Blame gtk/gtktreestore.c

Packit 98cdb6
/* gtktreestore.c
Packit 98cdb6
 * Copyright (C) 2000  Red Hat, Inc.,  Jonathan Blandford <jrb@redhat.com>
Packit 98cdb6
 *
Packit 98cdb6
 * This library is free software; you can redistribute it and/or
Packit 98cdb6
 * modify it under the terms of the GNU Library General Public
Packit 98cdb6
 * License as published by the Free Software Foundation; either
Packit 98cdb6
 * version 2 of the License, or (at your option) any later version.
Packit 98cdb6
 *
Packit 98cdb6
 * This library is distributed in the hope that it will be useful,
Packit 98cdb6
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Packit 98cdb6
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
Packit 98cdb6
 * Library General Public License for more details.
Packit 98cdb6
 *
Packit 98cdb6
 * You should have received a copy of the GNU Library General Public
Packit 98cdb6
 * License along with this library; if not, write to the
Packit 98cdb6
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Packit 98cdb6
 * Boston, MA 02111-1307, USA.
Packit 98cdb6
 */
Packit 98cdb6
Packit 98cdb6
#include "config.h"
Packit 98cdb6
#include <string.h>
Packit 98cdb6
#include <gobject/gvaluecollector.h>
Packit 98cdb6
#include "gtktreemodel.h"
Packit 98cdb6
#include "gtktreestore.h"
Packit 98cdb6
#include "gtktreedatalist.h"
Packit 98cdb6
#include "gtktreednd.h"
Packit 98cdb6
#include "gtkbuildable.h"
Packit 98cdb6
#include "gtkintl.h"
Packit 98cdb6
#include "gtkalias.h"
Packit 98cdb6
Packit 98cdb6
#define G_NODE(node) ((GNode *)node)
Packit 98cdb6
#define GTK_TREE_STORE_IS_SORTED(tree) (((GtkTreeStore*)(tree))->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
Packit 98cdb6
#define VALID_ITER(iter, tree_store) ((iter)!= NULL && (iter)->user_data != NULL && ((GtkTreeStore*)(tree_store))->stamp == (iter)->stamp)
Packit 98cdb6
Packit 98cdb6
static void         gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
Packit 98cdb6
static void         gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
Packit 98cdb6
static void         gtk_tree_store_drag_dest_init  (GtkTreeDragDestIface   *iface);
Packit 98cdb6
static void         gtk_tree_store_sortable_init   (GtkTreeSortableIface   *iface);
Packit 98cdb6
static void         gtk_tree_store_buildable_init  (GtkBuildableIface      *iface);
Packit 98cdb6
static void         gtk_tree_store_finalize        (GObject           *object);
Packit 98cdb6
static GtkTreeModelFlags gtk_tree_store_get_flags  (GtkTreeModel      *tree_model);
Packit 98cdb6
static gint         gtk_tree_store_get_n_columns   (GtkTreeModel      *tree_model);
Packit 98cdb6
static GType        gtk_tree_store_get_column_type (GtkTreeModel      *tree_model,
Packit 98cdb6
						    gint               index);
Packit 98cdb6
static gboolean     gtk_tree_store_get_iter        (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter,
Packit 98cdb6
						    GtkTreePath       *path);
Packit 98cdb6
static GtkTreePath *gtk_tree_store_get_path        (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter);
Packit 98cdb6
static void         gtk_tree_store_get_value       (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter,
Packit 98cdb6
						    gint               column,
Packit 98cdb6
						    GValue            *value);
Packit 98cdb6
static gboolean     gtk_tree_store_iter_next       (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter);
Packit 98cdb6
static gboolean     gtk_tree_store_iter_children   (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter,
Packit 98cdb6
						    GtkTreeIter       *parent);
Packit 98cdb6
static gboolean     gtk_tree_store_iter_has_child  (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter);
Packit 98cdb6
static gint         gtk_tree_store_iter_n_children (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter);
Packit 98cdb6
static gboolean     gtk_tree_store_iter_nth_child  (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter,
Packit 98cdb6
						    GtkTreeIter       *parent,
Packit 98cdb6
						    gint               n);
Packit 98cdb6
static gboolean     gtk_tree_store_iter_parent     (GtkTreeModel      *tree_model,
Packit 98cdb6
						    GtkTreeIter       *iter,
Packit 98cdb6
						    GtkTreeIter       *child);
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static void gtk_tree_store_set_n_columns   (GtkTreeStore *tree_store,
Packit 98cdb6
					    gint          n_columns);
Packit 98cdb6
static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
Packit 98cdb6
					    gint          column,
Packit 98cdb6
					    GType         type);
Packit 98cdb6
Packit 98cdb6
static void gtk_tree_store_increment_stamp (GtkTreeStore  *tree_store);
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
/* DND interfaces */
Packit 98cdb6
static gboolean real_gtk_tree_store_row_draggable   (GtkTreeDragSource *drag_source,
Packit 98cdb6
						   GtkTreePath       *path);
Packit 98cdb6
static gboolean gtk_tree_store_drag_data_delete   (GtkTreeDragSource *drag_source,
Packit 98cdb6
						   GtkTreePath       *path);
Packit 98cdb6
static gboolean gtk_tree_store_drag_data_get      (GtkTreeDragSource *drag_source,
Packit 98cdb6
						   GtkTreePath       *path,
Packit 98cdb6
						   GtkSelectionData  *selection_data);
Packit 98cdb6
static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest   *drag_dest,
Packit 98cdb6
						   GtkTreePath       *dest,
Packit 98cdb6
						   GtkSelectionData  *selection_data);
Packit 98cdb6
static gboolean gtk_tree_store_row_drop_possible  (GtkTreeDragDest   *drag_dest,
Packit 98cdb6
						   GtkTreePath       *dest_path,
Packit 98cdb6
						   GtkSelectionData  *selection_data);
Packit 98cdb6
Packit 98cdb6
/* Sortable Interfaces */
Packit 98cdb6
Packit 98cdb6
static void     gtk_tree_store_sort                    (GtkTreeStore           *tree_store);
Packit 98cdb6
static void     gtk_tree_store_sort_iter_changed       (GtkTreeStore           *tree_store,
Packit 98cdb6
							GtkTreeIter            *iter,
Packit 98cdb6
							gint                    column,
Packit 98cdb6
							gboolean                emit_signal);
Packit 98cdb6
static gboolean gtk_tree_store_get_sort_column_id      (GtkTreeSortable        *sortable,
Packit 98cdb6
							gint                   *sort_column_id,
Packit 98cdb6
							GtkSortType            *order);
Packit 98cdb6
static void     gtk_tree_store_set_sort_column_id      (GtkTreeSortable        *sortable,
Packit 98cdb6
							gint                    sort_column_id,
Packit 98cdb6
							GtkSortType             order);
Packit 98cdb6
static void     gtk_tree_store_set_sort_func           (GtkTreeSortable        *sortable,
Packit 98cdb6
							gint                    sort_column_id,
Packit 98cdb6
							GtkTreeIterCompareFunc  func,
Packit 98cdb6
							gpointer                data,
Packit 98cdb6
							GDestroyNotify          destroy);
Packit 98cdb6
static void     gtk_tree_store_set_default_sort_func   (GtkTreeSortable        *sortable,
Packit 98cdb6
							GtkTreeIterCompareFunc  func,
Packit 98cdb6
							gpointer                data,
Packit 98cdb6
							GDestroyNotify          destroy);
Packit 98cdb6
static gboolean gtk_tree_store_has_default_sort_func   (GtkTreeSortable        *sortable);
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
/* buildable */
Packit 98cdb6
Packit 98cdb6
static gboolean gtk_tree_store_buildable_custom_tag_start (GtkBuildable  *buildable,
Packit 98cdb6
							   GtkBuilder    *builder,
Packit 98cdb6
							   GObject       *child,
Packit 98cdb6
							   const gchar   *tagname,
Packit 98cdb6
							   GMarkupParser *parser,
Packit 98cdb6
							   gpointer      *data);
Packit 98cdb6
static void     gtk_tree_store_buildable_custom_finished (GtkBuildable 	 *buildable,
Packit 98cdb6
							  GtkBuilder   	 *builder,
Packit 98cdb6
							  GObject      	 *child,
Packit 98cdb6
							  const gchar  	 *tagname,
Packit 98cdb6
							  gpointer     	  user_data);
Packit 98cdb6
Packit 98cdb6
static void     validate_gnode                         (GNode *node);
Packit 98cdb6
Packit 98cdb6
static void     gtk_tree_store_move                    (GtkTreeStore           *tree_store,
Packit 98cdb6
                                                        GtkTreeIter            *iter,
Packit 98cdb6
                                                        GtkTreeIter            *position,
Packit 98cdb6
                                                        gboolean                before);
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static inline void
Packit 98cdb6
validate_tree (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  if (gtk_debug_flags & GTK_DEBUG_TREE)
Packit 98cdb6
    {
Packit 98cdb6
      g_assert (G_NODE (tree_store->root)->parent == NULL);
Packit 98cdb6
Packit 98cdb6
      validate_gnode (G_NODE (tree_store->root));
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
G_DEFINE_TYPE_WITH_CODE (GtkTreeStore, gtk_tree_store, G_TYPE_OBJECT,
Packit 98cdb6
			 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_MODEL,
Packit 98cdb6
						gtk_tree_store_tree_model_init)
Packit 98cdb6
			 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_DRAG_SOURCE,
Packit 98cdb6
						gtk_tree_store_drag_source_init)
Packit 98cdb6
			 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_DRAG_DEST,
Packit 98cdb6
						gtk_tree_store_drag_dest_init)
Packit 98cdb6
			 G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_SORTABLE,
Packit 98cdb6
						gtk_tree_store_sortable_init)
Packit 98cdb6
			 G_IMPLEMENT_INTERFACE (GTK_TYPE_BUILDABLE,
Packit 98cdb6
						gtk_tree_store_buildable_init))
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_class_init (GtkTreeStoreClass *class)
Packit 98cdb6
{
Packit 98cdb6
  GObjectClass *object_class;
Packit 98cdb6
Packit 98cdb6
  object_class = (GObjectClass *) class;
Packit 98cdb6
Packit 98cdb6
  object_class->finalize = gtk_tree_store_finalize;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
Packit 98cdb6
{
Packit 98cdb6
  iface->get_flags = gtk_tree_store_get_flags;
Packit 98cdb6
  iface->get_n_columns = gtk_tree_store_get_n_columns;
Packit 98cdb6
  iface->get_column_type = gtk_tree_store_get_column_type;
Packit 98cdb6
  iface->get_iter = gtk_tree_store_get_iter;
Packit 98cdb6
  iface->get_path = gtk_tree_store_get_path;
Packit 98cdb6
  iface->get_value = gtk_tree_store_get_value;
Packit 98cdb6
  iface->iter_next = gtk_tree_store_iter_next;
Packit 98cdb6
  iface->iter_children = gtk_tree_store_iter_children;
Packit 98cdb6
  iface->iter_has_child = gtk_tree_store_iter_has_child;
Packit 98cdb6
  iface->iter_n_children = gtk_tree_store_iter_n_children;
Packit 98cdb6
  iface->iter_nth_child = gtk_tree_store_iter_nth_child;
Packit 98cdb6
  iface->iter_parent = gtk_tree_store_iter_parent;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
Packit 98cdb6
{
Packit 98cdb6
  iface->row_draggable = real_gtk_tree_store_row_draggable;
Packit 98cdb6
  iface->drag_data_delete = gtk_tree_store_drag_data_delete;
Packit 98cdb6
  iface->drag_data_get = gtk_tree_store_drag_data_get;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
Packit 98cdb6
{
Packit 98cdb6
  iface->drag_data_received = gtk_tree_store_drag_data_received;
Packit 98cdb6
  iface->row_drop_possible = gtk_tree_store_row_drop_possible;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
Packit 98cdb6
{
Packit 98cdb6
  iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
Packit 98cdb6
  iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
Packit 98cdb6
  iface->set_sort_func = gtk_tree_store_set_sort_func;
Packit 98cdb6
  iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
Packit 98cdb6
  iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_buildable_init (GtkBuildableIface *iface)
Packit 98cdb6
{
Packit 98cdb6
  iface->custom_tag_start = gtk_tree_store_buildable_custom_tag_start;
Packit 98cdb6
  iface->custom_finished = gtk_tree_store_buildable_custom_finished;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_init (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  tree_store->root = g_node_new (NULL);
Packit 98cdb6
  /* While the odds are against us getting 0...
Packit 98cdb6
   */
Packit 98cdb6
  do
Packit 98cdb6
    {
Packit 98cdb6
      tree_store->stamp = g_random_int ();
Packit 98cdb6
    }
Packit 98cdb6
  while (tree_store->stamp == 0);
Packit 98cdb6
Packit 98cdb6
  tree_store->sort_list = NULL;
Packit 98cdb6
  tree_store->sort_column_id = GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID;
Packit 98cdb6
  tree_store->columns_dirty = FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_new:
Packit 98cdb6
 * @n_columns: number of columns in the tree store
Packit 98cdb6
 * @Varargs: all #GType types for the columns, from first to last
Packit 98cdb6
 *
Packit 98cdb6
 * Creates a new tree store as with @n_columns columns each of the types passed
Packit 98cdb6
 * in.  Note that only types derived from standard GObject fundamental types 
Packit 98cdb6
 * are supported. 
Packit 98cdb6
 *
Packit 98cdb6
 * As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
Packit 98cdb6
 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
Packit 98cdb6
 * <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
Packit 98cdb6
 *
Packit 98cdb6
 * Return value: a new #GtkTreeStore
Packit 98cdb6
 **/
Packit 98cdb6
GtkTreeStore *
Packit 98cdb6
gtk_tree_store_new (gint n_columns,
Packit 98cdb6
			       ...)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *retval;
Packit 98cdb6
  va_list args;
Packit 98cdb6
  gint i;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (n_columns > 0, NULL);
Packit 98cdb6
Packit 98cdb6
  retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
Packit 98cdb6
  gtk_tree_store_set_n_columns (retval, n_columns);
Packit 98cdb6
Packit 98cdb6
  va_start (args, n_columns);
Packit 98cdb6
Packit 98cdb6
  for (i = 0; i < n_columns; i++)
Packit 98cdb6
    {
Packit 98cdb6
      GType type = va_arg (args, GType);
Packit 98cdb6
      if (! _gtk_tree_data_list_check_type (type))
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (type));
Packit 98cdb6
	  g_object_unref (retval);
Packit 98cdb6
          va_end (args);
Packit 98cdb6
	  return NULL;
Packit 98cdb6
	}
Packit 98cdb6
      gtk_tree_store_set_column_type (retval, i, type);
Packit 98cdb6
    }
Packit 98cdb6
  va_end (args);
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_newv:
Packit 98cdb6
 * @n_columns: number of columns in the tree store
Packit 98cdb6
 * @types: (array length=n_columns): an array of #GType types for the columns, from first to last
Packit 98cdb6
 *
Packit 98cdb6
 * Non vararg creation function.  Used primarily by language bindings.
Packit 98cdb6
 *
Packit 98cdb6
 * Return value: (transfer full): a new #GtkTreeStore
Packit 98cdb6
 **/
Packit 98cdb6
GtkTreeStore *
Packit 98cdb6
gtk_tree_store_newv (gint   n_columns,
Packit 98cdb6
		     GType *types)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *retval;
Packit 98cdb6
  gint i;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (n_columns > 0, NULL);
Packit 98cdb6
Packit 98cdb6
  retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
Packit 98cdb6
  gtk_tree_store_set_n_columns (retval, n_columns);
Packit 98cdb6
Packit 98cdb6
   for (i = 0; i < n_columns; i++)
Packit 98cdb6
    {
Packit 98cdb6
      if (! _gtk_tree_data_list_check_type (types[i]))
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (types[i]));
Packit 98cdb6
	  g_object_unref (retval);
Packit 98cdb6
	  return NULL;
Packit 98cdb6
	}
Packit 98cdb6
      gtk_tree_store_set_column_type (retval, i, types[i]);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set_column_types:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @n_columns: Number of columns for the tree store
Packit 98cdb6
 * @types: (array length=n_columns): An array of #GType types, one for each column
Packit 98cdb6
 * 
Packit 98cdb6
 * This function is meant primarily for #GObjects that inherit from 
Packit 98cdb6
 * #GtkTreeStore, and should only be used when constructing a new 
Packit 98cdb6
 * #GtkTreeStore.  It will not function after a row has been added, 
Packit 98cdb6
 * or a method on the #GtkTreeModel interface is called.
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
Packit 98cdb6
				 gint          n_columns,
Packit 98cdb6
				 GType        *types)
Packit 98cdb6
{
Packit 98cdb6
  gint i;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (tree_store->columns_dirty == 0);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_set_n_columns (tree_store, n_columns);
Packit 98cdb6
   for (i = 0; i < n_columns; i++)
Packit 98cdb6
    {
Packit 98cdb6
      if (! _gtk_tree_data_list_check_type (types[i]))
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (types[i]));
Packit 98cdb6
	  continue;
Packit 98cdb6
	}
Packit 98cdb6
      gtk_tree_store_set_column_type (tree_store, i, types[i]);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
Packit 98cdb6
			      gint          n_columns)
Packit 98cdb6
{
Packit 98cdb6
  int i;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->n_columns == n_columns)
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  tree_store->column_headers = g_renew (GType, tree_store->column_headers, n_columns);
Packit 98cdb6
  for (i = tree_store->n_columns; i < n_columns; i++)
Packit 98cdb6
    tree_store->column_headers[i] = G_TYPE_INVALID;
Packit 98cdb6
  tree_store->n_columns = n_columns;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_list)
Packit 98cdb6
    _gtk_tree_data_list_header_free (tree_store->sort_list);
Packit 98cdb6
Packit 98cdb6
  tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set_column_type:
Packit 98cdb6
 * @tree_store: a #GtkTreeStore
Packit 98cdb6
 * @column: column number
Packit 98cdb6
 * @type: type of the data to be stored in @column
Packit 98cdb6
 *
Packit 98cdb6
 * Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
Packit 98cdb6
 * %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
Packit 98cdb6
 * %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
Packit 98cdb6
 * subclasses of those types such as %GDK_TYPE_PIXBUF.
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
Packit 98cdb6
				gint          column,
Packit 98cdb6
				GType         type)
Packit 98cdb6
{
Packit 98cdb6
  if (!_gtk_tree_data_list_check_type (type))
Packit 98cdb6
    {
Packit 98cdb6
      g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (type));
Packit 98cdb6
      return;
Packit 98cdb6
    }
Packit 98cdb6
  tree_store->column_headers[column] = type;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
node_free (GNode *node, gpointer data)
Packit 98cdb6
{
Packit 98cdb6
  if (node->data)
Packit 98cdb6
    _gtk_tree_data_list_free (node->data, (GType*)data);
Packit 98cdb6
  node->data = NULL;
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_finalize (GObject *object)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = GTK_TREE_STORE (object);
Packit 98cdb6
Packit 98cdb6
  g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
Packit 98cdb6
		   node_free, tree_store->column_headers);
Packit 98cdb6
  g_node_destroy (tree_store->root);
Packit 98cdb6
  _gtk_tree_data_list_header_free (tree_store->sort_list);
Packit 98cdb6
  g_free (tree_store->column_headers);
Packit 98cdb6
Packit 98cdb6
  if (tree_store->default_sort_destroy)
Packit 98cdb6
    {
Packit 98cdb6
      GDestroyNotify d = tree_store->default_sort_destroy;
Packit 98cdb6
Packit 98cdb6
      tree_store->default_sort_destroy = NULL;
Packit 98cdb6
      d (tree_store->default_sort_data);
Packit 98cdb6
      tree_store->default_sort_data = NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* must chain up */
Packit 98cdb6
  G_OBJECT_CLASS (gtk_tree_store_parent_class)->finalize (object);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* fulfill the GtkTreeModel requirements */
Packit 98cdb6
/* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node.  However,
Packit 98cdb6
 * it is not visible to the tree or to the user., and the path "0" refers to the
Packit 98cdb6
 * first child of GtkTreeStore::root.
Packit 98cdb6
 */
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static GtkTreeModelFlags
Packit 98cdb6
gtk_tree_store_get_flags (GtkTreeModel *tree_model)
Packit 98cdb6
{
Packit 98cdb6
  return GTK_TREE_MODEL_ITERS_PERSIST;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gint
Packit 98cdb6
gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  return tree_store->n_columns;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static GType
Packit 98cdb6
gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
Packit 98cdb6
				gint          index)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (index < tree_store->n_columns, G_TYPE_INVALID);
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  return tree_store->column_headers[index];
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_get_iter (GtkTreeModel *tree_model,
Packit 98cdb6
			 GtkTreeIter  *iter,
Packit 98cdb6
			 GtkTreePath  *path)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GtkTreeIter parent;
Packit 98cdb6
  gint *indices;
Packit 98cdb6
  gint depth, i;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  indices = gtk_tree_path_get_indices (path);
Packit 98cdb6
  depth = gtk_tree_path_get_depth (path);
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (depth > 0, FALSE);
Packit 98cdb6
Packit 98cdb6
  parent.stamp = tree_store->stamp;
Packit 98cdb6
  parent.user_data = tree_store->root;
Packit 98cdb6
Packit 98cdb6
  if (!gtk_tree_store_iter_nth_child (tree_model, iter, &parent, indices[0]))
Packit 98cdb6
    return FALSE;
Packit 98cdb6
Packit 98cdb6
  for (i = 1; i < depth; i++)
Packit 98cdb6
    {
Packit 98cdb6
      parent = *iter;
Packit 98cdb6
      if (!gtk_tree_store_iter_nth_child (tree_model, iter, &parent, indices[i]))
Packit 98cdb6
	return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return TRUE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static GtkTreePath *
Packit 98cdb6
gtk_tree_store_get_path (GtkTreeModel *tree_model,
Packit 98cdb6
			 GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GtkTreePath *retval;
Packit 98cdb6
  GNode *tmp_node;
Packit 98cdb6
  gint i = 0;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (iter->user_data != NULL, NULL);
Packit 98cdb6
  g_return_val_if_fail (iter->stamp == tree_store->stamp, NULL);
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
Packit 98cdb6
  if (G_NODE (iter->user_data)->parent == NULL &&
Packit 98cdb6
      G_NODE (iter->user_data) == tree_store->root)
Packit 98cdb6
    return gtk_tree_path_new ();
Packit 98cdb6
  g_assert (G_NODE (iter->user_data)->parent != NULL);
Packit 98cdb6
Packit 98cdb6
  if (G_NODE (iter->user_data)->parent == G_NODE (tree_store->root))
Packit 98cdb6
    {
Packit 98cdb6
      retval = gtk_tree_path_new ();
Packit 98cdb6
      tmp_node = G_NODE (tree_store->root)->children;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreeIter tmp_iter = *iter;
Packit 98cdb6
Packit 98cdb6
      tmp_iter.user_data = G_NODE (iter->user_data)->parent;
Packit 98cdb6
Packit 98cdb6
      retval = gtk_tree_store_get_path (tree_model, &tmp_iter);
Packit 98cdb6
      tmp_node = G_NODE (iter->user_data)->parent->children;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (retval == NULL)
Packit 98cdb6
    return NULL;
Packit 98cdb6
Packit 98cdb6
  if (tmp_node == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      gtk_tree_path_free (retval);
Packit 98cdb6
      return NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  for (; tmp_node; tmp_node = tmp_node->next)
Packit 98cdb6
    {
Packit 98cdb6
      if (tmp_node == G_NODE (iter->user_data))
Packit 98cdb6
	break;
Packit 98cdb6
      i++;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (tmp_node == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      /* We couldn't find node, meaning it's prolly not ours */
Packit 98cdb6
      /* Perhaps I should do a g_return_if_fail here. */
Packit 98cdb6
      gtk_tree_path_free (retval);
Packit 98cdb6
      return NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_append_index (retval, i);
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_get_value (GtkTreeModel *tree_model,
Packit 98cdb6
			  GtkTreeIter  *iter,
Packit 98cdb6
			  gint          column,
Packit 98cdb6
			  GValue       *value)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GtkTreeDataList *list;
Packit 98cdb6
  gint tmp_column = column;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (column < tree_store->n_columns);
Packit 98cdb6
  g_return_if_fail (VALID_ITER (iter, tree_store));
Packit 98cdb6
Packit 98cdb6
  list = G_NODE (iter->user_data)->data;
Packit 98cdb6
Packit 98cdb6
  while (tmp_column-- > 0 && list)
Packit 98cdb6
    list = list->next;
Packit 98cdb6
Packit 98cdb6
  if (list)
Packit 98cdb6
    {
Packit 98cdb6
      _gtk_tree_data_list_node_to_value (list,
Packit 98cdb6
					 tree_store->column_headers[column],
Packit 98cdb6
					 value);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      /* We want to return an initialized but empty (default) value */
Packit 98cdb6
      g_value_init (value, tree_store->column_headers[column]);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_next (GtkTreeModel  *tree_model,
Packit 98cdb6
			  GtkTreeIter   *iter)
Packit 98cdb6
{
Packit 98cdb6
  g_return_val_if_fail (iter->user_data != NULL, FALSE);
Packit 98cdb6
  g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
Packit 98cdb6
Packit 98cdb6
  if (G_NODE (iter->user_data)->next)
Packit 98cdb6
    {
Packit 98cdb6
      iter->user_data = G_NODE (iter->user_data)->next;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = 0;
Packit 98cdb6
      return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_children (GtkTreeModel *tree_model,
Packit 98cdb6
			      GtkTreeIter  *iter,
Packit 98cdb6
			      GtkTreeIter  *parent)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GNode *children;
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    g_return_val_if_fail (VALID_ITER (parent, tree_store), FALSE);
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    children = G_NODE (parent->user_data)->children;
Packit 98cdb6
  else
Packit 98cdb6
    children = G_NODE (tree_store->root)->children;
Packit 98cdb6
Packit 98cdb6
  if (children)
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      iter->user_data = children;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = 0;
Packit 98cdb6
      return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
Packit 98cdb6
			       GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  g_return_val_if_fail (iter->user_data != NULL, FALSE);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (iter, tree_model), FALSE);
Packit 98cdb6
Packit 98cdb6
  return G_NODE (iter->user_data)->children != NULL;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gint
Packit 98cdb6
gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
Packit 98cdb6
				GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  GNode *node;
Packit 98cdb6
  gint i = 0;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
Packit 98cdb6
Packit 98cdb6
  if (iter == NULL)
Packit 98cdb6
    node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
Packit 98cdb6
  else
Packit 98cdb6
    node = G_NODE (iter->user_data)->children;
Packit 98cdb6
Packit 98cdb6
  while (node)
Packit 98cdb6
    {
Packit 98cdb6
      i++;
Packit 98cdb6
      node = node->next;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return i;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
Packit 98cdb6
			       GtkTreeIter  *iter,
Packit 98cdb6
			       GtkTreeIter  *parent,
Packit 98cdb6
			       gint          n)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
  GNode *child;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
Packit 98cdb6
Packit 98cdb6
  if (parent == NULL)
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
Packit 98cdb6
  child = g_node_nth_child (parent_node, n);
Packit 98cdb6
Packit 98cdb6
  if (child)
Packit 98cdb6
    {
Packit 98cdb6
      iter->user_data = child;
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = 0;
Packit 98cdb6
      return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
Packit 98cdb6
			    GtkTreeIter  *iter,
Packit 98cdb6
			    GtkTreeIter  *child)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
Packit 98cdb6
  GNode *parent;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (iter != NULL, FALSE);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (child, tree_store), FALSE);
Packit 98cdb6
Packit 98cdb6
  parent = G_NODE (child->user_data)->parent;
Packit 98cdb6
Packit 98cdb6
  g_assert (parent != NULL);
Packit 98cdb6
Packit 98cdb6
  if (parent != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      iter->user_data = parent;
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = 0;
Packit 98cdb6
      return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
/* Does not emit a signal */
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
Packit 98cdb6
			       GtkTreeIter  *iter,
Packit 98cdb6
			       gint          column,
Packit 98cdb6
			       GValue       *value,
Packit 98cdb6
			       gboolean      sort)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeDataList *list;
Packit 98cdb6
  GtkTreeDataList *prev;
Packit 98cdb6
  gint old_column = column;
Packit 98cdb6
  GValue real_value = {0, };
Packit 98cdb6
  gboolean converted = FALSE;
Packit 98cdb6
  gboolean retval = FALSE;
Packit 98cdb6
Packit 98cdb6
  if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
Packit 98cdb6
    {
Packit 98cdb6
      if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
Packit 98cdb6
	     g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Unable to convert from %s to %s\n",
Packit 98cdb6
		     G_STRLOC,
Packit 98cdb6
		     g_type_name (G_VALUE_TYPE (value)),
Packit 98cdb6
		     g_type_name (tree_store->column_headers[column]));
Packit 98cdb6
	  return retval;
Packit 98cdb6
	}
Packit 98cdb6
      if (!g_value_transform (value, &real_value))
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Unable to make conversion from %s to %s\n",
Packit 98cdb6
		     G_STRLOC,
Packit 98cdb6
		     g_type_name (G_VALUE_TYPE (value)),
Packit 98cdb6
		     g_type_name (tree_store->column_headers[column]));
Packit 98cdb6
	  g_value_unset (&real_value);
Packit 98cdb6
	  return retval;
Packit 98cdb6
	}
Packit 98cdb6
      converted = TRUE;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  prev = list = G_NODE (iter->user_data)->data;
Packit 98cdb6
Packit 98cdb6
  while (list != NULL)
Packit 98cdb6
    {
Packit 98cdb6
      if (column == 0)
Packit 98cdb6
	{
Packit 98cdb6
	  if (converted)
Packit 98cdb6
	    _gtk_tree_data_list_value_to_node (list, &real_value);
Packit 98cdb6
	  else
Packit 98cdb6
	    _gtk_tree_data_list_value_to_node (list, value);
Packit 98cdb6
	  retval = TRUE;
Packit 98cdb6
	  if (converted)
Packit 98cdb6
	    g_value_unset (&real_value);
Packit 98cdb6
          if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
            gtk_tree_store_sort_iter_changed (tree_store, iter, old_column, TRUE);
Packit 98cdb6
	  return retval;
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      column--;
Packit 98cdb6
      prev = list;
Packit 98cdb6
      list = list->next;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (G_NODE (iter->user_data)->data == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
Packit 98cdb6
      list->next = NULL;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      list = prev->next = _gtk_tree_data_list_alloc ();
Packit 98cdb6
      list->next = NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  while (column != 0)
Packit 98cdb6
    {
Packit 98cdb6
      list->next = _gtk_tree_data_list_alloc ();
Packit 98cdb6
      list = list->next;
Packit 98cdb6
      list->next = NULL;
Packit 98cdb6
      column --;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (converted)
Packit 98cdb6
    _gtk_tree_data_list_value_to_node (list, &real_value);
Packit 98cdb6
  else
Packit 98cdb6
    _gtk_tree_data_list_value_to_node (list, value);
Packit 98cdb6
  
Packit 98cdb6
  retval = TRUE;
Packit 98cdb6
  if (converted)
Packit 98cdb6
    g_value_unset (&real_value);
Packit 98cdb6
Packit 98cdb6
  if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    gtk_tree_store_sort_iter_changed (tree_store, iter, old_column, TRUE);
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set_value:
Packit 98cdb6
 * @tree_store: a #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter for the row being modified
Packit 98cdb6
 * @column: column number to modify
Packit 98cdb6
 * @value: new value for the cell
Packit 98cdb6
 *
Packit 98cdb6
 * Sets the data in the cell specified by @iter and @column.
Packit 98cdb6
 * The type of @value must be convertible to the type of the
Packit 98cdb6
 * column.
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_set_value (GtkTreeStore *tree_store,
Packit 98cdb6
			  GtkTreeIter  *iter,
Packit 98cdb6
			  gint          column,
Packit 98cdb6
			  GValue       *value)
Packit 98cdb6
{
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (iter, tree_store));
Packit 98cdb6
  g_return_if_fail (column >= 0 && column < tree_store->n_columns);
Packit 98cdb6
  g_return_if_fail (G_IS_VALUE (value));
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreePath *path;
Packit 98cdb6
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
      gtk_tree_path_free (path);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static GtkTreeIterCompareFunc
Packit 98cdb6
gtk_tree_store_get_compare_func (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeIterCompareFunc func = NULL;
Packit 98cdb6
Packit 98cdb6
  if (GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    {
Packit 98cdb6
      if (tree_store->sort_column_id != -1)
Packit 98cdb6
	{
Packit 98cdb6
	  GtkTreeDataSortHeader *header;
Packit 98cdb6
	  header = _gtk_tree_data_list_get_header (tree_store->sort_list,
Packit 98cdb6
						   tree_store->sort_column_id);
Packit 98cdb6
	  g_return_val_if_fail (header != NULL, NULL);
Packit 98cdb6
	  g_return_val_if_fail (header->func != NULL, NULL);
Packit 98cdb6
	  func = header->func;
Packit 98cdb6
	}
Packit 98cdb6
      else
Packit 98cdb6
	{
Packit 98cdb6
	  func = tree_store->default_sort_func;
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return func;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_vector_internal (GtkTreeStore *tree_store,
Packit 98cdb6
				    GtkTreeIter  *iter,
Packit 98cdb6
				    gboolean     *emit_signal,
Packit 98cdb6
				    gboolean     *maybe_need_sort,
Packit 98cdb6
				    gint         *columns,
Packit 98cdb6
				    GValue       *values,
Packit 98cdb6
				    gint          n_values)
Packit 98cdb6
{
Packit 98cdb6
  gint i;
Packit 98cdb6
  GtkTreeIterCompareFunc func = NULL;
Packit 98cdb6
Packit 98cdb6
  func = gtk_tree_store_get_compare_func (tree_store);
Packit 98cdb6
  if (func != _gtk_tree_data_list_compare_func)
Packit 98cdb6
    *maybe_need_sort = TRUE;
Packit 98cdb6
Packit 98cdb6
  for (i = 0; i < n_values; i++)
Packit 98cdb6
    {
Packit 98cdb6
      *emit_signal = gtk_tree_store_real_set_value (tree_store, iter,
Packit 98cdb6
						    columns[i], &values[i],
Packit 98cdb6
						    FALSE) || *emit_signal;
Packit 98cdb6
Packit 98cdb6
      if (func == _gtk_tree_data_list_compare_func &&
Packit 98cdb6
	  columns[i] == tree_store->sort_column_id)
Packit 98cdb6
	*maybe_need_sort = TRUE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_valist_internal (GtkTreeStore *tree_store,
Packit 98cdb6
                                    GtkTreeIter  *iter,
Packit 98cdb6
                                    gboolean     *emit_signal,
Packit 98cdb6
                                    gboolean     *maybe_need_sort,
Packit 98cdb6
                                    va_list       var_args)
Packit 98cdb6
{
Packit 98cdb6
  gint column;
Packit 98cdb6
  GtkTreeIterCompareFunc func = NULL;
Packit 98cdb6
Packit 98cdb6
  column = va_arg (var_args, gint);
Packit 98cdb6
Packit 98cdb6
  func = gtk_tree_store_get_compare_func (tree_store);
Packit 98cdb6
  if (func != _gtk_tree_data_list_compare_func)
Packit 98cdb6
    *maybe_need_sort = TRUE;
Packit 98cdb6
Packit 98cdb6
  while (column != -1)
Packit 98cdb6
    {
Packit 98cdb6
      GValue value = { 0, };
Packit 98cdb6
      gchar *error = NULL;
Packit 98cdb6
Packit 98cdb6
      if (column < 0 || column >= tree_store->n_columns)
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
Packit 98cdb6
	  break;
Packit 98cdb6
	}
Packit 98cdb6
      g_value_init (&value, tree_store->column_headers[column]);
Packit 98cdb6
Packit 98cdb6
      G_VALUE_COLLECT (&value, var_args, 0, &error);
Packit 98cdb6
      if (error)
Packit 98cdb6
	{
Packit 98cdb6
	  g_warning ("%s: %s", G_STRLOC, error);
Packit 98cdb6
	  g_free (error);
Packit 98cdb6
Packit 98cdb6
 	  /* we purposely leak the value here, it might not be
Packit 98cdb6
	   * in a sane state if an error condition occoured
Packit 98cdb6
	   */
Packit 98cdb6
	  break;
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      *emit_signal = gtk_tree_store_real_set_value (tree_store,
Packit 98cdb6
						    iter,
Packit 98cdb6
						    column,
Packit 98cdb6
						    &value,
Packit 98cdb6
						    FALSE) || *emit_signal;
Packit 98cdb6
Packit 98cdb6
      if (func == _gtk_tree_data_list_compare_func &&
Packit 98cdb6
	  column == tree_store->sort_column_id)
Packit 98cdb6
	*maybe_need_sort = TRUE;
Packit 98cdb6
Packit 98cdb6
      g_value_unset (&value);
Packit 98cdb6
Packit 98cdb6
      column = va_arg (var_args, gint);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set_valuesv:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter for the row being modified
Packit 98cdb6
 * @columns: (array length=n_values): an array of column numbers
Packit 98cdb6
 * @values: (array length=n_values): an array of GValues
Packit 98cdb6
 * @n_values: the length of the @columns and @values arrays
Packit 98cdb6
 *
Packit 98cdb6
 * A variant of gtk_tree_store_set_valist() which takes
Packit 98cdb6
 * the columns and values as two arrays, instead of varargs.  This
Packit 98cdb6
 * function is mainly intended for language bindings or in case
Packit 98cdb6
 * the number of columns to change is not known until run-time.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.12
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_set_valuesv (GtkTreeStore *tree_store,
Packit 98cdb6
			    GtkTreeIter  *iter,
Packit 98cdb6
			    gint         *columns,
Packit 98cdb6
			    GValue       *values,
Packit 98cdb6
			    gint          n_values)
Packit 98cdb6
{
Packit 98cdb6
  gboolean emit_signal = FALSE;
Packit 98cdb6
  gboolean maybe_need_sort = FALSE;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (iter, tree_store));
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_set_vector_internal (tree_store, iter,
Packit 98cdb6
				      &emit_signal,
Packit 98cdb6
				      &maybe_need_sort,
Packit 98cdb6
				      columns, values, n_values);
Packit 98cdb6
Packit 98cdb6
  if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, TRUE);
Packit 98cdb6
Packit 98cdb6
  if (emit_signal)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreePath *path;
Packit 98cdb6
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
      gtk_tree_path_free (path);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set_valist:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter for the row being modified
Packit 98cdb6
 * @var_args: <type>va_list</type> of column/value pairs
Packit 98cdb6
 *
Packit 98cdb6
 * See gtk_tree_store_set(); this version takes a <type>va_list</type> for
Packit 98cdb6
 * use by language bindings.
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_set_valist (GtkTreeStore *tree_store,
Packit 98cdb6
                           GtkTreeIter  *iter,
Packit 98cdb6
                           va_list       var_args)
Packit 98cdb6
{
Packit 98cdb6
  gboolean emit_signal = FALSE;
Packit 98cdb6
  gboolean maybe_need_sort = FALSE;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (iter, tree_store));
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_set_valist_internal (tree_store, iter,
Packit 98cdb6
				      &emit_signal,
Packit 98cdb6
				      &maybe_need_sort,
Packit 98cdb6
				      var_args);
Packit 98cdb6
Packit 98cdb6
  if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, TRUE);
Packit 98cdb6
Packit 98cdb6
  if (emit_signal)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreePath *path;
Packit 98cdb6
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
      gtk_tree_path_free (path);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_set:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter for the row being modified
Packit 98cdb6
 * @Varargs: pairs of column number and value, terminated with -1
Packit 98cdb6
 *
Packit 98cdb6
 * Sets the value of one or more cells in the row referenced by @iter.
Packit 98cdb6
 * The variable argument list should contain integer column numbers,
Packit 98cdb6
 * each column number followed by the value to be set. 
Packit 98cdb6
 * The list is terminated by a -1. For example, to set column 0 with type
Packit 98cdb6
 * %G_TYPE_STRING to "Foo", you would write 
Packit 98cdb6
 * <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
Packit 98cdb6
 *
Packit 98cdb6
 * The value will be referenced by the store if it is a %G_TYPE_OBJECT, and it
Packit 98cdb6
 * will be copied if it is a %G_TYPE_STRING or %G_TYPE_BOXED.
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_set (GtkTreeStore *tree_store,
Packit 98cdb6
		    GtkTreeIter  *iter,
Packit 98cdb6
		    ...)
Packit 98cdb6
{
Packit 98cdb6
  va_list var_args;
Packit 98cdb6
Packit 98cdb6
  va_start (var_args, iter);
Packit 98cdb6
  gtk_tree_store_set_valist (tree_store, iter, var_args);
Packit 98cdb6
  va_end (var_args);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_remove:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter
Packit 98cdb6
 * 
Packit 98cdb6
 * Removes @iter from @tree_store.  After being removed, @iter is set to the
Packit 98cdb6
 * next valid row at that level, or invalidated if it previously pointed to the
Packit 98cdb6
 * last one.
Packit 98cdb6
 *
Packit 98cdb6
 * Return value: %TRUE if @iter is still valid, %FALSE if not.
Packit 98cdb6
 **/
Packit 98cdb6
gboolean
Packit 98cdb6
gtk_tree_store_remove (GtkTreeStore *tree_store,
Packit 98cdb6
		       GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GtkTreeIter new_iter = {0,};
Packit 98cdb6
  GNode *parent;
Packit 98cdb6
  GNode *next_node;
Packit 98cdb6
Packit 98cdb6
  g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
Packit 98cdb6
Packit 98cdb6
  parent = G_NODE (iter->user_data)->parent;
Packit 98cdb6
Packit 98cdb6
  g_assert (parent != NULL);
Packit 98cdb6
  next_node = G_NODE (iter->user_data)->next;
Packit 98cdb6
Packit 98cdb6
  if (G_NODE (iter->user_data)->data)
Packit 98cdb6
    g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
Packit 98cdb6
		     -1, node_free, tree_store->column_headers);
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  g_node_destroy (G_NODE (iter->user_data));
Packit 98cdb6
Packit 98cdb6
  gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
Packit 98cdb6
Packit 98cdb6
  if (parent != G_NODE (tree_store->root))
Packit 98cdb6
    {
Packit 98cdb6
      /* child_toggled */
Packit 98cdb6
      if (parent->children == NULL)
Packit 98cdb6
	{
Packit 98cdb6
	  gtk_tree_path_up (path);
Packit 98cdb6
Packit 98cdb6
	  new_iter.stamp = tree_store->stamp;
Packit 98cdb6
	  new_iter.user_data = parent;
Packit 98cdb6
	  gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  /* revalidate iter */
Packit 98cdb6
  if (next_node != NULL)
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      iter->user_data = next_node;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      iter->stamp = 0;
Packit 98cdb6
      iter->user_data = NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_insert:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out): An unset #GtkTreeIter to set to the new row
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * @position: position to insert the new row
Packit 98cdb6
 *
Packit 98cdb6
 * Creates a new row at @position.  If parent is non-%NULL, then the row will be
Packit 98cdb6
 * made a child of @parent.  Otherwise, the row will be created at the toplevel.
Packit 98cdb6
 * If @position is larger than the number of rows at that level, then the new
Packit 98cdb6
 * row will be inserted to the end of the list.  @iter will be changed to point
Packit 98cdb6
 * to this new row.  The row will be empty after this function is called.  To
Packit 98cdb6
 * fill in values, you need to call gtk_tree_store_set() or
Packit 98cdb6
 * gtk_tree_store_set_value().
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_insert (GtkTreeStore *tree_store,
Packit 98cdb6
		       GtkTreeIter  *iter,
Packit 98cdb6
		       GtkTreeIter  *parent,
Packit 98cdb6
		       gint          position)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
  GNode *new_node;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (iter != NULL);
Packit 98cdb6
  if (parent)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  new_node = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
  iter->stamp = tree_store->stamp;
Packit 98cdb6
  iter->user_data = new_node;
Packit 98cdb6
  g_node_insert (parent_node, position, new_node);
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
  if (parent_node != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      if (new_node->prev == NULL && new_node->next == NULL)
Packit 98cdb6
        {
Packit 98cdb6
          gtk_tree_path_up (path);
Packit 98cdb6
          gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
Packit 98cdb6
        }
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  validate_tree ((GtkTreeStore*)tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_insert_before:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out): An unset #GtkTreeIter to set to the new row
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * @sibling: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 *
Packit 98cdb6
 * Inserts a new row before @sibling.  If @sibling is %NULL, then the row will
Packit 98cdb6
 * be appended to @parent 's children.  If @parent and @sibling are %NULL, then
Packit 98cdb6
 * the row will be appended to the toplevel.  If both @sibling and @parent are
Packit 98cdb6
 * set, then @parent must be the parent of @sibling.  When @sibling is set,
Packit 98cdb6
 * @parent is optional.
Packit 98cdb6
 *
Packit 98cdb6
 * @iter will be changed to point to this new row.  The row will be empty after
Packit 98cdb6
 * this function is called.  To fill in values, you need to call
Packit 98cdb6
 * gtk_tree_store_set() or gtk_tree_store_set_value().
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_insert_before (GtkTreeStore *tree_store,
Packit 98cdb6
			      GtkTreeIter  *iter,
Packit 98cdb6
			      GtkTreeIter  *parent,
Packit 98cdb6
			      GtkTreeIter  *sibling)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GNode *parent_node = NULL;
Packit 98cdb6
  GNode *new_node;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (iter != NULL);
Packit 98cdb6
  if (parent != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
  if (sibling != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (sibling, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent == NULL && sibling == NULL)
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
  else if (parent == NULL)
Packit 98cdb6
    parent_node = G_NODE (sibling->user_data)->parent;
Packit 98cdb6
  else if (sibling == NULL)
Packit 98cdb6
    parent_node = G_NODE (parent->user_data);
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
Packit 98cdb6
      parent_node = G_NODE (parent->user_data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  new_node = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
  g_node_insert_before (parent_node,
Packit 98cdb6
			sibling ? G_NODE (sibling->user_data) : NULL,
Packit 98cdb6
                        new_node);
Packit 98cdb6
Packit 98cdb6
  iter->stamp = tree_store->stamp;
Packit 98cdb6
  iter->user_data = new_node;
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
  if (parent_node != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      if (new_node->prev == NULL && new_node->next == NULL)
Packit 98cdb6
        {
Packit 98cdb6
          GtkTreeIter parent_iter;
Packit 98cdb6
Packit 98cdb6
          parent_iter.stamp = tree_store->stamp;
Packit 98cdb6
          parent_iter.user_data = parent_node;
Packit 98cdb6
Packit 98cdb6
          gtk_tree_path_up (path);
Packit 98cdb6
          gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
Packit 98cdb6
        }
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_insert_after:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out): An unset #GtkTreeIter to set to the new row
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * @sibling: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 *
Packit 98cdb6
 * Inserts a new row after @sibling.  If @sibling is %NULL, then the row will be
Packit 98cdb6
 * prepended to @parent 's children.  If @parent and @sibling are %NULL, then
Packit 98cdb6
 * the row will be prepended to the toplevel.  If both @sibling and @parent are
Packit 98cdb6
 * set, then @parent must be the parent of @sibling.  When @sibling is set,
Packit 98cdb6
 * @parent is optional.
Packit 98cdb6
 *
Packit 98cdb6
 * @iter will be changed to point to this new row.  The row will be empty after
Packit 98cdb6
 * this function is called.  To fill in values, you need to call
Packit 98cdb6
 * gtk_tree_store_set() or gtk_tree_store_set_value().
Packit 98cdb6
 *
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_insert_after (GtkTreeStore *tree_store,
Packit 98cdb6
			     GtkTreeIter  *iter,
Packit 98cdb6
			     GtkTreeIter  *parent,
Packit 98cdb6
			     GtkTreeIter  *sibling)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
  GNode *new_node;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (iter != NULL);
Packit 98cdb6
  if (parent != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
  if (sibling != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (sibling, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent == NULL && sibling == NULL)
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
  else if (parent == NULL)
Packit 98cdb6
    parent_node = G_NODE (sibling->user_data)->parent;
Packit 98cdb6
  else if (sibling == NULL)
Packit 98cdb6
    parent_node = G_NODE (parent->user_data);
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      g_return_if_fail (G_NODE (sibling->user_data)->parent ==
Packit 98cdb6
                        G_NODE (parent->user_data));
Packit 98cdb6
      parent_node = G_NODE (parent->user_data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  new_node = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
  g_node_insert_after (parent_node,
Packit 98cdb6
		       sibling ? G_NODE (sibling->user_data) : NULL,
Packit 98cdb6
                       new_node);
Packit 98cdb6
Packit 98cdb6
  iter->stamp = tree_store->stamp;
Packit 98cdb6
  iter->user_data = new_node;
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
  if (parent_node != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      if (new_node->prev == NULL && new_node->next == NULL)
Packit 98cdb6
        {
Packit 98cdb6
          GtkTreeIter parent_iter;
Packit 98cdb6
Packit 98cdb6
          parent_iter.stamp = tree_store->stamp;
Packit 98cdb6
          parent_iter.user_data = parent_node;
Packit 98cdb6
Packit 98cdb6
          gtk_tree_path_up (path);
Packit 98cdb6
          gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
Packit 98cdb6
        }
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_insert_with_values:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out) (allow-none): An unset #GtkTreeIter to set the new row, or %NULL.
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * @position: position to insert the new row
Packit 98cdb6
 * @Varargs: pairs of column number and value, terminated with -1
Packit 98cdb6
 *
Packit 98cdb6
 * Creates a new row at @position.  @iter will be changed to point to this
Packit 98cdb6
 * new row.  If @position is larger than the number of rows on the list, then
Packit 98cdb6
 * the new row will be appended to the list.  The row will be filled with
Packit 98cdb6
 * the values given to this function.
Packit 98cdb6
 *
Packit 98cdb6
 * Calling
Packit 98cdb6
 * <literal>gtk_tree_store_insert_with_values (tree_store, iter, position, ...)</literal>
Packit 98cdb6
 * has the same effect as calling
Packit 98cdb6
 * |[
Packit 98cdb6
 * gtk_tree_store_insert (tree_store, iter, position);
Packit 98cdb6
 * gtk_tree_store_set (tree_store, iter, ...);
Packit 98cdb6
 * ]|
Packit 98cdb6
 * with the different that the former will only emit a row_inserted signal,
Packit 98cdb6
 * while the latter will emit row_inserted, row_changed and if the tree store
Packit 98cdb6
 * is sorted, rows_reordered.  Since emitting the rows_reordered signal
Packit 98cdb6
 * repeatedly can affect the performance of the program,
Packit 98cdb6
 * gtk_tree_store_insert_with_values() should generally be preferred when
Packit 98cdb6
 * inserting rows in a sorted tree store.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.10
Packit 98cdb6
 */
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_insert_with_values (GtkTreeStore *tree_store,
Packit 98cdb6
				   GtkTreeIter  *iter,
Packit 98cdb6
				   GtkTreeIter  *parent,
Packit 98cdb6
				   gint          position,
Packit 98cdb6
				   ...)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
  GNode *new_node;
Packit 98cdb6
  GtkTreeIter tmp_iter;
Packit 98cdb6
  va_list var_args;
Packit 98cdb6
  gboolean changed = FALSE;
Packit 98cdb6
  gboolean maybe_need_sort = FALSE;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
Packit 98cdb6
  if (!iter)
Packit 98cdb6
    iter = &tmp_iter;
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  new_node = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
  iter->stamp = tree_store->stamp;
Packit 98cdb6
  iter->user_data = new_node;
Packit 98cdb6
  g_node_insert (parent_node, position, new_node);
Packit 98cdb6
Packit 98cdb6
  va_start (var_args, position);
Packit 98cdb6
  gtk_tree_store_set_valist_internal (tree_store, iter,
Packit 98cdb6
				      &changed, &maybe_need_sort,
Packit 98cdb6
				      var_args);
Packit 98cdb6
  va_end (var_args);
Packit 98cdb6
Packit 98cdb6
  if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, FALSE);
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
  if (parent_node != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      if (new_node->prev == NULL && new_node->next == NULL)
Packit 98cdb6
        {
Packit 98cdb6
	  gtk_tree_path_up (path);
Packit 98cdb6
	  gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  validate_tree ((GtkTreeStore *)tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_insert_with_valuesv:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out) (allow-none): An unset #GtkTreeIter to set the new row, or %NULL.
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * @position: position to insert the new row
Packit 98cdb6
 * @columns: (array length=n_values): an array of column numbers
Packit 98cdb6
 * @values: (array length=n_values): an array of GValues
Packit 98cdb6
 * @n_values: the length of the @columns and @values arrays
Packit 98cdb6
 *
Packit 98cdb6
 * A variant of gtk_tree_store_insert_with_values() which takes
Packit 98cdb6
 * the columns and values as two arrays, instead of varargs.  This
Packit 98cdb6
 * function is mainly intended for language bindings.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.10
Packit 98cdb6
 */
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_insert_with_valuesv (GtkTreeStore *tree_store,
Packit 98cdb6
				    GtkTreeIter  *iter,
Packit 98cdb6
				    GtkTreeIter  *parent,
Packit 98cdb6
				    gint          position,
Packit 98cdb6
				    gint         *columns,
Packit 98cdb6
				    GValue       *values,
Packit 98cdb6
				    gint          n_values)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
  GNode *new_node;
Packit 98cdb6
  GtkTreeIter tmp_iter;
Packit 98cdb6
  gboolean changed = FALSE;
Packit 98cdb6
  gboolean maybe_need_sort = FALSE;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
Packit 98cdb6
  if (!iter)
Packit 98cdb6
    iter = &tmp_iter;
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent)
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  new_node = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
  iter->stamp = tree_store->stamp;
Packit 98cdb6
  iter->user_data = new_node;
Packit 98cdb6
  g_node_insert (parent_node, position, new_node);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_set_vector_internal (tree_store, iter,
Packit 98cdb6
				      &changed, &maybe_need_sort,
Packit 98cdb6
				      columns, values, n_values);
Packit 98cdb6
Packit 98cdb6
  if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, FALSE);
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
  gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
  if (parent_node != tree_store->root)
Packit 98cdb6
    {
Packit 98cdb6
      if (new_node->prev == NULL && new_node->next == NULL)
Packit 98cdb6
        {
Packit 98cdb6
	  gtk_tree_path_up (path);
Packit 98cdb6
	  gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
Packit 98cdb6
  validate_tree ((GtkTreeStore *)tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_prepend:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out): An unset #GtkTreeIter to set to the prepended row
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * 
Packit 98cdb6
 * Prepends a new row to @tree_store.  If @parent is non-%NULL, then it will prepend
Packit 98cdb6
 * the new row before the first child of @parent, otherwise it will prepend a row
Packit 98cdb6
 * to the top level.  @iter will be changed to point to this new row.  The row
Packit 98cdb6
 * will be empty after this function is called.  To fill in values, you need to
Packit 98cdb6
 * call gtk_tree_store_set() or gtk_tree_store_set_value().
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_prepend (GtkTreeStore *tree_store,
Packit 98cdb6
			GtkTreeIter  *iter,
Packit 98cdb6
			GtkTreeIter  *parent)
Packit 98cdb6
{
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (iter != NULL);
Packit 98cdb6
  if (parent != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  if (parent == NULL)
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
Packit 98cdb6
  if (parent_node->children == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreePath *path;
Packit 98cdb6
      
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      iter->user_data = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
      g_node_prepend (parent_node, G_NODE (iter->user_data));
Packit 98cdb6
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
      if (parent_node != tree_store->root)
Packit 98cdb6
	{
Packit 98cdb6
	  gtk_tree_path_up (path);
Packit 98cdb6
	  gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
Packit 98cdb6
	}
Packit 98cdb6
      gtk_tree_path_free (path);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_append:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: (out): An unset #GtkTreeIter to set to the appended row
Packit 98cdb6
 * @parent: (allow-none): A valid #GtkTreeIter, or %NULL
Packit 98cdb6
 * 
Packit 98cdb6
 * Appends a new row to @tree_store.  If @parent is non-%NULL, then it will append the
Packit 98cdb6
 * new row after the last child of @parent, otherwise it will append a row to
Packit 98cdb6
 * the top level.  @iter will be changed to point to this new row.  The row will
Packit 98cdb6
 * be empty after this function is called.  To fill in values, you need to call
Packit 98cdb6
 * gtk_tree_store_set() or gtk_tree_store_set_value().
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_append (GtkTreeStore *tree_store,
Packit 98cdb6
		       GtkTreeIter  *iter,
Packit 98cdb6
		       GtkTreeIter  *parent)
Packit 98cdb6
{
Packit 98cdb6
  GNode *parent_node;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (iter != NULL);
Packit 98cdb6
  if (parent != NULL)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (parent, tree_store));
Packit 98cdb6
Packit 98cdb6
  if (parent == NULL)
Packit 98cdb6
    parent_node = tree_store->root;
Packit 98cdb6
  else
Packit 98cdb6
    parent_node = parent->user_data;
Packit 98cdb6
Packit 98cdb6
  tree_store->columns_dirty = TRUE;
Packit 98cdb6
Packit 98cdb6
  if (parent_node->children == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreePath *path;
Packit 98cdb6
Packit 98cdb6
      iter->stamp = tree_store->stamp;
Packit 98cdb6
      iter->user_data = g_node_new (NULL);
Packit 98cdb6
Packit 98cdb6
      g_node_append (parent_node, G_NODE (iter->user_data));
Packit 98cdb6
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
Packit 98cdb6
Packit 98cdb6
      if (parent_node != tree_store->root)
Packit 98cdb6
	{
Packit 98cdb6
	  gtk_tree_path_up (path);
Packit 98cdb6
	  gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
Packit 98cdb6
	}
Packit 98cdb6
      gtk_tree_path_free (path);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_is_ancestor:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter
Packit 98cdb6
 * @descendant: A valid #GtkTreeIter
Packit 98cdb6
 * 
Packit 98cdb6
 * Returns %TRUE if @iter is an ancestor of @descendant.  That is, @iter is the
Packit 98cdb6
 * parent (or grandparent or great-grandparent) of @descendant.
Packit 98cdb6
 * 
Packit 98cdb6
 * Return value: %TRUE, if @iter is an ancestor of @descendant
Packit 98cdb6
 **/
Packit 98cdb6
gboolean
Packit 98cdb6
gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
Packit 98cdb6
			    GtkTreeIter  *iter,
Packit 98cdb6
			    GtkTreeIter  *descendant)
Packit 98cdb6
{
Packit 98cdb6
  g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
Packit 98cdb6
Packit 98cdb6
  return g_node_is_ancestor (G_NODE (iter->user_data),
Packit 98cdb6
			     G_NODE (descendant->user_data));
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_iter_depth:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore
Packit 98cdb6
 * @iter: A valid #GtkTreeIter
Packit 98cdb6
 * 
Packit 98cdb6
 * Returns the depth of @iter.  This will be 0 for anything on the root level, 1
Packit 98cdb6
 * for anything down a level, etc.
Packit 98cdb6
 * 
Packit 98cdb6
 * Return value: The depth of @iter
Packit 98cdb6
 **/
Packit 98cdb6
gint
Packit 98cdb6
gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
Packit 98cdb6
			   GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
Packit 98cdb6
  g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
Packit 98cdb6
Packit 98cdb6
  return g_node_depth (G_NODE (iter->user_data)) - 2;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* simple ripoff from g_node_traverse_post_order */
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_clear_traverse (GNode        *node,
Packit 98cdb6
			       GtkTreeStore *store)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeIter iter;
Packit 98cdb6
Packit 98cdb6
  if (node->children)
Packit 98cdb6
    {
Packit 98cdb6
      GNode *child;
Packit 98cdb6
Packit 98cdb6
      child = node->children;
Packit 98cdb6
      while (child)
Packit 98cdb6
        {
Packit 98cdb6
	  register GNode *current;
Packit 98cdb6
Packit 98cdb6
	  current = child;
Packit 98cdb6
	  child = current->next;
Packit 98cdb6
	  if (gtk_tree_store_clear_traverse (current, store))
Packit 98cdb6
	    return TRUE;
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      if (node->parent)
Packit 98cdb6
        {
Packit 98cdb6
	  iter.stamp = store->stamp;
Packit 98cdb6
	  iter.user_data = node;
Packit 98cdb6
Packit 98cdb6
	  gtk_tree_store_remove (store, &iter);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
  else if (node->parent)
Packit 98cdb6
    {
Packit 98cdb6
      iter.stamp = store->stamp;
Packit 98cdb6
      iter.user_data = node;
Packit 98cdb6
Packit 98cdb6
      gtk_tree_store_remove (store, &iter);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_increment_stamp (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  do
Packit 98cdb6
    {
Packit 98cdb6
      tree_store->stamp++;
Packit 98cdb6
    }
Packit 98cdb6
  while (tree_store->stamp == 0);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_clear:
Packit 98cdb6
 * @tree_store: a #GtkTreeStore
Packit 98cdb6
 * 
Packit 98cdb6
 * Removes all rows from @tree_store
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_clear (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_clear_traverse (tree_store->root, tree_store);
Packit 98cdb6
  gtk_tree_store_increment_stamp (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
Packit 98cdb6
				     GNode       *first)
Packit 98cdb6
{
Packit 98cdb6
  GNode *node;
Packit 98cdb6
Packit 98cdb6
  node = first;
Packit 98cdb6
Packit 98cdb6
  do
Packit 98cdb6
    {
Packit 98cdb6
      if (node == iter->user_data)
Packit 98cdb6
	return TRUE;
Packit 98cdb6
Packit 98cdb6
      if (node->children)
Packit 98cdb6
	if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
Packit 98cdb6
	  return TRUE;
Packit 98cdb6
Packit 98cdb6
      node = node->next;
Packit 98cdb6
    }
Packit 98cdb6
  while (node);
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_iter_is_valid:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore.
Packit 98cdb6
 * @iter: A #GtkTreeIter.
Packit 98cdb6
 *
Packit 98cdb6
 * WARNING: This function is slow. Only use it for debugging and/or testing
Packit 98cdb6
 * purposes.
Packit 98cdb6
 *
Packit 98cdb6
 * Checks if the given iter is a valid iter for this #GtkTreeStore.
Packit 98cdb6
 *
Packit 98cdb6
 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.2
Packit 98cdb6
 **/
Packit 98cdb6
gboolean
Packit 98cdb6
gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
Packit 98cdb6
                              GtkTreeIter  *iter)
Packit 98cdb6
{
Packit 98cdb6
  g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
Packit 98cdb6
  g_return_val_if_fail (iter != NULL, FALSE);
Packit 98cdb6
Packit 98cdb6
  if (!VALID_ITER (iter, tree_store))
Packit 98cdb6
    return FALSE;
Packit 98cdb6
Packit 98cdb6
  return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* DND */
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
Packit 98cdb6
                                                   GtkTreePath       *path)
Packit 98cdb6
{
Packit 98cdb6
  return TRUE;
Packit 98cdb6
}
Packit 98cdb6
               
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
Packit 98cdb6
                                 GtkTreePath       *path)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeIter iter;
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_store_get_iter (GTK_TREE_MODEL (drag_source),
Packit 98cdb6
                               &iter,
Packit 98cdb6
                               path))
Packit 98cdb6
    {
Packit 98cdb6
      gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
Packit 98cdb6
                             &iter);
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      return FALSE;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
Packit 98cdb6
                              GtkTreePath       *path,
Packit 98cdb6
                              GtkSelectionData  *selection_data)
Packit 98cdb6
{
Packit 98cdb6
  /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
Packit 98cdb6
   * target, because the default handler does it for us, but
Packit 98cdb6
   * we do anyway for the convenience of someone maybe overriding the
Packit 98cdb6
   * default handler.
Packit 98cdb6
   */
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_set_row_drag_data (selection_data,
Packit 98cdb6
				  GTK_TREE_MODEL (drag_source),
Packit 98cdb6
				  path))
Packit 98cdb6
    {
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      /* FIXME handle text targets at least. */
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
copy_node_data (GtkTreeStore *tree_store,
Packit 98cdb6
                GtkTreeIter  *src_iter,
Packit 98cdb6
                GtkTreeIter  *dest_iter)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
Packit 98cdb6
  GtkTreeDataList *copy_head = NULL;
Packit 98cdb6
  GtkTreeDataList *copy_prev = NULL;
Packit 98cdb6
  GtkTreeDataList *copy_iter = NULL;
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  gint col;
Packit 98cdb6
Packit 98cdb6
  col = 0;
Packit 98cdb6
  while (dl)
Packit 98cdb6
    {
Packit 98cdb6
      copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
Packit 98cdb6
Packit 98cdb6
      if (copy_head == NULL)
Packit 98cdb6
        copy_head = copy_iter;
Packit 98cdb6
Packit 98cdb6
      if (copy_prev)
Packit 98cdb6
        copy_prev->next = copy_iter;
Packit 98cdb6
Packit 98cdb6
      copy_prev = copy_iter;
Packit 98cdb6
Packit 98cdb6
      dl = dl->next;
Packit 98cdb6
      ++col;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  G_NODE (dest_iter->user_data)->data = copy_head;
Packit 98cdb6
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
Packit 98cdb6
  gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
recursive_node_copy (GtkTreeStore *tree_store,
Packit 98cdb6
                     GtkTreeIter  *src_iter,
Packit 98cdb6
                     GtkTreeIter  *dest_iter)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeIter child;
Packit 98cdb6
  GtkTreeModel *model;
Packit 98cdb6
Packit 98cdb6
  model = GTK_TREE_MODEL (tree_store);
Packit 98cdb6
Packit 98cdb6
  copy_node_data (tree_store, src_iter, dest_iter);
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_store_iter_children (model,
Packit 98cdb6
                                    &child,
Packit 98cdb6
                                    src_iter))
Packit 98cdb6
    {
Packit 98cdb6
      /* Need to create children and recurse. Note our
Packit 98cdb6
       * dependence on persistent iterators here.
Packit 98cdb6
       */
Packit 98cdb6
      do
Packit 98cdb6
        {
Packit 98cdb6
          GtkTreeIter copy;
Packit 98cdb6
Packit 98cdb6
          /* Gee, a really slow algorithm... ;-) FIXME */
Packit 98cdb6
          gtk_tree_store_append (tree_store,
Packit 98cdb6
                                 &copy,
Packit 98cdb6
                                 dest_iter);
Packit 98cdb6
Packit 98cdb6
          recursive_node_copy (tree_store, &child, ©);
Packit 98cdb6
        }
Packit 98cdb6
      while (gtk_tree_store_iter_next (model, &child));
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_drag_data_received (GtkTreeDragDest   *drag_dest,
Packit 98cdb6
                                   GtkTreePath       *dest,
Packit 98cdb6
                                   GtkSelectionData  *selection_data)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeModel *tree_model;
Packit 98cdb6
  GtkTreeStore *tree_store;
Packit 98cdb6
  GtkTreeModel *src_model = NULL;
Packit 98cdb6
  GtkTreePath *src_path = NULL;
Packit 98cdb6
  gboolean retval = FALSE;
Packit 98cdb6
Packit 98cdb6
  tree_model = GTK_TREE_MODEL (drag_dest);
Packit 98cdb6
  tree_store = GTK_TREE_STORE (drag_dest);
Packit 98cdb6
Packit 98cdb6
  validate_tree (tree_store);
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_get_row_drag_data (selection_data,
Packit 98cdb6
				  &src_model,
Packit 98cdb6
				  &src_path) &&
Packit 98cdb6
      src_model == tree_model)
Packit 98cdb6
    {
Packit 98cdb6
      /* Copy the given row to a new position */
Packit 98cdb6
      GtkTreeIter src_iter;
Packit 98cdb6
      GtkTreeIter dest_iter;
Packit 98cdb6
      GtkTreePath *prev;
Packit 98cdb6
Packit 98cdb6
      if (!gtk_tree_store_get_iter (src_model,
Packit 98cdb6
                                    &src_iter,
Packit 98cdb6
                                    src_path))
Packit 98cdb6
        {
Packit 98cdb6
          goto out;
Packit 98cdb6
        }
Packit 98cdb6
Packit 98cdb6
      /* Get the path to insert _after_ (dest is the path to insert _before_) */
Packit 98cdb6
      prev = gtk_tree_path_copy (dest);
Packit 98cdb6
Packit 98cdb6
      if (!gtk_tree_path_prev (prev))
Packit 98cdb6
        {
Packit 98cdb6
          GtkTreeIter dest_parent;
Packit 98cdb6
          GtkTreePath *parent;
Packit 98cdb6
          GtkTreeIter *dest_parent_p;
Packit 98cdb6
Packit 98cdb6
          /* dest was the first spot at the current depth; which means
Packit 98cdb6
           * we are supposed to prepend.
Packit 98cdb6
           */
Packit 98cdb6
Packit 98cdb6
          /* Get the parent, NULL if parent is the root */
Packit 98cdb6
          dest_parent_p = NULL;
Packit 98cdb6
          parent = gtk_tree_path_copy (dest);
Packit 98cdb6
          if (gtk_tree_path_up (parent) &&
Packit 98cdb6
	      gtk_tree_path_get_depth (parent) > 0)
Packit 98cdb6
            {
Packit 98cdb6
              gtk_tree_store_get_iter (tree_model,
Packit 98cdb6
                                       &dest_parent,
Packit 98cdb6
                                       parent);
Packit 98cdb6
              dest_parent_p = &dest_parent;
Packit 98cdb6
            }
Packit 98cdb6
          gtk_tree_path_free (parent);
Packit 98cdb6
          parent = NULL;
Packit 98cdb6
Packit 98cdb6
          gtk_tree_store_prepend (tree_store,
Packit 98cdb6
                                  &dest_iter,
Packit 98cdb6
                                  dest_parent_p);
Packit 98cdb6
Packit 98cdb6
          retval = TRUE;
Packit 98cdb6
        }
Packit 98cdb6
      else
Packit 98cdb6
        {
Packit 98cdb6
          if (gtk_tree_store_get_iter (tree_model, &dest_iter, prev))
Packit 98cdb6
            {
Packit 98cdb6
              GtkTreeIter tmp_iter = dest_iter;
Packit 98cdb6
Packit 98cdb6
              gtk_tree_store_insert_after (tree_store, &dest_iter, NULL,
Packit 98cdb6
                                           &tmp_iter);
Packit 98cdb6
Packit 98cdb6
              retval = TRUE;
Packit 98cdb6
            }
Packit 98cdb6
        }
Packit 98cdb6
Packit 98cdb6
      gtk_tree_path_free (prev);
Packit 98cdb6
Packit 98cdb6
      /* If we succeeded in creating dest_iter, walk src_iter tree branch,
Packit 98cdb6
       * duplicating it below dest_iter.
Packit 98cdb6
       */
Packit 98cdb6
Packit 98cdb6
      if (retval)
Packit 98cdb6
        {
Packit 98cdb6
          recursive_node_copy (tree_store,
Packit 98cdb6
                               &src_iter,
Packit 98cdb6
                               &dest_iter);
Packit 98cdb6
        }
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      /* FIXME maybe add some data targets eventually, or handle text
Packit 98cdb6
       * targets in the simple case.
Packit 98cdb6
       */
Packit 98cdb6
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
 out:
Packit 98cdb6
Packit 98cdb6
  if (src_path)
Packit 98cdb6
    gtk_tree_path_free (src_path);
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_row_drop_possible (GtkTreeDragDest  *drag_dest,
Packit 98cdb6
                                  GtkTreePath      *dest_path,
Packit 98cdb6
				  GtkSelectionData *selection_data)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeModel *src_model = NULL;
Packit 98cdb6
  GtkTreePath *src_path = NULL;
Packit 98cdb6
  GtkTreePath *tmp = NULL;
Packit 98cdb6
  gboolean retval = FALSE;
Packit 98cdb6
  
Packit 98cdb6
  /* don't accept drops if the tree has been sorted */
Packit 98cdb6
  if (GTK_TREE_STORE_IS_SORTED (drag_dest))
Packit 98cdb6
    return FALSE;
Packit 98cdb6
Packit 98cdb6
  if (!gtk_tree_get_row_drag_data (selection_data,
Packit 98cdb6
				   &src_model,
Packit 98cdb6
				   &src_path))
Packit 98cdb6
    goto out;
Packit 98cdb6
    
Packit 98cdb6
  /* can only drag to ourselves */
Packit 98cdb6
  if (src_model != GTK_TREE_MODEL (drag_dest))
Packit 98cdb6
    goto out;
Packit 98cdb6
Packit 98cdb6
  /* Can't drop into ourself. */
Packit 98cdb6
  if (gtk_tree_path_is_ancestor (src_path,
Packit 98cdb6
                                 dest_path))
Packit 98cdb6
    goto out;
Packit 98cdb6
Packit 98cdb6
  /* Can't drop if dest_path's parent doesn't exist */
Packit 98cdb6
  {
Packit 98cdb6
    GtkTreeIter iter;
Packit 98cdb6
Packit 98cdb6
    if (gtk_tree_path_get_depth (dest_path) > 1)
Packit 98cdb6
      {
Packit 98cdb6
	tmp = gtk_tree_path_copy (dest_path);
Packit 98cdb6
	gtk_tree_path_up (tmp);
Packit 98cdb6
	
Packit 98cdb6
	if (!gtk_tree_store_get_iter (GTK_TREE_MODEL (drag_dest),
Packit 98cdb6
				      &iter, tmp))
Packit 98cdb6
	  goto out;
Packit 98cdb6
      }
Packit 98cdb6
  }
Packit 98cdb6
  
Packit 98cdb6
  /* Can otherwise drop anywhere. */
Packit 98cdb6
  retval = TRUE;
Packit 98cdb6
Packit 98cdb6
 out:
Packit 98cdb6
Packit 98cdb6
  if (src_path)
Packit 98cdb6
    gtk_tree_path_free (src_path);
Packit 98cdb6
  if (tmp)
Packit 98cdb6
    gtk_tree_path_free (tmp);
Packit 98cdb6
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* Sorting and reordering */
Packit 98cdb6
typedef struct _SortTuple
Packit 98cdb6
{
Packit 98cdb6
  gint offset;
Packit 98cdb6
  GNode *node;
Packit 98cdb6
} SortTuple;
Packit 98cdb6
Packit 98cdb6
/* Reordering */
Packit 98cdb6
static gint
Packit 98cdb6
gtk_tree_store_reorder_func (gconstpointer a,
Packit 98cdb6
			     gconstpointer b,
Packit 98cdb6
			     gpointer      user_data)
Packit 98cdb6
{
Packit 98cdb6
  SortTuple *a_reorder;
Packit 98cdb6
  SortTuple *b_reorder;
Packit 98cdb6
Packit 98cdb6
  a_reorder = (SortTuple *)a;
Packit 98cdb6
  b_reorder = (SortTuple *)b;
Packit 98cdb6
Packit 98cdb6
  if (a_reorder->offset < b_reorder->offset)
Packit 98cdb6
    return -1;
Packit 98cdb6
  if (a_reorder->offset > b_reorder->offset)
Packit 98cdb6
    return 1;
Packit 98cdb6
Packit 98cdb6
  return 0;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_reorder:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore.
Packit 98cdb6
 * @parent: A #GtkTreeIter.
Packit 98cdb6
 * @new_order: (array): an array of integers mapping the new position of each child
Packit 98cdb6
 *      to its old position before the re-ordering,
Packit 98cdb6
 *      i.e. @new_order<literal>[newpos] = oldpos</literal>.
Packit 98cdb6
 *
Packit 98cdb6
 * Reorders the children of @parent in @tree_store to follow the order
Packit 98cdb6
 * indicated by @new_order. Note that this function only works with
Packit 98cdb6
 * unsorted stores.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.2
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_reorder (GtkTreeStore *tree_store,
Packit 98cdb6
			GtkTreeIter  *parent,
Packit 98cdb6
			gint         *new_order)
Packit 98cdb6
{
Packit 98cdb6
  gint i, length = 0;
Packit 98cdb6
  GNode *level, *node;
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
  SortTuple *sort_array;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
Packit 98cdb6
  g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
Packit 98cdb6
  g_return_if_fail (new_order != NULL);
Packit 98cdb6
Packit 98cdb6
  if (!parent)
Packit 98cdb6
    level = G_NODE (tree_store->root)->children;
Packit 98cdb6
  else
Packit 98cdb6
    level = G_NODE (parent->user_data)->children;
Packit 98cdb6
Packit 98cdb6
  /* count nodes */
Packit 98cdb6
  node = level;
Packit 98cdb6
  while (node)
Packit 98cdb6
    {
Packit 98cdb6
      length++;
Packit 98cdb6
      node = node->next;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* set up sortarray */
Packit 98cdb6
  sort_array = g_new (SortTuple, length);
Packit 98cdb6
Packit 98cdb6
  node = level;
Packit 98cdb6
  for (i = 0; i < length; i++)
Packit 98cdb6
    {
Packit 98cdb6
      sort_array[new_order[i]].offset = i;
Packit 98cdb6
      sort_array[i].node = node;
Packit 98cdb6
Packit 98cdb6
      node = node->next;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  g_qsort_with_data (sort_array,
Packit 98cdb6
		     length,
Packit 98cdb6
		     sizeof (SortTuple),
Packit 98cdb6
		     gtk_tree_store_reorder_func,
Packit 98cdb6
		     NULL);
Packit 98cdb6
Packit 98cdb6
  /* fix up level */
Packit 98cdb6
  for (i = 0; i < length - 1; i++)
Packit 98cdb6
    {
Packit 98cdb6
      sort_array[i].node->next = sort_array[i+1].node;
Packit 98cdb6
      sort_array[i+1].node->prev = sort_array[i].node;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  sort_array[length-1].node->next = NULL;
Packit 98cdb6
  sort_array[0].node->prev = NULL;
Packit 98cdb6
  if (parent)
Packit 98cdb6
    G_NODE (parent->user_data)->children = sort_array[0].node;
Packit 98cdb6
  else
Packit 98cdb6
    G_NODE (tree_store->root)->children = sort_array[0].node;
Packit 98cdb6
Packit 98cdb6
  /* emit signal */
Packit 98cdb6
  if (parent)
Packit 98cdb6
    path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), parent);
Packit 98cdb6
  else
Packit 98cdb6
    path = gtk_tree_path_new ();
Packit 98cdb6
  gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
Packit 98cdb6
				 parent, new_order);
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
  g_free (sort_array);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_swap:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore.
Packit 98cdb6
 * @a: A #GtkTreeIter.
Packit 98cdb6
 * @b: Another #GtkTreeIter.
Packit 98cdb6
 *
Packit 98cdb6
 * Swaps @a and @b in the same level of @tree_store. Note that this function
Packit 98cdb6
 * only works with unsorted stores.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.2
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_swap (GtkTreeStore *tree_store,
Packit 98cdb6
		     GtkTreeIter  *a,
Packit 98cdb6
		     GtkTreeIter  *b)
Packit 98cdb6
{
Packit 98cdb6
  GNode *tmp, *node_a, *node_b, *parent_node;
Packit 98cdb6
  GNode *a_prev, *a_next, *b_prev, *b_next;
Packit 98cdb6
  gint i, a_count, b_count, length, *order;
Packit 98cdb6
  GtkTreePath *path_a, *path_b;
Packit 98cdb6
  GtkTreeIter parent;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (a, tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (b, tree_store));
Packit 98cdb6
Packit 98cdb6
  node_a = G_NODE (a->user_data);
Packit 98cdb6
  node_b = G_NODE (b->user_data);
Packit 98cdb6
Packit 98cdb6
  /* basic sanity checking */
Packit 98cdb6
  if (node_a == node_b)
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  path_a = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), a);
Packit 98cdb6
  path_b = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), b);
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (path_a && path_b);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_up (path_a);
Packit 98cdb6
  gtk_tree_path_up (path_b);
Packit 98cdb6
Packit 98cdb6
  if (gtk_tree_path_get_depth (path_a) == 0
Packit 98cdb6
      || gtk_tree_path_get_depth (path_b) == 0)
Packit 98cdb6
    {
Packit 98cdb6
      if (gtk_tree_path_get_depth (path_a) != gtk_tree_path_get_depth (path_b))
Packit 98cdb6
        {
Packit 98cdb6
          gtk_tree_path_free (path_a);
Packit 98cdb6
          gtk_tree_path_free (path_b);
Packit 98cdb6
                                                                                
Packit 98cdb6
          g_warning ("Given children are not in the same level\n");
Packit 98cdb6
          return;
Packit 98cdb6
        }
Packit 98cdb6
      parent_node = G_NODE (tree_store->root);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      if (gtk_tree_path_compare (path_a, path_b))
Packit 98cdb6
        {
Packit 98cdb6
          gtk_tree_path_free (path_a);
Packit 98cdb6
          gtk_tree_path_free (path_b);
Packit 98cdb6
                                                                                
Packit 98cdb6
          g_warning ("Given children don't have a common parent\n");
Packit 98cdb6
          return;
Packit 98cdb6
        }
Packit 98cdb6
      gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), &parent,
Packit 98cdb6
                               path_a);
Packit 98cdb6
      parent_node = G_NODE (parent.user_data);
Packit 98cdb6
    }
Packit 98cdb6
  gtk_tree_path_free (path_b);
Packit 98cdb6
Packit 98cdb6
  /* old links which we have to keep around */
Packit 98cdb6
  a_prev = node_a->prev;
Packit 98cdb6
  a_next = node_a->next;
Packit 98cdb6
Packit 98cdb6
  b_prev = node_b->prev;
Packit 98cdb6
  b_next = node_b->next;
Packit 98cdb6
Packit 98cdb6
  /* fix up links if the nodes are next to eachother */
Packit 98cdb6
  if (a_prev == node_b)
Packit 98cdb6
    a_prev = node_a;
Packit 98cdb6
  if (a_next == node_b)
Packit 98cdb6
    a_next = node_a;
Packit 98cdb6
Packit 98cdb6
  if (b_prev == node_a)
Packit 98cdb6
    b_prev = node_b;
Packit 98cdb6
  if (b_next == node_a)
Packit 98cdb6
    b_next = node_b;
Packit 98cdb6
Packit 98cdb6
  /* counting nodes */
Packit 98cdb6
  tmp = parent_node->children;
Packit 98cdb6
  i = a_count = b_count = 0;
Packit 98cdb6
  while (tmp)
Packit 98cdb6
    {
Packit 98cdb6
      if (tmp == node_a)
Packit 98cdb6
	a_count = i;
Packit 98cdb6
      if (tmp == node_b)
Packit 98cdb6
	b_count = i;
Packit 98cdb6
Packit 98cdb6
      tmp = tmp->next;
Packit 98cdb6
      i++;
Packit 98cdb6
    }
Packit 98cdb6
  length = i;
Packit 98cdb6
Packit 98cdb6
  /* hacking the tree */
Packit 98cdb6
  if (!a_prev)
Packit 98cdb6
    parent_node->children = node_b;
Packit 98cdb6
  else
Packit 98cdb6
    a_prev->next = node_b;
Packit 98cdb6
Packit 98cdb6
  if (a_next)
Packit 98cdb6
    a_next->prev = node_b;
Packit 98cdb6
Packit 98cdb6
  if (!b_prev)
Packit 98cdb6
    parent_node->children = node_a;
Packit 98cdb6
  else
Packit 98cdb6
    b_prev->next = node_a;
Packit 98cdb6
Packit 98cdb6
  if (b_next)
Packit 98cdb6
    b_next->prev = node_a;
Packit 98cdb6
Packit 98cdb6
  node_a->prev = b_prev;
Packit 98cdb6
  node_a->next = b_next;
Packit 98cdb6
Packit 98cdb6
  node_b->prev = a_prev;
Packit 98cdb6
  node_b->next = a_next;
Packit 98cdb6
Packit 98cdb6
  /* emit signal */
Packit 98cdb6
  order = g_new (gint, length);
Packit 98cdb6
  for (i = 0; i < length; i++)
Packit 98cdb6
    if (i == a_count)
Packit 98cdb6
      order[i] = b_count;
Packit 98cdb6
    else if (i == b_count)
Packit 98cdb6
      order[i] = a_count;
Packit 98cdb6
    else
Packit 98cdb6
      order[i] = i;
Packit 98cdb6
Packit 98cdb6
  gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
Packit 98cdb6
				 parent_node == tree_store->root 
Packit 98cdb6
				 ? NULL : &parent, order);
Packit 98cdb6
  gtk_tree_path_free (path_a);
Packit 98cdb6
  g_free (order);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* WARNING: this function is *incredibly* fragile. Please smashtest after
Packit 98cdb6
 * making changes here.
Packit 98cdb6
 *	-Kris
Packit 98cdb6
 */
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_move (GtkTreeStore *tree_store,
Packit 98cdb6
                     GtkTreeIter  *iter,
Packit 98cdb6
		     GtkTreeIter  *position,
Packit 98cdb6
		     gboolean      before)
Packit 98cdb6
{
Packit 98cdb6
  GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
Packit 98cdb6
  gint old_pos, new_pos, length, i, *order;
Packit 98cdb6
  GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
Packit 98cdb6
  GtkTreeIter parent_iter, dst_a, dst_b;
Packit 98cdb6
  gint depth = 0;
Packit 98cdb6
  gboolean handle_b = TRUE;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
Packit 98cdb6
  g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
Packit 98cdb6
  g_return_if_fail (VALID_ITER (iter, tree_store));
Packit 98cdb6
  if (position)
Packit 98cdb6
    g_return_if_fail (VALID_ITER (position, tree_store));
Packit 98cdb6
Packit 98cdb6
  a = b = NULL;
Packit 98cdb6
Packit 98cdb6
  /* sanity checks */
Packit 98cdb6
  if (position)
Packit 98cdb6
    {
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      pos_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
	                                  position);
Packit 98cdb6
Packit 98cdb6
      /* if before:
Packit 98cdb6
       *   moving the iter before path or "path + 1" doesn't make sense
Packit 98cdb6
       * else
Packit 98cdb6
       *   moving the iter before path or "path - 1" doesn't make sense
Packit 98cdb6
       */
Packit 98cdb6
      if (!gtk_tree_path_compare (path, pos_path))
Packit 98cdb6
	goto free_paths_and_out;
Packit 98cdb6
Packit 98cdb6
      if (before)
Packit 98cdb6
        gtk_tree_path_next (path);
Packit 98cdb6
      else
Packit 98cdb6
        gtk_tree_path_prev (path);
Packit 98cdb6
Packit 98cdb6
      if (!gtk_tree_path_compare (path, pos_path))
Packit 98cdb6
	goto free_paths_and_out;
Packit 98cdb6
Packit 98cdb6
      if (before)
Packit 98cdb6
        gtk_tree_path_prev (path);
Packit 98cdb6
      else
Packit 98cdb6
        gtk_tree_path_next (path);
Packit 98cdb6
Packit 98cdb6
      if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
Packit 98cdb6
        {
Packit 98cdb6
          g_warning ("Given children are not in the same level\n");
Packit 98cdb6
Packit 98cdb6
	  goto free_paths_and_out;
Packit 98cdb6
        }
Packit 98cdb6
Packit 98cdb6
      tmppath = gtk_tree_path_copy (pos_path);
Packit 98cdb6
      gtk_tree_path_up (path);
Packit 98cdb6
      gtk_tree_path_up (tmppath);
Packit 98cdb6
Packit 98cdb6
      if (gtk_tree_path_get_depth (path) > 0 &&
Packit 98cdb6
	  gtk_tree_path_compare (path, tmppath))
Packit 98cdb6
        {
Packit 98cdb6
          g_warning ("Given children are not in the same level\n");
Packit 98cdb6
Packit 98cdb6
          gtk_tree_path_free (tmppath);
Packit 98cdb6
	  goto free_paths_and_out;
Packit 98cdb6
        }
Packit 98cdb6
Packit 98cdb6
      gtk_tree_path_free (tmppath);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (!path)
Packit 98cdb6
    {
Packit 98cdb6
      path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
Packit 98cdb6
      gtk_tree_path_up (path);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  depth = gtk_tree_path_get_depth (path);
Packit 98cdb6
Packit 98cdb6
  if (depth)
Packit 98cdb6
    {
Packit 98cdb6
      gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), 
Packit 98cdb6
			       &parent_iter, path);
Packit 98cdb6
Packit 98cdb6
      parent = G_NODE (parent_iter.user_data);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    parent = G_NODE (tree_store->root);
Packit 98cdb6
Packit 98cdb6
  /* yes, I know that this can be done shorter, but I'm doing it this way
Packit 98cdb6
   * so the code is also maintainable
Packit 98cdb6
   */
Packit 98cdb6
Packit 98cdb6
  if (before && position)
Packit 98cdb6
    {
Packit 98cdb6
      b = G_NODE (position->user_data);
Packit 98cdb6
Packit 98cdb6
      if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
Packit 98cdb6
        {
Packit 98cdb6
          gtk_tree_path_prev (pos_path);
Packit 98cdb6
          if (gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), 
Packit 98cdb6
				       &dst_a, pos_path))
Packit 98cdb6
            a = G_NODE (dst_a.user_data);
Packit 98cdb6
          else
Packit 98cdb6
            a = NULL;
Packit 98cdb6
          gtk_tree_path_next (pos_path);
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      /* if b is NULL, a is NULL too -- we are at the beginning of the list
Packit 98cdb6
       * yes and we leak memory here ...
Packit 98cdb6
       */
Packit 98cdb6
      g_return_if_fail (b);
Packit 98cdb6
    }
Packit 98cdb6
  else if (before && !position)
Packit 98cdb6
    {
Packit 98cdb6
      /* move before without position is appending */
Packit 98cdb6
      a = NULL;
Packit 98cdb6
      b = NULL;
Packit 98cdb6
    }
Packit 98cdb6
  else /* !before */
Packit 98cdb6
    {
Packit 98cdb6
      if (position)
Packit 98cdb6
        a = G_NODE (position->user_data);
Packit 98cdb6
      else
Packit 98cdb6
        a = NULL;
Packit 98cdb6
Packit 98cdb6
      if (position)
Packit 98cdb6
        {
Packit 98cdb6
          gtk_tree_path_next (pos_path);
Packit 98cdb6
          if (gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
Packit 98cdb6
             b = G_NODE (dst_b.user_data);
Packit 98cdb6
          else
Packit 98cdb6
             b = NULL;
Packit 98cdb6
          gtk_tree_path_prev (pos_path);
Packit 98cdb6
	}
Packit 98cdb6
      else
Packit 98cdb6
        {
Packit 98cdb6
	  /* move after without position is prepending */
Packit 98cdb6
	  if (depth)
Packit 98cdb6
	    gtk_tree_store_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
Packit 98cdb6
	                                  &parent_iter);
Packit 98cdb6
	  else
Packit 98cdb6
	    gtk_tree_store_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
Packit 98cdb6
		                          NULL);
Packit 98cdb6
Packit 98cdb6
	  b = G_NODE (dst_b.user_data);
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      /* if a is NULL, b is NULL too -- we are at the end of the list
Packit 98cdb6
       * yes and we leak memory here ...
Packit 98cdb6
       */
Packit 98cdb6
      if (position)
Packit 98cdb6
        g_return_if_fail (a);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* counting nodes */
Packit 98cdb6
  tmp = parent->children;
Packit 98cdb6
Packit 98cdb6
  length = old_pos = 0;
Packit 98cdb6
  while (tmp)
Packit 98cdb6
    {
Packit 98cdb6
      if (tmp == iter->user_data)
Packit 98cdb6
	old_pos = length;
Packit 98cdb6
Packit 98cdb6
      tmp = tmp->next;
Packit 98cdb6
      length++;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* remove node from list */
Packit 98cdb6
  node = G_NODE (iter->user_data);
Packit 98cdb6
  tmp_a = node->prev;
Packit 98cdb6
  tmp_b = node->next;
Packit 98cdb6
Packit 98cdb6
  if (tmp_a)
Packit 98cdb6
    tmp_a->next = tmp_b;
Packit 98cdb6
  else
Packit 98cdb6
    parent->children = tmp_b;
Packit 98cdb6
Packit 98cdb6
  if (tmp_b)
Packit 98cdb6
    tmp_b->prev = tmp_a;
Packit 98cdb6
Packit 98cdb6
  /* and reinsert the node */
Packit 98cdb6
  if (a)
Packit 98cdb6
    {
Packit 98cdb6
      tmp = a->next;
Packit 98cdb6
Packit 98cdb6
      a->next = node;
Packit 98cdb6
      node->next = tmp;
Packit 98cdb6
      node->prev = a;
Packit 98cdb6
    }
Packit 98cdb6
  else if (!a && !before)
Packit 98cdb6
    {
Packit 98cdb6
      tmp = parent->children;
Packit 98cdb6
Packit 98cdb6
      node->prev = NULL;
Packit 98cdb6
      parent->children = node;
Packit 98cdb6
Packit 98cdb6
      node->next = tmp;
Packit 98cdb6
      if (tmp) 
Packit 98cdb6
	tmp->prev = node;
Packit 98cdb6
Packit 98cdb6
      handle_b = FALSE;
Packit 98cdb6
    }
Packit 98cdb6
  else if (!a && before)
Packit 98cdb6
    {
Packit 98cdb6
      if (!position)
Packit 98cdb6
        {
Packit 98cdb6
          node->parent = NULL;
Packit 98cdb6
          node->next = node->prev = NULL;
Packit 98cdb6
Packit 98cdb6
          /* before with sibling = NULL appends */
Packit 98cdb6
          g_node_insert_before (parent, NULL, node);
Packit 98cdb6
	}
Packit 98cdb6
      else
Packit 98cdb6
        {
Packit 98cdb6
	  node->parent = NULL;
Packit 98cdb6
	  node->next = node->prev = NULL;
Packit 98cdb6
Packit 98cdb6
	  /* after with sibling = NULL prepends */
Packit 98cdb6
	  g_node_insert_after (parent, NULL, node);
Packit 98cdb6
	}
Packit 98cdb6
Packit 98cdb6
      handle_b = FALSE;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (handle_b)
Packit 98cdb6
    {
Packit 98cdb6
      if (b)
Packit 98cdb6
        {
Packit 98cdb6
          tmp = b->prev;
Packit 98cdb6
Packit 98cdb6
          b->prev = node;
Packit 98cdb6
          node->prev = tmp;
Packit 98cdb6
          node->next = b;
Packit 98cdb6
        }
Packit 98cdb6
      else if (!(!a && before)) /* !a && before is completely handled above */
Packit 98cdb6
        node->next = NULL;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* emit signal */
Packit 98cdb6
  if (position)
Packit 98cdb6
    new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
Packit 98cdb6
  else if (before)
Packit 98cdb6
    {
Packit 98cdb6
      if (depth)
Packit 98cdb6
        new_pos = gtk_tree_store_iter_n_children (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
	                                          &parent_iter) - 1;
Packit 98cdb6
      else
Packit 98cdb6
	new_pos = gtk_tree_store_iter_n_children (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
	                                          NULL) - 1;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    new_pos = 0;
Packit 98cdb6
Packit 98cdb6
  if (new_pos > old_pos)
Packit 98cdb6
    {
Packit 98cdb6
      if (before && position)
Packit 98cdb6
        new_pos--;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      if (!before && position)
Packit 98cdb6
        new_pos++;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  order = g_new (gint, length);
Packit 98cdb6
  if (new_pos > old_pos)
Packit 98cdb6
    {
Packit 98cdb6
      for (i = 0; i < length; i++)
Packit 98cdb6
        if (i < old_pos)
Packit 98cdb6
          order[i] = i;
Packit 98cdb6
        else if (i >= old_pos && i < new_pos)
Packit 98cdb6
          order[i] = i + 1;
Packit 98cdb6
        else if (i == new_pos)
Packit 98cdb6
          order[i] = old_pos;
Packit 98cdb6
        else
Packit 98cdb6
	  order[i] = i;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      for (i = 0; i < length; i++)
Packit 98cdb6
        if (i == new_pos)
Packit 98cdb6
	  order[i] = old_pos;
Packit 98cdb6
        else if (i > new_pos && i <= old_pos)
Packit 98cdb6
	  order[i] = i - 1;
Packit 98cdb6
	else
Packit 98cdb6
	  order[i] = i;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (depth)
Packit 98cdb6
    {
Packit 98cdb6
      tmppath = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), 
Packit 98cdb6
					 &parent_iter);
Packit 98cdb6
      gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
				     tmppath, &parent_iter, order);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      tmppath = gtk_tree_path_new ();
Packit 98cdb6
      gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
				     tmppath, NULL, order);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (tmppath);
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
  if (position)
Packit 98cdb6
    gtk_tree_path_free (pos_path);
Packit 98cdb6
  g_free (order);
Packit 98cdb6
Packit 98cdb6
  return;
Packit 98cdb6
Packit 98cdb6
free_paths_and_out:
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
  gtk_tree_path_free (pos_path);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_move_before:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore.
Packit 98cdb6
 * @iter: A #GtkTreeIter.
Packit 98cdb6
 * @position: (allow-none): A #GtkTreeIter or %NULL.
Packit 98cdb6
 *
Packit 98cdb6
 * Moves @iter in @tree_store to the position before @position. @iter and
Packit 98cdb6
 * @position should be in the same level. Note that this function only
Packit 98cdb6
 * works with unsorted stores. If @position is %NULL, @iter will be
Packit 98cdb6
 * moved to the end of the level.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.2
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_move_before (GtkTreeStore *tree_store,
Packit 98cdb6
                            GtkTreeIter  *iter,
Packit 98cdb6
			    GtkTreeIter  *position)
Packit 98cdb6
{
Packit 98cdb6
  gtk_tree_store_move (tree_store, iter, position, TRUE);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/**
Packit 98cdb6
 * gtk_tree_store_move_after:
Packit 98cdb6
 * @tree_store: A #GtkTreeStore.
Packit 98cdb6
 * @iter: A #GtkTreeIter.
Packit 98cdb6
 * @position: (allow-none): A #GtkTreeIter.
Packit 98cdb6
 *
Packit 98cdb6
 * Moves @iter in @tree_store to the position after @position. @iter and
Packit 98cdb6
 * @position should be in the same level. Note that this function only
Packit 98cdb6
 * works with unsorted stores. If @position is %NULL, @iter will be moved
Packit 98cdb6
 * to the start of the level.
Packit 98cdb6
 *
Packit 98cdb6
 * Since: 2.2
Packit 98cdb6
 **/
Packit 98cdb6
void
Packit 98cdb6
gtk_tree_store_move_after (GtkTreeStore *tree_store,
Packit 98cdb6
                           GtkTreeIter  *iter,
Packit 98cdb6
			   GtkTreeIter  *position)
Packit 98cdb6
{
Packit 98cdb6
  gtk_tree_store_move (tree_store, iter, position, FALSE);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* Sorting */
Packit 98cdb6
static gint
Packit 98cdb6
gtk_tree_store_compare_func (gconstpointer a,
Packit 98cdb6
			     gconstpointer b,
Packit 98cdb6
			     gpointer      user_data)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = user_data;
Packit 98cdb6
  GNode *node_a;
Packit 98cdb6
  GNode *node_b;
Packit 98cdb6
  GtkTreeIterCompareFunc func;
Packit 98cdb6
  gpointer data;
Packit 98cdb6
Packit 98cdb6
  GtkTreeIter iter_a;
Packit 98cdb6
  GtkTreeIter iter_b;
Packit 98cdb6
  gint retval;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_column_id != -1)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreeDataSortHeader *header;
Packit 98cdb6
Packit 98cdb6
      header = _gtk_tree_data_list_get_header (tree_store->sort_list,
Packit 98cdb6
					       tree_store->sort_column_id);
Packit 98cdb6
      g_return_val_if_fail (header != NULL, 0);
Packit 98cdb6
      g_return_val_if_fail (header->func != NULL, 0);
Packit 98cdb6
Packit 98cdb6
      func = header->func;
Packit 98cdb6
      data = header->data;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
Packit 98cdb6
      func = tree_store->default_sort_func;
Packit 98cdb6
      data = tree_store->default_sort_data;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  node_a = ((SortTuple *) a)->node;
Packit 98cdb6
  node_b = ((SortTuple *) b)->node;
Packit 98cdb6
Packit 98cdb6
  iter_a.stamp = tree_store->stamp;
Packit 98cdb6
  iter_a.user_data = node_a;
Packit 98cdb6
  iter_b.stamp = tree_store->stamp;
Packit 98cdb6
  iter_b.user_data = node_b;
Packit 98cdb6
Packit 98cdb6
  retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
Packit 98cdb6
Packit 98cdb6
  if (tree_store->order == GTK_SORT_DESCENDING)
Packit 98cdb6
    {
Packit 98cdb6
      if (retval > 0)
Packit 98cdb6
	retval = -1;
Packit 98cdb6
      else if (retval < 0)
Packit 98cdb6
	retval = 1;
Packit 98cdb6
    }
Packit 98cdb6
  return retval;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
Packit 98cdb6
			    GNode        *parent,
Packit 98cdb6
			    gboolean      recurse)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeIter iter;
Packit 98cdb6
  GArray *sort_array;
Packit 98cdb6
  GNode *node;
Packit 98cdb6
  GNode *tmp_node;
Packit 98cdb6
  gint list_length;
Packit 98cdb6
  gint i;
Packit 98cdb6
  gint *new_order;
Packit 98cdb6
  GtkTreePath *path;
Packit 98cdb6
Packit 98cdb6
  node = parent->children;
Packit 98cdb6
  if (node == NULL || node->next == NULL)
Packit 98cdb6
    {
Packit 98cdb6
      if (recurse && node && node->children)
Packit 98cdb6
        gtk_tree_store_sort_helper (tree_store, node, TRUE);
Packit 98cdb6
Packit 98cdb6
      return;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  list_length = 0;
Packit 98cdb6
  for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
Packit 98cdb6
    list_length++;
Packit 98cdb6
Packit 98cdb6
  sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
Packit 98cdb6
Packit 98cdb6
  i = 0;
Packit 98cdb6
  for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
Packit 98cdb6
    {
Packit 98cdb6
      SortTuple tuple;
Packit 98cdb6
Packit 98cdb6
      tuple.offset = i;
Packit 98cdb6
      tuple.node = tmp_node;
Packit 98cdb6
      g_array_append_val (sort_array, tuple);
Packit 98cdb6
      i++;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* Sort the array */
Packit 98cdb6
  g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
Packit 98cdb6
Packit 98cdb6
  for (i = 0; i < list_length - 1; i++)
Packit 98cdb6
    {
Packit 98cdb6
      g_array_index (sort_array, SortTuple, i).node->next =
Packit 98cdb6
	g_array_index (sort_array, SortTuple, i + 1).node;
Packit 98cdb6
      g_array_index (sort_array, SortTuple, i + 1).node->prev =
Packit 98cdb6
	g_array_index (sort_array, SortTuple, i).node;
Packit 98cdb6
    }
Packit 98cdb6
  g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
Packit 98cdb6
  g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
Packit 98cdb6
  parent->children = g_array_index (sort_array, SortTuple, 0).node;
Packit 98cdb6
Packit 98cdb6
  /* Let the world know about our new order */
Packit 98cdb6
  new_order = g_new (gint, list_length);
Packit 98cdb6
  for (i = 0; i < list_length; i++)
Packit 98cdb6
    new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
Packit 98cdb6
Packit 98cdb6
  iter.stamp = tree_store->stamp;
Packit 98cdb6
  iter.user_data = parent;
Packit 98cdb6
  path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
Packit 98cdb6
  gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
				 path, &iter, new_order);
Packit 98cdb6
  gtk_tree_path_free (path);
Packit 98cdb6
  g_free (new_order);
Packit 98cdb6
  g_array_free (sort_array, TRUE);
Packit 98cdb6
Packit 98cdb6
  if (recurse)
Packit 98cdb6
    {
Packit 98cdb6
      for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
Packit 98cdb6
	{
Packit 98cdb6
	  if (tmp_node->children)
Packit 98cdb6
	    gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_sort (GtkTreeStore *tree_store)
Packit 98cdb6
{
Packit 98cdb6
  if (!GTK_TREE_STORE_IS_SORTED (tree_store))
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_column_id != -1)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreeDataSortHeader *header = NULL;
Packit 98cdb6
Packit 98cdb6
      header = _gtk_tree_data_list_get_header (tree_store->sort_list, 
Packit 98cdb6
					       tree_store->sort_column_id);
Packit 98cdb6
Packit 98cdb6
      /* We want to make sure that we have a function */
Packit 98cdb6
      g_return_if_fail (header != NULL);
Packit 98cdb6
      g_return_if_fail (header->func != NULL);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      g_return_if_fail (tree_store->default_sort_func != NULL);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
Packit 98cdb6
				  GtkTreeIter  *iter,
Packit 98cdb6
				  gint          column,
Packit 98cdb6
				  gboolean      emit_signal)
Packit 98cdb6
{
Packit 98cdb6
  GNode *prev = NULL;
Packit 98cdb6
  GNode *next = NULL;
Packit 98cdb6
  GNode *node;
Packit 98cdb6
  GtkTreePath *tmp_path;
Packit 98cdb6
  GtkTreeIter tmp_iter;
Packit 98cdb6
  gint cmp_a = 0;
Packit 98cdb6
  gint cmp_b = 0;
Packit 98cdb6
  gint i;
Packit 98cdb6
  gint old_location;
Packit 98cdb6
  gint new_location;
Packit 98cdb6
  gint *new_order;
Packit 98cdb6
  gint length;
Packit 98cdb6
  GtkTreeIterCompareFunc func;
Packit 98cdb6
  gpointer data;
Packit 98cdb6
Packit 98cdb6
  g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
Packit 98cdb6
Packit 98cdb6
  tmp_iter.stamp = tree_store->stamp;
Packit 98cdb6
  if (tree_store->sort_column_id != -1)
Packit 98cdb6
    {
Packit 98cdb6
      GtkTreeDataSortHeader *header;
Packit 98cdb6
      header = _gtk_tree_data_list_get_header (tree_store->sort_list,
Packit 98cdb6
					       tree_store->sort_column_id);
Packit 98cdb6
      g_return_if_fail (header != NULL);
Packit 98cdb6
      g_return_if_fail (header->func != NULL);
Packit 98cdb6
      func = header->func;
Packit 98cdb6
      data = header->data;
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      g_return_if_fail (tree_store->default_sort_func != NULL);
Packit 98cdb6
      func = tree_store->default_sort_func;
Packit 98cdb6
      data = tree_store->default_sort_data;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  /* If it's the built in function, we don't sort. */
Packit 98cdb6
  if (func == _gtk_tree_data_list_compare_func &&
Packit 98cdb6
      tree_store->sort_column_id != column)
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  old_location = 0;
Packit 98cdb6
  node = G_NODE (iter->user_data)->parent->children;
Packit 98cdb6
  /* First we find the iter, its prev, and its next */
Packit 98cdb6
  while (node)
Packit 98cdb6
    {
Packit 98cdb6
      if (node == G_NODE (iter->user_data))
Packit 98cdb6
	break;
Packit 98cdb6
      old_location++;
Packit 98cdb6
      node = node->next;
Packit 98cdb6
    }
Packit 98cdb6
  g_assert (node != NULL);
Packit 98cdb6
Packit 98cdb6
  prev = node->prev;
Packit 98cdb6
  next = node->next;
Packit 98cdb6
Packit 98cdb6
  /* Check the common case, where we don't need to sort it moved. */
Packit 98cdb6
  if (prev != NULL)
Packit 98cdb6
    {
Packit 98cdb6
      tmp_iter.user_data = prev;
Packit 98cdb6
      cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (next != NULL)
Packit 98cdb6
    {
Packit 98cdb6
      tmp_iter.user_data = next;
Packit 98cdb6
      cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (tree_store->order == GTK_SORT_DESCENDING)
Packit 98cdb6
    {
Packit 98cdb6
      if (cmp_a < 0)
Packit 98cdb6
	cmp_a = 1;
Packit 98cdb6
      else if (cmp_a > 0)
Packit 98cdb6
	cmp_a = -1;
Packit 98cdb6
Packit 98cdb6
      if (cmp_b < 0)
Packit 98cdb6
	cmp_b = 1;
Packit 98cdb6
      else if (cmp_b > 0)
Packit 98cdb6
	cmp_b = -1;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (prev == NULL && cmp_b <= 0)
Packit 98cdb6
    return;
Packit 98cdb6
  else if (next == NULL && cmp_a <= 0)
Packit 98cdb6
    return;
Packit 98cdb6
  else if (prev != NULL && next != NULL &&
Packit 98cdb6
	   cmp_a <= 0 && cmp_b <= 0)
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  /* We actually need to sort it */
Packit 98cdb6
  /* First, remove the old link. */
Packit 98cdb6
Packit 98cdb6
  if (prev)
Packit 98cdb6
    prev->next = next;
Packit 98cdb6
  else
Packit 98cdb6
    node->parent->children = next;
Packit 98cdb6
Packit 98cdb6
  if (next)
Packit 98cdb6
    next->prev = prev;
Packit 98cdb6
Packit 98cdb6
  node->prev = NULL;
Packit 98cdb6
  node->next = NULL;
Packit 98cdb6
Packit 98cdb6
  /* FIXME: as an optimization, we can potentially start at next */
Packit 98cdb6
  prev = NULL;
Packit 98cdb6
  node = node->parent->children;
Packit 98cdb6
  new_location = 0;
Packit 98cdb6
  tmp_iter.user_data = node;
Packit 98cdb6
  if (tree_store->order == GTK_SORT_DESCENDING)
Packit 98cdb6
    cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
Packit 98cdb6
  else
Packit 98cdb6
    cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
Packit 98cdb6
Packit 98cdb6
  while ((node->next) && (cmp_a > 0))
Packit 98cdb6
    {
Packit 98cdb6
      prev = node;
Packit 98cdb6
      node = node->next;
Packit 98cdb6
      new_location++;
Packit 98cdb6
      tmp_iter.user_data = node;
Packit 98cdb6
      if (tree_store->order == GTK_SORT_DESCENDING)
Packit 98cdb6
	cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
Packit 98cdb6
      else
Packit 98cdb6
	cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if ((!node->next) && (cmp_a > 0))
Packit 98cdb6
    {
Packit 98cdb6
      new_location++;
Packit 98cdb6
      node->next = G_NODE (iter->user_data);
Packit 98cdb6
      node->next->prev = node;
Packit 98cdb6
    }
Packit 98cdb6
  else if (prev)
Packit 98cdb6
    {
Packit 98cdb6
      prev->next = G_NODE (iter->user_data);
Packit 98cdb6
      prev->next->prev = prev;
Packit 98cdb6
      G_NODE (iter->user_data)->next = node;
Packit 98cdb6
      G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
Packit 98cdb6
    }
Packit 98cdb6
  else
Packit 98cdb6
    {
Packit 98cdb6
      G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
Packit 98cdb6
      G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
Packit 98cdb6
      G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  if (!emit_signal)
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  /* Emit the reordered signal. */
Packit 98cdb6
  length = g_node_n_children (node->parent);
Packit 98cdb6
  new_order = g_new (int, length);
Packit 98cdb6
  if (old_location < new_location)
Packit 98cdb6
    for (i = 0; i < length; i++)
Packit 98cdb6
      {
Packit 98cdb6
	if (i < old_location ||
Packit 98cdb6
	    i > new_location)
Packit 98cdb6
	  new_order[i] = i;
Packit 98cdb6
	else if (i >= old_location &&
Packit 98cdb6
		 i < new_location)
Packit 98cdb6
	  new_order[i] = i + 1;
Packit 98cdb6
	else if (i == new_location)
Packit 98cdb6
	  new_order[i] = old_location;
Packit 98cdb6
      }
Packit 98cdb6
  else
Packit 98cdb6
    for (i = 0; i < length; i++)
Packit 98cdb6
      {
Packit 98cdb6
	if (i < new_location ||
Packit 98cdb6
	    i > old_location)
Packit 98cdb6
	  new_order[i] = i;
Packit 98cdb6
	else if (i > new_location &&
Packit 98cdb6
		 i <= old_location)
Packit 98cdb6
	  new_order[i] = i - 1;
Packit 98cdb6
	else if (i == new_location)
Packit 98cdb6
	  new_order[i] = old_location;
Packit 98cdb6
      }
Packit 98cdb6
Packit 98cdb6
  tmp_iter.user_data = node->parent;
Packit 98cdb6
  tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
Packit 98cdb6
				 tmp_path, &tmp_iter,
Packit 98cdb6
				 new_order);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_path_free (tmp_path);
Packit 98cdb6
  g_free (new_order);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_get_sort_column_id (GtkTreeSortable  *sortable,
Packit 98cdb6
				   gint             *sort_column_id,
Packit 98cdb6
				   GtkSortType      *order)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
Packit 98cdb6
Packit 98cdb6
  if (sort_column_id)
Packit 98cdb6
    * sort_column_id = tree_store->sort_column_id;
Packit 98cdb6
  if (order)
Packit 98cdb6
    * order = tree_store->order;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID ||
Packit 98cdb6
      tree_store->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
Packit 98cdb6
    return FALSE;
Packit 98cdb6
Packit 98cdb6
  return TRUE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_sort_column_id (GtkTreeSortable  *sortable,
Packit 98cdb6
				   gint              sort_column_id,
Packit 98cdb6
				   GtkSortType       order)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
Packit 98cdb6
Packit 98cdb6
  
Packit 98cdb6
  if ((tree_store->sort_column_id == sort_column_id) &&
Packit 98cdb6
      (tree_store->order == order))
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  if (sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
Packit 98cdb6
    {
Packit 98cdb6
      if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
Packit 98cdb6
	{
Packit 98cdb6
	  GtkTreeDataSortHeader *header = NULL;
Packit 98cdb6
Packit 98cdb6
	  header = _gtk_tree_data_list_get_header (tree_store->sort_list, 
Packit 98cdb6
						   sort_column_id);
Packit 98cdb6
Packit 98cdb6
	  /* We want to make sure that we have a function */
Packit 98cdb6
	  g_return_if_fail (header != NULL);
Packit 98cdb6
	  g_return_if_fail (header->func != NULL);
Packit 98cdb6
	}
Packit 98cdb6
      else
Packit 98cdb6
	{
Packit 98cdb6
	  g_return_if_fail (tree_store->default_sort_func != NULL);
Packit 98cdb6
	}
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  tree_store->sort_column_id = sort_column_id;
Packit 98cdb6
  tree_store->order = order;
Packit 98cdb6
Packit 98cdb6
  gtk_tree_sortable_sort_column_changed (sortable);
Packit 98cdb6
Packit 98cdb6
  gtk_tree_store_sort (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_sort_func (GtkTreeSortable        *sortable,
Packit 98cdb6
			      gint                    sort_column_id,
Packit 98cdb6
			      GtkTreeIterCompareFunc  func,
Packit 98cdb6
			      gpointer                data,
Packit 98cdb6
			      GDestroyNotify          destroy)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
Packit 98cdb6
Packit 98cdb6
  tree_store->sort_list = _gtk_tree_data_list_set_header (tree_store->sort_list, 
Packit 98cdb6
							  sort_column_id, 
Packit 98cdb6
							  func, data, destroy);
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_column_id == sort_column_id)
Packit 98cdb6
    gtk_tree_store_sort (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_set_default_sort_func (GtkTreeSortable        *sortable,
Packit 98cdb6
				      GtkTreeIterCompareFunc  func,
Packit 98cdb6
				      gpointer                data,
Packit 98cdb6
				      GDestroyNotify          destroy)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->default_sort_destroy)
Packit 98cdb6
    {
Packit 98cdb6
      GDestroyNotify d = tree_store->default_sort_destroy;
Packit 98cdb6
Packit 98cdb6
      tree_store->default_sort_destroy = NULL;
Packit 98cdb6
      d (tree_store->default_sort_data);
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  tree_store->default_sort_func = func;
Packit 98cdb6
  tree_store->default_sort_data = data;
Packit 98cdb6
  tree_store->default_sort_destroy = destroy;
Packit 98cdb6
Packit 98cdb6
  if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
Packit 98cdb6
    gtk_tree_store_sort (tree_store);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
Packit 98cdb6
{
Packit 98cdb6
  GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
Packit 98cdb6
Packit 98cdb6
  return (tree_store->default_sort_func != NULL);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
validate_gnode (GNode* node)
Packit 98cdb6
{
Packit 98cdb6
  GNode *iter;
Packit 98cdb6
Packit 98cdb6
  iter = node->children;
Packit 98cdb6
  while (iter != NULL)
Packit 98cdb6
    {
Packit 98cdb6
      g_assert (iter->parent == node);
Packit 98cdb6
      if (iter->prev)
Packit 98cdb6
        g_assert (iter->prev->next == iter);
Packit 98cdb6
      validate_gnode (iter);
Packit 98cdb6
      iter = iter->next;
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
/* GtkBuildable custom tag implementation
Packit 98cdb6
 *
Packit 98cdb6
 * <columns>
Packit 98cdb6
 *   <column type="..."/>
Packit 98cdb6
 *   <column type="..."/>
Packit 98cdb6
 * </columns>
Packit 98cdb6
 */
Packit 98cdb6
typedef struct {
Packit 98cdb6
  GtkBuilder *builder;
Packit 98cdb6
  GObject *object;
Packit 98cdb6
  GSList *items;
Packit 98cdb6
} GSListSubParserData;
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
tree_model_start_element (GMarkupParseContext *context,
Packit 98cdb6
			  const gchar         *element_name,
Packit 98cdb6
			  const gchar        **names,
Packit 98cdb6
			  const gchar        **values,
Packit 98cdb6
			  gpointer            user_data,
Packit 98cdb6
			  GError            **error)
Packit 98cdb6
{
Packit 98cdb6
  guint i;
Packit 98cdb6
  GSListSubParserData *data = (GSListSubParserData*)user_data;
Packit 98cdb6
Packit 98cdb6
  for (i = 0; names[i]; i++)
Packit 98cdb6
    {
Packit 98cdb6
      if (strcmp (names[i], "type") == 0)
Packit 98cdb6
	data->items = g_slist_prepend (data->items, g_strdup (values[i]));
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
tree_model_end_element (GMarkupParseContext *context,
Packit 98cdb6
			const gchar         *element_name,
Packit 98cdb6
			gpointer             user_data,
Packit 98cdb6
			GError             **error)
Packit 98cdb6
{
Packit 98cdb6
  GSListSubParserData *data = (GSListSubParserData*)user_data;
Packit 98cdb6
Packit 98cdb6
  g_assert(data->builder);
Packit 98cdb6
Packit 98cdb6
  if (strcmp (element_name, "columns") == 0)
Packit 98cdb6
    {
Packit 98cdb6
      GSList *l;
Packit 98cdb6
      GType *types;
Packit 98cdb6
      int i;
Packit 98cdb6
      GType type;
Packit 98cdb6
Packit 98cdb6
      data = (GSListSubParserData*)user_data;
Packit 98cdb6
      data->items = g_slist_reverse (data->items);
Packit 98cdb6
      types = g_new0 (GType, g_slist_length (data->items));
Packit 98cdb6
Packit 98cdb6
      for (l = data->items, i = 0; l; l = l->next, i++)
Packit 98cdb6
        {
Packit 98cdb6
          type = gtk_builder_get_type_from_name (data->builder, l->data);
Packit 98cdb6
          if (type == G_TYPE_INVALID)
Packit 98cdb6
            {
Packit 98cdb6
              g_warning ("Unknown type %s specified in treemodel %s",
Packit 98cdb6
                         (const gchar*)l->data,
Packit 98cdb6
                         gtk_buildable_get_name (GTK_BUILDABLE (data->object)));
Packit 98cdb6
              continue;
Packit 98cdb6
            }
Packit 98cdb6
          types[i] = type;
Packit 98cdb6
Packit 98cdb6
          g_free (l->data);
Packit 98cdb6
        }
Packit 98cdb6
Packit 98cdb6
      gtk_tree_store_set_column_types (GTK_TREE_STORE (data->object), i, types);
Packit 98cdb6
Packit 98cdb6
      g_free (types);
Packit 98cdb6
    }
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static const GMarkupParser tree_model_parser =
Packit 98cdb6
  {
Packit 98cdb6
    tree_model_start_element,
Packit 98cdb6
    tree_model_end_element
Packit 98cdb6
  };
Packit 98cdb6
Packit 98cdb6
Packit 98cdb6
static gboolean
Packit 98cdb6
gtk_tree_store_buildable_custom_tag_start (GtkBuildable  *buildable,
Packit 98cdb6
					   GtkBuilder    *builder,
Packit 98cdb6
					   GObject       *child,
Packit 98cdb6
					   const gchar   *tagname,
Packit 98cdb6
					   GMarkupParser *parser,
Packit 98cdb6
					   gpointer      *data)
Packit 98cdb6
{
Packit 98cdb6
  GSListSubParserData *parser_data;
Packit 98cdb6
Packit 98cdb6
  if (child)
Packit 98cdb6
    return FALSE;
Packit 98cdb6
Packit 98cdb6
  if (strcmp (tagname, "columns") == 0)
Packit 98cdb6
    {
Packit 98cdb6
      parser_data = g_slice_new0 (GSListSubParserData);
Packit 98cdb6
      parser_data->builder = builder;
Packit 98cdb6
      parser_data->items = NULL;
Packit 98cdb6
      parser_data->object = G_OBJECT (buildable);
Packit 98cdb6
Packit 98cdb6
      *parser = tree_model_parser;
Packit 98cdb6
      *data = parser_data;
Packit 98cdb6
      return TRUE;
Packit 98cdb6
    }
Packit 98cdb6
Packit 98cdb6
  return FALSE;
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
static void
Packit 98cdb6
gtk_tree_store_buildable_custom_finished (GtkBuildable *buildable,
Packit 98cdb6
					  GtkBuilder   *builder,
Packit 98cdb6
					  GObject      *child,
Packit 98cdb6
					  const gchar  *tagname,
Packit 98cdb6
					  gpointer      user_data)
Packit 98cdb6
{
Packit 98cdb6
  GSListSubParserData *data;
Packit 98cdb6
Packit 98cdb6
  if (strcmp (tagname, "columns"))
Packit 98cdb6
    return;
Packit 98cdb6
Packit 98cdb6
  data = (GSListSubParserData*)user_data;
Packit 98cdb6
Packit 98cdb6
  g_slist_free (data->items);
Packit 98cdb6
  g_slice_free (GSListSubParserData, data);
Packit 98cdb6
}
Packit 98cdb6
Packit 98cdb6
#define __GTK_TREE_STORE_C__
Packit 98cdb6
#include "gtkaliasdef.c"