Cadabra
Computer algebra system for field theory problems
Classes | Functions
young_reduce.cc File Reference
#include "Compare.hh"
#include "Cleanup.hh"
#include "algorithms/young_reduce.hh"
#include "algorithms/young_project_tensor.hh"
#include "algorithms/sort_sum.hh"
#include "algorithms/collect_terms.hh"
#include "algorithms/distribute.hh"
#include "algorithms/rename_dummies.hh"
#include <sstream>
#include "DisplayTerminal.hh"

Classes

struct  get_children_iterators
 
struct  get_combinations
 
struct  get_combinations::iterator
 
struct  get_combinations::iterator::Combination
 

Functions

multiplier_t linear_divide (const Kernel &kernel, const Ex &num, const Ex &den)
 
std::vector< Exall_index_permutations (Ex ex, const Kernel &kernel)
 
bool is_index_permutation (const Kernel &kernel, Ex::iterator lhs, Ex::iterator rhs)
 
bool is_index_permutation (const Kernel &kernel, const Ex &lhs, const Ex &rhs)
 
Ex project (const Kernel &kernel, Ex ex)
 
std::vector< Ex::iterator > find_matching_terms (const Kernel &kernel, Ex &ex, Ex::iterator &it, const Ex &pattern)
 

Function Documentation

◆ all_index_permutations()

std::vector<Ex> all_index_permutations ( Ex  ex,
const Kernel kernel 
)

◆ find_matching_terms()

std::vector<Ex::iterator> find_matching_terms ( const Kernel kernel,
Ex ex,
Ex::iterator &  it,
const Ex pattern 
)

◆ is_index_permutation() [1/2]

bool is_index_permutation ( const Kernel kernel,
Ex::iterator  lhs,
Ex::iterator  rhs 
)

◆ is_index_permutation() [2/2]

bool is_index_permutation ( const Kernel kernel,
const Ex lhs,
const Ex rhs 
)

◆ linear_divide()

multiplier_t linear_divide ( const Kernel kernel,
const Ex num,
const Ex den 
)

◆ project()

Ex project ( const Kernel kernel,
Ex  ex 
)