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
|
/*
* Calcurse - text-based organizer
*
* Copyright (c) 2004-2016 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"
void listbox_init(struct listbox *lb, int y, int x, int h, int w,
const char *label, listbox_fn_item_type_t fn_type,
listbox_fn_item_height_t fn_height,
listbox_fn_draw_item_t fn_draw)
{
EXIT_IF(lb == NULL, "null pointer");
wins_scrollwin_init(&(lb->sw), y, x, h, w, label);
lb->item_count = lb->item_sel = 0;
lb->fn_type = fn_type;
lb->type = NULL;
lb->fn_height = fn_height;
lb->ch = NULL;
lb->fn_draw = fn_draw;
lb->cb_data = NULL;
}
void listbox_delete(struct listbox *lb)
{
EXIT_IF(lb == NULL, "null pointer");
wins_scrollwin_delete(&(lb->sw));
mem_free(lb->type);
mem_free(lb->ch);
}
static void listbox_fix_visible_region(struct listbox *lb)
{
unsigned last_line = lb->ch[lb->item_count] - 1;
int i;
wins_scrollwin_ensure_visible(&(lb->sw), lb->ch[lb->item_sel]);
wins_scrollwin_ensure_visible(&(lb->sw), lb->ch[lb->item_sel + 1] - 1);
i = lb->item_sel - 1;
while (i >= 0 && lb->type[i] != LISTBOX_ROW_TEXT) {
wins_scrollwin_ensure_visible(&(lb->sw), lb->ch[i]);
wins_scrollwin_ensure_visible(&(lb->sw), lb->ch[i + 1] - 1);
i++;
}
if (wins_scrollwin_is_visible(&(lb->sw), last_line))
wins_scrollwin_set_lower(&(lb->sw), last_line);
}
void listbox_resize(struct listbox *lb, int y, int x, int h, int w)
{
EXIT_IF(lb == NULL, "null pointer");
wins_scrollwin_resize(&(lb->sw), y, x, h, w);
if (lb->item_sel < 0)
return;
listbox_fix_visible_region(lb);
}
void listbox_set_cb_data(struct listbox *lb, void *cb_data)
{
lb->cb_data = cb_data;
}
static void listbox_fix_sel(struct listbox *, int);
void listbox_load_items(struct listbox *lb, int item_count)
{
int i, ch;
lb->item_count = item_count;
if (item_count == 0) {
lb->item_sel = -1;
return;
}
mem_free(lb->type);
mem_free(lb->ch);
lb->type = mem_malloc(item_count * sizeof(unsigned));
lb->ch = mem_malloc((item_count + 1) * sizeof(unsigned));
for (i = 0, ch = 0; i < item_count; i++) {
lb->type[i] = lb->fn_type(i, lb->cb_data);
lb->ch[i] = ch;
ch += lb->fn_height(i, lb->cb_data);
}
lb->ch[item_count] = ch;
wins_scrollwin_set_linecount(&(lb->sw), ch);
if (item_count > 0 && lb->item_sel < 0)
lb->item_sel = 0;
else if (lb->item_sel >= item_count)
lb->item_sel = item_count - 1;
listbox_fix_sel(lb, 1);
listbox_fix_visible_region(lb);
}
void listbox_draw_deco(struct listbox *lb, int hilt)
{
wins_scrollwin_draw_deco(&(lb->sw), hilt);
}
void listbox_display(struct listbox *lb)
{
int i;
werase(lb->sw.inner);
for (i = 0; i < lb->item_count; i++) {
int is_sel = (i == lb->item_sel);
lb->fn_draw(i, lb->sw.inner, lb->ch[i], is_sel, lb->cb_data);
}
wins_scrollwin_display(&(lb->sw));
}
int listbox_get_sel(struct listbox *lb)
{
return lb->item_sel;
}
static void listbox_fix_sel(struct listbox *lb, int direction)
{
int did_flip = 0;
if (lb->item_count == 0 || direction == 0)
return;
direction = direction > 0 ? 1 : -1;
while (lb->type[lb->item_sel] != LISTBOX_ROW_TEXT) {
if ((direction == -1 && lb->item_sel == 0) ||
(direction == 1 && lb->item_sel == lb->item_count - 1)) {
if (did_flip) {
lb->item_sel = -1;
return;
}
direction = -direction;
did_flip = 1;
} else {
lb->item_sel += direction;
}
}
}
void listbox_set_sel(struct listbox *lb, unsigned pos)
{
lb->item_sel = pos;
listbox_fix_sel(lb, 1);
if (lb->item_sel < 0)
return;
listbox_fix_visible_region(lb);
}
void listbox_sel_move(struct listbox *lb, int delta)
{
if (lb->item_count == 0)
return;
lb->item_sel += delta;
if (lb->item_sel < 0)
lb->item_sel = 0;
else if (lb->item_sel >= lb->item_count)
lb->item_sel = lb->item_count - 1;
listbox_fix_sel(lb, delta);
if (lb->item_sel < 0)
return;
listbox_fix_visible_region(lb);
}
|
