X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~mdw/git/disorder/blobdiff_plain/6fc592ffe67215116e84a6c31a31ede189aa6c0e..b56bb147b52671fb2e4dc667e69c9ca476863367:/disobedience/choose.c diff --git a/disobedience/choose.c b/disobedience/choose.c index 7c37d44..a1d50c1 100644 --- a/disobedience/choose.c +++ b/disobedience/choose.c @@ -1,1534 +1,730 @@ /* * This file is part of DisOrder - * Copyright (C) 2006-2008 Richard Kettlewell + * Copyright (C) 2008 Richard Kettlewell * - * This program is free software; you can redistribute it and/or modify + * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or + * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * - * This program is distributed in the hope that it will be useful, but - * WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - * General Public License for more details. - * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * * You should have received a copy of the GNU General Public License - * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 - * USA + * along with this program. If not, see . */ /** @file disobedience/choose.c * @brief Hierarchical track selection and search * - * We don't use the built-in tree widgets because they require that you know - * the children of a node on demand, and we have to wait for the server to tell - * us. - */ - -#include "disobedience.h" -#include "timeval.h" - -/* Choose track ------------------------------------------------------------ */ - -#if TDEBUG -/* Timing */ -static struct { - struct timeval total; - struct timeval gtkbits; - struct timeval menuupdate; - struct timeval new_widgets; - struct timeval undisplay; - struct timeval colors; - struct timeval markers; - struct timeval location; - struct timeval selection; -} times; - -#define BEGIN(WHAT) do { \ - struct timeval started##WHAT, finished##WHAT; \ - xgettimeofday(&started##WHAT, 0) - -#define END(WHAT) \ - xgettimeofday(&finished##WHAT, 0); \ - times.WHAT = tvadd(times.WHAT, tvsub(finished##WHAT, started##WHAT)); \ -} while(0) - -#define INIT() memset(×, 0, sizeof times) - -#define REPORT() do { \ - fprintf(stderr, "total=%g\n" \ - "gtkbits=%g\n" \ - "menuupdate=%g\n" \ - "new_widgets=%g\n" \ - "undisplay=%g\n" \ - "colors=%g\n" \ - "markers=%g\n" \ - "location=%g\n" \ - "selection=%g\n" \ - "accumulation=%g\n" \ - "\n", \ - tvdouble(times.total), \ - tvdouble(times.gtkbits), \ - tvdouble(times.menuupdate), \ - tvdouble(times.new_widgets), \ - tvdouble(times.undisplay), \ - tvdouble(times.colors), \ - tvdouble(times.markers), \ - tvdouble(times.location), \ - tvdouble(times.selection), \ - (tvdouble(times.gtkbits) \ - + tvdouble(times.menuupdate) \ - + tvdouble(times.new_widgets) \ - + tvdouble(times.undisplay) \ - + tvdouble(times.colors) \ - + tvdouble(times.markers) \ - + tvdouble(times.location) \ - + tvdouble(times.selection))); \ -} while(0) -#else -#define BEGIN(WHAT) do { -#define END(WHAT) } while(0) -#define INIT() ((void)0) -#define REPORT() ((void)0) -#endif - -WT(label); -WT(event_box); -WT(menu); -WT(menu_item); -WT(layout); -WT(vbox); -WT(arrow); -WT(hbox); -WT(button); -WT(image); -WT(entry); - -/* Types */ - -struct choosenode; - -/** @brief Accumulated information about the tree widget */ -struct displaydata { - /** @brief Maximum width required */ - guint width; - /** @brief Maximum height required */ - guint height; -}; - -/* instantiate the node vector type */ - -VECTOR_TYPE(nodevector, struct choosenode *, xrealloc); - -/** @brief Signature of function called when a choosenode is filled */ -typedef void (when_filled_callback)(struct choosenode *cn, - void *wfu); - -/** @brief One node in the virtual filesystem */ -struct choosenode { - struct choosenode *parent; /**< @brief parent node */ - const char *path; /**< @brief full path or 0 */ - const char *sort; /**< @brief sort key */ - const char *display; /**< @brief display name */ - int pending; /**< @brief pending resolve queries */ - unsigned flags; -#define CN_EXPANDABLE 0x0001 /**< @brief node is expandable */ -#define CN_EXPANDED 0x0002 /**< @brief node is expanded - * - * Expandable items are directories; - * non-expandable ones are files. */ -#define CN_DISPLAYED 0x0004 /**< @brief widget is displayed in layout */ -#define CN_SELECTED 0x0008 /**< @brief node is selected */ -#define CN_GETTING_FILES 0x0010 /**< @brief files inbound */ -#define CN_RESOLVING_FILES 0x0020 /**< @brief resolved files inbound */ -#define CN_GETTING_DIRS 0x0040 /**< @brief directories inbound */ -#define CN_GETTING_ANY 0x0070 /**< @brief getting something */ -#define CN_CONTINGENT 0x0080 /**< @brief expansion contingent on search */ - struct nodevector children; /**< @brief vector of children */ - void (*fill)(struct choosenode *); /**< @brief request child fill or 0 for leaf */ - GtkWidget *container; /**< @brief the container for this row */ - GtkWidget *hbox; /**< @brief the hbox for this row */ - GtkWidget *arrow; /**< @brief arrow widget or 0 */ - GtkWidget *label; /**< @brief text label for this node */ - GtkWidget *marker; /**< @brief queued marker */ - - when_filled_callback *whenfilled; /**< @brief called when filled or 0 */ - void *wfu; /**< @brief passed to @c whenfilled */ - int ymin; /**< @brief least Y value */ - int ymax; /**< @brief greatest Y value */ -}; - -/** @brief One item in the popup menu */ -struct choose_menuitem { - /* Parameters */ - const char *name; /**< @brief name */ - - /* Callbacks */ - void (*activate)(GtkMenuItem *menuitem, gpointer user_data); - /**< @brief Called to activate the menu item. - * - * @p user_data is the choosenode the mouse pointer is over. */ - - gboolean (*sensitive)(struct choosenode *cn); - /* @brief Called to determine whether the menu item should be sensitive. - * - * TODO? */ - - /* State */ - gulong handlerid; /**< @brief signal handler ID */ - GtkWidget *w; /**< @brief menu item widget */ -}; - -/* Variables */ - -static GtkWidget *chooselayout; -static GtkAdjustment *vadjust; -static GtkWidget *searchentry; /**< @brief search terms */ -static GtkWidget *nextsearch; /**< @brief next search result */ -static GtkWidget *prevsearch; /**< @brief previous search result */ -static struct choosenode *root; -static GtkWidget *track_menu; /**< @brief track popup menu */ -static GtkWidget *dir_menu; /**< @brief directory popup menu */ -static struct choosenode *last_click; /**< @brief last clicked node for selection */ -static int files_visible; /**< @brief total files visible */ -static int files_selected; /**< @brief total files selected */ -static int gets_in_flight; /**< @brief total gets in flight */ -static int search_in_flight; /**< @brief a search is underway */ -static int search_obsolete; /**< @brief the current search is void */ -static char **searchresults; /**< @brief search results */ -static int nsearchresults; /**< @brief number of results */ -static int nsearchvisible; /**< @brief number of search results visible */ -static struct hash *searchhash; /**< @brief hash of search results */ -static struct progress_window *spw; /**< @brief progress window */ -static struct choosenode **searchnodes; /**< @brief choosenodes of search results */ -static int suppress_redisplay; /**< @brief suppress redisplay */ - -/* Forward Declarations */ - -static void clear_children(struct choosenode *cn); -static struct choosenode *newnode(struct choosenode *parent, - const char *path, - const char *display, - const char *sort, - unsigned flags, - void (*fill)(struct choosenode *)); -static void fill_root_node(struct choosenode *cn); -static void fill_directory_node(struct choosenode *cn); -static void got_files(void *v, int nvec, char **vec); -static void got_resolved_file(void *v, const char *track); -static void got_dirs(void *v, int nvec, char **vec); - -static void expand_node(struct choosenode *cn, int contingent); -static void contract_node(struct choosenode *cn); -static void updated_node(struct choosenode *cn, int redisplay, - const char *why); - -static void display_selection(struct choosenode *cn); -static void clear_selection(struct choosenode *cn); - -static void redisplay_tree(const char *why); -static struct displaydata display_tree(struct choosenode *cn, int x, int y); -static void undisplay_tree(struct choosenode *cn); -static void initiate_search(void); -static void expand_from(struct choosenode *cn); -static struct choosenode *first_search_result(struct choosenode *cn); - -static void clicked_choosenode(GtkWidget attribute((unused)) *widget, - GdkEventButton *event, - gpointer user_data); - -static void activate_track_play(GtkMenuItem *menuitem, gpointer user_data); -static void activate_track_properties(GtkMenuItem *menuitem, gpointer user_data); - -static gboolean sensitive_track_play(struct choosenode *cn); -static gboolean sensitive_track_properties(struct choosenode *cn); - -static void activate_dir_play(GtkMenuItem *menuitem, gpointer user_data); -static void activate_dir_properties(GtkMenuItem *menuitem, gpointer user_data); -static void activate_dir_select(GtkMenuItem *menuitem, gpointer user_data); - -static gboolean sensitive_dir_play(struct choosenode *cn); -static gboolean sensitive_dir_properties(struct choosenode *cn); -static gboolean sensitive_dir_select(struct choosenode *cn); - -/** @brief Track menu items */ -static struct choose_menuitem track_menuitems[] = { - { "Play track", activate_track_play, sensitive_track_play, 0, 0 }, - { "Track properties", activate_track_properties, sensitive_track_properties, 0, 0 }, - { 0, 0, 0, 0, 0 } -}; - -/** @brief Directory menu items */ -static struct choose_menuitem dir_menuitems[] = { - { "Play all tracks", activate_dir_play, sensitive_dir_play, 0, 0 }, - { "Track properties", activate_dir_properties, sensitive_dir_properties, 0, 0 }, - { "Select all tracks", activate_dir_select, sensitive_dir_select, 0, 0 }, - { 0, 0, 0, 0, 0 } -}; - -/* Maintaining the data structure ------------------------------------------ */ - -static char *cnflags(const struct choosenode *cn) { - unsigned f = cn->flags, n; - struct dynstr d[1]; - - static const char *bits[] = { - "expandable", - "expanded", - "displayed", - "selected", - "getting_files", - "resolving_files", - "getting_dirs", - "contingent" - }; -#define NBITS (sizeof bits / sizeof *bits) - - dynstr_init(d); - if(!f) - dynstr_append(d, '0'); - else { - for(n = 0; n < NBITS; ++n) { - const unsigned bit = 1 << n; - if(f & bit) { - if(d->nvec) - dynstr_append(d, '|'); - dynstr_append_string(d, bits[n]); - f ^= bit; - } - } - if(f) { - char buf[32]; - if(d->nvec) - dynstr_append(d, '|'); - sprintf(buf, "%#x", f); - dynstr_append_string(d, buf); - } - } - dynstr_terminate(d); - return d->vec; -} - -/** @brief Create a new node */ -static struct choosenode *newnode(struct choosenode *parent, - const char *path, - const char *display, - const char *sort, - unsigned flags, - void (*fill)(struct choosenode *)) { - struct choosenode *const n = xmalloc(sizeof *n); - - D(("newnode %s %s", path, display)); - if(flags & CN_EXPANDABLE) - assert(fill); - else - assert(!fill); - n->parent = parent; - n->path = path; - n->display = display; - n->sort = sort; - n->flags = flags; - nodevector_init(&n->children); - n->fill = fill; - if(parent) - nodevector_append(&parent->children, n); - return n; -} - -/** @brief Called when a node has been filled + * We now use an ordinary GtkTreeStore/GtkTreeView. * - * Response for calling @c whenfilled. - */ -static void filled(struct choosenode *cn) { - when_filled_callback *const whenfilled = cn->whenfilled; - - if(whenfilled) { - cn->whenfilled = 0; - whenfilled(cn, cn->wfu); - } - if(nsearchvisible < nsearchresults) { - /* There is still search expansion work to do */ - D(("filled %s %d/%d", cn->path, nsearchvisible, nsearchresults)); - expand_from(cn); - } - if(gets_in_flight == 0 && nsearchvisible < nsearchresults) - expand_from(root); -} - -/** @brief Fill the root */ -static void fill_root_node(struct choosenode *cn) { - struct callbackdata *cbd; - - D(("fill_root_node")); - clear_children(cn); - /* More de-duping possible here */ - if(cn->flags & CN_GETTING_ANY) - return; - gtk_label_set_text(GTK_LABEL(report_label), "getting files"); - cbd = xmalloc(sizeof *cbd); - cbd->u.choosenode = cn; - disorder_eclient_dirs(client, got_dirs, "", 0, cbd); - cbd = xmalloc(sizeof *cbd); - cbd->u.choosenode = cn; - disorder_eclient_files(client, got_files, "", 0, cbd); - cn->flags |= CN_GETTING_FILES|CN_GETTING_DIRS; - gets_in_flight += 2; -} - -/** @brief Delete all the widgets owned by @p cn */ -static void delete_cn_widgets(struct choosenode *cn) { - if(cn->arrow) { - DW(arrow); - gtk_widget_destroy(cn->arrow); - cn->arrow = 0; - } - if(cn->label) { - DW(label); - gtk_widget_destroy(cn->label); - cn->label = 0; - } - if(cn->marker) { - DW(image); - gtk_widget_destroy(cn->marker); - cn->marker = 0; - } - if(cn->hbox) { - DW(hbox); - gtk_widget_destroy(cn->hbox); - cn->hbox = 0; - } - if(cn->container) { - DW(event_box); - gtk_widget_destroy(cn->container); - cn->container = 0; - } -} - -/** @brief Recursively clear all the children of @p cn + * We don't want to pull the entire tree in memory, but we want directories to + * show up as having children. Therefore we give directories a placeholder + * child and replace their children when they are opened. Placeholders have + * TRACK_COLUMN="" and ISFILE_COLUMN=FALSE (so that they don't get check boxes, + * lengths, etc). * - * All the widgets at or below @p cn are deleted. All choosenodes below - * it are emptied. i.e. we prune the tree at @p cn. + * TODO: + * - sweep up contracted nodes, replacing their content with a placeholder */ -static void clear_children(struct choosenode *cn) { - int n; - D(("clear_children %s", cn->path)); - /* Recursively clear subtrees */ - for(n = 0; n < cn->children.nvec; ++n) { - clear_children(cn->children.vec[n]); - delete_cn_widgets(cn->children.vec[n]); +#include "disobedience.h" +#include "choose.h" +#include "multidrag.h" +#include "queue-generic.h" +#include + +/** @brief Drag types */ +const GtkTargetEntry choose_targets[] = { + { + PLAYABLE_TRACKS, /* drag type */ + GTK_TARGET_SAME_APP|GTK_TARGET_OTHER_WIDGET, /* copying between widgets */ + PLAYABLE_TRACKS_ID /* ID value */ + }, + { + .target = NULL } - cn->children.nvec = 0; -} +}; -/** @brief Called with a list of files just below some node */ -static void got_files(void *v, int nvec, char **vec) { - struct callbackdata *cbd = v; - struct choosenode *cn = cbd->u.choosenode; - int n; +/** @brief The current selection tree */ +GtkTreeStore *choose_store; - D(("got_files %d files for %s %s", nvec, cn->path, cnflags(cn))); - /* Complicated by the need to resolve aliases. We can save a bit of effort - * by re-using cbd though. */ - cn->flags &= ~CN_GETTING_FILES; - --gets_in_flight; - if((cn->pending = nvec)) { - cn->flags |= CN_RESOLVING_FILES; - for(n = 0; n < nvec; ++n) { - disorder_eclient_resolve(client, got_resolved_file, vec[n], cbd); - ++gets_in_flight; - } - } - /* If there are no files and the directories are all read by now, we're - * done */ - if(!(cn->flags & CN_GETTING_ANY)) - filled(cn); - if(!gets_in_flight) - redisplay_tree("got_files"); -} +/** @brief The view onto the selection tree */ +GtkWidget *choose_view; -/** @brief Called with an alias resolved filename */ -static void got_resolved_file(void *v, const char *track) { - struct callbackdata *cbd = v; - struct choosenode *cn = cbd->u.choosenode, *file_cn; +/** @brief The selection tree's selection */ +GtkTreeSelection *choose_selection; - D(("resolved %s %s %d left", cn->path, cnflags(cn), cn->pending - 1)); - /* TODO as below */ - file_cn = newnode(cn, track, - trackname_transform("track", track, "display"), - trackname_transform("track", track, "sort"), - 0/*flags*/, 0/*fill*/); - --gets_in_flight; - /* Only bother updating when we've got the lot */ - if(--cn->pending == 0) { - cn->flags &= ~CN_RESOLVING_FILES; - updated_node(cn, gets_in_flight == 0, "got_resolved_file"); - if(!(cn->flags & CN_GETTING_ANY)) - filled(cn); - } -} +/** @brief Count of file listing operations in flight */ +static int choose_list_in_flight; -/** @brief Called with a list of directories just below some node */ -static void got_dirs(void *v, int nvec, char **vec) { - struct callbackdata *cbd = v; - struct choosenode *cn = cbd->u.choosenode; - int n; +/** @brief If nonzero autocollapse column won't be set */ +static int choose_suppress_set_autocollapse; - D(("got_dirs %d dirs for %s %s", nvec, cn->path, cnflags(cn))); - /* TODO this depends on local configuration for trackname_transform(). - * This will work, since the defaults are now built-in, but it'll be - * (potentially) different to the server's configured settings. - * - * Really we want a variant of files/dirs that produces both the - * raw filename and the transformed name for a chosen context. - */ - --gets_in_flight; - for(n = 0; n < nvec; ++n) - newnode(cn, vec[n], - trackname_transform("dir", vec[n], "display"), - trackname_transform("dir", vec[n], "sort"), - CN_EXPANDABLE, fill_directory_node); - updated_node(cn, gets_in_flight == 0, "got_dirs"); - cn->flags &= ~CN_GETTING_DIRS; - if(!(cn->flags & CN_GETTING_ANY)) - filled(cn); +static char *choose_get_string(GtkTreeIter *iter, int column) { + gchar *gs; + gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter, + column, &gs, + -1); + char *s = xstrdup(gs); + g_free(gs); + return s; } - -/** @brief Fill a child node */ -static void fill_directory_node(struct choosenode *cn) { - struct callbackdata *cbd; - D(("fill_directory_node %s", cn->path)); - /* TODO: caching */ - if(cn->flags & CN_GETTING_ANY) - return; - assert(report_label != 0); - gtk_label_set_text(GTK_LABEL(report_label), "getting files"); - clear_children(cn); - cbd = xmalloc(sizeof *cbd); - cbd->u.choosenode = cn; - disorder_eclient_dirs(client, got_dirs, cn->path, 0, cbd); - cbd = xmalloc(sizeof *cbd); - cbd->u.choosenode = cn; - disorder_eclient_files(client, got_files, cn->path, 0, cbd); - cn->flags |= CN_GETTING_FILES|CN_GETTING_DIRS; - gets_in_flight += 2; +char *choose_get_track(GtkTreeIter *iter) { + char *s = choose_get_string(iter, TRACK_COLUMN); + return *s ? s : 0; /* Placeholder -> NULL */ } -/** @brief Expand a node */ -static void expand_node(struct choosenode *cn, int contingent) { - D(("expand_node %s %d %s", cn->path, contingent, cnflags(cn))); - assert(cn->flags & CN_EXPANDABLE); - /* If node is already expanded do nothing. */ - if(cn->flags & CN_EXPANDED) return; - /* We mark the node as expanded and request that it fill itself. When it has - * completed it will called updated_node() and we can redraw at that - * point. */ - cn->flags |= CN_EXPANDED; - if(contingent) - cn->flags |= CN_CONTINGENT; - else - cn->flags &= ~CN_CONTINGENT; - /* If this node is not contingently expanded, mark all its parents back to - * the root as not contingent either, so they won't be contracted when the - * search results change */ - if(!contingent) { - struct choosenode *cnp; - - for(cnp = cn->parent; cnp; cnp = cnp->parent) - cnp->flags &= ~CN_CONTINGENT; - } - /* TODO: visual feedback */ - cn->fill(cn); +char *choose_get_sort(GtkTreeIter *iter) { + return choose_get_string(iter, SORT_COLUMN); } -/** @brief Make sure all the search results below @p cn are expanded - * @param cn Node to start at - */ -static void expand_from(struct choosenode *cn) { - int n; - - if(nsearchvisible == nsearchresults) - /* We're done */ - return; - /* Are any of the search tracks at/below this point? */ - if(!(cn == root || hash_find(searchhash, cn->path))) - return; - D(("expand_from %d/%d visible %s", - nsearchvisible, nsearchresults, cn->path)); - if(cn->flags & CN_EXPANDABLE) { - if(cn->flags & CN_EXPANDED) - /* This node is marked as expanded already. children.nvec might be 0, - * indicating that expansion is still underway. We should get another - * callback when it is expanded. */ - for(n = 0; n < cn->children.nvec && gets_in_flight < 10; ++n) - expand_from(cn->children.vec[n]); - else { - /* This node is not expanded yet */ - expand_node(cn, 1); - } - } else { - /* This is an actual search result */ - ++nsearchvisible; - progress_window_progress(spw, nsearchvisible, nsearchresults); - if(nsearchvisible == nsearchresults) { - if(suppress_redisplay) { - suppress_redisplay = 0; - redisplay_tree("all search results visible"); - } - /* We've got the lot. We make sure the first result is visible. */ - cn = first_search_result(root); - gtk_adjustment_clamp_page(vadjust, cn->ymin, cn->ymax); - } - } +char *choose_get_display(GtkTreeIter *iter) { + return choose_get_string(iter, NAME_COLUMN); } -/** @brief Contract all contingently expanded nodes below @p cn */ -static void contract_contingent(struct choosenode *cn) { - int n; - - if(cn->flags & CN_CONTINGENT) - contract_node(cn); - else - for(n = 0; n < cn->children.nvec; ++n) - contract_contingent(cn->children.vec[n]); +int choose_is_file(GtkTreeIter *iter) { + gboolean isfile; + gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter, + ISFILE_COLUMN, &isfile, + -1); + return isfile; } -/** @brief Contract a node */ -static void contract_node(struct choosenode *cn) { - D(("contract_node %s", cn->path)); - assert(cn->flags & CN_EXPANDABLE); - /* If node is already contracted do nothing. */ - if(!(cn->flags & CN_EXPANDED)) return; - cn->flags &= ~(CN_EXPANDED|CN_CONTINGENT); - /* Clear selection below this node */ - clear_selection(cn); - /* Zot children. We never used to do this but the result would be that over - * time you'd end up with the entire tree pulled into memory. If the server - * is over a slow network it will make interactivity slightly worse; if - * anyone complains we can make it an option. */ - clear_children(cn); - /* We can contract a node immediately. */ - redisplay_tree("contract_node"); +int choose_is_dir(GtkTreeIter *iter) { + gboolean isfile; + gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter, + ISFILE_COLUMN, &isfile, + -1); + if(isfile) + return FALSE; + return !choose_is_placeholder(iter); } -/** @brief qsort() callback for ordering choosenodes */ -static int compare_choosenode(const void *av, const void *bv) { - const struct choosenode *const *aa = av, *const *bb = bv; - const struct choosenode *a = *aa, *b = *bb; - - return compare_tracks(a->sort, b->sort, - a->display, b->display, - a->path, b->path); +int choose_is_placeholder(GtkTreeIter *iter) { + return choose_get_string(iter, TRACK_COLUMN)[0] == 0; } -/** @brief Called when an expandable node is updated. */ -static void updated_node(struct choosenode *cn, int redisplay, - const char *why) { - D(("updated_node %s", cn->path)); - assert(cn->flags & CN_EXPANDABLE); - /* It might be that the node has been de-expanded since we requested the - * update. In that case we ignore this notification. */ - if(!(cn->flags & CN_EXPANDED)) return; - /* Sort children */ - qsort(cn->children.vec, cn->children.nvec, sizeof (struct choosenode *), - compare_choosenode); - if(redisplay) { - char whywhy[1024]; - - snprintf(whywhy, sizeof whywhy, "updated_node %s", why); - redisplay_tree(whywhy); - } +int choose_can_autocollapse(GtkTreeIter *iter) { + gboolean autocollapse; + gtk_tree_model_get(GTK_TREE_MODEL(choose_store), iter, + AUTOCOLLAPSE_COLUMN, &autocollapse, + -1); + return autocollapse; } -/* Searching --------------------------------------------------------------- */ - -/** @brief Return true if @p track is a search result +/** @brief Remove node @p it and all its children + * @param it Iterator, updated to point to next + * @return True if iterator remains valid * - * In particular the return value is one more than the index of the track - * @p searchresults. + * TODO is this necessary? gtk_tree_store_remove() does not document what + * happens to children. */ -static int is_search_result(const char *track) { - void *r; - - if(searchhash && (r = hash_find(searchhash, track))) - return 1 + *(int *)r; - else - return 0; +static gboolean choose_remove_node(GtkTreeIter *it) { + GtkTreeIter child[1]; + gboolean childv = gtk_tree_model_iter_children(GTK_TREE_MODEL(choose_store), + child, + it); + while(childv) + childv = choose_remove_node(child); + return gtk_tree_store_remove(choose_store, it); +} + +/** @brief Update length and state fields */ +static gboolean choose_set_state_callback(GtkTreeModel attribute((unused)) *model, + GtkTreePath attribute((unused)) *path, + GtkTreeIter *it, + gpointer attribute((unused)) data) { + if(choose_is_file(it)) { + const char *track = choose_get_track(it); + const long l = namepart_length(track); + char length[64]; + if(l > 0) + byte_snprintf(length, sizeof length, "%ld:%02ld", l / 60, l % 60); + else + length[0] = 0; + gtk_tree_store_set(choose_store, it, + LENGTH_COLUMN, length, + STATE_COLUMN, queued(track), + -1); + if(choose_is_search_result(track)) + gtk_tree_store_set(choose_store, it, + BG_COLUMN, SEARCH_RESULT_BG, + FG_COLUMN, SEARCH_RESULT_FG, + -1); + else + gtk_tree_store_set(choose_store, it, + BG_COLUMN, (char *)0, + FG_COLUMN, (char *)0, + -1); + } + return FALSE; /* continue walking */ } -/** @brief Return the first search result at or below @p cn */ -static struct choosenode *first_search_result(struct choosenode *cn) { - int n; - struct choosenode *r; - - if(cn->flags & CN_EXPANDABLE) { - for(n = 0; n < cn->children.nvec; ++n) - if((r = first_search_result(cn->children.vec[n]))) - return r; - } else if(is_search_result(cn->path)) - return cn; - return 0; +/** @brief Called when the queue or playing track change */ +static void choose_set_state(const char attribute((unused)) *event, + void attribute((unused)) *eventdata, + void attribute((unused)) *callbackdata) { + gtk_tree_model_foreach(GTK_TREE_MODEL(choose_store), + choose_set_state_callback, + NULL); } -/** @brief Called with a list of search results +/** @brief (Re-)populate a node + * @param parent_ref Node to populate or NULL to fill root + * @param nvec Number of children to add + * @param vec Children + * @param isfile 1 if children are files, 0 if directories * - * This is called from eclient with a (possibly empty) list of search results, - * and also from initiate_seatch with an always empty list to indicate that - * we're not searching for anything in particular. */ -static void search_completed(void attribute((unused)) *v, - int nvec, char **vec) { - int n; - char *s; - - search_in_flight = 0; - /* Contract any choosenodes that were only expanded to show search - * results */ - suppress_redisplay = 1; - contract_contingent(root); - suppress_redisplay = 0; - if(search_obsolete) { - /* This search has been obsoleted by user input since it started. - * Therefore we throw away the result and search again. */ - search_obsolete = 0; - initiate_search(); + * Adjusts the set of files (or directories) below @p parent_ref to match those + * listed in @p nvec and @p vec. + * + * @p parent_ref will be destroyed. + */ +static void choose_populate(GtkTreeRowReference *parent_ref, + int nvec, char **vec, + int isfile) { + const char *type = isfile ? "track" : "dir"; + //fprintf(stderr, "%d new children of type %s\n", nvec, type); + if(!nvec) + goto skip; + /* Compute parent_* */ + GtkTreeIter pit[1], *parent_it; + GtkTreePath *parent_path; + if(parent_ref) { + parent_path = gtk_tree_row_reference_get_path(parent_ref); + parent_it = pit; + gboolean pitv = gtk_tree_model_get_iter(GTK_TREE_MODEL(choose_store), + pit, parent_path); + assert(pitv); + /*fprintf(stderr, "choose_populate %s: parent path is [%s]\n", + type, + gtk_tree_path_to_string(parent_path));*/ } else { - /* Stash the search results */ - searchresults = vec; - nsearchresults = nvec; - if(nvec) { - /* Create a new search hash for fast identification of results */ - searchhash = hash_new(sizeof(int)); - for(n = 0; n < nvec; ++n) { - int *const ip = xmalloc(sizeof (int *)); - static const int minus_1 = -1; - *ip = n; - /* The filename itself lives in the hash */ - hash_add(searchhash, vec[n], ip, HASH_INSERT_OR_REPLACE); - /* So do its ancestor directories */ - for(s = vec[n] + 1; *s; ++s) { - if(*s == '/') { - *s = 0; - hash_add(searchhash, vec[n], &minus_1, HASH_INSERT_OR_REPLACE); - *s = '/'; - } - } - } - /* We don't yet know that the results are visible */ - nsearchvisible = 0; - if(spw) { - progress_window_progress(spw, 0, 0); - spw = 0; - } - if(nsearchresults > 50) - spw = progress_window_new("Fetching search results"); - /* Initiate expansion */ - expand_from(root); - /* The search results buttons are usable */ - gtk_widget_set_sensitive(nextsearch, 1); - gtk_widget_set_sensitive(prevsearch, 1); - suppress_redisplay = 1; /* avoid lots of redisplays */ + parent_path = 0; + parent_it = 0; + /*fprintf(stderr, "choose_populate %s: populating the root\n", + type);*/ + } + /* Both td[] and the current node set are sorted so we can do a single linear + * pass to insert new nodes and remove unwanted ones. The total performance + * may be worse than linear depending on the performance of GTK+'s insert and + * delete operations. */ + //fprintf(stderr, "sorting tracks\n"); + struct tracksort_data *td = tracksort_init(nvec, vec, type); + GtkTreeIter it[1]; + gboolean itv = gtk_tree_model_iter_children(GTK_TREE_MODEL(choose_store), + it, + parent_it); + int inserted = 0, deleted_placeholder = 0; + //fprintf(stderr, "inserting tracks type=%s\n", type); + while(nvec > 0 || itv) { + /*fprintf(stderr, "td[] = %s, it=%s [%s]\n", + nvec > 0 ? td->track : "(none)", + itv ? choose_get_track(it) : "(!itv)", + itv ? (choose_is_file(it) ? "file" : "dir") : "");*/ + enum { INSERT, DELETE, SKIP_TREE, SKIP_BOTH } action; + const char *track = itv ? choose_get_track(it) : 0; + if(itv && !track) { + //fprintf(stderr, " placeholder\n"); + action = DELETE; + ++deleted_placeholder; + } else if(nvec > 0 && itv) { + /* There's both a tree row and a td[] entry */ + const int cmp = compare_tracks(td->sort, choose_get_sort(it), + td->display, choose_get_display(it), + td->track, track); + //fprintf(stderr, " cmp=%d\n", cmp); + if(cmp < 0) + /* td < it, so we insert td before it */ + action = INSERT; + else if(cmp > 0) { + /* td > it, so we must either delete it (if the same type) or skip it */ + if(choose_is_file(it) == isfile) + action = DELETE; + else + action = SKIP_TREE; + } else + /* td = it, so we step past both */ + action = SKIP_BOTH; + } else if(nvec > 0) { + /* We've reached the end of the tree rows, but new have tracks left in + * td[] */ + //fprintf(stderr, " inserting\n"); + action = INSERT; } else { - searchhash = 0; /* for the gc */ - redisplay_tree("no search results"); /* remove search markers */ - /* The search results buttons are not usable */ - gtk_widget_set_sensitive(nextsearch, 0); - gtk_widget_set_sensitive(prevsearch, 0); + /* We've reached the end of the new tracks from td[], but there are + * further tracks in the tree */ + //fprintf(stderr, " deleting\n"); + if(choose_is_file(it) == isfile) + action = DELETE; + else + action = SKIP_TREE; + } + + switch(action) { + case INSERT: { + //fprintf(stderr, " INSERT %s\n", td->track); + /* Insert a new row from td[] before it, or at the end if it is no longer + * valid */ + GtkTreeIter child[1]; + gtk_tree_store_insert_before(choose_store, + child, /* new row */ + parent_it, /* parent */ + itv ? it : NULL); /* successor */ + gtk_tree_store_set(choose_store, child, + NAME_COLUMN, td->display, + ISFILE_COLUMN, isfile, + TRACK_COLUMN, td->track, + SORT_COLUMN, td->sort, + AUTOCOLLAPSE_COLUMN, FALSE, + -1); + /* Update length and state; we expect this to kick off length lookups + * rather than necessarily get the right value the first time round. */ + choose_set_state_callback(0, 0, child, 0); + /* If we inserted a directory, insert a placeholder too, so it appears to + * have children; it will be deleted when we expand the directory. */ + if(!isfile) { + //fprintf(stderr, " inserting a placeholder\n"); + GtkTreeIter placeholder[1]; + + gtk_tree_store_append(choose_store, placeholder, child); + gtk_tree_store_set(choose_store, placeholder, + NAME_COLUMN, "Waddling...", + TRACK_COLUMN, "", + ISFILE_COLUMN, FALSE, + -1); + } + ++inserted; + ++td; + --nvec; + break; + } + case SKIP_BOTH: + //fprintf(stderr, " SKIP_BOTH\n"); + ++td; + --nvec; + /* fall thru */ + case SKIP_TREE: + //fprintf(stderr, " SKIP_TREE\n"); + itv = gtk_tree_model_iter_next(GTK_TREE_MODEL(choose_store), it); + break; + case DELETE: + //fprintf(stderr, " DELETE\n"); + itv = choose_remove_node(it); + break; } } -} - -/** @brief Initiate a search - * - * If a search is underway we set @ref search_obsolete and restart the search - * in search_completed() above. - */ -static void initiate_search(void) { - char *terms, *e; - - /* Find out what the user is after */ - terms = xstrdup(gtk_entry_get_text(GTK_ENTRY(searchentry))); - /* Strip leading and trailing space */ - while(*terms == ' ') ++terms; - e = terms + strlen(terms); - while(e > terms && e[-1] == ' ') --e; - *e = 0; - /* If a search is already underway then mark it as obsolete. We'll revisit - * when it returns. */ - if(search_in_flight) { - search_obsolete = 1; - return; - } - if(*terms) { - /* There's still something left. Initiate the search. */ - if(disorder_eclient_search(client, search_completed, terms, 0)) { - /* The search terms are bad! We treat this as if there were no search - * terms at all. Some kind of feedback would be handy. */ - fprintf(stderr, "bad terms [%s]\n", terms); /* TODO */ - search_completed(0, 0, 0); - } else { - search_in_flight = 1; + /*fprintf(stderr, "inserted=%d deleted_placeholder=%d\n\n", + inserted, deleted_placeholder);*/ + if(parent_ref) { + /* If we deleted a placeholder then we must re-expand the row */ + if(deleted_placeholder) { + ++choose_suppress_set_autocollapse; + gtk_tree_view_expand_row(GTK_TREE_VIEW(choose_view), parent_path, FALSE); + --choose_suppress_set_autocollapse; } - } else { - /* No search terms - we want to see all tracks */ - search_completed(0, 0, 0); + gtk_tree_row_reference_free(parent_ref); + gtk_tree_path_free(parent_path); + } +skip: + /* We only notify others that we've inserted tracks when there are no more + * insertions pending, so that they don't have to keep track of how many + * requests they've made. */ + if(--choose_list_in_flight == 0) { + /* Notify interested parties that we inserted some tracks, AFTER making + * sure that the row is properly expanded */ + //fprintf(stderr, "raising choose-more-tracks\n"); + event_raise("choose-more-tracks", 0); + } + //fprintf(stderr, "choose_list_in_flight -> %d-\n", choose_list_in_flight); +} + +static void choose_dirs_completed(void *v, + const char *err, + int nvec, char **vec) { + if(err) { + popup_protocol_error(0, err); + return; } + choose_populate(v, nvec, vec, 0/*!isfile*/); } -/** @brief Called when the cancel search button is clicked */ -static void clearsearch_clicked(GtkButton attribute((unused)) *button, - gpointer attribute((unused)) userdata) { - gtk_entry_set_text(GTK_ENTRY(searchentry), ""); -} - -/** @brief Called when the 'next search result' button is clicked */ -static void next_clicked(GtkButton attribute((unused)) *button, - gpointer attribute((unused)) userdata) { - /* We want to find the highest (lowest ymax) track that is below the current - * visible range */ - int n; - const gdouble bottom = gtk_adjustment_get_value(vadjust) + vadjust->page_size; - const struct choosenode *candidate = 0; - - for(n = 0; n < nsearchresults; ++n) { - const struct choosenode *const cn = searchnodes[n]; - - if(cn - && cn->ymax > bottom - && (candidate == 0 - || cn->ymax < candidate->ymax)) - candidate = cn; +static void choose_files_completed(void *v, + const char *err, + int nvec, char **vec) { + if(err) { + popup_protocol_error(0, err); + return; } - if(candidate) - gtk_adjustment_clamp_page(vadjust, candidate->ymin, candidate->ymax); + choose_populate(v, nvec, vec, 1/*isfile*/); } -/** @brief Called when the 'previous search result' button is clicked */ -static void prev_clicked(GtkButton attribute((unused)) *button, - gpointer attribute((unused)) userdata) { - /* We want to find the lowest (greated ymax) track that is above the current - * visible range */ - int n; - const gdouble top = gtk_adjustment_get_value(vadjust); - const struct choosenode *candidate = 0; - - for(n = 0; n < nsearchresults; ++n) { - const struct choosenode *const cn = searchnodes[n]; - - if(cn - && cn->ymin < top - && (candidate == 0 - || cn->ymax > candidate->ymax)) - candidate = cn; - } - if(candidate) - gtk_adjustment_clamp_page(vadjust, candidate->ymin, candidate->ymax); +void choose_play_completed(void attribute((unused)) *v, + const char *err) { + if(err) + popup_protocol_error(0, err); } -/* Display functions ------------------------------------------------------- */ - -/** @brief Update the display */ -static void redisplay_tree(const char *why) { - struct displaydata d; - guint oldwidth, oldheight; - - D(("redisplay_tree %s", why)); - if(suppress_redisplay) { - /*fprintf(stderr, "redisplay_tree %s suppressed\n", why);*/ +static void choose_state_toggled + (GtkCellRendererToggle attribute((unused)) *cell_renderer, + gchar *path_str, + gpointer attribute((unused)) user_data) { + GtkTreeIter it[1]; + /* Identify the track */ + gboolean itv = + gtk_tree_model_get_iter_from_string(GTK_TREE_MODEL(choose_store), + it, + path_str); + if(!itv) return; - } - if(gets_in_flight) { - /*fprintf(stderr, "redisplay_tree %s suppressed (gets_in_flight)\n", why);*/ + if(!choose_is_file(it)) return; - } - INIT(); - BEGIN(total); - /*fprintf(stderr, "redisplay_tree %s *** NOT SUPPRESSED ***\n", why);*/ - /* We'll count these up empirically each time */ - files_selected = 0; - files_visible = 0; - /* Correct the layout and find out how much space it uses */ - MTAG_PUSH("display_tree"); - searchnodes = nsearchresults ? xcalloc(nsearchresults, - sizeof (struct choosenode *)) : 0; - d = display_tree(root, 0, 0); - MTAG_POP(); - - BEGIN(gtkbits); - /* We must set the total size or scrolling will not work (it wouldn't be hard - * for GtkLayout to figure it out for itself but presumably you're supposed - * to be able to have widgets off the edge of the layuot.) - * - * There is a problem: if we shrink the size then the part of the screen that - * is outside the new size but inside the old one is not updated. I think - * this is arguably bug in GTK+ but it's easy to force a redraw if this - * region is nonempty. - */ - gtk_layout_get_size(GTK_LAYOUT(chooselayout), &oldwidth, &oldheight); - if(oldwidth > d.width || oldheight > d.height) - gtk_widget_queue_draw(chooselayout); - gtk_layout_set_size(GTK_LAYOUT(chooselayout), d.width, d.height); - END(gtkbits); - /* Notify the main menu of any recent changes */ - BEGIN(menuupdate); - menu_update(-1); - END(menuupdate); - END(total); - REPORT(); + const char *track = choose_get_track(it); + if(queued(track)) + return; + disorder_eclient_play(client, track, choose_play_completed, 0); + } -/** @brief Recursive step for redisplay_tree() - * @param cn Node to display - * @param x X coordinate for @p cn - * @param y Y coordinate for @p cn +/** @brief (Re-)get the children of @p path + * @param path Path to target row + * @param iter Iterator pointing at target row * - * Makes sure all displayed widgets from CN down exist and are in their proper - * place and return the maximum space used. + * Called from choose_row_expanded() to make sure that the contents are present + * and from choose_refill_callback() to (re-)synchronize. */ -static struct displaydata display_tree(struct choosenode *cn, int x, int y) { - int n, aw; - GtkRequisition req; - struct displaydata d, cd; - GdkPixbuf *pb; - const int search_result = is_search_result(cn->path); - - D(("display_tree %s %d,%d", cn->path, x, y)); - - /* An expandable item contains an arrow and a text label. When you press the - * button it flips its expand state. - * - * A non-expandable item has just a text label and no arrow. - */ - if(!cn->container) { - BEGIN(new_widgets); - MTAG_PUSH("make_widgets_1"); - /* Widgets need to be created */ - NW(hbox); - cn->hbox = gtk_hbox_new(FALSE, 1); - if(cn->flags & CN_EXPANDABLE) { - NW(arrow); - cn->arrow = gtk_arrow_new(cn->flags & CN_EXPANDED ? GTK_ARROW_DOWN - : GTK_ARROW_RIGHT, - GTK_SHADOW_NONE); - cn->marker = 0; +static void choose_refill_row(GtkTreePath *path, + GtkTreeIter *iter) { + const char *track = choose_get_track(iter); + disorder_eclient_files(client, choose_files_completed, + track, + NULL, + gtk_tree_row_reference_new(GTK_TREE_MODEL(choose_store), + path)); + disorder_eclient_dirs(client, choose_dirs_completed, + track, + NULL, + gtk_tree_row_reference_new(GTK_TREE_MODEL(choose_store), + path)); + /* The row references are destroyed in the _completed handlers. */ + choose_list_in_flight += 2; +} + +static void choose_row_expanded(GtkTreeView attribute((unused)) *treeview, + GtkTreeIter *iter, + GtkTreePath *path, + gpointer attribute((unused)) user_data) { + /*fprintf(stderr, "row-expanded path=[%s]\n\n", + gtk_tree_path_to_string(path));*/ + /* We update a node's contents whenever it is expanded, even if it was + * already populated; the effect is that contracting and expanding a node + * suffices to update it to the latest state on the server. */ + choose_refill_row(path, iter); + if(!choose_suppress_set_autocollapse) { + if(choose_auto_expanding) { + /* This was an automatic expansion; mark it the row for auto-collapse. */ + gtk_tree_store_set(choose_store, iter, + AUTOCOLLAPSE_COLUMN, TRUE, + -1); + /*fprintf(stderr, "enable auto-collapse for %s\n", + gtk_tree_path_to_string(path));*/ } else { - cn->arrow = 0; - if((pb = find_image("notes.png"))) { - NW(image); - cn->marker = gtk_image_new_from_pixbuf(pb); - } - } - MTAG_POP(); - MTAG_PUSH("make_widgets_2"); - NW(label); - cn->label = gtk_label_new(cn->display); - if(cn->arrow) - gtk_container_add(GTK_CONTAINER(cn->hbox), cn->arrow); - gtk_container_add(GTK_CONTAINER(cn->hbox), cn->label); - if(cn->marker) - gtk_container_add(GTK_CONTAINER(cn->hbox), cn->marker); - MTAG_POP(); - MTAG_PUSH("make_widgets_3"); - NW(event_box); - cn->container = gtk_event_box_new(); - gtk_container_add(GTK_CONTAINER(cn->container), cn->hbox); - g_signal_connect(cn->container, "button-release-event", - G_CALLBACK(clicked_choosenode), cn); - g_signal_connect(cn->container, "button-press-event", - G_CALLBACK(clicked_choosenode), cn); - g_object_ref(cn->container); - /* Show everything by default */ - gtk_widget_show_all(cn->container); - MTAG_POP(); - END(new_widgets); - } - assert(cn->container); - /* Set colors */ - BEGIN(colors); - if(search_result) { - gtk_widget_set_style(cn->container, search_style); - gtk_widget_set_style(cn->label, search_style); - } else { - gtk_widget_set_style(cn->container, layout_style); - gtk_widget_set_style(cn->label, layout_style); - } - END(colors); - /* Make sure the icon is right */ - BEGIN(markers); - if(cn->flags & CN_EXPANDABLE) - gtk_arrow_set(GTK_ARROW(cn->arrow), - cn->flags & CN_EXPANDED ? GTK_ARROW_DOWN : GTK_ARROW_RIGHT, - GTK_SHADOW_NONE); - else if(cn->marker) - /* Make sure the queued marker is right */ - /* TODO: doesn't always work */ - (queued(cn->path) ? gtk_widget_show : gtk_widget_hide)(cn->marker); - END(markers); - /* Put the widget in the right place */ - BEGIN(location); - if(cn->flags & CN_DISPLAYED) - gtk_layout_move(GTK_LAYOUT(chooselayout), cn->container, x, y); - else { - gtk_layout_put(GTK_LAYOUT(chooselayout), cn->container, x, y); - cn->flags |= CN_DISPLAYED; - /* Now chooselayout has a ref to the container */ - g_object_unref(cn->container); - } - END(location); - /* Set the widget's selection status */ - BEGIN(selection); - if(!(cn->flags & CN_EXPANDABLE)) - display_selection(cn); - END(selection); - /* Find the size used so we can get vertical positioning right. */ - gtk_widget_size_request(cn->container, &req); - d.width = x + req.width; - d.height = y + req.height; - cn->ymin = y; - cn->ymax = d.height; - if(cn->flags & CN_EXPANDED) { - /* We'll offset children by the size of the arrow whatever it might be. */ - assert(cn->arrow); - gtk_widget_size_request(cn->arrow, &req); - aw = req.width; - for(n = 0; n < cn->children.nvec; ++n) { - cd = display_tree(cn->children.vec[n], x + aw, d.height); - if(cd.width > d.width) - d.width = cd.width; - d.height = cd.height; + /* This was a manual expansion. Inhibit automatic collapse on this row + * and all its ancestors. */ + gboolean itv; + do { + gtk_tree_store_set(choose_store, iter, + AUTOCOLLAPSE_COLUMN, FALSE, + -1); + /*fprintf(stderr, "suppress auto-collapse for %s\n", + gtk_tree_model_get_string_from_iter(GTK_TREE_MODEL(choose_store), + iter));*/ + GtkTreeIter child = *iter; + itv = gtk_tree_model_iter_parent(GTK_TREE_MODEL(choose_store), + iter, + &child); + } while(itv); + /* The effect of this is that if you expand a row that's actually a + * sibling of the real target of the auto-expansion, it stays expanded + * when you clear a search. That's find and good, but it _still_ stays + * expanded if you expand it and then collapse it. + * + * An alternative policy would be to only auto-collapse rows that don't + * have any expanded children (apart from ones also subject to + * auto-collapse). I'm not sure what the most usable policy is. + */ } - } else { - BEGIN(undisplay); - for(n = 0; n < cn->children.nvec; ++n) - undisplay_tree(cn->children.vec[n]); - END(undisplay); - } - if(!(cn->flags & CN_EXPANDABLE)) { - ++files_visible; - if(cn->flags & CN_SELECTED) - ++files_selected; } - /* update the search results array */ - if(search_result) - searchnodes[search_result - 1] = cn; - /* report back how much space we used */ - D(("display_tree %s %d,%d total size %dx%d", cn->path, x, y, - d.width, d.height)); - return d; } -/** @brief Remove widgets for newly hidden nodes */ -static void undisplay_tree(struct choosenode *cn) { - int n; +static void choose_auto_collapse_callback(GtkTreeView *tree_view, + GtkTreePath *path, + gpointer attribute((unused)) user_data) { + GtkTreeIter it[1]; - D(("undisplay_tree %s", cn->path)); - /* Remove this widget from the display */ - if(cn->flags & CN_DISPLAYED) { - gtk_container_remove(GTK_CONTAINER(chooselayout), cn->container); - cn->flags ^= CN_DISPLAYED; + gtk_tree_model_get_iter(GTK_TREE_MODEL(choose_store), it, path); + if(choose_can_autocollapse(it)) { + /*fprintf(stderr, "collapse %s\n", + gtk_tree_path_to_string(path));*/ + gtk_tree_store_set(choose_store, it, + AUTOCOLLAPSE_COLUMN, FALSE, + -1); + gtk_tree_view_collapse_row(tree_view, path); } - /* Remove children too */ - for(n = 0; n < cn->children.nvec; ++n) - undisplay_tree(cn->children.vec[n]); } -/* Selection --------------------------------------------------------------- */ - -/** @brief Mark the widget @p cn according to its selection state */ -static void display_selection(struct choosenode *cn) { - /* Need foreground and background colors */ - gtk_widget_set_state(cn->label, (cn->flags & CN_SELECTED - ? GTK_STATE_SELECTED : GTK_STATE_NORMAL)); - gtk_widget_set_state(cn->container, (cn->flags & CN_SELECTED - ? GTK_STATE_SELECTED : GTK_STATE_NORMAL)); -} - -/** @brief Set the selection state of a widget - * - * Directories can never be selected, we just ignore attempts to do so. */ -static void set_selection(struct choosenode *cn, int selected) { - unsigned f = selected ? CN_SELECTED : 0; - - D(("set_selection %d %s", selected, cn->path)); - if(!(cn->flags & CN_EXPANDABLE) && (cn->flags & CN_SELECTED) != f) { - cn->flags ^= CN_SELECTED; - /* Maintain selection count */ - if(selected) - ++files_selected; - else - --files_selected; - display_selection(cn); - /* Update main menu sensitivity */ - menu_update(-1); - } +/** @brief Perform automatic collapse after a search is cleared */ +void choose_auto_collapse(void) { + gtk_tree_view_map_expanded_rows(GTK_TREE_VIEW(choose_view), + choose_auto_collapse_callback, + 0); } -/** @brief Recursively clear all selection bits from CN down */ -static void clear_selection(struct choosenode *cn) { - int n; +/** @brief Called from choose_refill() with each expanded row */ +static void choose_refill_callback(GtkTreeView attribute((unused)) *tree_view, + GtkTreePath *path, + gpointer attribute((unused)) user_data) { + GtkTreeIter it[1]; - set_selection(cn, 0); - for(n = 0; n < cn->children.nvec; ++n) - clear_selection(cn->children.vec[n]); + gtk_tree_model_get_iter(GTK_TREE_MODEL(choose_store), it, path); + choose_refill_row(path, it); } -/* User actions ------------------------------------------------------------ */ - -/** @brief Clicked on something +/** @brief Synchronize all visible data with the server * - * This implements playing, all the modifiers for selection, etc. + * Called at startup, when a rescan completes, and via periodic_slow(). */ -static void clicked_choosenode(GtkWidget attribute((unused)) *widget, - GdkEventButton *event, - gpointer user_data) { - struct choosenode *cn = user_data; - int ind, last_ind, n; - - D(("clicked_choosenode %s", cn->path)); - if(event->type == GDK_BUTTON_RELEASE - && event->button == 1) { - /* Left click */ - if(cn->flags & CN_EXPANDABLE) { - /* This is a directory. Flip its expansion status. */ - if(cn->flags & CN_EXPANDED) - contract_node(cn); - else - expand_node(cn, 0/*!contingent*/); - last_click = 0; - } else { - /* This is a file. Adjust selection status */ - /* TODO the basic logic here is essentially the same as that in queue.c. - * Can we share code at all? */ - switch(event->state & (GDK_SHIFT_MASK|GDK_CONTROL_MASK)) { - case 0: - clear_selection(root); - set_selection(cn, 1); - last_click = cn; - break; - case GDK_CONTROL_MASK: - set_selection(cn, !(cn->flags & CN_SELECTED)); - last_click = cn; - break; - case GDK_SHIFT_MASK: - case GDK_SHIFT_MASK|GDK_CONTROL_MASK: - if(last_click && last_click->parent == cn->parent) { - /* Figure out where the current and last clicks are in the list */ - ind = last_ind = -1; - for(n = 0; n < cn->parent->children.nvec; ++n) { - if(cn->parent->children.vec[n] == cn) - ind = n; - if(cn->parent->children.vec[n] == last_click) - last_ind = n; - } - /* Test shouldn't ever fail, but still */ - if(ind >= 0 && last_ind >= 0) { - if(!(event->state & GDK_CONTROL_MASK)) { - for(n = 0; n < cn->parent->children.nvec; ++n) - set_selection(cn->parent->children.vec[n], 0); - } - if(ind > last_ind) - for(n = last_ind; n <= ind; ++n) - set_selection(cn->parent->children.vec[n], 1); - else - for(n = ind; n <= last_ind; ++n) - set_selection(cn->parent->children.vec[n], 1); - if(event->state & GDK_CONTROL_MASK) - last_click = cn; - } - } - /* TODO trying to select a range that doesn't share a single parent - * currently does not work, but it ought to. */ - break; - } - } - } else if(event->type == GDK_BUTTON_RELEASE - && event->button == 2) { - /* Middle click - play the pointed track */ - if(!(cn->flags & CN_EXPANDABLE)) { - clear_selection(root); - set_selection(cn, 1); - gtk_label_set_text(GTK_LABEL(report_label), "adding track to queue"); - disorder_eclient_play(client, cn->path, 0, 0); - last_click = 0; - } - } else if(event->type == GDK_BUTTON_PRESS - && event->button == 3) { - struct choose_menuitem *const menuitems = - (cn->flags & CN_EXPANDABLE ? dir_menuitems : track_menuitems); - GtkWidget *const menu = - (cn->flags & CN_EXPANDABLE ? dir_menu : track_menu); - /* Right click. Pop up a menu. */ - /* If the current file isn't selected, switch the selection to just that. - * (If we're looking at a directory then leave the selection alone.) */ - if(!(cn->flags & CN_EXPANDABLE) && !(cn->flags & CN_SELECTED)) { - clear_selection(root); - set_selection(cn, 1); - last_click = cn; +static void choose_refill(const char attribute((unused)) *event, + void attribute((unused)) *eventdata, + void attribute((unused)) *callbackdata) { + //fprintf(stderr, "choose_refill\n"); + /* Update the root */ + disorder_eclient_files(client, choose_files_completed, "", NULL, NULL); + disorder_eclient_dirs(client, choose_dirs_completed, "", NULL, NULL); + choose_list_in_flight += 2; + /* Update all expanded rows */ + gtk_tree_view_map_expanded_rows(GTK_TREE_VIEW(choose_view), + choose_refill_callback, + 0); + //fprintf(stderr, "choose_list_in_flight -> %d+\n", choose_list_in_flight); +} + +/** @brief Called for key-*-event on the main view + */ +static gboolean choose_key_event(GtkWidget attribute((unused)) *widget, + GdkEventKey *event, + gpointer user_data) { + /*fprintf(stderr, "choose_key_event type=%d state=%#x keyval=%#x\n", + event->type, event->state, event->keyval);*/ + switch(event->keyval) { + case GDK_Page_Up: + case GDK_Page_Down: + case GDK_Up: + case GDK_Down: + case GDK_Home: + case GDK_End: + return FALSE; /* We'll take these */ + case 'f': case 'F': + /* ^F is expected to start a search. We implement this by focusing the + * search entry box. */ + if((event->state & ~(GDK_LOCK_MASK|GDK_SHIFT_MASK)) == GDK_CONTROL_MASK + && event->type == GDK_KEY_PRESS) { + choose_search_new(); + return TRUE; /* Handled it */ } - /* Set the item sensitivity and callbacks */ - for(n = 0; menuitems[n].name; ++n) { - if(menuitems[n].handlerid) - g_signal_handler_disconnect(menuitems[n].w, - menuitems[n].handlerid); - gtk_widget_set_sensitive(menuitems[n].w, - menuitems[n].sensitive(cn)); - menuitems[n].handlerid = g_signal_connect - (menuitems[n].w, "activate", G_CALLBACK(menuitems[n].activate), cn); + break; + case 'g': case 'G': + /* ^G is expected to go the next match. We simulate a click on the 'next' + * button. */ + if((event->state & ~(GDK_LOCK_MASK|GDK_SHIFT_MASK)) == GDK_CONTROL_MASK + && event->type == GDK_KEY_PRESS) { + choose_next_clicked(0, 0); + return TRUE; /* Handled it */ } - set_tool_colors(menu); - /* Pop up the menu */ - gtk_widget_show_all(menu); - gtk_menu_popup(GTK_MENU(menu), 0, 0, 0, 0, - event->button, event->time); - } -} - -/** @brief Called BY GTK+ to tell us the search entry box has changed */ -static void searchentry_changed(GtkEditable attribute((unused)) *editable, - gpointer attribute((unused)) user_data) { - initiate_search(); -} - -/* Track menu items -------------------------------------------------------- */ - -/** @brief Recursive step for gather_selected() */ -static void recurse_selected(struct choosenode *cn, struct vector *v) { - int n; - - if(cn->flags & CN_EXPANDABLE) { - if(cn->flags & CN_EXPANDED) - for(n = 0; n < cn->children.nvec; ++n) - recurse_selected(cn->children.vec[n], v); - } else { - if((cn->flags & CN_SELECTED) && cn->path) - vector_append(v, (char *)cn->path); - } -} - -/*** @brief Get a list of all the selected tracks */ -static const char **gather_selected(int *ntracks) { - struct vector v; - - vector_init(&v); - recurse_selected(root, &v); - vector_terminate(&v); - if(ntracks) *ntracks = v.nvec; - return (const char **)v.vec; -} - -/** @brief Called when the track menu's play option is activated */ -static void activate_track_play(GtkMenuItem attribute((unused)) *menuitem, - gpointer attribute((unused)) user_data) { - const char **tracks = gather_selected(0); - int n; - - gtk_label_set_text(GTK_LABEL(report_label), "adding track to queue"); - for(n = 0; tracks[n]; ++n) - disorder_eclient_play(client, tracks[n], 0, 0); -} - -/** @brief Called when the menu's properties option is activated */ -static void activate_track_properties(GtkMenuItem attribute((unused)) *menuitem, - gpointer attribute((unused)) user_data) { - int ntracks; - const char **tracks = gather_selected(&ntracks); - - properties(ntracks, tracks); -} - -/** @brief Determine whether the menu's play option should be sensitive */ -static gboolean sensitive_track_play(struct choosenode attribute((unused)) *cn) { - return (!!files_selected - && (disorder_eclient_state(client) & DISORDER_CONNECTED)); -} - -/** @brief Determine whether the menu's properties option should be sensitive */ -static gboolean sensitive_track_properties(struct choosenode attribute((unused)) *cn) { - return !!files_selected && (disorder_eclient_state(client) & DISORDER_CONNECTED); -} - -/* Directory menu items ---------------------------------------------------- */ - -/** @brief Return the file children of @p cn - * - * The list is terminated by a null pointer. - */ -static const char **dir_files(struct choosenode *cn, int *nfiles) { - const char **files = xcalloc(cn->children.nvec + 1, sizeof (char *)); - int n, m; - - for(n = m = 0; n < cn->children.nvec; ++n) - if(!(cn->children.vec[n]->flags & CN_EXPANDABLE)) - files[m++] = cn->children.vec[n]->path; - files[m] = 0; - if(nfiles) *nfiles = m; - return files; -} - -static void play_dir(struct choosenode *cn, - void attribute((unused)) *wfu) { - int ntracks, n; - const char **tracks = dir_files(cn, &ntracks); - - gtk_label_set_text(GTK_LABEL(report_label), "adding track to queue"); - for(n = 0; n < ntracks; ++n) - disorder_eclient_play(client, tracks[n], 0, 0); -} - -static void properties_dir(struct choosenode *cn, - void attribute((unused)) *wfu) { - int ntracks; - const char **tracks = dir_files(cn, &ntracks); - - properties(ntracks, tracks); -} - -static void select_dir(struct choosenode *cn, - void attribute((unused)) *wfu) { - int n; - - clear_selection(root); - for(n = 0; n < cn->children.nvec; ++n) - set_selection(cn->children.vec[n], 1); -} - -/** @brief Ensure @p cn is expanded and then call @p callback */ -static void call_with_dir(struct choosenode *cn, - when_filled_callback *whenfilled, - void *wfu) { - if(!(cn->flags & CN_EXPANDABLE)) - return; /* something went wrong */ - if(cn->flags & CN_EXPANDED) - /* @p cn is already open */ - whenfilled(cn, wfu); - else { - /* @p cn is not open, arrange for the callback to go off when it is - * opened */ - cn->whenfilled = whenfilled; - cn->wfu = wfu; - expand_node(cn, 0/*not contingnet upon search*/); + break; } + /* Anything not handled we redirected to the search entry field */ + gtk_widget_event(user_data, (GdkEvent *)event); + return TRUE; /* Handled it */ } -/** @brief Called when the directory menu's play option is activated */ -static void activate_dir_play(GtkMenuItem attribute((unused)) *menuitem, - gpointer user_data) { - struct choosenode *const cn = (struct choosenode *)user_data; - - call_with_dir(cn, play_dir, 0); -} - -/** @brief Called when the directory menu's properties option is activated */ -static void activate_dir_properties(GtkMenuItem attribute((unused)) *menuitem, - gpointer user_data) { - struct choosenode *const cn = (struct choosenode *)user_data; - - call_with_dir(cn, properties_dir, 0); -} - -/** @brief Called when the directory menu's select option is activated */ -static void activate_dir_select(GtkMenuItem attribute((unused)) *menuitem, - gpointer user_data) { - struct choosenode *const cn = (struct choosenode *)user_data; - - call_with_dir(cn, select_dir, 0); -} - -/** @brief Determine whether the directory menu's play option should be sensitive */ -static gboolean sensitive_dir_play(struct choosenode attribute((unused)) *cn) { - return !!(disorder_eclient_state(client) & DISORDER_CONNECTED); -} - -/** @brief Determine whether the directory menu's properties option should be sensitive */ -static gboolean sensitive_dir_properties(struct choosenode attribute((unused)) *cn) { - return !!(disorder_eclient_state(client) & DISORDER_CONNECTED); -} - -/** @brief Determine whether the directory menu's select option should be sensitive */ -static gboolean sensitive_dir_select(struct choosenode attribute((unused)) *cn) { - return TRUE; +static gboolean choose_multidrag_predicate(GtkTreePath attribute((unused)) *path, + GtkTreeIter *iter) { + return choose_is_file(iter); } - -/* Main menu plumbing ------------------------------------------------------ */ - -/** @brief Determine whether the edit menu's properties option should be sensitive */ -static int choose_properties_sensitive(GtkWidget attribute((unused)) *w) { - return !!files_selected && (disorder_eclient_state(client) & DISORDER_CONNECTED); -} - -/** @brief Determine whether the edit menu's select all option should be sensitive +/** @brief Callback to add selected tracks to the selection data * - * TODO not implemented, see also choose_selectall_activate() + * Called from choose_drag_data_get(). */ -static int choose_selectall_sensitive(GtkWidget attribute((unused)) *w) { - return FALSE; -} - -/** @brief Determine whether the edit menu's select none option should be sensitive +static void choose_drag_data_get_collect(GtkTreeModel attribute((unused)) *model, + GtkTreePath attribute((unused)) *path, + GtkTreeIter *iter, + gpointer data) { + struct dynstr *const result = data; + + if(choose_is_file(iter)) { /* no diretories */ + dynstr_append_string(result, ""); /* no ID */ + dynstr_append(result, '\n'); + dynstr_append_string(result, choose_get_track(iter)); + dynstr_append(result, '\n'); + } +} + +/** @brief Called to extract the dragged data from the choose view + * @param w Source widget (the tree view) + * @param dc Drag context + * @param data Where to put the answer + * @param info_ Target @c info parameter + * @param time_ Time data requested (for some reason not a @c time_t) + * @param user_data The queuelike * - * TODO not implemented, see also choose_selectnone_activate() + * Closely analogous to ql_drag_data_get(), and uses the same data format. + * IDs are sent as empty strings. */ -static int choose_selectnone_sensitive(GtkWidget attribute((unused)) *w) { - return FALSE; -} - -/** @brief Called when the edit menu's properties option is activated */ -static void choose_properties_activate(GtkWidget attribute((unused)) *w) { - activate_track_properties(0, 0); -} - -/** @brief Called when the edit menu's select all option is activated - * - * TODO not implemented, see choose_selectall_sensitive() */ -static void choose_selectall_activate(GtkWidget attribute((unused)) *w) { -} - -/** @brief Called when the edit menu's select none option is activated - * - * TODO not implemented, see choose_selectnone_sensitive() */ -static void choose_selectnone_activate(GtkWidget attribute((unused)) *w) { -} - -/** @brief Main menu callbacks for Choose screen */ -static const struct tabtype tabtype_choose = { - choose_properties_sensitive, - choose_selectall_sensitive, - choose_selectnone_sensitive, - choose_properties_activate, - choose_selectall_activate, - choose_selectnone_activate, -}; - -/* Public entry points ----------------------------------------------------- */ - -/** @brief Called to entirely reset the choose screen */ -static void choose_reset(void) { - if(root) - undisplay_tree(root); - root = newnode(0/*parent*/, "", "All files", "", - CN_EXPANDABLE, fill_root_node); - expand_node(root, 0); /* will call redisplay_tree */ -} - -/** @brief Create a track choice widget */ +static void choose_drag_data_get(GtkWidget *w, + GdkDragContext attribute((unused)) *dc, + GtkSelectionData *data, + guint attribute((unused)) info_, + guint attribute((unused)) time_, + gpointer attribute((unused)) user_data) { + struct dynstr result[1]; + GtkTreeSelection *sel; + + sel = gtk_tree_view_get_selection(GTK_TREE_VIEW(w)); + dynstr_init(result); + gtk_tree_selection_selected_foreach(sel, + choose_drag_data_get_collect, + result); + gtk_selection_data_set(data, + GDK_TARGET_STRING, + 8, (guchar *)result->vec, result->nvec); +} + +/** @brief Create the choose tab */ GtkWidget *choose_widget(void) { - int n; - GtkWidget *scrolled; - GtkWidget *vbox, *hbox, *clearsearch; - - /* - * +--vbox-------------------------------------------------------+ - * | +-hbox----------------------------------------------------+ | - * | | searchentry | clearsearch | | - * | +---------------------------------------------------------+ | - * | +-scrolled------------------------------------------------+ | - * | | +-chooselayout------------------------------------++--+ | | - * | | | Tree structure is manually layed out in here ||^^| | | - * | | | || | | | - * | | | || | | | - * | | | || | | | - * | | | ||vv| | | - * | | +-------------------------------------------------++--+ | | - * | | +-------------------------------------------------+ | | - * | | |< >| | | - * | | +-------------------------------------------------+ | | - * | +---------------------------------------------------------+ | - * +-------------------------------------------------------------+ - */ + /* Create the tree store. */ + choose_store = gtk_tree_store_new(CHOOSE_COLUMNS, + G_TYPE_BOOLEAN, + G_TYPE_STRING, + G_TYPE_STRING, + G_TYPE_BOOLEAN, + G_TYPE_STRING, + G_TYPE_STRING, + G_TYPE_STRING, + G_TYPE_STRING, + G_TYPE_BOOLEAN); + + /* Create the view */ + choose_view = gtk_tree_view_new_with_model(GTK_TREE_MODEL(choose_store)); + gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(choose_view), TRUE); + /* Suppress built-in typeahead find, we do our own search support. */ + gtk_tree_view_set_enable_search(GTK_TREE_VIEW(choose_view), FALSE); + + /* Create cell renderers and columns */ + /* TODO use a table */ + { + GtkCellRenderer *r = gtk_cell_renderer_toggle_new(); + GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes + ("Queued", + r, + "active", STATE_COLUMN, + "visible", ISFILE_COLUMN, + (char *)0); + gtk_tree_view_column_set_resizable(c, TRUE); + gtk_tree_view_column_set_reorderable(c, TRUE); + gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c); + g_signal_connect(r, "toggled", + G_CALLBACK(choose_state_toggled), 0); + } + { + GtkCellRenderer *r = gtk_cell_renderer_text_new(); + GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes + ("Length", + r, + "text", LENGTH_COLUMN, + (char *)0); + gtk_tree_view_column_set_resizable(c, TRUE); + gtk_tree_view_column_set_reorderable(c, TRUE); + g_object_set(r, "xalign", (gfloat)1.0, (char *)0); + gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c); + } + { + GtkCellRenderer *r = gtk_cell_renderer_text_new(); + GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes + ("Track", + r, + "text", NAME_COLUMN, + "background", BG_COLUMN, + "foreground", FG_COLUMN, + (char *)0); + gtk_tree_view_column_set_resizable(c, TRUE); + gtk_tree_view_column_set_reorderable(c, TRUE); + g_object_set(c, "expand", TRUE, (char *)0); + gtk_tree_view_append_column(GTK_TREE_VIEW(choose_view), c); + gtk_tree_view_set_expander_column(GTK_TREE_VIEW(choose_view), c); + } - /* Text entry box for search terms */ - NW(entry); - searchentry = gtk_entry_new(); - gtk_widget_set_style(searchentry, tool_style); - g_signal_connect(searchentry, "changed", G_CALLBACK(searchentry_changed), 0); - gtk_tooltips_set_tip(tips, searchentry, "Enter search terms here; search is automatic", ""); - - /* Cancel button to clear the search */ - NW(button); - clearsearch = gtk_button_new_from_stock(GTK_STOCK_CANCEL); - gtk_widget_set_style(clearsearch, tool_style); - g_signal_connect(G_OBJECT(clearsearch), "clicked", - G_CALLBACK(clearsearch_clicked), 0); - gtk_tooltips_set_tip(tips, clearsearch, "Clear search terms", ""); - - /* Up and down buttons to find previous/next results; initially they are not - * usable as there are no search results. */ - prevsearch = iconbutton("up.png", "Previous search result"); - g_signal_connect(G_OBJECT(prevsearch), "clicked", - G_CALLBACK(prev_clicked), 0); - gtk_widget_set_style(prevsearch, tool_style); - gtk_widget_set_sensitive(prevsearch, 0); - nextsearch = iconbutton("down.png", "Next search result"); - g_signal_connect(G_OBJECT(nextsearch), "clicked", - G_CALLBACK(next_clicked), 0); - gtk_widget_set_style(nextsearch, tool_style); - gtk_widget_set_sensitive(nextsearch, 0); - - /* hbox packs the search tools button together on a line */ - NW(hbox); - hbox = gtk_hbox_new(FALSE/*homogeneous*/, 1/*spacing*/); - gtk_box_pack_start(GTK_BOX(hbox), searchentry, + /* The selection should support multiple things being selected */ + choose_selection = gtk_tree_view_get_selection(GTK_TREE_VIEW(choose_view)); + gtk_tree_selection_set_mode(choose_selection, GTK_SELECTION_MULTIPLE); + + /* Catch button presses */ + g_signal_connect(choose_view, "button-press-event", + G_CALLBACK(choose_button_event), 0); + g_signal_connect(choose_view, "button-release-event", + G_CALLBACK(choose_button_event), 0); + /* Catch row expansions so we can fill in placeholders */ + g_signal_connect(choose_view, "row-expanded", + G_CALLBACK(choose_row_expanded), 0); + + event_register("queue-list-changed", choose_set_state, 0); + event_register("playing-track-changed", choose_set_state, 0); + event_register("search-results-changed", choose_set_state, 0); + event_register("lookups-completed", choose_set_state, 0); + event_register("choose-more-tracks", choose_menu_moretracks, 0); + + /* After a rescan we update the choose tree. We get a rescan-complete + * automatically at startup and upon connection too. */ + event_register("rescan-complete", choose_refill, 0); + + /* Make the widget scrollable */ + GtkWidget *scrolled = scroll_widget(choose_view); + + /* Pack vertically with the search widget */ + GtkWidget *vbox = gtk_vbox_new(FALSE/*homogenous*/, 1/*spacing*/); + gtk_box_pack_start(GTK_BOX(vbox), scrolled, TRUE/*expand*/, TRUE/*fill*/, 0/*padding*/); - gtk_box_pack_start(GTK_BOX(hbox), prevsearch, - FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); - gtk_box_pack_start(GTK_BOX(hbox), nextsearch, - FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); - gtk_box_pack_start(GTK_BOX(hbox), clearsearch, - FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); + gtk_box_pack_end(GTK_BOX(vbox), choose_search_widget(), + FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); - /* chooselayout contains the currently visible subset of the track - * namespace */ - NW(layout); - chooselayout = gtk_layout_new(0, 0); - gtk_widget_set_style(chooselayout, layout_style); - choose_reset(); - register_reset(choose_reset); - /* Create the popup menus */ - NW(menu); - track_menu = gtk_menu_new(); - g_signal_connect(track_menu, "destroy", G_CALLBACK(gtk_widget_destroyed), - &track_menu); - for(n = 0; track_menuitems[n].name; ++n) { - NW(menu_item); - track_menuitems[n].w = - gtk_menu_item_new_with_label(track_menuitems[n].name); - gtk_menu_attach(GTK_MENU(track_menu), track_menuitems[n].w, - 0, 1, n, n + 1); - } - NW(menu); - dir_menu = gtk_menu_new(); - g_signal_connect(dir_menu, "destroy", G_CALLBACK(gtk_widget_destroyed), - &dir_menu); - for(n = 0; dir_menuitems[n].name; ++n) { - NW(menu_item); - dir_menuitems[n].w = - gtk_menu_item_new_with_label(dir_menuitems[n].name); - gtk_menu_attach(GTK_MENU(dir_menu), dir_menuitems[n].w, - 0, 1, n, n + 1); - } - /* The layout is scrollable */ - scrolled = scroll_widget(chooselayout); - vadjust = gtk_layout_get_vadjustment(GTK_LAYOUT(chooselayout)); + g_object_set_data(G_OBJECT(vbox), "type", (void *)&choose_tabtype); + + /* Redirect keyboard activity to the search widget */ + g_signal_connect(choose_view, "key-press-event", + G_CALLBACK(choose_key_event), choose_search_entry); + g_signal_connect(choose_view, "key-release-event", + G_CALLBACK(choose_key_event), choose_search_entry); + + /* Enable dragging of tracks out */ + gtk_drag_source_set(choose_view, + GDK_BUTTON1_MASK, + choose_targets, + 1, + GDK_ACTION_COPY); + g_signal_connect(choose_view, "drag-data-get", + G_CALLBACK(choose_drag_data_get), NULL); + make_treeview_multidrag(choose_view, + choose_multidrag_predicate); - /* The scrollable layout and the search hbox go together in a vbox */ - NW(vbox); - vbox = gtk_vbox_new(FALSE/*homogenous*/, 1/*spacing*/); - gtk_box_pack_start(GTK_BOX(vbox), hbox, - FALSE/*expand*/, FALSE/*fill*/, 0/*padding*/); - gtk_box_pack_end(GTK_BOX(vbox), scrolled, - TRUE/*expand*/, TRUE/*fill*/, 0/*padding*/); - - g_object_set_data(G_OBJECT(vbox), "type", (void *)&tabtype_choose); return vbox; } -/** @brief Called when something we care about here might have changed */ -void choose_update(void) { - redisplay_tree("choose_update"); -} - /* Local Variables: c-basic-offset:2