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 */
45 tree_model_type = g_type_register_static (G_TYPE_INTERFACE, "GtkTreeModel", &tree_model_info, 0);
48 return tree_model_type;
55 * Creates a new #GtkTreePath.
57 * Return value: A newly created #GtkTreePath.
59 /* GtkTreePath Operations */
61 gtk_tree_path_new (void)
64 retval = (GtkTreePath *) g_new (GtkTreePath, 1);
66 retval->indices = NULL;
72 * gtk_tree_path_new_from_string:
73 * @path: The string representation of a path.
75 * Creates a new #GtkTreePath initialized to @path. @path is expected to be a
76 * colon separated list of numbers. For example, the string "10:4:0" would
77 * create a path of depth 3.
79 * Return value: A newly created #GtkTreePath.
82 gtk_tree_path_new_from_string (gchar *path)
88 g_return_val_if_fail (path != NULL, gtk_tree_path_new ());
90 retval = gtk_tree_path_new ();
94 i = strtol (path, &ptr, 10);
95 gtk_tree_path_append_index (retval, i);
99 /* FIXME: should we error out if this is not a ':', or should we be tolerant? */
107 * gtk_tree_path_to_string:
108 * @path: A #GtkTreePath
110 * Generates a string representation of the path. This string is a ':'
111 * separated list of numbers. For example, "4:10:0:3" would be an acceptable return value for this string.
113 * Return value: A newly allocated string. Must be freed with #g_free.
116 gtk_tree_path_to_string (GtkTreePath *path)
121 if (path->depth == 0)
124 ptr = retval = (gchar *) g_new0 (char *, path->depth*8);
125 sprintf (retval, "%d", path->indices[0]);
126 while (*ptr != '\000')
129 for (i = 1; i < path->depth; i++)
131 sprintf (ptr, ":%d", path->indices[i]);
132 while (*ptr != '\000')
140 * gtk_tree_path_new_root:
143 * Creates a new root #GtkTreePath. The string representation of this path is
146 * Return value: A new #GtkTreePath.
149 gtk_tree_path_new_root (void)
153 retval = gtk_tree_path_new ();
154 gtk_tree_path_append_index (retval, 0);
160 * gtk_tree_path_append_index:
161 * @path: A #GtkTreePath.
164 * Appends a new index to a path. As a result, the depth of the path is
168 gtk_tree_path_append_index (GtkTreePath *path,
173 g_return_if_fail (path != NULL);
174 g_return_if_fail (index >= 0);
176 new_indices = g_new (gint, ++path->depth);
177 if (path->indices == NULL)
179 path->indices = new_indices;
180 path->indices[0] = index;
184 memcpy (new_indices, path->indices, (path->depth - 1)*sizeof (gint));
185 g_free (path->indices);
186 path->indices = new_indices;
187 path->indices[path->depth - 1] = index;
191 * gtk_tree_path_prepend_index:
192 * @path: A #GtkTreePath.
195 * Prepends a new index to a path. As a result, the depth of the path is
199 gtk_tree_path_prepend_index (GtkTreePath *path,
202 gint *new_indices = g_new (gint, ++path->depth);
203 if (path->indices == NULL)
205 path->indices = new_indices;
206 path->indices[0] = index;
209 memcpy (new_indices + 1, path->indices, (path->depth - 1)*sizeof (gint));
210 g_free (path->indices);
211 path->indices = new_indices;
212 path->indices[0] = index;
216 * gtk_tree_path_get_depth:
217 * @path: A #GtkTreePath.
219 * Returns the current depth of @path.
221 * Return value: The depth of @path
224 gtk_tree_path_get_depth (GtkTreePath *path)
226 g_return_val_if_fail (path != NULL, 0);
232 * gtk_tree_path_get_indices:
233 * @path: A #GtkTreePath.
235 * Returns the current indices of @path. This is an array of integers, each
236 * representing a node in a tree.
238 * Return value: The current indices, or NULL.
241 gtk_tree_path_get_indices (GtkTreePath *path)
243 g_return_val_if_fail (path != NULL, NULL);
245 return path->indices;
249 * gtk_tree_path_free:
250 * @path: A #GtkTreePath.
255 gtk_tree_path_free (GtkTreePath *path)
257 g_free (path->indices);
262 * gtk_tree_path_copy:
263 * @path: A #GtkTreePath.
265 * Creates a new #GtkTreePath based upon @path.
267 * Return value: A new #GtkTreePath.
270 gtk_tree_path_copy (GtkTreePath *path)
274 retval = g_new (GtkTreePath, 1);
275 retval->depth = path->depth;
276 retval->indices = g_new (gint, path->depth);
277 memcpy (retval->indices, path->indices, path->depth * sizeof (gint));
282 * gtk_tree_path_compare:
283 * @a: A #GtkTreePath.
284 * @b: A #GtkTreePath to compare with.
286 * Compares two paths. If @a appears before @b in a tree, then 1, is returned.
287 * If @b appears before @a, then -1 is returned. If the two nodes are equal,
288 * then 0 is returned.
290 * Return value: The relative positions of @a and @b
293 gtk_tree_path_compare (const GtkTreePath *a,
294 const GtkTreePath *b)
298 g_return_val_if_fail (a != NULL, 0);
299 g_return_val_if_fail (b != NULL, 0);
300 g_return_val_if_fail (a->depth > 0, 0);
301 g_return_val_if_fail (b->depth > 0, 0);
305 if (a->indices[p] == b->indices[q])
307 return (a->indices[p] < b->indices[q]?1:-1);
309 while (++p < a->depth && ++q < b->depth);
310 if (a->depth == b->depth)
312 return (a->depth < b->depth?1:-1);
316 * gtk_tree_path_next:
317 * @path: A #GtkTreePath.
319 * Moves the @path to point to the next node at the current depth.
322 gtk_tree_path_next (GtkTreePath *path)
324 g_return_if_fail (path != NULL);
325 g_return_if_fail (path->depth > 0);
327 path->indices[path->depth - 1] ++;
331 * gtk_tree_path_prev:
332 * @path: A #GtkTreePath.
334 * Moves the @path to point to the previous node at the current depth, if it exists.
337 gtk_tree_path_prev (GtkTreePath *path)
339 g_return_val_if_fail (path != NULL, FALSE);
341 if (path->indices[path->depth] == 0)
344 path->indices[path->depth - 1] --;
351 * @path: A #GtkTreePath.
353 * Moves the @path to point to it's parent node, if it has a parent.
355 * Return value: TRUE if @path has a parent, and the move was made.
358 gtk_tree_path_up (GtkTreePath *path)
360 g_return_val_if_fail (path != NULL, FALSE);
362 if (path->depth == 1)
371 * gtk_tree_path_down:
372 * @path: A #GtkTreePath.
374 * Moves @path to point to the first child of the current path.
377 gtk_tree_path_down (GtkTreePath *path)
379 g_return_if_fail (path != NULL);
381 gtk_tree_path_append_index (path, 0);
385 * gtk_tree_model_get_n_columns:
386 * @tree_model: A #GtkTreeModel.
388 * Returns the number of columns supported by the #tree_model
390 * Return value: The number of columns.
393 gtk_tree_model_get_n_columns (GtkTreeModel *tree_model)
395 g_return_val_if_fail (tree_model != NULL, 0);
396 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
397 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns != NULL, 0);
399 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_n_columns) (tree_model);
403 * gtk_tree_model_get_iter:
404 * @tree_model: A #GtkTreeModel.
405 * @iter: The uninitialized #GtkTreeIter.
406 * @path: The #GtkTreePath.
408 * Sets @iter to a valid iterator pointing to @path. If the model does not
409 * provide an implementation of this function, it is implemented in terms of
410 * @gtk_tree_model_iter_nth_child.
412 * Return value: TRUE, if @iter was set.
415 gtk_tree_model_get_iter (GtkTreeModel *tree_model,
423 g_return_val_if_fail (tree_model != NULL, FALSE);
424 g_return_val_if_fail (iter != NULL, FALSE);
425 g_return_val_if_fail (path != NULL, FALSE);
426 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
428 if (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter != NULL)
429 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_iter) (tree_model, iter, path);
431 indices = gtk_tree_path_get_indices (path);
432 depth = gtk_tree_path_get_depth (path);
434 g_return_val_if_fail (depth > 0, FALSE);
436 if (! gtk_tree_model_iter_nth_child (tree_model, iter, NULL, indices[0]))
439 for (i = 1; i < depth; i++)
442 if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
450 * gtk_tree_model_get_path:
451 * @tree_model: A #GtkTreeModel.
452 * @iter: The #GtkTreeIter.
454 * Returns a newly created #GtkTreePath referenced by @iter. This path should
455 * be freed with #gtk_tree_path_free.
457 * Return value: a newly created #GtkTreePath.
460 gtk_tree_model_get_path (GtkTreeModel *tree_model,
463 g_return_val_if_fail (tree_model != NULL, NULL);
464 g_return_val_if_fail (iter != NULL, NULL);
465 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), NULL);
466 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path != NULL, NULL);
468 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_path) (tree_model, iter);
472 * gtk_tree_model_get_value:
473 * @tree_model: A #GtkTreeModel.
474 * @iter: The #GtkTreeIter.
475 * @column: The column to lookup the value at.
476 * @value: An empty #GValue to set.
478 * Sets initializes and sets @value to that at @column. When done with value,
479 * #g_value_unset needs to be called on it.
482 gtk_tree_model_get_value (GtkTreeModel *tree_model,
487 g_return_if_fail (tree_model != NULL);
488 g_return_if_fail (iter != NULL);
489 g_return_if_fail (GTK_IS_TREE_MODEL (tree_model));
490 g_return_if_fail (value != NULL);
491 g_return_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value != NULL);
493 (* GTK_TREE_MODEL_GET_IFACE (tree_model)->get_value) (tree_model, iter, column, value);
497 * gtk_tree_model_iter_next:
498 * @tree_model: A #GtkTreeModel.
499 * @iter: The #GtkTreeIter.
501 * Sets @iter to point to the node following it at the current level. If there
502 * is no next @iter, FALSE is returned and @iter is set to be invalid.
504 * Return value: TRUE if @iter has been changed to the next node.
507 gtk_tree_model_iter_next (GtkTreeModel *tree_model,
510 g_return_val_if_fail (tree_model != NULL, FALSE);
511 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
512 g_return_val_if_fail (iter != NULL, FALSE);
513 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next != NULL, FALSE);
515 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_next) (tree_model, iter);
519 * gtk_tree_model_iter_children:
520 * @tree_model: A #GtkTreeModel.
521 * @iter: The #GtkTreeIter.
522 * @child: The new #GtkTreeIter.
524 * Sets @iter to point to the first child of @parent. If @parent has no children,
525 * FALSE is returned and @iter is set to be invalid. @parent will remain a valid
526 * node after this function has been called.
528 * Return value: TRUE, if @child has been set to the first child.
531 gtk_tree_model_iter_children (GtkTreeModel *tree_model,
535 g_return_val_if_fail (tree_model != NULL, FALSE);
536 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
537 g_return_val_if_fail (iter != NULL, FALSE);
538 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children != NULL, FALSE);
540 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_children) (tree_model, iter, parent);
544 * gtk_tree_model_iter_has_child:
545 * @tree_model: A #GtkTreeModel.
546 * @iter: The #GtkTreeIter to test for children.
548 * Returns TRUE if @iter has children, FALSE otherwise.
550 * Return value: TRUE if @iter has children.
553 gtk_tree_model_iter_has_child (GtkTreeModel *tree_model,
556 g_return_val_if_fail (tree_model != NULL, FALSE);
557 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
558 g_return_val_if_fail (iter != NULL, FALSE);
559 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child != NULL, FALSE);
561 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_has_child) (tree_model, iter);
565 * gtk_tree_model_iter_n_children:
566 * @tree_model: A #GtkTreeModel.
567 * @iter: The #GtkTreeIter.
569 * Returns the number of children that @iter has.
571 * Return value: The number of children of @iter.
574 gtk_tree_model_iter_n_children (GtkTreeModel *tree_model,
577 g_return_val_if_fail (tree_model != NULL, 0);
578 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), 0);
579 g_return_val_if_fail (iter != NULL, 0);
580 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children != NULL, 0);
582 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_n_children) (tree_model, iter);
586 * gtk_tree_model_iter_nth_child:
587 * @tree_model: A #GtkTreeModel.
588 * @iter: The #GtkTreeIter to set to the nth child.
589 * @parent: The #GtkTreeIter to get the child from, or NULL.
590 * @n: Then index of the desired child.
592 * Sets @iter to be the child of @parent, using the given index. The first index
593 * is 0. If the index is too big, or @parent has no children, @iter is set to an
594 * invalid iterator and FALSE is returned. @parent will remain a valid node after
595 * this function has been called. If @parent is NULL, then the root node is assumed.
597 * Return value: TRUE, if @parent has an nth child.
600 gtk_tree_model_iter_nth_child (GtkTreeModel *tree_model,
605 g_return_val_if_fail (tree_model != NULL, FALSE);
606 g_return_val_if_fail (GTK_IS_TREE_MODEL (tree_model), FALSE);
607 g_return_val_if_fail (iter != NULL, FALSE);
608 g_return_val_if_fail (n >= 0, FALSE);
609 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child != NULL, FALSE);
611 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_nth_child) (tree_model, iter, parent, n);
615 * gtk_tree_model_iter_parent:
616 * @tree_model: A #GtkTreeModel
617 * @iter: The #GtkTreeIter.
618 * @parent: The #GtkTreeIter to set to the parent
620 * Sets @iter to be the parent of @child. If @child is at the toplevel, and
621 * doesn't have a parent, then @iter is set to an invalid iterator and FALSE
622 * is returned. @child will remain a valid node after this function has been
625 * Return value: TRUE, if @iter is set to the parent of @child.
628 gtk_tree_model_iter_parent (GtkTreeModel *tree_model,
632 g_return_val_if_fail (GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent != NULL, FALSE);
634 return (* GTK_TREE_MODEL_GET_IFACE (tree_model)->iter_parent) (tree_model, iter, child);