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>
23 #include "gtktreemodel.h"
24 #include "gtktreestore.h"
25 #include "gtktreedatalist.h"
26 #include "gtktreednd.h"
28 #define G_NODE(node) ((GNode *)node)
29 #define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != -2)
30 #define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
32 static void gtk_tree_store_init (GtkTreeStore *tree_store);
33 static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
34 static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
35 static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
36 static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
37 static void gtk_tree_store_sortable_init (GtkTreeSortableIface *iface);
38 static void gtk_tree_store_finalize (GObject *object);
39 static GtkTreeModelFlags gtk_tree_store_get_flags (GtkTreeModel *tree_model);
40 static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
41 static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
43 static gboolean gtk_tree_store_get_iter (GtkTreeModel *tree_model,
46 static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
48 static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
52 static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
54 static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
57 static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
59 static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
61 static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
65 static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
70 static void gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
72 static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
78 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
80 static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
82 static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
84 GtkSelectionData *selection_data);
85 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
87 GtkSelectionData *selection_data);
88 static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
89 GtkTreePath *dest_path,
90 GtkSelectionData *selection_data);
92 /* Sortable Interfaces */
94 static void gtk_tree_store_sort (GtkTreeStore *tree_store);
95 static void gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
98 static gboolean gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
101 static void gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
104 static void gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
106 GtkTreeIterCompareFunc func,
108 GtkDestroyNotify destroy);
109 static void gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
110 GtkTreeIterCompareFunc func,
112 GtkDestroyNotify destroy);
113 static gboolean gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable);
115 static void validate_gnode (GNode *node);
117 static void gtk_tree_store_move (GtkTreeStore *tree_store,
119 GtkTreeIter *position,
123 static GObjectClass *parent_class = NULL;
127 validate_tree (GtkTreeStore *tree_store)
129 if (gtk_debug_flags & GTK_DEBUG_TREE)
131 g_assert (G_NODE (tree_store->root)->parent == NULL);
133 validate_gnode (G_NODE (tree_store->root));
138 gtk_tree_store_get_type (void)
140 static GType tree_store_type = 0;
142 if (!tree_store_type)
144 static const GTypeInfo tree_store_info =
146 sizeof (GtkTreeStoreClass),
147 NULL, /* base_init */
148 NULL, /* base_finalize */
149 (GClassInitFunc) gtk_tree_store_class_init,
150 NULL, /* class_finalize */
151 NULL, /* class_data */
152 sizeof (GtkTreeStore),
154 (GInstanceInitFunc) gtk_tree_store_init
157 static const GInterfaceInfo tree_model_info =
159 (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
164 static const GInterfaceInfo drag_source_info =
166 (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
171 static const GInterfaceInfo drag_dest_info =
173 (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
178 static const GInterfaceInfo sortable_info =
180 (GInterfaceInitFunc) gtk_tree_store_sortable_init,
185 tree_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkTreeStore",
186 &tree_store_info, 0);
188 g_type_add_interface_static (tree_store_type,
191 g_type_add_interface_static (tree_store_type,
192 GTK_TYPE_TREE_DRAG_SOURCE,
194 g_type_add_interface_static (tree_store_type,
195 GTK_TYPE_TREE_DRAG_DEST,
197 g_type_add_interface_static (tree_store_type,
198 GTK_TYPE_TREE_SORTABLE,
203 return tree_store_type;
207 gtk_tree_store_class_init (GtkTreeStoreClass *class)
209 GObjectClass *object_class;
211 parent_class = g_type_class_peek_parent (class);
212 object_class = (GObjectClass *) class;
214 object_class->finalize = gtk_tree_store_finalize;
218 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
220 iface->get_flags = gtk_tree_store_get_flags;
221 iface->get_n_columns = gtk_tree_store_get_n_columns;
222 iface->get_column_type = gtk_tree_store_get_column_type;
223 iface->get_iter = gtk_tree_store_get_iter;
224 iface->get_path = gtk_tree_store_get_path;
225 iface->get_value = gtk_tree_store_get_value;
226 iface->iter_next = gtk_tree_store_iter_next;
227 iface->iter_children = gtk_tree_store_iter_children;
228 iface->iter_has_child = gtk_tree_store_iter_has_child;
229 iface->iter_n_children = gtk_tree_store_iter_n_children;
230 iface->iter_nth_child = gtk_tree_store_iter_nth_child;
231 iface->iter_parent = gtk_tree_store_iter_parent;
235 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
237 iface->row_draggable = real_gtk_tree_store_row_draggable;
238 iface->drag_data_delete = gtk_tree_store_drag_data_delete;
239 iface->drag_data_get = gtk_tree_store_drag_data_get;
243 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
245 iface->drag_data_received = gtk_tree_store_drag_data_received;
246 iface->row_drop_possible = gtk_tree_store_row_drop_possible;
250 gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
252 iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
253 iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
254 iface->set_sort_func = gtk_tree_store_set_sort_func;
255 iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
256 iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
260 gtk_tree_store_init (GtkTreeStore *tree_store)
262 tree_store->root = g_node_new (NULL);
263 /* While the odds are against us getting 0...
267 tree_store->stamp = g_random_int ();
269 while (tree_store->stamp == 0);
271 tree_store->sort_list = NULL;
272 tree_store->sort_column_id = -2;
273 tree_store->columns_dirty = FALSE;
277 * gtk_tree_store_new:
278 * @n_columns: number of columns in the tree store
279 * @Varargs: all #GType types for the columns, from first to last
281 * Creates a new tree store as with @n_columns columns each of the types passed
282 * in. Note that only types derived from standard GObject fundamental types
285 * As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
286 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
287 * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
289 * Return value: a new #GtkTreeStore
292 gtk_tree_store_new (gint n_columns,
295 GtkTreeStore *retval;
299 g_return_val_if_fail (n_columns > 0, NULL);
301 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
302 gtk_tree_store_set_n_columns (retval, n_columns);
304 va_start (args, n_columns);
306 for (i = 0; i < n_columns; i++)
308 GType type = va_arg (args, GType);
309 if (! _gtk_tree_data_list_check_type (type))
311 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
312 G_STRLOC, g_type_name (type));
313 g_object_unref (retval);
316 gtk_tree_store_set_column_type (retval, i, type);
323 * gtk_tree_store_newv:
324 * @n_columns: number of columns in the tree store
325 * @types: an array of #GType types for the columns, from first to last
327 * Non vararg creation function. Used primarily by language bindings.
329 * Return value: a new #GtkTreeStore
332 gtk_tree_store_newv (gint n_columns,
335 GtkTreeStore *retval;
338 g_return_val_if_fail (n_columns > 0, NULL);
340 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
341 gtk_tree_store_set_n_columns (retval, n_columns);
343 for (i = 0; i < n_columns; i++)
345 if (! _gtk_tree_data_list_check_type (types[i]))
347 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
348 G_STRLOC, g_type_name (types[i]));
349 g_object_unref (retval);
352 gtk_tree_store_set_column_type (retval, i, types[i]);
360 * gtk_tree_store_set_column_types:
361 * @tree_store: A #GtkTreeStore
362 * @n_columns: Number of columns for the tree store
363 * @types: An array of #GType types, one for each column
365 * This function is meant primarily for #GObjects that inherit from
366 * #GtkTreeStore, and should only be used when constructing a new
367 * #GtkTreeStore. It will not function after a row has been added,
368 * or a method on the #GtkTreeModel interface is called.
371 gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
377 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
378 g_return_if_fail (tree_store->columns_dirty == 0);
380 gtk_tree_store_set_n_columns (tree_store, n_columns);
381 for (i = 0; i < n_columns; i++)
383 if (! _gtk_tree_data_list_check_type (types[i]))
385 g_warning ("%s: Invalid type %s passed to gtk_tree_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
388 gtk_tree_store_set_column_type (tree_store, i, types[i]);
393 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
398 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
400 if (tree_store->n_columns == n_columns)
403 new_columns = g_new0 (GType, n_columns);
404 if (tree_store->column_headers)
406 /* copy the old header orders over */
407 if (n_columns >= tree_store->n_columns)
408 memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
410 memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
412 g_free (tree_store->column_headers);
415 if (tree_store->sort_list)
416 _gtk_tree_data_list_header_free (tree_store->sort_list);
418 tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
420 tree_store->column_headers = new_columns;
421 tree_store->n_columns = n_columns;
425 * gtk_tree_store_set_column_type:
426 * @tree_store: a #GtkTreeStore
427 * @column: column number
428 * @type: type of the data to be stored in @column
430 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
431 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
432 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
433 * subclasses of those types such as %GDK_TYPE_PIXBUF.
437 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
441 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
442 g_return_if_fail (column >=0 && column < tree_store->n_columns);
443 if (!_gtk_tree_data_list_check_type (type))
445 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
448 tree_store->column_headers[column] = type;
452 node_free (GNode *node, gpointer data)
455 _gtk_tree_data_list_free (node->data, (GType*)data);
462 gtk_tree_store_finalize (GObject *object)
464 GtkTreeStore *tree_store = GTK_TREE_STORE (object);
466 g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
467 node_free, tree_store->column_headers);
468 g_node_destroy (tree_store->root);
469 _gtk_tree_data_list_header_free (tree_store->sort_list);
470 g_free (tree_store->column_headers);
472 if (tree_store->default_sort_destroy)
474 GtkDestroyNotify d = tree_store->default_sort_destroy;
476 tree_store->default_sort_destroy = NULL;
477 d (tree_store->default_sort_data);
478 tree_store->default_sort_data = NULL;
482 (* parent_class->finalize) (object);
485 /* fulfill the GtkTreeModel requirements */
486 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
487 * it is not visible to the tree or to the user., and the path "0" refers to the
488 * first child of GtkTreeStore::root.
492 static GtkTreeModelFlags
493 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
495 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
497 return GTK_TREE_MODEL_ITERS_PERSIST;
501 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
503 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
505 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
507 tree_store->columns_dirty = TRUE;
509 return tree_store->n_columns;
513 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
516 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
518 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
519 g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
520 index >= 0, G_TYPE_INVALID);
522 tree_store->columns_dirty = TRUE;
524 return tree_store->column_headers[index];
528 gtk_tree_store_get_iter (GtkTreeModel *tree_model,
532 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
537 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
539 tree_store->columns_dirty = TRUE;
541 indices = gtk_tree_path_get_indices (path);
542 depth = gtk_tree_path_get_depth (path);
544 g_return_val_if_fail (depth > 0, FALSE);
546 parent.stamp = tree_store->stamp;
547 parent.user_data = tree_store->root;
549 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[0]))
552 for (i = 1; i < depth; i++)
555 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
563 gtk_tree_store_get_path (GtkTreeModel *tree_model,
570 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
571 g_return_val_if_fail (iter != NULL, NULL);
572 g_return_val_if_fail (iter->user_data != NULL, NULL);
573 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
575 validate_tree ((GtkTreeStore*)tree_model);
577 if (G_NODE (iter->user_data)->parent == NULL &&
578 G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
579 return gtk_tree_path_new ();
580 g_assert (G_NODE (iter->user_data)->parent != NULL);
582 if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
584 retval = gtk_tree_path_new ();
585 tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
589 GtkTreeIter tmp_iter = *iter;
591 tmp_iter.user_data = G_NODE (iter->user_data)->parent;
593 retval = gtk_tree_store_get_path (tree_model,
595 tmp_node = G_NODE (iter->user_data)->parent->children;
601 if (tmp_node == NULL)
603 gtk_tree_path_free (retval);
607 for (; tmp_node; tmp_node = tmp_node->next)
609 if (tmp_node == G_NODE (iter->user_data))
614 if (tmp_node == NULL)
616 /* We couldn't find node, meaning it's prolly not ours */
617 /* Perhaps I should do a g_return_if_fail here. */
618 gtk_tree_path_free (retval);
622 gtk_tree_path_append_index (retval, i);
629 gtk_tree_store_get_value (GtkTreeModel *tree_model,
634 GtkTreeDataList *list;
635 gint tmp_column = column;
637 g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
638 g_return_if_fail (iter != NULL);
639 g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
640 g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
642 list = G_NODE (iter->user_data)->data;
644 while (tmp_column-- > 0 && list)
649 _gtk_tree_data_list_node_to_value (list,
650 GTK_TREE_STORE (tree_model)->column_headers[column],
655 /* We want to return an initialized but empty (default) value */
656 g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
661 gtk_tree_store_iter_next (GtkTreeModel *tree_model,
664 g_return_val_if_fail (iter != NULL, FALSE);
665 g_return_val_if_fail (iter->user_data != NULL, FALSE);
666 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
668 if (G_NODE (iter->user_data)->next)
670 iter->user_data = G_NODE (iter->user_data)->next;
678 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
684 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
685 g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
688 children = G_NODE (parent->user_data)->children;
690 children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
694 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
695 iter->user_data = children;
703 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
706 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
707 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
708 g_return_val_if_fail (iter->user_data != NULL, FALSE);
710 return G_NODE (iter->user_data)->children != NULL;
714 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
720 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
721 g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
724 node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
726 node = G_NODE (iter->user_data)->children;
738 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
746 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
747 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
750 parent_node = GTK_TREE_STORE (tree_model)->root;
752 parent_node = parent->user_data;
754 child = g_node_nth_child (parent_node, n);
758 iter->user_data = child;
759 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
767 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
773 g_return_val_if_fail (iter != NULL, FALSE);
774 g_return_val_if_fail (child != NULL, FALSE);
775 g_return_val_if_fail (child->user_data != NULL, FALSE);
776 g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
778 parent = G_NODE (child->user_data)->parent;
780 g_assert (parent != NULL);
782 if (parent != GTK_TREE_STORE (tree_model)->root)
784 iter->user_data = parent;
785 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
793 /* Does not emit a signal */
795 gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
801 GtkTreeDataList *list;
802 GtkTreeDataList *prev;
803 gint old_column = column;
804 GValue real_value = {0, };
805 gboolean converted = FALSE;
806 gboolean retval = FALSE;
808 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
809 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
810 g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
811 g_return_val_if_fail (G_IS_VALUE (value), FALSE);
813 if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
815 if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
816 g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
818 g_warning ("%s: Unable to convert from %s to %s\n",
820 g_type_name (G_VALUE_TYPE (value)),
821 g_type_name (tree_store->column_headers[column]));
824 if (!g_value_transform (value, &real_value))
826 g_warning ("%s: Unable to make conversion from %s to %s\n",
828 g_type_name (G_VALUE_TYPE (value)),
829 g_type_name (tree_store->column_headers[column]));
830 g_value_unset (&real_value);
836 prev = list = G_NODE (iter->user_data)->data;
843 _gtk_tree_data_list_value_to_node (list, &real_value);
845 _gtk_tree_data_list_value_to_node (list, value);
848 g_value_unset (&real_value);
849 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
850 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
859 if (G_NODE (iter->user_data)->data == NULL)
861 G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
866 list = prev->next = _gtk_tree_data_list_alloc ();
872 list->next = _gtk_tree_data_list_alloc ();
879 _gtk_tree_data_list_value_to_node (list, &real_value);
881 _gtk_tree_data_list_value_to_node (list, value);
885 g_value_unset (&real_value);
887 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
888 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
894 * gtk_tree_store_set_value:
895 * @tree_store: a #GtkTreeStore
896 * @iter: A valid #GtkTreeIter for the row being modified
897 * @column: column number to modify
898 * @value: new value for the cell
900 * Sets the data in the cell specified by @iter and @column.
901 * The type of @value must be convertible to the type of the
906 gtk_tree_store_set_value (GtkTreeStore *tree_store,
911 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
912 g_return_if_fail (VALID_ITER (iter, tree_store));
913 g_return_if_fail (column >= 0 && column < tree_store->n_columns);
914 g_return_if_fail (G_IS_VALUE (value));
916 if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
920 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
921 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
922 gtk_tree_path_free (path);
927 * gtk_tree_store_set_valist:
928 * @tree_store: A #GtkTreeStore
929 * @iter: A valid #GtkTreeIter for the row being modified
930 * @var_args: <type>va_list</type> of column/value pairs
932 * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
933 * use by language bindings.
937 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
942 gboolean emit_signal = FALSE;
943 gboolean maybe_need_sort = FALSE;
944 GtkTreeIterCompareFunc func = NULL;
946 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
947 g_return_if_fail (VALID_ITER (iter, tree_store));
949 column = va_arg (var_args, gint);
951 if (GTK_TREE_STORE_IS_SORTED (tree_store))
953 if (tree_store->sort_column_id != -1)
955 GtkTreeDataSortHeader *header;
956 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
957 tree_store->sort_column_id);
958 g_return_if_fail (header != NULL);
959 g_return_if_fail (header->func != NULL);
964 func = tree_store->default_sort_func;
968 if (func != gtk_tree_data_list_compare_func)
969 maybe_need_sort = TRUE;
973 GValue value = { 0, };
976 if (column >= tree_store->n_columns)
978 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
981 g_value_init (&value, tree_store->column_headers[column]);
983 G_VALUE_COLLECT (&value, var_args, 0, &error);
986 g_warning ("%s: %s", G_STRLOC, error);
989 /* we purposely leak the value here, it might not be
990 * in a sane state if an error condition occoured
995 emit_signal = gtk_tree_store_real_set_value (tree_store,
999 FALSE) || emit_signal;
1001 if (func == gtk_tree_data_list_compare_func &&
1002 column == tree_store->sort_column_id)
1003 maybe_need_sort = TRUE;
1005 g_value_unset (&value);
1007 column = va_arg (var_args, gint);
1010 if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1011 gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id);
1017 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
1018 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
1019 gtk_tree_path_free (path);
1024 * gtk_tree_store_set:
1025 * @tree_store: A #GtkTreeStore
1026 * @iter: A valid #GtkTreeIter for the row being modified
1027 * @Varargs: pairs of column number and value, terminated with -1
1029 * Sets the value of one or more cells in the row referenced by @iter.
1030 * The variable argument list should contain integer column numbers,
1031 * each column number followed by the value to be set.
1032 * The list is terminated by a -1. For example, to set column 0 with type
1033 * %G_TYPE_STRING to "Foo", you would write
1034 * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
1037 gtk_tree_store_set (GtkTreeStore *tree_store,
1043 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1044 g_return_if_fail (VALID_ITER (iter, tree_store));
1046 va_start (var_args, iter);
1047 gtk_tree_store_set_valist (tree_store, iter, var_args);
1052 * gtk_tree_store_remove:
1053 * @tree_store: A #GtkTreeStore
1054 * @iter: A valid #GtkTreeIter
1056 * Removes @iter from @tree_store. After being removed, @iter is set to the
1057 * next valid row at that level, or invalidated if it previously pointed to the
1060 * Return value: %TRUE if @iter is still valid, %FALSE if not.
1063 gtk_tree_store_remove (GtkTreeStore *tree_store,
1067 GtkTreeIter new_iter = {0,};
1071 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1072 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1074 parent = G_NODE (iter->user_data)->parent;
1076 g_assert (parent != NULL);
1077 next_node = G_NODE (iter->user_data)->next;
1079 if (G_NODE (iter->user_data)->data)
1080 g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1081 -1, node_free, tree_store->column_headers);
1083 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1084 g_node_destroy (G_NODE (iter->user_data));
1086 gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1088 if (parent != G_NODE (tree_store->root))
1091 if (parent->children == NULL)
1093 gtk_tree_path_up (path);
1095 new_iter.stamp = tree_store->stamp;
1096 new_iter.user_data = parent;
1097 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1100 gtk_tree_path_free (path);
1102 /* revalidate iter */
1103 if (next_node != NULL)
1105 iter->stamp = tree_store->stamp;
1106 iter->user_data = next_node;
1112 iter->user_data = NULL;
1119 * gtk_tree_store_insert:
1120 * @tree_store: A #GtkTreeStore
1121 * @iter: An unset #GtkTreeIter to set to the new row
1122 * @parent: A valid #GtkTreeIter, or %NULL
1123 * @position: position to insert the new row
1125 * Creates a new row at @position. If parent is non-%NULL, then the row will be
1126 * made a child of @parent. Otherwise, the row will be created at the toplevel.
1127 * If @position is larger than the number of rows at that level, then the new
1128 * row will be inserted to the end of the list. @iter will be changed to point
1129 * to this new row. The row will be empty after this function is called. To
1130 * fill in values, you need to call gtk_tree_store_set() or
1131 * gtk_tree_store_set_value().
1135 gtk_tree_store_insert (GtkTreeStore *tree_store,
1137 GtkTreeIter *parent,
1143 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1145 g_return_if_fail (VALID_ITER (parent, tree_store));
1148 parent_node = parent->user_data;
1150 parent_node = tree_store->root;
1152 tree_store->columns_dirty = TRUE;
1154 iter->stamp = tree_store->stamp;
1155 iter->user_data = g_node_new (NULL);
1156 g_node_insert (parent_node, position, G_NODE (iter->user_data));
1158 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1159 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1161 gtk_tree_path_free (path);
1163 validate_tree ((GtkTreeStore*)tree_store);
1167 * gtk_tree_store_insert_before:
1168 * @tree_store: A #GtkTreeStore
1169 * @iter: An unset #GtkTreeIter to set to the new row
1170 * @parent: A valid #GtkTreeIter, or %NULL
1171 * @sibling: A valid #GtkTreeIter, or %NULL
1173 * Inserts a new row before @sibling. If @sibling is %NULL, then the row will
1174 * be appended to @parent 's children. If @parent and @sibling are %NULL, then
1175 * the row will be appended to the toplevel. If both @sibling and @parent are
1176 * set, then @parent must be the parent of @sibling. When @sibling is set,
1177 * @parent is optional.
1179 * @iter will be changed to point to this new row. The row will be empty after
1180 * this function is called. To fill in values, you need to call
1181 * gtk_tree_store_set() or gtk_tree_store_set_value().
1185 gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1187 GtkTreeIter *parent,
1188 GtkTreeIter *sibling)
1191 GNode *parent_node = NULL;
1194 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1195 g_return_if_fail (iter != NULL);
1197 g_return_if_fail (VALID_ITER (parent, tree_store));
1198 if (sibling != NULL)
1199 g_return_if_fail (VALID_ITER (sibling, tree_store));
1201 tree_store->columns_dirty = TRUE;
1203 new_node = g_node_new (NULL);
1205 if (parent == NULL && sibling == NULL)
1206 parent_node = tree_store->root;
1207 else if (parent == NULL)
1208 parent_node = G_NODE (sibling->user_data)->parent;
1209 else if (sibling == NULL)
1210 parent_node = G_NODE (parent->user_data);
1213 g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1214 parent_node = G_NODE (parent->user_data);
1217 g_node_insert_before (parent_node,
1218 sibling ? G_NODE (sibling->user_data) : NULL,
1221 iter->stamp = tree_store->stamp;
1222 iter->user_data = new_node;
1224 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1225 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1227 gtk_tree_path_free (path);
1229 validate_tree ((GtkTreeStore*)tree_store);
1233 * gtk_tree_store_insert_after:
1234 * @tree_store: A #GtkTreeStore
1235 * @iter: An unset #GtkTreeIter to set to the new row
1236 * @parent: A valid #GtkTreeIter, or %NULL
1237 * @sibling: A valid #GtkTreeIter, or %NULL
1239 * Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1240 * prepended to @parent 's children. If @parent and @sibling are %NULL, then
1241 * the row will be prepended to the toplevel. If both @sibling and @parent are
1242 * set, then @parent must be the parent of @sibling. When @sibling is set,
1243 * @parent is optional.
1245 * @iter will be changed to point to this new row. The row will be empty after
1246 * this function is called. To fill in values, you need to call
1247 * gtk_tree_store_set() or gtk_tree_store_set_value().
1251 gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1253 GtkTreeIter *parent,
1254 GtkTreeIter *sibling)
1260 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1261 g_return_if_fail (iter != NULL);
1263 g_return_if_fail (VALID_ITER (parent, tree_store));
1264 if (sibling != NULL)
1265 g_return_if_fail (VALID_ITER (sibling, tree_store));
1267 tree_store->columns_dirty = TRUE;
1269 new_node = g_node_new (NULL);
1271 if (parent == NULL && sibling == NULL)
1272 parent_node = tree_store->root;
1273 else if (parent == NULL)
1274 parent_node = G_NODE (sibling->user_data)->parent;
1275 else if (sibling == NULL)
1276 parent_node = G_NODE (parent->user_data);
1279 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1280 G_NODE (parent->user_data));
1281 parent_node = G_NODE (parent->user_data);
1285 g_node_insert_after (parent_node,
1286 sibling ? G_NODE (sibling->user_data) : NULL,
1289 iter->stamp = tree_store->stamp;
1290 iter->user_data = new_node;
1292 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1293 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1295 gtk_tree_path_free (path);
1297 validate_tree ((GtkTreeStore*)tree_store);
1301 * gtk_tree_store_prepend:
1302 * @tree_store: A #GtkTreeStore
1303 * @iter: An unset #GtkTreeIter to set to the prepended row
1304 * @parent: A valid #GtkTreeIter, or %NULL
1306 * Prepends a new row to @tree_store. If @parent is non-%NULL, then it will prepend
1307 * the new row before the first child of @parent, otherwise it will prepend a row
1308 * to the top level. @iter will be changed to point to this new row. The row
1309 * will be empty after this function is called. To fill in values, you need to
1310 * call gtk_tree_store_set() or gtk_tree_store_set_value().
1313 gtk_tree_store_prepend (GtkTreeStore *tree_store,
1315 GtkTreeIter *parent)
1319 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1320 g_return_if_fail (iter != NULL);
1322 g_return_if_fail (VALID_ITER (parent, tree_store));
1324 tree_store->columns_dirty = TRUE;
1327 parent_node = tree_store->root;
1329 parent_node = parent->user_data;
1331 if (parent_node->children == NULL)
1335 iter->stamp = tree_store->stamp;
1336 iter->user_data = g_node_new (NULL);
1338 g_node_prepend (parent_node, G_NODE (iter->user_data));
1340 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1341 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1343 if (parent_node != tree_store->root)
1345 gtk_tree_path_up (path);
1346 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1348 gtk_tree_path_free (path);
1352 gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1355 validate_tree ((GtkTreeStore*)tree_store);
1359 * gtk_tree_store_append:
1360 * @tree_store: A #GtkTreeStore
1361 * @iter: An unset #GtkTreeIter to set to the appended row
1362 * @parent: A valid #GtkTreeIter, or %NULL
1364 * Appends a new row to @tree_store. If @parent is non-%NULL, then it will append the
1365 * new row after the last child of @parent, otherwise it will append a row to
1366 * the top level. @iter will be changed to point to this new row. The row will
1367 * be empty after this function is called. To fill in values, you need to call
1368 * gtk_tree_store_set() or gtk_tree_store_set_value().
1371 gtk_tree_store_append (GtkTreeStore *tree_store,
1373 GtkTreeIter *parent)
1377 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1378 g_return_if_fail (iter != NULL);
1381 g_return_if_fail (VALID_ITER (parent, tree_store));
1384 parent_node = tree_store->root;
1386 parent_node = parent->user_data;
1388 tree_store->columns_dirty = TRUE;
1390 if (parent_node->children == NULL)
1394 iter->stamp = tree_store->stamp;
1395 iter->user_data = g_node_new (NULL);
1397 g_node_append (parent_node, G_NODE (iter->user_data));
1399 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1400 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1402 if (parent_node != tree_store->root)
1404 gtk_tree_path_up (path);
1405 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1407 gtk_tree_path_free (path);
1411 gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1414 validate_tree ((GtkTreeStore*)tree_store);
1418 * gtk_tree_store_is_ancestor:
1419 * @tree_store: A #GtkTreeStore
1420 * @iter: A valid #GtkTreeIter
1421 * @descendant: A valid #GtkTreeIter
1423 * Returns %TRUE if @iter is an ancestor of @descendant. That is, @iter is the
1424 * parent (or grandparent or great-grandparent) of @descendant.
1426 * Return value: %TRUE, if @iter is an ancestor of @descendant
1429 gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1431 GtkTreeIter *descendant)
1433 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1434 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1435 g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1437 return g_node_is_ancestor (G_NODE (iter->user_data),
1438 G_NODE (descendant->user_data));
1443 * gtk_tree_store_iter_depth:
1444 * @tree_store: A #GtkTreeStore
1445 * @iter: A valid #GtkTreeIter
1447 * Returns the depth of @iter. This will be 0 for anything on the root level, 1
1448 * for anything down a level, etc.
1450 * Return value: The depth of @iter
1453 gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1456 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1457 g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1459 return g_node_depth (G_NODE (iter->user_data)) - 2;
1462 /* simple ripoff from g_node_traverse_post_order */
1464 gtk_tree_store_clear_traverse (GNode *node,
1465 GtkTreeStore *store)
1473 child = node->children;
1476 register GNode *current;
1479 child = current->next;
1480 if (gtk_tree_store_clear_traverse (current, store))
1486 iter.stamp = store->stamp;
1487 iter.user_data = node;
1489 gtk_tree_store_remove (store, &iter);
1492 else if (node->parent)
1494 iter.stamp = store->stamp;
1495 iter.user_data = node;
1497 gtk_tree_store_remove (store, &iter);
1504 * gtk_tree_store_clear:
1505 * @tree_store: a #GtkTreeStore
1507 * Removes all rows from @tree_store
1510 gtk_tree_store_clear (GtkTreeStore *tree_store)
1512 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1514 gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1518 gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1527 if (node == iter->user_data)
1531 if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1542 * gtk_tree_store_iter_is_valid:
1543 * @tree_store: A #GtkTreeStore.
1544 * @iter: A #GtkTreeIter.
1546 * WARNING: This function is slow. Only use it for debugging and/or testing
1549 * Checks if the given iter is a valid iter for this #GtkTreeStore.
1551 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1556 gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1559 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1560 g_return_val_if_fail (iter != NULL, FALSE);
1562 if (!VALID_ITER (iter, tree_store))
1565 return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1571 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
1578 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1583 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1585 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1589 gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1600 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1602 GtkSelectionData *selection_data)
1604 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1606 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1607 * target, because the default handler does it for us, but
1608 * we do anyway for the convenience of someone maybe overriding the
1612 if (gtk_tree_set_row_drag_data (selection_data,
1613 GTK_TREE_MODEL (drag_source),
1620 /* FIXME handle text targets at least. */
1627 copy_node_data (GtkTreeStore *tree_store,
1628 GtkTreeIter *src_iter,
1629 GtkTreeIter *dest_iter)
1631 GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1632 GtkTreeDataList *copy_head = NULL;
1633 GtkTreeDataList *copy_prev = NULL;
1634 GtkTreeDataList *copy_iter = NULL;
1641 copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1643 if (copy_head == NULL)
1644 copy_head = copy_iter;
1647 copy_prev->next = copy_iter;
1649 copy_prev = copy_iter;
1655 G_NODE (dest_iter->user_data)->data = copy_head;
1657 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1658 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1659 gtk_tree_path_free (path);
1663 recursive_node_copy (GtkTreeStore *tree_store,
1664 GtkTreeIter *src_iter,
1665 GtkTreeIter *dest_iter)
1668 GtkTreeModel *model;
1670 model = GTK_TREE_MODEL (tree_store);
1672 copy_node_data (tree_store, src_iter, dest_iter);
1674 if (gtk_tree_model_iter_children (model,
1678 /* Need to create children and recurse. Note our
1679 * dependence on persistent iterators here.
1685 /* Gee, a really slow algorithm... ;-) FIXME */
1686 gtk_tree_store_append (tree_store,
1690 recursive_node_copy (tree_store, &child, ©);
1692 while (gtk_tree_model_iter_next (model, &child));
1697 gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1699 GtkSelectionData *selection_data)
1701 GtkTreeModel *tree_model;
1702 GtkTreeStore *tree_store;
1703 GtkTreeModel *src_model = NULL;
1704 GtkTreePath *src_path = NULL;
1705 gboolean retval = FALSE;
1707 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1709 tree_model = GTK_TREE_MODEL (drag_dest);
1710 tree_store = GTK_TREE_STORE (drag_dest);
1712 validate_tree (tree_store);
1714 if (gtk_tree_get_row_drag_data (selection_data,
1717 src_model == tree_model)
1719 /* Copy the given row to a new position */
1720 GtkTreeIter src_iter;
1721 GtkTreeIter dest_iter;
1724 if (!gtk_tree_model_get_iter (src_model,
1731 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1732 prev = gtk_tree_path_copy (dest);
1734 if (!gtk_tree_path_prev (prev))
1736 GtkTreeIter dest_parent;
1737 GtkTreePath *parent;
1738 GtkTreeIter *dest_parent_p;
1740 /* dest was the first spot at the current depth; which means
1741 * we are supposed to prepend.
1744 /* Get the parent, NULL if parent is the root */
1745 dest_parent_p = NULL;
1746 parent = gtk_tree_path_copy (dest);
1747 if (gtk_tree_path_up (parent) &&
1748 gtk_tree_path_get_depth (parent) > 0)
1750 gtk_tree_model_get_iter (tree_model,
1753 dest_parent_p = &dest_parent;
1755 gtk_tree_path_free (parent);
1758 gtk_tree_store_prepend (tree_store,
1766 if (gtk_tree_model_get_iter (tree_model, &dest_iter, prev))
1768 GtkTreeIter tmp_iter = dest_iter;
1770 gtk_tree_store_insert_after (tree_store, &dest_iter, NULL,
1777 gtk_tree_path_free (prev);
1779 /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1780 * duplicating it below dest_iter.
1785 recursive_node_copy (tree_store,
1792 /* FIXME maybe add some data targets eventually, or handle text
1793 * targets in the simple case.
1801 gtk_tree_path_free (src_path);
1807 gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1808 GtkTreePath *dest_path,
1809 GtkSelectionData *selection_data)
1811 GtkTreeModel *src_model = NULL;
1812 GtkTreePath *src_path = NULL;
1813 GtkTreePath *tmp = NULL;
1814 gboolean retval = FALSE;
1816 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1818 /* don't accept drops if the tree has been sorted */
1819 if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1822 if (!gtk_tree_get_row_drag_data (selection_data,
1827 /* can only drag to ourselves */
1828 if (src_model != GTK_TREE_MODEL (drag_dest))
1831 /* Can't drop into ourself. */
1832 if (gtk_tree_path_is_ancestor (src_path,
1836 /* Can't drop if dest_path's parent doesn't exist */
1840 if (gtk_tree_path_get_depth (dest_path) > 1)
1842 tmp = gtk_tree_path_copy (dest_path);
1843 gtk_tree_path_up (tmp);
1845 if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1851 /* Can otherwise drop anywhere. */
1857 gtk_tree_path_free (src_path);
1859 gtk_tree_path_free (tmp);
1864 /* Sorting and reordering */
1865 typedef struct _SortTuple
1873 gtk_tree_store_reorder_func (gconstpointer a,
1877 SortTuple *a_reorder;
1878 SortTuple *b_reorder;
1880 a_reorder = (SortTuple *)a;
1881 b_reorder = (SortTuple *)b;
1883 if (a_reorder->offset < b_reorder->offset)
1885 if (a_reorder->offset > b_reorder->offset)
1892 * gtk_tree_store_reorder:
1893 * @tree_store: A #GtkTreeStore.
1894 * @parent: A #GtkTreeIter.
1895 * @new_order: an array of integers mapping the new position of each child
1896 * to its old position before the re-ordering,
1897 * i.e. @new_order<literal>[newpos] = oldpos</literal>.
1899 * Reorders the children of @parent in @tree_store to follow the order
1900 * indicated by @new_order. Note that this function only works with
1906 gtk_tree_store_reorder (GtkTreeStore *tree_store,
1907 GtkTreeIter *parent,
1911 GNode *level, *node;
1913 SortTuple *sort_array;
1915 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1916 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
1917 g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
1918 g_return_if_fail (new_order != NULL);
1921 level = G_NODE (tree_store->root)->children;
1923 level = G_NODE (parent->user_data)->children;
1933 /* set up sortarray */
1934 sort_array = g_new (SortTuple, length);
1937 for (i = 0; i < length; i++)
1939 sort_array[new_order[i]].offset = i;
1940 sort_array[i].node = node;
1945 g_qsort_with_data (sort_array,
1948 gtk_tree_store_reorder_func,
1952 for (i = 0; i < length - 1; i++)
1954 sort_array[i].node->next = sort_array[i+1].node;
1955 sort_array[i+1].node->prev = sort_array[i].node;
1958 sort_array[length-1].node->next = NULL;
1959 sort_array[0].node->prev = NULL;
1961 G_NODE (parent->user_data)->children = sort_array[0].node;
1963 G_NODE (tree_store->root)->children = sort_array[0].node;
1967 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), parent);
1969 path = gtk_tree_path_new ();
1970 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
1972 gtk_tree_path_free (path);
1973 g_free (sort_array);
1977 * gtk_tree_store_swap:
1978 * @tree_store: A #GtkTreeStore.
1979 * @a: A #GtkTreeIter.
1980 * @b: Another #GtkTreeIter.
1982 * Swaps @a and @b in the same level of @tree_store. Note that this function
1983 * only works with unsorted stores.
1988 gtk_tree_store_swap (GtkTreeStore *tree_store,
1992 GNode *tmp, *node_a, *node_b, *parent_node;
1993 GNode *a_prev, *a_next, *b_prev, *b_next;
1994 gint i, a_count, b_count, length, *order;
1995 GtkTreePath *path_a, *path_b;
1998 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1999 g_return_if_fail (VALID_ITER (a, tree_store));
2000 g_return_if_fail (VALID_ITER (b, tree_store));
2002 node_a = G_NODE (a->user_data);
2003 node_b = G_NODE (b->user_data);
2005 /* basic sanity checking */
2006 if (node_a == node_b)
2009 path_a = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), a);
2010 path_b = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), b);
2012 g_return_if_fail (path_a && path_b);
2014 gtk_tree_path_up (path_a);
2015 gtk_tree_path_up (path_b);
2017 if (gtk_tree_path_get_depth (path_a) == 0
2018 || gtk_tree_path_get_depth (path_b) == 0)
2020 if (gtk_tree_path_get_depth (path_a) != gtk_tree_path_get_depth (path_b))
2022 gtk_tree_path_free (path_a);
2023 gtk_tree_path_free (path_b);
2025 g_warning ("Given children are not in the same level\n");
2028 parent_node = G_NODE (tree_store->root);
2032 if (gtk_tree_path_compare (path_a, path_b))
2034 gtk_tree_path_free (path_a);
2035 gtk_tree_path_free (path_b);
2037 g_warning ("Given children don't have a common parent\n");
2040 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent,
2042 parent_node = G_NODE (parent.user_data);
2044 gtk_tree_path_free (path_b);
2046 /* old links which we have to keep around */
2047 a_prev = node_a->prev;
2048 a_next = node_a->next;
2050 b_prev = node_b->prev;
2051 b_next = node_b->next;
2053 /* fix up links if the nodes are next to eachother */
2054 if (a_prev == node_b)
2056 if (a_next == node_b)
2059 if (b_prev == node_a)
2061 if (b_next == node_a)
2064 /* counting nodes */
2065 tmp = parent_node->children;
2066 i = a_count = b_count = 0;
2079 /* hacking the tree */
2081 parent_node->children = node_b;
2083 a_prev->next = node_b;
2086 a_next->prev = node_b;
2089 parent_node->children = node_a;
2091 b_prev->next = node_a;
2094 b_next->prev = node_a;
2096 node_a->prev = b_prev;
2097 node_a->next = b_next;
2099 node_b->prev = a_prev;
2100 node_b->next = a_next;
2103 order = g_new (gint, length);
2104 for (i = 0; i < length; i++)
2107 else if (i == b_count)
2112 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2114 gtk_tree_path_free (path_a);
2118 /* WARNING: this function is *incredibly* fragile. Please smashtest after
2119 * making changes here.
2123 gtk_tree_store_move (GtkTreeStore *tree_store,
2125 GtkTreeIter *position,
2128 GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2129 gint old_pos, new_pos, length, i, *order;
2130 GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2131 GtkTreeIter parent_iter, dst_a, dst_b;
2133 gboolean handle_b = TRUE;
2135 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2136 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2137 g_return_if_fail (VALID_ITER (iter, tree_store));
2139 g_return_if_fail (VALID_ITER (position, tree_store));
2146 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2147 pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store),
2151 * moving the iter before path or "path + 1" doesn't make sense
2153 * moving the iter before path or "path - 1" doesn't make sense
2155 if (!gtk_tree_path_compare (path, pos_path))
2156 goto free_paths_and_out;
2159 gtk_tree_path_next (path);
2161 gtk_tree_path_prev (path);
2163 if (!gtk_tree_path_compare (path, pos_path))
2164 goto free_paths_and_out;
2167 gtk_tree_path_prev (path);
2169 gtk_tree_path_next (path);
2171 if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2173 g_warning ("Given children are not in the same level\n");
2175 goto free_paths_and_out;
2178 tmppath = gtk_tree_path_copy (pos_path);
2179 gtk_tree_path_up (path);
2180 gtk_tree_path_up (tmppath);
2182 if (gtk_tree_path_get_depth (path) > 0 &&
2183 gtk_tree_path_compare (path, tmppath))
2185 g_warning ("Given children are not in the same level\n");
2187 gtk_tree_path_free (tmppath);
2188 goto free_paths_and_out;
2191 gtk_tree_path_free (tmppath);
2196 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2197 gtk_tree_path_up (path);
2200 depth = gtk_tree_path_get_depth (path);
2204 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent_iter, path);
2205 gtk_tree_path_free (path);
2207 parent = G_NODE (parent_iter.user_data);
2210 parent = G_NODE (tree_store->root);
2212 /* yes, I know that this can be done shorter, but I'm doing it this way
2213 * so the code is also maintainable
2216 if (before && position)
2218 b = G_NODE (position->user_data);
2220 if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2222 gtk_tree_path_prev (pos_path);
2223 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_a, pos_path))
2224 a = G_NODE (dst_a.user_data);
2227 gtk_tree_path_next (pos_path);
2230 /* if b is NULL, a is NULL too -- we are at the beginning of the list
2231 * yes and we leak memory here ...
2233 g_return_if_fail (b);
2235 else if (before && !position)
2237 /* move before without position is appending */
2244 a = G_NODE (position->user_data);
2250 gtk_tree_path_next (pos_path);
2251 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2252 b = G_NODE (dst_b.user_data);
2255 gtk_tree_path_prev (pos_path);
2259 /* move after without position is prepending */
2261 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2264 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2267 b = G_NODE (dst_b.user_data);
2270 /* if a is NULL, a is NULL too -- we are at the end of the list
2271 * yes and we leak memory here ...
2274 g_return_if_fail (a);
2277 /* counting nodes */
2278 tmp = parent->children;
2280 length = old_pos = 0;
2283 if (tmp == iter->user_data)
2290 /* remove node from list */
2291 node = G_NODE (iter->user_data);
2296 tmp_a->next = tmp_b;
2298 parent->children = tmp_b;
2301 tmp_b->prev = tmp_a;
2303 /* and reinsert the node */
2312 else if (!a && !before)
2314 tmp = parent->children;
2317 parent->children = node;
2325 else if (!a && before)
2329 node->parent = NULL;
2330 node->next = node->prev = NULL;
2332 /* before with sibling = NULL appends */
2333 g_node_insert_before (parent, NULL, node);
2337 node->parent = NULL;
2338 node->next = node->prev = NULL;
2340 /* after with sibling = NULL prepends */
2341 g_node_insert_after (parent, NULL, node);
2357 else if (!(!a && before)) /* !a && before is completely handled above */
2363 new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2367 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2370 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2376 if (new_pos > old_pos)
2378 if (before && position)
2383 if (!before && position)
2387 order = g_new (gint, length);
2388 if (new_pos > old_pos)
2390 for (i = 0; i < length; i++)
2393 else if (i >= old_pos && i < new_pos)
2395 else if (i == new_pos)
2402 for (i = 0; i < length; i++)
2405 else if (i > new_pos && i <= old_pos)
2413 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), &parent_iter);
2414 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2415 path, &parent_iter, order);
2419 path = gtk_tree_path_new ();
2420 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2424 gtk_tree_path_free (path);
2426 gtk_tree_path_free (pos_path);
2432 gtk_tree_path_free (path);
2433 gtk_tree_path_free (pos_path);
2437 * gtk_tree_store_move_before:
2438 * @tree_store: A #GtkTreeStore.
2439 * @iter: A #GtkTreeIter.
2440 * @position: A #GtkTreeIter or %NULL.
2442 * Moves @iter in @tree_store to the position before @position. @iter and
2443 * @position should be in the same level. Note that this function only
2444 * works with unsorted stores. If @position is %NULL, @iter will be
2445 * moved to the end of the level.
2450 gtk_tree_store_move_before (GtkTreeStore *tree_store,
2452 GtkTreeIter *position)
2454 gtk_tree_store_move (tree_store, iter, position, TRUE);
2458 * gtk_tree_store_move_after:
2459 * @tree_store: A #GtkTreeStore.
2460 * @iter: A #GtkTreeIter.
2461 * @position: A #GtkTreeIter.
2463 * Moves @iter in @tree_store to the position after @position. @iter and
2464 * @position should be in the same level. Note that this function only
2465 * works with unsorted stores. If @position is %NULL, @iter will be moved
2466 * to the start of the level.
2471 gtk_tree_store_move_after (GtkTreeStore *tree_store,
2473 GtkTreeIter *position)
2475 gtk_tree_store_move (tree_store, iter, position, FALSE);
2480 gtk_tree_store_compare_func (gconstpointer a,
2484 GtkTreeStore *tree_store = user_data;
2487 GtkTreeIterCompareFunc func;
2494 if (tree_store->sort_column_id != -1)
2496 GtkTreeDataSortHeader *header;
2498 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2499 tree_store->sort_column_id);
2500 g_return_val_if_fail (header != NULL, 0);
2501 g_return_val_if_fail (header->func != NULL, 0);
2503 func = header->func;
2504 data = header->data;
2508 g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2509 func = tree_store->default_sort_func;
2510 data = tree_store->default_sort_data;
2513 node_a = ((SortTuple *) a)->node;
2514 node_b = ((SortTuple *) b)->node;
2516 iter_a.stamp = tree_store->stamp;
2517 iter_a.user_data = node_a;
2518 iter_b.stamp = tree_store->stamp;
2519 iter_b.user_data = node_b;
2521 retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2523 if (tree_store->order == GTK_SORT_DESCENDING)
2527 else if (retval < 0)
2534 gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2547 node = parent->children;
2548 if (node == NULL || node->next == NULL)
2550 if (recurse && node && node->children)
2551 gtk_tree_store_sort_helper (tree_store, node, TRUE);
2556 g_assert (GTK_TREE_STORE_IS_SORTED (tree_store));
2559 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2562 sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2565 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2570 tuple.node = tmp_node;
2571 g_array_append_val (sort_array, tuple);
2575 /* Sort the array */
2576 g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2578 for (i = 0; i < list_length - 1; i++)
2580 g_array_index (sort_array, SortTuple, i).node->next =
2581 g_array_index (sort_array, SortTuple, i + 1).node;
2582 g_array_index (sort_array, SortTuple, i + 1).node->prev =
2583 g_array_index (sort_array, SortTuple, i).node;
2585 g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2586 g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2587 parent->children = g_array_index (sort_array, SortTuple, 0).node;
2589 /* Let the world know about our new order */
2590 new_order = g_new (gint, list_length);
2591 for (i = 0; i < list_length; i++)
2592 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2594 iter.stamp = tree_store->stamp;
2595 iter.user_data = parent;
2596 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2597 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2598 path, &iter, new_order);
2599 gtk_tree_path_free (path);
2601 g_array_free (sort_array, TRUE);
2605 for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2607 if (tmp_node->children)
2608 gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2614 gtk_tree_store_sort (GtkTreeStore *tree_store)
2616 if (tree_store->sort_column_id != -1)
2618 GtkTreeDataSortHeader *header = NULL;
2620 header = _gtk_tree_data_list_get_header (tree_store->sort_list, tree_store->sort_column_id);
2622 /* We want to make sure that we have a function */
2623 g_return_if_fail (header != NULL);
2624 g_return_if_fail (header->func != NULL);
2628 g_return_if_fail (tree_store->default_sort_func != NULL);
2631 gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2635 gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2642 GtkTreePath *tmp_path;
2643 GtkTreeIter tmp_iter;
2651 GtkTreeIterCompareFunc func;
2654 g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2656 tmp_iter.stamp = tree_store->stamp;
2657 if (tree_store->sort_column_id != -1)
2659 GtkTreeDataSortHeader *header;
2660 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2661 tree_store->sort_column_id);
2662 g_return_if_fail (header != NULL);
2663 g_return_if_fail (header->func != NULL);
2664 func = header->func;
2665 data = header->data;
2669 g_return_if_fail (tree_store->default_sort_func != NULL);
2670 func = tree_store->default_sort_func;
2671 data = tree_store->default_sort_data;
2674 /* If it's the built in function, we don't sort. */
2675 if (func == gtk_tree_data_list_compare_func &&
2676 tree_store->sort_column_id != column)
2680 node = G_NODE (iter->user_data)->parent->children;
2681 /* First we find the iter, its prev, and its next */
2684 if (node == G_NODE (iter->user_data))
2689 g_assert (node != NULL);
2694 /* Check the common case, where we don't need to sort it moved. */
2697 tmp_iter.user_data = prev;
2698 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2703 tmp_iter.user_data = next;
2704 cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2707 if (tree_store->order == GTK_SORT_DESCENDING)
2720 if (prev == NULL && cmp_b <= 0)
2722 else if (next == NULL && cmp_a <= 0)
2724 else if (prev != NULL && next != NULL &&
2725 cmp_a <= 0 && cmp_b <= 0)
2728 /* We actually need to sort it */
2729 /* First, remove the old link. */
2734 node->parent->children = next;
2742 /* FIXME: as an optimization, we can potentially start at next */
2744 node = node->parent->children;
2746 tmp_iter.user_data = node;
2747 if (tree_store->order == GTK_SORT_DESCENDING)
2748 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2750 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2752 while ((node->next) && (cmp_a > 0))
2757 tmp_iter.user_data = node;
2758 if (tree_store->order == GTK_SORT_DESCENDING)
2759 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2761 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2764 if ((!node->next) && (cmp_a > 0))
2767 node->next = G_NODE (iter->user_data);
2768 node->next->prev = node;
2772 prev->next = G_NODE (iter->user_data);
2773 prev->next->prev = prev;
2774 G_NODE (iter->user_data)->next = node;
2775 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2779 G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2780 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2781 G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2784 /* Emit the reordered signal. */
2785 length = g_node_n_children (node->parent);
2786 new_order = g_new (int, length);
2787 if (old_location < new_location)
2788 for (i = 0; i < length; i++)
2790 if (i < old_location ||
2793 else if (i >= old_location &&
2795 new_order[i] = i + 1;
2796 else if (i == new_location)
2797 new_order[i] = old_location;
2800 for (i = 0; i < length; i++)
2802 if (i < new_location ||
2805 else if (i > new_location &&
2807 new_order[i] = i - 1;
2808 else if (i == new_location)
2809 new_order[i] = old_location;
2812 tmp_iter.user_data = node->parent;
2813 tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2815 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2816 tmp_path, &tmp_iter,
2819 gtk_tree_path_free (tmp_path);
2825 gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
2826 gint *sort_column_id,
2829 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2831 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2833 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2837 * sort_column_id = tree_store->sort_column_id;
2839 * order = tree_store->order;
2845 gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
2846 gint sort_column_id,
2849 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2851 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2854 if ((tree_store->sort_column_id == sort_column_id) &&
2855 (tree_store->order == order))
2858 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2860 GtkTreeDataSortHeader *header = NULL;
2862 header = _gtk_tree_data_list_get_header (tree_store->sort_list, sort_column_id);
2864 /* We want to make sure that we have a function */
2865 g_return_if_fail (header != NULL);
2866 g_return_if_fail (header->func != NULL);
2870 g_return_if_fail (tree_store->default_sort_func != NULL);
2873 tree_store->sort_column_id = sort_column_id;
2874 tree_store->order = order;
2876 gtk_tree_sortable_sort_column_changed (sortable);
2878 gtk_tree_store_sort (tree_store);
2882 gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
2883 gint sort_column_id,
2884 GtkTreeIterCompareFunc func,
2886 GtkDestroyNotify destroy)
2888 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2889 GtkTreeDataSortHeader *header = NULL;
2892 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2893 g_return_if_fail (func != NULL);
2895 for (list = tree_store->sort_list; list; list = list->next)
2897 GtkTreeDataSortHeader *list_header;
2899 list_header = (GtkTreeDataSortHeader*) list->data;
2900 if (list_header->sort_column_id == sort_column_id)
2902 header = list_header;
2909 header = g_new0 (GtkTreeDataSortHeader, 1);
2910 header->sort_column_id = sort_column_id;
2911 tree_store->sort_list = g_list_append (tree_store->sort_list, header);
2914 if (header->destroy)
2916 GtkDestroyNotify d = header->destroy;
2918 header->destroy = NULL;
2922 header->func = func;
2923 header->data = data;
2924 header->destroy = destroy;
2926 if (tree_store->sort_column_id == sort_column_id)
2927 gtk_tree_store_sort (tree_store);
2931 gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
2932 GtkTreeIterCompareFunc func,
2934 GtkDestroyNotify destroy)
2936 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2938 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2940 if (tree_store->default_sort_destroy)
2942 GtkDestroyNotify d = tree_store->default_sort_destroy;
2944 tree_store->default_sort_destroy = NULL;
2945 d (tree_store->default_sort_data);
2948 tree_store->default_sort_func = func;
2949 tree_store->default_sort_data = data;
2950 tree_store->default_sort_destroy = destroy;
2952 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2953 gtk_tree_store_sort (tree_store);
2957 gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
2959 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2961 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2963 return (tree_store->default_sort_func != NULL);
2967 validate_gnode (GNode* node)
2971 iter = node->children;
2972 while (iter != NULL)
2974 g_assert (iter->parent == node);
2976 g_assert (iter->prev->next == iter);
2977 validate_gnode (iter);