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
35 /* Box packing helpers */
36 static void clear_old(event_t **list, int n, event_t *cur)
38 for (int i = 0; i < n; i++)
39 if (list[i] && compare(&list[i]->end, &cur->start) < 0)
43 static int next_free(event_t **list, int n)
45 for (int i = 0; i < n; i++)
51 static int count_busy(event_t **list, int n)
54 for (int i = 0; i < n; i++)
60 static int get_ncols(event_t *event, int n)
64 memset(preview, 0, sizeof(preview));
65 for (event_t *cur = event; cur; cur = cur->next) {
66 int col = next_free(preview, n);
68 ncols = MAX(ncols, col+1);
70 clear_old(preview, n, cur->next);
71 if (count_busy(preview, n) == 0)
77 static int get_col(event_t **list, int n, event_t *event, int *ncols)
79 clear_old(list, n, event);
81 /* If there are current events, then recalculate
82 * ncols for the next series of events */
83 if (count_busy(list, n) == 0)
84 *ncols = get_ncols(event, n);
86 /* Find next open slot */
87 int col = next_free(list, n);
93 void day_init(WINDOW *_win)
95 win = _win; // lines cols y x
96 head = derwin(win, 1, COLS, 0, 0);
97 times = derwin(win, LINES-2-2, 5, 2, 0);
98 body = derwin(win, LINES-2-2, COLS-6, 2, 6);
103 void day_size(int rows, int cols)
105 wresize(head, 1, cols );
106 wresize(times, rows-2, 5);
107 wresize(body, rows-2, cols-6);
113 const char *mstr = month_to_string(MONTH);
114 const char *dstr = day_to_string(day_of_week(YEAR, MONTH, DAY));
117 mvwprintw(head, 0, 0, "%s, %s %d", dstr, mstr, DAY+1);
118 mvwprintw(head, 0, COLS-10, "%d-%02d-%02d", YEAR, MONTH, DAY+1);
121 mvwprintw(times, 0, 0, "%02d:%02d", ((line/4)-1)%12+1, (line*15)%60);
122 for (int h = 0; h < 24; h++)
123 mvwprintw(times, h*4-line, 0, "%02d:%02d", (h-1)%12+1, 0);
126 event_t *event = EVENTS;
127 event_t *active[10] = {};
129 for (int h = 0; h < 24; h++)
130 for (int m = 0; m < 60; m+=15)
131 while (event && before(&event->start,
132 YEAR, MONTH, DAY, h+(m+15)/60, (m+15)%60)) {
133 if (!before(&event->start, YEAR, MONTH, DAY, h, m)) {
134 int col = get_col(active, N_ELEMENTS(active), event, &ncols);
135 int left = ROUND((col+0.0)*(COLS-6)/ncols);
136 int right = ROUND((col+1.0)*(COLS-6)/ncols);
137 int row = h*4 + m/15 - line;
138 int height = (get_mins(&event->start, &event->end)-1)/15+1;
139 event_box(body, event, row, left, height, right-left);
145 mvwhline(win, 1, 0, ACS_HLINE, COLS);
146 mvwvline(win, 2, 5, ACS_VLINE, LINES-4);
150 int day_run(int key, mmask_t btn, int row, int col)
152 int days = 0, ref = 0;
155 case 'h': ref = 1; days = -1; break;
156 case 'l': ref = 1; days = 1; break;
157 case 'i': ref = 1; days = -7; break;
158 case 'o': ref = 1; days = 7; break;
159 case 'k': ref = 1; line--; break;
160 case 'j': ref = 1; line++; break;
162 line = CLAMP(line, 0, 24*4);
164 add_days(&YEAR, &MONTH, &DAY, days);