Add tests.
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);
89 T t = at(length() - 1);
95 data_[nitems_ - 1].~T();
101 size_t length() const {
105 assert(i < length());
108 const T& at(size_t i) const {
109 assert(i < length());
112 T& operator [](size_t i) {
115 const T& operator [](size_t i) const {
121 const T &back() const {
122 return at(length() - 1);
125 return at(length() - 1);
132 bool ensure(size_t desired) {
133 if (desired <= length())
136 return growIfNeeded(desired - length());
140 // These are disallowed because they basically violate the failure handling
141 // model for AllocPolicies and are also likely to have abysmal performance.
142 Vector(const Vector<T> &other) KE_DELETE;
143 Vector &operator =(const Vector<T> &other) KE_DELETE;
147 for (size_t i = 0; i < nitems_; i++)
157 bool growIfNeeded(size_t needed)
159 if (!IsUintPtrAddSafe(nitems_, needed)) {
160 this->reportAllocationOverflow();
163 if (nitems_ + needed < maxsize_)
166 size_t new_maxsize = maxsize_ ? maxsize_ : 8;
167 while (nitems_ + needed > new_maxsize) {
168 if (!IsUintPtrMultiplySafe(new_maxsize, 2)) {
169 this->reportAllocationOverflow();
175 T* newdata = (T*)this->malloc(sizeof(T) * new_maxsize);
178 for (size_t i = 0; i < nitems_; i++) {
179 new (&newdata[i]) T(Moveable<T>(data_[i]));
185 maxsize_ = new_maxsize;
197 #endif /* _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_ */