| all(int dim=-1) const | intNDArray< T > | |
| any(int dim=-1) const | intNDArray< T > | |
| Array(T *d, int n) | Array< T > | [inline, protected] |
| Array(T *d, const dim_vector &dv) | Array< T > | [inline, protected] |
| Array(void) | Array< T > | [inline] |
| Array(int n) | Array< T > | [inline, explicit] |
| Array(int n, const T &val) | Array< T > | [inline, explicit] |
| Array(const Array< U > &a) | Array< T > | [inline] |
| Array(const Array< T > &a) | Array< T > | [inline] |
| Array(const dim_vector &dv) | Array< T > | [inline] |
| Array(const dim_vector &dv, const T &val) | Array< T > | [inline] |
| Array(const Array< T > &a, const dim_vector &dv) | Array< T > | |
| ArrayN(T *d, const dim_vector &dv) | ArrayN< T > | [inline, protected] |
| ArrayN(void) | ArrayN< T > | [inline] |
| ArrayN(const dim_vector &dv) | ArrayN< T > | [inline] |
| ArrayN(const dim_vector &dv, const T &val) | ArrayN< T > | [inline] |
| ArrayN(const Array2< U > &a) | ArrayN< T > | [inline, explicit] |
| ArrayN(const ArrayN< U > &a) | ArrayN< T > | [inline] |
| ArrayN(const Array< U > &a) | ArrayN< T > | [inline] |
| ArrayN(const Array< U > &a, const dim_vector &dv) | ArrayN< T > | [inline] |
| byte_size(void) const | Array< T > | [inline] |
| capacity(void) const | Array< T > | [inline] |
| checkelem(int n) | Array< T > | [inline] |
| checkelem(int i, int j) | Array< T > | [inline] |
| checkelem(int i, int j, int k) | Array< T > | [inline] |
| checkelem(const Array< int > &ra_idx) | Array< T > | [inline] |
| checkelem(int n) const | Array< T > | [inline] |
| checkelem(int i, int j) const | Array< T > | [inline] |
| checkelem(int i, int j, int k) const | Array< T > | [inline] |
| checkelem(const Array< int > &ra_idx) const | Array< T > | [inline] |
| chop_trailing_singletons(void) | Array< T > | [inline] |
| clear_index(void) | Array< T > | |
| cols(void) const | Array< T > | [inline] |
| columns(void) const | Array< T > | [inline] |
| compute_index(Array< int > &ra_idx, const dim_vector &dimensions) | intNDArray< T > | [static] |
| MArrayN::compute_index(const Array< int > &ra_idx) const | Array< T > | |
| concat(const intNDArray< T > &rb, const Array< int > &ra_idx) | intNDArray< T > | |
| data(void) const | Array< T > | [inline] |
| dim1(void) const | Array< T > | [inline] |
| dim2(void) const | Array< T > | [inline] |
| dim3(void) const | Array< T > | [inline] |
| dimensions | Array< T > | |
| dims(void) const | Array< T > | [inline] |
| elem(int n) | Array< T > | [inline] |
| elem(int i, int j) | Array< T > | [inline] |
| elem(int i, int j, int k) | Array< T > | [inline] |
| elem(const Array< int > &ra_idx) | Array< T > | [inline] |
| elem(int n) const | Array< T > | [inline] |
| elem(int i, int j) const | Array< T > | [inline] |
| elem(int i, int j, int k) const | Array< T > | [inline] |
| elem(const Array< int > &ra_idx) const | Array< T > | [inline] |
| fill(const T &val) | Array< T > | [inline] |
| fortran_vec(void) const | Array< T > | [inline] |
| fortran_vec(void) | Array< T > | |
| get_idx(void) const | Array< T > | [inline] |
| get_size(int r, int c) | Array< T > | [static] |
| get_size(int r, int c, int p) | Array< T > | [static] |
| get_size(const dim_vector &dv) | Array< T > | [static] |
| idx | Array< T > | [protected] |
| idx_count | Array< T > | [protected] |
| increment_index(Array< int > &ra_idx, const dim_vector &dimensions, int start_dimension=0) | intNDArray< T > | [static] |
| index(idx_vector &i, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | ArrayN< T > | [inline] |
| index(idx_vector &i, idx_vector &j, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | ArrayN< T > | [inline] |
| index(Array< idx_vector > &ra_idx, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | ArrayN< T > | [inline] |
| index1(idx_vector &i, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | Array< T > | |
| index2(idx_vector &i, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | Array< T > | |
| index_count(void) const | Array< T > | [inline] |
| indexN(idx_vector &i, int resize_ok=0, const T &rfv=resize_fill_value(T())) const | Array< T > | |
| insert(const intNDArray< T > &a, int r, int c) | intNDArray< T > | |
| insert(const intNDArray< T > &a, const Array< int > &ra_idx) | intNDArray< T > | |
| MArrayN::insert(const ArrayN< T > &a, const dim_vector &dv) | ArrayN< T > | [inline] |
| MArrayN::insert(const ArrayN< T > &a, int r, int c) | ArrayN< T > | [inline] |
| Array::insert(const Array< T > &a, int r, int c) | Array< T > | |
| Array::insert(const Array< T > &a, const Array< int > &idx) | Array< T > | |
| insert2(const Array< T > &a, int r, int c) | Array< T > | |
| insertN(const Array< T > &a, int r, int c) | Array< T > | |
| intNDArray(void) | intNDArray< T > | [inline] |
| intNDArray(T val) | intNDArray< T > | [inline] |
| intNDArray(const dim_vector &dv) | intNDArray< T > | [inline] |
| intNDArray(const dim_vector &dv, T val) | intNDArray< T > | [inline] |
| intNDArray(const Array< U > &a) | intNDArray< T > | [inline, explicit] |
| intNDArray(const ArrayN< U > &a) | intNDArray< T > | [inline, explicit] |
| intNDArray(const MArrayN< U > &a) | intNDArray< T > | [inline] |
| intNDArray(const intNDArray< U > &a) | intNDArray< T > | [inline] |
| intNDArray(T *d, dim_vector &dv) | intNDArray< T > | [inline, protected] |
| ipermute(const Array< int > &vec) const | MArrayN< T > | [inline] |
| is_empty(void) const | Array< T > | [inline] |
| is_square(void) const | Array< T > | [inline] |
| length(void) const | Array< T > | [inline] |
| make_unique(void) | Array< T > | [inline, protected] |
| make_unique(const T &val) | Array< T > | [inline, protected] |
| MArrayN(T *d, const dim_vector &dv) | MArrayN< T > | [inline, protected] |
| MArrayN(void) | MArrayN< T > | [inline] |
| MArrayN(const dim_vector &dv) | MArrayN< T > | [inline] |
| MArrayN(const dim_vector &dv, const T &val) | MArrayN< T > | [inline] |
| MArrayN(const Array2< U > &a) | MArrayN< T > | [inline, explicit] |
| MArrayN(const ArrayN< U > &a) | MArrayN< T > | [inline] |
| MArrayN(const MArrayN< U > &a) | MArrayN< T > | [inline] |
| maybe_delete_dims(void) | Array< T > | |
| maybe_delete_elements(idx_vector &i) | Array< T > | |
| maybe_delete_elements(idx_vector &i, idx_vector &j) | Array< T > | |
| maybe_delete_elements(idx_vector &i, idx_vector &j, idx_vector &k) | Array< T > | |
| maybe_delete_elements(Array< idx_vector > &ra_idx, const T &rfv) | Array< T > | |
| maybe_delete_elements_1(idx_vector &i) | Array< T > | |
| maybe_delete_elements_2(idx_vector &i) | Array< T > | |
| ndims(void) const | Array< T > | [inline] |
| nelem(void) const | Array< T > | [inline] |
| numel(void) const | Array< T > | [inline] |
| operator!(void) const | intNDArray< T > | |
| operator()(int n) | Array< T > | [inline] |
| operator()(int i, int j) | Array< T > | [inline] |
| operator()(int i, int j, int k) | Array< T > | [inline] |
| operator()(const Array< int > &ra_idx) | Array< T > | [inline] |
| operator()(int n) const | Array< T > | [inline] |
| operator()(int i, int j) const | Array< T > | [inline] |
| operator()(int i, int j, int k) const | Array< T > | [inline] |
| operator()(const Array< int > &ra_idx) const | Array< T > | [inline] |
| operator=(const intNDArray< T > &a) | intNDArray< T > | [inline] |
| MArrayN::operator=(const MArrayN< T > &a) | MArrayN< T > | [inline] |
| ArrayN::operator=(const ArrayN< T > &a) | ArrayN< T > | [inline] |
| Array::operator=(const Array< T > &a) | Array< T > | [inline] |
| pages(void) const | Array< T > | [inline] |
| permute(const Array< int > &vec, bool inv=false) const | MArrayN< T > | [inline] |
| print_info(std::ostream &os, const std::string &prefix) const | Array< T > | |
| qsort(int(*compare)(const void *, const void *)) | Array< T > | [inline] |
| range_error(const char *fcn, int n) const | Array< T > | |
| range_error(const char *fcn, int n) | Array< T > | |
| range_error(const char *fcn, int i, int j) const | Array< T > | |
| range_error(const char *fcn, int i, int j) | Array< T > | |
| range_error(const char *fcn, int i, int j, int k) const | Array< T > | |
| range_error(const char *fcn, int i, int j, int k) | Array< T > | |
| range_error(const char *fcn, const Array< int > &ra_idx) const | Array< T > | |
| range_error(const char *fcn, const Array< int > &ra_idx) | Array< T > | |
| rep | Array< T > | |
| reshape(const dim_vector &new_dims) const | MArrayN< T > | [inline] |
| resize(const dim_vector &dv) | ArrayN< T > | [inline] |
| resize(const dim_vector &dv, const T &val) | ArrayN< T > | [inline] |
| Array::resize(int n) | Array< T > | [inline] |
| Array::resize(int n, const T &val) | Array< T > | [inline] |
| resize_and_fill(int n, const T &val) | Array< T > | |
| resize_and_fill(int r, int c, const T &val) | Array< T > | |
| resize_and_fill(int r, int c, int p, const T &val) | Array< T > | |
| resize_and_fill(const dim_vector &dv, const T &val) | Array< T > | |
| resize_fill_value(void) | intNDArray< T > | [inline, static] |
| resize_no_fill(int n) | Array< T > | |
| resize_no_fill(int r, int c) | Array< T > | |
| resize_no_fill(int r, int c, int p) | Array< T > | |
| resize_no_fill(const dim_vector &dv) | Array< T > | |
| rows(void) const | Array< T > | [inline] |
| set_index(const idx_vector &i) | Array< T > | |
| squeeze(void) const | intNDArray< T > | [inline] |
| transpose(void) const | intNDArray< T > | [inline] |
| value(void) | Array< T > | |
| xelem(int n) | Array< T > | [inline] |
| xelem(int n) const | Array< T > | [inline] |
| xelem(int i, int j) | Array< T > | [inline] |
| xelem(int i, int j) const | Array< T > | [inline] |
| xelem(int i, int j, int k) | Array< T > | [inline] |
| xelem(int i, int j, int k) const | Array< T > | [inline] |
| xelem(const Array< int > &ra_idx) | Array< T > | [inline] |
| xelem(const Array< int > &ra_idx) const | Array< T > | [inline] |
| ~Array(void) | Array< T > | [virtual] |
| ~ArrayN(void) | ArrayN< T > | [inline] |
| ~MArrayN(void) | MArrayN< T > | [inline] |
