| /dports/math/py-brial/BRiAl-1.2.10/libbrial/include/polybori/routines/ |
| H A D | pbori_routines_misc.h | 66 deg_type deg = dd_cached_degree(cache, navi.thenBranch()) + 1; in stable_hash_range()
219 navigator as1 = firstNavi.thenBranch();
226 bs1 = secondNavi.thenBranch();
334 navigator monomThen = monomNavi.thenBranch();
335 navigator naviThen = navi.thenBranch();
415 navigator naviThen = navi.thenBranch();
490 NaviType then_branch = navi.thenBranch();
676 navigator monomThen = monomNavi.thenBranch();
677 navigator naviThen = navi.thenBranch();
728 navigator naviThen = navi.thenBranch();
[all …]
|
| H A D | pbori_algorithms.h | 81 result = BooleSet(*navi, navi.thenBranch(), reselse.navigation(),
88 lower_term_accumulate(navi.thenBranch(), lstart, lfinish, init).diagram();
114 NaviType navithen = navi.thenBranch();
151 upper_term_accumulate(ustart, ufinish, navi.thenBranch(), init);
161 BooleSet resthen = term_accumulate(ustart, ufinish, navi.thenBranch(),
253 dd_mapping(cache, navi.thenBranch(), map.thenBranch(), init),
254 dd_mapping(cache, navi.elseBranch(), map.thenBranch(), init)
|
| H A D | pbori_algo.h | 78 result = dd_transform(navi.thenBranch(), then_binop(init, *navi), result, in dd_transform()
175 return dd_on_path(navi.thenBranch()) || dd_on_path(navi.elseBranch()); in dd_on_path()
200 dd_owns_term_of_indices(navi.thenBranch(), start, finish)) in dd_owns_term_of_indices()
238 dd_intersect_some_index(navi.thenBranch(), start, finish, in dd_intersect_some_index()
271 dd_print(navi.thenBranch()); in dd_print()
357 dd_modulo_monomials(cache_mgr, navi.thenBranch(), rhs.thenBranch(), init); in dd_modulo_monomials()
393 NaviType ms1 = navi.thenBranch(); in dd_minimal_elements()
436 if((navi.elseBranch() == navi.thenBranch()) || elsedd.blankness()){ in dd_minimal_elements()
654 return iter.thenBranch(); in increment_iteratorlike()
788 dd_is_singleton(navi.thenBranch()); in dd_pair_check()
[all …]
|
| H A D | pbori_routines_cuddext.h | 44 dd_long_count_step(cache, navi.thenBranch()) + in dd_long_count_step()
62 return dd_long_count<IntType, NaviType>(navi.thenBranch()) + in dd_long_count_without_cache()
|
| /dports/math/brial/BRiAl-1.2.10/libbrial/include/polybori/routines/ |
| H A D | pbori_routines_misc.h | 66 deg_type deg = dd_cached_degree(cache, navi.thenBranch()) + 1; in dd_cached_degree()
219 navigator as1 = firstNavi.thenBranch(); in dd_multiply()
226 bs1 = secondNavi.thenBranch(); in dd_multiply()
334 navigator monomThen = monomNavi.thenBranch(); in dd_multiply_recursively_monom()
335 navigator naviThen = navi.thenBranch(); in dd_multiply_recursively_monom()
415 navigator naviThen = navi.thenBranch(); in dd_multiply_recursively_exp()
490 NaviType then_branch = navi.thenBranch(); in dd_recursive_degree_lead()
676 navigator monomThen = monomNavi.thenBranch(); in dd_divide_recursively()
677 navigator naviThen = navi.thenBranch(); in dd_divide_recursively()
728 navigator naviThen = navi.thenBranch(); in dd_divide_recursively_exp()
[all …]
|
| H A D | pbori_algorithms.h | 81 result = BooleSet(*navi, navi.thenBranch(), reselse.navigation(), in lower_term_accumulate()
88 lower_term_accumulate(navi.thenBranch(), lstart, lfinish, init).diagram(); in lower_term_accumulate()
114 NaviType navithen = navi.thenBranch(); in upper_term_accumulate()
151 upper_term_accumulate(ustart, ufinish, navi.thenBranch(), init); in term_accumulate()
161 BooleSet resthen = term_accumulate(ustart, ufinish, navi.thenBranch(), in term_accumulate()
253 dd_mapping(cache, navi.thenBranch(), map.thenBranch(), init), in dd_mapping()
254 dd_mapping(cache, navi.elseBranch(), map.thenBranch(), init) in dd_mapping()
|
| H A D | pbori_algo.h | 78 result = dd_transform(navi.thenBranch(), then_binop(init, *navi), result, in dd_transform()
175 return dd_on_path(navi.thenBranch()) || dd_on_path(navi.elseBranch()); in dd_on_path()
200 dd_owns_term_of_indices(navi.thenBranch(), start, finish)) in dd_owns_term_of_indices()
238 dd_intersect_some_index(navi.thenBranch(), start, finish, in dd_intersect_some_index()
271 dd_print(navi.thenBranch()); in dd_print()
357 dd_modulo_monomials(cache_mgr, navi.thenBranch(), rhs.thenBranch(), init); in dd_modulo_monomials()
393 NaviType ms1 = navi.thenBranch(); in dd_minimal_elements()
436 if((navi.elseBranch() == navi.thenBranch()) || elsedd.blankness()){ in dd_minimal_elements()
654 return iter.thenBranch(); in increment_iteratorlike()
788 dd_is_singleton(navi.thenBranch()); in dd_pair_check()
[all …]
|
| H A D | pbori_routines_cuddext.h | 44 dd_long_count_step(cache, navi.thenBranch()) + in dd_long_count_step()
62 return dd_long_count<IntType, NaviType>(navi.thenBranch()) + in dd_long_count_without_cache()
|
| /dports/math/py-brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
| H A D | fixed_path_divisors.h | 107 result=do_fixed_path_divisors(cache_mgr, a_nav.thenBranch(), in do_fixed_path_divisors()
108 m_nav.thenBranch(), n_nav.thenBranch()); in do_fixed_path_divisors()
113 then_path=do_fixed_path_divisors(cache_mgr, a_nav.thenBranch(), in do_fixed_path_divisors()
114 m_nav.thenBranch(), n_nav); in do_fixed_path_divisors()
117 m_nav.thenBranch(), n_nav); in do_fixed_path_divisors()
|
| H A D | LLReduction.h | 79 Polynomial p_nav_then(cache_mgr.generate(p_nav.thenBranch())); in operator()
86 r_nav.thenBranch()); in operator()
89 Polynomial tmp1 = operator()(p_nav_else, r_nav.thenBranch()); in operator()
90 Polynomial tmp2 = operator()(p_nav_then, r_nav.thenBranch()); in operator()
93 operator()(r_nav_else, r_nav.thenBranch()) ); in operator()
|
| H A D | contained_variables.h | 40 MonomialSet::navigator check_nav=nav.thenBranch(); in contained_variables_cudd_style()
77 MonomialSet::navigator then_branch=nav.thenBranch(); in contained_deg2_cudd_style()
96 MonomialSet::navigator check_nav=nav.thenBranch(); in contained_variables()
|
| /dports/math/brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
| H A D | fixed_path_divisors.h | 107 result=do_fixed_path_divisors(cache_mgr, a_nav.thenBranch(), in do_fixed_path_divisors()
108 m_nav.thenBranch(), n_nav.thenBranch()); in do_fixed_path_divisors()
113 then_path=do_fixed_path_divisors(cache_mgr, a_nav.thenBranch(), in do_fixed_path_divisors()
114 m_nav.thenBranch(), n_nav); in do_fixed_path_divisors()
117 m_nav.thenBranch(), n_nav); in do_fixed_path_divisors()
|
| H A D | LLReduction.h | 79 Polynomial p_nav_then(cache_mgr.generate(p_nav.thenBranch())); in operator()
86 r_nav.thenBranch()); in operator()
89 Polynomial tmp1 = operator()(p_nav_else, r_nav.thenBranch()); in operator()
90 Polynomial tmp2 = operator()(p_nav_then, r_nav.thenBranch()); in operator()
93 operator()(r_nav_else, r_nav.thenBranch()) ); in operator()
|
| H A D | contained_variables.h | 40 MonomialSet::navigator check_nav=nav.thenBranch(); in contained_variables_cudd_style()
77 MonomialSet::navigator then_branch=nav.thenBranch(); in contained_deg2_cudd_style()
96 MonomialSet::navigator check_nav=nav.thenBranch(); in contained_variables()
|
| /dports/devel/cppcheck-gui/cppcheck-2.6.3/lib/ |
| H A D | forwardanalyzer.cpp | 619 Branch thenBranch{endBlock}; in updateRange() local
629 thenBranch.escape = isEscapeScope(endBlock, thenBranch.escapeUnknown); in updateRange()
630 if (thenBranch.check) { in updateRange()
634 if (checkBranch(thenBranch)) in updateRange()
644 } else if (!thenBranch.check) { in updateRange()
652 actions |= (thenBranch.action | elseBranch.action); in updateRange()
655 if (thenBranch.isDead() && elseBranch.isDead()) { in updateRange()
656 if (thenBranch.isModified() && elseBranch.isModified()) in updateRange()
663 if (thenBranch.isEscape() && !hasElse) { in updateRange()
664 if (!thenBranch.isConclusiveEscape()) { in updateRange()
[all …]
|
| /dports/devel/cppcheck/cppcheck-2.6.3/lib/ |
| H A D | forwardanalyzer.cpp | 619 Branch thenBranch{endBlock}; in updateRange() local
629 thenBranch.escape = isEscapeScope(endBlock, thenBranch.escapeUnknown); in updateRange()
630 if (thenBranch.check) { in updateRange()
634 if (checkBranch(thenBranch)) in updateRange()
644 } else if (!thenBranch.check) { in updateRange()
652 actions |= (thenBranch.action | elseBranch.action); in updateRange()
655 if (thenBranch.isDead() && elseBranch.isDead()) { in updateRange()
656 if (thenBranch.isModified() && elseBranch.isModified()) in updateRange()
663 if (thenBranch.isEscape() && !hasElse) { in updateRange()
664 if (!thenBranch.isConclusiveEscape()) { in updateRange()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/matcher/schema/ |
| H A D | expression_internal_schema_cond.cpp | 40 return condition()->matches(doc, details) ? thenBranch()->matches(doc, details) in matches()
47 ? thenBranch()->matchesSingleElement(elem, details) in matchesSingleElement()
|
| /dports/math/py-brial/BRiAl-1.2.10/groebner/src/ |
| H A D | groebner_alg.cc | 66 MonomialSet::navigator a_t=a.thenBranch(); in mod_var_set()
116 MonomialSet tmp = mod_var_set(cache_mgr.generate(a.thenBranch()), in mod_deg2_set()
117 cache_mgr.generate(v.thenBranch())); in mod_deg2_set()
127 mod_deg2_set(cache_mgr, a.thenBranch(), v), in mod_deg2_set()
358 return MonomialSet(*m,recursively_insert(mgr, p,idx,m.thenBranch()), in recursively_insert()
391 map_every_x_to_x_plus_one(cache_mgr, nav.thenBranch()); in map_every_x_to_x_plus_one()
398 nav.thenBranch()).diagram(), in map_every_x_to_x_plus_one()
|
| H A D | LiteralFactorization.cc | 60 res=do_has_factor_x(cache_mgr.generate(nav.thenBranch()),x); in do_has_factor_x()
86 return Polynomial((nav_r.thenBranch()==nav_l) && in do_left_equals_right_x_branch_and_r_has_fac_x()
104 …t_x_branch_and_r_has_fac_x(cache_mgr.generate(nav_l.thenBranch()),cache_mgr.generate(nav_r.thenBra… in do_left_equals_right_x_branch_and_r_has_fac_x()
130 MonomialSet::dd_type(m.ring(), nav.thenBranch()), in do_has_factor_x_plus_y()
154 res=do_has_factor_x_plus_y(cache_mgr.generate(nav.thenBranch()),x,y); in do_has_factor_x_plus_y()
175 return Polynomial(nav.elseBranch()==nav.thenBranch(), m.ring()); in do_has_factor_x_plus_one()
193 res=do_has_factor_x_plus_one(cache_mgr.generate(nav.thenBranch()), in do_has_factor_x_plus_one()
|
| H A D | polynomial_properties.cc | 81 Polynomial p1=cache_mgr.generate(p_nav.thenBranch()); in do_is_rewriteable()
93 MonomialSet l1=cache_mgr.generate(l_nav.thenBranch()); in do_is_rewriteable()
|
| /dports/math/brial/BRiAl-1.2.10/groebner/src/ |
| H A D | groebner_alg.cc | 66 MonomialSet::navigator a_t=a.thenBranch(); in mod_var_set()
116 MonomialSet tmp = mod_var_set(cache_mgr.generate(a.thenBranch()), in mod_deg2_set()
117 cache_mgr.generate(v.thenBranch())); in mod_deg2_set()
127 mod_deg2_set(cache_mgr, a.thenBranch(), v), in mod_deg2_set()
358 return MonomialSet(*m,recursively_insert(mgr, p,idx,m.thenBranch()), in recursively_insert()
391 map_every_x_to_x_plus_one(cache_mgr, nav.thenBranch()); in map_every_x_to_x_plus_one()
398 nav.thenBranch()).diagram(), in map_every_x_to_x_plus_one()
|
| H A D | LiteralFactorization.cc | 60 res=do_has_factor_x(cache_mgr.generate(nav.thenBranch()),x); in do_has_factor_x()
86 return Polynomial((nav_r.thenBranch()==nav_l) && in do_left_equals_right_x_branch_and_r_has_fac_x()
104 …t_x_branch_and_r_has_fac_x(cache_mgr.generate(nav_l.thenBranch()),cache_mgr.generate(nav_r.thenBra… in do_left_equals_right_x_branch_and_r_has_fac_x()
130 MonomialSet::dd_type(m.ring(), nav.thenBranch()), in do_has_factor_x_plus_y()
154 res=do_has_factor_x_plus_y(cache_mgr.generate(nav.thenBranch()),x,y); in do_has_factor_x_plus_y()
175 return Polynomial(nav.elseBranch()==nav.thenBranch(), m.ring()); in do_has_factor_x_plus_one()
193 res=do_has_factor_x_plus_one(cache_mgr.generate(nav.thenBranch()), in do_has_factor_x_plus_one()
|
| H A D | polynomial_properties.cc | 81 Polynomial p1=cache_mgr.generate(p_nav.thenBranch()); in do_is_rewriteable()
93 MonomialSet l1=cache_mgr.generate(l_nav.thenBranch()); in do_is_rewriteable()
|
| /dports/math/brial/BRiAl-1.2.10/tests/ |
| H A D | SetFactoryTest.cc | 81 poly.navigation().thenBranch(), in BOOST_AUTO_TEST_CASE()
85 poly.navigation().thenBranch(), in BOOST_AUTO_TEST_CASE()
|
| /dports/math/py-brial/BRiAl-1.2.10/tests/ |
| H A D | SetFactoryTest.cc | 81 poly.navigation().thenBranch(), in BOOST_AUTO_TEST_CASE()
85 poly.navigation().thenBranch(), in BOOST_AUTO_TEST_CASE()
|