13#include <flint/flint.h>
14#include <flint/fmpz.h>
15#include <flint/fmpq.h>
16#include <flint/fmpq_poly.h>
17#include "factory/factory.h"
33 while (*
s >=
'0' && *
s <=
'9')
s++;
36 mpz_set_str(
i,start,10);
42 mpz_set_str(
i,start,10);
124 fmpq_poly_set_si(
res,
i);
131 fmpq_poly_fit_length(
res, 1);
132 fmpz_set_mpz(
res->coeffs,
i);
134 _fmpq_poly_set_length(
res, 1);
135 _fmpq_poly_normalise(
res);
149 long nl=fmpz_get_si(fmpq_numref(
m));
150 if (fmpz_cmp_si(fmpq_numref(
m),nl)!=0) nl=0;
151 long dl=fmpz_get_si(fmpq_denref(
m));
152 if ((dl!=1)||(fmpz_cmp_si(fmpq_denref(
m),dl)!=0)) nl=0;
169 int dl=(int)mpz_get_si(
den);
170 if ((dl!=1)||(mpz_cmp_si(
den,(
long)dl)!=0)) mpz_set_ui(
result,0);
232 if (!fmpq_is_zero(
m))
234 if (need_plus && (fmpq_cmp_ui(
m,0)>0))
237 int l=fmpz_sizeinbase(fmpq_numref(
m),10);
238 l=
si_max(
l,(
int)fmpz_sizeinbase(fmpq_denref(
m),10));
241 char *z=fmpz_get_str(
s,10,fmpq_numref(
m));
243 ||(fmpz_cmp_si(fmpq_numref(
m),1)!=0)
244 ||(fmpz_cmp_si(fmpq_denref(
m),1)!=0))
247 if (fmpz_cmp_si(fmpq_denref(
m),1)!=0)
250 z=fmpz_get_str(
s,10,fmpq_denref(
m));
265static const char*
Read(
const char * st, number * a,
const coeffs r)
270 *a=(number)
omAlloc(
sizeof(fmpq_poly_t));
273 if (*
s==
'-') { neg=
TRUE;
s++;}
293 else if(strncmp(
s,r->pParameterNames[0],strlen(r->pParameterNames[0]))==0)
296 s+=strlen(r->pParameterNames[0]);
340 if (fmpz_cmp_si(fmpq_numref(
m),(
long)-1)!=0)
result=
FALSE;
343 int dl=(int)fmpz_get_si(fmpq_denref(
m));
344 if ((dl!=1)||(fmpz_cmp_si(fmpq_denref(
m),(
long)dl)!=0))
result=
FALSE;
367 fmpq_poly_set_fmpz(
res,
den);
430 fmpq_poly_set_mpz(
res,
i->z);
441 WerrorS(
"not yet: ChineseRemainder");
452 fmpq_poly_set_coeff_si(
res,1,1);
459 int l=fmpq_poly_length(aa);
466 for(
int i=
l;
i>=0;
i--)
492 for (
int i=
l;
i>=0;
i--)
495 fmpz_set_mpz(
num, tmp);
497 fmpz_set_mpz(
den, tmp);
499 fmpq_poly_set_coeff_fmpq(aa,
i,
m);
511 WerrorS(
"not yet: ConvFactoryNSingN");
516 WerrorS(
"not yet: ConvSingNFactoryN");
522 sprintf(CoeffName_flint_Q,
"flintQp[%s]",r->pParameterNames[0]);
523 return (
char*)CoeffName_flint_Q;
528 const char start[]=
"flintQp[";
529 const int start_len=strlen(start);
530 if (strncmp(
s,start,start_len)==0)
534 int l=sscanf(
s,
"%s",st);
537 while (st[strlen(st)-1]==
']') st[strlen(st)-1]=
'\0';
556 char *
pp=(
char*)infoStruct;
618 cf->iNumberOfParameters = 1;
619 char **pn=(
char**)
omAlloc0(
sizeof(
char*));
621 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)