/dports/math/py-brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
H A D | LessWeightedLengthInStratModified.h | 24 inline wlen_type wlen_literal_exceptioned(const PolyEntry& e){ in wlen_literal_exceptioned() 25 wlen_type res=e.weightedLength; in wlen_literal_exceptioned() 47 wlen_type wa=wlen_literal_exceptioned((*strat)[a]); in operator() 48 wlen_type wb=wlen_literal_exceptioned((*strat)[b]); in operator() 54 wlen_type wa=wlen_literal_exceptioned((*strat)[a]); in operator() 55 wlen_type wb=wlen_literal_exceptioned((*strat)[b]); in operator()
|
H A D | PolynomialSugar.h | 67 wlen_type getLengthEstimation() const { 73 void add(const Polynomial p2, deg_type sugar2, wlen_type length){ 103 wlen_type eliminationLength() const{ 105 wlen_type res=1;
|
H A D | ShorterEliminationLength.h | 32 wlen_type el; 33 ShorterEliminationLength(const GroebnerStrategy& strat,wlen_type el){
|
H A D | ShorterEliminationLengthModified.h | 32 wlen_type el; 34 ShorterEliminationLengthModified(const GroebnerStrategy& strat,wlen_type el, deg_type lm_deg){
|
H A D | groebner_defs.h | 36 typedef long long wlen_type; typedef 38 typedef long wlen_type; typedef
|
H A D | LessCombinedManySizesInStrat.h | 43 wlen_type w1 = d1; in operator() 44 wlen_type w2 = d2; in operator()
|
H A D | PolyEntryBase.h | 56 wlen_type weightedLength;
|
H A D | PairLS.h | 46 wlen_type wlen;
|
H A D | groebner_alg.h | 57 Polynomial reduce_complete(const Polynomial &p, const PolyEntry& reductor, wlen_type &len);
|
H A D | PairE.h | 35 wlen_type wlen;
|
H A D | GroebnerStrategy.h | 200 bool shorterElimination(const MonomialSet& divisors, wlen_type el, in optRedTailInLastBlock()
|
/dports/math/brial/BRiAl-1.2.10/groebner/include/polybori/groebner/ |
H A D | LessWeightedLengthInStratModified.h | 24 inline wlen_type wlen_literal_exceptioned(const PolyEntry& e){ in wlen_literal_exceptioned() 25 wlen_type res=e.weightedLength; in wlen_literal_exceptioned() 47 wlen_type wa=wlen_literal_exceptioned((*strat)[a]); in operator() 48 wlen_type wb=wlen_literal_exceptioned((*strat)[b]); in operator() 54 wlen_type wa=wlen_literal_exceptioned((*strat)[a]); in operator() 55 wlen_type wb=wlen_literal_exceptioned((*strat)[b]); in operator()
|
H A D | PolynomialSugar.h | 67 wlen_type getLengthEstimation() const { in getLengthEstimation() 73 void add(const Polynomial p2, deg_type sugar2, wlen_type length){ in add() 103 wlen_type eliminationLength() const{ in eliminationLength() 105 wlen_type res=1; in eliminationLength()
|
H A D | ShorterEliminationLength.h | 32 wlen_type el; 33 ShorterEliminationLength(const GroebnerStrategy& strat,wlen_type el){ in ShorterEliminationLength()
|
H A D | ShorterEliminationLengthModified.h | 32 wlen_type el; 34 ShorterEliminationLengthModified(const GroebnerStrategy& strat,wlen_type el, deg_type lm_deg){ in ShorterEliminationLengthModified()
|
H A D | groebner_defs.h | 36 typedef long long wlen_type; typedef 38 typedef long wlen_type; typedef
|
H A D | LessCombinedManySizesInStrat.h | 43 wlen_type w1 = d1; in operator() 44 wlen_type w2 = d2; in operator()
|
H A D | PolyEntryBase.h | 56 wlen_type weightedLength;
|
H A D | PairLS.h | 46 wlen_type wlen;
|
H A D | groebner_alg.h | 57 Polynomial reduce_complete(const Polynomial &p, const PolyEntry& reductor, wlen_type &len);
|
H A D | PairE.h | 35 wlen_type wlen;
|
/dports/math/py-brial/BRiAl-1.2.10/groebner/src/ |
H A D | nf.cc | 74 wlen_type dummy; in nf3() 136 wlen_type dummy; in nf3_no_deg_growth() 166 { wlen_type dummy; in nf3_degree_order() 200 wlen_type dummy; in nf3_short() 333 wlen_type new_len=curr[i].getLengthEstimation(); in step_S() 399 wlen_type pivot_el; in step_S_T() 405 wlen_type comp=//curr[i].value().nNodes(); in step_S_T() 430 wlen_type pivot_len=curr[found].value().length(); in step_S_T() 461 wlen_type pivot_el; in step_T_simple() 466 wlen_type comp=curr[i].eliminationLength(); in step_T_simple() [all …]
|
/dports/math/brial/BRiAl-1.2.10/groebner/src/ |
H A D | nf.cc | 74 wlen_type dummy; in nf3() 136 wlen_type dummy; in nf3_no_deg_growth() 166 { wlen_type dummy; in nf3_degree_order() 200 wlen_type dummy; in nf3_short() 333 wlen_type new_len=curr[i].getLengthEstimation(); in step_S() 399 wlen_type pivot_el; in step_S_T() 405 wlen_type comp=//curr[i].value().nNodes(); in step_S_T() 430 wlen_type pivot_len=curr[found].value().length(); in step_S_T() 461 wlen_type pivot_el; in step_T_simple() 466 wlen_type comp=curr[i].eliminationLength(); in step_T_simple() [all …]
|
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/ |
H A D | tgb.cc | 199 wlen_type c; in pSLength() 209 return (wlen_type) c *(wlen_type) l /*pLength(p) */ ; in pSLength() 224 wlen_type c; in kSBucketLength() 285 wlen_type erg = l; in pSLength() 296 wlen_type s = 0; in kSBucketLength() 450 wlen_type s = 0; in do_pELength() 475 wlen_type s = 0; in pELength() 496 wlen_type s = 0; in kEBucketLength() 552 wlen_type cs; in pQuality() 595 wlen_type s = 0; in guess_quality() [all …]
|
/dports/math/singular/Singular-Release-4-2-1/Singular/ |
H A D | claptmpl.cc | 89 template int pos_helper(kStrategy strat, poly p, wlen_type len, wlen_set setL, polyset set);
|