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);
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:45
@ n_Zn
only used if HAVE_RINGS is defined
Definition: coeffs.h:44
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
Definition: numbers.cc:392
const CanonicalForm int s
Definition: facAbsFact.cc:51
const ExtensionInfo & info
< [in] sqrfree poly
char * nEati(char *s, int *i, int m)
divide by the first (leading) number and return it, i.e. make monic
Definition: numbers.cc:656
char * nEatLong(char *s, mpz_ptr i)
extracts a long integer from s, returns the rest
Definition: numbers.cc:677
#define NULL
Definition: omList.c:12

◆ nrnInitChar()

BOOLEAN nrnInitChar ( coeffs  r,
void *  p 
)

Definition at line 996 of file rmodulon.cc.

997{
998 assume( (getCoeffType(r) == n_Zn) || (getCoeffType (r) == n_Znm) );
999 ZnmInfo * info= (ZnmInfo *) p;
1000 r->modBase= (mpz_ptr)nrnCopy((number)info->base, r); //this circumvents the problem
1001 //in bigintmat.cc where we cannot create a "legal" nrn that can be freed.
1002 //If we take a copy, we can do whatever we want.
1003
1004 nrnInitExp (info->exp, r);
1005
1006 /* next computation may yield wrong characteristic as r->modNumber
1007 is a GMP number */
1008 r->ch = mpz_get_ui(r->modNumber);
1009
1010 r->is_field=FALSE;
1011 r->is_domain=FALSE;
1012 r->rep=n_rep_gmp;
1013
1014 r->cfInit = nrnInit;
1015 r->cfDelete = nrnDelete;
1016 r->cfCopy = nrnCopy;
1017 r->cfSize = nrnSize;
1018 r->cfInt = nrnInt;
1019 r->cfAdd = nrnAdd;
1020 r->cfInpAdd = nrnInpAdd;
1021 r->cfSub = nrnSub;
1022 r->cfMult = nrnMult;
1023 r->cfInpMult = nrnInpMult;
1024 r->cfDiv = nrnDiv;
1025 r->cfAnn = nrnAnn;
1026 r->cfIntMod = nrnMod;
1027 r->cfExactDiv = nrnDiv;
1028 r->cfInpNeg = nrnNeg;
1029 r->cfInvers = nrnInvers;
1030 r->cfDivBy = nrnDivBy;
1031 r->cfDivComp = nrnDivComp;
1032 r->cfGreater = nrnGreater;
1033 r->cfEqual = nrnEqual;
1034 r->cfIsZero = nrnIsZero;
1035 r->cfIsOne = nrnIsOne;
1036 r->cfIsMOne = nrnIsMOne;
1037 r->cfGreaterZero = nrnGreaterZero;
1038 r->cfWriteLong = nrnWrite;
1039 r->cfRead = nrnRead;
1040 r->cfPower = nrnPower;
1041 r->cfSetMap = nrnSetMap;
1042 //r->cfNormalize = ndNormalize;
1043 r->cfLcm = nrnLcm;
1044 r->cfGcd = nrnGcd;
1045 r->cfIsUnit = nrnIsUnit;
1046 r->cfGetUnit = nrnGetUnit;
1047 r->cfExtGcd = nrnExtGcd;
1048 r->cfXExtGcd = nrnXExtGcd;
1049 r->cfQuotRem = nrnQuotRem;
1050 r->cfCoeffName = nrnCoeffName;
1051 r->nCoeffIsEqual = nrnCoeffIsEqual;
1052 r->cfKillChar = nrnKillChar;
1053 r->cfQuot1 = nrnQuot1;
1054 r->cfInitMPZ = nrnInitMPZ;
1055 r->cfMPZ = nrnMPZ;
1056#if SI_INTEGER_VARIANT==2
1057 r->cfWriteFd = nrzWriteFd;
1058 r->cfReadFd = nrzReadFd;
1059#endif
1060
1061#ifdef LDEBUG
1062 r->cfDBTest = nrnDBTest;
1063#endif
1064 if ((r->modExponent==1)&&(mpz_size1(r->modBase)==1))
1065 {
1066 long p=mpz_get_si(r->modBase);
1067 if ((p<=FACTORY_MAX_PRIME)&&(p==IsPrime(p))) /*factory limit: <2^29*/
1068 {
1069 r->convFactoryNSingN=nrnConvFactoryNSingN;
1070 r->convSingNFactoryN=nrnConvSingNFactoryN;
1071 }
1072 }
1073 return FALSE;
1074}
#define FALSE
Definition: auxiliary.h:96
int p
Definition: cfModGcd.cc:4078
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:389
#define FACTORY_MAX_PRIME
Definition: modulop.h:38
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 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:920
#define nrnSize
Definition: rmodulon.cc:178
static BOOLEAN nrnGreater(number a, number b, const coeffs)
Definition: rmodulon.cc:505
static BOOLEAN nrnIsZero(number a, const coeffs)
Definition: rmodulon.cc:247
static CanonicalForm nrnConvSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
Definition: rmodulon.cc:989
static number nrnExtGcd(number a, number b, number *s, number *t, const coeffs r)
Definition: rmodulon.cc:332
static void nrnMPZ(mpz_t m, number &n, const coeffs)
Definition: rmodulon.cc:888
static BOOLEAN nrnCoeffIsEqual(const coeffs r, n_coeffType n, void *parameter)
Definition: rmodulon.cc:89
static void nrnInpMult(number &a, number b, const coeffs r)
Definition: rmodulon.cc:209
void nrnWrite(number a, const coeffs)
Definition: rmodulon.cc:782
static number nrnMod(number a, number b, const coeffs r)
Definition: rmodulon.cc:629
static number nrnInitMPZ(mpz_t m, const coeffs r)
Definition: rmodulon.cc:880
static void nrnInitExp(unsigned long m, coeffs r)
Definition: rmodulon.cc:909
static number nrnAnn(number k, const coeffs r)
Definition: rmodulon.cc:554
static BOOLEAN nrnIsUnit(number a, const coeffs r)
Definition: rmodulon.cc:546
#define nrnDelete
Definition: rmodulon.cc:177
nMapFunc nrnSetMap(const coeffs src, const coeffs dst)
Definition: rmodulon.cc:799
static number nrnInvers(number c, const coeffs r)
Definition: rmodulon.cc:260
static number nrnConvFactoryNSingN(const CanonicalForm n, const coeffs r)
Definition: rmodulon.cc:984
static int nrnDivComp(number a, number b, const coeffs r)
Definition: rmodulon.cc:578
static const char * nrnRead(const char *s, number *a, const coeffs r)
Definition: rmodulon.cc:958
static number nrnXExtGcd(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition: rmodulon.cc:404
static BOOLEAN nrnEqual(number a, number b, const coeffs)
Definition: rmodulon.cc:353
static number nrnQuotRem(number a, number b, number *rem, const coeffs r)
Definition: rmodulon.cc:676
static long nrnInt(number &n, const coeffs)
Definition: rmodulon.cc:171
static BOOLEAN nrnIsOne(number a, const coeffs)
Definition: rmodulon.cc:348
static number nrnCopy(number a, const coeffs)
Definition: rmodulon.cc:150
static number nrnSub(number a, number b, const coeffs r)
Definition: rmodulon.cc:238
static number nrnLcm(number a, number b, const coeffs r)
Definition: rmodulon.cc:299
static void nrnPower(number a, int i, number *result, const coeffs r)
Definition: rmodulon.cc:215
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:252
static number nrnGetUnit(number k, const coeffs r)
Definition: rmodulon.cc:358
static char * nrnCoeffName(const coeffs r)
Definition: rmodulon.cc:66
static number nrnDiv(number a, number b, const coeffs r)
Definition: rmodulon.cc:586
static BOOLEAN nrnIsMOne(number a, const coeffs r)
Definition: rmodulon.cc:495
static BOOLEAN nrnDivBy(number a, number b, const coeffs r)
Definition: rmodulon.cc:568
static BOOLEAN nrnGreaterZero(number k, const coeffs cf)
Definition: rmodulon.cc:510
static number nrnAdd(number a, number b, const coeffs r)
Definition: rmodulon.cc:223
static number nrnGcd(number a, number b, const coeffs r)
Definition: rmodulon.cc:280
static void nrnInpAdd(number &a, number b, const coeffs r)
Definition: rmodulon.cc:232
#define mpz_size1(A)
Definition: si_gmp.h:17

◆ nrnMapGMP()

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

Definition at line 738 of file rmodulon.cc.

739{
740 mpz_ptr erg = (mpz_ptr)omAllocBin(gmp_nrz_bin);
741 mpz_init(erg);
742 mpz_mod(erg, (mpz_ptr)from, dst->modNumber);
743 return (number)erg;
744}
#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 799 of file rmodulon.cc.

800{
801 /* dst = nrn */
802 if ((src->rep==n_rep_gmp) && nCoeff_is_Z(src))
803 {
804 return nrnMapZ;
805 }
806 if ((src->rep==n_rep_gap_gmp) /*&& nCoeff_is_Z(src)*/)
807 {
808 return nrnMapZ;
809 }
810 if (src->rep==n_rep_gap_rat) /*&& nCoeff_is_Q(src)) or Z*/
811 {
812 return nrnMapQ;
813 }
814 // Some type of Z/n ring / field
815 if (nCoeff_is_Zn(src) || nCoeff_is_Ring_PtoM(src) ||
817 {
818 if ( (!nCoeff_is_Zp(src))
819 && (mpz_cmp(src->modBase, dst->modBase) == 0)
820 && (src->modExponent == dst->modExponent)) return ndCopyMap;
821 else
822 {
823 mpz_ptr nrnMapModul = (mpz_ptr) omAllocBin(gmp_nrz_bin);
824 // Computing the n of Z/n
825 if (nCoeff_is_Zp(src))
826 {
827 mpz_init_set_si(nrnMapModul, src->ch);
828 }
829 else
830 {
831 mpz_init(nrnMapModul);
832 mpz_set(nrnMapModul, src->modNumber);
833 }
834 // nrnMapCoef = 1 in dst if dst is a subring of src
835 // nrnMapCoef = 0 in dst / src if src is a subring of dst
836 if (nrnMapCoef == NULL)
837 {
838 nrnMapCoef = (mpz_ptr) omAllocBin(gmp_nrz_bin);
839 mpz_init(nrnMapCoef);
840 }
841 if (mpz_divisible_p(nrnMapModul, dst->modNumber))
842 {
843 mpz_set_ui(nrnMapCoef, 1);
844 }
845 else
846 if (mpz_divisible_p(dst->modNumber,nrnMapModul))
847 {
848 mpz_divexact(nrnMapCoef, dst->modNumber, nrnMapModul);
849 mpz_ptr tmp = dst->modNumber;
850 dst->modNumber = nrnMapModul;
851 if (!nrnIsUnit((number) nrnMapCoef,dst))
852 {
853 dst->modNumber = tmp;
854 nrnDelete((number*) &nrnMapModul, dst);
855 return NULL;
856 }
857 mpz_ptr inv = (mpz_ptr) nrnInvers((number) nrnMapCoef,dst);
858 dst->modNumber = tmp;
859 mpz_mul(nrnMapCoef, nrnMapCoef, inv);
860 mpz_mod(nrnMapCoef, nrnMapCoef, dst->modNumber);
861 nrnDelete((number*) &inv, dst);
862 }
863 else
864 {
865 nrnDelete((number*) &nrnMapModul, dst);
866 return NULL;
867 }
868 nrnDelete((number*) &nrnMapModul, dst);
869 if (nCoeff_is_Ring_2toM(src))
870 return nrnMap2toM;
871 else if (nCoeff_is_Zp(src))
872 return nrnMapZp;
873 else
874 return nrnMapModN;
875 }
876 }
877 return NULL; // default
878}
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
Definition: coeffs.h:816
number ndCopyMap(number a, const coeffs src, const coeffs dst)
Definition: numbers.cc:282
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM(const coeffs r)
Definition: coeffs.h:727
static FORCE_INLINE BOOLEAN nCoeff_is_Zn(const coeffs r)
Definition: coeffs.h:826
static FORCE_INLINE BOOLEAN nCoeff_is_Zp(const coeffs r)
Definition: coeffs.h:800
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM(const coeffs r)
Definition: coeffs.h:724
@ 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
static number nrnMap2toM(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:719
STATIC_VAR mpz_ptr nrnMapCoef
Definition: rmodulon.cc:712
static number nrnMapZ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:767
static number nrnMapZp(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:728
static number nrnMapQ(number from, const coeffs src, const coeffs dst)
Definition: rmodulon.cc:746
static number nrnMapModN(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:714