My Project
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
unsigned long exp

Function Documentation

◆ nrnInitCfByName()

coeffs nrnInitCfByName ( char *  name,
n_coeffType  n 
)

Definition at line 35 of file rmodulon.cc.

36 {
37  const char start[]="ZZ/bigint(";
38  const int start_len=strlen(start);
39  if (strncmp(s,start,start_len)==0)
40  {
41  s+=start_len;
42  mpz_t z;
43  mpz_init(z);
44  s=nEatLong(s,z);
45  ZnmInfo info;
46  info.base=z;
47  info.exp= 1;
48  while ((*s!='\0') && (*s!=')')) s++;
49  // expect ")" or ")^exp"
50  if (*s=='\0') { mpz_clear(z); return NULL; }
51  if (((*s)==')') && (*(s+1)=='^'))
52  {
53  s=s+2;
54  int i;
55  s=nEati(s,&i,0);
56  info.exp=(unsigned long)i;
57  return nInitChar(n_Znm,(void*) &info);
58  }
59  else
60  return nInitChar(n_Zn,(void*) &info);
61  }
62  else return NULL;
63 }
int i
Definition: cfEzgcd.cc:132
@ 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:353
const CanonicalForm int s
Definition: facAbsFact.cc:51
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:654
char * nEati(char *s, int *i, int m)
divide by the first (leading) number and return it, i.e. make monic
Definition: numbers.cc:633
#define NULL
Definition: omList.c:12

◆ nrnInitChar()

BOOLEAN nrnInitChar ( coeffs  r,
void *  p 
)

Definition at line 987 of file rmodulon.cc.

988 {
989  assume( (getCoeffType(r) == n_Zn) || (getCoeffType (r) == n_Znm) );
990  ZnmInfo * info= (ZnmInfo *) p;
991  r->modBase= (mpz_ptr)nrnCopy((number)info->base, r); //this circumvents the problem
992  //in bigintmat.cc where we cannot create a "legal" nrn that can be freed.
993  //If we take a copy, we can do whatever we want.
994 
995  nrnInitExp (info->exp, r);
996 
997  /* next computation may yield wrong characteristic as r->modNumber
998  is a GMP number */
999  r->ch = mpz_get_ui(r->modNumber);
1000 
1001  r->is_field=FALSE;
1002  r->is_domain=FALSE;
1003  r->rep=n_rep_gmp;
1004 
1005  r->cfInit = nrnInit;
1006  r->cfDelete = nrnDelete;
1007  r->cfCopy = nrnCopy;
1008  r->cfSize = nrnSize;
1009  r->cfInt = nrnInt;
1010  r->cfAdd = nrnAdd;
1011  r->cfSub = nrnSub;
1012  r->cfMult = nrnMult;
1013  r->cfDiv = nrnDiv;
1014  r->cfAnn = nrnAnn;
1015  r->cfIntMod = nrnMod;
1016  r->cfExactDiv = nrnDiv;
1017  r->cfInpNeg = nrnNeg;
1018  r->cfInvers = nrnInvers;
1019  r->cfDivBy = nrnDivBy;
1020  r->cfDivComp = nrnDivComp;
1021  r->cfGreater = nrnGreater;
1022  r->cfEqual = nrnEqual;
1023  r->cfIsZero = nrnIsZero;
1024  r->cfIsOne = nrnIsOne;
1025  r->cfIsMOne = nrnIsMOne;
1026  r->cfGreaterZero = nrnGreaterZero;
1027  r->cfWriteLong = nrnWrite;
1028  r->cfRead = nrnRead;
1029  r->cfPower = nrnPower;
1030  r->cfSetMap = nrnSetMap;
1031  //r->cfNormalize = ndNormalize;
1032  r->cfLcm = nrnLcm;
1033  r->cfGcd = nrnGcd;
1034  r->cfIsUnit = nrnIsUnit;
1035  r->cfGetUnit = nrnGetUnit;
1036  r->cfExtGcd = nrnExtGcd;
1037  r->cfXExtGcd = nrnXExtGcd;
1038  r->cfQuotRem = nrnQuotRem;
1039  r->cfCoeffName = nrnCoeffName;
1040  r->nCoeffIsEqual = nrnCoeffIsEqual;
1041  r->cfKillChar = nrnKillChar;
1042  r->cfQuot1 = nrnQuot1;
1043  r->cfInitMPZ = nrnInitMPZ;
1044  r->cfMPZ = nrnMPZ;
1045 #if SI_INTEGER_VARIANT==2
1046  r->cfWriteFd = nrzWriteFd;
1047  r->cfReadFd = nrzReadFd;
1048 #endif
1049 
1050 #ifdef LDEBUG
1051  r->cfDBTest = nrnDBTest;
1052 #endif
1053  if ((r->modExponent==1)&&(mpz_size1(r->modBase)==1))
1054  {
1055  long p=mpz_get_si(r->modBase);
1056  if ((p<=FACTORY_MAX_PRIME)&&(p==IsPrime(p))) /*factory limit: <2^29*/
1057  {
1058  r->convFactoryNSingN=nrnConvFactoryNSingN;
1059  r->convSingNFactoryN=nrnConvSingNFactoryN;
1060  }
1061  }
1062  return FALSE;
1063 }
#define FALSE
Definition: auxiliary.h:96
int p
Definition: cfModGcd.cc:4080
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition: coeffs.h:422
@ n_rep_gmp
(mpz_ptr), see rmodulon,h
Definition: coeffs.h:116
#define assume(x)
Definition: mod2.h:387
#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:949
static coeffs nrnQuot1(number c, const coeffs r)
Definition: rmodulon.cc:105
static number nrnInit(long i, const coeffs r)
Definition: rmodulon.cc:160
static void nrnKillChar(coeffs r)
Definition: rmodulon.cc:97
BOOLEAN nrnDBTest(number a, const char *f, const int l, const coeffs r)
Definition: rmodulon.cc:911
#define nrnSize
Definition: rmodulon.cc:178
static BOOLEAN nrnGreater(number a, number b, const coeffs)
Definition: rmodulon.cc:493
static BOOLEAN nrnIsZero(number a, const coeffs)
Definition: rmodulon.cc:235
static CanonicalForm nrnConvSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
Definition: rmodulon.cc:980
static number nrnExtGcd(number a, number b, number *s, number *t, const coeffs r)
Definition: rmodulon.cc:320
static void nrnMPZ(mpz_t m, number &n, const coeffs)
Definition: rmodulon.cc:879
static BOOLEAN nrnCoeffIsEqual(const coeffs r, n_coeffType n, void *parameter)
Definition: rmodulon.cc:89
void nrnWrite(number a, const coeffs)
Definition: rmodulon.cc:752
static number nrnMod(number a, number b, const coeffs r)
Definition: rmodulon.cc:599
static number nrnInitMPZ(mpz_t m, const coeffs r)
Definition: rmodulon.cc:871
static void nrnInitExp(unsigned long m, coeffs r)
Definition: rmodulon.cc:900
static number nrnAnn(number k, const coeffs r)
Definition: rmodulon.cc:524
static char * nrnCoeffName(const coeffs r)
Definition: rmodulon.cc:66
static BOOLEAN nrnIsUnit(number a, const coeffs r)
Definition: rmodulon.cc:516
#define nrnDelete
Definition: rmodulon.cc:177
nMapFunc nrnSetMap(const coeffs src, const coeffs dst)
Definition: rmodulon.cc:790
static number nrnInvers(number c, const coeffs r)
Definition: rmodulon.cc:248
static number nrnConvFactoryNSingN(const CanonicalForm n, const coeffs r)
Definition: rmodulon.cc:975
static int nrnDivComp(number a, number b, const coeffs r)
Definition: rmodulon.cc:548
static number nrnXExtGcd(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition: rmodulon.cc:392
static BOOLEAN nrnEqual(number a, number b, const coeffs)
Definition: rmodulon.cc:341
static number nrnQuotRem(number a, number b, number *rem, const coeffs r)
Definition: rmodulon.cc:646
static long nrnInt(number &n, const coeffs)
Definition: rmodulon.cc:171
static BOOLEAN nrnIsOne(number a, const coeffs)
Definition: rmodulon.cc:336
static number nrnCopy(number a, const coeffs)
Definition: rmodulon.cc:150
static number nrnSub(number a, number b, const coeffs r)
Definition: rmodulon.cc:226
static number nrnLcm(number a, number b, const coeffs r)
Definition: rmodulon.cc:287
static void nrnPower(number a, int i, number *result, const coeffs r)
Definition: rmodulon.cc:209
static number nrnMult(number a, number b, const coeffs r)
Definition: rmodulon.cc:200
static number nrnNeg(number c, const coeffs r)
Definition: rmodulon.cc:240
static number nrnGetUnit(number k, const coeffs r)
Definition: rmodulon.cc:346
static number nrnDiv(number a, number b, const coeffs r)
Definition: rmodulon.cc:556
static BOOLEAN nrnIsMOne(number a, const coeffs r)
Definition: rmodulon.cc:483
static BOOLEAN nrnDivBy(number a, number b, const coeffs r)
Definition: rmodulon.cc:538
static BOOLEAN nrnGreaterZero(number k, const coeffs cf)
Definition: rmodulon.cc:498
static number nrnAdd(number a, number b, const coeffs r)
Definition: rmodulon.cc:217
static number nrnGcd(number a, number b, const coeffs r)
Definition: rmodulon.cc:268
#define mpz_size1(A)
Definition: si_gmp.h:12

◆ nrnMapGMP()

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

Definition at line 708 of file rmodulon.cc.

709 {
710  mpz_ptr erg = (mpz_ptr)omAllocBin(gmp_nrz_bin);
711  mpz_init(erg);
712  mpz_mod(erg, (mpz_ptr)from, dst->modNumber);
713  return (number)erg;
714 }
#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 790 of file rmodulon.cc.

791 {
792  /* dst = nrn */
793  if ((src->rep==n_rep_gmp) && nCoeff_is_Z(src))
794  {
795  return nrnMapZ;
796  }
797  if ((src->rep==n_rep_gap_gmp) /*&& nCoeff_is_Z(src)*/)
798  {
799  return nrnMapZ;
800  }
801  if (src->rep==n_rep_gap_rat) /*&& nCoeff_is_Q(src)) or Z*/
802  {
803  return nrnMapQ;
804  }
805  // Some type of Z/n ring / field
806  if (nCoeff_is_Zn(src) || nCoeff_is_Ring_PtoM(src) ||
807  nCoeff_is_Ring_2toM(src) || nCoeff_is_Zp(src))
808  {
809  if ( (!nCoeff_is_Zp(src))
810  && (mpz_cmp(src->modBase, dst->modBase) == 0)
811  && (src->modExponent == dst->modExponent)) return ndCopyMap;
812  else
813  {
814  mpz_ptr nrnMapModul = (mpz_ptr) omAllocBin(gmp_nrz_bin);
815  // Computing the n of Z/n
816  if (nCoeff_is_Zp(src))
817  {
818  mpz_init_set_si(nrnMapModul, src->ch);
819  }
820  else
821  {
822  mpz_init(nrnMapModul);
823  mpz_set(nrnMapModul, src->modNumber);
824  }
825  // nrnMapCoef = 1 in dst if dst is a subring of src
826  // nrnMapCoef = 0 in dst / src if src is a subring of dst
827  if (nrnMapCoef == NULL)
828  {
829  nrnMapCoef = (mpz_ptr) omAllocBin(gmp_nrz_bin);
830  mpz_init(nrnMapCoef);
831  }
832  if (mpz_divisible_p(nrnMapModul, dst->modNumber))
833  {
834  mpz_set_ui(nrnMapCoef, 1);
835  }
836  else
837  if (mpz_divisible_p(dst->modNumber,nrnMapModul))
838  {
839  mpz_divexact(nrnMapCoef, dst->modNumber, nrnMapModul);
840  mpz_ptr tmp = dst->modNumber;
841  dst->modNumber = nrnMapModul;
842  if (!nrnIsUnit((number) nrnMapCoef,dst))
843  {
844  dst->modNumber = tmp;
845  nrnDelete((number*) &nrnMapModul, dst);
846  return NULL;
847  }
848  mpz_ptr inv = (mpz_ptr) nrnInvers((number) nrnMapCoef,dst);
849  dst->modNumber = tmp;
850  mpz_mul(nrnMapCoef, nrnMapCoef, inv);
851  mpz_mod(nrnMapCoef, nrnMapCoef, dst->modNumber);
852  nrnDelete((number*) &inv, dst);
853  }
854  else
855  {
856  nrnDelete((number*) &nrnMapModul, dst);
857  return NULL;
858  }
859  nrnDelete((number*) &nrnMapModul, dst);
860  if (nCoeff_is_Ring_2toM(src))
861  return nrnMap2toM;
862  else if (nCoeff_is_Zp(src))
863  return nrnMapZp;
864  else
865  return nrnMapModN;
866  }
867  }
868  return NULL; // default
869 }
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition: coeffs.h:840
number ndCopyMap(number a, const coeffs src, const coeffs dst)
Definition: numbers.cc:254
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM(const coeffs r)
Definition: coeffs.h:751
static FORCE_INLINE BOOLEAN nCoeff_is_Zn(const coeffs r)
Definition: coeffs.h:850
static FORCE_INLINE BOOLEAN nCoeff_is_Zp(const coeffs r)
Definition: coeffs.h:824
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
Definition: coeffs.h:748
@ n_rep_gap_rat
(number), see longrat.h
Definition: coeffs.h:112
@ n_rep_gap_gmp
(), see rinteger.h, new impl.
Definition: coeffs.h:113
static number nrnMap2toM(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:689
STATIC_VAR mpz_ptr nrnMapCoef
Definition: rmodulon.cc:682
static number nrnMapZ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:737
static number nrnMapZp(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:698
static number nrnMapQ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:716
static number nrnMapModN(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:684