BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file CAvl_decl.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 "CAvl_header.h" |
||
31 | |||
32 | typedef struct { |
||
33 | CAvlLink root; |
||
34 | } CAvl; |
||
35 | |||
36 | typedef struct { |
||
37 | CAvlEntry *ptr; |
||
38 | CAvlLink link; |
||
39 | } CAvlRef; |
||
40 | |||
41 | static int CAvlIsNullRef (CAvlRef node); |
||
42 | static int CAvlIsValidRef (CAvlRef node); |
||
43 | static CAvlRef CAvlDeref (CAvlArg arg, CAvlLink link); |
||
44 | |||
45 | static void CAvl_Init (CAvl *o); |
||
46 | #if !CAVL_PARAM_FEATURE_KEYS_ARE_INDICES |
||
47 | static int CAvl_Insert (CAvl *o, CAvlArg arg, CAvlRef node, CAvlRef *out_ref); |
||
48 | #else |
||
49 | static void CAvl_InsertAt (CAvl *o, CAvlArg arg, CAvlRef node, CAvlCount index); |
||
50 | #endif |
||
51 | static void CAvl_Remove (CAvl *o, CAvlArg arg, CAvlRef node); |
||
52 | #if !CAVL_PARAM_FEATURE_KEYS_ARE_INDICES && !CAVL_PARAM_FEATURE_NOKEYS |
||
53 | static CAvlRef CAvl_Lookup (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
54 | static CAvlRef CAvl_LookupExact (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
55 | static CAvlRef CAvl_GetFirstGreater (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
56 | static CAvlRef CAvl_GetLastLesser (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
57 | static CAvlRef CAvl_GetFirstGreaterEqual (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
58 | static CAvlRef CAvl_GetLastLesserEqual (const CAvl *o, CAvlArg arg, CAvlKey key); |
||
59 | #endif |
||
60 | static CAvlRef CAvl_GetFirst (const CAvl *o, CAvlArg arg); |
||
61 | static CAvlRef CAvl_GetLast (const CAvl *o, CAvlArg arg); |
||
62 | static CAvlRef CAvl_GetNext (const CAvl *o, CAvlArg arg, CAvlRef node); |
||
63 | static CAvlRef CAvl_GetPrev (const CAvl *o, CAvlArg arg, CAvlRef node); |
||
64 | static int CAvl_IsEmpty (const CAvl *o); |
||
65 | static void CAvl_Verify (const CAvl *o, CAvlArg arg); |
||
66 | #if CAVL_PARAM_FEATURE_COUNTS |
||
67 | static CAvlCount CAvl_Count (const CAvl *o, CAvlArg arg); |
||
68 | static CAvlCount CAvl_IndexOf (const CAvl *o, CAvlArg arg, CAvlRef node); |
||
69 | static CAvlRef CAvl_GetAt (const CAvl *o, CAvlArg arg, CAvlCount index); |
||
70 | #endif |
||
71 | #if CAVL_PARAM_FEATURE_ASSOC |
||
72 | static CAvlAssoc CAvl_AssocSum (const CAvl *o, CAvlArg arg); |
||
73 | static CAvlAssoc CAvl_ExclusiveAssocPrefixSum (const CAvl *o, CAvlArg arg, CAvlRef node); |
||
74 | static CAvlRef CAvl_FindLastExclusiveAssocPrefixSumLesserEqual (const CAvl *o, CAvlArg arg, CAvlAssoc sum, int (*sum_less) (void *, CAvlAssoc, CAvlAssoc), void *user); |
||
75 | #endif |
||
76 | |||
77 | #include "CAvl_footer.h" |