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.
22
#include <gobject/gvaluecollector.h>
23
#include "gtktreemodel.h"
24
#include "gtktreestore.h"
25
#include "gtktreedatalist.h"
26
#include "gtktreednd.h"
30
#define G_NODE(node) ((GNode *)node)
31
#define GTK_TREE_STORE_IS_SORTED(tree) (((GtkTreeStore*)(tree))->sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
32
#define VALID_ITER(iter, tree_store) ((iter)!= NULL && (iter)->user_data != NULL && ((GtkTreeStore*)(tree_store))->stamp == (iter)->stamp)
34
static void gtk_tree_store_tree_model_init (GtkTreeModelIface *iface);
35
static void gtk_tree_store_drag_source_init(GtkTreeDragSourceIface *iface);
36
static void gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface);
37
static void gtk_tree_store_sortable_init (GtkTreeSortableIface *iface);
38
static void gtk_tree_store_finalize (GObject *object);
39
static GtkTreeModelFlags gtk_tree_store_get_flags (GtkTreeModel *tree_model);
40
static gint gtk_tree_store_get_n_columns (GtkTreeModel *tree_model);
41
static GType gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
43
static gboolean gtk_tree_store_get_iter (GtkTreeModel *tree_model,
46
static GtkTreePath *gtk_tree_store_get_path (GtkTreeModel *tree_model,
48
static void gtk_tree_store_get_value (GtkTreeModel *tree_model,
52
static gboolean gtk_tree_store_iter_next (GtkTreeModel *tree_model,
54
static gboolean gtk_tree_store_iter_children (GtkTreeModel *tree_model,
57
static gboolean gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
59
static gint gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
61
static gboolean gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
65
static gboolean gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
70
static void gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
72
static void gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
76
static void gtk_tree_store_increment_stamp (GtkTreeStore *tree_store);
80
static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
82
static gboolean gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
84
static gboolean gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
86
GtkSelectionData *selection_data);
87
static gboolean gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
89
GtkSelectionData *selection_data);
90
static gboolean gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
91
GtkTreePath *dest_path,
92
GtkSelectionData *selection_data);
94
/* Sortable Interfaces */
96
static void gtk_tree_store_sort (GtkTreeStore *tree_store);
97
static void gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
100
gboolean emit_signal);
101
static gboolean gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
102
gint *sort_column_id,
104
static void gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
107
static void gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
109
GtkTreeIterCompareFunc func,
111
GtkDestroyNotify destroy);
112
static void gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
113
GtkTreeIterCompareFunc func,
115
GtkDestroyNotify destroy);
116
static gboolean gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable);
118
static void validate_gnode (GNode *node);
120
static void gtk_tree_store_move (GtkTreeStore *tree_store,
122
GtkTreeIter *position,
127
validate_tree (GtkTreeStore *tree_store)
129
if (gtk_debug_flags & GTK_DEBUG_TREE)
131
g_assert (G_NODE (tree_store->root)->parent == NULL);
133
validate_gnode (G_NODE (tree_store->root));
137
G_DEFINE_TYPE_WITH_CODE (GtkTreeStore, gtk_tree_store, G_TYPE_OBJECT,
138
G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_MODEL,
139
gtk_tree_store_tree_model_init)
140
G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_DRAG_SOURCE,
141
gtk_tree_store_drag_source_init)
142
G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_DRAG_DEST,
143
gtk_tree_store_drag_dest_init)
144
G_IMPLEMENT_INTERFACE (GTK_TYPE_TREE_SORTABLE,
145
gtk_tree_store_sortable_init))
148
gtk_tree_store_class_init (GtkTreeStoreClass *class)
150
GObjectClass *object_class;
152
object_class = (GObjectClass *) class;
154
object_class->finalize = gtk_tree_store_finalize;
158
gtk_tree_store_tree_model_init (GtkTreeModelIface *iface)
160
iface->get_flags = gtk_tree_store_get_flags;
161
iface->get_n_columns = gtk_tree_store_get_n_columns;
162
iface->get_column_type = gtk_tree_store_get_column_type;
163
iface->get_iter = gtk_tree_store_get_iter;
164
iface->get_path = gtk_tree_store_get_path;
165
iface->get_value = gtk_tree_store_get_value;
166
iface->iter_next = gtk_tree_store_iter_next;
167
iface->iter_children = gtk_tree_store_iter_children;
168
iface->iter_has_child = gtk_tree_store_iter_has_child;
169
iface->iter_n_children = gtk_tree_store_iter_n_children;
170
iface->iter_nth_child = gtk_tree_store_iter_nth_child;
171
iface->iter_parent = gtk_tree_store_iter_parent;
175
gtk_tree_store_drag_source_init (GtkTreeDragSourceIface *iface)
177
iface->row_draggable = real_gtk_tree_store_row_draggable;
178
iface->drag_data_delete = gtk_tree_store_drag_data_delete;
179
iface->drag_data_get = gtk_tree_store_drag_data_get;
183
gtk_tree_store_drag_dest_init (GtkTreeDragDestIface *iface)
185
iface->drag_data_received = gtk_tree_store_drag_data_received;
186
iface->row_drop_possible = gtk_tree_store_row_drop_possible;
190
gtk_tree_store_sortable_init (GtkTreeSortableIface *iface)
192
iface->get_sort_column_id = gtk_tree_store_get_sort_column_id;
193
iface->set_sort_column_id = gtk_tree_store_set_sort_column_id;
194
iface->set_sort_func = gtk_tree_store_set_sort_func;
195
iface->set_default_sort_func = gtk_tree_store_set_default_sort_func;
196
iface->has_default_sort_func = gtk_tree_store_has_default_sort_func;
200
gtk_tree_store_init (GtkTreeStore *tree_store)
202
tree_store->root = g_node_new (NULL);
203
/* While the odds are against us getting 0...
207
tree_store->stamp = g_random_int ();
209
while (tree_store->stamp == 0);
211
tree_store->sort_list = NULL;
212
tree_store->sort_column_id = -2;
213
tree_store->columns_dirty = FALSE;
217
* gtk_tree_store_new:
218
* @n_columns: number of columns in the tree store
219
* @Varargs: all #GType types for the columns, from first to last
221
* Creates a new tree store as with @n_columns columns each of the types passed
222
* in. Note that only types derived from standard GObject fundamental types
225
* As an example, <literal>gtk_tree_store_new (3, G_TYPE_INT, G_TYPE_STRING,
226
* GDK_TYPE_PIXBUF);</literal> will create a new #GtkTreeStore with three columns, of type
227
* <type>int</type>, <type>string</type> and #GdkPixbuf respectively.
229
* Return value: a new #GtkTreeStore
232
gtk_tree_store_new (gint n_columns,
235
GtkTreeStore *retval;
239
g_return_val_if_fail (n_columns > 0, NULL);
241
retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
242
gtk_tree_store_set_n_columns (retval, n_columns);
244
va_start (args, n_columns);
246
for (i = 0; i < n_columns; i++)
248
GType type = va_arg (args, GType);
249
if (! _gtk_tree_data_list_check_type (type))
251
g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (type));
252
g_object_unref (retval);
255
gtk_tree_store_set_column_type (retval, i, type);
262
* gtk_tree_store_newv:
263
* @n_columns: number of columns in the tree store
264
* @types: an array of #GType types for the columns, from first to last
266
* Non vararg creation function. Used primarily by language bindings.
268
* Return value: a new #GtkTreeStore
271
gtk_tree_store_newv (gint n_columns,
274
GtkTreeStore *retval;
277
g_return_val_if_fail (n_columns > 0, NULL);
279
retval = g_object_new (GTK_TYPE_TREE_STORE, NULL);
280
gtk_tree_store_set_n_columns (retval, n_columns);
282
for (i = 0; i < n_columns; i++)
284
if (! _gtk_tree_data_list_check_type (types[i]))
286
g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (types[i]));
287
g_object_unref (retval);
290
gtk_tree_store_set_column_type (retval, i, types[i]);
298
* gtk_tree_store_set_column_types:
299
* @tree_store: A #GtkTreeStore
300
* @n_columns: Number of columns for the tree store
301
* @types: An array of #GType types, one for each column
303
* This function is meant primarily for #GObjects that inherit from
304
* #GtkTreeStore, and should only be used when constructing a new
305
* #GtkTreeStore. It will not function after a row has been added,
306
* or a method on the #GtkTreeModel interface is called.
309
gtk_tree_store_set_column_types (GtkTreeStore *tree_store,
315
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
316
g_return_if_fail (tree_store->columns_dirty == 0);
318
gtk_tree_store_set_n_columns (tree_store, n_columns);
319
for (i = 0; i < n_columns; i++)
321
if (! _gtk_tree_data_list_check_type (types[i]))
323
g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (types[i]));
326
gtk_tree_store_set_column_type (tree_store, i, types[i]);
331
gtk_tree_store_set_n_columns (GtkTreeStore *tree_store,
336
if (tree_store->n_columns == n_columns)
339
new_columns = g_new0 (GType, n_columns);
340
if (tree_store->column_headers)
342
/* copy the old header orders over */
343
if (n_columns >= tree_store->n_columns)
344
memcpy (new_columns, tree_store->column_headers, tree_store->n_columns * sizeof (gchar *));
346
memcpy (new_columns, tree_store->column_headers, n_columns * sizeof (GType));
348
g_free (tree_store->column_headers);
351
if (tree_store->sort_list)
352
_gtk_tree_data_list_header_free (tree_store->sort_list);
354
tree_store->sort_list = _gtk_tree_data_list_header_new (n_columns, tree_store->column_headers);
356
tree_store->column_headers = new_columns;
357
tree_store->n_columns = n_columns;
361
* gtk_tree_store_set_column_type:
362
* @tree_store: a #GtkTreeStore
363
* @column: column number
364
* @type: type of the data to be stored in @column
366
* Supported types include: %G_TYPE_UINT, %G_TYPE_INT, %G_TYPE_UCHAR,
367
* %G_TYPE_CHAR, %G_TYPE_BOOLEAN, %G_TYPE_POINTER, %G_TYPE_FLOAT,
368
* %G_TYPE_DOUBLE, %G_TYPE_STRING, %G_TYPE_OBJECT, and %G_TYPE_BOXED, along with
369
* subclasses of those types such as %GDK_TYPE_PIXBUF.
373
gtk_tree_store_set_column_type (GtkTreeStore *tree_store,
377
if (!_gtk_tree_data_list_check_type (type))
379
g_warning ("%s: Invalid type %s\n", G_STRLOC, g_type_name (type));
382
tree_store->column_headers[column] = type;
386
node_free (GNode *node, gpointer data)
389
_gtk_tree_data_list_free (node->data, (GType*)data);
396
gtk_tree_store_finalize (GObject *object)
398
GtkTreeStore *tree_store = GTK_TREE_STORE (object);
400
g_node_traverse (tree_store->root, G_POST_ORDER, G_TRAVERSE_ALL, -1,
401
node_free, tree_store->column_headers);
402
g_node_destroy (tree_store->root);
403
_gtk_tree_data_list_header_free (tree_store->sort_list);
404
g_free (tree_store->column_headers);
406
if (tree_store->default_sort_destroy)
408
GtkDestroyNotify d = tree_store->default_sort_destroy;
410
tree_store->default_sort_destroy = NULL;
411
d (tree_store->default_sort_data);
412
tree_store->default_sort_data = NULL;
416
G_OBJECT_CLASS (gtk_tree_store_parent_class)->finalize (object);
419
/* fulfill the GtkTreeModel requirements */
420
/* NOTE: GtkTreeStore::root is a GNode, that acts as the parent node. However,
421
* it is not visible to the tree or to the user., and the path "0" refers to the
422
* first child of GtkTreeStore::root.
426
static GtkTreeModelFlags
427
gtk_tree_store_get_flags (GtkTreeModel *tree_model)
429
return GTK_TREE_MODEL_ITERS_PERSIST;
433
gtk_tree_store_get_n_columns (GtkTreeModel *tree_model)
435
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
437
tree_store->columns_dirty = TRUE;
439
return tree_store->n_columns;
443
gtk_tree_store_get_column_type (GtkTreeModel *tree_model,
446
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
448
g_return_val_if_fail (index < tree_store->n_columns, G_TYPE_INVALID);
450
tree_store->columns_dirty = TRUE;
452
return tree_store->column_headers[index];
456
gtk_tree_store_get_iter (GtkTreeModel *tree_model,
460
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
465
tree_store->columns_dirty = TRUE;
467
indices = gtk_tree_path_get_indices (path);
468
depth = gtk_tree_path_get_depth (path);
470
g_return_val_if_fail (depth > 0, FALSE);
472
parent.stamp = tree_store->stamp;
473
parent.user_data = tree_store->root;
475
if (!gtk_tree_store_iter_nth_child (tree_model, iter, &parent, indices[0]))
478
for (i = 1; i < depth; i++)
481
if (!gtk_tree_store_iter_nth_child (tree_model, iter, &parent, indices[i]))
489
gtk_tree_store_get_path (GtkTreeModel *tree_model,
492
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
497
g_return_val_if_fail (iter->user_data != NULL, NULL);
498
g_return_val_if_fail (iter->stamp == tree_store->stamp, NULL);
500
validate_tree (tree_store);
502
if (G_NODE (iter->user_data)->parent == NULL &&
503
G_NODE (iter->user_data) == tree_store->root)
504
return gtk_tree_path_new ();
505
g_assert (G_NODE (iter->user_data)->parent != NULL);
507
if (G_NODE (iter->user_data)->parent == G_NODE (tree_store->root))
509
retval = gtk_tree_path_new ();
510
tmp_node = G_NODE (tree_store->root)->children;
514
GtkTreeIter tmp_iter = *iter;
516
tmp_iter.user_data = G_NODE (iter->user_data)->parent;
518
retval = gtk_tree_store_get_path (tree_model, &tmp_iter);
519
tmp_node = G_NODE (iter->user_data)->parent->children;
525
if (tmp_node == NULL)
527
gtk_tree_path_free (retval);
531
for (; tmp_node; tmp_node = tmp_node->next)
533
if (tmp_node == G_NODE (iter->user_data))
538
if (tmp_node == NULL)
540
/* We couldn't find node, meaning it's prolly not ours */
541
/* Perhaps I should do a g_return_if_fail here. */
542
gtk_tree_path_free (retval);
546
gtk_tree_path_append_index (retval, i);
553
gtk_tree_store_get_value (GtkTreeModel *tree_model,
558
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
559
GtkTreeDataList *list;
560
gint tmp_column = column;
562
g_return_if_fail (column < tree_store->n_columns);
563
g_return_if_fail (VALID_ITER (iter, tree_store));
565
list = G_NODE (iter->user_data)->data;
567
while (tmp_column-- > 0 && list)
572
_gtk_tree_data_list_node_to_value (list,
573
tree_store->column_headers[column],
578
/* We want to return an initialized but empty (default) value */
579
g_value_init (value, tree_store->column_headers[column]);
584
gtk_tree_store_iter_next (GtkTreeModel *tree_model,
587
g_return_val_if_fail (iter->user_data != NULL, FALSE);
588
g_return_val_if_fail (iter->stamp == GTK_TREE_STORE (tree_model)->stamp, FALSE);
590
if (G_NODE (iter->user_data)->next)
592
iter->user_data = G_NODE (iter->user_data)->next;
600
gtk_tree_store_iter_children (GtkTreeModel *tree_model,
604
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
608
g_return_val_if_fail (VALID_ITER (parent, tree_store), FALSE);
611
children = G_NODE (parent->user_data)->children;
613
children = G_NODE (tree_store->root)->children;
617
iter->stamp = tree_store->stamp;
618
iter->user_data = children;
626
gtk_tree_store_iter_has_child (GtkTreeModel *tree_model,
629
g_return_val_if_fail (iter->user_data != NULL, FALSE);
630
g_return_val_if_fail (VALID_ITER (iter, tree_model), FALSE);
632
return G_NODE (iter->user_data)->children != NULL;
636
gtk_tree_store_iter_n_children (GtkTreeModel *tree_model,
642
g_return_val_if_fail (iter == NULL || iter->user_data != NULL, 0);
645
node = G_NODE (GTK_TREE_STORE (tree_model)->root)->children;
647
node = G_NODE (iter->user_data)->children;
659
gtk_tree_store_iter_nth_child (GtkTreeModel *tree_model,
664
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
668
g_return_val_if_fail (parent == NULL || parent->user_data != NULL, FALSE);
671
parent_node = tree_store->root;
673
parent_node = parent->user_data;
675
child = g_node_nth_child (parent_node, n);
679
iter->user_data = child;
680
iter->stamp = tree_store->stamp;
688
gtk_tree_store_iter_parent (GtkTreeModel *tree_model,
692
GtkTreeStore *tree_store = (GtkTreeStore *) tree_model;
695
g_return_val_if_fail (iter != NULL, FALSE);
696
g_return_val_if_fail (VALID_ITER (child, tree_store), FALSE);
698
parent = G_NODE (child->user_data)->parent;
700
g_assert (parent != NULL);
702
if (parent != tree_store->root)
704
iter->user_data = parent;
705
iter->stamp = tree_store->stamp;
713
/* Does not emit a signal */
715
gtk_tree_store_real_set_value (GtkTreeStore *tree_store,
721
GtkTreeDataList *list;
722
GtkTreeDataList *prev;
723
gint old_column = column;
724
GValue real_value = {0, };
725
gboolean converted = FALSE;
726
gboolean retval = FALSE;
728
if (! g_type_is_a (G_VALUE_TYPE (value), tree_store->column_headers[column]))
730
if (! (g_value_type_compatible (G_VALUE_TYPE (value), tree_store->column_headers[column]) &&
731
g_value_type_compatible (tree_store->column_headers[column], G_VALUE_TYPE (value))))
733
g_warning ("%s: Unable to convert from %s to %s\n",
735
g_type_name (G_VALUE_TYPE (value)),
736
g_type_name (tree_store->column_headers[column]));
739
if (!g_value_transform (value, &real_value))
741
g_warning ("%s: Unable to make conversion from %s to %s\n",
743
g_type_name (G_VALUE_TYPE (value)),
744
g_type_name (tree_store->column_headers[column]));
745
g_value_unset (&real_value);
751
prev = list = G_NODE (iter->user_data)->data;
758
_gtk_tree_data_list_value_to_node (list, &real_value);
760
_gtk_tree_data_list_value_to_node (list, value);
763
g_value_unset (&real_value);
764
if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
765
gtk_tree_store_sort_iter_changed (tree_store, iter, old_column, TRUE);
774
if (G_NODE (iter->user_data)->data == NULL)
776
G_NODE (iter->user_data)->data = list = _gtk_tree_data_list_alloc ();
781
list = prev->next = _gtk_tree_data_list_alloc ();
787
list->next = _gtk_tree_data_list_alloc ();
794
_gtk_tree_data_list_value_to_node (list, &real_value);
796
_gtk_tree_data_list_value_to_node (list, value);
800
g_value_unset (&real_value);
802
if (sort && GTK_TREE_STORE_IS_SORTED (tree_store))
803
gtk_tree_store_sort_iter_changed (tree_store, iter, old_column, TRUE);
809
* gtk_tree_store_set_value:
810
* @tree_store: a #GtkTreeStore
811
* @iter: A valid #GtkTreeIter for the row being modified
812
* @column: column number to modify
813
* @value: new value for the cell
815
* Sets the data in the cell specified by @iter and @column.
816
* The type of @value must be convertible to the type of the
821
gtk_tree_store_set_value (GtkTreeStore *tree_store,
826
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
827
g_return_if_fail (VALID_ITER (iter, tree_store));
828
g_return_if_fail (column >= 0 && column < tree_store->n_columns);
829
g_return_if_fail (G_IS_VALUE (value));
831
if (gtk_tree_store_real_set_value (tree_store, iter, column, value, TRUE))
835
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
836
gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
837
gtk_tree_path_free (path);
841
static GtkTreeIterCompareFunc
842
gtk_tree_store_get_compare_func (GtkTreeStore *tree_store)
844
GtkTreeIterCompareFunc func = NULL;
846
if (GTK_TREE_STORE_IS_SORTED (tree_store))
848
if (tree_store->sort_column_id != -1)
850
GtkTreeDataSortHeader *header;
851
header = _gtk_tree_data_list_get_header (tree_store->sort_list,
852
tree_store->sort_column_id);
853
g_return_val_if_fail (header != NULL, NULL);
854
g_return_val_if_fail (header->func != NULL, NULL);
859
func = tree_store->default_sort_func;
867
gtk_tree_store_set_valist_internal (GtkTreeStore *tree_store,
869
gboolean *emit_signal,
870
gboolean *maybe_need_sort,
874
GtkTreeIterCompareFunc func = NULL;
876
column = va_arg (var_args, gint);
878
func = gtk_tree_store_get_compare_func (tree_store);
879
if (func != _gtk_tree_data_list_compare_func)
880
*maybe_need_sort = TRUE;
884
GValue value = { 0, };
887
if (column < 0 || column >= tree_store->n_columns)
889
g_warning ("%s: Invalid column number %d added to iter (remember to end your list of columns with a -1)", G_STRLOC, column);
892
g_value_init (&value, tree_store->column_headers[column]);
894
G_VALUE_COLLECT (&value, var_args, 0, &error);
897
g_warning ("%s: %s", G_STRLOC, error);
900
/* we purposely leak the value here, it might not be
901
* in a sane state if an error condition occoured
906
*emit_signal = gtk_tree_store_real_set_value (tree_store,
910
FALSE) || *emit_signal;
912
if (func == _gtk_tree_data_list_compare_func &&
913
column == tree_store->sort_column_id)
914
*maybe_need_sort = TRUE;
916
g_value_unset (&value);
918
column = va_arg (var_args, gint);
923
* gtk_tree_store_set_valist:
924
* @tree_store: A #GtkTreeStore
925
* @iter: A valid #GtkTreeIter for the row being modified
926
* @var_args: <type>va_list</type> of column/value pairs
928
* See gtk_tree_store_set(); this version takes a <type>va_list</type> for
929
* use by language bindings.
933
gtk_tree_store_set_valist (GtkTreeStore *tree_store,
937
gboolean emit_signal = FALSE;
938
gboolean maybe_need_sort = FALSE;
940
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
941
g_return_if_fail (VALID_ITER (iter, tree_store));
943
gtk_tree_store_set_valist_internal (tree_store, iter,
948
if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
949
gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, TRUE);
955
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
956
gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, iter);
957
gtk_tree_path_free (path);
962
* gtk_tree_store_set:
963
* @tree_store: A #GtkTreeStore
964
* @iter: A valid #GtkTreeIter for the row being modified
965
* @Varargs: pairs of column number and value, terminated with -1
967
* Sets the value of one or more cells in the row referenced by @iter.
968
* The variable argument list should contain integer column numbers,
969
* each column number followed by the value to be set.
970
* The list is terminated by a -1. For example, to set column 0 with type
971
* %G_TYPE_STRING to "Foo", you would write
972
* <literal>gtk_tree_store_set (store, iter, 0, "Foo", -1)</literal>.
975
gtk_tree_store_set (GtkTreeStore *tree_store,
981
va_start (var_args, iter);
982
gtk_tree_store_set_valist (tree_store, iter, var_args);
987
* gtk_tree_store_remove:
988
* @tree_store: A #GtkTreeStore
989
* @iter: A valid #GtkTreeIter
991
* Removes @iter from @tree_store. After being removed, @iter is set to the
992
* next valid row at that level, or invalidated if it previously pointed to the
995
* Return value: %TRUE if @iter is still valid, %FALSE if not.
998
gtk_tree_store_remove (GtkTreeStore *tree_store,
1002
GtkTreeIter new_iter = {0,};
1006
g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1007
g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1009
parent = G_NODE (iter->user_data)->parent;
1011
g_assert (parent != NULL);
1012
next_node = G_NODE (iter->user_data)->next;
1014
if (G_NODE (iter->user_data)->data)
1015
g_node_traverse (G_NODE (iter->user_data), G_POST_ORDER, G_TRAVERSE_ALL,
1016
-1, node_free, tree_store->column_headers);
1018
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1019
g_node_destroy (G_NODE (iter->user_data));
1021
gtk_tree_model_row_deleted (GTK_TREE_MODEL (tree_store), path);
1023
if (parent != G_NODE (tree_store->root))
1026
if (parent->children == NULL)
1028
gtk_tree_path_up (path);
1030
new_iter.stamp = tree_store->stamp;
1031
new_iter.user_data = parent;
1032
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &new_iter);
1035
gtk_tree_path_free (path);
1037
/* revalidate iter */
1038
if (next_node != NULL)
1040
iter->stamp = tree_store->stamp;
1041
iter->user_data = next_node;
1047
iter->user_data = NULL;
1054
* gtk_tree_store_insert:
1055
* @tree_store: A #GtkTreeStore
1056
* @iter: An unset #GtkTreeIter to set to the new row
1057
* @parent: A valid #GtkTreeIter, or %NULL
1058
* @position: position to insert the new row
1060
* Creates a new row at @position. If parent is non-%NULL, then the row will be
1061
* made a child of @parent. Otherwise, the row will be created at the toplevel.
1062
* If @position is larger than the number of rows at that level, then the new
1063
* row will be inserted to the end of the list. @iter will be changed to point
1064
* to this new row. The row will be empty after this function is called. To
1065
* fill in values, you need to call gtk_tree_store_set() or
1066
* gtk_tree_store_set_value().
1070
gtk_tree_store_insert (GtkTreeStore *tree_store,
1072
GtkTreeIter *parent,
1079
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1080
g_return_if_fail (iter != NULL);
1082
g_return_if_fail (VALID_ITER (parent, tree_store));
1085
parent_node = parent->user_data;
1087
parent_node = tree_store->root;
1089
tree_store->columns_dirty = TRUE;
1091
new_node = g_node_new (NULL);
1093
iter->stamp = tree_store->stamp;
1094
iter->user_data = new_node;
1095
g_node_insert (parent_node, position, new_node);
1097
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1098
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1100
if (parent_node != tree_store->root)
1102
if (new_node->prev == NULL && new_node->next == NULL)
1104
gtk_tree_path_up (path);
1105
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1109
gtk_tree_path_free (path);
1111
validate_tree ((GtkTreeStore*)tree_store);
1115
* gtk_tree_store_insert_before:
1116
* @tree_store: A #GtkTreeStore
1117
* @iter: An unset #GtkTreeIter to set to the new row
1118
* @parent: A valid #GtkTreeIter, or %NULL
1119
* @sibling: A valid #GtkTreeIter, or %NULL
1121
* Inserts a new row before @sibling. If @sibling is %NULL, then the row will
1122
* be appended to @parent 's children. If @parent and @sibling are %NULL, then
1123
* the row will be appended to the toplevel. If both @sibling and @parent are
1124
* set, then @parent must be the parent of @sibling. When @sibling is set,
1125
* @parent is optional.
1127
* @iter will be changed to point to this new row. The row will be empty after
1128
* this function is called. To fill in values, you need to call
1129
* gtk_tree_store_set() or gtk_tree_store_set_value().
1133
gtk_tree_store_insert_before (GtkTreeStore *tree_store,
1135
GtkTreeIter *parent,
1136
GtkTreeIter *sibling)
1139
GNode *parent_node = NULL;
1142
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1143
g_return_if_fail (iter != NULL);
1145
g_return_if_fail (VALID_ITER (parent, tree_store));
1146
if (sibling != NULL)
1147
g_return_if_fail (VALID_ITER (sibling, tree_store));
1149
if (parent == NULL && sibling == NULL)
1150
parent_node = tree_store->root;
1151
else if (parent == NULL)
1152
parent_node = G_NODE (sibling->user_data)->parent;
1153
else if (sibling == NULL)
1154
parent_node = G_NODE (parent->user_data);
1157
g_return_if_fail (G_NODE (sibling->user_data)->parent == G_NODE (parent->user_data));
1158
parent_node = G_NODE (parent->user_data);
1161
tree_store->columns_dirty = TRUE;
1163
new_node = g_node_new (NULL);
1165
g_node_insert_before (parent_node,
1166
sibling ? G_NODE (sibling->user_data) : NULL,
1169
iter->stamp = tree_store->stamp;
1170
iter->user_data = new_node;
1172
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1173
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1175
if (parent_node != tree_store->root)
1177
if (new_node->prev == NULL && new_node->next == NULL)
1179
GtkTreeIter parent_iter;
1181
parent_iter.stamp = tree_store->stamp;
1182
parent_iter.user_data = parent_node;
1184
gtk_tree_path_up (path);
1185
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
1189
gtk_tree_path_free (path);
1191
validate_tree (tree_store);
1195
* gtk_tree_store_insert_after:
1196
* @tree_store: A #GtkTreeStore
1197
* @iter: An unset #GtkTreeIter to set to the new row
1198
* @parent: A valid #GtkTreeIter, or %NULL
1199
* @sibling: A valid #GtkTreeIter, or %NULL
1201
* Inserts a new row after @sibling. If @sibling is %NULL, then the row will be
1202
* prepended to @parent 's children. If @parent and @sibling are %NULL, then
1203
* the row will be prepended to the toplevel. If both @sibling and @parent are
1204
* set, then @parent must be the parent of @sibling. When @sibling is set,
1205
* @parent is optional.
1207
* @iter will be changed to point to this new row. The row will be empty after
1208
* this function is called. To fill in values, you need to call
1209
* gtk_tree_store_set() or gtk_tree_store_set_value().
1213
gtk_tree_store_insert_after (GtkTreeStore *tree_store,
1215
GtkTreeIter *parent,
1216
GtkTreeIter *sibling)
1222
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1223
g_return_if_fail (iter != NULL);
1225
g_return_if_fail (VALID_ITER (parent, tree_store));
1226
if (sibling != NULL)
1227
g_return_if_fail (VALID_ITER (sibling, tree_store));
1229
if (parent == NULL && sibling == NULL)
1230
parent_node = tree_store->root;
1231
else if (parent == NULL)
1232
parent_node = G_NODE (sibling->user_data)->parent;
1233
else if (sibling == NULL)
1234
parent_node = G_NODE (parent->user_data);
1237
g_return_if_fail (G_NODE (sibling->user_data)->parent ==
1238
G_NODE (parent->user_data));
1239
parent_node = G_NODE (parent->user_data);
1242
tree_store->columns_dirty = TRUE;
1244
new_node = g_node_new (NULL);
1246
g_node_insert_after (parent_node,
1247
sibling ? G_NODE (sibling->user_data) : NULL,
1250
iter->stamp = tree_store->stamp;
1251
iter->user_data = new_node;
1253
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1254
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1256
if (parent_node != tree_store->root)
1258
if (new_node->prev == NULL && new_node->next == NULL)
1260
GtkTreeIter parent_iter;
1262
parent_iter.stamp = tree_store->stamp;
1263
parent_iter.user_data = parent_node;
1265
gtk_tree_path_up (path);
1266
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, &parent_iter);
1270
gtk_tree_path_free (path);
1272
validate_tree (tree_store);
1276
* gtk_tree_store_insert_with_values:
1277
* @tree_store: A #GtkTreeStore
1278
* @iter: An unset #GtkTreeIter to set the new row, or %NULL.
1279
* @parent: A valid #GtkTreeIter, or %NULL
1280
* @position: position to insert the new row
1281
* @Varargs: pairs of column number and value, terminated with -1
1283
* Creates a new row at @position. @iter will be changed to point to this
1284
* new row. If @position is larger than the number of rows on the list, then
1285
* the new row will be appended to the list. The row will be filled with
1286
* the values given to this function.
1289
* <literal>gtk_tree_store_insert_with_values (tree_store, iter, position, ...)</literal>
1290
* has the same effect as calling
1291
* <informalexample><programlisting>
1292
* gtk_tree_store_insert (tree_store, iter, position);
1293
* gtk_tree_store_set (tree_store, iter, ...);
1294
* </programlisting></informalexample>
1295
* with the different that the former will only emit a row_inserted signal,
1296
* while the latter will emit row_inserted, row_changed and if the tree store
1297
* is sorted, rows_reordered. Since emitting the rows_reordered signal
1298
* repeatedly can affect the performance of the program,
1299
* gtk_tree_store_insert_with_values() should generally be preferred when
1300
* inserting rows in a sorted tree store.
1305
gtk_tree_store_insert_with_values (GtkTreeStore *tree_store,
1307
GtkTreeIter *parent,
1314
GtkTreeIter tmp_iter;
1316
gboolean changed = FALSE;
1317
gboolean maybe_need_sort = FALSE;
1319
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1325
g_return_if_fail (VALID_ITER (parent, tree_store));
1328
parent_node = parent->user_data;
1330
parent_node = tree_store->root;
1332
tree_store->columns_dirty = TRUE;
1334
new_node = g_node_new (NULL);
1336
iter->stamp = tree_store->stamp;
1337
iter->user_data = new_node;
1338
g_node_insert (parent_node, position, new_node);
1340
va_start (var_args, position);
1341
gtk_tree_store_set_valist_internal (tree_store, iter,
1342
&changed, &maybe_need_sort,
1346
if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1347
gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, FALSE);
1349
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1350
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1352
if (parent_node != tree_store->root)
1354
if (new_node->prev == NULL && new_node->next == NULL)
1356
gtk_tree_path_up (path);
1357
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1361
gtk_tree_path_free (path);
1363
validate_tree ((GtkTreeStore *)tree_store);
1367
* gtk_tree_store_insert_with_valuesv:
1368
* @tree_store: A #GtkTreeStore
1369
* @iter: An unset #GtkTreeIter to set the new row, or %NULL.
1370
* @parent: A valid #GtkTreeIter, or %NULL
1371
* @position: position to insert the new row
1372
* @columns: an array of column numbers
1373
* @values: an array of GValues
1374
* @n_values: the length of the @columns and @values arrays
1376
* A variant of gtk_tree_store_insert_with_values() which takes
1377
* the columns and values as two arrays, instead of varargs. This
1378
* function is mainly intended for language bindings.
1383
gtk_tree_store_insert_with_valuesv (GtkTreeStore *tree_store,
1385
GtkTreeIter *parent,
1394
GtkTreeIter tmp_iter;
1395
gboolean changed = FALSE;
1396
gboolean maybe_need_sort = FALSE;
1397
GtkTreeIterCompareFunc func = NULL;
1400
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1406
g_return_if_fail (VALID_ITER (parent, tree_store));
1409
parent_node = parent->user_data;
1411
parent_node = tree_store->root;
1413
tree_store->columns_dirty = TRUE;
1415
new_node = g_node_new (NULL);
1417
iter->stamp = tree_store->stamp;
1418
iter->user_data = new_node;
1419
g_node_insert (parent_node, position, new_node);
1421
func = gtk_tree_store_get_compare_func (tree_store);
1422
if (func != _gtk_tree_data_list_compare_func)
1423
maybe_need_sort = TRUE;
1425
for (i = 0; i < n_values; i++)
1427
changed = gtk_tree_store_real_set_value (tree_store, iter,
1428
columns[i], &values[i],
1431
if (func == _gtk_tree_data_list_compare_func &&
1432
columns[i] == tree_store->sort_column_id)
1433
maybe_need_sort = TRUE;
1436
if (maybe_need_sort && GTK_TREE_STORE_IS_SORTED (tree_store))
1437
gtk_tree_store_sort_iter_changed (tree_store, iter, tree_store->sort_column_id, FALSE);
1439
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1440
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1442
if (parent_node != tree_store->root)
1444
if (new_node->prev == NULL && new_node->next == NULL)
1446
gtk_tree_path_up (path);
1447
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1451
gtk_tree_path_free (path);
1453
validate_tree ((GtkTreeStore *)tree_store);
1457
* gtk_tree_store_prepend:
1458
* @tree_store: A #GtkTreeStore
1459
* @iter: An unset #GtkTreeIter to set to the prepended row
1460
* @parent: A valid #GtkTreeIter, or %NULL
1462
* Prepends a new row to @tree_store. If @parent is non-%NULL, then it will prepend
1463
* the new row before the first child of @parent, otherwise it will prepend a row
1464
* to the top level. @iter will be changed to point to this new row. The row
1465
* will be empty after this function is called. To fill in values, you need to
1466
* call gtk_tree_store_set() or gtk_tree_store_set_value().
1469
gtk_tree_store_prepend (GtkTreeStore *tree_store,
1471
GtkTreeIter *parent)
1475
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1476
g_return_if_fail (iter != NULL);
1478
g_return_if_fail (VALID_ITER (parent, tree_store));
1480
tree_store->columns_dirty = TRUE;
1483
parent_node = tree_store->root;
1485
parent_node = parent->user_data;
1487
if (parent_node->children == NULL)
1491
iter->stamp = tree_store->stamp;
1492
iter->user_data = g_node_new (NULL);
1494
g_node_prepend (parent_node, G_NODE (iter->user_data));
1496
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1497
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1499
if (parent_node != tree_store->root)
1501
gtk_tree_path_up (path);
1502
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1504
gtk_tree_path_free (path);
1508
gtk_tree_store_insert_after (tree_store, iter, parent, NULL);
1511
validate_tree (tree_store);
1515
* gtk_tree_store_append:
1516
* @tree_store: A #GtkTreeStore
1517
* @iter: An unset #GtkTreeIter to set to the appended row
1518
* @parent: A valid #GtkTreeIter, or %NULL
1520
* Appends a new row to @tree_store. If @parent is non-%NULL, then it will append the
1521
* new row after the last child of @parent, otherwise it will append a row to
1522
* the top level. @iter will be changed to point to this new row. The row will
1523
* be empty after this function is called. To fill in values, you need to call
1524
* gtk_tree_store_set() or gtk_tree_store_set_value().
1527
gtk_tree_store_append (GtkTreeStore *tree_store,
1529
GtkTreeIter *parent)
1533
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1534
g_return_if_fail (iter != NULL);
1536
g_return_if_fail (VALID_ITER (parent, tree_store));
1539
parent_node = tree_store->root;
1541
parent_node = parent->user_data;
1543
tree_store->columns_dirty = TRUE;
1545
if (parent_node->children == NULL)
1549
iter->stamp = tree_store->stamp;
1550
iter->user_data = g_node_new (NULL);
1552
g_node_append (parent_node, G_NODE (iter->user_data));
1554
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
1555
gtk_tree_model_row_inserted (GTK_TREE_MODEL (tree_store), path, iter);
1557
if (parent_node != tree_store->root)
1559
gtk_tree_path_up (path);
1560
gtk_tree_model_row_has_child_toggled (GTK_TREE_MODEL (tree_store), path, parent);
1562
gtk_tree_path_free (path);
1566
gtk_tree_store_insert_before (tree_store, iter, parent, NULL);
1569
validate_tree (tree_store);
1573
* gtk_tree_store_is_ancestor:
1574
* @tree_store: A #GtkTreeStore
1575
* @iter: A valid #GtkTreeIter
1576
* @descendant: A valid #GtkTreeIter
1578
* Returns %TRUE if @iter is an ancestor of @descendant. That is, @iter is the
1579
* parent (or grandparent or great-grandparent) of @descendant.
1581
* Return value: %TRUE, if @iter is an ancestor of @descendant
1584
gtk_tree_store_is_ancestor (GtkTreeStore *tree_store,
1586
GtkTreeIter *descendant)
1588
g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1589
g_return_val_if_fail (VALID_ITER (iter, tree_store), FALSE);
1590
g_return_val_if_fail (VALID_ITER (descendant, tree_store), FALSE);
1592
return g_node_is_ancestor (G_NODE (iter->user_data),
1593
G_NODE (descendant->user_data));
1598
* gtk_tree_store_iter_depth:
1599
* @tree_store: A #GtkTreeStore
1600
* @iter: A valid #GtkTreeIter
1602
* Returns the depth of @iter. This will be 0 for anything on the root level, 1
1603
* for anything down a level, etc.
1605
* Return value: The depth of @iter
1608
gtk_tree_store_iter_depth (GtkTreeStore *tree_store,
1611
g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), 0);
1612
g_return_val_if_fail (VALID_ITER (iter, tree_store), 0);
1614
return g_node_depth (G_NODE (iter->user_data)) - 2;
1617
/* simple ripoff from g_node_traverse_post_order */
1619
gtk_tree_store_clear_traverse (GNode *node,
1620
GtkTreeStore *store)
1628
child = node->children;
1631
register GNode *current;
1634
child = current->next;
1635
if (gtk_tree_store_clear_traverse (current, store))
1641
iter.stamp = store->stamp;
1642
iter.user_data = node;
1644
gtk_tree_store_remove (store, &iter);
1647
else if (node->parent)
1649
iter.stamp = store->stamp;
1650
iter.user_data = node;
1652
gtk_tree_store_remove (store, &iter);
1659
gtk_tree_store_increment_stamp (GtkTreeStore *tree_store)
1663
tree_store->stamp++;
1665
while (tree_store->stamp == 0);
1669
* gtk_tree_store_clear:
1670
* @tree_store: a #GtkTreeStore
1672
* Removes all rows from @tree_store
1675
gtk_tree_store_clear (GtkTreeStore *tree_store)
1677
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
1679
gtk_tree_store_clear_traverse (tree_store->root, tree_store);
1680
gtk_tree_store_increment_stamp (tree_store);
1684
gtk_tree_store_iter_is_valid_helper (GtkTreeIter *iter,
1693
if (node == iter->user_data)
1697
if (gtk_tree_store_iter_is_valid_helper (iter, node->children))
1708
* gtk_tree_store_iter_is_valid:
1709
* @tree_store: A #GtkTreeStore.
1710
* @iter: A #GtkTreeIter.
1712
* WARNING: This function is slow. Only use it for debugging and/or testing
1715
* Checks if the given iter is a valid iter for this #GtkTreeStore.
1717
* Return value: %TRUE if the iter is valid, %FALSE if the iter is invalid.
1722
gtk_tree_store_iter_is_valid (GtkTreeStore *tree_store,
1725
g_return_val_if_fail (GTK_IS_TREE_STORE (tree_store), FALSE);
1726
g_return_val_if_fail (iter != NULL, FALSE);
1728
if (!VALID_ITER (iter, tree_store))
1731
return gtk_tree_store_iter_is_valid_helper (iter, tree_store->root);
1737
static gboolean real_gtk_tree_store_row_draggable (GtkTreeDragSource *drag_source,
1744
gtk_tree_store_drag_data_delete (GtkTreeDragSource *drag_source,
1749
if (gtk_tree_store_get_iter (GTK_TREE_MODEL (drag_source),
1753
gtk_tree_store_remove (GTK_TREE_STORE (drag_source),
1764
gtk_tree_store_drag_data_get (GtkTreeDragSource *drag_source,
1766
GtkSelectionData *selection_data)
1768
/* Note that we don't need to handle the GTK_TREE_MODEL_ROW
1769
* target, because the default handler does it for us, but
1770
* we do anyway for the convenience of someone maybe overriding the
1774
if (gtk_tree_set_row_drag_data (selection_data,
1775
GTK_TREE_MODEL (drag_source),
1782
/* FIXME handle text targets at least. */
1789
copy_node_data (GtkTreeStore *tree_store,
1790
GtkTreeIter *src_iter,
1791
GtkTreeIter *dest_iter)
1793
GtkTreeDataList *dl = G_NODE (src_iter->user_data)->data;
1794
GtkTreeDataList *copy_head = NULL;
1795
GtkTreeDataList *copy_prev = NULL;
1796
GtkTreeDataList *copy_iter = NULL;
1803
copy_iter = _gtk_tree_data_list_node_copy (dl, tree_store->column_headers[col]);
1805
if (copy_head == NULL)
1806
copy_head = copy_iter;
1809
copy_prev->next = copy_iter;
1811
copy_prev = copy_iter;
1817
G_NODE (dest_iter->user_data)->data = copy_head;
1819
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), dest_iter);
1820
gtk_tree_model_row_changed (GTK_TREE_MODEL (tree_store), path, dest_iter);
1821
gtk_tree_path_free (path);
1825
recursive_node_copy (GtkTreeStore *tree_store,
1826
GtkTreeIter *src_iter,
1827
GtkTreeIter *dest_iter)
1830
GtkTreeModel *model;
1832
model = GTK_TREE_MODEL (tree_store);
1834
copy_node_data (tree_store, src_iter, dest_iter);
1836
if (gtk_tree_store_iter_children (model,
1840
/* Need to create children and recurse. Note our
1841
* dependence on persistent iterators here.
1847
/* Gee, a really slow algorithm... ;-) FIXME */
1848
gtk_tree_store_append (tree_store,
1852
recursive_node_copy (tree_store, &child, ©);
1854
while (gtk_tree_store_iter_next (model, &child));
1859
gtk_tree_store_drag_data_received (GtkTreeDragDest *drag_dest,
1861
GtkSelectionData *selection_data)
1863
GtkTreeModel *tree_model;
1864
GtkTreeStore *tree_store;
1865
GtkTreeModel *src_model = NULL;
1866
GtkTreePath *src_path = NULL;
1867
gboolean retval = FALSE;
1869
tree_model = GTK_TREE_MODEL (drag_dest);
1870
tree_store = GTK_TREE_STORE (drag_dest);
1872
validate_tree (tree_store);
1874
if (gtk_tree_get_row_drag_data (selection_data,
1877
src_model == tree_model)
1879
/* Copy the given row to a new position */
1880
GtkTreeIter src_iter;
1881
GtkTreeIter dest_iter;
1884
if (!gtk_tree_store_get_iter (src_model,
1891
/* Get the path to insert _after_ (dest is the path to insert _before_) */
1892
prev = gtk_tree_path_copy (dest);
1894
if (!gtk_tree_path_prev (prev))
1896
GtkTreeIter dest_parent;
1897
GtkTreePath *parent;
1898
GtkTreeIter *dest_parent_p;
1900
/* dest was the first spot at the current depth; which means
1901
* we are supposed to prepend.
1904
/* Get the parent, NULL if parent is the root */
1905
dest_parent_p = NULL;
1906
parent = gtk_tree_path_copy (dest);
1907
if (gtk_tree_path_up (parent) &&
1908
gtk_tree_path_get_depth (parent) > 0)
1910
gtk_tree_store_get_iter (tree_model,
1913
dest_parent_p = &dest_parent;
1915
gtk_tree_path_free (parent);
1918
gtk_tree_store_prepend (tree_store,
1926
if (gtk_tree_store_get_iter (tree_model, &dest_iter, prev))
1928
GtkTreeIter tmp_iter = dest_iter;
1930
gtk_tree_store_insert_after (tree_store, &dest_iter, NULL,
1937
gtk_tree_path_free (prev);
1939
/* If we succeeded in creating dest_iter, walk src_iter tree branch,
1940
* duplicating it below dest_iter.
1945
recursive_node_copy (tree_store,
1952
/* FIXME maybe add some data targets eventually, or handle text
1953
* targets in the simple case.
1961
gtk_tree_path_free (src_path);
1967
gtk_tree_store_row_drop_possible (GtkTreeDragDest *drag_dest,
1968
GtkTreePath *dest_path,
1969
GtkSelectionData *selection_data)
1971
GtkTreeModel *src_model = NULL;
1972
GtkTreePath *src_path = NULL;
1973
GtkTreePath *tmp = NULL;
1974
gboolean retval = FALSE;
1976
/* don't accept drops if the tree has been sorted */
1977
if (GTK_TREE_STORE_IS_SORTED (drag_dest))
1980
if (!gtk_tree_get_row_drag_data (selection_data,
1985
/* can only drag to ourselves */
1986
if (src_model != GTK_TREE_MODEL (drag_dest))
1989
/* Can't drop into ourself. */
1990
if (gtk_tree_path_is_ancestor (src_path,
1994
/* Can't drop if dest_path's parent doesn't exist */
1998
if (gtk_tree_path_get_depth (dest_path) > 1)
2000
tmp = gtk_tree_path_copy (dest_path);
2001
gtk_tree_path_up (tmp);
2003
if (!gtk_tree_store_get_iter (GTK_TREE_MODEL (drag_dest),
2009
/* Can otherwise drop anywhere. */
2015
gtk_tree_path_free (src_path);
2017
gtk_tree_path_free (tmp);
2022
/* Sorting and reordering */
2023
typedef struct _SortTuple
2031
gtk_tree_store_reorder_func (gconstpointer a,
2035
SortTuple *a_reorder;
2036
SortTuple *b_reorder;
2038
a_reorder = (SortTuple *)a;
2039
b_reorder = (SortTuple *)b;
2041
if (a_reorder->offset < b_reorder->offset)
2043
if (a_reorder->offset > b_reorder->offset)
2050
* gtk_tree_store_reorder:
2051
* @tree_store: A #GtkTreeStore.
2052
* @parent: A #GtkTreeIter.
2053
* @new_order: an array of integers mapping the new position of each child
2054
* to its old position before the re-ordering,
2055
* i.e. @new_order<literal>[newpos] = oldpos</literal>.
2057
* Reorders the children of @parent in @tree_store to follow the order
2058
* indicated by @new_order. Note that this function only works with
2064
gtk_tree_store_reorder (GtkTreeStore *tree_store,
2065
GtkTreeIter *parent,
2069
GNode *level, *node;
2071
SortTuple *sort_array;
2073
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2074
g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2075
g_return_if_fail (parent == NULL || VALID_ITER (parent, tree_store));
2076
g_return_if_fail (new_order != NULL);
2079
level = G_NODE (tree_store->root)->children;
2081
level = G_NODE (parent->user_data)->children;
2091
/* set up sortarray */
2092
sort_array = g_new (SortTuple, length);
2095
for (i = 0; i < length; i++)
2097
sort_array[new_order[i]].offset = i;
2098
sort_array[i].node = node;
2103
g_qsort_with_data (sort_array,
2106
gtk_tree_store_reorder_func,
2110
for (i = 0; i < length - 1; i++)
2112
sort_array[i].node->next = sort_array[i+1].node;
2113
sort_array[i+1].node->prev = sort_array[i].node;
2116
sort_array[length-1].node->next = NULL;
2117
sort_array[0].node->prev = NULL;
2119
G_NODE (parent->user_data)->children = sort_array[0].node;
2121
G_NODE (tree_store->root)->children = sort_array[0].node;
2125
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), parent);
2127
path = gtk_tree_path_new ();
2128
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path,
2130
gtk_tree_path_free (path);
2131
g_free (sort_array);
2135
* gtk_tree_store_swap:
2136
* @tree_store: A #GtkTreeStore.
2137
* @a: A #GtkTreeIter.
2138
* @b: Another #GtkTreeIter.
2140
* Swaps @a and @b in the same level of @tree_store. Note that this function
2141
* only works with unsorted stores.
2146
gtk_tree_store_swap (GtkTreeStore *tree_store,
2150
GNode *tmp, *node_a, *node_b, *parent_node;
2151
GNode *a_prev, *a_next, *b_prev, *b_next;
2152
gint i, a_count, b_count, length, *order;
2153
GtkTreePath *path_a, *path_b;
2156
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2157
g_return_if_fail (VALID_ITER (a, tree_store));
2158
g_return_if_fail (VALID_ITER (b, tree_store));
2160
node_a = G_NODE (a->user_data);
2161
node_b = G_NODE (b->user_data);
2163
/* basic sanity checking */
2164
if (node_a == node_b)
2167
path_a = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), a);
2168
path_b = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), b);
2170
g_return_if_fail (path_a && path_b);
2172
gtk_tree_path_up (path_a);
2173
gtk_tree_path_up (path_b);
2175
if (gtk_tree_path_get_depth (path_a) == 0
2176
|| gtk_tree_path_get_depth (path_b) == 0)
2178
if (gtk_tree_path_get_depth (path_a) != gtk_tree_path_get_depth (path_b))
2180
gtk_tree_path_free (path_a);
2181
gtk_tree_path_free (path_b);
2183
g_warning ("Given children are not in the same level\n");
2186
parent_node = G_NODE (tree_store->root);
2190
if (gtk_tree_path_compare (path_a, path_b))
2192
gtk_tree_path_free (path_a);
2193
gtk_tree_path_free (path_b);
2195
g_warning ("Given children don't have a common parent\n");
2198
gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), &parent,
2200
parent_node = G_NODE (parent.user_data);
2202
gtk_tree_path_free (path_b);
2204
/* old links which we have to keep around */
2205
a_prev = node_a->prev;
2206
a_next = node_a->next;
2208
b_prev = node_b->prev;
2209
b_next = node_b->next;
2211
/* fix up links if the nodes are next to eachother */
2212
if (a_prev == node_b)
2214
if (a_next == node_b)
2217
if (b_prev == node_a)
2219
if (b_next == node_a)
2222
/* counting nodes */
2223
tmp = parent_node->children;
2224
i = a_count = b_count = 0;
2237
/* hacking the tree */
2239
parent_node->children = node_b;
2241
a_prev->next = node_b;
2244
a_next->prev = node_b;
2247
parent_node->children = node_a;
2249
b_prev->next = node_a;
2252
b_next->prev = node_a;
2254
node_a->prev = b_prev;
2255
node_a->next = b_next;
2257
node_b->prev = a_prev;
2258
node_b->next = a_next;
2261
order = g_new (gint, length);
2262
for (i = 0; i < length; i++)
2265
else if (i == b_count)
2270
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store), path_a,
2271
parent_node == tree_store->root
2272
? NULL : &parent, order);
2273
gtk_tree_path_free (path_a);
2277
/* WARNING: this function is *incredibly* fragile. Please smashtest after
2278
* making changes here.
2282
gtk_tree_store_move (GtkTreeStore *tree_store,
2284
GtkTreeIter *position,
2287
GNode *parent, *node, *a, *b, *tmp, *tmp_a, *tmp_b;
2288
gint old_pos, new_pos, length, i, *order;
2289
GtkTreePath *path = NULL, *tmppath, *pos_path = NULL;
2290
GtkTreeIter parent_iter, dst_a, dst_b;
2292
gboolean handle_b = TRUE;
2294
g_return_if_fail (GTK_IS_TREE_STORE (tree_store));
2295
g_return_if_fail (!GTK_TREE_STORE_IS_SORTED (tree_store));
2296
g_return_if_fail (VALID_ITER (iter, tree_store));
2298
g_return_if_fail (VALID_ITER (position, tree_store));
2305
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
2306
pos_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store),
2310
* moving the iter before path or "path + 1" doesn't make sense
2312
* moving the iter before path or "path - 1" doesn't make sense
2314
if (!gtk_tree_path_compare (path, pos_path))
2315
goto free_paths_and_out;
2318
gtk_tree_path_next (path);
2320
gtk_tree_path_prev (path);
2322
if (!gtk_tree_path_compare (path, pos_path))
2323
goto free_paths_and_out;
2326
gtk_tree_path_prev (path);
2328
gtk_tree_path_next (path);
2330
if (gtk_tree_path_get_depth (path) != gtk_tree_path_get_depth (pos_path))
2332
g_warning ("Given children are not in the same level\n");
2334
goto free_paths_and_out;
2337
tmppath = gtk_tree_path_copy (pos_path);
2338
gtk_tree_path_up (path);
2339
gtk_tree_path_up (tmppath);
2341
if (gtk_tree_path_get_depth (path) > 0 &&
2342
gtk_tree_path_compare (path, tmppath))
2344
g_warning ("Given children are not in the same level\n");
2346
gtk_tree_path_free (tmppath);
2347
goto free_paths_and_out;
2350
gtk_tree_path_free (tmppath);
2355
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), iter);
2356
gtk_tree_path_up (path);
2359
depth = gtk_tree_path_get_depth (path);
2363
gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store),
2364
&parent_iter, path);
2366
parent = G_NODE (parent_iter.user_data);
2369
parent = G_NODE (tree_store->root);
2371
/* yes, I know that this can be done shorter, but I'm doing it this way
2372
* so the code is also maintainable
2375
if (before && position)
2377
b = G_NODE (position->user_data);
2379
if (gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path) - 1] > 0)
2381
gtk_tree_path_prev (pos_path);
2382
if (gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store),
2384
a = G_NODE (dst_a.user_data);
2387
gtk_tree_path_next (pos_path);
2390
/* if b is NULL, a is NULL too -- we are at the beginning of the list
2391
* yes and we leak memory here ...
2393
g_return_if_fail (b);
2395
else if (before && !position)
2397
/* move before without position is appending */
2404
a = G_NODE (position->user_data);
2410
gtk_tree_path_next (pos_path);
2411
if (gtk_tree_store_get_iter (GTK_TREE_MODEL (tree_store), &dst_b, pos_path))
2412
b = G_NODE (dst_b.user_data);
2415
gtk_tree_path_prev (pos_path);
2419
/* move after without position is prepending */
2421
gtk_tree_store_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2424
gtk_tree_store_iter_children (GTK_TREE_MODEL (tree_store), &dst_b,
2427
b = G_NODE (dst_b.user_data);
2430
/* if a is NULL, b is NULL too -- we are at the end of the list
2431
* yes and we leak memory here ...
2434
g_return_if_fail (a);
2437
/* counting nodes */
2438
tmp = parent->children;
2440
length = old_pos = 0;
2443
if (tmp == iter->user_data)
2450
/* remove node from list */
2451
node = G_NODE (iter->user_data);
2456
tmp_a->next = tmp_b;
2458
parent->children = tmp_b;
2461
tmp_b->prev = tmp_a;
2463
/* and reinsert the node */
2472
else if (!a && !before)
2474
tmp = parent->children;
2477
parent->children = node;
2485
else if (!a && before)
2489
node->parent = NULL;
2490
node->next = node->prev = NULL;
2492
/* before with sibling = NULL appends */
2493
g_node_insert_before (parent, NULL, node);
2497
node->parent = NULL;
2498
node->next = node->prev = NULL;
2500
/* after with sibling = NULL prepends */
2501
g_node_insert_after (parent, NULL, node);
2517
else if (!(!a && before)) /* !a && before is completely handled above */
2523
new_pos = gtk_tree_path_get_indices (pos_path)[gtk_tree_path_get_depth (pos_path)-1];
2527
new_pos = gtk_tree_store_iter_n_children (GTK_TREE_MODEL (tree_store),
2530
new_pos = gtk_tree_store_iter_n_children (GTK_TREE_MODEL (tree_store),
2536
if (new_pos > old_pos)
2538
if (before && position)
2543
if (!before && position)
2547
order = g_new (gint, length);
2548
if (new_pos > old_pos)
2550
for (i = 0; i < length; i++)
2553
else if (i >= old_pos && i < new_pos)
2555
else if (i == new_pos)
2562
for (i = 0; i < length; i++)
2565
else if (i > new_pos && i <= old_pos)
2573
tmppath = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store),
2575
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2576
tmppath, &parent_iter, order);
2580
tmppath = gtk_tree_path_new ();
2581
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2582
tmppath, NULL, order);
2585
gtk_tree_path_free (tmppath);
2586
gtk_tree_path_free (path);
2588
gtk_tree_path_free (pos_path);
2594
gtk_tree_path_free (path);
2595
gtk_tree_path_free (pos_path);
2599
* gtk_tree_store_move_before:
2600
* @tree_store: A #GtkTreeStore.
2601
* @iter: A #GtkTreeIter.
2602
* @position: A #GtkTreeIter or %NULL.
2604
* Moves @iter in @tree_store to the position before @position. @iter and
2605
* @position should be in the same level. Note that this function only
2606
* works with unsorted stores. If @position is %NULL, @iter will be
2607
* moved to the end of the level.
2612
gtk_tree_store_move_before (GtkTreeStore *tree_store,
2614
GtkTreeIter *position)
2616
gtk_tree_store_move (tree_store, iter, position, TRUE);
2620
* gtk_tree_store_move_after:
2621
* @tree_store: A #GtkTreeStore.
2622
* @iter: A #GtkTreeIter.
2623
* @position: A #GtkTreeIter.
2625
* Moves @iter in @tree_store to the position after @position. @iter and
2626
* @position should be in the same level. Note that this function only
2627
* works with unsorted stores. If @position is %NULL, @iter will be moved
2628
* to the start of the level.
2633
gtk_tree_store_move_after (GtkTreeStore *tree_store,
2635
GtkTreeIter *position)
2637
gtk_tree_store_move (tree_store, iter, position, FALSE);
2642
gtk_tree_store_compare_func (gconstpointer a,
2646
GtkTreeStore *tree_store = user_data;
2649
GtkTreeIterCompareFunc func;
2656
if (tree_store->sort_column_id != -1)
2658
GtkTreeDataSortHeader *header;
2660
header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2661
tree_store->sort_column_id);
2662
g_return_val_if_fail (header != NULL, 0);
2663
g_return_val_if_fail (header->func != NULL, 0);
2665
func = header->func;
2666
data = header->data;
2670
g_return_val_if_fail (tree_store->default_sort_func != NULL, 0);
2671
func = tree_store->default_sort_func;
2672
data = tree_store->default_sort_data;
2675
node_a = ((SortTuple *) a)->node;
2676
node_b = ((SortTuple *) b)->node;
2678
iter_a.stamp = tree_store->stamp;
2679
iter_a.user_data = node_a;
2680
iter_b.stamp = tree_store->stamp;
2681
iter_b.user_data = node_b;
2683
retval = (* func) (GTK_TREE_MODEL (user_data), &iter_a, &iter_b, data);
2685
if (tree_store->order == GTK_SORT_DESCENDING)
2689
else if (retval < 0)
2696
gtk_tree_store_sort_helper (GtkTreeStore *tree_store,
2709
node = parent->children;
2710
if (node == NULL || node->next == NULL)
2712
if (recurse && node && node->children)
2713
gtk_tree_store_sort_helper (tree_store, node, TRUE);
2719
for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2722
sort_array = g_array_sized_new (FALSE, FALSE, sizeof (SortTuple), list_length);
2725
for (tmp_node = node; tmp_node; tmp_node = tmp_node->next)
2730
tuple.node = tmp_node;
2731
g_array_append_val (sort_array, tuple);
2735
/* Sort the array */
2736
g_array_sort_with_data (sort_array, gtk_tree_store_compare_func, tree_store);
2738
for (i = 0; i < list_length - 1; i++)
2740
g_array_index (sort_array, SortTuple, i).node->next =
2741
g_array_index (sort_array, SortTuple, i + 1).node;
2742
g_array_index (sort_array, SortTuple, i + 1).node->prev =
2743
g_array_index (sort_array, SortTuple, i).node;
2745
g_array_index (sort_array, SortTuple, list_length - 1).node->next = NULL;
2746
g_array_index (sort_array, SortTuple, 0).node->prev = NULL;
2747
parent->children = g_array_index (sort_array, SortTuple, 0).node;
2749
/* Let the world know about our new order */
2750
new_order = g_new (gint, list_length);
2751
for (i = 0; i < list_length; i++)
2752
new_order[i] = g_array_index (sort_array, SortTuple, i).offset;
2754
iter.stamp = tree_store->stamp;
2755
iter.user_data = parent;
2756
path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &iter);
2757
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2758
path, &iter, new_order);
2759
gtk_tree_path_free (path);
2761
g_array_free (sort_array, TRUE);
2765
for (tmp_node = parent->children; tmp_node; tmp_node = tmp_node->next)
2767
if (tmp_node->children)
2768
gtk_tree_store_sort_helper (tree_store, tmp_node, TRUE);
2774
gtk_tree_store_sort (GtkTreeStore *tree_store)
2776
if (!GTK_TREE_STORE_IS_SORTED (tree_store))
2779
if (tree_store->sort_column_id != -1)
2781
GtkTreeDataSortHeader *header = NULL;
2783
header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2784
tree_store->sort_column_id);
2786
/* We want to make sure that we have a function */
2787
g_return_if_fail (header != NULL);
2788
g_return_if_fail (header->func != NULL);
2792
g_return_if_fail (tree_store->default_sort_func != NULL);
2795
gtk_tree_store_sort_helper (tree_store, G_NODE (tree_store->root), TRUE);
2799
gtk_tree_store_sort_iter_changed (GtkTreeStore *tree_store,
2802
gboolean emit_signal)
2807
GtkTreePath *tmp_path;
2808
GtkTreeIter tmp_iter;
2816
GtkTreeIterCompareFunc func;
2819
g_return_if_fail (G_NODE (iter->user_data)->parent != NULL);
2821
tmp_iter.stamp = tree_store->stamp;
2822
if (tree_store->sort_column_id != -1)
2824
GtkTreeDataSortHeader *header;
2825
header = _gtk_tree_data_list_get_header (tree_store->sort_list,
2826
tree_store->sort_column_id);
2827
g_return_if_fail (header != NULL);
2828
g_return_if_fail (header->func != NULL);
2829
func = header->func;
2830
data = header->data;
2834
g_return_if_fail (tree_store->default_sort_func != NULL);
2835
func = tree_store->default_sort_func;
2836
data = tree_store->default_sort_data;
2839
/* If it's the built in function, we don't sort. */
2840
if (func == _gtk_tree_data_list_compare_func &&
2841
tree_store->sort_column_id != column)
2845
node = G_NODE (iter->user_data)->parent->children;
2846
/* First we find the iter, its prev, and its next */
2849
if (node == G_NODE (iter->user_data))
2854
g_assert (node != NULL);
2859
/* Check the common case, where we don't need to sort it moved. */
2862
tmp_iter.user_data = prev;
2863
cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2868
tmp_iter.user_data = next;
2869
cmp_b = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2872
if (tree_store->order == GTK_SORT_DESCENDING)
2885
if (prev == NULL && cmp_b <= 0)
2887
else if (next == NULL && cmp_a <= 0)
2889
else if (prev != NULL && next != NULL &&
2890
cmp_a <= 0 && cmp_b <= 0)
2893
/* We actually need to sort it */
2894
/* First, remove the old link. */
2899
node->parent->children = next;
2907
/* FIXME: as an optimization, we can potentially start at next */
2909
node = node->parent->children;
2911
tmp_iter.user_data = node;
2912
if (tree_store->order == GTK_SORT_DESCENDING)
2913
cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2915
cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2917
while ((node->next) && (cmp_a > 0))
2922
tmp_iter.user_data = node;
2923
if (tree_store->order == GTK_SORT_DESCENDING)
2924
cmp_a = (* func) (GTK_TREE_MODEL (tree_store), &tmp_iter, iter, data);
2926
cmp_a = (* func) (GTK_TREE_MODEL (tree_store), iter, &tmp_iter, data);
2929
if ((!node->next) && (cmp_a > 0))
2932
node->next = G_NODE (iter->user_data);
2933
node->next->prev = node;
2937
prev->next = G_NODE (iter->user_data);
2938
prev->next->prev = prev;
2939
G_NODE (iter->user_data)->next = node;
2940
G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2944
G_NODE (iter->user_data)->next = G_NODE (iter->user_data)->parent->children;
2945
G_NODE (iter->user_data)->next->prev = G_NODE (iter->user_data);
2946
G_NODE (iter->user_data)->parent->children = G_NODE (iter->user_data);
2952
/* Emit the reordered signal. */
2953
length = g_node_n_children (node->parent);
2954
new_order = g_new (int, length);
2955
if (old_location < new_location)
2956
for (i = 0; i < length; i++)
2958
if (i < old_location ||
2961
else if (i >= old_location &&
2963
new_order[i] = i + 1;
2964
else if (i == new_location)
2965
new_order[i] = old_location;
2968
for (i = 0; i < length; i++)
2970
if (i < new_location ||
2973
else if (i > new_location &&
2975
new_order[i] = i - 1;
2976
else if (i == new_location)
2977
new_order[i] = old_location;
2980
tmp_iter.user_data = node->parent;
2981
tmp_path = gtk_tree_store_get_path (GTK_TREE_MODEL (tree_store), &tmp_iter);
2983
gtk_tree_model_rows_reordered (GTK_TREE_MODEL (tree_store),
2984
tmp_path, &tmp_iter,
2987
gtk_tree_path_free (tmp_path);
2993
gtk_tree_store_get_sort_column_id (GtkTreeSortable *sortable,
2994
gint *sort_column_id,
2997
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
3000
* sort_column_id = tree_store->sort_column_id;
3002
* order = tree_store->order;
3004
if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID ||
3005
tree_store->sort_column_id == GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
3012
gtk_tree_store_set_sort_column_id (GtkTreeSortable *sortable,
3013
gint sort_column_id,
3016
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
3019
if ((tree_store->sort_column_id == sort_column_id) &&
3020
(tree_store->order == order))
3023
if (sort_column_id != GTK_TREE_SORTABLE_UNSORTED_SORT_COLUMN_ID)
3025
if (sort_column_id != GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
3027
GtkTreeDataSortHeader *header = NULL;
3029
header = _gtk_tree_data_list_get_header (tree_store->sort_list,
3032
/* We want to make sure that we have a function */
3033
g_return_if_fail (header != NULL);
3034
g_return_if_fail (header->func != NULL);
3038
g_return_if_fail (tree_store->default_sort_func != NULL);
3042
tree_store->sort_column_id = sort_column_id;
3043
tree_store->order = order;
3045
gtk_tree_sortable_sort_column_changed (sortable);
3047
gtk_tree_store_sort (tree_store);
3051
gtk_tree_store_set_sort_func (GtkTreeSortable *sortable,
3052
gint sort_column_id,
3053
GtkTreeIterCompareFunc func,
3055
GtkDestroyNotify destroy)
3057
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
3059
tree_store->sort_list = _gtk_tree_data_list_set_header (tree_store->sort_list,
3061
func, data, destroy);
3063
if (tree_store->sort_column_id == sort_column_id)
3064
gtk_tree_store_sort (tree_store);
3068
gtk_tree_store_set_default_sort_func (GtkTreeSortable *sortable,
3069
GtkTreeIterCompareFunc func,
3071
GtkDestroyNotify destroy)
3073
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
3075
if (tree_store->default_sort_destroy)
3077
GtkDestroyNotify d = tree_store->default_sort_destroy;
3079
tree_store->default_sort_destroy = NULL;
3080
d (tree_store->default_sort_data);
3083
tree_store->default_sort_func = func;
3084
tree_store->default_sort_data = data;
3085
tree_store->default_sort_destroy = destroy;
3087
if (tree_store->sort_column_id == GTK_TREE_SORTABLE_DEFAULT_SORT_COLUMN_ID)
3088
gtk_tree_store_sort (tree_store);
3092
gtk_tree_store_has_default_sort_func (GtkTreeSortable *sortable)
3094
GtkTreeStore *tree_store = (GtkTreeStore *) sortable;
3096
return (tree_store->default_sort_func != NULL);
3100
validate_gnode (GNode* node)
3104
iter = node->children;
3105
while (iter != NULL)
3107
g_assert (iter->parent == node);
3109
g_assert (iter->prev->next == iter);
3110
validate_gnode (iter);
3115
#define __GTK_TREE_STORE_C__
3116
#include "gtkaliasdef.c"