1 // vim: set sts=8 ts=2 sw=2 tw=99 et:
3 // Copyright (C) 2013, David Anderson and AlliedModders LLC
4 // All rights reserved.
6 // Redistribution and use in source and binary forms, with or without
7 // modification, are permitted provided that the following conditions are met:
9 // * Redistributions of source code must retain the above copyright notice, this
10 // list of conditions and the following disclaimer.
11 // * Redistributions in binary form must reproduce the above copyright notice,
12 // this list of conditions and the following disclaimer in the documentation
13 // and/or other materials provided with the distribution.
14 // * Neither the name of AlliedModders LLC nor the names of its contributors
15 // may be used to endorse or promote products derived from this software
16 // without specific prior written permission.
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 // POSSIBILITY OF SUCH DAMAGE.
30 #ifndef _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_
31 #define _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_
35 #include <am-allocator-policies.h>
36 #include <am-utility.h>
37 #include <am-moveable.h>
41 template <typename T, typename AllocPolicy = SystemAllocatorPolicy>
42 class Vector : public AllocPolicy
45 Vector(AllocPolicy = AllocPolicy())
52 Vector(Moveable<Vector<T, AllocPolicy> > other) {
54 nitems_ = other->nitems_;
55 maxsize_ = other->maxsize_;
63 bool append(const T &item) {
66 new (&data_[nitems_]) T(item);
70 bool append(Moveable<T> item) {
73 new (&data_[nitems_]) T(item);
77 void infallibleAppend(const T &item) {
78 assert(growIfNeeded(1));
79 new (&data_[nitems_]) T(item);
82 void infallibleAppend(Moveable<T> item) {
83 assert(growIfNeeded(1));
84 new (&data_[nitems_]) T(item);
88 // Shift all elements including |at| up by one, and insert |item| at the
89 // given position. This is a linear-time operation.
90 bool insert(size_t at, const T &item) {
93 new (&data_[at]) T(item);
96 bool insert(size_t at, Moveable<T> item) {
99 new (&data_[at]) T(item);
103 // Shift all elements at the given position down, removing the given
104 // element. This is a linear-time operation.
105 void remove(size_t at) {
106 for (size_t i = at; i < length() - 1; i++)
107 data_[i] = T(Moveable<T>(data_[i + 1]));
112 T t = at(length() - 1);
118 data_[nitems_ - 1].~T();
122 return length() == 0;
124 size_t length() const {
128 assert(i < length());
131 const T& at(size_t i) const {
132 assert(i < length());
135 T& operator [](size_t i) {
138 const T& operator [](size_t i) const {
144 const T &back() const {
145 return at(length() - 1);
148 return at(length() - 1);
155 bool ensure(size_t desired) {
156 if (desired <= length())
159 return growIfNeeded(desired - length());
163 // These are disallowed because they basically violate the failure handling
164 // model for AllocPolicies and are also likely to have abysmal performance.
165 Vector(const Vector<T> &other) KE_DELETE;
166 Vector &operator =(const Vector<T> &other) KE_DELETE;
170 for (size_t i = 0; i < nitems_; i++)
180 bool moveUp(size_t at) {
181 if (!growIfNeeded(1))
184 for (size_t i = nitems_ - 1; i > at; i--)
185 data_[i] = T(Moveable<T>(data_[i - 1]));
189 bool growIfNeeded(size_t needed)
191 if (!IsUintPtrAddSafe(nitems_, needed)) {
192 this->reportAllocationOverflow();
195 if (nitems_ + needed < maxsize_)
198 size_t new_maxsize = maxsize_ ? maxsize_ : 8;
199 while (nitems_ + needed > new_maxsize) {
200 if (!IsUintPtrMultiplySafe(new_maxsize, 2)) {
201 this->reportAllocationOverflow();
207 T* newdata = (T*)this->malloc(sizeof(T) * new_maxsize);
210 for (size_t i = 0; i < nitems_; i++) {
211 new (&newdata[i]) T(Moveable<T>(data_[i]));
217 maxsize_ = new_maxsize;
229 #endif /* _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_ */