2 * Unix SMB/CIFS implementation.
3 * Generic Abstract Data Types
4 * Copyright (C) Gerald Carter 2002.
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 2 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, write to the Free Software
18 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
30 /* data structure used to build the tree */
32 typedef struct _tree_node {
33 struct _tree_node *parent;
34 struct _tree_node **children;
40 typedef struct _tree_root {
42 int (*compare)(void* x, void *y);
43 void (*free_func)(void *p);
50 /* initializer and desctrutor */
51 SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*), void (free_fn)(void*) );
52 void pathtree_destroy( SORTED_TREE *tree );
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 );