My Project
UNKNOWN_GIT_VERSION
libpolys
coeffs
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
number
nr2mMapZp
(number from,
const
coeffs
/*src*/
,
const
coeffs
dst);
20
/*for SAGE, better: use the result of n_SetMap*/
21
22
#endif
23
#endif
nr2mMapZp
number nr2mMapZp(number from, const coeffs, const coeffs dst)
Definition:
rmodulo2m.cc:619
nr2mInitChar
BOOLEAN nr2mInitChar(coeffs r, void *)
Definition:
rmodulo2m.cc:782
auxiliary.h
All the auxiliary stuff.
BOOLEAN
int BOOLEAN
Definition:
auxiliary.h:85
coeffs
The main handler for Singular numbers which are suitable for Singular polynomials.
snumber
'SR_INT' is the type of those integers small enough to fit into 29 bits.
Definition:
longrat.h:48
n_Procs_s
Definition:
coeffs.h:123
Generated on Thu Dec 17 2020 00:00:00 for My Project by
doxygen 1.8.20
for
Singular UNKNOWN_GIT_VERSION