CASM
AClustersApproachtoStatisticalMechanics
|
#include <Molecule.hh>
Definition at line 100 of file Molecule.hh.
Public Types | |
typedef Array< AtomPosition > | X1 |
typedef Array< X1 > | X2 |
typedef Array< X2 > | X3 |
typedef Array< X3 > | X4 |
typedef Array< X4 > | X5 |
typedef Array< X5 > | X6 |
typedef Array< X6 > | X7 |
typedef Array< X7 > | X8 |
typedef Array< X8 > | X9 |
typedef AtomPosition | value_type |
typedef Index | size_type |
typedef AtomPosition * | iterator |
typedef const AtomPosition * | const_iterator |
Public Member Functions | |
Molecule (const Lattice &init_home) | |
Lattice const * | home () const |
void | get_center () |
void | generate_point_group () |
bool | is_vacancy () const |
Molecule & | apply_sym (const SymOp &op) |
Molecule & | apply_sym_no_trans (const SymOp &op) |
void | set_lattice (const Lattice &new_lat, COORD_TYPE invariant_mode) |
Molecule | get_union (const Molecule &RHS) |
Molecule & | operator*= (const SymOp &RHS) |
Molecule & | operator+= (const Coordinate &RHS) |
bool | operator== (const Molecule &RHS) const |
bool | contains (const std::string &name) const |
void | read (std::istream &stream) |
void | print (std::ostream &stream, const Coordinate &trans, int spaces, char delim, bool SD_is_on=false) const |
jsonParser & | to_json (jsonParser &json) const |
void | from_json (const jsonParser &json) |
Index | size () const |
void | swap (Array< AtomPosition > &RHS) |
AtomPosition & | at (Index ind) |
const AtomPosition & | at (Index ind) const |
const AtomPosition & | operator[] (Index ind) const |
AtomPosition & | operator[] (Index ind) |
AtomPosition & | back () |
const AtomPosition & | back () const |
AtomPositionconst * | begin () const |
AtomPosition * | begin () |
AtomPositionconst * | cbegin () const |
AtomPositionconst * | end () const |
AtomPosition * | end () |
AtomPositionconst * | cend () const |
void | push_back (const AtomPosition &toPush) |
void | pop_back () |
void | remove (Index ind) |
void | clear () |
void | resize (Index new_N) |
void | resize (Index new_N, const AtomPosition &fill_val) |
void | reserve (Index new_max) |
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 AtomPosition & | max () const |
const AtomPosition & | min () const |
ReturnArray< AtomPosition > | sub_array (Index ind_begin, Index ind_end) const |
AtomPosition | sum () const |
bool | is_ascending () const |
bool | is_descending () const |
bool | is_constant () const |
bool | is_permute () const |
bool | has_fixed_points () const |
Checks whether any values are equal to their index – only valid for Array<Index> More... | |
bool | operator== (const Array< AtomPosition > &RHS) const |
bool | operator!= (const Array< AtomPosition > &RHS) const |
bool | operator< (const Array< AtomPosition > &RHS) const |
bool | operator> (const Array< AtomPosition > &RHS) const |
bool | operator<= (const Array< AtomPosition > &RHS) const |
bool | operator>= (const Array< AtomPosition > &RHS) const |
bool | all_in (const Array &superset) const |
Index | coincidence (const Array &superset) const |
Index | incidences (const AtomPosition &test_elem) const |
Index | find (const AtomPosition &test_elem) const |
Index | reverse_find (const AtomPosition &test_elem) const |
Same as find, but starts from the last element of the Array. More... | |
Index | almost_find (const AtomPosition &test_elem, double tol_val=TOL) const |
Index | almost_reverse_find (const AtomPosition &test_elem, double tol_val=TOL) const |
Same as almost_find, but start from the last element of the Array. More... | |
bool | contains (const AtomPosition &test_elem) const |
bool | almost_contains (const AtomPosition &test_elem, double tol_val=TOL) const |
void | print_column (std::ostream &stream, const std::string &indent="") const |
Static Public Member Functions | |
static ReturnArray< AtomPosition > | sequence (const AtomPosition &initial, const AtomPosition &final) |
Returns an array with the sequence (initial, ++initial, ..., final), inclusive. More... | |
static ReturnArray< AtomPosition > | sequence (const AtomPosition &initial, const AtomPosition &increment, const AtomPosition &final) |
Public Attributes | |
Coordinate | center |
std::string | name |
Private Attributes | |
Lattice const * | m_home |
Array< SymOp > | point_group |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inherited |
Same as almost_find, but start from the last element of the Array.
|
inherited |
|
inherited |
|
inherited |
Construct permutation that undoes the permutation performed by 'this' Inverse operation is calculated the same, regardless of permutation convention
|
inherited |
Given N distinct objects labeled from 0 to N-1, a permutation 'P_permute' that physically permutes the objects (with labels) in terms of their labels, and a permutation 'L_permute' that permutes their labels only, rewrite 'P_permute' in terms of the relabeling induced by 'L_permute' Rearrange 'this' permutation to form an equivalent permutation for any list that has already been permuted by trans_perm. Does not (nearly certain of this) depend on permutation convention
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inherited |
Checks whether any values are equal to their index – only valid for Array<Index>
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Checks that Array contains values from 0 to perm_array.size()-1 and that no value is repeated does not depend on definition of permutation convention
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Same as find, but starts from the last element of the Array.
|
staticinherited |
Returns an array with the sequence (initial, ++initial, ..., final), inclusive.
Returns an array with the sequence (initial, ++initial, ..., final), inclusive requires that operator<() and operator++() are defined on type T
|
staticinherited |
Returns an array with the sequence (initial, initial+increment, ..., final?), inclusive if final is in the sequence requires that operator<() and operator+=() are defined on type T
Returns an array with the sequence (initial, initial+increment, ..., final?), inclusive if final is in the sequence
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |