Commit | Line | Data |
---|---|---|
c133bd3c RK |
1 | /* |
2 | * This file is part of DisOrder | |
0beb320e | 3 | * Copyright (C) 2006-2009 Richard Kettlewell |
c133bd3c | 4 | * |
e7eb3a27 | 5 | * This program is free software: you can redistribute it and/or modify |
c133bd3c | 6 | * it under the terms of the GNU General Public License as published by |
e7eb3a27 | 7 | * the Free Software Foundation, either version 3 of the License, or |
c133bd3c RK |
8 | * (at your option) any later version. |
9 | * | |
e7eb3a27 RK |
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. | |
14 | * | |
c133bd3c | 15 | * You should have received a copy of the GNU General Public License |
e7eb3a27 | 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
c133bd3c RK |
17 | */ |
18 | /** @file disobedience/queue-generic.c | |
132a5a4a | 19 | * @brief Disobedience queue widgets |
c133bd3c RK |
20 | * |
21 | * This file provides contains code shared between all the queue-like | |
22 | * widgets - the queue, the recent list and the added tracks list. | |
23 | * | |
24 | * This code is in the process of being rewritten to use the native list | |
25 | * widget. | |
26 | * | |
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. | |
30 | * | |
31 | * When new contents turn up we rearrange the list store accordingly. | |
32 | * | |
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. | |
ee7552f8 RK |
36 | * |
37 | * To do: | |
ee7552f8 | 38 | * - display playing row in a different color? |
c133bd3c RK |
39 | */ |
40 | #include "disobedience.h" | |
6982880f | 41 | #include "popup.h" |
c133bd3c RK |
42 | #include "queue-generic.h" |
43 | ||
44 | static struct queuelike *const queuelikes[] = { | |
45 | &ql_queue, &ql_recent, &ql_added | |
46 | }; | |
47 | #define NQUEUELIKES (sizeof queuelikes / sizeof *queuelikes) | |
48 | ||
0beb320e RK |
49 | static const GtkTargetEntry queuelike_targets[] = { |
50 | { | |
51 | (char *)"text/x-disorder-track-data", /* drag type */ | |
52 | GTK_TARGET_SAME_WIDGET, /* rearrangement only for now */ | |
53 | 0 /* ID value */ | |
54 | }, | |
55 | }; | |
56 | ||
c133bd3c RK |
57 | /* Track detail lookup ----------------------------------------------------- */ |
58 | ||
ad47bd4c RK |
59 | static void queue_lookups_completed(const char attribute((unused)) *event, |
60 | void attribute((unused)) *eventdata, | |
61 | void *callbackdata) { | |
62 | struct queuelike *ql = callbackdata; | |
63 | ql_update_list_store(ql); | |
c133bd3c RK |
64 | } |
65 | ||
66 | /* Column formatting -------------------------------------------------------- */ | |
67 | ||
68 | /** @brief Format the 'when' column */ | |
69 | const char *column_when(const struct queue_entry *q, | |
70 | const char attribute((unused)) *data) { | |
71 | char when[64]; | |
72 | struct tm tm; | |
73 | time_t t; | |
74 | ||
75 | D(("column_when")); | |
76 | switch(q->state) { | |
77 | case playing_isscratch: | |
78 | case playing_unplayed: | |
79 | case playing_random: | |
80 | t = q->expected; | |
81 | break; | |
82 | case playing_failed: | |
83 | case playing_no_player: | |
84 | case playing_ok: | |
85 | case playing_scratched: | |
86 | case playing_started: | |
87 | case playing_paused: | |
88 | case playing_quitting: | |
89 | t = q->played; | |
90 | break; | |
91 | default: | |
92 | t = 0; | |
93 | break; | |
94 | } | |
95 | if(t) | |
96 | strftime(when, sizeof when, "%H:%M", localtime_r(&t, &tm)); | |
97 | else | |
98 | when[0] = 0; | |
99 | return xstrdup(when); | |
100 | } | |
101 | ||
102 | /** @brief Format the 'who' column */ | |
103 | const char *column_who(const struct queue_entry *q, | |
104 | const char attribute((unused)) *data) { | |
105 | D(("column_who")); | |
106 | return q->submitter ? q->submitter : ""; | |
107 | } | |
108 | ||
109 | /** @brief Format one of the track name columns */ | |
110 | const char *column_namepart(const struct queue_entry *q, | |
22717074 | 111 | const char *data) { |
c133bd3c RK |
112 | D(("column_namepart")); |
113 | return namepart(q->track, "display", data); | |
114 | } | |
115 | ||
116 | /** @brief Format the length column */ | |
117 | const char *column_length(const struct queue_entry *q, | |
118 | const char attribute((unused)) *data) { | |
119 | D(("column_length")); | |
120 | long l; | |
121 | time_t now; | |
122 | char *played = 0, *length = 0; | |
123 | ||
124 | /* Work out what to say for the length */ | |
ad47bd4c | 125 | l = namepart_length(q->track); |
c133bd3c RK |
126 | if(l > 0) |
127 | byte_xasprintf(&length, "%ld:%02ld", l / 60, l % 60); | |
128 | else | |
129 | byte_xasprintf(&length, "?:??"); | |
130 | /* For the currently playing track we want to report how much of the track | |
131 | * has been played */ | |
132 | if(q == playing_track) { | |
133 | /* log_state() arranges that we re-get the playing data whenever the | |
134 | * pause/resume state changes */ | |
135 | if(last_state & DISORDER_TRACK_PAUSED) | |
136 | l = playing_track->sofar; | |
137 | else { | |
3900d6d6 RK |
138 | if(!last_playing) |
139 | return NULL; | |
4265e5d3 | 140 | xtime(&now); |
c133bd3c RK |
141 | l = playing_track->sofar + (now - last_playing); |
142 | } | |
143 | byte_xasprintf(&played, "%ld:%02ld/%s", l / 60, l % 60, length); | |
144 | return played; | |
145 | } else | |
146 | return length; | |
147 | } | |
148 | ||
c133bd3c RK |
149 | /* List store maintenance -------------------------------------------------- */ |
150 | ||
22717074 | 151 | /** @brief Return the @ref queue_entry corresponding to @p iter |
83fb99f9 | 152 | * @param model Model that owns @p iter |
22717074 | 153 | * @param iter Tree iterator |
82db9336 | 154 | * @return Pointer to queue entry |
22717074 | 155 | */ |
83fb99f9 | 156 | struct queue_entry *ql_iter_to_q(GtkTreeModel *model, |
22717074 | 157 | GtkTreeIter *iter) { |
83fb99f9 | 158 | struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql"); |
22717074 RK |
159 | GValue v[1]; |
160 | memset(v, 0, sizeof v); | |
0fb5e8f3 | 161 | gtk_tree_model_get_value(model, iter, ql->ncolumns + QUEUEPOINTER_COLUMN, v); |
22717074 RK |
162 | assert(G_VALUE_TYPE(v) == G_TYPE_POINTER); |
163 | struct queue_entry *const q = g_value_get_pointer(v); | |
164 | g_value_unset(v); | |
165 | return q; | |
166 | } | |
167 | ||
0beb320e RK |
168 | /** @brief Return the @ref queue_entry corresponding to @p path |
169 | * @param model Model to query | |
170 | * @param path Path into tree | |
171 | * @return Pointer to queue entry or NULL | |
172 | */ | |
173 | struct queue_entry *ql_path_to_q(GtkTreeModel *model, | |
174 | GtkTreePath *path) { | |
175 | GtkTreeIter iter[1]; | |
176 | if(!gtk_tree_model_get_iter(model, iter, path)) | |
177 | return NULL; | |
178 | return ql_iter_to_q(model, iter); | |
179 | } | |
180 | ||
c133bd3c RK |
181 | /** @brief Update one row of a list store |
182 | * @param q Queue entry | |
183 | * @param iter Iterator referring to row or NULL to work it out | |
184 | */ | |
185 | void ql_update_row(struct queue_entry *q, | |
186 | GtkTreeIter *iter) { | |
187 | const struct queuelike *const ql = q->ql; | |
188 | ||
189 | D(("ql_update_row")); | |
190 | /* If no iter was supplied, work it out */ | |
191 | GtkTreeIter my_iter[1]; | |
192 | if(!iter) { | |
193 | gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), my_iter); | |
194 | struct queue_entry *qq; | |
195 | for(qq = ql->q; qq && q != qq; qq = qq->next) | |
196 | gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), my_iter); | |
197 | if(!qq) | |
198 | return; | |
199 | iter = my_iter; | |
200 | } | |
201 | /* Update all the columns */ | |
3900d6d6 RK |
202 | for(int col = 0; col < ql->ncolumns; ++col) { |
203 | const char *const v = ql->columns[col].value(q, | |
204 | ql->columns[col].data); | |
205 | if(v) | |
206 | gtk_list_store_set(ql->store, iter, | |
207 | col, v, | |
208 | -1); | |
209 | } | |
0fb5e8f3 RK |
210 | gtk_list_store_set(ql->store, iter, |
211 | ql->ncolumns + QUEUEPOINTER_COLUMN, q, | |
212 | -1); | |
213 | if(q == playing_track) | |
214 | gtk_list_store_set(ql->store, iter, | |
215 | ql->ncolumns + BACKGROUND_COLUMN, BG_PLAYING, | |
216 | ql->ncolumns + FOREGROUND_COLUMN, FG_PLAYING, | |
217 | -1); | |
218 | else | |
219 | gtk_list_store_set(ql->store, iter, | |
220 | ql->ncolumns + BACKGROUND_COLUMN, (char *)0, | |
221 | ql->ncolumns + FOREGROUND_COLUMN, (char *)0, | |
222 | -1); | |
c133bd3c RK |
223 | } |
224 | ||
225 | /** @brief Update the list store | |
226 | * @param ql Queuelike to update | |
227 | * | |
228 | * Called when new namepart data is available (and initially). Doesn't change | |
229 | * the rows, just updates the cell values. | |
230 | */ | |
231 | void ql_update_list_store(struct queuelike *ql) { | |
232 | D(("ql_update_list_store")); | |
233 | GtkTreeIter iter[1]; | |
234 | gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), iter); | |
235 | for(struct queue_entry *q = ql->q; q; q = q->next) { | |
236 | ql_update_row(q, iter); | |
237 | gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
238 | } | |
239 | } | |
240 | ||
83fb99f9 RK |
241 | struct newqueue_data { |
242 | struct queue_entry *old, *new; | |
243 | }; | |
244 | ||
245 | static void record_queue_map(hash *h, | |
246 | const char *id, | |
247 | struct queue_entry *old, | |
248 | struct queue_entry *new) { | |
249 | struct newqueue_data *nqd; | |
250 | ||
251 | if(!(nqd = hash_find(h, id))) { | |
252 | static const struct newqueue_data empty[1]; | |
253 | hash_add(h, id, empty, HASH_INSERT); | |
254 | nqd = hash_find(h, id); | |
255 | } | |
256 | if(old) | |
257 | nqd->old = old; | |
258 | if(new) | |
259 | nqd->new = new; | |
260 | } | |
261 | ||
262 | #if 0 | |
263 | static void dump_queue(struct queue_entry *head, struct queue_entry *mark) { | |
264 | for(struct queue_entry *q = head; q; q = q->next) { | |
265 | if(q == mark) | |
266 | fprintf(stderr, "!"); | |
267 | fprintf(stderr, "%s", q->id); | |
268 | if(q->next) | |
269 | fprintf(stderr, " "); | |
270 | } | |
271 | fprintf(stderr, "\n"); | |
272 | } | |
273 | ||
274 | static void dump_rows(struct queuelike *ql) { | |
275 | GtkTreeIter iter[1]; | |
276 | gboolean it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
277 | iter); | |
278 | while(it) { | |
279 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
280 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
281 | fprintf(stderr, "%s", q->id); | |
282 | if(it) | |
283 | fprintf(stderr, " "); | |
284 | } | |
285 | fprintf(stderr, "\n"); | |
286 | } | |
287 | #endif | |
288 | ||
c133bd3c RK |
289 | /** @brief Reset the list store |
290 | * @param ql Queuelike to reset | |
83fb99f9 | 291 | * @param newq New queue contents/ordering |
c133bd3c | 292 | * |
83fb99f9 | 293 | * Updates the queue to match @p newq |
c133bd3c RK |
294 | */ |
295 | void ql_new_queue(struct queuelike *ql, | |
296 | struct queue_entry *newq) { | |
297 | D(("ql_new_queue")); | |
83fb99f9 RK |
298 | ++suppress_actions; |
299 | ||
300 | /* Tell every queue entry which queue owns it */ | |
301 | //fprintf(stderr, "%s: filling in q->ql\n", ql->name); | |
302 | for(struct queue_entry *q = newq; q; q = q->next) | |
c133bd3c | 303 | q->ql = ql; |
83fb99f9 RK |
304 | |
305 | //fprintf(stderr, "%s: constructing h\n", ql->name); | |
306 | /* Construct map from id to new and old structures */ | |
307 | hash *h = hash_new(sizeof(struct newqueue_data)); | |
308 | for(struct queue_entry *q = ql->q; q; q = q->next) | |
309 | record_queue_map(h, q->id, q, NULL); | |
310 | for(struct queue_entry *q = newq; q; q = q->next) | |
311 | record_queue_map(h, q->id, NULL, q); | |
312 | ||
313 | /* The easy bit: delete rows not present any more. In the same pass we | |
314 | * update the secret column containing the queue_entry pointer. */ | |
315 | //fprintf(stderr, "%s: deleting rows...\n", ql->name); | |
316 | GtkTreeIter iter[1]; | |
317 | gboolean it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
318 | iter); | |
319 | int inserted = 0, deleted = 0, kept = 0; | |
320 | while(it) { | |
321 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
322 | const struct newqueue_data *nqd = hash_find(h, q->id); | |
323 | if(nqd->new) { | |
324 | /* Tell this row that it belongs to the new version of the queue */ | |
0fb5e8f3 RK |
325 | gtk_list_store_set(ql->store, iter, |
326 | ql->ncolumns + QUEUEPOINTER_COLUMN, nqd->new, | |
327 | -1); | |
83fb99f9 RK |
328 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); |
329 | ++kept; | |
330 | } else { | |
331 | /* Delete this row (and move iter to the next one) */ | |
332 | //fprintf(stderr, " delete %s", q->id); | |
333 | it = gtk_list_store_remove(ql->store, iter); | |
334 | ++deleted; | |
335 | } | |
c133bd3c | 336 | } |
83fb99f9 RK |
337 | |
338 | /* Now every row's secret column is right, but we might be missing new rows | |
339 | * and they might be in the wrong order */ | |
340 | ||
341 | /* We're going to have to support arbitrary rearrangements, so we might as | |
342 | * well add new elements at the end. */ | |
343 | //fprintf(stderr, "%s: adding rows...\n", ql->name); | |
344 | struct queue_entry *after = 0; | |
345 | for(struct queue_entry *q = newq; q; q = q->next) { | |
346 | const struct newqueue_data *nqd = hash_find(h, q->id); | |
347 | if(!nqd->old) { | |
83fb99f9 RK |
348 | if(after) { |
349 | /* Try to insert at the right sort of place */ | |
350 | GtkTreeIter where[1]; | |
351 | gboolean wit = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
352 | where); | |
353 | while(wit && ql_iter_to_q(GTK_TREE_MODEL(ql->store), where) != after) | |
354 | wit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), where); | |
355 | if(wit) | |
356 | gtk_list_store_insert_after(ql->store, iter, where); | |
357 | else | |
358 | gtk_list_store_append(ql->store, iter); | |
359 | } else | |
360 | gtk_list_store_prepend(ql->store, iter); | |
0fb5e8f3 RK |
361 | gtk_list_store_set(ql->store, iter, |
362 | ql->ncolumns + QUEUEPOINTER_COLUMN, q, | |
363 | -1); | |
83fb99f9 RK |
364 | //fprintf(stderr, " add %s", q->id); |
365 | ++inserted; | |
366 | } | |
367 | after = newq; | |
368 | } | |
369 | ||
370 | /* Now exactly the right set of rows are present, and they have the right | |
371 | * queue_entry pointers in their secret column, but they may be in the wrong | |
372 | * order. | |
373 | * | |
374 | * The current code is simple but amounts to a bubble-sort - we might easily | |
375 | * called gtk_tree_model_iter_next a couple of thousand times. | |
376 | */ | |
377 | //fprintf(stderr, "%s: rearranging rows\n", ql->name); | |
378 | //fprintf(stderr, "%s: queue state: ", ql->name); | |
379 | //dump_queue(newq, 0); | |
380 | //fprintf(stderr, "%s: row state: ", ql->name); | |
381 | //dump_rows(ql); | |
382 | it = gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), | |
383 | iter); | |
384 | struct queue_entry *rq = newq; /* r for 'right, correct' */ | |
385 | int swaps = 0, searches = 0; | |
386 | while(it) { | |
387 | struct queue_entry *q = ql_iter_to_q(GTK_TREE_MODEL(ql->store), iter); | |
388 | //fprintf(stderr, " rq = %p, q = %p\n", rq, q); | |
389 | //fprintf(stderr, " rq->id = %s, q->id = %s\n", rq->id, q->id); | |
390 | ||
391 | if(q != rq) { | |
392 | //fprintf(stderr, " mismatch\n"); | |
393 | GtkTreeIter next[1] = { *iter }; | |
394 | gboolean nit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), next); | |
395 | while(nit) { | |
396 | struct queue_entry *nq = ql_iter_to_q(GTK_TREE_MODEL(ql->store), next); | |
397 | //fprintf(stderr, " candidate: %s\n", nq->id); | |
398 | if(nq == rq) | |
399 | break; | |
400 | nit = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), next); | |
401 | ++searches; | |
402 | } | |
403 | assert(nit); | |
404 | //fprintf(stderr, " found it\n"); | |
405 | gtk_list_store_swap(ql->store, iter, next); | |
406 | *iter = *next; | |
407 | //fprintf(stderr, "%s: new row state: ", ql->name); | |
408 | //dump_rows(ql); | |
409 | ++swaps; | |
410 | } | |
411 | /* ...and onto the next one */ | |
412 | it = gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
413 | rq = rq->next; | |
414 | } | |
415 | #if 0 | |
416 | fprintf(stderr, "%6s: %3d kept %3d inserted %3d deleted %3d swaps %4d searches\n", ql->name, | |
417 | kept, inserted, deleted, swaps, searches); | |
418 | #endif | |
419 | //fprintf(stderr, "done\n"); | |
420 | ql->q = newq; | |
421 | /* Set the rest of the columns in new rows */ | |
422 | ql_update_list_store(ql); | |
83fb99f9 | 423 | --suppress_actions; |
c133bd3c RK |
424 | } |
425 | ||
0beb320e RK |
426 | /** @brief Called when a drag operation from this queuelike begins |
427 | * @param w Source widget (the tree view) | |
428 | * @param dc Drag context | |
429 | * @param user_data The queuelike | |
430 | */ | |
431 | static void ql_drag_begin(GtkWidget attribute((unused)) *w, | |
432 | GdkDragContext attribute((unused)) *dc, | |
433 | gpointer user_data) { | |
434 | struct queuelike *const attribute((unused)) ql = user_data; | |
435 | ||
436 | fprintf(stderr, "drag-begin\n"); | |
437 | // TODO call gtk_drag_source_set_icon() to set a suitably informative | |
438 | // drag icon | |
439 | } | |
440 | ||
441 | /** @brief Callback to add selected tracks to the selection data | |
82db9336 | 442 | * |
0beb320e | 443 | * Called from ql_drag_data_get(). |
82db9336 | 444 | */ |
0beb320e RK |
445 | static void ql_drag_data_get_collect(GtkTreeModel *model, |
446 | GtkTreePath attribute((unused)) *path, | |
447 | GtkTreeIter *iter, | |
448 | gpointer data) { | |
449 | struct dynstr *const result = data; | |
450 | struct queue_entry *const q = ql_iter_to_q(model, iter); | |
451 | ||
452 | dynstr_append_string(result, q->id); | |
453 | dynstr_append(result, '\n'); | |
454 | dynstr_append_string(result, q->track); | |
455 | dynstr_append(result, '\n'); | |
456 | } | |
82db9336 | 457 | |
0beb320e RK |
458 | /** @brief Called to extract the dragged data from the source queuelike |
459 | * @param w Source widget (the tree view) | |
460 | * @param dc Drag context | |
461 | * @param data Where to put the answer | |
462 | * @param info_ Target @c info parameter | |
463 | * @param time_ Time data requested (for some reason not a @c time_t) | |
464 | * @param user_data The queuelike | |
465 | */ | |
466 | static void ql_drag_data_get(GtkWidget attribute((unused)) *w, | |
467 | GdkDragContext attribute((unused)) *dc, | |
468 | GtkSelectionData *data, | |
469 | guint attribute((unused)) info_, | |
470 | guint attribute((unused)) time_, | |
471 | gpointer user_data) { | |
82db9336 | 472 | struct queuelike *const ql = user_data; |
0beb320e RK |
473 | struct dynstr result[1]; |
474 | ||
475 | /* The list of tracks is converted into a single string, consisting of IDs | |
476 | * and track names. Each is terminated by a newline. Including both ID and | |
477 | * track name means that the receiver can use whichever happens to be more | |
478 | * convenient. */ | |
479 | dynstr_init(result); | |
480 | gtk_tree_selection_selected_foreach(ql->selection, | |
481 | ql_drag_data_get_collect, | |
482 | result); | |
483 | //fprintf(stderr, "drag-data-get: %.*s\n", | |
484 | // result->nvec, result->vec); | |
485 | /* gtk_selection_data_set_text() insists that data->target is one of a | |
486 | * variety of stringy atoms. TODO: where does this value actually come | |
487 | * from? */ | |
488 | gtk_selection_data_set(data, | |
489 | GDK_TARGET_STRING, | |
490 | 8, (guchar *)result->vec, result->nvec); | |
82db9336 RK |
491 | } |
492 | ||
0beb320e RK |
493 | /** @brief Called when drag data is received |
494 | * @param w Target widget (the tree view) | |
495 | * @param dc Drag context | |
496 | * @param x The drop location | |
497 | * @param y The drop location | |
498 | * @param data The selection data | |
499 | * @param info_ The target type that was chosen | |
500 | * @param time_ Time data received (for some reason not a @c time_t) | |
501 | * @param user_data The queuelike | |
502 | */ | |
503 | static void ql_drag_data_received(GtkWidget attribute((unused)) *w, | |
504 | GdkDragContext attribute((unused)) *dc, | |
505 | gint x, | |
506 | gint y, | |
507 | GtkSelectionData *data, | |
508 | guint attribute((unused)) info_, | |
509 | guint attribute((unused)) time_, | |
510 | gpointer user_data) { | |
82db9336 | 511 | struct queuelike *const ql = user_data; |
0beb320e RK |
512 | char *result, *p; |
513 | struct vector ids[1], tracks[1]; | |
514 | int parity = 0; | |
515 | ||
516 | //fprintf(stderr, "drag-data-received: %d,%d\n", x, y); | |
517 | /* Get the selection string */ | |
518 | p = result = (char *)gtk_selection_data_get_text(data); | |
519 | if(!result) { | |
520 | //fprintf(stderr, "gtk_selection_data_get_text() returned NULL\n"); | |
521 | return; | |
522 | } | |
523 | //fprintf(stderr, "%s--\n", result); | |
524 | /* Parse it back into IDs and track names */ | |
525 | vector_init(ids); | |
526 | vector_init(tracks); | |
527 | while(*p) { | |
528 | char *nl = strchr(p, '\n'); | |
529 | if(!nl) | |
530 | break; | |
531 | *nl = 0; | |
532 | //fprintf(stderr, " %s\n", p); | |
533 | vector_append(parity++ & 1 ? tracks : ids, xstrdup(p)); | |
534 | p = nl + 1; | |
535 | } | |
536 | g_free(result); | |
537 | if(ids->nvec != tracks->nvec) { | |
538 | //fprintf(stderr, " inconsistent drag data!\n"); | |
539 | return; | |
540 | } | |
541 | vector_terminate(ids); | |
542 | vector_terminate(tracks); | |
543 | /* Figure out which row the drop precedes (if any) */ | |
544 | GtkTreePath *path; | |
545 | GtkTreeViewDropPosition pos; | |
546 | struct queue_entry *q; | |
547 | if(!gtk_tree_view_get_dest_row_at_pos(GTK_TREE_VIEW(ql->view), x, y, | |
548 | &path, &pos)) { | |
549 | //fprintf(stderr, "gtk_tree_view_get_dest_row_at_pos returned FALSE\n"); | |
550 | /* This generally means a drop past the end of the queue. We find the last | |
551 | * element in the queue and ask to move after that. */ | |
552 | for(q = ql->q; q && q->next; q = q->next) | |
553 | ; | |
554 | } else { | |
555 | /* Convert the path to a queue entry pointer. */ | |
556 | q = ql_path_to_q(GTK_TREE_MODEL(ql->store), path); | |
557 | //fprintf(stderr, " tree view likes to drop near %s\n", | |
558 | // q->id ? q->id : "NULL"); | |
559 | /* TODO interpretation of q=NULL */ | |
560 | /* Q should point to the entry just before the insertion point, so that | |
561 | * moveafter works, or NULL to insert right at the start. We don't support | |
562 | * dropping into a row, since that doesn't make sense for us. */ | |
563 | switch(pos) { | |
564 | case GTK_TREE_VIEW_DROP_BEFORE: | |
565 | case GTK_TREE_VIEW_DROP_INTO_OR_BEFORE: | |
566 | if(q) { | |
567 | q = q->prev; | |
568 | //fprintf(stderr, " ...but we like to drop near %s\n", | |
569 | // q ? q->id : "NULL"); | |
570 | } | |
571 | break; | |
572 | default: | |
573 | break; | |
82db9336 | 574 | } |
82db9336 | 575 | } |
0beb320e RK |
576 | /* Note that q->id can match one of ids[]. This doesn't matter for |
577 | * moveafter but TODO may matter for playlist support. */ | |
578 | ql->drop(ql, tracks->nvec, tracks->vec, ids->vec, q); | |
82db9336 RK |
579 | } |
580 | ||
c133bd3c RK |
581 | /** @brief Initialize a @ref queuelike */ |
582 | GtkWidget *init_queuelike(struct queuelike *ql) { | |
583 | D(("init_queuelike")); | |
0fb5e8f3 RK |
584 | /* Create the list store. We add an extra column to hold a pointer to the |
585 | * queue_entry. */ | |
586 | GType *types = xcalloc(ql->ncolumns + EXTRA_COLUMNS, sizeof (GType)); | |
587 | for(int n = 0; n < ql->ncolumns + EXTRA_COLUMNS; ++n) | |
c133bd3c | 588 | types[n] = G_TYPE_STRING; |
0fb5e8f3 RK |
589 | types[ql->ncolumns + QUEUEPOINTER_COLUMN] = G_TYPE_POINTER; |
590 | ql->store = gtk_list_store_newv(ql->ncolumns + EXTRA_COLUMNS, types); | |
22717074 | 591 | g_object_set_data(G_OBJECT(ql->store), "ql", (void *)ql); |
c133bd3c RK |
592 | |
593 | /* Create the view */ | |
594 | ql->view = gtk_tree_view_new_with_model(GTK_TREE_MODEL(ql->store)); | |
1583d68f | 595 | gtk_tree_view_set_rules_hint(GTK_TREE_VIEW(ql->view), TRUE); |
c133bd3c RK |
596 | |
597 | /* Create cell renderers and label columns */ | |
598 | for(int n = 0; n < ql->ncolumns; ++n) { | |
599 | GtkCellRenderer *r = gtk_cell_renderer_text_new(); | |
b0b15b7c RK |
600 | if(ql->columns[n].flags & COL_ELLIPSIZE) |
601 | g_object_set(r, "ellipsize", PANGO_ELLIPSIZE_END, (char *)0); | |
602 | if(ql->columns[n].flags & COL_RIGHT) | |
603 | g_object_set(r, "xalign", (gfloat)1.0, (char *)0); | |
c133bd3c RK |
604 | GtkTreeViewColumn *c = gtk_tree_view_column_new_with_attributes |
605 | (ql->columns[n].name, | |
606 | r, | |
607 | "text", n, | |
0fb5e8f3 RK |
608 | "background", ql->ncolumns + BACKGROUND_COLUMN, |
609 | "foreground", ql->ncolumns + FOREGROUND_COLUMN, | |
c133bd3c | 610 | (char *)0); |
3ffb8e5d RK |
611 | gtk_tree_view_column_set_resizable(c, TRUE); |
612 | gtk_tree_view_column_set_reorderable(c, TRUE); | |
b0b15b7c RK |
613 | if(ql->columns[n].flags & COL_EXPAND) |
614 | g_object_set(c, "expand", TRUE, (char *)0); | |
c133bd3c RK |
615 | gtk_tree_view_append_column(GTK_TREE_VIEW(ql->view), c); |
616 | } | |
617 | ||
618 | /* The selection should support multiple things being selected */ | |
619 | ql->selection = gtk_tree_view_get_selection(GTK_TREE_VIEW(ql->view)); | |
620 | gtk_tree_selection_set_mode(ql->selection, GTK_SELECTION_MULTIPLE); | |
621 | ||
c133bd3c | 622 | /* Catch button presses */ |
17c36802 | 623 | g_signal_connect(ql->view, "button-press-event", |
c133bd3c RK |
624 | G_CALLBACK(ql_button_release), ql); |
625 | ||
82db9336 RK |
626 | /* Drag+drop*/ |
627 | if(ql->drop) { | |
0beb320e RK |
628 | /* Originally this was: |
629 | * | |
630 | * gtk_tree_view_set_reorderable(GTK_TREE_VIEW(ql->view), TRUE); | |
631 | * | |
632 | * However this has a two deficiencies: | |
633 | * | |
634 | * 1) Only one row can be dragged at once. It would be nice | |
635 | * to be able to do bulk rearrangements since the server | |
636 | * can cope with that well. | |
637 | * 2) Dragging between windows is not possible. When playlist | |
638 | * support appears, it should be possible to drag tracks | |
639 | * from the choose tag into the playlist. | |
640 | * | |
641 | * At the time of writing neither of these problems are fully solved, the | |
642 | * code as it stands is just a stepping stone in that direction. | |
643 | */ | |
644 | ||
645 | /* This view will act as a drag source */ | |
646 | gtk_drag_source_set(ql->view, | |
647 | GDK_BUTTON1_MASK, | |
648 | queuelike_targets, | |
649 | sizeof queuelike_targets / sizeof *queuelike_targets, | |
650 | GDK_ACTION_MOVE); | |
651 | /* This view will act as a drag destination | |
652 | * | |
653 | * GTK_DEST_DEFAULT_ALL is going to have to change; GTK_DEST_DEFAULT_DROP | |
654 | * does not allow us to detect illegal drops up front. However it will do | |
655 | * for now. | |
656 | */ | |
657 | gtk_drag_dest_set(ql->view, | |
658 | GTK_DEST_DEFAULT_ALL, | |
659 | queuelike_targets, | |
660 | sizeof queuelike_targets / sizeof *queuelike_targets, | |
661 | GDK_ACTION_MOVE); | |
662 | g_signal_connect(ql->view, "drag-begin", | |
663 | G_CALLBACK(ql_drag_begin), ql); | |
664 | g_signal_connect(ql->view, "drag-data-get", | |
665 | G_CALLBACK(ql_drag_data_get), ql); | |
666 | g_signal_connect(ql->view, "drag-data-received", | |
667 | G_CALLBACK(ql_drag_data_received), ql); | |
668 | } else { | |
669 | /* TODO: support copy-dragging out of non-rearrangeable queues. Will need | |
670 | * to support copy dropping into the rearrangeable ones. */ | |
82db9336 RK |
671 | } |
672 | ||
c133bd3c | 673 | /* TODO style? */ |
c133bd3c | 674 | |
a8c0e917 | 675 | ql->init(ql); |
c133bd3c | 676 | |
ad47bd4c RK |
677 | /* Update display text when lookups complete */ |
678 | event_register("lookups-completed", queue_lookups_completed, ql); | |
679 | ||
ee7552f8 RK |
680 | GtkWidget *scrolled = scroll_widget(ql->view); |
681 | g_object_set_data(G_OBJECT(scrolled), "type", (void *)ql_tabtype(ql)); | |
682 | return scrolled; | |
c133bd3c RK |
683 | } |
684 | ||
685 | /* | |
686 | Local Variables: | |
687 | c-basic-offset:2 | |
688 | comment-column:40 | |
689 | fill-column:79 | |
690 | indent-tabs-mode:nil | |
691 | End: | |
692 | */ |