2 * This file is part of DisOrder
3 * Copyright (C) 2006-2009 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 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU 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, see <http://www.gnu.org/licenses/>.
18 /** @file disobedience/queue-generic.c
19 * @brief Disobedience queue widgets
21 * This file provides contains code shared between all the queue-like
22 * widgets - the queue, the recent list and the added tracks list.
24 * This code is in the process of being rewritten to use the native list
27 * There are three @ref queuelike objects: @ref ql_queue, @ref
28 * ql_recent and @ref ql_added. Each has an associated queue linked
29 * list and a list store containing the contents.
31 * When new contents turn up we rearrange the list store accordingly.
33 * NB that while in the server the playing track is not in the queue, in
34 * Disobedience, the playing does live in @c ql_queue.q, despite its different
35 * status to everything else found in that list.
38 * - display playing row in a different color?
40 #include "disobedience.h"
42 #include "queue-generic.h"
43 #include "multidrag.h"
44 #include "autoscroll.h"
46 /* Track detail lookup ----------------------------------------------------- */
48 static void queue_lookups_completed(const char attribute((unused
)) *event
,
49 void attribute((unused
)) *eventdata
,
51 struct queuelike
*ql
= callbackdata
;
52 ql_update_list_store(ql
);
55 /* Column formatting -------------------------------------------------------- */
57 /** @brief Format the 'when' column */
58 const char *column_when(const struct queue_entry
*q
,
59 const char attribute((unused
)) *data
) {
66 case playing_isscratch
:
67 case playing_unplayed
:
72 case playing_no_player
:
74 case playing_scratched
:
77 case playing_quitting
:
85 strftime(when
, sizeof when
, "%H:%M", localtime_r(&t
, &tm
));
91 /** @brief Format the 'who' column */
92 const char *column_who(const struct queue_entry
*q
,
93 const char attribute((unused
)) *data
) {
95 return q
->submitter ? q
->submitter
: "";
98 /** @brief Format one of the track name columns */
99 const char *column_namepart(const struct queue_entry
*q
,
101 D(("column_namepart"));
102 return namepart(q
->track
, "display", data
);
105 /** @brief Format the length column */
106 const char *column_length(const struct queue_entry
*q
,
107 const char attribute((unused
)) *data
) {
108 D(("column_length"));
111 char *played
= 0, *length
= 0;
113 /* Work out what to say for the length */
114 l
= namepart_length(q
->track
);
116 byte_xasprintf(&length
, "%ld:%02ld", l
/ 60, l
% 60);
118 byte_xasprintf(&length
, "?:??");
119 /* For the currently playing track we want to report how much of the track
121 if(q
== playing_track
) {
122 /* log_state() arranges that we re-get the playing data whenever the
123 * pause/resume state changes */
124 if(last_state
& DISORDER_TRACK_PAUSED
)
125 l
= playing_track
->sofar
;
130 l
= playing_track
->sofar
+ (now
- last_playing
);
132 byte_xasprintf(&played
, "%ld:%02ld/%s", l
/ 60, l
% 60, length
);
138 /* List store maintenance -------------------------------------------------- */
140 /** @brief Return the @ref queue_entry corresponding to @p iter
141 * @param model Model that owns @p iter
142 * @param iter Tree iterator
143 * @return Pointer to queue entry
145 struct queue_entry
*ql_iter_to_q(GtkTreeModel
*model
,
147 struct queuelike
*ql
= g_object_get_data(G_OBJECT(model
), "ql");
149 memset(v
, 0, sizeof v
);
150 gtk_tree_model_get_value(model
, iter
, ql
->ncolumns
+ QUEUEPOINTER_COLUMN
, v
);
151 assert(G_VALUE_TYPE(v
) == G_TYPE_POINTER
);
152 struct queue_entry
*const q
= g_value_get_pointer(v
);
157 /** @brief Return the @ref queue_entry corresponding to @p path
158 * @param model Model to query
159 * @param path Path into tree
160 * @return Pointer to queue entry or NULL
162 struct queue_entry
*ql_path_to_q(GtkTreeModel
*model
,
165 if(!gtk_tree_model_get_iter(model
, iter
, path
))
167 return ql_iter_to_q(model
, iter
);
170 /** @brief Update one row of a list store
171 * @param q Queue entry
172 * @param iter Iterator referring to row or NULL to work it out
174 void ql_update_row(struct queue_entry
*q
,
176 const struct queuelike
*const ql
= q
->ql
;
178 D(("ql_update_row"));
179 /* If no iter was supplied, work it out */
180 GtkTreeIter my_iter
[1];
182 gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
), my_iter
);
183 struct queue_entry
*qq
;
184 for(qq
= ql
->q
; qq
&& q
!= qq
; qq
= qq
->next
)
185 gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), my_iter
);
190 /* Update all the columns */
191 for(int col
= 0; col
< ql
->ncolumns
; ++col
) {
192 const char *const v
= ql
->columns
[col
].value(q
,
193 ql
->columns
[col
].data
);
195 gtk_list_store_set(ql
->store
, iter
,
199 gtk_list_store_set(ql
->store
, iter
,
200 ql
->ncolumns
+ QUEUEPOINTER_COLUMN
, q
,
202 if(q
== playing_track
)
203 gtk_list_store_set(ql
->store
, iter
,
204 ql
->ncolumns
+ BACKGROUND_COLUMN
, BG_PLAYING
,
205 ql
->ncolumns
+ FOREGROUND_COLUMN
, FG_PLAYING
,
208 gtk_list_store_set(ql
->store
, iter
,
209 ql
->ncolumns
+ BACKGROUND_COLUMN
, (char *)0,
210 ql
->ncolumns
+ FOREGROUND_COLUMN
, (char *)0,
214 /** @brief Update the list store
215 * @param ql Queuelike to update
217 * Called when new namepart data is available (and initially). Doesn't change
218 * the rows, just updates the cell values.
220 void ql_update_list_store(struct queuelike
*ql
) {
221 D(("ql_update_list_store"));
223 gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
), iter
);
224 for(struct queue_entry
*q
= ql
->q
; q
; q
= q
->next
) {
225 ql_update_row(q
, iter
);
226 gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), iter
);
230 struct newqueue_data
{
231 struct queue_entry
*old
, *new;
234 static void record_queue_map(hash
*h
,
236 struct queue_entry
*old
,
237 struct queue_entry
*new) {
238 struct newqueue_data
*nqd
;
240 if(!(nqd
= hash_find(h
, id
))) {
241 static const struct newqueue_data empty
[1];
242 hash_add(h
, id
, empty
, HASH_INSERT
);
243 nqd
= hash_find(h
, id
);
247 fprintf(stderr
, " old: %s\n", id
);
253 fprintf(stderr
, " new: %s\n", id
);
260 static void dump_queue(struct queue_entry
*head
, struct queue_entry
*mark
) {
261 for(struct queue_entry
*q
= head
; q
; q
= q
->next
) {
263 fprintf(stderr
, " !");
264 fprintf(stderr
, " %s\n", q
->id
);
268 static void dump_rows(struct queuelike
*ql
) {
270 gboolean it
= gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
),
273 struct queue_entry
*q
= ql_iter_to_q(GTK_TREE_MODEL(ql
->store
), iter
);
274 it
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), iter
);
275 fprintf(stderr
, " %s\n", q
->id
);
280 /** @brief Reset the list store
281 * @param ql Queuelike to reset
282 * @param newq New queue contents/ordering
284 * Updates the queue to match @p newq
286 void ql_new_queue(struct queuelike
*ql
,
287 struct queue_entry
*newq
) {
291 /* Tell every queue entry which queue owns it */
293 fprintf(stderr
, "%s: filling in q->ql\n", ql
->name
);
295 for(struct queue_entry
*q
= newq
; q
; q
= q
->next
)
299 fprintf(stderr
, "%s: constructing h\n", ql
->name
);
301 /* Construct map from id to new and old structures */
302 hash
*h
= hash_new(sizeof(struct newqueue_data
));
303 for(struct queue_entry
*q
= ql
->q
; q
; q
= q
->next
)
304 record_queue_map(h
, q
->id
, q
, NULL
);
305 for(struct queue_entry
*q
= newq
; q
; q
= q
->next
)
306 record_queue_map(h
, q
->id
, NULL
, q
);
308 /* The easy bit: delete rows not present any more. In the same pass we
309 * update the secret column containing the queue_entry pointer. */
311 fprintf(stderr
, "%s: deleting rows...\n", ql
->name
);
314 gboolean it
= gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
),
316 int inserted
= 0, deleted
= 0, kept
= 0;
318 struct queue_entry
*q
= ql_iter_to_q(GTK_TREE_MODEL(ql
->store
), iter
);
319 const struct newqueue_data
*nqd
= hash_find(h
, q
->id
);
321 /* Tell this row that it belongs to the new version of the queue */
322 gtk_list_store_set(ql
->store
, iter
,
323 ql
->ncolumns
+ QUEUEPOINTER_COLUMN
, nqd
->new,
325 it
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), iter
);
328 /* Delete this row (and move iter to the next one) */
330 fprintf(stderr
, " delete %s\n", q
->id
);
332 it
= gtk_list_store_remove(ql
->store
, iter
);
337 /* Now every row's secret column is right, but we might be missing new rows
338 * and they might be in the wrong order */
340 /* We're going to have to support arbitrary rearrangements, so we might as
341 * well add new elements at the end. */
343 fprintf(stderr
, "%s: adding rows...\n", ql
->name
);
345 struct queue_entry
*after
= 0;
346 for(struct queue_entry
*q
= newq
; q
; q
= q
->next
) {
347 const struct newqueue_data
*nqd
= hash_find(h
, q
->id
);
350 /* Try to insert at the right sort of place */
351 GtkTreeIter where
[1];
352 gboolean wit
= gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
),
354 while(wit
&& ql_iter_to_q(GTK_TREE_MODEL(ql
->store
), where
) != after
)
355 wit
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), where
);
357 gtk_list_store_insert_after(ql
->store
, iter
, where
);
359 gtk_list_store_append(ql
->store
, iter
);
361 gtk_list_store_prepend(ql
->store
, iter
);
362 gtk_list_store_set(ql
->store
, iter
,
363 ql
->ncolumns
+ QUEUEPOINTER_COLUMN
, q
,
366 fprintf(stderr
, " add %s\n", q
->id
);
373 /* Now exactly the right set of rows are present, and they have the right
374 * queue_entry pointers in their secret column, but they may be in the wrong
377 * The current code is simple but amounts to a bubble-sort - we might easily
378 * called gtk_tree_model_iter_next a couple of thousand times.
381 fprintf(stderr
, "%s: rearranging rows\n", ql
->name
);
382 fprintf(stderr
, "%s: target state:\n", ql
->name
);
384 fprintf(stderr
, "%s: current state:\n", ql
->name
);
387 it
= gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql
->store
), iter
);
388 struct queue_entry
*tq
= newq
; /* t-for-target */
389 int swaps
= 0, searches
= 0;
392 struct queue_entry
*cq
= ql_iter_to_q(GTK_TREE_MODEL(ql
->store
), iter
);
395 /* Everything has the right queue pointer (see above) so it's sufficient to
396 * compare pointers to detect mismatches */
399 fprintf(stderr
, " pointer mismatch at row %d\n", row
);
400 fprintf(stderr
, " target id %s\n", tq
->id
);
401 fprintf(stderr
, " actual id %s\n", cq
->id
);
403 /* Start looking for the target row fromn the next row */
404 GtkTreeIter next
[1] = { *iter
};
405 gboolean nit
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), next
);
407 struct queue_entry
*nq
= ql_iter_to_q(GTK_TREE_MODEL(ql
->store
), next
);
409 fprintf(stderr
, " candidate: %s\n", nq
->id
);
413 nit
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), next
);
416 /* Note that this assertion will fail in the face of duplicate IDs.
417 * q->id really does need to be unique. */
419 gtk_list_store_swap(ql
->store
, iter
, next
);
422 fprintf(stderr
, "%s: found it. new row state:\n", ql
->name
);
427 /* ...and onto the next one */
428 it
= gtk_tree_model_iter_next(GTK_TREE_MODEL(ql
->store
), iter
);
433 fprintf(stderr
, "%6s: %3d kept %3d inserted %3d deleted %3d swaps %4d searches\n", ql
->name
,
434 kept
, inserted
, deleted
, swaps
, searches
);
435 fprintf(stderr
, "done\n");
438 /* Set the rest of the columns in new rows */
439 ql_update_list_store(ql
);
443 /* Drag and drop ------------------------------------------------------------ */
445 /** @brief Identify the drop path
446 * @param w Destination tree view widget
447 * @param model Underlying tree model
448 * @param wx X coordinate
449 * @param wy Y coordinate
450 * @param posp Where to store relative position
451 * @return Target path or NULL
453 * This is used by ql_drag_motion() and ql_drag_data_received() to identify a
454 * drop would or does land. It's important that they use the same code since
455 * otherwise the visual feedback can be inconsistent with the actual effect!
457 * Remember to free the returned path.
459 static GtkTreePath
*ql_drop_path(GtkWidget
*w
,
462 GtkTreeViewDropPosition
*posp
) {
463 GtkTreePath
*path
= NULL
;
464 GtkTreeViewDropPosition pos
;
465 GtkTreeIter iter
[1], last
[1];
468 gtk_tree_view_convert_widget_to_tree_coords(GTK_TREE_VIEW(w
),
470 if(gtk_tree_view_get_dest_row_at_pos(GTK_TREE_VIEW(w
),
474 //fprintf(stderr, "gtk_tree_view_get_dest_row_at_pos() -> TRUE\n");
475 // Normalize drop position
477 case GTK_TREE_VIEW_DROP_INTO_OR_BEFORE
:
478 pos
= GTK_TREE_VIEW_DROP_BEFORE
;
480 case GTK_TREE_VIEW_DROP_INTO_OR_AFTER
:
481 pos
= GTK_TREE_VIEW_DROP_AFTER
;
485 } else if(gtk_tree_model_get_iter_first(model
, iter
)) {
486 /* If the pointer isn't over any particular row then either it's below
487 * the last row, in which case we want the dropzone to be below that row;
488 * or it's above the first row (in the column headings) in which case we
489 * want the dropzone to be above that row. */
491 /* Find the last row */
494 } while(gtk_tree_model_iter_next(model
, iter
));
495 /* The drop target is just after it */
496 pos
= GTK_TREE_VIEW_DROP_AFTER
;
499 /* The drop target will be just before the first row */
500 pos
= GTK_TREE_VIEW_DROP_BEFORE
;
502 path
= gtk_tree_model_get_path(model
, iter
);
509 static const char *act(GdkDragAction action
) {
513 if(action
& GDK_ACTION_DEFAULT
)
514 dynstr_append_string(d
, "|DEFAULT");
515 if(action
& GDK_ACTION_COPY
)
516 dynstr_append_string(d
, "|COPY");
517 if(action
& GDK_ACTION_MOVE
)
518 dynstr_append_string(d
, "|MOVE");
519 if(action
& GDK_ACTION_LINK
)
520 dynstr_append_string(d
, "|LINK");
521 if(action
& GDK_ACTION_PRIVATE
)
522 dynstr_append_string(d
, "|PRIVATE");
523 if(action
& GDK_ACTION_ASK
)
524 dynstr_append_string(d
, "|ASK");
526 return d
->nvec ? d
->vec
+ 1 : "";
530 /** @brief Called when a drag moves within a candidate destination
531 * @param w Destination widget
532 * @param dc Drag context
533 * @param x Current pointer location
534 * @param y Current pointer location
535 * @param time_ Current time
536 * @param user_data Pointer to queuelike
537 * @return TRUE in a dropzone, otherwise FALSE
539 * This is the handler for the "drag-motion" signal.
541 static gboolean
ql_drag_motion(GtkWidget
*w
,
546 gpointer user_data
) {
547 struct queuelike
*const ql
= user_data
;
548 GdkDragAction action
= 0;
550 // GTK_DEST_DEFAULT_MOTION vets actions as follows:
551 // 1) if dc->suggested_action is in the gtk_drag_dest_set actions
552 // then dc->suggested_action is taken as the action.
553 // 2) otherwise if dc->actions intersects the gtk_drag_dest_set actions
554 // then the lowest-numbered member of the intersection is chosen.
555 // 3) otherwise no member is chosen and gdk_drag_status() is called
556 // with action=0 to refuse the drop.
557 if(dc
->suggested_action
) {
558 if(dc
->suggested_action
& (GDK_ACTION_MOVE
|GDK_ACTION_COPY
))
559 action
= dc
->suggested_action
;
560 } else if(dc
->actions
& GDK_ACTION_MOVE
)
561 action
= GDK_ACTION_MOVE
;
562 else if(dc
->actions
& GDK_ACTION_COPY
)
563 action
= GDK_ACTION_COPY
;
564 /* TODO this comes up with the wrong answer sometimes. If we are in the
565 * middle of a rearrange then the suggested action will be COPY, which we'll
566 * take, even though MOVE would actually be appropriate. The drag still
567 * seems to work, but it _is_ wrong. The answer is to take the target into
569 /*fprintf(stderr, "suggested %s actions %s result %s\n",
570 act(dc->suggested_action), act(dc->actions), act(action));*/
572 // If the action is acceptable then we see if this widget is acceptable
573 if(gtk_drag_dest_find_target(w
, dc
, NULL
) == GDK_NONE
)
577 //fprintf(stderr, "drag action: %u\n", action);
578 gdk_drag_status(dc
, action
, time_
);
580 GtkTreeViewDropPosition pos
;
582 // Find the drop target
583 GtkTreePath
*path
= ql_drop_path(w
, GTK_TREE_MODEL(ql
->store
), x
, y
, &pos
);
584 // Highlight drop target
585 gtk_tree_view_set_drag_dest_row(GTK_TREE_VIEW(w
), path
, pos
);
587 gtk_tree_path_free(path
);
589 autoscroll_add(GTK_TREE_VIEW(w
));
590 return TRUE
; /* We are (always) in a drop zone */
593 /** @brief Called when a drag moves leaves a candidate destination
594 * @param w Destination widget
595 * @param dc Drag context
596 * @param time_ Current time
597 * @param user_data Pointer to queuelike
599 * This is the handler for the "drag-leave" signal.
601 * It turns out that we get a drag-leave event when the data is dropped, too
602 * (See _gtk_drag_dest_handle_event). This seems logically consistent and is
603 * convenient too - for instance it's why autoscroll_remove() gets called at
604 * the end of a drag+drop sequence.
606 static void ql_drag_leave(GtkWidget
*w
,
607 GdkDragContext
attribute((unused
)) *dc
,
608 guint
attribute((unused
)) time_
,
609 gpointer
attribute((unused
)) user_data
) {
610 //struct queuelike *const ql = user_data;
612 gtk_tree_view_set_drag_dest_row(GTK_TREE_VIEW(w
), NULL
, 0);
613 autoscroll_remove(GTK_TREE_VIEW(w
));
616 /** @brief Callback to add selected tracks to the selection data
618 * Called from ql_drag_data_get().
620 static void ql_drag_data_get_collect(GtkTreeModel
*model
,
621 GtkTreePath
attribute((unused
)) *path
,
624 struct dynstr
*const result
= data
;
625 struct queue_entry
*const q
= ql_iter_to_q(model
, iter
);
627 dynstr_append_string(result
, q
->id
);
628 dynstr_append(result
, '\n');
629 dynstr_append_string(result
, q
->track
);
630 dynstr_append(result
, '\n');
633 /** @brief Called to extract the dragged data from the source queuelike
634 * @param w Source widget (the tree view)
635 * @param dc Drag context
636 * @param data Where to put the answer
637 * @param info_ Target @c info parameter
638 * @param time_ Time data requested (for some reason not a @c time_t)
639 * @param user_data The queuelike
641 * The list of tracks is converted into a single string, consisting of IDs
642 * and track names. Each is terminated by a newline. Including both ID and
643 * track name means that the receiver can use whichever happens to be more
646 * If there are no IDs for rows in this widget then the ID half is undefined.
648 * This is the handler for the "drag-data-get" signal.
650 static void ql_drag_data_get(GtkWidget
attribute((unused
)) *w
,
651 GdkDragContext
attribute((unused
)) *dc
,
652 GtkSelectionData
*data
,
653 guint
attribute((unused
)) info
,
654 guint
attribute((unused
)) time_
,
655 gpointer user_data
) {
656 struct queuelike
*const ql
= user_data
;
657 struct dynstr result
[1];
659 //fprintf(stderr, "ql_drag_data_get %s info=%d\n", ql->name, info);
661 gtk_tree_selection_selected_foreach(ql
->selection
,
662 ql_drag_data_get_collect
,
664 // TODO must not be able to drag playing track!
665 //fprintf(stderr, "drag-data-get: %.*s\n",
666 // result->nvec, result->vec);
667 /* gtk_selection_data_set_text() insists that data->target is one of a
668 * variety of stringy atoms. TODO: where does this value actually come
670 gtk_selection_data_set(data
,
672 8, (guchar
*)result
->vec
, result
->nvec
);
675 /** @brief Called when drag data is received
676 * @param w Target widget (the tree view)
677 * @param dc Drag context
678 * @param x The drop location
679 * @param y The drop location
680 * @param data The selection data
681 * @param info_ The target type that was chosen
682 * @param time_ Time data received (for some reason not a @c time_t)
683 * @param user_data The queuelike
685 * This is the handler for the "drag-data-received" signal.
687 static void ql_drag_data_received(GtkWidget
attribute((unused
)) *w
,
688 GdkDragContext
attribute((unused
)) *dc
,
691 GtkSelectionData
*data
,
693 guint
attribute((unused
)) time_
,
694 gpointer user_data
) {
695 struct queuelike
*const ql
= user_data
;
697 struct vector ids
[1], tracks
[1];
700 //fprintf(stderr, "drag-data-received: %d,%d info=%u\n", x, y, info_);
701 /* Get the selection string */
702 p
= result
= (char *)gtk_selection_data_get_text(data
);
704 //fprintf(stderr, "gtk_selection_data_get_text() returned NULL\n");
707 //fprintf(stderr, "%s--\n", result);
708 /* Parse it back into IDs and track names */
712 char *nl
= strchr(p
, '\n');
716 //fprintf(stderr, " %s\n", p);
717 vector_append(parity
++ & 1 ? tracks
: ids
, xstrdup(p
));
721 if(ids
->nvec
!= tracks
->nvec
) {
722 //fprintf(stderr, " inconsistent drag data!\n");
725 vector_terminate(ids
);
726 vector_terminate(tracks
);
727 /* Figure out which row the drop precedes (if any) */
728 GtkTreeViewDropPosition pos
;
729 struct queue_entry
*q
;
730 GtkTreePath
*path
= ql_drop_path(w
, GTK_TREE_MODEL(ql
->store
), x
, y
, &pos
);
732 q
= ql_path_to_q(GTK_TREE_MODEL(ql
->store
), path
);
733 //fprintf(stderr, " drop path: %s q=%p pos=%d\n",
734 // gtk_tree_path_to_string(path), q, pos);
736 /* This generally means a drop past the end of the queue. We find the last
737 * element in the queue and ask to move after that. */
738 for(q
= ql
->q
; q
&& q
->next
; q
= q
->next
)
740 //fprintf(stderr, " after end. q=%p. pos=%d\n", q, pos);
743 case GTK_TREE_VIEW_DROP_BEFORE
:
744 case GTK_TREE_VIEW_DROP_INTO_OR_BEFORE
:
747 //fprintf(stderr, " but we like to drop near %s\n",
748 // q ? q->id : "NULL");
754 /* Guarantee we never drop an empty list */
757 /* Note that q->id can match one of ids[]. This doesn't matter for
758 * moveafter but TODO may matter for playlist support. */
760 case QUEUED_TRACKS_ID
:
761 case PLAYLIST_TRACKS_ID
:
762 /* Rearrangement within some widget. Send ID and track data. */
763 ql
->drop(ql
, tracks
->nvec
, tracks
->vec
, ids
->vec
, q
);
765 case PLAYABLE_TRACKS_ID
:
766 /* Copying between widgets. IDs mean nothing so don't send them. */
767 ql
->drop(ql
, tracks
->nvec
, tracks
->vec
, NULL
, q
);
771 gtk_tree_path_free(path
);
774 static int count_drag_targets(const GtkTargetEntry
*targets
) {
775 const GtkTargetEntry
*t
= targets
;
782 /** @brief Initialize a @ref queuelike */
783 GtkWidget
*init_queuelike(struct queuelike
*ql
) {
784 D(("init_queuelike"));
785 /* Create the list store. We add an extra column to hold a pointer to the
787 GType
*types
= xcalloc(ql
->ncolumns
+ EXTRA_COLUMNS
, sizeof (GType
));
788 for(int n
= 0; n
< ql
->ncolumns
+ EXTRA_COLUMNS
; ++n
)
789 types
[n
] = G_TYPE_STRING
;
790 types
[ql
->ncolumns
+ QUEUEPOINTER_COLUMN
] = G_TYPE_POINTER
;
791 ql
->store
= gtk_list_store_newv(ql
->ncolumns
+ EXTRA_COLUMNS
, types
);
792 g_object_set_data(G_OBJECT(ql
->store
), "ql", (void *)ql
);
794 /* Create the view */
795 ql
->view
= gtk_tree_view_new_with_model(GTK_TREE_MODEL(ql
->store
));
796 gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(ql
->view
), TRUE
);
798 /* Create cell renderers and label columns */
799 for(int n
= 0; n
< ql
->ncolumns
; ++n
) {
800 GtkCellRenderer
*r
= gtk_cell_renderer_text_new();
801 if(ql
->columns
[n
].flags
& COL_ELLIPSIZE
)
802 g_object_set(r
, "ellipsize", PANGO_ELLIPSIZE_END
, (char *)0);
803 if(ql
->columns
[n
].flags
& COL_RIGHT
)
804 g_object_set(r
, "xalign", (gfloat
)1.0, (char *)0);
805 GtkTreeViewColumn
*c
= gtk_tree_view_column_new_with_attributes
806 (ql
->columns
[n
].name
,
809 "background", ql
->ncolumns
+ BACKGROUND_COLUMN
,
810 "foreground", ql
->ncolumns
+ FOREGROUND_COLUMN
,
812 gtk_tree_view_column_set_resizable(c
, TRUE
);
813 gtk_tree_view_column_set_reorderable(c
, TRUE
);
814 if(ql
->columns
[n
].flags
& COL_EXPAND
)
815 g_object_set(c
, "expand", TRUE
, (char *)0);
816 gtk_tree_view_append_column(GTK_TREE_VIEW(ql
->view
), c
);
819 /* The selection should support multiple things being selected */
820 ql
->selection
= gtk_tree_view_get_selection(GTK_TREE_VIEW(ql
->view
));
821 g_object_ref(ql
->selection
);
822 gtk_tree_selection_set_mode(ql
->selection
, GTK_SELECTION_MULTIPLE
);
824 /* Catch button presses */
825 g_signal_connect(ql
->view
, "button-press-event",
826 G_CALLBACK(ql_button_release
), ql
);
830 /* Originally this was:
832 * gtk_tree_view_set_reorderable(GTK_TREE_VIEW(ql->view), TRUE);
834 * However this has a two deficiencies:
836 * 1) Only one row can be dragged at once. It would be nice
837 * to be able to do bulk rearrangements since the server
838 * can cope with that well.
839 * 2) Dragging between windows is not possible. When playlist
840 * support appears, it should be possible to drag tracks
841 * from the choose tag into the playlist.
843 * At the time of writing neither of these problems are fully solved, the
844 * code as it stands is just a stepping stone in that direction.
847 /* This view will act as a drag source */
848 gtk_drag_source_set(ql
->view
,
850 ql
->drag_source_targets
,
851 count_drag_targets(ql
->drag_source_targets
),
852 ql
->drag_dest_actions
);
853 /* This view will act as a drag destination */
854 gtk_drag_dest_set(ql
->view
,
855 GTK_DEST_DEFAULT_HIGHLIGHT
|GTK_DEST_DEFAULT_DROP
,
856 ql
->drag_dest_targets
,
857 count_drag_targets(ql
->drag_dest_targets
),
858 ql
->drag_dest_actions
);
859 g_signal_connect(ql
->view
, "drag-motion",
860 G_CALLBACK(ql_drag_motion
), ql
);
861 g_signal_connect(ql
->view
, "drag-leave",
862 G_CALLBACK(ql_drag_leave
), ql
);
863 g_signal_connect(ql
->view
, "drag-data-get",
864 G_CALLBACK(ql_drag_data_get
), ql
);
865 g_signal_connect(ql
->view
, "drag-data-received",
866 G_CALLBACK(ql_drag_data_received
), ql
);
867 make_treeview_multidrag(ql
->view
, NULL
);
868 // TODO playing track should be refused by predicate arg
870 /* For queues that cannot accept a drop we still accept a copy out */
871 gtk_drag_source_set(ql
->view
,
873 ql
->drag_source_targets
,
874 count_drag_targets(ql
->drag_source_targets
),
875 ql
->drag_source_actions
);
876 g_signal_connect(ql
->view
, "drag-data-get",
877 G_CALLBACK(ql_drag_data_get
), ql
);
878 make_treeview_multidrag(ql
->view
, NULL
);
886 /* Update display text when lookups complete */
887 event_register("lookups-completed", queue_lookups_completed
, ql
);
889 GtkWidget
*scrolled
= scroll_widget(ql
->view
);
890 g_object_set_data(G_OBJECT(scrolled
), "type", (void *)ql_tabtype(ql
));
894 /** @brief Destroy a queuelike
895 * @param ql Queuelike to destroy
897 * Returns @p ql to its initial state.
899 void destroy_queuelike(struct queuelike
*ql
) {
901 g_object_unref(ql
->store
);
905 gtk_object_destroy(GTK_OBJECT(ql
->view
));
909 gtk_object_destroy(GTK_OBJECT(ql
->menu
));
913 g_object_unref(ql
->selection
);
914 ql
->selection
= NULL
;