From 95ba651873ef5e263139a46ec76cb26b6cc79647 Mon Sep 17 00:00:00 2001 From: Chris Toshok Date: Tue, 22 Aug 2000 00:42:14 +0000 Subject: we can remove nodes with children now. 2000-08-21 Chris Toshok * e-tree-example-1.c (remove_node): we can remove nodes with children now. * e-tree-model.h: add prototype for e_tree_model_node_sort. * e-tree-model.c (etree_set_expanded): if the node is invisible, just set its expanded flag and return. (e_tree_model_root_node_set_visible): call set_expanded before we remove it from the row array or else the aforementioned change will result in nothing happening. (e_tree_model_node_insert): use a position of -1 as "append". (e_tree_model_node_insert): if the model was marked with root_visible == FALSE, make sure to set it's expanded flag to TRUE when the root node is inserted. (e_tree_model_node_sort): new function. svn path=/trunk/; revision=4912 --- widgets/e-table/e-tree-model.h | 3 +++ 1 file changed, 3 insertions(+) (limited to 'widgets/e-table/e-tree-model.h') diff --git a/widgets/e-table/e-tree-model.h b/widgets/e-table/e-tree-model.h index 7b8d86826f..403aff9a30 100644 --- a/widgets/e-table/e-tree-model.h +++ b/widgets/e-table/e-tree-model.h @@ -94,6 +94,9 @@ int e_tree_model_row_of_node (ETreeModel *etree, ETreePath *pat void e_tree_model_root_node_set_visible (ETreeModel *etree, gboolean visible); gboolean e_tree_model_root_node_is_visible (ETreeModel *etree); +/* sort routine, analogous to gtk_ctree_node_sort */ +void e_tree_model_node_sort (ETreeModel *tree_model, ETreePath *node, GCompareFunc compare); + /* ** Routines for emitting signals on the ETreeModel */ -- cgit