Commit | Line | Data |
---|---|---|
c133bd3c RK |
1 | /* |
2 | * This file is part of DisOrder | |
3 | * Copyright (C) 2006-2008 Richard Kettlewell | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License as published by | |
7 | * the Free Software Foundation; either version 2 of the License, or | |
8 | * (at your option) any later version. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, but | |
11 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 | * General Public License for more details. | |
14 | * | |
15 | * You should have received a copy of the GNU General Public License | |
16 | * along with this program; if not, write to the Free Software | |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 | |
18 | * USA | |
19 | */ | |
20 | #include "disobedience.h" | |
21 | #include "queue-generic.h" | |
22 | ||
23 | /* Select All */ | |
24 | ||
25 | int ql_selectall_sensitive(struct queuelike *ql) { | |
26 | return !!ql->q; | |
27 | } | |
28 | ||
29 | void ql_selectall_activate(GtkMenuItem attribute((unused)) *menuitem, | |
30 | gpointer user_data) { | |
31 | struct queuelike *ql = user_data; | |
32 | ||
33 | gtk_tree_selection_select_all(ql->selection); | |
34 | } | |
35 | ||
36 | /* Select None */ | |
37 | ||
38 | int ql_selectnone_sensitive(struct queuelike *ql) { | |
39 | return gtk_tree_selection_count_selected_rows(ql->selection) > 0; | |
40 | } | |
41 | ||
42 | void ql_selectnone_activate(GtkMenuItem attribute((unused)) *menuitem, | |
43 | gpointer user_data) { | |
44 | struct queuelike *ql = user_data; | |
45 | ||
46 | gtk_tree_selection_unselect_all(ql->selection); | |
47 | } | |
48 | ||
49 | /* Properties */ | |
50 | ||
51 | int ql_properties_sensitive(struct queuelike *ql) { | |
52 | return gtk_tree_selection_count_selected_rows(ql->selection) > 0; | |
53 | } | |
54 | ||
55 | void ql_properties_activate(GtkMenuItem attribute((unused)) *menuitem, | |
56 | gpointer user_data) { | |
57 | struct queuelike *ql = user_data; | |
58 | struct vector v[1]; | |
59 | GtkTreeIter iter[1]; | |
60 | ||
61 | vector_init(v); | |
62 | gtk_tree_model_get_iter_first(GTK_TREE_MODEL(ql->store), iter); | |
63 | for(struct queue_entry *q = ql->q; q; q = q->next) { | |
64 | if(gtk_tree_selection_iter_is_selected(ql->selection, iter)) | |
65 | vector_append(v, (char *)q->track); | |
66 | gtk_tree_model_iter_next(GTK_TREE_MODEL(ql->store), iter); | |
67 | } | |
68 | if(v->nvec) | |
69 | properties(v->nvec, (const char **)v->vec); | |
70 | } | |
71 | ||
72 | /* Scratch */ | |
73 | ||
74 | int ql_scratch_sensitive(struct queuelike attribute((unused)) *ql) { | |
c9fb35f4 RK |
75 | return !!(last_state & DISORDER_PLAYING) |
76 | && right_scratchable(last_rights, config->username, playing_track); | |
77 | } | |
78 | ||
79 | static void scratch_completed(void attribute((unused)) *v, const char *error) { | |
80 | if(error) | |
81 | popup_protocol_error(0, error); | |
c133bd3c RK |
82 | } |
83 | ||
84 | void ql_scratch_activate(GtkMenuItem attribute((unused)) *menuitem, | |
85 | gpointer attribute((unused)) user_data) { | |
c9fb35f4 | 86 | disorder_eclient_scratch_playing(client, scratch_completed, 0); |
c133bd3c RK |
87 | } |
88 | ||
89 | /* Remove */ | |
90 | ||
22717074 RK |
91 | static void remove_sensitive_callback(GtkTreeModel *model, |
92 | GtkTreePath attribute((unused)) *path, | |
93 | GtkTreeIter *iter, | |
94 | gpointer data) { | |
95 | struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql"); | |
96 | struct queue_entry *q = ql_iter_to_q(ql, iter); | |
97 | const int removable = (q != playing_track | |
98 | && right_removable(last_rights, config->username, q)); | |
99 | int *const counts = data; | |
100 | ++counts[removable]; | |
101 | } | |
102 | ||
c133bd3c | 103 | int ql_remove_sensitive(struct queuelike *ql) { |
22717074 RK |
104 | int counts[2] = { 0, 0 }; |
105 | gtk_tree_selection_selected_foreach(ql->selection, | |
106 | remove_sensitive_callback, | |
107 | counts); | |
108 | /* Remove will work if we have at least some removable tracks selected, and | |
109 | * no unremovable ones */ | |
110 | return counts[1] > 0 && counts[0] == 0; | |
111 | } | |
112 | ||
113 | static void remove_completed(void attribute((unused)) *v, const char *error) { | |
114 | if(error) | |
115 | popup_protocol_error(0, error); | |
116 | } | |
117 | ||
118 | static void remove_activate_callback(GtkTreeModel *model, | |
119 | GtkTreePath attribute((unused)) *path, | |
120 | GtkTreeIter *iter, | |
121 | gpointer attribute((unused)) data) { | |
122 | struct queuelike *ql = g_object_get_data(G_OBJECT(model), "ql"); | |
123 | struct queue_entry *q = ql_iter_to_q(ql, iter); | |
124 | ||
125 | disorder_eclient_remove(client, q->id, remove_completed, q); | |
c133bd3c RK |
126 | } |
127 | ||
128 | void ql_remove_activate(GtkMenuItem attribute((unused)) *menuitem, | |
22717074 RK |
129 | gpointer user_data) { |
130 | struct queuelike *ql = user_data; | |
131 | gtk_tree_selection_selected_foreach(ql->selection, | |
132 | remove_activate_callback, | |
133 | 0); | |
c133bd3c RK |
134 | } |
135 | ||
136 | /* Play */ | |
137 | ||
138 | int ql_play_sensitive(struct queuelike *ql) { | |
139 | return gtk_tree_selection_count_selected_rows(ql->selection) > 0; | |
140 | } | |
141 | ||
142 | void ql_play_activate(GtkMenuItem attribute((unused)) *menuitem, | |
143 | gpointer attribute((unused)) user_data) { | |
144 | /* TODO */ | |
145 | } | |
146 | ||
147 | ||
148 | /** @brief Create @c ql->menu if it does not already exist */ | |
149 | static void ql_create_menu(struct queuelike *ql) { | |
150 | if(ql->menu) | |
151 | return; | |
152 | ql->menu = gtk_menu_new(); | |
153 | g_signal_connect(ql->menu, "destroy", | |
154 | G_CALLBACK(gtk_widget_destroyed), &ql->menu); | |
155 | for(int n = 0; n < ql->nmenuitems; ++n) { | |
156 | ql->menuitems[n].w = gtk_menu_item_new_with_label(ql->menuitems[n].name); | |
157 | gtk_menu_attach(GTK_MENU(ql->menu), ql->menuitems[n].w, 0, 1, n, n + 1); | |
158 | } | |
159 | set_tool_colors(ql->menu); | |
160 | } | |
161 | ||
162 | /** @brief Configure @c ql->menu */ | |
163 | static void ql_configure_menu(struct queuelike *ql) { | |
164 | /* Set the sensitivity of each menu item and (re-)establish the signal | |
165 | * handlers */ | |
166 | for(int n = 0; n < ql->nmenuitems; ++n) { | |
167 | if(ql->menuitems[n].handlerid) | |
168 | g_signal_handler_disconnect(ql->menuitems[n].w, | |
169 | ql->menuitems[n].handlerid); | |
170 | gtk_widget_set_sensitive(ql->menuitems[n].w, | |
171 | ql->menuitems[n].sensitive(ql)); | |
172 | ql->menuitems[n].handlerid = g_signal_connect | |
173 | (ql->menuitems[n].w, "activate", | |
174 | G_CALLBACK(ql->menuitems[n].activate), ql); | |
175 | } | |
176 | } | |
177 | ||
178 | /** @brief Called when a button is released over a queuelike */ | |
be909398 | 179 | gboolean ql_button_release(GtkWidget*widget, |
c133bd3c RK |
180 | GdkEventButton *event, |
181 | gpointer user_data) { | |
182 | struct queuelike *ql = user_data; | |
183 | ||
184 | if(event->type == GDK_BUTTON_PRESS | |
185 | && event->button == 3) { | |
be909398 RK |
186 | /* Right button click. */ |
187 | if(gtk_tree_selection_count_selected_rows(ql->selection) == 0) { | |
188 | /* Nothing is selected, select whatever is under the pointer */ | |
189 | GtkTreePath *path; | |
190 | if(gtk_tree_view_get_path_at_pos(GTK_TREE_VIEW(widget), | |
191 | event->x, event->y, | |
192 | &path, | |
193 | NULL, | |
194 | NULL, NULL)) | |
195 | gtk_tree_selection_select_path(ql->selection, path); | |
196 | } | |
c133bd3c RK |
197 | ql_create_menu(ql); |
198 | ql_configure_menu(ql); | |
199 | gtk_widget_show_all(ql->menu); | |
200 | gtk_menu_popup(GTK_MENU(ql->menu), 0, 0, 0, 0, | |
201 | event->button, event->time); | |
202 | return TRUE; /* hide the click from other widgets */ | |
203 | } | |
204 | ||
205 | return FALSE; | |
206 | } | |
207 | ||
ee7552f8 RK |
208 | static int ql_tab_selectall_sensitive(void *extra) { |
209 | return ql_selectall_sensitive(extra); | |
210 | } | |
211 | ||
212 | static void ql_tab_selectall_activate(void *extra) { | |
213 | ql_selectall_activate(NULL, extra); | |
214 | } | |
215 | ||
216 | static int ql_tab_selectnone_sensitive(void *extra) { | |
217 | return ql_selectnone_sensitive(extra); | |
218 | } | |
219 | ||
220 | static void ql_tab_selectnone_activate(void *extra) { | |
221 | ql_selectnone_activate(NULL, extra); | |
222 | } | |
223 | ||
224 | static int ql_tab_properties_sensitive(void *extra) { | |
225 | return ql_properties_sensitive(extra); | |
226 | } | |
227 | ||
228 | static void ql_tab_properties_activate(void *extra) { | |
229 | ql_properties_activate(NULL, extra); | |
230 | } | |
231 | ||
232 | struct tabtype *ql_tabtype(struct queuelike *ql) { | |
233 | static const struct tabtype ql_tabtype = { | |
234 | ql_tab_properties_sensitive, | |
235 | ql_tab_selectall_sensitive, | |
236 | ql_tab_selectnone_sensitive, | |
237 | ql_tab_properties_activate, | |
238 | ql_tab_selectall_activate, | |
239 | ql_tab_selectnone_activate, | |
240 | 0, | |
241 | 0 | |
242 | }; | |
243 | ||
244 | struct tabtype *t = xmalloc(sizeof *t); | |
245 | *t = ql_tabtype; | |
246 | t->extra = ql; | |
247 | return t; | |
248 | } | |
249 | ||
c133bd3c RK |
250 | /* |
251 | Local Variables: | |
252 | c-basic-offset:2 | |
253 | comment-column:40 | |
254 | fill-column:79 | |
255 | indent-tabs-mode:nil | |
256 | End: | |
257 | */ |