Destruct.
Add elements es to the back. Throws when array becomes full. NOTE: doesn't invalidate any borrow
Try to add elements es to the back. NOTE: doesn't invalidate any borrow
Last (back) element.
Empty.
First (front) element.
Add elements es to the back. Throws when array becomes full. NOTE: doesn't invalidate any borrow
Try to add elements es to the back. NOTE: doesn't invalidate any borrow
Move element at index to return.
Comparison for equality.
Comparison for equality.
Index operator.
Add elements es to the back. NOTE: doesn't invalidate any borrow
Get slice in range i .. j.
Get full slice.
Pop element at index.
Pop last (back) element.
Pop the n last (back) elements.
Pop first (front) element.
Get full read-only slice.
Get read-only slice in range i .. j.
Get full read-write slice.
Get read-write slice in range i .. j.
Maximum value possible for _readBorrowCount.
Get length.
Get read-only slice in range i .. j.
Get read-write slice in range i .. j.
Get read-only full slice.
Get read-write full slice.
Get as string.
Construct from element values.
number of defined elements in _store
Store of capacity number of elements.
https://en.cppreference.com/w/cpp/container/array
TODO: Merge member functions with basic_*_array.d and array_ex.d
Statically allocated T-array of fixed pre-allocated length.
Similar to C++'s std::static_vector<T, Capacity> Similar to Rust's fixedvec: https://docs.rs/fixedvec/0.2.4/fixedvec/ Similar to mir.small_array at http://mir-algorithm.libmir.org/mir_small_array.html