2 * Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
20 #include "gtktreemodel.h"
21 #include "gtktreestore.h"
22 #include "gtktreedatalist.h"
23 #include "gtktreednd.h"
25 #include <gobject/gvaluecollector.h>
27 #define G_NODE(node) ((GNode *)node)
29 static void gtk_tree_store_init (GtkTreeStore *tree_store);
30 static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
31 static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
32 static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
33 static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
34 static guint gtk_tree_store_get_flags (GtkTreeModel *tree_model);
35 static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
36 static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
38 static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
40 static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
44 static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
46 static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
49 static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
51 static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
53 static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
57 static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
62 static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
64 static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
66 GtkSelectionData *selection_data);
67 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
69 GtkSelectionData *selection_data);
70 static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
71 GtkTreeModel *src_model,
72 GtkTreePath *src_path,
73 GtkTreePath *dest_path);
75 static void validate_gnode (GNode *node);
78 validate_tree (GtkTreeStore *tree_store)
80 if (gtk_debug_flags & GTK_DEBUG_TREE)
82 g_assert (G_NODE (tree_store->root)->parent == NULL);
84 validate_gnode (G_NODE (tree_store->root));
89 gtk_tree_store_get_type (void)
91 static GType tree_store_type = 0;
95 static const GTypeInfo tree_store_info =
97 sizeof (GtkTreeStoreClass),
99 NULL, /* base_finalize */
100 (GClassInitFunc) gtk_tree_store_class_init,
101 NULL, /* class_finalize */
102 NULL, /* class_data */
103 sizeof (GtkTreeStore),
105 (GInstanceInitFunc) gtk_tree_store_init
108 static const GInterfaceInfo tree_model_info =
110 (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
115 static const GInterfaceInfo drag_source_info =
117 (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
122 static const GInterfaceInfo drag_dest_info =
124 (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
129 tree_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkTreeStore", &tree_store_info, 0);
131 g_type_add_interface_static (tree_store_type,
135 g_type_add_interface_static (tree_store_type,
136 GTK_TYPE_TREE_DRAG_SOURCE,
138 g_type_add_interface_static (tree_store_type,
139 GTK_TYPE_TREE_DRAG_DEST,
145 return tree_store_type;
149 gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class)
151 GObjectClass *object_class;
153 object_class = (GObjectClass *) tree_store_class;
158 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
160 iface->get_flags = gtk_tree_store_get_flags;
161 iface->get_n_columns = gtk_tree_store_get_n_columns;
162 iface->get_column_type = gtk_tree_store_get_column_type;
163 iface->get_path = gtk_tree_store_get_path;
164 iface->get_value = gtk_tree_store_get_value;
165 iface->iter_next = gtk_tree_store_iter_next;
166 iface->iter_children = gtk_tree_store_iter_children;
167 iface->iter_has_child = gtk_tree_store_iter_has_child;
168 iface->iter_n_children = gtk_tree_store_iter_n_children;
169 iface->iter_nth_child = gtk_tree_store_iter_nth_child;
170 iface->iter_parent = gtk_tree_store_iter_parent;
174 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
176 iface->drag_data_delete = gtk_tree_store_drag_data_delete;
177 iface->drag_data_get = gtk_tree_store_drag_data_get;
181 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
183 iface->drag_data_received = gtk_tree_store_drag_data_received;
184 iface->row_drop_possible = gtk_tree_store_row_drop_possible;
188 gtk_tree_store_init (GtkTreeStore *tree_store)
190 tree_store->root = g_node_new (NULL);
191 tree_store->stamp = g_random_int ();
195 gtk_tree_store_new (void)
197 return GTK_TREE_STORE (g_object_new (gtk_tree_store_get_type (), NULL));
201 gtk_tree_store_new_with_types (gint n_columns,
204 GtkTreeStore *retval;
208 g_return_val_if_fail (n_columns > 0, NULL);
210 retval = gtk_tree_store_new ();
211 gtk_tree_store_set_n_columns (retval, n_columns);
213 va_start (args, n_columns);
215 for (i = 0; i < n_columns; i++)
217 GType type = va_arg (args, GType);
218 if (! _gtk_tree_data_list_check_type (type))
220 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
221 g_object_unref (G_OBJECT (retval));
224 gtk_tree_store_set_column_type (retval, i, type);
232 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
237 g_return_if_fail (tree_store != NULL);
238 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
240 if (tree_store->n_columns == n_columns)
243 new_columns = g_new0 (GType, n_columns);
244 if (tree_store->column_headers)
246 /* copy the old header orders over */
247 if (n_columns >= tree_store->n_columns)
248 memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
250 memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
252 g_free (tree_store->column_headers);
255 tree_store->column_headers = new_columns;
256 tree_store->n_columns = n_columns;
260 * gtk_tree_store_set_column_type:
261 * @tree_store: a #GtkTreeStore
262 * @column: column number
263 * @type: type of the data to be stored in @column
265 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
266 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
267 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
268 * subclasses of those types such as %GDK_TYPE_PIXBUF.
272 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
276 g_return_if_fail (tree_store != NULL);
277 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
278 g_return_if_fail (column >=0 && column < tree_store->n_columns);
279 if (!_gtk_tree_data_list_check_type (type))
281 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
284 tree_store->column_headers[column] = type;
287 /* fulfill the GtkTreeModel requirements */
288 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
289 * it is not visible to the tree or to the user., and the path "0" refers to the
290 * first child of GtkTreeStore::root.
295 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
297 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
299 return GTK_TREE_MODEL_ITERS_PERSIST;
303 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
305 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
307 return GTK_TREE_STORE (tree_model)->n_columns;
311 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
314 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
315 g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
316 index >= 0, G_TYPE_INVALID);
318 return GTK_TREE_STORE (tree_model)->column_headers[index];
322 gtk_tree_store_get_path (GtkTreeModel *tree_model,
329 g_return_val_if_fail (tree_model != NULL, NULL);
330 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
331 g_return_val_if_fail (iter != NULL, NULL);
332 g_return_val_if_fail (iter->user_data != NULL, NULL);
334 validate_tree ((GtkTreeStore*)tree_model);
336 g_assert (G_NODE (iter->user_data)->parent != NULL);
338 if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
340 retval = gtk_tree_path_new ();
341 tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
345 GtkTreeIter tmp_iter = *iter;
347 tmp_iter.user_data = G_NODE (iter->user_data)->parent;
349 retval = gtk_tree_store_get_path (tree_model,
351 tmp_node = G_NODE (iter->user_data)->parent->children;
357 if (tmp_node == NULL)
359 gtk_tree_path_free (retval);
363 for (; tmp_node; tmp_node = tmp_node->next)
365 if (tmp_node == G_NODE (iter->user_data))
370 if (tmp_node == NULL)
372 /* We couldn't find node, meaning it's prolly not ours */
373 /* Perhaps I should do a g_return_if_fail here. */
374 gtk_tree_path_free (retval);
378 gtk_tree_path_append_index (retval, i);
385 gtk_tree_store_get_value (GtkTreeModel *tree_model,
390 GtkTreeDataList *list;
391 gint tmp_column = column;
393 g_return_if_fail (tree_model != NULL);
394 g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
395 g_return_if_fail (iter != NULL);
396 g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
398 list = G_NODE (iter->user_data)->data;
400 while (tmp_column-- > 0 && list)
405 _gtk_tree_data_list_node_to_value (list,
406 GTK_TREE_STORE (tree_model)->column_headers[column],
411 /* We want to return an initialized but empty (default) value */
412 g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
417 gtk_tree_store_iter_next (GtkTreeModel *tree_model,
420 g_return_val_if_fail (iter->user_data != NULL, FALSE);
422 if (G_NODE (iter->user_data)->next)
424 iter->user_data = G_NODE (iter->user_data)->next;
432 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
438 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
441 children = G_NODE (parent->user_data)->children;
443 children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
447 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
448 iter->user_data = children;
456 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
459 g_return_val_if_fail (tree_model != NULL, FALSE);
460 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
461 g_return_val_if_fail (iter != NULL, FALSE);
462 g_return_val_if_fail (iter->user_data != NULL, FALSE);
464 return G_NODE (iter->user_data)->children != NULL;
468 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
474 g_return_val_if_fail (tree_model != NULL, 0);
475 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
476 g_return_val_if_fail (iter != NULL, FALSE);
477 g_return_val_if_fail (iter->user_data != NULL, FALSE);
480 node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
482 node = G_NODE (iter->user_data)->children;
494 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
502 g_return_val_if_fail (tree_model != NULL, FALSE);
503 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
504 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
507 parent_node = GTK_TREE_STORE (tree_model)->root;
509 parent_node = parent->user_data;
511 child = g_node_nth_child (parent_node, n);
515 iter->user_data = child;
516 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
524 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
530 g_return_val_if_fail (iter != NULL, FALSE);
531 g_return_val_if_fail (iter->user_data != NULL, FALSE);
533 parent = G_NODE (child->user_data)->parent;
535 g_assert (parent != NULL);
537 if (parent != GTK_TREE_STORE (tree_model)->root)
539 iter->user_data = parent;
540 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
548 * This is a somewhat inelegant function that does a lot of list
549 * manipulations on it's own.
552 gtk_tree_store_set_cell (GtkTreeStore *tree_store,
557 GtkTreeDataList *list;
558 GtkTreeDataList *prev;
559 GtkTreePath *path = NULL;
560 GValue real_value = {0, };
561 gboolean converted = FALSE;
563 g_return_if_fail (tree_store != NULL);
564 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
565 g_return_if_fail (column >= 0 && column < tree_store->n_columns);
566 g_return_if_fail (G_IS_VALUE (value));
568 if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
570 if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
571 g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
573 g_warning ("%s: Unable to convert from %s to %s\n",
575 g_type_name (G_VALUE_TYPE (value)),
576 g_type_name (tree_store->column_headers[column]));
579 if (!g_value_transform (value, &real_value))
581 g_warning ("%s: Unable to make conversion from %s to %s\n",
583 g_type_name (G_VALUE_TYPE (value)),
584 g_type_name (tree_store->column_headers[column]));
585 g_value_unset (&real_value);
591 prev = list = G_NODE (iter->user_data)->data;
593 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
600 _gtk_tree_data_list_value_to_node (list, &real_value);
602 _gtk_tree_data_list_value_to_node (list, value);
603 gtk_tree_model_changed (GTK_TREE_MODEL (tree_store), path, iter);
604 gtk_tree_path_free (path);
606 g_value_unset (&real_value);
615 if (G_NODE (iter->user_data)->data == NULL)
617 G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
622 list = prev->next = _gtk_tree_data_list_alloc ();
628 list->next = _gtk_tree_data_list_alloc ();
634 _gtk_tree_data_list_value_to_node (list, &real_value);
636 _gtk_tree_data_list_value_to_node (list, value);
637 gtk_tree_model_changed (GTK_TREE_MODEL (tree_store), path, iter);
638 gtk_tree_path_free (path);
640 g_value_unset (&real_value);
644 * gtk_tree_store_set_valist:
645 * @tree_store: a #GtkTreeStore
646 * @iter: row to set data for
647 * @var_args: va_list of column/value pairs
649 * See gtk_tree_store_set(); this version takes a va_list for
650 * use by language bindings.
654 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
660 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
662 column = va_arg (var_args, gint);
666 GValue value = { 0, };
669 if (column >= tree_store->n_columns)
671 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
674 g_value_init (&value, tree_store->column_headers[column]);
676 G_VALUE_COLLECT (&value, var_args, 0, &error);
679 g_warning ("%s: %s", G_STRLOC, error);
682 /* we purposely leak the value here, it might not be
683 * in a sane state if an error condition occoured
688 gtk_tree_store_set_cell (tree_store,
693 g_value_unset (&value);
695 column = va_arg (var_args, gint);
700 * gtk_tree_store_set:
701 * @tree_store: a #GtkTreeStore
702 * @iter: row iterator
703 * @Varargs: pairs of column number and value, terminated with -1
705 * Sets the value of one or more cells in the row referenced by @iter.
706 * The variable argument list should contain integer column numbers,
707 * each column number followed by the value to be set. For example,
708 * The list is terminated by a -1. For example, to set column 0 with type
709 * %G_TYPE_STRING to "Foo", you would write gtk_tree_store_set (store, iter,
713 gtk_tree_store_set (GtkTreeStore *tree_store,
719 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
721 va_start (var_args, iter);
722 gtk_tree_store_set_valist (tree_store, iter, var_args);
727 gtk_tree_store_remove (GtkTreeStore *model,
731 GtkTreeIter new_iter = {0,};
734 g_return_if_fail (model != NULL);
735 g_return_if_fail (GTK_IS_TREE_STORE (model));
737 parent = G_NODE (iter->user_data)->parent;
739 g_assert (parent != NULL);
741 if (G_NODE (iter->user_data)->data)
742 _gtk_tree_data_list_free ((GtkTreeDataList *) G_NODE (iter->user_data)->data,
743 model->column_headers);
745 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
746 g_node_destroy (G_NODE (iter->user_data));
749 gtk_tree_model_deleted (GTK_TREE_MODEL (model), path);
751 if (parent != G_NODE (model->root) && parent->children == NULL)
753 gtk_tree_path_up (path);
755 new_iter.stamp = model->stamp;
756 new_iter.user_data = parent;
757 gtk_tree_model_has_child_toggled (GTK_TREE_MODEL (model), path, &new_iter);
759 gtk_tree_path_free (path);
763 gtk_tree_store_insert (GtkTreeStore *model,
771 g_return_if_fail (model != NULL);
772 g_return_if_fail (GTK_IS_TREE_STORE (model));
775 parent_node = parent->user_data;
777 parent_node = model->root;
779 iter->stamp = model->stamp;
780 iter->user_data = g_node_new (NULL);
781 g_node_insert (parent_node, position, G_NODE (iter->user_data));
783 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
784 gtk_tree_model_inserted (GTK_TREE_MODEL (model), path, iter);
786 gtk_tree_path_free (path);
788 validate_tree ((GtkTreeStore*)model);
792 gtk_tree_store_insert_before (GtkTreeStore *model,
795 GtkTreeIter *sibling)
798 GNode *parent_node = NULL;
801 g_return_if_fail (model != NULL);
802 g_return_if_fail (GTK_IS_TREE_STORE (model));
803 g_return_if_fail (iter != NULL);
805 new_node = g_node_new (NULL);
807 if (parent == NULL && sibling == NULL)
808 parent_node = model->root;
809 else if (parent == NULL)
810 parent_node = G_NODE (sibling->user_data)->parent;
811 else if (sibling == NULL)
812 parent_node = G_NODE (parent->user_data);
815 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
816 G_NODE (parent->user_data));
817 parent_node = G_NODE (parent->user_data);
820 g_node_insert_before (parent_node,
821 sibling ? G_NODE (sibling->user_data) : NULL,
824 iter->stamp = model->stamp;
825 iter->user_data = new_node;
827 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
828 gtk_tree_model_inserted (GTK_TREE_MODEL (model), path, iter);
830 gtk_tree_path_free (path);
832 validate_tree ((GtkTreeStore*)model);
836 gtk_tree_store_insert_after (GtkTreeStore *model,
839 GtkTreeIter *sibling)
845 g_return_if_fail (model != NULL);
846 g_return_if_fail (GTK_IS_TREE_STORE (model));
847 g_return_if_fail (iter != NULL);
849 new_node = g_node_new (NULL);
851 if (parent == NULL && sibling == NULL)
852 parent_node = model->root;
853 else if (parent == NULL)
854 parent_node = G_NODE (sibling->user_data)->parent;
855 else if (sibling == NULL)
856 parent_node = G_NODE (parent->user_data);
859 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
860 G_NODE (parent->user_data));
861 parent_node = G_NODE (parent->user_data);
865 g_node_insert_after (parent_node,
866 sibling ? G_NODE (sibling->user_data) : NULL,
869 iter->stamp = model->stamp;
870 iter->user_data = new_node;
872 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
873 gtk_tree_model_inserted (GTK_TREE_MODEL (model), path, iter);
875 gtk_tree_path_free (path);
877 validate_tree ((GtkTreeStore*)model);
881 gtk_tree_store_prepend (GtkTreeStore *model,
887 g_return_if_fail (model != NULL);
888 g_return_if_fail (GTK_IS_TREE_STORE (model));
889 g_return_if_fail (iter != NULL);
892 parent_node = model->root;
894 parent_node = parent->user_data;
896 if (parent_node->children == NULL)
900 iter->stamp = model->stamp;
901 iter->user_data = g_node_new (NULL);
903 g_node_prepend (parent_node, iter->user_data);
905 if (parent_node != model->root)
907 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), parent);
908 gtk_tree_model_has_child_toggled (GTK_TREE_MODEL (model), path, parent);
909 gtk_tree_path_append_index (path, 0);
913 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
915 gtk_tree_model_inserted (GTK_TREE_MODEL (model), path, iter);
916 gtk_tree_path_free (path);
920 gtk_tree_store_insert_after (model, iter, parent, NULL);
923 validate_tree ((GtkTreeStore*)model);
927 gtk_tree_store_append (GtkTreeStore *model,
933 g_return_if_fail (model != NULL);
934 g_return_if_fail (GTK_IS_TREE_STORE (model));
935 g_return_if_fail (iter != NULL);
938 parent_node = model->root;
940 parent_node = parent->user_data;
942 if (parent_node->children == NULL)
946 iter->stamp = model->stamp;
947 iter->user_data = g_node_new (NULL);
949 g_node_append (parent_node, G_NODE (iter->user_data));
951 if (parent_node != model->root)
953 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), parent);
954 gtk_tree_model_has_child_toggled (GTK_TREE_MODEL (model), path, parent);
955 gtk_tree_path_append_index (path, 0);
959 path = gtk_tree_store_get_path (GTK_TREE_MODEL (model), iter);
962 gtk_tree_model_inserted (GTK_TREE_MODEL (model), path, iter);
963 gtk_tree_path_free (path);
967 gtk_tree_store_insert_before (model, iter, parent, NULL);
970 validate_tree ((GtkTreeStore*)model);
974 gtk_tree_store_is_ancestor (GtkTreeStore *model,
976 GtkTreeIter *descendant)
978 g_return_val_if_fail (model != NULL, FALSE);
979 g_return_val_if_fail (GTK_IS_TREE_STORE (model), FALSE);
980 g_return_val_if_fail (iter != NULL, FALSE);
981 g_return_val_if_fail (descendant != NULL, FALSE);
983 return g_node_is_ancestor (G_NODE (iter->user_data),
984 G_NODE (descendant->user_data));
989 gtk_tree_store_iter_depth (GtkTreeStore *model,
992 g_return_val_if_fail (model != NULL, 0);
993 g_return_val_if_fail (GTK_IS_TREE_STORE (model), 0);
994 g_return_val_if_fail (iter != NULL, 0);
996 return g_node_depth (G_NODE (iter->user_data)) - 1;
1004 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1009 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1011 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1015 gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1026 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1028 GtkSelectionData *selection_data)
1030 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1032 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1033 * target, because the default handler does it for us, but
1034 * we do anyway for the convenience of someone maybe overriding the
1038 if (gtk_selection_data_set_tree_row (selection_data,
1039 GTK_TREE_MODEL (drag_source),
1046 /* FIXME handle text targets at least. */
1053 copy_node_data (GtkTreeStore *tree_store,
1054 GtkTreeIter *src_iter,
1055 GtkTreeIter *dest_iter)
1057 GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1058 GtkTreeDataList *copy_head = NULL;
1059 GtkTreeDataList *copy_prev = NULL;
1060 GtkTreeDataList *copy_iter = NULL;
1067 copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1069 if (copy_head == NULL)
1070 copy_head = copy_iter;
1073 copy_prev->next = copy_iter;
1075 copy_prev = copy_iter;
1081 G_NODE (dest_iter->user_data)->data = copy_head;
1083 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1084 gtk_tree_model_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1085 gtk_tree_path_free (path);
1089 recursive_node_copy (GtkTreeStore *tree_store,
1090 GtkTreeIter *src_iter,
1091 GtkTreeIter *dest_iter)
1094 GtkTreeModel *model;
1096 model = GTK_TREE_MODEL (tree_store);
1098 copy_node_data (tree_store, src_iter, dest_iter);
1100 if (gtk_tree_model_iter_children (model,
1104 /* Need to create children and recurse. Note our
1105 * dependence on persistent iterators here.
1111 /* Gee, a really slow algorithm... ;-) FIXME */
1112 gtk_tree_store_append (tree_store,
1116 recursive_node_copy (tree_store, &child, ©);
1118 while (gtk_tree_model_iter_next (model, &child));
1123 gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1125 GtkSelectionData *selection_data)
1127 GtkTreeModel *tree_model;
1128 GtkTreeStore *tree_store;
1129 GtkTreeModel *src_model = NULL;
1130 GtkTreePath *src_path = NULL;
1131 gboolean retval = FALSE;
1133 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1135 tree_model = GTK_TREE_MODEL (drag_dest);
1136 tree_store = GTK_TREE_STORE (drag_dest);
1138 validate_tree (tree_store);
1140 if (gtk_selection_data_get_tree_row (selection_data,
1143 src_model == tree_model)
1145 /* Copy the given row to a new position */
1146 GtkTreeIter src_iter;
1147 GtkTreeIter dest_iter;
1150 if (!gtk_tree_model_get_iter (src_model,
1157 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1158 prev = gtk_tree_path_copy (dest);
1160 if (!gtk_tree_path_prev (prev))
1162 GtkTreeIter dest_parent;
1163 GtkTreePath *parent;
1164 GtkTreeIter *dest_parent_p;
1166 /* dest was the first spot at the current depth; which means
1167 * we are supposed to prepend.
1170 /* Get the parent, NULL if parent is the root */
1171 dest_parent_p = NULL;
1172 parent = gtk_tree_path_copy (dest);
1173 if (gtk_tree_path_up (parent))
1175 gtk_tree_model_get_iter (tree_model,
1178 dest_parent_p = &dest_parent;
1180 gtk_tree_path_free (parent);
1183 gtk_tree_store_prepend (GTK_TREE_STORE (tree_model),
1191 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model),
1195 GtkTreeIter tmp_iter = dest_iter;
1196 gtk_tree_store_insert_after (GTK_TREE_STORE (tree_model),
1205 gtk_tree_path_free (prev);
1207 /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1208 * duplicating it below dest_iter.
1213 recursive_node_copy (tree_store,
1220 /* FIXME maybe add some data targets eventually, or handle text
1221 * targets in the simple case.
1229 gtk_tree_path_free (src_path);
1235 gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1236 GtkTreeModel *src_model,
1237 GtkTreePath *src_path,
1238 GtkTreePath *dest_path)
1240 /* can only drag to ourselves */
1241 if (src_model != GTK_TREE_MODEL (drag_dest))
1244 /* Can't drop into ourself. */
1245 if (gtk_tree_path_is_ancestor (src_path,
1249 /* Can't drop if dest_path's parent doesn't exist */
1252 GtkTreePath *tmp = gtk_tree_path_copy (dest_path);
1254 /* if we can't go up, we know the parent exists, the root
1257 if (gtk_tree_path_up (tmp))
1259 if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1263 gtk_tree_path_free (tmp);
1269 gtk_tree_path_free (tmp);
1272 /* Can otherwise drop anywhere. */
1277 validate_gnode (GNode* node)
1281 iter = node->children;
1282 while (iter != NULL)
1284 g_assert (iter->parent == node);
1286 g_assert (iter->prev->next == iter);
1287 validate_gnode (iter);