From 40dff989475d31e3d24dd8ae38dc79c191358e52 Mon Sep 17 00:00:00 2001 From: Christopher James Lahey Date: Sat, 31 Mar 2001 11:41:34 +0000 Subject: New implementation based on a tree instead of a hash table. 2001-03-31 Christopher James Lahey * e-tree-selection-model.c, e-tree-selection-model.h: New implementation based on a tree instead of a hash table. * e-tree-sorted.c, e-tree-sorted.h: Added e_tree_sorted_num_children. svn path=/trunk/; revision=9070 --- widgets/table/e-tree-sorted.h | 2 ++ 1 file changed, 2 insertions(+) (limited to 'widgets/table/e-tree-sorted.h') diff --git a/widgets/table/e-tree-sorted.h b/widgets/table/e-tree-sorted.h index 3b81e2dcab..1ad5438c29 100644 --- a/widgets/table/e-tree-sorted.h +++ b/widgets/table/e-tree-sorted.h @@ -48,6 +48,8 @@ ETreePath e_tree_sorted_model_to_view_path (ETreeSorted *ets, ETreePath model_path); int e_tree_sorted_orig_position (ETreeSorted *ets, ETreePath path); +int e_tree_sorted_node_num_children (ETreeSorted *ets, + ETreePath path); #ifdef __cplusplus } -- cgit v1.2.3