 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the source code of this file.
|
#define | n_Copy_RingGeneral(n, r) n_Copy_FieldGeneral(n, r) |
|
#define | n_Delete_RingGeneral(n, r) n_Delete_FieldGeneral(n, r) |
|
#define | n_Mult_RingGeneral(n1, n2, r) n_Mult_FieldGeneral(n1, n2, r) |
|
#define | n_Add_RingGeneral(n1, n2, r) n_Add_FieldGeneral(n1, n2, r) |
|
#define | n_IsZero_RingGeneral(n, r) n_IsZero_FieldGeneral(n, r) |
|
#define | n_Equal_RingGeneral(n1, n2, r) n_Equal_FieldGeneral(n1, n2, r) |
|
#define | n_Neg_RingGeneral(n, r) n_Neg_FieldGeneral(n, r) |
|
#define | n_Sub_RingGeneral(n1, n2, r) n_Sub_FieldGeneral(n1, n2, r) |
|
#define | n_InpMult_RingGeneral(n1, n2, r) n_InpMult_FieldGeneral(n1, n2, r) |
|
#define | n_Copy_FieldZp(n, r) n |
|
#define | n_Delete_FieldZp(n, r) do {} while (0) |
|
#define | DO_LFORCE_INLINE |
|
|
static FORCE_INLINE number | n_Copy_FieldGeneral (number n, const coeffs r) |
|
static FORCE_INLINE void | n_Delete_FieldGeneral (number *p, const coeffs r) |
|
static FORCE_INLINE number | n_Mult_FieldGeneral (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Add_FieldGeneral (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_IsZero_FieldGeneral (number n, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_Equal_FieldGeneral (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Neg_FieldGeneral (number n, const coeffs r) |
|
static FORCE_INLINE number | n_Sub_FieldGeneral (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE void | n_InpMult_FieldGeneral (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE void | n_InpAdd_FieldGeneral (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE void | n_InpAdd_RingGeneral (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Mult_FieldZp (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Add_FieldZp (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Sub_FieldZp (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_IsZero_FieldZp (number n, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_Equal_FieldZp (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Neg_FieldZp (number n, const coeffs r) |
|
static FORCE_INLINE void | n_InpMult_FieldZp (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE void | n_InpAdd_FieldZp (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Copy_FieldQ (number n, const coeffs r) |
|
static FORCE_INLINE void | n_Delete_FieldQ (number *n, const coeffs r) |
|
static FORCE_INLINE number | n_Mult_FieldQ (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Add_FieldQ (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Sub_FieldQ (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_IsZero_FieldQ (number n, const coeffs r) |
|
static FORCE_INLINE BOOLEAN | n_Equal_FieldQ (number n1, number n2, const coeffs r) |
|
static FORCE_INLINE number | n_Neg_FieldQ (number n, const coeffs r) |
|
static FORCE_INLINE void | n_InpMult_FieldQ (number &n1, number n2, const coeffs r) |
|
static FORCE_INLINE void | n_InpAdd_FieldQ (number &n1, number n2, const coeffs r) |
|
◆ DO_LFORCE_INLINE
◆ n_Add_RingGeneral
◆ n_Copy_FieldZp
#define n_Copy_FieldZp |
( |
|
n, |
|
|
|
r |
|
) |
| n |
◆ n_Copy_RingGeneral
◆ n_Delete_FieldZp
#define n_Delete_FieldZp |
( |
|
n, |
|
|
|
r |
|
) |
| do {} while (0) |
◆ n_Delete_RingGeneral
◆ n_Equal_RingGeneral
◆ n_InpMult_RingGeneral
◆ n_IsZero_RingGeneral
◆ n_Mult_RingGeneral
◆ n_Neg_RingGeneral
◆ n_Sub_RingGeneral
◆ n_Add_FieldGeneral()
◆ n_Add_FieldQ()
◆ n_Add_FieldZp()
◆ n_Copy_FieldGeneral()
◆ n_Copy_FieldQ()
◆ n_Delete_FieldGeneral()
◆ n_Delete_FieldQ()
◆ n_Equal_FieldGeneral()
◆ n_Equal_FieldQ()
◆ n_Equal_FieldZp()
◆ n_InpAdd_FieldGeneral()
◆ n_InpAdd_FieldQ()
◆ n_InpAdd_FieldZp()
◆ n_InpAdd_RingGeneral()
◆ n_InpMult_FieldGeneral()
◆ n_InpMult_FieldQ()
◆ n_InpMult_FieldZp()
◆ n_IsZero_FieldGeneral()
◆ n_IsZero_FieldQ()
◆ n_IsZero_FieldZp()
◆ n_Mult_FieldGeneral()
◆ n_Mult_FieldQ()
◆ n_Mult_FieldZp()
◆ n_Neg_FieldGeneral()
◆ n_Neg_FieldQ()
◆ n_Neg_FieldZp()
◆ n_Sub_FieldGeneral()
◆ n_Sub_FieldQ()
◆ n_Sub_FieldZp()
LINLINE BOOLEAN nlIsZero(number za, const coeffs r)
LINLINE void nlInpMult(number &a, number b, const coeffs r)
#define npEqualM(A, B, r)
static FORCE_INLINE void n_InpMult(number &a, number b, const coeffs r)
multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
LINLINE number nlCopy(number a, const coeffs r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
LINLINE void nlInpAdd(number &a, number b, const coeffs r)
LINLINE number nlSub(number la, number li, const coeffs r)
LINLINE BOOLEAN nlEqual(number a, number b, const coeffs r)
static FORCE_INLINE number n_Add(number a, number b, const coeffs r)
return the sum of 'a' and 'b', i.e., a+b
static FORCE_INLINE void n_InpAdd(number &a, number b, const coeffs r)
addition of 'a' and 'b'; replacement of 'a' by the sum a+b
static number npAddM(number a, number b, const coeffs r)
static number npSubM(number a, number b, const coeffs r)
static number npNegM(number a, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
static FORCE_INLINE number n_Sub(number a, number b, const coeffs r)
return the difference of 'a' and 'b', i.e., a-b
LINLINE number nlAdd(number la, number li, const coeffs r)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
LINLINE number nlMult(number a, number b, const coeffs r)
static FORCE_INLINE BOOLEAN n_Equal(number a, number b, const coeffs r)
TRUE iff 'a' and 'b' represent the same number; they may have different representations.
LINLINE number nlNeg(number za, const coeffs r)
static BOOLEAN npIsZeroM(number a, const coeffs)
LINLINE void nlDelete(number *a, const coeffs r)