dox/html/rmodulo2m_8h_source.html

#ifndef RMODULO2M_H

#define RMODULO2M_H

/****************************************

*  Computer Algebra System SINGULAR     *

****************************************/

/*

* ABSTRACT: numbers modulo 2^m such that 2^m - 1

*           fits in an unsigned long

*/


#include "misc/auxiliary.h"


struct n_Procs_s; typedef struct  n_Procs_s  *coeffs;

struct snumber; typedef struct snumber *   number;


#ifdef HAVE_RINGS


BOOLEAN nr2mInitChar    (coeffs r, void*);

number  nr2mMapZp       (number from, const coeffs /*src*/, const coeffs dst);

/*for SAGE, better: use the result of n_SetMap*/


#endif

#endif

auxiliary.h
All the auxiliary stuff.

BOOLEAN
int BOOLEAN
Definition: auxiliary.h:87

snumber
'SR_INT' is the type of those integers small enough to fit into 29 bits.
Definition: longrat.h:49

coeffs
The main handler for Singular numbers which are suitable for Singular polynomials.

nr2mMapZp
number nr2mMapZp(number from, const coeffs, const coeffs dst)
Definition: rmodulo2m.cc:640

nr2mInitChar
BOOLEAN nr2mInitChar(coeffs r, void *)
Definition: rmodulo2m.cc:797

n_Procs_s
Definition: coeffs.h:123