MCPcopy Create free account
hub / github.com/Singular/Singular / n_IntMod

Function n_IntMod

libpolys/coeffs/coeffs.h:629–630  ·  view source on GitHub ↗

for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0

Source from the content-addressed store, hash-verified

627/// always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a
628/// n_IntMod(a,b,r) >=0
629static FORCE_INLINE number n_IntMod(number a, number b, const coeffs r)
630{ assume(r != NULL); return r->cfIntMod(a,b,r); }
631
632/// fill res with the power a^b
633static FORCE_INLINE void n_Power(number a, int b, number *res, const coeffs r)

Callers 8

modMethod · 0.85
bimFareyFunction · 0.85
jjNUMBER2_OP2Function · 0.85
jjMOD_BIFunction · 0.85
jjMOD_NFunction · 0.85
postReduceByMonFunction · 0.85
postReduceByMonSigFunction · 0.85
finalReduceByMonFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected