blob: 3e2f10001e280e078f8010244e4ba87bd91e896c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/*
* Unix SMB/CIFS implementation.
* Generic Abstract Data Types
* Copyright (C) Gerald Carter 2002-2005.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef ADT_TREE_H
#define ADT_TREE_H
/* data structure used to build the tree */
typedef struct _tree_node {
struct _tree_node *parent;
struct _tree_node **children;
int num_children;
char *key;
void *data_p;
} TREE_NODE;
typedef struct _tree_root {
TREE_NODE *root;
/* not used currently (is it needed?) */
int (*compare)(void* x, void *y);
} SORTED_TREE;
/*
* API
*/
/* create a new tree, talloc_free() to throw it away */
SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*) );
/* add a new path component */
bool pathtree_add( SORTED_TREE *tree, const char *path, void *data_p );
/* search path */
void* pathtree_find( SORTED_TREE *tree, char *key );
/* debug (print) functions */
void pathtree_print_keys( SORTED_TREE *tree, int debug );
#endif
|
