-
Notifications
You must be signed in to change notification settings - Fork 1
/
c_list_test.cpp
101 lines (89 loc) · 2.23 KB
/
c_list_test.cpp
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <gtest/gtest.h>
#include <vector>
extern "C"
{
#include "c_list.h"
#include <string.h>
bool is_foo(void *data)
{
return !strcmp((const char *)data, "foo");
}
bool is_false(void *data)
{
(void)data;
return false;
}
int sorter(const void *a, const void *b){
return strcmp(*((const char **) a), *((const char **) b));
}
}
TEST(C_LIST, BasicTestsPrepend)
{
linked_list *l = new_linked_list();
std::vector<const char *> teststrings = {"foo", "bar", "baz", "garplay"};
char *tmp = (char *) malloc(100);
sprintf(tmp, "foo");
size_t i;
i = 0;
for (const char *s : teststrings)
{
EXPECT_EQ(get_at(l, i), nullptr);
prepend(l, (void *)s);
i++;
EXPECT_EQ(get_at(l, 0), s);
EXPECT_EQ(l->length, i);
}
for (size_t i = 0; i < 4; ++i)
{
EXPECT_EQ((const char *)get_at(l, i), teststrings[3 - i]);
}
EXPECT_EQ(find_at(l, is_foo), 3);
EXPECT_EQ(find_at(l, is_false), -1);
// This does a pointer comparison
EXPECT_NE(get_at(l, 3), tmp);
EXPECT_TRUE(!strcmp((const char *) get_at(l, 3), tmp));
free_linked_list(l);
free(tmp);
};
TEST(C_LIST, BasicTestsAppend)
{
linked_list *l = new_linked_list();
std::vector<const char *> teststrings = {"foo", "bar", "baz", "garplay"};
size_t i;
i = 0;
for (const char *s : teststrings)
{
EXPECT_EQ(get_at(l, i), nullptr);
append(l, (void *)s);
EXPECT_EQ(get_at(l, i), s);
i++;
EXPECT_EQ(l->length, i);
}
for (size_t i = 0; i < 4; ++i)
{
EXPECT_EQ((const char *)get_at(l, i), teststrings[i]);
}
free_linked_list(l);
};
TEST(C_LIST, SandboxPrint)
{
float f = 1.0;
printf("%i\n", *((int *)&f));
printf("%i\n\n", (int)f);
f = 0.0;
printf("%i\n", *((int *)&f));
printf("%i\n\n", (int)f);
f = -0.0;
printf("%i\n", *((int *)&f));
printf("%i\n\n", (int)f);
}
TEST(C_LIST, qsort_test)
{
const char *test[] = {"foo", "bar", "baz", "garplay"};
const char *sorted[] = {"bar", "baz", "foo", "garplay"};
int i;
qsort(test, 4, sizeof(char *), sorter);
for (i = 0; i < 4; ++i){
EXPECT_STREQ(test[i], sorted[i]);
}
}