ipconv.cc
Go to the documentation of this file.
1 /****************************************
2 * Computer Algebra System SINGULAR *
3 ****************************************/
4 /*
5 * ABSTRACT: automatic type conversions
6 */
7 
8 
9 
10 
11 #include <kernel/mod2.h>
12 #include <Singular/tok.h>
13 #include <Singular/ipid.h>
14 #include <misc/intvec.h>
15 #include <misc/options.h>
16 #include <omalloc/omalloc.h>
17 #include <kernel/polys.h>
18 #include <kernel/ideals.h>
19 #include <Singular/subexpr.h>
20 #include <coeffs/numbers.h>
21 #include <coeffs/coeffs.h>
22 #include <coeffs/bigintmat.h>
23 //#include <polys/ext_fields/longalg.h>
24 #include <polys/matpol.h>
25 #include <Singular/links/silink.h>
26 #include <kernel/GBEngine/syz.h>
27 #include <Singular/attrib.h>
28 #include <polys/monomials/ring.h>
29 #include <Singular/ipshell.h>
30 #include <Singular/ipconv.h>
31 
32 typedef void * (*iiConvertProc)(void * data);
33 typedef void (*iiConvertProcL)(leftv out,leftv in);
34 struct sConvertTypes
35 {
36  int i_typ;
37  int o_typ;
40 };
41 
42 // all of these static conversion routines work destructive on their input
43 
44 static void * iiI2P(void *data)
45 {
46  poly p=pISet((int)(long)data);
47  return (void *)p;
48 }
49 
50 static void * iiBI2P(void *data)
51 {
53  if (nMap==NULL)
54  {
55  Werror("no conversion from bigint to %s", nCoeffString(currRing->cf));
56  return NULL;
57  }
58  number n=nMap((number)data,coeffs_BIGINT,currRing->cf);
59  n_Delete((number *)&data, coeffs_BIGINT);
60  poly p=p_NSet(n, currRing);
61  return (void *)p;
62 }
63 
64 static void * iiI2V(void *data)
65 {
66  poly p=pISet((int)(long)data);
67  if (p!=NULL) pSetComp(p,1);
68  return (void *)p;
69 }
70 
71 static void * iiBI2V(void *data)
72 {
74  if (nMap==NULL)
75  {
76  Werror("no conversion from bigint to %s", nCoeffString(currRing->cf));
77  return NULL;
78  }
79  number n=nMap((number)data,coeffs_BIGINT,currRing->cf);
80  n_Delete((number *)&data, coeffs_BIGINT);
81  poly p=p_NSet(n, currRing);
82  if (p!=NULL) pSetComp(p,1);
83  return (void *)p;
84 }
85 
86 static void * iiI2Id(void *data)
87 {
88  ideal I=idInit(1,1);
89  I->m[0]=pISet((int)(long)data);
90  return (void *)I;
91 }
92 
93 static void * iiBI2Id(void *data)
94 {
95  ideal I=idInit(1,1);
97  if (nMap==NULL)
98  {
99  Werror("no conversion from bigint to %s", nCoeffString(currRing->cf));
100  return NULL;
101  }
102  number n=nMap((number)data,coeffs_BIGINT,currRing->cf);
103  n_Delete((number *)&data,coeffs_BIGINT);
104  poly p=pNSet(n);
105  I->m[0]=p;
106  return (void *)I;
107 }
108 static void * iiP2V(void *data)
109 {
110  poly p=(poly)data;
111  if (p!=NULL) pSetCompP(p,1);
112  return (void *)p;
113 }
114 
115 static void * iiP2Id(void *data)
116 {
117  ideal I=idInit(1,1);
118 
119  if (data!=NULL)
120  {
121  poly p=(poly)data;
122  I->m[0]=p;
123  if (pGetComp(p)!=0) I->rank=pMaxComp(p);
124  }
125  return (void *)I;
126 }
127 
128 static void * iiV2Ma(void *data)
129 {
130  matrix m=(matrix)idVec2Ideal((poly)data);
131  int h=MATCOLS(m);
132  MATCOLS(m)=MATROWS(m);
133  MATROWS(m)=h;
134  m->rank=h;
135  pDelete((poly *)&data);
136  return (void *)m;
137 }
138 
139 static void * iiN2P(void *data);
140 
141 static void * iiDummy(void *data)
142 {
143  return data;
144 }
145 
146 static void * iiMo2Ma(void *data)
147 {
148  void *res=id_Module2Matrix((ideal)data,currRing);
149  return res;
150 }
151 
152 static void * iiMa2Mo(void *data)
153 {
154  void *res=id_Matrix2Module((matrix)data,currRing);
155  return res;
156 }
157 
158 static void * iiI2Iv(void *data)
159 {
160  int s=(int)(long)data;
161  intvec *iv=new intvec(s,s);
162  return (void *)iv;
163 }
164 
165 static void * iiI2N(void *data)
166 {
167  number n=nInit((int)(long)data);
168  return (void *)n;
169 }
170 
171 static void * iiI2BI(void *data)
172 {
173  number n=n_Init((int)(long)data, coeffs_BIGINT);
174  return (void *)n;
175 }
176 
177 static void * iiBI2N(void *data)
178 {
179  if (currRing==NULL) return NULL;
181  if (nMap==NULL)
182  {
183  Werror("no conversion from bigint to %s", nCoeffString(currRing->cf));
184  return NULL;
185  }
186  number n=nMap((number)data,coeffs_BIGINT,currRing->cf);
187  n_Delete((number *)&data, coeffs_BIGINT);
188  return (void*)n;
189 }
190 
191 static void * iiIm2Ma(void *data)
192 {
193  int i, j;
194  intvec *iv = (intvec *)data;
195  matrix m = mpNew(iv->rows(), iv->cols());
196 
197  for (i=iv->rows(); i>0; i--)
198  {
199  for (j=iv->cols(); j>0; j--)
200  {
201  MATELEM(m, i, j) = pISet(IMATELEM(*iv, i, j));
202  }
203  }
204  delete iv;
205  return (void *)m;
206 }
207 
208 static void * iiIm2Bim(void *data)
209 {
210  intvec *iv=(intvec*)data;
211  void *r=(void *)iv2bim(iv,coeffs_BIGINT);
212  delete iv;
213  return r;
214 }
215 
216 static void * iiBim2Im(void *data)
217 {
218  bigintmat *b=(bigintmat*)data;
219  void *r=(void *)bim2iv(b);
220  delete b;
221  return r;
222 }
223 
224 static void * iiN2P(void *data)
225 {
226  poly p=NULL;
227  if (!nIsZero((number)data))
228  {
229  p=pNSet((number)data);
230  }
231  //else
232  //{
233  // nDelete((number *)&data);
234  //}
235  return (void *)p;
236 }
237 
238 static void * iiN2Ma(void *data)
239 {
240  ideal I=idInit(1,1);
241  if (!nIsZero((number)data))
242  {
243  poly p=pNSet((number)data);
244  I->m[0]=p;
245  }
246  //else
247  //{
248  // nDelete((number *)&data);
249  //}
250  return (void *)I;
251 }
252 
253 static void * iiS2Link(void *data)
254 {
256  slInit(l, (char *) data);
257  omFree((ADDRESS)data);
258  return (void *)l;
259 }
260 
261 /*
262 static void * iiR2L(void * data)
263 {
264  syStrategy tmp=(syStrategy)data;
265  return (void *)syConvRes(tmp,TRUE);
266 }
267 */
268 static void iiR2L_l(leftv out, leftv in)
269 {
270  int add_row_shift = 0;
271  intvec *weights=(intvec*)atGet(in,"isHomog",INTVEC_CMD);
272  if (weights!=NULL) add_row_shift=weights->min_in();
273 
274  syStrategy tmp=(syStrategy)in->CopyD();
275 
276  out->data=(void *)syConvRes(tmp,TRUE,add_row_shift);
277 }
278 
279 static void * iiL2R(void * data)
280 {
281  return (void *)syConvList((lists)data,TRUE);
282 }
283 
284 //
285 // automatic conversions:
286 //
287 #define IPCONV
288 #define D(A) A
289 #define NULL_VAL NULL
290 #include <Singular/table.h>
291 /*2
292 * try to convert 'input' of type 'inputType' to 'output' of type 'outputType'
293 * return FALSE on success
294 */
295 BOOLEAN iiConvert (int inputType, int outputType, int index, leftv input, leftv output,struct sConvertTypes *dConvertTypes)
296 {
297  memset(output,0,sizeof(sleftv));
298  if ((inputType==outputType)
299  || (outputType==DEF_CMD)
300  || ((outputType==IDHDL)&&(input->rtyp==IDHDL)))
301  {
302  memcpy(output,input,sizeof(*output));
303  memset(input,0,sizeof(*input));
304  return FALSE;
305  }
306  else if (outputType==ANY_TYPE)
307  {
308  output->rtyp=ANY_TYPE;
309  output->data=(char *)(long)input->Typ();
310  /* the name of the object:*/
311  if (input->e==NULL)
312  {
313  if (input->rtyp==IDHDL)
314  /* preserve name: copy it */
315  output->name=omStrDup(IDID((idhdl)(input->data)));
316  else if (input->name!=NULL)
317  {
318  if (input->rtyp==ALIAS_CMD)
319  output->name=omStrDup(input->name);
320  else
321  {
322  output->name=input->name;
323  input->name=NULL;
324  }
325  }
326  else if ((input->rtyp==POLY_CMD) && (input->name==NULL))
327  {
328  if (input->data!=NULL)
329  {
330  int nr=pIsPurePower((poly)input->data);
331  if (nr!=0)
332  {
333  if (pGetExp((poly)input->data,nr)==1)
334  {
335  output->name=omStrDup(currRing->names[nr-1]);
336  }
337  else
338  {
339  char *tmp=(char *)omAlloc(4);
340  sprintf(tmp,"%c%d",*(currRing->names[nr-1]),
341  (int)pGetExp((poly)input->data,nr));
342  output->name=tmp;
343  }
344  }
345  else if(pIsConstant((poly)input->data))
346  {
347  StringSetS("");
348  number n=(pGetCoeff((poly)input->data));
349  n_Write(n, currRing->cf);
350  (pGetCoeff((poly)input->data))=n;
351  output->name=StringEndS();
352  }
353  }
354  }
355  else if ((input->rtyp==NUMBER_CMD) && (input->name==NULL))
356  {
357  StringSetS("");
358  number n=(number)input->data;
359  n_Write(n, currRing->cf);
360  input->data=(void*)n;
361  output->name=StringEndS();
362  }
363  else
364  {
365  /* no need to preserve name: use it */
366  output->name=input->name;
367  memset(input,0,sizeof(*input));
368  }
369  }
370  output->next=input->next;
371  input->next=NULL;
372  return FALSE;
373  }
374  if (index!=0) /* iiTestConvert does not returned 'failure' */
375  {
376  index--;
377 
378  if((dConvertTypes[index].i_typ==inputType)
379  &&(dConvertTypes[index].o_typ==outputType))
380  {
381  if(traceit&TRACE_CONV)
382  {
383  Print("automatic conversion %s -> %s\n",
384  Tok2Cmdname(inputType),Tok2Cmdname(outputType));
385  }
386  if ((currRing==NULL) && (outputType>BEGIN_RING) && (outputType<END_RING))
387  return TRUE;
388  output->rtyp=outputType;
389  if (dConvertTypes[index].p!=NULL)
390  {
391  output->data=dConvertTypes[index].p(input->CopyD());
392  }
393  else
394  {
395  dConvertTypes[index].pl(output,input);
396  }
397  if ((output->data==NULL)
398  && ((outputType!=INT_CMD)
399  &&(outputType!=POLY_CMD)
400  &&(outputType!=VECTOR_CMD)
401  &&(outputType!=NUMBER_CMD)))
402  {
403  return TRUE;
404  }
405  output->next=input->next;
406  input->next=NULL;
407  //if (outputType==MATRIX_CMD) Print("convert %d -> matrix\n",inputType);
408  return FALSE;
409  }
410  }
411  return TRUE;
412 }
413 
414 /*2
415 * try to convert 'inputType' in 'outputType'
416 * return 0 on failure, an index (<>0) on success
417 */
418 int iiTestConvert (int inputType, int outputType,struct sConvertTypes *dConvertTypes)
419 {
420  if ((inputType==outputType)
421  || (outputType==DEF_CMD)
422  || (outputType==IDHDL)
423  || (outputType==ANY_TYPE))
424  {
425  return -1;
426  }
427 
428  if ((currRing==NULL) && (outputType>BEGIN_RING) && (outputType<END_RING))
429  return 0;
430 
431  // search the list
432  int i=0;
433  while (dConvertTypes[i].i_typ!=0)
434  {
435  if((dConvertTypes[i].i_typ==inputType)
436  &&(dConvertTypes[i].o_typ==outputType))
437  {
438  //Print("test convert %d to %d (%s -> %s):%d\n",inputType,outputType,
439  //Tok2Cmdname(inputType), Tok2Cmdname(outputType),i+1);
440  return i+1;
441  }
442  i++;
443  }
444  //Print("test convert %d to %d (%s -> %s):0\n",inputType,outputType,
445  // Tok2Cmdname(inputType), Tok2Cmdname(outputType));
446  return 0;
447 }
static void * iiIm2Ma(void *data)
Definition: ipconv.cc:191
static void * iiP2Id(void *data)
Definition: ipconv.cc:115
static void * iiN2Ma(void *data)
Definition: ipconv.cc:238
const const intvec const intvec const ring _currRing const const intvec const intvec const ring _currRing int
Definition: gb_hack.h:53
#define pIsPurePower(p)
Definition: polys.h:219
const CanonicalForm int s
Definition: facAbsFact.cc:55
Class used for (list of) interpreter objects.
Definition: subexpr.h:83
#define ANY_TYPE
Definition: tok.h:34
#define Print
Definition: emacs.cc:83
Definition: tok.h:85
#define pNSet(n)
Definition: polys.h:284
Subexpr e
Definition: subexpr.h:106
Definition: lists.h:22
#define pMaxComp(p)
Definition: polys.h:270
static void * iiBI2N(void *data)
Definition: ipconv.cc:177
#define IDID(a)
Definition: ipid.h:121
#define FALSE
Definition: auxiliary.h:140
int iiTestConvert(int inputType, int outputType, struct sConvertTypes *dConvertTypes)
Definition: ipconv.cc:418
Compatiblity layer for legacy polynomial operations (over currRing)
return P p
Definition: myNF.cc:203
Matrices of numbers.
Definition: bigintmat.h:32
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
Definition: p_polys.cc:1448
lists syConvRes(syStrategy syzstr, BOOLEAN toDel, int add_row_shift)
Definition: ipshell.cc:2885
bigintmat * iv2bim(intvec *b, const coeffs C)
Definition: bigintmat.cc:347
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
Definition: coeffs.h:537
static void * iiN2P(void *data)
Definition: ipconv.cc:224
#define TRACE_CONV
Definition: reporter.h:34
const ideal
Definition: gb_hack.h:42
const CanonicalForm CFMap CFMap int &both_non_zero int n
Definition: cfEzgcd.cc:52
static void * iiIm2Bim(void *data)
Definition: ipconv.cc:208
#define TRUE
Definition: auxiliary.h:144
void * ADDRESS
Definition: auxiliary.h:161
int min_in()
Definition: intvec.h:109
char * StringEndS()
Definition: reporter.cc:151
static void * iiMa2Mo(void *data)
Definition: ipconv.cc:152
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:51
int traceit
Definition: febase.cc:47
iiConvertProc p
Definition: ipconv.cc:38
coeffs coeffs_BIGINT
Definition: ipid.cc:53
int Typ()
Definition: subexpr.cc:949
#define omAlloc(size)
Definition: omAllocDecl.h:210
static void iiR2L_l(leftv out, leftv in)
Definition: ipconv.cc:268
#define pGetComp(p)
Component.
Definition: polys.h:37
Definition: idrec.h:34
#define IDHDL
Definition: tok.h:35
void * data
Definition: subexpr.h:89
poly res
Definition: myNF.cc:322
static void * iiV2Ma(void *data)
Definition: ipconv.cc:128
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:12
#define pGetExp(p, i)
Exponent.
Definition: polys.h:41
const ring r
Definition: syzextra.cc:208
intvec * bim2iv(bigintmat *b)
Definition: bigintmat.cc:339
Coefficient rings, fields and other domains suitable for Singular polynomials.
Definition: intvec.h:16
static void * iiI2P(void *data)
Definition: ipconv.cc:44
int j
Definition: myNF.cc:70
Definition: tok.h:58
static void * iiL2R(void *data)
Definition: ipconv.cc:279
const char * name
Definition: subexpr.h:88
#define pSetCompP(a, i)
Definition: polys.h:274
#define omFree(addr)
Definition: omAllocDecl.h:261
polyrec * poly
Definition: hilb.h:10
void StringSetS(const char *st)
Definition: reporter.cc:128
static void * iiI2N(void *data)
Definition: ipconv.cc:165
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
Definition: coeffs.h:71
iiConvertProcL pl
Definition: ipconv.cc:39
static FORCE_INLINE void n_Write(number &n, const coeffs r, const BOOLEAN bShortOut=TRUE)
Definition: coeffs.h:590
ip_smatrix * matrix
static void * iiP2V(void *data)
Definition: ipconv.cc:108
#define pSetComp(p, v)
Definition: polys.h:38
int m
Definition: cfEzgcd.cc:119
#define pIsConstant(p)
like above, except that Comp might be != 0
Definition: polys.h:209
static void * iiS2Link(void *data)
Definition: ipconv.cc:253
int i
Definition: cfEzgcd.cc:123
matrix id_Module2Matrix(ideal mod, const ring R)
Definition: tok.h:88
static void * iiDummy(void *data)
Definition: ipconv.cc:141
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
Definition: coeffs.h:718
leftv next
Definition: subexpr.h:87
struct sConvertTypes dConvertTypes[]
Definition: table.h:1110
static int index(p_Length length, p_Ord ord)
Definition: p_Procs_Impl.h:597
matrix mpNew(int r, int c)
create a r x c zero-matrix
Definition: matpol.cc:48
Definition: tok.h:38
#define omAlloc0Bin(bin)
Definition: omAllocDecl.h:206
ideal idInit(int idsize, int rank)
Definition: simpleideals.cc:40
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
Definition: attrib.cc:135
#define MATCOLS(i)
Definition: matpol.h:28
#define nIsZero(n)
Definition: numbers.h:19
#define NULL
Definition: omList.c:10
int cols() const
Definition: intvec.h:86
ideal idVec2Ideal(poly vec, const ring R=currRing)
Definition: ideals.h:172
static void * iiMo2Ma(void *data)
Definition: ipconv.cc:146
const char * Tok2Cmdname(int tok)
Definition: gentable.cc:128
static void * iiI2Id(void *data)
Definition: ipconv.cc:86
int rows() const
Definition: intvec.h:87
void *(* iiConvertProc)(void *data)
Definition: ipconv.cc:32
BOOLEAN iiConvert(int inputType, int outputType, int index, leftv input, leftv output, struct sConvertTypes *dConvertTypes)
Definition: ipconv.cc:295
static void * iiBI2Id(void *data)
Definition: ipconv.cc:93
#define pDelete(p_ptr)
Definition: polys.h:157
int rtyp
Definition: subexpr.h:92
static void * iiBI2P(void *data)
Definition: ipconv.cc:50
syStrategy syConvList(lists li, BOOLEAN toDel)
Definition: ipshell.cc:2961
void(* iiConvertProcL)(leftv out, leftv in)
Definition: ipconv.cc:33
static void * iiBim2Im(void *data)
Definition: ipconv.cc:216
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition: coeffs.h:455
#define MATROWS(i)
Definition: matpol.h:27
static FORCE_INLINE char * nCoeffString(const coeffs cf)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar...
Definition: coeffs.h:958
#define pISet(i)
Definition: polys.h:283
#define nInit(i)
Definition: numbers.h:24
static Poly * h
Definition: janet.cc:978
int BOOLEAN
Definition: auxiliary.h:131
#define IMATELEM(M, I, J)
Definition: intvec.h:76
const poly b
Definition: syzextra.cc:213
static void * iiBI2V(void *data)
Definition: ipconv.cc:71
static void * iiI2BI(void *data)
Definition: ipconv.cc:171
ideal id_Matrix2Module(matrix mat, const ring R)
static void * iiI2Iv(void *data)
Definition: ipconv.cc:158
static void * iiI2V(void *data)
Definition: ipconv.cc:64
void Werror(const char *fmt,...)
Definition: reporter.cc:199
void * CopyD(int t)
Definition: subexpr.cc:656
int l
Definition: cfEzgcd.cc:94
long rank
Definition: matpol.h:20
#define MATELEM(mat, i, j)
Definition: matpol.h:29
ssyStrategy * syStrategy
Definition: syz.h:35
#define omStrDup(s)
Definition: omAllocDecl.h:263