Einfache Testroutine hinzugefügt.

1 files changed, 67 insertions, 0 deletions

diff --git a/deque.c b/deque.c
index f1da207..0e0bbf0 100644
--- a/deque.c
+++ b/deque.c
@@ -1,3 +1,4 @@
+#include <assert.h>
 #include <stdbool.h>
 #include <stdio.h>
 #include <stdlib.h>
@@ -276,9 +277,75 @@ deque_show(struct deque *d)
         putchar('\n');
 }
 
+void
+test_deque(void)
+{
+        struct deque d[1];
+
+        deque_init(d);
+
+        const int N = 10000000;
+
+        for ( int i = 0; i != N; ++i ) {
+                deque_push_front(d, i);
+        }
+
+        for ( int i = 0; i != N; ++i ) {
+                int data;
+                assert(deque_pop_back(d, &data) == true);
+                assert(data == i);
+        }
+
+        deque_free(d);
+
+        deque_init(d);
+
+        for ( int i = 0; i != N; ++i ) {
+                deque_push_back(d, i);
+        }
+
+        for ( int i = 0; i != N; ++i ) {
+                int data;
+                assert(deque_pop_front(d, &data) == true);
+                assert(data == i);
+        }
+
+        deque_free(d);
+
+        deque_init(d);
+
+        for ( int i = 0; i != N; ++i ) {
+                deque_push_back(d, i);
+        }
+
+        for ( int i = N - 1; i >= 0; --i ) {
+                int data;
+                assert(deque_pop_back(d, &data) == true);
+                assert(data == i);
+        }
+
+        deque_free(d);
+
+        deque_init(d);
+
+        for ( int i = 0; i != N; ++i ) {
+                deque_push_front(d, i);
+        }
+
+        for ( int i = N - 1; i >= 0; --i ) {
+                int data;
+                assert(deque_pop_front(d, &data) == true);
+                assert(data == i);
+        }
+
+        deque_free(d);
+}
+
 int
 main(void)
 {
+        test_deque();
+
         struct deque c;
 
         deque_init(&c);