template<class T>
class CASM::Tensor< T >
Definition at line 32 of file Tensor.hh.
|
| | Tensor (Index tNrank, Array< Index > tNdim) |
| |
| | Tensor (Index tNrank, Array< Index > tNdim, T init_val) |
| |
| | Tensor (Index tNrank=0) |
| |
| | Tensor (const Eigen::Matrix< T, 3, 3 > &mat_init) |
| |
| | Tensor (ReturnTensor< T > &init_cont) |
| |
| Tensor & | operator= (ReturnTensor< T > &RHS) |
| |
| Tensor & | operator= (const T &RHS) |
| |
| template<int dim1, int dim2, int flag1> |
| Tensor & | operator= (const Eigen::Matrix< T, dim1, dim2, flag1 > &LHS) |
| |
| void | swap (Tensor &RHS) |
| |
| void | redefine (Array< Index > _Ndim) |
| |
| void | redefine (Array< Index > _Ndim, T fill_val) |
| |
| Tensor & | dim_permute (const Array< Index > &iperm) |
| |
| Tensor & | dim_permute (const Permutation &perm) |
| |
| Tensor & | dim_ipermute (const Array< Index > &perm) |
| |
| Tensor & | dim_ipermute (const Permutation &perm) |
| |
| Tensor & | dim_unpermute () |
| |
| bool | next_permute () |
| |
| void | permute_symmetrize () |
| | Symmetrize tensor with respect to index permutation. More...
|
| |
| void | permute_symmetrize (const Array< Array< Index > > &unique_dim) |
| |
| void | reset_idim () |
| |
| Counter< Array< Index > > | element_counter () const |
| |
| Index | rank () const |
| |
| const Array< Index > & | ind_max () const |
| |
| const Array< Index > & | dim () const |
| |
| Index | dim (Index i) const |
| |
| const Array< Index > & | mult_array () const |
| |
| const T & | get (const Array< Index > &inds) const |
| |
| T & | at (const Array< Index > &inds) |
| |
| const T & | at (const Array< Index > &inds) const |
| |
| T & | operator() (const Array< Index > &inds) |
| |
| const T & | operator() (const Array< Index > &inds) const |
| |
| T & | operator() (Index i, Index j) |
| |
| const T & | operator() (Index i, Index j) const |
| |
| Tensor & | operator+= (const Tensor &RHS) |
| |
| Tensor & | operator-= (const Tensor &RHS) |
| |
| Tensor & | operator*= (T RHS) |
| |
| Tensor & | operator/= (T RHS) |
| |
| ReturnTensor< T > | operator- () |
| |
| ReturnTensor< T > | operator+ (const Tensor &RHS) |
| |
| ReturnTensor< T > | operator- (const Tensor &RHS) |
| |
| T | scalar_prod (const Tensor &RHS) const |
| |
| ReturnTensor< T > | tensor_prod (const Tensor &RHS) |
| |
| Tensor & | normalize () |
| |
| Tensor & | transform (const Eigen::MatrixXd &op) |
| |
| Tensor & | transform (const SymOp &op, Array< SymGroupRepID > rep_IDs) |
| |
| Tensor & | apply_sym (const SymOp &op) |
| |
| Tensor & | symmetrize_index (const SymOp &op, Array< SymGroupRepID > rep_IDs, Array< Index > inner_ind) |
| |
| Tensor | slice (Array< Index > slice_Ndim, Array< Index > slice_ind) |
| |
| void | read (std::istream &stream) |
| |
| Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > | convert_to_Eigen () const |
| |
| template<int dim1, int dim2, int flag1> |
| Tensor< T > & | operator= (const Eigen::Matrix< T, dim1, dim2, flag1 > &LHS) |
| |
| Index | size () const |
| |
| 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 * | begin () |
| |
| T const * | cbegin () const |
| |
| T const * | end () const |
| |
| T * | end () |
| |
| T const * | cend () const |
| |
| 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) |
| |
| 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 |
| |