2 * Unix SMB/CIFS implementation.
3 * Generic Abstract Data Types
4 * Copyright (C) Gerald Carter 2002-2005.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 3 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
29 /* data structure used to build the tree */
31 typedef struct _tree_node {
32 struct _tree_node *parent;
33 struct _tree_node **children;
39 typedef struct _tree_root {
42 /* not used currently (is it needed?) */
43 int (*compare)(void* x, void *y);
50 /* create a new tree, talloc_free() to throw it away */
52 SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*) );
54 /* add a new path component */
56 BOOL pathtree_add( SORTED_TREE *tree, const char *path, void *data_p );
60 void* pathtree_find( SORTED_TREE *tree, char *key );
62 /* debug (print) functions */
64 void pathtree_print_keys( SORTED_TREE *tree, int debug );