 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the documentation of this file.
49 #define n_Copy_RingGeneral(n, r) n_Copy_FieldGeneral(n, r)
50 #define n_Delete_RingGeneral(n, r) n_Delete_FieldGeneral(n, r)
51 #define n_Mult_RingGeneral(n1, n2, r) n_Mult_FieldGeneral(n1, n2, r)
52 #define n_Add_RingGeneral(n1, n2, r) n_Add_FieldGeneral(n1, n2, r)
53 #define n_IsZero_RingGeneral(n, r) n_IsZero_FieldGeneral(n, r)
54 #define n_Equal_RingGeneral(n1, n2, r) n_Equal_FieldGeneral(n1, n2, r)
55 #define n_Neg_RingGeneral(n, r) n_Neg_FieldGeneral(n, r)
56 #define n_Sub_RingGeneral(n1, n2, r) n_Sub_FieldGeneral(n1, n2, r)
57 #define n_InpMult_RingGeneral(n1, n2, r) n_InpMult_FieldGeneral(n1, n2, r)
65 #define n_Copy_FieldZp(n, r) n
66 #define n_Delete_FieldZp(n, r) do {} while (0)
80 {
return npAddM(n1, n2, r); }
92 {
return npSubM(n1, n2, r); }
119 #define DO_LFORCE_INLINE
140 {
return nlAdd(n1, n2, r); }
152 {
return nlSub(n1, n2, r); }
static FORCE_INLINE number n_Mult_FieldGeneral(number n1, number n2, const coeffs r)
static FORCE_INLINE number n_Sub_FieldGeneral(number n1, number n2, const coeffs r)
static FORCE_INLINE void n_InpMult_FieldZp(number &n1, number n2, const coeffs r)
LINLINE BOOLEAN nlIsZero(number za, const coeffs r)
LINLINE void nlInpMult(number &a, number b, const coeffs r)
#define npEqualM(A, B, r)
static number npMultM(number a, number b, const coeffs 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
static FORCE_INLINE void n_Delete_FieldGeneral(number *p, const coeffs r)
static FORCE_INLINE number n_Neg_FieldZp(number n, const coeffs r)
LINLINE number nlCopy(number a, const coeffs r)
static FORCE_INLINE number n_Neg_FieldQ(number n, const coeffs r)
static FORCE_INLINE void n_InpAdd_RingGeneral(number &n1, number n2, const coeffs r)
static FORCE_INLINE BOOLEAN n_Equal_FieldZp(number n1, number n2, const coeffs r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE BOOLEAN n_IsZero_FieldQ(number n, const coeffs r)
static FORCE_INLINE number n_Add_FieldQ(number n1, number n2, const coeffs r)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE number n_Sub_FieldZp(number n1, number n2, const coeffs r)
LINLINE void nlInpAdd(number &a, number b, const coeffs r)
static FORCE_INLINE number n_Mult_FieldZp(number n1, number n2, const coeffs r)
LINLINE number nlSub(number la, number li, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_Q(const coeffs r)
LINLINE BOOLEAN nlEqual(number a, number b, const coeffs r)
static FORCE_INLINE number n_Copy_FieldQ(number n, 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 FORCE_INLINE number n_Add_FieldGeneral(number n1, number n2, const coeffs r)
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 void n_InpAdd_FieldQ(number &n1, number n2, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
static FORCE_INLINE number n_Add_FieldZp(number n1, number n2, const coeffs r)
static FORCE_INLINE number n_Mult_FieldQ(number n1, number n2, const coeffs r)
static FORCE_INLINE void n_InpMult_FieldQ(number &n1, number n2, 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 void n_InpAdd_FieldGeneral(number &n1, number n2, const coeffs r)
static FORCE_INLINE number n_Sub(number a, number b, const coeffs r)
return the difference of 'a' and 'b', i.e., a-b
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_Copy_FieldGeneral(number n, const coeffs r)
static FORCE_INLINE number n_Sub_FieldQ(number n1, number n2, const coeffs r)
LINLINE number nlAdd(number la, number li, const coeffs r)
static FORCE_INLINE number n_Neg_FieldGeneral(number n, const coeffs r)
static FORCE_INLINE void n_InpAdd_FieldZp(number &n1, number n2, const coeffs r)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE BOOLEAN n_IsZero_FieldZp(number n, const coeffs r)
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 FORCE_INLINE void n_Delete_FieldQ(number *n, const coeffs r)
static void npInpMultM(number &a, number b, const coeffs r)
static BOOLEAN npIsZeroM(number a, const coeffs)
static FORCE_INLINE void n_InpMult_FieldGeneral(number &n1, number n2, const coeffs r)
LINLINE void nlDelete(number *a, const coeffs r)
static FORCE_INLINE BOOLEAN n_Equal_FieldQ(number n1, number n2, const coeffs r)