My Project
Loading...
Searching...
No Matches
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 "kernel/polys.h"
17#include "kernel/ideals.h"
18#include "Singular/subexpr.h"
19#include "coeffs/numbers.h"
20#include "coeffs/coeffs.h"
21#include "coeffs/bigintmat.h"
22//#include "polys/ext_fields/longalg.h"
23#include "polys/matpol.h"
25#include "kernel/GBEngine/syz.h"
26#include "Singular/attrib.h"
28#include "Singular/ipshell.h"
29#include "Singular/number2.h"
30#include "Singular/ipconv.h"
31
32typedef void * (*iiConvertProc)(void * data);
34struct 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
44static void * iiI2P(void *data)
45{
46 poly p=pISet((int)(long)data);
47 return (void *)p;
48}
49
50static void * iiBI2P(void *data)
51{
53 if (nMap==NULL)
54 {
55 Werror("no conversion from bigint to %s", nCoeffName(currRing->cf));
56 return NULL;
57 }
59 n_Delete((number *)&data, coeffs_BIGINT);
60 poly p=p_NSet(n, currRing);
61 return (void *)p;
62}
63
64static void iiBu2P(leftv out, leftv in)
65{
66 sBucket_pt b=(sBucket_pt)in->CopyD();
67 poly p; int l;
69 out->data=(void*)p;
70}
71
72static void * iiI2V(void *data)
73{
74 poly p=pISet((int)(long)data);
75 if (p!=NULL) pSetComp(p,1);
76 return (void *)p;
77}
78
79static void * iiBI2V(void *data)
80{
82 if (nMap==NULL)
83 {
84 Werror("no conversion from bigint to %s", nCoeffName(currRing->cf));
85 return NULL;
86 }
88 n_Delete((number *)&data, coeffs_BIGINT);
89 poly p=p_NSet(n, currRing);
90 if (p!=NULL) pSetComp(p,1);
91 return (void *)p;
92}
93
94static void * iiIV2BIV(void *data)
95{
96 intvec *aa=(intvec*)data;
97 int l=aa->rows();
99 for(int i=0;i<l;i++)
100 {
102 n_Delete(&BIMATELEM((*bim),1,i+1), coeffs_BIGINT);
103 BIMATELEM((*bim),1,i+1)=tp;
104 }
105 return (void *)bim;
106}
107
108static void * iiI2Id(void *data)
109{
110 ideal I=idInit(1,1);
111 I->m[0]=pISet((int)(long)data);
112 return (void *)I;
113}
114
115static void * iiBI2Id(void *data)
116{
117 ideal I=idInit(1,1);
119 if (nMap==NULL)
120 {
121 Werror("no conversion from bigint to %s", nCoeffName(currRing->cf));
122 return NULL;
123 }
125 n_Delete((number *)&data,coeffs_BIGINT);
126 poly p=pNSet(n);
127 I->m[0]=p;
128 return (void *)I;
129}
130static void * iiBu2V(void *data)
131{
132 poly p=NULL;
133 if (data!=NULL)
134 {
135 sBucket_pt b=(sBucket_pt)data;
136 int l;
138 if (p!=NULL) pSetCompP(p,1);
139 }
140 return (void *)p;
141}
142
143static void * iiP2V(void *data)
144{
145 poly p=(poly)data;
146 if (p!=NULL) pSetCompP(p,1);
147 return (void *)p;
148}
149
150static void * iiBu2Id(void *data)
151{
152 ideal I=idInit(1,1);
153
154 if (data!=NULL)
155 {
156 sBucket_pt b=(sBucket_pt)data;
157 poly p; int l;
159 I->m[0]=p;
160 }
161 return (void *)I;
162}
163
164static void * iiP2Id(void *data)
165{
166 ideal I=idInit(1,1);
167
168 if (data!=NULL)
169 {
170 poly p=(poly)data;
171 I->m[0]=p;
172 if (pGetComp(p)!=0) I->rank=pMaxComp(p);
173 }
174 return (void *)I;
175}
176
177static void * iiV2Ma(void *data)
178{
179 matrix m=(matrix)idVec2Ideal((poly)data);
180 int h=MATCOLS(m);
181 MATCOLS(m)=MATROWS(m);
182 MATROWS(m)=h;
183 m->rank=h;
184 pDelete((poly *)&data);
185 return (void *)m;
186}
187
188static void * iiN2P(void *data);
189
190static void * iiDummy(void *data)
191{
192 return data;
193}
194
195static void * iiMo2Ma(void *data)
196{
197 void *res=id_Module2Matrix((ideal)data,currRing);
198 return res;
199}
200
201static void * iiMa2Mo(void *data)
202{
203 void *res=id_Matrix2Module((matrix)data,currRing);
204 return res;
205}
206
207static void * iiI2Iv(void *data)
208{
209 int s=(int)(long)data;
210 intvec *iv=new intvec(s,s);
211 return (void *)iv;
212}
213
214static void * iiI2N(void *data)
215{
216 number n=nInit((int)(long)data);
217 return (void *)n;
218}
219
220static void * iiI2BI(void *data)
221{
222 number n=n_Init((int)(long)data, coeffs_BIGINT);
223 return (void *)n;
224}
225
226#ifdef SINGULAR_4_2
227static void * iiI2NN(void *data)
228{
229 if (currRing==NULL)
230 {
231 WerrorS("missing basering while converting int to Number");
232 return NULL;
233 }
234 number n=nInit((int)(long)data);
235 number2 nn=(number2)omAlloc(sizeof(*nn));
236 nn->cf=currRing->cf; nn->cf->ref++;
237 nn->n=n;
238 return (void *)nn;
239}
240static void * iiI2CP(void *data)
241{
242 if (currRing==NULL)
243 {
244 WerrorS("missing basering while converting int to Poly");
245 return NULL;
246 }
247 poly n=pISet((int)(long)data);
248 poly2 nn=(poly2)omAlloc(sizeof(*nn));
249 nn->cf=currRing; nn->cf->ref++;
250 nn->n=n;
251 return (void *)nn;
252}
253#endif
254
255static void * iiBI2N(void *data)
256{
257 if (currRing==NULL) return NULL;
259 if (nMap==NULL)
260 {
261 Werror("no conversion from bigint to %s", nCoeffName(currRing->cf));
262 return NULL;
263 }
265 n_Delete((number *)&data, coeffs_BIGINT);
266 return (void*)n;
267}
268
269#ifdef SINGULAR_4_2
270static void * iiBI2NN(void *data)
271{
272 if (currRing==NULL)
273 {
274 WerrorS("missing basering while converting bigint to Number");
275 return NULL;
276 }
278 if (nMap==NULL)
279 {
280 Werror("no conversion from bigint to %s",currRing->cf->cfCoeffName(currRing->cf));
281 return NULL;
282 }
284 n_Delete((number *)&data, coeffs_BIGINT);
285 number2 nn=(number2)omAlloc(sizeof(*nn));
286 nn->cf=currRing->cf; nn->cf->ref++;
287 nn->n=n;
288 return (void*)nn;
289}
290static void * iiBI2CP(void *data)
291{
292 if (currRing==NULL)
293 {
294 WerrorS("missing basering while converting bigint to Poly");
295 return NULL;
296 }
298 if (nMap==NULL)
299 {
300 Werror("no conversion from bigint to %s",currRing->cf->cfCoeffName(currRing->cf));
301 return NULL;
302 }
304 n_Delete((number *)&data, coeffs_BIGINT);
305 poly2 nn=(poly2)omAlloc(sizeof(*nn));
306 nn->cf=currRing; nn->cf->ref++;
307 nn->n=pNSet(n);
308 return (void*)nn;
309}
310static void * iiP2CP(void *data)
311{
312 poly2 nn=(poly2)omAlloc(sizeof(*nn));
313 nn->cf=currRing; nn->cf->ref++;
314 nn->n=(poly)data;
315 return (void*)nn;
316}
317#endif
318
319#ifdef SINGULAR_4_2
320static void * iiNN2N(void *data)
321{
322 number2 d=(number2)data;
323 if ((currRing==NULL)
324 || (currRing->cf!=d->cf))
325 {
326 WerrorS("cannot convert: incompatible");
327 return NULL;
328 }
329 number n = n_Copy(d->n, d->cf);
330 n2Delete(d);
331 return (void*)n;
332}
333#endif
334
335#ifdef SINGULAR_4_2
336static void * iiNN2P(void *data)
337{
338 number2 d=(number2)data;
339 if ((currRing==NULL)
340 || (currRing->cf!=d->cf))
341 {
342 WerrorS("cannot convert: incompatible");
343 return NULL;
344 }
345 number n = n_Copy(d->n, d->cf);
346 n2Delete(d);
347 return (void*)p_NSet(n,currRing);
348}
349#endif
350
351static void * iiIm2Ma(void *data)
352{
353 int i, j;
354 intvec *iv = (intvec *)data;
355 matrix m = mpNew(iv->rows(), iv->cols());
356
357 for (i=iv->rows(); i>0; i--)
358 {
359 for (j=iv->cols(); j>0; j--)
360 {
361 MATELEM(m, i, j) = pISet(IMATELEM(*iv, i, j));
362 }
363 }
364 delete iv;
365 return (void *)m;
366}
367
368static void * iiIm2Bim(void *data)
369{
370 intvec *iv=(intvec*)data;
371 void *r=(void *)iv2bim(iv,coeffs_BIGINT);
372 delete iv;
373 return r;
374}
375
376static void * iiN2P(void *data)
377{
378 poly p=NULL;
379 if (!nIsZero((number)data))
380 {
381 p=pNSet((number)data);
382 }
383 //else
384 //{
385 // nDelete((number *)&data);
386 //}
387 return (void *)p;
388}
389
390static void * iiN2Ma(void *data)
391{
392 ideal I=idInit(1,1);
393 if (!nIsZero((number)data))
394 {
395 poly p=pNSet((number)data);
396 I->m[0]=p;
397 }
398 //else
399 //{
400 // nDelete((number *)&data);
401 //}
402 return (void *)I;
403}
404
405static void * iiS2Link(void *data)
406{
408 slInit(l, (char *) data);
409 omFree((ADDRESS)data);
410 return (void *)l;
411}
412
413static void iiR2L_l(leftv out, leftv in)
414{
415 int add_row_shift = 0;
416 intvec *weights=(intvec*)atGet(in,"isHomog",INTVEC_CMD);
417 if (weights!=NULL) add_row_shift=weights->min_in();
418
419 syStrategy tmp=(syStrategy)in->CopyD();
420
421 out->data=(void *)syConvRes(tmp,TRUE,add_row_shift);
422}
423
424static void iiL2R(leftv out, leftv in)
425{
426 //int add_row_shift = 0;
427 lists l=(lists)in->Data();
428 intvec *ww=NULL;
429 if (l->nr>=0) ww=(intvec *)atGet(&(l->m[0]),"isHomog",INTVEC_CMD);
430 out->data=(void *)syConvList(l);
431 if (ww!=NULL)
432 {
433 intvec *weights=ivCopy(ww);
434 atSet(out,omStrDup("isHomog"),weights,INTVEC_CMD);
435 }
436}
437
438//
439// automatic conversions:
440//
441#define IPCONV
442#define D(A) A
443#define NULL_VAL NULL
444#include "Singular/table.h"
445/*2
446* try to convert 'input' of type 'inputType' to 'output' of type 'outputType'
447* return FALSE on success
448*/
450{
451 output->Init();
452 if ((inputType==outputType)
453 || (outputType==DEF_CMD)
454 || ((outputType==IDHDL)&&(input->rtyp==IDHDL)))
455 {
456 memcpy(output,input,sizeof(*output));
457 input->Init();
458 return FALSE;
459 }
460 else if (outputType==ANY_TYPE)
461 {
462 output->rtyp=ANY_TYPE;
463 output->data=(char *)(long)input->Typ();
464 /* the name of the object:*/
465 if (input->e==NULL)
466 {
467 if (input->rtyp==IDHDL)
468 /* preserve name: copy it */
469 output->name=omStrDup(IDID((idhdl)(input->data)));
470 else if (input->name!=NULL)
471 {
472 if (input->rtyp==ALIAS_CMD)
473 output->name=omStrDup(input->name);
474 else
475 {
476 output->name=input->name;
477 input->name=NULL;
478 }
479 }
480 else if ((input->rtyp==POLY_CMD) && (input->name==NULL))
481 {
482 if (input->data!=NULL)
483 {
484 int nr=pIsPurePower((poly)input->data);
485 if (nr!=0)
486 {
487 if (pGetExp((poly)input->data,nr)==1)
488 {
489 output->name=omStrDup(currRing->names[nr-1]);
490 }
491 else
492 {
493 char *tmp=(char *)omAlloc(8);
494 snprintf(tmp,8,"%c%d",*(currRing->names[nr-1]),
495 (int)pGetExp((poly)input->data,nr));
496 output->name=tmp;
497 }
498 }
499 else if(pIsConstant((poly)input->data))
500 {
501 StringSetS("");
502 number n=(pGetCoeff((poly)input->data));
503 n_Write(n, currRing->cf);
504 (pGetCoeff((poly)input->data))=n; // n_Write may have changed n
505 output->name=StringEndS();
506 }
507 }
508 }
509 else if ((input->rtyp==NUMBER_CMD) && (input->name==NULL))
510 {
511 StringSetS("");
512 number n=(number)input->data;
513 n_Write(n, currRing->cf);
514 input->data=(void*)n; // n_Write may have changed n
515 output->name=StringEndS();
516 }
517 else
518 {
519 /* no need to preserve name: use it */
520 output->name=input->name;
521 input->name=NULL;
522 }
523 }
524 output->next=input->next;
525 input->next=NULL;
526 if (!errorreported) input->CleanUp();
527 return errorreported;
528 }
529 if (index!=0) /* iiTestConvert does not returned 'failure' */
530 {
531 index--;
532
533 if((dConvertTypes[index].i_typ==inputType)
534 &&(dConvertTypes[index].o_typ==outputType))
535 {
537 {
538 Print("automatic conversion %s -> %s\n",
540 }
542 return TRUE;
543 output->rtyp=outputType;
545 {
546 output->data=dConvertTypes[index].p(input->CopyD());
547 }
548 else
549 {
551 }
552 if ((output->data==NULL)
553 && ((outputType!=INT_CMD)
557 {
558 return TRUE;
559 }
560 if (errorreported) return TRUE;
561 output->next=input->next;
562 input->next=NULL;
563 if ((input->rtyp!=IDHDL) && (input->attribute!=NULL))
564 {
565 input->attribute->killAll(currRing);
566 input->attribute=NULL;
567 }
568 if (input->e!=NULL)
569 {
570 Subexpr h;
571 while (input->e!=NULL)
572 {
573 h=input->e->next;
575 input->e=h;
576 }
577 }
578 //input->Init(); // seems that input (rtyp?) is still needed
579 return FALSE;
580 }
581 }
582 return TRUE;
583}
584
585/*2
586* try to convert 'inputType' in 'outputType'
587* return 0 on failure, an index (<>0) on success
588*/
590{
591 if ((inputType==outputType)
592 || (outputType==DEF_CMD)
593 || (outputType==IDHDL)
594 || (outputType==ANY_TYPE))
595 {
596 return -1;
597 }
598 if (inputType==UNKNOWN) return 0;
599
601 return 0;
602 //if ((currRing==NULL) && (outputType==CNUMBER_CMD))
603 // return 0;
604
605 // search the list
606 int i=0;
607 while (dConvertTypes[i].i_typ!=0)
608 {
609 if((dConvertTypes[i].i_typ==inputType)
610 &&(dConvertTypes[i].o_typ==outputType))
611 {
612 //Print("test convert %d to %d (%s -> %s):%d\n",inputType,outputType,
613 //Tok2Cmdname(inputType), Tok2Cmdname(outputType),i+1);
614 return i+1;
615 }
616 i++;
617 }
618 //Print("test convert %d to %d (%s -> %s):0, tested:%d\n",inputType,outputType,
619 // Tok2Cmdname(inputType), Tok2Cmdname(outputType),i);
620 return 0;
621}
void atSet(idhdl root, char *name, void *data, int typ)
Definition attrib.cc:153
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
Definition attrib.cc:132
int BOOLEAN
Definition auxiliary.h:87
#define TRUE
Definition auxiliary.h:100
#define FALSE
Definition auxiliary.h:96
bigintmat * iv2bim(intvec *b, const coeffs C)
Definition bigintmat.cc:349
#define BIMATELEM(M, I, J)
Definition bigintmat.h:133
int l
Definition cfEzgcd.cc:100
int m
Definition cfEzgcd.cc:128
int i
Definition cfEzgcd.cc:132
int p
Definition cfModGcd.cc:4086
CanonicalForm b
Definition cfModGcd.cc:4111
Matrices of numbers.
Definition bigintmat.h:51
Definition idrec.h:35
int min_in()
Definition intvec.h:121
int cols() const
Definition intvec.h:95
int rows() const
Definition intvec.h:96
Class used for (list of) interpreter objects.
Definition subexpr.h:83
Definition lists.h:24
Coefficient rings, fields and other domains suitable for Singular polynomials.
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
Definition coeffs.h:455
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:704
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition coeffs.h:459
static FORCE_INLINE char * nCoeffName(const coeffs cf)
Definition coeffs.h:967
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
Definition coeffs.h:595
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:542
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
Definition coeffs.h:80
#define Print
Definition emacs.cc:80
const CanonicalForm int s
Definition facAbsFact.cc:51
CanonicalForm res
Definition facAbsFact.cc:60
int j
Definition facHensel.cc:110
VAR short errorreported
Definition feFopen.cc:23
void WerrorS(const char *s)
Definition feFopen.cc:24
const char * Tok2Cmdname(int tok)
Definition gentable.cc:140
@ END_RING
Definition grammar.cc:311
@ BEGIN_RING
Definition grammar.cc:283
@ VECTOR_CMD
Definition grammar.cc:293
@ NUMBER_CMD
Definition grammar.cc:289
@ POLY_CMD
Definition grammar.cc:290
static ideal idVec2Ideal(poly vec)
Definition ideals.h:172
intvec * ivCopy(const intvec *o)
Definition intvec.h:145
#define IMATELEM(M, I, J)
Definition intvec.h:85
iiConvertProc p
Definition ipconv.cc:38
static void * iiBI2V(void *data)
Definition ipconv.cc:79
static void * iiP2V(void *data)
Definition ipconv.cc:143
static void iiL2R(leftv out, leftv in)
Definition ipconv.cc:424
static void * iiIm2Ma(void *data)
Definition ipconv.cc:351
static void * iiBI2P(void *data)
Definition ipconv.cc:50
static void iiBu2P(leftv out, leftv in)
Definition ipconv.cc:64
static void * iiN2Ma(void *data)
Definition ipconv.cc:390
static void * iiN2P(void *data)
Definition ipconv.cc:376
static void * iiV2Ma(void *data)
Definition ipconv.cc:177
static void * iiIV2BIV(void *data)
Definition ipconv.cc:94
static void * iiDummy(void *data)
Definition ipconv.cc:190
void *(* iiConvertProc)(void *data)
Definition ipconv.cc:32
static void * iiI2BI(void *data)
Definition ipconv.cc:220
void(* iiConvertProcL)(leftv out, leftv in)
Definition ipconv.cc:33
static void * iiP2Id(void *data)
Definition ipconv.cc:164
BOOLEAN iiConvert(int inputType, int outputType, int index, leftv input, leftv output, const struct sConvertTypes *dConvertTypes)
Definition ipconv.cc:449
static void * iiMa2Mo(void *data)
Definition ipconv.cc:201
static void * iiI2Id(void *data)
Definition ipconv.cc:108
static void * iiS2Link(void *data)
Definition ipconv.cc:405
static void * iiI2Iv(void *data)
Definition ipconv.cc:207
static void * iiI2N(void *data)
Definition ipconv.cc:214
static void * iiMo2Ma(void *data)
Definition ipconv.cc:195
static void iiR2L_l(leftv out, leftv in)
Definition ipconv.cc:413
static void * iiI2V(void *data)
Definition ipconv.cc:72
int iiTestConvert(int inputType, int outputType, const struct sConvertTypes *dConvertTypes)
Definition ipconv.cc:589
static void * iiIm2Bim(void *data)
Definition ipconv.cc:368
static void * iiBu2Id(void *data)
Definition ipconv.cc:150
static void * iiBu2V(void *data)
Definition ipconv.cc:130
static void * iiBI2Id(void *data)
Definition ipconv.cc:115
static void * iiI2P(void *data)
Definition ipconv.cc:44
iiConvertProcL pl
Definition ipconv.cc:39
static void * iiBI2N(void *data)
Definition ipconv.cc:255
const struct sConvertTypes dConvertTypes[]
Definition table.h:1322
VAR coeffs coeffs_BIGINT
Definition ipid.cc:50
#define IDID(a)
Definition ipid.h:122
syStrategy syConvList(lists li)
Definition ipshell.cc:3256
lists syConvRes(syStrategy syzstr, BOOLEAN toDel, int add_row_shift)
Definition ipshell.cc:3184
STATIC_VAR Poly * h
Definition janet.cc:971
matrix mpNew(int r, int c)
create a r x c zero-matrix
Definition matpol.cc:37
#define MATELEM(mat, i, j)
1-based access to matrix
Definition matpol.h:29
ip_smatrix * matrix
Definition matpol.h:43
#define MATROWS(i)
Definition matpol.h:26
#define MATCOLS(i)
Definition matpol.h:27
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
Definition monomials.h:44
slists * lists
#define nIsZero(n)
Definition numbers.h:19
#define nInit(i)
Definition numbers.h:24
#define omStrDup(s)
#define omAlloc(size)
#define omAlloc0Bin(bin)
#define omFree(addr)
#define omFreeBin(addr, bin)
#define NULL
Definition omList.c:12
static int index(p_Length length, p_Ord ord)
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
Definition p_polys.cc:1476
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition polys.cc:13
Compatibility layer for legacy polynomial operations (over currRing)
#define pDelete(p_ptr)
Definition polys.h:186
#define pIsConstant(p)
like above, except that Comp must be 0
Definition polys.h:238
#define pSetCompP(a, i)
Definition polys.h:303
#define pGetComp(p)
Component.
Definition polys.h:37
#define pNSet(n)
Definition polys.h:313
#define pMaxComp(p)
Definition polys.h:299
#define pSetComp(p, v)
Definition polys.h:38
#define pGetExp(p, i)
Exponent.
Definition polys.h:41
#define pIsPurePower(p)
Definition polys.h:248
#define pISet(i)
Definition polys.h:312
void StringSetS(const char *st)
Definition reporter.cc:128
char * StringEndS()
Definition reporter.cc:151
void Werror(const char *fmt,...)
Definition reporter.cc:189
EXTERN_VAR int traceit
Definition reporter.h:24
#define TRACE_CONV
Definition reporter.h:48
sBucket * sBucket_pt
Definition sbuckets.h:16
void sBucketDestroyAdd(sBucket_pt bucket, poly *p, int *length)
Definition sbuckets.h:68
ideal idInit(int idsize, int rank)
initialise an ideal / module
matrix id_Module2Matrix(ideal mod, const ring R)
ideal id_Matrix2Module(matrix mat, const ring R)
converts mat to module, destroys mat
VAR omBin sSubexpr_bin
Definition subexpr.cc:40
ssyStrategy * syStrategy
Definition syz.h:36
#define IDHDL
Definition tok.h:31
@ ALIAS_CMD
Definition tok.h:34
@ INTVEC_CMD
Definition tok.h:101
@ DEF_CMD
Definition tok.h:58
@ INT_CMD
Definition tok.h:96
#define UNKNOWN
Definition tok.h:224
#define ANY_TYPE
Definition tok.h:30