2 * viking -- GPS Data and Topo Analyzer, Explorer, and Manager
4 * Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 #include "icons/icons.h"
27 #define DISCONNECT_UPDATE_SIGNAL(vl, val) g_signal_handlers_disconnect_matched(vl, G_SIGNAL_MATCH_DATA, 0, 0, 0, 0, val)
29 static void aggregate_layer_marshall( VikAggregateLayer *val, guint8 **data, gint *len );
30 static VikAggregateLayer *aggregate_layer_unmarshall( guint8 *data, gint len, VikViewport *vvp );
31 static void aggregate_layer_change_coord_mode ( VikAggregateLayer *val, VikCoordMode mode );
32 static void aggregate_layer_drag_drop_request ( VikAggregateLayer *val_src, VikAggregateLayer *val_dest, GtkTreeIter *src_item_iter, GtkTreePath *dest_path );
34 VikLayerInterface vik_aggregate_layer_interface = {
36 &vikaggregatelayer_pixbuf,
48 (VikLayerFuncCreate) vik_aggregate_layer_create,
49 (VikLayerFuncRealize) vik_aggregate_layer_realize,
50 (VikLayerFuncPostRead) NULL,
51 (VikLayerFuncFree) vik_aggregate_layer_free,
53 (VikLayerFuncProperties) NULL,
54 (VikLayerFuncDraw) vik_aggregate_layer_draw,
55 (VikLayerFuncChangeCoordMode) aggregate_layer_change_coord_mode,
57 (VikLayerFuncSetMenuItemsSelection) NULL,
58 (VikLayerFuncGetMenuItemsSelection) NULL,
60 (VikLayerFuncAddMenuItems) NULL,
61 (VikLayerFuncSublayerAddMenuItems) NULL,
63 (VikLayerFuncSublayerRenameRequest) NULL,
64 (VikLayerFuncSublayerToggleVisible) NULL,
65 (VikLayerFuncSublayerTooltip) NULL,
66 (VikLayerFuncLayerTooltip) NULL,
68 (VikLayerFuncMarshall) aggregate_layer_marshall,
69 (VikLayerFuncUnmarshall) aggregate_layer_unmarshall,
71 (VikLayerFuncSetParam) NULL,
72 (VikLayerFuncGetParam) NULL,
74 (VikLayerFuncReadFileData) NULL,
75 (VikLayerFuncWriteFileData) NULL,
77 (VikLayerFuncDeleteItem) NULL,
78 (VikLayerFuncCopyItem) NULL,
79 (VikLayerFuncPasteItem) NULL,
80 (VikLayerFuncFreeCopiedItem) NULL,
81 (VikLayerFuncDragDropRequest) aggregate_layer_drag_drop_request,
84 struct _VikAggregateLayer {
89 GType vik_aggregate_layer_get_type ()
91 static GType val_type = 0;
95 static const GTypeInfo val_info =
97 sizeof (VikAggregateLayerClass),
99 NULL, /* base_finalize */
100 NULL, /* class init */
101 NULL, /* class_finalize */
102 NULL, /* class_data */
103 sizeof (VikAggregateLayer),
105 NULL /* instance init */
107 val_type = g_type_register_static ( VIK_LAYER_TYPE, "VikAggregateLayer", &val_info, 0 );
113 VikAggregateLayer *vik_aggregate_layer_create (VikViewport *vp)
115 VikAggregateLayer *rv = vik_aggregate_layer_new ();
116 vik_layer_rename ( VIK_LAYER(rv), vik_aggregate_layer_interface.name );
120 static void aggregate_layer_marshall( VikAggregateLayer *val, guint8 **data, gint *datalen )
122 GList *child = val->children;
123 VikLayer *child_layer;
126 GByteArray* b = g_byte_array_new ();
129 #define alm_append(obj, sz) \
131 g_byte_array_append ( b, (guint8 *)&len, sizeof(len) ); \
132 g_byte_array_append ( b, (guint8 *)(obj), len );
134 vik_layer_marshall_params(VIK_LAYER(val), &ld, &ll);
139 child_layer = VIK_LAYER(child->data);
140 vik_layer_marshall ( child_layer, &ld, &ll );
149 g_byte_array_free(b, FALSE);
153 static VikAggregateLayer *aggregate_layer_unmarshall( guint8 *data, gint len, VikViewport *vvp )
155 #define alm_size (*(gint *)data)
157 len -= sizeof(gint) + alm_size; \
158 data += sizeof(gint) + alm_size;
160 VikAggregateLayer *rv = vik_aggregate_layer_new();
161 VikLayer *child_layer;
163 vik_layer_unmarshall_params ( VIK_LAYER(rv), data+sizeof(gint), alm_size, vvp );
167 child_layer = vik_layer_unmarshall ( data + sizeof(gint), alm_size, vvp );
169 rv->children = g_list_append ( rv->children, child_layer );
170 g_signal_connect_swapped ( G_OBJECT(child_layer), "update", G_CALLBACK(vik_layer_emit_update_secondary), rv );
174 // g_print("aggregate_layer_unmarshall ended with len=%d\n", len);
180 VikAggregateLayer *vik_aggregate_layer_new ()
182 VikAggregateLayer *val = VIK_AGGREGATE_LAYER ( g_object_new ( VIK_AGGREGATE_LAYER_TYPE, NULL ) );
183 vik_layer_init ( VIK_LAYER(val), VIK_LAYER_AGGREGATE );
184 val->children = NULL;
188 void vik_aggregate_layer_insert_layer ( VikAggregateLayer *val, VikLayer *l, GtkTreeIter *replace_iter )
192 if ( VIK_LAYER(val)->realized )
194 vik_treeview_insert_layer ( VIK_LAYER(val)->vt, &(VIK_LAYER(val)->iter), &iter, l->name, val, l, l->type, l->type, replace_iter );
196 vik_treeview_item_set_visible ( VIK_LAYER(val)->vt, &iter, FALSE );
197 vik_layer_realize ( l, VIK_LAYER(val)->vt, &iter );
199 if ( val->children == NULL )
200 vik_treeview_expand ( VIK_LAYER(val)->vt, &(VIK_LAYER(val)->iter) );
204 GList *theone = g_list_find ( val->children, vik_treeview_item_get_pointer ( VIK_LAYER(val)->vt, replace_iter ) );
205 val->children = g_list_insert ( val->children, l, g_list_position(val->children,theone)+1 );
207 val->children = g_list_append ( val->children, l );
209 g_signal_connect_swapped ( G_OBJECT(l), "update", G_CALLBACK(vik_layer_emit_update_secondary), val );
212 void vik_aggregate_layer_add_layer ( VikAggregateLayer *val, VikLayer *l )
216 if ( VIK_LAYER(val)->realized )
218 vik_treeview_add_layer ( VIK_LAYER(val)->vt, &(VIK_LAYER(val)->iter), &iter, l->name, val, l, l->type, l->type);
220 vik_treeview_item_set_visible ( VIK_LAYER(val)->vt, &iter, FALSE );
221 vik_layer_realize ( l, VIK_LAYER(val)->vt, &iter );
223 if ( val->children == NULL )
224 vik_treeview_expand ( VIK_LAYER(val)->vt, &(VIK_LAYER(val)->iter) );
227 val->children = g_list_append ( val->children, l );
228 g_signal_connect_swapped ( G_OBJECT(l), "update", G_CALLBACK(vik_layer_emit_update_secondary), val );
231 void vik_aggregate_layer_move_layer ( VikAggregateLayer *val, GtkTreeIter *child_iter, gboolean up )
233 GList *theone, *first, *second;
234 vik_treeview_move_item ( VIK_LAYER(val)->vt, child_iter, up );
236 theone = g_list_find ( val->children, vik_treeview_item_get_pointer ( VIK_LAYER(val)->vt, child_iter ) );
238 g_assert ( theone != NULL );
240 /* the old switcheroo */
241 if ( up && theone->next )
244 second = theone->next;
246 else if ( !up && theone->prev )
248 first = theone->prev;
254 first->next = second->next;
255 second->prev = first->prev;
256 first->prev = second;
257 second->next = first;
259 /* second is now first */
262 second->prev->next = second;
264 first->next->prev = first;
266 if ( second->prev == NULL )
267 val->children = second;
270 /* Draw the aggregate layer. If vik viewport is in half_drawn mode, this means we are only
271 * to draw the layers above and including the trigger layer.
272 * To do this we don't draw any layers if in half drawn mode, unless we find the
273 * trigger layer, in which case we pull up the saved pixmap, turn off half drawn mode and
274 * start drawing layers.
275 * Also, if we were never in half drawn mode, we save a snapshot
276 * of the pixmap before drawing the trigger layer so we can use it again
279 void vik_aggregate_layer_draw ( VikAggregateLayer *val, gpointer data )
281 GList *iter = val->children;
283 VikLayer *trigger = VIK_LAYER(vik_viewport_get_trigger( VIK_VIEWPORT(data) ));
285 vl = VIK_LAYER(iter->data);
286 if ( vl == trigger ) {
287 if ( vik_viewport_get_half_drawn ( VIK_VIEWPORT(data) ) ) {
288 vik_viewport_set_half_drawn ( VIK_VIEWPORT(data), FALSE );
289 vik_viewport_snapshot_load( VIK_VIEWPORT(data) );
291 vik_viewport_snapshot_save( VIK_VIEWPORT(data) );
294 if ( vl->type == VIK_LAYER_AGGREGATE || vl->type == VIK_LAYER_GPS || ! vik_viewport_get_half_drawn( VIK_VIEWPORT(data) ) )
295 vik_layer_draw ( vl, data );
300 static void aggregate_layer_change_coord_mode ( VikAggregateLayer *val, VikCoordMode mode )
302 GList *iter = val->children;
305 vik_layer_change_coord_mode ( VIK_LAYER(iter->data), mode );
310 static void disconnect_layer_signal ( VikLayer *vl, VikAggregateLayer *val )
312 g_assert(DISCONNECT_UPDATE_SIGNAL(vl,val)==1);
315 void vik_aggregate_layer_free ( VikAggregateLayer *val )
317 g_list_foreach ( val->children, (GFunc)(disconnect_layer_signal), val );
318 g_list_foreach ( val->children, (GFunc)(g_object_unref), NULL );
319 g_list_free ( val->children );
322 static void delete_layer_iter ( VikLayer *vl )
325 vik_treeview_item_delete ( vl->vt, &(vl->iter) );
328 void vik_aggregate_layer_clear ( VikAggregateLayer *val )
330 g_list_foreach ( val->children, (GFunc)(disconnect_layer_signal), val );
331 g_list_foreach ( val->children, (GFunc)(delete_layer_iter), NULL );
332 g_list_foreach ( val->children, (GFunc)(g_object_unref), NULL );
333 g_list_free ( val->children );
334 val->children = NULL;
337 gboolean vik_aggregate_layer_delete ( VikAggregateLayer *val, GtkTreeIter *iter )
339 VikLayer *l = VIK_LAYER( vik_treeview_item_get_pointer ( VIK_LAYER(val)->vt, iter ) );
340 gboolean was_visible = l->visible;
342 vik_treeview_item_delete ( VIK_LAYER(val)->vt, iter );
343 val->children = g_list_remove ( val->children, l );
344 g_assert(DISCONNECT_UPDATE_SIGNAL(l,val)==1);
345 g_object_unref ( l );
351 /* returns 0 == we're good, 1 == didn't find any layers, 2 == got rejected */
352 guint vik_aggregate_layer_tool ( VikAggregateLayer *val, guint16 layer_type, VikToolInterfaceFunc tool_func, GdkEventButton *event, VikViewport *vvp )
354 GList *iter = val->children;
355 gboolean found_rej = FALSE;
363 /* if this layer "accepts" the tool call */
364 if ( VIK_LAYER(iter->data)->visible && VIK_LAYER(iter->data)->type == layer_type )
366 if ( tool_func ( VIK_LAYER(iter->data), event, vvp ) )
372 /* recursive -- try the same for the child aggregate layer. */
373 else if ( VIK_LAYER(iter->data)->visible && VIK_LAYER(iter->data)->type == VIK_LAYER_AGGREGATE )
375 gint rv = vik_aggregate_layer_tool(VIK_AGGREGATE_LAYER(iter->data), layer_type, tool_func, event, vvp);
383 return found_rej ? 2 : 1; /* no one wanted to accept the tool call in this layer */
387 VikLayer *vik_aggregate_layer_get_top_visible_layer_of_type ( VikAggregateLayer *val, gint type )
390 GList *ls = val->children;
398 if ( VIK_LAYER(ls->data)->visible && VIK_LAYER(ls->data)->type == type )
399 return VIK_LAYER(ls->data);
400 else if ( VIK_LAYER(ls->data)->visible && VIK_LAYER(ls->data)->type == VIK_LAYER_AGGREGATE )
402 rv = vik_aggregate_layer_get_top_visible_layer_of_type(VIK_AGGREGATE_LAYER(ls->data), type);
411 GList *vik_aggregate_layer_get_all_layers_of_type(VikAggregateLayer *val, GList *layers, gint type)
414 GList *children = val->children;
418 if (VIK_LAYER(children->data)->type == VIK_LAYER_AGGREGATE)
419 l = vik_aggregate_layer_get_all_layers_of_type(VIK_AGGREGATE_LAYER(children->data), l, type);
420 else if (VIK_LAYER(children->data)->type == type)
421 l = g_list_prepend(l, children->data); /* now in top down order */
422 children = children->next;
427 void vik_aggregate_layer_realize ( VikAggregateLayer *val, VikTreeview *vt, GtkTreeIter *layer_iter )
429 GList *i = val->children;
433 vik_treeview_add_layer ( VIK_LAYER(val)->vt, layer_iter, &iter, VIK_LAYER(i->data)->name, val,
434 VIK_LAYER(i->data), VIK_LAYER(i->data)->type, VIK_LAYER(i->data)->type );
435 if ( ! VIK_LAYER(i->data)->visible )
436 vik_treeview_item_set_visible ( VIK_LAYER(val)->vt, &iter, FALSE );
437 vik_layer_realize ( VIK_LAYER(i->data), VIK_LAYER(val)->vt, &iter );
442 const GList *vik_aggregate_layer_get_children ( VikAggregateLayer *val )
444 return val->children;
447 gboolean vik_aggregate_layer_is_empty ( VikAggregateLayer *val )
454 static void aggregate_layer_drag_drop_request ( VikAggregateLayer *val_src, VikAggregateLayer *val_dest, GtkTreeIter *src_item_iter, GtkTreePath *dest_path )
456 VikTreeview *vt = VIK_LAYER(val_src)->vt;
457 VikLayer *vl = vik_treeview_item_get_pointer(vt, src_item_iter);
458 GtkTreeIter dest_iter;
460 gboolean target_exists;
462 dp = gtk_tree_path_to_string(dest_path);
463 target_exists = vik_treeview_get_iter_from_path_str(vt, &dest_iter, dp);
465 /* vik_aggregate_layer_delete unrefs, but we don't want that here.
466 * we're still using the layer. */
468 vik_aggregate_layer_delete(val_src, src_item_iter);
471 vik_aggregate_layer_insert_layer(val_dest, vl, &dest_iter);
473 vik_aggregate_layer_insert_layer(val_dest, vl, NULL); /* append */