Mercurial > pidgin.yaz
annotate finch/libgnt/gnttree.c @ 15970:790d1d003825
Allow making some columns invisible.
author | Sadrul Habib Chowdhury <imadil@gmail.com> |
---|---|
date | Fri, 30 Mar 2007 05:32:40 +0000 |
parents | 0ab73bf1fef1 |
children | 05d347516fcd |
rev | line source |
---|---|
15818 | 1 #include "gntmarshal.h" |
2 #include "gntstyle.h" | |
3 #include "gnttree.h" | |
4 #include "gntutils.h" | |
5 | |
6 #include <string.h> | |
7 #include <ctype.h> | |
8 | |
9 #define SEARCH_TIMEOUT 4000 /* 4 secs */ | |
10 | |
11 enum | |
12 { | |
13 SIG_SELECTION_CHANGED, | |
14 SIG_SCROLLED, | |
15 SIG_TOGGLED, | |
16 SIGS, | |
17 }; | |
18 | |
19 #define TAB_SIZE 3 | |
20 | |
21 /* XXX: Make this one into a GObject? | |
22 * ... Probably not */ | |
15931
f00f2e283ffb
Some define changes. This helps in generating the python bindings.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15818
diff
changeset
|
23 struct _GntTreeRow |
15818 | 24 { |
25 void *key; | |
26 void *data; /* XXX: unused */ | |
27 | |
28 gboolean collapsed; | |
29 gboolean choice; /* Is this a choice-box? | |
30 If choice is true, then child will be NULL */ | |
31 gboolean isselected; | |
32 GntTextFormatFlags flags; | |
33 | |
34 GntTreeRow *parent; | |
35 GntTreeRow *child; | |
36 GntTreeRow *next; | |
37 GntTreeRow *prev; | |
38 | |
39 GList *columns; | |
40 GntTree *tree; | |
41 }; | |
42 | |
15931
f00f2e283ffb
Some define changes. This helps in generating the python bindings.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15818
diff
changeset
|
43 struct _GntTreeCol |
15818 | 44 { |
45 char *text; | |
46 int span; /* How many columns does it span? */ | |
47 }; | |
48 | |
49 static GntWidgetClass *parent_class = NULL; | |
50 static guint signals[SIGS] = { 0 }; | |
51 | |
52 /* Move the item at position old to position new */ | |
53 static GList * | |
54 g_list_reposition_child(GList *list, int old, int new) | |
55 { | |
56 gpointer item = g_list_nth_data(list, old); | |
57 list = g_list_remove(list, item); | |
58 if (old < new) | |
59 new--; /* because the positions would have shifted after removing the item */ | |
60 list = g_list_insert(list, item, new); | |
61 return list; | |
62 } | |
63 | |
64 static GntTreeRow * | |
65 _get_next(GntTreeRow *row, gboolean godeep) | |
66 { | |
67 if (row == NULL) | |
68 return NULL; | |
69 if (godeep && row->child) | |
70 return row->child; | |
71 if (row->next) | |
72 return row->next; | |
73 return _get_next(row->parent, FALSE); | |
74 } | |
75 | |
76 static gboolean | |
77 row_matches_search(GntTreeRow *row) | |
78 { | |
79 GntTree *t = row->tree; | |
80 if (t->search && t->search->len > 0) { | |
81 char *one = g_utf8_casefold(((GntTreeCol*)row->columns->data)->text, -1); | |
82 char *two = g_utf8_casefold(t->search->str, -1); | |
83 char *z = strstr(one, two); | |
84 g_free(one); | |
85 g_free(two); | |
86 if (z == NULL) | |
87 return FALSE; | |
88 } | |
89 return TRUE; | |
90 } | |
91 | |
92 static GntTreeRow * | |
93 get_next(GntTreeRow *row) | |
94 { | |
95 if (row == NULL) | |
96 return NULL; | |
97 while ((row = _get_next(row, !row->collapsed)) != NULL) { | |
98 if (row_matches_search(row)) | |
99 break; | |
100 } | |
101 return row; | |
102 } | |
103 | |
104 /* Returns the n-th next row. If it doesn't exist, returns NULL */ | |
105 static GntTreeRow * | |
106 get_next_n(GntTreeRow *row, int n) | |
107 { | |
108 while (row && n--) | |
109 row = get_next(row); | |
110 return row; | |
111 } | |
112 | |
113 /* Returns the n-th next row. If it doesn't exist, then the last non-NULL node */ | |
114 static GntTreeRow * | |
115 get_next_n_opt(GntTreeRow *row, int n, int *pos) | |
116 { | |
117 GntTreeRow *next = row; | |
118 int r = 0; | |
119 | |
120 if (row == NULL) | |
121 return NULL; | |
122 | |
123 while (row && n--) | |
124 { | |
125 row = get_next(row); | |
126 if (row) | |
127 { | |
128 next = row; | |
129 r++; | |
130 } | |
131 } | |
132 | |
133 if (pos) | |
134 *pos = r; | |
135 | |
136 return next; | |
137 } | |
138 | |
139 static GntTreeRow * | |
140 get_last_child(GntTreeRow *row) | |
141 { | |
142 if (row == NULL) | |
143 return NULL; | |
144 if (!row->collapsed && row->child) | |
145 row = row->child; | |
146 else | |
147 return row; | |
148 | |
149 while(row->next) | |
150 row = row->next; | |
151 if (!row->collapsed && row->child) | |
152 row = get_last_child(row->child); | |
153 return row; | |
154 } | |
155 | |
156 static GntTreeRow * | |
157 get_prev(GntTreeRow *row) | |
158 { | |
159 if (row == NULL) | |
160 return NULL; | |
161 while (row) { | |
162 if (row->prev) | |
163 row = get_last_child(row->prev); | |
164 else | |
165 row = row->parent; | |
166 if (!row || row_matches_search(row)) | |
167 break; | |
168 } | |
169 return row; | |
170 } | |
171 | |
172 static GntTreeRow * | |
173 get_prev_n(GntTreeRow *row, int n) | |
174 { | |
175 while (row && n--) | |
176 row = get_prev(row); | |
177 return row; | |
178 } | |
179 | |
180 /* Distance of row from the root */ | |
181 /* XXX: This is uber-inefficient */ | |
182 static int | |
183 get_root_distance(GntTreeRow *row) | |
184 { | |
185 if (row == NULL) | |
186 return -1; | |
187 return get_root_distance(get_prev(row)) + 1; | |
188 } | |
189 | |
190 /* Returns the distance between a and b. | |
191 * If a is 'above' b, then the distance is positive */ | |
192 static int | |
193 get_distance(GntTreeRow *a, GntTreeRow *b) | |
194 { | |
195 /* First get the distance from a to the root. | |
196 * Then the distance from b to the root. | |
197 * Subtract. | |
198 * It's not that good, but it works. */ | |
199 int ha = get_root_distance(a); | |
200 int hb = get_root_distance(b); | |
201 | |
202 return (hb - ha); | |
203 } | |
204 | |
205 static int | |
206 find_depth(GntTreeRow *row) | |
207 { | |
208 int dep = -1; | |
209 | |
210 while (row) | |
211 { | |
212 dep++; | |
213 row = row->parent; | |
214 } | |
215 | |
216 return dep; | |
217 } | |
218 | |
219 static char * | |
220 update_row_text(GntTree *tree, GntTreeRow *row) | |
221 { | |
222 GString *string = g_string_new(NULL); | |
223 GList *iter; | |
224 int i; | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
225 gboolean notfirst = FALSE; |
15818 | 226 |
227 for (i = 0, iter = row->columns; i < tree->ncol && iter; i++, iter = iter->next) | |
228 { | |
229 GntTreeCol *col = iter->data; | |
230 const char *text; | |
231 int len = gnt_util_onscreen_width(col->text, NULL); | |
232 int fl = 0; | |
233 gboolean cut = FALSE; | |
234 | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
235 if (tree->columns[i].invisible) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
236 continue; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
237 |
15818 | 238 if (i == 0) |
239 { | |
240 if (row->choice) | |
241 { | |
242 g_string_append_printf(string, "[%c] ", | |
243 row->isselected ? 'X' : ' '); | |
244 fl = 4; | |
245 } | |
246 else if (row->parent == NULL && row->child) | |
247 { | |
248 if (row->collapsed) | |
249 { | |
250 string = g_string_append(string, "+ "); | |
251 } | |
252 else | |
253 { | |
254 string = g_string_append(string, "- "); | |
255 } | |
256 fl = 2; | |
257 } | |
258 else | |
259 { | |
260 fl = TAB_SIZE * find_depth(row); | |
261 g_string_append_printf(string, "%*s", fl, ""); | |
262 } | |
263 len += fl; | |
264 } | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
265 else if (notfirst) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
266 g_string_append_c(string, '|'); |
15818 | 267 else |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
268 g_string_append_c(string, ' '); |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
269 |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
270 notfirst = TRUE; |
15818 | 271 |
272 if (len > tree->columns[i].width) { | |
273 len = tree->columns[i].width - 1; | |
274 cut = TRUE; | |
275 } | |
276 text = gnt_util_onscreen_width_to_pointer(col->text, len - fl, NULL); | |
277 string = g_string_append_len(string, col->text, text - col->text); | |
278 if (cut) { /* ellipsis */ | |
279 if (gnt_ascii_only()) | |
280 g_string_append_c(string, '~'); | |
281 else | |
282 string = g_string_append(string, "\342\200\246"); | |
283 len++; | |
284 } | |
285 | |
286 if (len < tree->columns[i].width && iter->next) | |
287 g_string_append_printf(string, "%*s", tree->columns[i].width - len, ""); | |
288 } | |
289 return g_string_free(string, FALSE); | |
290 } | |
291 | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
292 #define NEXT_X x += tree->columns[i].width + (i > 0 ? 1 : 0) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
293 |
15818 | 294 static void |
295 tree_mark_columns(GntTree *tree, int pos, int y, chtype type) | |
296 { | |
297 GntWidget *widget = GNT_WIDGET(tree); | |
298 int i; | |
299 int x = pos; | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
300 gboolean notfirst = FALSE; |
15818 | 301 |
302 for (i = 0; i < tree->ncol - 1; i++) | |
303 { | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
304 if (!tree->columns[i].invisible) { |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
305 notfirst = TRUE; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
306 NEXT_X; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
307 } |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
308 if (!tree->columns[i+1].invisible && notfirst) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
309 mvwaddch(widget->window, y, x, type); |
15818 | 310 } |
311 } | |
312 | |
313 static void | |
314 redraw_tree(GntTree *tree) | |
315 { | |
316 int start, i; | |
317 GntWidget *widget = GNT_WIDGET(tree); | |
318 GntTreeRow *row; | |
319 int pos, up, down; | |
320 int rows, scrcol; | |
321 | |
322 if (!GNT_WIDGET_IS_FLAG_SET(GNT_WIDGET(tree), GNT_WIDGET_MAPPED)) | |
323 return; | |
324 | |
325 if (GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER)) | |
326 pos = 0; | |
327 else | |
328 pos = 1; | |
329 | |
330 if (tree->top == NULL) | |
331 tree->top = tree->root; | |
332 if (tree->current == NULL) | |
333 tree->current = tree->root; | |
334 | |
335 wbkgd(widget->window, COLOR_PAIR(GNT_COLOR_NORMAL)); | |
336 | |
337 start = 0; | |
338 if (tree->show_title) | |
339 { | |
340 int i; | |
341 int x = pos; | |
342 | |
343 mvwhline(widget->window, pos + 1, pos, ACS_HLINE | COLOR_PAIR(GNT_COLOR_NORMAL), | |
344 widget->priv.width - pos - 1); | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
345 mvwhline(widget->window, pos, pos, ' ' | COLOR_PAIR(GNT_COLOR_NORMAL), |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
346 widget->priv.width - pos - 1); |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
347 |
15818 | 348 for (i = 0; i < tree->ncol; i++) |
349 { | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
350 if (tree->columns[i].invisible) { |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
351 continue; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
352 } |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
353 mvwaddstr(widget->window, pos, x + 1, tree->columns[i].title); |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
354 NEXT_X; |
15818 | 355 } |
356 if (pos) | |
357 { | |
358 tree_mark_columns(tree, pos, 0, ACS_TTEE | COLOR_PAIR(GNT_COLOR_NORMAL)); | |
359 tree_mark_columns(tree, pos, widget->priv.height - pos, | |
360 ACS_BTEE | COLOR_PAIR(GNT_COLOR_NORMAL)); | |
361 } | |
362 tree_mark_columns(tree, pos, pos + 1, | |
363 (tree->show_separator ? ACS_PLUS : ACS_HLINE) | COLOR_PAIR(GNT_COLOR_NORMAL)); | |
364 tree_mark_columns(tree, pos, pos, | |
365 (tree->show_separator ? ACS_VLINE : ' ') | COLOR_PAIR(GNT_COLOR_NORMAL)); | |
366 start = 2; | |
367 } | |
368 | |
369 rows = widget->priv.height - pos * 2 - start - 1; | |
370 tree->bottom = get_next_n_opt(tree->top, rows, &down); | |
371 if (down < rows) | |
372 { | |
373 tree->top = get_prev_n(tree->bottom, rows); | |
374 if (tree->top == NULL) | |
375 tree->top = tree->root; | |
376 } | |
377 | |
378 up = get_distance(tree->top, tree->current); | |
379 if (up < 0) | |
380 tree->top = tree->current; | |
381 else if (up >= widget->priv.height - pos) | |
382 tree->top = get_prev_n(tree->current, rows); | |
383 | |
384 if (tree->top && !row_matches_search(tree->top)) | |
385 tree->top = get_next(tree->top); | |
386 row = tree->top; | |
387 scrcol = widget->priv.width - 1 - 2 * pos; /* exclude the borders and the scrollbar */ | |
388 for (i = start + pos; row && i < widget->priv.height - pos; | |
389 i++, row = get_next(row)) | |
390 { | |
391 char *str; | |
392 int wr; | |
393 | |
394 GntTextFormatFlags flags = row->flags; | |
395 int attr = 0; | |
396 | |
397 if (!row_matches_search(row)) | |
398 continue; | |
399 str = update_row_text(tree, row); | |
400 | |
401 if ((wr = gnt_util_onscreen_width(str, NULL)) > scrcol) | |
402 { | |
403 char *s = (char*)gnt_util_onscreen_width_to_pointer(str, scrcol, &wr); | |
404 *s = '\0'; | |
405 } | |
406 | |
407 if (flags & GNT_TEXT_FLAG_BOLD) | |
408 attr |= A_BOLD; | |
409 if (flags & GNT_TEXT_FLAG_UNDERLINE) | |
410 attr |= A_UNDERLINE; | |
411 if (flags & GNT_TEXT_FLAG_BLINK) | |
412 attr |= A_BLINK; | |
413 | |
414 if (row == tree->current) | |
415 { | |
416 if (gnt_widget_has_focus(widget)) | |
417 attr |= COLOR_PAIR(GNT_COLOR_HIGHLIGHT); | |
418 else | |
419 attr |= COLOR_PAIR(GNT_COLOR_HIGHLIGHT_D); | |
420 } | |
421 else | |
422 { | |
423 if (flags & GNT_TEXT_FLAG_DIM) | |
424 attr |= (A_DIM | COLOR_PAIR(GNT_COLOR_DISABLED)); | |
425 else if (flags & GNT_TEXT_FLAG_HIGHLIGHT) | |
426 attr |= (A_DIM | COLOR_PAIR(GNT_COLOR_HIGHLIGHT)); | |
427 else | |
428 attr |= COLOR_PAIR(GNT_COLOR_NORMAL); | |
429 } | |
430 | |
431 wbkgdset(widget->window, '\0' | attr); | |
432 mvwaddstr(widget->window, i, pos, str); | |
433 whline(widget->window, ' ', scrcol - wr); | |
434 tree->bottom = row; | |
435 g_free(str); | |
436 tree_mark_columns(tree, pos, i, | |
437 (tree->show_separator ? ACS_VLINE : ' ') | attr); | |
438 } | |
439 | |
440 wbkgdset(widget->window, '\0' | COLOR_PAIR(GNT_COLOR_NORMAL)); | |
441 while (i < widget->priv.height - pos) | |
442 { | |
443 mvwhline(widget->window, i, pos, ' ', | |
444 widget->priv.width - pos * 2 - 1); | |
445 tree_mark_columns(tree, pos, i, | |
446 (tree->show_separator ? ACS_VLINE : ' ')); | |
447 i++; | |
448 } | |
449 | |
450 scrcol = widget->priv.width - pos - 1; /* position of the scrollbar */ | |
451 rows--; | |
452 if (rows > 0) | |
453 { | |
454 int total; | |
455 int showing, position; | |
456 | |
457 get_next_n_opt(tree->root, g_list_length(tree->list), &total); | |
458 showing = rows * rows / MAX(total, 1) + 1; | |
459 showing = MIN(rows, showing); | |
460 | |
461 total -= rows; | |
462 up = get_distance(tree->root, tree->top); | |
463 down = total - up; | |
464 | |
465 position = (rows - showing) * up / MAX(1, up + down); | |
466 position = MAX((tree->top != tree->root), position); | |
467 | |
468 if (showing + position > rows) | |
469 position = rows - showing; | |
470 | |
471 if (showing + position == rows && row) | |
472 position = MAX(0, rows - 1 - showing); | |
473 else if (showing + position < rows && !row) | |
474 position = rows - showing; | |
475 | |
476 position += pos + start + 1; | |
477 | |
478 mvwvline(widget->window, pos + start + 1, scrcol, | |
479 ' ' | COLOR_PAIR(GNT_COLOR_NORMAL), rows); | |
480 mvwvline(widget->window, position, scrcol, | |
481 ACS_CKBOARD | COLOR_PAIR(GNT_COLOR_HIGHLIGHT_D), showing); | |
482 } | |
483 | |
484 mvwaddch(widget->window, start + pos, scrcol, | |
485 ((tree->top != tree->root) ? ACS_UARROW : ' ') | | |
486 COLOR_PAIR(GNT_COLOR_HIGHLIGHT_D)); | |
487 | |
488 mvwaddch(widget->window, widget->priv.height - pos - 1, scrcol, | |
489 (row ? ACS_DARROW : ' ') | COLOR_PAIR(GNT_COLOR_HIGHLIGHT_D)); | |
490 | |
491 gnt_widget_queue_update(widget); | |
492 } | |
493 | |
494 static void | |
495 gnt_tree_draw(GntWidget *widget) | |
496 { | |
497 GntTree *tree = GNT_TREE(widget); | |
498 | |
499 redraw_tree(tree); | |
500 | |
501 GNTDEBUG; | |
502 } | |
503 | |
504 static void | |
505 gnt_tree_size_request(GntWidget *widget) | |
506 { | |
507 if (widget->priv.height == 0) | |
508 widget->priv.height = 10; /* XXX: Why?! */ | |
509 if (widget->priv.width == 0) | |
510 { | |
511 GntTree *tree = GNT_TREE(widget); | |
512 int i, width = 0; | |
513 for (i = 0; i < tree->ncol; i++) | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
514 if (!tree->columns[i].invisible) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
515 width += tree->columns[i].width + 1; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
516 widget->priv.width = width; |
15818 | 517 } |
518 } | |
519 | |
520 static void | |
521 gnt_tree_map(GntWidget *widget) | |
522 { | |
523 GntTree *tree = GNT_TREE(widget); | |
524 if (widget->priv.width == 0 || widget->priv.height == 0) | |
525 { | |
526 gnt_widget_size_request(widget); | |
527 } | |
528 tree->top = tree->root; | |
529 tree->current = tree->root; | |
530 GNTDEBUG; | |
531 } | |
532 | |
533 static void | |
534 tree_selection_changed(GntTree *tree, GntTreeRow *old, GntTreeRow *current) | |
535 { | |
536 g_signal_emit(tree, signals[SIG_SELECTION_CHANGED], 0, old ? old->key : NULL, | |
537 current ? current->key : NULL); | |
538 } | |
539 | |
540 static gboolean | |
541 action_down(GntBindable *bind, GList *null) | |
542 { | |
543 int dist; | |
544 GntTree *tree = GNT_TREE(bind); | |
545 GntTreeRow *old = tree->current; | |
546 GntTreeRow *row = get_next(tree->current); | |
547 if (row == NULL) | |
548 return FALSE; | |
549 tree->current = row; | |
550 if ((dist = get_distance(tree->current, tree->bottom)) < 0) | |
551 gnt_tree_scroll(tree, -dist); | |
552 else | |
553 redraw_tree(tree); | |
554 if (old != tree->current) | |
555 tree_selection_changed(tree, old, tree->current); | |
556 return TRUE; | |
557 } | |
558 | |
559 static gboolean | |
560 action_up(GntBindable *bind, GList *list) | |
561 { | |
562 int dist; | |
563 GntTree *tree = GNT_TREE(bind); | |
564 GntTreeRow *old = tree->current; | |
565 GntTreeRow *row = get_prev(tree->current); | |
566 if (!row) | |
567 return FALSE; | |
568 tree->current = row; | |
569 if ((dist = get_distance(tree->current, tree->top)) > 0) | |
570 gnt_tree_scroll(tree, -dist); | |
571 else | |
572 redraw_tree(tree); | |
573 if (old != tree->current) | |
574 tree_selection_changed(tree, old, tree->current); | |
575 | |
576 return TRUE; | |
577 } | |
578 | |
579 static gboolean | |
580 action_page_down(GntBindable *bind, GList *null) | |
581 { | |
582 GntTree *tree = GNT_TREE(bind); | |
583 GntTreeRow *old = tree->current; | |
584 GntTreeRow *row = get_next(tree->bottom); | |
585 if (row) | |
586 { | |
587 int dist = get_distance(tree->top, tree->current); | |
588 tree->top = tree->bottom; | |
589 tree->current = get_next_n_opt(tree->top, dist, NULL); | |
590 redraw_tree(tree); | |
591 } | |
592 else if (tree->current != tree->bottom) | |
593 { | |
594 tree->current = tree->bottom; | |
595 redraw_tree(tree); | |
596 } | |
597 | |
598 if (old != tree->current) | |
599 tree_selection_changed(tree, old, tree->current); | |
600 return TRUE; | |
601 } | |
602 | |
603 static gboolean | |
604 action_page_up(GntBindable *bind, GList *null) | |
605 { | |
606 GntWidget *widget = GNT_WIDGET(bind); | |
607 GntTree *tree = GNT_TREE(bind); | |
608 GntTreeRow *row; | |
609 GntTreeRow *old = tree->current; | |
610 | |
611 if (tree->top != tree->root) | |
612 { | |
613 int dist = get_distance(tree->top, tree->current); | |
614 row = get_prev_n(tree->top, widget->priv.height - 1 - | |
615 tree->show_title * 2 - 2 * (GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER) == 0)); | |
616 if (row == NULL) | |
617 row = tree->root; | |
618 tree->top = row; | |
619 tree->current = get_next_n_opt(tree->top, dist, NULL); | |
620 redraw_tree(tree); | |
621 } | |
622 else if (tree->current != tree->top) | |
623 { | |
624 tree->current = tree->top; | |
625 redraw_tree(tree); | |
626 } | |
627 if (old != tree->current) | |
628 tree_selection_changed(tree, old, tree->current); | |
629 return TRUE; | |
630 } | |
631 | |
632 static void | |
633 end_search(GntTree *tree) | |
634 { | |
635 if (tree->search) { | |
636 g_source_remove(tree->search_timeout); | |
637 g_string_free(tree->search, TRUE); | |
638 tree->search = NULL; | |
639 tree->search_timeout = 0; | |
640 } | |
641 } | |
642 | |
643 static gboolean | |
644 search_timeout(gpointer data) | |
645 { | |
646 GntTree *tree = data; | |
647 | |
648 end_search(tree); | |
649 redraw_tree(tree); | |
650 | |
651 return FALSE; | |
652 } | |
653 | |
654 static gboolean | |
655 gnt_tree_key_pressed(GntWidget *widget, const char *text) | |
656 { | |
657 GntTree *tree = GNT_TREE(widget); | |
658 GntTreeRow *old = tree->current; | |
659 | |
660 if (text[0] == '\r') { | |
661 end_search(tree); | |
662 gnt_widget_activate(widget); | |
663 } else if (tree->search) { | |
664 if (isalnum(*text)) { | |
665 tree->search = g_string_append_c(tree->search, *text); | |
666 redraw_tree(tree); | |
667 g_source_remove(tree->search_timeout); | |
668 tree->search_timeout = g_timeout_add(SEARCH_TIMEOUT, search_timeout, tree); | |
669 } | |
670 return TRUE; | |
671 } else if (text[0] == ' ' && text[1] == 0) { | |
672 /* Space pressed */ | |
673 GntTreeRow *row = tree->current; | |
674 if (row && row->child) | |
675 { | |
676 row->collapsed = !row->collapsed; | |
677 redraw_tree(tree); | |
678 } | |
679 else if (row && row->choice) | |
680 { | |
681 row->isselected = !row->isselected; | |
682 g_signal_emit(tree, signals[SIG_TOGGLED], 0, row->key); | |
683 redraw_tree(tree); | |
684 } | |
685 } | |
686 | |
687 if (old != tree->current) | |
688 { | |
689 tree_selection_changed(tree, old, tree->current); | |
690 return TRUE; | |
691 } | |
692 | |
693 return FALSE; | |
694 } | |
695 | |
696 static void | |
697 gnt_tree_destroy(GntWidget *widget) | |
698 { | |
699 GntTree *tree = GNT_TREE(widget); | |
700 int i; | |
701 | |
702 end_search(tree); | |
703 if (tree->hash) | |
704 g_hash_table_destroy(tree->hash); | |
705 g_list_free(tree->list); | |
706 | |
707 for (i = 0; i < tree->ncol; i++) | |
708 { | |
709 g_free(tree->columns[i].title); | |
710 } | |
711 g_free(tree->columns); | |
712 } | |
713 | |
714 static gboolean | |
715 gnt_tree_clicked(GntWidget *widget, GntMouseEvent event, int x, int y) | |
716 { | |
717 GntTree *tree = GNT_TREE(widget); | |
718 GntTreeRow *old = tree->current; | |
719 if (event == GNT_MOUSE_SCROLL_UP) { | |
720 action_up(GNT_BINDABLE(widget), NULL); | |
721 } else if (event == GNT_MOUSE_SCROLL_DOWN) { | |
722 action_down(GNT_BINDABLE(widget), NULL); | |
723 } else if (event == GNT_LEFT_MOUSE_DOWN) { | |
724 GntTreeRow *row; | |
725 GntTree *tree = GNT_TREE(widget); | |
726 int pos = 1; | |
727 if (GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER)) | |
728 pos = 0; | |
729 if (tree->show_title) | |
730 pos += 2; | |
731 pos = y - widget->priv.y - pos; | |
732 row = get_next_n(tree->top, pos); | |
733 if (row && tree->current != row) { | |
734 GntTreeRow *old = tree->current; | |
735 tree->current = row; | |
736 redraw_tree(tree); | |
737 tree_selection_changed(tree, old, tree->current); | |
738 } else if (row && row == tree->current) { | |
739 if (row->choice) { | |
740 row->isselected = !row->isselected; | |
741 g_signal_emit(tree, signals[SIG_TOGGLED], 0, row->key); | |
742 redraw_tree(tree); | |
743 } else { | |
744 gnt_widget_activate(widget); | |
745 } | |
746 } | |
747 } else { | |
748 return FALSE; | |
749 } | |
750 if (old != tree->current) { | |
751 tree_selection_changed(tree, old, tree->current); | |
752 } | |
753 return TRUE; | |
754 } | |
755 | |
756 static void | |
757 gnt_tree_size_changed(GntWidget *widget, int w, int h) | |
758 { | |
759 GntTree *tree = GNT_TREE(widget); | |
760 int i; | |
761 int n = 0; | |
762 if (widget->priv.width <= 0) | |
763 return; | |
764 for (i = 0; i < tree->ncol; ++i) | |
765 n += tree->columns[i].width; | |
766 if (GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER)) | |
767 tree->columns[tree->ncol - 1].width += widget->priv.width - n - 1 * tree->ncol; | |
768 else | |
769 tree->columns[tree->ncol - 1].width += widget->priv.width - n - 2 - 1 * tree->ncol; | |
770 } | |
771 | |
772 static gboolean | |
773 start_search(GntBindable *bindable, GList *list) | |
774 { | |
775 GntTree *tree = GNT_TREE(bindable); | |
776 if (tree->search) | |
777 return FALSE; | |
778 tree->search = g_string_new(NULL); | |
779 tree->search_timeout = g_timeout_add(SEARCH_TIMEOUT, search_timeout, tree); | |
780 return TRUE; | |
781 } | |
782 | |
783 static gboolean | |
784 end_search_action(GntBindable *bindable, GList *list) | |
785 { | |
786 GntTree *tree = GNT_TREE(bindable); | |
787 if (tree->search == NULL) | |
788 return FALSE; | |
789 end_search(tree); | |
790 redraw_tree(tree); | |
791 return TRUE; | |
792 } | |
793 | |
794 static void | |
795 gnt_tree_class_init(GntTreeClass *klass) | |
796 { | |
797 GntBindableClass *bindable = GNT_BINDABLE_CLASS(klass); | |
798 parent_class = GNT_WIDGET_CLASS(klass); | |
799 parent_class->destroy = gnt_tree_destroy; | |
800 parent_class->draw = gnt_tree_draw; | |
801 parent_class->map = gnt_tree_map; | |
802 parent_class->size_request = gnt_tree_size_request; | |
803 parent_class->key_pressed = gnt_tree_key_pressed; | |
804 parent_class->clicked = gnt_tree_clicked; | |
805 parent_class->size_changed = gnt_tree_size_changed; | |
806 | |
807 signals[SIG_SELECTION_CHANGED] = | |
808 g_signal_new("selection-changed", | |
809 G_TYPE_FROM_CLASS(klass), | |
810 G_SIGNAL_RUN_LAST, | |
811 G_STRUCT_OFFSET(GntTreeClass, selection_changed), | |
812 NULL, NULL, | |
813 gnt_closure_marshal_VOID__POINTER_POINTER, | |
814 G_TYPE_NONE, 2, G_TYPE_POINTER, G_TYPE_POINTER); | |
815 signals[SIG_SCROLLED] = | |
816 g_signal_new("scrolled", | |
817 G_TYPE_FROM_CLASS(klass), | |
818 G_SIGNAL_RUN_LAST, | |
819 0, | |
820 NULL, NULL, | |
821 g_cclosure_marshal_VOID__INT, | |
822 G_TYPE_NONE, 1, G_TYPE_INT); | |
823 signals[SIG_TOGGLED] = | |
824 g_signal_new("toggled", | |
825 G_TYPE_FROM_CLASS(klass), | |
826 G_SIGNAL_RUN_LAST, | |
827 G_STRUCT_OFFSET(GntTreeClass, toggled), | |
828 NULL, NULL, | |
829 g_cclosure_marshal_VOID__POINTER, | |
830 G_TYPE_NONE, 1, G_TYPE_POINTER); | |
831 | |
832 gnt_bindable_class_register_action(bindable, "move-up", action_up, | |
833 GNT_KEY_UP, NULL); | |
834 gnt_bindable_register_binding(bindable, "move-up", GNT_KEY_CTRL_P, NULL); | |
835 gnt_bindable_class_register_action(bindable, "move-down", action_down, | |
836 GNT_KEY_DOWN, NULL); | |
837 gnt_bindable_register_binding(bindable, "move-down", GNT_KEY_CTRL_N, NULL); | |
838 gnt_bindable_class_register_action(bindable, "page-up", action_page_up, | |
839 GNT_KEY_PGUP, NULL); | |
840 gnt_bindable_class_register_action(bindable, "page-down", action_page_down, | |
841 GNT_KEY_PGDOWN, NULL); | |
842 gnt_bindable_class_register_action(bindable, "start-search", start_search, | |
843 "/", NULL); | |
844 gnt_bindable_class_register_action(bindable, "end-search", end_search_action, | |
845 "\033", NULL); | |
846 | |
847 gnt_style_read_actions(G_OBJECT_CLASS_TYPE(klass), bindable); | |
848 GNTDEBUG; | |
849 } | |
850 | |
851 static void | |
852 gnt_tree_init(GTypeInstance *instance, gpointer class) | |
853 { | |
854 GntWidget *widget = GNT_WIDGET(instance); | |
855 GntTree *tree = GNT_TREE(widget); | |
856 tree->show_separator = TRUE; | |
857 GNT_WIDGET_SET_FLAGS(widget, GNT_WIDGET_GROW_X | GNT_WIDGET_GROW_Y); | |
858 widget->priv.minw = 4; | |
859 widget->priv.minh = 1; | |
860 GNTDEBUG; | |
861 } | |
862 | |
863 /****************************************************************************** | |
864 * GntTree API | |
865 *****************************************************************************/ | |
866 GType | |
867 gnt_tree_get_gtype(void) | |
868 { | |
869 static GType type = 0; | |
870 | |
871 if(type == 0) | |
872 { | |
873 static const GTypeInfo info = { | |
874 sizeof(GntTreeClass), | |
875 NULL, /* base_init */ | |
876 NULL, /* base_finalize */ | |
877 (GClassInitFunc)gnt_tree_class_init, | |
878 NULL, /* class_finalize */ | |
879 NULL, /* class_data */ | |
880 sizeof(GntTree), | |
881 0, /* n_preallocs */ | |
882 gnt_tree_init, /* instance_init */ | |
883 NULL /* value_table */ | |
884 }; | |
885 | |
886 type = g_type_register_static(GNT_TYPE_WIDGET, | |
887 "GntTree", | |
888 &info, 0); | |
889 } | |
890 | |
891 return type; | |
892 } | |
893 | |
894 static void | |
895 free_tree_col(gpointer data) | |
896 { | |
897 GntTreeCol *col = data; | |
898 | |
899 g_free(col->text); | |
900 g_free(col); | |
901 } | |
902 | |
903 static void | |
904 free_tree_row(gpointer data) | |
905 { | |
906 GntTreeRow *row = data; | |
907 | |
908 if (!row) | |
909 return; | |
910 | |
911 g_list_foreach(row->columns, (GFunc)free_tree_col, NULL); | |
912 g_list_free(row->columns); | |
913 g_free(row); | |
914 } | |
915 | |
916 GntWidget *gnt_tree_new() | |
917 { | |
918 return gnt_tree_new_with_columns(1); | |
919 } | |
920 | |
921 void gnt_tree_set_visible_rows(GntTree *tree, int rows) | |
922 { | |
923 GntWidget *widget = GNT_WIDGET(tree); | |
924 widget->priv.height = rows; | |
925 if (!GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER)) | |
926 widget->priv.height += 2; | |
927 } | |
928 | |
929 int gnt_tree_get_visible_rows(GntTree *tree) | |
930 { | |
931 GntWidget *widget = GNT_WIDGET(tree); | |
932 int ret = widget->priv.height; | |
933 if (!GNT_WIDGET_IS_FLAG_SET(widget, GNT_WIDGET_NO_BORDER)) | |
934 ret -= 2; | |
935 return ret; | |
936 } | |
937 | |
938 const GList *gnt_tree_get_rows(GntTree *tree) | |
939 { | |
940 return tree->list; | |
941 } | |
942 | |
943 void gnt_tree_scroll(GntTree *tree, int count) | |
944 { | |
945 GntTreeRow *row; | |
946 | |
947 if (count < 0) | |
948 { | |
949 if (get_root_distance(tree->top) == 0) | |
950 return; | |
951 row = get_prev_n(tree->top, -count); | |
952 if (row == NULL) | |
953 row = tree->root; | |
954 tree->top = row; | |
955 } | |
956 else | |
957 { | |
958 get_next_n_opt(tree->bottom, count, &count); | |
959 tree->top = get_next_n(tree->top, count); | |
960 } | |
961 | |
962 redraw_tree(tree); | |
963 g_signal_emit(tree, signals[SIG_SCROLLED], 0, count); | |
964 } | |
965 | |
966 static gpointer | |
967 find_position(GntTree *tree, gpointer key, gpointer parent) | |
968 { | |
969 GntTreeRow *row; | |
970 | |
971 if (tree->compare == NULL) | |
972 return NULL; | |
973 | |
974 if (parent == NULL) | |
975 row = tree->root; | |
976 else | |
977 row = g_hash_table_lookup(tree->hash, parent); | |
978 | |
979 if (!row) | |
980 return NULL; | |
981 | |
982 if (parent) | |
983 row = row->child; | |
984 | |
985 while (row) | |
986 { | |
987 if (tree->compare(key, row->key) < 0) | |
988 return (row->prev ? row->prev->key : NULL); | |
989 if (row->next) | |
990 row = row->next; | |
991 else | |
992 return row->key; | |
993 } | |
994 return NULL; | |
995 } | |
996 | |
997 void gnt_tree_sort_row(GntTree *tree, gpointer key) | |
998 { | |
999 GntTreeRow *row, *q, *s; | |
1000 int current, newp; | |
1001 | |
1002 if (!tree->compare) | |
1003 return; | |
1004 | |
1005 row = g_hash_table_lookup(tree->hash, key); | |
1006 g_return_if_fail(row != NULL); | |
1007 | |
1008 current = g_list_index(tree->list, key); | |
1009 | |
1010 if (row->parent) | |
1011 s = row->parent->child; | |
1012 else | |
1013 s = tree->root; | |
1014 | |
1015 q = NULL; | |
1016 while (s) { | |
1017 if (tree->compare(row->key, s->key) < 0) | |
1018 break; | |
1019 q = s; | |
1020 s = s->next; | |
1021 } | |
1022 | |
1023 /* Move row between q and s */ | |
1024 if (row == q || row == s) | |
1025 return; | |
1026 | |
1027 if (q == NULL) { | |
1028 /* row becomes the first child of its parent */ | |
1029 row->prev->next = row->next; /* row->prev cannot be NULL at this point */ | |
1030 if (row->next) | |
1031 row->next->prev = row->prev; | |
1032 if (row->parent) | |
1033 row->parent->child = row; | |
1034 else | |
1035 tree->root = row; | |
1036 row->next = s; | |
1037 s->prev = row; /* s cannot be NULL */ | |
1038 row->prev = NULL; | |
1039 newp = g_list_index(tree->list, s) - 1; | |
1040 } else { | |
1041 if (row->prev) { | |
1042 row->prev->next = row->next; | |
1043 } else { | |
1044 /* row was the first child of its parent */ | |
1045 if (row->parent) | |
1046 row->parent->child = row->next; | |
1047 else | |
1048 tree->top = row->next; | |
1049 } | |
1050 | |
1051 if (row->next) | |
1052 row->next->prev = row->prev; | |
1053 | |
1054 q->next = row; | |
1055 row->prev = q; | |
1056 if (s) | |
1057 s->prev = row; | |
1058 row->next = s; | |
1059 newp = g_list_index(tree->list, q) + 1; | |
1060 } | |
1061 tree->list = g_list_reposition_child(tree->list, current, newp); | |
1062 | |
1063 redraw_tree(tree); | |
1064 } | |
1065 | |
1066 GntTreeRow *gnt_tree_add_row_after(GntTree *tree, void *key, GntTreeRow *row, void *parent, void *bigbro) | |
1067 { | |
1068 GntTreeRow *pr = NULL; | |
1069 | |
1070 g_hash_table_replace(tree->hash, key, row); | |
1071 row->tree = tree; | |
1072 | |
1073 if (bigbro == NULL && tree->compare) | |
1074 { | |
1075 bigbro = find_position(tree, key, parent); | |
1076 } | |
1077 | |
1078 if (tree->root == NULL) | |
1079 { | |
1080 tree->root = row; | |
1081 tree->list = g_list_prepend(tree->list, key); | |
1082 } | |
1083 else | |
1084 { | |
1085 int position = 0; | |
1086 | |
1087 if (bigbro) | |
1088 { | |
1089 pr = g_hash_table_lookup(tree->hash, bigbro); | |
1090 if (pr) | |
1091 { | |
1092 if (pr->next) pr->next->prev = row; | |
1093 row->next = pr->next; | |
1094 row->prev = pr; | |
1095 pr->next = row; | |
1096 row->parent = pr->parent; | |
1097 | |
1098 position = g_list_index(tree->list, bigbro); | |
1099 } | |
1100 } | |
1101 | |
1102 if (pr == NULL && parent) | |
1103 { | |
1104 pr = g_hash_table_lookup(tree->hash, parent); | |
1105 if (pr) | |
1106 { | |
1107 if (pr->child) pr->child->prev = row; | |
1108 row->next = pr->child; | |
1109 pr->child = row; | |
1110 row->parent = pr; | |
1111 | |
1112 position = g_list_index(tree->list, parent); | |
1113 } | |
1114 } | |
1115 | |
1116 if (pr == NULL) | |
1117 { | |
1118 GntTreeRow *r = tree->root; | |
1119 row->next = r; | |
1120 if (r) r->prev = row; | |
1121 if (tree->current == tree->root) | |
1122 tree->current = row; | |
1123 tree->root = row; | |
1124 tree->list = g_list_prepend(tree->list, key); | |
1125 } | |
1126 else | |
1127 { | |
1128 tree->list = g_list_insert(tree->list, key, position + 1); | |
1129 } | |
1130 } | |
1131 | |
1132 row->key = key; | |
1133 row->data = NULL; | |
1134 | |
1135 redraw_tree(tree); | |
1136 | |
1137 return row; | |
1138 } | |
1139 | |
1140 GntTreeRow *gnt_tree_add_row_last(GntTree *tree, void *key, GntTreeRow *row, void *parent) | |
1141 { | |
1142 GntTreeRow *pr = NULL, *br = NULL; | |
1143 | |
1144 if (parent) | |
1145 pr = g_hash_table_lookup(tree->hash, parent); | |
1146 | |
1147 if (pr) | |
1148 br = pr->child; | |
1149 else | |
1150 br = tree->root; | |
1151 | |
1152 if (br) | |
1153 { | |
1154 while (br->next) | |
1155 br = br->next; | |
1156 } | |
1157 | |
1158 return gnt_tree_add_row_after(tree, key, row, parent, br ? br->key : NULL); | |
1159 } | |
1160 | |
1161 gpointer gnt_tree_get_selection_data(GntTree *tree) | |
1162 { | |
1163 if (tree->current) | |
1164 return tree->current->key; /* XXX: perhaps we should just get rid of 'data' */ | |
1165 return NULL; | |
1166 } | |
1167 | |
1168 char *gnt_tree_get_selection_text(GntTree *tree) | |
1169 { | |
1170 if (tree->current) | |
1171 return update_row_text(tree, tree->current); | |
1172 return NULL; | |
1173 } | |
1174 | |
1175 GList *gnt_tree_get_selection_text_list(GntTree *tree) | |
1176 { | |
1177 GList *list = NULL, *iter; | |
1178 int i; | |
1179 | |
1180 if (!tree->current) | |
1181 return NULL; | |
1182 | |
1183 for (i = 0, iter = tree->current->columns; i < tree->ncol && iter; | |
1184 i++, iter = iter->next) | |
1185 { | |
1186 GntTreeCol *col = iter->data; | |
1187 list = g_list_append(list, g_strdup(col->text)); | |
1188 } | |
1189 | |
1190 return list; | |
1191 } | |
1192 | |
1193 void gnt_tree_remove(GntTree *tree, gpointer key) | |
1194 { | |
1195 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1196 static int depth = 0; /* Only redraw after all child nodes are removed */ | |
1197 if (row) | |
1198 { | |
1199 gboolean redraw = FALSE; | |
1200 | |
1201 if (row->child) { | |
1202 depth++; | |
1203 while (row->child) { | |
1204 gnt_tree_remove(tree, row->child->key); | |
1205 } | |
1206 depth--; | |
1207 } | |
1208 | |
1209 if (get_distance(tree->top, row) >= 0 && get_distance(row, tree->bottom) >= 0) | |
1210 redraw = TRUE; | |
1211 | |
1212 /* Update root/top/current/bottom if necessary */ | |
1213 if (tree->root == row) | |
1214 tree->root = get_next(row); | |
1215 if (tree->top == row) | |
1216 { | |
1217 if (tree->top != tree->root) | |
1218 tree->top = get_prev(row); | |
1219 else | |
1220 tree->top = get_next(row); | |
1221 } | |
1222 if (tree->current == row) | |
1223 { | |
1224 if (tree->current != tree->root) | |
1225 tree->current = get_prev(row); | |
1226 else | |
1227 tree->current = get_next(row); | |
1228 tree_selection_changed(tree, row, tree->current); | |
1229 } | |
1230 if (tree->bottom == row) | |
1231 { | |
1232 tree->bottom = get_prev(row); | |
1233 } | |
1234 | |
1235 /* Fix the links */ | |
1236 if (row->next) | |
1237 row->next->prev = row->prev; | |
1238 if (row->parent && row->parent->child == row) | |
1239 row->parent->child = row->next; | |
1240 if (row->prev) | |
1241 row->prev->next = row->next; | |
1242 | |
1243 g_hash_table_remove(tree->hash, key); | |
1244 tree->list = g_list_remove(tree->list, key); | |
1245 | |
1246 if (redraw && depth == 0) | |
1247 { | |
1248 redraw_tree(tree); | |
1249 } | |
1250 } | |
1251 } | |
1252 | |
1253 static gboolean | |
1254 return_true(gpointer key, gpointer data, gpointer null) | |
1255 { | |
1256 return TRUE; | |
1257 } | |
1258 | |
1259 void gnt_tree_remove_all(GntTree *tree) | |
1260 { | |
1261 tree->root = NULL; | |
1262 g_hash_table_foreach_remove(tree->hash, (GHRFunc)return_true, tree); | |
1263 g_list_free(tree->list); | |
1264 tree->list = NULL; | |
1265 tree->current = tree->top = tree->bottom = NULL; | |
1266 } | |
1267 | |
1268 int gnt_tree_get_selection_visible_line(GntTree *tree) | |
1269 { | |
1270 return get_distance(tree->top, tree->current) + | |
1271 !!(GNT_WIDGET_IS_FLAG_SET(GNT_WIDGET(tree), GNT_WIDGET_NO_BORDER)); | |
1272 } | |
1273 | |
1274 void gnt_tree_change_text(GntTree *tree, gpointer key, int colno, const char *text) | |
1275 { | |
1276 GntTreeRow *row; | |
1277 GntTreeCol *col; | |
1278 | |
1279 g_return_if_fail(colno < tree->ncol); | |
1280 | |
1281 row = g_hash_table_lookup(tree->hash, key); | |
1282 if (row) | |
1283 { | |
1284 col = g_list_nth_data(row->columns, colno); | |
1285 g_free(col->text); | |
1286 col->text = g_strdup(text); | |
1287 | |
1288 if (get_distance(tree->top, row) >= 0 && get_distance(row, tree->bottom) >= 0) | |
1289 redraw_tree(tree); | |
1290 } | |
1291 } | |
1292 | |
1293 GntTreeRow *gnt_tree_add_choice(GntTree *tree, void *key, GntTreeRow *row, void *parent, void *bigbro) | |
1294 { | |
1295 GntTreeRow *r; | |
1296 r = g_hash_table_lookup(tree->hash, key); | |
1297 g_return_val_if_fail(!r || !r->choice, NULL); | |
1298 | |
1299 if (bigbro == NULL) { | |
1300 if (tree->compare) | |
1301 bigbro = find_position(tree, key, parent); | |
1302 else { | |
1303 r = g_hash_table_lookup(tree->hash, parent); | |
1304 if (!r) | |
1305 r = tree->root; | |
1306 else | |
1307 r = r->child; | |
1308 if (r) { | |
1309 while (r->next) | |
1310 r = r->next; | |
1311 bigbro = r->key; | |
1312 } | |
1313 } | |
1314 } | |
1315 row = gnt_tree_add_row_after(tree, key, row, parent, bigbro); | |
1316 row->choice = TRUE; | |
1317 | |
1318 return row; | |
1319 } | |
1320 | |
1321 void gnt_tree_set_choice(GntTree *tree, void *key, gboolean set) | |
1322 { | |
1323 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1324 | |
1325 if (!row) | |
1326 return; | |
1327 g_return_if_fail(row->choice); | |
1328 | |
1329 row->isselected = set; | |
1330 redraw_tree(tree); | |
1331 } | |
1332 | |
1333 gboolean gnt_tree_get_choice(GntTree *tree, void *key) | |
1334 { | |
1335 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1336 | |
1337 if (!row) | |
1338 return FALSE; | |
1339 g_return_val_if_fail(row->choice, FALSE); | |
1340 | |
1341 return row->isselected; | |
1342 } | |
1343 | |
1344 void gnt_tree_set_row_flags(GntTree *tree, void *key, GntTextFormatFlags flags) | |
1345 { | |
1346 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1347 if (!row || row->flags == flags) | |
1348 return; | |
1349 | |
1350 row->flags = flags; | |
1351 redraw_tree(tree); /* XXX: It shouldn't be necessary to redraw the whole darned tree */ | |
1352 } | |
1353 | |
1354 void gnt_tree_set_selected(GntTree *tree , void *key) | |
1355 { | |
1356 int dist; | |
1357 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1358 if (!row) | |
1359 return; | |
1360 | |
1361 if (tree->top == NULL) | |
1362 tree->top = row; | |
1363 if (tree->bottom == NULL) | |
1364 tree->bottom = row; | |
1365 | |
1366 tree->current = row; | |
1367 if ((dist = get_distance(tree->current, tree->bottom)) < 0) | |
1368 gnt_tree_scroll(tree, -dist); | |
1369 else if ((dist = get_distance(tree->current, tree->top)) > 0) | |
1370 gnt_tree_scroll(tree, -dist); | |
1371 else | |
1372 redraw_tree(tree); | |
1373 } | |
1374 | |
1375 void _gnt_tree_init_internals(GntTree *tree, int col) | |
1376 { | |
1377 tree->ncol = col; | |
1378 tree->hash = g_hash_table_new_full(g_direct_hash, g_direct_equal, NULL, free_tree_row); | |
1379 tree->columns = g_new0(struct _GntTreeColInfo, col); | |
1380 while (col--) | |
1381 { | |
1382 tree->columns[col].width = 15; | |
1383 } | |
1384 tree->list = NULL; | |
1385 tree->show_title = FALSE; | |
1386 } | |
1387 | |
1388 GntWidget *gnt_tree_new_with_columns(int col) | |
1389 { | |
1390 GntWidget *widget = g_object_new(GNT_TYPE_TREE, NULL); | |
1391 GntTree *tree = GNT_TREE(widget); | |
1392 | |
1393 _gnt_tree_init_internals(tree, col); | |
1394 | |
1395 GNT_WIDGET_SET_FLAGS(widget, GNT_WIDGET_NO_SHADOW); | |
1396 gnt_widget_set_take_focus(widget, TRUE); | |
1397 | |
1398 return widget; | |
1399 } | |
1400 | |
1401 GntTreeRow *gnt_tree_create_row_from_list(GntTree *tree, GList *list) | |
1402 { | |
1403 GList *iter; | |
1404 int i; | |
1405 GntTreeRow *row = g_new0(GntTreeRow, 1); | |
1406 | |
1407 for (i = 0, iter = list; i < tree->ncol && iter; iter = iter->next, i++) | |
1408 { | |
1409 GntTreeCol *col = g_new0(GntTreeCol, 1); | |
1410 col->span = 1; | |
1411 col->text = g_strdup(iter->data ? iter->data : ""); | |
1412 | |
1413 row->columns = g_list_append(row->columns, col); | |
1414 } | |
1415 | |
1416 return row; | |
1417 } | |
1418 | |
1419 GntTreeRow *gnt_tree_create_row(GntTree *tree, ...) | |
1420 { | |
1421 int i; | |
1422 va_list args; | |
1423 GList *list = NULL; | |
1424 GntTreeRow *row; | |
1425 | |
1426 va_start(args, tree); | |
1427 for (i = 0; i < tree->ncol; i++) | |
1428 { | |
1429 list = g_list_append(list, va_arg(args, char *)); | |
1430 } | |
1431 va_end(args); | |
1432 | |
1433 row = gnt_tree_create_row_from_list(tree, list); | |
1434 g_list_free(list); | |
1435 | |
1436 return row; | |
1437 } | |
1438 | |
1439 void gnt_tree_set_col_width(GntTree *tree, int col, int width) | |
1440 { | |
1441 g_return_if_fail(col < tree->ncol); | |
1442 | |
1443 tree->columns[col].width = width; | |
1444 } | |
1445 | |
1446 void gnt_tree_set_column_titles(GntTree *tree, ...) | |
1447 { | |
1448 int i; | |
1449 va_list args; | |
1450 | |
1451 va_start(args, tree); | |
1452 for (i = 0; i < tree->ncol; i++) | |
1453 { | |
1454 const char *title = va_arg(args, const char *); | |
1455 tree->columns[i].title = g_strdup(title); | |
1456 } | |
1457 va_end(args); | |
1458 } | |
1459 | |
1460 void gnt_tree_set_show_title(GntTree *tree, gboolean set) | |
1461 { | |
1462 tree->show_title = set; | |
1463 GNT_WIDGET(tree)->priv.minh = (set ? 6 : 4); | |
1464 } | |
1465 | |
1466 void gnt_tree_set_compare_func(GntTree *tree, GCompareFunc func) | |
1467 { | |
1468 tree->compare = func; | |
1469 } | |
1470 | |
1471 void gnt_tree_set_expanded(GntTree *tree, void *key, gboolean expanded) | |
1472 { | |
1473 GntTreeRow *row = g_hash_table_lookup(tree->hash, key); | |
1474 if (row) { | |
1475 row->collapsed = !expanded; | |
1476 if (GNT_WIDGET(tree)->window) | |
1477 gnt_widget_draw(GNT_WIDGET(tree)); | |
1478 } | |
1479 } | |
1480 | |
1481 void gnt_tree_set_show_separator(GntTree *tree, gboolean set) | |
1482 { | |
1483 tree->show_separator = set; | |
1484 } | |
1485 | |
1486 void gnt_tree_adjust_columns(GntTree *tree) | |
1487 { | |
1488 GntTreeRow *row = tree->root; | |
1489 int *widths, i, twidth, height; | |
1490 | |
1491 widths = g_new0(int, tree->ncol); | |
1492 while (row) { | |
1493 GList *iter; | |
1494 for (i = 0, iter = row->columns; iter; iter = iter->next, i++) { | |
1495 GntTreeCol *col = iter->data; | |
1496 int w = gnt_util_onscreen_width(col->text, NULL); | |
15968
0ab73bf1fef1
check-items are wider.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15931
diff
changeset
|
1497 if (i == 0 && row->choice) |
0ab73bf1fef1
check-items are wider.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15931
diff
changeset
|
1498 w += 4; |
15818 | 1499 if (widths[i] < w) |
1500 widths[i] = w; | |
1501 } | |
1502 row = row->next; | |
1503 } | |
1504 | |
1505 twidth = 1 + 2 * (!GNT_WIDGET_IS_FLAG_SET(GNT_WIDGET(tree), GNT_WIDGET_NO_BORDER)); | |
1506 for (i = 0; i < tree->ncol; i++) { | |
1507 gnt_tree_set_col_width(tree, i, widths[i]); | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1508 if (!tree->columns[i].invisible) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1509 twidth += widths[i] + (tree->show_separator ? 1 : 0) + 1; |
15818 | 1510 } |
1511 g_free(widths); | |
1512 | |
1513 gnt_widget_get_size(GNT_WIDGET(tree), NULL, &height); | |
1514 gnt_widget_set_size(GNT_WIDGET(tree), twidth, height); | |
1515 } | |
1516 | |
1517 void gnt_tree_set_hash_fns(GntTree *tree, gpointer hash, gpointer eq, gpointer kd) | |
1518 { | |
1519 g_hash_table_foreach_remove(tree->hash, return_true, NULL); | |
1520 g_hash_table_destroy(tree->hash); | |
1521 tree->hash = g_hash_table_new_full(hash, eq, kd, free_tree_row); | |
1522 } | |
1523 | |
15970
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1524 void gnt_tree_set_column_visible(GntTree *tree, int col, gboolean vis) |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1525 { |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1526 g_return_if_fail(col < tree->ncol); |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1527 tree->columns[col].invisible = !vis; |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1528 } |
790d1d003825
Allow making some columns invisible.
Sadrul Habib Chowdhury <imadil@gmail.com>
parents:
15968
diff
changeset
|
1529 |