rmodulo2m.h
Go to the documentation of this file.
1 #ifndef RMODULO2M_H
2 #define RMODULO2M_H
3 /****************************************
4 * Computer Algebra System SINGULAR *
5 ****************************************/
6 /*
7 * ABSTRACT: numbers modulo 2^m such that 2^m - 1
8 * fits in an unsigned long
9 */
10 
11 #include <misc/auxiliary.h>
12 
13 struct n_Procs_s; typedef struct n_Procs_s *coeffs;
14 struct snumber; typedef struct snumber * number;
15 
16 #ifdef HAVE_RINGS
17 
18 BOOLEAN nr2mInitChar (coeffs r, void*);
19 
20 #endif
21 #endif
BOOLEAN nr2mInitChar(coeffs r, void *)
Definition: rmodulo2m.cc:160
&#39;SR_INT&#39; is the type of those integers small enough to fit into 29 bits.
Definition: longrat.h:46
const ring r
Definition: syzextra.cc:208
The main handler for Singular numbers which are suitable for Singular polynomials.
All the auxiliary stuff.
int BOOLEAN
Definition: auxiliary.h:131