template<class T>
class CASM::Array< T >
Basic std::vector like container (deprecated)
- Legacy container that incorporated various useful algorithms, now being slowly replaced
- Prefer to use std::vector except when necessary for compatibility
Definition at line 45 of file Array.hh.
|
| Array () |
|
| Array (Index init_N) |
|
| Array (Index init_N, const T &init_val) |
|
| Array (const Array &RHS) |
|
template<typename Iterator , typename = CASM_TMP::enable_if_iterator_of<Iterator, T>> |
| Array (Iterator begin, Iterator end) |
|
| Array (std::initializer_list< T > in) |
|
| Array (ReturnArray< T > &RHS) |
|
| ~Array () |
|
Index | size () const |
|
Array & | operator= (const Array &RHS) |
|
Array & | operator= (ReturnArray< T > &RHS) |
|
void | swap (Array< T > &RHS) |
|
T & | at (Index ind) |
|
const T & | at (Index ind) const |
|
const T & | operator[] (Index ind) const |
|
T & | operator[] (Index ind) |
|
T & | back () |
|
const T & | back () const |
|
T const * | begin () const |
|
T const * | cbegin () const |
|
T * | begin () |
|
T const * | end () const |
|
T const * | cend () const |
|
T * | end () |
|
void | push_back (const T &toPush) |
|
void | pop_back () |
|
void | remove (Index ind) |
|
void | clear () |
|
void | resize (Index new_N) |
|
void | resize (Index new_N, const T &fill_val) |
|
void | reserve (Index new_max) |
|
template<typename CompareType > |
void | sort (const CompareType &comp) |
|
void | sort (Array< Index > &ind_order) |
|
void | sort () |
|
Array & | append (const Array &new_tail) |
|
Array & | append_unique (const Array &new_tail) |
|
void | swap_elem (Index i, Index j) |
|
Array & | permute (const Array< Index > &perm_array) |
|
Array & | ipermute (const Array< Index > &perm_array) |
|
bool | next_permute () |
|
ReturnArray< Index > | as_perm_inverse () const |
|
ReturnArray< Index > | as_perm_transform_by (const Array< Index > &trans_perm) const |
|
const T & | max () const |
|
const T & | min () const |
|
ReturnArray< T > | sub_array (Index ind_begin, Index ind_end) const |
|
T | sum () const |
|
bool | is_ascending () const |
|
bool | is_descending () const |
|
bool | is_constant () const |
|
bool | is_permute () const |
|
bool | has_fixed_points () const |
|
bool | operator== (const Array< T > &RHS) const |
|
bool | operator!= (const Array< T > &RHS) const |
|
bool | operator< (const Array< T > &RHS) const |
|
bool | operator> (const Array< T > &RHS) const |
|
bool | operator<= (const Array< T > &RHS) const |
|
bool | operator>= (const Array< T > &RHS) const |
|
bool | all_in (const Array &superset) const |
|
Index | coincidence (const Array &superset) const |
|
Index | incidences (const T &test_elem) const |
|
Index | find (const T &test_elem) const |
|
Index | reverse_find (const T &test_elem) const |
| Same as find, but starts from the last element of the Array. More...
|
|
Index | almost_find (const T &test_elem, double tol_val=TOL) const |
|
Index | almost_reverse_find (const T &test_elem, double tol_val=TOL) const |
| Same as almost_find, but start from the last element of the Array. More...
|
|
bool | contains (const T &test_elem) const |
|
bool | almost_contains (const T &test_elem, double tol_val=TOL) const |
|
void | print_column (std::ostream &stream, const std::string &indent="") const |
|