-
Notifications
You must be signed in to change notification settings - Fork 72
/
pr_tree.h
80 lines (69 loc) · 3.17 KB
/
pr_tree.h
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/*
* libdict -- internal path reduction tree interface.
*
* Copyright (c) 2001-2014, Farooq Mela
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef LIBDICT_PR_TREE_H__
#define LIBDICT_PR_TREE_H__
#include "dict.h"
BEGIN_DECL
typedef struct pr_tree pr_tree;
pr_tree* pr_tree_new(dict_compare_func cmp_func);
dict* pr_dict_new(dict_compare_func cmp_func);
size_t pr_tree_free(pr_tree* tree, dict_delete_func delete_func);
dict_insert_result
pr_tree_insert(pr_tree* tree, void* key);
void** pr_tree_search(pr_tree* tree, const void* key);
void** pr_tree_search_le(pr_tree* tree, const void* key);
void** pr_tree_search_lt(pr_tree* tree, const void* key);
void** pr_tree_search_ge(pr_tree* tree, const void* key);
void** pr_tree_search_gt(pr_tree* tree, const void* key);
dict_remove_result
pr_tree_remove(pr_tree* tree, const void* key);
size_t pr_tree_clear(pr_tree* tree, dict_delete_func delete_func);
size_t pr_tree_traverse(pr_tree* tree, dict_visit_func visit);
size_t pr_tree_count(const pr_tree* tree);
size_t pr_tree_height(const pr_tree* tree);
size_t pr_tree_mheight(const pr_tree* tree);
size_t pr_tree_pathlen(const pr_tree* tree);
const void* pr_tree_min(const pr_tree* tree);
const void* pr_tree_max(const pr_tree* tree);
bool pr_tree_verify(const pr_tree* tree);
typedef struct pr_itor pr_itor;
pr_itor* pr_itor_new(pr_tree* tree);
dict_itor* pr_dict_itor_new(pr_tree* tree);
void pr_itor_free(pr_itor* tree);
bool pr_itor_valid(const pr_itor* itor);
void pr_itor_invalidate(pr_itor* itor);
bool pr_itor_next(pr_itor* itor);
bool pr_itor_prev(pr_itor* itor);
bool pr_itor_nextn(pr_itor* itor, size_t count);
bool pr_itor_prevn(pr_itor* itor, size_t count);
bool pr_itor_first(pr_itor* itor);
bool pr_itor_last(pr_itor* itor);
const void* pr_itor_key(const pr_itor* itor);
void** pr_itor_data(pr_itor* itor);
bool pr_itor_remove(pr_itor* itor);
END_DECL
#endif /* !LIBDICT_PR_TREE_H__ */