BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file SAvl_impl.h |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | */ |
||
29 | |||
30 | #include "SAvl_header.h" |
||
31 | |||
32 | #include "SAvl_tree.h" |
||
33 | #include <structure/CAvl_impl.h> |
||
34 | |||
35 | static void SAvl_Init (SAvl *o) |
||
36 | { |
||
37 | SAvl__Tree_Init(&o->tree); |
||
38 | } |
||
39 | |||
40 | static int SAvl_Insert (SAvl *o, SAvlArg arg, SAvlEntry *entry, SAvlEntry **out_existing) |
||
41 | { |
||
42 | ASSERT(entry) |
||
43 | #if SAVL_PARAM_FEATURE_COUNTS |
||
44 | ASSERT(SAvl_Count(o, arg) < SAVL_PARAM_VALUE_COUNT_MAX) |
||
45 | #endif |
||
46 | |||
47 | SAvl__TreeRef out_ref; |
||
48 | int res = SAvl__Tree_Insert(&o->tree, arg, SAvl__TreeDeref(arg, entry), &out_ref); |
||
49 | |||
50 | if (out_existing) { |
||
51 | *out_existing = out_ref.link; |
||
52 | } |
||
53 | |||
54 | return res; |
||
55 | } |
||
56 | |||
57 | static void SAvl_Remove (SAvl *o, SAvlArg arg, SAvlEntry *entry) |
||
58 | { |
||
59 | ASSERT(entry) |
||
60 | |||
61 | SAvl__Tree_Remove(&o->tree, arg, SAvl__TreeDeref(arg, entry)); |
||
62 | } |
||
63 | |||
64 | #if !SAVL_PARAM_FEATURE_NOKEYS |
||
65 | |||
66 | static SAvlEntry * SAvl_Lookup (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
67 | { |
||
68 | SAvl__TreeRef ref = SAvl__Tree_Lookup(&o->tree, arg, key); |
||
69 | return ref.link; |
||
70 | } |
||
71 | |||
72 | static SAvlEntry * SAvl_LookupExact (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
73 | { |
||
74 | SAvl__TreeRef ref = SAvl__Tree_LookupExact(&o->tree, arg, key); |
||
75 | return ref.link; |
||
76 | } |
||
77 | |||
78 | static SAvlEntry * SAvl_GetFirstGreater (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
79 | { |
||
80 | SAvl__TreeRef ref = SAvl__Tree_GetFirstGreater(&o->tree, arg, key); |
||
81 | return ref.link; |
||
82 | } |
||
83 | |||
84 | static SAvlEntry * SAvl_GetLastLesser (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
85 | { |
||
86 | SAvl__TreeRef ref = SAvl__Tree_GetLastLesser(&o->tree, arg, key); |
||
87 | return ref.link; |
||
88 | } |
||
89 | |||
90 | static SAvlEntry * SAvl_GetFirstGreaterEqual (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
91 | { |
||
92 | SAvl__TreeRef ref = SAvl__Tree_GetFirstGreaterEqual(&o->tree, arg, key); |
||
93 | return ref.link; |
||
94 | } |
||
95 | |||
96 | static SAvlEntry * SAvl_GetLastLesserEqual (const SAvl *o, SAvlArg arg, SAvlKey key) |
||
97 | { |
||
98 | SAvl__TreeRef ref = SAvl__Tree_GetLastLesserEqual(&o->tree, arg, key); |
||
99 | return ref.link; |
||
100 | } |
||
101 | |||
102 | #endif |
||
103 | |||
104 | static SAvlEntry * SAvl_GetFirst (const SAvl *o, SAvlArg arg) |
||
105 | { |
||
106 | SAvl__TreeRef ref = SAvl__Tree_GetFirst(&o->tree, arg); |
||
107 | return ref.link; |
||
108 | } |
||
109 | |||
110 | static SAvlEntry * SAvl_GetLast (const SAvl *o, SAvlArg arg) |
||
111 | { |
||
112 | SAvl__TreeRef ref = SAvl__Tree_GetLast(&o->tree, arg); |
||
113 | return ref.link; |
||
114 | } |
||
115 | |||
116 | static SAvlEntry * SAvl_GetNext (const SAvl *o, SAvlArg arg, SAvlEntry *entry) |
||
117 | { |
||
118 | ASSERT(entry) |
||
119 | |||
120 | SAvl__TreeRef ref = SAvl__Tree_GetNext(&o->tree, arg, SAvl__TreeDeref(arg, entry)); |
||
121 | return ref.link; |
||
122 | } |
||
123 | |||
124 | static SAvlEntry * SAvl_GetPrev (const SAvl *o, SAvlArg arg, SAvlEntry *entry) |
||
125 | { |
||
126 | ASSERT(entry) |
||
127 | |||
128 | SAvl__TreeRef ref = SAvl__Tree_GetPrev(&o->tree, arg, SAvl__TreeDeref(arg, entry)); |
||
129 | return ref.link; |
||
130 | } |
||
131 | |||
132 | static int SAvl_IsEmpty (const SAvl *o) |
||
133 | { |
||
134 | return SAvl__Tree_IsEmpty(&o->tree); |
||
135 | } |
||
136 | |||
137 | static void SAvl_Verify (const SAvl *o, SAvlArg arg) |
||
138 | { |
||
139 | return SAvl__Tree_Verify(&o->tree, arg); |
||
140 | } |
||
141 | |||
142 | #if SAVL_PARAM_FEATURE_COUNTS |
||
143 | |||
144 | static SAvlCount SAvl_Count (const SAvl *o, SAvlArg arg) |
||
145 | { |
||
146 | return SAvl__Tree_Count(&o->tree, arg); |
||
147 | } |
||
148 | |||
149 | static SAvlCount SAvl_IndexOf (const SAvl *o, SAvlArg arg, SAvlEntry *entry) |
||
150 | { |
||
151 | ASSERT(entry) |
||
152 | |||
153 | return SAvl__Tree_IndexOf(&o->tree, arg, SAvl__TreeDeref(arg, entry)); |
||
154 | } |
||
155 | |||
156 | static SAvlEntry * SAvl_GetAt (const SAvl *o, SAvlArg arg, SAvlCount index) |
||
157 | { |
||
158 | SAvl__TreeRef ref = SAvl__Tree_GetAt(&o->tree, arg, index); |
||
159 | return ref.link; |
||
160 | } |
||
161 | |||
162 | #endif |
||
163 | |||
164 | #include "SAvl_footer.h" |