Cadabra
Computer algebra system for field theory problems
|
This is the complete list of members for cadabra::replace_match, including all inherited members.
Algorithm(const Kernel &, Ex &) | cadabra::Algorithm | |
apply(iterator &) override | cadabra::replace_match | virtual |
apply_generic(bool deep=true, bool repeat=false, unsigned int depth=0) | cadabra::Algorithm | |
apply_generic(iterator &, bool deep, bool repeat, unsigned int depth) | cadabra::Algorithm | |
apply_pre_order(bool repeat=false) | cadabra::Algorithm | |
begin_index(iterator it) const | cadabra::Algorithm | |
can_apply(iterator) override | cadabra::replace_match | virtual |
check_consistency(iterator) const | cadabra::Algorithm | |
check_degree_consistency(iterator) const | cadabra::Algorithm | |
check_index_consistency(iterator) const | cadabra::Algorithm | |
classify_add_index(iterator it, index_map_t &ind_free, index_map_t &ind_dummy) const | cadabra::Algorithm | protected |
classify_indices(iterator, index_map_t &ind_free, index_map_t &ind_dummy) const | cadabra::Algorithm | protected |
classify_indices_up(iterator, index_map_t &ind_free, index_map_t &ind_dummy) const | cadabra::Algorithm | protected |
compare_(const str_node &, const str_node &) | cadabra::Algorithm | protectedstatic |
contains(sibling_iterator from, sibling_iterator to, sibling_iterator arg) | cadabra::Algorithm | protected |
determine_intersection(index_map_t &one, index_map_t &two, index_map_t &target, bool move_out=false) const | cadabra::Algorithm | protected |
discard_command_node | cadabra::Algorithm | |
end_index(iterator it) const | cadabra::Algorithm | |
equal_without_numbers(nset_t::iterator, nset_t::iterator) | cadabra::Algorithm | protectedstatic |
fill_index_position_map(iterator, const index_map_t &, index_position_map_t &) const | cadabra::Algorithm | protected |
fill_map(index_map_t &, sibling_iterator, sibling_iterator) const | cadabra::Algorithm | protected |
find_arg_superset(range_vector_t &, Iter st, Iter nd) | cadabra::Algorithm | protected |
find_arg_superset(range_vector_t &, sibling_iterator it) | cadabra::Algorithm | protected |
find_argument_lists(range_vector_t &, bool only_comma_lists=true) const | cadabra::Algorithm | protected |
find_modulo_parent_rel(iterator it, index_map_t &imap) const | cadabra::Algorithm | protected |
force_prod_wrap(iterator &) | cadabra::Algorithm | protected |
get_dummy(const list_property *, const index_map_t *m1, const index_map_t *m2=0, const index_map_t *m3=0, const index_map_t *m4=0, const index_map_t *m5=0) const | cadabra::Algorithm | protected |
get_dummy(const list_property *, iterator) const | cadabra::Algorithm | protected |
get_dummy(const list_property *, iterator, iterator) const | cadabra::Algorithm | protected |
get_dummy_sw | cadabra::Algorithm | mutable |
index_in_set(Ex, const index_map_t *) const | cadabra::Algorithm | protected |
index_map_t typedef | cadabra::Algorithm | |
index_parity(iterator) const | cadabra::Algorithm | protected |
index_position_map_t typedef | cadabra::Algorithm | |
index_sw | cadabra::Algorithm | mutable |
interrupted | cadabra::Algorithm | |
intersection_number(sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, BinaryPredicate) const | cadabra::Algorithm | protected |
is_factorlike(iterator) | cadabra::Algorithm | protected |
is_nonprod_factor_in_prod(iterator) | cadabra::Algorithm | protected |
is_single_term(iterator) | cadabra::Algorithm | protected |
is_termlike(iterator) | cadabra::Algorithm | protected |
iterator typedef | cadabra::Algorithm | |
kernel | cadabra::Algorithm | protected |
less_without_numbers(nset_t::iterator, nset_t::iterator) | cadabra::Algorithm | protectedstatic |
locate_object_set(const Ex &objs, Ex::iterator st, Ex::iterator nd, std::vector< unsigned int > &store) | cadabra::Algorithm | protected |
locate_single_object(Ex::iterator obj_to_find, Ex::iterator st, Ex::iterator nd, std::vector< unsigned int > &store) | cadabra::Algorithm | protected |
max_numbered_name(const std::string &, const index_map_t *m1, const index_map_t *m2=0, const index_map_t *m3=0, const index_map_t *m4=0, const index_map_t *m5=0) const | cadabra::Algorithm | protected |
max_numbered_name_one(const std::string &nm, const index_map_t *one) const | cadabra::Algorithm | protected |
node_integer(iterator, int) | cadabra::Algorithm | protected |
node_one(iterator) | cadabra::Algorithm | protected |
node_zero(iterator) | cadabra::Algorithm | protected |
number_of_calls | cadabra::Algorithm | |
number_of_direct_indices(iterator it) | cadabra::Algorithm | static |
number_of_indices(iterator it) | cadabra::Algorithm | |
number_of_indices(const Properties &, iterator it) | cadabra::Algorithm | static |
number_of_modifications | cadabra::Algorithm | |
pm | cadabra::Algorithm | protected |
post_order_iterator typedef | cadabra::Algorithm | |
print_classify_indices(std::ostream &, iterator) const | cadabra::Algorithm | protected |
prod_unwrap_single_term(iterator &) | cadabra::Algorithm | protected |
prod_wrap_single_term(iterator &) | cadabra::Algorithm | protected |
pushup_multiplier(iterator) | cadabra::Algorithm | protected |
range_t typedef | cadabra::Algorithm | protected |
range_vector_t typedef | cadabra::Algorithm | protected |
rename_replacement_dummies(iterator, bool still_inside_algo=false) | cadabra::Algorithm | |
replace_match(const Kernel &, Ex &) | cadabra::replace_match | |
report_progress(const std::string &, int todo, int done, int count=2) | cadabra::Algorithm | |
report_progress_stopwatch | cadabra::Algorithm | mutable |
result_t typedef | cadabra::Algorithm | |
separated_by_derivative(iterator, iterator, iterator check_dependence) const | cadabra::Algorithm | protected |
set_progress_monitor(ProgressMonitor *) | cadabra::Algorithm | |
sibling_iterator typedef | cadabra::Algorithm | |
suppress_normal_output | cadabra::Algorithm | |
tr | cadabra::Algorithm | protected |
~Algorithm() | cadabra::Algorithm | virtual |