Pileus Git - ~andy/gtk/blob - gtk/gtktreemodelsort.c

   1 /* gtktreemodelsort.c
   2  * Copyright (C) 2000,2001  Red Hat, Inc.,  Jonathan Blandford <jrb@redhat.com>
   3  * Copyright (C) 2001,2002  Kristian Rietveld <kris@gtk.org>
   4  *
   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.
   9  *
  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.
  14  *
  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.
  19  */
  20
  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);
  25  */
  26
  27 /* ITER FORMAT:
  28  *
  29  * iter->stamp = tree_model_sort->stamp
  30  * iter->user_data = SortLevel
  31  * iter->user_data2 = SortElt
  32  */
  33
  34 /* WARNING: this code is dangerous, can cause sleepless nights,
  35  * can cause your dog to die among other bad things
  36  *
  37  * we warned you and we're not liable for any head injuries.
  38  */
  39
  40 #include "gtktreemodelsort.h"
  41 #include "gtktreesortable.h"
  42 #include "gtktreestore.h"
  43 #include "gtksignal.h"
  44 #include "gtktreedatalist.h"
  45 #include <string.h>
  46 #include "gtkintl.h"
  47
  48 typedef struct _SortElt SortElt;
  49 typedef struct _SortLevel SortLevel;
  50 typedef struct _SortData SortData;
  51 typedef struct _SortTuple SortTuple;
  52
  53 struct _SortElt
  54 {
  55   GtkTreeIter  iter;
  56   SortLevel   *children;
  57   gint         offset;
  58   gint         ref_count;
  59   gint         zero_ref_count;
  60 };
  61
  62 struct _SortLevel
  63 {
  64   GArray    *array;
  65   gint       ref_count;
  66   SortElt   *parent_elt;
  67   SortLevel *parent_level;
  68 };
  69
  70 struct _SortData
  71 {
  72   GtkTreeModelSort *tree_model_sort;
  73   GtkTreePath *parent_path;
  74   gint parent_path_depth;
  75   gint *parent_path_indices;
  76   GtkTreeIterCompareFunc sort_func;
  77   gpointer sort_data;
  78 };
  79
  80 struct _SortTuple
  81 {
  82   SortElt   *elt;
  83   gint       offset;
  84 };
  85
  86 /* Properties */
  87 enum {
  88   PROP_0,
  89   /* Construct args */
  90   PROP_MODEL
  91 };
  92
  93
  94
  95 #define GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS(tree_model_sort) \
  96         (((GtkTreeModelSort *)tree_model_sort)->child_flags&GTK_TREE_MODEL_ITERS_PERSIST)
  97 #define SORT_ELT(sort_elt) ((SortElt *)sort_elt)
  98 #define SORT_LEVEL(sort_level) ((SortLevel *)sort_level)
  99
 100 #define GET_CHILD_ITER(tree_model_sort,child_iter,sort_iter) gtk_tree_model_sort_convert_iter_to_child_iter(GTK_TREE_MODEL_SORT (tree_model_sort), child_iter, sort_iter);
 101
 102 #define NO_SORT_FUNC ((GtkTreeIterCompareFunc) 0x1)
 103
 104 /* general (object/interface init, etc) */
 105 static void gtk_tree_model_sort_init                  (GtkTreeModelSort      *tree_model_sort);
 106 static void gtk_tree_model_sort_class_init            (GtkTreeModelSortClass *tree_model_sort_class);
 107 static void gtk_tree_model_sort_tree_model_init       (GtkTreeModelIface     *iface);
 108 static void gtk_tree_model_sort_tree_sortable_init    (GtkTreeSortableIface  *iface);
 109 static void gtk_tree_model_sort_finalize              (GObject               *object);
 110 static void gtk_tree_model_sort_set_property          (GObject               *object,
 111                                                        guint                  prop_id,
 112                                                        const GValue          *value,
 113                                                        GParamSpec            *pspec);
 114 static void gtk_tree_model_sort_get_property          (GObject               *object,
 115                                                        guint                  prop_id,
 116                                                        GValue                *value,
 117                                                        GParamSpec            *pspec);
 118
 119 /* our signal handlers */
 120 static void gtk_tree_model_sort_row_changed           (GtkTreeModel          *model,
 121                                                        GtkTreePath           *start_path,
 122                                                        GtkTreeIter           *start_iter,
 123                                                        gpointer               data);
 124 static void gtk_tree_model_sort_row_inserted          (GtkTreeModel          *model,
 125                                                        GtkTreePath           *path,
 126                                                        GtkTreeIter           *iter,
 127                                                        gpointer               data);
 128 static void gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel          *model,
 129                                                        GtkTreePath           *path,
 130                                                        GtkTreeIter           *iter,
 131                                                        gpointer               data);
 132 static void gtk_tree_model_sort_row_deleted           (GtkTreeModel          *model,
 133                                                        GtkTreePath           *path,
 134                                                        gpointer               data);
 135 static void gtk_tree_model_sort_rows_reordered        (GtkTreeModel          *s_model,
 136                                                        GtkTreePath           *s_path,
 137                                                        GtkTreeIter           *s_iter,
 138                                                        gint                  *new_order,
 139                                                        gpointer               data);
 140
 141 /* TreeModel interface */
 142 static guint        gtk_tree_model_sort_get_flags          (GtkTreeModel          *tree_model);
 143 static gint         gtk_tree_model_sort_get_n_columns      (GtkTreeModel          *tree_model);
 144 static GType        gtk_tree_model_sort_get_column_type    (GtkTreeModel          *tree_model,
 145                                                             gint                   index);
 146 static gboolean     gtk_tree_model_sort_get_iter           (GtkTreeModel          *tree_model,
 147                                                             GtkTreeIter           *iter,
 148                                                             GtkTreePath           *path);
 149 static GtkTreePath *gtk_tree_model_sort_get_path           (GtkTreeModel          *tree_model,
 150                                                             GtkTreeIter           *iter);
 151 static void         gtk_tree_model_sort_get_value          (GtkTreeModel          *tree_model,
 152                                                             GtkTreeIter           *iter,
 153                                                             gint                   column,
 154                                                             GValue                *value);
 155 static gboolean     gtk_tree_model_sort_iter_next          (GtkTreeModel          *tree_model,
 156                                                             GtkTreeIter           *iter);
 157 static gboolean     gtk_tree_model_sort_iter_children      (GtkTreeModel          *tree_model,
 158                                                             GtkTreeIter           *iter,
 159                                                             GtkTreeIter           *parent);
 160 static gboolean     gtk_tree_model_sort_iter_has_child     (GtkTreeModel          *tree_model,
 161                                                             GtkTreeIter           *iter);
 162 static gint         gtk_tree_model_sort_iter_n_children    (GtkTreeModel          *tree_model,
 163                                                             GtkTreeIter           *iter);
 164 static gboolean     gtk_tree_model_sort_iter_nth_child     (GtkTreeModel          *tree_model,
 165                                                             GtkTreeIter           *iter,
 166                                                             GtkTreeIter           *parent,
 167                                                             gint                   n);
 168 static gboolean     gtk_tree_model_sort_iter_parent        (GtkTreeModel          *tree_model,
 169                                                             GtkTreeIter           *iter,
 170                                                             GtkTreeIter           *child);
 171 static void         gtk_tree_model_sort_ref_node           (GtkTreeModel          *tree_model,
 172                                                             GtkTreeIter           *iter);
 173 static void         gtk_tree_model_sort_real_unref_node    (GtkTreeModel          *tree_model,
 174                                                             GtkTreeIter           *iter,
 175                                                             gboolean               propagate_unref);
 176 static void         gtk_tree_model_sort_unref_node         (GtkTreeModel          *tree_model,
 177                                                             GtkTreeIter           *iter);
 178
 179 /* TreeSortable interface */
 180 static gboolean     gtk_tree_model_sort_get_sort_column_id    (GtkTreeSortable        *sortable,
 181                                                                gint                   *sort_column_id,
 182                                                                GtkSortType            *order);
 183 static void         gtk_tree_model_sort_set_sort_column_id    (GtkTreeSortable        *sortable,
 184                                                                gint                    sort_column_id,
 185                                                                GtkSortType        order);
 186 static void         gtk_tree_model_sort_set_sort_func         (GtkTreeSortable        *sortable,
 187                                                                gint                    sort_column_id,
 188                                                                GtkTreeIterCompareFunc  func,
 189                                                                gpointer                data,
 190                                                                GtkDestroyNotify        destroy);
 191 static void         gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable        *sortable,
 192                                                                GtkTreeIterCompareFunc  func,
 193                                                                gpointer                data,
 194                                                                GtkDestroyNotify        destroy);
 195 static gboolean     gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable     *sortable);
 196
 197 /* Private functions (sort funcs, level handling and other utils) */
 198 static void         gtk_tree_model_sort_build_level       (GtkTreeModelSort *tree_model_sort,
 199                                                            SortLevel        *parent_level,
 200                                                            SortElt          *parent_elt);
 201 static void         gtk_tree_model_sort_free_level        (GtkTreeModelSort *tree_model_sort,
 202                                                            SortLevel        *sort_level);
 203 static void         gtk_tree_model_sort_increment_stamp   (GtkTreeModelSort *tree_model_sort);
 204 static void         gtk_tree_model_sort_sort_level        (GtkTreeModelSort *tree_model_sort,
 205                                                            SortLevel        *level,
 206                                                            gboolean          recurse,
 207                                                            gboolean          emit_reordered);
 208 static void         gtk_tree_model_sort_sort              (GtkTreeModelSort *tree_model_sort);
 209 static gint         gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
 210                                                            SortLevel        *level,
 211                                                            GtkTreeIter      *iter,
 212                                                            gboolean          skip_sort_elt);
 213 static gboolean     gtk_tree_model_sort_insert_value      (GtkTreeModelSort *tree_model_sort,
 214                                                            SortLevel        *level,
 215                                                            GtkTreePath      *s_path,
 216                                                            GtkTreeIter      *s_iter);
 217 static GtkTreePath *gtk_tree_model_sort_elt_get_path      (SortLevel        *level,
 218                                                            SortElt          *elt);
 219 static void         gtk_tree_model_sort_set_model         (GtkTreeModelSort *tree_model_sort,
 220                                                            GtkTreeModel     *child_model);
 221 static GtkTreePath *gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
 222                                                                          GtkTreePath      *child_path,
 223                                                                          gboolean          build_levels);
 224
 225 static GObjectClass *parent_class = NULL;
 226
 227 GType
 228 gtk_tree_model_sort_get_type (void)
 229 {
 230   static GType tree_model_sort_type = 0;
 231
 232   if (!tree_model_sort_type)
 233     {
 234       static const GTypeInfo tree_model_sort_info =
 235       {
 236         sizeof (GtkTreeModelSortClass),
 237         NULL,           /* base_init */
 238         NULL,           /* base_finalize */
 239         (GClassInitFunc) gtk_tree_model_sort_class_init,
 240         NULL,           /* class_finalize */
 241         NULL,           /* class_data */
 242         sizeof (GtkTreeModelSort),
 243         0,              /* n_preallocs */
 244         (GInstanceInitFunc) gtk_tree_model_sort_init
 245       };
 246
 247       static const GInterfaceInfo tree_model_info =
 248       {
 249         (GInterfaceInitFunc) gtk_tree_model_sort_tree_model_init,
 250         NULL,
 251         NULL
 252       };
 253
 254       static const GInterfaceInfo sortable_info =
 255       {
 256         (GInterfaceInitFunc) gtk_tree_model_sort_tree_sortable_init,
 257         NULL,
 258         NULL
 259       };
 260
 261       tree_model_sort_type = g_type_register_static (G_TYPE_OBJECT,
 262                                                      "GtkTreeModelSort",
 263                                                      &tree_model_sort_info, 0);
 264       g_type_add_interface_static (tree_model_sort_type,
 265                                    GTK_TYPE_TREE_MODEL,
 266                                    &tree_model_info);
 267
 268       g_type_add_interface_static (tree_model_sort_type,
 269                                    GTK_TYPE_TREE_SORTABLE,
 270                                    &sortable_info);
 271     }
 272
 273   return tree_model_sort_type;
 274 }
 275
 276 static void
 277 gtk_tree_model_sort_init (GtkTreeModelSort *tree_model_sort)
 278 {
 279   tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
 280   tree_model_sort->stamp = 0;
 281   tree_model_sort->zero_ref_count = 0;
 282   tree_model_sort->root = NULL;
 283   tree_model_sort->sort_list = NULL;
 284 }
 285
 286 static void
 287 gtk_tree_model_sort_class_init (GtkTreeModelSortClass *class)
 288 {
 289   GObjectClass *object_class;
 290
 291   object_class = (GObjectClass *) class;
 292   parent_class = g_type_class_peek_parent (class);
 293
 294   object_class->set_property = gtk_tree_model_sort_set_property;
 295   object_class->get_property = gtk_tree_model_sort_get_property;
 296
 297   object_class->finalize = gtk_tree_model_sort_finalize;
 298
 299   /* Properties */
 300   g_object_class_install_property (object_class,
 301                                    PROP_MODEL,
 302                                    g_param_spec_object ("model",
 303                                                         _("TreeModelSort Model"),
 304                                                         _("The model for the TreeModelSort to sort"),
 305                                                         GTK_TYPE_TREE_MODEL,
 306                                                         G_PARAM_READWRITE | G_PARAM_CONSTRUCT_ONLY));
 307 }
 308
 309 static void
 310 gtk_tree_model_sort_tree_model_init (GtkTreeModelIface *iface)
 311 {
 312   iface->get_flags = gtk_tree_model_sort_get_flags;
 313   iface->get_n_columns = gtk_tree_model_sort_get_n_columns;
 314   iface->get_column_type = gtk_tree_model_sort_get_column_type;
 315   iface->get_iter = gtk_tree_model_sort_get_iter;
 316   iface->get_path = gtk_tree_model_sort_get_path;
 317   iface->get_value = gtk_tree_model_sort_get_value;
 318   iface->iter_next = gtk_tree_model_sort_iter_next;
 319   iface->iter_children = gtk_tree_model_sort_iter_children;
 320   iface->iter_has_child = gtk_tree_model_sort_iter_has_child;
 321   iface->iter_n_children = gtk_tree_model_sort_iter_n_children;
 322   iface->iter_nth_child = gtk_tree_model_sort_iter_nth_child;
 323   iface->iter_parent = gtk_tree_model_sort_iter_parent;
 324   iface->ref_node = gtk_tree_model_sort_ref_node;
 325   iface->unref_node = gtk_tree_model_sort_unref_node;
 326 }
 327
 328 static void
 329 gtk_tree_model_sort_tree_sortable_init (GtkTreeSortableIface *iface)
 330 {
 331   iface->get_sort_column_id = gtk_tree_model_sort_get_sort_column_id;
 332   iface->set_sort_column_id = gtk_tree_model_sort_set_sort_column_id;
 333   iface->set_sort_func = gtk_tree_model_sort_set_sort_func;
 334   iface->set_default_sort_func = gtk_tree_model_sort_set_default_sort_func;
 335   iface->has_default_sort_func = gtk_tree_model_sort_has_default_sort_func;
 336 }
 337
 338 /**
 339  * gtk_tree_model_sort_new_with_model:
 340  * @child_model: A #GtkTreeModel
 341  *
 342  * Creates a new #GtkTreeModel, with @child_model as the child_model.
 343  *
 344  * Return value: A new #GtkTreeModel.
 345  */
 346 GtkTreeModel *
 347 gtk_tree_model_sort_new_with_model (GtkTreeModel      *child_model)
 348 {
 349   GtkTreeModel *retval;
 350
 351   g_return_val_if_fail (GTK_IS_TREE_MODEL (child_model), NULL);
 352
 353   retval = GTK_TREE_MODEL (g_object_new (gtk_tree_model_sort_get_type (), NULL));
 354
 355   gtk_tree_model_sort_set_model (GTK_TREE_MODEL_SORT (retval), child_model);
 356
 357   return retval;
 358 }
 359
 360 /* GObject callbacks */
 361 static void
 362 gtk_tree_model_sort_finalize (GObject *object)
 363 {
 364   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) object;
 365
 366   gtk_tree_model_sort_set_model (tree_model_sort, NULL);
 367
 368   if (tree_model_sort->root)
 369     gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
 370
 371   if (tree_model_sort->sort_list)
 372     {
 373       _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
 374       tree_model_sort->sort_list = NULL;
 375     }
 376
 377   /* must chain up */
 378   parent_class->finalize (object);
 379 }
 380
 381 static void
 382 gtk_tree_model_sort_set_property (GObject      *object,
 383                                   guint         prop_id,
 384                                   const GValue *value,
 385                                   GParamSpec   *pspec)
 386 {
 387   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
 388
 389   switch (prop_id)
 390     {
 391     case PROP_MODEL:
 392       gtk_tree_model_sort_set_model (tree_model_sort, g_value_get_object (value));
 393       break;
 394     default:
 395       G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
 396       break;
 397     }
 398 }
 399
 400 static void
 401 gtk_tree_model_sort_get_property (GObject    *object,
 402                                   guint       prop_id,
 403                                   GValue     *value,
 404                                   GParamSpec *pspec)
 405 {
 406   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (object);
 407
 408   switch (prop_id)
 409     {
 410     case PROP_MODEL:
 411       g_value_set_object (value, gtk_tree_model_sort_get_model(tree_model_sort));
 412       break;
 413     default:
 414       G_OBJECT_WARN_INVALID_PROPERTY_ID (object, prop_id, pspec);
 415       break;
 416     }
 417 }
 418
 419 static void
 420 gtk_tree_model_sort_row_changed (GtkTreeModel *s_model,
 421                                  GtkTreePath  *start_s_path,
 422                                  GtkTreeIter  *start_s_iter,
 423                                  gpointer      data)
 424 {
 425   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 426   GtkTreePath *path = NULL;
 427   GtkTreeIter iter;
 428   GtkTreeIter tmpiter;
 429
 430   SortElt tmp;
 431   SortElt *elt;
 432   SortLevel *level;
 433
 434   gboolean free_s_path = FALSE;
 435
 436   gint offset, index = 0, i;
 437
 438   g_return_if_fail (start_s_path != NULL || start_s_iter != NULL);
 439
 440   if (!start_s_path)
 441     {
 442       free_s_path = TRUE;
 443       start_s_path = gtk_tree_model_get_path (s_model, start_s_iter);
 444     }
 445
 446   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
 447                                                               start_s_path,
 448                                                               FALSE);
 449   if (!path)
 450     {
 451       if (free_s_path)
 452         gtk_tree_path_free (start_s_path);
 453       return;
 454     }
 455
 456   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 457
 458   level = iter.user_data;
 459   elt = iter.user_data2;
 460
 461   if (level->array->len < 2 ||
 462       (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
 463        tree_model_sort->default_sort_func == NO_SORT_FUNC))
 464     {
 465       if (free_s_path)
 466         gtk_tree_path_free (start_s_path);
 467
 468       gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
 469
 470       gtk_tree_path_free (path);
 471
 472       return;
 473     }
 474
 475   if (!GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
 476     {
 477       gtk_tree_model_get_iter (tree_model_sort->child_model,
 478                                &tmpiter, start_s_path);
 479     }
 480
 481   offset = elt->offset;
 482
 483   for (i = 0; i < level->array->len; i++)
 484     if (elt->offset == g_array_index (level->array, SortElt, i).offset)
 485       index = i;
 486
 487   memcpy (&tmp, elt, sizeof (SortElt));
 488   g_array_remove_index (level->array, index);
 489
 490   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
 491     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
 492                                                    level,
 493                                                    &tmp.iter,
 494                                                    TRUE);
 495   else
 496     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
 497                                                    level,
 498                                                    &tmpiter,
 499                                                    TRUE);
 500
 501   g_array_insert_val (level->array, index, tmp);
 502
 503   for (i = 0; i < level->array->len; i++)
 504     if (g_array_index (level->array, SortElt, i).children)
 505       g_array_index (level->array, SortElt, i).children->parent_elt = &g_array_index (level->array, SortElt, i);
 506
 507   gtk_tree_path_up (path);
 508   gtk_tree_path_append_index (path, index);
 509
 510   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 511   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 512
 513   gtk_tree_model_row_changed (GTK_TREE_MODEL (data), path, &iter);
 514
 515   gtk_tree_path_free (path);
 516   if (free_s_path)
 517     gtk_tree_path_free (start_s_path);
 518 }
 519
 520 static void
 521 gtk_tree_model_sort_row_inserted (GtkTreeModel          *s_model,
 522                                   GtkTreePath           *s_path,
 523                                   GtkTreeIter           *s_iter,
 524                                   gpointer               data)
 525 {
 526   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 527   GtkTreePath *path;
 528   GtkTreeIter iter;
 529   GtkTreeIter real_s_iter;
 530
 531   gint i = 0;
 532
 533   gboolean free_s_path = FALSE;
 534
 535   SortElt *elt;
 536   SortLevel *level;
 537   SortLevel *parent_level = NULL;
 538
 539   parent_level = level = SORT_LEVEL (tree_model_sort->root);
 540
 541   g_return_if_fail (s_path != NULL || s_iter != NULL);
 542
 543   if (!s_path)
 544     {
 545       s_path = gtk_tree_model_get_path (s_model, s_iter);
 546       free_s_path = TRUE;
 547     }
 548
 549   if (!s_iter)
 550     gtk_tree_model_get_iter (s_model, &real_s_iter, s_path);
 551   else
 552     real_s_iter = *s_iter;
 553
 554   if (!tree_model_sort->root)
 555     {
 556       gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
 557
 558       /* the build level already put the inserted iter in the level,
 559          so no need to handle this signal anymore */
 560
 561       goto done_and_submit;
 562     }
 563
 564   /* find the parent level */
 565   while (i < gtk_tree_path_get_depth (s_path) - 1)
 566     {
 567       gint j;
 568
 569       if (!level)
 570         {
 571           /* level not yet build, we won't cover this signal */
 572           goto done;
 573         }
 574
 575       if (level->array->len < gtk_tree_path_get_indices (s_path)[i])
 576         {
 577           g_warning ("A node was inserted with a parent that's not in the tree.\n"
 578                      "This possibly means that a GtkTreeModel inserted a child node\n"
 579                      "before the parent was inserted.");
 580           goto done;
 581         }
 582
 583       elt = NULL;
 584       for (j = 0; j < level->array->len; j++)
 585         if (g_array_index (level->array, SortElt, j).offset == gtk_tree_path_get_indices (s_path)[i])
 586           {
 587             elt = &g_array_index (level->array, SortElt, j);
 588             break;
 589           }
 590
 591       g_return_if_fail (elt != NULL);
 592
 593       if (!elt->children)
 594         {
 595           GtkTreePath *tmppath;
 596           GtkTreeIter  tmpiter;
 597
 598           tmppath = gtk_tree_model_sort_elt_get_path (level, elt);
 599           if (tmppath)
 600             {
 601               gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &tmpiter,
 602                                        tmppath);
 603               gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data),
 604                                                     tmppath,
 605                                                     &tmpiter);
 606               gtk_tree_path_free (tmppath);
 607             }
 608
 609           /* not covering this signal */
 610           goto done;
 611         }
 612
 613       level = elt->children;
 614       parent_level = level;
 615       i++;
 616     }
 617
 618   if (!parent_level)
 619     goto done;
 620
 621   if (!gtk_tree_model_sort_insert_value (tree_model_sort,
 622                                          parent_level,
 623                                          s_path,
 624                                          &real_s_iter))
 625     goto done;
 626
 627  done_and_submit:
 628   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort,
 629                                                               s_path,
 630                                                               FALSE);
 631
 632   if (!path)
 633     return;
 634
 635   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 636
 637   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 638   gtk_tree_model_row_inserted (GTK_TREE_MODEL (data), path, &iter);
 639   gtk_tree_path_free (path);
 640
 641  done:
 642   if (free_s_path)
 643     gtk_tree_path_free (s_path);
 644
 645   return;
 646 }
 647
 648 static void
 649 gtk_tree_model_sort_row_has_child_toggled (GtkTreeModel *s_model,
 650                                            GtkTreePath  *s_path,
 651                                            GtkTreeIter  *s_iter,
 652                                            gpointer      data)
 653 {
 654   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 655   GtkTreePath *path;
 656   GtkTreeIter iter;
 657
 658   g_return_if_fail (s_path != NULL && s_iter != NULL);
 659
 660   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 661   if (path == NULL)
 662     return;
 663
 664   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 665   gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (data), path, &iter);
 666
 667   gtk_tree_path_free (path);
 668 }
 669
 670 /* FIXME: I still have doubts if this works */
 671 static void
 672 gtk_tree_model_sort_row_deleted (GtkTreeModel *s_model,
 673                                  GtkTreePath  *s_path,
 674                                  gpointer      data)
 675 {
 676   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 677   GtkTreePath *path = NULL;
 678   SortElt *elt;
 679   SortLevel *level;
 680   GtkTreeIter iter;
 681   gint offset;
 682   gint i;
 683
 684   g_return_if_fail (s_path != NULL);
 685
 686   path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 687   if (path == NULL)
 688     return;
 689
 690   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 691
 692   level = SORT_LEVEL (iter.user_data);
 693   elt = SORT_ELT (iter.user_data2);
 694   offset = elt->offset;
 695
 696   /* we _need_ to emit ::row_deleted before we start unreffing the node
 697    * itself. This is because of the row refs, which start unreffing nodes
 698    * when we emit ::row_deleted
 699    */
 700   gtk_tree_model_row_deleted (GTK_TREE_MODEL (data), path);
 701
 702   gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 703
 704   while (elt->ref_count > 0)
 705     gtk_tree_model_sort_real_unref_node (GTK_TREE_MODEL (data), &iter, FALSE);
 706
 707   if (level->ref_count == 0 && level != tree_model_sort->root)
 708     {
 709       /* This will prune the level, so I can just emit the signal and not worry
 710        * about cleaning this level up. */
 711       gtk_tree_model_sort_increment_stamp (tree_model_sort);
 712       gtk_tree_path_free (path);
 713       return;
 714     }
 715
 716   gtk_tree_model_sort_increment_stamp (tree_model_sort);
 717
 718   /* Remove the row */
 719   for (i = 0; i < level->array->len; i++)
 720     if (elt->offset == g_array_index (level->array, SortElt, i).offset)
 721       break;
 722
 723   g_array_remove_index (level->array, i);
 724
 725   /* update all offsets */
 726   for (i = 0; i < level->array->len; i++)
 727     {
 728       elt = & (g_array_index (level->array, SortElt, i));
 729       if (elt->offset > offset)
 730         elt->offset--;
 731       if (elt->children)
 732         elt->children->parent_elt = elt;
 733     }
 734
 735   gtk_tree_path_free (path);
 736 }
 737
 738 static void
 739 gtk_tree_model_sort_rows_reordered (GtkTreeModel *s_model,
 740                                     GtkTreePath  *s_path,
 741                                     GtkTreeIter  *s_iter,
 742                                     gint         *new_order,
 743                                     gpointer      data)
 744 {
 745   SortElt *elt;
 746   SortLevel *level;
 747   GtkTreeIter iter;
 748   gint *tmp_array;
 749   int i, j;
 750   GtkTreePath *path;
 751   GtkTreeModelSort *tree_model_sort = GTK_TREE_MODEL_SORT (data);
 752
 753   g_return_if_fail (new_order != NULL);
 754
 755   if (s_path == NULL || gtk_tree_path_get_indices (s_path) == NULL)
 756     {
 757       if (tree_model_sort->root == NULL)
 758         return;
 759       path = gtk_tree_path_new ();
 760       level = SORT_LEVEL (tree_model_sort->root);
 761     }
 762   else
 763     {
 764       path = gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, s_path, FALSE);
 765       if (path == NULL)
 766         return;
 767       gtk_tree_model_get_iter (GTK_TREE_MODEL (data), &iter, path);
 768
 769       level = SORT_LEVEL (iter.user_data);
 770       elt = SORT_ELT (iter.user_data2);
 771
 772       if (!elt->children)
 773         {
 774           gtk_tree_path_free (path);
 775           return;
 776         }
 777
 778       level = elt->children;
 779     }
 780
 781   if (level->array->len < 2)
 782     {
 783       gtk_tree_path_free (path);
 784       return;
 785     }
 786
 787   tmp_array = g_new (int, level->array->len);
 788   for (i = 0; i < level->array->len; i++)
 789     {
 790       for (j = 0; j < level->array->len; j++)
 791         {
 792           if (g_array_index (level->array, SortElt, i).offset == new_order[j])
 793             tmp_array[i] = j;
 794         }
 795     }
 796
 797   for (i = 0; i < level->array->len; i++)
 798     g_array_index (level->array, SortElt, i).offset = tmp_array[i];
 799   g_free (tmp_array);
 800
 801   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
 802       tree_model_sort->default_sort_func == NO_SORT_FUNC)
 803     {
 804
 805       gtk_tree_model_sort_sort_level (tree_model_sort, level,
 806                                       FALSE, FALSE);
 807       gtk_tree_model_sort_increment_stamp (tree_model_sort);
 808
 809       if (gtk_tree_path_get_depth (path))
 810         {
 811           gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort),
 812                                    &iter,
 813                                    path);
 814           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
 815                                          path, &iter, new_order);
 816         }
 817       else
 818         {
 819           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort),
 820                                          path, NULL, new_order);
 821         }
 822     }
 823
 824   gtk_tree_path_free (path);
 825 }
 826
 827 /* Fulfill our model requirements */
 828 static guint
 829 gtk_tree_model_sort_get_flags (GtkTreeModel *tree_model)
 830 {
 831   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
 832
 833   return 0;
 834 }
 835
 836 static gint
 837 gtk_tree_model_sort_get_n_columns (GtkTreeModel *tree_model)
 838 {
 839   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
 840
 841   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
 842
 843   if (tree_model_sort->child_model == 0)
 844     return 0;
 845
 846   return gtk_tree_model_get_n_columns (tree_model_sort->child_model);
 847 }
 848
 849 static GType
 850 gtk_tree_model_sort_get_column_type (GtkTreeModel *tree_model,
 851                                      gint          index)
 852 {
 853   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), G_TYPE_INVALID);
 854   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, G_TYPE_INVALID);
 855
 856   return gtk_tree_model_get_column_type (GTK_TREE_MODEL_SORT (tree_model)->child_model, index);
 857 }
 858
 859 static gboolean
 860 gtk_tree_model_sort_get_iter (GtkTreeModel *tree_model,
 861                               GtkTreeIter  *iter,
 862                               GtkTreePath  *path)
 863 {
 864   GtkTreeModelSort *tree_model_sort;
 865   gint *indices;
 866   SortLevel *level;
 867   gint depth, i;
 868
 869   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
 870   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
 871
 872   tree_model_sort = (GtkTreeModelSort *) tree_model;
 873   indices = gtk_tree_path_get_indices (path);
 874
 875   if (tree_model_sort->root == NULL)
 876     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
 877   level = SORT_LEVEL (tree_model_sort->root);
 878
 879   depth = gtk_tree_path_get_depth (path);
 880   if (depth == 0)
 881     return FALSE;
 882
 883   for (i = 0; i < depth - 1; i++)
 884     {
 885       if ((level == NULL) ||
 886           (indices[i] >= level->array->len))
 887         return FALSE;
 888
 889       if (g_array_index (level->array, SortElt, indices[i]).children == NULL)
 890         gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, indices[i]));
 891       level = g_array_index (level->array, SortElt, indices[i]).children;
 892     }
 893
 894   if (level == NULL)
 895     return FALSE;
 896   iter->stamp = tree_model_sort->stamp;
 897   iter->user_data = level;
 898   iter->user_data2 = &g_array_index (level->array, SortElt, indices[depth - 1]);
 899
 900   return TRUE;
 901 }
 902
 903 static GtkTreePath *
 904 gtk_tree_model_sort_get_path (GtkTreeModel *tree_model,
 905                               GtkTreeIter  *iter)
 906 {
 907   GtkTreePath *retval;
 908   SortLevel *level;
 909   SortElt *elt;
 910
 911   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
 912   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, NULL);
 913   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, NULL);
 914
 915   retval = gtk_tree_path_new ();
 916   level = iter->user_data;
 917   elt = iter->user_data2;
 918   while (level != NULL)
 919     {
 920       gtk_tree_path_prepend_index (retval, elt - (SortElt *)level->array->data);
 921
 922       elt = level->parent_elt;
 923       level = level->parent_level;
 924     }
 925
 926   return retval;
 927 }
 928
 929 static void
 930 gtk_tree_model_sort_get_value (GtkTreeModel *tree_model,
 931                                GtkTreeIter  *iter,
 932                                gint          column,
 933                                GValue       *value)
 934 {
 935   GtkTreeIter child_iter;
 936
 937   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
 938   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
 939   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
 940
 941   GET_CHILD_ITER (tree_model, &child_iter, iter);
 942   gtk_tree_model_get_value (GTK_TREE_MODEL_SORT (tree_model)->child_model,
 943                             &child_iter, column, value);
 944 }
 945
 946 static gboolean
 947 gtk_tree_model_sort_iter_next (GtkTreeModel *tree_model,
 948                                GtkTreeIter  *iter)
 949 {
 950   SortLevel *level;
 951   SortElt *elt;
 952
 953   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
 954   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
 955   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
 956
 957   level = iter->user_data;
 958   elt = iter->user_data2;
 959
 960   if (elt - (SortElt *)level->array->data >= level->array->len - 1)
 961     {
 962       iter->stamp = 0;
 963       return FALSE;
 964     }
 965   iter->user_data2 = elt + 1;
 966
 967   return TRUE;
 968 }
 969
 970 static gboolean
 971 gtk_tree_model_sort_iter_children (GtkTreeModel *tree_model,
 972                                    GtkTreeIter  *iter,
 973                                    GtkTreeIter  *parent)
 974 {
 975   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
 976   SortLevel *level;
 977
 978   iter->stamp = 0;
 979   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
 980   g_return_val_if_fail (tree_model_sort->child_model != NULL, FALSE);
 981   if (parent) g_return_val_if_fail (tree_model_sort->stamp == parent->stamp, FALSE);
 982
 983   if (parent == NULL)
 984     {
 985       if (tree_model_sort->root == NULL)
 986         gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
 987       if (tree_model_sort->root == NULL)
 988         return FALSE;
 989
 990       level = tree_model_sort->root;
 991       iter->stamp = tree_model_sort->stamp;
 992       iter->user_data = level;
 993       iter->user_data2 = level->array->data;
 994     }
 995   else
 996     {
 997       if (((SortElt *)parent->user_data2)->children == NULL)
 998         gtk_tree_model_sort_build_level (tree_model_sort,
 999                                          (SortLevel *)parent->user_data,
1000                                          (SortElt *)parent->user_data2);
1001       if (((SortElt *)parent->user_data2)->children == NULL)
1002         return FALSE;
1003       iter->stamp = tree_model_sort->stamp;
1004       iter->user_data = ((SortElt *)parent->user_data2)->children;
1005       iter->user_data2 = ((SortLevel *)iter->user_data)->array->data;
1006     }
1007
1008   return TRUE;
1009 }
1010
1011 static gboolean
1012 gtk_tree_model_sort_iter_has_child (GtkTreeModel *tree_model,
1013                                     GtkTreeIter  *iter)
1014 {
1015   GtkTreeIter child_iter;
1016
1017   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1018   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1019   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, FALSE);
1020
1021   GET_CHILD_ITER (tree_model, &child_iter, iter);
1022
1023   return gtk_tree_model_iter_has_child (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1024 }
1025
1026 static gint
1027 gtk_tree_model_sort_iter_n_children (GtkTreeModel *tree_model,
1028                                      GtkTreeIter  *iter)
1029 {
1030   GtkTreeIter child_iter;
1031
1032   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), 0);
1033   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, 0);
1034   if (iter) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp, 0);
1035
1036   if (iter == NULL)
1037     return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, NULL);
1038
1039   GET_CHILD_ITER (tree_model, &child_iter, iter);
1040
1041   return gtk_tree_model_iter_n_children (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1042 }
1043
1044 static gboolean
1045 gtk_tree_model_sort_iter_nth_child (GtkTreeModel *tree_model,
1046                                     GtkTreeIter  *iter,
1047                                     GtkTreeIter  *parent,
1048                                     gint          n)
1049 {
1050   SortLevel *level;
1051   /* We have this for the iter == parent case */
1052   GtkTreeIter children;
1053
1054   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1055   if (parent) g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == parent->stamp, FALSE);
1056
1057   /* Use this instead of has_child to force us to build the level, if needed */
1058   if (gtk_tree_model_sort_iter_children (tree_model, &children, parent) == FALSE)
1059     {
1060       iter->stamp = 0;
1061       return FALSE;
1062     }
1063
1064   level = children.user_data;
1065   if (n >= level->array->len)
1066     {
1067       iter->stamp = 0;
1068       return FALSE;
1069     }
1070
1071   iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1072   iter->user_data = level;
1073   iter->user_data2 = &g_array_index (level->array, SortElt, n);
1074
1075   return TRUE;
1076 }
1077
1078 static gboolean
1079 gtk_tree_model_sort_iter_parent (GtkTreeModel *tree_model,
1080                                  GtkTreeIter  *iter,
1081                                  GtkTreeIter  *child)
1082 {
1083   SortLevel *level;
1084
1085   iter->stamp = 0;
1086   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), FALSE);
1087   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL, FALSE);
1088   g_return_val_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == child->stamp, FALSE);
1089
1090   level = child->user_data;
1091
1092   if (level->parent_level)
1093     {
1094       iter->stamp = GTK_TREE_MODEL_SORT (tree_model)->stamp;
1095       iter->user_data = level->parent_level;
1096       iter->user_data2 = level->parent_elt;
1097
1098       return TRUE;
1099     }
1100   return FALSE;
1101 }
1102
1103 static void
1104 gtk_tree_model_sort_ref_node (GtkTreeModel *tree_model,
1105                               GtkTreeIter  *iter)
1106 {
1107   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1108   GtkTreeIter child_iter;
1109   SortLevel *level;
1110   SortElt *elt;
1111
1112   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1113   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1114   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1115
1116   GET_CHILD_ITER (tree_model, &child_iter, iter);
1117
1118   gtk_tree_model_ref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1119
1120   level = iter->user_data;
1121   elt = iter->user_data2;
1122
1123   elt->ref_count++;
1124   level->ref_count++;
1125   if (level->ref_count == 1)
1126     {
1127       SortLevel *parent_level = level->parent_level;
1128       SortElt *parent_elt = level->parent_elt;
1129       /* We were at zero -- time to decrement the zero_ref_count val */
1130       do
1131         {
1132           if (parent_elt)
1133             parent_elt->zero_ref_count--;
1134           else
1135             tree_model_sort->zero_ref_count--;
1136
1137           if (parent_level)
1138             {
1139               parent_elt = parent_level->parent_elt;
1140               parent_level = parent_level->parent_level;
1141             }
1142         }
1143       while (parent_level);
1144     }
1145 }
1146
1147 static void
1148 gtk_tree_model_sort_real_unref_node (GtkTreeModel *tree_model,
1149                                      GtkTreeIter  *iter,
1150                                      gboolean      propagate_unref)
1151 {
1152   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) tree_model;
1153   GtkTreeIter child_iter;
1154   SortLevel *level;
1155   SortElt *elt;
1156
1157   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model));
1158   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->child_model != NULL);
1159   g_return_if_fail (GTK_TREE_MODEL_SORT (tree_model)->stamp == iter->stamp);
1160
1161   GET_CHILD_ITER (tree_model, &child_iter, iter);
1162
1163   if (propagate_unref)
1164     gtk_tree_model_unref_node (GTK_TREE_MODEL_SORT (tree_model)->child_model, &child_iter);
1165
1166   level = iter->user_data;
1167   elt = iter->user_data2;
1168
1169   g_return_if_fail (elt->ref_count > 0);
1170
1171   elt->ref_count--;
1172   level->ref_count--;
1173   if (level->ref_count == 0)
1174     {
1175       SortLevel *parent_level = level->parent_level;
1176       SortElt *parent_elt = level->parent_elt;
1177
1178       /* We are at zero -- time to increment the zero_ref_count val */
1179       while (parent_level)
1180         {
1181           parent_elt->zero_ref_count++;
1182
1183           parent_elt = parent_level->parent_elt;
1184           parent_level = parent_level->parent_level;
1185         }
1186       tree_model_sort->zero_ref_count++;
1187     }
1188 }
1189
1190 static void
1191 gtk_tree_model_sort_unref_node (GtkTreeModel *tree_model,
1192                                 GtkTreeIter  *iter)
1193 {
1194   gtk_tree_model_sort_real_unref_node (tree_model, iter, TRUE);
1195 }
1196
1197 /* Sortable interface */
1198 static gboolean
1199 gtk_tree_model_sort_get_sort_column_id (GtkTreeSortable *sortable,
1200                                         gint            *sort_column_id,
1201                                         GtkSortType     *order)
1202 {
1203   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1204
1205   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1206
1207   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1208     return FALSE;
1209
1210   if (sort_column_id)
1211     *sort_column_id = tree_model_sort->sort_column_id;
1212   if (order)
1213     *order = tree_model_sort->order;
1214
1215   return TRUE;
1216 }
1217
1218 static void
1219 gtk_tree_model_sort_set_sort_column_id (GtkTreeSortable *sortable,
1220                                         gint             sort_column_id,
1221                                         GtkSortType      order)
1222 {
1223   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1224
1225   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1226
1227   if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1228     {
1229       GtkTreeDataSortHeader *header = NULL;
1230
1231       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1232                                                sort_column_id);
1233
1234       /* we want to make sure that we have a function */
1235       g_return_if_fail (header != NULL);
1236       g_return_if_fail (header->func != NULL);
1237     }
1238   else
1239     g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1240
1241   if (tree_model_sort->sort_column_id == sort_column_id)
1242     {
1243       if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1244         {
1245           if (tree_model_sort->order == order)
1246             return;
1247         }
1248       else
1249         return;
1250     }
1251
1252   tree_model_sort->sort_column_id = sort_column_id;
1253   tree_model_sort->order = order;
1254
1255   gtk_tree_model_sort_sort (tree_model_sort);
1256   gtk_tree_sortable_sort_column_changed (sortable);
1257 }
1258
1259 static void
1260 gtk_tree_model_sort_set_sort_func (GtkTreeSortable        *sortable,
1261                                    gint                    sort_column_id,
1262                                    GtkTreeIterCompareFunc  func,
1263                                    gpointer                data,
1264                                    GtkDestroyNotify        destroy)
1265 {
1266   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *) sortable;
1267   GtkTreeDataSortHeader *header = NULL;
1268   GList *list;
1269
1270   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1271   g_return_if_fail (func != NULL);
1272
1273   for (list = tree_model_sort->sort_list; list; list = list->next)
1274     {
1275       GtkTreeDataSortHeader *list_header;
1276
1277       list_header = (GtkTreeDataSortHeader*) list->data;
1278       if (list_header->sort_column_id == sort_column_id)
1279         {
1280           header = list_header;
1281           break;
1282         }
1283     }
1284
1285   if (header == NULL)
1286     {
1287       header = g_new0 (GtkTreeDataSortHeader, 1);
1288       header->sort_column_id = sort_column_id;
1289       tree_model_sort->sort_list = g_list_append (tree_model_sort->sort_list,
1290                                                   header);
1291     }
1292
1293   if (header->destroy)
1294     {
1295       GtkDestroyNotify d = header->destroy;
1296
1297       header->destroy = NULL;
1298       d (header->data);
1299     }
1300
1301   header->func = func;
1302   header->data = data;
1303   header->destroy = destroy;
1304 }
1305
1306 static void
1307 gtk_tree_model_sort_set_default_sort_func (GtkTreeSortable        *sortable,
1308                                            GtkTreeIterCompareFunc  func,
1309                                            gpointer                data,
1310                                            GtkDestroyNotify        destroy)
1311 {
1312   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1313
1314   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (sortable));
1315
1316   if (tree_model_sort->default_sort_destroy)
1317     {
1318       GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
1319
1320       tree_model_sort->default_sort_destroy = NULL;
1321       d (tree_model_sort->default_sort_data);
1322     }
1323
1324   tree_model_sort->default_sort_func = func;
1325   tree_model_sort->default_sort_data = data;
1326   tree_model_sort->default_sort_destroy = destroy;
1327 }
1328
1329 static gboolean
1330 gtk_tree_model_sort_has_default_sort_func (GtkTreeSortable *sortable)
1331 {
1332   GtkTreeModelSort *tree_model_sort = (GtkTreeModelSort *)sortable;
1333
1334   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (sortable), FALSE);
1335
1336   return (tree_model_sort->default_sort_func != NULL);
1337 }
1338
1339 /* sorting code - private */
1340 static gint
1341 gtk_tree_model_sort_compare_func (gconstpointer a,
1342                                   gconstpointer b,
1343                                   gpointer      user_data)
1344 {
1345   SortData *data = (SortData *)user_data;
1346   GtkTreeModelSort *tree_model_sort = data->tree_model_sort;
1347   SortTuple *sa = (SortTuple *)a;
1348   SortTuple *sb = (SortTuple *)b;
1349
1350   GtkTreeIter iter_a, iter_b;
1351   gint retval;
1352
1353   /* shortcut, if we've the same offsets here, they should be equal */
1354   if (sa->offset == sb->offset)
1355     return 0;
1356
1357   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1358     {
1359       iter_a = sa->elt->iter;
1360       iter_b = sb->elt->iter;
1361     }
1362   else
1363     {
1364       data->parent_path_indices [data->parent_path_depth-1] = sa->elt->offset;
1365       gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_a, data->parent_path);
1366       data->parent_path_indices [data->parent_path_depth-1] = sb->elt->offset;
1367       gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort->child_model), &iter_b, data->parent_path);
1368     }
1369
1370   retval = (* data->sort_func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1371                                 &iter_a, &iter_b,
1372                                 data->sort_data);
1373
1374   if (tree_model_sort->order == GTK_SORT_DESCENDING)
1375     {
1376       if (retval > 0)
1377         retval = -1;
1378       else if (retval < 0)
1379         retval = 1;
1380     }
1381
1382   return retval;
1383 }
1384
1385 static gint
1386 gtk_tree_model_sort_offset_compare_func (gconstpointer a,
1387                                          gconstpointer b,
1388                                          gpointer      user_data)
1389 {
1390   gint retval;
1391
1392   SortTuple *sa = (SortTuple *)a;
1393   SortTuple *sb = (SortTuple *)b;
1394
1395   SortData *data = (SortData *)user_data;
1396
1397   if (sa->elt->offset < sb->elt->offset)
1398     retval = -1;
1399   else if (sa->elt->offset > sb->elt->offset)
1400     retval = 1;
1401   else
1402     retval = 0;
1403
1404   if (data->tree_model_sort->order == GTK_SORT_DESCENDING)
1405     {
1406       if (retval > 0)
1407         retval = -1;
1408       else if (retval < 0)
1409         retval = 1;
1410     }
1411
1412   return retval;
1413 }
1414
1415 static void
1416 gtk_tree_model_sort_sort_level (GtkTreeModelSort *tree_model_sort,
1417                                 SortLevel        *level,
1418                                 gboolean          recurse,
1419                                 gboolean          emit_reordered)
1420 {
1421   gint i;
1422   GArray *sort_array;
1423   GArray *new_array;
1424   gint *new_order;
1425
1426   GtkTreeIter iter;
1427   GtkTreePath *path;
1428
1429   SortData data;
1430
1431   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1432   g_return_if_fail (level != NULL);
1433
1434   if (level->array->len < 1 && !((SortElt *)level->array->data)->children)
1435     return;
1436
1437   /* Set up data */
1438   data.tree_model_sort = tree_model_sort;
1439   if (level->parent_elt)
1440     {
1441       data.parent_path = gtk_tree_model_sort_elt_get_path (level->parent_level,
1442                                                            level->parent_elt);
1443       gtk_tree_path_append_index (data.parent_path, 0);
1444     }
1445   else
1446     {
1447       data.parent_path = gtk_tree_path_new_first ();
1448     }
1449   data.parent_path_depth = gtk_tree_path_get_depth (data.parent_path);
1450   data.parent_path_indices = gtk_tree_path_get_indices (data.parent_path);
1451
1452   /* make the array to be sorted */
1453   sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), level->array->len);
1454   for (i = 0; i < level->array->len; i++)
1455     {
1456       SortTuple tuple;
1457
1458       tuple.elt = &g_array_index (level->array, SortElt, i);
1459       tuple.offset = i;
1460
1461       g_array_append_val (sort_array, tuple);
1462     }
1463
1464     if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1465       {
1466         GtkTreeDataSortHeader *header = NULL;
1467
1468         header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1469                                                  tree_model_sort->sort_column_id);
1470
1471         g_return_if_fail (header != NULL);
1472         g_return_if_fail (header->func != NULL);
1473
1474         data.sort_func = header->func;
1475         data.sort_data = header->data;
1476       }
1477     else
1478       {
1479         /* absolutely SHOULD NOT happen: */
1480         g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1481
1482         data.sort_func = tree_model_sort->default_sort_func;
1483         data.sort_data = tree_model_sort->default_sort_data;
1484       }
1485
1486   if (data.sort_func == NO_SORT_FUNC)
1487     g_array_sort_with_data (sort_array,
1488                             gtk_tree_model_sort_offset_compare_func,
1489                             &data);
1490   else
1491     g_array_sort_with_data (sort_array,
1492                             gtk_tree_model_sort_compare_func,
1493                             &data);
1494
1495   gtk_tree_path_free (data.parent_path);
1496
1497   new_array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), level->array->len);
1498   new_order = g_new (gint, level->array->len);
1499
1500   for (i = 0; i < level->array->len; i++)
1501     {
1502       SortElt *elt;
1503
1504       elt = g_array_index (sort_array, SortTuple, i).elt;
1505       new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
1506
1507       g_array_append_val (new_array, *elt);
1508       elt = &g_array_index (new_array, SortElt, i);
1509       if (elt->children)
1510         elt->children->parent_elt = elt;
1511     }
1512
1513   g_array_free (level->array, TRUE);
1514   level->array = new_array;
1515   g_array_free (sort_array, TRUE);
1516
1517   if (emit_reordered)
1518     {
1519       gtk_tree_model_sort_increment_stamp (tree_model_sort);
1520       if (level->parent_elt)
1521         {
1522           iter.stamp = tree_model_sort->stamp;
1523           iter.user_data = level->parent_level;
1524           iter.user_data2 = level->parent_elt;
1525
1526           path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_model_sort),
1527                                           &iter);
1528
1529           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1530                                          &iter, new_order);
1531         }
1532       else
1533         {
1534           /* toplevel list */
1535           path = gtk_tree_path_new ();
1536           gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_model_sort), path,
1537                                          NULL, new_order);
1538         }
1539
1540       gtk_tree_path_free (path);
1541     }
1542
1543   /* recurse, if possible */
1544   if (recurse)
1545     {
1546       for (i = 0; i < level->array->len; i++)
1547         {
1548           SortElt *elt = &g_array_index (level->array, SortElt, i);
1549
1550           if (elt->children)
1551             gtk_tree_model_sort_sort_level (tree_model_sort,
1552                                             elt->children,
1553                                             TRUE, emit_reordered);
1554         }
1555     }
1556
1557   g_free (new_order);
1558 }
1559
1560 static void
1561 gtk_tree_model_sort_sort (GtkTreeModelSort *tree_model_sort)
1562 {
1563   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1564
1565   if (!tree_model_sort->root)
1566     return;
1567
1568   if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1569     {
1570       GtkTreeDataSortHeader *header = NULL;
1571
1572       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1573                                                tree_model_sort->sort_column_id);
1574
1575       /* we want to make sure that we have a function */
1576       g_return_if_fail (header != NULL);
1577       g_return_if_fail (header->func != NULL);
1578     }
1579   else
1580     g_return_if_fail (tree_model_sort->default_sort_func != NULL);
1581
1582   gtk_tree_model_sort_sort_level (tree_model_sort, tree_model_sort->root,
1583                                   TRUE, TRUE);
1584 }
1585
1586 /* signal helpers */
1587 static gint
1588 gtk_tree_model_sort_level_find_insert (GtkTreeModelSort *tree_model_sort,
1589                                        SortLevel        *level,
1590                                        GtkTreeIter      *iter,
1591                                        gboolean          skip_sort_elt)
1592 {
1593   gint middle;
1594   gint cmp;
1595   SortElt *tmp_elt;
1596   GtkTreeIter tmp_iter;
1597
1598   GtkTreeIterCompareFunc func;
1599   gpointer data;
1600
1601   GtkTreePath *path;
1602
1603   if (tree_model_sort->sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
1604     {
1605       GtkTreeDataSortHeader *header;
1606
1607       header = _gtk_tree_data_list_get_header (tree_model_sort->sort_list,
1608                                                tree_model_sort->sort_column_id);
1609
1610       g_return_val_if_fail (header != NULL, 0);
1611
1612       func = header->func;
1613       data = header->data;
1614     }
1615   else
1616     {
1617       func = tree_model_sort->default_sort_func;
1618       data = tree_model_sort->default_sort_data;
1619
1620       g_return_val_if_fail (func != NO_SORT_FUNC, 0);
1621     }
1622
1623   g_return_val_if_fail (func != NULL, 0);
1624
1625   for (middle = 0; middle < level->array->len; middle++)
1626     {
1627       tmp_elt = &(g_array_index (level->array, SortElt, middle));
1628
1629       if (!skip_sort_elt && SORT_ELT (iter->user_data2) == tmp_elt)
1630         continue;
1631
1632       path = gtk_tree_model_sort_elt_get_path (level, tmp_elt);
1633       gtk_tree_model_get_iter (tree_model_sort->child_model,
1634                                &tmp_iter, path);
1635       gtk_tree_path_free (path);
1636
1637       if (tree_model_sort->order == GTK_SORT_ASCENDING)
1638         cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1639                         &tmp_iter, iter, data);
1640       else
1641         cmp = (* func) (GTK_TREE_MODEL (tree_model_sort->child_model),
1642                         iter, &tmp_iter, data);
1643
1644       if (cmp > 0)
1645         break;
1646     }
1647
1648   return middle;
1649 }
1650
1651 static gboolean
1652 gtk_tree_model_sort_insert_value (GtkTreeModelSort *tree_model_sort,
1653                                   SortLevel        *level,
1654                                   GtkTreePath      *s_path,
1655                                   GtkTreeIter      *s_iter)
1656 {
1657   gint offset, index, i;
1658
1659   SortElt elt;
1660   SortElt *tmp_elt;
1661
1662   offset = gtk_tree_path_get_indices (s_path)[gtk_tree_path_get_depth (s_path) - 1];
1663
1664   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
1665     elt.iter = *s_iter;
1666   elt.offset = offset;
1667   elt.zero_ref_count = 0;
1668   elt.ref_count = 0;
1669   elt.children = NULL;
1670
1671   /* update all larger offsets */
1672   tmp_elt = SORT_ELT (level->array->data);
1673   for (i = 0; i < level->array->len; i++, tmp_elt++)
1674     if (tmp_elt->offset >= offset)
1675       tmp_elt->offset++;
1676
1677   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID &&
1678       tree_model_sort->default_sort_func == NO_SORT_FUNC)
1679     index = offset;
1680   else
1681     index = gtk_tree_model_sort_level_find_insert (tree_model_sort,
1682                                                    level, s_iter,
1683                                                    FALSE);
1684
1685   g_array_insert_vals (level->array, index, &elt, 1);
1686   tmp_elt = SORT_ELT (level->array->data);
1687   for (i = 0; i < level->array->len; i++, tmp_elt++)
1688     if (tmp_elt->children)
1689       tmp_elt->children->parent_elt = tmp_elt;
1690
1691   return TRUE;
1692 }
1693
1694 /* sort elt stuff */
1695 static GtkTreePath *
1696 gtk_tree_model_sort_elt_get_path (SortLevel *level,
1697                                   SortElt *elt)
1698 {
1699   SortLevel *walker = level;
1700   SortElt *walker2 = elt;
1701   GtkTreePath *path;
1702
1703   g_return_val_if_fail (level != NULL, NULL);
1704   g_return_val_if_fail (elt != NULL, NULL);
1705
1706   path = gtk_tree_path_new ();
1707
1708   while (walker)
1709     {
1710       gtk_tree_path_prepend_index (path, walker2->offset);
1711
1712       walker2 = walker->parent_elt;
1713       walker = walker->parent_level;
1714     }
1715
1716   return path;
1717 }
1718
1719 /**
1720  * gtk_tree_model_sort_set_model:
1721  * @tree_model_sort: The #GtkTreeModelSort.
1722  * @child_model: A #GtkTreeModel, or NULL.
1723  *
1724  * Sets the model of @tree_model_sort to be @model.  If @model is NULL, then the
1725  * old model is unset.  The sort function is unset as a result of this call.
1726  * The model will be in an unsorted state until a sort function is set.
1727  **/
1728 static void
1729 gtk_tree_model_sort_set_model (GtkTreeModelSort *tree_model_sort,
1730                                GtkTreeModel     *child_model)
1731 {
1732   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1733
1734   if (child_model)
1735     g_object_ref (G_OBJECT (child_model));
1736
1737   if (tree_model_sort->child_model)
1738     {
1739       g_signal_handler_disconnect (G_OBJECT (tree_model_sort->child_model),
1740                                    tree_model_sort->changed_id);
1741       g_signal_handler_disconnect (G_OBJECT (tree_model_sort->child_model),
1742                                    tree_model_sort->inserted_id);
1743       g_signal_handler_disconnect (G_OBJECT (tree_model_sort->child_model),
1744                                    tree_model_sort->has_child_toggled_id);
1745       g_signal_handler_disconnect (G_OBJECT (tree_model_sort->child_model),
1746                                    tree_model_sort->deleted_id);
1747       g_signal_handler_disconnect (G_OBJECT (tree_model_sort->child_model),
1748                                    tree_model_sort->reordered_id);
1749
1750       /* reset our state */
1751       if (tree_model_sort->root)
1752         gtk_tree_model_sort_free_level (tree_model_sort, tree_model_sort->root);
1753       tree_model_sort->root = NULL;
1754       _gtk_tree_data_list_header_free (tree_model_sort->sort_list);
1755       tree_model_sort->sort_list = NULL;
1756       g_object_unref (G_OBJECT (tree_model_sort->child_model));
1757     }
1758
1759   tree_model_sort->child_model = child_model;
1760
1761   if (child_model)
1762     {
1763       GType *types;
1764       gint i, n_columns;
1765
1766       g_object_ref (tree_model_sort->child_model);
1767       tree_model_sort->changed_id =
1768         g_signal_connect (child_model, "row_changed",
1769                           G_CALLBACK (gtk_tree_model_sort_row_changed),
1770                           tree_model_sort);
1771       tree_model_sort->inserted_id =
1772         g_signal_connect (child_model, "row_inserted",
1773                           G_CALLBACK (gtk_tree_model_sort_row_inserted),
1774                           tree_model_sort);
1775       tree_model_sort->has_child_toggled_id =
1776         g_signal_connect (child_model, "row_has_child_toggled",
1777                           G_CALLBACK (gtk_tree_model_sort_row_has_child_toggled),
1778                           tree_model_sort);
1779       tree_model_sort->deleted_id =
1780         g_signal_connect (child_model, "row_deleted",
1781                           G_CALLBACK (gtk_tree_model_sort_row_deleted),
1782                           tree_model_sort);
1783       tree_model_sort->reordered_id =
1784         g_signal_connect (child_model, "rows_reordered",
1785                           G_CALLBACK (gtk_tree_model_sort_rows_reordered),
1786                           tree_model_sort);
1787
1788       tree_model_sort->child_flags = gtk_tree_model_get_flags (child_model);
1789       n_columns = gtk_tree_model_get_n_columns (child_model);
1790
1791       types = g_new (GType, n_columns);
1792       for (i = 0; i < n_columns; i++)
1793         types[i] = gtk_tree_model_get_column_type (child_model, i);
1794
1795       tree_model_sort->sort_list = _gtk_tree_data_list_header_new (n_columns, types);
1796       g_free (types);
1797
1798       tree_model_sort->default_sort_func = NO_SORT_FUNC;
1799       tree_model_sort->stamp = g_random_int ();
1800     }
1801 }
1802
1803 /**
1804  * gtk_tree_model_sort_get_model:
1805  * @tree_model: a #GtkTreeModelSort
1806  *
1807  * Returns the model the #GtkTreeModelSort is sorting.
1808  *
1809  * Return value: the "child model" being sorted
1810  **/
1811 GtkTreeModel *
1812 gtk_tree_model_sort_get_model (GtkTreeModelSort  *tree_model)
1813 {
1814   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model), NULL);
1815
1816   return tree_model->child_model;
1817 }
1818
1819
1820 static GtkTreePath *
1821 gtk_real_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
1822                                                      GtkTreePath      *child_path,
1823                                                      gboolean          build_levels)
1824 {
1825   gint *child_indices;
1826   GtkTreePath *retval;
1827   SortLevel *level;
1828   gint i;
1829
1830   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
1831   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
1832   g_return_val_if_fail (child_path != NULL, NULL);
1833
1834   retval = gtk_tree_path_new ();
1835   child_indices = gtk_tree_path_get_indices (child_path);
1836
1837   if (tree_model_sort->root == NULL && build_levels)
1838     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1839   level = SORT_LEVEL (tree_model_sort->root);
1840
1841   for (i = 0; i < gtk_tree_path_get_depth (child_path); i++)
1842     {
1843       gint j;
1844       gboolean found_child = FALSE;
1845
1846       if (!level)
1847         {
1848           gtk_tree_path_free (retval);
1849           return NULL;
1850         }
1851
1852       if (child_indices[i] >= level->array->len)
1853         {
1854           gtk_tree_path_free (retval);
1855           return NULL;
1856         }
1857       for (j = 0; j < level->array->len; j++)
1858         {
1859           if ((g_array_index (level->array, SortElt, j)).offset == child_indices[i])
1860             {
1861               gtk_tree_path_append_index (retval, j);
1862               if (g_array_index (level->array, SortElt, j).children == NULL && build_levels)
1863                 {
1864                   gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, j));
1865                 }
1866               level = g_array_index (level->array, SortElt, j).children;
1867               found_child = TRUE;
1868               break;
1869             }
1870         }
1871       if (! found_child)
1872         {
1873           gtk_tree_path_free (retval);
1874           return NULL;
1875         }
1876     }
1877
1878   return retval;
1879 }
1880
1881
1882 /**
1883  * gtk_tree_model_sort_convert_child_path_to_path:
1884  * @tree_model_sort: A #GtkTreeModelSort
1885  * @child_path: A #GtkTreePath to convert
1886  *
1887  * Converts @child_path to a path relative to @tree_model_sort.  That is,
1888  * @child_path points to a path in the child model.  The returned path will
1889  * point to the same row in the sorted model.  If @child_path isn't a valid path
1890  * on the child model, then %NULL is returned.
1891  *
1892  * Return value: A newly allocated #GtkTreePath, or %NULL
1893  **/
1894 GtkTreePath *
1895 gtk_tree_model_sort_convert_child_path_to_path (GtkTreeModelSort *tree_model_sort,
1896                                                 GtkTreePath      *child_path)
1897 {
1898   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
1899   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
1900   g_return_val_if_fail (child_path != NULL, NULL);
1901
1902   return gtk_real_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path, TRUE);
1903 }
1904
1905 /**
1906  * gtk_tree_model_sort_convert_child_iter_to_iter:
1907  * @tree_model_sort: A #GtkTreeModelSort
1908  * @sort_iter: An uninitialized #GtkTreeIter.
1909  * @child_iter: A valid #GtkTreeIter pointing to a row on the child model
1910  *
1911  * Sets @sort_iter to point to the row in @tree_model_sort that corresponds to
1912  * the row pointed at by @child_iter.
1913  **/
1914 void
1915 gtk_tree_model_sort_convert_child_iter_to_iter (GtkTreeModelSort *tree_model_sort,
1916                                                 GtkTreeIter      *sort_iter,
1917                                                 GtkTreeIter      *child_iter)
1918 {
1919   GtkTreePath *child_path, *path;
1920
1921   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
1922   g_return_if_fail (tree_model_sort->child_model != NULL);
1923   g_return_if_fail (sort_iter != NULL);
1924   g_return_if_fail (child_iter != NULL);
1925
1926   sort_iter->stamp = 0;
1927
1928   child_path = gtk_tree_model_get_path (tree_model_sort->child_model, child_iter);
1929   g_return_if_fail (child_path != NULL);
1930
1931   path = gtk_tree_model_sort_convert_child_path_to_path (tree_model_sort, child_path);
1932   gtk_tree_path_free (child_path);
1933   g_return_if_fail (path != NULL);
1934
1935   gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model_sort), sort_iter, path);
1936   gtk_tree_path_free (path);
1937 }
1938
1939 /**
1940  * gtk_tree_model_sort_convert_path_to_child_path:
1941  * @tree_model_sort: A #GtkTreeModelSort
1942  * @sorted_path: A #GtkTreePath to convert
1943  *
1944  * Converts @sorted_path to a path on the child model of @tree_model_sort.  That
1945  * is, @sorted_path points to a location in @tree_model_sort.  The returned path
1946  * will point to the same location in the model not being sorted.  If @sorted_path
1947  * does not point to a location in the child model, %NULL is returned.
1948  *
1949  * Return value: A newly allocated #GtkTreePath, or %NULL
1950  **/
1951 GtkTreePath *
1952 gtk_tree_model_sort_convert_path_to_child_path (GtkTreeModelSort *tree_model_sort,
1953                                                 GtkTreePath      *sorted_path)
1954 {
1955   gint *sorted_indices;
1956   GtkTreePath *retval;
1957   SortLevel *level;
1958   gint i;
1959
1960   g_return_val_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort), NULL);
1961   g_return_val_if_fail (tree_model_sort->child_model != NULL, NULL);
1962   g_return_val_if_fail (sorted_path != NULL, NULL);
1963
1964   retval = gtk_tree_path_new ();
1965   sorted_indices = gtk_tree_path_get_indices (sorted_path);
1966   if (tree_model_sort->root == NULL)
1967     gtk_tree_model_sort_build_level (tree_model_sort, NULL, NULL);
1968   level = SORT_LEVEL (tree_model_sort->root);
1969
1970   for (i = 0; i < gtk_tree_path_get_depth (sorted_path); i++)
1971     {
1972       gint count = sorted_indices[i];
1973
1974       if ((level == NULL) ||
1975           (level->array->len <= count))
1976         {
1977           gtk_tree_path_free (retval);
1978           return NULL;
1979         }
1980
1981       if (g_array_index (level->array, SortElt, count).children == NULL)
1982         gtk_tree_model_sort_build_level (tree_model_sort, level, &g_array_index (level->array, SortElt, count));
1983
1984       if (level == NULL)
1985         {
1986           gtk_tree_path_free (retval);
1987           break;
1988         }
1989
1990       gtk_tree_path_append_index (retval, g_array_index (level->array, SortElt, count).offset);
1991       level = g_array_index (level->array, SortElt, count).children;
1992     }
1993
1994   return retval;
1995 }
1996
1997 /**
1998  * gtk_tree_model_sort_convert_iter_to_child_iter:
1999  * @tree_model_sort: A #GtkTreeModelSort
2000  * @child_iter: An uninitialized #GtkTreeIter
2001  * @sorted_iter: A valid #GtkTreeIter pointing to a row on @tree_model_sort.
2002  *
2003  * Sets @child_iter to point to the row pointed to by @sorted_iter.
2004  **/
2005 void
2006 gtk_tree_model_sort_convert_iter_to_child_iter (GtkTreeModelSort *tree_model_sort,
2007                                                 GtkTreeIter      *child_iter,
2008                                                 GtkTreeIter      *sorted_iter)
2009 {
2010   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2011   g_return_if_fail (tree_model_sort->child_model != NULL);
2012   g_return_if_fail (child_iter != NULL);
2013   g_return_if_fail (sorted_iter != NULL);
2014   g_return_if_fail (sorted_iter->stamp == tree_model_sort->stamp);
2015
2016   if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2017     {
2018       *child_iter = SORT_ELT (sorted_iter->user_data2)->iter;
2019     }
2020   else
2021     {
2022       GtkTreePath *path;
2023
2024       path = gtk_tree_model_sort_elt_get_path (sorted_iter->user_data,
2025                                                sorted_iter->user_data2);
2026       gtk_tree_model_get_iter (tree_model_sort->child_model, child_iter, path);
2027       gtk_tree_path_free (path);
2028     }
2029 }
2030
2031 static void
2032 gtk_tree_model_sort_build_level (GtkTreeModelSort *tree_model_sort,
2033                                  SortLevel        *parent_level,
2034                                  SortElt          *parent_elt)
2035 {
2036   GtkTreeIter iter;
2037   SortLevel *new_level;
2038   gint length = 0;
2039   gint i;
2040
2041   g_assert (tree_model_sort->child_model != NULL);
2042
2043   if (parent_level == NULL)
2044     {
2045       if (gtk_tree_model_get_iter_first (tree_model_sort->child_model, &iter) == FALSE)
2046         return;
2047       length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, NULL);
2048     }
2049   else
2050     {
2051       GtkTreeIter parent_iter;
2052       GtkTreeIter child_parent_iter;
2053
2054       parent_iter.stamp = tree_model_sort->stamp;
2055       parent_iter.user_data = parent_level;
2056       parent_iter.user_data2 = parent_elt;
2057
2058       gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2059                                                       &child_parent_iter,
2060                                                       &parent_iter);
2061       if (gtk_tree_model_iter_children (tree_model_sort->child_model,
2062                                         &iter,
2063                                         &child_parent_iter) == FALSE)
2064         return;
2065
2066       /* stamp may have changed */
2067       gtk_tree_model_sort_convert_iter_to_child_iter (tree_model_sort,
2068                                                       &child_parent_iter,
2069                                                       &parent_iter);
2070
2071       length = gtk_tree_model_iter_n_children (tree_model_sort->child_model, &child_parent_iter);
2072     }
2073
2074   g_return_if_fail (length > 0);
2075
2076   new_level = g_new (SortLevel, 1);
2077   new_level->array = g_array_sized_new (FALSE, FALSE, sizeof (SortElt), length);
2078   new_level->ref_count = 0;
2079   new_level->parent_elt = parent_elt;
2080   new_level->parent_level = parent_level;
2081
2082   if (parent_elt)
2083     parent_elt->children = new_level;
2084   else
2085     tree_model_sort->root = new_level;
2086
2087   /* increase the count of zero ref_counts.*/
2088   while (parent_level)
2089     {
2090       parent_elt->zero_ref_count++;
2091
2092       parent_elt = parent_level->parent_elt;
2093       parent_level = parent_level->parent_level;
2094     }
2095   if (new_level != tree_model_sort->root)
2096     tree_model_sort->zero_ref_count++;
2097
2098   for (i = 0; i < length; i++)
2099     {
2100       SortElt sort_elt;
2101       sort_elt.offset = i;
2102       sort_elt.zero_ref_count = 0;
2103       sort_elt.ref_count = 0;
2104       sort_elt.children = NULL;
2105
2106       if (GTK_TREE_MODEL_SORT_CACHE_CHILD_ITERS (tree_model_sort))
2107         {
2108           sort_elt.iter = iter;
2109           if (gtk_tree_model_iter_next (tree_model_sort->child_model, &iter) == FALSE &&
2110               i < length - 1)
2111             {
2112               g_warning ("There is a discrepency between the sort model and the child model.");
2113               return;
2114             }
2115         }
2116       g_array_append_val (new_level->array, sort_elt);
2117     }
2118
2119   /* sort level */
2120   gtk_tree_model_sort_sort_level (tree_model_sort, new_level,
2121                                   FALSE, FALSE);
2122 }
2123
2124 static void
2125 gtk_tree_model_sort_free_level (GtkTreeModelSort *tree_model_sort,
2126                                 SortLevel        *sort_level)
2127 {
2128   gint i;
2129
2130   g_assert (sort_level);
2131
2132   if (sort_level->ref_count == 0)
2133     {
2134       SortLevel *parent_level = sort_level->parent_level;
2135       SortElt *parent_elt = sort_level->parent_elt;
2136
2137       do
2138         {
2139           if (parent_elt)
2140             parent_elt->zero_ref_count--;
2141           else
2142             tree_model_sort->zero_ref_count--;
2143
2144           if (parent_level)
2145             {
2146               parent_elt = parent_level->parent_elt;
2147               parent_level = parent_level->parent_level;
2148             }
2149         }
2150       while (parent_level);
2151     }
2152
2153   for (i = 0; i < sort_level->array->len; i++)
2154     {
2155       if (g_array_index (sort_level->array, SortElt, i).children)
2156         gtk_tree_model_sort_free_level (tree_model_sort,
2157                                         SORT_LEVEL(g_array_index (sort_level->array, SortElt, i).children));
2158     }
2159
2160   if (sort_level->parent_elt)
2161     sort_level->parent_elt->children = NULL;
2162   else
2163     tree_model_sort->root = NULL;
2164
2165   g_array_free (sort_level->array, TRUE);
2166   sort_level->array = NULL;
2167
2168   g_free (sort_level);
2169   sort_level = NULL;
2170 }
2171
2172 static void
2173 gtk_tree_model_sort_increment_stamp (GtkTreeModelSort *tree_model_sort)
2174 {
2175   do
2176     {
2177       tree_model_sort->stamp++;
2178     }
2179   while (tree_model_sort->stamp == 0);
2180
2181   gtk_tree_model_sort_clear_cache (tree_model_sort);
2182 }
2183
2184 static void
2185 gtk_tree_model_sort_clear_cache_helper (GtkTreeModelSort *tree_model_sort,
2186                                         SortLevel        *level)
2187 {
2188   gint i;
2189
2190   g_assert (level != NULL);
2191
2192   for (i = 0; i < level->array->len; i++)
2193     {
2194       if (g_array_index (level->array, SortElt, i).zero_ref_count > 0)
2195         gtk_tree_model_sort_clear_cache_helper (tree_model_sort, g_array_index (level->array, SortElt, i).children);
2196     }
2197
2198   if (level->ref_count == 0 && level != tree_model_sort->root)
2199     gtk_tree_model_sort_free_level (tree_model_sort, level);
2200 }
2201
2202 /**
2203  * gtk_tree_model_sort_reset_default_sort_func:
2204  * @tree_model_sort: A #GtkTreeModelSort
2205  *
2206  * This resets the default sort function to be in the 'unsorted' state.  That
2207  * is, it is in the same order as the child model. It will re-sort the model
2208  * to be in the same order as the child model only if the #GtkTreeModelSort
2209  * is in 'unsorted' state.
2210  **/
2211 void
2212 gtk_tree_model_sort_reset_default_sort_func (GtkTreeModelSort *tree_model_sort)
2213 {
2214   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2215
2216   if (tree_model_sort->default_sort_destroy)
2217     {
2218       GtkDestroyNotify d = tree_model_sort->default_sort_destroy;
2219
2220       tree_model_sort->default_sort_destroy = NULL;
2221       d (tree_model_sort->default_sort_data);
2222     }
2223
2224   tree_model_sort->default_sort_func = NO_SORT_FUNC;
2225   tree_model_sort->default_sort_data = NULL;
2226   tree_model_sort->default_sort_destroy = NULL;
2227
2228   if (tree_model_sort->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
2229     gtk_tree_model_sort_sort (tree_model_sort);
2230   tree_model_sort->sort_column_id = GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID;
2231 }
2232
2233 /**
2234  * gtk_tree_model_sort_clear_cache:
2235  * @tree_model_sort: A #GtkTreeModelSort
2236  *
2237  * This function should almost never be called.  It clears the @tree_model_sort
2238  * of any cached iterators that haven't been reffed with
2239  * gtk_tree_model_ref_node().  This might be useful if the child model being
2240  * sorted is static (and doesn't change often) and there has been a lot of
2241  * unreffed access to nodes.  As a side effect of this function, all unreffed
2242  * iters will be invalid.
2243  **/
2244 void
2245 gtk_tree_model_sort_clear_cache (GtkTreeModelSort *tree_model_sort)
2246 {
2247   g_return_if_fail (GTK_IS_TREE_MODEL_SORT (tree_model_sort));
2248
2249   if (tree_model_sort->zero_ref_count)
2250     gtk_tree_model_sort_clear_cache_helper (tree_model_sort, (SortLevel *)tree_model_sort->root);
2251 }