#include <meld.hh>

Inheritance diagram for cadabra::meld:

Classes
struct	ProjectedTerm
struct	symmetrizer_t

Public Member Functions
	meld (const Kernel &kernel, Ex &ex, bool project_as_sum=false)
virtual	~meld ()
virtual bool	can_apply (iterator it) override
virtual result_t	apply (iterator &it) override
Public Member Functions inherited from cadabra::Algorithm
	Algorithm (const Kernel &, Ex &)
	Initialise the algorithm with a reference to the expression tree, but do not yet do anything with this tree.
virtual	~Algorithm ()
void	set_progress_monitor (ProgressMonitor *)
	Provide the algorithm with a ProgressMonitor object on which to register (nested) progress information, to be reported out-of-band to a client.
result_t	apply_generic (bool deep=true, bool repeat=false, unsigned int depth=0)
	The main entry points for running algorithms, which traverse the tree post-order ('child before parent').
result_t	apply_generic (iterator &, bool deep, bool repeat, unsigned int depth)
result_t	apply_pre_order (bool repeat=false)
	Apply algorithm with alternative traversal: starting from the top node, traverse the tree pre-order ('parent before child') and once the algorithm acts at a given node, do not traverse the subtree below anymore.
bool	check_consistency (iterator) const
	Given an expression top node, check index consistency.
bool	check_index_consistency (iterator) const
bool	check_degree_consistency (iterator) const
	Given an expression top node, check differential form degree consistency.
void	report_progress (const std::string &, int todo, int done, int count=2)
index_iterator	begin_index (iterator it) const
index_iterator	end_index (iterator it) const
unsigned int	number_of_indices (iterator it)
std::string	get_index_set_name (iterator it) const
bool	rename_replacement_dummies (iterator, bool still_inside_algo=false)
	Rename the dummies in the sub-tree starting with head at the given iterator.
void	pushup_multiplier (iterator)
	Determines whether the indicated node is 'like a factor in a product'.
template<class BinaryPredicate>
unsigned int	intersection_number (sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, BinaryPredicate) const
	Determine the number of elements in the first range which also occur in the second range.
void	node_zero (iterator)
void	node_one (iterator)
void	node_integer (iterator, int)
Public Member Functions inherited from cadabra::ExManip
	ExManip (const Kernel &, Ex &)
bool	prod_wrap_single_term (iterator &)
	Take a single non-product node in a sum and wrap it in a product node, so it can be handled on the same footing as a proper product.
bool	prod_unwrap_single_term (iterator &)
bool	sum_wrap_single_term (iterator &)
bool	sum_unwrap_single_term (iterator &)
bool	is_single_term (iterator)
	Is the indicated node a single term in an expression?
bool	is_nonprod_factor_in_prod (iterator)
void	force_node_wrap (iterator &, std::string)
	Wrap a term in a product or sum in a node with indicated name, irrespective of its parent (it usually makes more sense to call the safer prod_wrap_single_term or sum_wrap_single_term above).

Private Types
using	tab_t = cadabra::TableauBase::tab_t

Private Member Functions
std::vector< tab_t >	collect_tableaux (Ex &ex) const
bool	collect_symmetries (const std::vector< tab_t > &tabs, std::vector< symmetrizer_t > &symmetrizers) const
bool	collect_symmetries_as_product (const std::vector< tab_t > &tabs, std::vector< symmetrizer_t > &symmetrizers) const
bool	collect_symmetries_as_sum (const std::vector< tab_t > &tabs, std::vector< symmetrizer_t > &symmetrizers) const
void	symmetrize (ProjectedTerm &adj, const std::vector< symmetrizer_t > &symmetries)
void	symmetrize_as_product (ProjectedTerm &adj, const std::vector< symmetrizer_t > &symmetrizers)
void	symmetrize_as_sum (ProjectedTerm &adj, const std::vector< symmetrizer_t > &symmetries)
void	symmetrize_idents (ProjectedTerm &sym)
bool	can_apply_diagonals (iterator it)
bool	apply_diagonals (iterator it)
bool	can_apply_traceless (iterator it)
bool	apply_traceless (iterator it)
bool	can_apply_cycle_traces (iterator it)
bool	apply_cycle_traces (iterator it)
bool	can_apply_tableaux (iterator it)
bool	apply_tableaux (iterator it)

Private Attributes
IndexMap	index_map
bool	project_as_sum

Additional Inherited Members
Public Types inherited from cadabra::Algorithm
typedef std::set< Ex, tree_exact_less_obj >	Ex_set_t
typedef Ex::result_t	result_t
Public Types inherited from cadabra::ExManip
typedef Ex::iterator_base	iterator_base
typedef Ex::iterator	iterator
typedef Ex::post_order_iterator	post_order_iterator
typedef Ex::sibling_iterator	sibling_iterator
Static Public Member Functions inherited from cadabra::Algorithm
static unsigned int	number_of_indices (const Properties &, iterator it)
static unsigned int	number_of_direct_indices (iterator it)
static bool	is_termlike (iterator)
	Determines whether the indicated node is 'like a term in a sum'.
Public Attributes inherited from cadabra::Algorithm
bool	interrupted
unsigned int	number_of_calls
unsigned int	number_of_modifications
bool	suppress_normal_output
bool	discard_command_node
Stopwatch	index_sw
Stopwatch	get_dummy_sw
Stopwatch	report_progress_stopwatch
Protected Attributes inherited from cadabra::Algorithm
bool	traverse_ldots
Protected Attributes inherited from cadabra::ExManip
const Kernel &	kernel
Ex &	tr

Member Typedef Documentation

◆ tab_t

using cadabra::meld::tab_t = cadabra::TableauBase::tab_t

private

Constructor & Destructor Documentation

◆ meld()

meld::meld	(	const Kernel &	kernel,
		Ex &	ex,
		bool	project_as_sum = false )

◆ ~meld()

meld::~meld ( )

virtual

Member Function Documentation

◆ apply()

meld::result_t meld::apply ( iterator & it )

overridevirtual

◆ apply_cycle_traces()

bool meld::apply_cycle_traces ( iterator it )

private

◆ apply_diagonals()

bool meld::apply_diagonals ( iterator it )

private

◆ apply_tableaux()

bool meld::apply_tableaux ( iterator it )

private

◆ apply_traceless()

bool meld::apply_traceless ( iterator it )

private

◆ can_apply()

bool meld::can_apply ( iterator it )

overridevirtual

◆ can_apply_cycle_traces()

bool meld::can_apply_cycle_traces ( iterator it )

private

◆ can_apply_diagonals()

bool meld::can_apply_diagonals ( iterator it )

private

◆ can_apply_tableaux()

bool meld::can_apply_tableaux ( iterator it )

private

◆ can_apply_traceless()

bool meld::can_apply_traceless ( iterator it )

private

◆ collect_symmetries()

bool meld::collect_symmetries	(	const std::vector< tab_t > &	tabs,
		std::vector< symmetrizer_t > &	symmetrizers ) const

private

◆ collect_symmetries_as_product()

bool meld::collect_symmetries_as_product	(	const std::vector< tab_t > &	tabs,
		std::vector< symmetrizer_t > &	symmetrizers ) const

private

◆ collect_symmetries_as_sum()

bool meld::collect_symmetries_as_sum	(	const std::vector< tab_t > &	tabs,
		std::vector< symmetrizer_t > &	symmetrizers ) const

private

◆ collect_tableaux()

std::vector< meld::tab_t > meld::collect_tableaux ( Ex & ex ) const

private

◆ symmetrize()

void meld::symmetrize	(	ProjectedTerm &	adj,
		const std::vector< symmetrizer_t > &	symmetries )

private

◆ symmetrize_as_product()

void meld::symmetrize_as_product	(	ProjectedTerm &	adj,
		const std::vector< symmetrizer_t > &	symmetrizers )

private

◆ symmetrize_as_sum()

void meld::symmetrize_as_sum	(	ProjectedTerm &	adj,
		const std::vector< symmetrizer_t > &	symmetries )

private

◆ symmetrize_idents()

void meld::symmetrize_idents ( ProjectedTerm & sym )

private

Member Data Documentation

◆ index_map

IndexMap cadabra::meld::index_map

private

◆ project_as_sum

bool cadabra::meld::project_as_sum

private

The documentation for this class was generated from the following files:

core/algorithms/meld.hh
core/algorithms/meld.cc

Classes

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Additional Inherited Members

Member Typedef Documentation

◆ tab_t

Constructor & Destructor Documentation

◆ meld()

◆ ~meld()

Member Function Documentation

◆ apply()

◆ apply_cycle_traces()

◆ apply_diagonals()

◆ apply_tableaux()

◆ apply_traceless()

◆ can_apply()

◆ can_apply_cycle_traces()

◆ can_apply_diagonals()

◆ can_apply_tableaux()

◆ can_apply_traceless()

◆ collect_symmetries()

◆ collect_symmetries_as_product()

◆ collect_symmetries_as_sum()

◆ collect_tableaux()

◆ symmetrize()

◆ symmetrize_as_product()

◆ symmetrize_as_sum()

◆ symmetrize_idents()

Member Data Documentation

◆ index_map

◆ project_as_sum