Go to the source code of this file.
|
map | maCopy (map theMap, const ring r) |
|
poly | maEvalVariable (poly p, int v, int pExp, ideal s, const ring dst_r) |
|
static poly | maEvalMonom (map theMap, poly p, ring preimage_r, ideal s, nMapFunc nMap, const ring dst_r) |
|
poly | maEval (map theMap, poly p, ring preimage_r, nMapFunc nMap, ideal s, const ring dst_r) |
|
void | maFindPerm (char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch) |
|
poly | maIMap (ring r, poly p, const ring dst_r) |
|
int | maMaxDeg_Ma (ideal a, ring preimage_r) |
|
int | maMaxDeg_P (poly p, ring preimage_r) |
|
poly | p_MinPolyNormalize (poly p, const ring r) |
|
◆ MAX_MAP_DEG
◆ maCopy()
Definition at line 34 of file maps.cc.
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
static poly p_Copy(poly p, const ring r)
returns a copy of p
ideal idInit(int idsize, int rank)
initialise an ideal / module
◆ maEval()
poly maEval |
( |
map |
theMap, |
|
|
poly |
p, |
|
|
ring |
preimage_r, |
|
|
nMapFunc |
nMap, |
|
|
ideal |
s, |
|
|
const ring |
dst_r |
|
) |
| |
Definition at line 117 of file maps.cc.
138 monoms = (poly*)
omAlloc(
l*
sizeof(poly));
149 for(
i =
l-1;
i>=0;
i--)
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
const CanonicalForm int s
static poly maEvalMonom(map theMap, poly p, ring preimage_r, ideal s, nMapFunc nMap, const ring dst_r)
poly p_MinPolyNormalize(poly p, const ring r)
#define omFreeSize(addr, size)
static poly p_Add_q(poly p, poly q, const ring r)
static unsigned pLength(poly a)
◆ maEvalMonom()
static poly maEvalMonom |
( |
map |
theMap, |
|
|
poly |
p, |
|
|
ring |
preimage_r, |
|
|
ideal |
s, |
|
|
nMapFunc |
nMap, |
|
|
const ring |
dst_r |
|
) |
| |
|
static |
Definition at line 87 of file maps.cc.
94 for(
i=1;
i<=preimage_r->N;
i++)
99 if (theMap->m[
i-1]!=
NULL)
101 poly p1=theMap->m[
i-1];
poly maEvalVariable(poly p, int v, int pExp, ideal s, const ring dst_r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
static poly p_Mult_q(poly p, poly q, const ring r)
static void p_SetCompP(poly p, int i, ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static void p_Delete(poly *p, const ring r)
◆ maEvalVariable()
poly maEvalVariable |
( |
poly |
p, |
|
|
int |
v, |
|
|
int |
pExp, |
|
|
ideal |
s, |
|
|
const ring |
dst_r |
|
) |
| |
Definition at line 48 of file maps.cc.
const Variable & v
< [in] a sqrfree bivariate poly
#define MATELEM(mat, i, j)
poly p_Power(poly p, int i, const ring r)
void p_Normalize(poly p, const ring r)
static poly pp_Mult_qq(poly p, poly q, const ring r)
◆ maFindPerm()
void maFindPerm |
( |
char const *const *const |
preim_names, |
|
|
int |
preim_n, |
|
|
char const *const *const |
preim_par, |
|
|
int |
preim_p, |
|
|
char const *const *const |
names, |
|
|
int |
n, |
|
|
char const *const *const |
par, |
|
|
int |
nop, |
|
|
int * |
perm, |
|
|
int * |
par_perm, |
|
|
n_coeffType |
ch |
|
) |
| |
Definition at line 165 of file maps.cc.
171 for (
i=0;
i<preim_n;
i++)
175 if (strcmp(preim_names[
i],names[
j])==0)
178 Print(
"// var %s: nr %d -> nr %d\n",preim_names[
i],
i+1,
j+1);
184 if ((perm[
i+1]==0)&&(par!=
NULL)
190 if (strcmp(preim_names[
i],par[
j])==0)
193 Print(
"// var %s: nr %d -> par %d\n",preim_names[
i],
i+1,
j+1);
202 for (
i=0;
i<preim_p;
i++)
206 if (strcmp(preim_par[
i],names[
j])==0)
209 Print(
"// par %s: par %d -> nr %d\n",preim_par[
i],
i+1,
j+1);
215 if ((par!=
NULL) && (par_perm[
i]==0))
219 if (strcmp(preim_par[
i],par[
j])==0)
222 Print(
"// par %s: nr %d -> par %d\n",preim_par[
i],
i+1,
j+1);
◆ maIMap()
poly maIMap |
( |
ring |
r, |
|
|
poly |
p, |
|
|
const ring |
dst_r |
|
) |
| |
Definition at line 235 of file maps.cc.
238 if(r==dst_r)
return p_Copy(
p,dst_r);
240 int *perm=(
int *)
omAlloc0((r->N+1)*
sizeof(int));
244 perm,
NULL, dst_r->cf->type);
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
void maFindPerm(char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch)
poly p_PermPoly(poly p, const int *perm, const ring oldRing, const ring dst, nMapFunc nMap, const int *par_perm, int OldPar, BOOLEAN use_mult)
static char const ** rParameter(const ring r)
(r->cf->parameter)
static int rPar(const ring r)
(r->cf->P)
static short rVar(const ring r)
#define rVar(r) (r->N)
◆ maMaxDeg_Ma()
int maMaxDeg_Ma |
( |
ideal |
a, |
|
|
ring |
preimage_r |
|
) |
| |
Definition at line 254 of file maps.cc.
257 int N = preimage_r->N;
273 goto max_deg_fertig_id;
static int si_max(const int a, const int b)
const CanonicalForm CFMap CFMap & N
◆ maMaxDeg_P()
int maMaxDeg_P |
( |
poly |
p, |
|
|
ring |
preimage_r |
|
) |
| |
Definition at line 292 of file maps.cc.
295 int N = preimage_r->N;
307 goto max_deg_fertig_p;
◆ p_MinPolyNormalize()
poly p_MinPolyNormalize |
( |
poly |
p, |
|
|
const ring |
r |
|
) |
| |
Definition at line 324 of file maps.cc.
327 number one =
n_Init(1, C);
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
The main handler for Singular numbers which are suitable for Singular polynomials.
static void p_LmDelete(poly p, const ring r)
static number p_SetCoeff(poly p, number n, ring r)