1492 WerrorS(
"coefficient field should be Zp or Q!");
1497 WerrorS(
"quotient ring not supported!");
1502 WerrorS(
"ordering must be global!");
1508 WerrorS(
"list and intvec must have the same length!");
1527 PrintS(
"multiplicities: ");
1539 for(
i=0;
i<L.size();
i++)
1554 Print(
"coordinate %d for point %d initialized twice!\n",pcvar+1,
i+1);
1579 PrintS(
"not a variable? ");
1598 Print(
"coordinate %d for point %d not known!\n",
j+1,
i+1);
1607 WerrorS(
"data structure is invalid");
1622 bool correct_gen=
false;
1629 Print(
"trying %d cycles mod p...\n",modp_cycles);
1665 PrintS(
"wrong generator!\n");
1678 Print(
"maximal size of output: %d, precision bound: %d.\n",maximalsize,mpz_sizeinbase(
bigcongr,10));
1681 modp_cycles=modp_cycles+10;
1691 PrintS(
"computations finished.\n");
1700 WerrorS(
"internal error - coefficient too big!");
1731 cur_gen=cur_gen->next;
1745 if (mpz_sgn(temp->polycoef[a])!=0)
1751 mpz_init_set(n->z,temp->polycoef[a]);
int cf_getNumSmallPrimes()
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
const Variable & v
< [in] a sqrfree bivariate poly
void WerrorS(const char *s)
static modp_number TakePrime(modp_number)
static void ClearGenList()
static modp_result_entry * modp_result
static mono_type * generic_column_name
static void UpdateGenList()
static void FreeProcData()
static void ResolveCoeff(mpq_t c, number m)
static int final_base_dim
static coord_exist_table * coord_exist
static void IntegerPoints()
static void MakeConditions()
static void CloseChinese()
static void NewResultEntry()
static void PrepareChinese(int n)
static modp_coordinates * modp_points
static void ReconstructGenerator(int ngen, int n)
static int * multiplicity
static void modp_PrepareProducts()
static bool CheckGenerator()
static void InitProcData()
static void MultGenerators()
static void GeneralInit()
static gen_list_entry * gen_list
static void int_PrepareProducts()
static int generic_n_generators
static void GeneralDone()
static void CheckColumnSequence()
static void modp_SetColumnNames()
static q_coordinates * q_points
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
void * malloc(size_t size)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
void PrintS(const char *s)
static BOOLEAN rField_is_Zp(const ring r)
static BOOLEAN rField_is_Q(const ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module