| /dports/math/py-brial/BRiAl-1.2.10/groebner/src/ |
| H A D | polynomial_properties.cc | 19 Polynomial::navigator p_nav=p.navigation(); in do_is_rewriteable() local
20 idx_type p_i=*p_nav; in do_is_rewriteable()
30 while(((p_i=*p_nav)<l_i)&& (p_nav.elseBranch().isEmpty())){ in do_is_rewriteable()
31 p_nav.incrementThen(); in do_is_rewriteable()
34 …while((!(p_nav.isConstant()))&&(l_i==p_i) &&(p_nav.elseBranch().isEmpty()) && (l_nav.elseBranch().… in do_is_rewriteable()
35 p_nav.incrementThen(); in do_is_rewriteable()
38 p_i=*p_nav; in do_is_rewriteable()
43 PBORI_ASSERT(p_i==*p_nav); in do_is_rewriteable()
55 PBORI_ASSERT(!(p_nav.isEmpty())); in do_is_rewriteable()
61 if (p_nav.isTerminated()){ in do_is_rewriteable()
[all …]
|
| H A D | interpolate.cc | 88 MonomialSet::navigator p_nav=s.navigation(); in zeros() local
98 while ((*p_nav)<index){ in zeros()
99 p_nav.incrementElse(); in zeros()
104 MonomialSet::navigator cached=cache_mgr.find(p_nav, can_nav); in zeros()
108 s=MonomialSet(cache_mgr.generate(p_nav)); in zeros()
123 cache_mgr.insert(p_nav,can_nav,result.navigation()); in zeros()
|
| H A D | nf.cc | 777 Polynomial::navigator p_nav=p.navigation(); in do_plug_1() local
778 if PBORI_UNLIKELY(p_nav.isConstant()) return p; in do_plug_1()
779 idx_type p_index=*p_nav; in do_plug_1()
784 PBORI_ASSERT (p_index==*p_nav); in do_plug_1()
789 cache_mgr.find(p_nav,m_nav); in do_plug_1()
795 MonomialSet p1(cache_mgr.generate(p_nav.thenBranch())); in do_plug_1()
798 MonomialSet p0=cache_mgr.generate(p_nav.elseBranch()); in do_plug_1()
804 …(p_index,do_plug_1(cache_mgr.generate(p_nav.thenBranch()),m_plus_ones).diagram(),do_plug_1(cache_m… in do_plug_1()
806 cache_mgr.insert(p_nav,m_nav,res.navigation()); in do_plug_1()
|
| /dports/math/brial/BRiAl-1.2.10/groebner/src/ |
| H A D | polynomial_properties.cc | 19 Polynomial::navigator p_nav=p.navigation(); in do_is_rewriteable() local
20 idx_type p_i=*p_nav; in do_is_rewriteable()
30 while(((p_i=*p_nav)<l_i)&& (p_nav.elseBranch().isEmpty())){ in do_is_rewriteable()
31 p_nav.incrementThen(); in do_is_rewriteable()
34 …while((!(p_nav.isConstant()))&&(l_i==p_i) &&(p_nav.elseBranch().isEmpty()) && (l_nav.elseBranch().… in do_is_rewriteable()
35 p_nav.incrementThen(); in do_is_rewriteable()
38 p_i=*p_nav; in do_is_rewriteable()
43 PBORI_ASSERT(p_i==*p_nav); in do_is_rewriteable()
55 PBORI_ASSERT(!(p_nav.isEmpty())); in do_is_rewriteable()
61 if (p_nav.isTerminated()){ in do_is_rewriteable()
[all …]
|
| H A D | interpolate.cc | 88 MonomialSet::navigator p_nav=s.navigation(); in zeros() local
98 while ((*p_nav)<index){ in zeros()
99 p_nav.incrementElse(); in zeros()
104 MonomialSet::navigator cached=cache_mgr.find(p_nav, can_nav); in zeros()
108 s=MonomialSet(cache_mgr.generate(p_nav)); in zeros()
123 cache_mgr.insert(p_nav,can_nav,result.navigation()); in zeros()
|
| H A D | nf.cc | 777 Polynomial::navigator p_nav=p.navigation(); in do_plug_1() local
778 if PBORI_UNLIKELY(p_nav.isConstant()) return p; in do_plug_1()
779 idx_type p_index=*p_nav; in do_plug_1()
784 PBORI_ASSERT (p_index==*p_nav); in do_plug_1()
789 cache_mgr.find(p_nav,m_nav); in do_plug_1()
795 MonomialSet p1(cache_mgr.generate(p_nav.thenBranch())); in do_plug_1()
798 MonomialSet p0=cache_mgr.generate(p_nav.elseBranch()); in do_plug_1()
804 …(p_index,do_plug_1(cache_mgr.generate(p_nav.thenBranch()),m_plus_ones).diagram(),do_plug_1(cache_m… in do_plug_1()
806 cache_mgr.insert(p_nav,m_nav,res.navigation()); in do_plug_1()
|
| /dports/math/py-brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
| H A D | LLReduction.h | 61 MonomialSet::navigator p_nav=p.navigation(); in operator() local
62 idx_type p_index=*p_nav; in operator()
71 MonomialSet::navigator cached = cache_mgr.find(p_nav, r_nav); in operator()
78 Polynomial p_nav_else(cache_mgr.generate(p_nav.elseBranch())); in operator()
79 Polynomial p_nav_then(cache_mgr.generate(p_nav.thenBranch())); in operator()
105 cache_mgr.insert(p_nav, r_nav, res.navigation()); in operator()
|
| /dports/math/brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
| H A D | LLReduction.h | 61 MonomialSet::navigator p_nav=p.navigation(); in operator() local
62 idx_type p_index=*p_nav; in operator()
71 MonomialSet::navigator cached = cache_mgr.find(p_nav, r_nav); in operator()
78 Polynomial p_nav_else(cache_mgr.generate(p_nav.elseBranch())); in operator()
79 Polynomial p_nav_then(cache_mgr.generate(p_nav.thenBranch())); in operator()
105 cache_mgr.insert(p_nav, r_nav, res.navigation()); in operator()
|
| /dports/games/flightgear/flightgear-2020.3.11/test_suite/system_tests/Navaids/ |
| H A D | testnavs.cxx | 40 SGPath p_nav = data.getFGRoot() / "/Navaids/default.nav"; in testNavs() local
42 current_navlist->init( p_nav ); in testNavs()
|
| /dports/math/brial/BRiAl-1.2.10/sage-brial/brial/ |
| H A D | ll.py | 16 p_nav = p.navigation()
17 assert p_nav.value() < reductors.navigation().value()
18 p_else = BooleSet(p_nav.else_branch(), p.ring())
21 return if_then_else(p_nav.value(), reductors, p_else)
|
| H A D | check_claims.py | 128 p_nav = p.navigation()
129 reductors = recursively_insert(p_nav.else_branch(), p_nav.value(),
|
| /dports/math/py-brial/BRiAl-1.2.10/sage-brial/brial/ |
| H A D | ll.py | 16 p_nav = p.navigation()
17 assert p_nav.value() < reductors.navigation().value()
18 p_else = BooleSet(p_nav.else_branch(), p.ring())
21 return if_then_else(p_nav.value(), reductors, p_else)
|
| H A D | check_claims.py | 128 p_nav = p.navigation()
129 reductors = recursively_insert(p_nav.else_branch(), p_nav.value(),
|