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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
/*
* Worldvisions Weaver Software:
* Copyright (C) 1997-2002 Net Integration Technologies, Inc.
*
* Provides a dynamic array data structure.
*/
#include "wvvector.h"
#include <assert.h>
WvVectorBase::comparison_type_t WvVectorBase::innercomparator;
WvVectorBase::WvVectorBase(int slots)
: xseq(NULL), xcount(0), xslots(0)
{
set_capacity(slots);
}
void WvVectorBase::remove(int slot)
{
--xcount;
if (xcount - slot > 0)
memmove(xseq + slot, xseq + slot + 1,
(xcount - slot) * sizeof(WvLink *));
}
void WvVectorBase::insert(int slot, WvLink *elem)
{
if (++xcount > xslots)
{
int newslots = 2*xslots;
if (newslots < xcount)
newslots = xcount;
set_capacity(newslots);
}
if (xcount > slot + 1)
memmove(xseq + slot + 1, xseq + slot,
(xcount - slot - 1) * sizeof(WvLink *));
xseq[slot] = elem;
}
void WvVectorBase::append(WvLink *elem)
{
if (++xcount > xslots)
{
int newslots = 2*xslots;
if (newslots < xcount)
newslots = xcount;
set_capacity(newslots);
}
xseq[xcount - 1] = elem;
}
void WvVectorBase::set_capacity(int newslots)
{
// Ensure we don't eliminate data when we shrink
if (newslots < xcount)
newslots = xcount;
// Free the memory if we don't want any.
if (newslots <= 0)
{
xslots = 0;
if (xseq != NULL)
{
free(xseq);
xseq = NULL;
}
return;
}
else
{
// Allocate memory, if we want it
xslots = newslots;
void *newseq;
if (xseq != NULL)
newseq = realloc(xseq, xslots * sizeof(WvLink *));
else
newseq = malloc(xslots * sizeof(WvLink *));
assert(newseq != NULL || xslots == 0);
if (newseq != NULL || xslots == 0)
xseq = static_cast<WvLink **>(newseq);
}
}
WvLink *WvVectorBase::IterBase::find(const void *data)
{
for (rewind(); next(); )
{
if (link->data == data)
break;
}
return link;
}
WvLink *WvVectorBase::IterBase::find_next(const void *data)
{
if (link)
{
if (link->data == data)
return link;
for (; next(); )
{
if (link->data == data)
break;
}
}
return link;
}
|
