inserts elements of r in the back of this index.
Complexity: O(n r * i(n)),
amortized O(n r)
for this index
_
inserts value in the back of this index.
Complexity: O(i(n)),
amortized O(1) for this index
inserts elements of r in the back of this index.
Complexity: O(n r * i(n)),
amortized O(n r)
for this index
Perform mod on r.front and performs any necessary fixups to container's
indices. If the result of mod violates any index' invariant, r.front is
removed from the container.
Preconditions: !r.empty,
mod is a callable of the form void mod(ref Value)
Complexity: O(m(n)),
O(1) for this index
Preconditions: i < length Complexity: O(1)
Sets index i to value, unless another index refuses value Preconditions: i < length
Fetch a range that spans all the elements in the container.
Fetch a range that spans all the elements in the container from index a (inclusive) to index b (exclusive). Preconditions: a <= b && b <= length
removes elements of r from this container.
Complexity: O(n r * d(n)),
O(n)
for this index
Removes the last element from this index.
Preconditions: !empty
Complexity: O(d(n));
O(1) for this index
Replaces r.front with value
Ensures sufficient capacity to accommodate count elements.
Swaps element at index i with element at index j. Preconditions: i < length && j < length Complexity: O(1)
Complexity: O(1)
Complexity: O(r(n));
O(1) for this index
Returns the capacity of the index, which is the length of the underlying store
Property returning true if and only if the container has no elements.
Complexity: O(1)
Complexity: O(r(n));
O(1) for this index
Returns the number of elements in the container.
Defines the index' primary range, which embodies a random access range
index implementation
Requirements: the following symbols must be defined in the scope in which this index is mixed in:
ThisNode, Value, __InsertAllBut!N, __InsertAll, __Replace, __RemoveAllBut!N, node_count