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);
182 new_indices = g_new (gint, ++path->depth);
183 if (path->indices == NULL)
185 path->indices = new_indices;
186 path->indices[0] = index;
190 memcpy (new_indices, path->indices, (path->depth - 1)*sizeof (gint));
191 g_free (path->indices);
192 path->indices = new_indices;
193 path->indices[path->depth - 1] = index;
197 * gtk_tree_path_prepend_index:
198 * @path: A #GtkTreePath.
201 * Prepends a new index to a path. As a result, the depth of the path is
205 gtk_tree_path_prepend_index (GtkTreePath *path,
208 gint *new_indices = g_new (gint, ++path->depth);
209 if (path->indices == NULL)
211 path->indices = new_indices;
212 path->indices[0] = index;
215 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
216 g_free (path->indices);
217 path->indices = new_indices;
218 path->indices[0] = index;
222 * gtk_tree_path_get_depth:
223 * @path: A #GtkTreePath.
225 * Returns the current depth of @path.
227 * Return value: The depth of @path
230 gtk_tree_path_get_depth (GtkTreePath *path)
232 g_return_val_if_fail (path != NULL, 0);
238 * gtk_tree_path_get_indices:
239 * @path: A #GtkTreePath.
241 * Returns the current indices of @path. This is an array of integers, each
242 * representing a node in a tree.
244 * Return value: The current indices, or NULL.
247 gtk_tree_path_get_indices (GtkTreePath *path)
249 g_return_val_if_fail (path != NULL, NULL);
251 return path->indices;
255 * gtk_tree_path_free:
256 * @path: A #GtkTreePath.
261 gtk_tree_path_free (GtkTreePath *path)
263 g_return_if_fail (path != NULL);
265 g_free (path->indices);
270 * gtk_tree_path_copy:
271 * @path: A #GtkTreePath.
273 * Creates a new #GtkTreePath as a copy of @path.
275 * Return value: A new #GtkTreePath.
278 gtk_tree_path_copy (GtkTreePath *path)
282 g_return_val_if_fail (path != NULL, NULL);
284 retval = g_new (GtkTreePath, 1);
285 retval->depth = path->depth;
286 retval->indices = g_new (gint, path->depth);
287 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
292 * gtk_tree_path_compare:
293 * @a: A #GtkTreePath.
294 * @b: A #GtkTreePath to compare with.
296 * Compares two paths. If @a appears before @b in a tree, then 1, is returned.
297 * If @b appears before @a, then -1 is returned. If the two nodes are equal,
298 * then 0 is returned.
300 * Return value: The relative positions of @a and @b
303 gtk_tree_path_compare (const GtkTreePath *a,
304 const GtkTreePath *b)
308 g_return_val_if_fail (a != NULL, 0);
309 g_return_val_if_fail (b != NULL, 0);
310 g_return_val_if_fail (a->depth > 0, 0);
311 g_return_val_if_fail (b->depth > 0, 0);
315 if (a->indices[p] == b->indices[q])
317 return (a->indices[p] < b->indices[q]?1:-1);
319 while (++p < a->depth && ++q < b->depth);
320 if (a->depth == b->depth)
322 return (a->depth < b->depth?1:-1);
326 * gtk_tree_path_next:
327 * @path: A #GtkTreePath.
329 * Moves the @path to point to the next node at the current depth.
332 gtk_tree_path_next (GtkTreePath *path)
334 g_return_if_fail (path != NULL);
335 g_return_if_fail (path->depth > 0);
337 path->indices[path->depth - 1] ++;
341 * gtk_tree_path_prev:
342 * @path: A #GtkTreePath.
344 * Moves the @path to point to the previous node at the current depth, if it exists.
346 * Return value: TRUE if @path has a previous node, and the move was made.
349 gtk_tree_path_prev (GtkTreePath *path)
351 g_return_val_if_fail (path != NULL, FALSE);
353 if (path->indices[path->depth] == 0)
356 path->indices[path->depth - 1] --;
363 * @path: A #GtkTreePath.
365 * Moves the @path to point to it's parent node, if it has a parent.
367 * Return value: TRUE if @path has a parent, and the move was made.
370 gtk_tree_path_up (GtkTreePath *path)
372 g_return_val_if_fail (path != NULL, FALSE);
374 if (path->depth == 1)
383 * gtk_tree_path_down:
384 * @path: A #GtkTreePath.
386 * Moves @path to point to the first child of the current path.
389 gtk_tree_path_down (GtkTreePath *path)
391 g_return_if_fail (path != NULL);
393 gtk_tree_path_append_index (path, 0);
398 * gtk_tree_iter_copy:
399 * @iter: A #GtkTreeIter.
401 * Creates a dynamically allocated tree iterator as a copy of @iter. This
402 * function is not intended for use in applications, because you can just copy
403 * the structs by value (GtkTreeIter new_iter = iter;). You
404 * must free this iter with gtk_tree_iter_free ().
406 * Return value: a newly allocated copy of @iter.
409 gtk_tree_iter_copy (GtkTreeIter *iter)
413 g_return_val_if_fail (iter != NULL, NULL);
415 retval = g_new (GtkTreeIter, 1);
422 * gtk_tree_iter_free:
423 * @iter: A dynamically allocated tree iterator.
425 * Free an iterator that has been allocated on the heap. This function is
426 * mainly used for language bindings.
429 gtk_tree_iter_free (GtkTreeIter *iter)
431 g_return_if_fail (iter != NULL);
438 * gtk_tree_model_get_flags:
439 * @tree_model: A #GtkTreeModel.
441 * Returns a set of flags supported by this interface. The flags are a bitwise
442 * combination of #GtkTreeModelFlags. It is expected that the flags supported
443 * do not change for an interface.
445 * Return value: The flags supported by this interface.
448 gtk_tree_model_get_flags (GtkTreeModel *tree_model)
450 g_return_val_if_fail (tree_model != NULL, 0);
451 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
453 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags)
454 return (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_flags) (tree_model);
460 * gtk_tree_model_get_n_columns:
461 * @tree_model: A #GtkTreeModel.
463 * Returns the number of columns supported by the #tree_model
465 * Return value: The number of columns.
468 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
470 g_return_val_if_fail (tree_model != NULL, 0);
471 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
472 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
474 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
478 * gtk_tree_model_get_column_type:
479 * @tree_model: A #GtkTreeModel.
480 * @index: The column index.
482 * Returns the type of the column.
484 * Return value: The type of the column.
487 gtk_tree_model_get_column_type (GtkTreeModel *tree_model,
490 g_return_val_if_fail (tree_model != NULL, G_TYPE_INVALID);
491 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), G_TYPE_INVALID);
492 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type != NULL, G_TYPE_INVALID);
493 g_return_val_if_fail (index >= 0, G_TYPE_INVALID);
495 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_column_type) (tree_model, index);
499 * gtk_tree_model_get_iter:
500 * @tree_model: A #GtkTreeModel.
501 * @iter: The uninitialized #GtkTreeIter.
502 * @path: The #GtkTreePath.
504 * Sets @iter to a valid iterator pointing to @path. If the model does not
505 * provide an implementation of this function, it is implemented in terms of
506 * @gtk_tree_model_iter_nth_child.
508 * Return value: TRUE, if @iter was set.
511 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
519 g_return_val_if_fail (tree_model != NULL, FALSE);
520 g_return_val_if_fail (iter != NULL, FALSE);
521 g_return_val_if_fail (path != NULL, FALSE);
522 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
524 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL)
525 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
527 indices = gtk_tree_path_get_indices (path);
528 depth = gtk_tree_path_get_depth (path);
530 g_return_val_if_fail (depth > 0, FALSE);
532 if (! gtk_tree_model_iter_nth_child (tree_model, iter, NULL, indices[0]))
535 for (i = 1; i < depth; i++)
538 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
546 * gtk_tree_model_get_first:
547 * @tree_model: a #GtkTreeModel
548 * @iter: iterator to initialize
550 * Initialized @iter with the first iterator in the tree (the one at the
551 * root path) and returns %TRUE, or returns %FALSE if there are no
552 * iterable locations in the model (i.e. the tree is empty).
554 * Return value: %TRUE if @iter was initialized
557 gtk_tree_model_get_first (GtkTreeModel *tree_model,
563 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
564 g_return_val_if_fail (iter != NULL, FALSE);
566 path = gtk_tree_path_new_root ();
568 retval = gtk_tree_model_get_iter (tree_model, iter, path);
570 gtk_tree_path_free (path);
576 * gtk_tree_model_get_path:
577 * @tree_model: A #GtkTreeModel.
578 * @iter: The #GtkTreeIter.
580 * Returns a newly created #GtkTreePath referenced by @iter. This path should
581 * be freed with #gtk_tree_path_free.
583 * Return value: a newly created #GtkTreePath.
586 gtk_tree_model_get_path (GtkTreeModel *tree_model,
589 g_return_val_if_fail (tree_model != NULL, NULL);
590 g_return_val_if_fail (iter != NULL, NULL);
591 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
592 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
594 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
598 * gtk_tree_model_get_value:
599 * @tree_model: A #GtkTreeModel.
600 * @iter: The #GtkTreeIter.
601 * @column: The column to lookup the value at.
602 * @value: An empty #GValue to set.
604 * Sets initializes and sets @value to that at @column. When done with value,
605 * #g_value_unset needs to be called on it.
608 gtk_tree_model_get_value (GtkTreeModel *tree_model,
613 g_return_if_fail (tree_model != NULL);
614 g_return_if_fail (iter != NULL);
615 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
616 g_return_if_fail (value != NULL);
617 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
619 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
623 * gtk_tree_model_iter_next:
624 * @tree_model: A #GtkTreeModel.
625 * @iter: The #GtkTreeIter.
627 * Sets @iter to point to the node following it at the current level. If there
628 * is no next @iter, FALSE is returned and @iter is set to be invalid.
630 * Return value: TRUE if @iter has been changed to the next node.
633 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
636 g_return_val_if_fail (tree_model != NULL, FALSE);
637 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
638 g_return_val_if_fail (iter != NULL, FALSE);
639 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
641 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
645 * gtk_tree_model_iter_children:
646 * @tree_model: A #GtkTreeModel.
647 * @iter: The new #GtkTreeIter to be set to the child.
648 * @parent: The #GtkTreeIter.
650 * Sets @iter to point to the first child of @parent. If @parent has no children,
651 * FALSE is returned and @iter is set to be invalid. @parent will remain a valid
652 * node after this function has been called.
654 * Return value: TRUE, if @child has been set to the first child.
657 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
661 g_return_val_if_fail (tree_model != NULL, FALSE);
662 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
663 g_return_val_if_fail (iter != NULL, FALSE);
664 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
666 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
670 * gtk_tree_model_iter_has_child:
671 * @tree_model: A #GtkTreeModel.
672 * @iter: The #GtkTreeIter to test for children.
674 * Returns TRUE if @iter has children, FALSE otherwise.
676 * Return value: TRUE if @iter has children.
679 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
682 g_return_val_if_fail (tree_model != NULL, FALSE);
683 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
684 g_return_val_if_fail (iter != NULL, FALSE);
685 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
687 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
691 * gtk_tree_model_iter_n_children:
692 * @tree_model: A #GtkTreeModel.
693 * @iter: The #GtkTreeIter, or NULL.
695 * Returns the number of children that @iter has. If @iter is NULL, then the
696 * number of toplevel nodes is returned.
698 * Return value: The number of children of @iter.
701 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
704 g_return_val_if_fail (tree_model != NULL, 0);
705 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
706 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
708 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
712 * gtk_tree_model_iter_nth_child:
713 * @tree_model: A #GtkTreeModel.
714 * @iter: The #GtkTreeIter to set to the nth child.
715 * @parent: The #GtkTreeIter to get the child from, or NULL.
716 * @n: Then index of the desired child.
718 * Sets @iter to be the child of @parent, using the given index. The first
719 * index is 0. If the index is too big, or @parent has no children, @iter is
720 * set to an invalid iterator and FALSE is returned. @parent will remain a
721 * valid node after this function has been called. If @parent is NULL, then the
722 * root node is assumed.
724 * Return value: TRUE, if @parent has an nth child.
727 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
732 g_return_val_if_fail (tree_model != NULL, FALSE);
733 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
734 g_return_val_if_fail (iter != NULL, FALSE);
735 g_return_val_if_fail (n >= 0, FALSE);
736 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
738 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
742 * gtk_tree_model_iter_parent:
743 * @tree_model: A #GtkTreeModel
744 * @iter: The new #GtkTreeIter to set to the parent.
745 * @child: The #GtkTreeIter.
747 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
748 * doesn't have a parent, then @iter is set to an invalid iterator and FALSE
749 * is returned. @child will remain a valid node after this function has been
752 * Return value: TRUE, if @iter is set to the parent of @child.
755 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
759 g_return_val_if_fail (tree_model != NULL, FALSE);
760 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
761 g_return_val_if_fail (iter != NULL, FALSE);
762 g_return_val_if_fail (child != NULL, FALSE);
763 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
765 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);
768 /* FIXME explain what the method is supposed to do! */
770 * gtk_tree_model_ref_iter:
771 * @tree_model: A #GtkTreeModel.
772 * @iter: The #GtkTreeIter.
774 * Ref's the iter. This is an optional method for models to implement. To be
775 * more specific, models may ignore this call as it exists primarily for
776 * performance reasons.
779 gtk_tree_model_ref_iter (GtkTreeModel *tree_model,
782 g_return_if_fail (tree_model != NULL);
783 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
785 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter)
786 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->ref_iter) (tree_model, iter);
789 /* FIXME explain what the method is supposed to do! */
791 * gtk_tree_model_unref_iter:
792 * @tree_model: A #GtkTreeModel.
793 * @iter: The #GtkTreeIter.
795 * Unref's the iter. This is an optional method for models to implement. To be
796 * more specific, models may ignore this call as it exists primarily for
797 * performance reasons.
800 gtk_tree_model_unref_iter (GtkTreeModel *tree_model,
803 g_return_if_fail (tree_model != NULL);
804 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
806 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter)
807 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->unref_iter) (tree_model, iter);