|
|
std::vector< Wilson > | mty::copyWilsons (std::vector< Wilson > const &wilsons) |
| |
|
Cache< csl::Expr, csl::Expr > | mty::cachedWilson ([](csl::Expr const &A, csl::Expr const &B) { return(A==B)||csl::hardComparison(A, B);}) |
| |
|
void | mty::parseStructures (csl::Expr &arg, std::vector< csl::Expr > &inOperator, csl::IndexStructure &quantumStructure) |
| |
|
std::vector< csl::Expr > | mty::parseStructures (csl::Expr &product) |
| |
|
std::vector< Wilson > | mty::cachedWilsonCalculation (csl::Expr const &product, csl::Expr const &operatorFactor, Wilson res, csl::Expr op, bool standardBasis, bool recursive) |
| |
|
std::vector< Wilson > | mty::sglSimplifyForWilson (csl::Expr const &op, csl::Expr const &operatorFactor, Wilson res, bool standardBasis, bool recursive) |
| |
|
std::vector< Wilson > | mty::parseExpression (csl::Expr const &product, csl::Expr const &operatorFactor=CSL_1, bool standardBasis=false, bool recursive=false) |
| |
|
std::vector< Wilson > | mty::parseSum (csl::Expr const &sum, csl::Expr const &operatorFactor=CSL_1, bool standardBasis=false, bool recursive=false) |
| |
|
void | mty::addWilson (Wilson const &wil, std::vector< Wilson > &wilsons, bool merge=true) |
| |
|
void | mty::addSortedWilson (Wilson const &wil, std::vector< Wilson > &wilsons) |
| |
|
WilsonSet | mty::match (std::vector< csl::Expr > &litudes, csl::Expr const &operatorFactor, bool standardBasis=false, bool squaredAfter=false) |
| |