BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file SAvl_footer.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 | #undef SAVL_PARAM_NAME |
||
31 | #undef SAVL_PARAM_FEATURE_COUNTS |
||
32 | #undef SAVL_PARAM_FEATURE_NOKEYS |
||
33 | #undef SAVL_PARAM_TYPE_ENTRY |
||
34 | #undef SAVL_PARAM_TYPE_KEY |
||
35 | #undef SAVL_PARAM_TYPE_ARG |
||
36 | #undef SAVL_PARAM_TYPE_COUNT |
||
37 | #undef SAVL_PARAM_VALUE_COUNT_MAX |
||
38 | #undef SAVL_PARAM_FUN_COMPARE_ENTRIES |
||
39 | #undef SAVL_PARAM_FUN_COMPARE_KEY_ENTRY |
||
40 | #undef SAVL_PARAM_MEMBER_NODE |
||
41 | |||
42 | #undef SAvl |
||
43 | #undef SAvlEntry |
||
44 | #undef SAvlArg |
||
45 | #undef SAvlKey |
||
46 | #undef SAvlCount |
||
47 | #undef SAvlNode |
||
48 | |||
49 | #undef SAvl_Init |
||
50 | #undef SAvl_Insert |
||
51 | #undef SAvl_Remove |
||
52 | #undef SAvl_Lookup |
||
53 | #undef SAvl_LookupExact |
||
54 | #undef SAvl_GetFirstGreater |
||
55 | #undef SAvl_GetLastLesser |
||
56 | #undef SAvl_GetFirstGreaterEqual |
||
57 | #undef SAvl_GetLastLesserEqual |
||
58 | #undef SAvl_GetFirst |
||
59 | #undef SAvl_GetLast |
||
60 | #undef SAvl_GetNext |
||
61 | #undef SAvl_GetPrev |
||
62 | #undef SAvl_IsEmpty |
||
63 | #undef SAvl_Verify |
||
64 | #undef SAvl_Count |
||
65 | #undef SAvl_IndexOf |
||
66 | #undef SAvl_GetAt |
||
67 | |||
68 | #undef SAvl__Tree |
||
69 | #undef SAvl__TreeRef |
||
70 | #undef SAvl__TreeLink |
||
71 | #undef SAvl__TreeDeref |
||
72 | #undef SAvl__Tree_Init |
||
73 | #undef SAvl__Tree_Insert |
||
74 | #undef SAvl__Tree_Remove |
||
75 | #undef SAvl__Tree_Lookup |
||
76 | #undef SAvl__Tree_LookupExact |
||
77 | #undef SAvl__Tree_GetFirstGreater |
||
78 | #undef SAvl__Tree_GetLastLesser |
||
79 | #undef SAvl__Tree_GetFirstGreaterEqual |
||
80 | #undef SAvl__Tree_GetLastLesserEqual |
||
81 | #undef SAvl__Tree_GetFirst |
||
82 | #undef SAvl__Tree_GetLast |
||
83 | #undef SAvl__Tree_GetNext |
||
84 | #undef SAvl__Tree_GetPrev |
||
85 | #undef SAvl__Tree_IsEmpty |
||
86 | #undef SAvl__Tree_Verify |
||
87 | #undef SAvl__Tree_Count |
||
88 | #undef SAvl__Tree_IndexOf |
||
89 | #undef SAvl__Tree_GetAt |