| /dports/math/singular/Singular-Release-4-2-1/libpolys/polys/ |
| H A D | pDebug.cc | 367 _pPolyAssume(p_GetShortExpVector(p1, r_1) == sev_1, p1, r_1); in pDebugLmShortDivisibleBy()
368 _pPolyAssume(p_GetShortExpVector(p2, r_2) == ~ not_sev_2, p2, r_2); in pDebugLmShortDivisibleBy()
391 _pPolyAssume(p_GetShortExpVector(p1, r_1) == sev_1, p1, r_1); in pDebugLmShortDivisibleByNoComp()
392 _pPolyAssume(p_GetShortExpVector(p2, r_2) == ~ not_sev_2, p2, r_2); in pDebugLmShortDivisibleByNoComp()
|
| /dports/math/singular/Singular-Release-4-2-1/libpolys/polys/monomials/ |
| H A D | p_polys.h | 51 unsigned long p_GetShortExpVector(const poly a, const ring r);
54 unsigned long p_GetShortExpVector(const poly p, const poly pp, const ring r);
1903 _pPolyAssume2(p_GetShortExpVector(a, r) == sev_a, a, r); in p_LmShortDivisibleBy()
1904 _pPolyAssume2(p_GetShortExpVector(b, r) == ~ not_sev_b, b, r); in p_LmShortDivisibleBy()
1923 _pPolyAssume2(p_GetShortExpVector(a, r) == sev_a, a, r); in p_LmShortDivisibleByNoComp()
1924 _pPolyAssume2(p_GetShortExpVector(b, r) == ~ not_sev_b, b, r); in p_LmShortDivisibleByNoComp()
1943 _pPolyAssume2(p_GetShortExpVector(a, r_a) == sev_a, a, r_a); in p_LmShortDivisibleBy()
1944 _pPolyAssume2(p_GetShortExpVector(b, r_b) == ~ not_sev_b, b, r_b); in p_LmShortDivisibleBy()
|
| H A D | p_polys.cc | 4809 unsigned long p_GetShortExpVector(const poly p, const ring r) in p_GetShortExpVector() function
4861 unsigned long p_GetShortExpVector(const poly p, const poly pp, const ring r) in p_GetShortExpVector() function
|
| /dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/ |
| H A D | syz4.cc | 106 = (lt_struct){a, p_GetShortExpVector(a, R), k}; in initialize_hash()
131 const unsigned long q_not_sev = ~p_GetShortExpVector(q, r); in find_reducer()
|
| H A D | kstd2.cc | 99 pAssume(~not_sev == p_GetShortExpVector(p, r)); in kFindSameLMInT_Z()
155 pAssume(~not_sev == p_GetShortExpVector(p, r)); in kTestDivisibleByT0_Z()
222 pAssume(~not_sev == p_GetShortExpVector(p, r)); in kFindDivisibleByInT_Z()
301 pAssume(~not_sev == p_GetShortExpVector(p, r)); in kFindDivisibleByInT()
404 pAssume(~not_sev == p_GetShortExpVector(p, currRing)); in kFindDivisibleByInS()
473 pAssume(~not_sev == p_GetShortExpVector(p, currRing)); in kFindNextDivisibleByInS()
3286 strat->P.sevSig = p_GetShortExpVector(strat->P.sig,currRing); in sba()
3343 Q.sevSig = p_GetShortExpVector(Q.sig,currRing); in sba()
|
| H A D | kInline.h | 762 sev = p_GetShortExpVector(t_p, tailRing); in SetShortExpVector()
766 sev = p_GetShortExpVector(p, currRing); in SetShortExpVector()
|
| H A D | kutil.cc | 971 if (p_GetShortExpVector(p, r) != L->sev) in kTest_L()
2515 pSigMultNegSev = ~p_GetShortExpVector(pSigMult,currRing); in enterOnePairSig()
2517 sSigMultNegSev = ~p_GetShortExpVector(sSigMult,currRing); in enterOnePairSig()
2803 pSigMultNegSev = ~p_GetShortExpVector(pSigMult,currRing); in enterOnePairSigRing()
2857 Lp.sev = p_GetShortExpVector(Lp.p,currRing); in enterOnePairSigRing()
2892 Lp.sevSig = p_GetShortExpVector(Lp.sig,currRing); in enterOnePairSigRing()
2953 Lp.sev = p_GetShortExpVector(Lp.p,currRing); in enterOnePairSigRing()
6936 assume(~not_sev == p_GetShortExpVector(p, r)); in kFindDivisibleByInS_T()
7100 Ln.sev = p_GetShortExpVector(hn, strat->tailRing); in redtail()
8252 Q.sevSig = p_GetShortExpVector(Q.sig,currRing); in initSyzRules()
[all …]
|
| H A D | tgb.cc | 1111 long neg_bounds_short = ~p_GetShortExpVector (bound, c->r); in make_connections()
1534 c->short_Exps[i] = p_GetShortExpVector (h, c->r); in add_to_basis_ideal_quotient()
1611 p_GetShortExpVector (short_s, in add_to_basis_ideal_quotient()
2489 unsigned long sev = p_GetShortExpVector (t, currRing); in noro_red_mon()
5019 sev = p_GetShortExpVector (red, c->r); in multi_reduce_step()
|
| H A D | tgb_internal.h | 759 unsigned long sev=p_GetShortExpVector(t,currRing); in noro_red_mon_to_non_poly()
|
| /dports/math/singular/Singular-Release-4-2-1/kernel/ |
| H A D | polys.h | 152 #define pGetShortExpVector(a) p_GetShortExpVector(a, currRing)
|