My Project
Loading...
Searching...
No Matches
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
13struct n_Procs_s; typedef struct n_Procs_s *coeffs;
14struct snumber; typedef struct snumber * number;
15
16#ifdef HAVE_RINGS
17
18BOOLEAN nr2mInitChar (coeffs r, void*);
19number nr2mMapZp (number from, const coeffs /*src*/, const coeffs dst);
20/*for SAGE, better: use the result of n_SetMap*/
21
22#endif
23#endif
All the auxiliary stuff.
int BOOLEAN
Definition: auxiliary.h:87
'SR_INT' is the type of those integers small enough to fit into 29 bits.
Definition: longrat.h:49
The main handler for Singular numbers which are suitable for Singular polynomials.
number nr2mMapZp(number from, const coeffs, const coeffs dst)
Definition: rmodulo2m.cc:640
BOOLEAN nr2mInitChar(coeffs r, void *)
Definition: rmodulo2m.cc:797