-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.c
More file actions
75 lines (60 loc) · 2.39 KB
/
Copy pathtest.c
File metadata and controls
75 lines (60 loc) · 2.39 KB
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
#include "heap.h"
#include "unity.h"
#include "unity_internals.h"
void setUp(void) {}
void tearDown(void) {}
void should_pop_in_ascending_order_when_pushed_ascending_with_resize(void) {
struct Heap heap = heap_create_with_capacity(2);
TEST_ASSERT_NOT_NULL(heap.stack.slice.buffer);
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(2, heap.stack.capacity);
heap_push(&heap, 0);
heap_push(&heap, 1);
heap_push(&heap, 2);
heap_push(&heap, 3);
TEST_ASSERT_EQUAL_UINT8(0, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(1, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(2, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(3, heap_pop(&heap));
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(4, heap.stack.capacity);
}
void should_pop_in_ascending_order_when_pushed_descending_with_resize(void) {
struct Heap heap = heap_create_with_capacity(2);
TEST_ASSERT_NOT_NULL(heap.stack.slice.buffer);
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(2, heap.stack.capacity);
heap_push(&heap, 3);
heap_push(&heap, 2);
heap_push(&heap, 1);
heap_push(&heap, 0);
TEST_ASSERT_EQUAL_UINT8(0, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(1, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(2, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(3, heap_pop(&heap));
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(4, heap.stack.capacity);
}
void should_pop_in_ascending_order_when_pushed_random_with_resize(void) {
struct Heap heap = heap_create_with_capacity(2);
TEST_ASSERT_NOT_NULL(heap.stack.slice.buffer);
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(2, heap.stack.capacity);
heap_push(&heap, 2);
heap_push(&heap, 0);
heap_push(&heap, 3);
heap_push(&heap, 1);
TEST_ASSERT_EQUAL_UINT8(0, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(1, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(2, heap_pop(&heap));
TEST_ASSERT_EQUAL_UINT8(3, heap_pop(&heap));
TEST_ASSERT_EQUAL(0, heap.stack.slice.length);
TEST_ASSERT_EQUAL(4, heap.stack.capacity);
}
int main(void) {
UNITY_BEGIN();
RUN_TEST(should_pop_in_ascending_order_when_pushed_ascending_with_resize);
RUN_TEST(should_pop_in_ascending_order_when_pushed_descending_with_resize);
RUN_TEST(should_pop_in_ascending_order_when_pushed_random_with_resize);
return UNITY_END();
}