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.
23 #include "gtktreemodel.h"
32 gtk_tree_model_get_type (void)
34 static GtkType tree_model_type = 0;
38 static const GTypeInfo tree_model_info =
40 sizeof (GtkTreeModelIface), /* class_size */
42 NULL, /* base_finalize */
44 NULL, /* class_finalize */
45 NULL, /* class_data */
51 tree_model_type = g_type_register_static (G_TYPE_INTERFACE, "GtkTreeModel", &tree_model_info, 0);
54 return tree_model_type;
60 * Creates a new #GtkTreePath.
62 * Return value: A newly created #GtkTreePath.
64 /* GtkTreePath Operations */
66 gtk_tree_path_new (void)
69 retval = (GtkTreePath *) g_new (GtkTreePath, 1);
71 retval->indices = NULL;
77 * gtk_tree_path_new_from_string:
78 * @path: The string representation of a path.
80 * Creates a new #GtkTreePath initialized to @path. @path is expected
81 * to be a colon separated list of numbers. For example, the string
82 * "10:4:0" would create a path of depth 3 pointing to the 11th child
83 * of the root node, the 5th child of that 11th child, and the 1st
84 * child of that 5th child.
86 * Return value: A newly created #GtkTreePath.
89 gtk_tree_path_new_from_string (gchar *path)
95 g_return_val_if_fail (path != NULL, gtk_tree_path_new ());
97 retval = gtk_tree_path_new ();
101 i = strtol (path, &ptr, 10);
102 gtk_tree_path_append_index (retval, i);
106 /* FIXME: should we error out if this is not a ':', or should we be tolerant? */
114 * gtk_tree_path_to_string:
115 * @path: A #GtkTreePath
117 * Generates a string representation of the path. This string is a ':'
118 * separated list of numbers. For example, "4:10:0:3" would be an acceptable return value for this string.
120 * Return value: A newly allocated string. Must be freed with #g_free.
123 gtk_tree_path_to_string (GtkTreePath *path)
128 if (path->depth == 0)
131 ptr = retval = (gchar *) g_new0 (char *, path->depth*8);
132 sprintf (retval, "%d", path->indices[0]);
133 while (*ptr != '\000')
136 for (i = 1; i < path->depth; i++)
138 sprintf (ptr, ":%d", path->indices[i]);
139 while (*ptr != '\000')
147 * gtk_tree_path_new_root:
149 * Creates a new root #GtkTreePath. The string representation of this path is
152 * Return value: A new #GtkTreePath.
155 gtk_tree_path_new_root (void)
159 retval = gtk_tree_path_new ();
160 gtk_tree_path_append_index (retval, 0);
166 * gtk_tree_path_append_index:
167 * @path: A #GtkTreePath.
170 * Appends a new index to a path. As a result, the depth of the path is
174 gtk_tree_path_append_index (GtkTreePath *path,
179 g_return_if_fail (path != NULL);
180 g_return_if_fail (index >= 0);
183 path->indices = g_realloc (path->indices, path->depth * sizeof(gint));
184 path->indices[path->depth - 1] = index;
188 * gtk_tree_path_prepend_index:
189 * @path: A #GtkTreePath.
192 * Prepends a new index to a path. As a result, the depth of the path is
196 gtk_tree_path_prepend_index (GtkTreePath *path,
199 gint *new_indices = g_new (gint, ++path->depth);
200 if (path->indices == NULL)
202 path->indices = new_indices;
203 path->indices[0] = index;
206 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
207 g_free (path->indices);
208 path->indices = new_indices;
209 path->indices[0] = index;
213 * gtk_tree_path_get_depth:
214 * @path: A #GtkTreePath.
216 * Returns the current depth of @path.
218 * Return value: The depth of @path
221 gtk_tree_path_get_depth (GtkTreePath *path)
223 g_return_val_if_fail (path != NULL, 0);
229 * gtk_tree_path_get_indices:
230 * @path: A #GtkTreePath.
232 * Returns the current indices of @path. This is an array of integers, each
233 * representing a node in a tree.
235 * Return value: The current indices, or NULL.
238 gtk_tree_path_get_indices (GtkTreePath *path)
240 g_return_val_if_fail (path != NULL, NULL);
242 return path->indices;
246 * gtk_tree_path_free:
247 * @path: A #GtkTreePath.
252 gtk_tree_path_free (GtkTreePath *path)
254 g_return_if_fail (path != NULL);
256 g_free (path->indices);
261 * gtk_tree_path_copy:
262 * @path: A #GtkTreePath.
264 * Creates a new #GtkTreePath as a copy of @path.
266 * Return value: A new #GtkTreePath.
269 gtk_tree_path_copy (GtkTreePath *path)
273 g_return_val_if_fail (path != NULL, NULL);
275 retval = g_new (GtkTreePath, 1);
276 retval->depth = path->depth;
277 retval->indices = g_new (gint, path->depth);
278 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
283 * gtk_tree_path_compare:
284 * @a: A #GtkTreePath.
285 * @b: A #GtkTreePath to compare with.
287 * Compares two paths. If @a appears before @b in a tree, then 1, is returned.
288 * If @b appears before @a, then -1 is returned. If the two nodes are equal,
289 * then 0 is returned.
291 * Return value: The relative positions of @a and @b
294 gtk_tree_path_compare (const GtkTreePath *a,
295 const GtkTreePath *b)
299 g_return_val_if_fail (a != NULL, 0);
300 g_return_val_if_fail (b != NULL, 0);
301 g_return_val_if_fail (a->depth > 0, 0);
302 g_return_val_if_fail (b->depth > 0, 0);
306 if (a->indices[p] == b->indices[q])
308 return (a->indices[p] < b->indices[q]?1:-1);
310 while (++p < a->depth && ++q < b->depth);
311 if (a->depth == b->depth)
313 return (a->depth < b->depth?1:-1);
317 * gtk_tree_path_is_ancestor:
318 * @path: a #GtkTreePath
319 * @descendant: another #GtkTreePath
323 * Return value: %TRUE if @descendant is contained inside @path
326 gtk_tree_path_is_ancestor (GtkTreePath *path,
327 GtkTreePath *descendant)
331 g_return_val_if_fail (path != NULL, FALSE);
332 g_return_val_if_fail (descendant != NULL, FALSE);
334 /* can't be an ancestor if we're deeper */
335 if (path->depth >= descendant->depth)
339 while (i < path->depth)
341 if (path->indices[i] != descendant->indices[i])
350 * gtk_tree_path_is_descendant:
351 * @path: a #GtkTreePath
352 * @ancestor: another #GtkTreePath
356 * Return value: %TRUE if @ancestor contains @path somewhere below it
359 gtk_tree_path_is_descendant (GtkTreePath *path,
360 GtkTreePath *ancestor)
364 g_return_val_if_fail (path != NULL, FALSE);
365 g_return_val_if_fail (ancestor != NULL, FALSE);
367 /* can't be a descendant if we're shallower in the tree */
368 if (path->depth <= ancestor->depth)
372 while (i < ancestor->depth)
374 if (path->indices[i] != ancestor->indices[i])
384 * gtk_tree_path_next:
385 * @path: A #GtkTreePath.
387 * Moves the @path to point to the next node at the current depth.
390 gtk_tree_path_next (GtkTreePath *path)
392 g_return_if_fail (path != NULL);
393 g_return_if_fail (path->depth > 0);
395 path->indices[path->depth - 1] ++;
399 * gtk_tree_path_prev:
400 * @path: A #GtkTreePath.
402 * Moves the @path to point to the previous node at the current depth, if it exists.
404 * Return value: TRUE if @path has a previous node, and the move was made.
407 gtk_tree_path_prev (GtkTreePath *path)
409 g_return_val_if_fail (path != NULL, FALSE);
411 if (path->indices[path->depth - 1] == 0)
414 path->indices[path->depth - 1] -= 1;
421 * @path: A #GtkTreePath.
423 * Moves the @path to point to it's parent node, if it has a parent.
425 * Return value: TRUE if @path has a parent, and the move was made.
428 gtk_tree_path_up (GtkTreePath *path)
430 g_return_val_if_fail (path != NULL, FALSE);
432 if (path->depth == 1)
441 * gtk_tree_path_down:
442 * @path: A #GtkTreePath.
444 * Moves @path to point to the first child of the current path.
447 gtk_tree_path_down (GtkTreePath *path)
449 g_return_if_fail (path != NULL);
451 gtk_tree_path_append_index (path, 0);
454 struct _GtkTreeRowReference
460 typedef struct _RowRefList RowRefList;
468 release_row_references (gpointer data)
470 RowRefList *refs = data;
471 GSList *tmp_list = NULL;
473 tmp_list = refs->list;
474 while (tmp_list != NULL)
476 GtkTreeRowReference *reference = tmp_list->data;
478 reference->model = NULL;
480 /* we don't free the reference, users are responsible for that. */
482 tmp_list = g_slist_next (tmp_list);
485 g_slist_free (refs->list);
490 inserted_callback (GtkTreeModel *tree_model,
495 RowRefList *refs = data;
498 /* This function corrects the path stored in the reference to
499 * account for an insertion. Note that it's called _after_ the insertion
500 * with the path to the newly-inserted row. Which means that
501 * the inserted path is in a different "coordinate system" than
502 * the old path (e.g. if the inserted path was just before the old path,
503 * then inserted path and old path will be the same, and old path must be
507 tmp_list = refs->list;
509 while (tmp_list != NULL)
511 GtkTreeRowReference *reference = tmp_list->data;
513 /* if reference->path == NULL then the reference was already
519 gint depth = gtk_tree_path_get_depth (path);
520 gint ref_depth = gtk_tree_path_get_depth (reference->path);
522 if (ref_depth >= depth)
524 gint *indices = gtk_tree_path_get_indices (path);
525 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
528 /* This is the depth that might affect us. */
531 if (indices[i] <= ref_indices[i])
536 tmp_list = g_slist_next (tmp_list);
541 deleted_callback (GtkTreeModel *tree_model,
545 RowRefList *refs = data;
548 /* This function corrects the path stored in the reference to
549 * account for an deletion. Note that it's called _after_ the
550 * deletion with the old path of the just-deleted row. Which means
551 * that the deleted path is the same now-defunct "coordinate system"
552 * as the path saved in the reference, which is what we want to fix.
554 * Note that this is different from the situation in "inserted," so
555 * while you might think you can cut-and-paste between these
556 * functions, it's not going to work. ;-)
559 tmp_list = refs->list;
561 while (tmp_list != NULL)
563 GtkTreeRowReference *reference = tmp_list->data;
565 /* if reference->path == NULL then the reference was already
571 gint depth = gtk_tree_path_get_depth (path);
572 gint ref_depth = gtk_tree_path_get_depth (reference->path);
574 if (ref_depth >= depth)
576 /* Need to adjust path upward */
577 gint *indices = gtk_tree_path_get_indices (path);
578 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
582 if (indices[i] < ref_indices[i])
584 else if (indices[i] == ref_indices[i])
586 /* the referenced node itself, or its parent, was
587 * deleted, mark invalid
590 gtk_tree_path_free (reference->path);
591 reference->path = NULL;
596 tmp_list = g_slist_next (tmp_list);
601 reordered_callback (GtkTreeModel *tree_model,
611 connect_ref_callbacks (GtkTreeModel *model,
614 g_signal_connect_data (G_OBJECT (model),
616 (GCallback) inserted_callback,
622 g_signal_connect_data (G_OBJECT (model),
624 (GCallback) deleted_callback,
632 g_signal_connect_data (G_OBJECT (model),
634 (GCallback) reordered_callback,
643 disconnect_ref_callbacks (GtkTreeModel *model,
646 g_signal_handlers_disconnect_matched (G_OBJECT (model),
656 gtk_tree_row_reference_new (GtkTreeModel *model,
659 GtkTreeRowReference *reference;
662 reference = g_new (GtkTreeRowReference, 1);
664 reference->model = model;
665 reference->path = gtk_tree_path_copy (path);
667 refs = g_object_get_data (G_OBJECT (model),
668 "gtk-tree-row-refs");
672 refs = g_new (RowRefList, 1);
674 connect_ref_callbacks (model, refs);
675 g_object_set_data_full (G_OBJECT (model),
678 release_row_references);
681 refs->list = g_slist_prepend (refs->list, reference);
687 gtk_tree_row_reference_get_path (GtkTreeRowReference *reference)
689 g_return_val_if_fail (reference != NULL, NULL);
691 if (reference->model == NULL)
694 if (reference->path == NULL)
697 return gtk_tree_path_copy (reference->path);
701 gtk_tree_row_reference_free (GtkTreeRowReference *reference)
705 g_return_if_fail (reference != NULL);
707 if (reference->model)
709 refs = g_object_get_data (G_OBJECT (reference->model),
710 "gtk-tree-row-refs");
714 g_warning (G_STRLOC": bad row reference, model has no outstanding row references");
718 refs->list = g_slist_remove (refs->list, reference);
720 if (refs->list == NULL)
722 disconnect_ref_callbacks (reference->model, refs);
723 g_object_set_data (G_OBJECT (reference->model),
730 gtk_tree_path_free (reference->path);
736 * gtk_tree_iter_copy:
737 * @iter: A #GtkTreeIter.
739 * Creates a dynamically allocated tree iterator as a copy of @iter. This
740 * function is not intended for use in applications, because you can just copy
741 * the structs by value (GtkTreeIter new_iter = iter;). You
742 * must free this iter with gtk_tree_iter_free ().
744 * Return value: a newly allocated copy of @iter.
747 gtk_tree_iter_copy (GtkTreeIter *iter)
751 g_return_val_if_fail (iter != NULL, NULL);
753 retval = g_new (GtkTreeIter, 1);
760 * gtk_tree_iter_free:
761 * @iter: A dynamically allocated tree iterator.
763 * Free an iterator that has been allocated on the heap. This function is
764 * mainly used for language bindings.
767 gtk_tree_iter_free (GtkTreeIter *iter)
769 g_return_if_fail (iter != NULL);
775 * gtk_tree_model_get_flags:
776 * @tree_model: A #GtkTreeModel.
778 * Returns a set of flags supported by this interface. The flags are a bitwise
779 * combination of #GtkTreeModelFlags. It is expected that the flags supported
780 * do not change for an interface.
782 * Return value: The flags supported by this interface.
785 gtk_tree_model_get_flags (GtkTreeModel *tree_model)
787 g_return_val_if_fail (tree_model != NULL, 0);
788 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
790 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags)
791 return (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags) (tree_model);
797 * gtk_tree_model_get_n_columns:
798 * @tree_model: A #GtkTreeModel.
800 * Returns the number of columns supported by the #tree_model
802 * Return value: The number of columns.
805 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
807 g_return_val_if_fail (tree_model != NULL, 0);
808 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
809 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
811 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
815 * gtk_tree_model_get_column_type:
816 * @tree_model: A #GtkTreeModel.
817 * @index: The column index.
819 * Returns the type of the column.
821 * Return value: The type of the column.
824 gtk_tree_model_get_column_type (GtkTreeModel *tree_model,
827 g_return_val_if_fail (tree_model != NULL, G_TYPE_INVALID);
828 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), G_TYPE_INVALID);
829 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type != NULL, G_TYPE_INVALID);
830 g_return_val_if_fail (index >= 0, G_TYPE_INVALID);
832 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type) (tree_model, index);
836 * gtk_tree_model_get_iter:
837 * @tree_model: A #GtkTreeModel.
838 * @iter: The uninitialized #GtkTreeIter.
839 * @path: The #GtkTreePath.
841 * Sets @iter to a valid iterator pointing to @path. If the model does not
842 * provide an implementation of this function, it is implemented in terms of
843 * @gtk_tree_model_iter_nth_child.
845 * Return value: TRUE, if @iter was set.
848 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
856 g_return_val_if_fail (tree_model != NULL, FALSE);
857 g_return_val_if_fail (iter != NULL, FALSE);
858 g_return_val_if_fail (path != NULL, FALSE);
859 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
861 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL)
862 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
864 indices = gtk_tree_path_get_indices (path);
865 depth = gtk_tree_path_get_depth (path);
867 g_return_val_if_fail (depth > 0, FALSE);
869 if (! gtk_tree_model_iter_nth_child (tree_model, iter, NULL, indices[0]))
872 for (i = 1; i < depth; i++)
875 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
883 * gtk_tree_model_get_first:
884 * @tree_model: a #GtkTreeModel
885 * @iter: iterator to initialize
887 * Initialized @iter with the first iterator in the tree (the one at the
888 * root path) and returns %TRUE, or returns %FALSE if there are no
889 * iterable locations in the model (i.e. the tree is empty).
891 * Return value: %TRUE if @iter was initialized
894 gtk_tree_model_get_first (GtkTreeModel *tree_model,
900 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
901 g_return_val_if_fail (iter != NULL, FALSE);
903 path = gtk_tree_path_new_root ();
905 retval = gtk_tree_model_get_iter (tree_model, iter, path);
907 gtk_tree_path_free (path);
913 * gtk_tree_model_get_path:
914 * @tree_model: A #GtkTreeModel.
915 * @iter: The #GtkTreeIter.
917 * Returns a newly created #GtkTreePath referenced by @iter. This path should
918 * be freed with #gtk_tree_path_free.
920 * Return value: a newly created #GtkTreePath.
923 gtk_tree_model_get_path (GtkTreeModel *tree_model,
926 g_return_val_if_fail (tree_model != NULL, NULL);
927 g_return_val_if_fail (iter != NULL, NULL);
928 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
929 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
931 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
935 * gtk_tree_model_get_value:
936 * @tree_model: A #GtkTreeModel.
937 * @iter: The #GtkTreeIter.
938 * @column: The column to lookup the value at.
939 * @value: An empty #GValue to set.
941 * Sets initializes and sets @value to that at @column. When done with value,
942 * #g_value_unset needs to be called on it.
945 gtk_tree_model_get_value (GtkTreeModel *tree_model,
950 g_return_if_fail (tree_model != NULL);
951 g_return_if_fail (iter != NULL);
952 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
953 g_return_if_fail (value != NULL);
954 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
956 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
960 * gtk_tree_model_iter_next:
961 * @tree_model: A #GtkTreeModel.
962 * @iter: The #GtkTreeIter.
964 * Sets @iter to point to the node following it at the current level. If there
965 * is no next @iter, FALSE is returned and @iter is set to be invalid.
967 * Return value: TRUE if @iter has been changed to the next node.
970 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
973 g_return_val_if_fail (tree_model != NULL, FALSE);
974 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
975 g_return_val_if_fail (iter != NULL, FALSE);
976 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
978 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
982 * gtk_tree_model_iter_children:
983 * @tree_model: A #GtkTreeModel.
984 * @iter: The new #GtkTreeIter to be set to the child.
985 * @parent: The #GtkTreeIter.
987 * Sets @iter to point to the first child of @parent. If @parent has no children,
988 * FALSE is returned and @iter is set to be invalid. @parent will remain a valid
989 * node after this function has been called.
991 * Return value: TRUE, if @child has been set to the first child.
994 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
998 g_return_val_if_fail (tree_model != NULL, FALSE);
999 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1000 g_return_val_if_fail (iter != NULL, FALSE);
1001 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
1003 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
1007 * gtk_tree_model_iter_has_child:
1008 * @tree_model: A #GtkTreeModel.
1009 * @iter: The #GtkTreeIter to test for children.
1011 * Returns TRUE if @iter has children, FALSE otherwise.
1013 * Return value: TRUE if @iter has children.
1016 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
1019 g_return_val_if_fail (tree_model != NULL, FALSE);
1020 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1021 g_return_val_if_fail (iter != NULL, FALSE);
1022 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
1024 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
1028 * gtk_tree_model_iter_n_children:
1029 * @tree_model: A #GtkTreeModel.
1030 * @iter: The #GtkTreeIter, or NULL.
1032 * Returns the number of children that @iter has. If @iter is NULL, then the
1033 * number of toplevel nodes is returned.
1035 * Return value: The number of children of @iter.
1038 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
1041 g_return_val_if_fail (tree_model != NULL, 0);
1042 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
1043 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
1045 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
1049 * gtk_tree_model_iter_nth_child:
1050 * @tree_model: A #GtkTreeModel.
1051 * @iter: The #GtkTreeIter to set to the nth child.
1052 * @parent: The #GtkTreeIter to get the child from, or NULL.
1053 * @n: Then index of the desired child.
1055 * Sets @iter to be the child of @parent, using the given index. The first
1056 * index is 0. If the index is too big, or @parent has no children, @iter is
1057 * set to an invalid iterator and FALSE is returned. @parent will remain a
1058 * valid node after this function has been called. If @parent is NULL, then the
1059 * root node is assumed.
1061 * Return value: TRUE, if @parent has an nth child.
1064 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
1066 GtkTreeIter *parent,
1069 g_return_val_if_fail (tree_model != NULL, FALSE);
1070 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1071 g_return_val_if_fail (iter != NULL, FALSE);
1072 g_return_val_if_fail (n >= 0, FALSE);
1073 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
1075 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
1079 * gtk_tree_model_iter_parent:
1080 * @tree_model: A #GtkTreeModel
1081 * @iter: The new #GtkTreeIter to set to the parent.
1082 * @child: The #GtkTreeIter.
1084 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
1085 * doesn't have a parent, then @iter is set to an invalid iterator and FALSE
1086 * is returned. @child will remain a valid node after this function has been
1089 * Return value: TRUE, if @iter is set to the parent of @child.
1092 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
1096 g_return_val_if_fail (tree_model != NULL, FALSE);
1097 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1098 g_return_val_if_fail (iter != NULL, FALSE);
1099 g_return_val_if_fail (child != NULL, FALSE);
1100 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
1102 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);
1105 /* FIXME explain what the method is supposed to do! */
1107 * gtk_tree_model_ref_iter:
1108 * @tree_model: A #GtkTreeModel.
1109 * @iter: The #GtkTreeIter.
1111 * Ref's the iter. This is an optional method for models to implement. To be
1112 * more specific, models may ignore this call as it exists primarily for
1113 * performance reasons.
1116 gtk_tree_model_ref_iter (GtkTreeModel *tree_model,
1119 g_return_if_fail (tree_model != NULL);
1120 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1122 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter)
1123 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter) (tree_model, iter);
1126 /* FIXME explain what the method is supposed to do! */
1128 * gtk_tree_model_unref_iter:
1129 * @tree_model: A #GtkTreeModel.
1130 * @iter: The #GtkTreeIter.
1132 * Unref's the iter. This is an optional method for models to implement. To be
1133 * more specific, models may ignore this call as it exists primarily for
1134 * performance reasons.
1137 gtk_tree_model_unref_iter (GtkTreeModel *tree_model,
1140 g_return_if_fail (tree_model != NULL);
1141 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1143 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter)
1144 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter) (tree_model, iter);