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

◆ TEST() [16/24]

TEST ( ARingZZpFlint ,
arithmetic18446744073709551557  )

Definition at line 437 of file ARingZZpTest.cpp.

438{
439 // largest prime < 2^64
440 if (sizeof(unsigned long) <= 4)
441 std::cout << "seems to be a 32bit machine: skipping the test" << std::endl;
442 else
443 {
444 M2::ARingZZpFlint R(18446744073709551557UL);
445
446 // testCoerceToLongInteger(R); // this fails for charac > 2^63
447
448 testCoercions(R);
450 testAdd(R, ntrials);
455 // testPower(R, ntrials); // this test fails: as it expects the
456 // characteristic to fit into an int.
458 }
459}
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)
aring-style adapter for Z/p with p a word-size prime, backed by FLINT's nmod_* routines.
void testDivide()

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