forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
testInsertionDeletion.cxx
93 lines (83 loc) · 2.93 KB
/
testInsertionDeletion.cxx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*=========================================================================
Program: Visualization Toolkit
Module: testInsertionDeletion.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*----------------------------------------------------------------------------
Copyright (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
#include "freerange"
using namespace std;
// To test freerange insertion and deletion, we use an action
// table. Each triple of integers in the list below corresponds
// to a call that will be made on a freerange instance. When the
// first number is 0, grab() will be called. When nonzero, free()
// will be called.
// When calling grab() the second number serves as the number of
// entries and the third is the expected return value -- an error
// message is printed if it is not matched.
// When calling free() the second number servers as the starting
// index of the item to be freed and the third number is the
// number of items to be freed.
static int actions[] = {
0, 1, 0,
0, 5, 1,
0, 10, 6, /* test case where initial size aligns with entry bdy */
1, 1, 8,
0, 8, 1, /* test that we get back the hole we opened */
0, 0, -1, /* test that empty grab returns invalid result */
0, 1, 16,
1, 14, 2, /* test free near (but not at end) of list */
0, 2, 14, /* if the above worked, we get the same item back */
1, 13, 3,
1, 16, 1, /* what happens when we free the end and there's a hole nearby? */
0, 17, 16, /* for freerange (not freelist), the holes remain. This also tests an entry that would overlap allocated bdy. */
-1, -1, -1 /* signal end of test */
};
int testInsertionDeletion( int, char*[] )
{
freerange<int,int,-5> fr;
int idx;
int count = 0;
int grab = 0;
int* action = actions;
int result = 0;
while ( *action != -1 )
{
switch ( *action )
{
case 0:
idx = fr.grab( action[1] );
count += action[1];
if ( idx != action[2] )
{
cerr << "Grab " << grab << " returned " << idx
<< ", was expecting " << action[2] << endl;
result = 1;
}
break;
case 1:
fr.free( action[1], action[2] );
count -= action[2];
break;
case -1:
default:
break;
}
action += 3;
++grab;
}
if ( fr.size() != count )
{
cerr << "Entries in use was " << fr.size()
<< " but expected " << count << endl;
result = 1;
}
return result;
}