1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/*
* Calcurse - text-based organizer
*
* Copyright (c) 2004-2015 calcurse Development Team <misc@calcurse.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the
* following disclaimer in the documentation and/or other
* materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Send your feedback or comments to : misc@calcurse.org
* Calcurse home page : http://calcurse.org
*
*/
#include "calcurse.h"
/* Request user to enter a new todo item. */
void ui_todo_add(void)
{
int ch = 0;
const char *mesg = _("Enter the new TODO item:");
const char *mesg_id =
_("Enter the TODO priority [1 (highest) - 9 (lowest)]:");
char todo_input[BUFSIZ] = "";
status_mesg(mesg, "");
if (getstring(win[STA].p, todo_input, BUFSIZ, 0, 1) ==
GETSTRING_VALID) {
while ((ch < '1') || (ch > '9')) {
status_mesg(mesg_id, "");
ch = wgetch(win[KEY].p);
}
todo_add(todo_input, ch - '0', NULL);
ui_todo_load_items();
io_set_modified();
}
}
/* Delete an item from the TODO list. */
void ui_todo_delete(void)
{
const char *del_todo_str =
_("Do you really want to delete this task?");
const char *erase_warning =
_("This item has a note attached to it. "
"Delete (t)odo or just its (n)ote?");
const char *erase_choice = _("[tn]");
const int nb_erase_choice = 2;
int answer;
if (!LLIST_FIRST(&todolist) ||
(conf.confirm_delete
&& (status_ask_bool(del_todo_str) != 1))) {
wins_erase_status_bar();
return;
}
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
if (item->note)
answer = status_ask_choice(erase_warning, erase_choice,
nb_erase_choice);
else
answer = 1;
switch (answer) {
case 1:
todo_delete(item);
ui_todo_load_items();
io_set_modified();
break;
case 2:
todo_delete_note(item);
io_set_modified();
break;
default:
wins_erase_status_bar();
return;
}
}
/* Edit the description of an already existing todo item. */
void ui_todo_edit(void)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
const char *mesg = _("Enter the new TODO description:");
status_mesg(mesg, "");
updatestring(win[STA].p, &item->mesg, 0, 1);
io_set_modified();
}
/* Pipe a todo item to an external program. */
void ui_todo_pipe(void)
{
char cmd[BUFSIZ] = "";
char const *arg[] = { cmd, NULL };
int pout;
int pid;
FILE *fpout;
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
status_mesg(_("Pipe item to external command:"), "");
if (getstring(win[STA].p, cmd, BUFSIZ, 0, 1) != GETSTRING_VALID)
return;
wins_prepare_external();
if ((pid = shell_exec(NULL, &pout, *arg, arg))) {
fpout = fdopen(pout, "w");
todo_write(item, fpout);
fclose(fpout);
child_wait(NULL, &pout, pid);
press_any_key();
}
wins_unprepare_external();
}
/* Display todo items in the corresponding panel. */
void ui_todo_draw(int n, WINDOW *win, int y, int hilt, void *cb_data)
{
llist_item_t *i = *((llist_item_t **)cb_data);
struct todo *todo = LLIST_TS_GET_DATA(i);
int mark[2];
int width = lb_todo.sw.w;
char buf[width * UTF8_MAXLEN];
int j;
mark[0] = todo->id > 0 ? '0' + todo->id : 'X';
mark[1] = todo->note ? '>' : '.';
hilt = hilt && (wins_slctd() == TOD);
if (hilt)
custom_apply_attr(win, ATTR_HIGHEST);
if (utf8_strwidth(todo->mesg) < width) {
mvwprintw(win, y, 0, "%c%c %s", mark[0], mark[1], todo->mesg);
} else {
for (j = 0; todo->mesg[j] && width > 0; j++) {
if (!UTF8_ISCONT(todo->mesg[j]))
width -= utf8_width(&todo->mesg[j]);
buf[j] = todo->mesg[j];
}
if (j)
buf[j - 1] = 0;
else
buf[0] = 0;
mvwprintw(win, y, 0, "%c%c %s...", mark[0], mark[1], buf);
}
if (hilt)
custom_remove_attr(win, ATTR_HIGHEST);
*((llist_item_t **)cb_data) = i->next;
}
enum listbox_row_type ui_todo_row_type(int i, void *cb_data)
{
return LISTBOX_ROW_TEXT;
}
int ui_todo_height(int n, void *cb_data)
{
return 1;
}
void ui_todo_load_items(void)
{
int n = 0;
llist_item_t *i;
/* TODO: Optimize this by keeping the list size in a variable. */
LLIST_FOREACH(&todolist, i)
n++;
listbox_load_items(&lb_todo, n);
}
void ui_todo_sel_reset(void)
{
listbox_sel_move(&lb_todo, 0);
}
void ui_todo_sel_move(int delta)
{
listbox_sel_move(&lb_todo, delta);
}
/* Updates the TODO panel. */
void ui_todo_update_panel(int which_pan)
{
/*
* This is used and modified by display_todo_item() to avoid quadratic
* running time.
*/
llist_item_t *p = LLIST_FIRST(&todolist);
listbox_set_cb_data(&lb_todo, &p);
listbox_display(&lb_todo);
}
/* Change an item priority by pressing '+' or '-' inside TODO panel. */
void ui_todo_chg_priority(int diff)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
int id = item->id + diff;
struct todo *item_new;
if (id < 1)
id = 1;
else if (id > 9)
id = 9;
item_new = todo_add(item->mesg, id, item->note);
todo_delete(item);
io_set_modified();
listbox_set_sel(&lb_todo, todo_get_position(item_new));
}
void ui_todo_popup_item(void)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
item_in_popup(NULL, NULL, item->mesg, _("TODO:"));
}
void ui_todo_flag(void)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
todo_flag(item);
io_set_modified();
}
void ui_todo_view_note(void)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
todo_view_note(item, conf.pager);
}
void ui_todo_edit_note(void)
{
if (!LLIST_FIRST(&todolist))
return;
struct todo *item = todo_get_item(listbox_get_sel(&lb_todo));
todo_edit_note(item, conf.editor);
io_set_modified();
}
|