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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
// -*- c++ -*-
/* $Id: vec.h,v 1.1 2001/01/13 19:46:10 dm Exp $ */
/*
*
* Copyright (C) 1998 David Mazieres (dm@uun.org)
*
* 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 2, 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, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*
*/
#ifndef _VECTOR_H_INCLUDED_
#define _VECTOR_H_INCLUDED_ 1
#include "opnew.h"
#include "stllike.h"
#include "array.h"
#include "msb.h"
template<class T, size_t N> struct vec_base {
typedef toarray(T) elm_t;
protected:
elm_t *basep;
elm_t *firstp;
elm_t *lastp;
elm_t *limp;
union {
double alignment_hack;
char defbuf_space[N * sizeof (elm_t)];
};
elm_t *def_basep () { return reinterpret_cast<elm_t *> (defbuf_space); }
elm_t *def_limp () { return def_basep () + N; }
void bfree (T *t) { if ( t != def_basep ()) xfree (t); }
};
template<class T> struct vec_base<T, 0> {
typedef toarray(T) elm_t;
protected:
elm_t *basep;
elm_t *firstp;
elm_t *lastp;
elm_t *limp;
elm_t *def_basep () { return NULL; }
elm_t *def_limp () { return NULL; }
void bfree (T *t) { xfree (t); }
public:
#define doswap(x) tmp = x; x = v.x; v.x = tmp
void swap (vec_base &v) {
elm_t *tmp;
doswap (basep);
doswap (firstp);
doswap (lastp);
doswap (limp);
};
#undef doswap
};
template<class T, size_t N = 0> class vec : public vec_base<T, N> {
void move (elm_t *dst) {
if (dst == firstp)
return;
assert (dst < firstp || dst >= lastp);
basep = dst;
for (elm_t *src = firstp; src < lastp; src++) {
new ((void *) (dst++)) elm_t (*src);
src->~elm_t ();
}
lastp += basep - firstp;
firstp = basep;
}
static elm_t &construct (elm_t &e)
{ return *new (implicit_cast<void *> (&e)) elm_t; }
static elm_t &cconstruct (elm_t &e, const elm_t &v)
{ return *new (implicit_cast<void *> (&e)) elm_t (v); }
static void destroy (elm_t &e) { e.~elm_t (); }
void init () { lastp = firstp = basep = def_basep (); limp = def_limp (); }
void del () { while (firstp < lastp) firstp++->~elm_t (); bfree (basep); }
#define append(v) \
do { \
reserve (v.size ()); \
for (const elm_t *s = v.base (), *e = v.lim (); s < e; s++) \
cconstruct (*lastp++, *s); \
} while (0)
#ifdef CHECK_BOUNDS
#define zcheck() assert (lastp > firstp)
#define bcheck(n) assert ((size_t) (n) < (size_t) (lastp - firstp))
#define pcheck(n) assert ((size_t) (n) <= (size_t) (lastp - firstp))
#else /* !CHECK_BOUNDS */
#define zcheck()
#define bcheck(n)
#define pcheck(n)
#endif /* !CHECK_BOUNDS */
public:
vec () { init (); }
vec (const vec &v) { init (); append (v); }
template<size_t NN> vec (const vec<T, NN> &v) { init (); append (v); }
~vec () { del (); }
void clear () { del (); init (); }
vec &operator= (const vec &v)
{ if (this != &v) { clear (); append (v); } return *this; }
template<size_t NN> vec &operator= (const vec<T, NN> &v)
{ clear (); append (v); return *this; }
void reserve (size_t n) {
if (lastp + n <= limp)
return;
size_t nalloc = limp - basep;
size_t nwanted = lastp - firstp + n;
if (nwanted > nalloc / 2) {
nalloc = 1 << fls (max (nalloc, nwanted));
elm_t *obasep = basep;
move (static_cast<elm_t *> (txmalloc (nalloc * sizeof (elm_t))));
limp = basep + nalloc;
bfree (obasep);
}
else
move (basep);
}
void setsize (size_t n) {
size_t s = size ();
if (n < s)
popn_back (s - n);
else if ((n -= s)) {
reserve (n);
elm_t *sp = lastp;
lastp += n;
while (sp < lastp)
construct (*sp++);
}
}
elm_t *base () { return firstp; }
const elm_t *base () const { return firstp; }
elm_t *lim () { return lastp; }
const elm_t *lim () const { return lastp; }
size_t size () const { return lastp - firstp; }
bool empty () const { return lastp == firstp; }
elm_t &front () { zcheck (); return *firstp; }
const elm_t &front () const { zcheck (); return *firstp; }
elm_t &back () { zcheck (); return lastp[-1]; }
const elm_t &back () const { zcheck (); return lastp[-1]; }
elm_t &operator[] (ptrdiff_t i) { bcheck (i); return firstp[i]; }
const elm_t &operator[] (ptrdiff_t i) const { bcheck (i); return firstp[i]; }
elm_t &push_back () { reserve (1); return construct (*lastp++); }
elm_t &push_back (const elm_t &e)
{ reserve (1); return cconstruct (*lastp++, e); }
elm_t pop_back () { zcheck (); return destroy_return (*--lastp); }
void popn_back (size_t n) {
pcheck (n);
elm_t *sp = lastp;
lastp -= n;
while (sp > lastp)
destroy (*--sp);
}
elm_t pop_front () { zcheck (); return destroy_return (*firstp++); }
void popn_front (size_t n) {
pcheck (n);
elm_t *sp = firstp;
firstp += n;
while (sp < firstp)
destroy (*sp++);
}
#undef zcheck
#undef bcheck
#undef pcheck
#undef append
};
template<class T> void
swap (vec<T> &a, vec<T> &b)
{
a.swap (b);
}
#endif /* !_VECTOR_H_INCLUDED_ */
|
