46 void PrintRing(
const ring r)
53static inline void Test(
const ring)
65 clog <<
"Creating Z/13[t]: " << endl;
67 char* n[] = { (
char*)
"t"};
89 clog <<
"Creating Q[s]: " << endl;
91 char* n[] = {(
char*)
"s"};
112 clog <<
"Creating Z/11[x, y, z]: " << endl;
114 char* n[] = {(
char*)
"x", (
char*)
"y", (
char*)
"z"};
136 clog <<
"Creating QQ[x, y, z, u]: " << endl;
138 char* n[] = {(
char*)
"x", (
char*)
"y", (
char*)
"z", (
char*)
"u"};
160 clog <<
"Creating GF[t]: " << endl;
162 char* n[] = {(
char*)
"t"};
203 clog <<
"Creating QQ[x, y, z, u]: " << endl;
206 char* n[
N] = {(
char*)
"x", (
char*)
"y", (
char*)
"z", (
char*)
"u"};
212 int *block0 = (
int *)
omAlloc0(
D *
sizeof(
int));
213 int *block1 = (
int *)
omAlloc0(
D *
sizeof(
int));
221 ring r =
rDefault(0,
N, n,
D, order, block0, block1);
#define TS_ASSERT_EQUALS(x, y)
#define TS_ASSERT_DIFFERS(x, y)
const CanonicalForm CFMap CFMap & N
virtual bool setUpWorld()
virtual bool setUpWorld()
void test_QQ_x_y_z_ord_2_lp()
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
Creation data needed for finite fields.
BOOLEAN Test(const n_coeffType type, void *p=NULLp)
The main handler for Singular numbers which are suitable for Singular polynomials.
void rWrite(ring r, BOOLEAN details)
void rDebugPrint(const ring r)
void rDelete(ring r)
unconditionally deletes fields in r
ring rDefault(const coeffs cf, int N, char **n, int ord_size, rRingOrder_t *ord, int *block0, int *block1, int **wvhdl, unsigned long bitmask)
static BOOLEAN rField_is_Zp(const ring r)
static BOOLEAN rField_is_Domain(const ring r)
static BOOLEAN rField_is_Q(const ring r)
static BOOLEAN rField_is_GF(const ring r)
static short rVar(const ring r)
#define rVar(r) (r->N)
static MyGlobalPrintingFixture globalPrintingFixture