My Project
Loading...
Searching...
No Matches
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 17 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 33 of file rmodulon.cc.

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

◆ nrnInitChar()

BOOLEAN nrnInitChar ( coeffs r,
void * p )

Definition at line 991 of file rmodulon.cc.

992{
993 assume( (getCoeffType(r) == n_Zn) || (getCoeffType (r) == n_Znm) );
994 ZnmInfo * info= (ZnmInfo *) p;
995 r->modBase= (mpz_ptr)nrnCopy((number)info->base, r); //this circumvents the problem
996 //in bigintmat.cc where we cannot create a "legal" nrn that can be freed.
997 //If we take a copy, we can do whatever we want.
998
999 nrnInitExp (info->exp, r);
1000
1001 /* next computation may yield wrong characteristic as r->modNumber
1002 is a GMP number */
1003 r->ch = mpz_get_ui(r->modNumber);
1004
1005 r->is_field=FALSE;
1006 r->is_domain=FALSE;
1007 r->rep=n_rep_gmp;
1008
1009 r->cfInit = nrnInit;
1010 r->cfDelete = nrnDelete;
1011 r->cfCopy = nrnCopy;
1012 r->cfSize = nrnSize;
1013 r->cfInt = nrnInt;
1014 r->cfAdd = nrnAdd;
1015 r->cfInpAdd = nrnInpAdd;
1016 r->cfSub = nrnSub;
1017 r->cfMult = nrnMult;
1018 r->cfInpMult = nrnInpMult;
1019 r->cfDiv = nrnDiv;
1020 r->cfAnn = nrnAnn;
1021 r->cfIntMod = nrnMod;
1022 r->cfExactDiv = nrnDiv;
1023 r->cfInpNeg = nrnNeg;
1024 r->cfInvers = nrnInvers;
1025 r->cfDivBy = nrnDivBy;
1026 r->cfDivComp = nrnDivComp;
1027 r->cfGreater = nrnGreater;
1028 r->cfEqual = nrnEqual;
1029 r->cfIsZero = nrnIsZero;
1030 r->cfIsOne = nrnIsOne;
1031 r->cfIsMOne = nrnIsMOne;
1032 r->cfGreaterZero = nrnGreaterZero;
1033 r->cfWriteLong = nrnWrite;
1034 r->cfRead = nrnRead;
1035 r->cfPower = nrnPower;
1036 r->cfSetMap = nrnSetMap;
1037 //r->cfNormalize = ndNormalize;
1038 r->cfLcm = nrnLcm;
1039 r->cfGcd = nrnGcd;
1040 r->cfIsUnit = nrnIsUnit;
1041 r->cfGetUnit = nrnGetUnit;
1042 r->cfExtGcd = nrnExtGcd;
1043 r->cfXExtGcd = nrnXExtGcd;
1044 r->cfQuotRem = nrnQuotRem;
1045 r->cfCoeffName = nrnCoeffName;
1046 r->nCoeffIsEqual = nrnCoeffIsEqual;
1047 r->cfKillChar = nrnKillChar;
1048 r->cfQuot1 = nrnQuot1;
1049 r->cfInitMPZ = nrnInitMPZ;
1050 r->cfMPZ = nrnMPZ;
1051#if SI_INTEGER_VARIANT==2
1052 r->cfWriteFd = nrzWriteFd;
1053 r->cfReadFd = nrzReadFd;
1054#endif
1055
1056#ifdef LDEBUG
1057 r->cfDBTest = nrnDBTest;
1058#endif
1059 if ((r->modExponent==1)&&(mpz_size1(r->modBase)==1))
1060 {
1061 long p=mpz_get_si(r->modBase);
1062 if ((p<=FACTORY_MAX_PRIME)&&(p==IsPrime(p))) /*factory limit: <2^29*/
1063 {
1064 r->convFactoryNSingN=nrnConvFactoryNSingN;
1065 r->convSingNFactoryN=nrnConvSingNFactoryN;
1066 }
1067 }
1068 return FALSE;
1069}
#define FALSE
Definition auxiliary.h:97
int p
Definition cfModGcd.cc:4086
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition coeffs.h:429
@ n_rep_gmp
(mpz_ptr), see rmodulon,h
Definition coeffs.h:122
#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:103
static number nrnInit(long i, const coeffs r)
Definition rmodulon.cc:158
static BOOLEAN nrnDBTest(number a, const char *f, const int l, const coeffs r)
Definition rmodulon.cc:915
static void nrnKillChar(coeffs r)
Definition rmodulon.cc:95
#define nrnSize
Definition rmodulon.cc:176
static BOOLEAN nrnGreater(number a, number b, const coeffs)
Definition rmodulon.cc:500
static BOOLEAN nrnIsZero(number a, const coeffs)
Definition rmodulon.cc:242
static CanonicalForm nrnConvSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
Definition rmodulon.cc:984
static number nrnExtGcd(number a, number b, number *s, number *t, const coeffs r)
Definition rmodulon.cc:327
static void nrnMPZ(mpz_t m, number &n, const coeffs)
Definition rmodulon.cc:883
static BOOLEAN nrnCoeffIsEqual(const coeffs r, n_coeffType n, void *parameter)
Definition rmodulon.cc:87
static void nrnInpMult(number &a, number b, const coeffs r)
Definition rmodulon.cc:204
void nrnWrite(number a, const coeffs)
Definition rmodulon.cc:777
static number nrnMod(number a, number b, const coeffs r)
Definition rmodulon.cc:624
static number nrnInitMPZ(mpz_t m, const coeffs r)
Definition rmodulon.cc:875
static void nrnInitExp(unsigned long m, coeffs r)
Definition rmodulon.cc:904
static number nrnAnn(number k, const coeffs r)
Definition rmodulon.cc:549
static BOOLEAN nrnIsUnit(number a, const coeffs r)
Definition rmodulon.cc:541
#define nrnDelete
Definition rmodulon.cc:175
nMapFunc nrnSetMap(const coeffs src, const coeffs dst)
Definition rmodulon.cc:794
static number nrnInvers(number c, const coeffs r)
Definition rmodulon.cc:255
static number nrnConvFactoryNSingN(const CanonicalForm n, const coeffs r)
Definition rmodulon.cc:979
static int nrnDivComp(number a, number b, const coeffs r)
Definition rmodulon.cc:573
static const char * nrnRead(const char *s, number *a, const coeffs r)
Definition rmodulon.cc:953
static number nrnXExtGcd(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition rmodulon.cc:399
static BOOLEAN nrnEqual(number a, number b, const coeffs)
Definition rmodulon.cc:348
static number nrnQuotRem(number a, number b, number *rem, const coeffs r)
Definition rmodulon.cc:671
static long nrnInt(number &n, const coeffs)
Definition rmodulon.cc:169
static BOOLEAN nrnIsOne(number a, const coeffs)
Definition rmodulon.cc:343
static number nrnCopy(number a, const coeffs)
Definition rmodulon.cc:148
static number nrnSub(number a, number b, const coeffs r)
Definition rmodulon.cc:233
static number nrnLcm(number a, number b, const coeffs r)
Definition rmodulon.cc:294
static void nrnPower(number a, int i, number *result, const coeffs r)
Definition rmodulon.cc:210
static number nrnMult(number a, number b, const coeffs r)
Definition rmodulon.cc:195
static number nrnNeg(number c, const coeffs r)
Definition rmodulon.cc:247
static number nrnGetUnit(number k, const coeffs r)
Definition rmodulon.cc:353
static char * nrnCoeffName(const coeffs r)
Definition rmodulon.cc:64
static number nrnDiv(number a, number b, const coeffs r)
Definition rmodulon.cc:581
static BOOLEAN nrnIsMOne(number a, const coeffs r)
Definition rmodulon.cc:490
static BOOLEAN nrnDivBy(number a, number b, const coeffs r)
Definition rmodulon.cc:563
static BOOLEAN nrnGreaterZero(number k, const coeffs cf)
Definition rmodulon.cc:505
static number nrnAdd(number a, number b, const coeffs r)
Definition rmodulon.cc:218
static number nrnGcd(number a, number b, const coeffs r)
Definition rmodulon.cc:275
static void nrnInpAdd(number &a, number b, const coeffs r)
Definition rmodulon.cc:227
#define mpz_size1(A)
Definition si_gmp.h:17

◆ nrnMapGMP()

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

Definition at line 733 of file rmodulon.cc.

734{
735 mpz_ptr erg = (mpz_ptr)omAllocBin(gmp_nrz_bin);
736 mpz_init(erg);
737 mpz_mod(erg, (mpz_ptr)from, dst->modNumber);
738 return (number)erg;
739}
#define omAllocBin(bin)
VAR omBin gmp_nrz_bin
Definition rintegers.cc:23

◆ nrnSetMap()

nMapFunc nrnSetMap ( const coeffs src,
const coeffs dst )

Definition at line 794 of file rmodulon.cc.

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