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 if (win->prev->height == win_meta->height - 1) // if prev window fills entire column,
66 start.x = getbegx(win->prev->curses_win) + win->prev->width + 1; // place win in new column next to it
68 struct Win * first_ceiling = win->prev; // first_ceiling determines column with;
69 while (getbegy(first_ceiling->curses_win) != 1) // default: place window in new column
70 first_ceiling = first_ceiling->prev; // next to it
71 start.x = getbegx(first_ceiling->curses_win) + first_ceiling->width + 1;
72 if (first_ceiling->width >= win->width) { // only place wins in prev column that fit into its width
73 struct Win * win_p = first_ceiling;
74 struct Win * lastrow_startwin = win_p;
75 while (win_p != win) {
76 if (getbegx(win_p->curses_win) == getbegx(first_ceiling->curses_win))
77 lastrow_startwin = win_p; // try to fit window at the end of the last row of windows
78 win_p = win_p ->next; } // inside column; if failure, try opening a new row below
79 int lastcol_start = getbegx(win->prev->curses_win) + win->prev->width + 1;
80 if (win->width <= getbegx(first_ceiling->curses_win) + first_ceiling->width - lastcol_start
81 && win->height <= lastrow_startwin->height) {
82 start.x = lastcol_start;
83 start.y = getbegy(lastrow_startwin->curses_win); }
84 else if (win->height < win_meta->height - (getbegy(lastrow_startwin->curses_win) + lastrow_startwin->height)
85 && win->width <= first_ceiling->width) {
86 start.x = getbegx(first_ceiling->curses_win);
87 start.y = getbegy(lastrow_startwin->curses_win) + lastrow_startwin->height + 1; } } } }
90 void update_windows (struct WinMeta * win_meta, struct Win * win) {
91 // Update geometry of win and its next of kin. Destroy (if visible), (re-)build window. If need, resize pad.
92 if (0 != win->curses_win)
94 struct yx startyx = place_window(win_meta, win);
96 struct Win * win_p = win_meta->chain_start;
98 if (win_p != win && getbegx(win_p->curses_win) + win_p->width > lastwincol + 1)
99 lastwincol = getbegx(win_p->curses_win) + win_p->width - 1;
100 else if (win_p == win && startyx.x + win->width > lastwincol + 1)
101 lastwincol = startyx.x + win->width - 1;
102 win_p = win_p->next; }
103 if (getmaxx(win_meta->pad) != lastwincol) {
104 wresize(win_meta->pad, getmaxy(win_meta->pad), lastwincol + 2); }
105 win->curses_win = subpad(win_meta->pad, win->height, win->width, startyx.y, startyx.x);
107 update_windows (win_meta, win->next); }
109 void destroy_window (struct Win * win) {
111 delwin(win->curses_win);
112 win->curses_win = 0; }
114 void draw_window_borders (struct Win * win, char active) {
115 // Draw borders of window win, including title. Decorate in a special way if window is marked as active.
117 for (y = getbegy(win->curses_win); y <= getbegy(win->curses_win) + win->height; y++) {
118 mvwaddch(wgetparent(win->curses_win), y, getbegx(win->curses_win) - 1, '|');
119 mvwaddch(wgetparent(win->curses_win), y, getbegx(win->curses_win) + win->width, '|'); }
120 for (x = getbegx(win->curses_win); x <= getbegx(win->curses_win) + win->width; x++) {
121 mvwaddch(wgetparent(win->curses_win), getbegy(win->curses_win) - 1, x, '-');
122 mvwaddch(wgetparent(win->curses_win), getbegy(win->curses_win) + win->height, x, '-'); }
123 char min_title_length_visible = 3; // 1 char minimal, plus 2 chars for decoration left/right of title
124 if (win->width >= min_title_length_visible) {
125 int title_offset = 0;
126 if (win->width > strlen(win->title) + 2)
127 title_offset = (win->width - (strlen(win->title) + 2)) / 2; // + 2 is for decoration
128 int length_visible = strnlen(win->title, win->width - 2);
129 char title[length_visible + 3];
130 char decoration = ' ';
133 memcpy(title + 1, win->title, length_visible);
134 title[0] = title[length_visible + 1] = decoration;
135 title[length_visible + 2] = '\0';
136 mvwaddstr(wgetparent(win->curses_win), getbegy(win->curses_win) - 1, getbegx(win->curses_win) + title_offset, title); } }
138 void draw_windows_borders (struct Win * win, struct Win * win_active, struct Corners * corners, int ccount) {
139 // Craw draw_window_borders() for all windows in chain from win on. Save current window's border corners.
141 if (win == win_active)
143 draw_window_borders(win, active);
144 corners[ccount].tl.y = getbegy(win->curses_win) - 1;
145 corners[ccount].tl.x = getbegx(win->curses_win) - 1;
146 corners[ccount].tr.y = getbegy(win->curses_win) - 1;
147 corners[ccount].tr.x = getbegx(win->curses_win) + win->width;
148 corners[ccount].bl.y = getbegy(win->curses_win) + win->height;
149 corners[ccount].bl.x = getbegx(win->curses_win) - 1;
150 corners[ccount].br.y = getbegy(win->curses_win) + win->height;
151 corners[ccount].br.x = getbegx(win->curses_win) + win->width;
152 if (0 != win->next) {
153 draw_windows_borders (win->next, win_active, corners, ccount + 1); } }
155 void draw_windows (struct Win * win) {
156 // Draw contents of all windows in window chain from win on.
158 if (0 != win->next) {
159 draw_windows (win->next); } }
161 void draw_all_windows (struct WinMeta * win_meta) {
162 // Draw all windows and their borders.
164 wnoutrefresh(win_meta->screen);
165 werase(win_meta->pad);
166 if (win_meta->chain_start) {
168 struct Win * win_p = win_meta->chain_start;
169 while (0 != win_p->next) {
172 struct Corners * all_corners = malloc(sizeof(struct Corners) * n_wins);
173 draw_windows (win_meta->chain_start);
174 draw_windows_borders (win_meta->chain_start, win_meta->active, all_corners, 0);
176 for (i = 0; i < n_wins; i++) {
177 mvwaddch(win_meta->pad, all_corners[i].tl.y, all_corners[i].tl.x, '+');
178 mvwaddch(win_meta->pad, all_corners[i].tr.y, all_corners[i].tr.x, '+');
179 mvwaddch(win_meta->pad, all_corners[i].bl.y, all_corners[i].bl.x, '+');
180 mvwaddch(win_meta->pad, all_corners[i].br.y, all_corners[i].br.x, '+'); }
181 pnoutrefresh(win_meta->pad, 0, win_meta->pad_offset, 0, 0, win_meta->height, win_meta->width - 1);
185 void resize_window (struct WinMeta * win_meta, char change) {
186 // Grow or shrink currently active window. Correct its geometry and that of its followers.
187 if (change == '-' && win_meta->active->height > 1)
188 win_meta->active->height--;
189 else if (change == '+' && win_meta->active->height < win_meta->height - 1)
190 win_meta->active->height++;
191 else if (change == '_' && win_meta->active->width > 1)
192 win_meta->active->width--;
193 else if (change == '*')
194 win_meta->active->width++;
195 update_windows(win_meta, win_meta->chain_start); }
197 void cycle_active_window (struct WinMeta * win_meta, char dir) {
198 // Cycle active window selection forwards (dir = 'n') or backwards.
200 if (win_meta->active->next != 0)
201 win_meta->active = win_meta->active->next;
203 win_meta->active = win_meta->chain_start; }
205 if (win_meta->active->prev != 0)
206 win_meta->active = win_meta->active->prev;
208 win_meta->active = win_meta->chain_end; } }
210 void shift_window (struct WinMeta * win_meta, char dir) {
211 // Move active window forward/backward in window chain. If jumping beyond start/end, move to other chain end.
212 if (win_meta->chain_start != win_meta->chain_end && (dir == 'f' || dir == 'b')) {
214 struct Win * win_shift = win_meta->active;
216 if ((dir == 'f' && win_shift == win_meta->chain_end)
217 || (dir == 'b' && win_shift == win_meta->chain_start))
219 struct Win * win_p, * win_p_next;
220 for (i_max = 1, win_p = win_meta->chain_start; win_p != win_meta->chain_end; i_max++, win_p = win_p->next);
221 struct Win ** wins = malloc(i_max * sizeof(struct Win *));
222 for (i = 0, win_p = win_meta->chain_start; i < i_max; i++) {
223 win_p_next = win_p->next;
224 suspend_window(win_meta, win_p);
226 win_p = win_p_next; }
229 append_window(win_meta, win_shift);
230 for (i = 0; i < i_max - 1; i++)
231 append_window(win_meta, wins[i]); }
233 for (i = 1; i < i_max; i++)
234 append_window(win_meta, wins[i]);
235 append_window(win_meta, win_shift); }
237 for (i = 0; i < i_max; i++)
238 if ((dir == 'f' && win_shift == wins[i]) || (dir == 'b' && win_shift == wins[i+1])) {
239 append_window(win_meta, wins[i+1]);
240 append_window(win_meta, wins[i]);
243 append_window(win_meta, wins[i]);
245 win_meta->active = win_shift; } }