struct yx bl;
struct yx br; };
+static void refit_pad (struct WinMeta *);
static struct yx place_window (struct WinMeta *, struct Win *);
static void update_windows (struct WinMeta *, struct Win *);
static void destroy_window (struct Win *);
win_meta->chain_end = win;
update_windows(win_meta, win); }
+static void refit_pad (struct WinMeta * win_meta) {
+// Fit pad width to minimum width demanded by current windows' geometries.
+ uint16_t lastwincol = 0;
+ struct Win * win_p = win_meta->chain_start;
+ while (win_p != 0) {
+ if (win_p->startx + win_p->width > lastwincol + 1)
+ lastwincol = win_p->startx + win_p->width - 1;
+ win_p = win_p->next; }
+ if (getmaxx(win_meta->pad) != lastwincol)
+ wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2); }
+
extern void suspend_window (struct WinMeta * win_meta, struct Win * win) {
// Destroy win, suspend from chain. Update geometry of following rows and pad, as well as activity selection.
destroy_window(win);
win_meta->active = win->prev; }
win->prev = 0;
win->next = 0;
- if (0 == pad_refitted) { // Refit pad if necessary.
- uint16_t lastwincol = 0;
- struct Win * win_p = win_meta->chain_start;
- while (win_p != 0) {
- if (getbegx(win_p->curses) + win_p->width > lastwincol + 1)
- lastwincol = getbegx(win_p->curses) + win_p->width - 1;
- win_p = win_p->next; }
- if (getmaxx(win_meta->pad) != lastwincol)
- wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2); } }
+ if (0 == pad_refitted) // Refit pad if necessary.
+ refit_pad(win_meta); }
static struct yx place_window (struct WinMeta * win_meta, struct Win * win) {
// Based on position and sizes of previous window, find fitting place for current window.
start.y = 1;
if (0 != win->prev) {
struct Win * win_top = win->prev;
- while (getbegy(win_top->curses) != 1)
+ while (win_top->starty != 1)
win_top = win_top->prev; // else, default to placing window in new top
- start.x = getbegx(win_top->curses) + win_top->width + 1; // column to the right of the last one
- uint16_t winprev_maxy = getbegy(win->prev->curses) + getmaxy(win->prev->curses);
+ start.x = win_top->startx + win_top->width + 1; // column to the right of the last one
+ uint16_t winprev_maxy = win->prev->starty + getmaxy(win->prev->curses);
if (win->width <= win->prev->width && win->height < win_meta->height - winprev_maxy) {
- start.x = getbegx(win->prev->curses); // place window below previous window if it fits
+ start.x = win->prev->startx; // place window below previous window if it fits
start.y = winprev_maxy + 1; } // vertically and is not wider than its predecessor
else {
struct Win * win_up = win->prev;
while (win_up != win_top) {
win_upup = win_up->prev;
while (1) {
- if (getbegy(win_up->curses) != getbegy(win_upup->curses))
+ if (win_up->starty != win_upup->starty)
break;
win_upup = win_upup->prev; }
- winprev_maxy = getbegy(win_upup->curses) + getmaxy(win_upup->curses);
- widthdiff = (getbegx(win_upup->curses) + win_upup->width) - (getbegx(win_up->curses) + win_up->width);
+ winprev_maxy = win_upup->starty + getmaxy(win_upup->curses);
+ widthdiff = (win_upup->startx + win_upup->width) - (win_up->startx + win_up->width);
if (win->height < win_meta->height - winprev_maxy && win->width < widthdiff) {
- start.x = getbegx(win_up->curses) + win_up->width + 1; // else try to open new sub column under last
+ start.x = win_up->startx + win_up->width + 1; // else try to open new sub column under last
start.y = winprev_maxy + 1; // window below which enough space remains
break; }
win_up = win_upup; } } }
if (0 != win->curses)
destroy_window (win);
struct yx startyx = place_window(win_meta, win);
- uint16_t lastwincol = 0;
- struct Win * win_p = win_meta->chain_start;
- while (win_p != 0) {
- if (win_p != win && getbegx(win_p->curses) + win_p->width > lastwincol + 1)
- lastwincol = getbegx(win_p->curses) + win_p->width - 1;
- else if (win_p == win && startyx.x + win->width > lastwincol + 1)
- lastwincol = startyx.x + win->width - 1;
- win_p = win_p->next; }
- if (getmaxx(win_meta->pad) != lastwincol)
- wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2);
+ win->startx = startyx.x;
+ win->starty = startyx.y;
+ refit_pad(win_meta);
win->curses = subpad(win_meta->pad, win->height, win->width, startyx.y, startyx.x);
if (0 != win->next)
update_windows (win_meta, win->next); }
static void draw_window_borders (struct Win * win, char active) {
// Draw borders of window win, including title. Decorate in a special way if window is marked as active.
uint16_t y, x;
- for (y = getbegy(win->curses); y <= getbegy(win->curses) + win->height; y++) {
- mvwaddch(wgetparent(win->curses), y, getbegx(win->curses) - 1, '|');
- mvwaddch(wgetparent(win->curses), y, getbegx(win->curses) + win->width, '|'); }
- for (x = getbegx(win->curses); x <= getbegx(win->curses) + win->width; x++) {
- mvwaddch(wgetparent(win->curses), getbegy(win->curses) - 1, x, '-');
- mvwaddch(wgetparent(win->curses), getbegy(win->curses) + win->height, x, '-'); }
+ for (y = win->starty; y <= win->starty + win->height; y++) {
+ mvwaddch(wgetparent(win->curses), y, win->startx - 1, '|');
+ mvwaddch(wgetparent(win->curses), y, win->startx + win->width, '|'); }
+ for (x = win->startx; x <= win->startx + win->width; x++) {
+ mvwaddch(wgetparent(win->curses), win->starty - 1, x, '-');
+ mvwaddch(wgetparent(win->curses), win->starty + win->height, x, '-'); }
char min_title_length_visible = 3; // 1 char minimal, plus 2 chars for decoration left/right of title
if (win->width >= min_title_length_visible) {
uint16_t title_offset = 0;
memcpy(title + 1, win->title, length_visible);
title[0] = title[length_visible + 1] = decoration;
title[length_visible + 2] = '\0';
- mvwaddstr (wgetparent(win->curses), getbegy(win->curses)-1, getbegx(win->curses)+title_offset, title); } }
+ mvwaddstr(wgetparent(win->curses), win->starty - 1, win->startx + title_offset, title); } }
static void draw_windows_borders (struct Win * win, struct Win * win_active, struct Corners * corners, uint16_t ccount) {
// Craw draw_window_borders() for all windows in chain from win on. Save current window's border corners.
if (win == win_active)
active = 1;
draw_window_borders(win, active);
- corners[ccount].tl.y = getbegy(win->curses) - 1;
- corners[ccount].tl.x = getbegx(win->curses) - 1;
- corners[ccount].tr.y = getbegy(win->curses) - 1;
- corners[ccount].tr.x = getbegx(win->curses) + win->width;
- corners[ccount].bl.y = getbegy(win->curses) + win->height;
- corners[ccount].bl.x = getbegx(win->curses) - 1;
- corners[ccount].br.y = getbegy(win->curses) + win->height;
- corners[ccount].br.x = getbegx(win->curses) + win->width;
+ corners[ccount].tl.y = win->starty - 1;
+ corners[ccount].tl.x = win->startx - 1;
+ corners[ccount].tr.y = win->starty - 1;
+ corners[ccount].tr.x = win->startx + win->width;
+ corners[ccount].bl.y = win->starty + win->height;
+ corners[ccount].bl.x = win->startx - 1;
+ corners[ccount].br.y = win->starty + win->height;
+ corners[ccount].br.x = win->startx + win->width;
if (0 != win->next) {
draw_windows_borders (win->next, win_active, corners, ccount + 1); } }
extern void shift_active_window (struct WinMeta * win_meta, char dir) {
// Move active window forward/backward in window chain. If jumping beyond start/end, move to other chain end.
if (0 != win_meta->active && win_meta->chain_start != win_meta->chain_end && (dir == 'f' || dir == 'b')) {
- struct Win * win_shift = win_meta->active;
+ struct Win * win_shift = win_meta->active, * win_p, * win_p_next;
char wrap = 0;
if ((dir == 'f' && win_shift == win_meta->chain_end)
|| (dir == 'b' && win_shift == win_meta->chain_start))
wrap = 1;
uint16_t i, i_max;
- struct Win * win_p, * win_p_next;
for (i_max = 1, win_p = win_meta->chain_start; win_p != win_meta->chain_end; i_max++)
win_p = win_p->next;
struct Win ** wins = malloc(i_max * sizeof(struct Win *));
projects / plomrogue / blobdiff