Home
last modified time | relevance | path

Searched refs:m_nfCharQ (Results 1 – 4 of 4) sorted by relevance

/dports/math/singular/Singular-Release-4-2-1/libpolys/coeffs/
H A Dffields.cc128 } while (i<r->m_nfCharQ); in nfDBTest()
177 if (((long)a == (long)r->m_nfCharQ) || ((long)b == (long)r->m_nfCharQ)) in nfMult()
282 if (R->m_nfPlus1Table[zab]==R->m_nfCharQ) r=(long)R->m_nfCharQ; /*if z^(a-b)+1 =0*/ in nfAdd()
489 if ((long)a == (long)r->m_nfCharQ) rl=(long)r->m_nfCharQ; in nfPower()
595 if ((c==r->m_nfCharQ)||(c== -r->m_nfCharQ)) in nfReadTable()
611 if (r->m_nfCharQ > 1) in nfReadTable()
618 if (c>1) r->m_nfCharQ = c; in nfReadTable()
652 while ( i < r->m_nfCharQ ) in nfReadTable()
683 r->m_nfCharQ=0; in nfReadTable()
949 r->m_nfCharQ = 0; in nfInitChar()
[all …]
H A Dcoeffs.h363 int m_nfCharQ; ///< the number of elements: q member
/dports/math/singular/Singular-Release-4-2-1/Singular/
H A Dipshell.cc1985 Lc->m[0].data=(void*)(long)C->m_nfCharQ; in rDecompose_CF()
2208 Lc->m[0].data=(void*)(long)r->cf->m_nfCharQ; in rDecompose()
H A Diparith.cc3907 else if (rField_is_GF(r)) elems=r->cf->m_nfCharQ; in jjCOUNT_RG()