Go to the source code of this file.
◆ iiConvert()
Definition at line 450 of file ipconv.cc.
451{
453 if ((inputType==outputType)
456 {
457 memcpy(output,input,sizeof(*output));
460 }
462 {
464 output->
data=(
char *)(
long)input->
Typ();
465
467 {
469
472 {
475 else
476 {
479 }
480 }
482 {
484 {
486 if (nr!=0)
487 {
489 {
491 }
492 else
493 {
495 snprintf(tmp,8,
"%c%d",*(
currRing->names[nr-1]),
498 }
499 }
501 {
507 }
508 }
509 }
511 {
513 number n=(number)input->
data;
515 input->
data=(
void*)n;
517 }
518 else
519 {
520
523 }
524 }
529 }
531 {
533
536 {
538 {
539 Print(
"automatic conversion %s -> %s\n",
541 }
544 output->
rtyp=outputType;
546 {
548 }
549 else
550 {
552 }
558 {
560 }
565 {
568 }
570 {
572 while (input->
e!=
NULL)
573 {
577 }
578 }
579
581 }
582 }
584}
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)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pIsConstant(p)
like above, except that Comp must be 0
#define pGetExp(p, i)
Exponent.
void StringSetS(const char *st)
◆ iiTestConvert()
Definition at line 590 of file ipconv.cc.
591{
592 if ((inputType==outputType)
594 || (outputType==
IDHDL)
596 {
597 return -1;
598 }
599 if (inputType==
UNKNOWN)
return 0;
600
602 return 0;
603
604
605
606
609 {
612 {
613
614
616 }
618 }
619
620
621 return 0;
622}
◆ dConvertTypes