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

   1 /* gtktreestore.c
   2  * Copyright (C) 2000  Red Hat, Inc.,  Jonathan Blandford <jrb@redhat.com>
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Library General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Library General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Library General Public
  15  * License along with this library; if not, write to the
  16  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  17  * Boston, MA 02111-1307, USA.
  18  */
  19
  20 #include <string.h>
  21 #include <gobject/gvaluecollector.h>
  22 #include "gtktreemodel.h"
  23 #include "gtktreestore.h"
  24 #include "gtktreedatalist.h"
  25 #include "gtktreednd.h"
  26
  27 #define G_NODE(node) ((GNode *)node)
  28 #define GTK_TREE_STORE_IS_SORTED(tree) (GTK_TREE_STORE (tree)->sort_column_id != -2)
  29 #define VALID_ITER(iter, tree_store) (iter!= NULL && iter->user_data != NULL && tree_store->stamp == iter->stamp)
  30
  31 static void         gtk_tree_store_init            (GtkTreeStore      *tree_store);
  32 static void         gtk_tree_store_class_init      (GtkTreeStoreClass *tree_store_class);
  33 static void         gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
  34 static void         gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
  35 static void         gtk_tree_store_drag_dest_init  (GtkTreeDragDestIface   *iface);
  36 static void         gtk_tree_store_sortable_init   (GtkTreeSortableIface   *iface);
  37 static void         gtk_tree_store_finalize        (GObject           *object);
  38 static GtkTreeModelFlags gtk_tree_store_get_flags  (GtkTreeModel      *tree_model);
  39 static gint         gtk_tree_store_get_n_columns   (GtkTreeModel      *tree_model);
  40 static GType        gtk_tree_store_get_column_type (GtkTreeModel      *tree_model,
  41                                                     gint               index);
  42 static gboolean     gtk_tree_store_get_iter        (GtkTreeModel      *tree_model,
  43                                                     GtkTreeIter       *iter,
  44                                                     GtkTreePath       *path);
  45 static GtkTreePath *gtk_tree_store_get_path        (GtkTreeModel      *tree_model,
  46                                                     GtkTreeIter       *iter);
  47 static void         gtk_tree_store_get_value       (GtkTreeModel      *tree_model,
  48                                                     GtkTreeIter       *iter,
  49                                                     gint               column,
  50                                                     GValue            *value);
  51 static gboolean     gtk_tree_store_iter_next       (GtkTreeModel      *tree_model,
  52                                                     GtkTreeIter       *iter);
  53 static gboolean     gtk_tree_store_iter_children   (GtkTreeModel      *tree_model,
  54                                                     GtkTreeIter       *iter,
  55                                                     GtkTreeIter       *parent);
  56 static gboolean     gtk_tree_store_iter_has_child  (GtkTreeModel      *tree_model,
  57                                                     GtkTreeIter       *iter);
  58 static gint         gtk_tree_store_iter_n_children (GtkTreeModel      *tree_model,
  59                                                     GtkTreeIter       *iter);
  60 static gboolean     gtk_tree_store_iter_nth_child  (GtkTreeModel      *tree_model,
  61                                                     GtkTreeIter       *iter,
  62                                                     GtkTreeIter       *parent,
  63                                                     gint               n);
  64 static gboolean     gtk_tree_store_iter_parent     (GtkTreeModel      *tree_model,
  65                                                     GtkTreeIter       *iter,
  66                                                     GtkTreeIter       *child);
  67
  68
  69 static void gtk_tree_store_set_n_columns   (GtkTreeStore *tree_store,
  70                                             gint          n_columns);
  71 static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
  72                                             gint          column,
  73                                             GType         type);
  74
  75
  76 /* DND interfaces */
  77 static gboolean gtk_tree_store_drag_data_delete   (GtkTreeDragSource *drag_source,
  78                                                    GtkTreePath       *path);
  79 static gboolean gtk_tree_store_drag_data_get      (GtkTreeDragSource *drag_source,
  80                                                    GtkTreePath       *path,
  81                                                    GtkSelectionData  *selection_data);
  82 static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest   *drag_dest,
  83                                                    GtkTreePath       *dest,
  84                                                    GtkSelectionData  *selection_data);
  85 static gboolean gtk_tree_store_row_drop_possible  (GtkTreeDragDest   *drag_dest,
  86                                                    GtkTreePath       *dest_path,
  87                                                    GtkSelectionData  *selection_data);
  88
  89 /* Sortable Interfaces */
  90
  91 static void     gtk_tree_store_sort                    (GtkTreeStore           *tree_store);
  92 static void     gtk_tree_store_sort_iter_changed       (GtkTreeStore           *tree_store,
  93                                                         GtkTreeIter            *iter,
  94                                                         gint                    column);
  95 static gboolean gtk_tree_store_get_sort_column_id      (GtkTreeSortable        *sortable,
  96                                                         gint                   *sort_column_id,
  97                                                         GtkSortType            *order);
  98 static void     gtk_tree_store_set_sort_column_id      (GtkTreeSortable        *sortable,
  99                                                         gint                    sort_column_id,
 100                                                         GtkSortType             order);
 101 static void     gtk_tree_store_set_sort_func           (GtkTreeSortable        *sortable,
 102                                                         gint                    sort_column_id,
 103                                                         GtkTreeIterCompareFunc  func,
 104                                                         gpointer                data,
 105                                                         GtkDestroyNotify        destroy);
 106 static void     gtk_tree_store_set_default_sort_func   (GtkTreeSortable        *sortable,
 107                                                         GtkTreeIterCompareFunc  func,
 108                                                         gpointer                data,
 109                                                         GtkDestroyNotify        destroy);
 110 static gboolean gtk_tree_store_has_default_sort_func   (GtkTreeSortable        *sortable);
 111
 112 static void     validate_gnode                         (GNode *node);
 113
 114 static void     gtk_tree_store_move                    (GtkTreeStore           *tree_store,
 115                                                         GtkTreeIter            *iter,
 116                                                         GtkTreeIter            *position,
 117                                                         gboolean                before);
 118
 119
 120 static GObjectClass *parent_class = NULL;
 121
 122
 123 static inline void
 124 validate_tree (GtkTreeStore *tree_store)
 125 {
 126   if (gtk_debug_flags & GTK_DEBUG_TREE)
 127     {
 128       g_assert (G_NODE (tree_store->root)->parent == NULL);
 129
 130       validate_gnode (G_NODE (tree_store->root));
 131     }
 132 }
 133
 134 GType
 135 gtk_tree_store_get_type (void)
 136 {
 137   static GType tree_store_type = 0;
 138
 139   if (!tree_store_type)
 140     {
 141       static const GTypeInfo tree_store_info =
 142       {
 143         sizeof (GtkTreeStoreClass),
 144         NULL,           /* base_init */
 145         NULL,           /* base_finalize */
 146         (GClassInitFunc) gtk_tree_store_class_init,
 147         NULL,           /* class_finalize */
 148         NULL,           /* class_data */
 149         sizeof (GtkTreeStore),
 150         0,              /* n_preallocs */
 151         (GInstanceInitFunc) gtk_tree_store_init
 152       };
 153
 154       static const GInterfaceInfo tree_model_info =
 155       {
 156         (GInterfaceInitFunc) gtk_tree_store_tree_model_init,
 157         NULL,
 158         NULL
 159       };
 160
 161       static const GInterfaceInfo drag_source_info =
 162       {
 163         (GInterfaceInitFunc) gtk_tree_store_drag_source_init,
 164         NULL,
 165         NULL
 166       };
 167
 168       static const GInterfaceInfo drag_dest_info =
 169       {
 170         (GInterfaceInitFunc) gtk_tree_store_drag_dest_init,
 171         NULL,
 172         NULL
 173       };
 174
 175       static const GInterfaceInfo sortable_info =
 176       {
 177         (GInterfaceInitFunc) gtk_tree_store_sortable_init,
 178         NULL,
 179         NULL
 180       };
 181
 182       tree_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkTreeStore",
 183                                                 &tree_store_info, 0);
 184
 185       g_type_add_interface_static (tree_store_type,
 186                                    GTK_TYPE_TREE_MODEL,
 187                                    &tree_model_info);
 188       g_type_add_interface_static (tree_store_type,
 189                                    GTK_TYPE_TREE_DRAG_SOURCE,
 190                                    &drag_source_info);
 191       g_type_add_interface_static (tree_store_type,
 192                                    GTK_TYPE_TREE_DRAG_DEST,
 193                                    &drag_dest_info);
 194       g_type_add_interface_static (tree_store_type,
 195                                    GTK_TYPE_TREE_SORTABLE,
 196                                    &sortable_info);
 197
 198     }
 199
 200   return tree_store_type;
 201 }
 202
 203 static void
 204 gtk_tree_store_class_init (GtkTreeStoreClass *class)
 205 {
 206   GObjectClass *object_class;
 207
 208   parent_class = g_type_class_peek_parent (class);
 209   object_class = (GObjectClass *) class;
 210
 211   object_class->finalize = gtk_tree_store_finalize;
 212 }
 213
 214 static void
 215 gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
 216 {
 217   iface->get_flags = gtk_tree_store_get_flags;
 218   iface->get_n_columns = gtk_tree_store_get_n_columns;
 219   iface->get_column_type = gtk_tree_store_get_column_type;
 220   iface->get_iter = gtk_tree_store_get_iter;
 221   iface->get_path = gtk_tree_store_get_path;
 222   iface->get_value = gtk_tree_store_get_value;
 223   iface->iter_next = gtk_tree_store_iter_next;
 224   iface->iter_children = gtk_tree_store_iter_children;
 225   iface->iter_has_child = gtk_tree_store_iter_has_child;
 226   iface->iter_n_children = gtk_tree_store_iter_n_children;
 227   iface->iter_nth_child = gtk_tree_store_iter_nth_child;
 228   iface->iter_parent = gtk_tree_store_iter_parent;
 229 }
 230
 231 static void
 232 gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
 233 {
 234   iface->drag_data_delete = gtk_tree_store_drag_data_delete;
 235   iface->drag_data_get = gtk_tree_store_drag_data_get;
 236 }
 237
 238 static void
 239 gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
 240 {
 241   iface->drag_data_received = gtk_tree_store_drag_data_received;
 242   iface->row_drop_possible = gtk_tree_store_row_drop_possible;
 243 }
 244
 245 static void
 246 gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
 247 {
 248   iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
 249   iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
 250   iface->set_sort_func = gtk_tree_store_set_sort_func;
 251   iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
 252   iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
 253 }
 254
 255 static void
 256 gtk_tree_store_init (GtkTreeStore *tree_store)
 257 {
 258   tree_store->root = g_node_new (NULL);
 259   /* While the odds are against us getting 0...
 260    */
 261   do
 262     {
 263       tree_store->stamp = g_random_int ();
 264     }
 265   while (tree_store->stamp == 0);
 266
 267   tree_store->sort_list = NULL;
 268   tree_store->sort_column_id = -2;
 269   tree_store->columns_dirty = FALSE;
 270 }
 271
 272 /**
 273  * gtk_tree_store_new:
 274  * @n_columns: number of columns in the tree store
 275  * @Varargs: all #GType types for the columns, from first to last
 276  *
 277  * Creates a new tree store as with @n_columns columns each of the types passed
 278  * in.  As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
 279  * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
 280  * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
 281  *
 282  * Return value: a new #GtkTreeStore
 283  **/
 284 GtkTreeStore *
 285 gtk_tree_store_new (gint n_columns,
 286                                ...)
 287 {
 288   GtkTreeStore *retval;
 289   va_list args;
 290   gint i;
 291
 292   g_return_val_if_fail (n_columns > 0, NULL);
 293
 294   retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
 295   gtk_tree_store_set_n_columns (retval, n_columns);
 296
 297   va_start (args, n_columns);
 298
 299   for (i = 0; i < n_columns; i++)
 300     {
 301       GType type = va_arg (args, GType);
 302       if (! _gtk_tree_data_list_check_type (type))
 303         {
 304           g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
 305                      G_STRLOC, g_type_name (type));
 306           g_object_unref (retval);
 307           return NULL;
 308         }
 309       gtk_tree_store_set_column_type (retval, i, type);
 310     }
 311   va_end (args);
 312
 313   return retval;
 314 }
 315 /**
 316  * gtk_tree_store_newv:
 317  * @n_columns: number of columns in the tree store
 318  * @types: an array of #GType types for the columns, from first to last
 319  *
 320  * Non vararg creation function.  Used primarily by language bindings.
 321  *
 322  * Return value: a new #GtkTreeStore
 323  **/
 324 GtkTreeStore *
 325 gtk_tree_store_newv (gint   n_columns,
 326                      GType *types)
 327 {
 328   GtkTreeStore *retval;
 329   gint i;
 330
 331   g_return_val_if_fail (n_columns > 0, NULL);
 332
 333   retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
 334   gtk_tree_store_set_n_columns (retval, n_columns);
 335
 336    for (i = 0; i < n_columns; i++)
 337     {
 338       if (! _gtk_tree_data_list_check_type (types[i]))
 339         {
 340           g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n",
 341                      G_STRLOC, g_type_name (types[i]));
 342           g_object_unref (retval);
 343           return NULL;
 344         }
 345       gtk_tree_store_set_column_type (retval, i, types[i]);
 346     }
 347
 348   return retval;
 349 }
 350
 351
 352 /**
 353  * gtk_tree_store_set_column_types:
 354  * @tree_store: A #GtkTreeStore
 355  * @n_columns: Number of columns for the tree store
 356  * @types: An array of #GType types, one for each column
 357  *
 358  * This function is meant primarily for #GObjects that inherit from
 359  * #GtkTreeStore, and should only be used when constructing a new
 360  * #GtkTreeStore.  It will not function after a row has been added,
 361  * or a method on the #GtkTreeModel interface is called.
 362  **/
 363 void
 364 gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
 365                                  gint          n_columns,
 366                                  GType        *types)
 367 {
 368   gint i;
 369
 370   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
 371   g_return_if_fail (tree_store->columns_dirty == 0);
 372
 373   gtk_tree_store_set_n_columns (tree_store, n_columns);
 374    for (i = 0; i < n_columns; i++)
 375     {
 376       if (! _gtk_tree_data_list_check_type (types[i]))
 377         {
 378           g_warning ("%s: Invalid type %s passed to gtk_tree_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
 379           continue;
 380         }
 381       gtk_tree_store_set_column_type (tree_store, i, types[i]);
 382     }
 383 }
 384
 385 static void
 386 gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
 387                               gint          n_columns)
 388 {
 389   GType *new_columns;
 390
 391   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
 392
 393   if (tree_store->n_columns == n_columns)
 394     return;
 395
 396   new_columns = g_new0 (GType, n_columns);
 397   if (tree_store->column_headers)
 398     {
 399       /* copy the old header orders over */
 400       if (n_columns >= tree_store->n_columns)
 401         memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
 402       else
 403         memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
 404
 405       g_free (tree_store->column_headers);
 406     }
 407
 408   if (tree_store->sort_list)
 409     _gtk_tree_data_list_header_free (tree_store->sort_list);
 410
 411   tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
 412
 413   tree_store->column_headers = new_columns;
 414   tree_store->n_columns = n_columns;
 415 }
 416
 417 /**
 418  * gtk_tree_store_set_column_type:
 419  * @tree_store: a #GtkTreeStore
 420  * @column: column number
 421  * @type: type of the data to be stored in @column
 422  *
 423  * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
 424  * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
 425  * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
 426  * subclasses of those types such as %GDK_TYPE_PIXBUF.
 427  *
 428  **/
 429 static void
 430 gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
 431                                 gint          column,
 432                                 GType         type)
 433 {
 434   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
 435   g_return_if_fail (column >=0 && column < tree_store->n_columns);
 436   if (!_gtk_tree_data_list_check_type (type))
 437     {
 438       g_warning ("%s: Invalid type %s passed to gtk_tree_store_new_with_types\n", G_STRLOC, g_type_name (type));
 439       return;
 440     }
 441   tree_store->column_headers[column] = type;
 442 }
 443
 444 static gboolean
 445 node_free (GNode *node, gpointer data)
 446 {
 447   if (node->data)
 448     _gtk_tree_data_list_free (node->data, (GType*)data);
 449   node->data = NULL;
 450
 451   return FALSE;
 452 }
 453
 454 static void
 455 gtk_tree_store_finalize (GObject *object)
 456 {
 457   GtkTreeStore *tree_store = GTK_TREE_STORE (object);
 458
 459   g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
 460                    node_free, tree_store->column_headers);
 461   g_node_destroy (tree_store->root);
 462   _gtk_tree_data_list_header_free (tree_store->sort_list);
 463   g_free (tree_store->column_headers);
 464
 465   if (tree_store->default_sort_destroy)
 466     {
 467       GtkDestroyNotify d = tree_store->default_sort_destroy;
 468
 469       tree_store->default_sort_destroy = NULL;
 470       d (tree_store->default_sort_data);
 471       tree_store->default_sort_data = NULL;
 472     }
 473
 474   /* must chain up */
 475   (* parent_class->finalize) (object);
 476 }
 477
 478 /* fulfill the GtkTreeModel requirements */
 479 /* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node.  However,
 480  * it is not visible to the tree or to the user., and the path "0" refers to the
 481  * first child of GtkTreeStore::root.
 482  */
 483
 484
 485 static GtkTreeModelFlags
 486 gtk_tree_store_get_flags (GtkTreeModel *tree_model)
 487 {
 488   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
 489
 490   return GTK_TREE_MODEL_ITERS_PERSIST;
 491 }
 492
 493 static gint
 494 gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
 495 {
 496   GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
 497
 498   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
 499
 500   tree_store->columns_dirty = TRUE;
 501
 502   return tree_store->n_columns;
 503 }
 504
 505 static GType
 506 gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
 507                                 gint          index)
 508 {
 509   GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
 510
 511   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), G_TYPE_INVALID);
 512   g_return_val_if_fail (index < GTK_TREE_STORE (tree_model)->n_columns &&
 513                         index >= 0, G_TYPE_INVALID);
 514
 515   tree_store->columns_dirty = TRUE;
 516
 517   return tree_store->column_headers[index];
 518 }
 519
 520 static gboolean
 521 gtk_tree_store_get_iter (GtkTreeModel *tree_model,
 522                          GtkTreeIter  *iter,
 523                          GtkTreePath  *path)
 524 {
 525   GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
 526   GtkTreeIter parent;
 527   gint *indices;
 528   gint depth, i;
 529
 530   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
 531
 532   tree_store->columns_dirty = TRUE;
 533
 534   indices = gtk_tree_path_get_indices (path);
 535   depth = gtk_tree_path_get_depth (path);
 536
 537   g_return_val_if_fail (depth > 0, FALSE);
 538
 539   parent.stamp = tree_store->stamp;
 540   parent.user_data = tree_store->root;
 541
 542   if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[0]))
 543     return FALSE;
 544
 545   for (i = 1; i < depth; i++)
 546     {
 547       parent = *iter;
 548       if (! gtk_tree_model_iter_nth_child (tree_model, iter, &parent, indices[i]))
 549         return FALSE;
 550     }
 551
 552   return TRUE;
 553 }
 554
 555 static GtkTreePath *
 556 gtk_tree_store_get_path (GtkTreeModel *tree_model,
 557                          GtkTreeIter  *iter)
 558 {
 559   GtkTreePath *retval;
 560   GNode *tmp_node;
 561   gint i = 0;
 562
 563   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), NULL);
 564   g_return_val_if_fail (iter != NULL, NULL);
 565   g_return_val_if_fail (iter->user_data != NULL, NULL);
 566   g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, NULL);
 567
 568   validate_tree ((GtkTreeStore*)tree_model);
 569
 570   if (G_NODE (iter->user_data)->parent == NULL &&
 571       G_NODE (iter->user_data) == GTK_TREE_STORE (tree_model)->root)
 572     return gtk_tree_path_new ();
 573   g_assert (G_NODE (iter->user_data)->parent != NULL);
 574
 575   if (G_NODE (iter->user_data)->parent == G_NODE (GTK_TREE_STORE (tree_model)->root))
 576     {
 577       retval = gtk_tree_path_new ();
 578       tmp_node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
 579     }
 580   else
 581     {
 582       GtkTreeIter tmp_iter = *iter;
 583
 584       tmp_iter.user_data = G_NODE (iter->user_data)->parent;
 585
 586       retval = gtk_tree_store_get_path (tree_model,
 587                                         &tmp_iter);
 588       tmp_node = G_NODE (iter->user_data)->parent->children;
 589     }
 590
 591   if (retval == NULL)
 592     return NULL;
 593
 594   if (tmp_node == NULL)
 595     {
 596       gtk_tree_path_free (retval);
 597       return NULL;
 598     }
 599
 600   for (; tmp_node; tmp_node = tmp_node->next)
 601     {
 602       if (tmp_node == G_NODE (iter->user_data))
 603         break;
 604       i++;
 605     }
 606
 607   if (tmp_node == NULL)
 608     {
 609       /* We couldn't find node, meaning it's prolly not ours */
 610       /* Perhaps I should do a g_return_if_fail here. */
 611       gtk_tree_path_free (retval);
 612       return NULL;
 613     }
 614
 615   gtk_tree_path_append_index (retval, i);
 616
 617   return retval;
 618 }
 619
 620
 621 static void
 622 gtk_tree_store_get_value (GtkTreeModel *tree_model,
 623                           GtkTreeIter  *iter,
 624                           gint          column,
 625                           GValue       *value)
 626 {
 627   GtkTreeDataList *list;
 628   gint tmp_column = column;
 629
 630   g_return_if_fail (GTK_IS_TREE_STORE (tree_model));
 631   g_return_if_fail (iter != NULL);
 632   g_return_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp);
 633   g_return_if_fail (column < GTK_TREE_STORE (tree_model)->n_columns);
 634
 635   list = G_NODE (iter->user_data)->data;
 636
 637   while (tmp_column-- > 0 && list)
 638     list = list->next;
 639
 640   if (list)
 641     {
 642       _gtk_tree_data_list_node_to_value (list,
 643                                          GTK_TREE_STORE (tree_model)->column_headers[column],
 644                                          value);
 645     }
 646   else
 647     {
 648       /* We want to return an initialized but empty (default) value */
 649       g_value_init (value, GTK_TREE_STORE (tree_model)->column_headers[column]);
 650     }
 651 }
 652
 653 static gboolean
 654 gtk_tree_store_iter_next (GtkTreeModel  *tree_model,
 655                           GtkTreeIter   *iter)
 656 {
 657   g_return_val_if_fail (iter != NULL, FALSE);
 658   g_return_val_if_fail (iter->user_data != NULL, FALSE);
 659   g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
 660
 661   if (G_NODE (iter->user_data)->next)
 662     {
 663       iter->user_data = G_NODE (iter->user_data)->next;
 664       return TRUE;
 665     }
 666   else
 667     return FALSE;
 668 }
 669
 670 static gboolean
 671 gtk_tree_store_iter_children (GtkTreeModel *tree_model,
 672                               GtkTreeIter  *iter,
 673                               GtkTreeIter  *parent)
 674 {
 675   GNode *children;
 676
 677   g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
 678   g_return_val_if_fail (parent == NULL || parent->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
 679
 680   if (parent)
 681     children = G_NODE (parent->user_data)->children;
 682   else
 683     children = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
 684
 685   if (children)
 686     {
 687       iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
 688       iter->user_data = children;
 689       return TRUE;
 690     }
 691   else
 692     return FALSE;
 693 }
 694
 695 static gboolean
 696 gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
 697                                GtkTreeIter  *iter)
 698 {
 699   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
 700   g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
 701   g_return_val_if_fail (iter->user_data != NULL, FALSE);
 702
 703   return G_NODE (iter->user_data)->children != NULL;
 704 }
 705
 706 static gint
 707 gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
 708                                 GtkTreeIter  *iter)
 709 {
 710   GNode *node;
 711   gint i = 0;
 712
 713   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), 0);
 714   g_return_val_if_fail (iter == NULL || iter->user_data != NULL, FALSE);
 715
 716   if (iter == NULL)
 717     node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
 718   else
 719     node = G_NODE (iter->user_data)->children;
 720
 721   while (node)
 722     {
 723       i++;
 724       node = node->next;
 725     }
 726
 727   return i;
 728 }
 729
 730 static gboolean
 731 gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
 732                                GtkTreeIter  *iter,
 733                                GtkTreeIter  *parent,
 734                                gint          n)
 735 {
 736   GNode *parent_node;
 737   GNode *child;
 738
 739   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_model), FALSE);
 740   g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
 741
 742   if (parent == NULL)
 743     parent_node = GTK_TREE_STORE (tree_model)->root;
 744   else
 745     parent_node = parent->user_data;
 746
 747   child = g_node_nth_child (parent_node, n);
 748
 749   if (child)
 750     {
 751       iter->user_data = child;
 752       iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
 753       return TRUE;
 754     }
 755   else
 756     return FALSE;
 757 }
 758
 759 static gboolean
 760 gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
 761                             GtkTreeIter  *iter,
 762                             GtkTreeIter  *child)
 763 {
 764   GNode *parent;
 765
 766   g_return_val_if_fail (iter != NULL, FALSE);
 767   g_return_val_if_fail (child != NULL, FALSE);
 768   g_return_val_if_fail (child->user_data != NULL, FALSE);
 769   g_return_val_if_fail (child->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
 770
 771   parent = G_NODE (child->user_data)->parent;
 772
 773   g_assert (parent != NULL);
 774
 775   if (parent != GTK_TREE_STORE (tree_model)->root)
 776     {
 777       iter->user_data = parent;
 778       iter->stamp = GTK_TREE_STORE (tree_model)->stamp;
 779       return TRUE;
 780     }
 781   else
 782     return FALSE;
 783 }
 784
 785
 786 /* Does not emit a signal */
 787 static gboolean
 788 gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
 789                                GtkTreeIter  *iter,
 790                                gint          column,
 791                                GValue       *value,
 792                                gboolean      sort)
 793 {
 794   GtkTreeDataList *list;
 795   GtkTreeDataList *prev;
 796   gint old_column = column;
 797   GValue real_value = {0, };
 798   gboolean converted = FALSE;
 799   gboolean retval = FALSE;
 800
 801   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
 802   g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
 803   g_return_val_if_fail (column >= 0 && column < tree_store->n_columns, FALSE);
 804   g_return_val_if_fail (G_IS_VALUE (value), FALSE);
 805
 806   if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
 807     {
 808       if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
 809              g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
 810         {
 811           g_warning ("%s: Unable to convert from %s to %s\n",
 812                      G_STRLOC,
 813                      g_type_name (G_VALUE_TYPE (value)),
 814                      g_type_name (tree_store->column_headers[column]));
 815           return retval;
 816         }
 817       if (!g_value_transform (value, &real_value))
 818         {
 819           g_warning ("%s: Unable to make conversion from %s to %s\n",
 820                      G_STRLOC,
 821                      g_type_name (G_VALUE_TYPE (value)),
 822                      g_type_name (tree_store->column_headers[column]));
 823           g_value_unset (&real_value);
 824           return retval;
 825         }
 826       converted = TRUE;
 827     }
 828
 829   prev = list = G_NODE (iter->user_data)->data;
 830
 831   while (list != NULL)
 832     {
 833       if (column == 0)
 834         {
 835           if (converted)
 836             _gtk_tree_data_list_value_to_node (list, &real_value);
 837           else
 838             _gtk_tree_data_list_value_to_node (list, value);
 839           retval = TRUE;
 840           if (converted)
 841             g_value_unset (&real_value);
 842           if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
 843             gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
 844           return retval;
 845         }
 846
 847       column--;
 848       prev = list;
 849       list = list->next;
 850     }
 851
 852   if (G_NODE (iter->user_data)->data == NULL)
 853     {
 854       G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
 855       list->next = NULL;
 856     }
 857   else
 858     {
 859       list = prev->next = _gtk_tree_data_list_alloc ();
 860       list->next = NULL;
 861     }
 862
 863   while (column != 0)
 864     {
 865       list->next = _gtk_tree_data_list_alloc ();
 866       list = list->next;
 867       list->next = NULL;
 868       column --;
 869     }
 870
 871   if (converted)
 872     _gtk_tree_data_list_value_to_node (list, &real_value);
 873   else
 874     _gtk_tree_data_list_value_to_node (list, value);
 875
 876   retval = TRUE;
 877   if (converted)
 878     g_value_unset (&real_value);
 879
 880   if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
 881     gtk_tree_store_sort_iter_changed (tree_store, iter, old_column);
 882
 883   return retval;
 884 }
 885
 886 /**
 887  * gtk_tree_store_set_value:
 888  * @tree_store: a #GtkTreeStore
 889  * @iter: A valid #GtkTreeIter for the row being modified
 890  * @column: column number to modify
 891  * @value: new value for the cell
 892  *
 893  * Sets the data in the cell specified by @iter and @column.
 894  * The type of @value must be convertible to the type of the
 895  * column.
 896  *
 897  **/
 898 void
 899 gtk_tree_store_set_value (GtkTreeStore *tree_store,
 900                           GtkTreeIter  *iter,
 901                           gint          column,
 902                           GValue       *value)
 903 {
 904   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
 905   g_return_if_fail (VALID_ITER (iter, tree_store));
 906   g_return_if_fail (column >= 0 && column < tree_store->n_columns);
 907   g_return_if_fail (G_IS_VALUE (value));
 908
 909   if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
 910     {
 911       GtkTreePath *path;
 912
 913       path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
 914       gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
 915       gtk_tree_path_free (path);
 916     }
 917 }
 918
 919 /**
 920  * gtk_tree_store_set_valist:
 921  * @tree_store: A #GtkTreeStore
 922  * @iter: A valid #GtkTreeIter for the row being modified
 923  * @var_args: <type>va_list</type> of column/value pairs
 924  *
 925  * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
 926  * use by language bindings.
 927  *
 928  **/
 929 void
 930 gtk_tree_store_set_valist (GtkTreeStore *tree_store,
 931                            GtkTreeIter  *iter,
 932                            va_list      var_args)
 933 {
 934   gint column;
 935   gboolean emit_signal = FALSE;
 936   gboolean maybe_need_sort = FALSE;
 937   GtkTreeIterCompareFunc func = NULL;
 938
 939   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
 940   g_return_if_fail (VALID_ITER (iter, tree_store));
 941
 942   column = va_arg (var_args, gint);
 943
 944   if (GTK_TREE_STORE_IS_SORTED (tree_store))
 945     {
 946       if (tree_store->sort_column_id != -1)
 947         {
 948           GtkTreeDataSortHeader *header;
 949           header = _gtk_tree_data_list_get_header (tree_store->sort_list,
 950                                                    tree_store->sort_column_id);
 951           g_return_if_fail (header != NULL);
 952           g_return_if_fail (header->func != NULL);
 953           func = header->func;
 954         }
 955       else
 956         {
 957           func = tree_store->default_sort_func;
 958         }
 959     }
 960
 961   if (func != gtk_tree_data_list_compare_func)
 962     maybe_need_sort = TRUE;
 963
 964   while (column != -1)
 965     {
 966       GValue value = { 0, };
 967       gchar *error = NULL;
 968
 969       if (column >= tree_store->n_columns)
 970         {
 971           g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
 972           break;
 973         }
 974       g_value_init (&value, tree_store->column_headers[column]);
 975
 976       G_VALUE_COLLECT (&value, var_args, 0, &error);
 977       if (error)
 978         {
 979           g_warning ("%s: %s", G_STRLOC, error);
 980           g_free (error);
 981
 982           /* we purposely leak the value here, it might not be
 983            * in a sane state if an error condition occoured
 984            */
 985           break;
 986         }
 987
 988       emit_signal = gtk_tree_store_real_set_value (tree_store,
 989                                                    iter,
 990                                                    column,
 991                                                    &value,
 992                                                    FALSE) || emit_signal;
 993
 994       if (func == gtk_tree_data_list_compare_func &&
 995           column == tree_store->sort_column_id)
 996         maybe_need_sort = TRUE;
 997
 998       g_value_unset (&value);
 999
1000       column = va_arg (var_args, gint);
1001     }
1002
1003   if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1004     gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id);
1005
1006   if (emit_signal)
1007     {
1008       GtkTreePath *path;
1009
1010       path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
1011       gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
1012       gtk_tree_path_free (path);
1013     }
1014 }
1015
1016 /**
1017  * gtk_tree_store_set:
1018  * @tree_store: A #GtkTreeStore
1019  * @iter: A valid #GtkTreeIter for the row being modified
1020  * @Varargs: pairs of column number and value, terminated with -1
1021  *
1022  * Sets the value of one or more cells in the row referenced by @iter.
1023  * The variable argument list should contain integer column numbers,
1024  * each column number followed by the value to be set.
1025  * The list is terminated by a -1. For example, to set column 0 with type
1026  * %G_TYPE_STRING to "Foo", you would write
1027  * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
1028  **/
1029 void
1030 gtk_tree_store_set (GtkTreeStore *tree_store,
1031                     GtkTreeIter  *iter,
1032                     ...)
1033 {
1034   va_list var_args;
1035
1036   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1037   g_return_if_fail (VALID_ITER (iter, tree_store));
1038
1039   va_start (var_args, iter);
1040   gtk_tree_store_set_valist (tree_store, iter, var_args);
1041   va_end (var_args);
1042 }
1043
1044 /**
1045  * gtk_tree_store_remove:
1046  * @tree_store: A #GtkTreeStore
1047  * @iter: A valid #GtkTreeIter
1048  *
1049  * Removes @iter from @tree_store.  After being removed, @iter is set to the
1050  * next valid row at that level, or invalidated if it previously pointed to the
1051  * last one.
1052  *
1053  * Return value: %TRUE if @iter is still valid, %FALSE if not.
1054  **/
1055 gboolean
1056 gtk_tree_store_remove (GtkTreeStore *tree_store,
1057                        GtkTreeIter  *iter)
1058 {
1059   GtkTreePath *path;
1060   GtkTreeIter new_iter = {0,};
1061   GNode *parent;
1062   GNode *next_node;
1063
1064   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1065   g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1066
1067   parent = G_NODE (iter->user_data)->parent;
1068
1069   g_assert (parent != NULL);
1070   next_node = G_NODE (iter->user_data)->next;
1071
1072   if (G_NODE (iter->user_data)->data)
1073     g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1074                      -1, node_free, tree_store->column_headers);
1075
1076   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1077   g_node_destroy (G_NODE (iter->user_data));
1078
1079   gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1080
1081   if (parent != G_NODE (tree_store->root))
1082     {
1083       /* child_toggled */
1084       if (parent->children == NULL)
1085         {
1086           gtk_tree_path_up (path);
1087
1088           new_iter.stamp = tree_store->stamp;
1089           new_iter.user_data = parent;
1090           gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1091         }
1092     }
1093   gtk_tree_path_free (path);
1094
1095   /* revalidate iter */
1096   if (next_node != NULL)
1097     {
1098       iter->stamp = tree_store->stamp;
1099       iter->user_data = next_node;
1100       return TRUE;
1101     }
1102   else
1103     {
1104       iter->stamp = 0;
1105       iter->user_data = NULL;
1106     }
1107
1108   return FALSE;
1109 }
1110
1111 /**
1112  * gtk_tree_store_insert:
1113  * @tree_store: A #GtkTreeStore
1114  * @iter: An unset #GtkTreeIter to set to the new row
1115  * @parent: A valid #GtkTreeIter, or %NULL
1116  * @position: position to insert the new row
1117  *
1118  * Creates a new row at @position.  If parent is non-%NULL, then the row will be
1119  * made a child of @parent.  Otherwise, the row will be created at the toplevel.
1120  * If @position is larger than the number of rows at that level, then the new
1121  * row will be inserted to the end of the list.  @iter will be changed to point
1122  * to this new row.  The row will be empty after this function is called.  To
1123  * fill in values, you need to call gtk_tree_store_set() or
1124  * gtk_tree_store_set_value().
1125  *
1126  **/
1127 void
1128 gtk_tree_store_insert (GtkTreeStore *tree_store,
1129                        GtkTreeIter  *iter,
1130                        GtkTreeIter  *parent,
1131                        gint          position)
1132 {
1133   GtkTreePath *path;
1134   GNode *parent_node;
1135
1136   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1137   if (parent)
1138     g_return_if_fail (VALID_ITER (parent, tree_store));
1139
1140   if (parent)
1141     parent_node = parent->user_data;
1142   else
1143     parent_node = tree_store->root;
1144
1145   tree_store->columns_dirty = TRUE;
1146
1147   iter->stamp = tree_store->stamp;
1148   iter->user_data = g_node_new (NULL);
1149   g_node_insert (parent_node, position, G_NODE (iter->user_data));
1150
1151   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1152   gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1153
1154   gtk_tree_path_free (path);
1155
1156   validate_tree ((GtkTreeStore*)tree_store);
1157 }
1158
1159 /**
1160  * gtk_tree_store_insert_before:
1161  * @tree_store: A #GtkTreeStore
1162  * @iter: An unset #GtkTreeIter to set to the new row
1163  * @parent: A valid #GtkTreeIter, or %NULL
1164  * @sibling: A valid #GtkTreeIter, or %NULL
1165  *
1166  * Inserts a new row before @sibling.  If @sibling is %NULL, then the row will
1167  * be appended to @parent 's children.  If @parent and @sibling are %NULL, then
1168  * the row will be appended to the toplevel.  If both @sibling and @parent are
1169  * set, then @parent must be the parent of @sibling.  When @sibling is set,
1170  * @parent is optional.
1171  *
1172  * @iter will be changed to point to this new row.  The row will be empty after
1173  * this function is called.  To fill in values, you need to call
1174  * gtk_tree_store_set() or gtk_tree_store_set_value().
1175  *
1176  **/
1177 void
1178 gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1179                               GtkTreeIter  *iter,
1180                               GtkTreeIter  *parent,
1181                               GtkTreeIter  *sibling)
1182 {
1183   GtkTreePath *path;
1184   GNode *parent_node = NULL;
1185   GNode *new_node;
1186
1187   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1188   g_return_if_fail (iter != NULL);
1189   if (parent != NULL)
1190     g_return_if_fail (VALID_ITER (parent, tree_store));
1191   if (sibling != NULL)
1192     g_return_if_fail (VALID_ITER (sibling, tree_store));
1193
1194   tree_store->columns_dirty = TRUE;
1195
1196   new_node = g_node_new (NULL);
1197
1198   if (parent == NULL && sibling == NULL)
1199     parent_node = tree_store->root;
1200   else if (parent == NULL)
1201     parent_node = G_NODE (sibling->user_data)->parent;
1202   else if (sibling == NULL)
1203     parent_node = G_NODE (parent->user_data);
1204   else
1205     {
1206       g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1207       parent_node = G_NODE (parent->user_data);
1208     }
1209
1210   g_node_insert_before (parent_node,
1211                         sibling ? G_NODE (sibling->user_data) : NULL,
1212                         new_node);
1213
1214   iter->stamp = tree_store->stamp;
1215   iter->user_data = new_node;
1216
1217   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1218   gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1219
1220   gtk_tree_path_free (path);
1221
1222   validate_tree ((GtkTreeStore*)tree_store);
1223 }
1224
1225 /**
1226  * gtk_tree_store_insert_after:
1227  * @tree_store: A #GtkTreeStore
1228  * @iter: An unset #GtkTreeIter to set to the new row
1229  * @parent: A valid #GtkTreeIter, or %NULL
1230  * @sibling: A valid #GtkTreeIter, or %NULL
1231  *
1232  * Inserts a new row after @sibling.  If @sibling is %NULL, then the row will be
1233  * prepended to @parent 's children.  If @parent and @sibling are %NULL, then
1234  * the row will be prepended to the toplevel.  If both @sibling and @parent are
1235  * set, then @parent must be the parent of @sibling.  When @sibling is set,
1236  * @parent is optional.
1237  *
1238  * @iter will be changed to point to this new row.  The row will be empty after
1239  * this function is called.  To fill in values, you need to call
1240  * gtk_tree_store_set() or gtk_tree_store_set_value().
1241  *
1242  **/
1243 void
1244 gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1245                              GtkTreeIter  *iter,
1246                              GtkTreeIter  *parent,
1247                              GtkTreeIter  *sibling)
1248 {
1249   GtkTreePath *path;
1250   GNode *parent_node;
1251   GNode *new_node;
1252
1253   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1254   g_return_if_fail (iter != NULL);
1255   if (parent != NULL)
1256     g_return_if_fail (VALID_ITER (parent, tree_store));
1257   if (sibling != NULL)
1258     g_return_if_fail (VALID_ITER (sibling, tree_store));
1259
1260   tree_store->columns_dirty = TRUE;
1261
1262   new_node = g_node_new (NULL);
1263
1264   if (parent == NULL && sibling == NULL)
1265     parent_node = tree_store->root;
1266   else if (parent == NULL)
1267     parent_node = G_NODE (sibling->user_data)->parent;
1268   else if (sibling == NULL)
1269     parent_node = G_NODE (parent->user_data);
1270   else
1271     {
1272       g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1273                         G_NODE (parent->user_data));
1274       parent_node = G_NODE (parent->user_data);
1275     }
1276
1277
1278   g_node_insert_after (parent_node,
1279                        sibling ? G_NODE (sibling->user_data) : NULL,
1280                        new_node);
1281
1282   iter->stamp = tree_store->stamp;
1283   iter->user_data = new_node;
1284
1285   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1286   gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1287
1288   gtk_tree_path_free (path);
1289
1290   validate_tree ((GtkTreeStore*)tree_store);
1291 }
1292
1293 /**
1294  * gtk_tree_store_prepend:
1295  * @tree_store: A #GtkTreeStore
1296  * @iter: An unset #GtkTreeIter to set to the prepended row
1297  * @parent: A valid #GtkTreeIter, or %NULL
1298  *
1299  * Prepends a new row to @tree_store.  If @parent is non-%NULL, then it will prepend
1300  * the new row before the first child of @parent, otherwise it will prepend a row
1301  * to the top level.  @iter will be changed to point to this new row.  The row
1302  * will be empty after this function is called.  To fill in values, you need to
1303  * call gtk_tree_store_set() or gtk_tree_store_set_value().
1304  **/
1305 void
1306 gtk_tree_store_prepend (GtkTreeStore *tree_store,
1307                         GtkTreeIter  *iter,
1308                         GtkTreeIter  *parent)
1309 {
1310   GNode *parent_node;
1311
1312   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1313   g_return_if_fail (iter != NULL);
1314   if (parent != NULL)
1315     g_return_if_fail (VALID_ITER (parent, tree_store));
1316
1317   tree_store->columns_dirty = TRUE;
1318
1319   if (parent == NULL)
1320     parent_node = tree_store->root;
1321   else
1322     parent_node = parent->user_data;
1323
1324   if (parent_node->children == NULL)
1325     {
1326       GtkTreePath *path;
1327
1328       iter->stamp = tree_store->stamp;
1329       iter->user_data = g_node_new (NULL);
1330
1331       g_node_prepend (parent_node, G_NODE (iter->user_data));
1332
1333       path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1334       gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1335
1336       if (parent_node != tree_store->root)
1337         {
1338           gtk_tree_path_up (path);
1339           gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1340         }
1341       gtk_tree_path_free (path);
1342     }
1343   else
1344     {
1345       gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1346     }
1347
1348   validate_tree ((GtkTreeStore*)tree_store);
1349 }
1350
1351 /**
1352  * gtk_tree_store_append:
1353  * @tree_store: A #GtkTreeStore
1354  * @iter: An unset #GtkTreeIter to set to the appended row
1355  * @parent: A valid #GtkTreeIter, or %NULL
1356  *
1357  * Appends a new row to @tree_store.  If @parent is non-%NULL, then it will append the
1358  * new row after the last child of @parent, otherwise it will append a row to
1359  * the top level.  @iter will be changed to point to this new row.  The row will
1360  * be empty after this function is called.  To fill in values, you need to call
1361  * gtk_tree_store_set() or gtk_tree_store_set_value().
1362  **/
1363 void
1364 gtk_tree_store_append (GtkTreeStore *tree_store,
1365                        GtkTreeIter  *iter,
1366                        GtkTreeIter  *parent)
1367 {
1368   GNode *parent_node;
1369
1370   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1371   g_return_if_fail (iter != NULL);
1372
1373   if (parent != NULL)
1374     g_return_if_fail (VALID_ITER (parent, tree_store));
1375
1376   if (parent == NULL)
1377     parent_node = tree_store->root;
1378   else
1379     parent_node = parent->user_data;
1380
1381   tree_store->columns_dirty = TRUE;
1382
1383   if (parent_node->children == NULL)
1384     {
1385       GtkTreePath *path;
1386
1387       iter->stamp = tree_store->stamp;
1388       iter->user_data = g_node_new (NULL);
1389
1390       g_node_append (parent_node, G_NODE (iter->user_data));
1391
1392       path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1393       gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1394
1395       if (parent_node != tree_store->root)
1396         {
1397           gtk_tree_path_up (path);
1398           gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1399         }
1400       gtk_tree_path_free (path);
1401     }
1402   else
1403     {
1404       gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1405     }
1406
1407   validate_tree ((GtkTreeStore*)tree_store);
1408 }
1409
1410 /**
1411  * gtk_tree_store_is_ancestor:
1412  * @tree_store: A #GtkTreeStore
1413  * @iter: A valid #GtkTreeIter
1414  * @descendant: A valid #GtkTreeIter
1415  *
1416  * Returns %TRUE if @iter is an ancestor of @descendant.  That is, @iter is the
1417  * parent (or grandparent or great-grandparent) of @descendant.
1418  *
1419  * Return value: %TRUE, if @iter is an ancestor of @descendant
1420  **/
1421 gboolean
1422 gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1423                             GtkTreeIter  *iter,
1424                             GtkTreeIter  *descendant)
1425 {
1426   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1427   g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1428   g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1429
1430   return g_node_is_ancestor (G_NODE (iter->user_data),
1431                              G_NODE (descendant->user_data));
1432 }
1433
1434
1435 /**
1436  * gtk_tree_store_iter_depth:
1437  * @tree_store: A #GtkTreeStore
1438  * @iter: A valid #GtkTreeIter
1439  *
1440  * Returns the depth of @iter.  This will be 0 for anything on the root level, 1
1441  * for anything down a level, etc.
1442  *
1443  * Return value: The depth of @iter
1444  **/
1445 gint
1446 gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1447                            GtkTreeIter  *iter)
1448 {
1449   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1450   g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1451
1452   return g_node_depth (G_NODE (iter->user_data)) - 2;
1453 }
1454
1455 /* simple ripoff from g_node_traverse_post_order */
1456 static gboolean
1457 gtk_tree_store_clear_traverse (GNode *node,
1458                                GtkTreeStore *store)
1459 {
1460   GtkTreeIter iter;
1461
1462   if (node->children)
1463     {
1464       GNode *child;
1465
1466       child = node->children;
1467       while (child)
1468         {
1469           register GNode *current;
1470
1471           current = child;
1472           child = current->next;
1473           if (gtk_tree_store_clear_traverse (current, store))
1474             return TRUE;
1475         }
1476
1477       if (node->parent)
1478         {
1479           iter.stamp = store->stamp;
1480           iter.user_data = node;
1481
1482           gtk_tree_store_remove (store, &iter);
1483         }
1484     }
1485   else if (node->parent)
1486     {
1487       iter.stamp = store->stamp;
1488       iter.user_data = node;
1489
1490       gtk_tree_store_remove (store, &iter);
1491     }
1492
1493   return FALSE;
1494 }
1495
1496 /**
1497  * gtk_tree_store_clear:
1498  * @tree_store: a #GtkTreeStore
1499  *
1500  * Removes all rows from @tree_store
1501  **/
1502 void
1503 gtk_tree_store_clear (GtkTreeStore *tree_store)
1504 {
1505   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1506
1507   gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1508 }
1509
1510 static gboolean
1511 gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1512                                      GNode       *first)
1513 {
1514   GNode *node;
1515
1516   node = first;
1517
1518   do
1519     {
1520       if (node == iter->user_data)
1521         return TRUE;
1522
1523       if (node->children)
1524         if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1525           return TRUE;
1526
1527       node = node->next;
1528     }
1529   while (node);
1530
1531   return FALSE;
1532 }
1533
1534 /**
1535  * gtk_tree_store_iter_is_valid:
1536  * @tree_store: A #GtkTreeStore.
1537  * @iter: A #GtkTreeIter.
1538  *
1539  * WARNING: This function is slow. Only use it for debugging and/or testing
1540  * purposes.
1541  *
1542  * Checks if the given iter is a valid iter for this #GtkTreeStore.
1543  *
1544  * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1545  **/
1546 gboolean
1547 gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1548                               GtkTreeIter  *iter)
1549 {
1550   g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1551   g_return_val_if_fail (iter != NULL, FALSE);
1552
1553   if (!VALID_ITER (iter, tree_store))
1554     return FALSE;
1555
1556   return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1557 }
1558
1559 /* DND */
1560
1561
1562 static gboolean
1563 gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1564                                  GtkTreePath       *path)
1565 {
1566   GtkTreeIter iter;
1567
1568   g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1569
1570   if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1571                                &iter,
1572                                path))
1573     {
1574       gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1575                              &iter);
1576       return TRUE;
1577     }
1578   else
1579     {
1580       return FALSE;
1581     }
1582 }
1583
1584 static gboolean
1585 gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1586                               GtkTreePath       *path,
1587                               GtkSelectionData  *selection_data)
1588 {
1589   g_return_val_if_fail (GTK_IS_TREE_STORE (drag_source), FALSE);
1590
1591   /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1592    * target, because the default handler does it for us, but
1593    * we do anyway for the convenience of someone maybe overriding the
1594    * default handler.
1595    */
1596
1597   if (gtk_tree_set_row_drag_data (selection_data,
1598                                   GTK_TREE_MODEL (drag_source),
1599                                   path))
1600     {
1601       return TRUE;
1602     }
1603   else
1604     {
1605       /* FIXME handle text targets at least. */
1606     }
1607
1608   return FALSE;
1609 }
1610
1611 static void
1612 copy_node_data (GtkTreeStore *tree_store,
1613                 GtkTreeIter  *src_iter,
1614                 GtkTreeIter  *dest_iter)
1615 {
1616   GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1617   GtkTreeDataList *copy_head = NULL;
1618   GtkTreeDataList *copy_prev = NULL;
1619   GtkTreeDataList *copy_iter = NULL;
1620   GtkTreePath *path;
1621   gint col;
1622
1623   col = 0;
1624   while (dl)
1625     {
1626       copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1627
1628       if (copy_head == NULL)
1629         copy_head = copy_iter;
1630
1631       if (copy_prev)
1632         copy_prev->next = copy_iter;
1633
1634       copy_prev = copy_iter;
1635
1636       dl = dl->next;
1637       ++col;
1638     }
1639
1640   G_NODE (dest_iter->user_data)->data = copy_head;
1641
1642   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1643   gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1644   gtk_tree_path_free (path);
1645 }
1646
1647 static void
1648 recursive_node_copy (GtkTreeStore *tree_store,
1649                      GtkTreeIter  *src_iter,
1650                      GtkTreeIter  *dest_iter)
1651 {
1652   GtkTreeIter child;
1653   GtkTreeModel *model;
1654
1655   model = GTK_TREE_MODEL (tree_store);
1656
1657   copy_node_data (tree_store, src_iter, dest_iter);
1658
1659   if (gtk_tree_model_iter_children (model,
1660                                     &child,
1661                                     src_iter))
1662     {
1663       /* Need to create children and recurse. Note our
1664        * dependence on persistent iterators here.
1665        */
1666       do
1667         {
1668           GtkTreeIter copy;
1669
1670           /* Gee, a really slow algorithm... ;-) FIXME */
1671           gtk_tree_store_append (tree_store,
1672                                  &copy,
1673                                  dest_iter);
1674
1675           recursive_node_copy (tree_store, &child, &copy);
1676         }
1677       while (gtk_tree_model_iter_next (model, &child));
1678     }
1679 }
1680
1681 static gboolean
1682 gtk_tree_store_drag_data_received (GtkTreeDragDest   *drag_dest,
1683                                    GtkTreePath       *dest,
1684                                    GtkSelectionData  *selection_data)
1685 {
1686   GtkTreeModel *tree_model;
1687   GtkTreeStore *tree_store;
1688   GtkTreeModel *src_model = NULL;
1689   GtkTreePath *src_path = NULL;
1690   gboolean retval = FALSE;
1691
1692   g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1693
1694   tree_model = GTK_TREE_MODEL (drag_dest);
1695   tree_store = GTK_TREE_STORE (drag_dest);
1696
1697   validate_tree (tree_store);
1698
1699   if (gtk_tree_get_row_drag_data (selection_data,
1700                                   &src_model,
1701                                   &src_path) &&
1702       src_model == tree_model)
1703     {
1704       /* Copy the given row to a new position */
1705       GtkTreeIter src_iter;
1706       GtkTreeIter dest_iter;
1707       GtkTreePath *prev;
1708
1709       if (!gtk_tree_model_get_iter (src_model,
1710                                     &src_iter,
1711                                     src_path))
1712         {
1713           goto out;
1714         }
1715
1716       /* Get the path to insert _after_ (dest is the path to insert _before_) */
1717       prev = gtk_tree_path_copy (dest);
1718
1719       if (!gtk_tree_path_prev (prev))
1720         {
1721           GtkTreeIter dest_parent;
1722           GtkTreePath *parent;
1723           GtkTreeIter *dest_parent_p;
1724
1725           /* dest was the first spot at the current depth; which means
1726            * we are supposed to prepend.
1727            */
1728
1729           /* Get the parent, NULL if parent is the root */
1730           dest_parent_p = NULL;
1731           parent = gtk_tree_path_copy (dest);
1732           if (gtk_tree_path_up (parent) &&
1733               gtk_tree_path_get_depth (parent) > 0)
1734             {
1735               gtk_tree_model_get_iter (tree_model,
1736                                        &dest_parent,
1737                                        parent);
1738               dest_parent_p = &dest_parent;
1739             }
1740           gtk_tree_path_free (parent);
1741           parent = NULL;
1742
1743           gtk_tree_store_prepend (GTK_TREE_STORE (tree_model),
1744                                   &dest_iter,
1745                                   dest_parent_p);
1746
1747           retval = TRUE;
1748         }
1749       else
1750         {
1751           if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model),
1752                                        &dest_iter,
1753                                        prev))
1754             {
1755               GtkTreeIter tmp_iter = dest_iter;
1756
1757               if (GPOINTER_TO_INT (g_object_get_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append")))
1758                 {
1759                   GtkTreeIter parent;
1760
1761                   if (gtk_tree_model_iter_parent (GTK_TREE_MODEL (tree_model), &parent, &tmp_iter))
1762                     gtk_tree_store_append (GTK_TREE_STORE (tree_model),
1763                                            &dest_iter, &parent);
1764                   else
1765                     gtk_tree_store_append (GTK_TREE_STORE (tree_model),
1766                                            &dest_iter, NULL);
1767                 }
1768               else
1769                 gtk_tree_store_insert_after (GTK_TREE_STORE (tree_model),
1770                                              &dest_iter,
1771                                              NULL,
1772                                              &tmp_iter);
1773               retval = TRUE;
1774
1775             }
1776         }
1777
1778       g_object_set_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append",
1779                          NULL);
1780
1781       gtk_tree_path_free (prev);
1782
1783       /* If we succeeded in creating dest_iter, walk src_iter tree branch,
1784        * duplicating it below dest_iter.
1785        */
1786
1787       if (retval)
1788         {
1789           recursive_node_copy (tree_store,
1790                                &src_iter,
1791                                &dest_iter);
1792         }
1793     }
1794   else
1795     {
1796       /* FIXME maybe add some data targets eventually, or handle text
1797        * targets in the simple case.
1798        */
1799
1800     }
1801
1802  out:
1803
1804   if (src_path)
1805     gtk_tree_path_free (src_path);
1806
1807   return retval;
1808 }
1809
1810 static gboolean
1811 gtk_tree_store_row_drop_possible (GtkTreeDragDest  *drag_dest,
1812                                   GtkTreePath      *dest_path,
1813                                   GtkSelectionData *selection_data)
1814 {
1815   GtkTreeModel *src_model = NULL;
1816   GtkTreePath *src_path = NULL;
1817   GtkTreePath *tmp = NULL;
1818   gboolean retval = FALSE;
1819
1820   g_return_val_if_fail (GTK_IS_TREE_STORE (drag_dest), FALSE);
1821
1822   /* don't accept drops if the tree has been sorted */
1823   if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1824     return FALSE;
1825
1826   if (!gtk_tree_get_row_drag_data (selection_data,
1827                                    &src_model,
1828                                    &src_path))
1829     goto out;
1830
1831   /* can only drag to ourselves */
1832   if (src_model != GTK_TREE_MODEL (drag_dest))
1833     goto out;
1834
1835   /* Can't drop into ourself. */
1836   if (gtk_tree_path_is_ancestor (src_path,
1837                                  dest_path))
1838     goto out;
1839
1840   /* Can't drop if dest_path's parent doesn't exist */
1841   {
1842     GtkTreeIter iter;
1843
1844     if (gtk_tree_path_get_depth (dest_path) > 1)
1845       {
1846         tmp = gtk_tree_path_copy (dest_path);
1847         gtk_tree_path_up (tmp);
1848
1849         if (!gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_dest),
1850                                       &iter, tmp))
1851           goto out;
1852       }
1853   }
1854
1855   /* Can otherwise drop anywhere. */
1856   retval = TRUE;
1857
1858  out:
1859
1860   if (src_path)
1861     gtk_tree_path_free (src_path);
1862   if (tmp)
1863     gtk_tree_path_free (tmp);
1864
1865   return retval;
1866 }
1867
1868 /* Sorting and reordering */
1869 typedef struct _SortTuple
1870 {
1871   gint offset;
1872   GNode *node;
1873 } SortTuple;
1874
1875 /* Reordering */
1876 static gint
1877 gtk_tree_store_reorder_func (gconstpointer a,
1878                              gconstpointer b,
1879                              gpointer      user_data)
1880 {
1881   SortTuple *a_reorder;
1882   SortTuple *b_reorder;
1883
1884   a_reorder = (SortTuple *)a;
1885   b_reorder = (SortTuple *)b;
1886
1887   if (a_reorder->offset < b_reorder->offset)
1888     return -1;
1889   if (a_reorder->offset > b_reorder->offset)
1890     return 1;
1891
1892   return 0;
1893 }
1894
1895 /**
1896  * gtk_tree_store_reorder:
1897  * @tree_store: A #GtkTreeStore.
1898  * @parent: A #GtkTreeIter.
1899  * @new_order: An integer array indication the new order for the list.
1900  *
1901  * Reorders the children of @parent in @tree_store to follow the order
1902  * indicated by @new_order. Note that this function only works with
1903  * unsorted stores.
1904  **/
1905 void
1906 gtk_tree_store_reorder (GtkTreeStore *tree_store,
1907                         GtkTreeIter  *parent,
1908                         gint         *new_order)
1909 {
1910   gint i, length = 0;
1911   GNode *level, *node;
1912   GtkTreePath *path;
1913   SortTuple *sort_array;
1914
1915   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1916   g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
1917   g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
1918   g_return_if_fail (new_order != NULL);
1919
1920   if (!parent)
1921     level = G_NODE (tree_store->root)->children;
1922   else
1923     level = G_NODE (parent->user_data)->children;
1924
1925   /* count nodes */
1926   node = level;
1927   while (node)
1928     {
1929       length++;
1930       node = node->next;
1931     }
1932
1933   /* set up sortarray */
1934   sort_array = g_new (SortTuple, length);
1935
1936   node = level;
1937   for (i = 0; i < length; i++)
1938     {
1939       sort_array[i].offset = new_order[i];
1940       sort_array[i].node = node;
1941
1942       node = node->next;
1943     }
1944
1945   g_qsort_with_data (sort_array,
1946                      length,
1947                      sizeof (SortTuple),
1948                      gtk_tree_store_reorder_func,
1949                      NULL);
1950
1951   /* fix up level */
1952   for (i = 0; i < length - 1; i++)
1953     {
1954       sort_array[i].node->next = sort_array[i+1].node;
1955       sort_array[i+1].node->prev = sort_array[i].node;
1956     }
1957
1958   sort_array[length-1].node->next = NULL;
1959   sort_array[0].node->prev = NULL;
1960   if (parent)
1961     G_NODE (parent->user_data)->children = sort_array[0].node;
1962   else
1963     G_NODE (tree_store->root)->children = sort_array[0].node;
1964
1965   /* emit signal */
1966   if (parent)
1967     path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), parent);
1968   else
1969     path = gtk_tree_path_new ();
1970   gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
1971                                  parent, new_order);
1972   gtk_tree_path_free (path);
1973   g_free (sort_array);
1974 }
1975
1976 /**
1977  * gtk_tree_store_swap:
1978  * @tree_store: A #GtkTreeStore.
1979  * @a: A #GtkTreeIter.
1980  * @b: Another #GtkTreeIter.
1981  *
1982  * Swaps @a and @b in the same level of @tree_store. Note that this function
1983  * only works with unsorted stores.
1984  **/
1985 void
1986 gtk_tree_store_swap (GtkTreeStore *tree_store,
1987                      GtkTreeIter  *a,
1988                      GtkTreeIter  *b)
1989 {
1990   GNode *tmp, *node_a, *node_b, *parent_node;
1991   GNode *a_prev, *a_next, *b_prev, *b_next;
1992   gint i, a_count, b_count, length, *order;
1993   GtkTreePath *path_a, *path_b;
1994   GtkTreeIter parent;
1995
1996   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1997   g_return_if_fail (VALID_ITER (a, tree_store));
1998   g_return_if_fail (VALID_ITER (b, tree_store));
1999
2000   node_a = G_NODE (a->user_data);
2001   node_b = G_NODE (b->user_data);
2002
2003   /* basic sanity checking */
2004   if (node_a == node_b)
2005     return;
2006
2007   path_a = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), a);
2008   path_b = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), b);
2009
2010   g_return_if_fail (path_a && path_b);
2011
2012   gtk_tree_path_up (path_a);
2013   gtk_tree_path_up (path_b);
2014
2015   if (gtk_tree_path_compare (path_a, path_b))
2016     {
2017       gtk_tree_path_free (path_a);
2018       gtk_tree_path_free (path_b);
2019
2020       g_warning ("Given childs are not in the same level\n");
2021       return;
2022     }
2023
2024   gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent, path_a);
2025   parent_node = G_NODE (parent.user_data);
2026
2027   gtk_tree_path_free (path_b);
2028
2029   /* old links which we have to keep around */
2030   a_prev = node_a->prev;
2031   a_next = node_a->next;
2032
2033   b_prev = node_b->prev;
2034   b_next = node_b->next;
2035
2036   /* fix up links if the nodes are next to eachother */
2037   if (a_prev == node_b)
2038     a_prev = node_a;
2039   if (a_next == node_b)
2040     a_next = node_a;
2041
2042   if (b_prev == node_a)
2043     b_prev = node_b;
2044   if (b_next == node_a)
2045     b_next = node_b;
2046
2047   /* counting nodes */
2048   tmp = parent_node->children;
2049   i = a_count = b_count = 0;
2050   while (tmp)
2051     {
2052       if (tmp == node_a)
2053         a_count = i;
2054       if (tmp == node_b)
2055         b_count = i;
2056
2057       tmp = tmp->next;
2058       i++;
2059     }
2060   length = i;
2061
2062   /* hacking the tree */
2063   if (!a_prev)
2064     parent_node->children = node_b;
2065   else
2066     a_prev->next = node_b;
2067
2068   if (a_next)
2069     a_next->prev = node_b;
2070
2071   if (!b_prev)
2072     parent_node->children = node_a;
2073   else
2074     b_prev->next = node_a;
2075
2076   if (b_next)
2077     b_next->prev = node_a;
2078
2079   node_a->prev = b_prev;
2080   node_a->next = b_next;
2081
2082   node_b->prev = a_prev;
2083   node_b->next = a_next;
2084
2085   /* emit signal */
2086   order = g_new (gint, length);
2087   for (i = 0; i < length; i++)
2088     if (i == a_count)
2089       order[i] = b_count;
2090     else if (i == b_count)
2091       order[i] = a_count;
2092     else
2093       order[i] = i;
2094
2095   gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2096                                  &parent, order);
2097   gtk_tree_path_free (path_a);
2098   g_free (order);
2099 }
2100
2101 /* WARNING: this function is *incredibly* fragily. Please smashtest after
2102  * making changes here.
2103  *      -Kris
2104  */
2105 static void
2106 gtk_tree_store_move (GtkTreeStore *tree_store,
2107                      GtkTreeIter  *iter,
2108                      GtkTreeIter  *position,
2109                      gboolean      before)
2110 {
2111   GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2112   gint old_pos, new_pos, length, i, *order;
2113   GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2114   GtkTreeIter parent_iter, dst_a, dst_b;
2115   gint depth = 0;
2116   gboolean handle_b = TRUE;
2117
2118   g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2119   g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2120   g_return_if_fail (VALID_ITER (iter, tree_store));
2121   if (position)
2122     g_return_if_fail (VALID_ITER (position, tree_store));
2123
2124   a = b = NULL;
2125
2126   /* sanity checks */
2127   if (position)
2128     {
2129       path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2130       pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store),
2131                                           position);
2132
2133       /* if before:
2134        *   moving the iter before path or "path + 1" doesn't make sense
2135        * else
2136        *   moving the iter before path or "path - 1" doesn't make sense
2137        */
2138       if (!gtk_tree_path_compare (path, pos_path))
2139         goto free_paths_and_out;
2140
2141       if (before)
2142         gtk_tree_path_next (path);
2143       else
2144         gtk_tree_path_prev (path);
2145
2146       if (!gtk_tree_path_compare (path, pos_path))
2147         goto free_paths_and_out;
2148
2149       if (before)
2150         gtk_tree_path_prev (path);
2151       else
2152         gtk_tree_path_next (path);
2153
2154       if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2155         {
2156           g_warning ("Given childs are not in the same level\n");
2157
2158           goto free_paths_and_out;
2159         }
2160
2161       tmppath = gtk_tree_path_copy (pos_path);
2162       gtk_tree_path_up (path);
2163       gtk_tree_path_up (tmppath);
2164
2165       if (gtk_tree_path_get_depth (path) > 0 &&
2166           gtk_tree_path_compare (path, tmppath))
2167         {
2168           g_warning ("Given childs are not in the same level\n");
2169
2170           gtk_tree_path_free (tmppath);
2171           goto free_paths_and_out;
2172         }
2173
2174       gtk_tree_path_free (tmppath);
2175     }
2176
2177   if (!path)
2178     {
2179       path = gtk_tree_model_get_path (GTK_TREE_MODEL (tree_store), iter);
2180       gtk_tree_path_up (path);
2181     }
2182
2183   depth = gtk_tree_path_get_depth (path);
2184
2185   if (depth)
2186     {
2187       gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &parent_iter, path);
2188       gtk_tree_path_free (path);
2189
2190       parent = G_NODE (parent_iter.user_data);
2191     }
2192   else
2193     parent = G_NODE (tree_store->root);
2194
2195   /* yes, I know that this can be done shorter, but I'm doing it this way
2196    * so the code is also maintainable
2197    */
2198
2199   if (before && position)
2200     {
2201       b = G_NODE (position->user_data);
2202
2203       if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2204         {
2205           gtk_tree_path_prev (pos_path);
2206           if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_a, pos_path))
2207             a = G_NODE (dst_a.user_data);
2208           else
2209             a = NULL;
2210           gtk_tree_path_next (pos_path);
2211         }
2212
2213       /* if b is NULL, a is NULL too -- we are at the beginning of the list
2214        * yes and we leak memory here ...
2215        */
2216       g_return_if_fail (b);
2217     }
2218   else if (before && !position)
2219     {
2220       /* move before without position is appending */
2221       a = NULL;
2222       b = NULL;
2223     }
2224   else /* !before */
2225     {
2226       if (position)
2227         a = G_NODE (position->user_data);
2228       else
2229         a = NULL;
2230
2231       if (position)
2232         {
2233           gtk_tree_path_next (pos_path);
2234           if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2235              b = G_NODE (dst_b.user_data);
2236           else
2237              b = NULL;
2238           gtk_tree_path_prev (pos_path);
2239         }
2240       else
2241         {
2242           /* move after without position is prepending */
2243           if (depth)
2244             gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2245                                           &parent_iter);
2246           else
2247             gtk_tree_model_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2248                                           NULL);
2249
2250           b = G_NODE (dst_b.user_data);
2251         }
2252
2253       /* if a is NULL, a is NULL too -- we are at the end of the list
2254        * yes and we leak memory here ...
2255        */
2256       if (position)
2257         g_return_if_fail (a);
2258     }
2259
2260   /* counting nodes */
2261   tmp = parent->children;
2262
2263   length = old_pos = 0;
2264   while (tmp)
2265     {
2266       if (tmp == iter->user_data)
2267         old_pos = length;
2268
2269       tmp = tmp->next;
2270       length++;
2271     }
2272
2273   /* remove node from list */
2274   node = G_NODE (iter->user_data);
2275   tmp_a = node->prev;
2276   tmp_b = node->next;
2277
2278   if (tmp_a)
2279     tmp_a->next = tmp_b;
2280   else
2281     parent->children = tmp_b;
2282
2283   if (tmp_b)
2284     tmp_b->prev = tmp_a;
2285
2286   /* and reinsert the node */
2287   if (a)
2288     {
2289       tmp = a->next;
2290
2291       a->next = node;
2292       node->next = tmp;
2293       node->prev = a;
2294     }
2295   else if (!a && !before)
2296     {
2297       tmp = parent->children;
2298
2299       node->prev = NULL;
2300       parent->children = node;
2301
2302       node->next = tmp;
2303       tmp->prev = node;
2304
2305       handle_b = FALSE;
2306     }
2307   else if (!a && before)
2308     {
2309       if (!position)
2310         {
2311           node->parent = NULL;
2312           node->next = node->prev = NULL;
2313
2314           /* before with sibling = NULL appends */
2315           g_node_insert_before (parent, NULL, node);
2316         }
2317       else
2318         {
2319           node->parent = NULL;
2320           node->next = node->prev = NULL;
2321
2322           /* after with sibling = NULL prepends */
2323           g_node_insert_after (parent, NULL, node);
2324         }
2325     }
2326
2327   if (handle_b)
2328     {
2329       if (b)
2330         {
2331           tmp = b->prev;
2332
2333           b->prev = node;
2334           node->prev = tmp;
2335           node->next = b;
2336         }
2337       else if (!(!a && before)) /* !a && before is completely handled above */
2338         node->next = NULL;
2339     }
2340
2341   /* emit signal */
2342   if (position)
2343     new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2344   else if (before)
2345     {
2346       if (depth)
2347         new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2348                                                   &parent_iter) - 1;
2349       else
2350         new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (tree_store),
2351                                                   NULL) - 1;
2352     }
2353   else
2354     new_pos = 0;
2355
2356   if (new_pos > old_pos)
2357     {
2358       if (before && position)
2359         new_pos--;
2360     }
2361   else
2362     {
2363       if (!before && position)
2364         new_pos++;
2365     }
2366
2367   order = g_new (gint, length);
2368   if (new_pos > old_pos)
2369     {
2370       for (i = 0; i < length; i++)
2371         if (i < old_pos)
2372           order[i] = i;
2373         else if (i >= old_pos && i < new_pos)
2374           order[i] = i + 1;
2375         else if (i == new_pos)
2376           order[i] = old_pos;
2377         else
2378           order[i] = i;
2379     }
2380   else
2381     {
2382       for (i = 0; i < length; i++)
2383         if (i == new_pos)
2384           order[i] = old_pos;
2385         else if (i > new_pos && i <= old_pos)
2386           order[i] = i - 1;
2387         else
2388           order[i] = i;
2389     }
2390
2391   path = gtk_tree_path_new ();
2392   gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2393                                  path, NULL, order);
2394
2395   for (i = 0; i < length; i++)
2396     g_print ("%2d ", order[i]);
2397   g_print ("\n");
2398
2399   gtk_tree_path_free (path);
2400   if (position)
2401     gtk_tree_path_free (pos_path);
2402   g_free (order);
2403
2404   return;
2405
2406 free_paths_and_out:
2407   gtk_tree_path_free (path);
2408   gtk_tree_path_free (pos_path);
2409 }
2410
2411 /**
2412  * gtk_tree_store_move_before:
2413  * @tree_store: A #GtkTreeStore.
2414  * @iter: A #GtkTreeIter.
2415  * @position: A #GtkTreeIter or %NULL.
2416  *
2417  * Moves @iter in @tree_store to the position before @position. @iter and
2418  * @position should be in the same level. Note that this function only
2419  * works with unsorted stores. If @position is %NULL, @iter will be
2420  * moved to the end of the level.
2421  **/
2422 void
2423 gtk_tree_store_move_before (GtkTreeStore *tree_store,
2424                             GtkTreeIter  *iter,
2425                             GtkTreeIter  *position)
2426 {
2427   gtk_tree_store_move (tree_store, iter, position, TRUE);
2428 }
2429
2430 /**
2431  * gtk_tree_store_move_after:
2432  * @tree_store: A #GtkTreeStore.
2433  * @iter: A #GtkTreeIter.
2434  * @position: A #GtkTreeIter.
2435  *
2436  * Moves @iter in @tree_store to the position after @position. @iter and
2437  * @position should be in the same level. Note that this function only
2438  * works with unsorted stores. If @position is %NULL, @iter will be moved
2439  * to the start of the level.
2440  **/
2441 void
2442 gtk_tree_store_move_after (GtkTreeStore *tree_store,
2443                            GtkTreeIter  *iter,
2444                            GtkTreeIter  *position)
2445 {
2446   gtk_tree_store_move (tree_store, iter, position, FALSE);
2447 }
2448
2449 /* Sorting */
2450 static gint
2451 gtk_tree_store_compare_func (gconstpointer a,
2452                              gconstpointer b,
2453                              gpointer      user_data)
2454 {
2455   GtkTreeStore *tree_store = user_data;
2456   GNode *node_a;
2457   GNode *node_b;
2458   GtkTreeIterCompareFunc func;
2459   gpointer data;
2460
2461   GtkTreeIter iter_a;
2462   GtkTreeIter iter_b;
2463   gint retval;
2464
2465   if (tree_store->sort_column_id != -1)
2466     {
2467       GtkTreeDataSortHeader *header;
2468
2469       header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2470                                                tree_store->sort_column_id);
2471       g_return_val_if_fail (header != NULL, 0);
2472       g_return_val_if_fail (header->func != NULL, 0);
2473
2474       func = header->func;
2475       data = header->data;
2476     }
2477   else
2478     {
2479       g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2480       func = tree_store->default_sort_func;
2481       data = tree_store->default_sort_data;
2482     }
2483
2484   node_a = ((SortTuple *) a)->node;
2485   node_b = ((SortTuple *) b)->node;
2486
2487   iter_a.stamp = tree_store->stamp;
2488   iter_a.user_data = node_a;
2489   iter_b.stamp = tree_store->stamp;
2490   iter_b.user_data = node_b;
2491
2492   retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2493
2494   if (tree_store->order == GTK_SORT_DESCENDING)
2495     {
2496       if (retval > 0)
2497         retval = -1;
2498       else if (retval < 0)
2499         retval = 1;
2500     }
2501   return retval;
2502 }
2503
2504 static void
2505 gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2506                             GNode        *parent,
2507                             gboolean      recurse)
2508 {
2509   GtkTreeIter iter;
2510   GArray *sort_array;
2511   GNode *node;
2512   GNode *tmp_node;
2513   gint list_length;
2514   gint i;
2515   gint *new_order;
2516   GtkTreePath *path;
2517
2518   node = parent->children;
2519   if (node == NULL || node->next == NULL)
2520     return;
2521
2522   g_assert (GTK_TREE_STORE_IS_SORTED (tree_store));
2523
2524   list_length = 0;
2525   for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2526     list_length++;
2527
2528   sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2529
2530   i = 0;
2531   for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2532     {
2533       SortTuple tuple;
2534
2535       tuple.offset = i;
2536       tuple.node = tmp_node;
2537       g_array_append_val (sort_array, tuple);
2538       i++;
2539     }
2540
2541   /* Sort the array */
2542   g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2543
2544   for (i = 0; i < list_length - 1; i++)
2545     {
2546       g_array_index (sort_array, SortTuple, i).node->next =
2547         g_array_index (sort_array, SortTuple, i + 1).node;
2548       g_array_index (sort_array, SortTuple, i + 1).node->prev =
2549         g_array_index (sort_array, SortTuple, i).node;
2550     }
2551   g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2552   g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2553   parent->children = g_array_index (sort_array, SortTuple, 0).node;
2554
2555   /* Let the world know about our new order */
2556   new_order = g_new (gint, list_length);
2557   for (i = 0; i < list_length; i++)
2558     new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2559
2560   iter.stamp = tree_store->stamp;
2561   iter.user_data = parent;
2562   path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2563   gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2564                                  path, &iter, new_order);
2565   gtk_tree_path_free (path);
2566   g_free (new_order);
2567   g_array_free (sort_array, TRUE);
2568
2569   if (recurse)
2570     {
2571       for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2572         {
2573           if (tmp_node->children)
2574             gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2575         }
2576     }
2577 }
2578
2579 static void
2580 gtk_tree_store_sort (GtkTreeStore *tree_store)
2581 {
2582   if (tree_store->sort_column_id != -1)
2583     {
2584       GtkTreeDataSortHeader *header = NULL;
2585
2586       header = _gtk_tree_data_list_get_header (tree_store->sort_list, tree_store->sort_column_id);
2587
2588       /* We want to make sure that we have a function */
2589       g_return_if_fail (header != NULL);
2590       g_return_if_fail (header->func != NULL);
2591     }
2592   else
2593     {
2594       g_return_if_fail (tree_store->default_sort_func != NULL);
2595     }
2596
2597   gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2598 }
2599
2600 static void
2601 gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2602                                   GtkTreeIter  *iter,
2603                                   gint          column)
2604 {
2605   GNode *prev = NULL;
2606   GNode *next = NULL;
2607   GNode *node;
2608   GtkTreePath *tmp_path;
2609   GtkTreeIter tmp_iter;
2610   gint cmp_a = 0;
2611   gint cmp_b = 0;
2612   gint i;
2613   gint old_location;
2614   gint new_location;
2615   gint *new_order;
2616   gint length;
2617   GtkTreeIterCompareFunc func;
2618   gpointer data;
2619
2620   g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2621
2622   tmp_iter.stamp = tree_store->stamp;
2623   if (tree_store->sort_column_id != -1)
2624     {
2625       GtkTreeDataSortHeader *header;
2626       header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2627                                                tree_store->sort_column_id);
2628       g_return_if_fail (header != NULL);
2629       g_return_if_fail (header->func != NULL);
2630       func = header->func;
2631       data = header->data;
2632     }
2633   else
2634     {
2635       g_return_if_fail (tree_store->default_sort_func != NULL);
2636       func = tree_store->default_sort_func;
2637       data = tree_store->default_sort_data;
2638     }
2639
2640   /* If it's the built in function, we don't sort. */
2641   if (func == gtk_tree_data_list_compare_func &&
2642       tree_store->sort_column_id != column)
2643     return;
2644
2645   old_location = 0;
2646   node = G_NODE (iter->user_data)->parent->children;
2647   /* First we find the iter, its prev, and its next */
2648   while (node)
2649     {
2650       if (node == G_NODE (iter->user_data))
2651         break;
2652       old_location++;
2653       node = node->next;
2654     }
2655   g_assert (node != NULL);
2656
2657   prev = node->prev;
2658   next = node->next;
2659
2660   /* Check the common case, where we don't need to sort it moved. */
2661   if (prev != NULL)
2662     {
2663       tmp_iter.user_data = prev;
2664       cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2665     }
2666
2667   if (next != NULL)
2668     {
2669       tmp_iter.user_data = next;
2670       cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2671     }
2672
2673   if (tree_store->order == GTK_SORT_DESCENDING)
2674     {
2675       if (cmp_a < 0)
2676         cmp_a = 1;
2677       else if (cmp_a > 0)
2678         cmp_a = -1;
2679
2680       if (cmp_b < 0)
2681         cmp_b = 1;
2682       else if (cmp_b > 0)
2683         cmp_b = -1;
2684     }
2685
2686   if (prev == NULL && cmp_b <= 0)
2687     return;
2688   else if (next == NULL && cmp_a <= 0)
2689     return;
2690   else if (prev != NULL && next != NULL &&
2691            cmp_a <= 0 && cmp_b <= 0)
2692     return;
2693
2694   /* We actually need to sort it */
2695   /* First, remove the old link. */
2696
2697   if (prev)
2698     prev->next = next;
2699   else
2700     node->parent->children = next;
2701
2702   if (next)
2703     next->prev = prev;
2704
2705   node->prev = NULL;
2706   node->next = NULL;
2707
2708   /* FIXME: as an optimization, we can potentially start at next */
2709   prev = NULL;
2710   node = node->parent->children;
2711   new_location = 0;
2712   tmp_iter.user_data = node;
2713   if (tree_store->order == GTK_SORT_DESCENDING)
2714     cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2715   else
2716     cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2717
2718   while ((node->next) && (cmp_a > 0))
2719     {
2720       prev = node;
2721       node = node->next;
2722       new_location++;
2723       tmp_iter.user_data = node;
2724       if (tree_store->order == GTK_SORT_DESCENDING)
2725         cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2726       else
2727         cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2728     }
2729
2730   if ((!node->next) && (cmp_a > 0))
2731     {
2732       new_location++;
2733       node->next = G_NODE (iter->user_data);
2734       node->next->prev = node;
2735     }
2736   else if (prev)
2737     {
2738       prev->next = G_NODE (iter->user_data);
2739       prev->next->prev = prev;
2740       G_NODE (iter->user_data)->next = node;
2741       G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2742     }
2743   else
2744     {
2745       G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2746       G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2747       G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2748     }
2749
2750   /* Emit the reordered signal. */
2751   length = g_node_n_children (node->parent);
2752   new_order = g_new (int, length);
2753   if (old_location < new_location)
2754     for (i = 0; i < length; i++)
2755       {
2756         if (i < old_location ||
2757             i > new_location)
2758           new_order[i] = i;
2759         else if (i >= old_location &&
2760                  i < new_location)
2761           new_order[i] = i + 1;
2762         else if (i == new_location)
2763           new_order[i] = old_location;
2764       }
2765   else
2766     for (i = 0; i < length; i++)
2767       {
2768         if (i < new_location ||
2769             i > old_location)
2770           new_order[i] = i;
2771         else if (i > new_location &&
2772                  i <= old_location)
2773           new_order[i] = i - 1;
2774         else if (i == new_location)
2775           new_order[i] = old_location;
2776       }
2777
2778   tmp_iter.user_data = node->parent;
2779   tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2780
2781   gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2782                                  tmp_path, &tmp_iter,
2783                                  new_order);
2784
2785   gtk_tree_path_free (tmp_path);
2786   g_free (new_order);
2787 }
2788
2789
2790 static gboolean
2791 gtk_tree_store_get_sort_column_id (GtkTreeSortable  *sortable,
2792                                    gint             *sort_column_id,
2793                                    GtkSortType      *order)
2794 {
2795   GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2796
2797   g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2798
2799   if (tree_store->sort_column_id == -1)
2800     return FALSE;
2801
2802   if (sort_column_id)
2803     * sort_column_id = tree_store->sort_column_id;
2804   if (order)
2805     * order = tree_store->order;
2806   return TRUE;
2807
2808 }
2809
2810 static void
2811 gtk_tree_store_set_sort_column_id (GtkTreeSortable  *sortable,
2812                                    gint              sort_column_id,
2813                                    GtkSortType       order)
2814 {
2815   GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2816
2817   g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2818
2819
2820   if ((tree_store->sort_column_id == sort_column_id) &&
2821       (tree_store->order == order))
2822     return;
2823
2824   if (sort_column_id != -1)
2825     {
2826       GtkTreeDataSortHeader *header = NULL;
2827
2828       header = _gtk_tree_data_list_get_header (tree_store->sort_list, sort_column_id);
2829
2830       /* We want to make sure that we have a function */
2831       g_return_if_fail (header != NULL);
2832       g_return_if_fail (header->func != NULL);
2833     }
2834   else
2835     {
2836       g_return_if_fail (tree_store->default_sort_func != NULL);
2837     }
2838
2839   tree_store->sort_column_id = sort_column_id;
2840   tree_store->order = order;
2841
2842   gtk_tree_store_sort (tree_store);
2843
2844   gtk_tree_sortable_sort_column_changed (sortable);
2845 }
2846
2847 static void
2848 gtk_tree_store_set_sort_func (GtkTreeSortable        *sortable,
2849                               gint                    sort_column_id,
2850                               GtkTreeIterCompareFunc  func,
2851                               gpointer                data,
2852                               GtkDestroyNotify        destroy)
2853 {
2854   GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2855   GtkTreeDataSortHeader *header = NULL;
2856   GList *list;
2857
2858   g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2859   g_return_if_fail (func != NULL);
2860
2861   for (list = tree_store->sort_list; list; list = list->next)
2862     {
2863       GtkTreeDataSortHeader *list_header;
2864
2865       list_header = (GtkTreeDataSortHeader*) list->data;
2866       if (list_header->sort_column_id == sort_column_id)
2867         {
2868           header = list_header;
2869           break;
2870         }
2871     }
2872
2873   if (header == NULL)
2874     {
2875       header = g_new0 (GtkTreeDataSortHeader, 1);
2876       header->sort_column_id = sort_column_id;
2877       tree_store->sort_list = g_list_append (tree_store->sort_list, header);
2878     }
2879
2880   if (header->destroy)
2881     {
2882       GtkDestroyNotify d = header->destroy;
2883
2884       header->destroy = NULL;
2885       d (header->data);
2886     }
2887
2888   header->func = func;
2889   header->data = data;
2890   header->destroy = destroy;
2891 }
2892
2893 static void
2894 gtk_tree_store_set_default_sort_func (GtkTreeSortable        *sortable,
2895                                       GtkTreeIterCompareFunc  func,
2896                                       gpointer                data,
2897                                       GtkDestroyNotify        destroy)
2898 {
2899   GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2900
2901   g_return_if_fail (GTK_IS_TREE_STORE (sortable));
2902
2903   if (tree_store->default_sort_destroy)
2904     {
2905       GtkDestroyNotify d = tree_store->default_sort_destroy;
2906
2907       tree_store->default_sort_destroy = NULL;
2908       d (tree_store->default_sort_data);
2909     }
2910
2911   tree_store->default_sort_func = func;
2912   tree_store->default_sort_data = data;
2913   tree_store->default_sort_destroy = destroy;
2914 }
2915
2916 static gboolean
2917 gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
2918 {
2919   GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
2920
2921   g_return_val_if_fail (GTK_IS_TREE_STORE (sortable), FALSE);
2922
2923   return (tree_store->default_sort_func != NULL);
2924 }
2925
2926 static void
2927 validate_gnode (GNode* node)
2928 {
2929   GNode *iter;
2930
2931   iter = node->children;
2932   while (iter != NULL)
2933     {
2934       g_assert (iter->parent == node);
2935       if (iter->prev)
2936         g_assert (iter->prev->next == iter);
2937       validate_gnode (iter);
2938       iter = iter->next;
2939     }
2940 }
2941
2942
2943