1.1 --- a/include/am-vector.h Thu Aug 29 23:51:30 2013 -0700
1.2 +++ b/include/am-vector.h Sat Aug 31 19:52:41 2013 -0700
1.3 @@ -85,6 +85,29 @@
1.4 nitems_++;
1.5 }
1.6
1.7 + // Shift all elements including |at| up by one, and insert |item| at the
1.8 + // given position. This is a linear-time operation.
1.9 + bool insert(size_t at, const T &item) {
1.10 + if (!moveUp(at))
1.11 + return false;
1.12 + new (&data_[at]) T(item);
1.13 + return true;
1.14 + }
1.15 + bool insert(size_t at, Moveable<T> item) {
1.16 + if (!moveUp(at))
1.17 + return false;
1.18 + new (&data_[at]) T(item);
1.19 + return true;
1.20 + }
1.21 +
1.22 + // Shift all elements at the given position down, removing the given
1.23 + // element. This is a linear-time operation.
1.24 + void remove(size_t at) {
1.25 + for (size_t i = at; i < length() - 1; i++)
1.26 + data_[i] = T(Moveable<T>(data_[i + 1]));
1.27 + pop();
1.28 + }
1.29 +
1.30 T popCopy() {
1.31 T t = at(length() - 1);
1.32 pop();
1.33 @@ -154,6 +177,15 @@
1.34 maxsize_ = 0;
1.35 }
1.36
1.37 + bool moveUp(size_t at) {
1.38 + if (!growIfNeeded(1))
1.39 + return false;
1.40 + nitems_++;
1.41 + for (size_t i = nitems_ - 1; i > at; i--)
1.42 + data_[i] = T(Moveable<T>(data_[i - 1]));
1.43 + return true;
1.44 + }
1.45 +
1.46 bool growIfNeeded(size_t needed)
1.47 {
1.48 if (!IsUintPtrAddSafe(nitems_, needed)) {