michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "TestHarness.h"
michael@0: #include "nsDeque.h"
michael@0: #include "nsCRT.h"
michael@0: #include <stdio.h>
michael@0: 
michael@0: /**************************************************************
michael@0:   Now define the token deallocator class...
michael@0:  **************************************************************/
michael@0: class _TestDeque {
michael@0: public:
michael@0:   int Test();
michael@0: private:
michael@0:   int OriginalTest();
michael@0:   int OriginalFlaw();
michael@0:   int AssignFlaw();
michael@0:   int TestRemove();
michael@0: };
michael@0: 
michael@0: class _Dealloc: public nsDequeFunctor {
michael@0:   virtual void* operator()(void* aObject) {
michael@0:     return 0;
michael@0:   }
michael@0: };
michael@0: 
michael@0: #define TEST(aCondition, aMsg) \
michael@0:   if (!(aCondition)) { fail("TestDeque: "#aMsg); return 1; }
michael@0: 
michael@0: 
michael@0: /**
michael@0:  * conduct automated self test for this class
michael@0:  *
michael@0:  * @param
michael@0:  * @return
michael@0:  */
michael@0: int _TestDeque::Test() {
michael@0:   /* the old deque should have failed a bunch of these tests */
michael@0:   int results=0;
michael@0:   results+=OriginalTest();
michael@0:   results+=OriginalFlaw();
michael@0:   results+=AssignFlaw();
michael@0:   results+=TestRemove();
michael@0:   return results;
michael@0: }
michael@0: 
michael@0: int _TestDeque::OriginalTest() {
michael@0:   const int size = 200;
michael@0:   int ints[size];
michael@0:   int i=0;
michael@0:   int temp;
michael@0:   nsDeque theDeque(new _Dealloc); //construct a simple one...
michael@0:  
michael@0:   // ints = [0...199]
michael@0:   for (i=0;i<size;i++) { //initialize'em
michael@0:     ints[i]=i;
michael@0:   }
michael@0:   // queue = [0...69]
michael@0:   for (i=0;i<70;i++) {
michael@0:     theDeque.Push(&ints[i]);
michael@0:     temp=*(int*)theDeque.Peek();
michael@0:     TEST(temp == i, "Verify end after push #1");
michael@0:     TEST(theDeque.GetSize() == i + 1, "Verify size after push #1");
michael@0:   }
michael@0:   TEST(theDeque.GetSize() == 70, "Verify overall size after pushes #1");
michael@0:   // queue = [0...14]
michael@0:   for (i=1;i<=55;i++) {
michael@0:     temp=*(int*)theDeque.Pop();
michael@0:     TEST(temp == 70-i, "Verify end after pop # 1");
michael@0:     TEST(theDeque.GetSize() == 70 - i, "Verify size after pop # 1");
michael@0:   }
michael@0:   TEST(theDeque.GetSize() == 15, "Verify overall size after pops");
michael@0: 
michael@0:   // queue = [0...14,0...54]
michael@0:   for (i=0;i<55;i++) {
michael@0:     theDeque.Push(&ints[i]);
michael@0:     temp=*(int*)theDeque.Peek();
michael@0:     TEST(temp == i, "Verify end after push #2");
michael@0:     TEST(theDeque.GetSize() == i + 15 + 1, "Verify size after push # 2");
michael@0:   }
michael@0:   TEST(theDeque.GetSize() == 70, "Verify size after end of all pushes #2");
michael@0: 
michael@0:   // queue = [0...14,0...19]
michael@0:   for (i=1;i<=35;i++) {
michael@0:     temp=*(int*)theDeque.Pop();
michael@0:     TEST(temp == 55-i, "Verify end after pop # 2");
michael@0:     TEST(theDeque.GetSize() == 70 - i, "Verify size after pop #2");
michael@0:   }
michael@0:   TEST(theDeque.GetSize() == 35, "Verify overall size after end of all pops #2");
michael@0: 
michael@0:   // queue = [0...14,0...19,0...34]
michael@0:   for (i=0;i<35;i++) {
michael@0:     theDeque.Push(&ints[i]);
michael@0:     temp = *(int*)theDeque.Peek();
michael@0:     TEST(temp == i, "Verify end after push # 3");
michael@0:     TEST(theDeque.GetSize() == 35 + 1 + i, "Verify size after push #3");
michael@0:   }
michael@0: 
michael@0:   // queue = [0...14,0...19]
michael@0:   for (i=0;i<35;i++) {
michael@0:     temp=*(int*)theDeque.Pop();
michael@0:     TEST(temp == 34 - i, "Verify end after pop # 3");
michael@0:   }
michael@0: 
michael@0:   // queue = [0...14]
michael@0:   for (i=0;i<20;i++) {
michael@0:     temp=*(int*)theDeque.Pop();
michael@0:     TEST(temp == 19 - i, "Verify end after pop # 4");
michael@0:   }
michael@0: 
michael@0:   // queue = []
michael@0:   for (i=0;i<15;i++) {
michael@0:     temp=*(int*)theDeque.Pop();
michael@0:     TEST(temp == 14 - i, "Verify end after pop # 5");
michael@0:   }
michael@0: 
michael@0:   TEST(theDeque.GetSize() == 0, "Deque should finish empty.");
michael@0: 
michael@0:   return 0;
michael@0: }
michael@0: 
michael@0: int _TestDeque::OriginalFlaw() {
michael@0:   int ints[200];
michael@0:   int i=0;
michael@0:   int temp;
michael@0:   nsDeque d(new _Dealloc);
michael@0:   /**
michael@0:    * Test 1. Origin near end, semi full, call Peek().
michael@0:    * you start, mCapacity is 8
michael@0:    */
michael@0:   printf("fill array\n");
michael@0:   for (i=0; i<30; i++)
michael@0:     ints[i]=i;
michael@0: 
michael@0:   for (i=0; i<6; i++) {
michael@0:     d.Push(&ints[i]);
michael@0:     temp = *(int*)d.Peek();
michael@0:     TEST(temp == i, "OriginalFlaw push #1");
michael@0:   }
michael@0:   TEST(d.GetSize() == 6, "OriginalFlaw size check #1");
michael@0: 
michael@0:   for (i=0; i<4; i++) {
michael@0:     temp=*(int*)d.PopFront();
michael@0:     TEST(temp == i, "PopFront test");
michael@0:   }
michael@0:   // d = [4,5]
michael@0:   TEST(d.GetSize() == 2, "OriginalFlaw size check #2");
michael@0: 
michael@0:   for (i=0; i<4; i++) {
michael@0:     d.Push(&ints[6 + i]);
michael@0:   }
michael@0:   // d = [4...9]
michael@0: 
michael@0:   for (i=4; i<=9; i++) {
michael@0:     temp=*(int*)d.PopFront();
michael@0:     TEST(temp == i, "OriginalFlaw empty check");
michael@0:   }
michael@0: 
michael@0:   return 0;
michael@0: }
michael@0: 
michael@0: int _TestDeque::AssignFlaw() {
michael@0:   nsDeque src(new _Dealloc),dest(new _Dealloc);
michael@0:   return 0;
michael@0: }
michael@0: 
michael@0: static bool VerifyContents(const nsDeque& aDeque, const int* aContents, int aLength) {
michael@0:   for (int i=0; i<aLength; ++i) {
michael@0:     if (*(int*)aDeque.ObjectAt(i) != aContents[i]) {
michael@0:       return false;
michael@0:     }
michael@0:   }
michael@0:   return true;
michael@0: }
michael@0: 
michael@0: int _TestDeque::TestRemove() {
michael@0:   nsDeque d;
michael@0:   const int count = 10;
michael@0:   int ints[count];
michael@0:   for (int i=0; i<count; i++) {
michael@0:     ints[i] = i;
michael@0:   }
michael@0: 
michael@0:   for (int i=0; i<6; i++) {
michael@0:     d.Push(&ints[i]);
michael@0:   }
michael@0:   // d = [0...5]
michael@0:   d.PopFront();
michael@0:   d.PopFront();
michael@0: 
michael@0:   // d = [2,5]
michael@0:   for (int i=2; i<=5; i++) {
michael@0:     int t = *(int*)d.ObjectAt(i-2);
michael@0:     TEST(t == i, "Verify ObjectAt()");
michael@0:   }
michael@0: 
michael@0:   d.RemoveObjectAt(1);
michael@0:   // d == [2,4,5]
michael@0:   static const int t1[] = {2,4,5};
michael@0:   TEST(VerifyContents(d, t1, 3), "verify contents t1");
michael@0: 
michael@0:   d.PushFront(&ints[1]);
michael@0:   d.PushFront(&ints[0]);
michael@0:   d.PushFront(&ints[7]);
michael@0:   d.PushFront(&ints[6]);
michael@0:   //  d == [6,7,0,1,2,4,5] // (0==mOrigin)
michael@0:   static const int t2[] = {6,7,0,1,2,4,5};
michael@0:   TEST(VerifyContents(d, t2, 7), "verify contents t2");
michael@0: 
michael@0:   d.RemoveObjectAt(1);
michael@0:   //  d == [6,0,1,2,4,5] // (1==mOrigin)
michael@0:   static const int t3[] = {6,0,1,2,4,5};
michael@0:   TEST(VerifyContents(d, t3, 6), "verify contents t3");
michael@0: 
michael@0:   d.RemoveObjectAt(5);
michael@0:   //  d == [6,0,1,2,4] // (1==mOrigin)
michael@0:   static const int t4[] = {6,0,1,2,4};
michael@0:   TEST(VerifyContents(d, t4, 5), "verify contents t4");
michael@0: 
michael@0:   d.RemoveObjectAt(0);
michael@0:   //  d == [0,1,2,4] // (2==mOrigin)
michael@0:   static const int t5[] = {0,1,2,4};
michael@0:   TEST(VerifyContents(d, t5, 4), "verify contents t5");
michael@0: 
michael@0: 
michael@0:   return 0;
michael@0: }
michael@0: 
michael@0: int main (void) {
michael@0:   ScopedXPCOM xpcom("TestTimers");
michael@0:   NS_ENSURE_FALSE(xpcom.failed(), 1);
michael@0: 
michael@0:   _TestDeque test;
michael@0:   int result = test.Test();
michael@0:   TEST(result == 0, "All tests pass");
michael@0:   return 0;
michael@0: }