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, see <http://www.gnu.org/licenses/>.
22 #include "gtktreemodelsort.h"
23 #include "gtktreesortable.h"
24 #include "gtktreestore.h"
25 #include "gtktreedatalist.h"
27 #include "gtkprivate.h"
28 #include "gtktreednd.h"
32 * SECTION:gtktreemodelsort
33 * @Short_description: A GtkTreeModel which makes an underlying tree model sortable
34 * @Title: GtkTreeModelSort
35 * @See_also: #GtkTreeModel, #GtkListStore, #GtkTreeStore, #GtkTreeSortable, #GtkTreeModelFilter
37 * The #GtkTreeModelSort is a model which implements the #GtkTreeSortable
38 * interface. It does not hold any data itself, but rather is created with
39 * a child model and proxies its data. It has identical column types to
40 * this child model, and the changes in the child are propagated. The
41 * primary purpose of this model is to provide a way to sort a different
42 * model without modifying it. Note that the sort function used by
43 * #GtkTreeModelSort is not guaranteed to be stable.
45 * The use of this is best demonstrated through an example. In the
46 * following sample code we create two #GtkTreeView widgets each with a
47 * view of the same data. As the model is wrapped here by a
48 * #GtkTreeModelSort, the two #GtkTreeView<!-- -->s can each sort their
49 * view of the data without affecting the other. By contrast, if we
50 * simply put the same model in each widget, then sorting the first would
54 * <title>Using a <structname>GtkTreeModelSort</structname></title>
57 * GtkTreeView *tree_view1;
58 * GtkTreeView *tree_view2;
59 * GtkTreeModel *sort_model1;
60 * GtkTreeModel *sort_model2;
61 * GtkTreeModel *child_model;
63 * // get the child model
64 * child_model = get_my_model ();
66 * // Create the first tree
67 * sort_model1 = gtk_tree_model_sort_new_with_model (child_model);
68 * tree_view1 = gtk_tree_view_new_with_model (sort_model1);
70 * // Create the second tree
71 * sort_model2 = gtk_tree_model_sort_new_with_model (child_model);
72 * tree_view2 = gtk_tree_view_new_with_model (sort_model2);
74 * // Now we can sort the two models independently
75 * gtk_tree_sortable_set_sort_column_id (GTK_TREE_SORTABLE (sort_model1),
76 * COLUMN_1, GTK_SORT_ASCENDING);
77 * gtk_tree_sortable_set_sort_column_id (GTK_TREE_SORTABLE (sort_model2),
78 * COLUMN_1, GTK_SORT_DESCENDING);
83 * To demonstrate how to access the underlying child model from the sort
84 * model, the next example will be a callback for the #GtkTreeSelection
85 * #GtkTreeSelection::changed signal. In this callback, we get a string
86 * from COLUMN_1 of the model. We then modify the string, find the same
87 * selected row on the child model, and change the row there.
90 * <title>Accessing the child model of in a selection changed callback</title>
93 * selection_changed (GtkTreeSelection *selection, gpointer data)
95 * GtkTreeModel *sort_model = NULL;
96 * GtkTreeModel *child_model;
97 * GtkTreeIter sort_iter;
98 * GtkTreeIter child_iter;
99 * char *some_data = NULL;
100 * char *modified_data;
102 * // Get the current selected row and the model.
103 * if (! gtk_tree_selection_get_selected (selection,
108 * /<!---->* Look up the current value on the selected row and get a new value
111 * gtk_tree_model_get (GTK_TREE_MODEL (sort_model), &sort_iter,
112 * COLUMN_1, &some_data,
115 * modified_data = change_the_data (some_data);
116 * g_free (some_data);
118 * // Get an iterator on the child model, instead of the sort model.
119 * gtk_tree_model_sort_convert_iter_to_child_iter (GTK_TREE_MODEL_SORT (sort_model),
123 * /<!---->* Get the child model and change the value of the row. In this
124 * * example, the child model is a GtkListStore. It could be any other
125 * * type of model, though.
127 * child_model = gtk_tree_model_sort_get_model (GTK_TREE_MODEL_SORT (sort_model));
128 * gtk_list_store_set (GTK_LIST_STORE (child_model), &child_iter,
129 * COLUMN_1, &modified_data,
131 * g_free (modified_data);
138 /* Notes on this implementation of GtkTreeModelSort
139 * ================================================
144 * In this code there is a potential for confusion as to whether an iter,
145 * path or value refers to the GtkTreeModelSort model, or to the child model
146 * that has been set. As a convention, variables referencing the child model
147 * will have an s_ prefix before them (ie. s_iter, s_value, s_path);
148 * Conversion of iterators and paths between GtkTreeModelSort and the child
149 * model is done through the various gtk_tree_model_sort_convert_* functions.
154 * The iterator format of iterators handed out by GtkTreeModelSort is as
157 * iter->stamp = tree_model_sort->stamp
158 * iter->user_data = SortLevel
159 * iter->user_data2 = SortElt
161 * Internal data structure
162 * -----------------------
164 * Using SortLevel and SortElt, GtkTreeModelSort maintains a "cache" of
165 * the mapping from GtkTreeModelSort nodes to nodes in the child model.
166 * This is to avoid sorting a level each time an operation is requested
167 * on GtkTreeModelSort, such as get iter, get path, get value.
169 * A SortElt corresponds to a single node. A node and its siblings are
170 * stored in a SortLevel. The SortLevel keeps a reference to the parent
171 * SortElt and its SortLevel (if any). The SortElt can have a "children"
172 * pointer set, which points at a child level (a sub level).
174 * In a SortLevel, nodes are stored in a GSequence. The GSequence
175 * allows for fast additions and removals, and supports sorting
176 * the level of SortElt nodes.
178 * It is important to recognize the two different mappings that play
179 * a part in this code:
180 * I. The mapping from the client to this model. The order in which
181 * nodes are stored in the GSequence is the order in which the
182 * nodes are exposed to clients of the GtkTreeModelSort.
183 * II. The mapping from this model to its child model. Each SortElt
184 * contains an "offset" field which is the offset of the
185 * corresponding node in the child model.
190 * GtkTreeModelSort forwards all reference and unreference operations
191 * to the corresponding node in the child model. The reference count
192 * of each node is also maintained internally, in the "ref_count"
193 * fields in SortElt and SortLevel. For each ref and unref operation on
194 * a SortElt, the "ref_count" of the SortLevel is updated accordingly.
195 * In addition, if a SortLevel has a parent, a reference is taken on
196 * this parent. This happens in gtk_tree_model_sort_build_level() and
197 * the reference is released again in gtk_tree_model_sort_free_level().
198 * This ensures that when GtkTreeModelSort takes a reference on a node
199 * (for example during sorting), all parent nodes are referenced
200 * according to reference counting rule 1, see the GtkTreeModel
203 * When a level has a reference count of zero, which means that
204 * none of the nodes in the level is referenced, the level has
205 * a "zero ref count" on all its parents. As soon as the level
206 * reaches a reference count of zero, the zero ref count value is
207 * incremented by one on all parents of this level. Similarly, as
208 * soon as the reference count of a level changes from zero, the
209 * zero ref count value is decremented by one on all parents.
211 * The zero ref count value is used to clear unused portions of
212 * the cache. If a SortElt has a zero ref count of one, then
213 * its child level is unused and can be removed from the cache.
214 * If the zero ref count value is higher than one, then the
215 * child level contains sublevels which are unused as well.
216 * gtk_tree_model_sort_clear_cache() uses this to not recurse
217 * into levels which have a zero ref count of zero.
220 typedef struct _SortElt SortElt;
221 typedef struct _SortLevel SortLevel;
222 typedef struct _SortData SortData;
231 GSequenceIter *siter; /* iter into seq */
232 gint old_index; /* used while sorting */
240 SortLevel *parent_level;
245 GtkTreeModelSort *tree_model_sort;
246 GtkTreeIterCompareFunc sort_func;
249 GtkTreePath *parent_path;
250 gint parent_path_depth;
251 gint *parent_path_indices;
262 struct _GtkTreeModelSortPrivate
267 GtkTreeModel *child_model;
270 /* sort information */
276 GtkTreeIterCompareFunc default_sort_func;
277 gpointer default_sort_data;
278 GDestroyNotify default_sort_destroy;
283 gulong has_child_toggled_id;
288 /* Set this to 0 to disable caching of child iterators. This
289 * allows for more stringent testing. It is recommended to set this
290 * to one when refactoring this code and running the unit tests to
294 # define GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS(tree_model_sort) \
295 (((GtkTreeModelSort *)tree_model_sort)->priv->child_flags>K_TREE_MODEL_ITERS_PERSIST)
297 # define GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS(tree_model_sort) (FALSE)
300 #define SORT_ELT(sort_elt) ((SortElt *)sort_elt)
301 #define SORT_LEVEL(sort_level) ((SortLevel *)sort_level)
302 #define GET_ELT(siter) ((SortElt *) (siter ? g_sequence_get (siter) : NULL))
305 #define GET_CHILD_ITER(tree_model_sort,ch_iter,so_iter) gtk_tree_model_sort_convert_iter_to_child_iter((GtkTreeModelSort*)(tree_model_sort), (ch_iter), (so_iter));
307 #define NO_SORT_FUNC ((GtkTreeIterCompareFunc) 0x1)
309 #define VALID_ITER(iter, tree_model_sort) ((iter) != NULL && (iter)->user_data != NULL && (iter)->user_data2 != NULL && (tree_model_sort)->priv->stamp == (iter)->stamp)
311 /* general (object/interface init, etc) */
312 static void gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface);
313 static void gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface);
314 static void gtk_tree_model_sort_drag_source_init (GtkTreeDragSourceIface*iface);
315 static void gtk_tree_model_sort_finalize (GObject *object);
316 static void gtk_tree_model_sort_set_property (GObject *object,
320 static void gtk_tree_model_sort_get_property (GObject *object,
325 /* our signal handlers */
326 static void gtk_tree_model_sort_row_changed (GtkTreeModel *model,
327 GtkTreePath *start_path,
328 GtkTreeIter *start_iter,
330 static void gtk_tree_model_sort_row_inserted (GtkTreeModel *model,
334 static void gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *model,
338 static void gtk_tree_model_sort_row_deleted (GtkTreeModel *model,
341 static void gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
347 /* TreeModel interface */
348 static GtkTreeModelFlags gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model);
349 static gint gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model);
350 static GType gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
352 static gboolean gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
355 static GtkTreePath *gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
357 static void gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
361 static gboolean gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
363 static gboolean gtk_tree_model_sort_iter_previous (GtkTreeModel *tree_model,
365 static gboolean gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
367 GtkTreeIter *parent);
368 static gboolean gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
370 static gint gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
372 static gboolean gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
376 static gboolean gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
379 static void gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
381 static void gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
383 gboolean propagate_unref);
384 static void gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
387 /* TreeDragSource interface */
388 static gboolean gtk_tree_model_sort_row_draggable (GtkTreeDragSource *drag_source,
390 static gboolean gtk_tree_model_sort_drag_data_get (GtkTreeDragSource *drag_source,
392 GtkSelectionData *selection_data);
393 static gboolean gtk_tree_model_sort_drag_data_delete (GtkTreeDragSource *drag_source,
396 /* TreeSortable interface */
397 static gboolean gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
398 gint *sort_column_id,
400 static void gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
403 static void gtk_tree_model_sort_set_sort_func (GtkTreeSortable *sortable,
405 GtkTreeIterCompareFunc func,
407 GDestroyNotify destroy);
408 static void gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable *sortable,
409 GtkTreeIterCompareFunc func,
411 GDestroyNotify destroy);
412 static gboolean gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable);
414 /* Private functions (sort funcs, level handling and other utils) */
415 static void gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
416 SortLevel *parent_level,
417 SortElt *parent_elt);
418 static void gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
419 SortLevel *sort_level,
421 static void gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort);
422 static void gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
425 gboolean emit_reordered);
426 static void gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort);
427 static gboolean gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
430 GtkTreeIter *s_iter);
431 static GtkTreePath *gtk_tree_model_sort_elt_get_path (SortLevel *level,
433 static void gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
434 GtkTreeModel *child_model);
435 static GtkTreePath *gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
436 GtkTreePath *child_path,
437 gboolean build_levels);
439 static gint gtk_tree_model_sort_compare_func (gconstpointer a,
442 static gint gtk_tree_model_sort_offset_compare_func (gconstpointer a,
445 static void gtk_tree_model_sort_clear_cache_helper (GtkTreeModelSort *tree_model_sort,
449 G_DEFINE_TYPE_WITH_CODE (GtkTreeModelSort, gtk_tree_model_sort, G_TYPE_OBJECT,
450 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_MODEL,
451 gtk_tree_model_sort_tree_model_init)
452 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_SORTABLE,
453 gtk_tree_model_sort_tree_sortable_init)
454 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_DRAG_SOURCE,
455 gtk_tree_model_sort_drag_source_init))
458 gtk_tree_model_sort_init (GtkTreeModelSort *tree_model_sort)
460 GtkTreeModelSortPrivate *priv;
462 priv = G_TYPE_INSTANCE_GET_PRIVATE (tree_model_sort,
463 GTK_TYPE_TREE_MODEL_SORT,
464 GtkTreeModelSortPrivate);
465 tree_model_sort->priv = priv;
466 priv->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
468 priv->zero_ref_count = 0;
470 priv->sort_list = NULL;
474 gtk_tree_model_sort_class_init (GtkTreeModelSortClass *class)
476 GObjectClass *object_class;
478 object_class = (GObjectClass *) class;
480 object_class->set_property = gtk_tree_model_sort_set_property;
481 object_class->get_property = gtk_tree_model_sort_get_property;
483 object_class->finalize = gtk_tree_model_sort_finalize;
486 g_object_class_install_property (object_class,
488 g_param_spec_object ("model",
489 P_("TreeModelSort Model"),
490 P_("The model for the TreeModelSort to sort"),
492 GTK_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY));
494 g_type_class_add_private (class, sizeof (GtkTreeModelSortPrivate));
498 gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface)
500 iface->get_flags = gtk_tree_model_sort_get_flags;
501 iface->get_n_columns = gtk_tree_model_sort_get_n_columns;
502 iface->get_column_type = gtk_tree_model_sort_get_column_type;
503 iface->get_iter = gtk_tree_model_sort_get_iter;
504 iface->get_path = gtk_tree_model_sort_get_path;
505 iface->get_value = gtk_tree_model_sort_get_value;
506 iface->iter_next = gtk_tree_model_sort_iter_next;
507 iface->iter_previous = gtk_tree_model_sort_iter_previous;
508 iface->iter_children = gtk_tree_model_sort_iter_children;
509 iface->iter_has_child = gtk_tree_model_sort_iter_has_child;
510 iface->iter_n_children = gtk_tree_model_sort_iter_n_children;
511 iface->iter_nth_child = gtk_tree_model_sort_iter_nth_child;
512 iface->iter_parent = gtk_tree_model_sort_iter_parent;
513 iface->ref_node = gtk_tree_model_sort_ref_node;
514 iface->unref_node = gtk_tree_model_sort_unref_node;
518 gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface)
520 iface->get_sort_column_id = gtk_tree_model_sort_get_sort_column_id;
521 iface->set_sort_column_id = gtk_tree_model_sort_set_sort_column_id;
522 iface->set_sort_func = gtk_tree_model_sort_set_sort_func;
523 iface->set_default_sort_func = gtk_tree_model_sort_set_default_sort_func;
524 iface->has_default_sort_func = gtk_tree_model_sort_has_default_sort_func;
528 gtk_tree_model_sort_drag_source_init (GtkTreeDragSourceIface *iface)
530 iface->row_draggable = gtk_tree_model_sort_row_draggable;
531 iface->drag_data_delete = gtk_tree_model_sort_drag_data_delete;
532 iface->drag_data_get = gtk_tree_model_sort_drag_data_get;
536 * gtk_tree_model_sort_new_with_model:
537 * @child_model: A #GtkTreeModel
539 * Creates a new #GtkTreeModel, with @child_model as the child model.
541 * Return value: (transfer full): A new #GtkTreeModel.
544 gtk_tree_model_sort_new_with_model (GtkTreeModel *child_model)
546 GtkTreeModel *retval;
548 g_return_val_if_fail (GTK_IS_TREE_MODEL (child_model), NULL);
550 retval = g_object_new (gtk_tree_model_sort_get_type (), NULL);
552 gtk_tree_model_sort_set_model (GTK_TREE_MODEL_SORT (retval), child_model);
557 /* GObject callbacks */
559 gtk_tree_model_sort_finalize (GObject *object)
561 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) object;
562 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
564 gtk_tree_model_sort_set_model (tree_model_sort, NULL);
567 gtk_tree_model_sort_free_level (tree_model_sort, priv->root, TRUE);
571 _gtk_tree_data_list_header_free (priv->sort_list);
572 priv->sort_list = NULL;
575 if (priv->default_sort_destroy)
577 priv->default_sort_destroy (priv->default_sort_data);
578 priv->default_sort_destroy = NULL;
579 priv->default_sort_data = NULL;
584 G_OBJECT_CLASS (gtk_tree_model_sort_parent_class)->finalize (object);
588 gtk_tree_model_sort_set_property (GObject *object,
593 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
598 gtk_tree_model_sort_set_model (tree_model_sort, g_value_get_object (value));
601 G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
607 gtk_tree_model_sort_get_property (GObject *object,
612 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
617 g_value_set_object (value, gtk_tree_model_sort_get_model (tree_model_sort));
620 G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
629 return g_slice_new (SortElt);
633 sort_elt_free (gpointer elt)
635 g_slice_free (SortElt, elt);
639 increase_offset_iter (gpointer data,
643 gint offset = GPOINTER_TO_INT (user_data);
645 if (elt->offset >= offset)
650 decrease_offset_iter (gpointer data,
654 gint offset = GPOINTER_TO_INT (user_data);
656 if (elt->offset > offset)
661 fill_sort_data (SortData *data,
662 GtkTreeModelSort *tree_model_sort,
665 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
667 data->tree_model_sort = tree_model_sort;
669 if (priv->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
671 GtkTreeDataSortHeader *header;
673 header = _gtk_tree_data_list_get_header (priv->sort_list,
674 priv->sort_column_id);
676 g_return_if_fail (header != NULL);
677 g_return_if_fail (header->func != NULL);
679 data->sort_func = header->func;
680 data->sort_data = header->data;
684 /* absolutely SHOULD NOT happen: */
685 g_return_if_fail (priv->default_sort_func != NULL);
687 data->sort_func = priv->default_sort_func;
688 data->sort_data = priv->default_sort_data;
691 if (level->parent_elt)
693 data->parent_path = gtk_tree_model_sort_elt_get_path (level->parent_level,
695 gtk_tree_path_append_index (data->parent_path, 0);
699 data->parent_path = gtk_tree_path_new_first ();
701 data->parent_path_depth = gtk_tree_path_get_depth (data->parent_path);
702 data->parent_path_indices = gtk_tree_path_get_indices (data->parent_path);
706 free_sort_data (SortData *data)
708 gtk_tree_path_free (data->parent_path);
712 lookup_elt_with_offset (GtkTreeModelSort *tree_model_sort,
715 GSequenceIter **ret_siter)
717 GSequenceIter *siter, *end_siter;
719 /* FIXME: We have to do a search like this, because the sequence is not
720 * (always) sorted on offset order. Perhaps we should introduce a
721 * second sequence which is sorted on offset order.
723 end_siter = g_sequence_get_end_iter (level->seq);
724 for (siter = g_sequence_get_begin_iter (level->seq);
726 siter = g_sequence_iter_next (siter))
728 SortElt *elt = g_sequence_get (siter);
730 if (elt->offset == offset)
737 return GET_ELT (siter);
742 gtk_tree_model_sort_row_changed (GtkTreeModel *s_model,
743 GtkTreePath *start_s_path,
744 GtkTreeIter *start_s_iter,
747 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
748 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
749 GtkTreePath *path = NULL;
757 gboolean free_s_path = FALSE;
759 gint index = 0, old_index;
761 g_return_if_fail (start_s_path != NULL || start_s_iter != NULL);
766 start_s_path = gtk_tree_model_get_path (s_model, start_s_iter);
769 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
775 gtk_tree_path_free (start_s_path);
779 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
780 gtk_tree_model_sort_ref_node (GTK_TREE_MODEL (data), &iter);
782 level = iter.user_data;
783 elt = iter.user_data2;
785 if (g_sequence_get_length (level->seq) < 2 ||
786 (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
787 priv->default_sort_func == NO_SORT_FUNC))
790 gtk_tree_path_free (start_s_path);
792 gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
793 gtk_tree_model_sort_unref_node (GTK_TREE_MODEL (data), &iter);
795 gtk_tree_path_free (path);
800 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
803 gtk_tree_model_get_iter (priv->child_model,
804 &tmpiter, start_s_path);
806 old_index = g_sequence_iter_get_position (elt->siter);
808 fill_sort_data (&sort_data, tree_model_sort, level);
809 g_sequence_sort_changed (elt->siter,
810 gtk_tree_model_sort_compare_func,
812 free_sort_data (&sort_data);
814 index = g_sequence_iter_get_position (elt->siter);
816 /* Prepare the path for signal emission */
817 gtk_tree_path_up (path);
818 gtk_tree_path_append_index (path, index);
820 gtk_tree_model_sort_increment_stamp (tree_model_sort);
822 /* if the item moved, then emit rows_reordered */
823 if (old_index != index)
828 GtkTreePath *tmppath;
830 new_order = g_new (gint, g_sequence_get_length (level->seq));
832 for (j = 0; j < g_sequence_get_length (level->seq); j++)
834 if (index > old_index)
837 new_order[j] = old_index;
838 else if (j >= old_index && j < index)
839 new_order[j] = j + 1;
843 else if (index < old_index)
846 new_order[j] = old_index;
847 else if (j > index && j <= old_index)
848 new_order[j] = j - 1;
852 /* else? shouldn't really happen */
855 if (level->parent_elt)
857 iter.stamp = priv->stamp;
858 iter.user_data = level->parent_level;
859 iter.user_data2 = level->parent_elt;
861 tmppath = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort), &iter);
863 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
864 tmppath, &iter, new_order);
869 tmppath = gtk_tree_path_new ();
871 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), tmppath,
875 gtk_tree_path_free (tmppath);
879 /* emit row_changed signal (at new location) */
880 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
881 gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
882 gtk_tree_model_sort_unref_node (GTK_TREE_MODEL (data), &iter);
884 gtk_tree_path_free (path);
886 gtk_tree_path_free (start_s_path);
890 gtk_tree_model_sort_row_inserted (GtkTreeModel *s_model,
895 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
896 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
899 GtkTreeIter real_s_iter;
903 gboolean free_s_path = FALSE;
907 SortLevel *parent_level = NULL;
909 parent_level = level = SORT_LEVEL (priv->root);
911 g_return_if_fail (s_path != NULL || s_iter != NULL);
915 s_path = gtk_tree_model_get_path (s_model, s_iter);
920 gtk_tree_model_get_iter (s_model, &real_s_iter, s_path);
922 real_s_iter = *s_iter;
926 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
928 /* the build level already put the inserted iter in the level,
929 so no need to handle this signal anymore */
931 goto done_and_submit;
934 /* find the parent level */
935 while (i < gtk_tree_path_get_depth (s_path) - 1)
939 /* level not yet build, we won't cover this signal */
943 if (g_sequence_get_length (level->seq) < gtk_tree_path_get_indices (s_path)[i])
945 g_warning ("%s: A node was inserted with a parent that's not in the tree.\n"
946 "This possibly means that a GtkTreeModel inserted a child node\n"
947 "before the parent was inserted.",
952 elt = lookup_elt_with_offset (tree_model_sort, level,
953 gtk_tree_path_get_indices (s_path)[i],
956 g_return_if_fail (elt != NULL);
960 /* not covering this signal */
964 level = elt->children;
965 parent_level = level;
972 if (level->ref_count == 0 && level != priv->root)
974 gtk_tree_model_sort_free_level (tree_model_sort, level, TRUE);
978 if (!gtk_tree_model_sort_insert_value (tree_model_sort,
985 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
992 gtk_tree_model_sort_increment_stamp (tree_model_sort);
994 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
995 gtk_tree_model_row_inserted (GTK_TREE_MODEL (data), path, &iter);
996 gtk_tree_path_free (path);
1000 gtk_tree_path_free (s_path);
1006 gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *s_model,
1007 GtkTreePath *s_path,
1008 GtkTreeIter *s_iter,
1011 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
1015 g_return_if_fail (s_path != NULL && s_iter != NULL);
1017 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
1021 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
1022 gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data), path, &iter);
1024 gtk_tree_path_free (path);
1028 gtk_tree_model_sort_row_deleted (GtkTreeModel *s_model,
1029 GtkTreePath *s_path,
1032 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
1033 GtkTreePath *path = NULL;
1039 g_return_if_fail (s_path != NULL);
1041 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
1045 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
1047 level = SORT_LEVEL (iter.user_data);
1048 elt = SORT_ELT (iter.user_data2);
1049 offset = elt->offset;
1051 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
1053 while (elt->ref_count > 0)
1054 gtk_tree_model_sort_real_unref_node (GTK_TREE_MODEL (data), &iter, FALSE);
1056 /* If this node has children, we free the level (recursively) here
1057 * and specify that unref may not be used, because parent and its
1058 * children have been removed by now.
1061 gtk_tree_model_sort_free_level (tree_model_sort,
1062 elt->children, FALSE);
1064 if (level->ref_count == 0)
1066 gtk_tree_model_sort_increment_stamp (tree_model_sort);
1067 gtk_tree_model_row_deleted (GTK_TREE_MODEL (data), path);
1068 gtk_tree_path_free (path);
1070 if (level == tree_model_sort->priv->root)
1072 gtk_tree_model_sort_free_level (tree_model_sort,
1073 tree_model_sort->priv->root,
1075 tree_model_sort->priv->root = NULL;
1080 g_sequence_remove (elt->siter);
1083 /* The sequence is not ordered on offset, so we traverse the entire
1086 g_sequence_foreach (level->seq, decrease_offset_iter,
1087 GINT_TO_POINTER (offset));
1089 gtk_tree_model_sort_increment_stamp (tree_model_sort);
1090 gtk_tree_model_row_deleted (GTK_TREE_MODEL (data), path);
1092 gtk_tree_path_free (path);
1096 gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
1097 GtkTreePath *s_path,
1098 GtkTreeIter *s_iter,
1108 GSequenceIter *siter, *end_siter;
1109 GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
1110 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1112 g_return_if_fail (new_order != NULL);
1114 if (s_path == NULL || gtk_tree_path_get_depth (s_path) == 0)
1116 if (priv->root == NULL)
1118 path = gtk_tree_path_new ();
1119 level = SORT_LEVEL (priv->root);
1123 path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
1126 gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
1128 elt = SORT_ELT (iter.user_data2);
1132 gtk_tree_path_free (path);
1136 level = elt->children;
1139 length = g_sequence_get_length (level->seq);
1142 gtk_tree_path_free (path);
1146 tmp_array = g_new (int, length);
1148 /* FIXME: I need to think about whether this can be done in a more
1152 end_siter = g_sequence_get_end_iter (level->seq);
1153 for (siter = g_sequence_get_begin_iter (level->seq);
1155 siter = g_sequence_iter_next (siter))
1158 SortElt *elt = g_sequence_get (siter);
1160 for (j = 0; j < length; j++)
1162 if (elt->offset == new_order[j])
1169 /* This loop cannot be merged with the above loop nest, because that
1170 * would introduce duplicate offsets.
1173 end_siter = g_sequence_get_end_iter (level->seq);
1174 for (siter = g_sequence_get_begin_iter (level->seq);
1176 siter = g_sequence_iter_next (siter))
1178 SortElt *elt = g_sequence_get (siter);
1180 elt->offset = tmp_array[i];
1185 if (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
1186 priv->default_sort_func == NO_SORT_FUNC)
1188 gtk_tree_model_sort_sort_level (tree_model_sort, level,
1190 gtk_tree_model_sort_increment_stamp (tree_model_sort);
1192 if (gtk_tree_path_get_depth (path))
1194 gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort),
1197 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
1198 path, &iter, new_order);
1202 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
1203 path, NULL, new_order);
1207 gtk_tree_path_free (path);
1210 /* Fulfill our model requirements */
1211 static GtkTreeModelFlags
1212 gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model)
1214 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1215 GtkTreeModelFlags flags;
1217 g_return_val_if_fail (tree_model_sort->priv->child_model != NULL, 0);
1219 flags = gtk_tree_model_get_flags (tree_model_sort->priv->child_model);
1221 if ((flags & GTK_TREE_MODEL_LIST_ONLY) == GTK_TREE_MODEL_LIST_ONLY)
1222 return GTK_TREE_MODEL_LIST_ONLY;
1228 gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model)
1230 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1232 if (tree_model_sort->priv->child_model == 0)
1235 return gtk_tree_model_get_n_columns (tree_model_sort->priv->child_model);
1239 gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
1242 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1244 g_return_val_if_fail (tree_model_sort->priv->child_model != NULL, G_TYPE_INVALID);
1246 return gtk_tree_model_get_column_type (tree_model_sort->priv->child_model, index);
1250 gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
1254 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1255 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1260 GSequenceIter *siter;
1262 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1264 indices = gtk_tree_path_get_indices (path);
1266 if (priv->root == NULL)
1267 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1268 level = SORT_LEVEL (priv->root);
1270 depth = gtk_tree_path_get_depth (path);
1277 for (i = 0; i < depth - 1; i++)
1279 if ((level == NULL) ||
1280 (indices[i] >= g_sequence_get_length (level->seq)))
1286 siter = g_sequence_get_iter_at_pos (level->seq, indices[i]);
1287 if (g_sequence_iter_is_end (siter))
1293 elt = GET_ELT (siter);
1294 if (elt->children == NULL)
1295 gtk_tree_model_sort_build_level (tree_model_sort, level, elt);
1297 level = elt->children;
1300 if (!level || indices[i] >= g_sequence_get_length (level->seq))
1306 iter->stamp = priv->stamp;
1307 iter->user_data = level;
1309 siter = g_sequence_get_iter_at_pos (level->seq, indices[depth - 1]);
1310 if (g_sequence_iter_is_end (siter))
1315 iter->user_data2 = GET_ELT (siter);
1320 static GtkTreePath *
1321 gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
1324 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1325 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1326 GtkTreePath *retval;
1330 g_return_val_if_fail (priv->child_model != NULL, NULL);
1331 g_return_val_if_fail (priv->stamp == iter->stamp, NULL);
1333 retval = gtk_tree_path_new ();
1335 level = SORT_LEVEL (iter->user_data);
1336 elt = SORT_ELT (iter->user_data2);
1342 index = g_sequence_iter_get_position (elt->siter);
1343 gtk_tree_path_prepend_index (retval, index);
1345 elt = level->parent_elt;
1346 level = level->parent_level;
1353 gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
1358 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1359 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1360 GtkTreeIter child_iter;
1362 g_return_if_fail (priv->child_model != NULL);
1363 g_return_if_fail (VALID_ITER (iter, tree_model_sort));
1365 GET_CHILD_ITER (tree_model_sort, &child_iter, iter);
1366 gtk_tree_model_get_value (priv->child_model,
1367 &child_iter, column, value);
1371 gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
1374 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1375 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1377 GSequenceIter *siter;
1379 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1380 g_return_val_if_fail (priv->stamp == iter->stamp, FALSE);
1382 elt = iter->user_data2;
1384 siter = g_sequence_iter_next (elt->siter);
1385 if (g_sequence_iter_is_end (siter))
1390 iter->user_data2 = GET_ELT (siter);
1396 gtk_tree_model_sort_iter_previous (GtkTreeModel *tree_model,
1399 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1400 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1402 GSequenceIter *siter;
1404 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1405 g_return_val_if_fail (priv->stamp == iter->stamp, FALSE);
1407 elt = iter->user_data2;
1409 siter = g_sequence_iter_prev (elt->siter);
1410 if (g_sequence_iter_is_begin (siter))
1415 iter->user_data2 = GET_ELT (siter);
1421 gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
1423 GtkTreeIter *parent)
1425 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1426 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1430 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1432 g_return_val_if_fail (VALID_ITER (parent, tree_model_sort), FALSE);
1436 if (priv->root == NULL)
1437 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1438 if (priv->root == NULL)
1442 iter->stamp = priv->stamp;
1443 iter->user_data = level;
1444 iter->user_data2 = g_sequence_get (g_sequence_get_begin_iter (level->seq));
1450 level = SORT_LEVEL (parent->user_data);
1451 elt = SORT_ELT (parent->user_data2);
1453 if (elt->children == NULL)
1454 gtk_tree_model_sort_build_level (tree_model_sort, level, elt);
1456 if (elt->children == NULL)
1459 iter->stamp = priv->stamp;
1460 iter->user_data = elt->children;
1461 iter->user_data2 = g_sequence_get (g_sequence_get_begin_iter (elt->children->seq));
1468 gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
1471 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1472 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1473 GtkTreeIter child_iter;
1475 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1476 g_return_val_if_fail (VALID_ITER (iter, tree_model_sort), FALSE);
1478 GET_CHILD_ITER (tree_model_sort, &child_iter, iter);
1480 return gtk_tree_model_iter_has_child (priv->child_model, &child_iter);
1484 gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
1487 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1488 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1489 GtkTreeIter child_iter;
1491 g_return_val_if_fail (priv->child_model != NULL, 0);
1493 g_return_val_if_fail (VALID_ITER (iter, tree_model_sort), 0);
1496 return gtk_tree_model_iter_n_children (priv->child_model, NULL);
1498 GET_CHILD_ITER (tree_model_sort, &child_iter, iter);
1500 return gtk_tree_model_iter_n_children (priv->child_model, &child_iter);
1504 gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
1506 GtkTreeIter *parent,
1509 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1511 /* We have this for the iter == parent case */
1512 GtkTreeIter children;
1515 g_return_val_if_fail (VALID_ITER (parent, tree_model_sort), FALSE);
1517 /* Use this instead of has_child to force us to build the level, if needed */
1518 if (gtk_tree_model_sort_iter_children (tree_model, &children, parent) == FALSE)
1524 level = children.user_data;
1525 if (n >= g_sequence_get_length (level->seq))
1531 iter->stamp = tree_model_sort->priv->stamp;
1532 iter->user_data = level;
1533 iter->user_data2 = g_sequence_get (g_sequence_get_iter_at_pos (level->seq, n));
1539 gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
1543 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1544 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1548 g_return_val_if_fail (priv->child_model != NULL, FALSE);
1549 g_return_val_if_fail (VALID_ITER (child, tree_model_sort), FALSE);
1551 level = child->user_data;
1553 if (level->parent_level)
1555 iter->stamp = priv->stamp;
1556 iter->user_data = level->parent_level;
1557 iter->user_data2 = level->parent_elt;
1565 gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
1568 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1569 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1570 GtkTreeIter child_iter;
1574 g_return_if_fail (priv->child_model != NULL);
1575 g_return_if_fail (VALID_ITER (iter, tree_model_sort));
1577 GET_CHILD_ITER (tree_model_sort, &child_iter, iter);
1579 /* Reference the node in the child model */
1580 gtk_tree_model_ref_node (priv->child_model, &child_iter);
1582 /* Increase the reference count of this element and its level */
1583 level = iter->user_data;
1584 elt = iter->user_data2;
1589 if (level->ref_count == 1)
1591 SortLevel *parent_level = level->parent_level;
1592 SortElt *parent_elt = level->parent_elt;
1594 /* We were at zero -- time to decrement the zero_ref_count val */
1595 while (parent_level)
1597 parent_elt->zero_ref_count--;
1599 parent_elt = parent_level->parent_elt;
1600 parent_level = parent_level->parent_level;
1603 if (priv->root != level)
1604 priv->zero_ref_count--;
1609 gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
1611 gboolean propagate_unref)
1613 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1614 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1618 g_return_if_fail (priv->child_model != NULL);
1619 g_return_if_fail (VALID_ITER (iter, tree_model_sort));
1621 if (propagate_unref)
1623 GtkTreeIter child_iter;
1625 GET_CHILD_ITER (tree_model_sort, &child_iter, iter);
1626 gtk_tree_model_unref_node (priv->child_model, &child_iter);
1629 level = iter->user_data;
1630 elt = iter->user_data2;
1632 g_return_if_fail (elt->ref_count > 0);
1637 if (level->ref_count == 0)
1639 SortLevel *parent_level = level->parent_level;
1640 SortElt *parent_elt = level->parent_elt;
1642 /* We are at zero -- time to increment the zero_ref_count val */
1643 while (parent_level)
1645 parent_elt->zero_ref_count++;
1647 parent_elt = parent_level->parent_elt;
1648 parent_level = parent_level->parent_level;
1651 if (priv->root != level)
1652 priv->zero_ref_count++;
1657 gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
1660 gtk_tree_model_sort_real_unref_node (tree_model, iter, TRUE);
1663 /* Sortable interface */
1665 gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
1666 gint *sort_column_id,
1669 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1670 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1673 *sort_column_id = priv->sort_column_id;
1675 *order = priv->order;
1677 if (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID ||
1678 priv->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
1685 gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
1686 gint sort_column_id,
1689 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1690 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1692 if (sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
1694 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1696 GtkTreeDataSortHeader *header = NULL;
1698 header = _gtk_tree_data_list_get_header (priv->sort_list,
1701 /* we want to make sure that we have a function */
1702 g_return_if_fail (header != NULL);
1703 g_return_if_fail (header->func != NULL);
1706 g_return_if_fail (priv->default_sort_func != NULL);
1708 if (priv->sort_column_id == sort_column_id)
1710 if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1712 if (priv->order == order)
1720 priv->sort_column_id = sort_column_id;
1721 priv->order = order;
1723 gtk_tree_sortable_sort_column_changed (sortable);
1725 gtk_tree_model_sort_sort (tree_model_sort);
1729 gtk_tree_model_sort_set_sort_func (GtkTreeSortable *sortable,
1730 gint sort_column_id,
1731 GtkTreeIterCompareFunc func,
1733 GDestroyNotify destroy)
1735 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) sortable;
1736 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1738 priv->sort_list = _gtk_tree_data_list_set_header (priv->sort_list,
1740 func, data, destroy);
1742 if (priv->sort_column_id == sort_column_id)
1743 gtk_tree_model_sort_sort (tree_model_sort);
1747 gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable *sortable,
1748 GtkTreeIterCompareFunc func,
1750 GDestroyNotify destroy)
1752 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1753 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1755 if (priv->default_sort_destroy)
1757 GDestroyNotify d = priv->default_sort_destroy;
1759 priv->default_sort_destroy = NULL;
1760 d (priv->default_sort_data);
1763 priv->default_sort_func = func;
1764 priv->default_sort_data = data;
1765 priv->default_sort_destroy = destroy;
1767 if (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1768 gtk_tree_model_sort_sort (tree_model_sort);
1772 gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable)
1774 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1776 return (tree_model_sort->priv->default_sort_func != NULL);
1779 /* DragSource interface */
1781 gtk_tree_model_sort_row_draggable (GtkTreeDragSource *drag_source,
1784 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1785 GtkTreePath *child_path;
1788 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort,
1790 draggable = gtk_tree_drag_source_row_draggable (GTK_TREE_DRAG_SOURCE (tree_model_sort->priv->child_model), child_path);
1791 gtk_tree_path_free (child_path);
1797 gtk_tree_model_sort_drag_data_get (GtkTreeDragSource *drag_source,
1799 GtkSelectionData *selection_data)
1801 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1802 GtkTreePath *child_path;
1805 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort, path);
1806 gotten = gtk_tree_drag_source_drag_data_get (GTK_TREE_DRAG_SOURCE (tree_model_sort->priv->child_model), child_path, selection_data);
1807 gtk_tree_path_free (child_path);
1813 gtk_tree_model_sort_drag_data_delete (GtkTreeDragSource *drag_source,
1816 GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)drag_source;
1817 GtkTreePath *child_path;
1820 child_path = gtk_tree_model_sort_convert_path_to_child_path (tree_model_sort, path);
1821 deleted = gtk_tree_drag_source_drag_data_delete (GTK_TREE_DRAG_SOURCE (tree_model_sort->priv->child_model), child_path);
1822 gtk_tree_path_free (child_path);
1827 /* sorting code - private */
1829 gtk_tree_model_sort_compare_func (gconstpointer a,
1833 SortData *data = (SortData *)user_data;
1834 GtkTreeModelSort *tree_model_sort = data->tree_model_sort;
1835 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1836 const SortElt *sa = a;
1837 const SortElt *sb = b;
1839 GtkTreeIter iter_a, iter_b;
1842 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1849 data->parent_path_indices [data->parent_path_depth-1] = sa->offset;
1850 gtk_tree_model_get_iter (GTK_TREE_MODEL (priv->child_model), &iter_a, data->parent_path);
1851 data->parent_path_indices [data->parent_path_depth-1] = sb->offset;
1852 gtk_tree_model_get_iter (GTK_TREE_MODEL (priv->child_model), &iter_b, data->parent_path);
1855 retval = (* data->sort_func) (GTK_TREE_MODEL (priv->child_model),
1859 if (priv->order == GTK_SORT_DESCENDING)
1863 else if (retval < 0)
1871 gtk_tree_model_sort_offset_compare_func (gconstpointer a,
1877 const SortElt *sa = (SortElt *)a;
1878 const SortElt *sb = (SortElt *)b;
1880 SortData *data = (SortData *)user_data;
1882 if (sa->offset < sb->offset)
1884 else if (sa->offset > sb->offset)
1889 if (data->tree_model_sort->priv->order == GTK_SORT_DESCENDING)
1893 else if (retval < 0)
1901 gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
1904 gboolean emit_reordered)
1906 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
1908 GSequenceIter *begin_siter, *end_siter, *siter;
1917 g_return_if_fail (level != NULL);
1919 begin_siter = g_sequence_get_begin_iter (level->seq);
1920 begin_elt = g_sequence_get (begin_siter);
1922 if (g_sequence_get_length (level->seq) < 1 && !begin_elt->children)
1925 iter.stamp = priv->stamp;
1926 iter.user_data = level;
1927 iter.user_data2 = begin_elt;
1929 gtk_tree_model_sort_ref_node (GTK_TREE_MODEL (tree_model_sort), &iter);
1932 end_siter = g_sequence_get_end_iter (level->seq);
1933 for (siter = g_sequence_get_begin_iter (level->seq);
1935 siter = g_sequence_iter_next (siter))
1937 SortElt *elt = g_sequence_get (siter);
1943 fill_sort_data (&data, tree_model_sort, level);
1945 if (data.sort_func == NO_SORT_FUNC)
1946 g_sequence_sort (level->seq, gtk_tree_model_sort_offset_compare_func,
1949 g_sequence_sort (level->seq, gtk_tree_model_sort_compare_func, &data);
1951 free_sort_data (&data);
1953 new_order = g_new (gint, g_sequence_get_length (level->seq));
1956 end_siter = g_sequence_get_end_iter (level->seq);
1957 for (siter = g_sequence_get_begin_iter (level->seq);
1959 siter = g_sequence_iter_next (siter))
1961 SortElt *elt = g_sequence_get (siter);
1963 new_order[i++] = elt->old_index;
1968 gtk_tree_model_sort_increment_stamp (tree_model_sort);
1969 if (level->parent_elt)
1971 iter.stamp = priv->stamp;
1972 iter.user_data = level->parent_level;
1973 iter.user_data2 = level->parent_elt;
1975 path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort),
1978 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1984 path = gtk_tree_path_new ();
1985 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1989 gtk_tree_path_free (path);
1992 /* recurse, if possible */
1995 end_siter = g_sequence_get_end_iter (level->seq);
1996 for (siter = g_sequence_get_begin_iter (level->seq);
1998 siter = g_sequence_iter_next (siter))
2000 SortElt *elt = g_sequence_get (siter);
2003 gtk_tree_model_sort_sort_level (tree_model_sort,
2005 TRUE, emit_reordered);
2011 /* get the iter we referenced at the beginning of this function and
2014 iter.stamp = priv->stamp;
2015 iter.user_data = level;
2016 iter.user_data2 = begin_elt;
2018 gtk_tree_model_sort_unref_node (GTK_TREE_MODEL (tree_model_sort), &iter);
2022 gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort)
2024 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2026 if (priv->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
2032 if (priv->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2034 GtkTreeDataSortHeader *header = NULL;
2036 header = _gtk_tree_data_list_get_header (priv->sort_list,
2037 priv->sort_column_id);
2039 /* we want to make sure that we have a function */
2040 g_return_if_fail (header != NULL);
2041 g_return_if_fail (header->func != NULL);
2044 g_return_if_fail (priv->default_sort_func != NULL);
2046 gtk_tree_model_sort_sort_level (tree_model_sort, priv->root,
2050 /* signal helpers */
2052 gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
2054 GtkTreePath *s_path,
2055 GtkTreeIter *s_iter)
2057 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2062 elt = sort_elt_new ();
2064 offset = gtk_tree_path_get_indices (s_path)[gtk_tree_path_get_depth (s_path) - 1];
2066 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2067 elt->iter = *s_iter;
2068 elt->offset = offset;
2069 elt->zero_ref_count = 0;
2071 elt->children = NULL;
2073 /* update all larger offsets */
2074 g_sequence_foreach (level->seq, increase_offset_iter, GINT_TO_POINTER (offset));
2076 fill_sort_data (&data, tree_model_sort, level);
2078 if (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
2079 priv->default_sort_func == NO_SORT_FUNC)
2081 elt->siter = g_sequence_insert_sorted (level->seq, elt,
2082 gtk_tree_model_sort_offset_compare_func,
2087 elt->siter = g_sequence_insert_sorted (level->seq, elt,
2088 gtk_tree_model_sort_compare_func,
2092 free_sort_data (&data);
2097 /* sort elt stuff */
2098 static GtkTreePath *
2099 gtk_tree_model_sort_elt_get_path (SortLevel *level,
2102 SortLevel *walker = level;
2103 SortElt *walker2 = elt;
2106 g_return_val_if_fail (level != NULL, NULL);
2107 g_return_val_if_fail (elt != NULL, NULL);
2109 path = gtk_tree_path_new ();
2113 gtk_tree_path_prepend_index (path, walker2->offset);
2115 if (!walker->parent_level)
2118 walker2 = walker->parent_elt;
2119 walker = walker->parent_level;
2126 * gtk_tree_model_sort_set_model:
2127 * @tree_model_sort: The #GtkTreeModelSort.
2128 * @child_model: (allow-none): A #GtkTreeModel, or %NULL.
2130 * Sets the model of @tree_model_sort to be @model. If @model is %NULL,
2131 * then the old model is unset. The sort function is unset as a result
2132 * of this call. The model will be in an unsorted state until a sort
2136 gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
2137 GtkTreeModel *child_model)
2139 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2142 g_object_ref (child_model);
2144 if (priv->child_model)
2146 g_signal_handler_disconnect (priv->child_model,
2148 g_signal_handler_disconnect (priv->child_model,
2150 g_signal_handler_disconnect (priv->child_model,
2151 priv->has_child_toggled_id);
2152 g_signal_handler_disconnect (priv->child_model,
2154 g_signal_handler_disconnect (priv->child_model,
2155 priv->reordered_id);
2157 /* reset our state */
2159 gtk_tree_model_sort_free_level (tree_model_sort, priv->root, TRUE);
2161 _gtk_tree_data_list_header_free (priv->sort_list);
2162 priv->sort_list = NULL;
2163 g_object_unref (priv->child_model);
2166 priv->child_model = child_model;
2174 g_signal_connect (child_model, "row-changed",
2175 G_CALLBACK (gtk_tree_model_sort_row_changed),
2178 g_signal_connect (child_model, "row-inserted",
2179 G_CALLBACK (gtk_tree_model_sort_row_inserted),
2181 priv->has_child_toggled_id =
2182 g_signal_connect (child_model, "row-has-child-toggled",
2183 G_CALLBACK (gtk_tree_model_sort_row_has_child_toggled),
2186 g_signal_connect (child_model, "row-deleted",
2187 G_CALLBACK (gtk_tree_model_sort_row_deleted),
2189 priv->reordered_id =
2190 g_signal_connect (child_model, "rows-reordered",
2191 G_CALLBACK (gtk_tree_model_sort_rows_reordered),
2194 priv->child_flags = gtk_tree_model_get_flags (child_model);
2195 n_columns = gtk_tree_model_get_n_columns (child_model);
2197 types = g_new (GType, n_columns);
2198 for (i = 0; i < n_columns; i++)
2199 types[i] = gtk_tree_model_get_column_type (child_model, i);
2201 priv->sort_list = _gtk_tree_data_list_header_new (n_columns, types);
2204 priv->default_sort_func = NO_SORT_FUNC;
2205 priv->stamp = g_random_int ();
2210 * gtk_tree_model_sort_get_model:
2211 * @tree_model: a #GtkTreeModelSort
2213 * Returns the model the #GtkTreeModelSort is sorting.
2215 * Return value: (transfer none): the "child model" being sorted
2218 gtk_tree_model_sort_get_model (GtkTreeModelSort *tree_model)
2220 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
2222 return tree_model->priv->child_model;
2226 static GtkTreePath *
2227 gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
2228 GtkTreePath *child_path,
2229 gboolean build_levels)
2231 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2232 gint *child_indices;
2233 GtkTreePath *retval;
2237 g_return_val_if_fail (priv->child_model != NULL, NULL);
2238 g_return_val_if_fail (child_path != NULL, NULL);
2240 retval = gtk_tree_path_new ();
2241 child_indices = gtk_tree_path_get_indices (child_path);
2243 if (priv->root == NULL && build_levels)
2244 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
2245 level = SORT_LEVEL (priv->root);
2247 for (i = 0; i < gtk_tree_path_get_depth (child_path); i++)
2250 GSequenceIter *siter;
2251 gboolean found_child = FALSE;
2255 gtk_tree_path_free (retval);
2259 if (child_indices[i] >= g_sequence_get_length (level->seq))
2261 gtk_tree_path_free (retval);
2264 tmp = lookup_elt_with_offset (tree_model_sort, level,
2265 child_indices[i], &siter);
2268 gtk_tree_path_append_index (retval, g_sequence_iter_get_position (siter));
2269 if (tmp->children == NULL && build_levels)
2270 gtk_tree_model_sort_build_level (tree_model_sort, level, tmp);
2272 level = tmp->children;
2278 gtk_tree_path_free (retval);
2288 * gtk_tree_model_sort_convert_child_path_to_path:
2289 * @tree_model_sort: A #GtkTreeModelSort
2290 * @child_path: A #GtkTreePath to convert
2292 * Converts @child_path to a path relative to @tree_model_sort. That is,
2293 * @child_path points to a path in the child model. The returned path will
2294 * point to the same row in the sorted model. If @child_path isn't a valid
2295 * path on the child model, then %NULL is returned.
2297 * Return value: A newly allocated #GtkTreePath, or %NULL
2300 gtk_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
2301 GtkTreePath *child_path)
2303 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2304 g_return_val_if_fail (tree_model_sort->priv->child_model != NULL, NULL);
2305 g_return_val_if_fail (child_path != NULL, NULL);
2307 return gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path, TRUE);
2311 * gtk_tree_model_sort_convert_child_iter_to_iter:
2312 * @tree_model_sort: A #GtkTreeModelSort
2313 * @sort_iter: (out): An uninitialized #GtkTreeIter.
2314 * @child_iter: A valid #GtkTreeIter pointing to a row on the child model
2316 * Sets @sort_iter to point to the row in @tree_model_sort that corresponds to
2317 * the row pointed at by @child_iter. If @sort_iter was not set, %FALSE
2318 * is returned. Note: a boolean is only returned since 2.14.
2320 * Return value: %TRUE, if @sort_iter was set, i.e. if @sort_iter is a
2321 * valid iterator pointer to a visible row in the child model.
2324 gtk_tree_model_sort_convert_child_iter_to_iter (GtkTreeModelSort *tree_model_sort,
2325 GtkTreeIter *sort_iter,
2326 GtkTreeIter *child_iter)
2329 GtkTreePath *child_path, *path;
2330 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2332 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), FALSE);
2333 g_return_val_if_fail (priv->child_model != NULL, FALSE);
2334 g_return_val_if_fail (sort_iter != NULL, FALSE);
2335 g_return_val_if_fail (child_iter != NULL, FALSE);
2336 g_return_val_if_fail (sort_iter != child_iter, FALSE);
2338 sort_iter->stamp = 0;
2340 child_path = gtk_tree_model_get_path (priv->child_model, child_iter);
2341 g_return_val_if_fail (child_path != NULL, FALSE);
2343 path = gtk_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path);
2344 gtk_tree_path_free (child_path);
2348 g_warning ("%s: The conversion of the child path to a GtkTreeModel sort path failed", G_STRLOC);
2352 ret = gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort),
2354 gtk_tree_path_free (path);
2360 * gtk_tree_model_sort_convert_path_to_child_path:
2361 * @tree_model_sort: A #GtkTreeModelSort
2362 * @sorted_path: A #GtkTreePath to convert
2364 * Converts @sorted_path to a path on the child model of @tree_model_sort.
2365 * That is, @sorted_path points to a location in @tree_model_sort. The
2366 * returned path will point to the same location in the model not being
2367 * sorted. If @sorted_path does not point to a location in the child model,
2368 * %NULL is returned.
2370 * Return value: A newly allocated #GtkTreePath, or %NULL
2373 gtk_tree_model_sort_convert_path_to_child_path (GtkTreeModelSort *tree_model_sort,
2374 GtkTreePath *sorted_path)
2376 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2377 gint *sorted_indices;
2378 GtkTreePath *retval;
2382 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
2383 g_return_val_if_fail (priv->child_model != NULL, NULL);
2384 g_return_val_if_fail (sorted_path != NULL, NULL);
2386 retval = gtk_tree_path_new ();
2387 sorted_indices = gtk_tree_path_get_indices (sorted_path);
2388 if (priv->root == NULL)
2389 gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
2390 level = SORT_LEVEL (priv->root);
2392 for (i = 0; i < gtk_tree_path_get_depth (sorted_path); i++)
2394 SortElt *elt = NULL;
2395 GSequenceIter *siter;
2397 if ((level == NULL) ||
2398 (g_sequence_get_length (level->seq) <= sorted_indices[i]))
2400 gtk_tree_path_free (retval);
2404 siter = g_sequence_get_iter_at_pos (level->seq, sorted_indices[i]);
2405 if (g_sequence_iter_is_end (siter))
2407 gtk_tree_path_free (retval);
2411 elt = GET_ELT (siter);
2412 if (elt->children == NULL)
2413 gtk_tree_model_sort_build_level (tree_model_sort, level, elt);
2417 gtk_tree_path_free (retval);
2421 gtk_tree_path_append_index (retval, elt->offset);
2422 level = elt->children;
2429 * gtk_tree_model_sort_convert_iter_to_child_iter:
2430 * @tree_model_sort: A #GtkTreeModelSort
2431 * @child_iter: (out): An uninitialized #GtkTreeIter
2432 * @sorted_iter: A valid #GtkTreeIter pointing to a row on @tree_model_sort.
2434 * Sets @child_iter to point to the row pointed to by @sorted_iter.
2437 gtk_tree_model_sort_convert_iter_to_child_iter (GtkTreeModelSort *tree_model_sort,
2438 GtkTreeIter *child_iter,
2439 GtkTreeIter *sorted_iter)
2441 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2442 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2443 g_return_if_fail (priv->child_model != NULL);
2444 g_return_if_fail (child_iter != NULL);
2445 g_return_if_fail (VALID_ITER (sorted_iter, tree_model_sort));
2446 g_return_if_fail (sorted_iter != child_iter);
2448 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2450 *child_iter = SORT_ELT (sorted_iter->user_data2)->iter;
2455 gboolean valid = FALSE;
2457 path = gtk_tree_model_sort_elt_get_path (sorted_iter->user_data,
2458 sorted_iter->user_data2);
2459 valid = gtk_tree_model_get_iter (priv->child_model, child_iter, path);
2460 gtk_tree_path_free (path);
2462 g_return_if_fail (valid == TRUE);
2467 gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
2468 SortLevel *parent_level,
2469 SortElt *parent_elt)
2471 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2473 SortLevel *new_level;
2477 g_assert (priv->child_model != NULL);
2479 if (parent_level == NULL)
2481 if (gtk_tree_model_get_iter_first (priv->child_model, &iter) == FALSE)
2483 length = gtk_tree_model_iter_n_children (priv->child_model, NULL);
2487 GtkTreeIter parent_iter;
2488 GtkTreeIter child_parent_iter;
2490 parent_iter.stamp = priv->stamp;
2491 parent_iter.user_data = parent_level;
2492 parent_iter.user_data2 = parent_elt;
2494 gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2497 if (gtk_tree_model_iter_children (priv->child_model,
2499 &child_parent_iter) == FALSE)
2502 /* stamp may have changed */
2503 gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2507 length = gtk_tree_model_iter_n_children (priv->child_model, &child_parent_iter);
2509 gtk_tree_model_sort_ref_node (GTK_TREE_MODEL (tree_model_sort),
2513 g_return_if_fail (length > 0);
2515 new_level = g_new (SortLevel, 1);
2516 new_level->seq = g_sequence_new (sort_elt_free);
2517 new_level->ref_count = 0;
2518 new_level->parent_level = parent_level;
2519 new_level->parent_elt = parent_elt;
2522 parent_elt->children = new_level;
2524 priv->root = new_level;
2526 /* increase the count of zero ref_counts.*/
2527 while (parent_level)
2529 parent_elt->zero_ref_count++;
2531 parent_elt = parent_level->parent_elt;
2532 parent_level = parent_level->parent_level;
2535 if (new_level != priv->root)
2536 priv->zero_ref_count++;
2538 for (i = 0; i < length; i++)
2542 sort_elt = sort_elt_new ();
2543 sort_elt->offset = i;
2544 sort_elt->zero_ref_count = 0;
2545 sort_elt->ref_count = 0;
2546 sort_elt->children = NULL;
2548 if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2550 sort_elt->iter = iter;
2551 if (gtk_tree_model_iter_next (priv->child_model, &iter) == FALSE &&
2559 level = gtk_tree_model_sort_elt_get_path (parent_level,
2561 str = gtk_tree_path_to_string (level);
2562 gtk_tree_path_free (level);
2564 g_warning ("%s: There is a discrepancy between the sort model "
2565 "and the child model. The child model is "
2566 "advertising a wrong length for level %s:.",
2572 g_warning ("%s: There is a discrepancy between the sort model "
2573 "and the child model. The child model is "
2574 "advertising a wrong length for the root level.",
2582 sort_elt->siter = g_sequence_append (new_level->seq, sort_elt);
2586 gtk_tree_model_sort_sort_level (tree_model_sort, new_level,
2591 gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
2592 SortLevel *sort_level,
2595 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2596 GSequenceIter *siter;
2597 GSequenceIter *end_siter;
2599 g_assert (sort_level);
2601 end_siter = g_sequence_get_end_iter (sort_level->seq);
2602 for (siter = g_sequence_get_begin_iter (sort_level->seq);
2604 siter = g_sequence_iter_next (siter))
2606 SortElt *elt = g_sequence_get (siter);
2609 gtk_tree_model_sort_free_level (tree_model_sort,
2610 elt->children, unref);
2613 if (sort_level->ref_count == 0)
2615 SortLevel *parent_level = sort_level->parent_level;
2616 SortElt *parent_elt = sort_level->parent_elt;
2618 while (parent_level)
2620 parent_elt->zero_ref_count--;
2622 parent_elt = parent_level->parent_elt;
2623 parent_level = parent_level->parent_level;
2626 if (sort_level != priv->root)
2627 priv->zero_ref_count--;
2630 if (sort_level->parent_elt)
2634 GtkTreeIter parent_iter;
2636 parent_iter.stamp = tree_model_sort->priv->stamp;
2637 parent_iter.user_data = sort_level->parent_level;
2638 parent_iter.user_data2 = sort_level->parent_elt;
2640 gtk_tree_model_sort_unref_node (GTK_TREE_MODEL (tree_model_sort),
2644 sort_level->parent_elt->children = NULL;
2649 g_sequence_free (sort_level->seq);
2650 sort_level->seq = NULL;
2652 g_free (sort_level);
2657 gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort)
2659 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2665 while (priv->stamp == 0);
2667 gtk_tree_model_sort_clear_cache (tree_model_sort);
2671 gtk_tree_model_sort_clear_cache_helper_iter (gpointer data,
2674 GtkTreeModelSort *tree_model_sort = user_data;
2675 SortElt *elt = data;
2677 if (elt->zero_ref_count > 0)
2678 gtk_tree_model_sort_clear_cache_helper (tree_model_sort, elt->children);
2682 gtk_tree_model_sort_clear_cache_helper (GtkTreeModelSort *tree_model_sort,
2685 g_assert (level != NULL);
2687 g_sequence_foreach (level->seq, gtk_tree_model_sort_clear_cache_helper_iter,
2690 if (level->ref_count == 0 && level != tree_model_sort->priv->root)
2691 gtk_tree_model_sort_free_level (tree_model_sort, level, TRUE);
2695 * gtk_tree_model_sort_reset_default_sort_func:
2696 * @tree_model_sort: A #GtkTreeModelSort
2698 * This resets the default sort function to be in the 'unsorted' state. That
2699 * is, it is in the same order as the child model. It will re-sort the model
2700 * to be in the same order as the child model only if the #GtkTreeModelSort
2701 * is in 'unsorted' state.
2704 gtk_tree_model_sort_reset_default_sort_func (GtkTreeModelSort *tree_model_sort)
2706 GtkTreeModelSortPrivate *priv = tree_model_sort->priv;
2708 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2710 if (priv->default_sort_destroy)
2712 GDestroyNotify d = priv->default_sort_destroy;
2714 priv->default_sort_destroy = NULL;
2715 d (priv->default_sort_data);
2718 priv->default_sort_func = NO_SORT_FUNC;
2719 priv->default_sort_data = NULL;
2720 priv->default_sort_destroy = NULL;
2722 if (priv->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2723 gtk_tree_model_sort_sort (tree_model_sort);
2724 priv->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
2728 * gtk_tree_model_sort_clear_cache:
2729 * @tree_model_sort: A #GtkTreeModelSort
2731 * This function should almost never be called. It clears the @tree_model_sort
2732 * of any cached iterators that haven't been reffed with
2733 * gtk_tree_model_ref_node(). This might be useful if the child model being
2734 * sorted is static (and doesn't change often) and there has been a lot of
2735 * unreffed access to nodes. As a side effect of this function, all unreffed
2736 * iters will be invalid.
2739 gtk_tree_model_sort_clear_cache (GtkTreeModelSort *tree_model_sort)
2741 g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2743 if (tree_model_sort->priv->zero_ref_count > 0)
2744 gtk_tree_model_sort_clear_cache_helper (tree_model_sort, (SortLevel *)tree_model_sort->priv->root);
2748 gtk_tree_model_sort_iter_is_valid_helper (GtkTreeIter *iter,
2751 GSequenceIter *siter;
2752 GSequenceIter *end_siter;
2754 end_siter = g_sequence_get_end_iter (level->seq);
2755 for (siter = g_sequence_get_begin_iter (level->seq);
2756 siter != end_siter; siter = g_sequence_iter_next (siter))
2758 SortElt *elt = g_sequence_get (siter);
2760 if (iter->user_data == level && iter->user_data2 == elt)
2764 if (gtk_tree_model_sort_iter_is_valid_helper (iter, elt->children))
2772 * gtk_tree_model_sort_iter_is_valid:
2773 * @tree_model_sort: A #GtkTreeModelSort.
2774 * @iter: A #GtkTreeIter.
2777 * This function is slow. Only use it for debugging and/or testing purposes.
2780 * Checks if the given iter is a valid iter for this #GtkTreeModelSort.
2782 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
2787 gtk_tree_model_sort_iter_is_valid (GtkTreeModelSort *tree_model_sort,
2790 g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), FALSE);
2791 g_return_val_if_fail (iter != NULL, FALSE);
2793 if (!VALID_ITER (iter, tree_model_sort))
2796 return gtk_tree_model_sort_iter_is_valid_helper (iter,
2797 tree_model_sort->priv->root);