2 * Copyright (C) 2000 Red Hat, Inc., Jonathan Blandford <jrb@redhat.com>
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
14 * You should have received a copy of the GNU Library General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 #include <gobject/gvaluecollector.h>
22 #include "gtktreemodel.h"
23 #include "gtkliststore.h"
24 #include "gtktreedatalist.h"
25 #include "gtktreednd.h"
27 #define G_SLIST(x) ((GSList *) x)
28 #define GTK_LIST_STORE_IS_SORTED(list) (GTK_LIST_STORE (list)->sort_column_id != -2)
29 #define VALID_ITER(iter, list_store) (iter!= NULL && iter->user_data != NULL && list_store->stamp == iter->stamp)
31 static void gtk_list_store_init (GtkListStore *list_store);
32 static void gtk_list_store_class_init (GtkListStoreClass *class);
33 static void gtk_list_store_tree_model_init (GtkTreeModelIface *iface);
34 static void gtk_list_store_drag_source_init(GtkTreeDragSourceIface *iface);
35 static void gtk_list_store_drag_dest_init (GtkTreeDragDestIface *iface);
36 static void gtk_list_store_sortable_init (GtkTreeSortableIface *iface);
37 static void gtk_list_store_finalize (GObject *object);
38 static GtkTreeModelFlags gtk_list_store_get_flags (GtkTreeModel *tree_model);
39 static gint gtk_list_store_get_n_columns (GtkTreeModel *tree_model);
40 static GType gtk_list_store_get_column_type (GtkTreeModel *tree_model,
42 static gboolean gtk_list_store_get_iter (GtkTreeModel *tree_model,
45 static GtkTreePath *gtk_list_store_get_path (GtkTreeModel *tree_model,
47 static void gtk_list_store_get_value (GtkTreeModel *tree_model,
51 static gboolean gtk_list_store_iter_next (GtkTreeModel *tree_model,
53 static gboolean gtk_list_store_iter_children (GtkTreeModel *tree_model,
56 static gboolean gtk_list_store_iter_has_child (GtkTreeModel *tree_model,
58 static gint gtk_list_store_iter_n_children (GtkTreeModel *tree_model,
60 static gboolean gtk_list_store_iter_nth_child (GtkTreeModel *tree_model,
64 static gboolean gtk_list_store_iter_parent (GtkTreeModel *tree_model,
69 static void gtk_list_store_set_n_columns (GtkListStore *list_store,
71 static void gtk_list_store_set_column_type (GtkListStore *list_store,
77 static gboolean gtk_list_store_drag_data_delete (GtkTreeDragSource *drag_source,
79 static gboolean gtk_list_store_drag_data_get (GtkTreeDragSource *drag_source,
81 GtkSelectionData *selection_data);
82 static gboolean gtk_list_store_drag_data_received (GtkTreeDragDest *drag_dest,
84 GtkSelectionData *selection_data);
85 static gboolean gtk_list_store_row_drop_possible (GtkTreeDragDest *drag_dest,
86 GtkTreePath *dest_path,
87 GtkSelectionData *selection_data);
91 static void gtk_list_store_sort (GtkListStore *list_store);
92 static void gtk_list_store_sort_iter_changed (GtkListStore *list_store,
95 static gboolean gtk_list_store_get_sort_column_id (GtkTreeSortable *sortable,
98 static void gtk_list_store_set_sort_column_id (GtkTreeSortable *sortable,
101 static void gtk_list_store_set_sort_func (GtkTreeSortable *sortable,
103 GtkTreeIterCompareFunc func,
105 GtkDestroyNotify destroy);
106 static void gtk_list_store_set_default_sort_func (GtkTreeSortable *sortable,
107 GtkTreeIterCompareFunc func,
109 GtkDestroyNotify destroy);
110 static gboolean gtk_list_store_has_default_sort_func (GtkTreeSortable *sortable);
112 static void gtk_list_store_move (GtkListStore *store,
118 static GObjectClass *parent_class = NULL;
122 validate_list_store (GtkListStore *list_store)
124 if (gtk_debug_flags & GTK_DEBUG_TREE)
126 g_assert (g_slist_length (list_store->root) == list_store->length);
128 g_assert (g_slist_last (list_store->root) == list_store->tail);
133 gtk_list_store_get_type (void)
135 static GType list_store_type = 0;
137 if (!list_store_type)
139 static const GTypeInfo list_store_info =
141 sizeof (GtkListStoreClass),
142 NULL, /* base_init */
143 NULL, /* base_finalize */
144 (GClassInitFunc) gtk_list_store_class_init,
145 NULL, /* class_finalize */
146 NULL, /* class_data */
147 sizeof (GtkListStore),
149 (GInstanceInitFunc) gtk_list_store_init,
152 static const GInterfaceInfo tree_model_info =
154 (GInterfaceInitFunc) gtk_list_store_tree_model_init,
159 static const GInterfaceInfo drag_source_info =
161 (GInterfaceInitFunc) gtk_list_store_drag_source_init,
166 static const GInterfaceInfo drag_dest_info =
168 (GInterfaceInitFunc) gtk_list_store_drag_dest_init,
173 static const GInterfaceInfo sortable_info =
175 (GInterfaceInitFunc) gtk_list_store_sortable_init,
180 list_store_type = g_type_register_static (G_TYPE_OBJECT, "GtkListStore",
181 &list_store_info, 0);
183 g_type_add_interface_static (list_store_type,
186 g_type_add_interface_static (list_store_type,
187 GTK_TYPE_TREE_DRAG_SOURCE,
189 g_type_add_interface_static (list_store_type,
190 GTK_TYPE_TREE_DRAG_DEST,
192 g_type_add_interface_static (list_store_type,
193 GTK_TYPE_TREE_SORTABLE,
197 return list_store_type;
201 gtk_list_store_class_init (GtkListStoreClass *class)
203 GObjectClass *object_class;
205 parent_class = g_type_class_peek_parent (class);
206 object_class = (GObjectClass*) class;
208 object_class->finalize = gtk_list_store_finalize;
212 gtk_list_store_tree_model_init (GtkTreeModelIface *iface)
214 iface->get_flags = gtk_list_store_get_flags;
215 iface->get_n_columns = gtk_list_store_get_n_columns;
216 iface->get_column_type = gtk_list_store_get_column_type;
217 iface->get_iter = gtk_list_store_get_iter;
218 iface->get_path = gtk_list_store_get_path;
219 iface->get_value = gtk_list_store_get_value;
220 iface->iter_next = gtk_list_store_iter_next;
221 iface->iter_children = gtk_list_store_iter_children;
222 iface->iter_has_child = gtk_list_store_iter_has_child;
223 iface->iter_n_children = gtk_list_store_iter_n_children;
224 iface->iter_nth_child = gtk_list_store_iter_nth_child;
225 iface->iter_parent = gtk_list_store_iter_parent;
229 gtk_list_store_drag_source_init (GtkTreeDragSourceIface *iface)
231 iface->drag_data_delete = gtk_list_store_drag_data_delete;
232 iface->drag_data_get = gtk_list_store_drag_data_get;
236 gtk_list_store_drag_dest_init (GtkTreeDragDestIface *iface)
238 iface->drag_data_received = gtk_list_store_drag_data_received;
239 iface->row_drop_possible = gtk_list_store_row_drop_possible;
243 gtk_list_store_sortable_init (GtkTreeSortableIface *iface)
245 iface->get_sort_column_id = gtk_list_store_get_sort_column_id;
246 iface->set_sort_column_id = gtk_list_store_set_sort_column_id;
247 iface->set_sort_func = gtk_list_store_set_sort_func;
248 iface->set_default_sort_func = gtk_list_store_set_default_sort_func;
249 iface->has_default_sort_func = gtk_list_store_has_default_sort_func;
253 gtk_list_store_init (GtkListStore *list_store)
255 list_store->root = NULL;
256 list_store->tail = NULL;
257 list_store->sort_list = NULL;
258 list_store->stamp = g_random_int ();
259 list_store->length = 0;
260 list_store->sort_column_id = -2;
261 list_store->columns_dirty = FALSE;
265 * gtk_list_store_new:
266 * @n_columns: number of columns in the list store
267 * @Varargs: all #GType types for the columns, from first to last
269 * Creates a new list store as with @n_columns columns each of the types passed
270 * in. As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
271 * GDK_TYPE_PIXBUF);</literal> will create a new #GtkListStore with three columns, of type
272 * int, string and #GdkPixbuf respectively.
274 * Return value: a new #GtkListStore
277 gtk_list_store_new (gint n_columns,
280 GtkListStore *retval;
284 g_return_val_if_fail (n_columns > 0, NULL);
286 retval = g_object_new (GTK_TYPE_LIST_STORE, NULL);
287 gtk_list_store_set_n_columns (retval, n_columns);
289 va_start (args, n_columns);
291 for (i = 0; i < n_columns; i++)
293 GType type = va_arg (args, GType);
294 if (! _gtk_tree_data_list_check_type (type))
296 g_warning ("%s: Invalid type %s passed to gtk_list_store_new\n",
297 G_STRLOC, g_type_name (type));
298 g_object_unref (retval);
302 gtk_list_store_set_column_type (retval, i, type);
312 * gtk_list_store_newv:
313 * @n_columns: number of columns in the list store
314 * @types: an array of #GType types for the columns, from first to last
316 * Non-vararg creation function. Used primarily by language bindings.
318 * Return value: a new #GtkListStore
321 gtk_list_store_newv (gint n_columns,
324 GtkListStore *retval;
327 g_return_val_if_fail (n_columns > 0, NULL);
329 retval = g_object_new (GTK_TYPE_LIST_STORE, NULL);
330 gtk_list_store_set_n_columns (retval, n_columns);
332 for (i = 0; i < n_columns; i++)
334 if (! _gtk_tree_data_list_check_type (types[i]))
336 g_warning ("%s: Invalid type %s passed to gtk_list_store_newv\n",
337 G_STRLOC, g_type_name (types[i]));
338 g_object_unref (retval);
342 gtk_list_store_set_column_type (retval, i, types[i]);
349 * gtk_list_store_set_column_types:
350 * @list_store: A #GtkListStore
351 * @n_columns: Number of columns for the list store
352 * @types: An array length n of #GTypes
354 * This function is meant primarily for #GObjects that inherit from #GtkListStore,
355 * and should only be used when constructing a new #GtkListStore. It will not
356 * function after a row has been added, or a method on the #GtkTreeModel
357 * interface is called.
360 gtk_list_store_set_column_types (GtkListStore *list_store,
366 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
367 g_return_if_fail (list_store->columns_dirty == 0);
369 gtk_list_store_set_n_columns (list_store, n_columns);
370 for (i = 0; i < n_columns; i++)
372 if (! _gtk_tree_data_list_check_type (types[i]))
374 g_warning ("%s: Invalid type %s passed to gtk_list_store_set_column_types\n", G_STRLOC, g_type_name (types[i]));
377 gtk_list_store_set_column_type (list_store, i, types[i]);
382 gtk_list_store_set_n_columns (GtkListStore *list_store,
387 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
388 g_return_if_fail (n_columns > 0);
390 if (list_store->n_columns == n_columns)
393 new_columns = g_new0 (GType, n_columns);
394 if (list_store->column_headers)
396 /* copy the old header orders over */
397 if (n_columns >= list_store->n_columns)
398 memcpy (new_columns, list_store->column_headers, list_store->n_columns * sizeof (gchar *));
400 memcpy (new_columns, list_store->column_headers, n_columns * sizeof (GType));
402 g_free (list_store->column_headers);
405 if (list_store->sort_list)
406 _gtk_tree_data_list_header_free (list_store->sort_list);
408 list_store->sort_list = _gtk_tree_data_list_header_new (n_columns, list_store->column_headers);
410 list_store->column_headers = new_columns;
411 list_store->n_columns = n_columns;
415 gtk_list_store_set_column_type (GtkListStore *list_store,
419 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
420 g_return_if_fail (column >=0 && column < list_store->n_columns);
422 if (!_gtk_tree_data_list_check_type (type))
424 g_warning ("%s: Invalid type %s passed to gtk_list_store_set_column_type\n", G_STRLOC, g_type_name (type));
428 list_store->column_headers[column] = type;
432 gtk_list_store_finalize (GObject *object)
434 GtkListStore *list_store = GTK_LIST_STORE (object);
436 g_slist_foreach (list_store->root, (GFunc) _gtk_tree_data_list_free, list_store->column_headers);
437 g_slist_free (list_store->root);
439 _gtk_tree_data_list_header_free (list_store->sort_list);
440 g_free (list_store->column_headers);
442 if (list_store->default_sort_destroy)
444 GtkDestroyNotify d = list_store->default_sort_destroy;
446 list_store->default_sort_destroy = NULL;
447 d (list_store->default_sort_data);
448 list_store->default_sort_data = NULL;
452 (* parent_class->finalize) (object);
455 /* Fulfill the GtkTreeModel requirements */
456 static GtkTreeModelFlags
457 gtk_list_store_get_flags (GtkTreeModel *tree_model)
459 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), 0);
461 return GTK_TREE_MODEL_ITERS_PERSIST | GTK_TREE_MODEL_LIST_ONLY;
465 gtk_list_store_get_n_columns (GtkTreeModel *tree_model)
467 GtkListStore *list_store = (GtkListStore *) tree_model;
469 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), 0);
471 list_store->columns_dirty = TRUE;
473 return list_store->n_columns;
477 gtk_list_store_get_column_type (GtkTreeModel *tree_model,
480 GtkListStore *list_store = (GtkListStore *) tree_model;
482 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), G_TYPE_INVALID);
483 g_return_val_if_fail (index < GTK_LIST_STORE (tree_model)->n_columns &&
484 index >= 0, G_TYPE_INVALID);
486 list_store->columns_dirty = TRUE;
488 return list_store->column_headers[index];
492 gtk_list_store_get_iter (GtkTreeModel *tree_model,
496 GtkListStore *list_store = (GtkListStore *) tree_model;
500 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
501 g_return_val_if_fail (gtk_tree_path_get_depth (path) > 0, FALSE);
503 list_store->columns_dirty = TRUE;
505 i = gtk_tree_path_get_indices (path)[0];
507 if (i >= list_store->length)
510 list = g_slist_nth (G_SLIST (list_store->root), i);
512 /* If this fails, list_store->length has gotten mangled. */
515 iter->stamp = list_store->stamp;
516 iter->user_data = list;
522 gtk_list_store_get_path (GtkTreeModel *tree_model,
529 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), NULL);
530 g_return_val_if_fail (iter->stamp == GTK_LIST_STORE (tree_model)->stamp, NULL);
531 if (G_SLIST (iter->user_data) == G_SLIST (GTK_LIST_STORE (tree_model)->tail))
533 retval = gtk_tree_path_new ();
534 gtk_tree_path_append_index (retval, GTK_LIST_STORE (tree_model)->length - 1);
538 for (list = G_SLIST (GTK_LIST_STORE (tree_model)->root); list; list = list->next)
540 if (list == G_SLIST (iter->user_data))
547 retval = gtk_tree_path_new ();
548 gtk_tree_path_append_index (retval, i);
553 gtk_list_store_get_value (GtkTreeModel *tree_model,
558 GtkTreeDataList *list;
559 gint tmp_column = column;
561 g_return_if_fail (GTK_IS_LIST_STORE (tree_model));
562 g_return_if_fail (column < GTK_LIST_STORE (tree_model)->n_columns);
563 g_return_if_fail (GTK_LIST_STORE (tree_model)->stamp == iter->stamp);
565 list = G_SLIST (iter->user_data)->data;
567 while (tmp_column-- > 0 && list)
571 g_value_init (value, GTK_LIST_STORE (tree_model)->column_headers[column]);
573 _gtk_tree_data_list_node_to_value (list,
574 GTK_LIST_STORE (tree_model)->column_headers[column],
579 gtk_list_store_iter_next (GtkTreeModel *tree_model,
582 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
583 g_return_val_if_fail (GTK_LIST_STORE (tree_model)->stamp == iter->stamp, FALSE);
585 iter->user_data = G_SLIST (iter->user_data)->next;
587 return (iter->user_data != NULL);
591 gtk_list_store_iter_children (GtkTreeModel *tree_model,
595 /* this is a list, nodes have no children */
599 /* but if parent == NULL we return the list itself as children of the
603 if (GTK_LIST_STORE (tree_model)->root)
605 iter->stamp = GTK_LIST_STORE (tree_model)->stamp;
606 iter->user_data = GTK_LIST_STORE (tree_model)->root;
614 gtk_list_store_iter_has_child (GtkTreeModel *tree_model,
621 gtk_list_store_iter_n_children (GtkTreeModel *tree_model,
624 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), -1);
626 return GTK_LIST_STORE (tree_model)->length;
628 g_return_val_if_fail (GTK_LIST_STORE (tree_model)->stamp == iter->stamp, -1);
633 gtk_list_store_iter_nth_child (GtkTreeModel *tree_model,
640 g_return_val_if_fail (GTK_IS_LIST_STORE (tree_model), FALSE);
645 child = g_slist_nth (G_SLIST (GTK_LIST_STORE (tree_model)->root), n);
649 iter->stamp = GTK_LIST_STORE (tree_model)->stamp;
650 iter->user_data = child;
658 gtk_list_store_iter_parent (GtkTreeModel *tree_model,
666 gtk_list_store_real_set_value (GtkListStore *list_store,
672 GtkTreeDataList *list;
673 GtkTreeDataList *prev;
674 gint old_column = column;
675 GValue real_value = {0, };
676 gboolean converted = FALSE;
677 gboolean retval = FALSE;
679 g_return_val_if_fail (GTK_IS_LIST_STORE (list_store), FALSE);
680 g_return_val_if_fail (VALID_ITER (iter, list_store), FALSE);
681 g_return_val_if_fail (column >= 0 && column < list_store->n_columns, FALSE);
682 g_return_val_if_fail (G_IS_VALUE (value), FALSE);
684 if (! g_type_is_a (G_VALUE_TYPE (value), list_store->column_headers[column]))
686 if (! (g_value_type_compatible (G_VALUE_TYPE (value), list_store->column_headers[column]) &&
687 g_value_type_compatible (list_store->column_headers[column], G_VALUE_TYPE (value))))
689 g_warning ("%s: Unable to convert from %s to %s\n",
691 g_type_name (G_VALUE_TYPE (value)),
692 g_type_name (list_store->column_headers[column]));
695 if (!g_value_transform (value, &real_value))
697 g_warning ("%s: Unable to make conversion from %s to %s\n",
699 g_type_name (G_VALUE_TYPE (value)),
700 g_type_name (list_store->column_headers[column]));
701 g_value_unset (&real_value);
707 prev = list = G_SLIST (iter->user_data)->data;
714 _gtk_tree_data_list_value_to_node (list, &real_value);
716 _gtk_tree_data_list_value_to_node (list, value);
719 g_value_unset (&real_value);
728 if (G_SLIST (iter->user_data)->data == NULL)
730 G_SLIST (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
735 list = prev->next = _gtk_tree_data_list_alloc ();
741 list->next = _gtk_tree_data_list_alloc ();
748 _gtk_tree_data_list_value_to_node (list, &real_value);
750 _gtk_tree_data_list_value_to_node (list, value);
754 g_value_unset (&real_value);
756 if (sort && GTK_LIST_STORE_IS_SORTED (list_store))
757 gtk_list_store_sort_iter_changed (list_store, iter, old_column);
764 * gtk_list_store_set_value:
765 * @list_store: A #GtkListStore
766 * @iter: A valid #GtkTreeIter for the row being modified
767 * @column: column number to modify
768 * @value: new value for the cell
770 * Sets the data in the cell specified by @iter and @column.
771 * The type of @value must be convertible to the type of the
776 gtk_list_store_set_value (GtkListStore *list_store,
781 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
782 g_return_if_fail (VALID_ITER (iter, list_store));
783 g_return_if_fail (column >= 0 && column < list_store->n_columns);
784 g_return_if_fail (G_IS_VALUE (value));
786 if (gtk_list_store_real_set_value (list_store, iter, column, value, TRUE))
790 path = gtk_tree_model_get_path (GTK_TREE_MODEL (list_store), iter);
791 gtk_tree_model_row_changed (GTK_TREE_MODEL (list_store), path, iter);
792 gtk_tree_path_free (path);
797 * gtk_list_store_set_valist:
798 * @list_store: A #GtkListStore
799 * @iter: A valid #GtkTreeIter for the row being modified
800 * @var_args: va_list of column/value pairs
802 * See gtk_list_store_set(); this version takes a va_list for use by language
807 gtk_list_store_set_valist (GtkListStore *list_store,
812 gboolean emit_signal = FALSE;
813 gboolean maybe_need_sort = FALSE;
814 GtkTreeIterCompareFunc func = NULL;
816 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
817 g_return_if_fail (VALID_ITER (iter, list_store));
819 column = va_arg (var_args, gint);
821 if (GTK_LIST_STORE_IS_SORTED (list_store))
823 if (list_store->sort_column_id != -1)
825 GtkTreeDataSortHeader *header;
826 header = _gtk_tree_data_list_get_header (list_store->sort_list,
827 list_store->sort_column_id);
828 g_return_if_fail (header != NULL);
829 g_return_if_fail (header->func != NULL);
834 func = list_store->default_sort_func;
838 if (func != gtk_tree_data_list_compare_func)
839 maybe_need_sort = TRUE;
843 GValue value = { 0, };
846 if (column >= list_store->n_columns)
848 g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
851 g_value_init (&value, list_store->column_headers[column]);
853 G_VALUE_COLLECT (&value, var_args, 0, &error);
856 g_warning ("%s: %s", G_STRLOC, error);
859 /* we purposely leak the value here, it might not be
860 * in a sane state if an error condition occoured
865 /* FIXME: instead of calling this n times, refactor with above */
866 emit_signal = gtk_list_store_real_set_value (list_store,
870 FALSE) || emit_signal;
872 if (func == gtk_tree_data_list_compare_func &&
873 column == list_store->sort_column_id)
874 maybe_need_sort = TRUE;
876 g_value_unset (&value);
878 column = va_arg (var_args, gint);
881 if (maybe_need_sort && GTK_LIST_STORE_IS_SORTED (list_store))
882 gtk_list_store_sort_iter_changed (list_store, iter, list_store->sort_column_id);
888 path = gtk_tree_model_get_path (GTK_TREE_MODEL (list_store), iter);
889 gtk_tree_model_row_changed (GTK_TREE_MODEL (list_store), path, iter);
890 gtk_tree_path_free (path);
895 * gtk_list_store_set:
896 * @list_store: a #GtkListStore
897 * @iter: row iterator
898 * @Varargs: pairs of column number and value, terminated with -1
900 * Sets the value of one or more cells in the row referenced by @iter.
901 * The variable argument list should contain integer column numbers,
902 * each column number followed by the value to be set.
903 * The list is terminated by a -1. For example, to set column 0 with type
904 * %G_TYPE_STRING to "Foo", you would write <literal>gtk_list_store_set (store, iter,
905 * 0, "Foo", -1)</literal>.
908 gtk_list_store_set (GtkListStore *list_store,
914 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
915 g_return_if_fail (iter != NULL);
916 g_return_if_fail (iter->stamp == list_store->stamp);
918 va_start (var_args, iter);
919 gtk_list_store_set_valist (list_store, iter, var_args);
924 remove_link_saving_prev (GSList *list,
939 prev->next = link->next;
958 gtk_list_store_remove_silently (GtkListStore *list_store,
962 if (G_SLIST (iter->user_data)->data)
964 _gtk_tree_data_list_free ((GtkTreeDataList *) G_SLIST (iter->user_data)->data,
965 list_store->column_headers);
966 G_SLIST (iter->user_data)->data = NULL;
972 list_store->root = remove_link_saving_prev (G_SLIST (list_store->root),
973 G_SLIST (iter->user_data),
976 list_store->length -= 1;
978 if (iter->user_data == list_store->tail)
979 list_store->tail = prev;
981 g_slist_free (G_SLIST (iter->user_data));
986 * gtk_list_store_remove:
987 * @list_store: A #GtkListStore
988 * @iter: A valid #GtkTreeIter
990 * Removes the given row from the list store. After being removed,
991 * @iter is set to be the next valid row, or invalidated if it pointed
992 * to the last row in @list_store.
994 * Return value: %TRUE if @iter is valid, %FALSE if not.
997 gtk_list_store_remove (GtkListStore *list_store,
1003 g_return_val_if_fail (GTK_IS_LIST_STORE (list_store), FALSE);
1004 g_return_val_if_fail (VALID_ITER (iter, list_store), FALSE);
1006 next = G_SLIST (iter->user_data)->next;
1007 path = gtk_list_store_get_path (GTK_TREE_MODEL (list_store), iter);
1009 validate_list_store (list_store);
1011 gtk_list_store_remove_silently (list_store, iter, path);
1013 validate_list_store (list_store);
1015 gtk_tree_model_row_deleted (GTK_TREE_MODEL (list_store), path);
1016 gtk_tree_path_free (path);
1020 iter->stamp = list_store->stamp;
1021 iter->user_data = next;
1033 insert_after (GtkListStore *list_store,
1037 g_return_if_fail (sibling != NULL);
1038 g_return_if_fail (new_list != NULL);
1040 /* insert new node after list */
1041 new_list->next = sibling->next;
1042 sibling->next = new_list;
1044 /* if list was the tail, the new node is the new tail */
1045 if (sibling == ((GSList *) list_store->tail))
1046 list_store->tail = new_list;
1048 list_store->length += 1;
1052 * gtk_list_store_insert:
1053 * @list_store: A #GtkListStore
1054 * @iter: An unset #GtkTreeIter to set to the new row
1055 * @position: position to insert the new row
1057 * Creates a new row at @position. @iter will be changed to point to this new
1058 * row. If @position is larger than the number of rows on the list, then the
1059 * new row will be appended to the list. The row will be empty before this
1060 * function is called. To fill in values, you need to call gtk_list_store_set()
1061 * or gtk_list_store_set_value().
1065 gtk_list_store_insert (GtkListStore *list_store,
1073 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1074 g_return_if_fail (iter != NULL);
1075 g_return_if_fail (position >= 0);
1077 list_store->columns_dirty = TRUE;
1079 if (position == 0 ||
1080 GTK_LIST_STORE_IS_SORTED (list_store))
1082 gtk_list_store_prepend (list_store, iter);
1086 new_list = g_slist_alloc ();
1088 list = g_slist_nth (G_SLIST (list_store->root), position - 1);
1092 /* position if off the end of the list, append it */
1093 gtk_list_store_append (list_store, iter);
1098 insert_after (list_store, list, new_list);
1100 iter->stamp = list_store->stamp;
1101 iter->user_data = new_list;
1103 validate_list_store (list_store);
1105 path = gtk_tree_path_new ();
1106 gtk_tree_path_append_index (path, position);
1107 gtk_tree_model_row_inserted (GTK_TREE_MODEL (list_store), path, iter);
1108 gtk_tree_path_free (path);
1112 * gtk_list_store_insert_before:
1113 * @list_store: A #GtkListStore
1114 * @iter: An unset #GtkTreeIter to set to the new row
1115 * @sibling: A valid #GtkTreeIter, or %NULL
1117 * Inserts a new row before @sibling. If @sibling is %NULL, then the row will be
1118 * appended to the end of the list. @iter will be changed to point to this new
1119 * row. The row will be empty before this function is called. To fill in values,
1120 * you need to call gtk_list_store_set() or gtk_list_store_set_value().
1124 gtk_list_store_insert_before (GtkListStore *list_store,
1126 GtkTreeIter *sibling)
1129 GSList *list, *prev, *new_list;
1132 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1133 g_return_if_fail (iter != NULL);
1135 g_return_if_fail (VALID_ITER (sibling, list_store));
1137 list_store->columns_dirty = TRUE;
1139 if (GTK_LIST_STORE_IS_SORTED (list_store))
1141 gtk_list_store_prepend (list_store, iter);
1145 if (sibling == NULL)
1147 gtk_list_store_append (list_store, iter);
1151 new_list = g_slist_alloc ();
1154 list = list_store->root;
1155 while (list && list != sibling->user_data)
1162 if (list != sibling->user_data)
1164 g_warning ("%s: sibling iterator invalid? not found in the list", G_STRLOC);
1168 /* if there are no nodes, we become the list tail, otherwise we
1169 * are inserting before any existing nodes so we can't change
1173 if (list_store->root == NULL)
1174 list_store->tail = new_list;
1178 new_list->next = prev->next;
1179 prev->next = new_list;
1183 new_list->next = list_store->root;
1184 list_store->root = new_list;
1187 iter->stamp = list_store->stamp;
1188 iter->user_data = new_list;
1190 list_store->length += 1;
1192 validate_list_store (list_store);
1194 path = gtk_tree_path_new ();
1195 gtk_tree_path_append_index (path, i);
1196 gtk_tree_model_row_inserted (GTK_TREE_MODEL (list_store), path, iter);
1197 gtk_tree_path_free (path);
1201 * gtk_list_store_insert_after:
1202 * @list_store: A #GtkListStore
1203 * @iter: An unset #GtkTreeIter to set to the new row
1204 * @sibling: A valid #GtkTreeIter, or %NULL
1206 * Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1207 * prepended to the beginning of the list. @iter will be changed to point to
1208 * this new row. The row will be empty after this function is called. To fill
1209 * in values, you need to call gtk_list_store_set() or gtk_list_store_set_value().
1213 gtk_list_store_insert_after (GtkListStore *list_store,
1215 GtkTreeIter *sibling)
1218 GSList *list, *new_list;
1221 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1222 g_return_if_fail (iter != NULL);
1224 g_return_if_fail (VALID_ITER (sibling, list_store));
1226 list_store->columns_dirty = TRUE;
1228 if (sibling == NULL ||
1229 GTK_LIST_STORE_IS_SORTED (list_store))
1231 gtk_list_store_prepend (list_store, iter);
1235 for (list = list_store->root; list && list != sibling->user_data; list = list->next)
1238 g_return_if_fail (list == sibling->user_data);
1240 new_list = g_slist_alloc ();
1242 insert_after (list_store, list, new_list);
1244 iter->stamp = list_store->stamp;
1245 iter->user_data = new_list;
1247 validate_list_store (list_store);
1249 path = gtk_tree_path_new ();
1250 gtk_tree_path_append_index (path, i + 1);
1251 gtk_tree_model_row_inserted (GTK_TREE_MODEL (list_store), path, iter);
1252 gtk_tree_path_free (path);
1256 * gtk_list_store_prepend:
1257 * @list_store: A #GtkListStore
1258 * @iter: An unset #GtkTreeIter to set to the prepend row
1260 * Prepends a new row to @list_store. @iter will be changed to point to this new
1261 * row. The row will be empty after this function is called. To fill in
1262 * values, you need to call gtk_list_store_set() or gtk_list_store_set_value().
1266 gtk_list_store_prepend (GtkListStore *list_store,
1271 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1272 g_return_if_fail (iter != NULL);
1274 iter->stamp = list_store->stamp;
1275 iter->user_data = g_slist_alloc ();
1277 list_store->columns_dirty = TRUE;
1279 if (list_store->root == NULL)
1280 list_store->tail = iter->user_data;
1282 G_SLIST (iter->user_data)->next = G_SLIST (list_store->root);
1283 list_store->root = iter->user_data;
1285 list_store->length += 1;
1287 validate_list_store (list_store);
1289 path = gtk_tree_path_new ();
1290 gtk_tree_path_append_index (path, 0);
1291 gtk_tree_model_row_inserted (GTK_TREE_MODEL (list_store), path, iter);
1292 gtk_tree_path_free (path);
1296 * gtk_list_store_append:
1297 * @list_store: A #GtkListStore
1298 * @iter: An unset #GtkTreeIter to set to the appended row
1300 * Appends a new row to @list_store. @iter will be changed to point to this new
1301 * row. The row will be empty after this function is called. To fill in
1302 * values, you need to call gtk_list_store_set() or gtk_list_store_set_value().
1306 gtk_list_store_append (GtkListStore *list_store,
1311 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1312 g_return_if_fail (iter != NULL);
1314 list_store->columns_dirty = TRUE;
1316 if (GTK_LIST_STORE_IS_SORTED (list_store))
1318 gtk_list_store_prepend (list_store, iter);
1322 iter->stamp = list_store->stamp;
1323 iter->user_data = g_slist_alloc ();
1325 if (list_store->tail)
1326 ((GSList *)list_store->tail)->next = iter->user_data;
1328 list_store->root = iter->user_data;
1330 list_store->tail = iter->user_data;
1332 list_store->length += 1;
1334 validate_list_store (list_store);
1336 path = gtk_tree_path_new ();
1337 gtk_tree_path_append_index (path, list_store->length - 1);
1338 gtk_tree_model_row_inserted (GTK_TREE_MODEL (list_store), path, iter);
1339 gtk_tree_path_free (path);
1343 * gtk_list_store_clear:
1344 * @list_store: a #GtkListStore.
1346 * Removes all rows from the list store.
1350 gtk_list_store_clear (GtkListStore *list_store)
1353 g_return_if_fail (GTK_IS_LIST_STORE (list_store));
1355 while (list_store->root)
1357 iter.stamp = list_store->stamp;
1358 iter.user_data = list_store->root;
1359 gtk_list_store_remove (list_store, &iter);
1364 * gtk_list_store_iter_is_valid:
1365 * @list_store: A #GtkListStore.
1366 * @iter: A #GtkTreeIter.
1368 * WARNING: This function is slow. Only use it for debugging and/or testing
1371 * Checks if the given iter is a valid iter for this #GtkListStore.
1373 * Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1376 gtk_list_store_iter_is_valid (GtkListStore *list_store,
1381 g_return_val_if_fail (GTK_IS_LIST_STORE (list_store), FALSE);
1382 g_return_val_if_fail (iter != NULL, FALSE);
1384 if (!VALID_ITER (iter, list_store))
1387 if (iter->user_data == list_store->root)
1389 if (iter->user_data == list_store->tail)
1392 for (list = ((GList *)list_store->root)->next; list; list = list->next)
1393 if (list == iter->user_data)
1400 gtk_list_store_drag_data_delete (GtkTreeDragSource *drag_source,
1404 g_return_val_if_fail (GTK_IS_LIST_STORE (drag_source), FALSE);
1406 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (drag_source),
1410 gtk_list_store_remove (GTK_LIST_STORE (drag_source), &iter);
1417 gtk_list_store_drag_data_get (GtkTreeDragSource *drag_source,
1419 GtkSelectionData *selection_data)
1421 g_return_val_if_fail (GTK_IS_LIST_STORE (drag_source), FALSE);
1423 /* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1424 * target, because the default handler does it for us, but
1425 * we do anyway for the convenience of someone maybe overriding the
1429 if (gtk_tree_set_row_drag_data (selection_data,
1430 GTK_TREE_MODEL (drag_source),
1437 /* FIXME handle text targets at least. */
1444 gtk_list_store_drag_data_received (GtkTreeDragDest *drag_dest,
1446 GtkSelectionData *selection_data)
1448 GtkTreeModel *tree_model;
1449 GtkListStore *list_store;
1450 GtkTreeModel *src_model = NULL;
1451 GtkTreePath *src_path = NULL;
1452 gboolean retval = FALSE;
1454 g_return_val_if_fail (GTK_IS_LIST_STORE (drag_dest), FALSE);
1456 tree_model = GTK_TREE_MODEL (drag_dest);
1457 list_store = GTK_LIST_STORE (drag_dest);
1459 if (gtk_tree_get_row_drag_data (selection_data,
1462 src_model == tree_model)
1464 /* Copy the given row to a new position */
1465 GtkTreeIter src_iter;
1466 GtkTreeIter dest_iter;
1469 if (!gtk_tree_model_get_iter (src_model,
1476 /* Get the path to insert _after_ (dest is the path to insert _before_) */
1477 prev = gtk_tree_path_copy (dest);
1479 if (!gtk_tree_path_prev (prev))
1481 /* dest was the first spot in the list; which means we are supposed
1484 gtk_list_store_prepend (GTK_LIST_STORE (tree_model),
1491 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (tree_model),
1495 GtkTreeIter tmp_iter = dest_iter;
1497 if (GPOINTER_TO_INT (g_object_get_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append")))
1498 gtk_list_store_append (GTK_LIST_STORE (tree_model), &dest_iter);
1500 gtk_list_store_insert_after (GTK_LIST_STORE (tree_model),
1501 &dest_iter, &tmp_iter);
1507 g_object_set_data (G_OBJECT (tree_model), "gtk-tree-model-drop-append",
1510 gtk_tree_path_free (prev);
1512 /* If we succeeded in creating dest_iter, copy data from src
1516 GtkTreeDataList *dl = G_SLIST (src_iter.user_data)->data;
1517 GtkTreeDataList *copy_head = NULL;
1518 GtkTreeDataList *copy_prev = NULL;
1519 GtkTreeDataList *copy_iter = NULL;
1526 copy_iter = _gtk_tree_data_list_node_copy (dl,
1527 list_store->column_headers[col]);
1529 if (copy_head == NULL)
1530 copy_head = copy_iter;
1533 copy_prev->next = copy_iter;
1535 copy_prev = copy_iter;
1541 dest_iter.stamp = GTK_LIST_STORE (tree_model)->stamp;
1542 G_SLIST (dest_iter.user_data)->data = copy_head;
1544 path = gtk_list_store_get_path (GTK_TREE_MODEL (tree_model), &dest_iter);
1545 gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_model), path, &dest_iter);
1546 gtk_tree_path_free (path);
1551 /* FIXME maybe add some data targets eventually, or handle text
1552 * targets in the simple case.
1559 gtk_tree_path_free (src_path);
1565 gtk_list_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1566 GtkTreePath *dest_path,
1567 GtkSelectionData *selection_data)
1570 GtkTreeModel *src_model = NULL;
1571 GtkTreePath *src_path = NULL;
1572 gboolean retval = FALSE;
1574 g_return_val_if_fail (GTK_IS_LIST_STORE (drag_dest), FALSE);
1576 /* don't accept drops if the list has been sorted */
1577 if (GTK_LIST_STORE_IS_SORTED (drag_dest))
1580 if (!gtk_tree_get_row_drag_data (selection_data,
1585 if (src_model != GTK_TREE_MODEL (drag_dest))
1588 if (gtk_tree_path_get_depth (dest_path) != 1)
1591 /* can drop before any existing node, or before one past any existing. */
1593 indices = gtk_tree_path_get_indices (dest_path);
1595 if (indices[0] <= GTK_LIST_STORE (drag_dest)->length)
1599 gtk_tree_path_free (src_path);
1604 /* Sorting and reordering */
1605 typedef struct _SortTuple
1613 gtk_list_store_reorder_func (gconstpointer a,
1617 SortTuple *a_reorder;
1618 SortTuple *b_reorder;
1620 a_reorder = (SortTuple *)a;
1621 b_reorder = (SortTuple *)b;
1623 if (a_reorder->offset < b_reorder->offset)
1625 if (a_reorder->offset > b_reorder->offset)
1632 * gtk_list_store_reorder:
1633 * @store: A #GtkTreeStore.
1634 * @new_order: An integer array indicating the new order for the list.
1636 * Reorders @store to follow the order indicated by @new_order. Note that
1637 * this function only works with unsorted stores.
1640 gtk_list_store_reorder (GtkListStore *store,
1644 GSList *current_list;
1646 SortTuple *sort_array;
1648 g_return_if_fail (GTK_IS_LIST_STORE (store));
1649 g_return_if_fail (!GTK_LIST_STORE_IS_SORTED (store));
1650 g_return_if_fail (new_order != NULL);
1652 sort_array = g_new (SortTuple, store->length);
1654 current_list = store->root;
1656 for (i = 0; i < store->length; i++)
1658 sort_array[i].offset = new_order[i];
1659 sort_array[i].el = current_list;
1661 current_list = current_list->next;
1664 g_qsort_with_data (sort_array,
1667 gtk_list_store_reorder_func,
1670 for (i = 0; i < store->length - 1; i++)
1671 G_SLIST (sort_array[i].el)->next = G_SLIST (sort_array[i+1].el);
1673 store->root = G_SLIST (sort_array[0].el);
1674 store->tail = G_SLIST (sort_array[store->length-1].el);
1675 G_SLIST (store->tail)->next = NULL;
1678 path = gtk_tree_path_new ();
1679 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (store),
1680 path, NULL, new_order);
1681 gtk_tree_path_free (path);
1682 g_free (sort_array);
1686 * gtk_list_store_swap:
1687 * @store: A #GtkListStore.
1688 * @a: A #GtkTreeIter.
1689 * @b: Another #GtkTreeIter.
1691 * Swaps @a and @b in @store. Note that this function only works with
1695 gtk_list_store_swap (GtkListStore *store,
1699 GSList *i, *prev_a = NULL, *prev_b = NULL;
1700 gint j, a_count = 0, b_count = 0, *order;
1703 g_return_if_fail (GTK_IS_LIST_STORE (store));
1704 g_return_if_fail (!GTK_LIST_STORE_IS_SORTED (store));
1705 g_return_if_fail (VALID_ITER (a, store));
1706 g_return_if_fail (VALID_ITER (b, store));
1708 if (a->user_data == b->user_data)
1711 if (a->user_data == store->root)
1715 for (i = store->root; i; i = i->next, a_count++)
1716 if (i->next == a->user_data)
1725 if (b->user_data == store->root)
1729 for (i = store->root; i; i = i->next, b_count++)
1730 if (i->next == b->user_data)
1740 store->root = b->user_data;
1742 prev_a->next = b->user_data;
1745 store->root = a->user_data;
1747 prev_b->next = a->user_data;
1749 /* think a_next inspead of a_prev here ... */
1750 prev_a = G_SLIST (a->user_data)->next;
1751 prev_b = G_SLIST (b->user_data)->next;
1753 G_SLIST (a->user_data)->next = prev_b;
1754 G_SLIST (b->user_data)->next = prev_a;
1757 order = g_new (gint, store->length);
1758 for (j = 0; j < store->length; j++)
1761 else if (j == b_count)
1766 path = gtk_tree_path_new ();
1767 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (store),
1769 gtk_tree_path_free (path);
1774 gtk_list_store_move (GtkListStore *store,
1776 GtkTreeIter *position,
1780 GSList *i, *a, *prev = NULL, *tmp;
1781 gint new_pos = 0, old_pos = 0, j = 0, *order;
1782 GtkTreePath *path, *pos_path = NULL;
1784 g_return_if_fail (GTK_IS_LIST_STORE (store));
1785 g_return_if_fail (!GTK_LIST_STORE_IS_SORTED (store));
1786 g_return_if_fail (VALID_ITER (iter, store));
1788 g_return_if_fail (VALID_ITER (position, store));
1790 /* lots of sanity checks */
1793 path = gtk_tree_model_get_path (GTK_TREE_MODEL (store), iter);
1794 pos_path = gtk_tree_model_get_path (GTK_TREE_MODEL (store), position);
1796 if (gtk_tree_path_get_depth (pos_path) != 1)
1797 goto free_paths_and_out;
1800 * moving the iter before path or "path + 1" doesn't make sense
1802 * moving the iter before path or "path - 1" doesn't make sense
1804 if (!gtk_tree_path_compare (path, pos_path))
1805 goto free_paths_and_out;
1808 gtk_tree_path_next (path);
1810 gtk_tree_path_prev (path);
1812 if (!gtk_tree_path_compare (path, pos_path))
1813 goto free_paths_and_out;
1815 gtk_tree_path_free (path);
1818 /* getting destination iters */
1819 if (before && position)
1821 if (gtk_tree_path_get_indices (pos_path)[0] > 0)
1823 gtk_tree_path_prev (pos_path);
1824 if (gtk_tree_model_get_iter (GTK_TREE_MODEL (store), &dst_a, pos_path))
1825 a = G_SLIST (dst_a.user_data);
1828 gtk_tree_path_next (pos_path);
1833 else if (before && !position)
1838 a = G_SLIST (position->user_data);
1843 /* getting the old prev node */
1844 if (iter->user_data == store->root)
1848 for (i = store->root; i; i = i->next, old_pos++)
1849 if (i->next == iter->user_data)
1860 store->root = G_SLIST (iter->user_data)->next;
1862 prev->next = G_SLIST (iter->user_data)->next;
1864 /* and reinsert it */
1869 a->next = G_SLIST (iter->user_data);
1870 a->next->next = tmp;
1872 else if (!a && !before)
1874 tmp = G_SLIST (store->root);
1876 store->root = G_SLIST (iter->user_data);
1877 G_SLIST (store->root)->next = tmp;
1879 else if (!a && before)
1881 G_SLIST (store->tail)->next = G_SLIST (iter->user_data);
1882 G_SLIST (iter->user_data)->next = NULL;
1883 store->tail = iter->user_data;
1888 new_pos = gtk_tree_path_get_indices (pos_path)[0];
1890 new_pos = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (store), NULL) - 1;
1894 if (new_pos > old_pos)
1905 order = g_new (gint, store->length);
1906 if (new_pos > old_pos)
1908 for (j = 0; j < store->length; j++)
1911 else if (j >= old_pos && j < new_pos)
1913 else if (j == new_pos)
1920 for (j = 0; j < store->length; j++)
1923 else if (j > new_pos && j <= old_pos)
1929 path = gtk_tree_path_new ();
1930 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (store),
1932 gtk_tree_path_free (path);
1934 gtk_tree_path_free (pos_path);
1940 gtk_tree_path_free (path);
1941 gtk_tree_path_free (pos_path);
1945 * gtk_list_store_move_before:
1946 * @store: A #GtkListStore.
1947 * @iter: A #GtkTreeIter.
1948 * @position: A #GtkTreeIter, or %NULL.
1950 * Moves @iter in @store to the position before @position. Note that this
1951 * function only works with unsorted stores. If @position is %NULL, @iter
1952 * will be moved to the end of the list.
1955 gtk_list_store_move_before (GtkListStore *store,
1957 GtkTreeIter *position)
1959 gtk_list_store_move (store, iter, position, TRUE);
1963 * gtk_list_store_move_after:
1964 * @store: A #GtkListStore.
1965 * @iter: A #GtkTreeIter.
1966 * @position: A #GtkTreeIter, or %NULL.
1968 * Moves @iter in @store to the position after @position. Note that this
1969 * function only works with unsorted stores. If @position is %NULL, @iter
1970 * will be moved to the start of the list.
1973 gtk_list_store_move_after (GtkListStore *store,
1975 GtkTreeIter *position)
1977 gtk_list_store_move (store, iter, position, FALSE);
1982 gtk_list_store_compare_func (gconstpointer a,
1986 GtkListStore *list_store = user_data;
1987 GSList *el_a; /* Los Angeles? */
1992 GtkTreeIterCompareFunc func;
1996 if (list_store->sort_column_id != -1)
1998 GtkTreeDataSortHeader *header;
2000 header = _gtk_tree_data_list_get_header (list_store->sort_list,
2001 list_store->sort_column_id);
2002 g_return_val_if_fail (header != NULL, 0);
2003 g_return_val_if_fail (header->func != NULL, 0);
2005 func = header->func;
2006 data = header->data;
2010 g_return_val_if_fail (list_store->default_sort_func != NULL, 0);
2011 func = list_store->default_sort_func;
2012 data = list_store->default_sort_data;
2015 el_a = ((SortTuple *) a)->el;
2016 el_b = ((SortTuple *) b)->el;
2018 iter_a.stamp = list_store->stamp;
2019 iter_a.user_data = el_a;
2020 iter_b.stamp = list_store->stamp;
2021 iter_b.user_data = el_b;
2023 retval = (* func) (GTK_TREE_MODEL (list_store), &iter_a, &iter_b, data);
2025 if (list_store->order == GTK_SORT_DESCENDING)
2029 else if (retval < 0)
2036 gtk_list_store_sort (GtkListStore *list_store)
2044 if (list_store->length <= 1)
2047 g_assert (GTK_LIST_STORE_IS_SORTED (list_store));
2049 list = G_SLIST (list_store->root);
2051 sort_array = g_array_sized_new (FALSE, FALSE,
2053 list_store->length);
2055 for (i = 0; i < list_store->length; i++)
2059 /* If this fails, we are in an inconsistent state. Bad */
2060 g_return_if_fail (list != NULL);
2064 g_array_append_val (sort_array, tuple);
2069 g_array_sort_with_data (sort_array, gtk_list_store_compare_func, list_store);
2071 for (i = 0; i < list_store->length - 1; i++)
2072 g_array_index (sort_array, SortTuple, i).el->next =
2073 g_array_index (sort_array, SortTuple, i + 1).el;
2074 g_array_index (sort_array, SortTuple, list_store->length - 1).el->next = NULL;
2075 list_store->root = g_array_index (sort_array, SortTuple, 0).el;
2076 list_store->tail = g_array_index (sort_array, SortTuple, list_store->length - 1).el;
2078 /* Let the world know about our new order */
2079 new_order = g_new (gint, list_store->length);
2080 for (i = 0; i < list_store->length; i++)
2081 new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2083 path = gtk_tree_path_new ();
2084 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (list_store),
2085 path, NULL, new_order);
2086 gtk_tree_path_free (path);
2088 g_array_free (sort_array, TRUE);
2092 gtk_list_store_sort_iter_changed (GtkListStore *list_store,
2097 GSList *prev = NULL;
2098 GSList *next = NULL;
2099 GSList *list = G_SLIST (list_store->root);
2100 GtkTreePath *tmp_path;
2101 GtkTreeIter tmp_iter;
2108 GtkTreeIterCompareFunc func;
2111 if (list_store->length < 2)
2114 tmp_iter.stamp = list_store->stamp;
2116 if (list_store->sort_column_id != -1)
2118 GtkTreeDataSortHeader *header;
2119 header = _gtk_tree_data_list_get_header (list_store->sort_list,
2120 list_store->sort_column_id);
2121 g_return_if_fail (header != NULL);
2122 g_return_if_fail (header->func != NULL);
2123 func = header->func;
2124 data = header->data;
2128 g_return_if_fail (list_store->default_sort_func != NULL);
2129 func = list_store->default_sort_func;
2130 data = list_store->default_sort_data;
2133 /* If it's the built in function, we don't sort. */
2134 if (func == gtk_tree_data_list_compare_func &&
2135 list_store->sort_column_id != column)
2139 /* First we find the iter, its prev, and its next */
2142 if (list == G_SLIST (iter->user_data))
2148 g_assert (list != NULL);
2152 /* Check the common case, where we don't need to sort it moved. */
2155 tmp_iter.user_data = prev;
2156 cmp_a = (* func) (GTK_TREE_MODEL (list_store), &tmp_iter, iter, data);
2161 tmp_iter.user_data = next;
2162 cmp_b = (* func) (GTK_TREE_MODEL (list_store), iter, &tmp_iter, data);
2165 if (list_store->order == GTK_SORT_DESCENDING)
2178 if (prev == NULL && cmp_b <= 0)
2180 else if (next == NULL && cmp_a <= 0)
2182 else if (prev != NULL && next != NULL &&
2183 cmp_a <= 0 && cmp_b <= 0)
2186 /* We actually need to sort it */
2187 /* First, remove the old link. */
2190 list_store->root = next;
2194 list_store->tail = prev;
2197 /* FIXME: as an optimization, we can potentially start at next */
2199 list = G_SLIST (list_store->root);
2201 tmp_iter.user_data = list;
2202 if (list_store->order == GTK_SORT_DESCENDING)
2203 cmp_a = (* func) (GTK_TREE_MODEL (list_store), &tmp_iter, iter, data);
2205 cmp_a = (* func) (GTK_TREE_MODEL (list_store), iter, &tmp_iter, data);
2207 while ((list->next) && (cmp_a > 0))
2212 tmp_iter.user_data = list;
2213 if (list_store->order == GTK_SORT_DESCENDING)
2214 cmp_a = (* func) (GTK_TREE_MODEL (list_store), &tmp_iter, iter, data);
2216 cmp_a = (* func) (GTK_TREE_MODEL (list_store), iter, &tmp_iter, data);
2219 if ((!list->next) && (cmp_a > 0))
2222 list->next = G_SLIST (iter->user_data);
2223 list_store->tail = list->next;
2227 prev->next = G_SLIST (iter->user_data);
2228 G_SLIST (iter->user_data)->next = list;
2232 G_SLIST (iter->user_data)->next = G_SLIST (list_store->root);
2233 list_store->root = G_SLIST (iter->user_data);
2236 /* Emit the reordered signal. */
2237 new_order = g_new (int, list_store->length);
2238 if (old_location < new_location)
2239 for (i = 0; i < list_store->length; i++)
2241 if (i < old_location ||
2244 else if (i >= old_location &&
2246 new_order[i] = i + 1;
2247 else if (i == new_location)
2248 new_order[i] = old_location;
2251 for (i = 0; i < list_store->length; i++)
2253 if (i < new_location ||
2256 else if (i > new_location &&
2258 new_order[i] = i - 1;
2259 else if (i == new_location)
2260 new_order[i] = old_location;
2263 tmp_path = gtk_tree_path_new ();
2264 tmp_iter.user_data = NULL;
2266 gtk_tree_model_rows_reordered (GTK_TREE_MODEL (list_store),
2270 gtk_tree_path_free (tmp_path);
2275 gtk_list_store_get_sort_column_id (GtkTreeSortable *sortable,
2276 gint *sort_column_id,
2279 GtkListStore *list_store = (GtkListStore *) sortable;
2281 g_return_val_if_fail (GTK_IS_LIST_STORE (sortable), FALSE);
2283 if (list_store->sort_column_id == -1)
2287 * sort_column_id = list_store->sort_column_id;
2289 * order = list_store->order;
2294 gtk_list_store_set_sort_column_id (GtkTreeSortable *sortable,
2295 gint sort_column_id,
2298 GtkListStore *list_store = (GtkListStore *) sortable;
2300 g_return_if_fail (GTK_IS_LIST_STORE (sortable));
2302 if ((list_store->sort_column_id == sort_column_id) &&
2303 (list_store->order == order))
2306 if (sort_column_id != -1)
2308 GtkTreeDataSortHeader *header = NULL;
2310 header = _gtk_tree_data_list_get_header (list_store->sort_list, sort_column_id);
2312 /* We want to make sure that we have a function */
2313 g_return_if_fail (header != NULL);
2314 g_return_if_fail (header->func != NULL);
2318 g_return_if_fail (list_store->default_sort_func != NULL);
2322 list_store->sort_column_id = sort_column_id;
2323 list_store->order = order;
2325 gtk_list_store_sort (list_store);
2327 gtk_tree_sortable_sort_column_changed (sortable);
2331 gtk_list_store_set_sort_func (GtkTreeSortable *sortable,
2332 gint sort_column_id,
2333 GtkTreeIterCompareFunc func,
2335 GtkDestroyNotify destroy)
2337 GtkListStore *list_store = (GtkListStore *) sortable;
2338 GtkTreeDataSortHeader *header = NULL;
2341 g_return_if_fail (GTK_IS_LIST_STORE (sortable));
2342 g_return_if_fail (func != NULL);
2344 for (list = list_store->sort_list; list; list = list->next)
2346 GtkTreeDataSortHeader *list_header;
2348 list_header = (GtkTreeDataSortHeader*) list->data;
2349 if (list_header->sort_column_id == sort_column_id)
2351 header = list_header;
2358 header = g_new0 (GtkTreeDataSortHeader, 1);
2359 header->sort_column_id = sort_column_id;
2360 list_store->sort_list = g_list_append (list_store->sort_list, header);
2363 if (header->destroy)
2365 GtkDestroyNotify d = header->destroy;
2367 header->destroy = NULL;
2371 header->func = func;
2372 header->data = data;
2373 header->destroy = destroy;
2378 gtk_list_store_set_default_sort_func (GtkTreeSortable *sortable,
2379 GtkTreeIterCompareFunc func,
2381 GtkDestroyNotify destroy)
2383 GtkListStore *list_store = (GtkListStore *) sortable;
2385 g_return_if_fail (GTK_IS_LIST_STORE (sortable));
2387 if (list_store->default_sort_destroy)
2389 GtkDestroyNotify d = list_store->default_sort_destroy;
2391 list_store->default_sort_destroy = NULL;
2392 d (list_store->default_sort_data);
2395 list_store->default_sort_func = func;
2396 list_store->default_sort_data = data;
2397 list_store->default_sort_destroy = destroy;
2401 gtk_list_store_has_default_sort_func (GtkTreeSortable *sortable)
2403 GtkListStore *list_store = (GtkListStore *) sortable;
2405 g_return_val_if_fail (GTK_IS_LIST_STORE (sortable), FALSE);
2407 return (list_store->default_sort_func != NULL);