Optimized usage of Layout::queueQueueResizeList.

1 files changed, 17 insertions, 0 deletions

diff --git a/test/containers.cc b/test/containers.cc
index 9b93f158..af317d7e 100644
--- a/test/containers.cc
+++ b/test/containers.cc
@@ -128,6 +128,22 @@ void testVector3 ()
    printf ("   -> %d\n", v.bsearch (&k, false));
 }
 
+void testStackAsQueue ()
+{
+   puts ("--- testStackAsQueue ---");
+
+   Stack<Integer> s (true);
+
+   for (int i = 1; i <= 10; i++)
+      s.pushUnder (new Integer (i));
+
+   while (s.size () > 0) {
+      Integer *i = s.getTop ();
+      printf ("%d\n", i->getValue ());
+      s.pop ();
+   }
+}
+
 int main (int argc, char *argv[])
 {
    testHashSet ();
@@ -135,6 +151,7 @@ int main (int argc, char *argv[])
    testVector1 ();
    testVector2 ();
    testVector3 ();
+   testStackAsQueue ();
 
    return 0;
 }