include/am-vector.h
author David Anderson <dvander@alliedmods.net>
Fri Sep 06 13:54:31 2013 -0700 (2013-09-06)
changeset 18 9b30f80f6e49
parent 17 563aea5eba06
permissions -rw-r--r--
Eliminate Newborn/NoAddRef (bug 5907, r=ds).
     1 // vim: set sts=8 ts=2 sw=2 tw=99 et:
     2 //
     3 // Copyright (C) 2013, David Anderson and AlliedModders LLC
     4 // All rights reserved.
     5 // 
     6 // Redistribution and use in source and binary forms, with or without
     7 // modification, are permitted provided that the following conditions are met:
     8 // 
     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.
    17 //
    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.
    29 
    30 #ifndef _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_
    31 #define _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_
    32 
    33 #include <new>
    34 #include <stdlib.h>
    35 #include <am-allocator-policies.h>
    36 #include <am-utility.h>
    37 #include <am-moveable.h>
    38 
    39 namespace ke {
    40 
    41 template <typename T, typename AllocPolicy = SystemAllocatorPolicy>
    42 class Vector : public AllocPolicy
    43 {
    44  public:
    45   Vector(AllocPolicy = AllocPolicy())
    46    : data_(NULL),
    47      nitems_(0),
    48      maxsize_(0)
    49   {
    50   }
    51 
    52   Vector(Moveable<Vector<T, AllocPolicy> > other) {
    53     data_ = other->data_;
    54     nitems_ = other->nitems_;
    55     maxsize_ = other->maxsize_;
    56     other->reset();
    57   }
    58 
    59   ~Vector() {
    60     zap();
    61   }
    62 
    63   bool append(const T &item) {
    64     if (!growIfNeeded(1))
    65       return false;
    66     new (&data_[nitems_]) T(item);
    67     nitems_++;
    68     return true;
    69   }
    70   bool append(Moveable<T> item) {
    71     if (!growIfNeeded(1))
    72       return false;
    73     new (&data_[nitems_]) T(item);
    74     nitems_++;
    75     return true;
    76   }
    77   void infallibleAppend(const T &item) {
    78     assert(growIfNeeded(1));
    79     new (&data_[nitems_]) T(item);
    80     nitems_++;
    81   }
    82   void infallibleAppend(Moveable<T> item) {
    83     assert(growIfNeeded(1));
    84     new (&data_[nitems_]) T(item);
    85     nitems_++;
    86   }
    87 
    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) {
    91     if (!moveUp(at))
    92       return false;
    93     new (&data_[at]) T(item);
    94     return true;
    95   }
    96   bool insert(size_t at, Moveable<T> item) {
    97     if (!moveUp(at))
    98       return false;
    99     new (&data_[at]) T(item);
   100     return true;
   101   }
   102 
   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]));
   108     pop();
   109   }
   110 
   111   T popCopy() {
   112     T t = at(length() - 1);
   113     pop();
   114     return t;
   115   }
   116   void pop() {
   117     assert(nitems_);
   118     data_[nitems_ - 1].~T();
   119     nitems_--;
   120   }
   121   bool empty() const {
   122     return length() == 0;
   123   }
   124   size_t length() const {
   125     return nitems_;
   126   }
   127   T& at(size_t i) {
   128     assert(i < length());
   129     return data_[i];
   130   }
   131   const T& at(size_t i) const {
   132     assert(i < length());
   133     return data_[i];
   134   }
   135   T& operator [](size_t i) {
   136     return at(i);
   137   }
   138   const T& operator [](size_t i) const {
   139     return at(i);
   140   }
   141   void clear() {
   142     nitems_ = 0;
   143   }
   144   const T &back() const {
   145     return at(length() - 1);
   146   }
   147   T &back() {
   148     return at(length() - 1);
   149   }
   150 
   151   T *buffer() const {
   152     return data_;
   153   }
   154 
   155   bool ensure(size_t desired) {
   156     if (desired <= length())
   157       return true;
   158 
   159     return growIfNeeded(desired - length());
   160   }
   161 
   162  private:
   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;
   167 
   168  private:
   169   void zap() {
   170     for (size_t i = 0; i < nitems_; i++)
   171       data_[i].~T();
   172     this->free(data_);
   173   }
   174   void reset() {
   175     data_ = NULL;
   176     nitems_ = 0;
   177     maxsize_ = 0;
   178   }
   179 
   180   bool moveUp(size_t at) {
   181     if (!growIfNeeded(1))
   182       return false;
   183     nitems_++;
   184     for (size_t i = nitems_ - 1; i > at; i--)
   185       data_[i] = T(Moveable<T>(data_[i - 1]));
   186     return true;
   187   }
   188 
   189   bool growIfNeeded(size_t needed)
   190   {
   191     if (!IsUintPtrAddSafe(nitems_, needed)) {
   192       this->reportAllocationOverflow();
   193       return false;
   194     }
   195     if (nitems_ + needed < maxsize_)
   196       return true;
   197 
   198     size_t new_maxsize = maxsize_ ? maxsize_ : 8;
   199     while (nitems_ + needed > new_maxsize) {
   200       if (!IsUintPtrMultiplySafe(new_maxsize, 2)) {
   201         this->reportAllocationOverflow();
   202         return false;
   203       }
   204       new_maxsize *= 2;
   205     }
   206 
   207     T* newdata = (T*)this->malloc(sizeof(T) * new_maxsize);
   208     if (newdata == NULL)
   209       return false;
   210     for (size_t i = 0; i < nitems_; i++) {
   211       new (&newdata[i]) T(Moveable<T>(data_[i]));
   212       data_[i].~T();
   213     }
   214     this->free(data_);
   215 
   216     data_ = newdata;
   217     maxsize_ = new_maxsize;
   218     return true;
   219   }
   220 
   221  private:
   222   T* data_;
   223   size_t nitems_;
   224   size_t maxsize_;
   225 };
   226 
   227 }
   228 
   229 #endif /* _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_ */
   230