6 struct WinMeta init_win_meta (WINDOW * screen) {
7 // Create and populate WinMeta struct with sane default values.
8 struct WinMeta win_meta;
9 win_meta.screen = screen;
10 win_meta.height = getmaxy(screen);
11 win_meta.width = getmaxx(screen);
12 win_meta.chain_start = 0;
13 win_meta.chain_end = 0;
14 win_meta.pad_offset = 0;
15 win_meta.pad = newpad(win_meta.height, 1);
18 struct Win init_window (struct WinMeta * win_meta, char * title) {
19 // Create and populate Win struct with sane default values.
26 win.height = win_meta->height - 1;
29 void append_window (struct WinMeta * win_meta, struct Win * win) {
30 // Append win to window chain. Set active, if first window. Update geometry of windows from new window on.
31 if (0 != win_meta->chain_start) {
32 win->prev = win_meta->chain_end;
33 win_meta->chain_end->next = win; }
35 win_meta->active = win;
36 win_meta->chain_start = win; }
37 win_meta->chain_end = win;
38 update_windows(win_meta, win); }
40 void suspend_window (struct WinMeta * win_meta, struct Win * win) {
41 // Destroy win, suspend from window chain. Update geometry of following rows, as well as activity selection.
43 if (win_meta->chain_start != win) // Give win's position in the chain to element next to it in the chain.
44 win->prev->next = win->next;
46 win_meta->chain_start = win->next;
47 if (win_meta->chain_end != win) { // Let chain element next to win know its new predecessor.
48 win->next->prev = win->prev;
49 if (win_meta->active == win) // If win was active, shift active window pointer to ...
50 win_meta->active = win->next; // ... the next chain element, if that is a window ...
51 update_windows(win_meta, win->next); }
53 win_meta->chain_end = win->prev;
54 if (win_meta->active == win) // ... or else to the previous element.
55 win_meta->active = win->prev; }
59 struct yx place_window (struct WinMeta * win_meta, struct Win * win) {
60 // Based on position and sizes of previous window, find fitting place for current window.
62 start.x = 0; // if window is first in chain, place it on top-left corner
65 struct Win * win_top = win->prev;
66 while (getbegy(win_top->curses_win) != 1)
67 win_top = win_top->prev; // else, default to placing window in new top
68 start.x = getbegx(win_top->curses_win) + win_top->width + 1; // column to the right of the last one
69 int winprev_maxy = getbegy(win->prev->curses_win) + getmaxy(win->prev->curses_win);
70 if (win->width <= win->prev->width && win->height < win_meta->height - winprev_maxy) {
71 start.x = getbegx(win->prev->curses_win); // place window below previous window if it fits
72 start.y = winprev_maxy + 1; } // vertically and is not wider than its predecessor
74 struct Win * win_up = win->prev;
75 struct Win * win_upup = win_up;
77 while (win_up != win_top) {
78 win_upup = win_up->prev;
80 if (getbegy(win_up->curses_win) != getbegy(win_upup->curses_win))
82 win_upup = win_upup->prev; }
83 winprev_maxy = getbegy(win_upup->curses_win) + getmaxy(win_upup->curses_win);
84 widthdiff = (getbegx(win_upup->curses_win) + win_upup->width) - (getbegx(win_up->curses_win) + win_up->width);
85 if (win->height < win_meta->height - winprev_maxy && win->width < widthdiff) {
86 start.x = getbegx(win_up->curses_win) + win_up->width + 1; // else try to open new sub column under
87 start.y = winprev_maxy + 1; // last window below which enough space
88 break; } // for current window remains
89 win_up = win_upup; } } }
92 void update_windows (struct WinMeta * win_meta, struct Win * win) {
93 // Update geometry of win and its next of kin. Destroy (if visible), (re-)build window. If need, resize pad.
94 if (0 != win->curses_win)
96 struct yx startyx = place_window(win_meta, win);
98 struct Win * win_p = win_meta->chain_start;
100 if (win_p != win && getbegx(win_p->curses_win) + win_p->width > lastwincol + 1)
101 lastwincol = getbegx(win_p->curses_win) + win_p->width - 1;
102 else if (win_p == win && startyx.x + win->width > lastwincol + 1)
103 lastwincol = startyx.x + win->width - 1;
104 win_p = win_p->next; }
105 if (getmaxx(win_meta->pad) != lastwincol) {
106 wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2); }
107 win->curses_win = subpad(win_meta->pad, win->height, win->width, startyx.y, startyx.x);
109 update_windows (win_meta, win->next); }
111 void destroy_window (struct Win * win) {
113 delwin(win->curses_win);
114 win->curses_win = 0; }
116 void draw_window_borders (struct Win * win, char active) {
117 // Draw borders of window win, including title. Decorate in a special way if window is marked as active.
119 for (y = getbegy(win->curses_win); y <= getbegy(win->curses_win) + win->height; y++) {
120 mvwaddch(wgetparent(win->curses_win), y, getbegx(win->curses_win) - 1, '|');
121 mvwaddch(wgetparent(win->curses_win), y, getbegx(win->curses_win) + win->width, '|'); }
122 for (x = getbegx(win->curses_win); x <= getbegx(win->curses_win) + win->width; x++) {
123 mvwaddch(wgetparent(win->curses_win), getbegy(win->curses_win) - 1, x, '-');
124 mvwaddch(wgetparent(win->curses_win), getbegy(win->curses_win) + win->height, x, '-'); }
125 char min_title_length_visible = 3; // 1 char minimal, plus 2 chars for decoration left/right of title
126 if (win->width >= min_title_length_visible) {
127 int title_offset = 0;
128 if (win->width > strlen(win->title) + 2)
129 title_offset = (win->width - (strlen(win->title) + 2)) / 2; // + 2 is for decoration
130 int length_visible = strnlen(win->title, win->width - 2);
131 char title[length_visible + 3];
132 char decoration = ' ';
135 memcpy(title + 1, win->title, length_visible);
136 title[0] = title[length_visible + 1] = decoration;
137 title[length_visible + 2] = '\0';
138 mvwaddstr(wgetparent(win->curses_win), getbegy(win->curses_win) - 1, getbegx(win->curses_win) + title_offset, title); } }
140 void draw_windows_borders (struct Win * win, struct Win * win_active, struct Corners * corners, int ccount) {
141 // Craw draw_window_borders() for all windows in chain from win on. Save current window's border corners.
143 if (win == win_active)
145 draw_window_borders(win, active);
146 corners[ccount].tl.y = getbegy(win->curses_win) - 1;
147 corners[ccount].tl.x = getbegx(win->curses_win) - 1;
148 corners[ccount].tr.y = getbegy(win->curses_win) - 1;
149 corners[ccount].tr.x = getbegx(win->curses_win) + win->width;
150 corners[ccount].bl.y = getbegy(win->curses_win) + win->height;
151 corners[ccount].bl.x = getbegx(win->curses_win) - 1;
152 corners[ccount].br.y = getbegy(win->curses_win) + win->height;
153 corners[ccount].br.x = getbegx(win->curses_win) + win->width;
154 if (0 != win->next) {
155 draw_windows_borders (win->next, win_active, corners, ccount + 1); } }
157 void draw_windows (struct Win * win) {
158 // Draw contents of all windows in window chain from win on.
160 if (0 != win->next) {
161 draw_windows (win->next); } }
163 void draw_all_windows (struct WinMeta * win_meta) {
164 // Draw all windows and their borders.
166 wnoutrefresh(win_meta->screen);
167 werase(win_meta->pad);
168 if (win_meta->chain_start) {
170 struct Win * win_p = win_meta->chain_start;
171 while (0 != win_p->next) {
174 struct Corners * all_corners = malloc(sizeof(struct Corners) * n_wins);
175 draw_windows (win_meta->chain_start);
176 draw_windows_borders (win_meta->chain_start, win_meta->active, all_corners, 0);
178 for (i = 0; i < n_wins; i++) {
179 mvwaddch(win_meta->pad, all_corners[i].tl.y, all_corners[i].tl.x, '+');
180 mvwaddch(win_meta->pad, all_corners[i].tr.y, all_corners[i].tr.x, '+');
181 mvwaddch(win_meta->pad, all_corners[i].bl.y, all_corners[i].bl.x, '+');
182 mvwaddch(win_meta->pad, all_corners[i].br.y, all_corners[i].br.x, '+'); }
183 pnoutrefresh(win_meta->pad, 0, win_meta->pad_offset, 0, 0, win_meta->height, win_meta->width - 1);
187 void resize_window (struct WinMeta * win_meta, char change) {
188 // Grow or shrink currently active window. Correct its geometry and that of its followers.
189 if (change == '-' && win_meta->active->height > 1)
190 win_meta->active->height--;
191 else if (change == '+' && win_meta->active->height < win_meta->height - 1)
192 win_meta->active->height++;
193 else if (change == '_' && win_meta->active->width > 1)
194 win_meta->active->width--;
195 else if (change == '*')
196 win_meta->active->width++;
197 update_windows(win_meta, win_meta->chain_start); }
199 void cycle_active_window (struct WinMeta * win_meta, char dir) {
200 // Cycle active window selection forwards (dir = 'n') or backwards.
202 if (win_meta->active->next != 0)
203 win_meta->active = win_meta->active->next;
205 win_meta->active = win_meta->chain_start; }
207 if (win_meta->active->prev != 0)
208 win_meta->active = win_meta->active->prev;
210 win_meta->active = win_meta->chain_end; } }
212 void shift_window (struct WinMeta * win_meta, char dir) {
213 // Move active window forward/backward in window chain. If jumping beyond start/end, move to other chain end.
214 if (win_meta->chain_start != win_meta->chain_end && (dir == 'f' || dir == 'b')) {
216 struct Win * win_shift = win_meta->active;
218 if ((dir == 'f' && win_shift == win_meta->chain_end)
219 || (dir == 'b' && win_shift == win_meta->chain_start))
221 struct Win * win_p, * win_p_next;
222 for (i_max = 1, win_p = win_meta->chain_start; win_p != win_meta->chain_end; i_max++, win_p = win_p->next);
223 struct Win ** wins = malloc(i_max * sizeof(struct Win *));
224 for (i = 0, win_p = win_meta->chain_start; i < i_max; i++) {
225 win_p_next = win_p->next;
226 suspend_window(win_meta, win_p);
228 win_p = win_p_next; }
231 append_window(win_meta, win_shift);
232 for (i = 0; i < i_max - 1; i++)
233 append_window(win_meta, wins[i]); }
235 for (i = 1; i < i_max; i++)
236 append_window(win_meta, wins[i]);
237 append_window(win_meta, win_shift); }
239 for (i = 0; i < i_max; i++)
240 if ((dir == 'f' && win_shift == wins[i]) || (dir == 'b' && win_shift == wins[i+1])) {
241 append_window(win_meta, wins[i+1]);
242 append_window(win_meta, wins[i]);
245 append_window(win_meta, wins[i]);
247 win_meta->active = win_shift; } }