7 struct WinMeta init_win_meta (WINDOW * screen) {
8 // Create and populate WinMeta struct with sane default values.
9 struct WinMeta win_meta;
10 win_meta.screen = screen;
11 win_meta.height = getmaxy(screen);
12 win_meta.width = getmaxx(screen);
13 win_meta.chain_start = 0;
14 win_meta.chain_end = 0;
15 win_meta.pad_offset = 0;
16 win_meta.pad = newpad(win_meta.height, 1);
20 void scroll_pad (struct WinMeta * win_meta, char dir) {
21 // Scroll pad left or right (if possible).
22 if ('+' == dir && win_meta->pad_offset + win_meta->width < getmaxx(win_meta->pad) - 1)
23 win_meta->pad_offset++;
24 else if ('-' == dir && win_meta->pad_offset > 0)
25 win_meta->pad_offset--; }
27 struct Win init_window (struct WinMeta * win_meta, char * title, void * data, void * func) {
28 // Create and populate Win struct with sane default values.
35 win.height = win_meta->height - 1;
40 void append_window (struct WinMeta * win_meta, struct Win * win) {
41 // Append win to window chain. Set active, if first window. Update geometry of windows from new window on.
42 if (0 != win_meta->chain_start) {
43 win->prev = win_meta->chain_end;
44 win_meta->chain_end->next = win; }
46 win_meta->active = win;
47 win_meta->chain_start = win; }
48 win_meta->chain_end = win;
49 update_windows(win_meta, win); }
51 void suspend_window (struct WinMeta * win_meta, struct Win * win) {
52 // Destroy win, suspend from window chain. Update geometry of following rows, as well as activity selection.
54 if (win_meta->chain_start != win) // Give win's position in the chain to element next to it in the chain.
55 win->prev->next = win->next;
57 win_meta->chain_start = win->next;
58 if (win_meta->chain_end != win) { // Let chain element next to win know its new predecessor.
59 win->next->prev = win->prev;
60 if (win_meta->active == win) // If win was active, shift active window pointer to
61 win_meta->active = win->next; } // the next chain element, if that is a window ...
63 win_meta->chain_end = win->prev;
64 if (win_meta->active == win) // ... or else to the previous element.
65 win_meta->active = win->prev; }
67 update_windows(win_meta, win->prev);
68 else if (0 != win->next)
69 update_windows(win_meta, win->next);
73 struct yx place_window (struct WinMeta * win_meta, struct Win * win) {
74 // Based on position and sizes of previous window, find fitting place for current window.
76 start.x = 0; // if window is first in chain, place it on top-left corner
79 struct Win * win_top = win->prev;
80 while (getbegy(win_top->curses) != 1)
81 win_top = win_top->prev; // else, default to placing window in new top
82 start.x = getbegx(win_top->curses) + win_top->width + 1; // column to the right of the last one
83 uint16_t winprev_maxy = getbegy(win->prev->curses) + getmaxy(win->prev->curses);
84 if (win->width <= win->prev->width && win->height < win_meta->height - winprev_maxy) {
85 start.x = getbegx(win->prev->curses); // place window below previous window if it fits
86 start.y = winprev_maxy + 1; } // vertically and is not wider than its predecessor
88 struct Win * win_up = win->prev;
89 struct Win * win_upup = win_up;
91 while (win_up != win_top) {
92 win_upup = win_up->prev;
94 if (getbegy(win_up->curses) != getbegy(win_upup->curses))
96 win_upup = win_upup->prev; }
97 winprev_maxy = getbegy(win_upup->curses) + getmaxy(win_upup->curses);
98 widthdiff = (getbegx(win_upup->curses) + win_upup->width) - (getbegx(win_up->curses) + win_up->width);
99 if (win->height < win_meta->height - winprev_maxy && win->width < widthdiff) {
100 start.x = getbegx(win_up->curses) + win_up->width + 1; // else try to open new sub column under last
101 start.y = winprev_maxy + 1; // window below which enough space remains
103 win_up = win_upup; } } }
106 void update_windows (struct WinMeta * win_meta, struct Win * win) {
107 // Update geometry of win and its next of kin. Destroy (if visible), (re-)build window. If need, resize pad.
108 if (0 != win->curses)
109 destroy_window (win);
110 struct yx startyx = place_window(win_meta, win);
111 uint16_t lastwincol = 0;
112 struct Win * win_p = win_meta->chain_start;
114 if (win_p != win && getbegx(win_p->curses) + win_p->width > lastwincol + 1)
115 lastwincol = getbegx(win_p->curses) + win_p->width - 1;
116 else if (win_p == win && startyx.x + win->width > lastwincol + 1)
117 lastwincol = startyx.x + win->width - 1;
118 win_p = win_p->next; }
119 if (getmaxx(win_meta->pad) != lastwincol) {
120 wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2); }
121 win->curses = subpad(win_meta->pad, win->height, win->width, startyx.y, startyx.x);
123 update_windows (win_meta, win->next); }
125 void destroy_window (struct Win * win) {
130 void draw_window_borders (struct Win * win, char active) {
131 // Draw borders of window win, including title. Decorate in a special way if window is marked as active.
133 for (y = getbegy(win->curses); y <= getbegy(win->curses) + win->height; y++) {
134 mvwaddch(wgetparent(win->curses), y, getbegx(win->curses) - 1, '|');
135 mvwaddch(wgetparent(win->curses), y, getbegx(win->curses) + win->width, '|'); }
136 for (x = getbegx(win->curses); x <= getbegx(win->curses) + win->width; x++) {
137 mvwaddch(wgetparent(win->curses), getbegy(win->curses) - 1, x, '-');
138 mvwaddch(wgetparent(win->curses), getbegy(win->curses) + win->height, x, '-'); }
139 char min_title_length_visible = 3; // 1 char minimal, plus 2 chars for decoration left/right of title
140 if (win->width >= min_title_length_visible) {
141 uint16_t title_offset = 0;
142 if (win->width > strlen(win->title) + 2)
143 title_offset = (win->width - (strlen(win->title) + 2)) / 2; // + 2 is for decoration
144 uint16_t length_visible = strnlen(win->title, win->width - 2);
145 char title[length_visible + 3];
146 char decoration = ' ';
149 memcpy(title + 1, win->title, length_visible);
150 title[0] = title[length_visible + 1] = decoration;
151 title[length_visible + 2] = '\0';
152 mvwaddstr (wgetparent(win->curses), getbegy(win->curses)-1, getbegx(win->curses)+title_offset, title); } }
154 void draw_windows_borders (struct Win * win, struct Win * win_active, struct Corners * corners, uint16_t ccount) {
155 // Craw draw_window_borders() for all windows in chain from win on. Save current window's border corners.
157 if (win == win_active)
159 draw_window_borders(win, active);
160 corners[ccount].tl.y = getbegy(win->curses) - 1;
161 corners[ccount].tl.x = getbegx(win->curses) - 1;
162 corners[ccount].tr.y = getbegy(win->curses) - 1;
163 corners[ccount].tr.x = getbegx(win->curses) + win->width;
164 corners[ccount].bl.y = getbegy(win->curses) + win->height;
165 corners[ccount].bl.x = getbegx(win->curses) - 1;
166 corners[ccount].br.y = getbegy(win->curses) + win->height;
167 corners[ccount].br.x = getbegx(win->curses) + win->width;
168 if (0 != win->next) {
169 draw_windows_borders (win->next, win_active, corners, ccount + 1); } }
171 void draw_windows (struct Win * win) {
172 // Draw contents of all windows in window chain from win on.
174 if (0 != win->next) {
175 draw_windows (win->next); } }
177 void draw_vertical_scroll_hint (struct WinMeta * win_meta, uint16_t x, uint32_t more_cols, char dir) {
178 // Draw scroll hint line in win at col x of pad display, announce more_cols more columns in direction dir.
181 char phrase[] = "more columns";
182 char * scrolldesc = malloc((3 * sizeof(char)) + strlen(phrase) + 10); // 10 = max chars for uint32_t string
183 sprintf(scrolldesc, " %d %s ", more_cols, phrase);
185 if (win_meta->height > (strlen(scrolldesc) + 1))
186 offset = (win_meta->height - strlen(scrolldesc)) / 2;
187 for (y = 0; y < win_meta->height; y++)
188 if (y >= offset && y < strlen(scrolldesc) + offset)
189 mvwaddch(win_meta->pad, y, x, scrolldesc[y - offset] | A_REVERSE);
191 mvwaddch(win_meta->pad, y, x, dir | A_REVERSE);
194 void draw_all_windows (struct WinMeta * win_meta) {
195 // Draw pad with all windows and their borders, plus scrolling hints.
197 wnoutrefresh(win_meta->screen);
198 werase(win_meta->pad);
199 if (win_meta->chain_start) {
201 struct Win * win_p = win_meta->chain_start;
202 while (0 != win_p->next) {
205 struct Corners * all_corners = malloc(sizeof(struct Corners) * n_wins);
206 draw_windows (win_meta->chain_start);
207 draw_windows_borders (win_meta->chain_start, win_meta->active, all_corners, 0);
209 for (i = 0; i < n_wins; i++) {
210 mvwaddch(win_meta->pad, all_corners[i].tl.y, all_corners[i].tl.x, '+');
211 mvwaddch(win_meta->pad, all_corners[i].tr.y, all_corners[i].tr.x, '+');
212 mvwaddch(win_meta->pad, all_corners[i].bl.y, all_corners[i].bl.x, '+');
213 mvwaddch(win_meta->pad, all_corners[i].br.y, all_corners[i].br.x, '+'); }
216 if (win_meta->pad_offset > 0)
217 draw_vertical_scroll_hint(win_meta, win_meta->pad_offset, win_meta->pad_offset + 1, '<');
218 if (win_meta->pad_offset + win_meta->width < getmaxx(win_meta->pad) - 1)
219 for (y = 0; y < win_meta->height; y++)
220 draw_vertical_scroll_hint(win_meta, win_meta->pad_offset + win_meta->width - 1,
221 getmaxx(win_meta->pad) - (win_meta->pad_offset + win_meta->width), '>');
222 pnoutrefresh(win_meta->pad, 0, win_meta->pad_offset, 0, 0, win_meta->height, win_meta->width - 1); }
225 void resize_active_window (struct WinMeta * win_meta, uint16_t height, uint16_t width) {
226 // Grow or shrink currently active window. Correct its geometry and that of its followers.
227 if (0 != win_meta->active && width > 0 && height > 0 && height < win_meta->height) {
228 win_meta->active->height = height;
229 win_meta->active->width = width;
230 update_windows(win_meta, win_meta->chain_start); } }
232 void cycle_active_window (struct WinMeta * win_meta, char dir) {
233 // Cycle active window selection forwards (dir = 'n') or backwards.
234 if (0 != win_meta->active) {
236 if (win_meta->active->next != 0)
237 win_meta->active = win_meta->active->next;
239 win_meta->active = win_meta->chain_start; }
241 if (win_meta->active->prev != 0)
242 win_meta->active = win_meta->active->prev;
244 win_meta->active = win_meta->chain_end; } } }
246 void shift_active_window (struct WinMeta * win_meta, char dir) {
247 // Move active window forward/backward in window chain. If jumping beyond start/end, move to other chain end.
248 if (0 != win_meta->active && win_meta->chain_start != win_meta->chain_end && (dir == 'f' || dir == 'b')) {
249 struct Win * win_shift = win_meta->active;
251 if ((dir == 'f' && win_shift == win_meta->chain_end)
252 || (dir == 'b' && win_shift == win_meta->chain_start))
255 struct Win * win_p, * win_p_next;
256 for (i_max = 1, win_p = win_meta->chain_start; win_p != win_meta->chain_end; i_max++)
258 struct Win ** wins = malloc(i_max * sizeof(struct Win *));
259 for (i = 0, win_p = win_meta->chain_start; i < i_max; i++) {
260 win_p_next = win_p->next;
261 suspend_window(win_meta, win_p);
263 win_p = win_p_next; }
266 append_window(win_meta, win_shift);
267 for (i = 0; i < i_max - 1; i++)
268 append_window(win_meta, wins[i]); }
270 for (i = 1; i < i_max; i++)
271 append_window(win_meta, wins[i]);
272 append_window(win_meta, win_shift); }
274 for (i = 0; i < i_max; i++)
275 if ((dir == 'f' && win_shift == wins[i]) || (dir == 'b' && win_shift == wins[i+1])) {
276 append_window(win_meta, wins[i+1]);
277 append_window(win_meta, wins[i]);
280 append_window(win_meta, wins[i]);
282 win_meta->active = win_shift; } }