diff options
Diffstat (limited to 'test/stress_avlmap.cpp')
-rw-r--r-- | test/stress_avlmap.cpp | 167 |
1 files changed, 0 insertions, 167 deletions
diff --git a/test/stress_avlmap.cpp b/test/stress_avlmap.cpp deleted file mode 100644 index 088b42f4..00000000 --- a/test/stress_avlmap.cpp +++ /dev/null @@ -1,167 +0,0 @@ -/* - * Copyright 2001, 2003 Adrian Thurston <thurston@colm.net> - * - * Permission is hereby granted, free of charge, to any person obtaining a copy - * of this software and associated documentation files (the "Software"), to - * deal in the Software without restriction, including without limitation the - * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or - * sell copies of the Software, and to permit persons to whom the Software is - * furnished to do so, subject to the following conditions: - * - * The above copyright notice and this permission notice shall be included in all - * copies or substantial portions of the Software. - * - * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR - * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, - * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE - * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER - * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, - * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE - * SOFTWARE. - */ - -#include <time.h> -#include <string.h> -#include <stdlib.h> -#include <iostream> -#include <stdio.h> -#include "avlmap.h" - -#define AVLTREE_MAP -#include "avlverify.h" -#undef AVLTREE_MAP - -#include "util.h" - -/* Having the action change perion larger than the number of initial entries - * means that it will take longer to get to all the cases, but all the - * cases will be more thoroughly tested. The tree will be more likely to - * empty out completely and fill up with all of the entries. */ -#define INITIAL_ENTRIES 64831 -#define ACTION_CHANGE_PERIOD 120233 -#define VERIFY_PERIOD 1119 -#define COPY_PERIOD 1351 -#define INCREMENT_VARIATION 10 -#define STATS_PERIOD 211 -#define OUTBUFSIZE 100 - -using namespace std; - -/* Instantiate the entire tree. */ -template class AvlMap< int, int >; -template class AvlMapVer< int, int >; - -int increment = 0; -int curIndex = 0; -int action = 1; -int curRound = 0; - -void ExpandTab(char *buf, char *dstBuf) -{ - int pos = 10; - char *src = buf; - char *dst = dstBuf; - - while ( *src != 0 ) { - if ( *src == '\t' ) { - *dst++ = ' '; - while ( dst - dstBuf < pos ) - *dst++ = ' '; - pos += 10; - } - else - *dst++ = *src; - src++; - } - *dst = 0; -} - -/* Replace the current stats line with new stats. For one tree. */ -void printStats( int treeSize, AvlMapEl<int,int> *head ) -{ - /* Print stats. */ - static char buf[OUTBUFSIZE] = { 0 }; - char tmpBuf[OUTBUFSIZE]; - - if ( curRound % STATS_PERIOD == 0 ) { - memset( buf, '\b', strlen(buf) ); - cout << buf; - sprintf( tmpBuf, "%i\t%i\t%s\t%s\t%i\t%i\t%li\t", curRound, increment, - action&0x1 ? "yes" : "no", action&0x2 ? "yes" : "no", - curIndex, treeSize, head ? head->height : 0 ); - expandTab( buf, tmpBuf ); - cout << buf; - cout.flush(); - } -} - -/* Find a new curIndex to use. If the increment is 0 then get - * a random curIndex. Otherwise use the increment. */ -void newIndex() -{ - if ( increment == 0 ) - curIndex = random() % INITIAL_ENTRIES; - else - curIndex = (curIndex + increment) % INITIAL_ENTRIES; -} - -/* Print the header to the stats. For one tree. */ -void printHeader() -{ - char buf[OUTBUFSIZE]; - expandTab( buf, "round\tinc\tins\trem\tindex\tels\theight" ); - cout << buf << endl; -} - - -int main( int argc, char **argv ) -{ - processArgs( argc, argv ); - srandom( time(0) ); - - typedef AvlMapEl< int, int > TreeEl; - AvlMapVer< int, int > tree; - - printHeader(); - - for ( curRound = 0; true; curRound++ ) { - /* Do we change our action? */ - if ( curRound % ACTION_CHANGE_PERIOD == 0 ) { - increment = random() % 2; - if ( increment > 0 ) - increment = random() % INCREMENT_VARIATION; - - action = (random()%3) + 1; - } - - /* Dump stats. */ - printStats( tree.treeSize, tree.root ); - - /* Insert one? */ - if ( action&0x1 ) { - newIndex(); - tree.insert( curIndex, curIndex ); - } - - /* Delete one? */ - if ( action&0x2 ) { - newIndex(); - TreeEl *element = tree.detach( curIndex ); - if ( element != 0 ) - delete element; - } - - /* Verify? */ - if ( curRound % VERIFY_PERIOD == 0 ) - tree.verifyIntegrity(); - - /* Test the deep copy? */ - if ( curRound % COPY_PERIOD == 0 ) { - AvlMapVer< int, int > copy(tree); - copy.verifyIntegrity(); - copy.empty(); - } - - } - return 0; -} |