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.
22 #include <gobject/gvaluecollector.h>
24 #include "gtktreemodel.h"
25 #include "gtktreestore.h"
26 #include "gtktreedatalist.h"
27 #include "gtktreednd.h"
29 #define G_NODE(node) ((GNode *)node)
30 #define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != -2)
31 #define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
33 static void gtk_tree_store_init (GtkTreeStore *tree_store);
34 static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
35 static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
36 static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
37 static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
38 static void gtk_tree_store_sortable_init (GtkTreeSortableIface *iface);
39 static void gtk_tree_store_finalize (GObject *object);
40 static GtkTreeModelFlags gtk_tree_store_get_flags (GtkTreeModel *tree_model);
41 static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
42 static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
44 static gboolean gtk_tree_store_get_iter (GtkTreeModel *tree_model,
47 static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
49 static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
53 static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
55 static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
58 static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
60 static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
62 static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
66 static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
71 static void gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
73 static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
79 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
81 static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
83 static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
85 GtkSelectionData *selection_data);
86 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
88 GtkSelectionData *selection_data);
89 static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
90 GtkTreePath *dest_path,
91 GtkSelectionData *selection_data);
93 /* Sortable Interfaces */
95 static void gtk_tree_store_sort (GtkTreeStore *tree_store);
96 static void gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
99 static gboolean gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
100 gint *sort_column_id,
102 static void gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
105 static void gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
107 GtkTreeIterCompareFunc func,
109 GtkDestroyNotify destroy);
110 static void gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
111 GtkTreeIterCompareFunc func,
113 GtkDestroyNotify destroy);
114 static gboolean gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable);
116 static void validate_gnode (GNode *node);
118 static void gtk_tree_store_move (GtkTreeStore *tree_store,
120 GtkTreeIter *position,
124 static GObjectClass *parent_class = NULL;
128 validate_tree (GtkTreeStore *tree_store)
130 if (gtk_debug_flags & GTK_DEBUG_TREE)
132 g_assert (G_NODE (tree_store->root)->parent == NULL);
134 validate_gnode (G_NODE (tree_store->root));
139 gtk_tree_store_get_type (void)
141 static GType tree_store_type = 0;
143 if (!tree_store_type)
145 static const GTypeInfo tree_store_info =
147 sizeof (GtkTreeStoreClass),
148 NULL, /* base_init */
149 NULL, /* base_finalize */
150 (GClassInitFunc) gtk_tree_store_class_init,
151 NULL, /* class_finalize */
152 NULL, /* class_data */
153 sizeof (GtkTreeStore),
155 (GInstanceInitFunc) gtk_tree_store_init
158 static const GInterfaceInfo tree_model_info =
160 (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
165 static const GInterfaceInfo drag_source_info =
167 (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
172 static const GInterfaceInfo drag_dest_info =
174 (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
179 static const GInterfaceInfo sortable_info =
181 (GInterfaceInitFunc) gtk_tree_store_sortable_init,
186 tree_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkTreeStore",
187 &tree_store_info, 0);
189 g_type_add_interface_static (tree_store_type,
192 g_type_add_interface_static (tree_store_type,
193 GTK_TYPE_TREE_DRAG_SOURCE,
195 g_type_add_interface_static (tree_store_type,
196 GTK_TYPE_TREE_DRAG_DEST,
198 g_type_add_interface_static (tree_store_type,
199 GTK_TYPE_TREE_SORTABLE,
204 return tree_store_type;
208 gtk_tree_store_class_init (GtkTreeStoreClass *class)
210 GObjectClass *object_class;
212 parent_class = g_type_class_peek_parent (class);
213 object_class = (GObjectClass *) class;
215 object_class->finalize = gtk_tree_store_finalize;
219 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
221 iface->get_flags = gtk_tree_store_get_flags;
222 iface->get_n_columns = gtk_tree_store_get_n_columns;
223 iface->get_column_type = gtk_tree_store_get_column_type;
224 iface->get_iter = gtk_tree_store_get_iter;
225 iface->get_path = gtk_tree_store_get_path;
226 iface->get_value = gtk_tree_store_get_value;
227 iface->iter_next = gtk_tree_store_iter_next;
228 iface->iter_children = gtk_tree_store_iter_children;
229 iface->iter_has_child = gtk_tree_store_iter_has_child;
230 iface->iter_n_children = gtk_tree_store_iter_n_children;
231 iface->iter_nth_child = gtk_tree_store_iter_nth_child;
232 iface->iter_parent = gtk_tree_store_iter_parent;
236 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
238 iface->row_draggable = real_gtk_tree_store_row_draggable;
239 iface->drag_data_delete = gtk_tree_store_drag_data_delete;
240 iface->drag_data_get = gtk_tree_store_drag_data_get;
244 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
246 iface->drag_data_received = gtk_tree_store_drag_data_received;
247 iface->row_drop_possible = gtk_tree_store_row_drop_possible;
251 gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
253 iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
254 iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
255 iface->set_sort_func = gtk_tree_store_set_sort_func;
256 iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
257 iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
261 gtk_tree_store_init (GtkTreeStore *tree_store)
263 tree_store->root = g_node_new (NULL);
264 /* While the odds are against us getting 0...
268 tree_store->stamp = g_random_int ();
270 while (tree_store->stamp == 0);
272 tree_store->sort_list = NULL;
273 tree_store->sort_column_id = -2;
274 tree_store->columns_dirty = FALSE;
278 * gtk_tree_store_new:
279 * @n_columns: number of columns in the tree store
280 * @Varargs: all #GType types for the columns, from first to last
282 * Creates a new tree store as with @n_columns columns each of the types passed
283 * in. Note that only types derived from standard GObject fundamental types
286 * As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
287 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
288 * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
290 * Return value: a new #GtkTreeStore
293 gtk_tree_store_new (gint n_columns,
296 GtkTreeStore *retval;
300 g_return_val_if_fail (n_columns > 0, NULL);
302 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
303 gtk_tree_store_set_n_columns (retval, n_columns);
305 va_start (args, n_columns);
307 for (i = 0; i < n_columns; i++)
309 GType type = va_arg (args, GType);
310 if (! _gtk_tree_data_list_check_type (type))
312 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
313 G_STRLOC, g_type_name (type));
314 g_object_unref (retval);
317 gtk_tree_store_set_column_type (retval, i, type);
324 * gtk_tree_store_newv:
325 * @n_columns: number of columns in the tree store
326 * @types: an array of #GType types for the columns, from first to last
328 * Non vararg creation function. Used primarily by language bindings.
330 * Return value: a new #GtkTreeStore
333 gtk_tree_store_newv (gint n_columns,
336 GtkTreeStore *retval;
339 g_return_val_if_fail (n_columns > 0, NULL);
341 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
342 gtk_tree_store_set_n_columns (retval, n_columns);
344 for (i = 0; i < n_columns; i++)
346 if (! _gtk_tree_data_list_check_type (types[i]))
348 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
349 G_STRLOC, g_type_name (types[i]));
350 g_object_unref (retval);
353 gtk_tree_store_set_column_type (retval, i, types[i]);
361 * gtk_tree_store_set_column_types:
362 * @tree_store: A #GtkTreeStore
363 * @n_columns: Number of columns for the tree store
364 * @types: An array of #GType types, one for each column
366 * This function is meant primarily for #GObjects that inherit from
367 * #GtkTreeStore, and should only be used when constructing a new
368 * #GtkTreeStore. It will not function after a row has been added,
369 * or a method on the #GtkTreeModel interface is called.
372 gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
378 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
379 g_return_if_fail (tree_store->columns_dirty == 0);
381 gtk_tree_store_set_n_columns (tree_store, n_columns);
382 for (i = 0; i < n_columns; i++)
384 if (! _gtk_tree_data_list_check_type (types[i]))
386 g_warning ("%s: Invalid type %s passed to gtk_tree_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
389 gtk_tree_store_set_column_type (tree_store, i, types[i]);
394 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
399 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
401 if (tree_store->n_columns == n_columns)
404 new_columns = g_new0 (GType, n_columns);
405 if (tree_store->column_headers)
407 /* copy the old header orders over */
408 if (n_columns >= tree_store->n_columns)
409 memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
411 memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
413 g_free (tree_store->column_headers);
416 if (tree_store->sort_list)
417 _gtk_tree_data_list_header_free (tree_store->sort_list);
419 tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
421 tree_store->column_headers = new_columns;
422 tree_store->n_columns = n_columns;
426 * gtk_tree_store_set_column_type:
427 * @tree_store: a #GtkTreeStore
428 * @column: column number
429 * @type: type of the data to be stored in @column
431 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
432 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
433 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
434 * subclasses of those types such as %GDK_TYPE_PIXBUF.
438 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
442 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
443 g_return_if_fail (column >=0 && column < tree_store->n_columns);
444 if (!_gtk_tree_data_list_check_type (type))
446 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
449 tree_store->column_headers[column] = type;
453 node_free (GNode *node, gpointer data)
456 _gtk_tree_data_list_free (node->data, (GType*)data);
463 gtk_tree_store_finalize (GObject *object)
465 GtkTreeStore *tree_store = GTK_TREE_STORE (object);
467 g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
468 node_free, tree_store->column_headers);
469 g_node_destroy (tree_store->root);
470 _gtk_tree_data_list_header_free (tree_store->sort_list);
471 g_free (tree_store->column_headers);
473 if (tree_store->default_sort_destroy)
475 GtkDestroyNotify d = tree_store->default_sort_destroy;
477 tree_store->default_sort_destroy = NULL;
478 d (tree_store->default_sort_data);
479 tree_store->default_sort_data = NULL;
483 (* parent_class->finalize) (object);
486 /* fulfill the GtkTreeModel requirements */
487 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
488 * it is not visible to the tree or to the user., and the path "0" refers to the
489 * first child of GtkTreeStore::root.
493 static GtkTreeModelFlags
494 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
496 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
498 return GTK_TREE_MODEL_ITERS_PERSIST;
502 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
504 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
506 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
508 tree_store->columns_dirty = TRUE;
510 return tree_store->n_columns;
514 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
517 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
519 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
520 g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
521 index >= 0, G_TYPE_INVALID);
523 tree_store->columns_dirty = TRUE;
525 return tree_store->column_headers[index];
529 gtk_tree_store_get_iter (GtkTreeModel *tree_model,
533 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
538 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
540 tree_store->columns_dirty = TRUE;
542 indices = gtk_tree_path_get_indices (path);
543 depth = gtk_tree_path_get_depth (path);
545 g_return_val_if_fail (depth > 0, FALSE);
547 parent.stamp = tree_store->stamp;
548 parent.user_data = tree_store->root;
550 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[0]))
553 for (i = 1; i < depth; i++)
556 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
564 gtk_tree_store_get_path (GtkTreeModel *tree_model,
571 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
572 g_return_val_if_fail (iter != NULL, NULL);
573 g_return_val_if_fail (iter->user_data != NULL, NULL);
574 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
576 validate_tree ((GtkTreeStore*)tree_model);
578 if (G_NODE (iter->user_data)->parent == NULL &&
579 G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
580 return gtk_tree_path_new ();
581 g_assert (G_NODE (iter->user_data)->parent != NULL);
583 if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
585 retval = gtk_tree_path_new ();
586 tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
590 GtkTreeIter tmp_iter = *iter;
592 tmp_iter.user_data = G_NODE (iter->user_data)->parent;
594 retval = gtk_tree_store_get_path (tree_model,
596 tmp_node = G_NODE (iter->user_data)->parent->children;
602 if (tmp_node == NULL)
604 gtk_tree_path_free (retval);
608 for (; tmp_node; tmp_node = tmp_node->next)
610 if (tmp_node == G_NODE (iter->user_data))
615 if (tmp_node == NULL)
617 /* We couldn't find node, meaning it's prolly not ours */
618 /* Perhaps I should do a g_return_if_fail here. */
619 gtk_tree_path_free (retval);
623 gtk_tree_path_append_index (retval, i);
630 gtk_tree_store_get_value (GtkTreeModel *tree_model,
635 GtkTreeDataList *list;
636 gint tmp_column = column;
638 g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
639 g_return_if_fail (iter != NULL);
640 g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
641 g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
643 list = G_NODE (iter->user_data)->data;
645 while (tmp_column-- > 0 && list)
650 _gtk_tree_data_list_node_to_value (list,
651 GTK_TREE_STORE (tree_model)->column_headers[column],
656 /* We want to return an initialized but empty (default) value */
657 g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
662 gtk_tree_store_iter_next (GtkTreeModel *tree_model,
665 g_return_val_if_fail (iter != NULL, FALSE);
666 g_return_val_if_fail (iter->user_data != NULL, FALSE);
667 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
669 if (G_NODE (iter->user_data)->next)
671 iter->user_data = G_NODE (iter->user_data)->next;
679 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
685 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
686 g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
689 children = G_NODE (parent->user_data)->children;
691 children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
695 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
696 iter->user_data = children;
704 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
707 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
708 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
709 g_return_val_if_fail (iter->user_data != NULL, FALSE);
711 return G_NODE (iter->user_data)->children != NULL;
715 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
721 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
722 g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
725 node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
727 node = G_NODE (iter->user_data)->children;
739 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
747 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
748 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
751 parent_node = GTK_TREE_STORE (tree_model)->root;
753 parent_node = parent->user_data;
755 child = g_node_nth_child (parent_node, n);
759 iter->user_data = child;
760 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
768 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
774 g_return_val_if_fail (iter != NULL, FALSE);
775 g_return_val_if_fail (child != NULL, FALSE);
776 g_return_val_if_fail (child->user_data != NULL, FALSE);
777 g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
779 parent = G_NODE (child->user_data)->parent;
781 g_assert (parent != NULL);
783 if (parent != GTK_TREE_STORE (tree_model)->root)
785 iter->user_data = parent;
786 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
794 /* Does not emit a signal */
796 gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
802 GtkTreeDataList *list;
803 GtkTreeDataList *prev;
804 gint old_column = column;
805 GValue real_value = {0, };
806 gboolean converted = FALSE;
807 gboolean retval = FALSE;
809 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
810 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
811 g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
812 g_return_val_if_fail (G_IS_VALUE (value), FALSE);
814 if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
816 if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
817 g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
819 g_warning ("%s: Unable to convert from %s to %s\n",
821 g_type_name (G_VALUE_TYPE (value)),
822 g_type_name (tree_store->column_headers[column]));
825 if (!g_value_transform (value, &real_value))
827 g_warning ("%s: Unable to make conversion from %s to %s\n",
829 g_type_name (G_VALUE_TYPE (value)),
830 g_type_name (tree_store->column_headers[column]));
831 g_value_unset (&real_value);
837 prev = list = G_NODE (iter->user_data)->data;
844 _gtk_tree_data_list_value_to_node (list, &real_value);
846 _gtk_tree_data_list_value_to_node (list, value);
849 g_value_unset (&real_value);
850 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
851 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
860 if (G_NODE (iter->user_data)->data == NULL)
862 G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
867 list = prev->next = _gtk_tree_data_list_alloc ();
873 list->next = _gtk_tree_data_list_alloc ();
880 _gtk_tree_data_list_value_to_node (list, &real_value);
882 _gtk_tree_data_list_value_to_node (list, value);
886 g_value_unset (&real_value);
888 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
889 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
895 * gtk_tree_store_set_value:
896 * @tree_store: a #GtkTreeStore
897 * @iter: A valid #GtkTreeIter for the row being modified
898 * @column: column number to modify
899 * @value: new value for the cell
901 * Sets the data in the cell specified by @iter and @column.
902 * The type of @value must be convertible to the type of the
907 gtk_tree_store_set_value (GtkTreeStore *tree_store,
912 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
913 g_return_if_fail (VALID_ITER (iter, tree_store));
914 g_return_if_fail (column >= 0 && column < tree_store->n_columns);
915 g_return_if_fail (G_IS_VALUE (value));
917 if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
921 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
922 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
923 gtk_tree_path_free (path);
928 * gtk_tree_store_set_valist:
929 * @tree_store: A #GtkTreeStore
930 * @iter: A valid #GtkTreeIter for the row being modified
931 * @var_args: <type>va_list</type> of column/value pairs
933 * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
934 * use by language bindings.
938 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
943 gboolean emit_signal = FALSE;
944 gboolean maybe_need_sort = FALSE;
945 GtkTreeIterCompareFunc func = NULL;
947 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
948 g_return_if_fail (VALID_ITER (iter, tree_store));
950 column = va_arg (var_args, gint);
952 if (GTK_TREE_STORE_IS_SORTED (tree_store))
954 if (tree_store->sort_column_id != -1)
956 GtkTreeDataSortHeader *header;
957 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
958 tree_store->sort_column_id);
959 g_return_if_fail (header != NULL);
960 g_return_if_fail (header->func != NULL);
965 func = tree_store->default_sort_func;
969 if (func != _gtk_tree_data_list_compare_func)
970 maybe_need_sort = TRUE;
974 GValue value = { 0, };
977 if (column >= tree_store->n_columns)
979 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
982 g_value_init (&value, tree_store->column_headers[column]);
984 G_VALUE_COLLECT (&value, var_args, 0, &error);
987 g_warning ("%s: %s", G_STRLOC, error);
990 /* we purposely leak the value here, it might not be
991 * in a sane state if an error condition occoured
996 emit_signal = gtk_tree_store_real_set_value (tree_store,
1000 FALSE) || emit_signal;
1002 if (func == _gtk_tree_data_list_compare_func &&
1003 column == tree_store->sort_column_id)
1004 maybe_need_sort = TRUE;
1006 g_value_unset (&value);
1008 column = va_arg (var_args, gint);
1011 if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1012 gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id);
1018 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
1019 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
1020 gtk_tree_path_free (path);
1025 * gtk_tree_store_set:
1026 * @tree_store: A #GtkTreeStore
1027 * @iter: A valid #GtkTreeIter for the row being modified
1028 * @Varargs: pairs of column number and value, terminated with -1
1030 * Sets the value of one or more cells in the row referenced by @iter.
1031 * The variable argument list should contain integer column numbers,
1032 * each column number followed by the value to be set.
1033 * The list is terminated by a -1. For example, to set column 0 with type
1034 * %G_TYPE_STRING to "Foo", you would write
1035 * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
1038 gtk_tree_store_set (GtkTreeStore *tree_store,
1044 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1045 g_return_if_fail (VALID_ITER (iter, tree_store));
1047 va_start (var_args, iter);
1048 gtk_tree_store_set_valist (tree_store, iter, var_args);
1053 * gtk_tree_store_remove:
1054 * @tree_store: A #GtkTreeStore
1055 * @iter: A valid #GtkTreeIter
1057 * Removes @iter from @tree_store. After being removed, @iter is set to the
1058 * next valid row at that level, or invalidated if it previously pointed to the
1061 * Return value: %TRUE if @iter is still valid, %FALSE if not.
1064 gtk_tree_store_remove (GtkTreeStore *tree_store,
1068 GtkTreeIter new_iter = {0,};
1072 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1073 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1075 parent = G_NODE (iter->user_data)->parent;
1077 g_assert (parent != NULL);
1078 next_node = G_NODE (iter->user_data)->next;
1080 if (G_NODE (iter->user_data)->data)
1081 g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1082 -1, node_free, tree_store->column_headers);
1084 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1085 g_node_destroy (G_NODE (iter->user_data));
1087 gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1089 if (parent != G_NODE (tree_store->root))
1092 if (parent->children == NULL)
1094 gtk_tree_path_up (path);
1096 new_iter.stamp = tree_store->stamp;
1097 new_iter.user_data = parent;
1098 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1101 gtk_tree_path_free (path);
1103 /* revalidate iter */
1104 if (next_node != NULL)
1106 iter->stamp = tree_store->stamp;
1107 iter->user_data = next_node;
1113 iter->user_data = NULL;
1120 * gtk_tree_store_insert:
1121 * @tree_store: A #GtkTreeStore
1122 * @iter: An unset #GtkTreeIter to set to the new row
1123 * @parent: A valid #GtkTreeIter, or %NULL
1124 * @position: position to insert the new row
1126 * Creates a new row at @position. If parent is non-%NULL, then the row will be
1127 * made a child of @parent. Otherwise, the row will be created at the toplevel.
1128 * If @position is larger than the number of rows at that level, then the new
1129 * row will be inserted to the end of the list. @iter will be changed to point
1130 * to this new row. The row will be empty after this function is called. To
1131 * fill in values, you need to call gtk_tree_store_set() or
1132 * gtk_tree_store_set_value().
1136 gtk_tree_store_insert (GtkTreeStore *tree_store,
1138 GtkTreeIter *parent,
1144 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1146 g_return_if_fail (VALID_ITER (parent, tree_store));
1149 parent_node = parent->user_data;
1151 parent_node = tree_store->root;
1153 tree_store->columns_dirty = TRUE;
1155 iter->stamp = tree_store->stamp;
1156 iter->user_data = g_node_new (NULL);
1157 g_node_insert (parent_node, position, G_NODE (iter->user_data));
1159 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1160 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1162 gtk_tree_path_free (path);
1164 validate_tree ((GtkTreeStore*)tree_store);
1168 * gtk_tree_store_insert_before:
1169 * @tree_store: A #GtkTreeStore
1170 * @iter: An unset #GtkTreeIter to set to the new row
1171 * @parent: A valid #GtkTreeIter, or %NULL
1172 * @sibling: A valid #GtkTreeIter, or %NULL
1174 * Inserts a new row before @sibling. If @sibling is %NULL, then the row will
1175 * be appended to @parent 's children. If @parent and @sibling are %NULL, then
1176 * the row will be appended to the toplevel. If both @sibling and @parent are
1177 * set, then @parent must be the parent of @sibling. When @sibling is set,
1178 * @parent is optional.
1180 * @iter will be changed to point to this new row. The row will be empty after
1181 * this function is called. To fill in values, you need to call
1182 * gtk_tree_store_set() or gtk_tree_store_set_value().
1186 gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1188 GtkTreeIter *parent,
1189 GtkTreeIter *sibling)
1192 GNode *parent_node = NULL;
1195 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1196 g_return_if_fail (iter != NULL);
1198 g_return_if_fail (VALID_ITER (parent, tree_store));
1199 if (sibling != NULL)
1200 g_return_if_fail (VALID_ITER (sibling, tree_store));
1202 tree_store->columns_dirty = TRUE;
1204 new_node = g_node_new (NULL);
1206 if (parent == NULL && sibling == NULL)
1207 parent_node = tree_store->root;
1208 else if (parent == NULL)
1209 parent_node = G_NODE (sibling->user_data)->parent;
1210 else if (sibling == NULL)
1211 parent_node = G_NODE (parent->user_data);
1214 g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1215 parent_node = G_NODE (parent->user_data);
1218 g_node_insert_before (parent_node,
1219 sibling ? G_NODE (sibling->user_data) : NULL,
1222 iter->stamp = tree_store->stamp;
1223 iter->user_data = new_node;
1225 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1226 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1228 gtk_tree_path_free (path);
1230 validate_tree ((GtkTreeStore*)tree_store);
1234 * gtk_tree_store_insert_after:
1235 * @tree_store: A #GtkTreeStore
1236 * @iter: An unset #GtkTreeIter to set to the new row
1237 * @parent: A valid #GtkTreeIter, or %NULL
1238 * @sibling: A valid #GtkTreeIter, or %NULL
1240 * Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1241 * prepended to @parent 's children. If @parent and @sibling are %NULL, then
1242 * the row will be prepended to the toplevel. If both @sibling and @parent are
1243 * set, then @parent must be the parent of @sibling. When @sibling is set,
1244 * @parent is optional.
1246 * @iter will be changed to point to this new row. The row will be empty after
1247 * this function is called. To fill in values, you need to call
1248 * gtk_tree_store_set() or gtk_tree_store_set_value().
1252 gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1254 GtkTreeIter *parent,
1255 GtkTreeIter *sibling)
1261 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1262 g_return_if_fail (iter != NULL);
1264 g_return_if_fail (VALID_ITER (parent, tree_store));
1265 if (sibling != NULL)
1266 g_return_if_fail (VALID_ITER (sibling, tree_store));
1268 tree_store->columns_dirty = TRUE;
1270 new_node = g_node_new (NULL);
1272 if (parent == NULL && sibling == NULL)
1273 parent_node = tree_store->root;
1274 else if (parent == NULL)
1275 parent_node = G_NODE (sibling->user_data)->parent;
1276 else if (sibling == NULL)
1277 parent_node = G_NODE (parent->user_data);
1280 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1281 G_NODE (parent->user_data));
1282 parent_node = G_NODE (parent->user_data);
1286 g_node_insert_after (parent_node,
1287 sibling ? G_NODE (sibling->user_data) : NULL,
1290 iter->stamp = tree_store->stamp;
1291 iter->user_data = new_node;
1293 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1294 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1296 gtk_tree_path_free (path);
1298 validate_tree ((GtkTreeStore*)tree_store);
1302 * gtk_tree_store_prepend:
1303 * @tree_store: A #GtkTreeStore
1304 * @iter: An unset #GtkTreeIter to set to the prepended row
1305 * @parent: A valid #GtkTreeIter, or %NULL
1307 * Prepends a new row to @tree_store. If @parent is non-%NULL, then it will prepend
1308 * the new row before the first child of @parent, otherwise it will prepend a row
1309 * to the top level. @iter will be changed to point to this new row. The row
1310 * will be empty after this function is called. To fill in values, you need to
1311 * call gtk_tree_store_set() or gtk_tree_store_set_value().
1314 gtk_tree_store_prepend (GtkTreeStore *tree_store,
1316 GtkTreeIter *parent)
1320 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1321 g_return_if_fail (iter != NULL);
1323 g_return_if_fail (VALID_ITER (parent, tree_store));
1325 tree_store->columns_dirty = TRUE;
1328 parent_node = tree_store->root;
1330 parent_node = parent->user_data;
1332 if (parent_node->children == NULL)
1336 iter->stamp = tree_store->stamp;
1337 iter->user_data = g_node_new (NULL);
1339 g_node_prepend (parent_node, G_NODE (iter->user_data));
1341 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1342 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1344 if (parent_node != tree_store->root)
1346 gtk_tree_path_up (path);
1347 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1349 gtk_tree_path_free (path);
1353 gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1356 validate_tree ((GtkTreeStore*)tree_store);
1360 * gtk_tree_store_append:
1361 * @tree_store: A #GtkTreeStore
1362 * @iter: An unset #GtkTreeIter to set to the appended row
1363 * @parent: A valid #GtkTreeIter, or %NULL
1365 * Appends a new row to @tree_store. If @parent is non-%NULL, then it will append the
1366 * new row after the last child of @parent, otherwise it will append a row to
1367 * the top level. @iter will be changed to point to this new row. The row will
1368 * be empty after this function is called. To fill in values, you need to call
1369 * gtk_tree_store_set() or gtk_tree_store_set_value().
1372 gtk_tree_store_append (GtkTreeStore *tree_store,
1374 GtkTreeIter *parent)
1378 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1379 g_return_if_fail (iter != NULL);
1382 g_return_if_fail (VALID_ITER (parent, tree_store));
1385 parent_node = tree_store->root;
1387 parent_node = parent->user_data;
1389 tree_store->columns_dirty = TRUE;
1391 if (parent_node->children == NULL)
1395 iter->stamp = tree_store->stamp;
1396 iter->user_data = g_node_new (NULL);
1398 g_node_append (parent_node, G_NODE (iter->user_data));
1400 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1401 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1403 if (parent_node != tree_store->root)
1405 gtk_tree_path_up (path);
1406 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1408 gtk_tree_path_free (path);
1412 gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1415 validate_tree ((GtkTreeStore*)tree_store);
1419 * gtk_tree_store_is_ancestor:
1420 * @tree_store: A #GtkTreeStore
1421 * @iter: A valid #GtkTreeIter
1422 * @descendant: A valid #GtkTreeIter
1424 * Returns %TRUE if @iter is an ancestor of @descendant. That is, @iter is the
1425 * parent (or grandparent or great-grandparent) of @descendant.
1427 * Return value: %TRUE, if @iter is an ancestor of @descendant
1430 gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1432 GtkTreeIter *descendant)
1434 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1435 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1436 g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1438 return g_node_is_ancestor (G_NODE (iter->user_data),
1439 G_NODE (descendant->user_data));
1444 * gtk_tree_store_iter_depth:
1445 * @tree_store: A #GtkTreeStore
1446 * @iter: A valid #GtkTreeIter
1448 * Returns the depth of @iter. This will be 0 for anything on the root level, 1
1449 * for anything down a level, etc.
1451 * Return value: The depth of @iter
1454 gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1457 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1458 g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1460 return g_node_depth (G_NODE (iter->user_data)) - 2;
1463 /* simple ripoff from g_node_traverse_post_order */
1465 gtk_tree_store_clear_traverse (GNode *node,
1466 GtkTreeStore *store)
1474 child = node->children;
1477 register GNode *current;
1480 child = current->next;
1481 if (gtk_tree_store_clear_traverse (current, store))
1487 iter.stamp = store->stamp;
1488 iter.user_data = node;
1490 gtk_tree_store_remove (store, &iter);
1493 else if (node->parent)
1495 iter.stamp = store->stamp;
1496 iter.user_data = node;
1498 gtk_tree_store_remove (store, &iter);
1505 * gtk_tree_store_clear:
1506 * @tree_store: a #GtkTreeStore
1508 * Removes all rows from @tree_store
1511 gtk_tree_store_clear (GtkTreeStore *tree_store)
1513 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1515 gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1519 gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1528 if (node == iter->user_data)
1532 if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1543 * gtk_tree_store_iter_is_valid:
1544 * @tree_store: A #GtkTreeStore.
1545 * @iter: A #GtkTreeIter.
1547 * WARNING: This function is slow. Only use it for debugging and/or testing
1550 * Checks if the given iter is a valid iter for this #GtkTreeStore.
1552 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1557 gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1560 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1561 g_return_val_if_fail (iter != NULL, FALSE);
1563 if (!VALID_ITER (iter, tree_store))
1566 return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1572 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
1579 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1584 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1586 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1590 gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1601 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1603 GtkSelectionData *selection_data)
1605 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1607 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1608 * target, because the default handler does it for us, but
1609 * we do anyway for the convenience of someone maybe overriding the
1613 if (gtk_tree_set_row_drag_data (selection_data,
1614 GTK_TREE_MODEL (drag_source),
1621 /* FIXME handle text targets at least. */
1628 copy_node_data (GtkTreeStore *tree_store,
1629 GtkTreeIter *src_iter,
1630 GtkTreeIter *dest_iter)
1632 GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1633 GtkTreeDataList *copy_head = NULL;
1634 GtkTreeDataList *copy_prev = NULL;
1635 GtkTreeDataList *copy_iter = NULL;
1642 copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1644 if (copy_head == NULL)
1645 copy_head = copy_iter;
1648 copy_prev->next = copy_iter;
1650 copy_prev = copy_iter;
1656 G_NODE (dest_iter->user_data)->data = copy_head;
1658 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1659 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1660 gtk_tree_path_free (path);
1664 recursive_node_copy (GtkTreeStore *tree_store,
1665 GtkTreeIter *src_iter,
1666 GtkTreeIter *dest_iter)
1669 GtkTreeModel *model;
1671 model = GTK_TREE_MODEL (tree_store);
1673 copy_node_data (tree_store, src_iter, dest_iter);
1675 if (gtk_tree_model_iter_children (model,
1679 /* Need to create children and recurse. Note our
1680 * dependence on persistent iterators here.
1686 /* Gee, a really slow algorithm... ;-) FIXME */
1687 gtk_tree_store_append (tree_store,
1691 recursive_node_copy (tree_store, &child, ©);
1693 while (gtk_tree_model_iter_next (model, &child));
1698 gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1700 GtkSelectionData *selection_data)
1702 GtkTreeModel *tree_model;
1703 GtkTreeStore *tree_store;
1704 GtkTreeModel *src_model = NULL;
1705 GtkTreePath *src_path = NULL;
1706 gboolean retval = FALSE;
1708 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1710 tree_model = GTK_TREE_MODEL (drag_dest);
1711 tree_store = GTK_TREE_STORE (drag_dest);
1713 validate_tree (tree_store);
1715 if (gtk_tree_get_row_drag_data (selection_data,
1718 src_model == tree_model)
1720 /* Copy the given row to a new position */
1721 GtkTreeIter src_iter;
1722 GtkTreeIter dest_iter;
1725 if (!gtk_tree_model_get_iter (src_model,
1732 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1733 prev = gtk_tree_path_copy (dest);
1735 if (!gtk_tree_path_prev (prev))
1737 GtkTreeIter dest_parent;
1738 GtkTreePath *parent;
1739 GtkTreeIter *dest_parent_p;
1741 /* dest was the first spot at the current depth; which means
1742 * we are supposed to prepend.
1745 /* Get the parent, NULL if parent is the root */
1746 dest_parent_p = NULL;
1747 parent = gtk_tree_path_copy (dest);
1748 if (gtk_tree_path_up (parent) &&
1749 gtk_tree_path_get_depth (parent) > 0)
1751 gtk_tree_model_get_iter (tree_model,
1754 dest_parent_p = &dest_parent;
1756 gtk_tree_path_free (parent);
1759 gtk_tree_store_prepend (tree_store,
1767 if (gtk_tree_model_get_iter (tree_model, &dest_iter, prev))
1769 GtkTreeIter tmp_iter = dest_iter;
1771 gtk_tree_store_insert_after (tree_store, &dest_iter, NULL,
1778 gtk_tree_path_free (prev);
1780 /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1781 * duplicating it below dest_iter.
1786 recursive_node_copy (tree_store,
1793 /* FIXME maybe add some data targets eventually, or handle text
1794 * targets in the simple case.
1802 gtk_tree_path_free (src_path);
1808 gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1809 GtkTreePath *dest_path,
1810 GtkSelectionData *selection_data)
1812 GtkTreeModel *src_model = NULL;
1813 GtkTreePath *src_path = NULL;
1814 GtkTreePath *tmp = NULL;
1815 gboolean retval = FALSE;
1817 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1819 /* don't accept drops if the tree has been sorted */
1820 if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1823 if (!gtk_tree_get_row_drag_data (selection_data,
1828 /* can only drag to ourselves */
1829 if (src_model != GTK_TREE_MODEL (drag_dest))
1832 /* Can't drop into ourself. */
1833 if (gtk_tree_path_is_ancestor (src_path,
1837 /* Can't drop if dest_path's parent doesn't exist */
1841 if (gtk_tree_path_get_depth (dest_path) > 1)
1843 tmp = gtk_tree_path_copy (dest_path);
1844 gtk_tree_path_up (tmp);
1846 if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1852 /* Can otherwise drop anywhere. */
1858 gtk_tree_path_free (src_path);
1860 gtk_tree_path_free (tmp);
1865 /* Sorting and reordering */
1866 typedef struct _SortTuple
1874 gtk_tree_store_reorder_func (gconstpointer a,
1878 SortTuple *a_reorder;
1879 SortTuple *b_reorder;
1881 a_reorder = (SortTuple *)a;
1882 b_reorder = (SortTuple *)b;
1884 if (a_reorder->offset < b_reorder->offset)
1886 if (a_reorder->offset > b_reorder->offset)
1893 * gtk_tree_store_reorder:
1894 * @tree_store: A #GtkTreeStore.
1895 * @parent: A #GtkTreeIter.
1896 * @new_order: an array of integers mapping the new position of each child
1897 * to its old position before the re-ordering,
1898 * i.e. @new_order<literal>[newpos] = oldpos</literal>.
1900 * Reorders the children of @parent in @tree_store to follow the order
1901 * indicated by @new_order. Note that this function only works with
1907 gtk_tree_store_reorder (GtkTreeStore *tree_store,
1908 GtkTreeIter *parent,
1912 GNode *level, *node;
1914 SortTuple *sort_array;
1916 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1917 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
1918 g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
1919 g_return_if_fail (new_order != NULL);
1922 level = G_NODE (tree_store->root)->children;
1924 level = G_NODE (parent->user_data)->children;
1934 /* set up sortarray */
1935 sort_array = g_new (SortTuple, length);
1938 for (i = 0; i < length; i++)
1940 sort_array[new_order[i]].offset = i;
1941 sort_array[i].node = node;
1946 g_qsort_with_data (sort_array,
1949 gtk_tree_store_reorder_func,
1953 for (i = 0; i < length - 1; i++)
1955 sort_array[i].node->next = sort_array[i+1].node;
1956 sort_array[i+1].node->prev = sort_array[i].node;
1959 sort_array[length-1].node->next = NULL;
1960 sort_array[0].node->prev = NULL;
1962 G_NODE (parent->user_data)->children = sort_array[0].node;
1964 G_NODE (tree_store->root)->children = sort_array[0].node;
1968 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), parent);
1970 path = gtk_tree_path_new ();
1971 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
1973 gtk_tree_path_free (path);
1974 g_free (sort_array);
1978 * gtk_tree_store_swap:
1979 * @tree_store: A #GtkTreeStore.
1980 * @a: A #GtkTreeIter.
1981 * @b: Another #GtkTreeIter.
1983 * Swaps @a and @b in the same level of @tree_store. Note that this function
1984 * only works with unsorted stores.
1989 gtk_tree_store_swap (GtkTreeStore *tree_store,
1993 GNode *tmp, *node_a, *node_b, *parent_node;
1994 GNode *a_prev, *a_next, *b_prev, *b_next;
1995 gint i, a_count, b_count, length, *order;
1996 GtkTreePath *path_a, *path_b;
1999 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2000 g_return_if_fail (VALID_ITER (a, tree_store));
2001 g_return_if_fail (VALID_ITER (b, tree_store));
2003 node_a = G_NODE (a->user_data);
2004 node_b = G_NODE (b->user_data);
2006 /* basic sanity checking */
2007 if (node_a == node_b)
2010 path_a = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), a);
2011 path_b = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), b);
2013 g_return_if_fail (path_a && path_b);
2015 gtk_tree_path_up (path_a);
2016 gtk_tree_path_up (path_b);
2018 if (gtk_tree_path_get_depth (path_a) == 0
2019 || gtk_tree_path_get_depth (path_b) == 0)
2021 if (gtk_tree_path_get_depth (path_a) != gtk_tree_path_get_depth (path_b))
2023 gtk_tree_path_free (path_a);
2024 gtk_tree_path_free (path_b);
2026 g_warning ("Given children are not in the same level\n");
2029 parent_node = G_NODE (tree_store->root);
2033 if (gtk_tree_path_compare (path_a, path_b))
2035 gtk_tree_path_free (path_a);
2036 gtk_tree_path_free (path_b);
2038 g_warning ("Given children don't have a common parent\n");
2041 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent,
2043 parent_node = G_NODE (parent.user_data);
2045 gtk_tree_path_free (path_b);
2047 /* old links which we have to keep around */
2048 a_prev = node_a->prev;
2049 a_next = node_a->next;
2051 b_prev = node_b->prev;
2052 b_next = node_b->next;
2054 /* fix up links if the nodes are next to eachother */
2055 if (a_prev == node_b)
2057 if (a_next == node_b)
2060 if (b_prev == node_a)
2062 if (b_next == node_a)
2065 /* counting nodes */
2066 tmp = parent_node->children;
2067 i = a_count = b_count = 0;
2080 /* hacking the tree */
2082 parent_node->children = node_b;
2084 a_prev->next = node_b;
2087 a_next->prev = node_b;
2090 parent_node->children = node_a;
2092 b_prev->next = node_a;
2095 b_next->prev = node_a;
2097 node_a->prev = b_prev;
2098 node_a->next = b_next;
2100 node_b->prev = a_prev;
2101 node_b->next = a_next;
2104 order = g_new (gint, length);
2105 for (i = 0; i < length; i++)
2108 else if (i == b_count)
2113 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2114 parent_node == tree_store->root
2115 ? NULL : &parent, order);
2116 gtk_tree_path_free (path_a);
2120 /* WARNING: this function is *incredibly* fragile. Please smashtest after
2121 * making changes here.
2125 gtk_tree_store_move (GtkTreeStore *tree_store,
2127 GtkTreeIter *position,
2130 GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2131 gint old_pos, new_pos, length, i, *order;
2132 GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2133 GtkTreeIter parent_iter, dst_a, dst_b;
2135 gboolean handle_b = TRUE;
2137 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2138 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2139 g_return_if_fail (VALID_ITER (iter, tree_store));
2141 g_return_if_fail (VALID_ITER (position, tree_store));
2148 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2149 pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store),
2153 * moving the iter before path or "path + 1" doesn't make sense
2155 * moving the iter before path or "path - 1" doesn't make sense
2157 if (!gtk_tree_path_compare (path, pos_path))
2158 goto free_paths_and_out;
2161 gtk_tree_path_next (path);
2163 gtk_tree_path_prev (path);
2165 if (!gtk_tree_path_compare (path, pos_path))
2166 goto free_paths_and_out;
2169 gtk_tree_path_prev (path);
2171 gtk_tree_path_next (path);
2173 if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2175 g_warning ("Given children are not in the same level\n");
2177 goto free_paths_and_out;
2180 tmppath = gtk_tree_path_copy (pos_path);
2181 gtk_tree_path_up (path);
2182 gtk_tree_path_up (tmppath);
2184 if (gtk_tree_path_get_depth (path) > 0 &&
2185 gtk_tree_path_compare (path, tmppath))
2187 g_warning ("Given children are not in the same level\n");
2189 gtk_tree_path_free (tmppath);
2190 goto free_paths_and_out;
2193 gtk_tree_path_free (tmppath);
2198 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2199 gtk_tree_path_up (path);
2202 depth = gtk_tree_path_get_depth (path);
2206 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent_iter, path);
2207 gtk_tree_path_free (path);
2209 parent = G_NODE (parent_iter.user_data);
2212 parent = G_NODE (tree_store->root);
2214 /* yes, I know that this can be done shorter, but I'm doing it this way
2215 * so the code is also maintainable
2218 if (before && position)
2220 b = G_NODE (position->user_data);
2222 if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2224 gtk_tree_path_prev (pos_path);
2225 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_a, pos_path))
2226 a = G_NODE (dst_a.user_data);
2229 gtk_tree_path_next (pos_path);
2232 /* if b is NULL, a is NULL too -- we are at the beginning of the list
2233 * yes and we leak memory here ...
2235 g_return_if_fail (b);
2237 else if (before && !position)
2239 /* move before without position is appending */
2246 a = G_NODE (position->user_data);
2252 gtk_tree_path_next (pos_path);
2253 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2254 b = G_NODE (dst_b.user_data);
2257 gtk_tree_path_prev (pos_path);
2261 /* move after without position is prepending */
2263 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2266 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2269 b = G_NODE (dst_b.user_data);
2272 /* if a is NULL, a is NULL too -- we are at the end of the list
2273 * yes and we leak memory here ...
2276 g_return_if_fail (a);
2279 /* counting nodes */
2280 tmp = parent->children;
2282 length = old_pos = 0;
2285 if (tmp == iter->user_data)
2292 /* remove node from list */
2293 node = G_NODE (iter->user_data);
2298 tmp_a->next = tmp_b;
2300 parent->children = tmp_b;
2303 tmp_b->prev = tmp_a;
2305 /* and reinsert the node */
2314 else if (!a && !before)
2316 tmp = parent->children;
2319 parent->children = node;
2327 else if (!a && before)
2331 node->parent = NULL;
2332 node->next = node->prev = NULL;
2334 /* before with sibling = NULL appends */
2335 g_node_insert_before (parent, NULL, node);
2339 node->parent = NULL;
2340 node->next = node->prev = NULL;
2342 /* after with sibling = NULL prepends */
2343 g_node_insert_after (parent, NULL, node);
2359 else if (!(!a && before)) /* !a && before is completely handled above */
2365 new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2369 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2372 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2378 if (new_pos > old_pos)
2380 if (before && position)
2385 if (!before && position)
2389 order = g_new (gint, length);
2390 if (new_pos > old_pos)
2392 for (i = 0; i < length; i++)
2395 else if (i >= old_pos && i < new_pos)
2397 else if (i == new_pos)
2404 for (i = 0; i < length; i++)
2407 else if (i > new_pos && i <= old_pos)
2415 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), &parent_iter);
2416 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2417 path, &parent_iter, order);
2421 path = gtk_tree_path_new ();
2422 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2426 gtk_tree_path_free (path);
2428 gtk_tree_path_free (pos_path);
2434 gtk_tree_path_free (path);
2435 gtk_tree_path_free (pos_path);
2439 * gtk_tree_store_move_before:
2440 * @tree_store: A #GtkTreeStore.
2441 * @iter: A #GtkTreeIter.
2442 * @position: A #GtkTreeIter or %NULL.
2444 * Moves @iter in @tree_store to the position before @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
2447 * moved to the end of the level.
2452 gtk_tree_store_move_before (GtkTreeStore *tree_store,
2454 GtkTreeIter *position)
2456 gtk_tree_store_move (tree_store, iter, position, TRUE);
2460 * gtk_tree_store_move_after:
2461 * @tree_store: A #GtkTreeStore.
2462 * @iter: A #GtkTreeIter.
2463 * @position: A #GtkTreeIter.
2465 * Moves @iter in @tree_store to the position after @position. @iter and
2466 * @position should be in the same level. Note that this function only
2467 * works with unsorted stores. If @position is %NULL, @iter will be moved
2468 * to the start of the level.
2473 gtk_tree_store_move_after (GtkTreeStore *tree_store,
2475 GtkTreeIter *position)
2477 gtk_tree_store_move (tree_store, iter, position, FALSE);
2482 gtk_tree_store_compare_func (gconstpointer a,
2486 GtkTreeStore *tree_store = user_data;
2489 GtkTreeIterCompareFunc func;
2496 if (tree_store->sort_column_id != -1)
2498 GtkTreeDataSortHeader *header;
2500 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2501 tree_store->sort_column_id);
2502 g_return_val_if_fail (header != NULL, 0);
2503 g_return_val_if_fail (header->func != NULL, 0);
2505 func = header->func;
2506 data = header->data;
2510 g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2511 func = tree_store->default_sort_func;
2512 data = tree_store->default_sort_data;
2515 node_a = ((SortTuple *) a)->node;
2516 node_b = ((SortTuple *) b)->node;
2518 iter_a.stamp = tree_store->stamp;
2519 iter_a.user_data = node_a;
2520 iter_b.stamp = tree_store->stamp;
2521 iter_b.user_data = node_b;
2523 retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2525 if (tree_store->order == GTK_SORT_DESCENDING)
2529 else if (retval < 0)
2536 gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2549 node = parent->children;
2550 if (node == NULL || node->next == NULL)
2552 if (recurse && node && node->children)
2553 gtk_tree_store_sort_helper (tree_store, node, TRUE);
2558 g_assert (GTK_TREE_STORE_IS_SORTED (tree_store));
2561 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2564 sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2567 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2572 tuple.node = tmp_node;
2573 g_array_append_val (sort_array, tuple);
2577 /* Sort the array */
2578 g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2580 for (i = 0; i < list_length - 1; i++)
2582 g_array_index (sort_array, SortTuple, i).node->next =
2583 g_array_index (sort_array, SortTuple, i + 1).node;
2584 g_array_index (sort_array, SortTuple, i + 1).node->prev =
2585 g_array_index (sort_array, SortTuple, i).node;
2587 g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2588 g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2589 parent->children = g_array_index (sort_array, SortTuple, 0).node;
2591 /* Let the world know about our new order */
2592 new_order = g_new (gint, list_length);
2593 for (i = 0; i < list_length; i++)
2594 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2596 iter.stamp = tree_store->stamp;
2597 iter.user_data = parent;
2598 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2599 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2600 path, &iter, new_order);
2601 gtk_tree_path_free (path);
2603 g_array_free (sort_array, TRUE);
2607 for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2609 if (tmp_node->children)
2610 gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2616 gtk_tree_store_sort (GtkTreeStore *tree_store)
2618 if (tree_store->sort_column_id != -1)
2620 GtkTreeDataSortHeader *header = NULL;
2622 header = _gtk_tree_data_list_get_header (tree_store->sort_list, tree_store->sort_column_id);
2624 /* We want to make sure that we have a function */
2625 g_return_if_fail (header != NULL);
2626 g_return_if_fail (header->func != NULL);
2630 g_return_if_fail (tree_store->default_sort_func != NULL);
2633 gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2637 gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2644 GtkTreePath *tmp_path;
2645 GtkTreeIter tmp_iter;
2653 GtkTreeIterCompareFunc func;
2656 g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2658 tmp_iter.stamp = tree_store->stamp;
2659 if (tree_store->sort_column_id != -1)
2661 GtkTreeDataSortHeader *header;
2662 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2663 tree_store->sort_column_id);
2664 g_return_if_fail (header != NULL);
2665 g_return_if_fail (header->func != NULL);
2666 func = header->func;
2667 data = header->data;
2671 g_return_if_fail (tree_store->default_sort_func != NULL);
2672 func = tree_store->default_sort_func;
2673 data = tree_store->default_sort_data;
2676 /* If it's the built in function, we don't sort. */
2677 if (func == _gtk_tree_data_list_compare_func &&
2678 tree_store->sort_column_id != column)
2682 node = G_NODE (iter->user_data)->parent->children;
2683 /* First we find the iter, its prev, and its next */
2686 if (node == G_NODE (iter->user_data))
2691 g_assert (node != NULL);
2696 /* Check the common case, where we don't need to sort it moved. */
2699 tmp_iter.user_data = prev;
2700 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2705 tmp_iter.user_data = next;
2706 cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2709 if (tree_store->order == GTK_SORT_DESCENDING)
2722 if (prev == NULL && cmp_b <= 0)
2724 else if (next == NULL && cmp_a <= 0)
2726 else if (prev != NULL && next != NULL &&
2727 cmp_a <= 0 && cmp_b <= 0)
2730 /* We actually need to sort it */
2731 /* First, remove the old link. */
2736 node->parent->children = next;
2744 /* FIXME: as an optimization, we can potentially start at next */
2746 node = node->parent->children;
2748 tmp_iter.user_data = node;
2749 if (tree_store->order == GTK_SORT_DESCENDING)
2750 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2752 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2754 while ((node->next) && (cmp_a > 0))
2759 tmp_iter.user_data = node;
2760 if (tree_store->order == GTK_SORT_DESCENDING)
2761 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2763 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2766 if ((!node->next) && (cmp_a > 0))
2769 node->next = G_NODE (iter->user_data);
2770 node->next->prev = node;
2774 prev->next = G_NODE (iter->user_data);
2775 prev->next->prev = prev;
2776 G_NODE (iter->user_data)->next = node;
2777 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2781 G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2782 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2783 G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2786 /* Emit the reordered signal. */
2787 length = g_node_n_children (node->parent);
2788 new_order = g_new (int, length);
2789 if (old_location < new_location)
2790 for (i = 0; i < length; i++)
2792 if (i < old_location ||
2795 else if (i >= old_location &&
2797 new_order[i] = i + 1;
2798 else if (i == new_location)
2799 new_order[i] = old_location;
2802 for (i = 0; i < length; i++)
2804 if (i < new_location ||
2807 else if (i > new_location &&
2809 new_order[i] = i - 1;
2810 else if (i == new_location)
2811 new_order[i] = old_location;
2814 tmp_iter.user_data = node->parent;
2815 tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2817 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2818 tmp_path, &tmp_iter,
2821 gtk_tree_path_free (tmp_path);
2827 gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
2828 gint *sort_column_id,
2831 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2833 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2835 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2839 * sort_column_id = tree_store->sort_column_id;
2841 * order = tree_store->order;
2847 gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
2848 gint sort_column_id,
2851 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2853 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2856 if ((tree_store->sort_column_id == sort_column_id) &&
2857 (tree_store->order == order))
2860 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2862 GtkTreeDataSortHeader *header = NULL;
2864 header = _gtk_tree_data_list_get_header (tree_store->sort_list, sort_column_id);
2866 /* We want to make sure that we have a function */
2867 g_return_if_fail (header != NULL);
2868 g_return_if_fail (header->func != NULL);
2872 g_return_if_fail (tree_store->default_sort_func != NULL);
2875 tree_store->sort_column_id = sort_column_id;
2876 tree_store->order = order;
2878 gtk_tree_sortable_sort_column_changed (sortable);
2880 gtk_tree_store_sort (tree_store);
2884 gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
2885 gint sort_column_id,
2886 GtkTreeIterCompareFunc func,
2888 GtkDestroyNotify destroy)
2890 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2891 GtkTreeDataSortHeader *header = NULL;
2894 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2895 g_return_if_fail (func != NULL);
2897 for (list = tree_store->sort_list; list; list = list->next)
2899 GtkTreeDataSortHeader *list_header;
2901 list_header = (GtkTreeDataSortHeader*) list->data;
2902 if (list_header->sort_column_id == sort_column_id)
2904 header = list_header;
2911 header = g_new0 (GtkTreeDataSortHeader, 1);
2912 header->sort_column_id = sort_column_id;
2913 tree_store->sort_list = g_list_append (tree_store->sort_list, header);
2916 if (header->destroy)
2918 GtkDestroyNotify d = header->destroy;
2920 header->destroy = NULL;
2924 header->func = func;
2925 header->data = data;
2926 header->destroy = destroy;
2928 if (tree_store->sort_column_id == sort_column_id)
2929 gtk_tree_store_sort (tree_store);
2933 gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
2934 GtkTreeIterCompareFunc func,
2936 GtkDestroyNotify destroy)
2938 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2940 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2942 if (tree_store->default_sort_destroy)
2944 GtkDestroyNotify d = tree_store->default_sort_destroy;
2946 tree_store->default_sort_destroy = NULL;
2947 d (tree_store->default_sort_data);
2950 tree_store->default_sort_func = func;
2951 tree_store->default_sort_data = data;
2952 tree_store->default_sort_destroy = destroy;
2954 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2955 gtk_tree_store_sort (tree_store);
2959 gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
2961 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2963 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2965 return (tree_store->default_sort_func != NULL);
2969 validate_gnode (GNode* node)
2973 iter = node->children;
2974 while (iter != NULL)
2976 g_assert (iter->parent == node);
2978 g_assert (iter->prev->next == iter);
2979 validate_gnode (iter);