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.
21 #include <gobject/gvaluecollector.h>
22 #include "gtktreemodel.h"
23 #include "gtktreestore.h"
24 #include "gtktreedatalist.h"
25 #include "gtktreednd.h"
27 #define G_NODE(node) ((GNode *)node)
28 #define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != -2)
29 #define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
31 static void gtk_tree_store_init (GtkTreeStore *tree_store);
32 static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
33 static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
34 static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
35 static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
36 static void gtk_tree_store_sortable_init (GtkTreeSortableIface *iface);
37 static void gtk_tree_store_finalize (GObject *object);
38 static GtkTreeModelFlags gtk_tree_store_get_flags (GtkTreeModel *tree_model);
39 static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
40 static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
42 static gboolean gtk_tree_store_get_iter (GtkTreeModel *tree_model,
45 static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
47 static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
51 static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
53 static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
56 static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
58 static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
60 static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
64 static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
69 static void gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
71 static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
77 static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
79 static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
81 GtkSelectionData *selection_data);
82 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
84 GtkSelectionData *selection_data);
85 static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
86 GtkTreePath *dest_path,
87 GtkSelectionData *selection_data);
89 /* Sortable Interfaces */
91 static void gtk_tree_store_sort (GtkTreeStore *tree_store);
92 static void gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
95 static gboolean gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
98 static void gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
101 static void gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
103 GtkTreeIterCompareFunc func,
105 GtkDestroyNotify destroy);
106 static void gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
107 GtkTreeIterCompareFunc func,
109 GtkDestroyNotify destroy);
110 static gboolean gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable);
112 static void validate_gnode (GNode *node);
114 static void gtk_tree_store_move (GtkTreeStore *tree_store,
116 GtkTreeIter *position,
120 static GObjectClass *parent_class = NULL;
124 validate_tree (GtkTreeStore *tree_store)
126 if (gtk_debug_flags & GTK_DEBUG_TREE)
128 g_assert (G_NODE (tree_store->root)->parent == NULL);
130 validate_gnode (G_NODE (tree_store->root));
135 gtk_tree_store_get_type (void)
137 static GType tree_store_type = 0;
139 if (!tree_store_type)
141 static const GTypeInfo tree_store_info =
143 sizeof (GtkTreeStoreClass),
144 NULL, /* base_init */
145 NULL, /* base_finalize */
146 (GClassInitFunc) gtk_tree_store_class_init,
147 NULL, /* class_finalize */
148 NULL, /* class_data */
149 sizeof (GtkTreeStore),
151 (GInstanceInitFunc) gtk_tree_store_init
154 static const GInterfaceInfo tree_model_info =
156 (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
161 static const GInterfaceInfo drag_source_info =
163 (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
168 static const GInterfaceInfo drag_dest_info =
170 (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
175 static const GInterfaceInfo sortable_info =
177 (GInterfaceInitFunc) gtk_tree_store_sortable_init,
182 tree_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkTreeStore",
183 &tree_store_info, 0);
185 g_type_add_interface_static (tree_store_type,
188 g_type_add_interface_static (tree_store_type,
189 GTK_TYPE_TREE_DRAG_SOURCE,
191 g_type_add_interface_static (tree_store_type,
192 GTK_TYPE_TREE_DRAG_DEST,
194 g_type_add_interface_static (tree_store_type,
195 GTK_TYPE_TREE_SORTABLE,
200 return tree_store_type;
204 gtk_tree_store_class_init (GtkTreeStoreClass *class)
206 GObjectClass *object_class;
208 parent_class = g_type_class_peek_parent (class);
209 object_class = (GObjectClass *) class;
211 object_class->finalize = gtk_tree_store_finalize;
215 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
217 iface->get_flags = gtk_tree_store_get_flags;
218 iface->get_n_columns = gtk_tree_store_get_n_columns;
219 iface->get_column_type = gtk_tree_store_get_column_type;
220 iface->get_iter = gtk_tree_store_get_iter;
221 iface->get_path = gtk_tree_store_get_path;
222 iface->get_value = gtk_tree_store_get_value;
223 iface->iter_next = gtk_tree_store_iter_next;
224 iface->iter_children = gtk_tree_store_iter_children;
225 iface->iter_has_child = gtk_tree_store_iter_has_child;
226 iface->iter_n_children = gtk_tree_store_iter_n_children;
227 iface->iter_nth_child = gtk_tree_store_iter_nth_child;
228 iface->iter_parent = gtk_tree_store_iter_parent;
232 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
234 iface->drag_data_delete = gtk_tree_store_drag_data_delete;
235 iface->drag_data_get = gtk_tree_store_drag_data_get;
239 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
241 iface->drag_data_received = gtk_tree_store_drag_data_received;
242 iface->row_drop_possible = gtk_tree_store_row_drop_possible;
246 gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
248 iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
249 iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
250 iface->set_sort_func = gtk_tree_store_set_sort_func;
251 iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
252 iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
256 gtk_tree_store_init (GtkTreeStore *tree_store)
258 tree_store->root = g_node_new (NULL);
259 /* While the odds are against us getting 0...
263 tree_store->stamp = g_random_int ();
265 while (tree_store->stamp == 0);
267 tree_store->sort_list = NULL;
268 tree_store->sort_column_id = -2;
269 tree_store->columns_dirty = FALSE;
273 * gtk_tree_store_new:
274 * @n_columns: number of columns in the tree store
275 * @Varargs: all #GType types for the columns, from first to last
277 * Creates a new tree store as with @n_columns columns each of the types passed
278 * in. As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
279 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
280 * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
282 * Return value: a new #GtkTreeStore
285 gtk_tree_store_new (gint n_columns,
288 GtkTreeStore *retval;
292 g_return_val_if_fail (n_columns > 0, NULL);
294 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
295 gtk_tree_store_set_n_columns (retval, n_columns);
297 va_start (args, n_columns);
299 for (i = 0; i < n_columns; i++)
301 GType type = va_arg (args, GType);
302 if (! _gtk_tree_data_list_check_type (type))
304 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
305 G_STRLOC, g_type_name (type));
306 g_object_unref (retval);
309 gtk_tree_store_set_column_type (retval, i, type);
316 * gtk_tree_store_newv:
317 * @n_columns: number of columns in the tree store
318 * @types: an array of #GType types for the columns, from first to last
320 * Non vararg creation function. Used primarily by language bindings.
322 * Return value: a new #GtkTreeStore
325 gtk_tree_store_newv (gint n_columns,
328 GtkTreeStore *retval;
331 g_return_val_if_fail (n_columns > 0, NULL);
333 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
334 gtk_tree_store_set_n_columns (retval, n_columns);
336 for (i = 0; i < n_columns; i++)
338 if (! _gtk_tree_data_list_check_type (types[i]))
340 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
341 G_STRLOC, g_type_name (types[i]));
342 g_object_unref (retval);
345 gtk_tree_store_set_column_type (retval, i, types[i]);
353 * gtk_tree_store_set_column_types:
354 * @tree_store: A #GtkTreeStore
355 * @n_columns: Number of columns for the tree store
356 * @types: An array of #GType types, one for each column
358 * This function is meant primarily for #GObjects that inherit from
359 * #GtkTreeStore, and should only be used when constructing a new
360 * #GtkTreeStore. It will not function after a row has been added,
361 * or a method on the #GtkTreeModel interface is called.
364 gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
370 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
371 g_return_if_fail (tree_store->columns_dirty == 0);
373 gtk_tree_store_set_n_columns (tree_store, n_columns);
374 for (i = 0; i < n_columns; i++)
376 if (! _gtk_tree_data_list_check_type (types[i]))
378 g_warning ("%s: Invalid type %s passed to gtk_tree_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
381 gtk_tree_store_set_column_type (tree_store, i, types[i]);
386 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
391 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
393 if (tree_store->n_columns == n_columns)
396 new_columns = g_new0 (GType, n_columns);
397 if (tree_store->column_headers)
399 /* copy the old header orders over */
400 if (n_columns >= tree_store->n_columns)
401 memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
403 memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
405 g_free (tree_store->column_headers);
408 if (tree_store->sort_list)
409 _gtk_tree_data_list_header_free (tree_store->sort_list);
411 tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
413 tree_store->column_headers = new_columns;
414 tree_store->n_columns = n_columns;
418 * gtk_tree_store_set_column_type:
419 * @tree_store: a #GtkTreeStore
420 * @column: column number
421 * @type: type of the data to be stored in @column
423 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
424 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
425 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
426 * subclasses of those types such as %GDK_TYPE_PIXBUF.
430 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
434 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
435 g_return_if_fail (column >=0 && column < tree_store->n_columns);
436 if (!_gtk_tree_data_list_check_type (type))
438 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
441 tree_store->column_headers[column] = type;
445 node_free (GNode *node, gpointer data)
448 _gtk_tree_data_list_free (node->data, (GType*)data);
455 gtk_tree_store_finalize (GObject *object)
457 GtkTreeStore *tree_store = GTK_TREE_STORE (object);
459 g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
460 node_free, tree_store->column_headers);
461 g_node_destroy (tree_store->root);
462 _gtk_tree_data_list_header_free (tree_store->sort_list);
463 g_free (tree_store->column_headers);
465 if (tree_store->default_sort_destroy)
467 GtkDestroyNotify d = tree_store->default_sort_destroy;
469 tree_store->default_sort_destroy = NULL;
470 d (tree_store->default_sort_data);
471 tree_store->default_sort_data = NULL;
475 (* parent_class->finalize) (object);
478 /* fulfill the GtkTreeModel requirements */
479 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
480 * it is not visible to the tree or to the user., and the path "0" refers to the
481 * first child of GtkTreeStore::root.
485 static GtkTreeModelFlags
486 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
488 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
490 return GTK_TREE_MODEL_ITERS_PERSIST;
494 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
496 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
498 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
500 tree_store->columns_dirty = TRUE;
502 return tree_store->n_columns;
506 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
509 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
511 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
512 g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
513 index >= 0, G_TYPE_INVALID);
515 tree_store->columns_dirty = TRUE;
517 return tree_store->column_headers[index];
521 gtk_tree_store_get_iter (GtkTreeModel *tree_model,
525 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
530 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
532 tree_store->columns_dirty = TRUE;
534 indices = gtk_tree_path_get_indices (path);
535 depth = gtk_tree_path_get_depth (path);
537 g_return_val_if_fail (depth > 0, FALSE);
539 parent.stamp = tree_store->stamp;
540 parent.user_data = tree_store->root;
542 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[0]))
545 for (i = 1; i < depth; i++)
548 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
556 gtk_tree_store_get_path (GtkTreeModel *tree_model,
563 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
564 g_return_val_if_fail (iter != NULL, NULL);
565 g_return_val_if_fail (iter->user_data != NULL, NULL);
566 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
568 validate_tree ((GtkTreeStore*)tree_model);
570 if (G_NODE (iter->user_data)->parent == NULL &&
571 G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
572 return gtk_tree_path_new ();
573 g_assert (G_NODE (iter->user_data)->parent != NULL);
575 if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
577 retval = gtk_tree_path_new ();
578 tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
582 GtkTreeIter tmp_iter = *iter;
584 tmp_iter.user_data = G_NODE (iter->user_data)->parent;
586 retval = gtk_tree_store_get_path (tree_model,
588 tmp_node = G_NODE (iter->user_data)->parent->children;
594 if (tmp_node == NULL)
596 gtk_tree_path_free (retval);
600 for (; tmp_node; tmp_node = tmp_node->next)
602 if (tmp_node == G_NODE (iter->user_data))
607 if (tmp_node == NULL)
609 /* We couldn't find node, meaning it's prolly not ours */
610 /* Perhaps I should do a g_return_if_fail here. */
611 gtk_tree_path_free (retval);
615 gtk_tree_path_append_index (retval, i);
622 gtk_tree_store_get_value (GtkTreeModel *tree_model,
627 GtkTreeDataList *list;
628 gint tmp_column = column;
630 g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
631 g_return_if_fail (iter != NULL);
632 g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
633 g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
635 list = G_NODE (iter->user_data)->data;
637 while (tmp_column-- > 0 && list)
642 _gtk_tree_data_list_node_to_value (list,
643 GTK_TREE_STORE (tree_model)->column_headers[column],
648 /* We want to return an initialized but empty (default) value */
649 g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
654 gtk_tree_store_iter_next (GtkTreeModel *tree_model,
657 g_return_val_if_fail (iter != NULL, FALSE);
658 g_return_val_if_fail (iter->user_data != NULL, FALSE);
659 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
661 if (G_NODE (iter->user_data)->next)
663 iter->user_data = G_NODE (iter->user_data)->next;
671 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
677 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
678 g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
681 children = G_NODE (parent->user_data)->children;
683 children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
687 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
688 iter->user_data = children;
696 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
699 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
700 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
701 g_return_val_if_fail (iter->user_data != NULL, FALSE);
703 return G_NODE (iter->user_data)->children != NULL;
707 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
713 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
714 g_return_val_if_fail (iter == NULL || iter->user_data != NULL, FALSE);
717 node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
719 node = G_NODE (iter->user_data)->children;
731 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
739 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
740 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
743 parent_node = GTK_TREE_STORE (tree_model)->root;
745 parent_node = parent->user_data;
747 child = g_node_nth_child (parent_node, n);
751 iter->user_data = child;
752 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
760 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
766 g_return_val_if_fail (iter != NULL, FALSE);
767 g_return_val_if_fail (child != NULL, FALSE);
768 g_return_val_if_fail (child->user_data != NULL, FALSE);
769 g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
771 parent = G_NODE (child->user_data)->parent;
773 g_assert (parent != NULL);
775 if (parent != GTK_TREE_STORE (tree_model)->root)
777 iter->user_data = parent;
778 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
786 /* Does not emit a signal */
788 gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
794 GtkTreeDataList *list;
795 GtkTreeDataList *prev;
796 gint old_column = column;
797 GValue real_value = {0, };
798 gboolean converted = FALSE;
799 gboolean retval = FALSE;
801 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
802 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
803 g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
804 g_return_val_if_fail (G_IS_VALUE (value), FALSE);
806 if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
808 if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
809 g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
811 g_warning ("%s: Unable to convert from %s to %s\n",
813 g_type_name (G_VALUE_TYPE (value)),
814 g_type_name (tree_store->column_headers[column]));
817 if (!g_value_transform (value, &real_value))
819 g_warning ("%s: Unable to make conversion from %s to %s\n",
821 g_type_name (G_VALUE_TYPE (value)),
822 g_type_name (tree_store->column_headers[column]));
823 g_value_unset (&real_value);
829 prev = list = G_NODE (iter->user_data)->data;
836 _gtk_tree_data_list_value_to_node (list, &real_value);
838 _gtk_tree_data_list_value_to_node (list, value);
841 g_value_unset (&real_value);
842 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
843 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
852 if (G_NODE (iter->user_data)->data == NULL)
854 G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
859 list = prev->next = _gtk_tree_data_list_alloc ();
865 list->next = _gtk_tree_data_list_alloc ();
872 _gtk_tree_data_list_value_to_node (list, &real_value);
874 _gtk_tree_data_list_value_to_node (list, value);
878 g_value_unset (&real_value);
880 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
881 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
887 * gtk_tree_store_set_value:
888 * @tree_store: a #GtkTreeStore
889 * @iter: A valid #GtkTreeIter for the row being modified
890 * @column: column number to modify
891 * @value: new value for the cell
893 * Sets the data in the cell specified by @iter and @column.
894 * The type of @value must be convertible to the type of the
899 gtk_tree_store_set_value (GtkTreeStore *tree_store,
904 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
905 g_return_if_fail (VALID_ITER (iter, tree_store));
906 g_return_if_fail (column >= 0 && column < tree_store->n_columns);
907 g_return_if_fail (G_IS_VALUE (value));
909 if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
913 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
914 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
915 gtk_tree_path_free (path);
920 * gtk_tree_store_set_valist:
921 * @tree_store: A #GtkTreeStore
922 * @iter: A valid #GtkTreeIter for the row being modified
923 * @var_args: <type>va_list</type> of column/value pairs
925 * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
926 * use by language bindings.
930 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
935 gboolean emit_signal = FALSE;
936 gboolean maybe_need_sort = FALSE;
937 GtkTreeIterCompareFunc func = NULL;
939 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
940 g_return_if_fail (VALID_ITER (iter, tree_store));
942 column = va_arg (var_args, gint);
944 if (GTK_TREE_STORE_IS_SORTED (tree_store))
946 if (tree_store->sort_column_id != -1)
948 GtkTreeDataSortHeader *header;
949 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
950 tree_store->sort_column_id);
951 g_return_if_fail (header != NULL);
952 g_return_if_fail (header->func != NULL);
957 func = tree_store->default_sort_func;
961 if (func != gtk_tree_data_list_compare_func)
962 maybe_need_sort = TRUE;
966 GValue value = { 0, };
969 if (column >= tree_store->n_columns)
971 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
974 g_value_init (&value, tree_store->column_headers[column]);
976 G_VALUE_COLLECT (&value, var_args, 0, &error);
979 g_warning ("%s: %s", G_STRLOC, error);
982 /* we purposely leak the value here, it might not be
983 * in a sane state if an error condition occoured
988 emit_signal = gtk_tree_store_real_set_value (tree_store,
992 FALSE) || emit_signal;
994 if (func == gtk_tree_data_list_compare_func &&
995 column == tree_store->sort_column_id)
996 maybe_need_sort = TRUE;
998 g_value_unset (&value);
1000 column = va_arg (var_args, gint);
1003 if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1004 gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id);
1010 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
1011 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
1012 gtk_tree_path_free (path);
1017 * gtk_tree_store_set:
1018 * @tree_store: A #GtkTreeStore
1019 * @iter: A valid #GtkTreeIter for the row being modified
1020 * @Varargs: pairs of column number and value, terminated with -1
1022 * Sets the value of one or more cells in the row referenced by @iter.
1023 * The variable argument list should contain integer column numbers,
1024 * each column number followed by the value to be set.
1025 * The list is terminated by a -1. For example, to set column 0 with type
1026 * %G_TYPE_STRING to "Foo", you would write
1027 * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
1030 gtk_tree_store_set (GtkTreeStore *tree_store,
1036 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1037 g_return_if_fail (VALID_ITER (iter, tree_store));
1039 va_start (var_args, iter);
1040 gtk_tree_store_set_valist (tree_store, iter, var_args);
1045 * gtk_tree_store_remove:
1046 * @tree_store: A #GtkTreeStore
1047 * @iter: A valid #GtkTreeIter
1049 * Removes @iter from @tree_store. After being removed, @iter is set to the
1050 * next valid row at that level, or invalidated if it previously pointed to the
1053 * Return value: %TRUE if @iter is still valid, %FALSE if not.
1056 gtk_tree_store_remove (GtkTreeStore *tree_store,
1060 GtkTreeIter new_iter = {0,};
1064 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1065 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1067 parent = G_NODE (iter->user_data)->parent;
1069 g_assert (parent != NULL);
1070 next_node = G_NODE (iter->user_data)->next;
1072 if (G_NODE (iter->user_data)->data)
1073 g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1074 -1, node_free, tree_store->column_headers);
1076 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1077 g_node_destroy (G_NODE (iter->user_data));
1079 gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1081 if (parent != G_NODE (tree_store->root))
1084 if (parent->children == NULL)
1086 gtk_tree_path_up (path);
1088 new_iter.stamp = tree_store->stamp;
1089 new_iter.user_data = parent;
1090 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1093 gtk_tree_path_free (path);
1095 /* revalidate iter */
1096 if (next_node != NULL)
1098 iter->stamp = tree_store->stamp;
1099 iter->user_data = next_node;
1105 iter->user_data = NULL;
1112 * gtk_tree_store_insert:
1113 * @tree_store: A #GtkTreeStore
1114 * @iter: An unset #GtkTreeIter to set to the new row
1115 * @parent: A valid #GtkTreeIter, or %NULL
1116 * @position: position to insert the new row
1118 * Creates a new row at @position. If parent is non-%NULL, then the row will be
1119 * made a child of @parent. Otherwise, the row will be created at the toplevel.
1120 * If @position is larger than the number of rows at that level, then the new
1121 * row will be inserted to the end of the list. @iter will be changed to point
1122 * to this new row. The row will be empty after this function is called. To
1123 * fill in values, you need to call gtk_tree_store_set() or
1124 * gtk_tree_store_set_value().
1128 gtk_tree_store_insert (GtkTreeStore *tree_store,
1130 GtkTreeIter *parent,
1136 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1138 g_return_if_fail (VALID_ITER (parent, tree_store));
1141 parent_node = parent->user_data;
1143 parent_node = tree_store->root;
1145 tree_store->columns_dirty = TRUE;
1147 iter->stamp = tree_store->stamp;
1148 iter->user_data = g_node_new (NULL);
1149 g_node_insert (parent_node, position, G_NODE (iter->user_data));
1151 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1152 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1154 gtk_tree_path_free (path);
1156 validate_tree ((GtkTreeStore*)tree_store);
1160 * gtk_tree_store_insert_before:
1161 * @tree_store: A #GtkTreeStore
1162 * @iter: An unset #GtkTreeIter to set to the new row
1163 * @parent: A valid #GtkTreeIter, or %NULL
1164 * @sibling: A valid #GtkTreeIter, or %NULL
1166 * Inserts a new row before @sibling. If @sibling is %NULL, then the row will
1167 * be appended to @parent 's children. If @parent and @sibling are %NULL, then
1168 * the row will be appended to the toplevel. If both @sibling and @parent are
1169 * set, then @parent must be the parent of @sibling. When @sibling is set,
1170 * @parent is optional.
1172 * @iter will be changed to point to this new row. The row will be empty after
1173 * this function is called. To fill in values, you need to call
1174 * gtk_tree_store_set() or gtk_tree_store_set_value().
1178 gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1180 GtkTreeIter *parent,
1181 GtkTreeIter *sibling)
1184 GNode *parent_node = NULL;
1187 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1188 g_return_if_fail (iter != NULL);
1190 g_return_if_fail (VALID_ITER (parent, tree_store));
1191 if (sibling != NULL)
1192 g_return_if_fail (VALID_ITER (sibling, tree_store));
1194 tree_store->columns_dirty = TRUE;
1196 new_node = g_node_new (NULL);
1198 if (parent == NULL && sibling == NULL)
1199 parent_node = tree_store->root;
1200 else if (parent == NULL)
1201 parent_node = G_NODE (sibling->user_data)->parent;
1202 else if (sibling == NULL)
1203 parent_node = G_NODE (parent->user_data);
1206 g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1207 parent_node = G_NODE (parent->user_data);
1210 g_node_insert_before (parent_node,
1211 sibling ? G_NODE (sibling->user_data) : NULL,
1214 iter->stamp = tree_store->stamp;
1215 iter->user_data = new_node;
1217 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1218 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1220 gtk_tree_path_free (path);
1222 validate_tree ((GtkTreeStore*)tree_store);
1226 * gtk_tree_store_insert_after:
1227 * @tree_store: A #GtkTreeStore
1228 * @iter: An unset #GtkTreeIter to set to the new row
1229 * @parent: A valid #GtkTreeIter, or %NULL
1230 * @sibling: A valid #GtkTreeIter, or %NULL
1232 * Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1233 * prepended to @parent 's children. If @parent and @sibling are %NULL, then
1234 * the row will be prepended to the toplevel. If both @sibling and @parent are
1235 * set, then @parent must be the parent of @sibling. When @sibling is set,
1236 * @parent is optional.
1238 * @iter will be changed to point to this new row. The row will be empty after
1239 * this function is called. To fill in values, you need to call
1240 * gtk_tree_store_set() or gtk_tree_store_set_value().
1244 gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1246 GtkTreeIter *parent,
1247 GtkTreeIter *sibling)
1253 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1254 g_return_if_fail (iter != NULL);
1256 g_return_if_fail (VALID_ITER (parent, tree_store));
1257 if (sibling != NULL)
1258 g_return_if_fail (VALID_ITER (sibling, tree_store));
1260 tree_store->columns_dirty = TRUE;
1262 new_node = g_node_new (NULL);
1264 if (parent == NULL && sibling == NULL)
1265 parent_node = tree_store->root;
1266 else if (parent == NULL)
1267 parent_node = G_NODE (sibling->user_data)->parent;
1268 else if (sibling == NULL)
1269 parent_node = G_NODE (parent->user_data);
1272 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1273 G_NODE (parent->user_data));
1274 parent_node = G_NODE (parent->user_data);
1278 g_node_insert_after (parent_node,
1279 sibling ? G_NODE (sibling->user_data) : NULL,
1282 iter->stamp = tree_store->stamp;
1283 iter->user_data = new_node;
1285 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1286 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1288 gtk_tree_path_free (path);
1290 validate_tree ((GtkTreeStore*)tree_store);
1294 * gtk_tree_store_prepend:
1295 * @tree_store: A #GtkTreeStore
1296 * @iter: An unset #GtkTreeIter to set to the prepended row
1297 * @parent: A valid #GtkTreeIter, or %NULL
1299 * Prepends a new row to @tree_store. If @parent is non-%NULL, then it will prepend
1300 * the new row before the first child of @parent, otherwise it will prepend a row
1301 * to the top level. @iter will be changed to point to this new row. The row
1302 * will be empty after this function is called. To fill in values, you need to
1303 * call gtk_tree_store_set() or gtk_tree_store_set_value().
1306 gtk_tree_store_prepend (GtkTreeStore *tree_store,
1308 GtkTreeIter *parent)
1312 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1313 g_return_if_fail (iter != NULL);
1315 g_return_if_fail (VALID_ITER (parent, tree_store));
1317 tree_store->columns_dirty = TRUE;
1320 parent_node = tree_store->root;
1322 parent_node = parent->user_data;
1324 if (parent_node->children == NULL)
1328 iter->stamp = tree_store->stamp;
1329 iter->user_data = g_node_new (NULL);
1331 g_node_prepend (parent_node, G_NODE (iter->user_data));
1333 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1334 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1336 if (parent_node != tree_store->root)
1338 gtk_tree_path_up (path);
1339 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1341 gtk_tree_path_free (path);
1345 gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1348 validate_tree ((GtkTreeStore*)tree_store);
1352 * gtk_tree_store_append:
1353 * @tree_store: A #GtkTreeStore
1354 * @iter: An unset #GtkTreeIter to set to the appended row
1355 * @parent: A valid #GtkTreeIter, or %NULL
1357 * Appends a new row to @tree_store. If @parent is non-%NULL, then it will append the
1358 * new row after the last child of @parent, otherwise it will append a row to
1359 * the top level. @iter will be changed to point to this new row. The row will
1360 * be empty after this function is called. To fill in values, you need to call
1361 * gtk_tree_store_set() or gtk_tree_store_set_value().
1364 gtk_tree_store_append (GtkTreeStore *tree_store,
1366 GtkTreeIter *parent)
1370 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1371 g_return_if_fail (iter != NULL);
1374 g_return_if_fail (VALID_ITER (parent, tree_store));
1377 parent_node = tree_store->root;
1379 parent_node = parent->user_data;
1381 tree_store->columns_dirty = TRUE;
1383 if (parent_node->children == NULL)
1387 iter->stamp = tree_store->stamp;
1388 iter->user_data = g_node_new (NULL);
1390 g_node_append (parent_node, G_NODE (iter->user_data));
1392 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1393 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1395 if (parent_node != tree_store->root)
1397 gtk_tree_path_up (path);
1398 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1400 gtk_tree_path_free (path);
1404 gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1407 validate_tree ((GtkTreeStore*)tree_store);
1411 * gtk_tree_store_is_ancestor:
1412 * @tree_store: A #GtkTreeStore
1413 * @iter: A valid #GtkTreeIter
1414 * @descendant: A valid #GtkTreeIter
1416 * Returns %TRUE if @iter is an ancestor of @descendant. That is, @iter is the
1417 * parent (or grandparent or great-grandparent) of @descendant.
1419 * Return value: %TRUE, if @iter is an ancestor of @descendant
1422 gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1424 GtkTreeIter *descendant)
1426 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1427 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1428 g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1430 return g_node_is_ancestor (G_NODE (iter->user_data),
1431 G_NODE (descendant->user_data));
1436 * gtk_tree_store_iter_depth:
1437 * @tree_store: A #GtkTreeStore
1438 * @iter: A valid #GtkTreeIter
1440 * Returns the depth of @iter. This will be 0 for anything on the root level, 1
1441 * for anything down a level, etc.
1443 * Return value: The depth of @iter
1446 gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1449 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1450 g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1452 return g_node_depth (G_NODE (iter->user_data)) - 2;
1455 /* simple ripoff from g_node_traverse_post_order */
1457 gtk_tree_store_clear_traverse (GNode *node,
1458 GtkTreeStore *store)
1466 child = node->children;
1469 register GNode *current;
1472 child = current->next;
1473 if (gtk_tree_store_clear_traverse (current, store))
1479 iter.stamp = store->stamp;
1480 iter.user_data = node;
1482 gtk_tree_store_remove (store, &iter);
1485 else if (node->parent)
1487 iter.stamp = store->stamp;
1488 iter.user_data = node;
1490 gtk_tree_store_remove (store, &iter);
1497 * gtk_tree_store_clear:
1498 * @tree_store: a #GtkTreeStore
1500 * Removes all rows from @tree_store
1503 gtk_tree_store_clear (GtkTreeStore *tree_store)
1505 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1507 gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1511 gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1520 if (node == iter->user_data)
1524 if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1535 * gtk_tree_store_iter_is_valid:
1536 * @tree_store: A #GtkTreeStore.
1537 * @iter: A #GtkTreeIter.
1539 * WARNING: This function is slow. Only use it for debugging and/or testing
1542 * Checks if the given iter is a valid iter for this #GtkTreeStore.
1544 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1549 gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1552 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1553 g_return_val_if_fail (iter != NULL, FALSE);
1555 if (!VALID_ITER (iter, tree_store))
1558 return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1565 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1570 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1572 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1576 gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1587 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1589 GtkSelectionData *selection_data)
1591 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1593 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1594 * target, because the default handler does it for us, but
1595 * we do anyway for the convenience of someone maybe overriding the
1599 if (gtk_tree_set_row_drag_data (selection_data,
1600 GTK_TREE_MODEL (drag_source),
1607 /* FIXME handle text targets at least. */
1614 copy_node_data (GtkTreeStore *tree_store,
1615 GtkTreeIter *src_iter,
1616 GtkTreeIter *dest_iter)
1618 GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1619 GtkTreeDataList *copy_head = NULL;
1620 GtkTreeDataList *copy_prev = NULL;
1621 GtkTreeDataList *copy_iter = NULL;
1628 copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1630 if (copy_head == NULL)
1631 copy_head = copy_iter;
1634 copy_prev->next = copy_iter;
1636 copy_prev = copy_iter;
1642 G_NODE (dest_iter->user_data)->data = copy_head;
1644 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1645 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1646 gtk_tree_path_free (path);
1650 recursive_node_copy (GtkTreeStore *tree_store,
1651 GtkTreeIter *src_iter,
1652 GtkTreeIter *dest_iter)
1655 GtkTreeModel *model;
1657 model = GTK_TREE_MODEL (tree_store);
1659 copy_node_data (tree_store, src_iter, dest_iter);
1661 if (gtk_tree_model_iter_children (model,
1665 /* Need to create children and recurse. Note our
1666 * dependence on persistent iterators here.
1672 /* Gee, a really slow algorithm... ;-) FIXME */
1673 gtk_tree_store_append (tree_store,
1677 recursive_node_copy (tree_store, &child, ©);
1679 while (gtk_tree_model_iter_next (model, &child));
1684 gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1686 GtkSelectionData *selection_data)
1688 GtkTreeModel *tree_model;
1689 GtkTreeStore *tree_store;
1690 GtkTreeModel *src_model = NULL;
1691 GtkTreePath *src_path = NULL;
1692 gboolean retval = FALSE;
1694 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1696 tree_model = GTK_TREE_MODEL (drag_dest);
1697 tree_store = GTK_TREE_STORE (drag_dest);
1699 validate_tree (tree_store);
1701 if (gtk_tree_get_row_drag_data (selection_data,
1704 src_model == tree_model)
1706 /* Copy the given row to a new position */
1707 GtkTreeIter src_iter;
1708 GtkTreeIter dest_iter;
1711 if (!gtk_tree_model_get_iter (src_model,
1718 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1719 prev = gtk_tree_path_copy (dest);
1721 if (!gtk_tree_path_prev (prev))
1723 GtkTreeIter dest_parent;
1724 GtkTreePath *parent;
1725 GtkTreeIter *dest_parent_p;
1727 /* dest was the first spot at the current depth; which means
1728 * we are supposed to prepend.
1731 /* Get the parent, NULL if parent is the root */
1732 dest_parent_p = NULL;
1733 parent = gtk_tree_path_copy (dest);
1734 if (gtk_tree_path_up (parent) &&
1735 gtk_tree_path_get_depth (parent) > 0)
1737 gtk_tree_model_get_iter (tree_model,
1740 dest_parent_p = &dest_parent;
1742 gtk_tree_path_free (parent);
1745 gtk_tree_store_prepend (GTK_TREE_STORE (tree_model),
1753 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model),
1757 GtkTreeIter tmp_iter = dest_iter;
1759 if (GPOINTER_TO_INT (g_object_get_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append")))
1763 if (gtk_tree_model_iter_parent (GTK_TREE_MODEL (tree_model), &parent, &tmp_iter))
1764 gtk_tree_store_append (GTK_TREE_STORE (tree_model),
1765 &dest_iter, &parent);
1767 gtk_tree_store_append (GTK_TREE_STORE (tree_model),
1771 gtk_tree_store_insert_after (GTK_TREE_STORE (tree_model),
1780 g_object_set_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append",
1783 gtk_tree_path_free (prev);
1785 /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1786 * duplicating it below dest_iter.
1791 recursive_node_copy (tree_store,
1798 /* FIXME maybe add some data targets eventually, or handle text
1799 * targets in the simple case.
1807 gtk_tree_path_free (src_path);
1813 gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1814 GtkTreePath *dest_path,
1815 GtkSelectionData *selection_data)
1817 GtkTreeModel *src_model = NULL;
1818 GtkTreePath *src_path = NULL;
1819 GtkTreePath *tmp = NULL;
1820 gboolean retval = FALSE;
1822 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1824 /* don't accept drops if the tree has been sorted */
1825 if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1828 if (!gtk_tree_get_row_drag_data (selection_data,
1833 /* can only drag to ourselves */
1834 if (src_model != GTK_TREE_MODEL (drag_dest))
1837 /* Can't drop into ourself. */
1838 if (gtk_tree_path_is_ancestor (src_path,
1842 /* Can't drop if dest_path's parent doesn't exist */
1846 if (gtk_tree_path_get_depth (dest_path) > 1)
1848 tmp = gtk_tree_path_copy (dest_path);
1849 gtk_tree_path_up (tmp);
1851 if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1857 /* Can otherwise drop anywhere. */
1863 gtk_tree_path_free (src_path);
1865 gtk_tree_path_free (tmp);
1870 /* Sorting and reordering */
1871 typedef struct _SortTuple
1879 gtk_tree_store_reorder_func (gconstpointer a,
1883 SortTuple *a_reorder;
1884 SortTuple *b_reorder;
1886 a_reorder = (SortTuple *)a;
1887 b_reorder = (SortTuple *)b;
1889 if (a_reorder->offset < b_reorder->offset)
1891 if (a_reorder->offset > b_reorder->offset)
1898 * gtk_tree_store_reorder:
1899 * @tree_store: A #GtkTreeStore.
1900 * @parent: A #GtkTreeIter.
1901 * @new_order: An integer array indication the new order for the list.
1903 * Reorders the children of @parent in @tree_store to follow the order
1904 * indicated by @new_order. Note that this function only works with
1910 gtk_tree_store_reorder (GtkTreeStore *tree_store,
1911 GtkTreeIter *parent,
1915 GNode *level, *node;
1917 SortTuple *sort_array;
1919 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1920 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
1921 g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
1922 g_return_if_fail (new_order != NULL);
1925 level = G_NODE (tree_store->root)->children;
1927 level = G_NODE (parent->user_data)->children;
1937 /* set up sortarray */
1938 sort_array = g_new (SortTuple, length);
1941 for (i = 0; i < length; i++)
1943 sort_array[i].offset = new_order[i];
1944 sort_array[i].node = node;
1949 g_qsort_with_data (sort_array,
1952 gtk_tree_store_reorder_func,
1956 for (i = 0; i < length - 1; i++)
1958 sort_array[i].node->next = sort_array[i+1].node;
1959 sort_array[i+1].node->prev = sort_array[i].node;
1962 sort_array[length-1].node->next = NULL;
1963 sort_array[0].node->prev = NULL;
1965 G_NODE (parent->user_data)->children = sort_array[0].node;
1967 G_NODE (tree_store->root)->children = sort_array[0].node;
1971 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), parent);
1973 path = gtk_tree_path_new ();
1974 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
1976 gtk_tree_path_free (path);
1977 g_free (sort_array);
1981 * gtk_tree_store_swap:
1982 * @tree_store: A #GtkTreeStore.
1983 * @a: A #GtkTreeIter.
1984 * @b: Another #GtkTreeIter.
1986 * Swaps @a and @b in the same level of @tree_store. Note that this function
1987 * only works with unsorted stores.
1992 gtk_tree_store_swap (GtkTreeStore *tree_store,
1996 GNode *tmp, *node_a, *node_b, *parent_node;
1997 GNode *a_prev, *a_next, *b_prev, *b_next;
1998 gint i, a_count, b_count, length, *order;
1999 GtkTreePath *path_a, *path_b;
2002 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2003 g_return_if_fail (VALID_ITER (a, tree_store));
2004 g_return_if_fail (VALID_ITER (b, tree_store));
2006 node_a = G_NODE (a->user_data);
2007 node_b = G_NODE (b->user_data);
2009 /* basic sanity checking */
2010 if (node_a == node_b)
2013 path_a = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), a);
2014 path_b = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), b);
2016 g_return_if_fail (path_a && path_b);
2018 gtk_tree_path_up (path_a);
2019 gtk_tree_path_up (path_b);
2021 if (gtk_tree_path_compare (path_a, path_b))
2023 gtk_tree_path_free (path_a);
2024 gtk_tree_path_free (path_b);
2026 g_warning ("Given childs are not in the same level\n");
2030 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent, path_a);
2031 parent_node = G_NODE (parent.user_data);
2033 gtk_tree_path_free (path_b);
2035 /* old links which we have to keep around */
2036 a_prev = node_a->prev;
2037 a_next = node_a->next;
2039 b_prev = node_b->prev;
2040 b_next = node_b->next;
2042 /* fix up links if the nodes are next to eachother */
2043 if (a_prev == node_b)
2045 if (a_next == node_b)
2048 if (b_prev == node_a)
2050 if (b_next == node_a)
2053 /* counting nodes */
2054 tmp = parent_node->children;
2055 i = a_count = b_count = 0;
2068 /* hacking the tree */
2070 parent_node->children = node_b;
2072 a_prev->next = node_b;
2075 a_next->prev = node_b;
2078 parent_node->children = node_a;
2080 b_prev->next = node_a;
2083 b_next->prev = node_a;
2085 node_a->prev = b_prev;
2086 node_a->next = b_next;
2088 node_b->prev = a_prev;
2089 node_b->next = a_next;
2092 order = g_new (gint, length);
2093 for (i = 0; i < length; i++)
2096 else if (i == b_count)
2101 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2103 gtk_tree_path_free (path_a);
2107 /* WARNING: this function is *incredibly* fragily. Please smashtest after
2108 * making changes here.
2112 gtk_tree_store_move (GtkTreeStore *tree_store,
2114 GtkTreeIter *position,
2117 GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2118 gint old_pos, new_pos, length, i, *order;
2119 GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2120 GtkTreeIter parent_iter, dst_a, dst_b;
2122 gboolean handle_b = TRUE;
2124 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2125 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2126 g_return_if_fail (VALID_ITER (iter, tree_store));
2128 g_return_if_fail (VALID_ITER (position, tree_store));
2135 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2136 pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store),
2140 * moving the iter before path or "path + 1" doesn't make sense
2142 * moving the iter before path or "path - 1" doesn't make sense
2144 if (!gtk_tree_path_compare (path, pos_path))
2145 goto free_paths_and_out;
2148 gtk_tree_path_next (path);
2150 gtk_tree_path_prev (path);
2152 if (!gtk_tree_path_compare (path, pos_path))
2153 goto free_paths_and_out;
2156 gtk_tree_path_prev (path);
2158 gtk_tree_path_next (path);
2160 if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2162 g_warning ("Given childs are not in the same level\n");
2164 goto free_paths_and_out;
2167 tmppath = gtk_tree_path_copy (pos_path);
2168 gtk_tree_path_up (path);
2169 gtk_tree_path_up (tmppath);
2171 if (gtk_tree_path_get_depth (path) > 0 &&
2172 gtk_tree_path_compare (path, tmppath))
2174 g_warning ("Given childs are not in the same level\n");
2176 gtk_tree_path_free (tmppath);
2177 goto free_paths_and_out;
2180 gtk_tree_path_free (tmppath);
2185 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2186 gtk_tree_path_up (path);
2189 depth = gtk_tree_path_get_depth (path);
2193 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent_iter, path);
2194 gtk_tree_path_free (path);
2196 parent = G_NODE (parent_iter.user_data);
2199 parent = G_NODE (tree_store->root);
2201 /* yes, I know that this can be done shorter, but I'm doing it this way
2202 * so the code is also maintainable
2205 if (before && position)
2207 b = G_NODE (position->user_data);
2209 if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2211 gtk_tree_path_prev (pos_path);
2212 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_a, pos_path))
2213 a = G_NODE (dst_a.user_data);
2216 gtk_tree_path_next (pos_path);
2219 /* if b is NULL, a is NULL too -- we are at the beginning of the list
2220 * yes and we leak memory here ...
2222 g_return_if_fail (b);
2224 else if (before && !position)
2226 /* move before without position is appending */
2233 a = G_NODE (position->user_data);
2239 gtk_tree_path_next (pos_path);
2240 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2241 b = G_NODE (dst_b.user_data);
2244 gtk_tree_path_prev (pos_path);
2248 /* move after without position is prepending */
2250 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2253 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2256 b = G_NODE (dst_b.user_data);
2259 /* if a is NULL, a is NULL too -- we are at the end of the list
2260 * yes and we leak memory here ...
2263 g_return_if_fail (a);
2266 /* counting nodes */
2267 tmp = parent->children;
2269 length = old_pos = 0;
2272 if (tmp == iter->user_data)
2279 /* remove node from list */
2280 node = G_NODE (iter->user_data);
2285 tmp_a->next = tmp_b;
2287 parent->children = tmp_b;
2290 tmp_b->prev = tmp_a;
2292 /* and reinsert the node */
2301 else if (!a && !before)
2303 tmp = parent->children;
2306 parent->children = node;
2313 else if (!a && before)
2317 node->parent = NULL;
2318 node->next = node->prev = NULL;
2320 /* before with sibling = NULL appends */
2321 g_node_insert_before (parent, NULL, node);
2325 node->parent = NULL;
2326 node->next = node->prev = NULL;
2328 /* after with sibling = NULL prepends */
2329 g_node_insert_after (parent, NULL, node);
2343 else if (!(!a && before)) /* !a && before is completely handled above */
2349 new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2353 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2356 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2362 if (new_pos > old_pos)
2364 if (before && position)
2369 if (!before && position)
2373 order = g_new (gint, length);
2374 if (new_pos > old_pos)
2376 for (i = 0; i < length; i++)
2379 else if (i >= old_pos && i < new_pos)
2381 else if (i == new_pos)
2388 for (i = 0; i < length; i++)
2391 else if (i > new_pos && i <= old_pos)
2397 path = gtk_tree_path_new ();
2398 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2401 for (i = 0; i < length; i++)
2402 g_print ("%2d ", order[i]);
2405 gtk_tree_path_free (path);
2407 gtk_tree_path_free (pos_path);
2413 gtk_tree_path_free (path);
2414 gtk_tree_path_free (pos_path);
2418 * gtk_tree_store_move_before:
2419 * @tree_store: A #GtkTreeStore.
2420 * @iter: A #GtkTreeIter.
2421 * @position: A #GtkTreeIter or %NULL.
2423 * Moves @iter in @tree_store to the position before @position. @iter and
2424 * @position should be in the same level. Note that this function only
2425 * works with unsorted stores. If @position is %NULL, @iter will be
2426 * moved to the end of the level.
2431 gtk_tree_store_move_before (GtkTreeStore *tree_store,
2433 GtkTreeIter *position)
2435 gtk_tree_store_move (tree_store, iter, position, TRUE);
2439 * gtk_tree_store_move_after:
2440 * @tree_store: A #GtkTreeStore.
2441 * @iter: A #GtkTreeIter.
2442 * @position: A #GtkTreeIter.
2444 * Moves @iter in @tree_store to the position after @position. @iter and
2445 * @position should be in the same level. Note that this function only
2446 * works with unsorted stores. If @position is %NULL, @iter will be moved
2447 * to the start of the level.
2452 gtk_tree_store_move_after (GtkTreeStore *tree_store,
2454 GtkTreeIter *position)
2456 gtk_tree_store_move (tree_store, iter, position, FALSE);
2461 gtk_tree_store_compare_func (gconstpointer a,
2465 GtkTreeStore *tree_store = user_data;
2468 GtkTreeIterCompareFunc func;
2475 if (tree_store->sort_column_id != -1)
2477 GtkTreeDataSortHeader *header;
2479 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2480 tree_store->sort_column_id);
2481 g_return_val_if_fail (header != NULL, 0);
2482 g_return_val_if_fail (header->func != NULL, 0);
2484 func = header->func;
2485 data = header->data;
2489 g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2490 func = tree_store->default_sort_func;
2491 data = tree_store->default_sort_data;
2494 node_a = ((SortTuple *) a)->node;
2495 node_b = ((SortTuple *) b)->node;
2497 iter_a.stamp = tree_store->stamp;
2498 iter_a.user_data = node_a;
2499 iter_b.stamp = tree_store->stamp;
2500 iter_b.user_data = node_b;
2502 retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2504 if (tree_store->order == GTK_SORT_DESCENDING)
2508 else if (retval < 0)
2515 gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2528 node = parent->children;
2529 if (node == NULL || node->next == NULL)
2532 g_assert (GTK_TREE_STORE_IS_SORTED (tree_store));
2535 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2538 sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2541 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2546 tuple.node = tmp_node;
2547 g_array_append_val (sort_array, tuple);
2551 /* Sort the array */
2552 g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2554 for (i = 0; i < list_length - 1; i++)
2556 g_array_index (sort_array, SortTuple, i).node->next =
2557 g_array_index (sort_array, SortTuple, i + 1).node;
2558 g_array_index (sort_array, SortTuple, i + 1).node->prev =
2559 g_array_index (sort_array, SortTuple, i).node;
2561 g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2562 g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2563 parent->children = g_array_index (sort_array, SortTuple, 0).node;
2565 /* Let the world know about our new order */
2566 new_order = g_new (gint, list_length);
2567 for (i = 0; i < list_length; i++)
2568 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2570 iter.stamp = tree_store->stamp;
2571 iter.user_data = parent;
2572 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2573 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2574 path, &iter, new_order);
2575 gtk_tree_path_free (path);
2577 g_array_free (sort_array, TRUE);
2581 for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2583 if (tmp_node->children)
2584 gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2590 gtk_tree_store_sort (GtkTreeStore *tree_store)
2592 if (tree_store->sort_column_id != -1)
2594 GtkTreeDataSortHeader *header = NULL;
2596 header = _gtk_tree_data_list_get_header (tree_store->sort_list, tree_store->sort_column_id);
2598 /* We want to make sure that we have a function */
2599 g_return_if_fail (header != NULL);
2600 g_return_if_fail (header->func != NULL);
2604 g_return_if_fail (tree_store->default_sort_func != NULL);
2607 gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2611 gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2618 GtkTreePath *tmp_path;
2619 GtkTreeIter tmp_iter;
2627 GtkTreeIterCompareFunc func;
2630 g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2632 tmp_iter.stamp = tree_store->stamp;
2633 if (tree_store->sort_column_id != -1)
2635 GtkTreeDataSortHeader *header;
2636 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2637 tree_store->sort_column_id);
2638 g_return_if_fail (header != NULL);
2639 g_return_if_fail (header->func != NULL);
2640 func = header->func;
2641 data = header->data;
2645 g_return_if_fail (tree_store->default_sort_func != NULL);
2646 func = tree_store->default_sort_func;
2647 data = tree_store->default_sort_data;
2650 /* If it's the built in function, we don't sort. */
2651 if (func == gtk_tree_data_list_compare_func &&
2652 tree_store->sort_column_id != column)
2656 node = G_NODE (iter->user_data)->parent->children;
2657 /* First we find the iter, its prev, and its next */
2660 if (node == G_NODE (iter->user_data))
2665 g_assert (node != NULL);
2670 /* Check the common case, where we don't need to sort it moved. */
2673 tmp_iter.user_data = prev;
2674 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2679 tmp_iter.user_data = next;
2680 cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2683 if (tree_store->order == GTK_SORT_DESCENDING)
2696 if (prev == NULL && cmp_b <= 0)
2698 else if (next == NULL && cmp_a <= 0)
2700 else if (prev != NULL && next != NULL &&
2701 cmp_a <= 0 && cmp_b <= 0)
2704 /* We actually need to sort it */
2705 /* First, remove the old link. */
2710 node->parent->children = next;
2718 /* FIXME: as an optimization, we can potentially start at next */
2720 node = node->parent->children;
2722 tmp_iter.user_data = node;
2723 if (tree_store->order == GTK_SORT_DESCENDING)
2724 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2726 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2728 while ((node->next) && (cmp_a > 0))
2733 tmp_iter.user_data = node;
2734 if (tree_store->order == GTK_SORT_DESCENDING)
2735 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2737 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2740 if ((!node->next) && (cmp_a > 0))
2743 node->next = G_NODE (iter->user_data);
2744 node->next->prev = node;
2748 prev->next = G_NODE (iter->user_data);
2749 prev->next->prev = prev;
2750 G_NODE (iter->user_data)->next = node;
2751 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2755 G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2756 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2757 G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2760 /* Emit the reordered signal. */
2761 length = g_node_n_children (node->parent);
2762 new_order = g_new (int, length);
2763 if (old_location < new_location)
2764 for (i = 0; i < length; i++)
2766 if (i < old_location ||
2769 else if (i >= old_location &&
2771 new_order[i] = i + 1;
2772 else if (i == new_location)
2773 new_order[i] = old_location;
2776 for (i = 0; i < length; i++)
2778 if (i < new_location ||
2781 else if (i > new_location &&
2783 new_order[i] = i - 1;
2784 else if (i == new_location)
2785 new_order[i] = old_location;
2788 tmp_iter.user_data = node->parent;
2789 tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2791 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2792 tmp_path, &tmp_iter,
2795 gtk_tree_path_free (tmp_path);
2801 gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
2802 gint *sort_column_id,
2805 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2807 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2809 if (tree_store->sort_column_id == -1)
2813 * sort_column_id = tree_store->sort_column_id;
2815 * order = tree_store->order;
2821 gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
2822 gint sort_column_id,
2825 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2827 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2830 if ((tree_store->sort_column_id == sort_column_id) &&
2831 (tree_store->order == order))
2834 if (sort_column_id != -1)
2836 GtkTreeDataSortHeader *header = NULL;
2838 header = _gtk_tree_data_list_get_header (tree_store->sort_list, sort_column_id);
2840 /* We want to make sure that we have a function */
2841 g_return_if_fail (header != NULL);
2842 g_return_if_fail (header->func != NULL);
2846 g_return_if_fail (tree_store->default_sort_func != NULL);
2849 tree_store->sort_column_id = sort_column_id;
2850 tree_store->order = order;
2852 gtk_tree_store_sort (tree_store);
2854 gtk_tree_sortable_sort_column_changed (sortable);
2858 gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
2859 gint sort_column_id,
2860 GtkTreeIterCompareFunc func,
2862 GtkDestroyNotify destroy)
2864 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2865 GtkTreeDataSortHeader *header = NULL;
2868 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2869 g_return_if_fail (func != NULL);
2871 for (list = tree_store->sort_list; list; list = list->next)
2873 GtkTreeDataSortHeader *list_header;
2875 list_header = (GtkTreeDataSortHeader*) list->data;
2876 if (list_header->sort_column_id == sort_column_id)
2878 header = list_header;
2885 header = g_new0 (GtkTreeDataSortHeader, 1);
2886 header->sort_column_id = sort_column_id;
2887 tree_store->sort_list = g_list_append (tree_store->sort_list, header);
2890 if (header->destroy)
2892 GtkDestroyNotify d = header->destroy;
2894 header->destroy = NULL;
2898 header->func = func;
2899 header->data = data;
2900 header->destroy = destroy;
2904 gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
2905 GtkTreeIterCompareFunc func,
2907 GtkDestroyNotify destroy)
2909 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2911 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2913 if (tree_store->default_sort_destroy)
2915 GtkDestroyNotify d = tree_store->default_sort_destroy;
2917 tree_store->default_sort_destroy = NULL;
2918 d (tree_store->default_sort_data);
2921 tree_store->default_sort_func = func;
2922 tree_store->default_sort_data = data;
2923 tree_store->default_sort_destroy = destroy;
2927 gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
2929 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2931 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2933 return (tree_store->default_sort_func != NULL);
2937 validate_gnode (GNode* node)
2941 iter = node->children;
2942 while (iter != NULL)
2944 g_assert (iter->parent == node);
2946 g_assert (iter->prev->next == iter);
2947 validate_gnode (iter);