factorise Member List

This is the complete list of members for factorise, including all inherited members.

active_node(exptree &, iterator)	active_node
algorithm(exptree &, iterator)	algorithm
apply(iterator &)	factorise	[virtual]
algorithm::apply(sibling_iterator &, sibling_iterator &)	algorithm	[virtual]
algorithm::apply(unsigned int last_used_equation_number, bool multiple, bool until_nochange, bool make_copy, int act_at_level=-1, bool called_by_manipulator=false)	algorithm
apply_recursive(iterator &, bool check_consistency=true, int act_at_level=-1, bool called_by_manipulator=false, bool until_nochange=false)	algorithm
args_begin() const	active_node
args_begin_	active_node	[mutable, protected]
args_end() const	active_node
args_end_	active_node	[mutable, protected]
calc_restricted_hash(iterator it) const	factorise	[private]
can_apply(iterator)	factorise	[virtual]
algorithm::can_apply(sibling_iterator, sibling_iterator)	algorithm	[virtual]
check_consistency(iterator) const	algorithm
check_index_consistency(iterator) const	algorithm
classify_add_index(iterator it, index_map_t &ind_free, index_map_t &ind_dummy) const	algorithm	[protected]
classify_indices(iterator, index_map_t &ind_free, index_map_t &ind_dummy) const	algorithm	[protected]
classify_indices_up(iterator, index_map_t &ind_free, index_map_t &ind_dummy) const	algorithm	[protected]
compare_prod_nonprod(iterator prod, iterator nonprod) const	factorise	[private]
compare_restricted(iterator one, iterator two) const	factorise	[private]
contains(sibling_iterator from, sibling_iterator to, sibling_iterator arg)	algorithm	[protected]
description() const	factorise	[virtual]
determine_intersection(index_map_t &one, index_map_t &two, index_map_t &target, bool move_out=false) const	algorithm	[protected]
discard_command_node	algorithm
dont_iterate	algorithm	[protected]
equal_without_numbers(nset_t::iterator, nset_t::iterator)	algorithm	[protected, static]
equation_number	algorithm
expression_modified	algorithm
factnodes	factorise	[private]
factorise(exptree &, iterator)	factorise
fill_hash_map(iterator)	factorise	[private]
fill_index_position_map(iterator, const index_map_t &, index_position_map_t &) const	algorithm	[protected]
fill_map(index_map_t &, sibling_iterator, sibling_iterator) const	algorithm	[protected]
find_arg_superset(range_vector_t &, Iter st, Iter nd)	algorithm	[protected]
find_arg_superset(range_vector_t &, sibling_iterator it)	algorithm	[protected]
find_argument_lists(range_vector_t &, bool only_comma_lists=true) const	algorithm	[protected]
g_applied enum value	algorithm
g_apply_failed enum value	algorithm
g_arguments_accepted enum value	algorithm
g_not_yet_started enum value	algorithm
g_operand_determined enum value	algorithm
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	algorithm	[protected]
get_dummy(const list_property *, iterator) const	algorithm	[protected]
get_dummy(const list_property *, iterator, iterator) const	algorithm	[protected]
get_dummy_sw	algorithm	[static]
global_success	algorithm
global_success_t enum name	algorithm
has_argument(const std::string &) const	active_node
index_map_t typedef	algorithm	[protected]
index_parity(iterator) const	algorithm	[protected]
index_position_map_t typedef	algorithm	[protected]
index_sw	algorithm	[static]
intersection_number(sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, BinaryPredicate) const	active_node	[protected]
is_single_term(iterator)	algorithm	[protected]
iterator typedef	active_node
l_applied enum value	algorithm
l_error enum value	algorithm
l_no_action enum value	algorithm
last_used_equation_number	algorithm	[protected]
less_without_numbers(nset_t::iterator, nset_t::iterator)	algorithm	[protected, static]
marks	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	algorithm	[protected]
max_numbered_name_one(const std::string &nm, const index_map_t *one) const	algorithm	[protected]
node_integer(iterator, int)	algorithm	[protected]
node_one(iterator)	algorithm	[protected]
node_zero(iterator)	algorithm	[protected]
number_of_args() const	active_node
number_of_calls	algorithm
number_of_modifications	algorithm
output_format	algorithm
post_order_iterator typedef	active_node
previous_expression	algorithm	[protected]
print_classify_indices(iterator) const	algorithm	[protected]
prod_unwrap_single_term(iterator &)	algorithm	[protected]
prod_wrap_single_term(iterator &)	algorithm	[protected]
pushup_multiplier(iterator)	algorithm	[protected]
range_t typedef	algorithm	[protected]
range_vector_t typedef	algorithm	[protected]
rename_replacement_dummies(iterator, bool still_inside_algo=false)	algorithm	[protected]
report_progress(const std::string &, int todo, int done, int count=2)	algorithm
report_progress_stopwatch	algorithm
result_t enum name	algorithm
sibling_iterator typedef	active_node
subtree	algorithm
suppress_normal_output	algorithm
term_hash	factorise	[private]
term_hash_iterator_t typedef	factorise	[private]
term_hash_t typedef	factorise	[private]
this_command	active_node
tr	active_node	[protected]
~active_node()	active_node	[inline, virtual]
~algorithm()	algorithm	[virtual]

---