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/gobject.h>
25 #include <gobject/gvaluecollector.h>
26 #include "gtkmarshal.h"
27 #include "gtktreemodel.h"
35 static void gtk_tree_model_base_init (gpointer g_class);
39 gtk_tree_model_get_type (void)
41 static GtkType tree_model_type = 0;
45 static const GTypeInfo tree_model_info =
47 sizeof (GtkTreeModelIface), /* class_size */
48 gtk_tree_model_base_init, /* base_init */
49 NULL, /* base_finalize */
51 NULL, /* class_finalize */
52 NULL, /* class_data */
58 tree_model_type = g_type_register_static (G_TYPE_INTERFACE, "GtkTreeModel", &tree_model_info, 0);
61 return tree_model_type;
66 gtk_tree_model_base_init (gpointer g_class)
68 static gboolean initted = FALSE;
72 g_signal_newc ("changed",
75 G_STRUCT_OFFSET (GtkTreeModelIface, changed),
77 gtk_marshal_VOID__BOXED_BOXED,
82 g_signal_newc ("inserted",
85 G_STRUCT_OFFSET (GtkTreeModelIface, inserted),
87 gtk_marshal_VOID__BOXED_BOXED,
91 g_signal_newc ("child_toggled",
94 G_STRUCT_OFFSET (GtkTreeModelIface, child_toggled),
96 gtk_marshal_VOID__BOXED_BOXED,
100 g_signal_newc ("deleted",
103 G_STRUCT_OFFSET (GtkTreeModelIface, deleted),
105 gtk_marshal_VOID__BOXED_BOXED,
117 * Creates a new #GtkTreePath.
119 * Return value: A newly created #GtkTreePath.
121 /* GtkTreePath Operations */
123 gtk_tree_path_new (void)
126 retval = (GtkTreePath *) g_new (GtkTreePath, 1);
128 retval->indices = NULL;
134 * gtk_tree_path_new_from_string:
135 * @path: The string representation of a path.
137 * Creates a new #GtkTreePath initialized to @path. @path is expected
138 * to be a colon separated list of numbers. For example, the string
139 * "10:4:0" would create a path of depth 3 pointing to the 11th child
140 * of the root node, the 5th child of that 11th child, and the 1st
141 * child of that 5th child.
143 * Return value: A newly created #GtkTreePath.
146 gtk_tree_path_new_from_string (gchar *path)
152 g_return_val_if_fail (path != NULL, gtk_tree_path_new ());
154 retval = gtk_tree_path_new ();
158 i = strtol (path, &ptr, 10);
159 gtk_tree_path_append_index (retval, i);
163 /* FIXME: should we error out if this is not a ':', or should we be tolerant? */
171 * gtk_tree_path_to_string:
172 * @path: A #GtkTreePath
174 * Generates a string representation of the path. This string is a ':'
175 * separated list of numbers. For example, "4:10:0:3" would be an acceptable return value for this string.
177 * Return value: A newly allocated string. Must be freed with #g_free.
180 gtk_tree_path_to_string (GtkTreePath *path)
185 if (path->depth == 0)
188 ptr = retval = (gchar *) g_new0 (char *, path->depth*8);
189 sprintf (retval, "%d", path->indices[0]);
190 while (*ptr != '\000')
193 for (i = 1; i < path->depth; i++)
195 sprintf (ptr, ":%d", path->indices[i]);
196 while (*ptr != '\000')
204 * gtk_tree_path_new_root:
206 * Creates a new root #GtkTreePath. The string representation of this path is
209 * Return value: A new #GtkTreePath.
212 gtk_tree_path_new_root (void)
216 retval = gtk_tree_path_new ();
217 gtk_tree_path_append_index (retval, 0);
223 * gtk_tree_path_append_index:
224 * @path: A #GtkTreePath.
227 * Appends a new index to a path. As a result, the depth of the path is
231 gtk_tree_path_append_index (GtkTreePath *path,
234 g_return_if_fail (path != NULL);
235 g_return_if_fail (index >= 0);
238 path->indices = g_realloc (path->indices, path->depth * sizeof(gint));
239 path->indices[path->depth - 1] = index;
243 * gtk_tree_path_prepend_index:
244 * @path: A #GtkTreePath.
247 * Prepends a new index to a path. As a result, the depth of the path is
251 gtk_tree_path_prepend_index (GtkTreePath *path,
254 gint *new_indices = g_new (gint, ++path->depth);
255 if (path->indices == NULL)
257 path->indices = new_indices;
258 path->indices[0] = index;
261 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
262 g_free (path->indices);
263 path->indices = new_indices;
264 path->indices[0] = index;
268 * gtk_tree_path_get_depth:
269 * @path: A #GtkTreePath.
271 * Returns the current depth of @path.
273 * Return value: The depth of @path
276 gtk_tree_path_get_depth (GtkTreePath *path)
278 g_return_val_if_fail (path != NULL, 0);
284 * gtk_tree_path_get_indices:
285 * @path: A #GtkTreePath.
287 * Returns the current indices of @path. This is an array of integers, each
288 * representing a node in a tree.
290 * Return value: The current indices, or NULL.
293 gtk_tree_path_get_indices (GtkTreePath *path)
295 g_return_val_if_fail (path != NULL, NULL);
297 return path->indices;
301 * gtk_tree_path_free:
302 * @path: A #GtkTreePath.
307 gtk_tree_path_free (GtkTreePath *path)
309 g_return_if_fail (path != NULL);
311 g_free (path->indices);
316 * gtk_tree_path_copy:
317 * @path: A #GtkTreePath.
319 * Creates a new #GtkTreePath as a copy of @path.
321 * Return value: A new #GtkTreePath.
324 gtk_tree_path_copy (GtkTreePath *path)
328 g_return_val_if_fail (path != NULL, NULL);
330 retval = g_new (GtkTreePath, 1);
331 retval->depth = path->depth;
332 retval->indices = g_new (gint, path->depth);
333 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
338 * gtk_tree_path_compare:
339 * @a: A #GtkTreePath.
340 * @b: A #GtkTreePath to compare with.
342 * Compares two paths. If @a appears before @b in a tree, then 1, is returned.
343 * If @b appears before @a, then -1 is returned. If the two nodes are equal,
344 * then 0 is returned.
346 * Return value: The relative positions of @a and @b
349 gtk_tree_path_compare (const GtkTreePath *a,
350 const GtkTreePath *b)
354 g_return_val_if_fail (a != NULL, 0);
355 g_return_val_if_fail (b != NULL, 0);
356 g_return_val_if_fail (a->depth > 0, 0);
357 g_return_val_if_fail (b->depth > 0, 0);
361 if (a->indices[p] == b->indices[q])
363 return (a->indices[p] < b->indices[q]?1:-1);
365 while (++p < a->depth && ++q < b->depth);
366 if (a->depth == b->depth)
368 return (a->depth < b->depth?1:-1);
372 * gtk_tree_path_is_ancestor:
373 * @path: a #GtkTreePath
374 * @descendant: another #GtkTreePath
378 * Return value: %TRUE if @descendant is contained inside @path
381 gtk_tree_path_is_ancestor (GtkTreePath *path,
382 GtkTreePath *descendant)
386 g_return_val_if_fail (path != NULL, FALSE);
387 g_return_val_if_fail (descendant != NULL, FALSE);
389 /* can't be an ancestor if we're deeper */
390 if (path->depth >= descendant->depth)
394 while (i < path->depth)
396 if (path->indices[i] != descendant->indices[i])
405 * gtk_tree_path_is_descendant:
406 * @path: a #GtkTreePath
407 * @ancestor: another #GtkTreePath
411 * Return value: %TRUE if @ancestor contains @path somewhere below it
414 gtk_tree_path_is_descendant (GtkTreePath *path,
415 GtkTreePath *ancestor)
419 g_return_val_if_fail (path != NULL, FALSE);
420 g_return_val_if_fail (ancestor != NULL, FALSE);
422 /* can't be a descendant if we're shallower in the tree */
423 if (path->depth <= ancestor->depth)
427 while (i < ancestor->depth)
429 if (path->indices[i] != ancestor->indices[i])
439 * gtk_tree_path_next:
440 * @path: A #GtkTreePath.
442 * Moves the @path to point to the next node at the current depth.
445 gtk_tree_path_next (GtkTreePath *path)
447 g_return_if_fail (path != NULL);
448 g_return_if_fail (path->depth > 0);
450 path->indices[path->depth - 1] ++;
454 * gtk_tree_path_prev:
455 * @path: A #GtkTreePath.
457 * Moves the @path to point to the previous node at the current depth, if it exists.
459 * Return value: TRUE if @path has a previous node, and the move was made.
462 gtk_tree_path_prev (GtkTreePath *path)
464 g_return_val_if_fail (path != NULL, FALSE);
466 if (path->indices[path->depth - 1] == 0)
469 path->indices[path->depth - 1] -= 1;
476 * @path: A #GtkTreePath.
478 * Moves the @path to point to it's parent node, if it has a parent.
480 * Return value: TRUE if @path has a parent, and the move was made.
483 gtk_tree_path_up (GtkTreePath *path)
485 g_return_val_if_fail (path != NULL, FALSE);
487 if (path->depth == 1)
496 * gtk_tree_path_down:
497 * @path: A #GtkTreePath.
499 * Moves @path to point to the first child of the current path.
502 gtk_tree_path_down (GtkTreePath *path)
504 g_return_if_fail (path != NULL);
506 gtk_tree_path_append_index (path, 0);
509 struct _GtkTreeRowReference
515 typedef struct _RowRefList RowRefList;
523 release_row_references (gpointer data)
525 RowRefList *refs = data;
526 GSList *tmp_list = NULL;
528 tmp_list = refs->list;
529 while (tmp_list != NULL)
531 GtkTreeRowReference *reference = tmp_list->data;
533 reference->model = NULL;
535 /* we don't free the reference, users are responsible for that. */
537 tmp_list = g_slist_next (tmp_list);
540 g_slist_free (refs->list);
545 inserted_callback (GtkTreeModel *tree_model,
550 RowRefList *refs = data;
553 /* This function corrects the path stored in the reference to
554 * account for an insertion. Note that it's called _after_ the insertion
555 * with the path to the newly-inserted row. Which means that
556 * the inserted path is in a different "coordinate system" than
557 * the old path (e.g. if the inserted path was just before the old path,
558 * then inserted path and old path will be the same, and old path must be
562 tmp_list = refs->list;
564 while (tmp_list != NULL)
566 GtkTreeRowReference *reference = tmp_list->data;
568 /* if reference->path == NULL then the reference was already
574 gint depth = gtk_tree_path_get_depth (path);
575 gint ref_depth = gtk_tree_path_get_depth (reference->path);
577 if (ref_depth >= depth)
579 gint *indices = gtk_tree_path_get_indices (path);
580 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
583 /* This is the depth that might affect us. */
586 if (indices[i] <= ref_indices[i])
591 tmp_list = g_slist_next (tmp_list);
596 deleted_callback (GtkTreeModel *tree_model,
600 RowRefList *refs = data;
603 /* This function corrects the path stored in the reference to
604 * account for an deletion. Note that it's called _after_ the
605 * deletion with the old path of the just-deleted row. Which means
606 * that the deleted path is the same now-defunct "coordinate system"
607 * as the path saved in the reference, which is what we want to fix.
609 * Note that this is different from the situation in "inserted," so
610 * while you might think you can cut-and-paste between these
611 * functions, it's not going to work. ;-)
614 tmp_list = refs->list;
616 while (tmp_list != NULL)
618 GtkTreeRowReference *reference = tmp_list->data;
620 /* if reference->path == NULL then the reference was already
626 gint depth = gtk_tree_path_get_depth (path);
627 gint ref_depth = gtk_tree_path_get_depth (reference->path);
629 if (ref_depth >= depth)
631 /* Need to adjust path upward */
632 gint *indices = gtk_tree_path_get_indices (path);
633 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
637 if (indices[i] < ref_indices[i])
639 else if (indices[i] == ref_indices[i])
641 /* the referenced node itself, or its parent, was
642 * deleted, mark invalid
645 gtk_tree_path_free (reference->path);
646 reference->path = NULL;
651 tmp_list = g_slist_next (tmp_list);
656 connect_ref_callbacks (GtkTreeModel *model,
659 g_signal_connect_data (G_OBJECT (model),
661 (GCallback) inserted_callback,
667 g_signal_connect_data (G_OBJECT (model),
669 (GCallback) deleted_callback,
677 g_signal_connect_data (G_OBJECT (model),
679 (GCallback) reorderedc_allback,
688 disconnect_ref_callbacks (GtkTreeModel *model,
691 g_signal_handlers_disconnect_matched (G_OBJECT (model),
701 gtk_tree_row_reference_new (GtkTreeModel *model,
704 GtkTreeRowReference *reference;
707 reference = g_new (GtkTreeRowReference, 1);
709 reference->model = model;
710 reference->path = gtk_tree_path_copy (path);
712 refs = g_object_get_data (G_OBJECT (model),
713 "gtk-tree-row-refs");
717 refs = g_new (RowRefList, 1);
719 connect_ref_callbacks (model, refs);
720 g_object_set_data_full (G_OBJECT (model),
723 release_row_references);
726 refs->list = g_slist_prepend (refs->list, reference);
732 gtk_tree_row_reference_get_path (GtkTreeRowReference *reference)
734 g_return_val_if_fail (reference != NULL, NULL);
736 if (reference->model == NULL)
739 if (reference->path == NULL)
742 return gtk_tree_path_copy (reference->path);
746 gtk_tree_row_reference_free (GtkTreeRowReference *reference)
750 g_return_if_fail (reference != NULL);
752 if (reference->model)
754 refs = g_object_get_data (G_OBJECT (reference->model),
755 "gtk-tree-row-refs");
759 g_warning (G_STRLOC": bad row reference, model has no outstanding row references");
763 refs->list = g_slist_remove (refs->list, reference);
765 if (refs->list == NULL)
767 disconnect_ref_callbacks (reference->model, refs);
768 g_object_set_data (G_OBJECT (reference->model),
775 gtk_tree_path_free (reference->path);
781 * gtk_tree_iter_copy:
782 * @iter: A #GtkTreeIter.
784 * Creates a dynamically allocated tree iterator as a copy of @iter. This
785 * function is not intended for use in applications, because you can just copy
786 * the structs by value (GtkTreeIter new_iter = iter;). You
787 * must free this iter with gtk_tree_iter_free ().
789 * Return value: a newly allocated copy of @iter.
792 gtk_tree_iter_copy (GtkTreeIter *iter)
796 g_return_val_if_fail (iter != NULL, NULL);
798 retval = g_new (GtkTreeIter, 1);
805 * gtk_tree_iter_free:
806 * @iter: A dynamically allocated tree iterator.
808 * Free an iterator that has been allocated on the heap. This function is
809 * mainly used for language bindings.
812 gtk_tree_iter_free (GtkTreeIter *iter)
814 g_return_if_fail (iter != NULL);
820 * gtk_tree_model_get_flags:
821 * @tree_model: A #GtkTreeModel.
823 * Returns a set of flags supported by this interface. The flags are a bitwise
824 * combination of #GtkTreeModelFlags. It is expected that the flags supported
825 * do not change for an interface.
827 * Return value: The flags supported by this interface.
830 gtk_tree_model_get_flags (GtkTreeModel *tree_model)
832 g_return_val_if_fail (tree_model != NULL, 0);
833 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
835 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags)
836 return (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags) (tree_model);
842 * gtk_tree_model_get_n_columns:
843 * @tree_model: A #GtkTreeModel.
845 * Returns the number of columns supported by the #tree_model
847 * Return value: The number of columns.
850 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
852 g_return_val_if_fail (tree_model != NULL, 0);
853 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
854 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
856 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
860 * gtk_tree_model_get_column_type:
861 * @tree_model: A #GtkTreeModel.
862 * @index: The column index.
864 * Returns the type of the column.
866 * Return value: The type of the column.
869 gtk_tree_model_get_column_type (GtkTreeModel *tree_model,
872 g_return_val_if_fail (tree_model != NULL, G_TYPE_INVALID);
873 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), G_TYPE_INVALID);
874 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type != NULL, G_TYPE_INVALID);
875 g_return_val_if_fail (index >= 0, G_TYPE_INVALID);
877 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type) (tree_model, index);
881 * gtk_tree_model_get_iter:
882 * @tree_model: A #GtkTreeModel.
883 * @iter: The uninitialized #GtkTreeIter.
884 * @path: The #GtkTreePath.
886 * Sets @iter to a valid iterator pointing to @path. If the model does not
887 * provide an implementation of this function, it is implemented in terms of
888 * @gtk_tree_model_iter_nth_child.
890 * Return value: TRUE, if @iter was set.
893 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
901 g_return_val_if_fail (tree_model != NULL, FALSE);
902 g_return_val_if_fail (iter != NULL, FALSE);
903 g_return_val_if_fail (path != NULL, FALSE);
904 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
906 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL)
907 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
909 indices = gtk_tree_path_get_indices (path);
910 depth = gtk_tree_path_get_depth (path);
912 g_return_val_if_fail (depth > 0, FALSE);
914 if (! gtk_tree_model_iter_nth_child (tree_model, iter, NULL, indices[0]))
917 for (i = 1; i < depth; i++)
920 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
928 * gtk_tree_model_get_first:
929 * @tree_model: a #GtkTreeModel
930 * @iter: iterator to initialize
932 * Initialized @iter with the first iterator in the tree (the one at the
933 * root path) and returns %TRUE, or returns %FALSE if there are no
934 * iterable locations in the model (i.e. the tree is empty).
936 * Return value: %TRUE if @iter was initialized
939 gtk_tree_model_get_first (GtkTreeModel *tree_model,
945 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
946 g_return_val_if_fail (iter != NULL, FALSE);
948 path = gtk_tree_path_new_root ();
950 retval = gtk_tree_model_get_iter (tree_model, iter, path);
952 gtk_tree_path_free (path);
958 * gtk_tree_model_get_path:
959 * @tree_model: A #GtkTreeModel.
960 * @iter: The #GtkTreeIter.
962 * Returns a newly created #GtkTreePath referenced by @iter. This path should
963 * be freed with #gtk_tree_path_free.
965 * Return value: a newly created #GtkTreePath.
968 gtk_tree_model_get_path (GtkTreeModel *tree_model,
971 g_return_val_if_fail (tree_model != NULL, NULL);
972 g_return_val_if_fail (iter != NULL, NULL);
973 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
974 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
976 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
980 * gtk_tree_model_get_value:
981 * @tree_model: A #GtkTreeModel.
982 * @iter: The #GtkTreeIter.
983 * @column: The column to lookup the value at.
984 * @value: An empty #GValue to set.
986 * Sets initializes and sets @value to that at @column. When done with value,
987 * #g_value_unset needs to be called on it.
990 gtk_tree_model_get_value (GtkTreeModel *tree_model,
995 g_return_if_fail (tree_model != NULL);
996 g_return_if_fail (iter != NULL);
997 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
998 g_return_if_fail (value != NULL);
999 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
1001 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
1005 * gtk_tree_model_iter_next:
1006 * @tree_model: A #GtkTreeModel.
1007 * @iter: The #GtkTreeIter.
1009 * Sets @iter to point to the node following it at the current level. If there
1010 * is no next @iter, FALSE is returned and @iter is set to be invalid.
1012 * Return value: TRUE if @iter has been changed to the next node.
1015 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
1018 g_return_val_if_fail (tree_model != NULL, FALSE);
1019 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1020 g_return_val_if_fail (iter != NULL, FALSE);
1021 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
1023 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
1027 * gtk_tree_model_iter_children:
1028 * @tree_model: A #GtkTreeModel.
1029 * @iter: The new #GtkTreeIter to be set to the child.
1030 * @parent: The #GtkTreeIter.
1032 * Sets @iter to point to the first child of @parent. If @parent has no children,
1033 * FALSE is returned and @iter is set to be invalid. @parent will remain a valid
1034 * node after this function has been called.
1036 * Return value: TRUE, if @child has been set to the first child.
1039 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
1041 GtkTreeIter *parent)
1043 g_return_val_if_fail (tree_model != NULL, FALSE);
1044 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1045 g_return_val_if_fail (iter != NULL, FALSE);
1046 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
1048 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
1052 * gtk_tree_model_iter_has_child:
1053 * @tree_model: A #GtkTreeModel.
1054 * @iter: The #GtkTreeIter to test for children.
1056 * Returns TRUE if @iter has children, FALSE otherwise.
1058 * Return value: TRUE if @iter has children.
1061 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
1064 g_return_val_if_fail (tree_model != NULL, FALSE);
1065 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1066 g_return_val_if_fail (iter != NULL, FALSE);
1067 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
1069 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
1073 * gtk_tree_model_iter_n_children:
1074 * @tree_model: A #GtkTreeModel.
1075 * @iter: The #GtkTreeIter, or NULL.
1077 * Returns the number of children that @iter has. If @iter is NULL, then the
1078 * number of toplevel nodes is returned.
1080 * Return value: The number of children of @iter.
1083 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
1086 g_return_val_if_fail (tree_model != NULL, 0);
1087 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
1088 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
1090 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
1094 * gtk_tree_model_iter_nth_child:
1095 * @tree_model: A #GtkTreeModel.
1096 * @iter: The #GtkTreeIter to set to the nth child.
1097 * @parent: The #GtkTreeIter to get the child from, or NULL.
1098 * @n: Then index of the desired child.
1100 * Sets @iter to be the child of @parent, using the given index. The first
1101 * index is 0. If the index is too big, or @parent has no children, @iter is
1102 * set to an invalid iterator and FALSE is returned. @parent will remain a
1103 * valid node after this function has been called. If @parent is NULL, then the
1104 * root node is assumed.
1106 * Return value: TRUE, if @parent has an nth child.
1109 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
1111 GtkTreeIter *parent,
1114 g_return_val_if_fail (tree_model != NULL, FALSE);
1115 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1116 g_return_val_if_fail (iter != NULL, FALSE);
1117 g_return_val_if_fail (n >= 0, FALSE);
1118 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
1120 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
1124 * gtk_tree_model_iter_parent:
1125 * @tree_model: A #GtkTreeModel
1126 * @iter: The new #GtkTreeIter to set to the parent.
1127 * @child: The #GtkTreeIter.
1129 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
1130 * doesn't have a parent, then @iter is set to an invalid iterator and FALSE
1131 * is returned. @child will remain a valid node after this function has been
1134 * Return value: TRUE, if @iter is set to the parent of @child.
1137 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
1141 g_return_val_if_fail (tree_model != NULL, FALSE);
1142 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1143 g_return_val_if_fail (iter != NULL, FALSE);
1144 g_return_val_if_fail (child != NULL, FALSE);
1145 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
1147 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);
1150 /* FIXME explain what the method is supposed to do! */
1152 * gtk_tree_model_ref_iter:
1153 * @tree_model: A #GtkTreeModel.
1154 * @iter: The #GtkTreeIter.
1156 * Ref's the iter. This is an optional method for models to implement. To be
1157 * more specific, models may ignore this call as it exists primarily for
1158 * performance reasons.
1161 gtk_tree_model_ref_iter (GtkTreeModel *tree_model,
1164 g_return_if_fail (tree_model != NULL);
1165 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1167 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter)
1168 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter) (tree_model, iter);
1171 /* FIXME explain what the method is supposed to do! */
1173 * gtk_tree_model_unref_iter:
1174 * @tree_model: A #GtkTreeModel.
1175 * @iter: The #GtkTreeIter.
1177 * Unref's the iter. This is an optional method for models to implement. To be
1178 * more specific, models may ignore this call as it exists primarily for
1179 * performance reasons.
1182 gtk_tree_model_unref_iter (GtkTreeModel *tree_model,
1185 g_return_if_fail (tree_model != NULL);
1186 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1188 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter)
1189 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter) (tree_model, iter);
1193 * gtk_tree_model_get:
1194 * @tree_model: a #GtkTreeModel
1195 * @iter: a row in @tree_model
1196 * @Varargs: pairs of column number and value return locations, terminated by -1
1198 * Gets the value of one or more cells in the row referenced by @iter.
1199 * The variable argument list should contain integer column numbers,
1200 * each column number followed by a place to store the value being
1201 * retrieved. The list is terminated by a -1. For example, to get a
1202 * value from column 0 with type %G_TYPE_STRING, you would
1203 * write: gtk_tree_model_set (model, iter, 0, &place_string_here, -1),
1204 * where place_string_here is a gchar* to be filled with the string.
1205 * If appropriate, the returned values have to be freed or unreferenced.
1209 gtk_tree_model_get (GtkTreeModel *tree_model,
1215 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1217 va_start (var_args, iter);
1218 gtk_tree_model_get_valist (tree_model, iter, var_args);
1223 * gtk_tree_model_get_valist:
1224 * @tree_model: a #GtkTreeModel
1225 * @iter: a row in @tree_model
1226 * @var_args: va_list of column/return location pairs
1228 * See gtk_tree_model_get(), this version takes a va_list for
1229 * language bindings to use.
1233 gtk_tree_model_get_valist (GtkTreeModel *tree_model,
1239 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1241 column = va_arg (var_args, gint);
1243 while (column != -1)
1245 GValue value = { 0, };
1246 gchar *error = NULL;
1248 if (column >= gtk_tree_model_get_n_columns (tree_model))
1250 g_warning ("%s: Invalid column number %d accessed (remember to end your list of columns with a -1)", G_STRLOC, column);
1254 gtk_tree_model_get_value (GTK_TREE_MODEL (tree_model), iter, column, &value);
1256 G_VALUE_LCOPY (&value, var_args, 0, &error);
1259 g_warning ("%s: %s", G_STRLOC, error);
1262 /* we purposely leak the value here, it might not be
1263 * in a sane state if an error condition occoured
1268 g_value_unset (&value);
1270 column = va_arg (var_args, gint);