| apply(UOp f) | Arageli::vector< T, REFCNT > | [inline] |
| assign() | Arageli::vector< T, REFCNT > | [inline] |
| assign(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign(size_type size_a, const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_and(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_and_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_and_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_or(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_or_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_or_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_xor(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_xor_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_bitwise_xor_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_divides(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_divides_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_divides_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_fromseq(size_type size_a, Seq seq) | Arageli::vector< T, REFCNT > | [inline] |
| assign_fromsize(size_type size_a) | Arageli::vector< T, REFCNT > | [inline] |
| assign_fromstr(const char *s) | Arageli::vector< T, REFCNT > | |
| assign_fromval(size_type size_a, const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_fromvec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_minus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_minus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_minus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_modulus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_modulus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_modulus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_multiplies(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_multiplies_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_multiplies_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_plus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_plus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_plus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_left(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_left_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_left_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_right(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_right_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| assign_shift_right_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| at(size_type i) const | Arageli::vector< T, REFCNT > | [inline] |
| at(size_type i) | Arageli::vector< T, REFCNT > | [inline] |
| back() const | Arageli::vector< T, REFCNT > | [inline] |
| back() | Arageli::vector< T, REFCNT > | [inline] |
| begin() | Arageli::vector< T, REFCNT > | [inline] |
| begin() const | Arageli::vector< T, REFCNT > | [inline] |
| bitwise_not() | Arageli::vector< T, REFCNT > | |
| capacity() const | Arageli::vector< T, REFCNT > | [inline] |
| const_iterator typedef | Arageli::vector< T, REFCNT > | |
| const_pointer typedef | Arageli::vector< T, REFCNT > | |
| const_reference typedef | Arageli::vector< T, REFCNT > | |
| copy_subvector(const SV &sv, V &res) const | Arageli::vector< T, REFCNT > | |
| copy_subvector(const SV &sv) const | Arageli::vector< T, REFCNT > | [inline] |
| difference_type typedef | Arageli::vector< T, REFCNT > | |
| el(size_type i) const | Arageli::vector< T, REFCNT > | [inline] |
| el(size_type i) | Arageli::vector< T, REFCNT > | [inline] |
| element_type typedef | Arageli::vector< T, REFCNT > | |
| end() | Arageli::vector< T, REFCNT > | [inline] |
| end() const | Arageli::vector< T, REFCNT > | [inline] |
| erase(iterator pos) | Arageli::vector< T, REFCNT > | [inline] |
| erase(size_type pos) | Arageli::vector< T, REFCNT > | [inline] |
| erase(iterator first, iterator last) | Arageli::vector< T, REFCNT > | [inline] |
| erase(size_type pos, size_type n) | Arageli::vector< T, REFCNT > | [inline] |
| erase_subvector(const SV &sv) | Arageli::vector< T, REFCNT > | |
| fill(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| fill_fromseq(const Seq &seq) | Arageli::vector< T, REFCNT > | [inline] |
| fill_fromval(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| front() const | Arageli::vector< T, REFCNT > | [inline] |
| front() | Arageli::vector< T, REFCNT > | [inline] |
| insert(iterator pos, const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| insert(size_type pos, const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| insert(size_type pos, size_type size_a, const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromseq(iterator pos, size_type size_a, const Seq &seq) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromseq(size_type pos, size_type size_a, const Seq &seq) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromstr(iterator pos, const Str &str) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromstr(size_type pos, const Str &str) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromval(iterator pos, const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromval(size_type pos, const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromval(iterator pos, size_type size_a, const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromval(size_type pos, size_type size_a, const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromvec(iterator pos, const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| insert_fromvec(size_type pos, const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| inverse() | Arageli::vector< T, REFCNT > | |
| is_empty() const | Arageli::vector< T, REFCNT > | [inline] |
| is_null() const | Arageli::vector< T, REFCNT > | |
| is_opposite_unit() const | Arageli::vector< T, REFCNT > | |
| is_unit() const | Arageli::vector< T, REFCNT > | |
| iterator typedef | Arageli::vector< T, REFCNT > | |
| left_apply(const X &x, Binop f) | Arageli::vector< T, REFCNT > | [inline] |
| left_apply_val(const Val &val, BinAsnOp f) | Arageli::vector< T, REFCNT > | [inline] |
| left_apply_vec(const Vec &vec, BinAsnOp f) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_and(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_and_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_and_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_or(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_or_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_or_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_xor(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_xor_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_bitwise_xor_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_divides(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_divides_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_divides_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_minus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_minus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_minus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_modulus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_modulus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_modulus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_multiplies(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_multiplies_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_multiplies_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_plus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_plus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_plus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_left(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_left_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_left_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_right(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_right_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| left_assign_shift_right_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| length() const | Arageli::vector< T, REFCNT > | [inline] |
| logical_not() | Arageli::vector< T, REFCNT > | |
| operator &=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator *=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator!() const | Arageli::vector< T, REFCNT > | [inline] |
| operator%=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator()(const X &x) const | Arageli::vector< T, REFCNT > | [inline] |
| operator()(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator+() const | Arageli::vector< T, REFCNT > | [inline] |
| operator++() | Arageli::vector< T, REFCNT > | [inline] |
| operator++(int) | Arageli::vector< T, REFCNT > | [inline] |
| operator+=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator-() const | Arageli::vector< T, REFCNT > | [inline] |
| operator--() | Arageli::vector< T, REFCNT > | [inline] |
| operator--(int) | Arageli::vector< T, REFCNT > | [inline] |
| operator-=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator/=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator<<=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator>>=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator[](const X &x) const | Arageli::vector< T, REFCNT > | [inline] |
| operator[](const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator^=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator|=(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| operator~() const | Arageli::vector< T, REFCNT > | [inline] |
| opposite() | Arageli::vector< T, REFCNT > | |
| pack() | Arageli::vector< T, REFCNT > | [inline] |
| pointer typedef | Arageli::vector< T, REFCNT > | |
| pop_back() | Arageli::vector< T, REFCNT > | [inline] |
| pop_front() | Arageli::vector< T, REFCNT > | [inline] |
| push_back(const T &val) | Arageli::vector< T, REFCNT > | [inline] |
| push_front(const T &val) | Arageli::vector< T, REFCNT > | [inline] |
| refcounting | Arageli::vector< T, REFCNT > | [static] |
| reference typedef | Arageli::vector< T, REFCNT > | |
| remove(const T2 &v) | Arageli::vector< T, REFCNT > | [inline] |
| remove_if(Fu f) | Arageli::vector< T, REFCNT > | [inline] |
| reserve(size_type n) | Arageli::vector< T, REFCNT > | [inline] |
| resize(size_type sz) | Arageli::vector< T, REFCNT > | [inline] |
| right_apply(const X &x, BinAsnOp f) | Arageli::vector< T, REFCNT > | [inline] |
| right_apply_val(const Val &val, BinAsnOp f) | Arageli::vector< T, REFCNT > | [inline] |
| right_apply_vec(const Vec &vec, BinAsnOp f) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_and(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_and_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_and_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_or(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_or_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_or_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_xor(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_xor_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_bitwise_xor_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_divides(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_divides_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_divides_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_minus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_minus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_minus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_modulus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_modulus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_modulus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_multiplies(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_multiplies_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_multiplies_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_plus(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_plus_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_plus_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_left(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_left_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_left_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_right(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_right_val(const Val &val) | Arageli::vector< T, REFCNT > | [inline] |
| right_assign_shift_right_vec(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| size() const | Arageli::vector< T, REFCNT > | [inline] |
| size_type typedef | Arageli::vector< T, REFCNT > | |
| subvector(const Vec &vec) const | Arageli::vector< T, REFCNT > | [inline] |
| subvector(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| subvector_at(const Vec &vec) const | Arageli::vector< T, REFCNT > | [inline] |
| subvector_at(const Vec &vec) | Arageli::vector< T, REFCNT > | [inline] |
| swap(vector< T1, REFCNT1 > &x) | Arageli::vector< T, REFCNT > | [inline] |
| swap_els(iterator x, iterator y) | Arageli::vector< T, REFCNT > | [inline] |
| swap_els(size_type xpos, size_type ypos) | Arageli::vector< T, REFCNT > | [inline] |
| take(size_type i) | Arageli::vector< T, REFCNT > | [inline] |
| take_subvector(const SV &sv, V &res) | Arageli::vector< T, REFCNT > | [inline] |
| take_subvector(const SV &sv) | Arageli::vector< T, REFCNT > | [inline] |
| unique() | Arageli::vector< T, REFCNT > | [inline] |
| unique_clear() | Arageli::vector< T, REFCNT > | [inline] |
| value_type typedef | Arageli::vector< T, REFCNT > | |
| vector() | Arageli::vector< T, REFCNT > | [inline] |
| vector(std::size_t size_a, const fromsize_t &select) | Arageli::vector< T, REFCNT > | [inline] |
| vector(const char *s, const fromstr_t &select) | Arageli::vector< T, REFCNT > | [inline] |
| vector(const Vec &vec, const fromvec_t &select) | Arageli::vector< T, REFCNT > | [inline] |
| vector(const X &x) | Arageli::vector< T, REFCNT > | [inline] |
| vector(std::size_t size_a, const Val &val, const fromval_t &select) | Arageli::vector< T, REFCNT > | [inline] |
| vector(std::size_t size_a, const Seq &seq, const fromseq_t &select) | Arageli::vector< T, REFCNT > | [inline] |
| vector(std::size_t size_a, const X &x) | Arageli::vector< T, REFCNT > | [inline] |