2 * This file is part of DisOrder
3 * Copyright (C) 2006, 2007 Richard Kettlewell
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
20 /** @file disobedience/choose.c
21 * @brief Hierarchical track selection and search
23 * We don't use the built-in tree widgets because they require that you know
24 * the children of a node on demand, and we have to wait for the server to tell
28 #include "disobedience.h"
30 /* Choose track ------------------------------------------------------------ */
48 /** @brief Accumulated information about the tree widget */
50 /** @brief Maximum width required */
52 /** @brief Maximum height required */
56 /* instantiate the node vector type */
58 VECTOR_TYPE(nodevector
, struct choosenode
*, xrealloc
);
60 /** @brief Signature of function called when a choosenode is filled */
61 typedef void (when_filled_callback
)(struct choosenode
*cn
,
64 /** @brief One node in the virtual filesystem */
66 struct choosenode
*parent
; /**< @brief parent node */
67 const char *path
; /**< @brief full path or 0 */
68 const char *sort
; /**< @brief sort key */
69 const char *display
; /**< @brief display name */
70 int pending
; /**< @brief pending resolve queries */
72 #define CN_EXPANDABLE 0x0001 /**< @brief node is expandable */
73 #define CN_EXPANDED 0x0002 /**< @brief node is expanded
75 * Expandable items are directories;
76 * non-expandable ones are files. */
77 #define CN_DISPLAYED 0x0004 /**< @brief widget is displayed in layout */
78 #define CN_SELECTED 0x0008 /**< @brief node is selected */
79 #define CN_GETTING_FILES 0x0010 /**< @brief files inbound */
80 #define CN_RESOLVING_FILES 0x0020 /**< @brief resolved files inbound */
81 #define CN_GETTING_DIRS 0x0040 /**< @brief directories inbound */
82 #define CN_GETTING_ANY 0x0070 /**< @brief getting something */
83 #define CN_CONTINGENT 0x0080 /**< @brief expansion contingent on search */
84 struct nodevector children
; /**< @brief vector of children */
85 void (*fill
)(struct choosenode
*); /**< @brief request child fill or 0 for leaf */
86 GtkWidget
*container
; /**< @brief the container for this row */
87 GtkWidget
*hbox
; /**< @brief the hbox for this row */
88 GtkWidget
*arrow
; /**< @brief arrow widget or 0 */
89 GtkWidget
*label
; /**< @brief text label for this node */
90 GtkWidget
*marker
; /**< @brief queued marker */
92 when_filled_callback
*whenfilled
; /**< @brief called when filled or 0 */
93 void *wfu
; /**< @brief passed to @c whenfilled */
94 int ymin
; /**< @brief least Y value */
95 int ymax
; /**< @brief greatest Y value */
98 /** @brief One item in the popup menu */
99 struct choose_menuitem
{
101 const char *name
; /**< @brief name */
104 void (*activate
)(GtkMenuItem
*menuitem
, gpointer user_data
);
105 /**< @brief Called to activate the menu item.
107 * @p user_data is the choosenode the mouse pointer is over. */
109 gboolean (*sensitive
)(struct choosenode
*cn
);
110 /* @brief Called to determine whether the menu item should be sensitive.
115 gulong handlerid
; /**< @brief signal handler ID */
116 GtkWidget
*w
; /**< @brief menu item widget */
121 static GtkWidget
*chooselayout
;
122 static GtkAdjustment
*vadjust
;
123 static GtkWidget
*searchentry
; /**< @brief search terms */
124 static GtkWidget
*nextsearch
; /**< @brief next search result */
125 static GtkWidget
*prevsearch
; /**< @brief previous search result */
126 static struct choosenode
*root
;
127 static GtkWidget
*track_menu
; /**< @brief track popup menu */
128 static GtkWidget
*dir_menu
; /**< @brief directory popup menu */
129 static struct choosenode
*last_click
; /**< @brief last clicked node for selection */
130 static int files_visible
; /**< @brief total files visible */
131 static int files_selected
; /**< @brief total files selected */
132 static int gets_in_flight
; /**< @brief total gets in flight */
133 static int search_in_flight
; /**< @brief a search is underway */
134 static int search_obsolete
; /**< @brief the current search is void */
135 static char **searchresults
; /**< @brief search results */
136 static int nsearchresults
; /**< @brief number of results */
137 static int nsearchvisible
; /**< @brief number of search results visible */
138 static struct hash
*searchhash
; /**< @brief hash of search results */
139 static struct progress_window
*spw
; /**< @brief progress window */
140 static struct choosenode
**searchnodes
; /**< @brief choosenodes of search results */
142 /* Forward Declarations */
144 static void clear_children(struct choosenode
*cn
);
145 static struct choosenode
*newnode(struct choosenode
*parent
,
150 void (*fill
)(struct choosenode
*));
151 static void fill_root_node(struct choosenode
*cn
);
152 static void fill_directory_node(struct choosenode
*cn
);
153 static void got_files(void *v
, int nvec
, char **vec
);
154 static void got_resolved_file(void *v
, const char *track
);
155 static void got_dirs(void *v
, int nvec
, char **vec
);
157 static void expand_node(struct choosenode
*cn
, int contingent
);
158 static void contract_node(struct choosenode
*cn
);
159 static void updated_node(struct choosenode
*cn
, int redisplay
);
161 static void display_selection(struct choosenode
*cn
);
162 static void clear_selection(struct choosenode
*cn
);
164 static void redisplay_tree(void);
165 static struct displaydata
display_tree(struct choosenode
*cn
, int x
, int y
);
166 static void undisplay_tree(struct choosenode
*cn
);
167 static void initiate_search(void);
168 static void delete_widgets(struct choosenode
*cn
);
169 static void expand_from(struct choosenode
*cn
);
170 static struct choosenode
*first_search_result(struct choosenode
*cn
);
172 static void clicked_choosenode(GtkWidget
attribute((unused
)) *widget
,
173 GdkEventButton
*event
,
176 static void activate_track_play(GtkMenuItem
*menuitem
, gpointer user_data
);
177 static void activate_track_properties(GtkMenuItem
*menuitem
, gpointer user_data
);
179 static gboolean
sensitive_track_play(struct choosenode
*cn
);
180 static gboolean
sensitive_track_properties(struct choosenode
*cn
);
182 static void activate_dir_play(GtkMenuItem
*menuitem
, gpointer user_data
);
183 static void activate_dir_properties(GtkMenuItem
*menuitem
, gpointer user_data
);
184 static void activate_dir_select(GtkMenuItem
*menuitem
, gpointer user_data
);
186 static gboolean
sensitive_dir_play(struct choosenode
*cn
);
187 static gboolean
sensitive_dir_properties(struct choosenode
*cn
);
188 static gboolean
sensitive_dir_select(struct choosenode
*cn
);
190 /** @brief Track menu items */
191 static struct choose_menuitem track_menuitems
[] = {
192 { "Play track", activate_track_play
, sensitive_track_play
, 0, 0 },
193 { "Track properties", activate_track_properties
, sensitive_track_properties
, 0, 0 },
197 /** @brief Directory menu items */
198 static struct choose_menuitem dir_menuitems
[] = {
199 { "Play all tracks", activate_dir_play
, sensitive_dir_play
, 0, 0 },
200 { "Track properties", activate_dir_properties
, sensitive_dir_properties
, 0, 0 },
201 { "Select all tracks", activate_dir_select
, sensitive_dir_select
, 0, 0 },
205 /* Maintaining the data structure ------------------------------------------ */
207 static char *cnflags(const struct choosenode
*cn
) {
208 unsigned f
= cn
->flags
, n
;
211 static const char *bits
[] = {
221 #define NBITS (sizeof bits / sizeof *bits)
225 dynstr_append(d
, '0');
227 for(n
= 0; n
< NBITS
; ++n
) {
228 const unsigned bit
= 1 << n
;
231 dynstr_append(d
, '|');
232 dynstr_append_string(d
, bits
[n
]);
239 dynstr_append(d
, '|');
240 sprintf(buf
, "%#x", f
);
241 dynstr_append_string(d
, buf
);
248 /** @brief Create a new node */
249 static struct choosenode
*newnode(struct choosenode
*parent
,
254 void (*fill
)(struct choosenode
*)) {
255 struct choosenode
*const n
= xmalloc(sizeof *n
);
257 D(("newnode %s %s", path
, display
));
258 if(flags
& CN_EXPANDABLE
)
264 n
->display
= display
;
267 nodevector_init(&n
->children
);
270 nodevector_append(&parent
->children
, n
);
274 /** @brief Called when a node has been filled
276 * Response for calling @c whenfilled.
278 static void filled(struct choosenode
*cn
) {
279 when_filled_callback
*const whenfilled
= cn
->whenfilled
;
283 whenfilled(cn
, cn
->wfu
);
285 if(nsearchvisible
< nsearchresults
) {
286 /* There is still search expansion work to do */
287 D(("filled %s %d/%d", cn
->path
, nsearchvisible
, nsearchresults
));
290 if(gets_in_flight
== 0 && nsearchvisible
< nsearchresults
)
294 /** @brief Fill the root */
295 static void fill_root_node(struct choosenode
*cn
) {
296 struct callbackdata
*cbd
;
298 D(("fill_root_node"));
300 /* More de-duping possible here */
301 if(cn
->flags
& CN_GETTING_ANY
)
303 gtk_label_set_text(GTK_LABEL(report_label
), "getting files");
304 cbd
= xmalloc(sizeof *cbd
);
305 cbd
->u
.choosenode
= cn
;
306 disorder_eclient_dirs(client
, got_dirs
, "", 0, cbd
);
307 cbd
= xmalloc(sizeof *cbd
);
308 cbd
->u
.choosenode
= cn
;
309 disorder_eclient_files(client
, got_files
, "", 0, cbd
);
310 cn
->flags
|= CN_GETTING_FILES
|CN_GETTING_DIRS
;
314 /** @brief Delete all the widgets owned by @p cn */
315 static void delete_cn_widgets(struct choosenode
*cn
) {
318 gtk_widget_destroy(cn
->arrow
);
323 gtk_widget_destroy(cn
->label
);
328 gtk_widget_destroy(cn
->marker
);
333 gtk_widget_destroy(cn
->hbox
);
338 gtk_widget_destroy(cn
->container
);
343 /** @brief Recursively clear all the children of @p cn
345 * All the widgets at or below @p cn are deleted. All choosenodes below
346 * it are emptied. i.e. we prune the tree at @p cn.
348 static void clear_children(struct choosenode
*cn
) {
351 D(("clear_children %s", cn
->path
));
352 /* Recursively clear subtrees */
353 for(n
= 0; n
< cn
->children
.nvec
; ++n
) {
354 clear_children(cn
->children
.vec
[n
]);
355 delete_cn_widgets(cn
->children
.vec
[n
]);
357 cn
->children
.nvec
= 0;
360 /** @brief Called with a list of files just below some node */
361 static void got_files(void *v
, int nvec
, char **vec
) {
362 struct callbackdata
*cbd
= v
;
363 struct choosenode
*cn
= cbd
->u
.choosenode
;
366 D(("got_files %d files for %s %s", nvec
, cn
->path
, cnflags(cn
)));
367 /* Complicated by the need to resolve aliases. We can save a bit of effort
368 * by re-using cbd though. */
369 cn
->flags
&= ~CN_GETTING_FILES
;
371 if((cn
->pending
= nvec
)) {
372 cn
->flags
|= CN_RESOLVING_FILES
;
373 for(n
= 0; n
< nvec
; ++n
) {
374 disorder_eclient_resolve(client
, got_resolved_file
, vec
[n
], cbd
);
378 /* If there are no files and the directories are all read by now, we're
380 if(!(cn
->flags
& CN_GETTING_ANY
))
384 /** @brief Called with an alias resolved filename */
385 static void got_resolved_file(void *v
, const char *track
) {
386 struct callbackdata
*cbd
= v
;
387 struct choosenode
*cn
= cbd
->u
.choosenode
, *file_cn
;
389 D(("resolved %s %s %d left", cn
->path
, cnflags(cn
), cn
->pending
- 1));
391 file_cn
= newnode(cn
, track
,
392 trackname_transform("track", track
, "display"),
393 trackname_transform("track", track
, "sort"),
394 0/*flags*/, 0/*fill*/);
396 /* Only bother updating when we've got the lot */
397 if(--cn
->pending
== 0) {
398 cn
->flags
&= ~CN_RESOLVING_FILES
;
400 if(!(cn
->flags
& CN_GETTING_ANY
))
405 /** @brief Called with a list of directories just below some node */
406 static void got_dirs(void *v
, int nvec
, char **vec
) {
407 struct callbackdata
*cbd
= v
;
408 struct choosenode
*cn
= cbd
->u
.choosenode
;
411 D(("got_dirs %d dirs for %s %s", nvec
, cn
->path
, cnflags(cn
)));
412 /* TODO this depends on local configuration for trackname_transform().
413 * This will work, since the defaults are now built-in, but it'll be
414 * (potentially) different to the server's configured settings.
416 * Really we want a variant of files/dirs that produces both the
417 * raw filename and the transformed name for a chosen context.
420 for(n
= 0; n
< nvec
; ++n
)
422 trackname_transform("dir", vec
[n
], "display"),
423 trackname_transform("dir", vec
[n
], "sort"),
424 CN_EXPANDABLE
, fill_directory_node
);
426 cn
->flags
&= ~CN_GETTING_DIRS
;
427 if(!(cn
->flags
& CN_GETTING_ANY
))
431 /** @brief Fill a child node */
432 static void fill_directory_node(struct choosenode
*cn
) {
433 struct callbackdata
*cbd
;
435 D(("fill_directory_node %s", cn
->path
));
437 if(cn
->flags
& CN_GETTING_ANY
)
439 assert(report_label
!= 0);
440 gtk_label_set_text(GTK_LABEL(report_label
), "getting files");
442 cbd
= xmalloc(sizeof *cbd
);
443 cbd
->u
.choosenode
= cn
;
444 disorder_eclient_dirs(client
, got_dirs
, cn
->path
, 0, cbd
);
445 cbd
= xmalloc(sizeof *cbd
);
446 cbd
->u
.choosenode
= cn
;
447 disorder_eclient_files(client
, got_files
, cn
->path
, 0, cbd
);
448 cn
->flags
|= CN_GETTING_FILES
|CN_GETTING_DIRS
;
452 /** @brief Expand a node */
453 static void expand_node(struct choosenode
*cn
, int contingent
) {
454 D(("expand_node %s %d %s", cn
->path
, contingent
, cnflags(cn
)));
455 assert(cn
->flags
& CN_EXPANDABLE
);
456 /* If node is already expanded do nothing. */
457 if(cn
->flags
& CN_EXPANDED
) return;
458 /* We mark the node as expanded and request that it fill itself. When it has
459 * completed it will called updated_node() and we can redraw at that
461 cn
->flags
|= CN_EXPANDED
;
463 cn
->flags
|= CN_CONTINGENT
;
465 cn
->flags
&= ~CN_CONTINGENT
;
466 /* If this node is not contingently expanded, mark all its parents back to
467 * the root as not contingent either, so they won't be contracted when the
468 * search results change */
470 struct choosenode
*cnp
;
472 for(cnp
= cn
->parent
; cnp
; cnp
= cnp
->parent
)
473 cnp
->flags
&= ~CN_CONTINGENT
;
475 /* TODO: visual feedback */
479 /** @brief Make sure all the search results below @p cn are expanded
480 * @param cn Node to start at
482 static void expand_from(struct choosenode
*cn
) {
485 if(nsearchvisible
== nsearchresults
)
488 /* Are any of the search tracks at/below this point? */
489 if(!(cn
== root
|| hash_find(searchhash
, cn
->path
)))
491 D(("expand_from %d/%d visible %s",
492 nsearchvisible
, nsearchresults
, cn
->path
));
493 if(cn
->flags
& CN_EXPANDABLE
) {
494 if(cn
->flags
& CN_EXPANDED
)
495 /* This node is marked as expanded already. children.nvec might be 0,
496 * indicating that expansion is still underway. We should get another
497 * callback when it is expanded. */
498 for(n
= 0; n
< cn
->children
.nvec
&& gets_in_flight
< 10; ++n
)
499 expand_from(cn
->children
.vec
[n
]);
501 /* This node is not expanded yet */
505 /* This is an actual search result */
507 progress_window_progress(spw
, nsearchvisible
, nsearchresults
);
508 if(nsearchvisible
== nsearchresults
) {
509 /* We've got the lot. We make sure the first result is visible. */
510 cn
= first_search_result(root
);
511 gtk_adjustment_clamp_page(vadjust
, cn
->ymin
, cn
->ymax
);
516 /** @brief Contract all contingently expanded nodes below @p cn */
517 static void contract_contingent(struct choosenode
*cn
) {
520 if(cn
->flags
& CN_CONTINGENT
)
523 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
524 contract_contingent(cn
->children
.vec
[n
]);
527 /** @brief Contract a node */
528 static void contract_node(struct choosenode
*cn
) {
529 D(("contract_node %s", cn
->path
));
530 assert(cn
->flags
& CN_EXPANDABLE
);
531 /* If node is already contracted do nothing. */
532 if(!(cn
->flags
& CN_EXPANDED
)) return;
533 cn
->flags
&= ~(CN_EXPANDED
|CN_CONTINGENT
);
534 /* Clear selection below this node */
536 /* Zot children. We never used to do this but the result would be that over
537 * time you'd end up with the entire tree pulled into memory. If the server
538 * is over a slow network it will make interactivity slightly worse; if
539 * anyone complains we can make it an option. */
541 /* We can contract a node immediately. */
545 /** @brief qsort() callback for ordering choosenodes */
546 static int compare_choosenode(const void *av
, const void *bv
) {
547 const struct choosenode
*const *aa
= av
, *const *bb
= bv
;
548 const struct choosenode
*a
= *aa
, *b
= *bb
;
550 return compare_tracks(a
->sort
, b
->sort
,
551 a
->display
, b
->display
,
555 /** @brief Called when an expandable node is updated. */
556 static void updated_node(struct choosenode
*cn
, int redisplay
) {
557 D(("updated_node %s", cn
->path
));
558 assert(cn
->flags
& CN_EXPANDABLE
);
559 /* It might be that the node has been de-expanded since we requested the
560 * update. In that case we ignore this notification. */
561 if(!(cn
->flags
& CN_EXPANDED
)) return;
563 qsort(cn
->children
.vec
, cn
->children
.nvec
, sizeof (struct choosenode
*),
569 /* Searching --------------------------------------------------------------- */
571 /** @brief Return true if @p track is a search result
573 * In particular the return value is one more than the index of the track
576 static int is_search_result(const char *track
) {
579 if(searchhash
&& (r
= hash_find(searchhash
, track
)))
580 return 1 + *(int *)r
;
585 /** @brief Return the first search result at or below @p cn */
586 static struct choosenode
*first_search_result(struct choosenode
*cn
) {
588 struct choosenode
*r
;
590 if(cn
->flags
& CN_EXPANDABLE
) {
591 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
592 if((r
= first_search_result(cn
->children
.vec
[n
])))
594 } else if(is_search_result(cn
->path
))
599 /** @brief Called with a list of search results
601 * This is called from eclient with a (possibly empty) list of search results,
602 * and also from initiate_seatch with an always empty list to indicate that
603 * we're not searching for anything in particular. */
604 static void search_completed(void attribute((unused
)) *v
,
605 int nvec
, char **vec
) {
609 search_in_flight
= 0;
610 /* Contract any choosenodes that were only expanded to show search
612 contract_contingent(root
);
613 if(search_obsolete
) {
614 /* This search has been obsoleted by user input since it started.
615 * Therefore we throw away the result and search again. */
619 /* Stash the search results */
621 nsearchresults
= nvec
;
623 /* Create a new search hash for fast identification of results */
624 searchhash
= hash_new(sizeof(int));
625 for(n
= 0; n
< nvec
; ++n
) {
626 int *const ip
= xmalloc(sizeof (int *));
627 static const int minus_1
= -1;
629 /* The filename itself lives in the hash */
630 hash_add(searchhash
, vec
[n
], ip
, HASH_INSERT_OR_REPLACE
);
631 /* So do its ancestor directories */
632 for(s
= vec
[n
] + 1; *s
; ++s
) {
635 hash_add(searchhash
, vec
[n
], &minus_1
, HASH_INSERT_OR_REPLACE
);
640 /* We don't yet know that the results are visible */
643 progress_window_progress(spw
, 0, 0);
646 if(nsearchresults
> 50)
647 spw
= progress_window_new("Fetching search results");
648 /* Initiate expansion */
650 /* The search results buttons are usable */
651 gtk_widget_set_sensitive(nextsearch
, 1);
652 gtk_widget_set_sensitive(prevsearch
, 1);
654 searchhash
= 0; /* for the gc */
655 redisplay_tree(); /* remove search markers */
656 /* The search results buttons are not usable */
657 gtk_widget_set_sensitive(nextsearch
, 0);
658 gtk_widget_set_sensitive(prevsearch
, 0);
663 /** @brief Initiate a search
665 * If a search is underway we set @ref search_obsolete and restart the search
666 * in search_completed() above.
668 static void initiate_search(void) {
671 /* Find out what the user is after */
672 terms
= xstrdup(gtk_entry_get_text(GTK_ENTRY(searchentry
)));
673 /* Strip leading and trailing space */
674 while(*terms
== ' ') ++terms
;
675 e
= terms
+ strlen(terms
);
676 while(e
> terms
&& e
[-1] == ' ') --e
;
678 /* If a search is already underway then mark it as obsolete. We'll revisit
679 * when it returns. */
680 if(search_in_flight
) {
685 /* There's still something left. Initiate the search. */
686 if(disorder_eclient_search(client
, search_completed
, terms
, 0)) {
687 /* The search terms are bad! We treat this as if there were no search
688 * terms at all. Some kind of feedback would be handy. */
689 fprintf(stderr
, "bad terms [%s]\n", terms
); /* TODO */
690 search_completed(0, 0, 0);
692 search_in_flight
= 1;
695 /* No search terms - we want to see all tracks */
696 search_completed(0, 0, 0);
700 /** @brief Called when the cancel search button is clicked */
701 static void clearsearch_clicked(GtkButton
attribute((unused
)) *button
,
702 gpointer
attribute((unused
)) userdata
) {
703 gtk_entry_set_text(GTK_ENTRY(searchentry
), "");
706 /** @brief Called when the 'next search result' button is clicked */
707 static void next_clicked(GtkButton
attribute((unused
)) *button
,
708 gpointer
attribute((unused
)) userdata
) {
709 /* We want to find the highest (lowest ymax) track that is below the current
712 const gdouble bottom
= gtk_adjustment_get_value(vadjust
) + vadjust
->page_size
;
713 const struct choosenode
*candidate
= 0;
715 for(n
= 0; n
< nsearchresults
; ++n
) {
716 const struct choosenode
*const cn
= searchnodes
[n
];
721 || cn
->ymax
< candidate
->ymax
))
725 gtk_adjustment_clamp_page(vadjust
, candidate
->ymin
, candidate
->ymax
);
728 /** @brief Called when the 'previous search result' button is clicked */
729 static void prev_clicked(GtkButton
attribute((unused
)) *button
,
730 gpointer
attribute((unused
)) userdata
) {
731 /* We want to find the lowest (greated ymax) track that is above the current
734 const gdouble top
= gtk_adjustment_get_value(vadjust
);
735 const struct choosenode
*candidate
= 0;
737 for(n
= 0; n
< nsearchresults
; ++n
) {
738 const struct choosenode
*const cn
= searchnodes
[n
];
743 || cn
->ymax
> candidate
->ymax
))
747 gtk_adjustment_clamp_page(vadjust
, candidate
->ymin
, candidate
->ymax
);
750 /* Display functions ------------------------------------------------------- */
752 /** @brief Delete all the widgets in the tree */
753 static void delete_widgets(struct choosenode
*cn
) {
756 delete_cn_widgets(cn
);
757 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
758 delete_widgets(cn
->children
.vec
[n
]);
759 cn
->flags
&= ~(CN_DISPLAYED
|CN_SELECTED
);
763 /** @brief Update the display */
764 static void redisplay_tree(void) {
765 struct displaydata d
;
766 guint oldwidth
, oldheight
;
768 D(("redisplay_tree"));
769 /* We'll count these up empirically each time */
772 /* Correct the layout and find out how much space it uses */
773 MTAG_PUSH("display_tree");
774 searchnodes
= nsearchresults ?
xcalloc(nsearchresults
,
775 sizeof (struct choosenode
*)) : 0;
776 d
= display_tree(root
, 0, 0);
778 /* We must set the total size or scrolling will not work (it wouldn't be hard
779 * for GtkLayout to figure it out for itself but presumably you're supposed
780 * to be able to have widgets off the edge of the layuot.)
782 * There is a problem: if we shrink the size then the part of the screen that
783 * is outside the new size but inside the old one is not updated. I think
784 * this is arguably bug in GTK+ but it's easy to force a redraw if this
785 * region is nonempty.
787 gtk_layout_get_size(GTK_LAYOUT(chooselayout
), &oldwidth
, &oldheight
);
788 if(oldwidth
> d
.width
|| oldheight
> d
.height
)
789 gtk_widget_queue_draw(chooselayout
);
790 gtk_layout_set_size(GTK_LAYOUT(chooselayout
), d
.width
, d
.height
);
791 /* Notify the main menu of any recent changes */
795 /** @brief Recursive step for redisplay_tree()
796 * @param cn Node to display
797 * @param x X coordinate for @p cn
798 * @param y Y coordinate for @p cn
800 * Makes sure all displayed widgets from CN down exist and are in their proper
801 * place and return the maximum space used.
803 static struct displaydata
display_tree(struct choosenode
*cn
, int x
, int y
) {
806 struct displaydata d
, cd
;
809 const int search_result
= is_search_result(cn
->path
);
811 D(("display_tree %s %d,%d", cn
->path
, x
, y
));
813 /* An expandable item contains an arrow and a text label. When you press the
814 * button it flips its expand state.
816 * A non-expandable item has just a text label and no arrow.
819 MTAG_PUSH("make_widgets_1");
820 /* Widgets need to be created */
822 cn
->hbox
= gtk_hbox_new(FALSE
, 1);
823 if(cn
->flags
& CN_EXPANDABLE
) {
825 cn
->arrow
= gtk_arrow_new(cn
->flags
& CN_EXPANDED ? GTK_ARROW_DOWN
831 if((pb
= find_image("notes.png"))) {
833 cn
->marker
= gtk_image_new_from_pixbuf(pb
);
837 MTAG_PUSH("make_widgets_2");
839 cn
->label
= gtk_label_new(cn
->display
);
841 gtk_container_add(GTK_CONTAINER(cn
->hbox
), cn
->arrow
);
842 gtk_container_add(GTK_CONTAINER(cn
->hbox
), cn
->label
);
844 gtk_container_add(GTK_CONTAINER(cn
->hbox
), cn
->marker
);
846 MTAG_PUSH("make_widgets_3");
848 cn
->container
= gtk_event_box_new();
849 gtk_container_add(GTK_CONTAINER(cn
->container
), cn
->hbox
);
850 g_signal_connect(cn
->container
, "button-release-event",
851 G_CALLBACK(clicked_choosenode
), cn
);
852 g_signal_connect(cn
->container
, "button-press-event",
853 G_CALLBACK(clicked_choosenode
), cn
);
854 g_object_ref(cn
->container
);
855 /* Show everything by default */
856 gtk_widget_show_all(cn
->container
);
859 assert(cn
->container
);
860 /* Make sure the widget name is right */
861 name
= (cn
->flags
& CN_EXPANDABLE
863 : search_result ?
"choose-search" : "choose");
864 gtk_widget_set_name(cn
->label
, name
);
865 gtk_widget_set_name(cn
->container
, name
);
866 /* Make sure the icon is right */
867 if(cn
->flags
& CN_EXPANDABLE
)
868 gtk_arrow_set(GTK_ARROW(cn
->arrow
),
869 cn
->flags
& CN_EXPANDED ? GTK_ARROW_DOWN
: GTK_ARROW_RIGHT
,
872 /* Make sure the queued marker is right */
873 /* TODO: doesn't always work */
874 (queued(cn
->path
) ? gtk_widget_show
: gtk_widget_hide
)(cn
->marker
);
875 /* Put the widget in the right place */
876 if(cn
->flags
& CN_DISPLAYED
)
877 gtk_layout_move(GTK_LAYOUT(chooselayout
), cn
->container
, x
, y
);
879 gtk_layout_put(GTK_LAYOUT(chooselayout
), cn
->container
, x
, y
);
880 cn
->flags
|= CN_DISPLAYED
;
881 /* Now chooselayout has a ref to the container */
882 g_object_unref(cn
->container
);
884 /* Set the widget's selection status */
885 if(!(cn
->flags
& CN_EXPANDABLE
))
886 display_selection(cn
);
887 /* Find the size used so we can get vertical positioning right. */
888 gtk_widget_size_request(cn
->container
, &req
);
889 d
.width
= x
+ req
.width
;
890 d
.height
= y
+ req
.height
;
893 if(cn
->flags
& CN_EXPANDED
) {
894 /* We'll offset children by the size of the arrow whatever it might be. */
896 gtk_widget_size_request(cn
->arrow
, &req
);
898 for(n
= 0; n
< cn
->children
.nvec
; ++n
) {
899 cd
= display_tree(cn
->children
.vec
[n
], x
+ aw
, d
.height
);
900 if(cd
.width
> d
.width
)
902 d
.height
= cd
.height
;
905 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
906 undisplay_tree(cn
->children
.vec
[n
]);
908 if(!(cn
->flags
& CN_EXPANDABLE
)) {
910 if(cn
->flags
& CN_SELECTED
)
913 /* update the search results array */
915 searchnodes
[search_result
- 1] = cn
;
916 /* report back how much space we used */
917 D(("display_tree %s %d,%d total size %dx%d", cn
->path
, x
, y
,
922 /** @brief Remove widgets for newly hidden nodes */
923 static void undisplay_tree(struct choosenode
*cn
) {
926 D(("undisplay_tree %s", cn
->path
));
927 /* Remove this widget from the display */
928 if(cn
->flags
& CN_DISPLAYED
) {
929 gtk_container_remove(GTK_CONTAINER(chooselayout
), cn
->container
);
930 cn
->flags
^= CN_DISPLAYED
;
932 /* Remove children too */
933 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
934 undisplay_tree(cn
->children
.vec
[n
]);
937 /* Selection --------------------------------------------------------------- */
939 /** @brief Mark the widget @p cn according to its selection state */
940 static void display_selection(struct choosenode
*cn
) {
941 /* Need foreground and background colors */
942 gtk_widget_set_state(cn
->label
, (cn
->flags
& CN_SELECTED
943 ? GTK_STATE_SELECTED
: GTK_STATE_NORMAL
));
944 gtk_widget_set_state(cn
->container
, (cn
->flags
& CN_SELECTED
945 ? GTK_STATE_SELECTED
: GTK_STATE_NORMAL
));
948 /** @brief Set the selection state of a widget
950 * Directories can never be selected, we just ignore attempts to do so. */
951 static void set_selection(struct choosenode
*cn
, int selected
) {
952 unsigned f
= selected ? CN_SELECTED
: 0;
954 D(("set_selection %d %s", selected
, cn
->path
));
955 if(!(cn
->flags
& CN_EXPANDABLE
) && (cn
->flags
& CN_SELECTED
) != f
) {
956 cn
->flags
^= CN_SELECTED
;
957 /* Maintain selection count */
962 display_selection(cn
);
963 /* Update main menu sensitivity */
968 /** @brief Recursively clear all selection bits from CN down */
969 static void clear_selection(struct choosenode
*cn
) {
972 set_selection(cn
, 0);
973 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
974 clear_selection(cn
->children
.vec
[n
]);
977 /* User actions ------------------------------------------------------------ */
979 /** @brief Clicked on something
981 * This implements playing, all the modifiers for selection, etc.
983 static void clicked_choosenode(GtkWidget
attribute((unused
)) *widget
,
984 GdkEventButton
*event
,
985 gpointer user_data
) {
986 struct choosenode
*cn
= user_data
;
987 int ind
, last_ind
, n
;
989 D(("clicked_choosenode %s", cn
->path
));
990 if(event
->type
== GDK_BUTTON_RELEASE
991 && event
->button
== 1) {
993 if(cn
->flags
& CN_EXPANDABLE
) {
994 /* This is a directory. Flip its expansion status. */
995 if(cn
->flags
& CN_EXPANDED
)
998 expand_node(cn
, 0/*!contingent*/);
1001 /* This is a file. Adjust selection status */
1002 /* TODO the basic logic here is essentially the same as that in queue.c.
1003 * Can we share code at all? */
1004 switch(event
->state
& (GDK_SHIFT_MASK
|GDK_CONTROL_MASK
)) {
1006 clear_selection(root
);
1007 set_selection(cn
, 1);
1010 case GDK_CONTROL_MASK
:
1011 set_selection(cn
, !(cn
->flags
& CN_SELECTED
));
1014 case GDK_SHIFT_MASK
:
1015 case GDK_SHIFT_MASK
|GDK_CONTROL_MASK
:
1016 if(last_click
&& last_click
->parent
== cn
->parent
) {
1017 /* Figure out where the current and last clicks are in the list */
1018 ind
= last_ind
= -1;
1019 for(n
= 0; n
< cn
->parent
->children
.nvec
; ++n
) {
1020 if(cn
->parent
->children
.vec
[n
] == cn
)
1022 if(cn
->parent
->children
.vec
[n
] == last_click
)
1025 /* Test shouldn't ever fail, but still */
1026 if(ind
>= 0 && last_ind
>= 0) {
1027 if(!(event
->state
& GDK_CONTROL_MASK
)) {
1028 for(n
= 0; n
< cn
->parent
->children
.nvec
; ++n
)
1029 set_selection(cn
->parent
->children
.vec
[n
], 0);
1032 for(n
= last_ind
; n
<= ind
; ++n
)
1033 set_selection(cn
->parent
->children
.vec
[n
], 1);
1035 for(n
= ind
; n
<= last_ind
; ++n
)
1036 set_selection(cn
->parent
->children
.vec
[n
], 1);
1037 if(event
->state
& GDK_CONTROL_MASK
)
1041 /* TODO trying to select a range that doesn't share a single parent
1042 * currently does not work, but it ought to. */
1046 } else if(event
->type
== GDK_BUTTON_RELEASE
1047 && event
->button
== 2) {
1048 /* Middle click - play the pointed track */
1049 if(!(cn
->flags
& CN_EXPANDABLE
)) {
1050 clear_selection(root
);
1051 set_selection(cn
, 1);
1052 gtk_label_set_text(GTK_LABEL(report_label
), "adding track to queue");
1053 disorder_eclient_play(client
, cn
->path
, 0, 0);
1056 } else if(event
->type
== GDK_BUTTON_PRESS
1057 && event
->button
== 3) {
1058 struct choose_menuitem
*const menuitems
=
1059 (cn
->flags
& CN_EXPANDABLE ? dir_menuitems
: track_menuitems
);
1060 GtkWidget
*const menu
=
1061 (cn
->flags
& CN_EXPANDABLE ? dir_menu
: track_menu
);
1062 /* Right click. Pop up a menu. */
1063 /* If the current file isn't selected, switch the selection to just that.
1064 * (If we're looking at a directory then leave the selection alone.) */
1065 if(!(cn
->flags
& CN_EXPANDABLE
) && !(cn
->flags
& CN_SELECTED
)) {
1066 clear_selection(root
);
1067 set_selection(cn
, 1);
1070 /* Set the item sensitivity and callbacks */
1071 for(n
= 0; menuitems
[n
].name
; ++n
) {
1072 if(menuitems
[n
].handlerid
)
1073 g_signal_handler_disconnect(menuitems
[n
].w
,
1074 menuitems
[n
].handlerid
);
1075 gtk_widget_set_sensitive(menuitems
[n
].w
,
1076 menuitems
[n
].sensitive(cn
));
1077 menuitems
[n
].handlerid
= g_signal_connect
1078 (menuitems
[n
].w
, "activate", G_CALLBACK(menuitems
[n
].activate
), cn
);
1080 /* Pop up the menu */
1081 gtk_widget_show_all(menu
);
1082 gtk_menu_popup(GTK_MENU(menu
), 0, 0, 0, 0,
1083 event
->button
, event
->time
);
1087 /** @brief Called BY GTK+ to tell us the search entry box has changed */
1088 static void searchentry_changed(GtkEditable
attribute((unused
)) *editable
,
1089 gpointer
attribute((unused
)) user_data
) {
1093 /* Track menu items -------------------------------------------------------- */
1095 /** @brief Recursive step for gather_selected() */
1096 static void recurse_selected(struct choosenode
*cn
, struct vector
*v
) {
1099 if(cn
->flags
& CN_EXPANDABLE
) {
1100 if(cn
->flags
& CN_EXPANDED
)
1101 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
1102 recurse_selected(cn
->children
.vec
[n
], v
);
1104 if((cn
->flags
& CN_SELECTED
) && cn
->path
)
1105 vector_append(v
, (char *)cn
->path
);
1109 /*** @brief Get a list of all the selected tracks */
1110 static const char **gather_selected(int *ntracks
) {
1114 recurse_selected(root
, &v
);
1115 vector_terminate(&v
);
1116 if(ntracks
) *ntracks
= v
.nvec
;
1117 return (const char **)v
.vec
;
1120 /** @brief Called when the track menu's play option is activated */
1121 static void activate_track_play(GtkMenuItem
attribute((unused
)) *menuitem
,
1122 gpointer
attribute((unused
)) user_data
) {
1123 const char **tracks
= gather_selected(0);
1126 gtk_label_set_text(GTK_LABEL(report_label
), "adding track to queue");
1127 for(n
= 0; tracks
[n
]; ++n
)
1128 disorder_eclient_play(client
, tracks
[n
], 0, 0);
1131 /** @brief Called when the menu's properties option is activated */
1132 static void activate_track_properties(GtkMenuItem
attribute((unused
)) *menuitem
,
1133 gpointer
attribute((unused
)) user_data
) {
1135 const char **tracks
= gather_selected(&ntracks
);
1137 properties(ntracks
, tracks
);
1140 /** @brief Determine whether the menu's play option should be sensitive */
1141 static gboolean
sensitive_track_play(struct choosenode
attribute((unused
)) *cn
) {
1142 return (!!files_selected
1143 && (disorder_eclient_state(client
) & DISORDER_CONNECTED
));
1146 /** @brief Determine whether the menu's properties option should be sensitive */
1147 static gboolean
sensitive_track_properties(struct choosenode
attribute((unused
)) *cn
) {
1148 return !!files_selected
&& (disorder_eclient_state(client
) & DISORDER_CONNECTED
);
1151 /* Directory menu items ---------------------------------------------------- */
1153 /** @brief Return the file children of @p cn
1155 * The list is terminated by a null pointer.
1157 static const char **dir_files(struct choosenode
*cn
, int *nfiles
) {
1158 const char **files
= xcalloc(cn
->children
.nvec
+ 1, sizeof (char *));
1161 for(n
= m
= 0; n
< cn
->children
.nvec
; ++n
)
1162 if(!(cn
->children
.vec
[n
]->flags
& CN_EXPANDABLE
))
1163 files
[m
++] = cn
->children
.vec
[n
]->path
;
1165 if(nfiles
) *nfiles
= m
;
1169 static void play_dir(struct choosenode
*cn
,
1170 void attribute((unused
)) *wfu
) {
1172 const char **tracks
= dir_files(cn
, &ntracks
);
1174 gtk_label_set_text(GTK_LABEL(report_label
), "adding track to queue");
1175 for(n
= 0; n
< ntracks
; ++n
)
1176 disorder_eclient_play(client
, tracks
[n
], 0, 0);
1179 static void properties_dir(struct choosenode
*cn
,
1180 void attribute((unused
)) *wfu
) {
1182 const char **tracks
= dir_files(cn
, &ntracks
);
1184 properties(ntracks
, tracks
);
1187 static void select_dir(struct choosenode
*cn
,
1188 void attribute((unused
)) *wfu
) {
1191 clear_selection(root
);
1192 for(n
= 0; n
< cn
->children
.nvec
; ++n
)
1193 set_selection(cn
->children
.vec
[n
], 1);
1196 /** @brief Ensure @p cn is expanded and then call @p callback */
1197 static void call_with_dir(struct choosenode
*cn
,
1198 when_filled_callback
*whenfilled
,
1200 if(!(cn
->flags
& CN_EXPANDABLE
))
1201 return; /* something went wrong */
1202 if(cn
->flags
& CN_EXPANDED
)
1203 /* @p cn is already open */
1204 whenfilled(cn
, wfu
);
1206 /* @p cn is not open, arrange for the callback to go off when it is
1208 cn
->whenfilled
= whenfilled
;
1210 expand_node(cn
, 0/*not contingnet upon search*/);
1214 /** @brief Called when the directory menu's play option is activated */
1215 static void activate_dir_play(GtkMenuItem
attribute((unused
)) *menuitem
,
1216 gpointer user_data
) {
1217 struct choosenode
*const cn
= (struct choosenode
*)user_data
;
1219 call_with_dir(cn
, play_dir
, 0);
1222 /** @brief Called when the directory menu's properties option is activated */
1223 static void activate_dir_properties(GtkMenuItem
attribute((unused
)) *menuitem
,
1224 gpointer user_data
) {
1225 struct choosenode
*const cn
= (struct choosenode
*)user_data
;
1227 call_with_dir(cn
, properties_dir
, 0);
1230 /** @brief Called when the directory menu's select option is activated */
1231 static void activate_dir_select(GtkMenuItem
attribute((unused
)) *menuitem
,
1232 gpointer user_data
) {
1233 struct choosenode
*const cn
= (struct choosenode
*)user_data
;
1235 call_with_dir(cn
, select_dir
, 0);
1238 /** @brief Determine whether the directory menu's play option should be sensitive */
1239 static gboolean
sensitive_dir_play(struct choosenode
attribute((unused
)) *cn
) {
1240 return !!(disorder_eclient_state(client
) & DISORDER_CONNECTED
);
1243 /** @brief Determine whether the directory menu's properties option should be sensitive */
1244 static gboolean
sensitive_dir_properties(struct choosenode
attribute((unused
)) *cn
) {
1245 return !!(disorder_eclient_state(client
) & DISORDER_CONNECTED
);
1248 /** @brief Determine whether the directory menu's select option should be sensitive */
1249 static gboolean
sensitive_dir_select(struct choosenode
attribute((unused
)) *cn
) {
1255 /* Main menu plumbing ------------------------------------------------------ */
1257 /** @brief Determine whether the edit menu's properties option should be sensitive */
1258 static int choose_properties_sensitive(GtkWidget
attribute((unused
)) *w
) {
1259 return !!files_selected
&& (disorder_eclient_state(client
) & DISORDER_CONNECTED
);
1262 /** @brief Determine whether the edit menu's select all option should be sensitive
1264 * TODO not implemented, see also choose_selectall_activate()
1266 static int choose_selectall_sensitive(GtkWidget
attribute((unused
)) *w
) {
1270 /** @brief Called when the edit menu's properties option is activated */
1271 static void choose_properties_activate(GtkWidget
attribute((unused
)) *w
) {
1272 activate_track_properties(0, 0);
1275 /** @brief Called when the edit menu's select all option is activated
1277 * TODO not implemented, see choose_selectall_sensitive() */
1278 static void choose_selectall_activate(GtkWidget
attribute((unused
)) *w
) {
1281 /** @brief Main menu callbacks for Choose screen */
1282 static const struct tabtype tabtype_choose
= {
1283 choose_properties_sensitive
,
1284 choose_selectall_sensitive
,
1285 choose_properties_activate
,
1286 choose_selectall_activate
,
1289 /* Public entry points ----------------------------------------------------- */
1291 /** @brief Create a track choice widget */
1292 GtkWidget
*choose_widget(void) {
1294 GtkWidget
*scrolled
;
1295 GtkWidget
*vbox
, *hbox
, *clearsearch
;
1298 * +--vbox-------------------------------------------------------+
1299 * | +-hbox----------------------------------------------------+ |
1300 * | | searchentry | clearsearch | |
1301 * | +---------------------------------------------------------+ |
1302 * | +-scrolled------------------------------------------------+ |
1303 * | | +-chooselayout------------------------------------++--+ | |
1304 * | | | Tree structure is manually layed out in here ||^^| | |
1309 * | | +-------------------------------------------------++--+ | |
1310 * | | +-------------------------------------------------+ | |
1312 * | | +-------------------------------------------------+ | |
1313 * | +---------------------------------------------------------+ |
1314 * +-------------------------------------------------------------+
1317 /* Text entry box for search terms */
1319 searchentry
= gtk_entry_new();
1320 g_signal_connect(searchentry
, "changed", G_CALLBACK(searchentry_changed
), 0);
1321 gtk_tooltips_set_tip(tips
, searchentry
, "Enter search terms here; search is automatic", "");
1323 /* Cancel button to clear the search */
1325 clearsearch
= gtk_button_new_from_stock(GTK_STOCK_CANCEL
);
1326 g_signal_connect(G_OBJECT(clearsearch
), "clicked",
1327 G_CALLBACK(clearsearch_clicked
), 0);
1328 gtk_tooltips_set_tip(tips
, clearsearch
, "Clear search terms", "");
1330 /* Up and down buttons to find previous/next results; initially they are not
1331 * usable as there are no search results. */
1332 prevsearch
= iconbutton("up.png", "Previous search result");
1333 g_signal_connect(G_OBJECT(prevsearch
), "clicked",
1334 G_CALLBACK(prev_clicked
), 0);
1335 gtk_widget_set_sensitive(prevsearch
, 0);
1336 nextsearch
= iconbutton("down.png", "Next search result");
1337 g_signal_connect(G_OBJECT(nextsearch
), "clicked",
1338 G_CALLBACK(next_clicked
), 0);
1339 gtk_widget_set_sensitive(nextsearch
, 0);
1341 /* hbox packs the search tools button together on a line */
1343 hbox
= gtk_hbox_new(FALSE
/*homogeneous*/, 1/*spacing*/);
1344 gtk_box_pack_start(GTK_BOX(hbox
), searchentry
,
1345 TRUE
/*expand*/, TRUE
/*fill*/, 0/*padding*/);
1346 gtk_box_pack_start(GTK_BOX(hbox
), prevsearch
,
1347 FALSE
/*expand*/, FALSE
/*fill*/, 0/*padding*/);
1348 gtk_box_pack_start(GTK_BOX(hbox
), nextsearch
,
1349 FALSE
/*expand*/, FALSE
/*fill*/, 0/*padding*/);
1350 gtk_box_pack_start(GTK_BOX(hbox
), clearsearch
,
1351 FALSE
/*expand*/, FALSE
/*fill*/, 0/*padding*/);
1353 /* chooselayout contains the currently visible subset of the track
1356 chooselayout
= gtk_layout_new(0, 0);
1357 root
= newnode(0/*parent*/, "<root>", "All files", "",
1358 CN_EXPANDABLE
, fill_root_node
);
1359 expand_node(root
, 0); /* will call redisplay_tree */
1360 /* Create the popup menus */
1362 track_menu
= gtk_menu_new();
1363 g_signal_connect(track_menu
, "destroy", G_CALLBACK(gtk_widget_destroyed
),
1365 for(n
= 0; track_menuitems
[n
].name
; ++n
) {
1367 track_menuitems
[n
].w
=
1368 gtk_menu_item_new_with_label(track_menuitems
[n
].name
);
1369 gtk_menu_attach(GTK_MENU(track_menu
), track_menuitems
[n
].w
,
1373 dir_menu
= gtk_menu_new();
1374 g_signal_connect(dir_menu
, "destroy", G_CALLBACK(gtk_widget_destroyed
),
1376 for(n
= 0; dir_menuitems
[n
].name
; ++n
) {
1378 dir_menuitems
[n
].w
=
1379 gtk_menu_item_new_with_label(dir_menuitems
[n
].name
);
1380 gtk_menu_attach(GTK_MENU(dir_menu
), dir_menuitems
[n
].w
,
1383 /* The layout is scrollable */
1384 scrolled
= scroll_widget(chooselayout
, "choose");
1385 vadjust
= gtk_layout_get_vadjustment(GTK_LAYOUT(chooselayout
));
1387 /* The scrollable layout and the search hbox go together in a vbox */
1389 vbox
= gtk_vbox_new(FALSE
/*homogenous*/, 1/*spacing*/);
1390 gtk_box_pack_start(GTK_BOX(vbox
), hbox
,
1391 FALSE
/*expand*/, FALSE
/*fill*/, 0/*padding*/);
1392 gtk_box_pack_end(GTK_BOX(vbox
), scrolled
,
1393 TRUE
/*expand*/, TRUE
/*fill*/, 0/*padding*/);
1395 g_object_set_data(G_OBJECT(vbox
), "type", (void *)&tabtype_choose
);
1399 /** @brief Called when something we care about here might have changed */
1400 void choose_update(void) {
1409 indent-tabs-mode:nil