#include <FusionTree.hpp>
|
typedef Symmetry::qType | qType |
|
typedef Symmetry::Scalar | Scalar |
|
|
template<typename Ar > |
void | serialize (Ar &ar) |
|
void | computeDim () |
|
void | computeIntermediates () |
|
bool | operator< (const FusionTree< Rank, Symmetry > &other) const |
|
bool | operator> (const FusionTree< Rank, Symmetry > &other) const |
|
bool | operator== (const FusionTree< Rank, Symmetry > &other) const |
|
bool | operator!= (const FusionTree< Rank, Symmetry > &other) const |
|
std::string | printTree (const std::array< std::string, Rank > &s_uncoupled, const std::array< std::string, util::inter_dim(Rank)> &s_intermediates, const std::string &s_coupled, const std::array< std::string, util::mult_dim(Rank)> &s_multiplicities) const |
|
std::string | draw () const |
|
std::string | print () const |
|
template<typename PlainLib > |
PlainLib::template TType< Scalar, Rank+1 > | asTensor (const mpi::XpedWorld &world=mpi::getUniverse()) const |
|
FusionTree< Rank+1, Symmetry > | enlarge (const FusionTree< 1, Symmetry > &other) const |
|
std::unordered_map< FusionTree< Rank, Symmetry >, typename Symmetry::Scalar > | permute (const util::Permutation &p) const |
|
std::unordered_map< FusionTree< Rank, Symmetry >, typename Symmetry::Scalar > | swap (const std::size_t &pos) const |
|
template<typename PlainLib > |
PlainLib::template TType< typename Symmetry::Scalar, Rank+1 > | asTensor (const mpi::XpedWorld &world) const |
|
◆ qType
template<std::size_t Rank, typename Symmetry >
◆ Scalar
template<std::size_t Rank, typename Symmetry >
◆ asTensor() [1/2]
template<std::size_t Rank, typename Symmetry >
template<typename PlainLib >
◆ asTensor() [2/2]
template<std::size_t Rank, typename Symmetry >
template<typename PlainLib >
◆ computeDim()
template<std::size_t Rank, typename Symmetry >
◆ computeIntermediates()
template<std::size_t Rank, typename Symmetry >
◆ draw()
template<std::size_t Rank, typename Symmetry >
◆ enlarge()
template<std::size_t Rank, typename Symmetry >
◆ operator!=()
template<std::size_t Rank, typename Symmetry >
◆ operator<()
template<std::size_t Rank, typename Symmetry >
◆ operator==()
template<std::size_t Rank, typename Symmetry >
◆ operator>()
template<std::size_t Rank, typename Symmetry >
◆ permute()
template<std::size_t Rank, typename Symmetry >
◆ print()
template<std::size_t Rank, typename Symmetry >
◆ printTree()
template<std::size_t Rank, typename Symmetry >
std::string Xped::FusionTree< Rank, Symmetry >::printTree |
( |
const std::array< std::string, Rank > & |
s_uncoupled, |
|
|
const std::array< std::string, util::inter_dim(Rank)> & |
s_intermediates, |
|
|
const std::string & |
s_coupled, |
|
|
const std::array< std::string, util::mult_dim(Rank)> & |
s_multiplicities |
|
) |
| const |
◆ serialize()
template<std::size_t Rank, typename Symmetry >
template<typename Ar >
◆ swap()
template<std::size_t Rank, typename Symmetry >
std::unordered_map< FusionTree< Rank, Symmetry >, typename Symmetry::Scalar > Xped::FusionTree< Rank, Symmetry >::swap |
( |
const std::size_t & |
pos | ) |
const |
◆ hash_value
template<std::size_t Rank, typename Symmetry >
std::size_t hash_value |
( |
const FusionTree< Rank, Symmetry > & |
tree | ) |
|
|
friend |
◆ dim
template<std::size_t Rank, typename Symmetry >
◆ dims
template<std::size_t Rank, typename Symmetry >
◆ IS_DUAL
template<std::size_t Rank, typename Symmetry >
◆ multiplicities
template<std::size_t Rank, typename Symmetry >
Initial value:=
std::array<size_t, util::mult_dim(Rank)>()
◆ q_coupled
template<std::size_t Rank, typename Symmetry >
◆ q_intermediates
template<std::size_t Rank, typename Symmetry >
◆ q_uncoupled
template<std::size_t Rank, typename Symmetry >
The documentation for this struct was generated from the following files: