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
|
#ifndef LCDF_VECTOR_CC
#define LCDF_VECTOR_CC
/*
* vector.{cc,hh} -- simple array template class
* Eddie Kohler
*
* Copyright (c) 1999-2000 Massachusetts Institute of Technology
* Copyright (c) 2001-2003 International Computer Science Institute
*
* 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, subject to the conditions
* listed in the Click LICENSE file. These conditions include: you must
* preserve this copyright notice, and you cannot mention the copyright
* holders in advertising related to the Software without their permission.
* The Software is provided WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED. This
* notice is a summary of the Click LICENSE file; the license in that file is
* legally binding.
*/
/* #include <lcdf/vector.hh> */
template <class T>
Vector<T>::Vector(const Vector<T> &o)
: _l(0), _n(0), _capacity(0)
{
*this = o;
}
template <class T>
Vector<T>::~Vector()
{
for (int i = 0; i < _n; i++)
_l[i].~T();
delete[] (unsigned char *)_l;
}
template <class T> Vector<T> &
Vector<T>::operator=(const Vector<T> &o)
{
if (&o != this) {
for (int i = 0; i < _n; i++)
_l[i].~T();
_n = 0;
if (reserve(o._n)) {
_n = o._n;
for (int i = 0; i < _n; i++)
new(velt(i)) T(o._l[i]);
}
}
return *this;
}
template <class T> Vector<T> &
Vector<T>::assign(int n, const T &e)
{
resize(0, e);
resize(n, e);
return *this;
}
template <class T> typename Vector<T>::iterator
Vector<T>::erase(iterator a, iterator b)
{
if (b > a) {
assert(a >= begin() && b <= end());
iterator i = a, j = b;
for (; j < end(); i++, j++) {
i->~T();
new((void*) i) T(*j);
}
for (; i < end(); i++)
i->~T();
_n -= b - a;
return a;
} else
return b;
}
template <class T> bool
Vector<T>::reserve(int want)
{
if (want < 0)
want = _capacity > 0 ? _capacity * 2 : 4;
if (want <= _capacity)
return true;
T *new_l = (T *)new unsigned char[sizeof(T) * want];
if (!new_l)
return false;
for (int i = 0; i < _n; i++) {
new(velt(new_l, i)) T(_l[i]);
_l[i].~T();
}
delete[] (unsigned char *)_l;
_l = new_l;
_capacity = want;
return true;
}
template <class T> void
Vector<T>::resize(int nn, const T &e)
{
if (nn <= _capacity || reserve(nn)) {
for (int i = nn; i < _n; i++)
_l[i].~T();
for (int i = _n; i < nn; i++)
new(velt(i)) T(e);
_n = nn;
}
}
template <class T> void
Vector<T>::swap(Vector<T> &o)
{
T *l = _l;
int n = _n;
int cap = _capacity;
_l = o._l;
_n = o._n;
_capacity = o._capacity;
o._l = l;
o._n = n;
o._capacity = cap;
}
#endif
|
