2 * Copyright (C) 2012 Andy Spencer <andy753421@gmail.com>
4 * This program is free software: you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation, either version 3 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 #define _XOPEN_SOURCE_EXTENDED
34 /* Box packing helpers */
35 static void clear_old(event_t **list, int n, event_t *cur)
37 for (int i = 0; i < n; i++)
38 if (list[i] && compare(&list[i]->end, &cur->start) <= 0)
42 static int next_free(event_t **list, int n)
44 for (int i = 0; i < n; i++)
50 static int count_busy(event_t **list, int n)
53 for (int i = 0; i < n; i++)
59 static int get_ncols(event_t *event, int n)
63 memset(preview, 0, sizeof(preview));
64 for (event_t *cur = event; cur; cur = cur->next) {
65 int col = next_free(preview, n);
67 ncols = MAX(ncols, col+1);
69 clear_old(preview, n, cur->next);
70 if (count_busy(preview, n) == 0)
76 static int get_col(event_t **list, int n, event_t *event, int *ncols)
78 clear_old(list, n, event);
80 /* If there are current events, then recalculate
81 * ncols for the next series of events */
82 if (count_busy(list, n) == 0)
83 *ncols = get_ncols(event, n);
85 /* Find next open slot */
86 int col = next_free(list, n);
92 void day_init(WINDOW *_win)
94 win = _win; // lines cols y x
95 times = derwin(win, LINES-2, 5, 0, 0);
96 body = derwin(win, LINES-2, COLS-5, 0, 5);
101 void day_size(int rows, int cols)
104 wmvresize(times, hdr, 0, rows-hdr, 5);
105 wmvresize(body, hdr, 5, rows-hdr, cols-5);
111 const char *mstr = month_to_string(MONTH);
112 const char *dstr = day_to_string(day_of_week(YEAR, MONTH, DAY));
118 if (COMPACT) wattron(win, A_REVERSE | A_BOLD);
119 mvwhline(win, 0, 0, ' ', COLS);
120 mvwprintw(win, 0, 0, "%s, %s %d", dstr, mstr, DAY+1);
121 mvwprintw(win, 0, COLS-10, "%d-%02d-%02d", YEAR, MONTH, DAY+1);
122 if (COMPACT) wattroff(win, A_REVERSE | A_BOLD);
124 /* Print all day events */
127 while (event && before(&event->start, YEAR, MONTH, DAY, 24, 0)) {
128 if (!before(&event->end, YEAR, MONTH, DAY, 0, 1) &&
129 get_mins(&event->start, &event->end) > 23*60)
130 event_line(win, event, y+allday++, 6, COLS, 1);
133 if (allday && !COMPACT)
137 wshrink(times, y+allday);
138 wshrink(body, y+allday);
141 mvwprintw(times, 0, 0, "%02d:%02d", ((line/4)-1)%12+1, (line*15)%60);
142 for (int h = 0; h < 24; h++)
143 mvwprintw(times, h*4-line, 0, "%02d:%02d", (h-1)%12+1, 0);
147 event_t *active[10] = {};
149 for (int h = 0; h < 24; h++)
150 for (int m = 0; m < 60; m+=15)
151 while (event && before(&event->start,
152 YEAR, MONTH, DAY, h+(m+15)/60, (m+15)%60)) {
153 if (!before(&event->start, YEAR, MONTH, DAY, h, m) &&
154 get_mins(&event->start, &event->end) <= 23*60) {
155 int col = get_col(active, N_ELEMENTS(active), event, &ncols);
156 int left = ROUND((col+0.0)*(COLS-6)/ncols) + 1;
157 int right = ROUND((col+1.0)*(COLS-6)/ncols) + 1;
158 int row = h*4 + m/15 - line;
159 int height = (get_mins(&event->start, &event->end)-1)/15+1;
160 event_box(body, event, row, left, height, right-left);
167 mvwhline(win, 1, 0, ACS_HLINE, COLS);
168 if (!COMPACT && allday)
169 mvwhline(win, allday+1, 0, ACS_HLINE, COLS);
170 mvwvline(body, 0, 0, ACS_VLINE, LINES-4+COMPACT+COMPACT);
174 int day_run(int key, mmask_t btn, int row, int col)
176 int days = 0, ref = 0;
179 case 'h': ref = 1; days = -1; break;
180 case 'l': ref = 1; days = 1; break;
181 case 'i': ref = 1; days = -7; break;
182 case 'o': ref = 1; days = 7; break;
183 case 'k': ref = 1; line--; break;
184 case 'j': ref = 1; line++; break;
186 line = CLAMP(line, 0, 24*4);
188 add_days(&YEAR, &MONTH, &DAY, days);