Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "queue.h"
- #include "util.h"
- #include <assert.h>
- #include <stddef.h>
- #include <stdio.h>
- #include <stdlib.h>
- struct queue_test {
- struct queue element;
- struct list_elem elem;
- int zaehler;
- };
- int main (void) {
- struct queue_test* queue = malloc(sizeof(struct queue_test));
- struct queue_test* queue2 = malloc(sizeof(struct queue_test));
- struct queue_test* queue3 = malloc(sizeof(struct queue_test));
- struct queue_test* queue4 = malloc(sizeof(struct queue_test));
- struct queue_test* queue5 = malloc(sizeof(struct queue_test));
- struct queue_test* queue6 = malloc(sizeof(struct queue_test));
- struct queue_test* queue7 = malloc(sizeof(struct queue_test));
- struct queue_test* queue8 = malloc(sizeof(struct queue_test));
- queue_init(&queue->element, QUEUE_LIFO);
- queue->zaehler = 1;
- queue_add(&queue->element, &queue2->elem);
- queue2->zaehler = 2;
- queue_add(&queue->element, &queue3->elem);
- queue3->zaehler = 3;
- queue_add(&queue->element, &queue4->elem);
- queue4->zaehler = 4;
- printf("%i \n", queue->zaehler);
- assert(queue_del(&queue->element) == &queue4->elem);
- /*how can i get the return value another time eg for printf?*/
- free(queue4);
- assert(queue_del(&queue->element) == &queue3->elem);
- free(queue3);
- assert(queue_del(&queue->element) == &queue2->elem);
- free(queue2);
- assert(queue_del(&queue->element) == NULL);
- free(queue);
- queue_init(&queue5->element, QUEUE_FIFO);
- queue->zaehler = 5;
- queue_add(&queue5->element, &queue6->elem);
- queue2->zaehler = 6;
- queue_add(&queue5->element, &queue7->elem);
- queue3->zaehler = 7
- queue_add(&queue5->element, &queue8->elem);
- queue4->zaehler = 8;
- printf("%i \n", queue5->zaehler);
- assert(queue_del(&queue5->element) == &queue5->elem);
- assert(queue_del(&queue5->element) == &queue6->elem);
- free(queue3);
- assert(queue_del(&queue5->element) == &queue7->elem);
- free(queue2);
- assert(queue_del(&queue5->element) == NULL);
- free(queue);
- free(queue5);
- return 0;
- }
Add Comment
Please, Sign In to add comment