112 void report_progress(
const std::string&,
int todo,
int done,
int count=2);
147 static bool is_factorlike(
iterator);
166 static bool less_without_numbers(nset_t::iterator, nset_t::iterator);
167 static bool equal_without_numbers(nset_t::iterator, nset_t::iterator);
170 typedef std::pair<sibling_iterator, sibling_iterator> range_t;
171 typedef std::vector<range_t> range_vector_t;
174 void find_argument_lists(range_vector_t&,
bool only_comma_lists=
true)
const;
176 range_vector_t::iterator find_arg_superset(range_vector_t&, Iter st, Iter nd);
177 range_vector_t::iterator find_arg_superset(range_vector_t&,
sibling_iterator it);
180 unsigned int locate_single_object(Ex::iterator obj_to_find,
181 Ex::iterator st, Ex::iterator nd,
182 std::vector<unsigned int>& store);
183 bool locate_object_set(
const Ex& objs,
184 Ex::iterator st, Ex::iterator nd,
185 std::vector<unsigned int>& store);
190 bool is_nonprod_factor_in_prod(
iterator);
194 bool prod_wrap_single_term(
iterator&);
195 bool prod_unwrap_single_term(
iterator&);
196 bool sum_wrap_single_term(
iterator&);
197 bool sum_unwrap_single_term(
iterator&);
204 void force_node_wrap(
iterator&, std::string);
226 template<
class BinaryPredicate>
260 template<
class BinaryPredicate>
263 BinaryPredicate
fun)
const
Object keeping track of time spent in nested execution blocks, and keeping track of out-of-band messa...
Definition ProgressMonitor.hh:17
The Stopwach class provides a simple interace to allow timing function calls etc.....
Definition Stopwatch.hh:107
Ex::iterator iterator
Definition Algorithm.hh:70
Algorithm(const Kernel &, Ex &)
Initialise the algorithm with a reference to the expression tree, but do not yet do anything with thi...
Definition Algorithm.cc:51
void report_progress(const std::string &, int todo, int done, int count=2)
Definition Algorithm.cc:622
bool interrupted
Definition Algorithm.hh:75
static unsigned int number_of_direct_indices(iterator it)
Definition Algorithm.cc:1114
bool check_degree_consistency(iterator) const
Given an expression top node, check differential form degree consistency.
Definition Algorithm.cc:533
void propagate_zeroes(post_order_iterator &, const iterator &)
Given a node with zero multiplier, propagate this zero upwards in the tree.
Definition Algorithm.cc:321
static bool is_termlike(iterator)
Determines whether the indicated node is 'like a term in a sum'.
Definition Algorithm.cc:825
index_iterator end_index(iterator it) const
Definition Algorithm.cc:518
Ex::sibling_iterator sibling_iterator
Definition Algorithm.hh:72
void node_zero(iterator)
Definition Algorithm.cc:454
bool rename_replacement_dummies(iterator, bool still_inside_algo=false)
Rename the dummies in the sub-tree starting with head at the given iterator.
Definition Algorithm.cc:655
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.
Definition Algorithm.hh:261
unsigned int number_of_calls
Definition Algorithm.hh:101
bool check_consistency(iterator) const
Given an expression top node, check index consistency.
Definition Algorithm.cc:538
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 paren...
Definition Algorithm.cc:109
void node_one(iterator)
Definition Algorithm.cc:461
void set_progress_monitor(ProgressMonitor *)
Provide the algorithm with a ProgressMonitor object on which to register (nested) progress informatio...
Definition Algorithm.cc:67
bool check_index_consistency(iterator) const
Definition Algorithm.cc:526
Ex::result_t result_t
Definition Algorithm.hh:73
bool traverse_ldots
Definition Algorithm.hh:238
Stopwatch index_sw
Definition Algorithm.hh:114
void node_integer(iterator, int)
Definition Algorithm.cc:468
bool discard_command_node
Definition Algorithm.hh:104
Ex::post_order_iterator post_order_iterator
Definition Algorithm.hh:71
Stopwatch report_progress_stopwatch
Definition Algorithm.hh:116
bool suppress_normal_output
Definition Algorithm.hh:103
void pushup_multiplier(iterator)
Determines whether the indicated node is 'like a factor in a product'.
Definition Algorithm.cc:414
index_iterator begin_index(iterator it) const
Definition Algorithm.cc:513
result_t apply_once(Ex::iterator &it)
Definition Algorithm.cc:195
result_t apply_deep(Ex::iterator &it)
Definition Algorithm.cc:212
unsigned int number_of_indices(iterator it)
Definition Algorithm.cc:489
unsigned int number_of_modifications
Definition Algorithm.hh:102
std::string get_index_set_name(iterator it) const
Definition Algorithm.cc:500
Stopwatch get_dummy_sw
Definition Algorithm.hh:115
virtual ~Algorithm()
Definition Algorithm.cc:63
result_t apply_pre_order(bool repeat=false)
Apply algorithm with alternative traversal: starting from the top node, traverse the tree pre-order (...
Definition Algorithm.cc:72
Basic storage class for symbolic mathemematical expressions.
Definition Storage.hh:165
result_t
Keeping track of what algorithms have done to this expression.
Definition Storage.hh:193
IndexClassifier(const Kernel &)
Definition IndexClassifier.cc:15
Class holding a collection of properties attached to expressions.
Definition Props.hh:237
An iterator which iterates over indices even if they are at lower levels, i.e.
Definition IndexIterator.hh:16
Elementary building block for a mathematical expression.
Definition Storage.hh:61
Functions to handle the exchange properties of two or more symbols in a product.
Definition Adjform.cc:83
void fun(int *&p)
Definition passing.cc:6