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,
81 g_signal_newc ("inserted",
84 G_STRUCT_OFFSET (GtkTreeModelIface, inserted),
86 gtk_marshal_VOID__BOXED_BOXED,
90 g_signal_newc ("child_toggled",
93 G_STRUCT_OFFSET (GtkTreeModelIface, child_toggled),
95 gtk_marshal_VOID__BOXED_BOXED,
99 g_signal_newc ("deleted",
102 G_STRUCT_OFFSET (GtkTreeModelIface, deleted),
104 gtk_marshal_VOID__BOXED,
114 * Creates a new #GtkTreePath.
116 * Return value: A newly created #GtkTreePath.
118 /* GtkTreePath Operations */
120 gtk_tree_path_new (void)
123 retval = (GtkTreePath *) g_new (GtkTreePath, 1);
125 retval->indices = NULL;
131 * gtk_tree_path_new_from_string:
132 * @path: The string representation of a path.
134 * Creates a new #GtkTreePath initialized to @path. @path is expected
135 * to be a colon separated list of numbers. For example, the string
136 * "10:4:0" would create a path of depth 3 pointing to the 11th child
137 * of the root node, the 5th child of that 11th child, and the 1st
138 * child of that 5th child.
140 * Return value: A newly created #GtkTreePath.
143 gtk_tree_path_new_from_string (gchar *path)
149 g_return_val_if_fail (path != NULL, gtk_tree_path_new ());
151 retval = gtk_tree_path_new ();
155 i = strtol (path, &ptr, 10);
156 gtk_tree_path_append_index (retval, i);
160 /* FIXME: should we error out if this is not a ':', or should we be tolerant? */
168 * gtk_tree_path_to_string:
169 * @path: A #GtkTreePath
171 * Generates a string representation of the path. This string is a ':'
172 * separated list of numbers. For example, "4:10:0:3" would be an acceptable return value for this string.
174 * Return value: A newly allocated string. Must be freed with #g_free.
177 gtk_tree_path_to_string (GtkTreePath *path)
182 if (path->depth == 0)
185 ptr = retval = (gchar *) g_new0 (char *, path->depth*8);
186 sprintf (retval, "%d", path->indices[0]);
187 while (*ptr != '\000')
190 for (i = 1; i < path->depth; i++)
192 sprintf (ptr, ":%d", path->indices[i]);
193 while (*ptr != '\000')
201 * gtk_tree_path_new_root:
203 * Creates a new root #GtkTreePath. The string representation of this path is
206 * Return value: A new #GtkTreePath.
209 gtk_tree_path_new_root (void)
213 retval = gtk_tree_path_new ();
214 gtk_tree_path_append_index (retval, 0);
220 * gtk_tree_path_append_index:
221 * @path: A #GtkTreePath.
224 * Appends a new index to a path. As a result, the depth of the path is
228 gtk_tree_path_append_index (GtkTreePath *path,
231 g_return_if_fail (path != NULL);
232 g_return_if_fail (index >= 0);
235 path->indices = g_realloc (path->indices, path->depth * sizeof(gint));
236 path->indices[path->depth - 1] = index;
240 * gtk_tree_path_prepend_index:
241 * @path: A #GtkTreePath.
244 * Prepends a new index to a path. As a result, the depth of the path is
248 gtk_tree_path_prepend_index (GtkTreePath *path,
251 gint *new_indices = g_new (gint, ++path->depth);
252 if (path->indices == NULL)
254 path->indices = new_indices;
255 path->indices[0] = index;
258 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
259 g_free (path->indices);
260 path->indices = new_indices;
261 path->indices[0] = index;
265 * gtk_tree_path_get_depth:
266 * @path: A #GtkTreePath.
268 * Returns the current depth of @path.
270 * Return value: The depth of @path
273 gtk_tree_path_get_depth (GtkTreePath *path)
275 g_return_val_if_fail (path != NULL, 0);
281 * gtk_tree_path_get_indices:
282 * @path: A #GtkTreePath.
284 * Returns the current indices of @path. This is an array of integers, each
285 * representing a node in a tree.
287 * Return value: The current indices, or NULL.
290 gtk_tree_path_get_indices (GtkTreePath *path)
292 g_return_val_if_fail (path != NULL, NULL);
294 return path->indices;
298 * gtk_tree_path_free:
299 * @path: A #GtkTreePath.
304 gtk_tree_path_free (GtkTreePath *path)
306 g_return_if_fail (path != NULL);
308 g_free (path->indices);
313 * gtk_tree_path_copy:
314 * @path: A #GtkTreePath.
316 * Creates a new #GtkTreePath as a copy of @path.
318 * Return value: A new #GtkTreePath.
321 gtk_tree_path_copy (GtkTreePath *path)
325 g_return_val_if_fail (path != NULL, NULL);
327 retval = g_new (GtkTreePath, 1);
328 retval->depth = path->depth;
329 retval->indices = g_new (gint, path->depth);
330 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
335 * gtk_tree_path_compare:
336 * @a: A #GtkTreePath.
337 * @b: A #GtkTreePath to compare with.
339 * Compares two paths. If @a appears before @b in a tree, then 1, is returned.
340 * If @b appears before @a, then -1 is returned. If the two nodes are equal,
341 * then 0 is returned.
343 * Return value: The relative positions of @a and @b
346 gtk_tree_path_compare (const GtkTreePath *a,
347 const GtkTreePath *b)
351 g_return_val_if_fail (a != NULL, 0);
352 g_return_val_if_fail (b != NULL, 0);
353 g_return_val_if_fail (a->depth > 0, 0);
354 g_return_val_if_fail (b->depth > 0, 0);
358 if (a->indices[p] == b->indices[q])
360 return (a->indices[p] < b->indices[q]?1:-1);
362 while (++p < a->depth && ++q < b->depth);
363 if (a->depth == b->depth)
365 return (a->depth < b->depth?1:-1);
369 * gtk_tree_path_is_ancestor:
370 * @path: a #GtkTreePath
371 * @descendant: another #GtkTreePath
375 * Return value: %TRUE if @descendant is contained inside @path
378 gtk_tree_path_is_ancestor (GtkTreePath *path,
379 GtkTreePath *descendant)
383 g_return_val_if_fail (path != NULL, FALSE);
384 g_return_val_if_fail (descendant != NULL, FALSE);
386 /* can't be an ancestor if we're deeper */
387 if (path->depth >= descendant->depth)
391 while (i < path->depth)
393 if (path->indices[i] != descendant->indices[i])
402 * gtk_tree_path_is_descendant:
403 * @path: a #GtkTreePath
404 * @ancestor: another #GtkTreePath
408 * Return value: %TRUE if @ancestor contains @path somewhere below it
411 gtk_tree_path_is_descendant (GtkTreePath *path,
412 GtkTreePath *ancestor)
416 g_return_val_if_fail (path != NULL, FALSE);
417 g_return_val_if_fail (ancestor != NULL, FALSE);
419 /* can't be a descendant if we're shallower in the tree */
420 if (path->depth <= ancestor->depth)
424 while (i < ancestor->depth)
426 if (path->indices[i] != ancestor->indices[i])
436 * gtk_tree_path_next:
437 * @path: A #GtkTreePath.
439 * Moves the @path to point to the next node at the current depth.
442 gtk_tree_path_next (GtkTreePath *path)
444 g_return_if_fail (path != NULL);
445 g_return_if_fail (path->depth > 0);
447 path->indices[path->depth - 1] ++;
451 * gtk_tree_path_prev:
452 * @path: A #GtkTreePath.
454 * Moves the @path to point to the previous node at the current depth, if it exists.
456 * Return value: TRUE if @path has a previous node, and the move was made.
459 gtk_tree_path_prev (GtkTreePath *path)
461 g_return_val_if_fail (path != NULL, FALSE);
463 if (path->indices[path->depth - 1] == 0)
466 path->indices[path->depth - 1] -= 1;
473 * @path: A #GtkTreePath.
475 * Moves the @path to point to it's parent node, if it has a parent.
477 * Return value: TRUE if @path has a parent, and the move was made.
480 gtk_tree_path_up (GtkTreePath *path)
482 g_return_val_if_fail (path != NULL, FALSE);
484 if (path->depth == 1)
493 * gtk_tree_path_down:
494 * @path: A #GtkTreePath.
496 * Moves @path to point to the first child of the current path.
499 gtk_tree_path_down (GtkTreePath *path)
501 g_return_if_fail (path != NULL);
503 gtk_tree_path_append_index (path, 0);
506 struct _GtkTreeRowReference
512 typedef struct _RowRefList RowRefList;
524 _gtk_tree_row_reference_inserted (GtkTreeRowReference *reference,
529 gint depth = gtk_tree_path_get_depth (path);
530 gint ref_depth = gtk_tree_path_get_depth (reference->path);
532 if (ref_depth >= depth)
534 gint *indices = gtk_tree_path_get_indices (path);
535 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
538 /* This is the depth that might affect us. */
541 if (indices[i] <= ref_indices[i])
547 /* Returns TRUE if the reference path was deleted; FALSE otherwise */
549 _gtk_tree_row_reference_deleted (GtkTreeRowReference *reference,
554 gint depth = gtk_tree_path_get_depth (path);
555 gint ref_depth = gtk_tree_path_get_depth (reference->path);
557 if (ref_depth >= depth)
559 /* Need to adjust path upward */
560 gint *indices = gtk_tree_path_get_indices (path);
561 gint *ref_indices = gtk_tree_path_get_indices (reference->path);
565 if (indices[i] < ref_indices[i])
567 else if (indices[i] == ref_indices[i])
569 /* the referenced node itself, or its parent, was
570 * deleted, mark invalid
573 gtk_tree_path_free (reference->path);
574 reference->path = NULL;
583 release_row_references (gpointer data)
585 RowRefList *refs = data;
586 GSList *tmp_list = NULL;
588 tmp_list = refs->list;
589 while (tmp_list != NULL)
591 GtkTreeRowReference *reference = tmp_list->data;
593 reference->model = NULL;
595 /* we don't free the reference, users are responsible for that. */
597 tmp_list = g_slist_next (tmp_list);
600 g_slist_free (refs->list);
605 inserted_callback (GtkTreeModel *tree_model,
610 RowRefList *refs = data;
613 /* This function corrects the path stored in the reference to
614 * account for an insertion. Note that it's called _after_ the insertion
615 * with the path to the newly-inserted row. Which means that
616 * the inserted path is in a different "coordinate system" than
617 * the old path (e.g. if the inserted path was just before the old path,
618 * then inserted path and old path will be the same, and old path must be
622 tmp_list = refs->list;
624 while (tmp_list != NULL)
626 GtkTreeRowReference *reference = tmp_list->data;
628 _gtk_tree_row_reference_inserted (reference, path);
630 tmp_list = g_slist_next (tmp_list);
635 deleted_callback (GtkTreeModel *tree_model,
639 RowRefList *refs = data;
642 /* This function corrects the path stored in the reference to
643 * account for an deletion. Note that it's called _after_ the
644 * deletion with the old path of the just-deleted row. Which means
645 * that the deleted path is the same now-defunct "coordinate system"
646 * as the path saved in the reference, which is what we want to fix.
648 * Note that this is different from the situation in "inserted," so
649 * while you might think you can cut-and-paste between these
650 * functions, it's not going to work. ;-)
653 tmp_list = refs->list;
655 while (tmp_list != NULL)
657 GtkTreeRowReference *reference = tmp_list->data;
659 _gtk_tree_row_reference_deleted (reference, path);
661 tmp_list = g_slist_next (tmp_list);
666 connect_ref_callbacks (GtkTreeModel *model,
669 g_signal_connect_data (G_OBJECT (model),
671 (GCallback) inserted_callback,
677 g_signal_connect_data (G_OBJECT (model),
679 (GCallback) deleted_callback,
687 g_signal_connect_data (G_OBJECT (model),
689 (GCallback) reordered_callback,
698 disconnect_ref_callbacks (GtkTreeModel *model,
701 g_signal_handlers_disconnect_matched (G_OBJECT (model),
711 gtk_tree_row_reference_new (GtkTreeModel *model,
714 GtkTreeRowReference *reference;
717 reference = g_new (GtkTreeRowReference, 1);
719 reference->model = model;
720 reference->path = gtk_tree_path_copy (path);
722 refs = g_object_get_data (G_OBJECT (model),
723 "gtk-tree-row-refs");
727 refs = g_new (RowRefList, 1);
729 connect_ref_callbacks (model, refs);
730 g_object_set_data_full (G_OBJECT (model),
733 release_row_references);
736 refs->list = g_slist_prepend (refs->list, reference);
741 GtkTreeRowReference *
742 _gtk_tree_row_reference_new_from_view (GtkTreePath *path)
744 GtkTreeRowReference *reference;
746 reference = g_new (GtkTreeRowReference, 1);
748 reference->model = NULL;
749 reference->path = gtk_tree_path_copy (path);
755 gtk_tree_row_reference_get_path (GtkTreeRowReference *reference)
757 g_return_val_if_fail (reference != NULL, NULL);
759 if (reference->model == NULL)
762 if (reference->path == NULL)
765 return gtk_tree_path_copy (reference->path);
769 gtk_tree_row_reference_free (GtkTreeRowReference *reference)
773 g_return_if_fail (reference != NULL);
775 if (reference->model)
777 refs = g_object_get_data (G_OBJECT (reference->model),
778 "gtk-tree-row-refs");
782 g_warning (G_STRLOC": bad row reference, model has no outstanding row references");
786 refs->list = g_slist_remove (refs->list, reference);
788 if (refs->list == NULL)
790 disconnect_ref_callbacks (reference->model, refs);
791 g_object_set_data (G_OBJECT (reference->model),
798 gtk_tree_path_free (reference->path);
804 * gtk_tree_iter_copy:
805 * @iter: A #GtkTreeIter.
807 * Creates a dynamically allocated tree iterator as a copy of @iter. This
808 * function is not intended for use in applications, because you can just copy
809 * the structs by value (GtkTreeIter new_iter = iter;). You
810 * must free this iter with gtk_tree_iter_free ().
812 * Return value: a newly allocated copy of @iter.
815 gtk_tree_iter_copy (GtkTreeIter *iter)
819 g_return_val_if_fail (iter != NULL, NULL);
821 retval = g_new (GtkTreeIter, 1);
828 * gtk_tree_iter_free:
829 * @iter: A dynamically allocated tree iterator.
831 * Free an iterator that has been allocated on the heap. This function is
832 * mainly used for language bindings.
835 gtk_tree_iter_free (GtkTreeIter *iter)
837 g_return_if_fail (iter != NULL);
843 * gtk_tree_model_get_flags:
844 * @tree_model: A #GtkTreeModel.
846 * Returns a set of flags supported by this interface. The flags are a bitwise
847 * combination of #GtkTreeModelFlags. It is expected that the flags supported
848 * do not change for an interface.
850 * Return value: The flags supported by this interface.
853 gtk_tree_model_get_flags (GtkTreeModel *tree_model)
855 g_return_val_if_fail (tree_model != NULL, 0);
856 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
858 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags)
859 return (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags) (tree_model);
865 * gtk_tree_model_get_n_columns:
866 * @tree_model: A #GtkTreeModel.
868 * Returns the number of columns supported by the #tree_model
870 * Return value: The number of columns.
873 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
875 g_return_val_if_fail (tree_model != NULL, 0);
876 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
877 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
879 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
883 * gtk_tree_model_get_column_type:
884 * @tree_model: A #GtkTreeModel.
885 * @index: The column index.
887 * Returns the type of the column.
889 * Return value: The type of the column.
892 gtk_tree_model_get_column_type (GtkTreeModel *tree_model,
895 g_return_val_if_fail (tree_model != NULL, G_TYPE_INVALID);
896 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), G_TYPE_INVALID);
897 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type != NULL, G_TYPE_INVALID);
898 g_return_val_if_fail (index >= 0, G_TYPE_INVALID);
900 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type) (tree_model, index);
904 * gtk_tree_model_get_iter:
905 * @tree_model: A #GtkTreeModel.
906 * @iter: The uninitialized #GtkTreeIter.
907 * @path: The #GtkTreePath.
909 * Sets @iter to a valid iterator pointing to @path. If the model does not
910 * provide an implementation of this function, it is implemented in terms of
911 * @gtk_tree_model_iter_nth_child.
913 * Return value: TRUE, if @iter was set.
916 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
924 g_return_val_if_fail (tree_model != NULL, FALSE);
925 g_return_val_if_fail (iter != NULL, FALSE);
926 g_return_val_if_fail (path != NULL, FALSE);
927 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
929 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL)
930 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
932 indices = gtk_tree_path_get_indices (path);
933 depth = gtk_tree_path_get_depth (path);
935 g_return_val_if_fail (depth > 0, FALSE);
937 if (! gtk_tree_model_iter_nth_child (tree_model, iter, NULL, indices[0]))
940 for (i = 1; i < depth; i++)
943 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
951 * gtk_tree_model_get_first:
952 * @tree_model: a #GtkTreeModel
953 * @iter: iterator to initialize
955 * Initialized @iter with the first iterator in the tree (the one at the
956 * root path) and returns %TRUE, or returns %FALSE if there are no
957 * iterable locations in the model (i.e. the tree is empty).
959 * Return value: %TRUE if @iter was initialized
962 gtk_tree_model_get_first (GtkTreeModel *tree_model,
968 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
969 g_return_val_if_fail (iter != NULL, FALSE);
971 path = gtk_tree_path_new_root ();
973 retval = gtk_tree_model_get_iter (tree_model, iter, path);
975 gtk_tree_path_free (path);
981 * gtk_tree_model_get_path:
982 * @tree_model: A #GtkTreeModel.
983 * @iter: The #GtkTreeIter.
985 * Returns a newly created #GtkTreePath referenced by @iter. This path should
986 * be freed with #gtk_tree_path_free.
988 * Return value: a newly created #GtkTreePath.
991 gtk_tree_model_get_path (GtkTreeModel *tree_model,
994 g_return_val_if_fail (tree_model != NULL, NULL);
995 g_return_val_if_fail (iter != NULL, NULL);
996 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
997 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
999 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
1003 * gtk_tree_model_get_value:
1004 * @tree_model: A #GtkTreeModel.
1005 * @iter: The #GtkTreeIter.
1006 * @column: The column to lookup the value at.
1007 * @value: An empty #GValue to set.
1009 * Sets initializes and sets @value to that at @column. When done with value,
1010 * #g_value_unset needs to be called on it.
1013 gtk_tree_model_get_value (GtkTreeModel *tree_model,
1018 g_return_if_fail (tree_model != NULL);
1019 g_return_if_fail (iter != NULL);
1020 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1021 g_return_if_fail (value != NULL);
1022 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
1024 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
1028 * gtk_tree_model_iter_next:
1029 * @tree_model: A #GtkTreeModel.
1030 * @iter: The #GtkTreeIter.
1032 * Sets @iter to point to the node following it at the current level. If there
1033 * is no next @iter, FALSE is returned and @iter is set to be invalid.
1035 * Return value: TRUE if @iter has been changed to the next node.
1038 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
1041 g_return_val_if_fail (tree_model != NULL, FALSE);
1042 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1043 g_return_val_if_fail (iter != NULL, FALSE);
1044 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
1046 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
1050 * gtk_tree_model_iter_children:
1051 * @tree_model: A #GtkTreeModel.
1052 * @iter: The new #GtkTreeIter to be set to the child.
1053 * @parent: The #GtkTreeIter.
1055 * Sets @iter to point to the first child of @parent. If @parent has no children,
1056 * FALSE is returned and @iter is set to be invalid. @parent will remain a valid
1057 * node after this function has been called.
1059 * Return value: TRUE, if @child has been set to the first child.
1062 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
1064 GtkTreeIter *parent)
1066 g_return_val_if_fail (tree_model != NULL, FALSE);
1067 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1068 g_return_val_if_fail (iter != NULL, FALSE);
1069 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
1071 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
1075 * gtk_tree_model_iter_has_child:
1076 * @tree_model: A #GtkTreeModel.
1077 * @iter: The #GtkTreeIter to test for children.
1079 * Returns TRUE if @iter has children, FALSE otherwise.
1081 * Return value: TRUE if @iter has children.
1084 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
1087 g_return_val_if_fail (tree_model != NULL, FALSE);
1088 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1089 g_return_val_if_fail (iter != NULL, FALSE);
1090 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
1092 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
1096 * gtk_tree_model_iter_n_children:
1097 * @tree_model: A #GtkTreeModel.
1098 * @iter: The #GtkTreeIter, or NULL.
1100 * Returns the number of children that @iter has. If @iter is NULL, then the
1101 * number of toplevel nodes is returned.
1103 * Return value: The number of children of @iter.
1106 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
1109 g_return_val_if_fail (tree_model != NULL, 0);
1110 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
1111 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
1113 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
1117 * gtk_tree_model_iter_nth_child:
1118 * @tree_model: A #GtkTreeModel.
1119 * @iter: The #GtkTreeIter to set to the nth child.
1120 * @parent: The #GtkTreeIter to get the child from, or NULL.
1121 * @n: Then index of the desired child.
1123 * Sets @iter to be the child of @parent, using the given index. The first
1124 * index is 0. If the index is too big, or @parent has no children, @iter is
1125 * set to an invalid iterator and FALSE is returned. @parent will remain a
1126 * valid node after this function has been called. If @parent is NULL, then the
1127 * root node is assumed.
1129 * Return value: TRUE, if @parent has an nth child.
1132 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
1134 GtkTreeIter *parent,
1137 g_return_val_if_fail (tree_model != NULL, FALSE);
1138 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1139 g_return_val_if_fail (iter != NULL, FALSE);
1140 g_return_val_if_fail (n >= 0, FALSE);
1141 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
1143 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
1147 * gtk_tree_model_iter_parent:
1148 * @tree_model: A #GtkTreeModel
1149 * @iter: The new #GtkTreeIter to set to the parent.
1150 * @child: The #GtkTreeIter.
1152 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
1153 * doesn't have a parent, then @iter is set to an invalid iterator and FALSE
1154 * is returned. @child will remain a valid node after this function has been
1157 * Return value: TRUE, if @iter is set to the parent of @child.
1160 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
1164 g_return_val_if_fail (tree_model != NULL, FALSE);
1165 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
1166 g_return_val_if_fail (iter != NULL, FALSE);
1167 g_return_val_if_fail (child != NULL, FALSE);
1168 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
1170 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);
1173 /* FIXME explain what the method is supposed to do! */
1175 * gtk_tree_model_ref_iter:
1176 * @tree_model: A #GtkTreeModel.
1177 * @iter: The #GtkTreeIter.
1179 * Ref's the iter. This is an optional method for models to implement. To be
1180 * more specific, models may ignore this call as it exists primarily for
1181 * performance reasons.
1184 gtk_tree_model_ref_iter (GtkTreeModel *tree_model,
1187 g_return_if_fail (tree_model != NULL);
1188 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1190 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter)
1191 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter) (tree_model, iter);
1194 /* FIXME explain what the method is supposed to do! */
1196 * gtk_tree_model_unref_iter:
1197 * @tree_model: A #GtkTreeModel.
1198 * @iter: The #GtkTreeIter.
1200 * Unref's the iter. This is an optional method for models to implement. To be
1201 * more specific, models may ignore this call as it exists primarily for
1202 * performance reasons.
1205 gtk_tree_model_unref_iter (GtkTreeModel *tree_model,
1208 g_return_if_fail (tree_model != NULL);
1209 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1211 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter)
1212 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter) (tree_model, iter);
1216 * gtk_tree_model_get:
1217 * @tree_model: a #GtkTreeModel
1218 * @iter: a row in @tree_model
1219 * @Varargs: pairs of column number and value return locations, terminated by -1
1221 * Gets the value of one or more cells in the row referenced by @iter.
1222 * The variable argument list should contain integer column numbers,
1223 * each column number followed by a place to store the value being
1224 * retrieved. The list is terminated by a -1. For example, to get a
1225 * value from column 0 with type %G_TYPE_STRING, you would
1226 * write: gtk_tree_model_set (model, iter, 0, &place_string_here, -1),
1227 * where place_string_here is a gchar* to be filled with the string.
1228 * If appropriate, the returned values have to be freed or unreferenced.
1232 gtk_tree_model_get (GtkTreeModel *tree_model,
1238 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1240 va_start (var_args, iter);
1241 gtk_tree_model_get_valist (tree_model, iter, var_args);
1246 * gtk_tree_model_get_valist:
1247 * @tree_model: a #GtkTreeModel
1248 * @iter: a row in @tree_model
1249 * @var_args: va_list of column/return location pairs
1251 * See gtk_tree_model_get(), this version takes a va_list for
1252 * language bindings to use.
1256 gtk_tree_model_get_valist (GtkTreeModel *tree_model,
1262 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1264 column = va_arg (var_args, gint);
1266 while (column != -1)
1268 GValue value = { 0, };
1269 gchar *error = NULL;
1271 if (column >= gtk_tree_model_get_n_columns (tree_model))
1273 g_warning ("%s: Invalid column number %d accessed (remember to end your list of columns with a -1)", G_STRLOC, column);
1277 gtk_tree_model_get_value (GTK_TREE_MODEL (tree_model), iter, column, &value);
1279 G_VALUE_LCOPY (&value, var_args, 0, &error);
1282 g_warning ("%s: %s", G_STRLOC, error);
1285 /* we purposely leak the value here, it might not be
1286 * in a sane state if an error condition occoured
1291 g_value_unset (&value);
1293 column = va_arg (var_args, gint);
1298 gtk_tree_model_changed (GtkTreeModel *tree_model,
1302 g_return_if_fail (tree_model != NULL);
1303 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1304 g_return_if_fail (path != NULL);
1305 g_return_if_fail (iter != NULL);
1307 g_signal_emit_by_name (tree_model, "changed", path, iter);
1311 gtk_tree_model_inserted (GtkTreeModel *tree_model,
1315 g_return_if_fail (tree_model != NULL);
1316 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1317 g_return_if_fail (path != NULL);
1318 g_return_if_fail (iter != NULL);
1320 g_signal_emit_by_name (tree_model, "inserted", path, iter);
1324 gtk_tree_model_child_toggled (GtkTreeModel *tree_model,
1328 g_return_if_fail (tree_model != NULL);
1329 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1330 g_return_if_fail (path != NULL);
1331 g_return_if_fail (iter != NULL);
1333 g_signal_emit_by_name (tree_model, "child_toggled", path, iter);
1337 gtk_tree_model_deleted (GtkTreeModel *tree_model,
1340 g_return_if_fail (tree_model != NULL);
1341 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
1342 g_return_if_fail (path != NULL);
1344 g_signal_emit_by_name (tree_model, "deleted", path);