Home
last modified time | relevance | path

Searched refs:mod_prel (Results 1 – 2 of 2) sorted by relevance

/dports/math/cadabra2/cadabra2-2.3.6.8/core/
H A DCompare.hh58 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2,
65 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2);
68 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2);
71 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2,
75 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2,
80 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2);
83 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2);
86 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2,
90 int mod_prel=-2, bool checksets=true, int compare_multiplier=-2,
392 Ex_is_less(const Properties&, int mod_prel);
[all …]
H A DCompare.cc30 int mod_prel, bool, int compare_multiplier, bool literal_wildcards) in subtree_compare() argument
80 if(mod_prel<=-2) { in subtree_compare()
109 if(mod_prel==0) mod_prel=-2; in subtree_compare()
110 else if(mod_prel>0) --mod_prel; in subtree_compare()
119 int ret=subtree_compare(properties, sib1,sib2, mod_prel, true /* checksets */, in subtree_compare()
142 …return subtree_less(properties, one.begin(), two.begin(), mod_prel, checksets, compare_multiplier); in tree_less()
147 …return subtree_equal(properties, one.begin(), two.begin(), mod_prel, checksets, compare_multiplier… in tree_equal()
162 int cmp=subtree_compare(properties, one, two, mod_prel, checksets, compare_multiplier); in subtree_less()
169 int cmp=subtree_compare(properties, one, two, mod_prel, checksets, compare_multiplier); in subtree_equal()
1699 : properties(k), mod_prel(mp) in Ex_is_less()
[all …]