Macaulay2 Engine
Loading...
Searching...
No Matches

◆ TEST() [22/24]

TEST ( ARingZZpFlint ,
arithmetic9223372036854775783  )

Definition at line 409 of file ARingZZpTest.cpp.

410{
411 // largest prime < 2^63
412 if (sizeof(unsigned long) <= 4)
413 std::cout << "seems to be a 32bit machine: skipping the test" << std::endl;
414 else
415 {
416 M2::ARingZZpFlint R(9223372036854775783L);
417
419
420 testCoercions(R);
422 testAdd(R, ntrials);
427 // testPower(R, ntrials); // this test fails: as it expects the
428 // characteristic to fit into an int.
430 }
431}
void testAdd(const T &R, int ntrials)
void testNegate(const T &R, int ntrials)
void testReciprocal(const T &R, int ntrials)
void testCoercions(const T &R)
void testAxioms(const T &R, int ntrials)
const int ntrials
Definition ARingTest.hpp:42
void testSubtract(const T &R, int ntrials)
void testMultiply(const T &R, int ntrials)
void testCoerceToLongInteger(const RT &R)
aring-style adapter for Z/p with p a word-size prime, backed by FLINT's nmod_* routines.
void testDivide()

References ntrials, testAdd(), testAxioms(), testCoerceToLongInteger(), testCoercions(), testDivide(), testMultiply(), testNegate(), testReciprocal(), and testSubtract().