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.
24 #include <gobject/gvaluecollector.h>
25 #include "gtktreemodel.h"
26 #include "gtktreeview.h"
27 #include "gtktreeprivate.h"
28 #include "gtkmarshalers.h"
31 #define INITIALIZE_TREE_ITER(Iter) \
34 (Iter)->user_data = NULL; \
35 (Iter)->user_data2 = NULL; \
36 (Iter)->user_data3 = NULL; \
43 ROW_HAS_CHILD_TOGGLED,
49 static guint tree_model_signals[LAST_SIGNAL] = { 0 };
58 static void gtk_tree_model_base_init (gpointer g_class);
62 gtk_tree_model_get_type (void)
64 static GType tree_model_type = 0;
66 if (! tree_model_type)
68 static const GTypeInfo tree_model_info =
70 sizeof (GtkTreeModelIface), /* class_size */
71 gtk_tree_model_base_init, /* base_init */
72 NULL, /* base_finalize */
74 NULL, /* class_finalize */
75 NULL, /* class_data */
82 g_type_register_static (G_TYPE_INTERFACE, "GtkTreeModel",
85 g_type_interface_add_prerequisite (tree_model_type, G_TYPE_OBJECT);
88 return tree_model_type;
92 gtk_tree_model_base_init (gpointer g_class)
94 static gboolean initialized = FALSE;
98 tree_model_signals[ROW_CHANGED] =
99 g_signal_new ("row_changed",
102 G_STRUCT_OFFSET (GtkTreeModelIface, row_changed),
104 _gtk_marshal_VOID__BOXED_BOXED,
108 tree_model_signals[ROW_INSERTED] =
109 g_signal_new ("row_inserted",
112 G_STRUCT_OFFSET (GtkTreeModelIface, row_inserted),
114 _gtk_marshal_VOID__BOXED_BOXED,
118 tree_model_signals[ROW_HAS_CHILD_TOGGLED] =
119 g_signal_new ("row_has_child_toggled",
122 G_STRUCT_OFFSET (GtkTreeModelIface, row_has_child_toggled),
124 _gtk_marshal_VOID__BOXED_BOXED,
128 tree_model_signals[ROW_DELETED] =
129 g_signal_new ("row_deleted",
132 G_STRUCT_OFFSET (GtkTreeModelIface, row_deleted),
134 _gtk_marshal_VOID__BOXED,
137 tree_model_signals[ROWS_REORDERED] =
138 g_signal_new ("rows_reordered",
141 G_STRUCT_OFFSET (GtkTreeModelIface, rows_reordered),
143 _gtk_marshal_VOID__BOXED_BOXED_POINTER,
155 * Creates a new #GtkTreePath. This structure refers to a row.
157 * Return value: A newly created #GtkTreePath.
159 /* GtkTreePath Operations */
161 gtk_tree_path_new (void)
164 retval = (GtkTreePath *) g_new (GtkTreePath, 1);
166 retval->indices = NULL;
172 * gtk_tree_path_new_from_string:
173 * @path: The string representation of a path.
175 * Creates a new #GtkTreePath initialized to @path. @path is expected to be a
176 * colon separated list of numbers. For example, the string "10:4:0" would
177 * create a path of depth 3 pointing to the 11th child of the root node, the 5th
178 * child of that 11th child, and the 1st child of that 5th child. If an invalid
179 * path string is passed in, %NULL is returned.
181 * Return value: A newly-created #GtkTreePath, or %NULL
184 gtk_tree_path_new_from_string (const gchar *path)
187 const gchar *orig_path = path;
191 g_return_val_if_fail (path != NULL, NULL);
192 g_return_val_if_fail (*path != '\000', NULL);
194 retval = gtk_tree_path_new ();
198 i = strtol (path, &ptr, 10);
199 gtk_tree_path_append_index (retval, i);
203 g_warning (G_STRLOC ": Negative numbers in path %s passed to gtk_tree_path_new_from_string", orig_path);
204 gtk_tree_path_free (retval);
209 if (ptr == path || *ptr != ':')
211 g_warning (G_STRLOC ": Invalid path %s passed to gtk_tree_path_new_from_string", orig_path);
212 gtk_tree_path_free (retval);
222 * gtk_tree_path_new_from_indices:
223 * @first_index: first integer
224 * @varargs: list of integers terminated by -1
226 * Creates a new path with @first_index and @varargs as indices.
228 * Return value: A newly created GtkTreePath.
231 gtk_tree_path_new_from_indices (gint first_index,
238 path = gtk_tree_path_new ();
240 va_start (args, first_index);
245 gtk_tree_path_append_index (path, arg);
246 arg = va_arg (args, gint);
255 * gtk_tree_path_to_string:
256 * @path: A #GtkTreePath
258 * Generates a string representation of the path. This string is a ':'
259 * separated list of numbers. For example, "4:10:0:3" would be an acceptable return value for this string.
261 * Return value: A newly-allocated string. Must be freed with g_free().
264 gtk_tree_path_to_string (GtkTreePath *path)
269 g_return_val_if_fail (path != NULL, NULL);
271 if (path->depth == 0)
274 ptr = retval = (gchar *) g_new0 (char *, path->depth*8);
275 sprintf (retval, "%d", path->indices[0]);
276 while (*ptr != '\000')
279 for (i = 1; i < path->depth; i++)
281 sprintf (ptr, ":%d", path->indices[i]);
282 while (*ptr != '\000')
290 * gtk_tree_path_new_first:
292 * Creates a new #GtkTreePath. The string representation of this path is "0"
294 * Return value: A new #GtkTreePath.
297 gtk_tree_path_new_first (void)
301 retval = gtk_tree_path_new ();
302 gtk_tree_path_append_index (retval, 0);
308 * gtk_tree_path_append_index:
309 * @path: A #GtkTreePath.
310 * @index_: The index.
312 * Appends a new index to a path. As a result, the depth of the path is
316 gtk_tree_path_append_index (GtkTreePath *path,
319 g_return_if_fail (path != NULL);
320 g_return_if_fail (index >= 0);
323 path->indices = g_realloc (path->indices, path->depth * sizeof(gint));
324 path->indices[path->depth - 1] = index;
328 * gtk_tree_path_prepend_index:
329 * @path: A #GtkTreePath.
330 * @index_: The index.
332 * Prepends a new index to a path. As a result, the depth of the path is
336 gtk_tree_path_prepend_index (GtkTreePath *path,
342 new_indices = g_new (gint, path->depth);
344 if (path->indices == NULL)
346 path->indices = new_indices;
347 path->indices[0] = index;
350 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
351 g_free (path->indices);
352 path->indices = new_indices;
353 path->indices[0] = index;
357 * gtk_tree_path_get_depth:
358 * @path: A #GtkTreePath.
360 * Returns the current depth of @path.
362 * Return value: The depth of @path
365 gtk_tree_path_get_depth (GtkTreePath *path)
367 g_return_val_if_fail (path != NULL, 0);
373 * gtk_tree_path_get_indices:
374 * @path: A #GtkTreePath.
376 * Returns the current indices of @path. This is an array of integers, each
377 * representing a node in a tree. This value should not be freed.
379 * Return value: The current indices, or %NULL.
382 gtk_tree_path_get_indices (GtkTreePath *path)
384 g_return_val_if_fail (path != NULL, NULL);
386 return path->indices;
390 * gtk_tree_path_free:
391 * @path: A #GtkTreePath.
396 gtk_tree_path_free (GtkTreePath *path)
398 g_return_if_fail (path != NULL);
400 g_free (path->indices);
405 * gtk_tree_path_copy:
406 * @path: A #GtkTreePath.
408 * Creates a new #GtkTreePath as a copy of @path.
410 * Return value: A new #GtkTreePath.
413 gtk_tree_path_copy (const GtkTreePath *path)
417 g_return_val_if_fail (path != NULL, NULL);
419 retval = g_new (GtkTreePath, 1);
420 retval->depth = path->depth;
421 retval->indices = g_new (gint, path->depth);
422 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
427 gtk_tree_path_get_type (void)
429 static GType our_type = 0;
432 our_type = g_boxed_type_register_static ("GtkTreePath",
433 (GBoxedCopyFunc) gtk_tree_path_copy,
434 (GBoxedFreeFunc) gtk_tree_path_free);
440 * gtk_tree_path_compare:
441 * @a: A #GtkTreePath.
442 * @b: A #GtkTreePath to compare with.
444 * Compares two paths. If @a appears before @b in a tree, then -1 is returned.
445 * If @b appears before @a, then 1 is returned. If the two nodes are equal,
446 * then 0 is returned.
448 * Return value: The relative positions of @a and @b
451 gtk_tree_path_compare (const GtkTreePath *a,
452 const GtkTreePath *b)
456 g_return_val_if_fail (a != NULL, 0);
457 g_return_val_if_fail (b != NULL, 0);
458 g_return_val_if_fail (a->depth > 0, 0);
459 g_return_val_if_fail (b->depth > 0, 0);
463 if (a->indices[p] == b->indices[q])
465 return (a->indices[p] < b->indices[q]?-1:1);
467 while (++p < a->depth && ++q < b->depth);
468 if (a->depth == b->depth)
470 return (a->depth < b->depth?-1:1);
474 * gtk_tree_path_is_ancestor:
475 * @path: a #GtkTreePath
476 * @descendant: another #GtkTreePath
478 * Returns %TRUE if @descendant is a descendant of @path.
480 * Return value: %TRUE if @descendant is contained inside @path
483 gtk_tree_path_is_ancestor (GtkTreePath *path,
484 GtkTreePath *descendant)
488 g_return_val_if_fail (path != NULL, FALSE);
489 g_return_val_if_fail (descendant != NULL, FALSE);
491 /* can't be an ancestor if we're deeper */
492 if (path->depth >= descendant->depth)
496 while (i < path->depth)
498 if (path->indices[i] != descendant->indices[i])
507 * gtk_tree_path_is_descendant:
508 * @path: a #GtkTreePath
509 * @ancestor: another #GtkTreePath
511 * Returns %TRUE if @path is a descendant of @ancestor.
513 * Return value: %TRUE if @ancestor contains @path somewhere below it
516 gtk_tree_path_is_descendant (GtkTreePath *path,
517 GtkTreePath *ancestor)
521 g_return_val_if_fail (path != NULL, FALSE);
522 g_return_val_if_fail (ancestor != NULL, FALSE);
524 /* can't be a descendant if we're shallower in the tree */
525 if (path->depth <= ancestor->depth)
529 while (i < ancestor->depth)
531 if (path->indices[i] != ancestor->indices[i])
541 * gtk_tree_path_next:
542 * @path: A #GtkTreePath.
544 * Moves the @path to point to the next node at the current depth.
547 gtk_tree_path_next (GtkTreePath *path)
549 g_return_if_fail (path != NULL);
550 g_return_if_fail (path->depth > 0);
552 path->indices[path->depth - 1] ++;
556 * gtk_tree_path_prev:
557 * @path: A #GtkTreePath.
559 * Moves the @path to point to the previous node at the current depth, if it exists.
561 * Return value: %TRUE if @path has a previous node, and the move was made.
564 gtk_tree_path_prev (GtkTreePath *path)
566 g_return_val_if_fail (path != NULL, FALSE);
568 if (path->indices[path->depth - 1] == 0)
571 path->indices[path->depth - 1] -= 1;
578 * @path: A #GtkTreePath.
580 * Moves the @path to point to it's parent node, if it has a parent.
582 * Return value: %TRUE if @path has a parent, and the move was made.
585 gtk_tree_path_up (GtkTreePath *path)
587 g_return_val_if_fail (path != NULL, FALSE);
589 if (path->depth == 0)
598 * gtk_tree_path_down:
599 * @path: A #GtkTreePath.
601 * Moves @path to point to the first child of the current path.
604 gtk_tree_path_down (GtkTreePath *path)
606 g_return_if_fail (path != NULL);
608 gtk_tree_path_append_index (path, 0);
612 * gtk_tree_iter_copy:
613 * @iter: A #GtkTreeIter.
615 * Creates a dynamically allocated tree iterator as a copy of @iter. This
616 * function is not intended for use in applications, because you can just copy
617 * the structs by value (<literal>GtkTreeIter new_iter = iter;</literal>). You
618 * must free this iter with gtk_tree_iter_free ().
620 * Return value: a newly-allocated copy of @iter.
623 gtk_tree_iter_copy (GtkTreeIter *iter)
627 g_return_val_if_fail (iter != NULL, NULL);
629 retval = g_new (GtkTreeIter, 1);
636 * gtk_tree_iter_free:
637 * @iter: A dynamically allocated tree iterator.
639 * Frees an iterator that has been allocated on the heap. This function is
640 * mainly used for language bindings.
643 gtk_tree_iter_free (GtkTreeIter *iter)
645 g_return_if_fail (iter != NULL);
651 gtk_tree_iter_get_type (void)
653 static GType our_type = 0;
656 our_type = g_boxed_type_register_static ("GtkTreeIter",
657 (GBoxedCopyFunc) gtk_tree_iter_copy,
658 (GBoxedFreeFunc) gtk_tree_iter_free);
664 * gtk_tree_model_get_flags:
665 * @tree_model: A #GtkTreeModel.
667 * Returns a set of flags supported by this interface. The flags are a bitwise
668 * combination of #GtkTreeModelFlags. The flags supported should not change
669 * during the lifecycle of the tree_model.
671 * Return value: The flags supported by this interface.
674 gtk_tree_model_get_flags (GtkTreeModel *tree_model)
676 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
678 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags)
679 return (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags) (tree_model);
685 * gtk_tree_model_get_n_columns:
686 * @tree_model: A #GtkTreeModel.
688 * Returns the number of columns supported by @tree_model.
690 * Return value: The number of columns.
693 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
695 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
696 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
698 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
702 * gtk_tree_model_get_column_type:
703 * @tree_model: A #GtkTreeModel.
704 * @index_: The column index.
706 * Returns the type of the column.
708 * Return value: The type of the column.
711 gtk_tree_model_get_column_type (GtkTreeModel *tree_model,
714 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), G_TYPE_INVALID);
715 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type != NULL, G_TYPE_INVALID);
716 g_return_val_if_fail (index >= 0, G_TYPE_INVALID);
718 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type) (tree_model, index);
722 * gtk_tree_model_get_iter:
723 * @tree_model: A #GtkTreeModel.
724 * @iter: The uninitialized #GtkTreeIter.
725 * @path: The #GtkTreePath.
727 * Sets @iter to a valid iterator pointing to @path.
729 * Return value: %TRUE, if @iter was set.
732 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
736 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
737 g_return_val_if_fail (iter != NULL, FALSE);
738 g_return_val_if_fail (path != NULL, FALSE);
739 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL, FALSE);
740 g_return_val_if_fail (path->depth > 0, FALSE);
742 INITIALIZE_TREE_ITER (iter);
744 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
748 * gtk_tree_model_get_iter_from_string:
749 * @tree_model: A #GtkTreeModel.
750 * @iter: An uninitialized #GtkTreeIter.
751 * @path_string: A string representation of a #GtkTreePath.
753 * Sets @iter to a valid iterator pointing to @path_string, if it
754 * exists. Otherwise, @iter is left invalid and %FALSE is returned.
756 * Return value: %TRUE, if @iter was set.
759 gtk_tree_model_get_iter_from_string (GtkTreeModel *tree_model,
761 const gchar *path_string)
766 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
767 g_return_val_if_fail (iter != NULL, FALSE);
768 g_return_val_if_fail (path_string != NULL, FALSE);
770 path = gtk_tree_path_new_from_string (path_string);
772 g_return_val_if_fail (path != NULL, FALSE);
774 retval = gtk_tree_model_get_iter (tree_model, iter, path);
775 gtk_tree_path_free (path);
781 * gtk_tree_model_get_string_from_iter:
782 * @tree_model: A #GtkTreeModel.
783 * @iter: An #GtkTreeIter.
785 * Generates a string representation of the iter. This string is a ':'
786 * separated list of numbers. For example, "4:10:0:3" would be an
787 * acceptable return value for this string.
789 * Return value: A newly-allocated string. Must be freed with g_free().
792 gtk_tree_model_get_string_from_iter (GtkTreeModel *tree_model,
798 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
799 g_return_val_if_fail (iter != NULL, NULL);
801 path = gtk_tree_model_get_path (tree_model, iter);
803 g_return_val_if_fail (path != NULL, NULL);
805 ret = gtk_tree_path_to_string (path);
806 gtk_tree_path_free (path);
812 * gtk_tree_model_get_iter_first:
813 * @tree_model: A #GtkTreeModel.
814 * @iter: The uninitialized #GtkTreeIter.
816 * Initializes @iter with the first iterator in the tree (the one at the path
817 * "0") and returns %TRUE. Returns %FALSE if the tree is empty.
819 * Return value: %TRUE, if @iter was set.
822 gtk_tree_model_get_iter_first (GtkTreeModel *tree_model,
828 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
829 g_return_val_if_fail (iter != NULL, FALSE);
831 path = gtk_tree_path_new_first ();
832 retval = gtk_tree_model_get_iter (tree_model, iter, path);
833 gtk_tree_path_free (path);
839 * gtk_tree_model_get_path:
840 * @tree_model: A #GtkTreeModel.
841 * @iter: The #GtkTreeIter.
843 * Returns a newly-created #GtkTreePath referenced by @iter. This path should
844 * be freed with gtk_tree_path_free().
846 * Return value: a newly-created #GtkTreePath.
849 gtk_tree_model_get_path (GtkTreeModel *tree_model,
852 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
853 g_return_val_if_fail (iter != NULL, NULL);
854 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
856 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
860 * gtk_tree_model_get_value:
861 * @tree_model: A #GtkTreeModel.
862 * @iter: The #GtkTreeIter.
863 * @column: The column to lookup the value at.
864 * @value: An empty #GValue to set.
866 * Sets initializes and sets @value to that at @column. When done with @value,
867 * g_value_unset() needs to be called to free any allocated memory.
870 gtk_tree_model_get_value (GtkTreeModel *tree_model,
875 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
876 g_return_if_fail (iter != NULL);
877 g_return_if_fail (value != NULL);
878 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
880 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
884 * gtk_tree_model_iter_next:
885 * @tree_model: A #GtkTreeModel.
886 * @iter: The #GtkTreeIter.
888 * Sets @iter to point to the node following it at the current level. If there
889 * is no next @iter, %FALSE is returned and @iter is set to be invalid.
891 * Return value: %TRUE if @iter has been changed to the next node.
894 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
897 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
898 g_return_val_if_fail (iter != NULL, FALSE);
899 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
901 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
905 * gtk_tree_model_iter_children:
906 * @tree_model: A #GtkTreeModel.
907 * @iter: The new #GtkTreeIter to be set to the child.
908 * @parent: The #GtkTreeIter, or %NULL
910 * Sets @iter to point to the first child of @parent. If @parent has no children,
911 * %FALSE is returned and @iter is set to be invalid. @parent will remain a valid
912 * node after this function has been called.
914 * If @parent is %NULL returns the first node, equivalent to
915 * <literal>gtk_tree_model_get_iter_first (tree_model, iter);</literal>
917 * Return value: %TRUE, if @child has been set to the first child.
920 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
924 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
925 g_return_val_if_fail (iter != NULL, FALSE);
926 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
928 INITIALIZE_TREE_ITER (iter);
930 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
934 * gtk_tree_model_iter_has_child:
935 * @tree_model: A #GtkTreeModel.
936 * @iter: The #GtkTreeIter to test for children.
938 * Returns %TRUE if @iter has children, %FALSE otherwise.
940 * Return value: %TRUE if @iter has children.
943 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
946 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
947 g_return_val_if_fail (iter != NULL, FALSE);
948 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
950 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
954 * gtk_tree_model_iter_n_children:
955 * @tree_model: A #GtkTreeModel.
956 * @iter: The #GtkTreeIter, or %NULL.
958 * Returns the number of children that @iter has. As a special case, if @iter
959 * is %NULL, then the number of toplevel nodes is returned.
961 * Return value: The number of children of @iter.
964 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
967 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
968 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
970 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
974 * gtk_tree_model_iter_nth_child:
975 * @tree_model: A #GtkTreeModel.
976 * @iter: The #GtkTreeIter to set to the nth child.
977 * @parent: The #GtkTreeIter to get the child from, or %NULL.
978 * @n: Then index of the desired child.
980 * Sets @iter to be the child of @parent, using the given index. The first
981 * index is 0. If @n is too big, or @parent has no children, @iter is set
982 * to an invalid iterator and %FALSE is returned. @parent will remain a valid
983 * node after this function has been called. As a special case, if @parent is
984 * %NULL, then the @n<!-- -->th root node is set.
986 * Return value: %TRUE, if @parent has an @n<!-- -->th child.
989 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
994 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
995 g_return_val_if_fail (iter != NULL, FALSE);
996 g_return_val_if_fail (n >= 0, FALSE);
997 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
999 INITIALIZE_TREE_ITER (iter);
1001 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
1005 * gtk_tree_model_iter_parent:
1006 * @tree_model: A #GtkTreeModel
1007 * @iter: The new #GtkTreeIter to set to the parent.
1008 * @child: The #GtkTreeIter.
1010 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
1011 * doesn't have a parent, then @iter is set to an invalid iterator and %FALSE
1012 * is returned. @child will remain a valid node after this function has been
1015 * Return value: %TRUE, if @iter is set to the parent of @child.
1018 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
1022 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1023 g_return_val_if_fail (iter != NULL, FALSE);
1024 g_return_val_if_fail (child != NULL, FALSE);
1025 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
1027 INITIALIZE_TREE_ITER (iter);
1029 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);
1033 * gtk_tree_model_ref_node:
1034 * @tree_model: A #GtkTreeModel.
1035 * @iter: The #GtkTreeIter.
1037 * Lets the tree ref the node. This is an optional method for models to
1038 * implement. To be more specific, models may ignore this call as it exists
1039 * primarily for performance reasons.
1041 * This function is primarily meant as a way for views to let caching model know
1042 * when nodes are being displayed (and hence, whether or not to cache that
1043 * node.) For example, a file-system based model would not want to keep the
1044 * entire file-hierarchy in memory, just the sections that are currently being
1045 * displayed by every current view.
1047 * A model should be expected to be able to get an iter independent of it's
1051 gtk_tree_model_ref_node (GtkTreeModel *tree_model,
1054 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1056 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_node)
1057 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_node) (tree_model, iter);
1061 * gtk_tree_model_unref_node:
1062 * @tree_model: A #GtkTreeModel.
1063 * @iter: The #GtkTreeIter.
1065 * Lets the tree unref the node. This is an optional method for models to
1066 * implement. To be more specific, models may ignore this call as it exists
1067 * primarily for performance reasons.
1069 * For more information on what this means, see gtk_tree_model_ref_node().
1070 * Please note that nodes that are deleted are not unreffed.
1073 gtk_tree_model_unref_node (GtkTreeModel *tree_model,
1076 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1077 g_return_if_fail (iter != NULL);
1079 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_node)
1080 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_node) (tree_model, iter);
1084 * gtk_tree_model_get:
1085 * @tree_model: a #GtkTreeModel
1086 * @iter: a row in @tree_model
1087 * @Varargs: pairs of column number and value return locations, terminated by -1
1089 * Gets the value of one or more cells in the row referenced by @iter.
1090 * The variable argument list should contain integer column numbers,
1091 * each column number followed by a place to store the value being
1092 * retrieved. The list is terminated by a -1. For example, to get a
1093 * value from column 0 with type %G_TYPE_STRING, you would
1094 * write: <literal>gtk_tree_model_get (model, iter, 0, &place_string_here, -1)</literal>,
1095 * where <literal>place_string_here</literal> is a <type>gchar*</type> to be
1096 * filled with the string.
1097 * If appropriate, the returned values have to be freed or unreferenced.
1101 gtk_tree_model_get (GtkTreeModel *tree_model,
1107 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1108 g_return_if_fail (iter != NULL);
1110 va_start (var_args, iter);
1111 gtk_tree_model_get_valist (tree_model, iter, var_args);
1116 * gtk_tree_model_get_valist:
1117 * @tree_model: a #GtkTreeModel
1118 * @iter: a row in @tree_model
1119 * @var_args: <type>va_list</type> of column/return location pairs
1121 * See gtk_tree_model_get(), this version takes a <type>va_list</type>
1122 * for language bindings to use.
1125 gtk_tree_model_get_valist (GtkTreeModel *tree_model,
1131 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1132 g_return_if_fail (iter != NULL);
1134 column = va_arg (var_args, gint);
1136 while (column != -1)
1138 GValue value = { 0, };
1139 gchar *error = NULL;
1141 if (column >= gtk_tree_model_get_n_columns (tree_model))
1143 g_warning ("%s: Invalid column number %d accessed (remember to end your list of columns with a -1)", G_STRLOC, column);
1147 gtk_tree_model_get_value (GTK_TREE_MODEL (tree_model), iter, column, &value);
1149 G_VALUE_LCOPY (&value, var_args, 0, &error);
1152 g_warning ("%s: %s", G_STRLOC, error);
1155 /* we purposely leak the value here, it might not be
1156 * in a sane state if an error condition occoured
1161 g_value_unset (&value);
1163 column = va_arg (var_args, gint);
1168 * gtk_tree_model_row_changed:
1169 * @tree_model: A #GtkTreeModel
1170 * @path: A #GtkTreePath pointing to the changed row
1171 * @iter: A valid #GtkTreeIter pointing to the changed row
1173 * Emits the "row_changed" signal on @tree_model.
1176 gtk_tree_model_row_changed (GtkTreeModel *tree_model,
1180 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1181 g_return_if_fail (path != NULL);
1182 g_return_if_fail (iter != NULL);
1184 g_signal_emit (tree_model, tree_model_signals[ROW_CHANGED], 0, path, iter);
1188 * gtk_tree_model_row_inserted:
1189 * @tree_model: A #GtkTreeModel
1190 * @path: A #GtkTreePath pointing to the inserted row
1191 * @iter: A valid #GtkTreeIter pointing to the inserted row
1193 * Emits the "row_inserted" signal on @tree_model
1196 gtk_tree_model_row_inserted (GtkTreeModel *tree_model,
1200 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1201 g_return_if_fail (path != NULL);
1202 g_return_if_fail (iter != NULL);
1204 g_signal_emit (tree_model, tree_model_signals[ROW_INSERTED], 0, path, iter);
1208 * gtk_tree_model_row_has_child_toggled:
1209 * @tree_model: A #GtkTreeModel
1210 * @path: A #GtkTreePath pointing to the changed row
1211 * @iter: A valid #GtkTreeIter pointing to the changed row
1213 * Emits the "row_has_child_toggled" signal on @tree_model. This should be
1214 * called by models after the child state of a node changes.
1217 gtk_tree_model_row_has_child_toggled (GtkTreeModel *tree_model,
1221 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1222 g_return_if_fail (path != NULL);
1223 g_return_if_fail (iter != NULL);
1225 g_signal_emit (tree_model, tree_model_signals[ROW_HAS_CHILD_TOGGLED], 0, path, iter);
1229 * gtk_tree_model_row_deleted:
1230 * @tree_model: A #GtkTreeModel
1231 * @path: A #GtkTreePath pointing to the previous location of the deleted row.
1233 * Emits the "row_deleted" signal on @tree_model. This should be called by
1234 * models after a row has been removed. The location pointed to by @path should
1235 * be the location that the row previously was at. It may not be a valid
1239 gtk_tree_model_row_deleted (GtkTreeModel *tree_model,
1242 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1243 g_return_if_fail (path != NULL);
1245 g_signal_emit (tree_model, tree_model_signals[ROW_DELETED], 0, path);
1249 * gtk_tree_model_rows_reordered:
1250 * @tree_model: A #GtkTreeModel
1251 * @path: A #GtkTreePath pointing to the tree node whose children have been reordered
1252 * @iter: A valid #GtkTreeIter pointing to the node whose children have been reordered
1253 * @new_order: an array of integers containing the new indices of the children,
1254 * i.e. the former child <literal>n</literal> is now at position
1255 * @new_order<literal>[n]</literal>.
1257 * Emits the "rows_reordered" signal on @tree_model. This should be called by
1258 * models when their rows have been reordered.
1261 gtk_tree_model_rows_reordered (GtkTreeModel *tree_model,
1266 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1267 g_return_if_fail (new_order != NULL);
1269 g_signal_emit (tree_model, tree_model_signals[ROWS_REORDERED], 0, path, iter, new_order);
1274 gtk_tree_model_foreach_helper (GtkTreeModel *model,
1277 GtkTreeModelForeachFunc func,
1284 if ((* func) (model, path, iter, user_data))
1287 if (gtk_tree_model_iter_children (model, &child, iter))
1289 gtk_tree_path_down (path);
1290 if (gtk_tree_model_foreach_helper (model, &child, path, func, user_data))
1292 gtk_tree_path_up (path);
1295 gtk_tree_path_next (path);
1297 while (gtk_tree_model_iter_next (model, iter));
1303 * gtk_tree_model_foreach:
1304 * @model: A #GtkTreeModel
1305 * @func: A function to be called on each row
1306 * @user_data: User data to passed to func.
1308 * Calls func on each node in model in a depth-first fashion. If func returns
1309 * %TRUE, then the tree ceases to be walked, and gtk_tree_model_foreach() returns.
1313 gtk_tree_model_foreach (GtkTreeModel *model,
1314 GtkTreeModelForeachFunc func,
1320 g_return_if_fail (GTK_IS_TREE_MODEL (model));
1321 g_return_if_fail (func != NULL);
1323 path = gtk_tree_path_new_first ();
1324 if (gtk_tree_model_get_iter (model, &iter, path) == FALSE)
1326 gtk_tree_path_free (path);
1330 gtk_tree_model_foreach_helper (model, &iter, path, func, user_data);
1331 gtk_tree_path_free (path);
1336 * GtkTreeRowReference
1339 static void gtk_tree_row_reference_unref_path (GtkTreePath *path,
1340 GtkTreeModel *model,
1345 gtk_tree_row_reference_get_type (void)
1347 static GType our_type = 0;
1350 our_type = g_boxed_type_register_static ("GtkTreeRowReference",
1351 (GBoxedCopyFunc) gtk_tree_row_reference_copy,
1352 (GBoxedFreeFunc) gtk_tree_row_reference_free);
1358 #define ROW_REF_DATA_STRING "gtk-tree-row-refs"
1360 struct _GtkTreeRowReference
1363 GtkTreeModel *model;
1374 release_row_references (gpointer data)
1376 RowRefList *refs = data;
1377 GSList *tmp_list = NULL;
1379 tmp_list = refs->list;
1380 while (tmp_list != NULL)
1382 GtkTreeRowReference *reference = tmp_list->data;
1384 if (reference->proxy == (GObject *)reference->model)
1385 reference->model = NULL;
1386 reference->proxy = NULL;
1388 /* we don't free the reference, users are responsible for that. */
1390 tmp_list = g_slist_next (tmp_list);
1393 g_slist_free (refs->list);
1398 gtk_tree_row_ref_inserted_callback (GObject *object,
1403 RowRefList *refs = g_object_get_data (data, ROW_REF_DATA_STRING);
1410 /* This function corrects the path stored in the reference to
1411 * account for an insertion. Note that it's called _after_ the insertion
1412 * with the path to the newly-inserted row. Which means that
1413 * the inserted path is in a different "coordinate system" than
1414 * the old path (e.g. if the inserted path was just before the old path,
1415 * then inserted path and old path will be the same, and old path must be
1419 tmp_list = refs->list;
1421 while (tmp_list != NULL)
1423 GtkTreeRowReference *reference = tmp_list->data;
1425 if (reference->path == NULL)
1428 if (reference->path->depth >= path->depth)
1431 gboolean ancestor = TRUE;
1433 for (i = 0; i < path->depth - 1; i ++)
1435 if (path->indices[i] != reference->path->indices[i])
1441 if (ancestor == FALSE)
1444 if (path->indices[path->depth-1] <= reference->path->indices[path->depth-1])
1445 reference->path->indices[path->depth-1] += 1;
1448 tmp_list = g_slist_next (tmp_list);
1453 gtk_tree_row_ref_deleted_callback (GObject *object,
1457 RowRefList *refs = g_object_get_data (data, ROW_REF_DATA_STRING);
1463 /* This function corrects the path stored in the reference to
1464 * account for an deletion. Note that it's called _after_ the
1465 * deletion with the old path of the just-deleted row. Which means
1466 * that the deleted path is the same now-defunct "coordinate system"
1467 * as the path saved in the reference, which is what we want to fix.
1470 tmp_list = refs->list;
1472 while (tmp_list != NULL)
1474 GtkTreeRowReference *reference = tmp_list->data;
1476 if (reference->path)
1480 if (path->depth > reference->path->depth)
1482 for (i = 0; i < path->depth - 1; i++)
1484 if (path->indices[i] != reference->path->indices[i])
1488 /* We know it affects us. */
1489 if (path->indices[i] == reference->path->indices[i])
1491 if (reference->path->depth > path->depth)
1492 /* some parent was deleted, trying to unref any node
1493 * between the deleted parent and the node the reference
1494 * is pointing to is bad, as those nodes are already gone.
1496 gtk_tree_row_reference_unref_path (reference->path, reference->model, path->depth - 1);
1498 gtk_tree_row_reference_unref_path (reference->path, reference->model, reference->path->depth - 1);
1499 gtk_tree_path_free (reference->path);
1500 reference->path = NULL;
1502 else if (path->indices[i] < reference->path->indices[i])
1504 reference->path->indices[path->depth-1]-=1;
1509 tmp_list = g_slist_next (tmp_list);
1514 gtk_tree_row_ref_reordered_callback (GObject *object,
1520 RowRefList *refs = g_object_get_data (data, ROW_REF_DATA_STRING);
1527 tmp_list = refs->list;
1529 while (tmp_list != NULL)
1531 GtkTreeRowReference *reference = tmp_list->data;
1533 length = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (reference->model), iter);
1538 if ((reference->path) &&
1539 (gtk_tree_path_is_ancestor (path, reference->path)))
1541 gint ref_depth = gtk_tree_path_get_depth (reference->path);
1542 gint depth = gtk_tree_path_get_depth (path);
1544 if (ref_depth > depth)
1547 gint *indices = gtk_tree_path_get_indices (reference->path);
1549 for (i = 0; i < length; i++)
1551 if (new_order[i] == indices[depth])
1560 tmp_list = g_slist_next (tmp_list);
1566 connect_ref_callbacks (GtkTreeModel *model)
1568 g_signal_connect (model,
1570 G_CALLBACK (gtk_tree_row_ref_inserted_callback),
1572 g_signal_connect (model,
1574 G_CALLBACK (gtk_tree_row_ref_deleted_callback),
1576 g_signal_connect (model,
1578 G_CALLBACK (gtk_tree_row_ref_reordered_callback),
1583 /* We do this recursively so that we can unref children nodes before their parent */
1585 gtk_tree_row_reference_unref_path_helper (GtkTreePath *path,
1586 GtkTreeModel *model,
1587 GtkTreeIter *parent_iter,
1593 if (depth == current_depth)
1596 gtk_tree_model_iter_nth_child (model, &iter, parent_iter, path->indices[current_depth]);
1597 gtk_tree_row_reference_unref_path_helper (path, model, &iter, depth, current_depth + 1);
1598 gtk_tree_model_unref_node (model, &iter);
1602 gtk_tree_row_reference_unref_path (GtkTreePath *path,
1603 GtkTreeModel *model,
1611 gtk_tree_model_iter_nth_child (model, &iter, NULL, path->indices[0]);
1612 gtk_tree_row_reference_unref_path_helper (path, model, &iter, depth, 1);
1613 gtk_tree_model_unref_node (model, &iter);
1617 disconnect_ref_callbacks (GtkTreeModel *model)
1619 g_signal_handlers_disconnect_matched (model,
1620 G_SIGNAL_MATCH_FUNC,
1622 gtk_tree_row_ref_inserted_callback,
1624 g_signal_handlers_disconnect_matched (model,
1625 G_SIGNAL_MATCH_FUNC,
1627 gtk_tree_row_ref_deleted_callback,
1629 g_signal_handlers_disconnect_matched (model,
1630 G_SIGNAL_MATCH_FUNC,
1632 gtk_tree_row_ref_reordered_callback,
1637 * gtk_tree_row_reference_new:
1638 * @model: A #GtkTreeModel
1639 * @path: A valid #GtkTreePath to monitor
1641 * Creates a row reference based on @path. This reference will keep pointing to
1642 * the node pointed to by @path, so long as it exists. It listens to all
1643 * signals emitted by @model, and updates it's path appropriately. If @path
1644 * isn't a valid path in @model, then %NULL is returned.
1646 * Return value: A newly allocated #GtkTreeRowReference, or %NULL
1648 GtkTreeRowReference *
1649 gtk_tree_row_reference_new (GtkTreeModel *model,
1652 g_return_val_if_fail (GTK_IS_TREE_MODEL (model), NULL);
1653 g_return_val_if_fail (path != NULL, NULL);
1655 return gtk_tree_row_reference_new_proxy (G_OBJECT (model), model, path);
1659 * gtk_tree_row_reference_new_proxy:
1660 * @proxy: A proxy #GObject
1661 * @model: A #GtkTreeModel
1662 * @path: A valid #GtkTreePath to monitor
1664 * You do not need to use this function. Creates a row reference based on
1665 * @path. This reference will keep pointing to the node pointed to by @path, so
1666 * long as it exists. If @path isn't a valid path in @model, then %NULL is
1667 * returned. However, unlike references created with
1668 * gtk_tree_row_reference_new(), it does not listen to the model for changes.
1669 * The creator of the row reference must do this explicitly using
1670 * gtk_tree_row_reference_inserted(), gtk_tree_row_reference_deleted(),
1671 * gtk_tree_row_reference_reordered(). This must be called once per signal per
1674 * This type of row reference is primarily meant by structures that need to
1675 * carefully monitor exactly when a row_reference updates itself, and is not
1676 * generally needed by most applications.
1678 * Return value: A newly allocated #GtkTreeRowReference, or %NULL
1680 GtkTreeRowReference *
1681 gtk_tree_row_reference_new_proxy (GObject *proxy,
1682 GtkTreeModel *model,
1685 GtkTreeRowReference *reference;
1687 GtkTreeIter parent_iter;
1690 g_return_val_if_fail (G_IS_OBJECT (proxy), NULL);
1691 g_return_val_if_fail (GTK_IS_TREE_MODEL (model), NULL);
1692 g_return_val_if_fail (path != NULL, NULL);
1693 g_return_val_if_fail (path->depth > 0, NULL);
1695 /* check that the path is valid */
1696 if (gtk_tree_model_get_iter (model, &parent_iter, path) == FALSE)
1699 /* Now we want to ref every node */
1700 gtk_tree_model_iter_nth_child (model, &parent_iter, NULL, path->indices[0]);
1701 gtk_tree_model_ref_node (model, &parent_iter);
1703 for (i = 1; i < path->depth; i++)
1706 gtk_tree_model_iter_nth_child (model, &iter, &parent_iter, path->indices[i]);
1707 gtk_tree_model_ref_node (model, &iter);
1711 /* Make ther row reference */
1712 reference = g_new (GtkTreeRowReference, 1);
1714 g_object_ref (proxy);
1715 g_object_ref (model);
1716 reference->proxy = proxy;
1717 reference->model = model;
1718 reference->path = gtk_tree_path_copy (path);
1720 refs = g_object_get_data (G_OBJECT (proxy), ROW_REF_DATA_STRING);
1724 refs = g_new (RowRefList, 1);
1727 if (G_OBJECT (model) == proxy)
1728 connect_ref_callbacks (model);
1730 g_object_set_data_full (G_OBJECT (proxy),
1731 ROW_REF_DATA_STRING,
1732 refs, release_row_references);
1735 refs->list = g_slist_prepend (refs->list, reference);
1741 * gtk_tree_row_reference_get_path:
1742 * @reference: A #GtkTreeRowReference
1744 * Returns a path that the row reference currently points to, or %NULL if the
1745 * path pointed to is no longer valid.
1747 * Return value: A current path, or %NULL.
1750 gtk_tree_row_reference_get_path (GtkTreeRowReference *reference)
1752 g_return_val_if_fail (reference != NULL, NULL);
1754 if (reference->proxy == NULL)
1757 if (reference->path == NULL)
1760 return gtk_tree_path_copy (reference->path);
1764 * gtk_tree_row_reference_valid:
1765 * @reference: A #GtkTreeRowReference, or NULL
1767 * Returns TRUE if the %reference is non-NULL and refers to a current valid
1770 * Return value: TRUE if %reference points to a valid path.
1773 gtk_tree_row_reference_valid (GtkTreeRowReference *reference)
1775 if (reference == NULL || reference->path == NULL)
1782 GtkTreeRowReference *
1783 gtk_tree_row_reference_copy (GtkTreeRowReference *reference)
1785 return gtk_tree_row_reference_new_proxy (reference->proxy,
1791 * gtk_tree_row_reference_free:
1792 * @reference: A #GtkTreeRowReference, or NULL
1794 * Free's %reference. %reference may be NULL.
1797 gtk_tree_row_reference_free (GtkTreeRowReference *reference)
1801 if (reference == NULL)
1804 refs = g_object_get_data (G_OBJECT (reference->proxy), ROW_REF_DATA_STRING);
1808 g_warning (G_STRLOC": bad row reference, proxy has no outstanding row references");
1812 refs->list = g_slist_remove (refs->list, reference);
1814 if (refs->list == NULL)
1816 if (G_OBJECT (reference->model) == reference->proxy)
1817 disconnect_ref_callbacks (reference->model);
1819 g_object_set_data (G_OBJECT (reference->proxy),
1820 ROW_REF_DATA_STRING,
1824 if (reference->path)
1826 gtk_tree_row_reference_unref_path (reference->path, reference->model, reference->path->depth);
1827 gtk_tree_path_free (reference->path);
1830 g_object_unref (reference->proxy);
1831 g_object_unref (reference->model);
1836 * gtk_tree_row_reference_inserted:
1837 * @proxy: A #GObject
1838 * @path: The row position that was inserted
1840 * Lets a set of row reference created by gtk_tree_row_reference_new_proxy()
1841 * know that the model emitted the "row_inserted" signal.
1844 gtk_tree_row_reference_inserted (GObject *proxy,
1847 g_return_if_fail (G_IS_OBJECT (proxy));
1849 gtk_tree_row_ref_inserted_callback (NULL, path, NULL, proxy);
1854 * gtk_tree_row_reference_deleted:
1855 * @proxy: A #GObject
1856 * @path: The path position that was deleted
1858 * Lets a set of row reference created by gtk_tree_row_reference_new_proxy()
1859 * know that the model emitted the "row_deleted" signal.
1862 gtk_tree_row_reference_deleted (GObject *proxy,
1865 g_return_if_fail (G_IS_OBJECT (proxy));
1867 gtk_tree_row_ref_deleted_callback (NULL, path, proxy);
1871 * gtk_tree_row_reference_reordered:
1872 * @proxy: A #GObject
1873 * @path: The parent path of the reordered signal
1874 * @iter: The iter pointing to the parent of the reordered
1875 * @new_order: The new order of rows
1877 * Lets a set of row reference created by gtk_tree_row_reference_new_proxy()
1878 * know that the model emitted the "rows_reordered" signal.
1881 gtk_tree_row_reference_reordered (GObject *proxy,
1886 g_return_if_fail (G_IS_OBJECT (proxy));
1888 gtk_tree_row_ref_reordered_callback (NULL, path, iter, new_order, proxy);