2 * Copyright (C) 2000,2001 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
3 * Copyright (C) 2001,2002 Kristian Rietveld <kris@gtk.org>
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Library General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Library General Public License for more details.
15 * You should have received a copy of the GNU Library General Public
16 * License along with this library; if not, write to the
17 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 * Boston, MA 02111-1307, USA.
21 /* NOTE: There is a potential for confusion in this code as to whether an iter,
22 * path or value refers to the GtkTreeModelSort model, or the child model being
23 * sorted. As a convention, variables referencing the child model will have an
24 * s_ prefix before them (ie. s_iter, s_value, s_path);
29 * iter->stamp = tree_model_sort->stamp
30 * iter->user_data = SortLevel
31 * iter->user_data2 = SortElt
34 /* WARNING: this code is dangerous, can cause sleepless nights,
35 * can cause your dog to die among other bad things
37 * we warned you and we're not liable for any head injuries.
43 #include "gtktreemodelsort.h"
44 #include "gtktreesortable.h"
45 #include "gtktreestore.h"
46 #include "gtktreedatalist.h"
48 #include "gtktreednd.h"
51 typedef struct _SortElt SortElt;
52 typedef struct _SortLevel SortLevel;
53 typedef struct _SortData SortData;
54 typedef struct _SortTuple SortTuple;
70 SortLevel *parent_level;
75 GtkTreeModelSort *tree_model_sort;
76 GtkTreePath *parent_path;
77 gint parent_path_depth;
78 gint *parent_path_indices;
79 GtkTreeIterCompareFunc sort_func;
98 #define GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS(tree_model_sort) \
99 (((GtkTreeModelSort *)tree_model_sort)->child_flags>K_TREE_MODEL_ITERS_PERSIST)
100 #define SORT_ELT(sort_elt) ((SortElt *)sort_elt)
101 #define SORT_LEVEL(sort_level) ((SortLevel *)sort_level)
103 #define GET_CHILD_ITER(tree_model_sort,ch_iter,so_iter) gtk_tree_model_sort_convert_iter_to_child_iter(GTK_TREE_MODEL_SORT (tree_model_sort), ch_iter, so_iter);
105 #define NO_SORT_FUNC ((GtkTreeIterCompareFunc) 0x1)
107 #define VALID_ITER(iter, tree_model_sort) (iter != NULL && iter->user_data != NULL && iter->user_data2 != NULL && tree_model_sort->stamp == iter->stamp)
109 /* general (object/interface init, etc) */
110 static void gtk_tree_model_sort_init (GtkTreeModelSort *tree_model_sort);
111 static void gtk_tree_model_sort_class_init (GtkTreeModelSortClass *tree_model_sort_class);
112 static void gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface);
113 static void gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface);
114 static void gtk_tree_model_sort_drag_source_init (GtkTreeDragSourceIface*iface);
115 static void gtk_tree_model_sort_finalize (GObject *object);
116 static void gtk_tree_model_sort_set_property (GObject *object,
120 static void gtk_tree_model_sort_get_property (GObject *object,
125 /* our signal handlers */
126 static void gtk_tree_model_sort_row_changed (GtkTreeModel *model,
127 GtkTreePath *start_path,
128 GtkTreeIter *start_iter,
130 static void gtk_tree_model_sort_row_inserted (GtkTreeModel *model,
134 static void gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *model,
138 static void gtk_tree_model_sort_row_deleted (GtkTreeModel *model,
141 static void gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
147 /* TreeModel interface */
148 static GtkTreeModelFlags gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model);
149 static gint gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model);
150 static GType gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
152 static gboolean gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
155 static GtkTreePath *gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
157 static void gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
161 static gboolean gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
163 static gboolean gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
165 GtkTreeIter *parent);
166 static gboolean gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
168 static gint gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
170 static gboolean gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
174 static gboolean gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
177 static void gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
179 static void gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
181 gboolean propagate_unref);
182 static void gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
185 /* TreeDragSource interface */
186 static gboolean gtk_tree_model_sort_row_draggable (GtkTreeDragSource *drag_source,
188 static gboolean gtk_tree_model_sort_drag_data_get (GtkTreeDragSource *drag_source,
190 GtkSelectionData *selection_data);
191 static gboolean gtk_tree_model_sort_drag_data_delete (GtkTreeDragSource *drag_source,
194 /* TreeSortable interface */
195 static gboolean gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
196 gint *sort_column_id,
198 static void gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
201 static void gtk_tree_model_sort_set_sort_func (GtkTreeSortable *sortable,
203 GtkTreeIterCompareFunc func,
205 GtkDestroyNotify destroy);
206 static void gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable *sortable,
207 GtkTreeIterCompareFunc func,
209 GtkDestroyNotify destroy);
210 static gboolean gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable);
212 /* Private functions (sort funcs, level handling and other utils) */
213 static void gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
214 SortLevel *parent_level,
215 SortElt *parent_elt);
216 static void gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
217 SortLevel *sort_level);
218 static void gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort);
219 static void gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
222 gboolean emit_reordered);
223 static void gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort);
224 static gint gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
228 static gboolean gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
231 GtkTreeIter *s_iter);
232 static GtkTreePath *gtk_tree_model_sort_elt_get_path (SortLevel *level,
234 static void gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
235 GtkTreeModel *child_model);
236 static GtkTreePath *gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
237 GtkTreePath *child_path,
238 gboolean build_levels);
240 static GObjectClass *parent_class = NULL;
243 gtk_tree_model_sort_get_type (void)
245 static GType tree_model_sort_type = 0;
247 if (!tree_model_sort_type)
249 static const GTypeInfo tree_model_sort_info =
251 sizeof (GtkTreeModelSortClass),
252 NULL, /* base_init */
253 NULL, /* base_finalize */
254 (GClassInitFunc) gtk_tree_model_sort_class_init,
255 NULL, /* class_finalize */
256 NULL, /* class_data */
257 sizeof (GtkTreeModelSort),
259 (GInstanceInitFunc) gtk_tree_model_sort_init
262 static const GInterfaceInfo tree_model_info =
264 (GInterfaceInitFunc) gtk_tree_model_sort_tree_model_init,
269 static const GInterfaceInfo sortable_info =
271 (GInterfaceInitFunc) gtk_tree_model_sort_tree_sortable_init,
276 static const GInterfaceInfo drag_source_info =
278 (GInterfaceInitFunc) gtk_tree_model_sort_drag_source_init,
283 tree_model_sort_type =
284 g_type_register_static (G_TYPE_OBJECT, "GtkTreeModelSort",
285 &tree_model_sort_info, 0);
287 g_type_add_interface_static (tree_model_sort_type,
291 g_type_add_interface_static (tree_model_sort_type,
292 GTK_TYPE_TREE_SORTABLE,
295 g_type_add_interface_static (tree_model_sort_type,
296 GTK_TYPE_TREE_DRAG_SOURCE,
300 return tree_model_sort_type;
304 gtk_tree_model_sort_init (GtkTreeModelSort *tree_model_sort)
306 tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
307 tree_model_sort->stamp = 0;
308 tree_model_sort->zero_ref_count = 0;
309 tree_model_sort->root = NULL;
310 tree_model_sort->sort_list = NULL;
314 gtk_tree_model_sort_class_init (GtkTreeModelSortClass *class)
316 GObjectClass *object_class;
318 object_class = (GObjectClass *) class;
319 parent_class = g_type_class_peek_parent (class);
321 object_class->set_property = gtk_tree_model_sort_set_property;
322 object_class->get_property = gtk_tree_model_sort_get_property;
324 object_class->finalize = gtk_tree_model_sort_finalize;
327 g_object_class_install_property (object_class,
329 g_param_spec_object ("model",
330 P_("TreeModelSort Model"),
331 P_("The model for the TreeModelSort to sort"),
333 G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY));
337 gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface)
339 iface->get_flags = gtk_tree_model_sort_get_flags;
340 iface->get_n_columns = gtk_tree_model_sort_get_n_columns;
341 iface->get_column_type = gtk_tree_model_sort_get_column_type;
342 iface->get_iter = gtk_tree_model_sort_get_iter;
343 iface->get_path = gtk_tree_model_sort_get_path;
344 iface->get_value = gtk_tree_model_sort_get_value;
345 iface->iter_next = gtk_tree_model_sort_iter_next;
346 iface->iter_children = gtk_tree_model_sort_iter_children;
347 iface->iter_has_child = gtk_tree_model_sort_iter_has_child;
348 iface->iter_n_children = gtk_tree_model_sort_iter_n_children;
349 iface->iter_nth_child = gtk_tree_model_sort_iter_nth_child;
350 iface->iter_parent = gtk_tree_model_sort_iter_parent;
351 iface->ref_node = gtk_tree_model_sort_ref_node;
352 iface->unref_node = gtk_tree_model_sort_unref_node;
356 gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface)
358 iface->get_sort_column_id = gtk_tree_model_sort_get_sort_column_id;
359 iface->set_sort_column_id = gtk_tree_model_sort_set_sort_column_id;
360 iface->set_sort_func = gtk_tree_model_sort_set_sort_func;
361 iface->set_default_sort_func = gtk_tree_model_sort_set_default_sort_func;
362 iface->has_default_sort_func = gtk_tree_model_sort_has_default_sort_func;
366 gtk_tree_model_sort_drag_source_init (GtkTreeDragSourceIface *iface)
368 iface->row_draggable = gtk_tree_model_sort_row_draggable;
369 iface->drag_data_delete = gtk_tree_model_sort_drag_data_delete;
370 iface->drag_data_get = gtk_tree_model_sort_drag_data_get;
374 * gtk_tree_model_sort_new_with_model:
375 * @child_model: A #GtkTreeModel
377 * Creates a new #GtkTreeModel, with @child_model as the child_model.
379 * Return value: A new #GtkTreeModel.
382 gtk_tree_model_sort_new_with_model (GtkTreeModel *child_model)
384 GtkTreeModel *retval;
386 g_return_val_if_fail (GTK_IS_TREE_MODEL (child_model), NULL);
388 retval = g_object_new (gtk_tree_model_sort_get_type (), NULL);
390 gtk_tree_model_sort_set_model (GTK_TREE_MODEL_SORT (retval), child_model);
395 /* GObject callbacks */
397 gtk_tree_model_sort_finalize (GObject *object)
399 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) object;
401 gtk_tree_model_sort_set_model (tree_model_sort, NULL);
403 if (tree_model_sort->root)
404 gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
406 if (tree_model_sort->sort_list)
408 _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
409 tree_model_sort->sort_list = NULL;
413 parent_class->finalize (object);
417 gtk_tree_model_sort_set_property (GObject *object,
422 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
427 gtk_tree_model_sort_set_model (tree_model_sort, g_value_get_object (value));
430 G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
436 gtk_tree_model_sort_get_property (GObject *object,
441 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
446 g_value_set_object (value, gtk_tree_model_sort_get_model(tree_model_sort));
449 G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
455 gtk_tree_model_sort_row_changed (GtkTreeModel *s_model,
456 GtkTreePath *start_s_path,
457 GtkTreeIter *start_s_iter,
460 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
461 GtkTreePath *path = NULL;
469 gboolean free_s_path = FALSE;
471 gint index = 0, old_index, i;
473 g_return_if_fail (start_s_path != NULL || start_s_iter != NULL);
478 start_s_path = gtk_tree_model_get_path (s_model, start_s_iter);
481 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
487 gtk_tree_path_free (start_s_path);
491 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
493 level = iter.user_data;
494 elt = iter.user_data2;
496 if (level->array->len < 2 ||
497 (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
498 tree_model_sort->default_sort_func == NO_SORT_FUNC))
501 gtk_tree_path_free (start_s_path);
503 gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
505 gtk_tree_path_free (path);
510 if (!GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
512 gtk_tree_model_get_iter (tree_model_sort->child_model,
513 &tmpiter, start_s_path);
516 old_index = elt - SORT_ELT (level->array->data);
518 memcpy (&tmp, elt, sizeof (SortElt));
520 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
521 index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
526 index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
531 if (index < old_index)
533 g_memmove (level->array->data + ((index + 1)*sizeof (SortElt)),
534 level->array->data + ((index)*sizeof (SortElt)),
535 (old_index - index)* sizeof(SortElt));
537 else if (index > old_index)
539 g_memmove (level->array->data + ((old_index)*sizeof (SortElt)),
540 level->array->data + ((old_index + 1)*sizeof (SortElt)),
541 (index - old_index)* sizeof(SortElt));
543 memcpy (level->array->data + ((index)*sizeof (SortElt)),
544 &tmp, sizeof (SortElt));
546 for (i = 0; i < level->array->len; i++)
547 if (g_array_index (level->array, SortElt, i).children)
548 g_array_index (level->array, SortElt, i).children->parent_elt = &g_array_index (level->array, SortElt, i);
550 gtk_tree_path_up (path);
551 gtk_tree_path_append_index (path, index);
553 gtk_tree_model_sort_increment_stamp (tree_model_sort);
555 /* if the item moved, then emit rows_reordered */
556 if (old_index != index)
561 GtkTreePath *tmppath;
563 new_order = g_new (gint, level->array->len);
565 for (j = 0; j < level->array->len; j++)
567 if (index > old_index)
570 new_order[j] = old_index;
571 else if (j >= old_index && j < index)
572 new_order[j] = j + 1;
576 else if (index < old_index)
579 new_order[j] = old_index;
580 else if (j > index && j <= old_index)
581 new_order[j] = j - 1;
585 /* else? shouldn't really happen */
588 if (level->parent_elt)
590 iter.stamp = tree_model_sort->stamp;
591 iter.user_data = level->parent_level;
592 iter.user_data2 = level->parent_elt;
594 tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort), &iter);
596 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
597 tmppath, &iter, new_order);
602 tmppath = gtk_tree_path_new ();
604 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), tmppath,
608 gtk_tree_path_free (tmppath);
612 /* emit row_changed signal (at new location) */
613 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
614 gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
616 gtk_tree_path_free (path);
618 gtk_tree_path_free (start_s_path);
622 gtk_tree_model_sort_row_inserted (GtkTreeModel *s_model,
627 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
630 GtkTreeIter real_s_iter;
634 gboolean free_s_path = FALSE;
638 SortLevel *parent_level = NULL;
640 parent_level = level = SORT_LEVEL (tree_model_sort->root);
642 g_return_if_fail (s_path != NULL || s_iter != NULL);
646 s_path = gtk_tree_model_get_path (s_model, s_iter);
651 gtk_tree_model_get_iter (s_model, &real_s_iter, s_path);
653 real_s_iter = *s_iter;
655 if (!tree_model_sort->root)
657 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
659 /* the build level already put the inserted iter in the level,
660 so no need to handle this signal anymore */
662 goto done_and_submit;
665 /* find the parent level */
666 while (i < gtk_tree_path_get_depth (s_path) - 1)
672 /* level not yet build, we won't cover this signal */
676 if (level->array->len < gtk_tree_path_get_indices (s_path)[i])
678 g_warning ("A node was inserted with a parent that's not in the tree.\n"
679 "This possibly means that a GtkTreeModel inserted a child node\n"
680 "before the parent was inserted.");
685 for (j = 0; j < level->array->len; j++)
686 if (g_array_index (level->array, SortElt, j).offset == gtk_tree_path_get_indices (s_path)[i])
688 elt = &g_array_index (level->array, SortElt, j);
692 g_return_if_fail (elt != NULL);
696 GtkTreePath *tmppath;
699 tmpiter.stamp = tree_model_sort->stamp;
700 tmpiter.user_data = level;
701 tmpiter.user_data2 = elt;
703 tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (data), &tmpiter);
706 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data),
709 gtk_tree_path_free (tmppath);
712 /* not covering this signal */
716 level = elt->children;
717 parent_level = level;
724 if (!gtk_tree_model_sort_insert_value (tree_model_sort,
731 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
738 gtk_tree_model_sort_increment_stamp (tree_model_sort);
740 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
741 gtk_tree_model_row_inserted (GTK_TREE_MODEL (data), path, &iter);
742 gtk_tree_path_free (path);
746 gtk_tree_path_free (s_path);
752 gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *s_model,
757 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
761 g_return_if_fail (s_path != NULL && s_iter != NULL);
763 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
767 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
768 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data), path, &iter);
770 gtk_tree_path_free (path);
773 /* FIXME: I still have doubts if this works */
775 gtk_tree_model_sort_row_deleted (GtkTreeModel *s_model,
779 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
780 GtkTreePath *path = NULL;
787 g_return_if_fail (s_path != NULL);
789 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
793 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
795 level = SORT_LEVEL (iter.user_data);
796 elt = SORT_ELT (iter.user_data2);
797 offset = elt->offset;
799 /* we _need_ to emit ::row_deleted before we start unreffing the node
800 * itself. This is because of the row refs, which start unreffing nodes
801 * when we emit ::row_deleted
803 gtk_tree_model_row_deleted (GTK_TREE_MODEL (data), path);
805 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
807 while (elt->ref_count > 0)
808 gtk_tree_model_sort_real_unref_node (GTK_TREE_MODEL (data), &iter, FALSE);
810 if (level->ref_count == 0)
812 /* This will prune the level, so I can just emit the signal and not worry
813 * about cleaning this level up. */
814 gtk_tree_model_sort_increment_stamp (tree_model_sort);
815 gtk_tree_path_free (path);
816 if (level == tree_model_sort->root)
817 tree_model_sort->root = NULL;
821 gtk_tree_model_sort_increment_stamp (tree_model_sort);
824 for (i = 0; i < level->array->len; i++)
825 if (elt->offset == g_array_index (level->array, SortElt, i).offset)
828 g_array_remove_index (level->array, i);
830 /* update all offsets */
831 for (i = 0; i < level->array->len; i++)
833 elt = & (g_array_index (level->array, SortElt, i));
834 if (elt->offset > offset)
837 elt->children->parent_elt = elt;
840 gtk_tree_path_free (path);
844 gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
856 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
858 g_return_if_fail (new_order != NULL);
860 if (s_path == NULL || gtk_tree_path_get_indices (s_path) == NULL)
862 if (tree_model_sort->root == NULL)
864 path = gtk_tree_path_new ();
865 level = SORT_LEVEL (tree_model_sort->root);
869 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
872 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
874 level = SORT_LEVEL (iter.user_data);
875 elt = SORT_ELT (iter.user_data2);
879 gtk_tree_path_free (path);
883 level = elt->children;
886 if (level->array->len < 2)
888 gtk_tree_path_free (path);
892 tmp_array = g_new (int, level->array->len);
893 for (i = 0; i < level->array->len; i++)
895 for (j = 0; j < level->array->len; j++)
897 if (g_array_index (level->array, SortElt, i).offset == new_order[j])
902 for (i = 0; i < level->array->len; i++)
903 g_array_index (level->array, SortElt, i).offset = tmp_array[i];
906 if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
907 tree_model_sort->default_sort_func == NO_SORT_FUNC)
910 gtk_tree_model_sort_sort_level (tree_model_sort, level,
912 gtk_tree_model_sort_increment_stamp (tree_model_sort);
914 if (gtk_tree_path_get_depth (path))
916 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort),
919 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
920 path, &iter, new_order);
924 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
925 path, NULL, new_order);
929 gtk_tree_path_free (path);
932 /* Fulfill our model requirements */
933 static GtkTreeModelFlags
934 gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model)
936 GtkTreeModelFlags flags;
938 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
939 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, 0);
941 flags = gtk_tree_model_get_flags (GTK_TREE_MODEL_SORT (tree_model)->child_model);
943 if ((flags & GTK_TREE_MODEL_LIST_ONLY) == GTK_TREE_MODEL_LIST_ONLY)
944 return GTK_TREE_MODEL_LIST_ONLY;
950 gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model)
952 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
954 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
956 if (tree_model_sort->child_model == 0)
959 return gtk_tree_model_get_n_columns (tree_model_sort->child_model);
963 gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
966 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), G_TYPE_INVALID);
967 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, G_TYPE_INVALID);
969 return gtk_tree_model_get_column_type (GTK_TREE_MODEL_SORT (tree_model)->child_model, index);
973 gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
977 GtkTreeModelSort *tree_model_sort;
982 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
983 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
985 tree_model_sort = (GtkTreeModelSort *) tree_model;
986 indices = gtk_tree_path_get_indices (path);
988 if (tree_model_sort->root == NULL)
989 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
990 level = SORT_LEVEL (tree_model_sort->root);
992 depth = gtk_tree_path_get_depth (path);
996 for (i = 0; i < depth - 1; i++)
998 if ((level == NULL) ||
999 (indices[i] >= level->array->len))
1002 if (g_array_index (level->array, SortElt, indices[i]).children == NULL)
1003 gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, indices[i]));
1004 level = g_array_index (level->array, SortElt, indices[i]).children;
1007 if (!level || indices[i] >= level->array->len)
1013 iter->stamp = tree_model_sort->stamp;
1014 iter->user_data = level;
1015 iter->user_data2 = &g_array_index (level->array, SortElt, indices[depth - 1]);
1020 static GtkTreePath *
1021 gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
1024 GtkTreePath *retval;
1028 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
1029 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, NULL);
1030 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, NULL);
1032 retval = gtk_tree_path_new ();
1033 level = iter->user_data;
1034 elt = iter->user_data2;
1035 while (level != NULL)
1037 gtk_tree_path_prepend_index (retval, elt - (SortElt *)level->array->data);
1039 elt = level->parent_elt;
1040 level = level->parent_level;
1047 gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
1052 GtkTreeIter child_iter;
1054 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1055 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1056 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1058 GET_CHILD_ITER (tree_model, &child_iter, iter);
1059 gtk_tree_model_get_value (GTK_TREE_MODEL_SORT (tree_model)->child_model,
1060 &child_iter, column, value);
1064 gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
1070 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1071 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1072 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
1074 level = iter->user_data;
1075 elt = iter->user_data2;
1077 if (elt - (SortElt *)level->array->data >= level->array->len - 1)
1082 iter->user_data2 = elt + 1;
1088 gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
1090 GtkTreeIter *parent)
1092 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1096 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1097 g_return_val_if_fail (tree_model_sort->child_model != NULL, FALSE);
1098 if (parent) g_return_val_if_fail (tree_model_sort->stamp == parent->stamp, FALSE);
1102 if (tree_model_sort->root == NULL)
1103 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1104 if (tree_model_sort->root == NULL)
1107 level = tree_model_sort->root;
1108 iter->stamp = tree_model_sort->stamp;
1109 iter->user_data = level;
1110 iter->user_data2 = level->array->data;
1114 if (((SortElt *)parent->user_data2)->children == NULL)
1115 gtk_tree_model_sort_build_level (tree_model_sort,
1116 (SortLevel *)parent->user_data,
1117 (SortElt *)parent->user_data2);
1118 if (((SortElt *)parent->user_data2)->children == NULL)
1120 iter->stamp = tree_model_sort->stamp;
1121 iter->user_data = ((SortElt *)parent->user_data2)->children;
1122 iter->user_data2 = ((SortLevel *)iter->user_data)->array->data;
1129 gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
1132 GtkTreeIter child_iter;
1134 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1135 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1136 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
1138 GET_CHILD_ITER (tree_model, &child_iter, iter);
1140 return gtk_tree_model_iter_has_child (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1144 gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
1147 GtkTreeIter child_iter;
1149 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
1150 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, 0);
1151 if (iter) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, 0);
1154 return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, NULL);
1156 GET_CHILD_ITER (tree_model, &child_iter, iter);
1158 return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1162 gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
1164 GtkTreeIter *parent,
1168 /* We have this for the iter == parent case */
1169 GtkTreeIter children;
1171 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1172 if (parent) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == parent->stamp, FALSE);
1174 /* Use this instead of has_child to force us to build the level, if needed */
1175 if (gtk_tree_model_sort_iter_children (tree_model, &children, parent) == FALSE)
1181 level = children.user_data;
1182 if (n >= level->array->len)
1188 iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1189 iter->user_data = level;
1190 iter->user_data2 = &g_array_index (level->array, SortElt, n);
1196 gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
1203 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1204 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1205 g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == child->stamp, FALSE);
1207 level = child->user_data;
1209 if (level->parent_level)
1211 iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1212 iter->user_data = level->parent_level;
1213 iter->user_data2 = level->parent_elt;
1221 gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
1224 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1225 GtkTreeIter child_iter;
1229 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1230 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1231 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1233 GET_CHILD_ITER (tree_model, &child_iter, iter);
1235 gtk_tree_model_ref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1237 level = iter->user_data;
1238 elt = iter->user_data2;
1242 if (level->ref_count == 1)
1244 SortLevel *parent_level = level->parent_level;
1245 SortElt *parent_elt = level->parent_elt;
1246 /* We were at zero -- time to decrement the zero_ref_count val */
1250 parent_elt->zero_ref_count--;
1252 tree_model_sort->zero_ref_count--;
1256 parent_elt = parent_level->parent_elt;
1257 parent_level = parent_level->parent_level;
1260 while (parent_level);
1265 gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
1267 gboolean propagate_unref)
1269 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1270 GtkTreeIter child_iter;
1274 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1275 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1276 g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1278 GET_CHILD_ITER (tree_model, &child_iter, iter);
1280 if (propagate_unref)
1281 gtk_tree_model_unref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1283 level = iter->user_data;
1284 elt = iter->user_data2;
1286 g_return_if_fail (elt->ref_count > 0);
1291 if (level->ref_count == 0)
1293 SortLevel *parent_level = level->parent_level;
1294 SortElt *parent_elt = level->parent_elt;
1296 /* We are at zero -- time to increment the zero_ref_count val */
1297 while (parent_level)
1299 parent_elt->zero_ref_count++;
1301 parent_elt = parent_level->parent_elt;
1302 parent_level = parent_level->parent_level;
1304 tree_model_sort->zero_ref_count++;
1309 gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
1312 gtk_tree_model_sort_real_unref_node (tree_model, iter, TRUE);
1315 /* Sortable interface */
1317 gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
1318 gint *sort_column_id,
1321 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1323 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1326 *sort_column_id = tree_model_sort->sort_column_id;
1328 *order = tree_model_sort->order;
1330 if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID ||
1331 tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
1338 gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
1339 gint sort_column_id,
1342 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1344 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1346 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1348 GtkTreeDataSortHeader *header = NULL;
1350 header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1353 /* we want to make sure that we have a function */
1354 g_return_if_fail (header != NULL);
1355 g_return_if_fail (header->func != NULL);
1358 g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1360 if (tree_model_sort->sort_column_id == sort_column_id)
1362 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1364 if (tree_model_sort->order == order)
1371 tree_model_sort->sort_column_id = sort_column_id;
1372 tree_model_sort->order = order;
1374 gtk_tree_sortable_sort_column_changed (sortable);
1376 gtk_tree_model_sort_sort (tree_model_sort);
1380 gtk_tree_model_sort_set_sort_func (GtkTreeSortable *sortable,
1381 gint sort_column_id,
1382 GtkTreeIterCompareFunc func,
1384 GtkDestroyNotify destroy)
1386 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) sortable;
1387 GtkTreeDataSortHeader *header = NULL;
1390 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1391 g_return_if_fail (func != NULL);
1393 for (list = tree_model_sort->sort_list; list; list = list->next)
1395 GtkTreeDataSortHeader *list_header;
1397 list_header = (GtkTreeDataSortHeader*) list->data;
1398 if (list_header->sort_column_id == sort_column_id)
1400 header = list_header;
1407 header = g_new0 (GtkTreeDataSortHeader, 1);
1408 header->sort_column_id = sort_column_id;
1409 tree_model_sort->sort_list = g_list_append (tree_model_sort->sort_list,
1413 if (header->destroy)
1415 GtkDestroyNotify d = header->destroy;
1417 header->destroy = NULL;
1421 header->func = func;
1422 header->data = data;
1423 header->destroy = destroy;
1425 if (tree_model_sort->sort_column_id == sort_column_id)
1426 gtk_tree_model_sort_sort (tree_model_sort);
1430 gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable *sortable,
1431 GtkTreeIterCompareFunc func,
1433 GtkDestroyNotify destroy)
1435 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1437 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1439 if (tree_model_sort->default_sort_destroy)
1441 GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
1443 tree_model_sort->default_sort_destroy = NULL;
1444 d (tree_model_sort->default_sort_data);
1447 tree_model_sort->default_sort_func = func;
1448 tree_model_sort->default_sort_data = data;
1449 tree_model_sort->default_sort_destroy = destroy;
1451 if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1452 gtk_tree_model_sort_sort (tree_model_sort);
1456 gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable)
1458 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1460 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1462 return (tree_model_sort->default_sort_func != NULL);
1465 /* DragSource interface */
1467 gtk_tree_model_sort_row_draggable (GtkTreeDragSource *drag_source,
1470 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1471 GtkTreePath *child_path;
1474 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (drag_source), FALSE);
1475 g_return_val_if_fail (path != NULL, FALSE);
1477 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort,
1479 draggable = gtk_tree_drag_source_row_draggable (GTK_TREE_DRAG_SOURCE (tree_model_sort->child_model), child_path);
1480 gtk_tree_path_free (child_path);
1486 gtk_tree_model_sort_drag_data_get (GtkTreeDragSource *drag_source,
1488 GtkSelectionData *selection_data)
1490 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1491 GtkTreePath *child_path;
1494 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (drag_source), FALSE);
1495 g_return_val_if_fail (path != NULL, FALSE);
1497 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort,
1499 gotten = gtk_tree_drag_source_drag_data_get (GTK_TREE_DRAG_SOURCE (tree_model_sort->child_model), child_path, selection_data);
1500 gtk_tree_path_free (child_path);
1506 gtk_tree_model_sort_drag_data_delete (GtkTreeDragSource *drag_source,
1509 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1510 GtkTreePath *child_path;
1513 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (drag_source), FALSE);
1514 g_return_val_if_fail (path != NULL, FALSE);
1516 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort,
1518 deleted = gtk_tree_drag_source_drag_data_delete (GTK_TREE_DRAG_SOURCE (tree_model_sort->child_model), child_path);
1519 gtk_tree_path_free (child_path);
1524 /* sorting code - private */
1526 gtk_tree_model_sort_compare_func (gconstpointer a,
1530 SortData *data = (SortData *)user_data;
1531 GtkTreeModelSort *tree_model_sort = data->tree_model_sort;
1532 SortTuple *sa = (SortTuple *)a;
1533 SortTuple *sb = (SortTuple *)b;
1535 GtkTreeIter iter_a, iter_b;
1538 /* shortcut, if we've the same offsets here, they should be equal */
1539 if (sa->offset == sb->offset)
1542 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1544 iter_a = sa->elt->iter;
1545 iter_b = sb->elt->iter;
1549 data->parent_path_indices [data->parent_path_depth-1] = sa->elt->offset;
1550 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_a, data->parent_path);
1551 data->parent_path_indices [data->parent_path_depth-1] = sb->elt->offset;
1552 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_b, data->parent_path);
1555 retval = (* data->sort_func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1559 if (tree_model_sort->order == GTK_SORT_DESCENDING)
1563 else if (retval < 0)
1571 gtk_tree_model_sort_offset_compare_func (gconstpointer a,
1577 SortTuple *sa = (SortTuple *)a;
1578 SortTuple *sb = (SortTuple *)b;
1580 SortData *data = (SortData *)user_data;
1582 if (sa->elt->offset < sb->elt->offset)
1584 else if (sa->elt->offset > sb->elt->offset)
1589 if (data->tree_model_sort->order == GTK_SORT_DESCENDING)
1593 else if (retval < 0)
1601 gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
1604 gboolean emit_reordered)
1616 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1617 g_return_if_fail (level != NULL);
1619 if (level->array->len < 1 && !((SortElt *)level->array->data)->children)
1623 data.tree_model_sort = tree_model_sort;
1624 if (level->parent_elt)
1626 data.parent_path = gtk_tree_model_sort_elt_get_path (level->parent_level,
1628 gtk_tree_path_append_index (data.parent_path, 0);
1632 data.parent_path = gtk_tree_path_new_first ();
1634 data.parent_path_depth = gtk_tree_path_get_depth (data.parent_path);
1635 data.parent_path_indices = gtk_tree_path_get_indices (data.parent_path);
1637 /* make the array to be sorted */
1638 sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), level->array->len);
1639 for (i = 0; i < level->array->len; i++)
1643 tuple.elt = &g_array_index (level->array, SortElt, i);
1646 g_array_append_val (sort_array, tuple);
1649 if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1651 GtkTreeDataSortHeader *header = NULL;
1653 header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1654 tree_model_sort->sort_column_id);
1656 g_return_if_fail (header != NULL);
1657 g_return_if_fail (header->func != NULL);
1659 data.sort_func = header->func;
1660 data.sort_data = header->data;
1664 /* absolutely SHOULD NOT happen: */
1665 g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1667 data.sort_func = tree_model_sort->default_sort_func;
1668 data.sort_data = tree_model_sort->default_sort_data;
1671 if (data.sort_func == NO_SORT_FUNC)
1672 g_array_sort_with_data (sort_array,
1673 gtk_tree_model_sort_offset_compare_func,
1676 g_array_sort_with_data (sort_array,
1677 gtk_tree_model_sort_compare_func,
1680 gtk_tree_path_free (data.parent_path);
1682 new_array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), level->array->len);
1683 new_order = g_new (gint, level->array->len);
1685 for (i = 0; i < level->array->len; i++)
1689 elt = g_array_index (sort_array, SortTuple, i).elt;
1690 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
1692 g_array_append_val (new_array, *elt);
1693 elt = &g_array_index (new_array, SortElt, i);
1695 elt->children->parent_elt = elt;
1698 g_array_free (level->array, TRUE);
1699 level->array = new_array;
1700 g_array_free (sort_array, TRUE);
1704 gtk_tree_model_sort_increment_stamp (tree_model_sort);
1705 if (level->parent_elt)
1707 iter.stamp = tree_model_sort->stamp;
1708 iter.user_data = level->parent_level;
1709 iter.user_data2 = level->parent_elt;
1711 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort),
1714 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1720 path = gtk_tree_path_new ();
1721 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1725 gtk_tree_path_free (path);
1728 /* recurse, if possible */
1731 for (i = 0; i < level->array->len; i++)
1733 SortElt *elt = &g_array_index (level->array, SortElt, i);
1736 gtk_tree_model_sort_sort_level (tree_model_sort,
1738 TRUE, emit_reordered);
1746 gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort)
1748 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1750 if (!tree_model_sort->root)
1753 if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1755 GtkTreeDataSortHeader *header = NULL;
1757 header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1758 tree_model_sort->sort_column_id);
1760 /* we want to make sure that we have a function */
1761 g_return_if_fail (header != NULL);
1762 g_return_if_fail (header->func != NULL);
1765 g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1767 gtk_tree_model_sort_sort_level (tree_model_sort, tree_model_sort->root,
1771 /* signal helpers */
1773 gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
1778 gint start, middle, end;
1781 GtkTreeIter tmp_iter;
1783 GtkTreeIterCompareFunc func;
1786 if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1788 GtkTreeDataSortHeader *header;
1790 header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1791 tree_model_sort->sort_column_id);
1793 g_return_val_if_fail (header != NULL, 0);
1795 func = header->func;
1796 data = header->data;
1800 func = tree_model_sort->default_sort_func;
1801 data = tree_model_sort->default_sort_data;
1803 g_return_val_if_fail (func != NO_SORT_FUNC, 0);
1806 g_return_val_if_fail (func != NULL, 0);
1809 end = level->array->len;
1818 while (start != end)
1820 middle = (start + end) / 2;
1822 if (middle < skip_index)
1823 tmp_elt = &(g_array_index (level->array, SortElt, middle));
1825 tmp_elt = &(g_array_index (level->array, SortElt, middle + 1));
1827 if (!GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1829 GtkTreePath *path = gtk_tree_model_sort_elt_get_path (level, tmp_elt);
1830 gtk_tree_model_get_iter (tree_model_sort->child_model,
1832 gtk_tree_path_free (path);
1835 tmp_iter = tmp_elt->iter;
1837 if (tree_model_sort->order == GTK_SORT_ASCENDING)
1838 cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1839 &tmp_iter, iter, data);
1841 cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1842 iter, &tmp_iter, data);
1857 gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
1859 GtkTreePath *s_path,
1860 GtkTreeIter *s_iter)
1862 gint offset, index, i;
1867 offset = gtk_tree_path_get_indices (s_path)[gtk_tree_path_get_depth (s_path) - 1];
1869 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1871 elt.offset = offset;
1872 elt.zero_ref_count = 0;
1874 elt.children = NULL;
1876 /* update all larger offsets */
1877 tmp_elt = SORT_ELT (level->array->data);
1878 for (i = 0; i < level->array->len; i++, tmp_elt++)
1879 if (tmp_elt->offset >= offset)
1882 if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
1883 tree_model_sort->default_sort_func == NO_SORT_FUNC)
1886 index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
1890 g_array_insert_vals (level->array, index, &elt, 1);
1891 tmp_elt = SORT_ELT (level->array->data);
1892 for (i = 0; i < level->array->len; i++, tmp_elt++)
1893 if (tmp_elt->children)
1894 tmp_elt->children->parent_elt = tmp_elt;
1899 /* sort elt stuff */
1900 static GtkTreePath *
1901 gtk_tree_model_sort_elt_get_path (SortLevel *level,
1904 SortLevel *walker = level;
1905 SortElt *walker2 = elt;
1908 g_return_val_if_fail (level != NULL, NULL);
1909 g_return_val_if_fail (elt != NULL, NULL);
1911 path = gtk_tree_path_new ();
1915 gtk_tree_path_prepend_index (path, walker2->offset);
1917 walker2 = walker->parent_elt;
1918 walker = walker->parent_level;
1925 * gtk_tree_model_sort_set_model:
1926 * @tree_model_sort: The #GtkTreeModelSort.
1927 * @child_model: A #GtkTreeModel, or NULL.
1929 * Sets the model of @tree_model_sort to be @model. If @model is NULL, then the
1930 * old model is unset. The sort function is unset as a result of this call.
1931 * The model will be in an unsorted state until a sort function is set.
1934 gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
1935 GtkTreeModel *child_model)
1937 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1940 g_object_ref (child_model);
1942 if (tree_model_sort->child_model)
1944 g_signal_handler_disconnect (tree_model_sort->child_model,
1945 tree_model_sort->changed_id);
1946 g_signal_handler_disconnect (tree_model_sort->child_model,
1947 tree_model_sort->inserted_id);
1948 g_signal_handler_disconnect (tree_model_sort->child_model,
1949 tree_model_sort->has_child_toggled_id);
1950 g_signal_handler_disconnect (tree_model_sort->child_model,
1951 tree_model_sort->deleted_id);
1952 g_signal_handler_disconnect (tree_model_sort->child_model,
1953 tree_model_sort->reordered_id);
1955 /* reset our state */
1956 if (tree_model_sort->root)
1957 gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
1958 tree_model_sort->root = NULL;
1959 _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
1960 tree_model_sort->sort_list = NULL;
1961 g_object_unref (tree_model_sort->child_model);
1964 tree_model_sort->child_model = child_model;
1971 tree_model_sort->changed_id =
1972 g_signal_connect (child_model, "row_changed",
1973 G_CALLBACK (gtk_tree_model_sort_row_changed),
1975 tree_model_sort->inserted_id =
1976 g_signal_connect (child_model, "row_inserted",
1977 G_CALLBACK (gtk_tree_model_sort_row_inserted),
1979 tree_model_sort->has_child_toggled_id =
1980 g_signal_connect (child_model, "row_has_child_toggled",
1981 G_CALLBACK (gtk_tree_model_sort_row_has_child_toggled),
1983 tree_model_sort->deleted_id =
1984 g_signal_connect (child_model, "row_deleted",
1985 G_CALLBACK (gtk_tree_model_sort_row_deleted),
1987 tree_model_sort->reordered_id =
1988 g_signal_connect (child_model, "rows_reordered",
1989 G_CALLBACK (gtk_tree_model_sort_rows_reordered),
1992 tree_model_sort->child_flags = gtk_tree_model_get_flags (child_model);
1993 n_columns = gtk_tree_model_get_n_columns (child_model);
1995 types = g_new (GType, n_columns);
1996 for (i = 0; i < n_columns; i++)
1997 types[i] = gtk_tree_model_get_column_type (child_model, i);
1999 tree_model_sort->sort_list = _gtk_tree_data_list_header_new (n_columns, types);
2002 tree_model_sort->default_sort_func = NO_SORT_FUNC;
2003 tree_model_sort->stamp = g_random_int ();
2008 * gtk_tree_model_sort_get_model:
2009 * @tree_model: a #GtkTreeModelSort
2011 * Returns the model the #GtkTreeModelSort is sorting.
2013 * Return value: the "child model" being sorted
2016 gtk_tree_model_sort_get_model (GtkTreeModelSort *tree_model)
2018 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
2020 return tree_model->child_model;
2024 static GtkTreePath *
2025 gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
2026 GtkTreePath *child_path,
2027 gboolean build_levels)
2029 gint *child_indices;
2030 GtkTreePath *retval;
2034 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2035 g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
2036 g_return_val_if_fail (child_path != NULL, NULL);
2038 retval = gtk_tree_path_new ();
2039 child_indices = gtk_tree_path_get_indices (child_path);
2041 if (tree_model_sort->root == NULL && build_levels)
2042 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
2043 level = SORT_LEVEL (tree_model_sort->root);
2045 for (i = 0; i < gtk_tree_path_get_depth (child_path); i++)
2048 gboolean found_child = FALSE;
2052 gtk_tree_path_free (retval);
2056 if (child_indices[i] >= level->array->len)
2058 gtk_tree_path_free (retval);
2061 for (j = 0; j < level->array->len; j++)
2063 if ((g_array_index (level->array, SortElt, j)).offset == child_indices[i])
2065 gtk_tree_path_append_index (retval, j);
2066 if (g_array_index (level->array, SortElt, j).children == NULL && build_levels)
2068 gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, j));
2070 level = g_array_index (level->array, SortElt, j).children;
2077 gtk_tree_path_free (retval);
2087 * gtk_tree_model_sort_convert_child_path_to_path:
2088 * @tree_model_sort: A #GtkTreeModelSort
2089 * @child_path: A #GtkTreePath to convert
2091 * Converts @child_path to a path relative to @tree_model_sort. That is,
2092 * @child_path points to a path in the child model. The returned path will
2093 * point to the same row in the sorted model. If @child_path isn't a valid path
2094 * on the child model, then %NULL is returned.
2096 * Return value: A newly allocated #GtkTreePath, or %NULL
2099 gtk_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
2100 GtkTreePath *child_path)
2102 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2103 g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
2104 g_return_val_if_fail (child_path != NULL, NULL);
2106 return gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path, TRUE);
2110 * gtk_tree_model_sort_convert_child_iter_to_iter:
2111 * @tree_model_sort: A #GtkTreeModelSort
2112 * @sort_iter: An uninitialized #GtkTreeIter.
2113 * @child_iter: A valid #GtkTreeIter pointing to a row on the child model
2115 * Sets @sort_iter to point to the row in @tree_model_sort that corresponds to
2116 * the row pointed at by @child_iter.
2119 gtk_tree_model_sort_convert_child_iter_to_iter (GtkTreeModelSort *tree_model_sort,
2120 GtkTreeIter *sort_iter,
2121 GtkTreeIter *child_iter)
2123 GtkTreePath *child_path, *path;
2125 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2126 g_return_if_fail (tree_model_sort->child_model != NULL);
2127 g_return_if_fail (sort_iter != NULL);
2128 g_return_if_fail (child_iter != NULL);
2130 sort_iter->stamp = 0;
2132 child_path = gtk_tree_model_get_path (tree_model_sort->child_model, child_iter);
2133 g_return_if_fail (child_path != NULL);
2135 path = gtk_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path);
2136 gtk_tree_path_free (child_path);
2137 g_return_if_fail (path != NULL);
2139 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort), sort_iter, path);
2140 gtk_tree_path_free (path);
2144 * gtk_tree_model_sort_convert_path_to_child_path:
2145 * @tree_model_sort: A #GtkTreeModelSort
2146 * @sorted_path: A #GtkTreePath to convert
2148 * Converts @sorted_path to a path on the child model of @tree_model_sort. That
2149 * is, @sorted_path points to a location in @tree_model_sort. The returned path
2150 * will point to the same location in the model not being sorted. If @sorted_path
2151 * does not point to a location in the child model, %NULL is returned.
2153 * Return value: A newly allocated #GtkTreePath, or %NULL
2156 gtk_tree_model_sort_convert_path_to_child_path (GtkTreeModelSort *tree_model_sort,
2157 GtkTreePath *sorted_path)
2159 gint *sorted_indices;
2160 GtkTreePath *retval;
2164 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2165 g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
2166 g_return_val_if_fail (sorted_path != NULL, NULL);
2168 retval = gtk_tree_path_new ();
2169 sorted_indices = gtk_tree_path_get_indices (sorted_path);
2170 if (tree_model_sort->root == NULL)
2171 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
2172 level = SORT_LEVEL (tree_model_sort->root);
2174 for (i = 0; i < gtk_tree_path_get_depth (sorted_path); i++)
2176 gint count = sorted_indices[i];
2178 if ((level == NULL) ||
2179 (level->array->len <= count))
2181 gtk_tree_path_free (retval);
2185 if (g_array_index (level->array, SortElt, count).children == NULL)
2186 gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, count));
2190 gtk_tree_path_free (retval);
2194 gtk_tree_path_append_index (retval, g_array_index (level->array, SortElt, count).offset);
2195 level = g_array_index (level->array, SortElt, count).children;
2202 * gtk_tree_model_sort_convert_iter_to_child_iter:
2203 * @tree_model_sort: A #GtkTreeModelSort
2204 * @child_iter: An uninitialized #GtkTreeIter
2205 * @sorted_iter: A valid #GtkTreeIter pointing to a row on @tree_model_sort.
2207 * Sets @child_iter to point to the row pointed to by @sorted_iter.
2210 gtk_tree_model_sort_convert_iter_to_child_iter (GtkTreeModelSort *tree_model_sort,
2211 GtkTreeIter *child_iter,
2212 GtkTreeIter *sorted_iter)
2214 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2215 g_return_if_fail (tree_model_sort->child_model != NULL);
2216 g_return_if_fail (child_iter != NULL);
2217 g_return_if_fail (sorted_iter != NULL);
2218 g_return_if_fail (sorted_iter->stamp == tree_model_sort->stamp);
2220 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2222 *child_iter = SORT_ELT (sorted_iter->user_data2)->iter;
2228 path = gtk_tree_model_sort_elt_get_path (sorted_iter->user_data,
2229 sorted_iter->user_data2);
2230 gtk_tree_model_get_iter (tree_model_sort->child_model, child_iter, path);
2231 gtk_tree_path_free (path);
2236 gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
2237 SortLevel *parent_level,
2238 SortElt *parent_elt)
2241 SortLevel *new_level;
2245 g_assert (tree_model_sort->child_model != NULL);
2247 if (parent_level == NULL)
2249 if (gtk_tree_model_get_iter_first (tree_model_sort->child_model, &iter) == FALSE)
2251 length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, NULL);
2255 GtkTreeIter parent_iter;
2256 GtkTreeIter child_parent_iter;
2258 parent_iter.stamp = tree_model_sort->stamp;
2259 parent_iter.user_data = parent_level;
2260 parent_iter.user_data2 = parent_elt;
2262 gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2265 if (gtk_tree_model_iter_children (tree_model_sort->child_model,
2267 &child_parent_iter) == FALSE)
2270 /* stamp may have changed */
2271 gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2275 length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, &child_parent_iter);
2278 g_return_if_fail (length > 0);
2280 new_level = g_new (SortLevel, 1);
2281 new_level->array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), length);
2282 new_level->ref_count = 0;
2283 new_level->parent_elt = parent_elt;
2284 new_level->parent_level = parent_level;
2287 parent_elt->children = new_level;
2289 tree_model_sort->root = new_level;
2291 /* increase the count of zero ref_counts.*/
2292 while (parent_level)
2294 parent_elt->zero_ref_count++;
2296 parent_elt = parent_level->parent_elt;
2297 parent_level = parent_level->parent_level;
2299 if (new_level != tree_model_sort->root)
2300 tree_model_sort->zero_ref_count++;
2302 for (i = 0; i < length; i++)
2305 sort_elt.offset = i;
2306 sort_elt.zero_ref_count = 0;
2307 sort_elt.ref_count = 0;
2308 sort_elt.children = NULL;
2310 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2312 sort_elt.iter = iter;
2313 if (gtk_tree_model_iter_next (tree_model_sort->child_model, &iter) == FALSE &&
2316 g_warning ("There is a discrepency between the sort model and the child model.");
2320 g_array_append_val (new_level->array, sort_elt);
2324 gtk_tree_model_sort_sort_level (tree_model_sort, new_level,
2329 gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
2330 SortLevel *sort_level)
2334 g_assert (sort_level);
2336 if (sort_level->ref_count == 0)
2338 SortLevel *parent_level = sort_level->parent_level;
2339 SortElt *parent_elt = sort_level->parent_elt;
2344 parent_elt->zero_ref_count--;
2346 tree_model_sort->zero_ref_count--;
2350 parent_elt = parent_level->parent_elt;
2351 parent_level = parent_level->parent_level;
2354 while (parent_level);
2357 for (i = 0; i < sort_level->array->len; i++)
2359 if (g_array_index (sort_level->array, SortElt, i).children)
2360 gtk_tree_model_sort_free_level (tree_model_sort,
2361 SORT_LEVEL(g_array_index (sort_level->array, SortElt, i).children));
2364 if (sort_level->parent_elt)
2365 sort_level->parent_elt->children = NULL;
2367 tree_model_sort->root = NULL;
2369 g_array_free (sort_level->array, TRUE);
2370 sort_level->array = NULL;
2372 g_free (sort_level);
2377 gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort)
2381 tree_model_sort->stamp++;
2383 while (tree_model_sort->stamp == 0);
2385 gtk_tree_model_sort_clear_cache (tree_model_sort);
2389 gtk_tree_model_sort_clear_cache_helper (GtkTreeModelSort *tree_model_sort,
2394 g_assert (level != NULL);
2396 for (i = 0; i < level->array->len; i++)
2398 if (g_array_index (level->array, SortElt, i).zero_ref_count > 0)
2399 gtk_tree_model_sort_clear_cache_helper (tree_model_sort, g_array_index (level->array, SortElt, i).children);
2402 if (level->ref_count == 0 && level != tree_model_sort->root)
2403 gtk_tree_model_sort_free_level (tree_model_sort, level);
2407 * gtk_tree_model_sort_reset_default_sort_func:
2408 * @tree_model_sort: A #GtkTreeModelSort
2410 * This resets the default sort function to be in the 'unsorted' state. That
2411 * is, it is in the same order as the child model. It will re-sort the model
2412 * to be in the same order as the child model only if the #GtkTreeModelSort
2413 * is in 'unsorted' state.
2416 gtk_tree_model_sort_reset_default_sort_func (GtkTreeModelSort *tree_model_sort)
2418 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2420 if (tree_model_sort->default_sort_destroy)
2422 GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
2424 tree_model_sort->default_sort_destroy = NULL;
2425 d (tree_model_sort->default_sort_data);
2428 tree_model_sort->default_sort_func = NO_SORT_FUNC;
2429 tree_model_sort->default_sort_data = NULL;
2430 tree_model_sort->default_sort_destroy = NULL;
2432 if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2433 gtk_tree_model_sort_sort (tree_model_sort);
2434 tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
2438 * gtk_tree_model_sort_clear_cache:
2439 * @tree_model_sort: A #GtkTreeModelSort
2441 * This function should almost never be called. It clears the @tree_model_sort
2442 * of any cached iterators that haven't been reffed with
2443 * gtk_tree_model_ref_node(). This might be useful if the child model being
2444 * sorted is static (and doesn't change often) and there has been a lot of
2445 * unreffed access to nodes. As a side effect of this function, all unreffed
2446 * iters will be invalid.
2449 gtk_tree_model_sort_clear_cache (GtkTreeModelSort *tree_model_sort)
2451 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2453 if (tree_model_sort->zero_ref_count)
2454 gtk_tree_model_sort_clear_cache_helper (tree_model_sort, (SortLevel *)tree_model_sort->root);
2458 gtk_tree_model_sort_iter_is_valid_helper (GtkTreeIter *iter,
2463 for (i = 0; i < level->array->len; i++)
2465 SortElt *elt = &g_array_index (level->array, SortElt, i);
2467 if (iter->user_data == level && iter->user_data2 == elt)
2471 if (gtk_tree_model_sort_iter_is_valid_helper (iter, elt->children))
2479 * gtk_tree_model_sort_iter_is_valid:
2480 * @tree_model_sort: A #GtkTreeModelSort.
2481 * @iter: A #GtkTreeIter.
2483 * WARNING: This function is slow. Only use it for debugging and/or testing
2486 * Checks if the given iter is a valid iter for this #GtkTreeModelSort.
2488 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
2493 gtk_tree_model_sort_iter_is_valid (GtkTreeModelSort *tree_model_sort,
2496 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), FALSE);
2497 g_return_val_if_fail (iter != NULL, FALSE);
2499 if (!VALID_ITER (iter, tree_model_sort))
2502 return gtk_tree_model_sort_iter_is_valid_helper (iter,
2503 tree_model_sort->root);
2506 #define __GTK_TREE_MODEL_SORT_C__
2507 #include "gtkaliasdef.c"