Home
last modified time | relevance | path

Searched refs:equal_subtree (Results 1 – 25 of 29) sorted by relevance

12

/dports/math/cadabra2/cadabra2-2.3.6.8/core/algorithms/
H A Dexpand_delta.cc96 auto m1=comp.equal_subtree(ind, implicit_index.begin(), Ex_comparator::useprops_t::never, true); in apply()
101 auto m2=comp.equal_subtree(ind, implicit_index.begin(), Ex_comparator::useprops_t::never, true); in apply()
139 …auto m = comp.equal_subtree(ci.original[i1].begin(), implicit_index.begin(), Ex_comparator::usepro… in apply()
H A Ddecompose.cc35 if(projterm.equal_subtree(terms_from_yp[ypi].begin(), (iterator)moreit)) { in add_element_to_basis()
59 if(projterm.equal_subtree(terms_from_yp[ypi].begin(), projtermit)) { in add_element_to_basis()
251 if(tr.equal_subtree(terms_from_yp[i].begin(), (iterator)(rhssumit))) { in apply()
271 if(tr.equal_subtree(terms_from_yp[i].begin(), rhsit)) { in apply()
H A Dcombine.cc154 auto es=compare.equal_subtree(tr.begin(parn2), tr.begin(sib)); in apply()
158 auto es=compare.equal_subtree(parn2, tr.begin(sib)); in apply()
162 auto es=compare.equal_subtree(tr.begin(parn2), sib); in apply()
166 auto es=compare.equal_subtree(parn2, sib); in apply()
H A Dsort_product.cc67 auto es = compare.equal_subtree(one, two); in apply()
145 auto es=compare.equal_subtree(one, two); in apply()
198 auto es=compare.equal_subtree(one, two); in apply()
H A Dfactor_out.cc70 auto match=comparator.equal_subtree(fac, to_factor_out[i].begin()); in apply()
91 auto match=comparator.equal_subtree(fac, to_factor_out[i].begin()); in apply()
H A Dunwrap.cc46 if(comp.equal_subtree(w.begin(), it)==Ex_comparator::match_t::subtree_match) { in can_apply()
89 auto stc=comp.equal_subtree(prevwedfac, fac); in apply_on_wedge()
H A Dsort_spinors.cc73 …auto cmp = comp.equal_subtree(one, two);// auto cmp=subtree_compare(&kernel.properties, one, two… in apply()
H A Duntrace.cc83 auto es=compare.equal_subtree(st, st2); in apply()
H A Devaluate.cc488 if(tr.equal_subtree(iv1, iv2)) { in merge_component_children()
564 if(tr.equal_subtree(lhs1, lhs2)) { in merge_components()
773 …if(comp.equal_subtree(allowed.begin(), obj.begin(), Ex_comparator::useprops_t::never, true)<=Ex_co… in handle_derivative()
1281 if(tr.equal_subtree(ivalue1,ivalue2)) { in handle_prod()
1344 if(tr.equal_subtree(ivalue1,ivalue2)) { in handle_prod()
H A Drewrite_indices.cc100 Ex_comparator::match_t fnd = comp.equal_subtree(par, prefit, Ex_comparator::useprops_t::never); in apply()
H A Dproduct_rule.cc214 auto stc=comp.equal_subtree(emptyD.begin(), repch); in apply()
H A Dintegrate_by_parts.cc71 if( is_in( comp.equal_subtree(top, arg), { in derivative_acting_on_arg()
/dports/math/cadabra2/cadabra2-2.3.6.8/core/
H A DCompare.cc287 auto ret = equal_subtree(i1, i2); in match_subtree()
769 return report(equal_subtree((*loc).second,two,use_props)); in compare()
921 auto match = equal_subtree(tofind, start); in match_subproduct()
1015 auto match = equal_subtree(tofind, start); in match_subsum()
1142 auto es=equal_subtree(one,two); in can_move_adjacent()
1155 auto es=equal_subtree(two,probe); in can_move_adjacent()
1167 auto es=equal_subtree(one,probe); in can_move_adjacent()
1240 auto es=equal_subtree(i2, probe); in can_move_adjacent()
1252 auto es=equal_subtree(i2, *f); in can_move_adjacent()
1312 auto es=equal_subtree(sib, obj); in can_swap_prod_obj()
[all …]
H A DExNode.cc484 auto ret=comp.equal_subtree(ex->begin(), other.it); in Ex_matches()
492 auto ret=comp.equal_subtree(ex->begin(), other->begin()); in Ex_matches_Ex()
500 auto ret=comp.equal_subtree(one.it, two.it); in ExNode_less()
508 auto ret=comp.equal_subtree(one.it, two.it); in ExNode_greater()
H A DExchange.cc67 auto match = comp.equal_subtree(truetensor2, truetensor); in collect_identical_tensors()
H A DCompare.hh236 match_t equal_subtree(Ex::iterator i1, Ex::iterator i2,
H A DAdjform.cc311 auto res = comp.equal_subtree(a, b); in compare()
353 auto res = comp->equal_subtree(index, beg, Ex_comparator::useprops_t::never, true); in get_free_index()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/algo/structure/cd_utils/
H A Dtree_msvc7.hpp296 bool equal_subtree(const iter& one, const iter& two) const;
298 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1194 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1197 return equal_subtree(one_, two_, comp); in equal_subtree()
1221 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/finance/libofx/libofx-0.10.2/lib/
H A Dtree.hh342 bool equal_subtree(const iter& one, const iter& two) const;
344 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1353 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1356 return equal_subtree(one_, two_, comp); in equal_subtree()
1381 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/www/htmlcxx/htmlcxx-0.87/html/
H A Dtree.h297 bool equal_subtree(const iter& one, const iter& two) const;
299 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1205 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function
1208 return equal_subtree(one_, two_, comp); in equal_subtree()
1232 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function
/dports/devel/RStudio/rstudio-2021.09.1-372/src/cpp/core/include/core/collection/
H A DTree.hpp376 bool equal_subtree(const iter& one, const iter& two) const;
378 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1601 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1604 return equal_subtree(one_, two_, comp); in equal_subtree()
1628 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/math/liborigin/liborigin-3.0.1/
H A Dtree.hh393 bool equal_subtree(const iter& one, const iter& two) const;
395 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1548 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1551 return equal_subtree(one_, two_, comp); in equal_subtree()
1575 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/science/openbabel/openbabel-3.1.1/include/openbabel/tree/
H A Dtree.hh400 bool equal_subtree(const iter& one, const iter& two) const;
402 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1586 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1589 return equal_subtree(one_, two_, comp); in equal_subtree()
1613 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/graphics/gnash/gnash-2b3bdede0305c4fc3ad21a0a4197330606c9b880/libbase/
H A Dtree.hh356 bool equal_subtree(const iter& one, const iter& two) const;
358 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1581 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1584 return equal_subtree(one_, two_, comp); in equal_subtree()
1608 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree
/dports/math/cadabra2/cadabra2-2.3.6.8/client_server/
H A Dtree.hh369 bool equal_subtree(const iter& one, const iter& two) const;
371 bool equal_subtree(const iter& one, const iter& two, BinaryPredicate) const;
1742 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_) const in equal_subtree() function in tree
1745 return equal_subtree(one_, two_, comp); in equal_subtree()
1769 bool tree<T, tree_node_allocator>::equal_subtree(const iter& one_, const iter& two_, BinaryPredicat… in equal_subtree() function in tree

12