LIBINT
2.6.0
|
QuantumNumbersA<T,N> is a set of N quantum numbers of type T implemented in terms of a C-style array. More...
#include <quanta.h>
Public Types | |
typedef QuantumSet | parent_type |
typedef QuantumNumbersA | iter_type |
QuantumSet is a set of one QuantumSet. | |
![]() | |
typedef DummyIterator | iter_type |
![]() | |
typedef KeyTraits< LIBINT2_UINT_LEAST64 >::ReturnType | KeyReturnType |
Public Member Functions | |
QuantumNumbersA (const T &val) | |
QuantumNumbersA (const T *qn) | |
QuantumNumbersA (const vector< T > &qn) | |
QuantumNumbersA (const SafePtr< QuantumNumbersA > &) | |
QuantumNumbersA (const SafePtr< QuantumSet > &) | |
QuantumNumbersA (const SafePtr< ConstructablePolymorphically > &) | |
bool | operator== (const QuantumNumbersA &) const |
std::string | label () const |
void | inc (unsigned int i) |
Increment quantum number i. | |
void | dec (unsigned int i) |
Decrement quantum number i. | |
const T | elem (unsigned int i) const |
Return i-th quantum number. | |
void | set_elem (unsigned int i, const T &value) |
Return i-th quantum number. | |
unsigned int | num_quanta () const |
Implementation of QuantumSet::num_quanta() | |
LIBINT2_UINT_LEAST64 | key () const |
Implements Hashable::key() | |
LIBINT2_UINT_LEAST64 | max_key () const |
key is in range [0,max_key()) | |
Additional Inherited Members | |
![]() | |
static const LIBINT2_UINT_LEAST64 | max_quantum_number = 100 |
Quantum numbers lie in range [0,max_quantum_number) | |
![]() | |
KeyStore< LIBINT2_UINT_LEAST64, OwnKey< KeyMP >::result > | key_ |
QuantumNumbersA<T,N> is a set of N quantum numbers of type T implemented in terms of a C-style array.
QuantumNumbersA is faster than QuantumNumbers but is not as safe!