 |
Cadabra
Computer algebra system for field theory problems
|
Go to the documentation of this file.
19 std::set<Ex, tree_exact_less_for_indexmap_obj>
factnodes;
28 typedef std::multimap<hashval_t, Ex::sibling_iterator>
term_hash_t;
void fill_hash_map(iterator)
Definition: factor_in.cc:56
virtual bool can_apply(iterator) override
Definition: factor_in.cc:17
bool compare_restricted(iterator one, iterator two) const
Definition: factor_in.cc:90
bool compare_prod_nonprod(iterator prod, iterator nonprod) const
Definition: factor_in.cc:70
term_hash_t term_hash
Definition: factor_in.hh:31
Ex & factors
Definition: factor_in.hh:18
virtual result_t apply(iterator &) override
Definition: factor_in.cc:123
hashval_t calc_restricted_hash(iterator it) const
Definition: factor_in.cc:31
void one(rset_t::iterator &num)
Definition: Storage.cc:1024
std::set< Ex, tree_exact_less_for_indexmap_obj > factnodes
Definition: factor_in.hh:19
Ex::iterator iterator
Definition: Algorithm.hh:70
Definition: Algorithm.hh:59
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83
Definition: Storage.hh:141
factor_in(const Kernel &, Ex &, Ex &)
Definition: factor_in.cc:12
Definition: factor_in.hh:10
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:160
term_hash_t::iterator term_hash_iterator_t
Definition: factor_in.hh:29
uintptr_t hashval_t
Definition: Storage.hh:41
std::multimap< hashval_t, Ex::sibling_iterator > term_hash_t
Definition: factor_in.hh:28