Go to the source code of this file.
|
static void * | iiI2P (void *data) |
|
static void * | iiBI2P (void *data) |
|
static void | iiBu2P (leftv out, leftv in) |
|
static void * | iiI2V (void *data) |
|
static void * | iiBI2V (void *data) |
|
static void * | iiI2Id (void *data) |
|
static void * | iiBI2Id (void *data) |
|
static void * | iiBu2V (void *data) |
|
static void * | iiP2V (void *data) |
|
static void * | iiBu2Id (void *data) |
|
static void * | iiP2Id (void *data) |
|
static void * | iiV2Ma (void *data) |
|
static void * | iiN2P (void *data) |
|
static void * | iiDummy (void *data) |
|
static void * | iiMo2Ma (void *data) |
|
static void * | iiMa2Mo (void *data) |
|
static void * | iiI2Iv (void *data) |
|
static void * | iiI2N (void *data) |
|
static void * | iiI2BI (void *data) |
|
static void * | iiBI2N (void *data) |
|
static void * | iiIm2Ma (void *data) |
|
static void * | iiIm2Bim (void *data) |
|
static void * | iiN2Ma (void *data) |
|
static void * | iiS2Link (void *data) |
|
static void | iiR2L_l (leftv out, leftv in) |
|
static void | iiL2R (leftv out, leftv in) |
|
BOOLEAN | iiConvert (int inputType, int outputType, int index, leftv input, leftv output, const struct sConvertTypes *dConvertTypes) |
|
int | iiTestConvert (int inputType, int outputType, const struct sConvertTypes *dConvertTypes) |
|
◆ sConvertTypes
◆ IPCONV
◆ NULL_VAL
◆ iiConvertProc
typedef void *(* iiConvertProc) (void *data) |
◆ iiConvertProcL
typedef void(* iiConvertProcL) (leftv out, leftv in) |
◆ iiBI2Id()
static void * iiBI2Id |
( |
void * |
data | ) |
|
|
static |
Definition at line 101 of file ipconv.cc.
102{
106 {
109 }
114 return (void *)I;
115}
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE char * nCoeffName(const coeffs cf)
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
void Werror(const char *fmt,...)
ideal idInit(int idsize, int rank)
initialise an ideal / module
◆ iiBI2N()
static void * iiBI2N |
( |
void * |
data | ) |
|
|
static |
Definition at line 241 of file ipconv.cc.
242{
246 {
249 }
252 return (void*)n;
253}
◆ iiBI2P()
static void * iiBI2P |
( |
void * |
data | ) |
|
|
static |
Definition at line 50 of file ipconv.cc.
51{
54 {
57 }
62}
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
◆ iiBI2V()
static void * iiBI2V |
( |
void * |
data | ) |
|
|
static |
◆ iiBu2Id()
static void * iiBu2Id |
( |
void * |
data | ) |
|
|
static |
Definition at line 136 of file ipconv.cc.
137{
139
141 {
146 }
147 return (void *)I;
148}
void sBucketDestroyAdd(sBucket_pt bucket, poly *p, int *length)
◆ iiBu2P()
◆ iiBu2V()
static void * iiBu2V |
( |
void * |
data | ) |
|
|
static |
◆ iiConvert()
Definition at line 435 of file ipconv.cc.
436{
438 if ((inputType==outputType)
441 {
442 memcpy(output,input,sizeof(*output));
445 }
447 {
449 output->
data=(
char *)(
long)input->
Typ();
450
452 {
454
457 {
460 else
461 {
464 }
465 }
467 {
469 {
471 if (nr!=0)
472 {
474 {
476 }
477 else
478 {
480 sprintf(tmp,
"%c%d",*(
currRing->names[nr-1]),
483 }
484 }
486 {
492 }
493 }
494 }
496 {
498 number n=(number)input->
data;
500 input->
data=(
void*)n;
502 }
503 else
504 {
505
508 }
509 }
514 }
516 {
518
521 {
523 {
524 Print(
"automatic conversion %s -> %s\n",
526 }
529 output->
rtyp=outputType;
531 {
533 }
534 else
535 {
537 }
543 {
545 }
550 {
553 }
555 {
557 while (input->
e!=
NULL)
558 {
562 }
563 }
564
566 }
567 }
569}
void killAll(const ring r)
void CleanUp(ring r=currRing)
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
const char * Tok2Cmdname(int tok)
const struct sConvertTypes dConvertTypes[]
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define omFreeBin(addr, bin)
static int index(p_Length length, p_Ord ord)
#define pIsConstant(p)
like above, except that Comp must be 0
#define pGetExp(p, i)
Exponent.
void StringSetS(const char *st)
◆ iiDummy()
static void * iiDummy |
( |
void * |
data | ) |
|
|
static |
Definition at line 176 of file ipconv.cc.
177{
178 return data;
179}
◆ iiI2BI()
static void * iiI2BI |
( |
void * |
data | ) |
|
|
static |
Definition at line 206 of file ipconv.cc.
207{
209 return (void *)n;
210}
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
◆ iiI2Id()
static void * iiI2Id |
( |
void * |
data | ) |
|
|
static |
Definition at line 94 of file ipconv.cc.
95{
97 I->m[0]=
pISet((
int)(
long)data);
98 return (void *)I;
99}
◆ iiI2Iv()
static void * iiI2Iv |
( |
void * |
data | ) |
|
|
static |
Definition at line 193 of file ipconv.cc.
194{
195 int s=(int)(
long)data;
197 return (void *)iv;
198}
const CanonicalForm int s
◆ iiI2N()
static void * iiI2N |
( |
void * |
data | ) |
|
|
static |
Definition at line 200 of file ipconv.cc.
201{
202 number n=
nInit((
int)(
long)data);
203 return (void *)n;
204}
◆ iiI2P()
static void * iiI2P |
( |
void * |
data | ) |
|
|
static |
◆ iiI2V()
static void * iiI2V |
( |
void * |
data | ) |
|
|
static |
◆ iiIm2Bim()
static void * iiIm2Bim |
( |
void * |
data | ) |
|
|
static |
Definition at line 354 of file ipconv.cc.
355{
358 delete iv;
359 return r;
360}
bigintmat * iv2bim(intvec *b, const coeffs C)
◆ iiIm2Ma()
static void * iiIm2Ma |
( |
void * |
data | ) |
|
|
static |
Definition at line 337 of file ipconv.cc.
338{
342
344 {
346 {
348 }
349 }
350 delete iv;
352}
#define IMATELEM(M, I, J)
matrix mpNew(int r, int c)
create a r x c zero-matrix
#define MATELEM(mat, i, j)
1-based access to matrix
◆ iiL2R()
Definition at line 410 of file ipconv.cc.
411{
412
418 {
421 }
422}
void atSet(idhdl root, char *name, void *data, int typ)
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
intvec * ivCopy(const intvec *o)
syStrategy syConvList(lists li)
◆ iiMa2Mo()
static void * iiMa2Mo |
( |
void * |
data | ) |
|
|
static |
Definition at line 187 of file ipconv.cc.
188{
191}
ideal id_Matrix2Module(matrix mat, const ring R)
converts mat to module, destroys mat
◆ iiMo2Ma()
static void * iiMo2Ma |
( |
void * |
data | ) |
|
|
static |
Definition at line 181 of file ipconv.cc.
182{
185}
matrix id_Module2Matrix(ideal mod, const ring R)
◆ iiN2Ma()
static void * iiN2Ma |
( |
void * |
data | ) |
|
|
static |
Definition at line 376 of file ipconv.cc.
377{
380 {
381 poly
p=
pNSet((number)data);
383 }
384
385
386
387
388 return (void *)I;
389}
◆ iiN2P()
static void * iiN2P |
( |
void * |
data | ) |
|
|
static |
Definition at line 362 of file ipconv.cc.
363{
366 {
368 }
369
370
371
372
374}
◆ iiP2Id()
static void * iiP2Id |
( |
void * |
data | ) |
|
|
static |
Definition at line 150 of file ipconv.cc.
151{
153
155 {
159 }
160 return (void *)I;
161}
#define pGetComp(p)
Component.
◆ iiP2V()
static void * iiP2V |
( |
void * |
data | ) |
|
|
static |
◆ iiR2L_l()
Definition at line 399 of file ipconv.cc.
400{
401 int add_row_shift = 0;
403 if (weights!=
NULL) add_row_shift=weights->
min_in();
404
406
408}
lists syConvRes(syStrategy syzstr, BOOLEAN toDel, int add_row_shift)
◆ iiS2Link()
static void * iiS2Link |
( |
void * |
data | ) |
|
|
static |
Definition at line 391 of file ipconv.cc.
392{
397}
BOOLEAN slInit(si_link l, char *istr)
◆ iiTestConvert()
int iiTestConvert |
( |
int |
inputType, |
|
|
int |
outputType, |
|
|
const struct sConvertTypes * |
dConvertTypes |
|
) |
| |
Definition at line 575 of file ipconv.cc.
576{
577 if ((inputType==outputType)
579 || (outputType==
IDHDL)
581 {
582 return -1;
583 }
584 if (inputType==
UNKNOWN)
return 0;
585
587 return 0;
588
589
590
591
594 {
597 {
598
599
601 }
603 }
604
605
606 return 0;
607}
◆ iiV2Ma()
static void * iiV2Ma |
( |
void * |
data | ) |
|
|
static |
Definition at line 163 of file ipconv.cc.
164{
172}
static ideal idVec2Ideal(poly vec)