Home
last modified time | relevance | path

Searched refs:n_IsMOne (Results 1 – 11 of 11) sorted by relevance

/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/
H A Dpolys0.cc36 && (!n_IsMOne(pGetCoeff(p),C)) in writemon()
50 else if (n_IsMOne(pGetCoeff(p),C)) in writemon()
115 && (!n_IsMOne(pGetCoeff(p),C)) in writemonLP()
124 else if (n_IsMOne(pGetCoeff(p),C)) in writemonLP()
H A Dcoeffrings.h22 static FORCE_INLINE BOOLEAN n_IsMOne(number n, const ring r){ return n_IsMOne(n,r->cf); } in n_IsMOne() function
H A Dkbuckets.cc1298 return (n_IsOne(n,r->cf) || n_IsMOne(n,r->cf)); in nIsPseudoUnit()
/dports/math/singular/Singular-Release-4-2-1/libpolys/coeffs/
H A Dnumstats.h49 FUN(n_IsMOne); \
H A Dnumbers.h26 #define nIsMOne(n) n_IsMOne(n, currRing->cf)
H A Dcoeffs.h473 static FORCE_INLINE BOOLEAN n_IsMOne(number n, const coeffs r) in n_IsMOne() function
474 { STATISTIC(n_IsMOne); assume(r != NULL); assume(r->cfIsMOne!=NULL); return r->cfIsMOne(n,r); } in n_IsMOne()
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/nc/
H A Dold.gring.cc1384 if (!n_IsMOne(cF,r->cf)) in gnc_ReduceSpolyOld()
1452 if (!n_IsMOne(cF,r->cf)) // ??? in gnc_ReduceSpolyNew()
1527 if (n_IsMOne(C1,r->cf)) in gnc_CreateSpolyOld()
1932 if (!n_IsMOne(n, r->cf)) in gnc_kBucketPolyRedOld()
1998 …if (!n_IsMOne(n, r->cf) ) // does this improve performance??!? also see below... // TODO: check la… in gnc_kBucketPolyRedNew()
2114 if (!n_IsMOne(n, r->cf)) in nc_PolyPolyRedOld()
2212 if (!n_IsMOne(n, r->cf)) // TODO: as above. in nc_PolyPolyRedNew()
H A Dsca.cc997 if( n_IsMOne(c, rBase->cf) ) // !!!??? in sca_SetupQuotient()
1035 if( !n_IsMOne(c, rBase->cf) ) in sca_SetupQuotient()
H A DncSAFormula.cc163 if( n_IsMOne(q, r->cf) ) // anti-commutative in AnalyzePairType()
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/ext_fields/
H A Dalgext.cc328 return n_IsMOne(p_GetCoeff(aAsPoly, naRing), naCoeffs); in naIsMOne()
H A Dtransext.cc687 return n_IsMOne(p_GetCoeff(g, ntRing), ntCoeffs); in ntIsMOne()