14#include <flint/flint.h>
15#include <flint/fmpz.h>
16#include <flint/fmpq.h>
17#include <flint/fmpq_poly.h>
18#include "factory/factory.h"
34 while (*
s >=
'0' && *
s <=
'9')
s++;
164#if __FLINT_RELEASE >= 20503
241#if __FLINT_RELEASE >= 20503
334 if (*
s==
'-') { neg=
TRUE;
s++;}
354 else if(
strncmp(
s,r->pParameterNames[0],
strlen(r->pParameterNames[0]))==0)
357 s+=
strlen(r->pParameterNames[0]);
502 WerrorS(
"not yet: ChineseRemainder");
522#if __FLINT_RELEASE >= 20503
528 for(
int i=
l;
i>=0;
i--)
546 for(
int i=
l;
i>=0;
i--)
574 for (
int i=
l;
i>=0;
i--)
593 WerrorS(
"not yet: ConvFactoryNSingN");
598 WerrorS(
"not yet: ConvSingNFactoryN");
610 const char start[]=
"flintQp[";
700 cf->iNumberOfParameters = 1;
703 cf->pParameterNames = (
const char **)
pn;
static int si_max(const int a, const int b)
Coefficient rings, fields and other domains suitable for Singular polynomials.
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
const CanonicalForm int s
void WerrorS(const char *s)
static number ExtGcd(number a, number b, number *s, number *t, const coeffs)
static void WriteShort(number a, const coeffs r)
static number Copy(number a, const coeffs)
static number ChineseRemainder(number *, number *, int, BOOLEAN, CFArray &, const coeffs)
static void Normalize(number &a, const coeffs)
static void SetChar(const coeffs)
static nMapFunc SetMap(const coeffs, const coeffs)
static number Farey(number, number, const coeffs)
static number GetDenom(number &n, const coeffs)
static const char * Read(const char *st, number *a, const coeffs r)
static BOOLEAN IsOne(number a, const coeffs)
char * CoeffName(const coeffs r)
static number ConvFactoryNSingN(const CanonicalForm, const coeffs)
BOOLEAN flintQ_InitChar(coeffs cf, void *infoStruct)
fmpq_poly_struct * fmpq_poly_ptr
static number InitMPZ(mpz_t i, const coeffs)
static int Size(number n, const coeffs)
static number Add(number a, number b, const coeffs)
static number Div(number a, number b, const coeffs)
static void WriteFd(number a, const ssiInfo *d, const coeffs)
coeffs flintQInitCfByName(char *s, n_coeffType n)
static void Delete(number *a, const coeffs)
static number Parameter(const int, const coeffs)
static BOOLEAN DBTest(number, const char *, const int, const coeffs)
static void KillChar(coeffs cf)
static CanonicalForm ConvSingNFactoryN(number, BOOLEAN, const coeffs)
static number Init(long i, const coeffs)
static void MPZ(mpz_t result, number &n, const coeffs)
static number ReadFd(const ssiInfo *d, const coeffs)
static number ExactDiv(number a, number b, const coeffs)
static void Power(number a, int i, number *result, const coeffs)
static BOOLEAN IsMOne(number k, const coeffs)
static number Sub(number a, number b, const coeffs)
static number GetNumerator(number &n, const coeffs)
static BOOLEAN GreaterZero(number, const coeffs)
static number Gcd(number a, number b, const coeffs)
static BOOLEAN CoeffIsEqual(const coeffs r, n_coeffType n, void *)
static number Mult(number a, number b, const coeffs)
static number Invers(number a, const coeffs)
static number Lcm(number, number, const coeffs)
static int ParDeg(number x, const coeffs)
static BOOLEAN IsZero(number a, const coeffs)
static number Neg(number a, const coeffs)
static BOOLEAN Equal(number a, number b, const coeffs)
static BOOLEAN Greater(number a, number b, const coeffs)
static long Int(number &n, const coeffs)
static char * nlEatLong(char *s, mpz_ptr i)
static number Init_bigint(number i, const coeffs dummy, const coeffs dst)
static number IntMod(number a, number b, const coeffs c)
The main handler for Singular numbers which are suitable for Singular polynomials.
char * nEati(char *s, int *i, int m)
divide by the first (leading) number and return it, i.e. make monic
const char *const nDivBy0
#define omFreeSize(addr, size)
void StringAppendS(const char *st)
void s_readmpz_base(s_buff F, mpz_ptr a, int base)