mirror of
https://github.com/bkthomps/Containers.git
synced 2026-04-09 11:59:53 +00:00
43 lines
1.1 KiB
C
43 lines
1.1 KiB
C
#include "test.h"
|
|
#include "../src/queue.h"
|
|
|
|
void test_queue(void)
|
|
{
|
|
int val[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
|
|
queue me = queue_init(sizeof(int));
|
|
assert(me != NULL);
|
|
assert(queue_size(me) == 0);
|
|
assert(queue_is_empty(me));
|
|
for (int i = 0; i < 10; i++) {
|
|
queue_push(me, &val[i]);
|
|
int get = 0;
|
|
queue_back(&get, me);
|
|
assert(get == val[i]);
|
|
int stuff = 0;
|
|
queue_front(&stuff, me);
|
|
assert(stuff == 1);
|
|
}
|
|
assert(queue_size(me) == 10);
|
|
assert(!queue_is_empty(me));
|
|
int get_arr[10] = {0};
|
|
queue_to_array(get_arr, me);
|
|
for (int i = 0; i < 10; i++) {
|
|
assert(get_arr[i] == i + 1);
|
|
}
|
|
for (int i = 0; i < 9; i++) {
|
|
int get = 0;
|
|
queue_pop(&get, me);
|
|
assert(get == i + 1);
|
|
}
|
|
queue_trim(me);
|
|
assert(queue_size(me) == 1);
|
|
queue_clear(me);
|
|
assert(queue_size(me) == 0);
|
|
int get = 0;
|
|
assert(queue_pop(&get, me) == -EINVAL);
|
|
assert(queue_front(&get, me) == -EINVAL);
|
|
assert(queue_back(&get, me) == -EINVAL);
|
|
me = queue_destroy(me);
|
|
assert(me == NULL);
|
|
}
|