include/am-vector.h
author David Anderson <danderson@mozilla.com>
Mon Aug 26 23:18:03 2013 -0700 (2013-08-26)
changeset 11 cfe800908837
parent 10 0ac292cc1467
child 17 563aea5eba06
permissions -rw-r--r--
Add tests.
     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   T popCopy() {
    89     T t = at(length() - 1);
    90     pop();
    91     return t;
    92   }
    93   void pop() {
    94     assert(nitems_);
    95     data_[nitems_ - 1].~T();
    96     nitems_--;
    97   }
    98   bool empty() const {
    99     return length() == 0;
   100   }
   101   size_t length() const {
   102     return nitems_;
   103   }
   104   T& at(size_t i) {
   105     assert(i < length());
   106     return data_[i];
   107   }
   108   const T& at(size_t i) const {
   109     assert(i < length());
   110     return data_[i];
   111   }
   112   T& operator [](size_t i) {
   113     return at(i);
   114   }
   115   const T& operator [](size_t i) const {
   116     return at(i);
   117   }
   118   void clear() {
   119     nitems_ = 0;
   120   }
   121   const T &back() const {
   122     return at(length() - 1);
   123   }
   124   T &back() {
   125     return at(length() - 1);
   126   }
   127 
   128   T *buffer() const {
   129     return data_;
   130   }
   131 
   132   bool ensure(size_t desired) {
   133     if (desired <= length())
   134       return true;
   135 
   136     return growIfNeeded(desired - length());
   137   }
   138 
   139  private:
   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;
   144 
   145  private:
   146   void zap() {
   147     for (size_t i = 0; i < nitems_; i++)
   148       data_[i].~T();
   149     this->free(data_);
   150   }
   151   void reset() {
   152     data_ = NULL;
   153     nitems_ = 0;
   154     maxsize_ = 0;
   155   }
   156 
   157   bool growIfNeeded(size_t needed)
   158   {
   159     if (!IsUintPtrAddSafe(nitems_, needed)) {
   160       this->reportAllocationOverflow();
   161       return false;
   162     }
   163     if (nitems_ + needed < maxsize_)
   164       return true;
   165 
   166     size_t new_maxsize = maxsize_ ? maxsize_ : 8;
   167     while (nitems_ + needed > new_maxsize) {
   168       if (!IsUintPtrMultiplySafe(new_maxsize, 2)) {
   169         this->reportAllocationOverflow();
   170         return false;
   171       }
   172       new_maxsize *= 2;
   173     }
   174 
   175     T* newdata = (T*)this->malloc(sizeof(T) * new_maxsize);
   176     if (newdata == NULL)
   177       return false;
   178     for (size_t i = 0; i < nitems_; i++) {
   179       new (&newdata[i]) T(Moveable<T>(data_[i]));
   180       data_[i].~T();
   181     }
   182     this->free(data_);
   183 
   184     data_ = newdata;
   185     maxsize_ = new_maxsize;
   186     return true;
   187   }
   188 
   189  private:
   190   T* data_;
   191   size_t nitems_;
   192   size_t maxsize_;
   193 };
   194 
   195 }
   196 
   197 #endif /* _INCLUDE_KEIMA_TPL_CPP_VECTOR_H_ */
   198