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"
30 #define G_NODE(node) ((GNode *)node)
31 #define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
32 #define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
34 static void gtk_tree_store_init (GtkTreeStore *tree_store);
35 static void gtk_tree_store_class_init (GtkTreeStoreClass *tree_store_class);
36 static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
37 static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
38 static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
39 static void gtk_tree_store_sortable_init (GtkTreeSortableIface *iface);
40 static void gtk_tree_store_finalize (GObject *object);
41 static GtkTreeModelFlags gtk_tree_store_get_flags (GtkTreeModel *tree_model);
42 static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
43 static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
45 static gboolean gtk_tree_store_get_iter (GtkTreeModel *tree_model,
48 static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
50 static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
54 static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
56 static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
59 static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
61 static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
63 static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
67 static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
72 static void gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
74 static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
78 static void gtk_tree_store_increment_stamp (GtkTreeStore *tree_store);
82 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
84 static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
86 static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
88 GtkSelectionData *selection_data);
89 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
91 GtkSelectionData *selection_data);
92 static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
93 GtkTreePath *dest_path,
94 GtkSelectionData *selection_data);
96 /* Sortable Interfaces */
98 static void gtk_tree_store_sort (GtkTreeStore *tree_store);
99 static void gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
102 static gboolean gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
103 gint *sort_column_id,
105 static void gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
108 static void gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
110 GtkTreeIterCompareFunc func,
112 GtkDestroyNotify destroy);
113 static void gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
114 GtkTreeIterCompareFunc func,
116 GtkDestroyNotify destroy);
117 static gboolean gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable);
119 static void validate_gnode (GNode *node);
121 static void gtk_tree_store_move (GtkTreeStore *tree_store,
123 GtkTreeIter *position,
127 static GObjectClass *parent_class = NULL;
131 validate_tree (GtkTreeStore *tree_store)
133 if (gtk_debug_flags & GTK_DEBUG_TREE)
135 g_assert (G_NODE (tree_store->root)->parent == NULL);
137 validate_gnode (G_NODE (tree_store->root));
142 gtk_tree_store_get_type (void)
144 static GType tree_store_type = 0;
146 if (!tree_store_type)
148 static const GTypeInfo tree_store_info =
150 sizeof (GtkTreeStoreClass),
151 NULL, /* base_init */
152 NULL, /* base_finalize */
153 (GClassInitFunc) gtk_tree_store_class_init,
154 NULL, /* class_finalize */
155 NULL, /* class_data */
156 sizeof (GtkTreeStore),
158 (GInstanceInitFunc) gtk_tree_store_init
161 static const GInterfaceInfo tree_model_info =
163 (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
168 static const GInterfaceInfo drag_source_info =
170 (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
175 static const GInterfaceInfo drag_dest_info =
177 (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
182 static const GInterfaceInfo sortable_info =
184 (GInterfaceInitFunc) gtk_tree_store_sortable_init,
189 tree_store_type = g_type_register_static (G_TYPE_OBJECT, I_("GtkTreeStore"),
190 &tree_store_info, 0);
192 g_type_add_interface_static (tree_store_type,
195 g_type_add_interface_static (tree_store_type,
196 GTK_TYPE_TREE_DRAG_SOURCE,
198 g_type_add_interface_static (tree_store_type,
199 GTK_TYPE_TREE_DRAG_DEST,
201 g_type_add_interface_static (tree_store_type,
202 GTK_TYPE_TREE_SORTABLE,
207 return tree_store_type;
211 gtk_tree_store_class_init (GtkTreeStoreClass *class)
213 GObjectClass *object_class;
215 parent_class = g_type_class_peek_parent (class);
216 object_class = (GObjectClass *) class;
218 object_class->finalize = gtk_tree_store_finalize;
222 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
224 iface->get_flags = gtk_tree_store_get_flags;
225 iface->get_n_columns = gtk_tree_store_get_n_columns;
226 iface->get_column_type = gtk_tree_store_get_column_type;
227 iface->get_iter = gtk_tree_store_get_iter;
228 iface->get_path = gtk_tree_store_get_path;
229 iface->get_value = gtk_tree_store_get_value;
230 iface->iter_next = gtk_tree_store_iter_next;
231 iface->iter_children = gtk_tree_store_iter_children;
232 iface->iter_has_child = gtk_tree_store_iter_has_child;
233 iface->iter_n_children = gtk_tree_store_iter_n_children;
234 iface->iter_nth_child = gtk_tree_store_iter_nth_child;
235 iface->iter_parent = gtk_tree_store_iter_parent;
239 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
241 iface->row_draggable = real_gtk_tree_store_row_draggable;
242 iface->drag_data_delete = gtk_tree_store_drag_data_delete;
243 iface->drag_data_get = gtk_tree_store_drag_data_get;
247 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
249 iface->drag_data_received = gtk_tree_store_drag_data_received;
250 iface->row_drop_possible = gtk_tree_store_row_drop_possible;
254 gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
256 iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
257 iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
258 iface->set_sort_func = gtk_tree_store_set_sort_func;
259 iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
260 iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
264 gtk_tree_store_init (GtkTreeStore *tree_store)
266 tree_store->root = g_node_new (NULL);
267 /* While the odds are against us getting 0...
271 tree_store->stamp = g_random_int ();
273 while (tree_store->stamp == 0);
275 tree_store->sort_list = NULL;
276 tree_store->sort_column_id = -2;
277 tree_store->columns_dirty = FALSE;
281 * gtk_tree_store_new:
282 * @n_columns: number of columns in the tree store
283 * @Varargs: all #GType types for the columns, from first to last
285 * Creates a new tree store as with @n_columns columns each of the types passed
286 * in. Note that only types derived from standard GObject fundamental types
289 * As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
290 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
291 * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
293 * Return value: a new #GtkTreeStore
296 gtk_tree_store_new (gint n_columns,
299 GtkTreeStore *retval;
303 g_return_val_if_fail (n_columns > 0, NULL);
305 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
306 gtk_tree_store_set_n_columns (retval, n_columns);
308 va_start (args, n_columns);
310 for (i = 0; i < n_columns; i++)
312 GType type = va_arg (args, GType);
313 if (! _gtk_tree_data_list_check_type (type))
315 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
316 G_STRLOC, g_type_name (type));
317 g_object_unref (retval);
320 gtk_tree_store_set_column_type (retval, i, type);
327 * gtk_tree_store_newv:
328 * @n_columns: number of columns in the tree store
329 * @types: an array of #GType types for the columns, from first to last
331 * Non vararg creation function. Used primarily by language bindings.
333 * Return value: a new #GtkTreeStore
336 gtk_tree_store_newv (gint n_columns,
339 GtkTreeStore *retval;
342 g_return_val_if_fail (n_columns > 0, NULL);
344 retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
345 gtk_tree_store_set_n_columns (retval, n_columns);
347 for (i = 0; i < n_columns; i++)
349 if (! _gtk_tree_data_list_check_type (types[i]))
351 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
352 G_STRLOC, g_type_name (types[i]));
353 g_object_unref (retval);
356 gtk_tree_store_set_column_type (retval, i, types[i]);
364 * gtk_tree_store_set_column_types:
365 * @tree_store: A #GtkTreeStore
366 * @n_columns: Number of columns for the tree store
367 * @types: An array of #GType types, one for each column
369 * This function is meant primarily for #GObjects that inherit from
370 * #GtkTreeStore, and should only be used when constructing a new
371 * #GtkTreeStore. It will not function after a row has been added,
372 * or a method on the #GtkTreeModel interface is called.
375 gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
381 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
382 g_return_if_fail (tree_store->columns_dirty == 0);
384 gtk_tree_store_set_n_columns (tree_store, n_columns);
385 for (i = 0; i < n_columns; i++)
387 if (! _gtk_tree_data_list_check_type (types[i]))
389 g_warning ("%s: Invalid type %s passed to gtk_tree_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
392 gtk_tree_store_set_column_type (tree_store, i, types[i]);
397 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
402 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
404 if (tree_store->n_columns == n_columns)
407 new_columns = g_new0 (GType, n_columns);
408 if (tree_store->column_headers)
410 /* copy the old header orders over */
411 if (n_columns >= tree_store->n_columns)
412 memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
414 memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
416 g_free (tree_store->column_headers);
419 if (tree_store->sort_list)
420 _gtk_tree_data_list_header_free (tree_store->sort_list);
422 tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
424 tree_store->column_headers = new_columns;
425 tree_store->n_columns = n_columns;
429 * gtk_tree_store_set_column_type:
430 * @tree_store: a #GtkTreeStore
431 * @column: column number
432 * @type: type of the data to be stored in @column
434 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
435 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
436 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
437 * subclasses of those types such as %GDK_TYPE_PIXBUF.
441 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
445 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
446 g_return_if_fail (column >=0 && column < tree_store->n_columns);
447 if (!_gtk_tree_data_list_check_type (type))
449 g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
452 tree_store->column_headers[column] = type;
456 node_free (GNode *node, gpointer data)
459 _gtk_tree_data_list_free (node->data, (GType*)data);
466 gtk_tree_store_finalize (GObject *object)
468 GtkTreeStore *tree_store = GTK_TREE_STORE (object);
470 g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
471 node_free, tree_store->column_headers);
472 g_node_destroy (tree_store->root);
473 _gtk_tree_data_list_header_free (tree_store->sort_list);
474 g_free (tree_store->column_headers);
476 if (tree_store->default_sort_destroy)
478 GtkDestroyNotify d = tree_store->default_sort_destroy;
480 tree_store->default_sort_destroy = NULL;
481 d (tree_store->default_sort_data);
482 tree_store->default_sort_data = NULL;
486 (* parent_class->finalize) (object);
489 /* fulfill the GtkTreeModel requirements */
490 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
491 * it is not visible to the tree or to the user., and the path "0" refers to the
492 * first child of GtkTreeStore::root.
496 static GtkTreeModelFlags
497 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
499 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
501 return GTK_TREE_MODEL_ITERS_PERSIST;
505 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
507 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
509 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
511 tree_store->columns_dirty = TRUE;
513 return tree_store->n_columns;
517 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
520 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
522 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
523 g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
524 index >= 0, G_TYPE_INVALID);
526 tree_store->columns_dirty = TRUE;
528 return tree_store->column_headers[index];
532 gtk_tree_store_get_iter (GtkTreeModel *tree_model,
536 GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
541 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
543 tree_store->columns_dirty = TRUE;
545 indices = gtk_tree_path_get_indices (path);
546 depth = gtk_tree_path_get_depth (path);
548 g_return_val_if_fail (depth > 0, FALSE);
550 parent.stamp = tree_store->stamp;
551 parent.user_data = tree_store->root;
553 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[0]))
556 for (i = 1; i < depth; i++)
559 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
567 gtk_tree_store_get_path (GtkTreeModel *tree_model,
574 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
575 g_return_val_if_fail (iter != NULL, NULL);
576 g_return_val_if_fail (iter->user_data != NULL, NULL);
577 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
579 validate_tree ((GtkTreeStore*)tree_model);
581 if (G_NODE (iter->user_data)->parent == NULL &&
582 G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
583 return gtk_tree_path_new ();
584 g_assert (G_NODE (iter->user_data)->parent != NULL);
586 if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
588 retval = gtk_tree_path_new ();
589 tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
593 GtkTreeIter tmp_iter = *iter;
595 tmp_iter.user_data = G_NODE (iter->user_data)->parent;
597 retval = gtk_tree_store_get_path (tree_model,
599 tmp_node = G_NODE (iter->user_data)->parent->children;
605 if (tmp_node == NULL)
607 gtk_tree_path_free (retval);
611 for (; tmp_node; tmp_node = tmp_node->next)
613 if (tmp_node == G_NODE (iter->user_data))
618 if (tmp_node == NULL)
620 /* We couldn't find node, meaning it's prolly not ours */
621 /* Perhaps I should do a g_return_if_fail here. */
622 gtk_tree_path_free (retval);
626 gtk_tree_path_append_index (retval, i);
633 gtk_tree_store_get_value (GtkTreeModel *tree_model,
638 GtkTreeDataList *list;
639 gint tmp_column = column;
641 g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
642 g_return_if_fail (iter != NULL);
643 g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
644 g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
646 list = G_NODE (iter->user_data)->data;
648 while (tmp_column-- > 0 && list)
653 _gtk_tree_data_list_node_to_value (list,
654 GTK_TREE_STORE (tree_model)->column_headers[column],
659 /* We want to return an initialized but empty (default) value */
660 g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
665 gtk_tree_store_iter_next (GtkTreeModel *tree_model,
668 g_return_val_if_fail (iter != NULL, FALSE);
669 g_return_val_if_fail (iter->user_data != NULL, FALSE);
670 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
672 if (G_NODE (iter->user_data)->next)
674 iter->user_data = G_NODE (iter->user_data)->next;
682 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
688 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
689 g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
692 children = G_NODE (parent->user_data)->children;
694 children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
698 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
699 iter->user_data = children;
707 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
710 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
711 g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
712 g_return_val_if_fail (iter->user_data != NULL, FALSE);
714 return G_NODE (iter->user_data)->children != NULL;
718 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
724 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
725 g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
728 node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
730 node = G_NODE (iter->user_data)->children;
742 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
750 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
751 g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
754 parent_node = GTK_TREE_STORE (tree_model)->root;
756 parent_node = parent->user_data;
758 child = g_node_nth_child (parent_node, n);
762 iter->user_data = child;
763 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
771 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
777 g_return_val_if_fail (iter != NULL, FALSE);
778 g_return_val_if_fail (child != NULL, FALSE);
779 g_return_val_if_fail (child->user_data != NULL, FALSE);
780 g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
782 parent = G_NODE (child->user_data)->parent;
784 g_assert (parent != NULL);
786 if (parent != GTK_TREE_STORE (tree_model)->root)
788 iter->user_data = parent;
789 iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
797 /* Does not emit a signal */
799 gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
805 GtkTreeDataList *list;
806 GtkTreeDataList *prev;
807 gint old_column = column;
808 GValue real_value = {0, };
809 gboolean converted = FALSE;
810 gboolean retval = FALSE;
812 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
813 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
814 g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
815 g_return_val_if_fail (G_IS_VALUE (value), FALSE);
817 if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
819 if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
820 g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
822 g_warning ("%s: Unable to convert from %s to %s\n",
824 g_type_name (G_VALUE_TYPE (value)),
825 g_type_name (tree_store->column_headers[column]));
828 if (!g_value_transform (value, &real_value))
830 g_warning ("%s: Unable to make conversion from %s to %s\n",
832 g_type_name (G_VALUE_TYPE (value)),
833 g_type_name (tree_store->column_headers[column]));
834 g_value_unset (&real_value);
840 prev = list = G_NODE (iter->user_data)->data;
847 _gtk_tree_data_list_value_to_node (list, &real_value);
849 _gtk_tree_data_list_value_to_node (list, value);
852 g_value_unset (&real_value);
853 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
854 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
863 if (G_NODE (iter->user_data)->data == NULL)
865 G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
870 list = prev->next = _gtk_tree_data_list_alloc ();
876 list->next = _gtk_tree_data_list_alloc ();
883 _gtk_tree_data_list_value_to_node (list, &real_value);
885 _gtk_tree_data_list_value_to_node (list, value);
889 g_value_unset (&real_value);
891 if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
892 gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
898 * gtk_tree_store_set_value:
899 * @tree_store: a #GtkTreeStore
900 * @iter: A valid #GtkTreeIter for the row being modified
901 * @column: column number to modify
902 * @value: new value for the cell
904 * Sets the data in the cell specified by @iter and @column.
905 * The type of @value must be convertible to the type of the
910 gtk_tree_store_set_value (GtkTreeStore *tree_store,
915 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
916 g_return_if_fail (VALID_ITER (iter, tree_store));
917 g_return_if_fail (column >= 0 && column < tree_store->n_columns);
918 g_return_if_fail (G_IS_VALUE (value));
920 if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
924 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
925 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
926 gtk_tree_path_free (path);
931 * gtk_tree_store_set_valist:
932 * @tree_store: A #GtkTreeStore
933 * @iter: A valid #GtkTreeIter for the row being modified
934 * @var_args: <type>va_list</type> of column/value pairs
936 * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
937 * use by language bindings.
941 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
946 gboolean emit_signal = FALSE;
947 gboolean maybe_need_sort = FALSE;
948 GtkTreeIterCompareFunc func = NULL;
950 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
951 g_return_if_fail (VALID_ITER (iter, tree_store));
953 column = va_arg (var_args, gint);
955 if (GTK_TREE_STORE_IS_SORTED (tree_store))
957 if (tree_store->sort_column_id != -1)
959 GtkTreeDataSortHeader *header;
960 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
961 tree_store->sort_column_id);
962 g_return_if_fail (header != NULL);
963 g_return_if_fail (header->func != NULL);
968 func = tree_store->default_sort_func;
972 if (func != _gtk_tree_data_list_compare_func)
973 maybe_need_sort = TRUE;
977 GValue value = { 0, };
980 if (column >= tree_store->n_columns)
982 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
985 g_value_init (&value, tree_store->column_headers[column]);
987 G_VALUE_COLLECT (&value, var_args, 0, &error);
990 g_warning ("%s: %s", G_STRLOC, error);
993 /* we purposely leak the value here, it might not be
994 * in a sane state if an error condition occoured
999 emit_signal = gtk_tree_store_real_set_value (tree_store,
1003 FALSE) || emit_signal;
1005 if (func == _gtk_tree_data_list_compare_func &&
1006 column == tree_store->sort_column_id)
1007 maybe_need_sort = TRUE;
1009 g_value_unset (&value);
1011 column = va_arg (var_args, gint);
1014 if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1015 gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id);
1021 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
1022 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
1023 gtk_tree_path_free (path);
1028 * gtk_tree_store_set:
1029 * @tree_store: A #GtkTreeStore
1030 * @iter: A valid #GtkTreeIter for the row being modified
1031 * @Varargs: pairs of column number and value, terminated with -1
1033 * Sets the value of one or more cells in the row referenced by @iter.
1034 * The variable argument list should contain integer column numbers,
1035 * each column number followed by the value to be set.
1036 * The list is terminated by a -1. For example, to set column 0 with type
1037 * %G_TYPE_STRING to "Foo", you would write
1038 * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
1041 gtk_tree_store_set (GtkTreeStore *tree_store,
1047 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1048 g_return_if_fail (VALID_ITER (iter, tree_store));
1050 va_start (var_args, iter);
1051 gtk_tree_store_set_valist (tree_store, iter, var_args);
1056 * gtk_tree_store_remove:
1057 * @tree_store: A #GtkTreeStore
1058 * @iter: A valid #GtkTreeIter
1060 * Removes @iter from @tree_store. After being removed, @iter is set to the
1061 * next valid row at that level, or invalidated if it previously pointed to the
1064 * Return value: %TRUE if @iter is still valid, %FALSE if not.
1067 gtk_tree_store_remove (GtkTreeStore *tree_store,
1071 GtkTreeIter new_iter = {0,};
1075 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1076 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1078 parent = G_NODE (iter->user_data)->parent;
1080 g_assert (parent != NULL);
1081 next_node = G_NODE (iter->user_data)->next;
1083 if (G_NODE (iter->user_data)->data)
1084 g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1085 -1, node_free, tree_store->column_headers);
1087 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1088 g_node_destroy (G_NODE (iter->user_data));
1090 gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1092 if (parent != G_NODE (tree_store->root))
1095 if (parent->children == NULL)
1097 gtk_tree_path_up (path);
1099 new_iter.stamp = tree_store->stamp;
1100 new_iter.user_data = parent;
1101 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1104 gtk_tree_path_free (path);
1106 /* revalidate iter */
1107 if (next_node != NULL)
1109 iter->stamp = tree_store->stamp;
1110 iter->user_data = next_node;
1116 iter->user_data = NULL;
1123 * gtk_tree_store_insert:
1124 * @tree_store: A #GtkTreeStore
1125 * @iter: An unset #GtkTreeIter to set to the new row
1126 * @parent: A valid #GtkTreeIter, or %NULL
1127 * @position: position to insert the new row
1129 * Creates a new row at @position. If parent is non-%NULL, then the row will be
1130 * made a child of @parent. Otherwise, the row will be created at the toplevel.
1131 * If @position is larger than the number of rows at that level, then the new
1132 * row will be inserted to the end of the list. @iter will be changed to point
1133 * to this new row. The row will be empty after this function is called. To
1134 * fill in values, you need to call gtk_tree_store_set() or
1135 * gtk_tree_store_set_value().
1139 gtk_tree_store_insert (GtkTreeStore *tree_store,
1141 GtkTreeIter *parent,
1148 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1149 g_return_if_fail (iter != NULL);
1151 g_return_if_fail (VALID_ITER (parent, tree_store));
1154 parent_node = parent->user_data;
1156 parent_node = tree_store->root;
1158 tree_store->columns_dirty = TRUE;
1160 new_node = g_node_new (NULL);
1162 iter->stamp = tree_store->stamp;
1163 iter->user_data = new_node;
1164 g_node_insert (parent_node, position, new_node);
1166 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1167 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1169 if (parent_node != tree_store->root)
1171 if (new_node->prev == NULL && new_node->next == NULL)
1173 gtk_tree_path_up (path);
1174 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1178 gtk_tree_path_free (path);
1180 validate_tree ((GtkTreeStore*)tree_store);
1184 * gtk_tree_store_insert_before:
1185 * @tree_store: A #GtkTreeStore
1186 * @iter: An unset #GtkTreeIter to set to the new row
1187 * @parent: A valid #GtkTreeIter, or %NULL
1188 * @sibling: A valid #GtkTreeIter, or %NULL
1190 * Inserts a new row before @sibling. If @sibling is %NULL, then the row will
1191 * be appended to @parent 's children. If @parent and @sibling are %NULL, then
1192 * the row will be appended to the toplevel. If both @sibling and @parent are
1193 * set, then @parent must be the parent of @sibling. When @sibling is set,
1194 * @parent is optional.
1196 * @iter will be changed to point to this new row. The row will be empty after
1197 * this function is called. To fill in values, you need to call
1198 * gtk_tree_store_set() or gtk_tree_store_set_value().
1202 gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1204 GtkTreeIter *parent,
1205 GtkTreeIter *sibling)
1208 GNode *parent_node = NULL;
1211 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1212 g_return_if_fail (iter != NULL);
1214 g_return_if_fail (VALID_ITER (parent, tree_store));
1215 if (sibling != NULL)
1216 g_return_if_fail (VALID_ITER (sibling, tree_store));
1218 if (parent == NULL && sibling == NULL)
1219 parent_node = tree_store->root;
1220 else if (parent == NULL)
1221 parent_node = G_NODE (sibling->user_data)->parent;
1222 else if (sibling == NULL)
1223 parent_node = G_NODE (parent->user_data);
1226 g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1227 parent_node = G_NODE (parent->user_data);
1230 tree_store->columns_dirty = TRUE;
1232 new_node = g_node_new (NULL);
1234 g_node_insert_before (parent_node,
1235 sibling ? G_NODE (sibling->user_data) : NULL,
1238 iter->stamp = tree_store->stamp;
1239 iter->user_data = new_node;
1241 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1242 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1244 if (parent_node != tree_store->root)
1246 if (new_node->prev == NULL && new_node->next == NULL)
1248 GtkTreeIter parent_iter;
1250 parent_iter.stamp = tree_store->stamp;
1251 parent_iter.user_data = parent_node;
1253 gtk_tree_path_up (path);
1254 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
1258 gtk_tree_path_free (path);
1260 validate_tree ((GtkTreeStore*)tree_store);
1264 * gtk_tree_store_insert_after:
1265 * @tree_store: A #GtkTreeStore
1266 * @iter: An unset #GtkTreeIter to set to the new row
1267 * @parent: A valid #GtkTreeIter, or %NULL
1268 * @sibling: A valid #GtkTreeIter, or %NULL
1270 * Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1271 * prepended to @parent 's children. If @parent and @sibling are %NULL, then
1272 * the row will be prepended to the toplevel. If both @sibling and @parent are
1273 * set, then @parent must be the parent of @sibling. When @sibling is set,
1274 * @parent is optional.
1276 * @iter will be changed to point to this new row. The row will be empty after
1277 * this function is called. To fill in values, you need to call
1278 * gtk_tree_store_set() or gtk_tree_store_set_value().
1282 gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1284 GtkTreeIter *parent,
1285 GtkTreeIter *sibling)
1291 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1292 g_return_if_fail (iter != NULL);
1294 g_return_if_fail (VALID_ITER (parent, tree_store));
1295 if (sibling != NULL)
1296 g_return_if_fail (VALID_ITER (sibling, tree_store));
1298 if (parent == NULL && sibling == NULL)
1299 parent_node = tree_store->root;
1300 else if (parent == NULL)
1301 parent_node = G_NODE (sibling->user_data)->parent;
1302 else if (sibling == NULL)
1303 parent_node = G_NODE (parent->user_data);
1306 g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1307 G_NODE (parent->user_data));
1308 parent_node = G_NODE (parent->user_data);
1311 tree_store->columns_dirty = TRUE;
1313 new_node = g_node_new (NULL);
1315 g_node_insert_after (parent_node,
1316 sibling ? G_NODE (sibling->user_data) : NULL,
1319 iter->stamp = tree_store->stamp;
1320 iter->user_data = new_node;
1322 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1323 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1325 if (parent_node != tree_store->root)
1327 if (new_node->prev == NULL && new_node->next == NULL)
1329 GtkTreeIter parent_iter;
1331 parent_iter.stamp = tree_store->stamp;
1332 parent_iter.user_data = parent_node;
1334 gtk_tree_path_up (path);
1335 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
1339 gtk_tree_path_free (path);
1341 validate_tree ((GtkTreeStore*)tree_store);
1345 * gtk_tree_store_prepend:
1346 * @tree_store: A #GtkTreeStore
1347 * @iter: An unset #GtkTreeIter to set to the prepended row
1348 * @parent: A valid #GtkTreeIter, or %NULL
1350 * Prepends a new row to @tree_store. If @parent is non-%NULL, then it will prepend
1351 * the new row before the first child of @parent, otherwise it will prepend a row
1352 * to the top level. @iter will be changed to point to this new row. The row
1353 * will be empty after this function is called. To fill in values, you need to
1354 * call gtk_tree_store_set() or gtk_tree_store_set_value().
1357 gtk_tree_store_prepend (GtkTreeStore *tree_store,
1359 GtkTreeIter *parent)
1363 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1364 g_return_if_fail (iter != NULL);
1366 g_return_if_fail (VALID_ITER (parent, tree_store));
1368 tree_store->columns_dirty = TRUE;
1371 parent_node = tree_store->root;
1373 parent_node = parent->user_data;
1375 if (parent_node->children == NULL)
1379 iter->stamp = tree_store->stamp;
1380 iter->user_data = g_node_new (NULL);
1382 g_node_prepend (parent_node, G_NODE (iter->user_data));
1384 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1385 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1387 if (parent_node != tree_store->root)
1389 gtk_tree_path_up (path);
1390 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1392 gtk_tree_path_free (path);
1396 gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1399 validate_tree ((GtkTreeStore*)tree_store);
1403 * gtk_tree_store_append:
1404 * @tree_store: A #GtkTreeStore
1405 * @iter: An unset #GtkTreeIter to set to the appended row
1406 * @parent: A valid #GtkTreeIter, or %NULL
1408 * Appends a new row to @tree_store. If @parent is non-%NULL, then it will append the
1409 * new row after the last child of @parent, otherwise it will append a row to
1410 * the top level. @iter will be changed to point to this new row. The row will
1411 * be empty after this function is called. To fill in values, you need to call
1412 * gtk_tree_store_set() or gtk_tree_store_set_value().
1415 gtk_tree_store_append (GtkTreeStore *tree_store,
1417 GtkTreeIter *parent)
1421 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1422 g_return_if_fail (iter != NULL);
1425 g_return_if_fail (VALID_ITER (parent, tree_store));
1428 parent_node = tree_store->root;
1430 parent_node = parent->user_data;
1432 tree_store->columns_dirty = TRUE;
1434 if (parent_node->children == NULL)
1438 iter->stamp = tree_store->stamp;
1439 iter->user_data = g_node_new (NULL);
1441 g_node_append (parent_node, G_NODE (iter->user_data));
1443 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1444 gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1446 if (parent_node != tree_store->root)
1448 gtk_tree_path_up (path);
1449 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1451 gtk_tree_path_free (path);
1455 gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1458 validate_tree ((GtkTreeStore*)tree_store);
1462 * gtk_tree_store_is_ancestor:
1463 * @tree_store: A #GtkTreeStore
1464 * @iter: A valid #GtkTreeIter
1465 * @descendant: A valid #GtkTreeIter
1467 * Returns %TRUE if @iter is an ancestor of @descendant. That is, @iter is the
1468 * parent (or grandparent or great-grandparent) of @descendant.
1470 * Return value: %TRUE, if @iter is an ancestor of @descendant
1473 gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1475 GtkTreeIter *descendant)
1477 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1478 g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1479 g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1481 return g_node_is_ancestor (G_NODE (iter->user_data),
1482 G_NODE (descendant->user_data));
1487 * gtk_tree_store_iter_depth:
1488 * @tree_store: A #GtkTreeStore
1489 * @iter: A valid #GtkTreeIter
1491 * Returns the depth of @iter. This will be 0 for anything on the root level, 1
1492 * for anything down a level, etc.
1494 * Return value: The depth of @iter
1497 gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1500 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1501 g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1503 return g_node_depth (G_NODE (iter->user_data)) - 2;
1506 /* simple ripoff from g_node_traverse_post_order */
1508 gtk_tree_store_clear_traverse (GNode *node,
1509 GtkTreeStore *store)
1517 child = node->children;
1520 register GNode *current;
1523 child = current->next;
1524 if (gtk_tree_store_clear_traverse (current, store))
1530 iter.stamp = store->stamp;
1531 iter.user_data = node;
1533 gtk_tree_store_remove (store, &iter);
1536 else if (node->parent)
1538 iter.stamp = store->stamp;
1539 iter.user_data = node;
1541 gtk_tree_store_remove (store, &iter);
1548 gtk_tree_store_increment_stamp (GtkTreeStore *tree_store)
1552 tree_store->stamp++;
1554 while (tree_store->stamp == 0);
1558 * gtk_tree_store_clear:
1559 * @tree_store: a #GtkTreeStore
1561 * Removes all rows from @tree_store
1564 gtk_tree_store_clear (GtkTreeStore *tree_store)
1566 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1568 gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1569 gtk_tree_store_increment_stamp (tree_store);
1573 gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1582 if (node == iter->user_data)
1586 if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1597 * gtk_tree_store_iter_is_valid:
1598 * @tree_store: A #GtkTreeStore.
1599 * @iter: A #GtkTreeIter.
1601 * WARNING: This function is slow. Only use it for debugging and/or testing
1604 * Checks if the given iter is a valid iter for this #GtkTreeStore.
1606 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1611 gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1614 g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1615 g_return_val_if_fail (iter != NULL, FALSE);
1617 if (!VALID_ITER (iter, tree_store))
1620 return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1626 static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
1633 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1638 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1640 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1644 gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1655 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1657 GtkSelectionData *selection_data)
1659 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1661 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1662 * target, because the default handler does it for us, but
1663 * we do anyway for the convenience of someone maybe overriding the
1667 if (gtk_tree_set_row_drag_data (selection_data,
1668 GTK_TREE_MODEL (drag_source),
1675 /* FIXME handle text targets at least. */
1682 copy_node_data (GtkTreeStore *tree_store,
1683 GtkTreeIter *src_iter,
1684 GtkTreeIter *dest_iter)
1686 GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1687 GtkTreeDataList *copy_head = NULL;
1688 GtkTreeDataList *copy_prev = NULL;
1689 GtkTreeDataList *copy_iter = NULL;
1696 copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1698 if (copy_head == NULL)
1699 copy_head = copy_iter;
1702 copy_prev->next = copy_iter;
1704 copy_prev = copy_iter;
1710 G_NODE (dest_iter->user_data)->data = copy_head;
1712 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1713 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1714 gtk_tree_path_free (path);
1718 recursive_node_copy (GtkTreeStore *tree_store,
1719 GtkTreeIter *src_iter,
1720 GtkTreeIter *dest_iter)
1723 GtkTreeModel *model;
1725 model = GTK_TREE_MODEL (tree_store);
1727 copy_node_data (tree_store, src_iter, dest_iter);
1729 if (gtk_tree_model_iter_children (model,
1733 /* Need to create children and recurse. Note our
1734 * dependence on persistent iterators here.
1740 /* Gee, a really slow algorithm... ;-) FIXME */
1741 gtk_tree_store_append (tree_store,
1745 recursive_node_copy (tree_store, &child, ©);
1747 while (gtk_tree_model_iter_next (model, &child));
1752 gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1754 GtkSelectionData *selection_data)
1756 GtkTreeModel *tree_model;
1757 GtkTreeStore *tree_store;
1758 GtkTreeModel *src_model = NULL;
1759 GtkTreePath *src_path = NULL;
1760 gboolean retval = FALSE;
1762 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1764 tree_model = GTK_TREE_MODEL (drag_dest);
1765 tree_store = GTK_TREE_STORE (drag_dest);
1767 validate_tree (tree_store);
1769 if (gtk_tree_get_row_drag_data (selection_data,
1772 src_model == tree_model)
1774 /* Copy the given row to a new position */
1775 GtkTreeIter src_iter;
1776 GtkTreeIter dest_iter;
1779 if (!gtk_tree_model_get_iter (src_model,
1786 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1787 prev = gtk_tree_path_copy (dest);
1789 if (!gtk_tree_path_prev (prev))
1791 GtkTreeIter dest_parent;
1792 GtkTreePath *parent;
1793 GtkTreeIter *dest_parent_p;
1795 /* dest was the first spot at the current depth; which means
1796 * we are supposed to prepend.
1799 /* Get the parent, NULL if parent is the root */
1800 dest_parent_p = NULL;
1801 parent = gtk_tree_path_copy (dest);
1802 if (gtk_tree_path_up (parent) &&
1803 gtk_tree_path_get_depth (parent) > 0)
1805 gtk_tree_model_get_iter (tree_model,
1808 dest_parent_p = &dest_parent;
1810 gtk_tree_path_free (parent);
1813 gtk_tree_store_prepend (tree_store,
1821 if (gtk_tree_model_get_iter (tree_model, &dest_iter, prev))
1823 GtkTreeIter tmp_iter = dest_iter;
1825 gtk_tree_store_insert_after (tree_store, &dest_iter, NULL,
1832 gtk_tree_path_free (prev);
1834 /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1835 * duplicating it below dest_iter.
1840 recursive_node_copy (tree_store,
1847 /* FIXME maybe add some data targets eventually, or handle text
1848 * targets in the simple case.
1856 gtk_tree_path_free (src_path);
1862 gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1863 GtkTreePath *dest_path,
1864 GtkSelectionData *selection_data)
1866 GtkTreeModel *src_model = NULL;
1867 GtkTreePath *src_path = NULL;
1868 GtkTreePath *tmp = NULL;
1869 gboolean retval = FALSE;
1871 g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1873 /* don't accept drops if the tree has been sorted */
1874 if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1877 if (!gtk_tree_get_row_drag_data (selection_data,
1882 /* can only drag to ourselves */
1883 if (src_model != GTK_TREE_MODEL (drag_dest))
1886 /* Can't drop into ourself. */
1887 if (gtk_tree_path_is_ancestor (src_path,
1891 /* Can't drop if dest_path's parent doesn't exist */
1895 if (gtk_tree_path_get_depth (dest_path) > 1)
1897 tmp = gtk_tree_path_copy (dest_path);
1898 gtk_tree_path_up (tmp);
1900 if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1906 /* Can otherwise drop anywhere. */
1912 gtk_tree_path_free (src_path);
1914 gtk_tree_path_free (tmp);
1919 /* Sorting and reordering */
1920 typedef struct _SortTuple
1928 gtk_tree_store_reorder_func (gconstpointer a,
1932 SortTuple *a_reorder;
1933 SortTuple *b_reorder;
1935 a_reorder = (SortTuple *)a;
1936 b_reorder = (SortTuple *)b;
1938 if (a_reorder->offset < b_reorder->offset)
1940 if (a_reorder->offset > b_reorder->offset)
1947 * gtk_tree_store_reorder:
1948 * @tree_store: A #GtkTreeStore.
1949 * @parent: A #GtkTreeIter.
1950 * @new_order: an array of integers mapping the new position of each child
1951 * to its old position before the re-ordering,
1952 * i.e. @new_order<literal>[newpos] = oldpos</literal>.
1954 * Reorders the children of @parent in @tree_store to follow the order
1955 * indicated by @new_order. Note that this function only works with
1961 gtk_tree_store_reorder (GtkTreeStore *tree_store,
1962 GtkTreeIter *parent,
1966 GNode *level, *node;
1968 SortTuple *sort_array;
1970 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1971 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
1972 g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
1973 g_return_if_fail (new_order != NULL);
1976 level = G_NODE (tree_store->root)->children;
1978 level = G_NODE (parent->user_data)->children;
1988 /* set up sortarray */
1989 sort_array = g_new (SortTuple, length);
1992 for (i = 0; i < length; i++)
1994 sort_array[new_order[i]].offset = i;
1995 sort_array[i].node = node;
2000 g_qsort_with_data (sort_array,
2003 gtk_tree_store_reorder_func,
2007 for (i = 0; i < length - 1; i++)
2009 sort_array[i].node->next = sort_array[i+1].node;
2010 sort_array[i+1].node->prev = sort_array[i].node;
2013 sort_array[length-1].node->next = NULL;
2014 sort_array[0].node->prev = NULL;
2016 G_NODE (parent->user_data)->children = sort_array[0].node;
2018 G_NODE (tree_store->root)->children = sort_array[0].node;
2022 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), parent);
2024 path = gtk_tree_path_new ();
2025 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
2027 gtk_tree_path_free (path);
2028 g_free (sort_array);
2032 * gtk_tree_store_swap:
2033 * @tree_store: A #GtkTreeStore.
2034 * @a: A #GtkTreeIter.
2035 * @b: Another #GtkTreeIter.
2037 * Swaps @a and @b in the same level of @tree_store. Note that this function
2038 * only works with unsorted stores.
2043 gtk_tree_store_swap (GtkTreeStore *tree_store,
2047 GNode *tmp, *node_a, *node_b, *parent_node;
2048 GNode *a_prev, *a_next, *b_prev, *b_next;
2049 gint i, a_count, b_count, length, *order;
2050 GtkTreePath *path_a, *path_b;
2053 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2054 g_return_if_fail (VALID_ITER (a, tree_store));
2055 g_return_if_fail (VALID_ITER (b, tree_store));
2057 node_a = G_NODE (a->user_data);
2058 node_b = G_NODE (b->user_data);
2060 /* basic sanity checking */
2061 if (node_a == node_b)
2064 path_a = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), a);
2065 path_b = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), b);
2067 g_return_if_fail (path_a && path_b);
2069 gtk_tree_path_up (path_a);
2070 gtk_tree_path_up (path_b);
2072 if (gtk_tree_path_get_depth (path_a) == 0
2073 || gtk_tree_path_get_depth (path_b) == 0)
2075 if (gtk_tree_path_get_depth (path_a) != gtk_tree_path_get_depth (path_b))
2077 gtk_tree_path_free (path_a);
2078 gtk_tree_path_free (path_b);
2080 g_warning ("Given children are not in the same level\n");
2083 parent_node = G_NODE (tree_store->root);
2087 if (gtk_tree_path_compare (path_a, path_b))
2089 gtk_tree_path_free (path_a);
2090 gtk_tree_path_free (path_b);
2092 g_warning ("Given children don't have a common parent\n");
2095 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent,
2097 parent_node = G_NODE (parent.user_data);
2099 gtk_tree_path_free (path_b);
2101 /* old links which we have to keep around */
2102 a_prev = node_a->prev;
2103 a_next = node_a->next;
2105 b_prev = node_b->prev;
2106 b_next = node_b->next;
2108 /* fix up links if the nodes are next to eachother */
2109 if (a_prev == node_b)
2111 if (a_next == node_b)
2114 if (b_prev == node_a)
2116 if (b_next == node_a)
2119 /* counting nodes */
2120 tmp = parent_node->children;
2121 i = a_count = b_count = 0;
2134 /* hacking the tree */
2136 parent_node->children = node_b;
2138 a_prev->next = node_b;
2141 a_next->prev = node_b;
2144 parent_node->children = node_a;
2146 b_prev->next = node_a;
2149 b_next->prev = node_a;
2151 node_a->prev = b_prev;
2152 node_a->next = b_next;
2154 node_b->prev = a_prev;
2155 node_b->next = a_next;
2158 order = g_new (gint, length);
2159 for (i = 0; i < length; i++)
2162 else if (i == b_count)
2167 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2168 parent_node == tree_store->root
2169 ? NULL : &parent, order);
2170 gtk_tree_path_free (path_a);
2174 /* WARNING: this function is *incredibly* fragile. Please smashtest after
2175 * making changes here.
2179 gtk_tree_store_move (GtkTreeStore *tree_store,
2181 GtkTreeIter *position,
2184 GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2185 gint old_pos, new_pos, length, i, *order;
2186 GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2187 GtkTreeIter parent_iter, dst_a, dst_b;
2189 gboolean handle_b = TRUE;
2191 g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2192 g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2193 g_return_if_fail (VALID_ITER (iter, tree_store));
2195 g_return_if_fail (VALID_ITER (position, tree_store));
2202 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2203 pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store),
2207 * moving the iter before path or "path + 1" doesn't make sense
2209 * moving the iter before path or "path - 1" doesn't make sense
2211 if (!gtk_tree_path_compare (path, pos_path))
2212 goto free_paths_and_out;
2215 gtk_tree_path_next (path);
2217 gtk_tree_path_prev (path);
2219 if (!gtk_tree_path_compare (path, pos_path))
2220 goto free_paths_and_out;
2223 gtk_tree_path_prev (path);
2225 gtk_tree_path_next (path);
2227 if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2229 g_warning ("Given children are not in the same level\n");
2231 goto free_paths_and_out;
2234 tmppath = gtk_tree_path_copy (pos_path);
2235 gtk_tree_path_up (path);
2236 gtk_tree_path_up (tmppath);
2238 if (gtk_tree_path_get_depth (path) > 0 &&
2239 gtk_tree_path_compare (path, tmppath))
2241 g_warning ("Given children are not in the same level\n");
2243 gtk_tree_path_free (tmppath);
2244 goto free_paths_and_out;
2247 gtk_tree_path_free (tmppath);
2252 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2253 gtk_tree_path_up (path);
2256 depth = gtk_tree_path_get_depth (path);
2260 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent_iter, path);
2262 parent = G_NODE (parent_iter.user_data);
2265 parent = G_NODE (tree_store->root);
2267 /* yes, I know that this can be done shorter, but I'm doing it this way
2268 * so the code is also maintainable
2271 if (before && position)
2273 b = G_NODE (position->user_data);
2275 if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2277 gtk_tree_path_prev (pos_path);
2278 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_a, pos_path))
2279 a = G_NODE (dst_a.user_data);
2282 gtk_tree_path_next (pos_path);
2285 /* if b is NULL, a is NULL too -- we are at the beginning of the list
2286 * yes and we leak memory here ...
2288 g_return_if_fail (b);
2290 else if (before && !position)
2292 /* move before without position is appending */
2299 a = G_NODE (position->user_data);
2305 gtk_tree_path_next (pos_path);
2306 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2307 b = G_NODE (dst_b.user_data);
2310 gtk_tree_path_prev (pos_path);
2314 /* move after without position is prepending */
2316 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2319 gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2322 b = G_NODE (dst_b.user_data);
2325 /* if a is NULL, b is NULL too -- we are at the end of the list
2326 * yes and we leak memory here ...
2329 g_return_if_fail (a);
2332 /* counting nodes */
2333 tmp = parent->children;
2335 length = old_pos = 0;
2338 if (tmp == iter->user_data)
2345 /* remove node from list */
2346 node = G_NODE (iter->user_data);
2351 tmp_a->next = tmp_b;
2353 parent->children = tmp_b;
2356 tmp_b->prev = tmp_a;
2358 /* and reinsert the node */
2367 else if (!a && !before)
2369 tmp = parent->children;
2372 parent->children = node;
2380 else if (!a && before)
2384 node->parent = NULL;
2385 node->next = node->prev = NULL;
2387 /* before with sibling = NULL appends */
2388 g_node_insert_before (parent, NULL, node);
2392 node->parent = NULL;
2393 node->next = node->prev = NULL;
2395 /* after with sibling = NULL prepends */
2396 g_node_insert_after (parent, NULL, node);
2412 else if (!(!a && before)) /* !a && before is completely handled above */
2418 new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2422 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2425 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2431 if (new_pos > old_pos)
2433 if (before && position)
2438 if (!before && position)
2442 order = g_new (gint, length);
2443 if (new_pos > old_pos)
2445 for (i = 0; i < length; i++)
2448 else if (i >= old_pos && i < new_pos)
2450 else if (i == new_pos)
2457 for (i = 0; i < length; i++)
2460 else if (i > new_pos && i <= old_pos)
2468 tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), &parent_iter);
2469 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2470 tmppath, &parent_iter, order);
2474 tmppath = gtk_tree_path_new ();
2475 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2476 tmppath, NULL, order);
2479 gtk_tree_path_free (tmppath);
2480 gtk_tree_path_free (path);
2482 gtk_tree_path_free (pos_path);
2488 gtk_tree_path_free (path);
2489 gtk_tree_path_free (pos_path);
2493 * gtk_tree_store_move_before:
2494 * @tree_store: A #GtkTreeStore.
2495 * @iter: A #GtkTreeIter.
2496 * @position: A #GtkTreeIter or %NULL.
2498 * Moves @iter in @tree_store to the position before @position. @iter and
2499 * @position should be in the same level. Note that this function only
2500 * works with unsorted stores. If @position is %NULL, @iter will be
2501 * moved to the end of the level.
2506 gtk_tree_store_move_before (GtkTreeStore *tree_store,
2508 GtkTreeIter *position)
2510 gtk_tree_store_move (tree_store, iter, position, TRUE);
2514 * gtk_tree_store_move_after:
2515 * @tree_store: A #GtkTreeStore.
2516 * @iter: A #GtkTreeIter.
2517 * @position: A #GtkTreeIter.
2519 * Moves @iter in @tree_store to the position after @position. @iter and
2520 * @position should be in the same level. Note that this function only
2521 * works with unsorted stores. If @position is %NULL, @iter will be moved
2522 * to the start of the level.
2527 gtk_tree_store_move_after (GtkTreeStore *tree_store,
2529 GtkTreeIter *position)
2531 gtk_tree_store_move (tree_store, iter, position, FALSE);
2536 gtk_tree_store_compare_func (gconstpointer a,
2540 GtkTreeStore *tree_store = user_data;
2543 GtkTreeIterCompareFunc func;
2550 if (tree_store->sort_column_id != -1)
2552 GtkTreeDataSortHeader *header;
2554 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2555 tree_store->sort_column_id);
2556 g_return_val_if_fail (header != NULL, 0);
2557 g_return_val_if_fail (header->func != NULL, 0);
2559 func = header->func;
2560 data = header->data;
2564 g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2565 func = tree_store->default_sort_func;
2566 data = tree_store->default_sort_data;
2569 node_a = ((SortTuple *) a)->node;
2570 node_b = ((SortTuple *) b)->node;
2572 iter_a.stamp = tree_store->stamp;
2573 iter_a.user_data = node_a;
2574 iter_b.stamp = tree_store->stamp;
2575 iter_b.user_data = node_b;
2577 retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2579 if (tree_store->order == GTK_SORT_DESCENDING)
2583 else if (retval < 0)
2590 gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2603 node = parent->children;
2604 if (node == NULL || node->next == NULL)
2606 if (recurse && node && node->children)
2607 gtk_tree_store_sort_helper (tree_store, node, TRUE);
2613 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2616 sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2619 for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2624 tuple.node = tmp_node;
2625 g_array_append_val (sort_array, tuple);
2629 /* Sort the array */
2630 g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2632 for (i = 0; i < list_length - 1; i++)
2634 g_array_index (sort_array, SortTuple, i).node->next =
2635 g_array_index (sort_array, SortTuple, i + 1).node;
2636 g_array_index (sort_array, SortTuple, i + 1).node->prev =
2637 g_array_index (sort_array, SortTuple, i).node;
2639 g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2640 g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2641 parent->children = g_array_index (sort_array, SortTuple, 0).node;
2643 /* Let the world know about our new order */
2644 new_order = g_new (gint, list_length);
2645 for (i = 0; i < list_length; i++)
2646 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2648 iter.stamp = tree_store->stamp;
2649 iter.user_data = parent;
2650 path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2651 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2652 path, &iter, new_order);
2653 gtk_tree_path_free (path);
2655 g_array_free (sort_array, TRUE);
2659 for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2661 if (tmp_node->children)
2662 gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2668 gtk_tree_store_sort (GtkTreeStore *tree_store)
2670 if (!GTK_TREE_STORE_IS_SORTED (tree_store))
2673 if (tree_store->sort_column_id != -1)
2675 GtkTreeDataSortHeader *header = NULL;
2677 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2678 tree_store->sort_column_id);
2680 /* We want to make sure that we have a function */
2681 g_return_if_fail (header != NULL);
2682 g_return_if_fail (header->func != NULL);
2686 g_return_if_fail (tree_store->default_sort_func != NULL);
2689 gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2693 gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2700 GtkTreePath *tmp_path;
2701 GtkTreeIter tmp_iter;
2709 GtkTreeIterCompareFunc func;
2712 g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2714 tmp_iter.stamp = tree_store->stamp;
2715 if (tree_store->sort_column_id != -1)
2717 GtkTreeDataSortHeader *header;
2718 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2719 tree_store->sort_column_id);
2720 g_return_if_fail (header != NULL);
2721 g_return_if_fail (header->func != NULL);
2722 func = header->func;
2723 data = header->data;
2727 g_return_if_fail (tree_store->default_sort_func != NULL);
2728 func = tree_store->default_sort_func;
2729 data = tree_store->default_sort_data;
2732 /* If it's the built in function, we don't sort. */
2733 if (func == _gtk_tree_data_list_compare_func &&
2734 tree_store->sort_column_id != column)
2738 node = G_NODE (iter->user_data)->parent->children;
2739 /* First we find the iter, its prev, and its next */
2742 if (node == G_NODE (iter->user_data))
2747 g_assert (node != NULL);
2752 /* Check the common case, where we don't need to sort it moved. */
2755 tmp_iter.user_data = prev;
2756 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2761 tmp_iter.user_data = next;
2762 cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2765 if (tree_store->order == GTK_SORT_DESCENDING)
2778 if (prev == NULL && cmp_b <= 0)
2780 else if (next == NULL && cmp_a <= 0)
2782 else if (prev != NULL && next != NULL &&
2783 cmp_a <= 0 && cmp_b <= 0)
2786 /* We actually need to sort it */
2787 /* First, remove the old link. */
2792 node->parent->children = next;
2800 /* FIXME: as an optimization, we can potentially start at next */
2802 node = node->parent->children;
2804 tmp_iter.user_data = node;
2805 if (tree_store->order == GTK_SORT_DESCENDING)
2806 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2808 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2810 while ((node->next) && (cmp_a > 0))
2815 tmp_iter.user_data = node;
2816 if (tree_store->order == GTK_SORT_DESCENDING)
2817 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2819 cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2822 if ((!node->next) && (cmp_a > 0))
2825 node->next = G_NODE (iter->user_data);
2826 node->next->prev = node;
2830 prev->next = G_NODE (iter->user_data);
2831 prev->next->prev = prev;
2832 G_NODE (iter->user_data)->next = node;
2833 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2837 G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2838 G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2839 G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2842 /* Emit the reordered signal. */
2843 length = g_node_n_children (node->parent);
2844 new_order = g_new (int, length);
2845 if (old_location < new_location)
2846 for (i = 0; i < length; i++)
2848 if (i < old_location ||
2851 else if (i >= old_location &&
2853 new_order[i] = i + 1;
2854 else if (i == new_location)
2855 new_order[i] = old_location;
2858 for (i = 0; i < length; i++)
2860 if (i < new_location ||
2863 else if (i > new_location &&
2865 new_order[i] = i - 1;
2866 else if (i == new_location)
2867 new_order[i] = old_location;
2870 tmp_iter.user_data = node->parent;
2871 tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2873 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2874 tmp_path, &tmp_iter,
2877 gtk_tree_path_free (tmp_path);
2883 gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
2884 gint *sort_column_id,
2887 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2889 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2892 * sort_column_id = tree_store->sort_column_id;
2894 * order = tree_store->order;
2896 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID ||
2897 tree_store->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
2904 gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
2905 gint sort_column_id,
2908 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2910 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2913 if ((tree_store->sort_column_id == sort_column_id) &&
2914 (tree_store->order == order))
2917 if (sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
2919 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2921 GtkTreeDataSortHeader *header = NULL;
2923 header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2926 /* We want to make sure that we have a function */
2927 g_return_if_fail (header != NULL);
2928 g_return_if_fail (header->func != NULL);
2932 g_return_if_fail (tree_store->default_sort_func != NULL);
2936 tree_store->sort_column_id = sort_column_id;
2937 tree_store->order = order;
2939 gtk_tree_sortable_sort_column_changed (sortable);
2941 gtk_tree_store_sort (tree_store);
2945 gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
2946 gint sort_column_id,
2947 GtkTreeIterCompareFunc func,
2949 GtkDestroyNotify destroy)
2951 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2953 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2954 g_return_if_fail (func != NULL);
2956 tree_store->sort_list = _gtk_tree_data_list_set_header (tree_store->sort_list,
2958 func, data, destroy);
2960 if (tree_store->sort_column_id == sort_column_id)
2961 gtk_tree_store_sort (tree_store);
2965 gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
2966 GtkTreeIterCompareFunc func,
2968 GtkDestroyNotify destroy)
2970 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2972 g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2974 if (tree_store->default_sort_destroy)
2976 GtkDestroyNotify d = tree_store->default_sort_destroy;
2978 tree_store->default_sort_destroy = NULL;
2979 d (tree_store->default_sort_data);
2982 tree_store->default_sort_func = func;
2983 tree_store->default_sort_data = data;
2984 tree_store->default_sort_destroy = destroy;
2986 if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2987 gtk_tree_store_sort (tree_store);
2991 gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
2993 GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2995 g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2997 return (tree_store->default_sort_func != NULL);
3001 validate_gnode (GNode* node)
3005 iter = node->children;
3006 while (iter != NULL)
3008 g_assert (iter->parent == node);
3010 g_assert (iter->prev->next == iter);
3011 validate_gnode (iter);
3016 #define __GTK_TREE_STORE_C__
3017 #include "gtkaliasdef.c"