summaryrefslogtreecommitdiffstats
path: root/src/engine/tests/queue_test.cpp
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2006-06-10 01:52:02 +0000
committerDavid Robillard <d@drobilla.net>2006-06-10 01:52:02 +0000
commit98fe0e7056e6697396249531785d3899f94d79be (patch)
tree233319008d4bfb6c8bdc546bdf4a81b87ecf7f3a /src/engine/tests/queue_test.cpp
parent6c8eaee73b0ea66216744f49b452e22e26fe83e1 (diff)
downloadingen-98fe0e7056e6697396249531785d3899f94d79be.tar.gz
ingen-98fe0e7056e6697396249531785d3899f94d79be.tar.bz2
ingen-98fe0e7056e6697396249531785d3899f94d79be.zip
More juggling
git-svn-id: http://svn.drobilla.net/lad/grauph@15 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'src/engine/tests/queue_test.cpp')
-rw-r--r--src/engine/tests/queue_test.cpp47
1 files changed, 0 insertions, 47 deletions
diff --git a/src/engine/tests/queue_test.cpp b/src/engine/tests/queue_test.cpp
deleted file mode 100644
index 3381a329..00000000
--- a/src/engine/tests/queue_test.cpp
+++ /dev/null
@@ -1,47 +0,0 @@
-#include <iostream>
-#include <string>
-#include "../../common/Queue.h"
-
-using std::string; using std::cerr; using std::cout; using std::endl;
-
-
-int main()
-{
- Queue<int> q(10);
-
- cout << "New queue. Should be empty: " << q.is_empty() << endl;
- cout << "Capacity: " << q.capacity() << endl;
- cout << "Fill: " << q.fill() << endl;
-
- for (uint i=0; i < 5; ++i) {
- q.push(i);
- assert(!q.is_full());
- q.pop();
- }
- cout << "Pushed and popped 5 elements. Queue should be empty: " << q.is_empty() << endl;
- cout << "Fill: " << q.fill() << endl;
-
- for (uint i=10; i < 20; ++i) {
- q.push(i);
- }
- cout << "Pushed 10 elements. Queue should be full: " << q.is_full() << endl;
- cout << "Fill: " << q.fill() << endl;
-
- cout << "The digits 10->19 should print: " << endl;
- while (!q.is_empty()) {
- int foo = q.pop();
- cout << "Popped: " << foo << endl;
- }
- cout << "Queue should be empty: " << q.is_empty() << endl;
- cout << "Fill: " << q.fill() << endl;
-
- cout << "Attempting to add eleven elements to queue of size 10. Only first 10 should succeed:" << endl;
- for (uint i=20; i <= 39; ++i) {
- cout << i;
- cout << " - Fill: " << q.fill();
- cout << ", is full: " << q.is_full();
- cout << ", succeeded: " << q.push(i) << endl;
- }
-
- return 0;
-}