xpcom/tests/TestDeque.cpp

   1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
   2 /* ***** BEGIN LICENSE BLOCK *****
   3  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   4  *
   5  * The contents of this file are subject to the Mozilla Public License Version
   6  * 1.1 (the "License"); you may not use this file except in compliance with
   7  * the License. You may obtain a copy of the License at
   8  * http://www.mozilla.org/MPL/
   9  *
  10  * Software distributed under the License is distributed on an "AS IS" basis,
  11  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  12  * for the specific language governing rights and limitations under the
  13  * License.
  14  *
  15  * The Original Code is mozilla.org code.
  16  *
  17  * The Initial Developer of the Original Code is
  18  * Netscape Communications Corporation.
  19  * Portions created by the Initial Developer are Copyright (C) 1998
  20  * the Initial Developer. All Rights Reserved.
  21  *
  22  * Contributor(s):
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either of the GNU General Public License Version 2 or later (the "GPL"),
  26  * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 #include "nsDeque.h"
  39 #include "nsCRT.h"
  40 #include <stdio.h>
  41
  42 /**************************************************************
  43   Now define the token deallocator class...
  44  **************************************************************/
  45 class _TestDeque {
  46 public:
  47   _TestDeque() {
  48     SelfTest();
  49   }
  50   int SelfTest();
  51   nsresult OriginalTest();
  52   nsresult OriginalFlaw();
  53   nsresult AssignFlaw();
  54 };
  55 static _TestDeque sTestDeque;
  56
  57 class _Dealloc: public nsDequeFunctor {
  58   virtual void* operator()(void* aObject) {
  59     return 0;
  60   }
  61 };
  62
  63 /**
  64  * conduct automated self test for this class
  65  *
  66  * @param
  67  * @return
  68  */
  69 int _TestDeque::SelfTest() {
  70   /* the old deque should have failed a bunch of these tests */
  71   int results=0;
  72   results+=OriginalTest();
  73   results+=OriginalFlaw();
  74   results+=AssignFlaw();
  75   return results;
  76 }
  77
  78 nsresult _TestDeque::OriginalTest() {
  79   int ints[200];
  80   int count=sizeof(ints)/sizeof(int);
  81   int i=0;
  82   int* temp;
  83   nsDeque theDeque(new _Dealloc); //construct a simple one...
  84
  85   for (i=0;i<count;i++) { //initialize'em
  86     ints[i]=10*(1+i);
  87   }
  88   for (i=0;i<70;i++) {
  89     theDeque.Push(&ints[i]);
  90   }
  91   for (i=0;i<56;i++) {
  92     temp=(int*)theDeque.Pop();
  93   }
  94   for (i=0;i<55;i++) {
  95     theDeque.Push(&ints[i]);
  96   }
  97   for (i=0;i<35;i++) {
  98     temp=(int*)theDeque.Pop();
  99   }
 100   for (i=0;i<35;i++) {
 101     theDeque.Push(&ints[i]);
 102   }
 103   for (i=0;i<38;i++) {
 104     temp=(int*)theDeque.Pop();
 105   }
 106   return NS_OK;
 107 }
 108
 109 nsresult _TestDeque::OriginalFlaw() {
 110   int ints[200];
 111   int i=0;
 112   int* temp;
 113   nsDeque secondDeque(new _Dealloc);
 114   /**
 115    * Test 1. Origin near end, semi full, call Peek().
 116    * you start, mCapacity is 8
 117    */
 118   printf("fill array\n");
 119   for (i=32; i; --i)
 120     ints[i]=i*3+10;
 121   printf("push 6 times\n");
 122   for (i=0; i<6; i++)
 123     secondDeque.Push(&ints[i]);
 124   printf("popfront 4 times:\n");
 125   for (i=4; i; --i) {
 126     temp=(int*)secondDeque.PopFront();
 127     printf("%d\t",*temp);
 128   }
 129   printf("push 4 times\n");
 130   for (int j=4; j; --j)
 131     secondDeque.Push(&ints[++i]);
 132   printf("origin should now be about 4\n");
 133   printf("and size should be 6\n");
 134   printf("origin+size>capacity\n");
 135
 136    /*<akk> Oh, I see ... it's a circular buffer */
 137   printf("but the old code wasn't behaving accordingly.\n");
 138
 139    /*right*/
 140   printf("we shouldn't crash or anything interesting, ");
 141
 142   temp=(int*)secondDeque.Peek();
 143   printf("peek: %d\n",*temp);
 144   return NS_OK;
 145 }
 146
 147 nsresult _TestDeque::AssignFlaw() {
 148   nsDeque src(new _Dealloc),dest(new _Dealloc);
 149   return NS_OK;
 150 }
 151
 152 int main (void) {
 153   _TestDeque test;
 154   return 0;
 155 }