blob: 37510b0c2b698052e70381bbe4039168c24bc1ac (
plain)
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
|
/* Copyright (C) 2021-2023 Free Software Foundation, Inc.
Contributed by Oracle.
This file is part of GNU Binutils.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, 51 Franklin Street - Fifth Floor, Boston,
MA 02110-1301, USA. */
#ifndef _DbeArray_H
#define _DbeArray_H
template <typename ITEM> class DbeArray
{
public:
DbeArray (long sz)
{
count = 0;
limit = sz;
data = new ITEM[limit];
};
virtual
~DbeArray ()
{
delete[] data;
}
int
append (const ITEM &item)
{
int n = allocate (1);
ITEM *p = get (n);
*p = item;
return n;
};
ITEM *
get (long index)
{
return (index < count && index >= 0) ? data + index : (ITEM *) NULL;
};
int
allocate (int cnt)
{
count += cnt;
resize (count);
return count - cnt;
};
int
size ()
{
return (int) count;
};
void
reset ()
{
count = 0;
};
private:
void
resize (long cnt)
{
if (limit <= cnt)
{
limit *= 2;
if (limit < cnt)
limit = cnt + 1;
ITEM *d = new ITEM[limit];
if (count > 0)
memcpy (d, data, sizeof (ITEM) * count);
delete[] data;
data = d;
}
};
ITEM *data; // Pointer to data vector
long count; // Number of items
long limit; // Array length
};
#endif /* _DbeArray_H */
|
