rmodulon.h
Go to the documentation of this file.
1 #ifndef RMODULON_H
2 #define RMODULON_H
3 /****************************************
4 * Computer Algebra System SINGULAR *
5 ****************************************/
6 /*
7 * ABSTRACT: numbers modulo n
8 */
9 #include "misc/auxiliary.h"
10 #include "coeffs/coeffs.h"
11 
12 struct n_Procs_s; typedef struct n_Procs_s *coeffs;
13 struct snumber; typedef struct snumber * number;
14 
15 #ifdef HAVE_RINGS
16 #include "coeffs/rintegers.h"
17 
18 typedef struct { mpz_ptr base; int exp; } ZnmInfo;
19 
20 BOOLEAN nrnInitChar (coeffs r, void*);
21 number nrnMapGMP(number from, const coeffs /*src*/, const coeffs dst);/*for SAGE*/
22 nMapFunc nrnSetMap(const coeffs src, const coeffs dst);/* for SAGE, better: n_setMap*/
23 coeffs nrnInitCfByName(char *name,n_coeffType n);
24 
25 #endif
26 
27 #endif
nMapFunc nrnSetMap(const coeffs src, const coeffs dst)
Definition: rmodulon.cc:814
'SR_INT' is the type of those integers small enough to fit into 29 bits.
Definition: longrat.h:47
char N base
Definition: ValueTraits.h:144
coeffs nrnInitCfByName(char *name, n_coeffType n)
Definition: rmodulon.cc:57
number nrnMapGMP(number from, const coeffs, const coeffs dst)
Definition: rmodulon.cc:731
mpz_t n
Definition: longrat.h:50
Coefficient rings, fields and other domains suitable for Singular polynomials.
The main handler for Singular numbers which are suitable for Singular polynomials.
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
Definition: coeffs.h:73
All the auxiliary stuff.
BOOLEAN nrnInitChar(coeffs r, void *)
Definition: rmodulon.cc:998
char name(const Variable &v)
Definition: factory.h:180
n_coeffType
Definition: coeffs.h:27
int exp
Definition: rmodulon.h:18
int BOOLEAN
Definition: auxiliary.h:87