My Project  debian-1:4.1.2-p1+ds-2
Data Structures | Functions
rmodulon.h File Reference
#include "misc/auxiliary.h"
#include "coeffs/coeffs.h"
#include "coeffs/rintegers.h"

Go to the source code of this file.

Data Structures

struct  ZnmInfo
 

Functions

BOOLEAN nrnInitChar (coeffs r, void *)
 
number nrnMapGMP (number from, const coeffs, const coeffs dst)
 
nMapFunc nrnSetMap (const coeffs src, const coeffs dst)
 
coeffs nrnInitCfByName (char *name, n_coeffType n)
 

Data Structure Documentation

◆ ZnmInfo

struct ZnmInfo

Definition at line 18 of file rmodulon.h.

Data Fields
mpz_ptr base
int exp

Function Documentation

◆ nrnInitCfByName()

coeffs nrnInitCfByName ( char *  name,
n_coeffType  n 
)

Definition at line 57 of file rmodulon.cc.

58 {
59  const char start[]="ZZ/bigint(";
60  const int start_len=strlen(start);
61  if (strncmp(s,start,start_len)==0)
62  {
63  s+=start_len;
64  mpz_t z;
65  mpz_init(z);
66  s=nEatLong(s,z);
67  ZnmInfo info;
68  info.base=z;
69  info.exp= 1;
70  while ((*s!='\0') && (*s!=')')) s++;
71  // expect ")" or ")^exp"
72  if (*s=='\0') { mpz_clear(z); return NULL; }
73  if (((*s)==')') && (*(s+1)=='^'))
74  {
75  s=s+2;
76  s=nEati(s,&(info.exp),0);
77  return nInitChar(n_Znm,(void*) &info);
78  }
79  else
80  return nInitChar(n_Zn,(void*) &info);
81  }
82  else return NULL;
83 }
@ n_Znm
only used if HAVE_RINGS is defined
Definition: coeffs.h:46
@ n_Zn
only used if HAVE_RINGS is defined
Definition: coeffs.h:45
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
Definition: numbers.cc:349
const CanonicalForm int s
Definition: facAbsFact.cc:55
const ExtensionInfo & info
< [in] sqrfree poly
char * nEatLong(char *s, mpz_ptr i)
extracts a long integer from s, returns the rest
Definition: numbers.cc:651
char * nEati(char *s, int *i, int m)
divide by the first (leading) number and return it, i.e. make monic
Definition: numbers.cc:630
#define NULL
Definition: omList.c:12

◆ nrnInitChar()

BOOLEAN nrnInitChar ( coeffs  r,
void *  p 
)

Definition at line 998 of file rmodulon.cc.

999 {
1000  assume( (getCoeffType(r) == n_Zn) || (getCoeffType (r) == n_Znm) );
1001  ZnmInfo * info= (ZnmInfo *) p;
1002  r->modBase= (mpz_ptr)nrnCopy((number)info->base, r); //this circumvents the problem
1003  //in bigintmat.cc where we cannot create a "legal" nrn that can be freed.
1004  //If we take a copy, we can do whatever we want.
1005 
1006  nrnInitExp (info->exp, r);
1007 
1008  /* next computation may yield wrong characteristic as r->modNumber
1009  is a GMP number */
1010  r->ch = mpz_get_ui(r->modNumber);
1011 
1012  r->is_field=FALSE;
1013  r->is_domain=FALSE;
1014  r->rep=n_rep_gmp;
1015 
1016 
1017  r->cfCoeffString = nrnCoeffString;
1018 
1019  r->cfInit = nrnInit;
1020  r->cfDelete = nrnDelete;
1021  r->cfCopy = nrnCopy;
1022  r->cfSize = nrnSize;
1023  r->cfInt = nrnInt;
1024  r->cfAdd = nrnAdd;
1025  r->cfSub = nrnSub;
1026  r->cfMult = nrnMult;
1027  r->cfDiv = nrnDiv;
1028  r->cfAnn = nrnAnn;
1029  r->cfIntMod = nrnMod;
1030  r->cfExactDiv = nrnDiv;
1031  r->cfInpNeg = nrnNeg;
1032  r->cfInvers = nrnInvers;
1033  r->cfDivBy = nrnDivBy;
1034  r->cfDivComp = nrnDivComp;
1035  r->cfGreater = nrnGreater;
1036  r->cfEqual = nrnEqual;
1037  r->cfIsZero = nrnIsZero;
1038  r->cfIsOne = nrnIsOne;
1039  r->cfIsMOne = nrnIsMOne;
1040  r->cfGreaterZero = nrnGreaterZero;
1041  r->cfWriteLong = nrnWrite;
1042  r->cfRead = nrnRead;
1043  r->cfPower = nrnPower;
1044  r->cfSetMap = nrnSetMap;
1045  //r->cfNormalize = ndNormalize;
1046  r->cfLcm = nrnLcm;
1047  r->cfGcd = nrnGcd;
1048  r->cfIsUnit = nrnIsUnit;
1049  r->cfGetUnit = nrnGetUnit;
1050  r->cfExtGcd = nrnExtGcd;
1051  r->cfXExtGcd = nrnXExtGcd;
1052  r->cfQuotRem = nrnQuotRem;
1053  r->cfCoeffName = nrnCoeffName;
1054  r->cfCoeffWrite = nrnCoeffWrite;
1055  r->nCoeffIsEqual = nrnCoeffIsEqual;
1056  r->cfKillChar = nrnKillChar;
1057  r->cfQuot1 = nrnQuot1;
1058 #if SI_INTEGER_VARIANT==2
1059  r->cfWriteFd = nrzWriteFd;
1060  r->cfReadFd = nrzReadFd;
1061 #endif
1062 
1063 #ifdef LDEBUG
1064  r->cfDBTest = nrnDBTest;
1065 #endif
1066  if ((r->modExponent==1)&&(mpz_size1(r->modBase)==1))
1067  {
1068  long p=mpz_get_si(r->modBase);
1069  if ((p<=FACTORY_MAX_PRIME)&&(p==IsPrime(p))) /*factory limit: <2^29*/
1070  {
1071  r->convFactoryNSingN=nrnConvFactoryNSingN;
1072  r->convSingNFactoryN=nrnConvSingNFactoryN;
1073  }
1074  }
1075  return FALSE;
1076 }
#define FALSE
Definition: auxiliary.h:96
int p
Definition: cfModGcd.cc:4019
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition: coeffs.h:421
@ n_rep_gmp
(mpz_ptr), see rmodulon,h
Definition: coeffs.h:115
#define assume(x)
Definition: mod2.h:390
#define FACTORY_MAX_PRIME
Definition: modulop.h:30
int IsPrime(int p)
Definition: prime.cc:61
number nrzReadFd(const ssiInfo *d, const coeffs)
void nrzWriteFd(number n, const ssiInfo *d, const coeffs)
static const char * nrnRead(const char *s, number *a, const coeffs r)
Definition: rmodulon.cc:960
static coeffs nrnQuot1(number c, const coeffs r)
Definition: rmodulon.cc:132
static number nrnInit(long i, const coeffs r)
Definition: rmodulon.cc:187
static void nrnKillChar(coeffs r)
Definition: rmodulon.cc:124
BOOLEAN nrnDBTest(number a, const char *f, const int l, const coeffs r)
Definition: rmodulon.cc:922
#define nrnSize
Definition: rmodulon.cc:205
static BOOLEAN nrnGreater(number a, number b, const coeffs)
Definition: rmodulon.cc:513
static BOOLEAN nrnIsZero(number a, const coeffs)
Definition: rmodulon.cc:262
static CanonicalForm nrnConvSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
Definition: rmodulon.cc:991
static number nrnExtGcd(number a, number b, number *s, number *t, const coeffs r)
Definition: rmodulon.cc:340
static BOOLEAN nrnCoeffIsEqual(const coeffs r, n_coeffType n, void *parameter)
Definition: rmodulon.cc:104
void nrnWrite(number a, const coeffs)
Definition: rmodulon.cc:776
static number nrnMod(number a, number b, const coeffs r)
Definition: rmodulon.cc:614
static void nrnInitExp(unsigned long m, coeffs r)
Definition: rmodulon.cc:911
static number nrnAnn(number k, const coeffs r)
Definition: rmodulon.cc:544
static char * nrnCoeffName(const coeffs r)
Definition: rmodulon.cc:86
static BOOLEAN nrnIsUnit(number a, const coeffs r)
Definition: rmodulon.cc:536
static void nrnCoeffWrite(const coeffs r, BOOLEAN)
Definition: rmodulon.cc:35
#define nrnDelete
Definition: rmodulon.cc:204
nMapFunc nrnSetMap(const coeffs src, const coeffs dst)
Definition: rmodulon.cc:814
static number nrnInvers(number c, const coeffs r)
Definition: rmodulon.cc:275
static number nrnConvFactoryNSingN(const CanonicalForm n, const coeffs r)
Definition: rmodulon.cc:986
static int nrnDivComp(number a, number b, const coeffs r)
Definition: rmodulon.cc:568
static number nrnXExtGcd(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition: rmodulon.cc:412
static BOOLEAN nrnEqual(number a, number b, const coeffs)
Definition: rmodulon.cc:361
static number nrnQuotRem(number a, number b, number *rem, const coeffs r)
Definition: rmodulon.cc:669
static long nrnInt(number &n, const coeffs)
Definition: rmodulon.cc:198
static BOOLEAN nrnIsOne(number a, const coeffs)
Definition: rmodulon.cc:356
static number nrnCopy(number a, const coeffs)
Definition: rmodulon.cc:177
static number nrnSub(number a, number b, const coeffs r)
Definition: rmodulon.cc:253
static number nrnLcm(number a, number b, const coeffs r)
Definition: rmodulon.cc:307
static void nrnPower(number a, int i, number *result, const coeffs r)
Definition: rmodulon.cc:236
static number nrnMult(number a, number b, const coeffs r)
Definition: rmodulon.cc:227
static number nrnNeg(number c, const coeffs r)
Definition: rmodulon.cc:267
static char * nrnCoeffString(const coeffs r)
Definition: rmodulon.cc:112
static number nrnGetUnit(number k, const coeffs r)
Definition: rmodulon.cc:366
static number nrnDiv(number a, number b, const coeffs r)
Definition: rmodulon.cc:576
static BOOLEAN nrnIsMOne(number a, const coeffs r)
Definition: rmodulon.cc:503
static BOOLEAN nrnDivBy(number a, number b, const coeffs r)
Definition: rmodulon.cc:558
static BOOLEAN nrnGreaterZero(number k, const coeffs cf)
Definition: rmodulon.cc:518
static number nrnAdd(number a, number b, const coeffs r)
Definition: rmodulon.cc:244
static number nrnGcd(number a, number b, const coeffs r)
Definition: rmodulon.cc:288
#define mpz_size1(A)
Definition: si_gmp.h:12

◆ nrnMapGMP()

number nrnMapGMP ( number  from,
const  coeffs,
const coeffs  dst 
)

Definition at line 731 of file rmodulon.cc.

732 {
733  mpz_ptr erg = (mpz_ptr)omAllocBin(gmp_nrz_bin);
734  mpz_init(erg);
735  mpz_mod(erg, (mpz_ptr)from, dst->modNumber);
736  return (number)erg;
737 }
#define omAllocBin(bin)
Definition: omAllocDecl.h:205
EXTERN_VAR omBin gmp_nrz_bin
Definition: rmodulon.cc:33

◆ nrnSetMap()

nMapFunc nrnSetMap ( const coeffs  src,
const coeffs  dst 
)

Definition at line 814 of file rmodulon.cc.

815 {
816  /* dst = nrn */
817  if ((src->rep==n_rep_gmp) && nCoeff_is_Z(src))
818  {
819  return nrnMapZ;
820  }
821  if ((src->rep==n_rep_gap_gmp) /*&& nCoeff_is_Z(src)*/)
822  {
823  return nrnMapZ;
824  }
825  if (src->rep==n_rep_gap_rat) /*&& nCoeff_is_Q(src)) or Z*/
826  {
827  return nrnMapQ;
828  }
829  // Some type of Z/n ring / field
830  if (nCoeff_is_Zn(src) || nCoeff_is_Ring_PtoM(src) ||
831  nCoeff_is_Ring_2toM(src) || nCoeff_is_Zp(src))
832  {
833  if ( (!nCoeff_is_Zp(src))
834  && (mpz_cmp(src->modBase, dst->modBase) == 0)
835  && (src->modExponent == dst->modExponent)) return ndCopyMap;
836  else
837  {
838  mpz_ptr nrnMapModul = (mpz_ptr) omAllocBin(gmp_nrz_bin);
839  // Computing the n of Z/n
840  if (nCoeff_is_Zp(src))
841  {
842  mpz_init_set_si(nrnMapModul, src->ch);
843  }
844  else
845  {
846  mpz_init(nrnMapModul);
847  mpz_set(nrnMapModul, src->modNumber);
848  }
849  // nrnMapCoef = 1 in dst if dst is a subring of src
850  // nrnMapCoef = 0 in dst / src if src is a subring of dst
851  if (nrnMapCoef == NULL)
852  {
853  nrnMapCoef = (mpz_ptr) omAllocBin(gmp_nrz_bin);
854  mpz_init(nrnMapCoef);
855  }
856  if (mpz_divisible_p(nrnMapModul, dst->modNumber))
857  {
858  mpz_set_ui(nrnMapCoef, 1);
859  }
860  else
861  if (mpz_divisible_p(dst->modNumber,nrnMapModul))
862  {
863  mpz_divexact(nrnMapCoef, dst->modNumber, nrnMapModul);
864  mpz_ptr tmp = dst->modNumber;
865  dst->modNumber = nrnMapModul;
866  if (!nrnIsUnit((number) nrnMapCoef,dst))
867  {
868  dst->modNumber = tmp;
869  nrnDelete((number*) &nrnMapModul, dst);
870  return NULL;
871  }
872  mpz_ptr inv = (mpz_ptr) nrnInvers((number) nrnMapCoef,dst);
873  dst->modNumber = tmp;
874  mpz_mul(nrnMapCoef, nrnMapCoef, inv);
875  mpz_mod(nrnMapCoef, nrnMapCoef, dst->modNumber);
876  nrnDelete((number*) &inv, dst);
877  }
878  else
879  {
880  nrnDelete((number*) &nrnMapModul, dst);
881  return NULL;
882  }
883  nrnDelete((number*) &nrnMapModul, dst);
884  if (nCoeff_is_Ring_2toM(src))
885  return nrnMap2toM;
886  else if (nCoeff_is_Zp(src))
887  return nrnMapZp;
888  else
889  return nrnMapModN;
890  }
891  }
892  return NULL; // default
893 }
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition: coeffs.h:838
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM(const coeffs r)
Definition: coeffs.h:749
static FORCE_INLINE BOOLEAN nCoeff_is_Zn(const coeffs r)
Definition: coeffs.h:848
static FORCE_INLINE BOOLEAN nCoeff_is_Zp(const coeffs r)
Definition: coeffs.h:822
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
Definition: coeffs.h:746
@ n_rep_gap_rat
(number), see longrat.h
Definition: coeffs.h:111
@ n_rep_gap_gmp
(), see rinteger.h, new impl.
Definition: coeffs.h:112
number ndCopyMap(number a, const coeffs aRing, const coeffs r)
Definition: numbers.cc:251
static number nrnMap2toM(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:712
STATIC_VAR mpz_ptr nrnMapCoef
Definition: rmodulon.cc:705
static number nrnMapZ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:761
static number nrnMapZp(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:721
static number nrnMapQ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:739
static number nrnMapModN(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:707