Home
last modified time | relevance | path

Searched refs:elseBranch (Results 1 – 25 of 270) sorted by relevance

1234567891011

/dports/databases/akonadi/akonadi-21.12.3/src/server/storage/
H A Dquery.cpp59 Case::Case(const Condition &when, const QString &then, const QString &elseBranch) in Case() argument
62 setElse(elseBranch); in Case()
65 …&column, CompareOperator op, const QVariant &value, const QString &when, const QString &elseBranch) in Case() argument
68 setElse(elseBranch); in Case()
90 void Case::setElse(const QString &elseBranch) in setElse() argument
92 mElse = elseBranch; in setElse()
H A Dquery.h126 Case(const Condition &when, const QString &then, const QString &elseBranch = QString());
127 …areOperator op, const QVariant &value, const QString &when, const QString &elseBranch = QString());
133 void setElse(const QString &elseBranch);
/dports/math/py-brial/BRiAl-1.2.10/libbrial/include/polybori/routines/
H A Dpbori_routines_misc.h69 deg = std::max(deg, dd_cached_degree(cache, navi.elseBranch()) ); in stable_hash_range()
218 navigator as0 = firstNavi.elseBranch();
225 bs0 = secondNavi.elseBranch();
303 PBORI_ASSERT(monomNavi.elseBranch().isEmpty());
336 navigator naviElse = navi.elseBranch();
416 navigator naviElse = navi.elseBranch();
613 NaviType thenNavi(navi.thenBranch()), elseNavi(navi.elseBranch());
652 PBORI_ASSERT(monomNavi.elseBranch().isEmpty());
764 result *= cached_used_vars(cache, navi.elseBranch(), init);
829 return dd_owns(navi.elseBranch(), start, finish) &&
[all …]
H A Dpbori_algo.h191 NaviType elsenode = navi.elseBranch(); in dd_owns_term_of_indices()
232 dd_intersect_some_index(navi.elseBranch(), start, finish, in dd_intersect_some_index()
249 navi = navi.elseBranch(); in dd_intersect_some_index()
272 dd_print(navi.elseBranch()); in dd_print()
355 NaviType rhselse = rhs.elseBranch(); in dd_modulo_monomials()
364 navi.elseBranch(), rhselse, init) in dd_modulo_monomials()
392 NaviType ms0 = navi.elseBranch(); in dd_minimal_elements()
773 if (!navi.elseBranch().isEmpty()) in dd_is_singleton()
786 if (!navi.elseBranch().isEmpty()) in dd_pair_check()
787 return dd_is_singleton(navi.elseBranch()) && in dd_pair_check()
[all …]
H A Dpbori_algorithms.h72 lower_term_accumulate(navi.elseBranch(), lstart, lfinish, init);
121 return BooleSet(*navi, resthen.navigation(), navi.elseBranch(), init.ring());
153 lower_term_accumulate(navi.elseBranch(), lstart, lfinish, init);
252 SetType(*(map.elseBranch()),
254 dd_mapping(cache, navi.elseBranch(), map.thenBranch(), init)
H A Dpbori_routines_cuddext.h45 dd_long_count_step(cache, navi.elseBranch()); in dd_long_count_step()
63 dd_long_count<IntType, NaviType>(navi.elseBranch()); in dd_long_count_without_cache()
/dports/math/brial/BRiAl-1.2.10/libbrial/include/polybori/routines/
H A Dpbori_routines_misc.h69 deg = std::max(deg, dd_cached_degree(cache, navi.elseBranch()) ); in dd_cached_degree()
218 navigator as0 = firstNavi.elseBranch(); in dd_multiply()
225 bs0 = secondNavi.elseBranch(); in dd_multiply()
303 PBORI_ASSERT(monomNavi.elseBranch().isEmpty()); in dd_multiply_recursively_monom()
336 navigator naviElse = navi.elseBranch(); in dd_multiply_recursively_monom()
416 navigator naviElse = navi.elseBranch(); in dd_multiply_recursively_exp()
613 NaviType thenNavi(navi.thenBranch()), elseNavi(navi.elseBranch()); in dd_existential_abstraction()
652 PBORI_ASSERT(monomNavi.elseBranch().isEmpty()); in dd_divide_recursively()
764 result *= cached_used_vars(cache, navi.elseBranch(), init); in cached_used_vars()
829 return dd_owns(navi.elseBranch(), start, finish) && in dd_contains_divs_of_dec_deg()
[all …]
H A Dpbori_algo.h191 NaviType elsenode = navi.elseBranch(); in dd_owns_term_of_indices()
232 dd_intersect_some_index(navi.elseBranch(), start, finish, in dd_intersect_some_index()
249 navi = navi.elseBranch(); in dd_intersect_some_index()
272 dd_print(navi.elseBranch()); in dd_print()
355 NaviType rhselse = rhs.elseBranch(); in dd_modulo_monomials()
364 navi.elseBranch(), rhselse, init) in dd_modulo_monomials()
392 NaviType ms0 = navi.elseBranch(); in dd_minimal_elements()
773 if (!navi.elseBranch().isEmpty()) in dd_is_singleton()
786 if (!navi.elseBranch().isEmpty()) in dd_pair_check()
787 return dd_is_singleton(navi.elseBranch()) && in dd_pair_check()
[all …]
H A Dpbori_algorithms.h72 lower_term_accumulate(navi.elseBranch(), lstart, lfinish, init); in lower_term_accumulate()
121 return BooleSet(*navi, resthen.navigation(), navi.elseBranch(), init.ring()); in upper_term_accumulate()
153 lower_term_accumulate(navi.elseBranch(), lstart, lfinish, init); in term_accumulate()
252 SetType(*(map.elseBranch()), in dd_mapping()
254 dd_mapping(cache, navi.elseBranch(), map.thenBranch(), init) in dd_mapping()
H A Dpbori_routines_cuddext.h45 dd_long_count_step(cache, navi.elseBranch()); in dd_long_count_step()
63 dd_long_count<IntType, NaviType>(navi.elseBranch()); in dd_long_count_without_cache()
/dports/math/py-brial/BRiAl-1.2.10/groebner/src/
H A Dpolynomial_properties.cc30 while(((p_i=*p_nav)<l_i)&& (p_nav.elseBranch().isEmpty())){ in do_is_rewriteable()
34 …while((!(p_nav.isConstant()))&&(l_i==p_i) &&(p_nav.elseBranch().isEmpty()) && (l_nav.elseBranch().… in do_is_rewriteable()
80 Polynomial p0=cache_mgr.generate(p_nav.elseBranch()); in do_is_rewriteable()
92 MonomialSet l0=cache_mgr.generate(l_nav.elseBranch()); in do_is_rewriteable()
H A DLiteralFactorization.cc35 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) &&(*nav<x_idx)){ in do_has_factor_x()
42 return Polynomial(nav.elseBranch().isEmpty(), m.ring()); in do_has_factor_x()
57 Polynomial res0=do_has_factor_x(cache_mgr.generate(nav.elseBranch()),x); in do_has_factor_x()
87 (nav_r.elseBranch().isEmpty()), left.ring()); in do_left_equals_right_x_branch_and_r_has_fac_x()
101 …t_x_branch_and_r_has_fac_x(cache_mgr.generate(nav_l.elseBranch()),cache_mgr.generate(nav_r.elseBra… in do_left_equals_right_x_branch_and_r_has_fac_x()
119 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) && (*nav<min_idx)){ in do_has_factor_x_plus_y()
131 MonomialSet::dd_type(m.ring(), nav.elseBranch()), in do_has_factor_x_plus_y()
150 res0=do_has_factor_x_plus_y(cache_mgr.generate(nav.elseBranch()), in do_has_factor_x_plus_y()
168 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) &&(*nav<x_idx)){ in do_has_factor_x_plus_one()
175 return Polynomial(nav.elseBranch()==nav.thenBranch(), m.ring()); in do_has_factor_x_plus_one()
[all …]
H A Dgroebner_alg.cc65 MonomialSet::navigator a_e=a.elseBranch(); in mod_var_set()
120 tmp.navigation(), v.elseBranch()), in mod_deg2_set()
121 mod_deg2_set(cache_mgr, a.elseBranch(), v.elseBranch()) in mod_deg2_set()
128 mod_deg2_set(cache_mgr, a.elseBranch(), v) ); in mod_deg2_set()
359 MonomialSet( m.elseBranch(), in recursively_insert()
393 map_every_x_to_x_plus_one(cache_mgr, nav.elseBranch()) + in map_every_x_to_x_plus_one()
/dports/math/brial/BRiAl-1.2.10/groebner/src/
H A Dpolynomial_properties.cc30 while(((p_i=*p_nav)<l_i)&& (p_nav.elseBranch().isEmpty())){ in do_is_rewriteable()
34 …while((!(p_nav.isConstant()))&&(l_i==p_i) &&(p_nav.elseBranch().isEmpty()) && (l_nav.elseBranch().… in do_is_rewriteable()
80 Polynomial p0=cache_mgr.generate(p_nav.elseBranch()); in do_is_rewriteable()
92 MonomialSet l0=cache_mgr.generate(l_nav.elseBranch()); in do_is_rewriteable()
H A DLiteralFactorization.cc35 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) &&(*nav<x_idx)){ in do_has_factor_x()
42 return Polynomial(nav.elseBranch().isEmpty(), m.ring()); in do_has_factor_x()
57 Polynomial res0=do_has_factor_x(cache_mgr.generate(nav.elseBranch()),x); in do_has_factor_x()
87 (nav_r.elseBranch().isEmpty()), left.ring()); in do_left_equals_right_x_branch_and_r_has_fac_x()
101 …t_x_branch_and_r_has_fac_x(cache_mgr.generate(nav_l.elseBranch()),cache_mgr.generate(nav_r.elseBra… in do_left_equals_right_x_branch_and_r_has_fac_x()
119 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) && (*nav<min_idx)){ in do_has_factor_x_plus_y()
131 MonomialSet::dd_type(m.ring(), nav.elseBranch()), in do_has_factor_x_plus_y()
150 res0=do_has_factor_x_plus_y(cache_mgr.generate(nav.elseBranch()), in do_has_factor_x_plus_y()
168 while((!(nav.isConstant())) && (nav.elseBranch().isEmpty()) &&(*nav<x_idx)){ in do_has_factor_x_plus_one()
175 return Polynomial(nav.elseBranch()==nav.thenBranch(), m.ring()); in do_has_factor_x_plus_one()
[all …]
H A Dgroebner_alg.cc65 MonomialSet::navigator a_e=a.elseBranch(); in mod_var_set()
120 tmp.navigation(), v.elseBranch()), in mod_deg2_set()
121 mod_deg2_set(cache_mgr, a.elseBranch(), v.elseBranch()) in mod_deg2_set()
128 mod_deg2_set(cache_mgr, a.elseBranch(), v) ); in mod_deg2_set()
359 MonomialSet( m.elseBranch(), in recursively_insert()
393 map_every_x_to_x_plus_one(cache_mgr, nav.elseBranch()) + in map_every_x_to_x_plus_one()
/dports/math/dune-common/dune-common-df65b1282ea89ad40d2cb6565983f7e633ccce31/dune/common/
H A Dhybridutilities.hh410 …std::integer_sequence<T>, const Value& /*value*/, Branches&& /*branches*/, ElseBranch&& elseBranch) in switchCases() argument
412 return elseBranch(); in switchCases()
416 …::integer_sequence<T, t0, tt...>, const Value& value, Branches&& branches, ElseBranch&& elseBranch) in switchCases() argument
423 …turn Impl::switchCases<Result>(id(std::integer_sequence<T, tt...>()), value, branches, elseBranch); in switchCases()
459 …) switchCases(const Cases& cases, const Value& value, Branches&& branches, ElseBranch&& elseBranch) in switchCases() argument
461 …Impl::switchCases<decltype(elseBranch())>(cases, value, std::forward<Branches>(branches), std::for… in switchCases()
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/mongo/db/matcher/schema/
H A Dexpression_internal_schema_cond.cpp41 : elseBranch()->matches(doc, details); in matches()
48 : elseBranch()->matchesSingleElement(elem, details); in matchesSingleElement()
/dports/devel/cppcheck-gui/cppcheck-2.6.3/lib/
H A Dforwardanalyzer.cpp622 std::tie(thenBranch.check, elseBranch.check) = evalCond(condTok); in updateRange()
633 } else if (!elseBranch.check) { in updateRange()
639 … elseBranch.escape = isEscapeScope(endBlock->linkAt(2), elseBranch.escapeUnknown); in updateRange()
640 if (elseBranch.check) { in updateRange()
645 if (checkBranch(elseBranch)) 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()
675 if (thenBranch.isInconclusive() || elseBranch.isInconclusive()) { in updateRange()
678 } else if (thenBranch.isModified() || elseBranch.isModified()) { in updateRange()
[all …]
/dports/devel/cppcheck/cppcheck-2.6.3/lib/
H A Dforwardanalyzer.cpp622 std::tie(thenBranch.check, elseBranch.check) = evalCond(condTok); in updateRange()
633 } else if (!elseBranch.check) { in updateRange()
639 … elseBranch.escape = isEscapeScope(endBlock->linkAt(2), elseBranch.escapeUnknown); in updateRange()
640 if (elseBranch.check) { in updateRange()
645 if (checkBranch(elseBranch)) 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()
675 if (thenBranch.isInconclusive() || elseBranch.isInconclusive()) { in updateRange()
678 } else if (thenBranch.isModified() || elseBranch.isModified()) { in updateRange()
[all …]
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/mgechev/revive/rule/
H A Didentical-branches.go47 elseBranch, ok := n.Else.(*ast.BlockStmt)
51 branches = append(branches, elseBranch)
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/include/clang/Tooling/Transformer/
H A DRangeSelector.h84 RangeSelector elseBranch(std::string ID);
101 using transformer::elseBranch;
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/include/clang/Tooling/Transformer/
H A DRangeSelector.h84 RangeSelector elseBranch(std::string ID);
101 using transformer::elseBranch;
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/python/dune/source/
H A Dcplusplus.py217 def __init__(self, condition, thenBranch, elseBranch=None, constexpr=False): argument
221 if elseBranch is not None:
222 self.elseBranch = Block()
223 self.elseBranch.append(elseBranch)
225 self.elseBranch = None
438 if src.elseBranch is not None:
440 self.emit(src.elseBranch,indent)
/dports/math/brial/BRiAl-1.2.10/tests/
H A DSetFactoryTest.cc82 poly.navigation().elseBranch(), ring), poly.set()); in BOOST_AUTO_TEST_CASE()
86 poly.navigation().elseBranch()), poly.set()); in BOOST_AUTO_TEST_CASE()

1234567891011