feat: initial set and sockets
This commit is contained in:
@@ -1,49 +1,49 @@
|
||||
#include <assert.h>
|
||||
|
||||
#include "../../queue/myqueue.h"
|
||||
|
||||
void test_queue1(void) {
|
||||
/* Allocate a new queue */
|
||||
queue_s *queue = queue_new(3, sizeof(int));
|
||||
assert(queue != NULL);
|
||||
|
||||
int val, out;
|
||||
|
||||
/* Push value to the ring buffer */
|
||||
val = 1;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
val = 2;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
/* Retrieve values */
|
||||
int front, rear;
|
||||
assert(queue_get_front(queue, &front) == 0);
|
||||
assert(queue_get_rear(queue, &rear) == 0);
|
||||
assert(front == 1);
|
||||
assert(rear == 2);
|
||||
|
||||
/* Remove an element from the buffer */
|
||||
assert(queue_pop(queue, &out) == 0);
|
||||
assert(out == 1);
|
||||
|
||||
assert(queue_get_front(queue, &front) == 0);
|
||||
assert(front == 2);
|
||||
|
||||
val = 3;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
assert(queue_get_rear(queue, &rear) == 0);
|
||||
assert(rear == 3);
|
||||
|
||||
val = 4;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
/* Clear queue */
|
||||
while (queue_pop(queue, &out) == 0) {
|
||||
}
|
||||
assert(queue->size == 0);
|
||||
|
||||
/* Deallocate memory */
|
||||
queue_free(queue);
|
||||
}
|
||||
#include <assert.h>
|
||||
|
||||
#include "../../queue/myqueue.h"
|
||||
|
||||
void test_queue1(void) {
|
||||
/* Allocate a new queue */
|
||||
queue_s *queue = queue_new(3, sizeof(int));
|
||||
assert(queue != NULL);
|
||||
|
||||
int val, out;
|
||||
|
||||
/* Push value to the ring buffer */
|
||||
val = 1;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
val = 2;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
/* Retrieve values */
|
||||
int front, rear;
|
||||
assert(queue_get_front(queue, &front) == 0);
|
||||
assert(queue_get_rear(queue, &rear) == 0);
|
||||
assert(front == 1);
|
||||
assert(rear == 2);
|
||||
|
||||
/* Remove an element from the buffer */
|
||||
assert(queue_pop(queue, &out) == 0);
|
||||
assert(out == 1);
|
||||
|
||||
assert(queue_get_front(queue, &front) == 0);
|
||||
assert(front == 2);
|
||||
|
||||
val = 3;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
assert(queue_get_rear(queue, &rear) == 0);
|
||||
assert(rear == 3);
|
||||
|
||||
val = 4;
|
||||
assert(queue_push(queue, &val) == 0);
|
||||
|
||||
/* Clear queue */
|
||||
while (queue_pop(queue, &out) == 0) {
|
||||
}
|
||||
assert(queue->size == 0);
|
||||
|
||||
/* Deallocate memory */
|
||||
queue_free(queue);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user