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
|
#include "kern/mem.h"
#include "shared/array_list.h"
#include "test_harness.h"
ARRAY_LIST_DECL(int);
ARRAY_LIST_IMPL(int);
TEST(array_list, smell)
{
array_list_t(int)* list = array_list_new(int)();
array_list_add(int)(list, 1);
array_list_add(int)(list, 2);
array_list_add(int)(list, 3);
array_list_add(int)(list, 4);
array_list_add(int)(list, 5);
int expected[5] = {1, 2, 3, 4, 5};
for (size_t i = 0; i < 5; ++i) {
ASSERT_EQ(*array_list_ref(int)(list, i), expected[i]);
}
ASSERT_EQ(array_list_length(int)(list), 5);
*array_list_ref(int)(list, 3) = 8;
expected[3] = 8;
for (size_t i = 0; i < 5; ++i) {
ASSERT_EQ(*array_list_ref(int)(list, i), expected[i]);
}
int out;
array_list_remove(int)(list, 2, &out);
ASSERT_EQ(out, 3);
ASSERT_EQ(array_list_length(int)(list), 4);
int expected2[4] = {1, 2, 8, 5};
for (size_t i = 0; i < 4; ++i) {
ASSERT_EQ(*array_list_ref(int)(list, i), expected2[i]);
}
return 0;
}
TEST(array_list, foreach)
{
array_list_t(int)* arl = array_list_new(int)();
array_list_add(int)(arl, 3);
array_list_add(int)(arl, 2);
array_list_add(int)(arl, 1);
int i = 0;
int values[3];
array_list_foreach(arl, val) {
values[i] = val;
++ i;
}
ASSERT_EQ(values[0], 3);
ASSERT_EQ(values[1], 2);
ASSERT_EQ(values[2], 1);
return 0;
}
|
