add_to_end(const T &aValue, const int doResize=1) | Hat< T > | [inline, private] |
addLeaf(const T &aValue, const int doResize) | Hat< T > | [inline, private] |
append(const T &a) | Hat< T > | [inline] |
at(const size_t i) | Hat< T > | [inline] |
at(const size_t i) const | Hat< T > | [inline] |
decrement_length(const unsigned int val) | Hat< T > | [inline] |
first() const | Hat< T > | [inline] |
Hat(const size_t aExpectedSize=min_hat_size) | Hat< T > | [inline] |
Hat(const Hat< T > &hat) | Hat< T > | [inline] |
init(const size_t aExpectedSize=min_hat_size) | Hat< T > | [inline] |
insert(const T &a, const size_t i) | Hat< T > | [inline] |
isEmpty() const | Hat< T > | [inline] |
last() const | Hat< T > | [inline] |
leafIndex(const unsigned i) const | Hat< T > | [inline, private] |
leafMask | Hat< T > | [private] |
leafSize() const | Hat< T > | [inline, private] |
length() const | Hat< T > | [inline] |
numAvail | Hat< T > | [private] |
numElements | Hat< T > | [private] |
operator[](const size_t i) | Hat< T > | [inline] |
operator[](const size_t i) const | Hat< T > | [inline] |
power | Hat< T > | [private] |
recommendedPower(const size_t s) const | Hat< T > | [inline, private] |
remove(const size_t i) | Hat< T > | [inline] |
remove_n(const size_t i, const size_t n) | Hat< T > | [inline] |
resize(const size_t newExpectedSize) | Hat< T > | [inline, private] |
set_to_empty() | Hat< T > | [inline] |
setPower(const size_t p) | Hat< T > | [inline, private] |
top | Hat< T > | [private] |
topIndex(const unsigned i) const | Hat< T > | [inline, private] |
topSize() const | Hat< T > | [inline, private] |
topUsed | Hat< T > | [private] |
~Hat() | Hat< T > | [inline] |