BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file indexedlist_test.c |
||
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 <misc/debug.h> |
||
31 | #include <misc/offset.h> |
||
32 | #include <structure/IndexedList.h> |
||
33 | |||
34 | IndexedList il; |
||
35 | |||
36 | struct elem { |
||
37 | int value; |
||
38 | IndexedListNode node; |
||
39 | }; |
||
40 | |||
41 | static void elem_insert (struct elem *e, int value, uint64_t index) |
||
42 | { |
||
43 | e->value = value; |
||
44 | IndexedList_InsertAt(&il, &e->node, index); |
||
45 | } |
||
46 | |||
47 | static void remove_at (uint64_t index) |
||
48 | { |
||
49 | IndexedListNode *n = IndexedList_GetAt(&il, index); |
||
50 | struct elem *e = UPPER_OBJECT(n, struct elem, node); |
||
51 | IndexedList_Remove(&il, &e->node); |
||
52 | } |
||
53 | |||
54 | static void print_list (void) |
||
55 | { |
||
56 | for (uint64_t i = 0; i < IndexedList_Count(&il); i++) { |
||
57 | IndexedListNode *n = IndexedList_GetAt(&il, i); |
||
58 | struct elem *e = UPPER_OBJECT(n, struct elem, node); |
||
59 | printf("%d ", e->value); |
||
60 | } |
||
61 | printf("\n"); |
||
62 | } |
||
63 | |||
64 | int main (int argc, char *argv[]) |
||
65 | { |
||
66 | IndexedList_Init(&il); |
||
67 | |||
68 | struct elem arr[100]; |
||
69 | |||
70 | print_list(); |
||
71 | |||
72 | elem_insert(&arr[0], 1, 0); |
||
73 | print_list(); |
||
74 | elem_insert(&arr[1], 2, 0); |
||
75 | print_list(); |
||
76 | elem_insert(&arr[2], 3, 0); |
||
77 | print_list(); |
||
78 | elem_insert(&arr[3], 4, 0); |
||
79 | print_list(); |
||
80 | elem_insert(&arr[4], 5, 0); |
||
81 | print_list(); |
||
82 | elem_insert(&arr[5], 6, 0); |
||
83 | print_list(); |
||
84 | |||
85 | elem_insert(&arr[6], 7, 1); |
||
86 | print_list(); |
||
87 | |||
88 | remove_at(0); |
||
89 | print_list(); |
||
90 | |||
91 | remove_at(5); |
||
92 | print_list(); |
||
93 | |||
94 | return 0; |
||
95 | } |