Context Navigation

source: git/Singular/iparith.cc @ 5ec4a8

spielwiese

Last change on this file since 5ec4a8 was 5ec4a8, checked in by Hans Schönemann <hannes@…>, 15 years ago
*hannes: set module weights for kbase - fix git-svn-id: file:///usr/local/Singular/svn/trunk@11320 2c84dea3-7e68-4137-9b89-c4e89433aadc
Property mode set to `100644`
File size: 249.9 KB

Line
1	/****************************************
2	* Computer Algebra System SINGULAR *
3	****************************************/
4	/* $Id: iparith.cc,v 1.491 2009-01-15 17:22:02 Singular Exp $ */
5
6	/*
7	* ABSTRACT: table driven kernel interface, used by interpreter
8	*/
9
10	#include <stdlib.h>
11	#include <string.h>
12	#include <ctype.h>
13	#include <stdio.h>
14	#include <time.h>
15	#include <unistd.h>
16
17	#include "mod2.h"
18	#include "tok.h"
19	#include "ipid.h"
20	#include "intvec.h"
21	#include "omalloc.h"
22	#include "polys.h"
23	#include "febase.h"
24	#include "sdb.h"
25	#include "longalg.h"
26	#include "ideals.h"
27	#include "matpol.h"
28	#include "kstd1.h"
29	#include "timer.h"
30	#include "ring.h"
31	#include "subexpr.h"
32	#include "lists.h"
33	#include "longalg.h"
34	#include "modulop.h"
35	#ifdef HAVE_RINGS
36	#include "rmodulon.h"
37	#include "rmodulo2m.h"
38	#include "rintegers.h"
39	#endif
40	#include "numbers.h"
41	#include "stairc.h"
42	#include "maps.h"
43	#include "maps_ip.h"
44	#include "syz.h"
45	#include "weight.h"
46	#include "ipconv.h"
47	#include "ipprint.h"
48	#include "attrib.h"
49	#include "silink.h"
50	#include "sparsmat.h"
51	#include "units.h"
52	#include "janet.h"
53	#include "GMPrat.h"
54	#include "tgb.h"
55	#include "walkProc.h"
56	#include "mod_raw.h"
57	#ifdef HAVE_FACTORY
58	#include "clapsing.h"
59	#include "kstdfac.h"
60	#endif /* HAVE_FACTORY */
61	#ifdef HAVE_FGLM
62	#include "fglm.h"
63	#endif /* HAVE_FGLM */
64	#define HAVE_INTERPOLATION
65	#ifdef HAVE_INTERPOLATION
66	#include "interpolation.h"
67	#endif
68
69	#include "ipshell.h"
70	#include "mpr_inout.h"
71
72	#ifdef HAVE_PLURAL
73	#include "gring.h"
74	#include "sca.h"
75	#define ALLOW_PLURAL ,1
76	#define ALLOW_PLURAL_N 1
77	#define NO_PLURAL ,0
78	#define NO_PLURAL_N 0
79	#define COMM_PLURAL ,2
80	#define COMM_PLURAL_N 2
81	#else /* HAVE_PLURAL */
82	#define ALLOW_PLURAL
83	#define NO_PLURAL
84	#define COMM_PLURAL
85	#endif /* HAVE_PLURAL */
86
87	/=============== types =====================/
88	struct sValCmdTab
89	{
90	short cmd;
91	short start;
92	};
93
94	typedef sValCmdTab jjValCmdTab[];
95
96	/* ifdef GENTABLE: definitions are in ipshell.h */
97	#ifndef GENTABLE
98	typedef char * (Proc1)(char );
99	struct sValCmd1
100	{
101	proc1 p;
102	short cmd;
103	short res;
104	short arg;
105	#ifdef HAVE_PLURAL
106	short valid_for_plural;
107	# endif /* HAVE_PLURAL */
108	};
109
110	typedef BOOLEAN (*proc2)(leftv,leftv,leftv);
111	struct sValCmd2
112	{
113	proc2 p;
114	short cmd;
115	short res;
116	short arg1;
117	short arg2;
118	#ifdef HAVE_PLURAL
119	short valid_for_plural;
120	# endif /* HAVE_PLURAL */
121	};
122
123	typedef BOOLEAN (*proc3)(leftv,leftv,leftv,leftv);
124	struct sValCmd3
125	{
126	proc3 p;
127	short cmd;
128	short res;
129	short arg1;
130	short arg2;
131	short arg3;
132	#ifdef HAVE_PLURAL
133	short valid_for_plural;
134	# endif /* HAVE_PLURAL */
135	};
136	struct sValCmdM
137	{
138	proc1 p;
139	short cmd;
140	short res;
141	short number_of_args; /* -1: any, -2: any >0, .. */
142	#ifdef HAVE_PLURAL
143	short valid_for_plural;
144	# endif /* HAVE_PLURAL */
145	};
146	#endif /* GENTABLE */
147
148	typedef struct
149	{
150	cmdnames sCmds; /< array of existing commands /
151	#ifndef GENTABLE
152	struct sValCmd1 *psValCmd1;
153	struct sValCmd2 *psValCmd2;
154	struct sValCmd3 *psValCmd3;
155	struct sValCmdM *psValCmdM;
156	#endif /* GENTABLE */
157	int nCmdUsed; /*< number of commands used /
158	int nCmdAllocated; /*< number of commands-slots allocated /
159	int nLastIdentifier; /*< valid indentifieres are slot 1..nLastIdentifier /
160	} SArithBase;
161
162	/---------------------------------------------------------------------
163	* File scope Variables (Variables share by several functions in
164	* the same file )
165	*
166	---------------------------------------------------------------------/
167	static SArithBase sArithBase; /*< Base entry for arithmetic /
168
169	/---------------------------------------------------------------------
170	* Extern Functions declarations
171	*
172	---------------------------------------------------------------------/
173	static int _gentable_sort_cmds(const void a, const void b);
174	extern int iiArithRemoveCmd(char *szName);
175	extern int iiArithAddCmd(const char *szName, short nAlias, short nTokval,
176	short nToktype, short nPos=-1);
177
178	/============= proc =======================/
179	static BOOLEAN jjLOAD(leftv res, leftv v, BOOLEAN autoexport = FALSE);
180	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op);
181	#ifdef MDEBUG
182	#define jjMakeSub(A) jjDBMakeSub(A,__FILE__,__LINE__)
183	static Subexpr jjDBMakeSub(leftv e,const char *f,const int l);
184	#else
185	static Subexpr jjMakeSub(leftv e);
186	#endif
187
188	/============= vars ======================/
189	extern int cmdtok;
190	extern BOOLEAN expected_parms;
191
192	#define ii_div_by_0 "div. by 0"
193	#define ii_not_for_plural "not implemented for non-commutative rings"
194
195	int iiOp; /* the current operation*/
196
197	#ifdef GENTABLE
198	cmdnames cmds[] =
199	{ // name-string alias tokval toktype
200	{ "$INVALID$", 0, -1, 0},
201	{ "and", 0, '&' , LOGIC_OP},
202	{ "attrib", 0, ATTRIB_CMD , CMD_123},
203	{ "bareiss", 0, BAREISS_CMD , CMD_123},
204	{ "betti", 0, BETTI_CMD , CMD_12},
205	{ "bigint", 0, BIGINT_CMD , ROOT_DECL},
206	#ifdef HAVE_PLURAL
207	{ "bracket", 0, BRACKET_CMD , CMD_2},
208	#endif
209	{ "break", 0, BREAK_CMD , BREAK_CMD},
210	{ "breakpoint", 0, BREAKPOINT_CMD , CMD_M},
211	{ "char", 0, CHARACTERISTIC_CMD ,CMD_1},
212	{ "char_series", 0, CHAR_SERIES_CMD , CMD_1},
213	{ "charstr", 0, CHARSTR_CMD , CMD_1},
214	{ "chinrem", 0, CHINREM_CMD , CMD_2},
215	{ "cleardenom", 0, CONTENT_CMD , CMD_1},
216	{ "close", 0, CLOSE_CMD , CMD_1},
217	{ "coef", 0, COEF_CMD , CMD_M},
218	{ "coeffs", 0, COEFFS_CMD , CMD_23},
219	{ "continue", 0, CONTINUE_CMD , CONTINUE_CMD},
220	{ "contract", 0, CONTRACT_CMD , CMD_2},
221	{ "convhull", 0, NEWTONPOLY_CMD, CMD_1},
222	{ "dbprint", 0, DBPRINT_CMD , CMD_M},
223	{ "def", 0, DEF_CMD , ROOT_DECL},
224	{ "defined", 0, DEFINED_CMD , CMD_1},
225	{ "deg", 0, DEG_CMD , CMD_12},
226	{ "degree", 0, DEGREE_CMD , CMD_1},
227	{ "delete", 0, DELETE_CMD , CMD_2},
228	{ "det", 0, DET_CMD , CMD_1},
229	{ "diff", 0, DIFF_CMD , CMD_2},
230	{ "dim", 0, DIM_CMD , CMD_1},
231	{ "div", 0, INTDIV_CMD , MULDIV_OP},
232	{ "division", 0, DIVISION_CMD , CMD_M},
233	{ "dump", 0, DUMP_CMD, CMD_1},
234	{ "extgcd", 0, EXTGCD_CMD , CMD_2},
235	{ "EXTGCD", 2, EXTGCD_CMD , CMD_2},
236	{ "ERROR", 0, ERROR_CMD , CMD_1},
237	{ "eliminate", 0, ELIMINATION_CMD, CMD_23},
238	{ "else", 0, ELSE_CMD , ELSE_CMD},
239	#ifdef HAVE_PLURAL
240	{ "envelope", 0, ENVELOPE_CMD , CMD_1},
241	#endif
242	{ "eval", 0, EVAL , EVAL},
243	{ "example", 0, EXAMPLE_CMD , EXAMPLE_CMD},
244	{ "execute", 0, EXECUTE_CMD , CMD_1},
245	{ "export", 0, EXPORT_CMD , EXPORT_CMD},
246	{ "exportto", 0, EXPORTTO_CMD , CMD_2},
247	{ "factorize", 0, FAC_CMD , CMD_12},
248	{ "fetch", 0, FETCH_CMD , CMD_2},
249	{ "fglm", 0, FGLM_CMD , CMD_2},
250	{ "fglmquot", 0, FGLMQUOT_CMD, CMD_2},
251	{ "find", 0, FIND_CMD , CMD_23},
252	{ "finduni", 0, FINDUNI_CMD, CMD_1},
253	{ "forif", 0, IF_CMD , IF_CMD},
254	{ "freemodule", 0, FREEMODULE_CMD , CMD_1},
255	{ "facstd", 0, FACSTD_CMD , CMD_12},
256	{ "frwalk", 0, FWALK_CMD , CMD_23},
257	{ "gen", 0, E_CMD , CMD_1},
258	{ "getdump", 0, GETDUMP_CMD, CMD_1},
259	{ "gcd", 0, GCD_CMD , CMD_2},
260	{ "GCD", 2, GCD_CMD , CMD_2},
261	{ "hilb", 0, HILBERT_CMD , CMD_123},
262	{ "highcorner", 0, HIGHCORNER_CMD, CMD_1},
263	{ "homog", 0, HOMOG_CMD , CMD_12},
264	{ "hres", 0, HRES_CMD , CMD_2},
265	{ "ideal", 0, IDEAL_CMD , IDEAL_CMD},
266	{ "if", 0, IF_CMD , IF_CMD},
267	{ "imap", 0, IMAP_CMD , CMD_2},
268	{ "impart", 0, IMPART_CMD , CMD_1},
269	{ "importfrom", 0, IMPORTFROM_CMD , CMD_2},
270	{ "indepSet", 0, INDEPSET_CMD , CMD_12},
271	{ "insert", 0, INSERT_CMD , CMD_23},
272	{ "int", 0, INT_CMD , ROOT_DECL},
273	#ifdef HAVE_INTERPOLATION
274	{ "interpolation",0,INTERPOLATE_CMD , CMD_2},
275	#endif
276	{ "interred", 0, INTERRED_CMD , CMD_1},
277	{ "intersect", 0, INTERSECT_CMD , CMD_M},
278	{ "intmat", 0, INTMAT_CMD , INTMAT_CMD},
279	{ "intvec", 0, INTVEC_CMD , ROOT_DECL_LIST},
280	{ "jacob", 0, JACOB_CMD , CMD_1},
281	{ "janet", 0, JANET_CMD , CMD_12},
282	{ "jet", 0, JET_CMD , CMD_M},
283	{ "kbase", 0, KBASE_CMD , CMD_12},
284	{ "keepring", 0, KEEPRING_CMD , KEEPRING_CMD},
285	{ "kernel", 0, KERNEL_CMD , CMD_2},
286	{ "kill", 0, KILL_CMD , KILL_CMD},
287	{ "killattrib", 0, KILLATTR_CMD , CMD_12},
288	{ "koszul", 0, KOSZUL_CMD , CMD_23},
289	{ "kres", 0, KRES_CMD , CMD_2},
290	{ "laguerre", 0, LAGSOLVE_CMD, CMD_3},
291	{ "lead", 0, LEAD_CMD , CMD_1},
292	{ "leadcoef", 0, LEADCOEF_CMD , CMD_1},
293	{ "leadexp", 0, LEADEXP_CMD , CMD_1},
294	{ "leadmonom", 0, LEADMONOM_CMD , CMD_1},
295	{ "LIB", 0, LIB_CMD , SYSVAR},
296	{ "lift", 0, LIFT_CMD , CMD_23},
297	{ "liftstd", 0, LIFTSTD_CMD , CMD_2},
298	{ "link", 0, LINK_CMD , ROOT_DECL},
299	{ "listvar", 0, LISTVAR_CMD , LISTVAR_CMD},
300	{ "list", 0, LIST_CMD , ROOT_DECL_LIST},
301	{ "load", 0, LOAD_CMD , CMD_12},
302	{ "lres", 0, LRES_CMD , CMD_2},
303	{ "map", 0, MAP_CMD , RING_DECL},
304	{ "matrix", 0, MATRIX_CMD , MATRIX_CMD},
305	{ "maxideal", 0, MAXID_CMD , CMD_1},
306	{ "memory", 0, MEMORY_CMD , CMD_1},
307	{ "minbase", 0, MINBASE_CMD , CMD_1},
308	{ "minor", 0, MINOR_CMD , CMD_23},
309	{ "minres", 0, MINRES_CMD , CMD_1},
310	{ "mod", 0, INTMOD_CMD , MULDIV_OP},
311	{ "module", 0, MODUL_CMD , MODUL_CMD},
312	{ "modulo", 0, MODULO_CMD , CMD_2},
313	{ "monitor", 0, MONITOR_CMD , CMD_12},
314	{ "mpresmat", 0, MPRES_CMD, CMD_2},
315	{ "mult", 0, MULTIPLICITY_CMD , CMD_1},
316	#ifdef OLD_RES
317	{ "mres", 0, MRES_CMD , CMD_23},
318	#else
319	{ "mres", 0, MRES_CMD , CMD_2},
320	#endif
321	{ "mstd", 0, MSTD_CMD , CMD_1},
322	{ "nameof", 0, NAMEOF_CMD , CMD_1},
323	{ "names", 0, NAMES_CMD , CMD_M},
324	#ifdef HAVE_PLURAL
325	{ "ncalgebra", 2, NCALGEBRA_CMD , CMD_2},
326	{ "nc_algebra", 0, NC_ALGEBRA_CMD , CMD_2},
327	#endif
328	{ "ncols", 0, COLS_CMD , CMD_1},
329	{ "not", 0, NOT , NOT},
330	{ "npars", 0, NPARS_CMD , CMD_1},
331	#ifdef OLD_RES
332	{ "nres", 0, RES_CMD , CMD_23},
333	#else
334	{ "nres", 0, RES_CMD , CMD_2},
335	#endif
336	{ "nrows", 0, ROWS_CMD , CMD_1},
337	{ "number", 0, NUMBER_CMD , RING_DECL},
338	{ "nvars", 0, NVARS_CMD , CMD_1},
339	{ "open", 0, OPEN_CMD , CMD_1},
340	#ifdef HAVE_PLURAL
341	{ "oppose", 0, OPPOSE_CMD , CMD_2},
342	{ "opposite", 0, OPPOSITE_CMD , CMD_1},
343	#endif
344	{ "option", 0, OPTION_CMD , CMD_M},
345	{ "or", 0, '\|' , LOGIC_OP},
346	{ "ord", 0, ORD_CMD , CMD_1},
347	{ "ordstr", 0, ORDSTR_CMD , CMD_1},
348	{ "package", 0, PACKAGE_CMD , ROOT_DECL},
349	{ "par", 0, PAR_CMD , CMD_1},
350	{ "parameter", 0, PARAMETER , PARAMETER},
351	{ "pardeg", 0, PARDEG_CMD , CMD_1},
352	{ "parstr", 0, PARSTR_CMD , CMD_12},
353	{ "poly", 0, POLY_CMD , RING_DECL},
354	{ "preimage", 0, PREIMAGE_CMD , CMD_13},
355	{ "prime", 0, PRIME_CMD , CMD_1},
356	{ "print", 0, PRINT_CMD , CMD_12},
357	{ "prune", 0, PRUNE_CMD , CMD_1},
358	{ "proc", 0, PROC_CMD , PROC_CMD},
359	{ "qhweight", 0, QHWEIGHT_CMD , CMD_1},
360	{ "qring", 0, QRING_CMD , ROOT_DECL},
361	{ "quote", 0, QUOTE , QUOTE},
362	{ "quotient", 0, QUOTIENT_CMD , CMD_2},
363	{ "random", 0, RANDOM_CMD , CMD_23},
364	{ "read", 0, READ_CMD , CMD_12},
365	{ "reduce", 0, REDUCE_CMD , CMD_M},
366	{ "regularity", 0, REGULARITY_CMD , CMD_1},
367	{ "repart", 0, REPART_CMD , CMD_1},
368	{ "reservedName",0, RESERVEDNAME_CMD , CMD_M},
369	{ "resolution", 0, RESOLUTION_CMD , RING_DECL},
370	{ "resultant", 0, RESULTANT_CMD, CMD_3},
371	{ "return", 0, RETURN , RETURN},
372	{ "RETURN", 0, END_GRAMMAR , RETURN},
373	{ "ring", 0, RING_CMD , RING_CMD},
374	{ "ringlist", 0, RINGLIST_CMD , CMD_1},
375	{ "rvar", 0, IS_RINGVAR , CMD_1},
376	{ "setring", 0, SETRING_CMD , SETRING_CMD},
377	{ "simplex", 0, SIMPLEX_CMD, CMD_M},
378	{ "simplify", 0, SIMPLIFY_CMD , CMD_2},
379	{ "size", 0, COUNT_CMD , CMD_1},
380	{ "slimgb", 0, SLIM_GB_CMD , CMD_1},
381	{ "sortvec", 0, SORTVEC_CMD , CMD_1},
382	{ "sqrfree", 0, SQR_FREE_CMD , CMD_1},
383	#ifdef OLD_RES
384	{ "sres", 0, SRES_CMD , CMD_23},
385	#else /* OLD_RES */
386	{ "sres", 0, SRES_CMD , CMD_2},
387	#endif /* OLD_RES */
388	{ "status", 0, STATUS_CMD, CMD_M},
389	{ "std", 0, STD_CMD , CMD_123},
390	{ "string", 0, STRING_CMD , ROOT_DECL_LIST},
391	{ "subst", 0, SUBST_CMD , CMD_M},
392	{ "system", 0, SYSTEM_CMD, CMD_M},
393	{ "syz", 0, SYZYGY_CMD , CMD_1},
394	{ "test", 0, TEST_CMD , CMD_M},
395	{ "trace", 0, TRACE_CMD , CMD_1},
396	{ "transpose", 0, TRANSPOSE_CMD , CMD_1},
397	#ifdef HAVE_PLURAL
398	{ "twostd", 0, TWOSTD_CMD , CMD_1},
399	#endif /* HAVE_PLURAL */
400	{ "type", 0, TYPE_CMD , TYPE_CMD},
401	{ "typeof", 0, TYPEOF_CMD , CMD_1},
402	{ "univariate", 0, UNIVARIATE_CMD, CMD_1},
403	{ "uressolve", 0, URSOLVE_CMD, CMD_M},
404	{ "vandermonde", 0, VANDER_CMD, CMD_3},
405	{ "var", 0, VAR_CMD , CMD_1},
406	{ "variables", 0, VARIABLES_CMD, CMD_1},
407	{ "varstr", 0, VARSTR_CMD , CMD_12},
408	{ "vdim", 0, VDIM_CMD , CMD_1},
409	{ "vector", 0, VECTOR_CMD , RING_DECL},
410	{ "wedge", 0, WEDGE_CMD , CMD_2},
411	{ "weight", 0, WEIGHT_CMD , CMD_1},
412	{ "whileif", 0, IF_CMD , IF_CMD},
413	{ "write", 0, WRITE_CMD , CMD_M},
414	/* delete for next version:*/
415	{ "IN", 1, LEAD_CMD , CMD_1},
416	{ "NF", 1, REDUCE_CMD , CMD_M},
417	{ "multiplicity",1, MULTIPLICITY_CMD , CMD_1},
418	{ "verbose", 2, OPTION_CMD , CMD_M},
419	// { "rank", 1, ROWS_CMD , CMD_1},
420	// { "Current", 0, -1 , SYSVAR},
421	// { "Top", 0, -1 , SYSVAR},
422	// { "Up", 0, -1 , SYSVAR},
423
424	/* set sys vars*/
425	{ "degBound", 0, VMAXDEG , SYSVAR},
426	{ "echo", 0, VECHO , SYSVAR},
427	{ "minpoly", 0, VMINPOLY , SYSVAR},
428	{ "multBound", 0, VMAXMULT , SYSVAR},
429	{ "noether", 0, VNOETHER , SYSVAR},
430	{ "pagelength", 0, VPAGELENGTH , SYSVAR},
431	{ "pagewidth", 0, VCOLMAX , SYSVAR},
432	{ "printlevel", 0, VPRINTLEVEL , SYSVAR},
433	{ "short", 0, VSHORTOUT , SYSVAR},
434	{ "timer", 0, VTIMER , SYSVAR},
435	{ "rtimer", 0, VRTIMER, SYSVAR},
436	{ "TRACE", 0, TRACE , SYSVAR},
437	{ "voice", 0, VOICE , SYSVAR},
438
439	/* other reserved words:scanner.l */
440	{ "pause", 2, -1 , 0},
441	{ "while", 0, -1 , 0},
442	{ "for", 0, -1 , 0},
443	{ "help", 0, -1 , 0},
444	{ "newline", 0, -1 , 0},
445	{ "exit", 0, -1 , 0},
446	{ "quit", 0, -1 , 0},
447	/* end of list marker */
448	{ NULL, 0, 0, 0}
449	};
450	#endif /* GENTABLE */
451
452	/=================== operations with 2 args.: static proc =================/
453	static BOOLEAN jjOP_IV_I(leftv res, leftv u, leftv v)
454	{
455	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
456	int bb = (int)(long)(v->Data());
457	if (errorreported) return TRUE;
458	switch (iiOp)
459	{
460	case '+': (*aa) += bb; break;
461	case '-': (*aa) -= bb; break;
462	case '': (aa) *= bb; break;
463	case '/':
464	case INTDIV_CMD: (*aa) /= bb; break;
465	case '%':
466	case INTMOD_CMD: (*aa) %= bb; break;
467	}
468	res->data=(char *)aa;
469	return FALSE;
470	}
471	static BOOLEAN jjOP_I_IV(leftv res, leftv u, leftv v)
472	{
473	return jjOP_IV_I(res,v,u);
474	}
475	static BOOLEAN jjOP_IM_I(leftv res, leftv u, leftv v)
476	{
477	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
478	int bb = (int)(long)(v->Data());
479	int i=si_min(aa->rows(),aa->cols());
480	switch (iiOp)
481	{
482	case '+': for (;i>0;i--) IMATELEM(*aa,i,i) += bb;
483	break;
484	case '-': for (;i>0;i--) IMATELEM(*aa,i,i) -= bb;
485	break;
486	}
487	res->data=(char *)aa;
488	return FALSE;
489	}
490	static BOOLEAN jjOP_I_IM(leftv res, leftv u, leftv v)
491	{
492	return jjOP_IM_I(res,v,u);
493	}
494	static BOOLEAN jjCOLON(leftv res, leftv u, leftv v)
495	{
496	int l=(int)(long)v->Data();
497	if (l>0)
498	{
499	int d=(int)(long)u->Data();
500	intvec *vv=new intvec(l);
501	int i;
502	for(i=0;i<l;i++) { (*vv)[i]=d; }
503	res->data=(char *)vv;
504	}
505	return (l<=0);
506	}
507	static BOOLEAN jjDOTDOT(leftv res, leftv u, leftv v)
508	{
509	res->data=(char *)new intvec((int)(long)u->Data(),(int)(long)v->Data());
510	return FALSE;
511	}
512	static void jjEQUAL_REST(leftv res,leftv u,leftv v);
513	static BOOLEAN jjCOMPARE_IV(leftv res, leftv u, leftv v)
514	{
515	intvec* a = (intvec * )(u->Data());
516	intvec* b = (intvec * )(v->Data());
517	int r=a->compare(b);
518	switch (iiOp)
519	{
520	case '<':
521	res->data = (char *) (r<0);
522	break;
523	case '>':
524	res->data = (char *) (r>0);
525	break;
526	case LE:
527	res->data = (char *) (r<=0);
528	break;
529	case GE:
530	res->data = (char *) (r>=0);
531	break;
532	case EQUAL_EQUAL:
533	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
534	res->data = (char *) (r==0);
535	break;
536	}
537	jjEQUAL_REST(res,u,v);
538	if(r==-2) { WerrorS("size incompatible"); return TRUE; }
539	return FALSE;
540	}
541	static BOOLEAN jjCOMPARE_IV_I(leftv res, leftv u, leftv v)
542	{
543	intvec* a = (intvec * )(u->Data());
544	int b = (int)(long)(v->Data());
545	int r=a->compare(b);
546	switch (iiOp)
547	{
548	case '<':
549	res->data = (char *) (r<0);
550	break;
551	case '>':
552	res->data = (char *) (r>0);
553	break;
554	case LE:
555	res->data = (char *) (r<=0);
556	break;
557	case GE:
558	res->data = (char *) (r>=0);
559	break;
560	case EQUAL_EQUAL:
561	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
562	res->data = (char *) (r==0);
563	break;
564	}
565	jjEQUAL_REST(res,u,v);
566	return FALSE;
567	}
568	static BOOLEAN jjCOMPARE_P(leftv res, leftv u, leftv v)
569	{
570	poly p=(poly)u->Data();
571	poly q=(poly)v->Data();
572	int r=pCmp(p,q);
573	if (r==0)
574	{
575	number h=nSub(pGetCoeff(p),pGetCoeff(q));
576	/* compare lead coeffs */
577	r = -1+nIsZero(h)+2nGreaterZero(h); / -1: <, 0:==, 1: > */
578	nDelete(&h);
579	}
580	else if (p==NULL)
581	{
582	if (q==NULL)
583	{
584	/* compare 0, 0 */
585	r=0;
586	}
587	else if(pIsConstant(q))
588	{
589	/* compare 0, const */
590	r = 1-2nGreaterZero(pGetCoeff(q)); / -1: <, 1: > */
591	}
592	}
593	else if (q==NULL)
594	{
595	if (pIsConstant(p))
596	{
597	/* compare const, 0 */
598	r = -1+2nGreaterZero(pGetCoeff(p)); / -1: <, 1: > */
599	}
600	}
601	switch (iiOp)
602	{
603	case '<':
604	res->data = (char *) (r < 0);
605	break;
606	case '>':
607	res->data = (char *) (r > 0);
608	break;
609	case LE:
610	res->data = (char *) (r <= 0);
611	break;
612	case GE:
613	res->data = (char *) (r >= 0);
614	break;
615	//case EQUAL_EQUAL:
616	//case NOTEQUAL: /* negation handled by jjEQUAL_REST */
617	// res->data = (char *) (r == 0);
618	// break;
619	}
620	jjEQUAL_REST(res,u,v);
621	return FALSE;
622	}
623	static BOOLEAN jjCOMPARE_S(leftv res, leftv u, leftv v)
624	{
625	char* a = (char * )(u->Data());
626	char* b = (char * )(v->Data());
627	int result = strcmp(a,b);
628	switch (iiOp)
629	{
630	case '<':
631	res->data = (char *) (result < 0);
632	break;
633	case '>':
634	res->data = (char *) (result > 0);
635	break;
636	case LE:
637	res->data = (char *) (result <= 0);
638	break;
639	case GE:
640	res->data = (char *) (result >= 0);
641	break;
642	case EQUAL_EQUAL:
643	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
644	res->data = (char *) (result == 0);
645	break;
646	}
647	jjEQUAL_REST(res,u,v);
648	return FALSE;
649	}
650	static BOOLEAN jjOP_REST(leftv res, leftv u, leftv v)
651	{
652	if (u->Next()!=NULL)
653	{
654	u=u->next;
655	res->next = (leftv)omAllocBin(sleftv_bin);
656	return iiExprArith2(res->next,u,iiOp,v);
657	}
658	else if (v->Next()!=NULL)
659	{
660	v=v->next;
661	res->next = (leftv)omAllocBin(sleftv_bin);
662	return iiExprArith2(res->next,u,iiOp,v);
663	}
664	return FALSE;
665	}
666	static BOOLEAN jjPOWER_I(leftv res, leftv u, leftv v)
667	{
668	int b=(int)(long)u->Data();
669	int e=(int)(long)v->Data();
670	int rc = 1;
671	BOOLEAN overflow=FALSE;
672	if (e >= 0)
673	{
674	if (b==0)
675	{
676	rc=(e==0);
677	}
678	else
679	{
680	int oldrc;
681	while ((e--)!=0)
682	{
683	oldrc=rc;
684	rc *= b;
685	if (!overflow)
686	{
687	if(rc/b!=oldrc) overflow=TRUE;
688	}
689	}
690	if (overflow)
691	WarnS("int overflow(^), result may be wrong");
692	}
693	res->data = (char *)((long)rc);
694	if (u!=NULL) return jjOP_REST(res,u,v);
695	return FALSE;
696	}
697	else
698	{
699	WerrorS("exponent must be non-negative");
700	return TRUE;
701	}
702	}
703	static BOOLEAN jjPOWER_BI(leftv res, leftv u, leftv v)
704	{
705	int e=(int)(long)v->Data();
706	number n=(number)u->Data();
707	if (e>=0)
708	{
709	nlPower(n,e,(number*)&res->data);
710	}
711	else
712	{
713	WerrorS("exponent must be non-negative");
714	return TRUE;
715	}
716	if (u!=NULL) return jjOP_REST(res,u,v);
717	return FALSE;
718	}
719	static BOOLEAN jjPOWER_N(leftv res, leftv u, leftv v)
720	{
721	int e=(int)(long)v->Data();
722	number n=(number)u->Data();
723	int d=0;
724	if (e<0)
725	{
726	n=nInvers(n);
727	e=-e;
728	d=1;
729	}
730	nPower(n,e,(number*)&res->data);
731	if (d) nDelete(&n);
732	if (u!=NULL) return jjOP_REST(res,u,v);
733	return FALSE;
734	}
735	static BOOLEAN jjPOWER_P(leftv res, leftv u, leftv v)
736	{
737	res->data = (char *)pPower((poly)u->CopyD(POLY_CMD),(int)(long)v->Data());
738	if (u!=NULL) return jjOP_REST(res,u,v);
739	return errorreported; /* pPower may set errorreported via Werror */
740	}
741	static BOOLEAN jjPOWER_ID(leftv res, leftv u, leftv v)
742	{
743	res->data = (char *)idPower((ideal)(u->Data()),(int)(long)(v->Data()));
744	if (u!=NULL) return jjOP_REST(res,u,v);
745	return FALSE;
746	}
747	static BOOLEAN jjPLUSMINUS_Gen(leftv res, leftv u, leftv v)
748	{
749	u=u->next;
750	v=v->next;
751	if (u==NULL)
752	{
753	if (v==NULL) return FALSE; /* u==NULL, v==NULL */
754	if (iiOp=='-') /* u==NULL, v<>NULL, iiOp=='-'*/
755	{
756	do
757	{
758	if (res->next==NULL)
759	res->next = (leftv)omAlloc0Bin(sleftv_bin);
760	leftv tmp_v=v->next;
761	v->next=NULL;
762	BOOLEAN b=iiExprArith1(res->next,v,'-');
763	v->next=tmp_v;
764	if (b)
765	return TRUE;
766	v=tmp_v;
767	res=res->next;
768	} while (v!=NULL);
769	return FALSE;
770	}
771	loop /* u==NULL, v<>NULL, iiOp=='+' */
772	{
773	res->next = (leftv)omAlloc0Bin(sleftv_bin);
774	res=res->next;
775	res->data = v->CopyD();
776	res->rtyp = v->Typ();
777	v=v->next;
778	if (v==NULL) return FALSE;
779	}
780	}
781	if (v!=NULL) /* u<>NULL, v<>NULL */
782	{
783	do
784	{
785	res->next = (leftv)omAlloc0Bin(sleftv_bin);
786	leftv tmp_u=u->next; u->next=NULL;
787	leftv tmp_v=v->next; v->next=NULL;
788	BOOLEAN b=iiExprArith2(res->next,u,iiOp,v);
789	u->next=tmp_u;
790	v->next=tmp_v;
791	if (b)
792	return TRUE;
793	u=tmp_u;
794	v=tmp_v;
795	res=res->next;
796	} while ((u!=NULL) && (v!=NULL));
797	return FALSE;
798	}
799	loop /* u<>NULL, v==NULL */
800	{
801	res->next = (leftv)omAlloc0Bin(sleftv_bin);
802	res=res->next;
803	res->data = u->CopyD();
804	res->rtyp = u->Typ();
805	u=u->next;
806	if (u==NULL) return FALSE;
807	}
808	}
809	static BOOLEAN jjCOLCOL(leftv res, leftv u, leftv v)
810	{
811	#ifdef HAVE_NS
812	idhdl packhdl;
813	switch(u->Typ())
814	{
815	case 0:
816	Print("%s of type 'ANY'. Trying load.\n", v->name);
817	if(iiTryLoadLib(u, u->name))
818	{
819	Werror("'%s' no such package", u->name);
820	return TRUE;
821	}
822	syMake(u,u->name,NULL);
823	// else: use next case !!! no break !!!
824	case PACKAGE_CMD:
825	packhdl = (idhdl)u->data;
826	if((!IDPACKAGE(packhdl)->loaded)
827	&& (IDPACKAGE(packhdl)->language > LANG_TOP))
828	{
829	//if(iiReLoadLib(packhdl))
830	// Werror("unable to reload package '%s'", IDID(packhdl));
831	Werror("'%s' not loaded", u->name);
832	return TRUE;
833	}
834	if(v->rtyp == IDHDL)
835	{
836	v->name = omStrDup(v->name);
837	}
838	v->req_packhdl=IDPACKAGE(packhdl);
839	v->packhdl=IDPACKAGE(packhdl);
840	syMake(v, v->name, packhdl);
841	memcpy(res, v, sizeof(sleftv));
842	memset(v, 0, sizeof(sleftv));
843	break;
844	case DEF_CMD:
845	break;
846	default:
847	WerrorS("<package>::<id> expected");
848	return TRUE;
849	}
850	#else /* HAVE_NS */
851	WerrorS("package is not supported in this version");
852	#endif /* HAVE_NS */
853	return FALSE;
854	}
855	static BOOLEAN jjPLUS_I(leftv res, leftv u, leftv v)
856	{
857	unsigned int a=(unsigned int)(unsigned long)u->Data();
858	unsigned int b=(unsigned int)(unsigned long)v->Data();
859	unsigned int c=a+b;
860	res->data = (char *)((long)c);
861	if (((Sy_bit(31)&a)==(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
862	{
863	WarnS("int overflow(+), result may be wrong");
864	}
865	return jjPLUSMINUS_Gen(res,u,v);
866	}
867	static BOOLEAN jjPLUS_BI(leftv res, leftv u, leftv v)
868	{
869	res->data = (char *)(nlAdd((number)u->Data(), (number)v->Data()));
870	return jjPLUSMINUS_Gen(res,u,v);
871	}
872	static BOOLEAN jjPLUS_N(leftv res, leftv u, leftv v)
873	{
874	res->data = (char *)(nAdd((number)u->Data(), (number)v->Data()));
875	return jjPLUSMINUS_Gen(res,u,v);
876	}
877	static BOOLEAN jjPLUS_P(leftv res, leftv u, leftv v)
878	{
879	res->data = (char *)(pAdd((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
880	return jjPLUSMINUS_Gen(res,u,v);
881	}
882	static BOOLEAN jjPLUS_IV(leftv res, leftv u, leftv v)
883	{
884	res->data = (char )ivAdd((intvec)(u->Data()), (intvec*)(v->Data()));
885	if (res->data==NULL)
886	{
887	WerrorS("intmat size not compatible");
888	return TRUE;
889	}
890	return jjPLUSMINUS_Gen(res,u,v);
891	return FALSE;
892	}
893	static BOOLEAN jjPLUS_MA(leftv res, leftv u, leftv v)
894	{
895	matrix A=(matrix)u->Data(); matrix B=(matrix)v->Data();
896	res->data = (char *)(mpAdd(A , B));
897	if (res->data==NULL)
898	{
899	Werror("matrix size not compatible(%dx%d, %dx%d)",
900	MATROWS(A),MATCOLS(A),MATROWS(B),MATCOLS(B));
901	return TRUE;
902	}
903	return jjPLUSMINUS_Gen(res,u,v);
904	}
905	static BOOLEAN jjPLUS_MA_P(leftv res, leftv u, leftv v)
906	{
907	matrix m=(matrix)u->Data();
908	matrix p= mpInitP(m->nrows,m->ncols,(poly)(v->CopyD(POLY_CMD)));
909	if (iiOp=='+')
910	res->data = (char *)mpAdd(m , p);
911	else
912	res->data = (char *)mpSub(m , p);
913	idDelete((ideal *)&p);
914	return jjPLUSMINUS_Gen(res,u,v);
915	}
916	static BOOLEAN jjPLUS_P_MA(leftv res, leftv u, leftv v)
917	{
918	return jjPLUS_MA_P(res,v,u);
919	}
920	static BOOLEAN jjPLUS_S(leftv res, leftv u, leftv v)
921	{
922	char* a = (char * )(u->Data());
923	char* b = (char * )(v->Data());
924	char* r = (char * )omAlloc(strlen(a) + strlen(b) + 1);
925	strcpy(r,a);
926	strcat(r,b);
927	res->data=r;
928	return jjPLUSMINUS_Gen(res,u,v);
929	}
930	static BOOLEAN jjPLUS_ID(leftv res, leftv u, leftv v)
931	{
932	res->data = (char *)idAdd((ideal)u->Data(),(ideal)v->Data());
933	return jjPLUSMINUS_Gen(res,u,v);
934	}
935	static BOOLEAN jjMINUS_I(leftv res, leftv u, leftv v)
936	{
937	unsigned int a=(unsigned int)(unsigned long)u->Data();
938	unsigned int b=(unsigned int)(unsigned long)v->Data();
939	unsigned int c=a-b;
940	if (((Sy_bit(31)&a)!=(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
941	{
942	WarnS("int overflow(-), result may be wrong");
943	}
944	res->data = (char *)((long)c);
945	return jjPLUSMINUS_Gen(res,u,v);
946	}
947	static BOOLEAN jjMINUS_BI(leftv res, leftv u, leftv v)
948	{
949	res->data = (char *)(nlSub((number)u->Data(), (number)v->Data()));
950	return jjPLUSMINUS_Gen(res,u,v);
951	}
952	static BOOLEAN jjMINUS_N(leftv res, leftv u, leftv v)
953	{
954	res->data = (char *)(nSub((number)u->Data(), (number)v->Data()));
955	return jjPLUSMINUS_Gen(res,u,v);
956	}
957	static BOOLEAN jjMINUS_P(leftv res, leftv u, leftv v)
958	{
959	res->data = (char *)(pSub((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
960	return jjPLUSMINUS_Gen(res,u,v);
961	}
962	static BOOLEAN jjMINUS_IV(leftv res, leftv u, leftv v)
963	{
964	res->data = (char )ivSub((intvec)(u->Data()), (intvec*)(v->Data()));
965	if (res->data==NULL)
966	{
967	WerrorS("intmat size not compatible");
968	return TRUE;
969	}
970	return jjPLUSMINUS_Gen(res,u,v);
971	}
972	static BOOLEAN jjMINUS_MA(leftv res, leftv u, leftv v)
973	{
974	matrix A=(matrix)u->Data(); matrix B=(matrix)v->Data();
975	res->data = (char *)(mpSub(A , B));
976	if (res->data==NULL)
977	{
978	Werror("matrix size not compatible(%dx%d, %dx%d)",
979	MATROWS(A),MATCOLS(A),MATROWS(B),MATCOLS(B));
980	return TRUE;
981	}
982	return jjPLUSMINUS_Gen(res,u,v);
983	return FALSE;
984	}
985	static BOOLEAN jjTIMES_I(leftv res, leftv u, leftv v)
986	{
987	int a=(int)(long)u->Data();
988	int b=(int)(long)v->Data();
989	int c=a * b;
990	if ((b!=0) && (c/b !=a))
991	WarnS("int overflow(*), result may be wrong");
992	res->data = (char *)((long)c);
993	if ((u->Next()!=NULL) \|\| (v->Next()!=NULL))
994	return jjOP_REST(res,u,v);
995	return FALSE;
996	}
997	static BOOLEAN jjTIMES_BI(leftv res, leftv u, leftv v)
998	{
999	res->data = (char *)(nlMult( (number)u->Data(), (number)v->Data()));
1000	if ((v->next!=NULL) \|\| (u->next!=NULL))
1001	return jjOP_REST(res,u,v);
1002	return FALSE;
1003	}
1004	static BOOLEAN jjTIMES_N(leftv res, leftv u, leftv v)
1005	{
1006	res->data = (char *)(nMult( (number)u->Data(), (number)v->Data()));
1007	number n=(number)res->data;
1008	nNormalize(n);
1009	res->data=(char *)n;
1010	if ((v->next!=NULL) \|\| (u->next!=NULL))
1011	return jjOP_REST(res,u,v);
1012	return FALSE;
1013	}
1014	static BOOLEAN jjTIMES_P(leftv res, leftv u, leftv v)
1015	{
1016	poly a;
1017	poly b;
1018	if (v->next==NULL)
1019	{
1020	a=(poly)u->CopyD(POLY_CMD); // works also for VECTOR_CMD
1021	if (u->next==NULL)
1022	{
1023	b=(poly)v->CopyD(POLY_CMD); // works also for VECTOR_CMD
1024	res->data = (char *)(pMult( a, b));
1025	pNormalize((poly)res->data);
1026	return FALSE;
1027	}
1028	// u->next exists: copy v
1029	b=pCopy((poly)v->Data());
1030	res->data = (char *)(pMult( a, b));
1031	pNormalize((poly)res->data);
1032	return jjOP_REST(res,u,v);
1033	}
1034	// v->next exists: copy u
1035	a=pCopy((poly)u->Data());
1036	b=(poly)v->CopyD(POLY_CMD); // works also for VECTOR_CMD
1037	res->data = (char *)(pMult( a, b));
1038	pNormalize((poly)res->data);
1039	return jjOP_REST(res,u,v);
1040	}
1041	static BOOLEAN jjTIMES_ID(leftv res, leftv u, leftv v)
1042	{
1043	res->data = (char *)idMult((ideal)u->Data(),(ideal)v->Data());
1044	idNormalize((ideal)res->data);
1045	if ((v->next!=NULL) \|\| (u->next!=NULL))
1046	return jjOP_REST(res,u,v);
1047	return FALSE;
1048	}
1049	static BOOLEAN jjTIMES_IV(leftv res, leftv u, leftv v)
1050	{
1051	res->data = (char )ivMult((intvec)(u->Data()), (intvec*)(v->Data()));
1052	if (res->data==NULL)
1053	{
1054	WerrorS("intmat size not compatible");
1055	return TRUE;
1056	}
1057	if ((v->next!=NULL) \|\| (u->next!=NULL))
1058	return jjOP_REST(res,u,v);
1059	return FALSE;
1060	}
1061	static BOOLEAN jjTIMES_MA_P1(leftv res, leftv u, leftv v)
1062	{
1063	poly p=(poly)v->CopyD(POLY_CMD);
1064	int r=pMaxComp(p);/* recompute the rank for the case idealvector/
1065	ideal I= (ideal)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
1066	if (r>0) I->rank=r;
1067	idNormalize(I);
1068	res->data = (char *)I;
1069	return FALSE;
1070	}
1071	static BOOLEAN jjTIMES_MA_P2(leftv res, leftv u, leftv v)
1072	{
1073	return jjTIMES_MA_P1(res,v,u);
1074	}
1075	static BOOLEAN jjTIMES_MA_N1(leftv res, leftv u, leftv v)
1076	{
1077	number n=(number)v->CopyD(NUMBER_CMD);
1078	poly p=pOne();
1079	pSetCoeff(p,n);
1080	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
1081	idNormalize((ideal)res->data);
1082	return FALSE;
1083	}
1084	static BOOLEAN jjTIMES_MA_N2(leftv res, leftv u, leftv v)
1085	{
1086	return jjTIMES_MA_N1(res,v,u);
1087	}
1088	static BOOLEAN jjTIMES_MA_I1(leftv res, leftv u, leftv v)
1089	{
1090	res->data = (char *)mpMultI((matrix)u->CopyD(MATRIX_CMD),(int)(long)v->Data());
1091	idNormalize((ideal)res->data);
1092	return FALSE;
1093	}
1094	static BOOLEAN jjTIMES_MA_I2(leftv res, leftv u, leftv v)
1095	{
1096	return jjTIMES_MA_I1(res,v,u);
1097	}
1098	static BOOLEAN jjTIMES_MA(leftv res, leftv u, leftv v)
1099	{
1100	matrix A=(matrix)u->Data(); matrix B=(matrix)v->Data();
1101	res->data = (char *)mpMult(A,B);
1102	if (res->data==NULL)
1103	{
1104	Werror("matrix size not compatible(%dx%d, %dx%d)",
1105	MATROWS(A),MATCOLS(A),MATROWS(B),MATCOLS(B));
1106	return TRUE;
1107	}
1108	idNormalize((ideal)res->data);
1109	if ((v->next!=NULL) \|\| (u->next!=NULL))
1110	return jjOP_REST(res,u,v);
1111	return FALSE;
1112	}
1113	static BOOLEAN jjGE_BI(leftv res, leftv u, leftv v)
1114	{
1115	number h=nlSub((number)u->Data(),(number)v->Data());
1116	res->data = (char *) (nlGreaterZero(h)\|\|(nlIsZero(h)));
1117	nlDelete(&h,NULL);
1118	return FALSE;
1119	}
1120	static BOOLEAN jjGE_I(leftv res, leftv u, leftv v)
1121	{
1122	res->data = (char *)((int)((long)u->Data()) >= (int)((long)v->Data()));
1123	return FALSE;
1124	}
1125	static BOOLEAN jjGE_N(leftv res, leftv u, leftv v)
1126	{
1127	number h=nSub((number)u->Data(),(number)v->Data());
1128	res->data = (char *) (nGreaterZero(h)\|\|(nIsZero(h)));
1129	nDelete(&h);
1130	return FALSE;
1131	}
1132	static BOOLEAN jjGT_BI(leftv res, leftv u, leftv v)
1133	{
1134	number h=nlSub((number)u->Data(),(number)v->Data());
1135	res->data = (char *) (nlGreaterZero(h)&&(!nlIsZero(h)));
1136	nlDelete(&h,NULL);
1137	return FALSE;
1138	}
1139	static BOOLEAN jjGT_I(leftv res, leftv u, leftv v)
1140	{
1141	res->data = (char *)((int)((long)u->Data()) > (int)((long)v->Data()));
1142	return FALSE;
1143	}
1144	static BOOLEAN jjGT_N(leftv res, leftv u, leftv v)
1145	{
1146	number h=nSub((number)u->Data(),(number)v->Data());
1147	res->data = (char *) (nGreaterZero(h)&&(!nIsZero(h)));
1148	nDelete(&h);
1149	return FALSE;
1150	}
1151	static BOOLEAN jjLE_BI(leftv res, leftv u, leftv v)
1152	{
1153	return jjGE_BI(res,v,u);
1154	}
1155	static BOOLEAN jjLE_I(leftv res, leftv u, leftv v)
1156	{
1157	res->data = (char *)((int)((long)u->Data()) <= (int)((long)v->Data()));
1158	return FALSE;
1159	}
1160	static BOOLEAN jjLE_N(leftv res, leftv u, leftv v)
1161	{
1162	return jjGE_N(res,v,u);
1163	}
1164	static BOOLEAN jjLT_BI(leftv res, leftv u, leftv v)
1165	{
1166	return jjGT_BI(res,v,u);
1167	}
1168	static BOOLEAN jjLT_I(leftv res, leftv u, leftv v)
1169	{
1170	res->data = (char *)((int)((long)u->Data()) < (int)((long)v->Data()));
1171	return FALSE;
1172	}
1173	static BOOLEAN jjLT_N(leftv res, leftv u, leftv v)
1174	{
1175	return jjGT_N(res,v,u);
1176	}
1177	static BOOLEAN jjDIVMOD_I(leftv res, leftv u, leftv v)
1178	{
1179	int a= (int)(long)u->Data();
1180	int b= (int)(long)v->Data();
1181	if (b==0)
1182	{
1183	WerrorS(ii_div_by_0);
1184	return TRUE;
1185	}
1186	int bb=ABS(b);
1187	int c=a%bb;
1188	if(c<0) c+=bb;
1189	int r=0;
1190	switch (iiOp)
1191	{
1192	case INTMOD_CMD:
1193	r=c; break;
1194	case '%':
1195	r= (a % b); break;
1196	case INTDIV_CMD:
1197	r=((a-c) /b); break;
1198	case '/':
1199	r= (a / b); break;
1200	}
1201	res->data=(void *)((long)r);
1202	return FALSE;
1203	}
1204	static BOOLEAN jjDIV_BI(leftv res, leftv u, leftv v)
1205	{
1206	number q=(number)v->Data();
1207	if (nlIsZero(q))
1208	{
1209	WerrorS(ii_div_by_0);
1210	return TRUE;
1211	}
1212	q = nlIntDiv((number)u->Data(),q);
1213	nlNormalize(q);
1214	res->data = (char *)q;
1215	return FALSE;
1216	}
1217	static BOOLEAN jjDIV_N(leftv res, leftv u, leftv v)
1218	{
1219	number q=(number)v->Data();
1220	if (nIsZero(q))
1221	{
1222	WerrorS(ii_div_by_0);
1223	return TRUE;
1224	}
1225	q = nDiv((number)u->Data(),q);
1226	nNormalize(q);
1227	res->data = (char *)q;
1228	return FALSE;
1229	}
1230	static BOOLEAN jjDIV_P(leftv res, leftv u, leftv v)
1231	{
1232	poly q=(poly)v->Data();
1233	if (q==NULL)
1234	{
1235	WerrorS(ii_div_by_0);
1236	return TRUE;
1237	}
1238	poly p=(poly)(u->Data());
1239	if (p==NULL)
1240	{
1241	res->data=NULL;
1242	return FALSE;
1243	}
1244	if (pNext(q)!=NULL)
1245	{
1246	#ifdef HAVE_FACTORY
1247	if(pGetComp(p)==0)
1248	{
1249	res->data=(void)(singclap_pdivide(p /(poly)(u->Data())*/ ,
1250	q /(poly)(v->Data())/ ));
1251	}
1252	else
1253	{
1254	int comps=pMaxComp(p);
1255	ideal I=idInit(comps,1);
1256	p=pCopy(p);
1257	poly h;
1258	int i;
1259	// conversion to a list of polys:
1260	while (p!=NULL)
1261	{
1262	i=pGetComp(p)-1;
1263	h=pNext(p);
1264	pNext(p)=NULL;
1265	pSetComp(p,0);
1266	I->m[i]=pAdd(I->m[i],p);
1267	p=h;
1268	}
1269	// division and conversion to vector:
1270	h=NULL;
1271	p=NULL;
1272	for(i=comps-1;i>=0;i--)
1273	{
1274	if (I->m[i]!=NULL)
1275	{
1276	h=singclap_pdivide(I->m[i],q);
1277	pSetCompP(h,i+1);
1278	p=pAdd(p,h);
1279	}
1280	}
1281	idDelete(&I);
1282	res->data=(void *)p;
1283	}
1284	#else /* HAVE_FACTORY */
1285	WerrorS("division only by a monomial");
1286	return TRUE;
1287	#endif /* HAVE_FACTORY */
1288	}
1289	else
1290	{
1291	res->data = (char *)pDivideM(pCopy(p),pHead(q));
1292	}
1293	pNormalize((poly)res->data);
1294	return FALSE;
1295	}
1296	static BOOLEAN jjDIV_Ma(leftv res, leftv u, leftv v)
1297	{
1298	poly q=(poly)v->Data();
1299	if (q==NULL)
1300	{
1301	WerrorS(ii_div_by_0);
1302	return TRUE;
1303	}
1304	matrix m=(matrix)(u->Data());
1305	int r=m->rows();
1306	int c=m->cols();
1307	matrix mm=mpNew(r,c);
1308	int i,j;
1309	for(i=r;i>0;i--)
1310	{
1311	for(j=c;j>0;j--)
1312	{
1313	if (pNext(q)!=NULL)
1314	{
1315	#ifdef HAVE_FACTORY
1316	MATELEM(mm,i,j) = singclap_pdivide( MATELEM(m,i,j) ,
1317	q /(poly)(v->Data())/ );
1318	#else /* HAVE_FACTORY */
1319	WerrorS("division only by a monomial");
1320	return TRUE;
1321	#endif /* HAVE_FACTORY */
1322	}
1323	else
1324	MATELEM(mm,i,j) = pDivideM(pCopy(MATELEM(m,i,j)),pHead(q));
1325	}
1326	}
1327	idNormalize((ideal)mm);
1328	res->data=(char *)mm;
1329	return FALSE;
1330	}
1331	static BOOLEAN jjEQUAL_BI(leftv res, leftv u, leftv v)
1332	{
1333	res->data = (char *)((long)nlEqual((number)u->Data(),(number)v->Data()));
1334	jjEQUAL_REST(res,u,v);
1335	return FALSE;
1336	}
1337	static BOOLEAN jjEQUAL_I(leftv res, leftv u, leftv v)
1338	{
1339	res->data = (char *)((int)((long)u->Data()) == (int)((long)v->Data()));
1340	jjEQUAL_REST(res,u,v);
1341	return FALSE;
1342	}
1343	static BOOLEAN jjEQUAL_Ma(leftv res, leftv u, leftv v)
1344	{
1345	res->data = (char *)((long)mpEqual((matrix)u->Data(),(matrix)v->Data()));
1346	jjEQUAL_REST(res,u,v);
1347	return FALSE;
1348	}
1349	static BOOLEAN jjEQUAL_N(leftv res, leftv u, leftv v)
1350	{
1351	res->data = (char *)((long)nEqual((number)u->Data(),(number)v->Data()));
1352	jjEQUAL_REST(res,u,v);
1353	return FALSE;
1354	}
1355	static BOOLEAN jjEQUAL_P(leftv res, leftv u, leftv v)
1356	{
1357	poly p=(poly)u->Data();
1358	poly q=(poly)v->Data();
1359	res->data = (char *) ((long)pEqualPolys(p,q));
1360	jjEQUAL_REST(res,u,v);
1361	return FALSE;
1362	}
1363	static void jjEQUAL_REST(leftv res,leftv u,leftv v)
1364	{
1365	if ((res->data) && (u->next!=NULL) && (v->next!=NULL))
1366	{
1367	int save_iiOp=iiOp;
1368	if (iiOp==NOTEQUAL)
1369	iiExprArith2(res,u->next,EQUAL_EQUAL,v->next);
1370	else
1371	iiExprArith2(res,u->next,iiOp,v->next);
1372	iiOp=save_iiOp;
1373	}
1374	if (iiOp==NOTEQUAL) res->data=(char *)(!(long)res->data);
1375	}
1376	static BOOLEAN jjAND_I(leftv res, leftv u, leftv v)
1377	{
1378	res->data = (char *)((long)u->Data() && (long)v->Data());
1379	return FALSE;
1380	}
1381	static BOOLEAN jjOR_I(leftv res, leftv u, leftv v)
1382	{
1383	res->data = (char *)((long)u->Data() \|\| (long)v->Data());
1384	return FALSE;
1385	}
1386	static BOOLEAN jjINDEX_I(leftv res, leftv u, leftv v)
1387	{
1388	res->rtyp=u->rtyp; u->rtyp=0;
1389	res->data=u->data; u->data=NULL;
1390	res->name=u->name; u->name=NULL;
1391	res->attribute=u->attribute; u->attribute=NULL;
1392	res->e=u->e; u->e=NULL;
1393	if (res->e==NULL) res->e=jjMakeSub(v);
1394	else
1395	{
1396	Subexpr sh=res->e;
1397	while (sh->next != NULL) sh=sh->next;
1398	sh->next=jjMakeSub(v);
1399	}
1400	return FALSE;
1401	}
1402	static BOOLEAN jjINDEX_IV(leftv res, leftv u, leftv v)
1403	{
1404	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
1405	{
1406	WerrorS("indexed object must have a name");
1407	return TRUE;
1408	}
1409	intvec * iv=(intvec *)v->Data();
1410	leftv p=NULL;
1411	int i;
1412	sleftv t;
1413	memset(&t,0,sizeof(t));
1414	t.rtyp=INT_CMD;
1415	for (i=0;i<iv->length(); i++)
1416	{
1417	t.data=(char )((long)(iv)[i]);
1418	if (p==NULL)
1419	{
1420	p=res;
1421	}
1422	else
1423	{
1424	p->next=(leftv)omAlloc0Bin(sleftv_bin);
1425	p=p->next;
1426	}
1427	p->rtyp=IDHDL;
1428	p->data=u->data;
1429	p->name=u->name;
1430	p->flag=u->flag;
1431	p->attribute=u->attribute;
1432	p->e=jjMakeSub(&t);
1433	}
1434	u->rtyp=0;
1435	u->data=NULL;
1436	u->name=NULL;
1437	return FALSE;
1438	}
1439	static BOOLEAN jjINDEX_P(leftv res, leftv u, leftv v)
1440	{
1441	poly p=(poly)u->Data();
1442	int i=(int)(long)v->Data();
1443	int j=0;
1444	while (p!=NULL)
1445	{
1446	j++;
1447	if (j==i)
1448	{
1449	res->data=(char *)pHead(p);
1450	return FALSE;
1451	}
1452	pIter(p);
1453	}
1454	return FALSE;
1455	}
1456	static BOOLEAN jjINDEX_P_IV(leftv res, leftv u, leftv v)
1457	{
1458	poly p=(poly)u->Data();
1459	poly r=NULL;
1460	intvec iv=(intvec )v->CopyD(INTVEC_CMD);
1461	int i;
1462	int sum=0;
1463	for(i=iv->length()-1;i>=0;i--)
1464	sum+=(*iv)[i];
1465	int j=0;
1466	while ((p!=NULL) && (sum>0))
1467	{
1468	j++;
1469	for(i=iv->length()-1;i>=0;i--)
1470	{
1471	if (j==(*iv)[i])
1472	{
1473	r=pAdd(r,pHead(p));
1474	sum-=j;
1475	(*iv)[i]=0;
1476	break;
1477	}
1478	}
1479	pIter(p);
1480	}
1481	delete iv;
1482	res->data=(char *)r;
1483	return FALSE;
1484	}
1485	static BOOLEAN jjINDEX_V(leftv res, leftv u, leftv v)
1486	{
1487	poly p=(poly)u->CopyD(VECTOR_CMD);
1488	poly r=p; // pointer to the beginning of component i
1489	poly o=NULL;
1490	int i=(int)(long)v->Data();
1491	while (p!=NULL)
1492	{
1493	if (pGetComp(p)!=i)
1494	{
1495	if (r==p) r=pNext(p);
1496	if (o!=NULL)
1497	{
1498	pDeleteLm(&pNext(o));
1499	p=pNext(o);
1500	}
1501	else
1502	pDeleteLm(&p);
1503	}
1504	else
1505	{
1506	pSetComp(p, 0);
1507	o=p;
1508	p=pNext(o);
1509	}
1510	}
1511	res->data=(char *)r;
1512	return FALSE;
1513	}
1514	static BOOLEAN jjINDEX_V_IV(leftv res, leftv u, leftv v)
1515	{
1516	poly p=(poly)u->CopyD(VECTOR_CMD);
1517	if (p!=NULL)
1518	{
1519	poly r=pOne();
1520	poly hp=r;
1521	intvec iv=(intvec )v->Data();
1522	int i;
1523	loop
1524	{
1525	for(i=0;i<iv->length();i++)
1526	{
1527	if (pGetComp(p)==(*iv)[i])
1528	{
1529	poly h;
1530	pSplit(p,&h);
1531	pNext(hp)=p;
1532	p=h;
1533	pIter(hp);
1534	break;
1535	}
1536	}
1537	if (p==NULL) break;
1538	if (i==iv->length())
1539	{
1540	pDeleteLm(&p);
1541	if (p==NULL) break;
1542	}
1543	}
1544	pDeleteLm(&r);
1545	res->data=(char *)r;
1546	}
1547	return FALSE;
1548	}
1549	static BOOLEAN jjKLAMMER_rest(leftv res, leftv u, leftv v);
1550	static BOOLEAN jjKLAMMER(leftv res, leftv u, leftv v)
1551	{
1552	if(u->name==NULL) return TRUE;
1553	char * nn = (char *)omAlloc(strlen(u->name) + 14);
1554	sprintf(nn,"%s(%d)",u->name,(int)(long)v->Data());
1555	omFree((ADDRESS)u->name);
1556	u->name=NULL;
1557	char *n=omStrDup(nn);
1558	omFree((ADDRESS)nn);
1559	syMake(res,n);
1560	if (u->next!=NULL) return jjKLAMMER_rest(res,u->next,v);
1561	return FALSE;
1562	}
1563	static BOOLEAN jjKLAMMER_IV(leftv res, leftv u, leftv v)
1564	{
1565	intvec * iv=(intvec *)v->Data();
1566	leftv p=NULL;
1567	int i;
1568	long slen = strlen(u->name) + 14;
1569	char n = (char) omAlloc(slen);
1570
1571	for (i=0;i<iv->length(); i++)
1572	{
1573	if (p==NULL)
1574	{
1575	p=res;
1576	}
1577	else
1578	{
1579	p->next=(leftv)omAlloc0Bin(sleftv_bin);
1580	p=p->next;
1581	}
1582	sprintf(n,"%s(%d)",u->name,(*iv)[i]);
1583	syMake(p,omStrDup(n));
1584	}
1585	omFree((ADDRESS)u->name);
1586	u->name = NULL;
1587	omFreeSize(n, slen);
1588	if (u->next!=NULL) return jjKLAMMER_rest(res,u->next,v);
1589	return FALSE;
1590	}
1591	static BOOLEAN jjKLAMMER_rest(leftv res, leftv u, leftv v)
1592	{
1593	leftv tmp=(leftv)omAllocBin(sleftv_bin);
1594	memset(tmp,0,sizeof(sleftv));
1595	BOOLEAN b;
1596	if (v->Typ()==INTVEC_CMD)
1597	b=jjKLAMMER_IV(tmp,u,v);
1598	else
1599	b=jjKLAMMER(tmp,u,v);
1600	if (b)
1601	{
1602	omFreeBin(tmp,sleftv_bin);
1603	return TRUE;
1604	}
1605	leftv h=res;
1606	while (h->next!=NULL) h=h->next;
1607	h->next=tmp;
1608	return FALSE;
1609	}
1610	BOOLEAN jjPROC(leftv res, leftv u, leftv v)
1611	{
1612	void *d;
1613	Subexpr e;
1614	int typ;
1615	BOOLEAN t=FALSE;
1616	if (u->rtyp!=IDHDL)
1617	{
1618	idrec tmp_proc;
1619	tmp_proc.id="_auto";
1620	tmp_proc.typ=PROC_CMD;
1621	tmp_proc.data.pinf=(procinfo *)u->Data();
1622	tmp_proc.ref=1;
1623	d=u->data; u->data=(void *)&tmp_proc;
1624	e=u->e; u->e=NULL;
1625	t=TRUE;
1626	typ=u->rtyp; u->rtyp=IDHDL;
1627	}
1628	#ifdef HAVE_NS
1629	leftv sl;
1630	if (u->req_packhdl==currPack)
1631	sl = iiMake_proc((idhdl)u->data,NULL,v);
1632	else
1633	sl = iiMake_proc((idhdl)u->data,u->req_packhdl,v);
1634	#else /* HAVE_NS */
1635	leftv sl = iiMake_proc((idhdl)u->data,v);
1636	#endif /* HAVE_NS */
1637	if (t)
1638	{
1639	u->rtyp=typ;
1640	u->data=d;
1641	u->e=e;
1642	}
1643	if (sl==NULL)
1644	{
1645	return TRUE;
1646	}
1647	else
1648	{
1649	memcpy(res,sl,sizeof(sleftv));
1650	}
1651	return FALSE;
1652	}
1653	static BOOLEAN jjMAP(leftv res, leftv u, leftv v)
1654	{
1655	//Print("try to map %s with %s\n",$3.Name(),$1.Name());
1656	leftv sl=NULL;
1657	if ((v->e==NULL)&&(v->name!=NULL))
1658	{
1659	map m=(map)u->Data();
1660	sl=iiMap(m,v->name);
1661	}
1662	else
1663	{
1664	Werror("%s(<name>) expected",u->Name());
1665	}
1666	if (sl==NULL) return TRUE;
1667	memcpy(res,sl,sizeof(sleftv));
1668	omFreeBin((ADDRESS)sl, sleftv_bin);
1669	return FALSE;
1670	}
1671	static BOOLEAN jjCALL2MANY(leftv res, leftv u, leftv v)
1672	{
1673	u->next=(leftv)omAllocBin(sleftv_bin);
1674	memcpy(u->next,v,sizeof(sleftv));
1675	BOOLEAN r=iiExprArithM(res,u,iiOp);
1676	v->Init();
1677	// iiExprArithM did the CleanUp
1678	return r;
1679	}
1680	static BOOLEAN jjCHINREM_BI(leftv res, leftv u, leftv v)
1681	{
1682	intvec c=(intvec)u->Data();
1683	intvec* p=(intvec*)v->Data();
1684	int rl=p->length();
1685	number x=(number )omAlloc(rl*sizeof(number));
1686	number q=(number )omAlloc(rl*sizeof(number));
1687	int i;
1688	for(i=rl-1;i>=0;i--)
1689	{
1690	q[i]=nlInit((*p)[i]);
1691	x[i]=nlInit((*c)[i]);
1692	}
1693	number n=nlChineseRemainder(x,q,rl);
1694	for(i=rl-1;i>=0;i--)
1695	{
1696	nlDelete(&(q[i]),currRing);
1697	nlDelete(&(x[i]),currRing);
1698	}
1699	omFree(x); omFree(q);
1700	res->data=(char *)n;
1701	return FALSE;
1702	}
1703	#if 0
1704	static BOOLEAN jjCHINREM_P(leftv res, leftv u, leftv v)
1705	{
1706	lists c=(lists)u->CopyD(); // list of poly
1707	intvec* p=(intvec*)v->Data();
1708	int rl=p->length();
1709	poly r=NULL,h, result=NULL;
1710	number x=(number )omAlloc(rl*sizeof(number));
1711	number q=(number )omAlloc(rl*sizeof(number));
1712	int i;
1713	for(i=rl-1;i>=0;i--)
1714	{
1715	q[i]=nlInit((*p)[i]);
1716	}
1717	loop
1718	{
1719	for(i=rl-1;i>=0;i--)
1720	{
1721	if (c->m[i].Typ()!=POLY_CMD)
1722	{
1723	Werror("poly expected at pos %d",i+1);
1724	for(i=rl-1;i>=0;i--)
1725	{
1726	nlDelete(&(q[i]),currRing);
1727	}
1728	omFree(x); omFree(q); // delete c
1729	return TRUE;
1730	}
1731	h=((poly)c->m[i].Data());
1732	if (r==NULL) r=h;
1733	else if (pLmCmp(r,h)==-1) r=h;
1734	}
1735	if (r==NULL) break;
1736	for(i=rl-1;i>=0;i--)
1737	{
1738	h=((poly)c->m[i].Data());
1739	if (pLmCmp(r,h)==0)
1740	{
1741	x[i]=pGetCoeff(h);
1742	h=pLmFreeAndNext(h);
1743	c->m[i].data=(char*)h;
1744	}
1745	else
1746	x[i]=nlInit(0);
1747	}
1748	number n=nlChineseRemainder(x,q,rl);
1749	for(i=rl-1;i>=0;i--)
1750	{
1751	nlDelete(&(x[i]),currRing);
1752	}
1753	h=pHead(r);
1754	pSetCoeff(h,n);
1755	result=pAdd(result,h);
1756	}
1757	for(i=rl-1;i>=0;i--)
1758	{
1759	nlDelete(&(q[i]),currRing);
1760	}
1761	omFree(x); omFree(q);
1762	res->data=(char *)result;
1763	return FALSE;
1764	}
1765	#endif
1766	static BOOLEAN jjCHINREM_ID(leftv res, leftv u, leftv v)
1767	{
1768	lists c=(lists)u->CopyD(); // list of ideal
1769	intvec* p=(intvec*)v->Data();
1770	int rl=p->length();
1771	poly r=NULL,h;
1772	ideal result;
1773	ideal x=(ideal )omAlloc(rl*sizeof(ideal));
1774	int i;
1775	for(i=rl-1;i>=0;i--)
1776	{
1777	if (c->m[i].Typ()!=IDEAL_CMD)
1778	{
1779	Werror("ideal expected at pos %d",i+1);
1780	omFree(x); // delete c
1781	return TRUE;
1782	}
1783	x[i]=((ideal)c->m[i].Data());
1784	}
1785	number q=(number )omAlloc(rl*sizeof(number));
1786	for(i=rl-1;i>=0;i--)
1787	{
1788	q[i]=nlInit((*p)[i]);
1789	}
1790	result=idChineseRemainder(x,q,rl);
1791	for(i=rl-1;i>=0;i--)
1792	{
1793	nlDelete(&(q[i]),currRing);
1794	}
1795	omFree(q);
1796	res->data=(char *)result;
1797	return FALSE;
1798	}
1799	static BOOLEAN jjCOEF(leftv res, leftv u, leftv v)
1800	{
1801	poly p=(poly)v->Data();
1802	if ((p==NULL)\|\|(pNext(p)!=NULL)) return TRUE;
1803	res->data=(char )mpCoeffProc((poly)u->Data(),p /(poly)v->Data()*/);
1804	return FALSE;
1805	}
1806	static BOOLEAN jjCOEFFS_Id(leftv res, leftv u, leftv v)
1807	{
1808	int i=pVar((poly)v->Data());
1809	if (i==0)
1810	{
1811	WerrorS("ringvar expected");
1812	return TRUE;
1813	}
1814	res->data=(char *)mpCoeffs((ideal)u->CopyD(),i);
1815	return FALSE;
1816	}
1817	static BOOLEAN jjCOEFFS2_KB(leftv res, leftv u, leftv v)
1818	{
1819	poly p = pInit();
1820	int i;
1821	for (i=1; i<=pVariables; i++)
1822	{
1823	pSetExp(p, i, 1);
1824	}
1825	pSetm(p);
1826	res->data = (void*)idCoeffOfKBase((ideal)(u->Data()),
1827	(ideal)(v->Data()), p);
1828	pDelete(&p);
1829	return FALSE;
1830	}
1831	static BOOLEAN jjCONTRACT(leftv res, leftv u, leftv v)
1832	{
1833	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data(),FALSE);
1834	return FALSE;
1835	}
1836	static BOOLEAN jjDEG_M_IV(leftv res, leftv u, leftv v)
1837	{
1838	short iv=iv2array((intvec )v->Data());
1839	ideal I=(ideal)u->Data();
1840	int d=-1;
1841	int i;
1842	for(i=IDELEMS(I);i>=0;i--) d=si_max(d,(int)pDegW(I->m[i],iv));
1843	omFreeSize((ADDRESS)iv,(pVariables+1)*sizeof(short));
1844	res->data = (char *)((long)d);
1845	return FALSE;
1846	}
1847	static BOOLEAN jjDEG_IV(leftv res, leftv u, leftv v)
1848	{
1849	short iv=iv2array((intvec )v->Data());
1850	res->data = (char *)pDegW((poly)u->Data(),iv);
1851	omFreeSize((ADDRESS)iv,(pVariables+1)*sizeof(short));
1852	return FALSE;
1853	}
1854	static BOOLEAN jjDIFF_P(leftv res, leftv u, leftv v)
1855	{
1856	int i=pVar((poly)v->Data());
1857	if (i==0)
1858	{
1859	WerrorS("ringvar expected");
1860	return TRUE;
1861	}
1862	res->data=(char *)pDiff((poly)(u->Data()),i);
1863	return FALSE;
1864	}
1865	static BOOLEAN jjDIFF_ID(leftv res, leftv u, leftv v)
1866	{
1867	int i=pVar((poly)v->Data());
1868	if (i==0)
1869	{
1870	WerrorS("ringvar expected");
1871	return TRUE;
1872	}
1873	res->data=(char *)idDiff((matrix)(u->Data()),i);
1874	return FALSE;
1875	}
1876	static BOOLEAN jjDIFF_ID_ID(leftv res, leftv u, leftv v)
1877	{
1878	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data());
1879	return FALSE;
1880	}
1881	static BOOLEAN jjDIM2(leftv res, leftv v, leftv w)
1882	{
1883	assumeStdFlag(v);
1884	if(currQuotient==NULL)
1885	res->data = (char *)((long)scDimInt((ideal)(v->Data()),(ideal)w->Data()));
1886	else
1887	{
1888	ideal q=idSimpleAdd(currQuotient,(ideal)w->Data());
1889	res->data = (char *)((long)scDimInt((ideal)(v->Data()),q));
1890	idDelete(&q);
1891	}
1892	return FALSE;
1893	}
1894	static BOOLEAN jjDIVISION(leftv res, leftv u, leftv v)
1895	{
1896	ideal vi=(ideal)v->Data();
1897	int vl= IDELEMS(vi);
1898	ideal ui=(ideal)u->Data();
1899	int ul= IDELEMS(ui);
1900	ideal R; matrix U;
1901	ideal m = idLift(vi,ui,&R, FALSE,hasFlag(v,FLAG_STD),TRUE,&U);
1902	// now make sure that all matices have the corect size:
1903	matrix T = idModule2formatedMatrix(m,vl,ul);
1904	if (MATCOLS(U) != ul)
1905	{
1906	int mul=si_min(ul,MATCOLS(U));
1907	matrix UU=mpNew(ul,ul);
1908	int i,j;
1909	for(i=mul;i>0;i--)
1910	{
1911	for(j=mul;j>0;j--)
1912	{
1913	MATELEM(UU,i,j)=MATELEM(U,i,j);
1914	MATELEM(U,i,j)=NULL;
1915	}
1916	}
1917	idDelete((ideal *)&U);
1918	U=UU;
1919	}
1920	lists L=(lists)omAllocBin(slists_bin);
1921	L->Init(3);
1922	L->m[0].rtyp=MATRIX_CMD; L->m[0].data=(void *)T;
1923	L->m[1].rtyp=u->Typ(); L->m[1].data=(void *)R;
1924	L->m[2].rtyp=MATRIX_CMD; L->m[2].data=(void *)U;
1925	res->data=(char *)L;
1926	return FALSE;
1927	}
1928	static BOOLEAN jjELIMIN(leftv res, leftv u, leftv v)
1929	{
1930	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data());
1931	//setFlag(res,FLAG_STD);
1932	return FALSE;
1933	}
1934	static BOOLEAN jjELIMIN_IV(leftv res, leftv u, leftv v)
1935	{
1936	poly p=pOne();
1937	intvec iv=(intvec)v->Data();
1938	for(int i=iv->length()-1; i>=0; i--)
1939	{
1940	pSetExp(p,(*iv)[i],1);
1941	}
1942	pSetm(p);
1943	res->data=(char *)idElimination((ideal)u->Data(),p);
1944	pLmDelete(&p);
1945	//setFlag(res,FLAG_STD);
1946	return FALSE;
1947	}
1948	static BOOLEAN jjEXPORTTO(leftv res, leftv u, leftv v)
1949	{
1950	#ifdef HAVE_NS
1951	//Print("exportto %s -> %s\n",v->Name(),u->Name() );
1952	return iiExport(v,0,(idhdl)u->data);
1953	#else /* HAVE_NS */
1954	return TRUE;
1955	#endif /* HAVE_NS */
1956	}
1957	static BOOLEAN jjERROR(leftv res, leftv u)
1958	{
1959	WerrorS((char *)u->Data());
1960	return TRUE;
1961	}
1962	static BOOLEAN jjEXTGCD_I(leftv res, leftv u, leftv v)
1963	{
1964	int uu=(int)(long)u->Data();int vv=(int)(long)v->Data();
1965	int p0=ABS(uu),p1=ABS(vv);
1966	int f0 = 1, f1 = 0, g0 = 0, g1 = 1, q, r;
1967
1968	while ( p1!=0 )
1969	{
1970	q=p0 / p1;
1971	r=p0 % p1;
1972	p0 = p1; p1 = r;
1973	r = g0 - g1 * q;
1974	g0 = g1; g1 = r;
1975	r = f0 - f1 * q;
1976	f0 = f1; f1 = r;
1977	}
1978	int a = f0;
1979	int b = g0;
1980	if ( uu /(int)(long)u->Data()/ < 0 ) a=-a;
1981	if ( vv /(int)(long)v->Data()/ < 0 ) b=-b;
1982	lists L=(lists)omAllocBin(slists_bin);
1983	L->Init(3);
1984	L->m[0].rtyp=INT_CMD; L->m[0].data=(void *)(long)p0;
1985	L->m[1].rtyp=INT_CMD; L->m[1].data=(void *)(long)a;
1986	L->m[2].rtyp=INT_CMD; L->m[2].data=(void *)(long)b;
1987	res->rtyp=LIST_CMD;
1988	res->data=(char *)L;
1989	return FALSE;
1990	}
1991	#ifdef HAVE_FACTORY
1992	static BOOLEAN jjEXTGCD_P(leftv res, leftv u, leftv v)
1993	{
1994	poly r,pa,pb;
1995	BOOLEAN ret=singclap_extgcd((poly)u->Data(),(poly)v->Data(),r,pa,pb);
1996	if (ret) return TRUE;
1997	lists L=(lists)omAllocBin(slists_bin);
1998	L->Init(3);
1999	res->data=(char *)L;
2000	L->m[0].data=(void *)r;
2001	L->m[0].rtyp=POLY_CMD;
2002	L->m[1].data=(void *)pa;
2003	L->m[1].rtyp=POLY_CMD;
2004	L->m[2].data=(void *)pb;
2005	L->m[2].rtyp=POLY_CMD;
2006	return FALSE;
2007	}
2008	extern int singclap_factorize_retry;
2009	static BOOLEAN jjFAC_P2(leftv res, leftv u,leftv dummy)
2010	{
2011	intvec *v=NULL;
2012	int sw=(int)(long)dummy->Data();
2013	int fac_sw=sw;
2014	if ((sw<0)\|\|(sw>2)) fac_sw=1;
2015	singclap_factorize_retry=0;
2016	ideal f=singclap_factorize((poly)(u->CopyD()), &v, fac_sw);
2017	if (f==NULL)
2018	return TRUE;
2019	switch(sw)
2020	{
2021	case 0:
2022	case 2:
2023	{
2024	lists l=(lists)omAllocBin(slists_bin);
2025	l->Init(2);
2026	l->m[0].rtyp=IDEAL_CMD;
2027	l->m[0].data=(void *)f;
2028	l->m[1].rtyp=INTVEC_CMD;
2029	l->m[1].data=(void *)v;
2030	res->data=(void *)l;
2031	res->rtyp=LIST_CMD;
2032	return FALSE;
2033	}
2034	case 1:
2035	res->data=(void *)f;
2036	return FALSE;
2037	case 3:
2038	{
2039	poly p=f->m[0];
2040	int i=IDELEMS(f);
2041	f->m[0]=NULL;
2042	while(i>1)
2043	{
2044	i--;
2045	p=pMult(p,f->m[i]);
2046	f->m[i]=NULL;
2047	}
2048	res->data=(void *)p;
2049	res->rtyp=POLY_CMD;
2050	}
2051	return FALSE;
2052	}
2053	WerrorS("invalid switch");
2054	return TRUE;
2055	}
2056	static BOOLEAN jjFACSTD2(leftv res, leftv v, leftv w)
2057	{
2058	ideal_list p,h;
2059	h=kStdfac((ideal)v->Data(),NULL,testHomog,NULL,(ideal)w->Data());
2060	p=h;
2061	int l=0;
2062	while (p!=NULL) { p=p->next;l++; }
2063	lists L=(lists)omAllocBin(slists_bin);
2064	L->Init(l);
2065	l=0;
2066	while(h!=NULL)
2067	{
2068	L->m[l].data=(char *)h->d;
2069	L->m[l].rtyp=IDEAL_CMD;
2070	p=h->next;
2071	omFreeSize(h,sizeof(*h));
2072	h=p;
2073	l++;
2074	}
2075	res->data=(void *)L;
2076	return FALSE;
2077	}
2078	#endif /* HAVE_FACTORY */
2079	static BOOLEAN jjFETCH(leftv res, leftv u, leftv v)
2080	{
2081	ring r=(ring)u->Data();
2082	idhdl w;
2083	int op=iiOp;
2084	nMapFunc nMap;
2085
2086	if ((w=r->idroot->get(v->Name(),myynest))!=NULL)
2087	{
2088	int *perm=NULL;
2089	int *par_perm=NULL;
2090	int par_perm_size=0;
2091	BOOLEAN bo;
2092	//if (!nSetMap(rInternalChar(r),r->parameter,rPar(r),r->minpoly))
2093	if ((nMap=nSetMap(r))==NULL)
2094	{
2095	if (rEqual(r,currRing))
2096	{
2097	nMap=nCopy;
2098	}
2099	else
2100	// Allow imap/fetch to be make an exception only for:
2101	if ( (rField_is_Q_a(r) && // Q(a..) -> Q(a..) \|\| Q \|\| Zp \|\| Zp(a)
2102	(rField_is_Q() \|\| rField_is_Q_a() \|\|
2103	(rField_is_Zp() \|\| rField_is_Zp_a())))
2104	\|\|
2105	(rField_is_Zp_a(r) && // Zp(a..) -> Zp(a..) \|\| Zp
2106	(rField_is_Zp(currRing, rInternalChar(r)) \|\|
2107	rField_is_Zp_a(currRing, rInternalChar(r)))) )
2108	{
2109	par_perm_size=rPar(r);
2110	BITSET save_test=test;
2111	naSetChar(rInternalChar(r),r);
2112	nSetChar(currRing);
2113	test=save_test;
2114	}
2115	else
2116	{
2117	goto err_fetch;
2118	}
2119	}
2120	if ((iiOp!=FETCH_CMD) \|\| (r->N!=pVariables) \|\| (rPar(r)!=rPar(currRing)))
2121	{
2122	perm=(int )omAlloc0((r->N+1)sizeof(int));
2123	if (par_perm_size!=0)
2124	par_perm=(int )omAlloc0(par_perm_sizesizeof(int));
2125	op=IMAP_CMD;
2126	if (iiOp==IMAP_CMD)
2127	{
2128	maFindPerm(r->names, r->N, r->parameter, r->P,
2129	currRing->names,currRing->N,currRing->parameter, currRing->P,
2130	perm,par_perm, currRing->ch);
2131	}
2132	else
2133	{
2134	int i;
2135	if (par_perm_size!=0)
2136	for(i=si_min(rPar(r),rPar(currRing))-1;i>=0;i--) par_perm[i]=-(i+1);
2137	for(i=si_min(r->N,pVariables);i>0;i--) perm[i]=i;
2138	}
2139	}
2140	if ((iiOp==FETCH_CMD) &&(BVERBOSE(V_IMAP)))
2141	{
2142	int i;
2143	for(i=0;i<si_min(r->N,pVariables);i++)
2144	{
2145	Print("// var nr %d: %s -> %s\n",i,r->names[i],currRing->names[i]);
2146	}
2147	for(i=0;i<si_min(rPar(r),rPar(currRing));i++) // possibly empty loop
2148	{
2149	Print("// par nr %d: %s -> %s\n",
2150	i,r->parameter[i],currRing->parameter[i]);
2151	}
2152	}
2153	sleftv tmpW;
2154	memset(&tmpW,0,sizeof(sleftv));
2155	tmpW.rtyp=IDTYP(w);
2156	tmpW.data=IDDATA(w);
2157	if ((bo=maApplyFetch(op,NULL,res,&tmpW, r,
2158	perm,par_perm,par_perm_size,nMap)))
2159	{
2160	Werror("cannot map %s of type %s(%d)",v->name, Tok2Cmdname(w->typ),w->typ);
2161	}
2162	if (perm!=NULL)
2163	omFreeSize((ADDRESS)perm,(r->N+1)*sizeof(int));
2164	if (par_perm!=NULL)
2165	omFreeSize((ADDRESS)par_perm,par_perm_size*sizeof(int));
2166	return bo;
2167	}
2168	else
2169	{
2170	Werror("identifier %s not found in %s",v->Fullname(),u->Fullname());
2171	}
2172	return TRUE;
2173	err_fetch:
2174	Werror("no identity map from %s",u->Fullname());
2175	return TRUE;
2176	}
2177	static BOOLEAN jjFIND2(leftv res, leftv u, leftv v)
2178	{
2179	/*4
2180	* look for the substring what in the string where
2181	* return the position of the first char of what in where
2182	* or 0
2183	*/
2184	char where=(char )u->Data();
2185	char what=(char )v->Data();
2186	char *found = strstr(where,what);
2187	if (found != NULL)
2188	{
2189	res->data=(char *)((found-where)+1);
2190	}
2191	/else res->data=NULL;/
2192	return FALSE;
2193	}
2194	static BOOLEAN jjFWALK(leftv res, leftv u, leftv v)
2195	{
2196	res->data=(char *)fractalWalkProc(u,v);
2197	setFlag( res, FLAG_STD );
2198	return FALSE;
2199	}
2200	static BOOLEAN jjGCD_I(leftv res, leftv u, leftv v)
2201	{
2202	int uu=(int)(long)u->Data();int vv=(int)(long)v->Data();
2203	int p0=ABS(uu),p1=ABS(vv);
2204	int r;
2205	while ( p1!=0 )
2206	{
2207	r=p0 % p1;
2208	p0 = p1; p1 = r;
2209	}
2210	res->rtyp=INT_CMD;
2211	res->data=(char *)(long)p0;
2212	return FALSE;
2213	}
2214	static BOOLEAN jjGCD_BI(leftv res, leftv u, leftv v)
2215	{
2216	number a=(number) u->Data();
2217	number b=(number) v->Data();
2218	if (nlIsZero(a))
2219	{
2220	if (nlIsZero(b)) res->data=(char *)nlInit(1);
2221	else res->data=(char *)nlCopy(b);
2222	}
2223	else
2224	{
2225	if (nlIsZero(b)) res->data=(char *)nlCopy(a);
2226	else res->data=(char *)nlGcd(a, b, NULL);
2227	}
2228	return FALSE;
2229	}
2230	static BOOLEAN jjGCD_N(leftv res, leftv u, leftv v)
2231	{
2232	number a=(number) u->Data();
2233	number b=(number) v->Data();
2234	if (nIsZero(a))
2235	{
2236	if (nIsZero(b)) res->data=(char *)nInit(1);
2237	else res->data=(char *)nCopy(b);
2238	}
2239	else
2240	{
2241	if (nIsZero(b)) res->data=(char *)nCopy(a);
2242	else res->data=(char *)nGcd(a, b, currRing);
2243	}
2244	return FALSE;
2245	}
2246	#ifdef HAVE_FACTORY
2247	static BOOLEAN jjGCD_P(leftv res, leftv u, leftv v)
2248	{
2249	res->data=(void *)singclap_gcd((poly)(u->CopyD(POLY_CMD)),
2250	(poly)(v->CopyD(POLY_CMD)));
2251	return FALSE;
2252	}
2253	#endif /* HAVE_FACTORY */
2254	static BOOLEAN jjHILBERT2(leftv res, leftv u, leftv v)
2255	{
2256	assumeStdFlag(u);
2257	intvec module_w=(intvec)atGet(u,"isHomog",INTVEC_CMD);
2258	intvec *iv=hFirstSeries((ideal)u->Data(),module_w,currQuotient);
2259	switch((int)(long)v->Data())
2260	{
2261	case 1:
2262	res->data=(void *)iv;
2263	return FALSE;
2264	case 2:
2265	res->data=(void *)hSecondSeries(iv);
2266	delete iv;
2267	return FALSE;
2268	}
2269	WerrorS(feNotImplemented);
2270	delete iv;
2271	return TRUE;
2272	}
2273	static BOOLEAN jjHOMOG_P(leftv res, leftv u, leftv v)
2274	{
2275	int i=pVar((poly)v->Data());
2276	if (i==0)
2277	{
2278	WerrorS("ringvar expected");
2279	return TRUE;
2280	}
2281	poly p=pOne(); pSetExp(p,i,1); pSetm(p);
2282	int d=pWTotaldegree(p);
2283	pLmDelete(p);
2284	if (d==1)
2285	res->data = (char *)pHomogen((poly)u->Data(),i);
2286	else
2287	WerrorS("variable must have weight 1");
2288	return (d!=1);
2289	}
2290	static BOOLEAN jjHOMOG_ID(leftv res, leftv u, leftv v)
2291	{
2292	int i=pVar((poly)v->Data());
2293	if (i==0)
2294	{
2295	WerrorS("ringvar expected");
2296	return TRUE;
2297	}
2298	poly p=pOne(); pSetExp(p,i,1); pSetm(p);
2299	int d=pWTotaldegree(p);
2300	pLmDelete(p);
2301	if (d==1)
2302	res->data = (char *)idHomogen((ideal)u->Data(),i);
2303	else
2304	WerrorS("variable must have weight 1");
2305	return (d!=1);
2306	}
2307	static BOOLEAN jjINDEPSET2(leftv res, leftv u, leftv v)
2308	{
2309	assumeStdFlag(u);
2310	res->data=(void *)scIndIndset((ideal)(u->Data()),(int)(long)(v->Data()),
2311	currQuotient);
2312	return FALSE;
2313	}
2314	static BOOLEAN jjINTERSECT(leftv res, leftv u, leftv v)
2315	{
2316	res->data=(char *)idSect((ideal)u->Data(),(ideal)v->Data());
2317	setFlag(res,FLAG_STD);
2318	return FALSE;
2319	}
2320	static BOOLEAN jjJanetBasis2(leftv res, leftv u, leftv v)
2321	{
2322	return jjStdJanetBasis(res,u,(int)(long)v->Data());
2323	}
2324	static BOOLEAN jjJET_P(leftv res, leftv u, leftv v)
2325	{
2326	res->data = (char *)pJet((poly)u->CopyD(), (int)(long)v->Data());
2327	return FALSE;
2328	}
2329	static BOOLEAN jjJET_ID(leftv res, leftv u, leftv v)
2330	{
2331	res->data = (char *)idJet((ideal)u->Data(),(int)(long)v->Data());
2332	return FALSE;
2333	}
2334	static BOOLEAN jjKBASE2(leftv res, leftv u, leftv v)
2335	{
2336	assumeStdFlag(u);
2337	intvec w_u=(intvec )atGet(u,"isHomog",INTVEC_CMD);
2338	res->data = (char *)scKBase((int)(long)v->Data(),
2339	(ideal)(u->Data()),currQuotient, w_u);
2340	if (w_u!=NULL)
2341	{
2342	atSet(res,omStrDup("isHomog"),ivCopy(w_u),INTVEC_CMD);
2343	}
2344	return FALSE;
2345	}
2346	static BOOLEAN jjPREIMAGE(leftv res, leftv u, leftv v, leftv w);
2347	static BOOLEAN jjKERNEL(leftv res, leftv u, leftv v)
2348	{
2349	return jjPREIMAGE(res,u,v,NULL);
2350	}
2351	static BOOLEAN jjKoszul(leftv res, leftv u, leftv v)
2352	{
2353	return mpKoszul(res, u,v);
2354	}
2355	static BOOLEAN jjKoszul_Id(leftv res, leftv u, leftv v)
2356	{
2357	sleftv h;
2358	memset(&h,0,sizeof(sleftv));
2359	h.rtyp=INT_CMD;
2360	h.data=(void *)(long)IDELEMS((ideal)v->Data());
2361	return mpKoszul(res, u, &h, v);
2362	}
2363	static BOOLEAN jjLIFT(leftv res, leftv u, leftv v)
2364	{
2365	ideal m;
2366	BITSET save_test=test;
2367	int ul= IDELEMS((ideal)u->Data());
2368	int vl= IDELEMS((ideal)v->Data());
2369	m = idLift((ideal)u->Data(),(ideal)v->Data(),NULL,FALSE,hasFlag(u,FLAG_STD));
2370	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
2371	test=save_test;
2372	return FALSE;
2373	}
2374	static BOOLEAN jjLIFTSTD(leftv res, leftv u, leftv v)
2375	{
2376	if ((v->rtyp!=IDHDL)\|\|(v->e!=NULL)) return TRUE;
2377	idhdl h=(idhdl)v->data;
2378	// CopyD for IDEAL_CMD and MODUL_CMD are identical:
2379	res->data = (char *)idLiftStd((ideal)u->Data(),
2380	&(h->data.umatrix),testHomog);
2381	setFlag(res,FLAG_STD);
2382	return FALSE;
2383	}
2384	static BOOLEAN jjLOAD_E(leftv res, leftv v, leftv u)
2385	{
2386	char * s=(char *)u->Data();
2387	if(strcmp(s, "with")==0)
2388	return jjLOAD(res, v, TRUE);
2389	WerrorS("invalid second argument");
2390	WerrorS("load(\"libname\" [,\"with\"]);");
2391	return TRUE;
2392	}
2393	static BOOLEAN jjMINOR(leftv res, leftv u, leftv v)
2394	{
2395	res->data = (char *)idMinors((matrix)u->Data(),(int)(long)v->Data());
2396	return (res->data==NULL);
2397	}
2398	static BOOLEAN jjMODULO(leftv res, leftv u, leftv v)
2399	{
2400	intvec w_u=(intvec )atGet(u,"isHomog",INTVEC_CMD);
2401	tHomog hom=testHomog;
2402	if (w_u!=NULL)
2403	{
2404	w_u=ivCopy(w_u);
2405	hom=isHomog;
2406	}
2407	intvec w_v=(intvec )atGet(v,"isHomog",INTVEC_CMD);
2408	if (w_v!=NULL)
2409	{
2410	w_v=ivCopy(w_v);
2411	hom=isHomog;
2412	}
2413	if ((w_u!=NULL) && (w_v==NULL))
2414	w_v=ivCopy(w_u);
2415	if ((w_v!=NULL) && (w_u==NULL))
2416	w_u=ivCopy(w_v);
2417	ideal u_id=(ideal)u->Data();
2418	ideal v_id=(ideal)v->Data();
2419	if (w_u!=NULL)
2420	{
2421	if ((*w_u).compare((w_v))!=0)
2422	{
2423	WarnS("incompatible weights");
2424	delete w_u; w_u=NULL;
2425	hom=testHomog;
2426	}
2427	else
2428	{
2429	if ((!idTestHomModule(u_id,currQuotient,w_v))
2430	\|\| (!idTestHomModule(v_id,currQuotient,w_v)))
2431	{
2432	WarnS("wrong weights");
2433	delete w_u; w_u=NULL;
2434	hom=testHomog;
2435	}
2436	}
2437	}
2438	res->data = (char *)idModulo(u_id,v_id ,hom,&w_u);
2439	if (w_u!=NULL)
2440	{
2441	atSet(res,omStrDup("isHomog"),w_u,INTVEC_CMD);
2442	}
2443	delete w_v;
2444	return FALSE;
2445	}
2446	static BOOLEAN jjMOD_BI(leftv res, leftv u, leftv v)
2447	{
2448	number q=(number)v->Data();
2449	if (nlIsZero(q))
2450	{
2451	WerrorS(ii_div_by_0);
2452	return TRUE;
2453	}
2454	res->data =(char *) nlIntMod((number)u->Data(),q);
2455	return FALSE;
2456	}
2457	static BOOLEAN jjMOD_N(leftv res, leftv u, leftv v)
2458	{
2459	number q=(number)v->Data();
2460	if (nIsZero(q))
2461	{
2462	WerrorS(ii_div_by_0);
2463	return TRUE;
2464	}
2465	res->data =(char *) nIntMod((number)u->Data(),q);
2466	return FALSE;
2467	}
2468	static BOOLEAN jjMONITOR2(leftv res, leftv u,leftv v);
2469	static BOOLEAN jjMONITOR1(leftv res, leftv v)
2470	{
2471	return jjMONITOR2(res,v,NULL);
2472	}
2473	static BOOLEAN jjMONITOR2(leftv res, leftv u,leftv v)
2474	{
2475	#if 0
2476	char opt=(char )v->Data();
2477	int mode=0;
2478	while(*opt!='\0')
2479	{
2480	if (*opt=='i') mode \|= PROT_I;
2481	else if (*opt=='o') mode \|= PROT_O;
2482	opt++;
2483	}
2484	monitor((char *)(u->Data()),mode);
2485	#else
2486	si_link l=(si_link)u->Data();
2487	if (slOpen(l,SI_LINK_WRITE)) return TRUE;
2488	if(strcmp(l->m->type,"ASCII")!=0)
2489	{
2490	Werror("ASCII link required, not `%s`",l->m->type);
2491	slClose(l);
2492	return TRUE;
2493	}
2494	SI_LINK_SET_CLOSE_P(l); // febase handles the FILE*
2495	char *opt;
2496	if (v==NULL) opt="i";
2497	else opt=(char *)v->Data();
2498	int mode=0;
2499	while(*opt!='\0')
2500	{
2501	if (*opt=='i') mode \|= PROT_I;
2502	else if (*opt=='o') mode \|= PROT_O;
2503	opt++;
2504	}
2505	if (((FILE*)l->data) == stdin) monitor(NULL,0);
2506	else monitor((FILE *)l->data,mode);
2507	return FALSE;
2508	#endif
2509	}
2510	static BOOLEAN jjPARSTR2(leftv res, leftv u, leftv v)
2511	{
2512	idhdl h=(idhdl)u->data;
2513	int i=(int)(long)v->Data();
2514	int p=0;
2515	if ((0<i)
2516	&& (IDRING(h)->parameter!=NULL)
2517	&& (i<=(p=rPar(IDRING(h)))))
2518	res->data=omStrDup(IDRING(h)->parameter[i-1]);
2519	else
2520	{
2521	Werror("par number %d out of range 1..%d",i,p);
2522	return TRUE;
2523	}
2524	return FALSE;
2525	}
2526	#ifdef HAVE_PLURAL
2527	static BOOLEAN jjPlural_num_poly(leftv res, leftv a, leftv b)
2528	{
2529	if (iiOp==NCALGEBRA_CMD)
2530	{
2531	return nc_CallPlural(NULL,NULL,(poly)a->Data(),(poly)b->Data(),currRing);
2532	}
2533	else
2534	{
2535	ring r=rCopy(currRing);
2536	BOOLEAN result=nc_CallPlural(NULL,NULL,(poly)a->Data(),(poly)b->Data(),r);
2537	res->data=r;
2538	if (r->qideal!=NULL) res->rtyp=QRING_CMD;
2539	return result;
2540	}
2541	}
2542	static BOOLEAN jjPlural_num_mat(leftv res, leftv a, leftv b)
2543	{
2544	if (iiOp==NCALGEBRA_CMD)
2545	{
2546	return nc_CallPlural(NULL,(matrix)b->Data(),(poly)a->Data(),NULL,currRing);
2547	}
2548	else
2549	{
2550	ring r=rCopy(currRing);
2551	BOOLEAN result=nc_CallPlural(NULL,(matrix)b->Data(),(poly)a->Data(),NULL,r);
2552	res->data=r;
2553	if (r->qideal!=NULL) res->rtyp=QRING_CMD;
2554	return result;
2555	}
2556	}
2557	static BOOLEAN jjPlural_mat_poly(leftv res, leftv a, leftv b)
2558	{
2559	if (iiOp==NCALGEBRA_CMD)
2560	{
2561	return nc_CallPlural((matrix)a->Data(),NULL,NULL,(poly)b->Data(),currRing);
2562	}
2563	else
2564	{
2565	ring r=rCopy(currRing);
2566	BOOLEAN result=nc_CallPlural((matrix)a->Data(),NULL,NULL,(poly)b->Data(),r);
2567	res->data=r;
2568	if (r->qideal!=NULL) res->rtyp=QRING_CMD;
2569	return result;
2570	}
2571	}
2572	static BOOLEAN jjPlural_mat_mat(leftv res, leftv a, leftv b)
2573	{
2574	if (iiOp==NCALGEBRA_CMD)
2575	{
2576	return nc_CallPlural((matrix)a->Data(),(matrix)b->Data(),NULL,NULL,currRing);
2577	}
2578	else
2579	{
2580	ring r=rCopy(currRing);
2581	BOOLEAN result=nc_CallPlural((matrix)a->Data(),(matrix)b->Data(),NULL,NULL,r);
2582	res->data=r;
2583	if (r->qideal!=NULL) res->rtyp=QRING_CMD;
2584	return result;
2585	}
2586	}
2587	static BOOLEAN jjBRACKET(leftv res, leftv a, leftv b)
2588	{
2589	if (rIsPluralRing(currRing))
2590	{
2591	poly p = (poly)a->CopyD(POLY_CMD);
2592	poly q = (poly)b->Data();
2593	res->data = nc_p_Bracket_qq(p,q);
2594	}
2595	else res->data=NULL;
2596	return FALSE;
2597	}
2598	static BOOLEAN jjOPPOSE(leftv res, leftv a, leftv b)
2599	{
2600	/* number, poly, vector, ideal, module, matrix */
2601	ring r = (ring)a->Data();
2602	if (r == currRing)
2603	{
2604	res->data = b->Data();
2605	res->rtyp = b->rtyp;
2606	return FALSE;
2607	}
2608	if (!rIsLikeOpposite(currRing, r))
2609	{
2610	Werror("%s is not an opposite ring to current ring",a->Fullname());
2611	return TRUE;
2612	}
2613	idhdl w;
2614	if( ((w=r->idroot->get(b->Name(),myynest))!=NULL) && (b->e==NULL))
2615	{
2616	int argtype = IDTYP(w);
2617	switch (argtype)
2618	{
2619	case NUMBER_CMD:
2620	{
2621	/* since basefields are equal, we can apply nCopy */
2622	res->data = nCopy((number)IDDATA(w));
2623	res->rtyp = argtype;
2624	break;
2625	}
2626	case POLY_CMD:
2627	case VECTOR_CMD:
2628	{
2629	poly q = (poly)IDDATA(w);
2630	res->data = pOppose(r,q);
2631	res->rtyp = argtype;
2632	break;
2633	}
2634	case IDEAL_CMD:
2635	case MODUL_CMD:
2636	{
2637	ideal Q = (ideal)IDDATA(w);
2638	res->data = idOppose(r,Q);
2639	res->rtyp = argtype;
2640	break;
2641	}
2642	case MATRIX_CMD:
2643	{
2644	ring save = currRing;
2645	rChangeCurrRing(r);
2646	matrix m = (matrix)IDDATA(w);
2647	ideal Q = idMatrix2Module(mpCopy(m));
2648	rChangeCurrRing(save);
2649	ideal S = idOppose(r,Q);
2650	id_Delete(&Q, r);
2651	res->data = idModule2Matrix(S);
2652	res->rtyp = argtype;
2653	break;
2654	}
2655	default:
2656	{
2657	WerrorS("unsupported type in oppose");
2658	return TRUE;
2659	}
2660	}
2661	}
2662	else
2663	{
2664	Werror("identifier %s not found in %s",b->Fullname(),a->Fullname());
2665	return TRUE;
2666	}
2667	return FALSE;
2668	}
2669	#endif /* HAVE_PLURAL */
2670
2671	static BOOLEAN jjQUOT(leftv res, leftv u, leftv v)
2672	{
2673	res->data = (char *)idQuot((ideal)u->Data(),(ideal)v->Data(),
2674	hasFlag(u,FLAG_STD),u->Typ()==v->Typ());
2675	idDelMultiples((ideal)(res->data));
2676	return FALSE;
2677	}
2678	static BOOLEAN jjRANDOM(leftv res, leftv u, leftv v)
2679	{
2680	int i=(int)(long)u->Data();
2681	int j=(int)(long)v->Data();
2682	#ifdef buildin_rand
2683	res->data =(char *)(long)((i > j) ? i : (siRand() % (j-i+1)) + i);
2684	#else /* buildin_rand */
2685	res->data =(char *)(long)((i > j) ? i : (rand() % (j-i+1)) + i);
2686	#endif /* buildin_rand */
2687	return FALSE;
2688	}
2689	static BOOLEAN jjREAD2(leftv res, leftv u, leftv v)
2690	{
2691	si_link l=(si_link)u->Data();
2692	leftv r=slRead(l,v);
2693	if (r==NULL)
2694	{
2695	const char *s;
2696	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2697	else s=sNoName;
2698	Werror("cannot read from `%s`",s);
2699	return TRUE;
2700	}
2701	memcpy(res,r,sizeof(sleftv));
2702	omFreeBin((ADDRESS)r, sleftv_bin);
2703	return FALSE;
2704	}
2705	static BOOLEAN jjREDUCE_P(leftv res, leftv u, leftv v)
2706	{
2707	assumeStdFlag(v);
2708	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data());
2709	return FALSE;
2710	}
2711	static BOOLEAN jjREDUCE_ID(leftv res, leftv u, leftv v)
2712	{
2713	assumeStdFlag(v);
2714	ideal ui=(ideal)u->Data();
2715	idTest(ui);
2716	ideal vi=(ideal)v->Data();
2717	idTest(vi);
2718	res->data = (char *)kNF(vi,currQuotient,ui);
2719	return FALSE;
2720	}
2721	#if 0
2722	static BOOLEAN jjRES(leftv res, leftv u, leftv v)
2723	{
2724	int maxl=(int)(long)v->Data();
2725	if (maxl<0)
2726	{
2727	WerrorS("length for res must not be negative");
2728	return TRUE;
2729	}
2730	int l=0;
2731	//resolvente r;
2732	syStrategy r;
2733	intvec *weights=NULL;
2734	int wmaxl=maxl;
2735	ideal u_id=(ideal)u->Data();
2736
2737	maxl--;
2738	if ((maxl==-1) /&& (iiOp!=MRES_CMD)/)
2739	{
2740	maxl = pVariables-1+2*(iiOp==MRES_CMD);
2741	if (currQuotient!=NULL)
2742	{
2743	Warn(
2744	"full resolution in a qring may be infinite, setting max length to %d",
2745	maxl+1);
2746	}
2747	}
2748	weights=(intvec*)atGet(u,"isHomog",INTVEC_CMD);
2749	if (weights!=NULL)
2750	{
2751	if (!idTestHomModule(u_id,currQuotient,weights))
2752	{
2753	WarnS("wrong weights given:");weights->show();PrintLn();
2754	weights=NULL;
2755	}
2756	}
2757	intvec *ww=NULL;
2758	int add_row_shift=0;
2759	if (weights!=NULL)
2760	{
2761	ww=ivCopy(weights);
2762	add_row_shift = ww->min_in();
2763	(*ww) -= add_row_shift;
2764	}
2765	else
2766	idHomModule(u_id,currQuotient,&ww);
2767	weights=ww;
2768
2769	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
2770	{
2771	r=syResolution(u_id,maxl, ww, iiOp==MRES_CMD);
2772	}
2773	else if (iiOp==SRES_CMD)
2774	// r=sySchreyerResolvente(u_id,maxl+1,&l);
2775	r=sySchreyer(u_id,maxl+1);
2776	else if (iiOp == LRES_CMD)
2777	{
2778	int dummy;
2779	if((currQuotient!=NULL)\|\|
2780	(!idHomIdeal (u_id,NULL)))
2781	{
2782	WerrorS
2783	("`lres` not implemented for inhomogeneous input or qring");
2784	return TRUE;
2785	}
2786	r=syLaScala3(u_id,&dummy);
2787	}
2788	else if (iiOp == KRES_CMD)
2789	{
2790	int dummy;
2791	if((currQuotient!=NULL)\|\|
2792	(!idHomIdeal (u_id,NULL)))
2793	{
2794	WerrorS
2795	("`kres` not implemented for inhomogeneous input or qring");
2796	return TRUE;
2797	}
2798	r=syKosz(u_id,&dummy);
2799	}
2800	else
2801	{
2802	int dummy;
2803	if((currQuotient!=NULL)\|\|
2804	(!idHomIdeal (u_id,NULL)))
2805	{
2806	WerrorS
2807	("`hres` not implemented for inhomogeneous input or qring");
2808	return TRUE;
2809	}
2810	r=syHilb(u_id,&dummy);
2811	}
2812	if (r==NULL) return TRUE;
2813	//res->data=(void *)liMakeResolv(r,l,wmaxl,u->Typ(),weights);
2814	r->list_length=wmaxl;
2815	res->data=(void *)r;
2816	if ((r->weights!=NULL) && (r->weights[0]!=NULL))
2817	{
2818	intvec *w=ivCopy(r->weights[0]);
2819	if (weights!=NULL) (*w) += add_row_shift;
2820	atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
2821	delete w;
2822	}
2823	else
2824	{
2825	//#if 0
2826	// need to set weights for ALL components (sres)
2827	if (weights!=NULL)
2828	{
2829	atSet(res,omStrDup("isHomog"),ivCopy(weights),INTVEC_CMD);
2830	r->weights = (intvec**)omAlloc0Bin(void_ptr_bin);
2831	(r->weights)[0] = ivCopy(weights);
2832	}
2833	//#endif
2834	}
2835	if (ww!=NULL) { delete ww; ww=NULL; }
2836	return FALSE;
2837	}
2838	#else
2839	static BOOLEAN jjRES(leftv res, leftv u, leftv v)
2840	{
2841	int maxl=(int)(long)v->Data();
2842	if (maxl<0)
2843	{
2844	WerrorS("length for res must not be negative");
2845	return TRUE;
2846	}
2847	int l=0;
2848	//resolvente r;
2849	syStrategy r;
2850	intvec *weights=NULL;
2851	int wmaxl=maxl;
2852	ideal u_id=(ideal)u->Data();
2853
2854	maxl--;
2855	if ((maxl==-1) /&& (iiOp!=MRES_CMD)/)
2856	{
2857	maxl = pVariables-1+2*(iiOp==MRES_CMD);
2858	if (currQuotient!=NULL)
2859	{
2860	Warn(
2861	"full resolution in a qring may be infinite, setting max length to %d",
2862	maxl+1);
2863	}
2864	}
2865	weights=(intvec*)atGet(u,"isHomog",INTVEC_CMD);
2866	if (weights!=NULL)
2867	{
2868	if (!idTestHomModule(u_id,currQuotient,weights))
2869	{
2870	WarnS("wrong weights given:");weights->show();PrintLn();
2871	weights=NULL;
2872	}
2873	}
2874	intvec *ww=NULL;
2875	int add_row_shift=0;
2876	if (weights!=NULL)
2877	{
2878	ww=ivCopy(weights);
2879	add_row_shift = ww->min_in();
2880	(*ww) -= add_row_shift;
2881	}
2882	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
2883	{
2884	r=syResolution(u_id,maxl, ww, iiOp==MRES_CMD);
2885	}
2886	else if (iiOp==SRES_CMD)
2887	// r=sySchreyerResolvente(u_id,maxl+1,&l);
2888	r=sySchreyer(u_id,maxl+1);
2889	else if (iiOp == LRES_CMD)
2890	{
2891	int dummy;
2892	if((currQuotient!=NULL)\|\|
2893	(!idHomIdeal (u_id,NULL)))
2894	{
2895	WerrorS
2896	("`lres` not implemented for inhomogeneous input or qring");
2897	return TRUE;
2898	}
2899	r=syLaScala3(u_id,&dummy);
2900	}
2901	else if (iiOp == KRES_CMD)
2902	{
2903	int dummy;
2904	if((currQuotient!=NULL)\|\|
2905	(!idHomIdeal (u_id,NULL)))
2906	{
2907	WerrorS
2908	("`kres` not implemented for inhomogeneous input or qring");
2909	return TRUE;
2910	}
2911	r=syKosz(u_id,&dummy);
2912	}
2913	else
2914	{
2915	int dummy;
2916	if((currQuotient!=NULL)\|\|
2917	(!idHomIdeal (u_id,NULL)))
2918	{
2919	WerrorS
2920	("`hres` not implemented for inhomogeneous input or qring");
2921	return TRUE;
2922	}
2923	r=syHilb(u_id,&dummy);
2924	}
2925	if (r==NULL) return TRUE;
2926	//res->data=(void *)liMakeResolv(r,l,wmaxl,u->Typ(),weights);
2927	r->list_length=wmaxl;
2928	res->data=(void *)r;
2929	if ((weights!=NULL) && (ww!=NULL)) { delete ww; ww=NULL; }
2930	if ((r->weights!=NULL) && (r->weights[0]!=NULL))
2931	{
2932	ww=ivCopy(r->weights[0]);
2933	if (weights!=NULL) (*ww) += add_row_shift;
2934	atSet(res,omStrDup("isHomog"),ww,INTVEC_CMD);
2935	}
2936	else
2937	{
2938	if (weights!=NULL)
2939	{
2940	atSet(res,omStrDup("isHomog"),ivCopy(weights),INTVEC_CMD);
2941	}
2942	}
2943	return FALSE;
2944	}
2945	#endif
2946	static BOOLEAN jjRSUM(leftv res, leftv u, leftv v)
2947	{
2948	ring r;
2949	int i=rSum((ring)u->Data(),(ring)v->Data(),r);
2950	res->data = (char *)r;
2951	return (i==-1);
2952	}
2953	#define SIMPL_LMDIV 32
2954	#define SIMPL_LMEQ 16
2955	#define SIMPL_MULT 8
2956	#define SIMPL_EQU 4
2957	#define SIMPL_NULL 2
2958	#define SIMPL_NORM 1
2959	static BOOLEAN jjSIMPL_ID(leftv res, leftv u, leftv v)
2960	{
2961	int sw = (int)(long)v->Data();
2962	// CopyD for IDEAL_CMD and MODUL_CMD are identical:
2963	ideal id = (ideal)u->CopyD(IDEAL_CMD);
2964	if (sw & SIMPL_LMDIV)
2965	{
2966	idDelDiv(id);
2967	}
2968	if (sw & SIMPL_LMEQ)
2969	{
2970	idDelLmEquals(id);
2971	}
2972	if (sw & SIMPL_MULT)
2973	{
2974	idDelMultiples(id);
2975	}
2976	else if(sw & SIMPL_EQU)
2977	{
2978	idDelEquals(id);
2979	}
2980	if (sw & SIMPL_NULL)
2981	{
2982	idSkipZeroes(id);
2983	}
2984	if (sw & SIMPL_NORM)
2985	{
2986	idNorm(id);
2987	}
2988	res->data = (char * )id;
2989	return FALSE;
2990	}
2991	static BOOLEAN jjSTATUS2(leftv res, leftv u, leftv v)
2992	{
2993	res->data = omStrDup(slStatus((si_link) u->Data(), (char *) v->Data()));
2994	return FALSE;
2995	}
2996	static BOOLEAN jjSIMPL_P(leftv res, leftv u, leftv v)
2997	{
2998	int sw = (int)(long)v->Data();
2999	// CopyD for POLY_CMD and VECTOR_CMD are identical:
3000	poly p = (poly)u->CopyD(POLY_CMD);
3001	if (sw & SIMPL_NORM)
3002	{
3003	pNorm(p);
3004	}
3005	res->data = (char * )p;
3006	return FALSE;
3007	}
3008	static BOOLEAN jjSTD_HILB(leftv res, leftv u, leftv v)
3009	{
3010	ideal result;
3011	intvec w=(intvec )atGet(u,"isHomog",INTVEC_CMD);
3012	tHomog hom=testHomog;
3013	ideal u_id=(ideal)(u->Data());
3014	if (w!=NULL)
3015	{
3016	if (!idTestHomModule(u_id,currQuotient,w))
3017	{
3018	WarnS("wrong weights");
3019	w=NULL;
3020	}
3021	else
3022	{
3023	w=ivCopy(w);
3024	hom=isHomog;
3025	}
3026	}
3027	result=kStd(u_id,currQuotient,hom,&w,(intvec *)v->Data());
3028	idSkipZeroes(result);
3029	res->data = (char *)result;
3030	setFlag(res,FLAG_STD);
3031	if (w!=NULL) atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
3032	return FALSE;
3033	}
3034	static BOOLEAN jjSTD_1(leftv res, leftv u, leftv v)
3035	{
3036	ideal result;
3037	assumeStdFlag(u);
3038	ideal i1=(ideal)(u->Data());
3039	ideal i0;
3040	int r=v->Typ();
3041	if ((/v->Typ()/r==POLY_CMD) \|\|(r==VECTOR_CMD))
3042	{
3043	i0=idInit(1,i1->rank);
3044	i0->m[0]=(poly)v->Data();
3045	}
3046	else /IDEAL/
3047	{
3048	i0=(ideal)v->CopyD();
3049	}
3050	int ii0=idElem(i0);
3051	i1=idSimpleAdd(i1,i0);
3052	memset(i0->m,0,sizeof(poly)*IDELEMS(i0));
3053	idDelete(&i0);
3054	intvec w=(intvec )atGet(u,"isHomog",INTVEC_CMD);
3055	tHomog hom=testHomog;
3056
3057	if (w!=NULL)
3058	{
3059	if (!idTestHomModule(i1,currQuotient,w))
3060	{
3061	// no warnung: this is legal, if i in std(i,p)
3062	// is homogeneous, but p not
3063	w=NULL;
3064	}
3065	else
3066	{
3067	w=ivCopy(w);
3068	hom=isHomog;
3069	}
3070	}
3071	BITSET save_test=test;
3072	test\|=Sy_bit(OPT_SB_1);
3073	result=kStd(i1,currQuotient,hom,&w,NULL,0,IDELEMS(i1)-ii0);
3074	test=save_test;
3075	idDelete(&i1);
3076	idSkipZeroes(result);
3077	res->data = (char *)result;
3078	if(!TEST_OPT_DEGBOUND) setFlag(res,FLAG_STD);
3079	if (w!=NULL) atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
3080	return FALSE;
3081	}
3082	static BOOLEAN jjVARSTR2(leftv res, leftv u, leftv v)
3083	{
3084	idhdl h=(idhdl)u->data;
3085	int i=(int)(long)v->Data();
3086	if ((0<i) && (i<=IDRING(h)->N))
3087	res->data=omStrDup(IDRING(h)->names[i-1]);
3088	else
3089	{
3090	Werror("var number %d out of range 1..%d",i,IDRING(h)->N);
3091	return TRUE;
3092	}
3093	return FALSE;
3094	}
3095	static BOOLEAN jjWEDGE(leftv res, leftv u, leftv v)
3096	{
3097	res->data = (char *)mpWedge((matrix)u->Data(),(int)(long)v->Data());
3098	return FALSE;
3099	}
3100	#define jjWRONG2 (proc2)jjWRONG
3101	#define jjWRONG3 (proc3)jjWRONG
3102	static BOOLEAN jjWRONG(leftv res, leftv u)
3103	{
3104	return TRUE;
3105	}
3106
3107	/=================== operations with 2 args.: table =================/
3108
3109	struct sValCmd2 dArith2[]=
3110	{
3111	// operations:
3112	// proc cmd res arg1 arg2 plural
3113	{jjCOLCOL, COLONCOLON, ANY_TYPE, DEF_CMD, DEF_CMD ALLOW_PLURAL}
3114	,{jjPLUS_I, '+', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3115	,{jjPLUS_BI, '+', BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3116	,{jjPLUS_N, '+', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3117	,{jjPLUS_P, '+', POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3118	,{jjPLUS_P, '+', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3119	,{jjPLUS_ID, '+', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3120	,{jjPLUS_ID, '+', MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3121	,{jjPLUS_P_MA, '+', MATRIX_CMD, POLY_CMD, MATRIX_CMD ALLOW_PLURAL}
3122	,{jjPLUS_MA_P, '+', MATRIX_CMD, MATRIX_CMD, POLY_CMD ALLOW_PLURAL}
3123	,{jjPLUS_MA, '+', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
3124	,{jjPLUS_S, '+', STRING_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3125	,{jjOP_IV_I, '+', INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3126	,{jjOP_I_IV, '+', INTVEC_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
3127	,{jjOP_IM_I, '+', INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3128	,{jjOP_I_IM, '+', INTMAT_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
3129	,{jjPLUS_IV, '+', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3130	,{jjPLUS_IV, '+', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
3131	,{lAdd, '+', LIST_CMD, LIST_CMD, LIST_CMD ALLOW_PLURAL}
3132	,{jjRSUM, '+', RING_CMD, RING_CMD, RING_CMD ALLOW_PLURAL}
3133	,{jjRSUM, '+', QRING_CMD, QRING_CMD, RING_CMD ALLOW_PLURAL}
3134	,{jjRSUM, '+', QRING_CMD, RING_CMD, QRING_CMD ALLOW_PLURAL}
3135	,{jjRSUM, '+', QRING_CMD, QRING_CMD, QRING_CMD ALLOW_PLURAL}
3136	,{jjMINUS_I, '-', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3137	,{jjMINUS_BI, '-', BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3138	,{jjMINUS_N, '-', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3139	,{jjMINUS_P, '-', POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3140	,{jjMINUS_P, '-', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3141	,{jjPLUS_MA_P, '-', MATRIX_CMD, MATRIX_CMD, POLY_CMD ALLOW_PLURAL}
3142	,{jjMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
3143	,{jjOP_IV_I, '-', INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3144	,{jjOP_IM_I, '-', INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3145	,{jjMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3146	,{jjMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
3147	,{jjTIMES_I, '*', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3148	,{jjTIMES_BI, '*', BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3149	,{jjTIMES_N, '*', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3150	,{jjTIMES_P, '*', POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3151	,{jjTIMES_P, '*', VECTOR_CMD, POLY_CMD, VECTOR_CMD ALLOW_PLURAL}
3152	,{jjTIMES_P, '*', VECTOR_CMD, VECTOR_CMD, POLY_CMD ALLOW_PLURAL}
3153	,{jjTIMES_MA_P1,'*', IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3154	,{jjTIMES_MA_P2,'*', IDEAL_CMD, POLY_CMD, IDEAL_CMD NO_PLURAL}
3155	,{jjTIMES_ID, '*', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3156	,{jjTIMES_MA_P1,'*', MODUL_CMD, IDEAL_CMD, VECTOR_CMD ALLOW_PLURAL}
3157	,{jjTIMES_MA_P2,'*', MODUL_CMD, VECTOR_CMD, IDEAL_CMD NO_PLURAL}
3158	,{jjTIMES_ID, '*', MODUL_CMD, IDEAL_CMD, MODUL_CMD ALLOW_PLURAL}
3159	,{jjTIMES_ID, '*', MODUL_CMD, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
3160	,{jjTIMES_MA_P1,'*', MATRIX_CMD, MATRIX_CMD, POLY_CMD ALLOW_PLURAL}
3161	,{jjTIMES_MA_P2,'*', MATRIX_CMD, POLY_CMD, MATRIX_CMD NO_PLURAL}
3162	,{jjTIMES_MA_N1,'*', MATRIX_CMD, MATRIX_CMD, NUMBER_CMD ALLOW_PLURAL}
3163	,{jjTIMES_MA_N2,'*', MATRIX_CMD, NUMBER_CMD, MATRIX_CMD ALLOW_PLURAL}
3164	,{jjTIMES_MA_I1,'*', MATRIX_CMD, MATRIX_CMD, INT_CMD ALLOW_PLURAL}
3165	,{jjTIMES_MA_I2,'*', MATRIX_CMD, INT_CMD, MATRIX_CMD ALLOW_PLURAL}
3166	,{jjTIMES_MA, '*', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
3167	,{jjOP_IV_I, '*', INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3168	,{jjOP_I_IV, '*', INTVEC_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
3169	,{jjOP_IV_I, '*', INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3170	,{jjOP_I_IV, '*', INTMAT_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
3171	,{jjTIMES_IV, '*', INTVEC_CMD, INTMAT_CMD, INTVEC_CMD ALLOW_PLURAL}
3172	,{jjTIMES_IV, '*', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
3173	,{jjTIMES_IV, '*', INTMAT_CMD, INTVEC_CMD, INTMAT_CMD ALLOW_PLURAL}
3174	,{jjDIV_N, '/', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3175	,{jjDIV_P, '/', POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3176	,{jjDIV_P, '/', VECTOR_CMD, VECTOR_CMD, POLY_CMD ALLOW_PLURAL}
3177	,{jjDIV_Ma, '/', MATRIX_CMD, MATRIX_CMD, POLY_CMD ALLOW_PLURAL}
3178	,{jjDIVMOD_I, '/', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3179	,{jjDIV_BI, '/', BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3180	,{jjOP_IV_I, '/', INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3181	,{jjOP_IV_I, '/', INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3182	,{jjDIVMOD_I, INTDIV_CMD, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3183	,{jjDIV_BI, INTDIV_CMD, BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3184	,{jjOP_IV_I, INTDIV_CMD, INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3185	,{jjOP_IV_I, INTDIV_CMD, INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3186	,{jjDIVMOD_I, '%', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3187	,{jjMOD_BI, '%', BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3188	,{jjOP_IV_I, '%', INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3189	,{jjOP_IV_I, '%', INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3190	,{jjMOD_N, '%', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3191	,{jjDIVMOD_I, INTMOD_CMD, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3192	,{jjMOD_BI, INTMOD_CMD, BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3193	,{jjOP_IV_I, INTMOD_CMD, INTVEC_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3194	,{jjOP_IV_I, INTMOD_CMD, INTMAT_CMD, INTMAT_CMD, INT_CMD ALLOW_PLURAL}
3195	,{jjMOD_N, INTMOD_CMD, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3196	,{jjPOWER_I, '^', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3197	,{jjPOWER_BI, '^', BIGINT_CMD, BIGINT_CMD, INT_CMD ALLOW_PLURAL}
3198	,{jjPOWER_N, '^', NUMBER_CMD, NUMBER_CMD, INT_CMD ALLOW_PLURAL}
3199	,{jjPOWER_P, '^', POLY_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
3200	,{jjPOWER_ID, '^', IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3201	,{jjLE_I, LE, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3202	,{jjLE_BI, LE, INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3203	,{jjLE_N, LE, INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3204	,{jjCOMPARE_S, LE, INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3205	,{jjCOMPARE_IV_I,LE, INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3206	,{jjCOMPARE_IV,LE, INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3207	,{jjCOMPARE_P, LE, INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3208	,{jjCOMPARE_P, LE, INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3209	,{jjLT_I, '<', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3210	,{jjLT_BI, '<', INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3211	,{jjLT_N, '<', INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3212	,{jjCOMPARE_IV_I,'<', INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3213	,{jjCOMPARE_IV,'<', INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3214	,{jjCOMPARE_S, '<', INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3215	,{jjCOMPARE_P, '<', INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3216	,{jjCOMPARE_P, '<', INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3217	,{jjGE_I, GE, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3218	,{jjGE_BI, GE, INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3219	,{jjGE_N, GE, INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3220	,{jjCOMPARE_S, GE, INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3221	,{jjCOMPARE_IV_I,GE, INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3222	,{jjCOMPARE_IV,GE, INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3223	,{jjCOMPARE_P, GE, INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3224	,{jjCOMPARE_P, GE, INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3225	,{jjGT_I, '>', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3226	,{jjGT_BI, '>', INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3227	,{jjGT_N, '>', INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3228	,{jjCOMPARE_S, '>', INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3229	,{jjCOMPARE_IV_I,'>', INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3230	,{jjCOMPARE_IV,'>', INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3231	,{jjCOMPARE_P, '>', INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3232	,{jjCOMPARE_P, '>', INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3233	,{jjAND_I, '&', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3234	,{jjOR_I, '\|', INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3235	,{jjEQUAL_I, EQUAL_EQUAL, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3236	,{jjEQUAL_BI, EQUAL_EQUAL, INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3237	,{jjEQUAL_N, EQUAL_EQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3238	,{jjCOMPARE_S, EQUAL_EQUAL, INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3239	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3240	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3241	,{jjCOMPARE_IV_I,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3242	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3243	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
3244	,{jjEQUAL_Ma, EQUAL_EQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
3245	,{jjWRONG2, EQUAL_EQUAL, 0, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3246	,{jjWRONG2, EQUAL_EQUAL, 0, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3247	,{jjWRONG2, EQUAL_EQUAL, 0, IDEAL_CMD, MODUL_CMD ALLOW_PLURAL}
3248	,{jjWRONG2, EQUAL_EQUAL, 0, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
3249	,{jjEQUAL_I, NOTEQUAL, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3250	,{jjEQUAL_BI, NOTEQUAL, INT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3251	,{jjEQUAL_N, NOTEQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3252	,{jjCOMPARE_S, NOTEQUAL, INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3253	,{jjEQUAL_P, NOTEQUAL, INT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3254	,{jjEQUAL_P, NOTEQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
3255	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3256	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
3257	,{jjEQUAL_Ma, NOTEQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
3258	,{jjWRONG2, NOTEQUAL, 0, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3259	,{jjWRONG2, NOTEQUAL, 0, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3260	,{jjWRONG2, NOTEQUAL, 0, IDEAL_CMD, MODUL_CMD ALLOW_PLURAL}
3261	,{jjWRONG2, NOTEQUAL, 0, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
3262	,{jjDOTDOT, DOTDOT, INTVEC_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3263	,{jjINDEX_I, '[', INT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
3264	,{jjINDEX_IV, '[', INT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3265	,{jjINDEX_I, '[', POLY_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3266	,{jjINDEX_I, '[', POLY_CMD, MAP_CMD, INT_CMD ALLOW_PLURAL}
3267	,{jjINDEX_IV, '[', POLY_CMD, IDEAL_CMD, INTVEC_CMD ALLOW_PLURAL}
3268	,{jjINDEX_I, '[', VECTOR_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3269	,{jjINDEX_IV, '[', VECTOR_CMD, MODUL_CMD, INTVEC_CMD ALLOW_PLURAL}
3270	,{jjINDEX_I, '[', STRING_CMD, STRING_CMD, INT_CMD ALLOW_PLURAL}
3271	,{jjINDEX_IV, '[', STRING_CMD, STRING_CMD, INTVEC_CMD ALLOW_PLURAL}
3272	,{jjINDEX_I, '[', ANY_TYPE/set by p/,LIST_CMD, INT_CMD ALLOW_PLURAL}
3273	,{jjINDEX_IV, '[', ANY_TYPE/set by p/,LIST_CMD, INTVEC_CMD ALLOW_PLURAL}
3274	,{jjINDEX_P, '[', POLY_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
3275	,{jjINDEX_P_IV,'[', POLY_CMD, POLY_CMD, INTVEC_CMD ALLOW_PLURAL}
3276	,{jjINDEX_V, '[', POLY_CMD, VECTOR_CMD, INT_CMD ALLOW_PLURAL}
3277	,{jjINDEX_V_IV,'[', VECTOR_CMD, VECTOR_CMD, INTVEC_CMD ALLOW_PLURAL}
3278	,{jjPROC, '(', ANY_TYPE/set by p/,PROC_CMD, DEF_CMD ALLOW_PLURAL}
3279	,{jjMAP, '(', ANY_TYPE/set by p/,MAP_CMD, DEF_CMD ALLOW_PLURAL}
3280	,{jjKLAMMER, '(', ANY_TYPE/set by p/,ANY_TYPE, INT_CMD ALLOW_PLURAL}
3281	,{jjKLAMMER_IV,'(', ANY_TYPE/set by p/,ANY_TYPE, INTVEC_CMD ALLOW_PLURAL}
3282	,{jjCOLON, ':', INTVEC_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3283	// and the procedures with 2 arguments:
3284	,{atATTRIB2, ATTRIB_CMD, NONE/set by p/,DEF_CMD, STRING_CMD ALLOW_PLURAL}
3285	,{jjWRONG2, BAREISS_CMD, 0, DEF_CMD, DEF_CMD ALLOW_PLURAL}
3286	,{jjBETTI2, BETTI_CMD, INTMAT_CMD, LIST_CMD, INT_CMD ALLOW_PLURAL}
3287	,{syBetti2, BETTI_CMD, INTMAT_CMD, RESOLUTION_CMD, INT_CMD ALLOW_PLURAL}
3288	,{jjBETTI2_ID, BETTI_CMD, INTMAT_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3289	,{jjBETTI2_ID, BETTI_CMD, INTMAT_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3290	#ifdef HAVE_PLURAL
3291	,{jjBRACKET, BRACKET_CMD, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3292	#endif
3293	,{jjCHINREM_BI,CHINREM_CMD, BIGINT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
3294	//,{jjCHINREM_P, CHINREM_CMD, POLY_CMD, LIST_CMD, INTVEC_CMD ALLOW_PLURAL}
3295	,{jjCHINREM_ID,CHINREM_CMD, IDEAL_CMD, LIST_CMD, INTVEC_CMD ALLOW_PLURAL}
3296	,{jjCOEF, COEF_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3297	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3298	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD ALLOW_PLURAL}
3299	,{jjCOEFFS2_KB,COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3300	,{jjCOEFFS2_KB,COEFFS_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3301	,{jjCONTRACT, CONTRACT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3302	,{jjDEG_IV, DEG_CMD, INT_CMD, POLY_CMD, INTVEC_CMD ALLOW_PLURAL}
3303	,{jjDEG_IV, DEG_CMD, INT_CMD, VECTOR_CMD, INTVEC_CMD ALLOW_PLURAL}
3304	,{jjDEG_M_IV, DEG_CMD, INT_CMD, MATRIX_CMD, INTVEC_CMD ALLOW_PLURAL}
3305	,{lDelete, DELETE_CMD, LIST_CMD, LIST_CMD, INT_CMD ALLOW_PLURAL}
3306	,{jjDIFF_P, DIFF_CMD, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3307	,{jjDIFF_P, DIFF_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD ALLOW_PLURAL}
3308	,{jjDIFF_ID, DIFF_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3309	,{jjDIFF_ID_ID,DIFF_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3310	,{jjDIFF_ID, DIFF_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD ALLOW_PLURAL}
3311	,{jjDIFF_ID, DIFF_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD ALLOW_PLURAL}
3312	,{jjDIM2, DIM_CMD, INT_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
3313	,{jjDIM2, DIM_CMD, INT_CMD, MODUL_CMD, IDEAL_CMD NO_PLURAL}
3314	,{jjDIVISION, DIVISION_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
3315	,{jjDIVISION, DIVISION_CMD, LIST_CMD, MODUL_CMD, MODUL_CMD NO_PLURAL}
3316	,{jjELIMIN, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3317	,{jjELIMIN, ELIMINATION_CMD,MODUL_CMD, MODUL_CMD, POLY_CMD ALLOW_PLURAL}
3318	,{jjELIMIN_IV, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, INTVEC_CMD ALLOW_PLURAL}
3319	,{jjELIMIN_IV, ELIMINATION_CMD,MODUL_CMD, MODUL_CMD, INTVEC_CMD ALLOW_PLURAL}
3320	,{jjEXPORTTO, EXPORTTO_CMD, NONE, PACKAGE_CMD, IDHDL ALLOW_PLURAL}
3321	,{jjEXTGCD_I, EXTGCD_CMD, LIST_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3322	#ifdef HAVE_FACTORY
3323	,{jjEXTGCD_P, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
3324	,{jjFAC_P2, FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD NO_PLURAL}
3325	,{jjFACSTD2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
3326	#else
3327	,{jjWRONG2, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
3328	,{jjWRONG2, FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD NO_PLURAL}
3329	,{jjWRONG2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
3330	#endif
3331	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE ALLOW_PLURAL}
3332	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE ALLOW_PLURAL}
3333	#ifdef HAVE_FGLM
3334	,{fglmProc, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD NO_PLURAL}
3335	,{fglmProc, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD NO_PLURAL}
3336	,{fglmQuotProc,FGLMQUOT_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD NO_PLURAL}
3337	#else
3338	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD NO_PLURAL}
3339	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD NO_PLURAL}
3340	,{jjWRONG2, FGLMQUOT_CMD, IDEAL_CMD, POLY_CMD, IDEAL_CMD NO_PLURAL}
3341	#endif
3342	,{jjFIND2, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3343	,{jjFWALK, FWALK_CMD, IDEAL_CMD, RING_CMD, DEF_CMD NO_PLURAL}
3344	,{jjGCD_I, GCD_CMD, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3345	,{jjGCD_N, GCD_CMD, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
3346	,{jjGCD_BI, GCD_CMD, BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
3347	#if defined(HAVE_FACTORY) && defined(HAVE_LIBFAC_P)
3348	,{jjGCD_P, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
3349	#else
3350	,{jjWRONG2, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
3351	#endif
3352	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3353	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, MODUL_CMD, INT_CMD NO_PLURAL}
3354	,{jjHOMOG_P, HOMOG_CMD, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
3355	,{jjHOMOG_P, HOMOG_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD ALLOW_PLURAL}
3356	,{jjHOMOG_ID, HOMOG_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3357	,{jjHOMOG_ID, HOMOG_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD ALLOW_PLURAL}
3358	,{jjRES, HRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3359	,{jjCALL2MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
3360	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE ALLOW_PLURAL}
3361	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE ALLOW_PLURAL}
3362	,{jjIMPORTFROM,IMPORTFROM_CMD, NONE, PACKAGE_CMD, ANY_TYPE ALLOW_PLURAL}
3363	,{jjINDEPSET2, INDEPSET_CMD, LIST_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3364	,{lInsert, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD ALLOW_PLURAL}
3365	#ifdef HAVE_INTERPOLATION
3366	,{jjINTERPOLATION,INTERPOLATE_CMD,IDEAL_CMD, LIST_CMD, INTVEC_CMD NO_PLURAL}
3367	#endif
3368	,{jjINTERSECT, INTERSECT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3369	,{jjINTERSECT, INTERSECT_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3370	,{jjJanetBasis2, JANET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3371	,{jjJET_P, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
3372	,{jjJET_ID, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3373	,{jjJET_P, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD ALLOW_PLURAL}
3374	,{jjJET_ID, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3375	,{jjJET_ID, JET_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD ALLOW_PLURAL}
3376	,{jjKBASE2, KBASE_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3377	,{jjKBASE2, KBASE_CMD, MODUL_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3378	,{jjKERNEL, KERNEL_CMD, IDEAL_CMD, RING_CMD, ANY_TYPE ALLOW_PLURAL}
3379	,{jjKERNEL, KERNEL_CMD, IDEAL_CMD, QRING_CMD, ANY_TYPE ALLOW_PLURAL}
3380	,{atKILLATTR2, KILLATTR_CMD, NONE, IDHDL, STRING_CMD ALLOW_PLURAL}
3381	,{jjKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD NO_PLURAL}
3382	,{jjKoszul_Id, KOSZUL_CMD, MATRIX_CMD, INT_CMD, IDEAL_CMD NO_PLURAL}
3383	,{jjRES, KRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3384	,{jjLIFT, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3385	,{jjLIFT, LIFT_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3386	,{jjLIFTSTD, LIFTSTD_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD ALLOW_PLURAL}
3387	,{jjLIFTSTD, LIFTSTD_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD ALLOW_PLURAL}
3388	,{jjCALL2MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
3389	,{jjLOAD_E, LOAD_CMD, NONE, STRING_CMD, STRING_CMD ALLOW_PLURAL}
3390	,{jjRES, LRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3391	,{jjMINOR, MINOR_CMD, IDEAL_CMD, MATRIX_CMD, INT_CMD NO_PLURAL}
3392	,{jjCALL2MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
3393	,{jjMODULO, MODULO_CMD, MODUL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3394	,{jjMODULO, MODULO_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3395	,{jjMONITOR2, MONITOR_CMD, NONE, LINK_CMD, STRING_CMD ALLOW_PLURAL}
3396	//,{jjRES, MRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3397	//,{jjRES, MRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD NO_PLURAL}
3398	,{nuMPResMat, MPRES_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3399	,{jjRES, MRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3400	,{jjRES, MRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3401	//,{nuMPResMat, MPRES_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3402	#ifdef HAVE_PLURAL
3403	,{jjPlural_num_poly, NCALGEBRA_CMD,NONE, POLY_CMD, POLY_CMD NO_PLURAL}
3404	,{jjPlural_num_mat, NCALGEBRA_CMD,NONE, POLY_CMD, MATRIX_CMD NO_PLURAL}
3405	,{jjPlural_mat_poly, NCALGEBRA_CMD,NONE, MATRIX_CMD, POLY_CMD NO_PLURAL}
3406	,{jjPlural_mat_mat, NCALGEBRA_CMD,NONE, MATRIX_CMD, MATRIX_CMD NO_PLURAL}
3407	,{jjPlural_num_poly, NC_ALGEBRA_CMD,RING_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
3408	,{jjPlural_num_mat, NC_ALGEBRA_CMD,RING_CMD, POLY_CMD, MATRIX_CMD NO_PLURAL}
3409	,{jjPlural_mat_poly, NC_ALGEBRA_CMD,RING_CMD, MATRIX_CMD, POLY_CMD NO_PLURAL}
3410	,{jjPlural_mat_mat, NC_ALGEBRA_CMD,RING_CMD, MATRIX_CMD, MATRIX_CMD NO_PLURAL}
3411	#endif
3412	#ifdef HAVE_PLURAL
3413	,{jjOPPOSE, OPPOSE_CMD, ANY_TYPE/set by p/, RING_CMD, DEF_CMD ALLOW_PLURAL}
3414	,{jjOPPOSE, OPPOSE_CMD, ANY_TYPE/set by p/, QRING_CMD, DEF_CMD ALLOW_PLURAL}
3415	#endif
3416	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD ALLOW_PLURAL}
3417	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD ALLOW_PLURAL}
3418	,{jjPRINT_FORMAT, PRINT_CMD, ANY_TYPE, DEF_CMD, STRING_CMD ALLOW_PLURAL}
3419	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3420	,{jjQUOT, QUOTIENT_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
3421	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3422	,{jjRANDOM, RANDOM_CMD, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
3423	,{jjREAD2, READ_CMD, STRING_CMD, LINK_CMD, STRING_CMD ALLOW_PLURAL}
3424	,{jjREDUCE_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD ALLOW_PLURAL}
3425	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD ALLOW_PLURAL}
3426	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD ALLOW_PLURAL}
3427	,{jjREDUCE_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3428	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3429	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
3430	//,{jjRES, RES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3431	//,{jjRES, RES_CMD, LIST_CMD, MODUL_CMD, INT_CMD NO_PLURAL}
3432	,{jjRES, RES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3433	,{jjRES, RES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3434	,{jjSTATUS2, STATUS_CMD, STRING_CMD, LINK_CMD, STRING_CMD ALLOW_PLURAL}
3435	,{jjSIMPL_P, SIMPLIFY_CMD, POLY_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
3436	,{jjSIMPL_P, SIMPLIFY_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD ALLOW_PLURAL}
3437	,{jjSIMPL_ID, SIMPLIFY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
3438	,{jjSIMPL_ID, SIMPLIFY_CMD, MODUL_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
3439	//,{jjRES, SRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3440	//,{jjRES, SRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD NO_PLURAL}
3441	,{jjRES, SRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
3442	,{jjRES, SRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD NO_PLURAL}
3443	,{jjCALL2MANY, SYSTEM_CMD, ANY_TYPE/set by p/,STRING_CMD, DEF_CMD ALLOW_PLURAL}
3444	,{jjSTD_1, STD_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
3445	,{jjSTD_1, STD_CMD, MODUL_CMD, MODUL_CMD, VECTOR_CMD ALLOW_PLURAL}
3446	,{jjSTD_1, STD_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
3447	,{jjSTD_1, STD_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
3448	,{jjSTD_HILB, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD NO_PLURAL}
3449	,{jjSTD_HILB, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD NO_PLURAL}
3450	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD ALLOW_PLURAL}
3451	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD ALLOW_PLURAL}
3452	,{jjWEDGE, WEDGE_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD NO_PLURAL}
3453	,{NULL, 0, 0, 0, 0 NO_PLURAL}
3454	};
3455	/=================== operations with 1 arg.: static proc =================/
3456	static BOOLEAN jjDUMMY(leftv res, leftv u)
3457	{
3458	res->data = (char *)u->CopyD();
3459	return FALSE;
3460	}
3461	static BOOLEAN jjNULL(leftv res, leftv u)
3462	{
3463	return FALSE;
3464	}
3465	//static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
3466	//{
3467	// res->data = (char *)((int)(long)u->Data()+1);
3468	// return FALSE;
3469	//}
3470	//static BOOLEAN jjMINUSMINUS(leftv res, leftv u)
3471	//{
3472	// res->data = (char *)((int)(long)u->Data()-1);
3473	// return FALSE;
3474	//}
3475	static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
3476	{
3477	if (IDTYP((idhdl)u->data)==INT_CMD)
3478	{
3479	int i=IDINT((idhdl)u->data);
3480	if (iiOp==PLUSPLUS) i++;
3481	else i--;
3482	IDDATA((idhdl)u->data)=(char *)(long)i;
3483	return FALSE;
3484	}
3485	return TRUE;
3486	}
3487	static BOOLEAN jjUMINUS_BI(leftv res, leftv u)
3488	{
3489	number n=(number)u->CopyD(BIGINT_CMD);
3490	n=nlNeg(n);
3491	res->data = (char *)n;
3492	return FALSE;
3493	}
3494	static BOOLEAN jjUMINUS_I(leftv res, leftv u)
3495	{
3496	res->data = (char *)(-(long)u->Data());
3497	return FALSE;
3498	}
3499	static BOOLEAN jjUMINUS_N(leftv res, leftv u)
3500	{
3501	number n=(number)u->CopyD(NUMBER_CMD);
3502	n=nNeg(n);
3503	res->data = (char *)n;
3504	return FALSE;
3505	}
3506	static BOOLEAN jjUMINUS_P(leftv res, leftv u)
3507	{
3508	res->data = (char *)pNeg((poly)u->CopyD(POLY_CMD));
3509	return FALSE;
3510	}
3511	static BOOLEAN jjUMINUS_MA(leftv res, leftv u)
3512	{
3513	poly m1=pISet(-1);
3514	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),m1);
3515	return FALSE;
3516	}
3517	static BOOLEAN jjUMINUS_IV(leftv res, leftv u)
3518	{
3519	intvec iv=(intvec )u->CopyD(INTVEC_CMD);
3520	(iv)=(-1);
3521	res->data = (char *)iv;
3522	return FALSE;
3523	}
3524	static BOOLEAN jjPROC1(leftv res, leftv u)
3525	{
3526	return jjPROC(res,u,NULL);
3527	}
3528	static BOOLEAN jjBAREISS(leftv res, leftv v)
3529	{
3530	//matrix m=(matrix)v->Data();
3531	//lists l=mpBareiss(m,FALSE);
3532	intvec *iv;
3533	ideal m;
3534	smCallNewBareiss((ideal)v->Data(),0,0,m,&iv);
3535	lists l=(lists)omAllocBin(slists_bin);
3536	l->Init(2);
3537	l->m[0].rtyp=MODUL_CMD;
3538	l->m[1].rtyp=INTVEC_CMD;
3539	l->m[0].data=(void *)m;
3540	l->m[1].data=(void *)iv;
3541	res->data = (char *)l;
3542	return FALSE;
3543	}
3544	//static BOOLEAN jjBAREISS_IM(leftv res, leftv v)
3545	//{
3546	// intvec m=(intvec )v->CopyD(INTMAT_CMD);
3547	// ivTriangMat(m);
3548	// res->data = (char *)m;
3549	// return FALSE;
3550	//}
3551	static BOOLEAN jjBI2N(leftv res, leftv u)
3552	{
3553	if (rField_is_Q())
3554	{
3555	res->data=u->CopyD();
3556	return FALSE;
3557	}
3558	else
3559	{
3560	BOOLEAN bo=FALSE;
3561	number n=(number)u->CopyD();
3562	if (rField_is_Zp())
3563	{
3564	res->data=(void *)npMap0(n);
3565	}
3566	else if (rField_is_Q_a())
3567	{
3568	res->data=(void *)naMap00(n);
3569	}
3570	else if (rField_is_Zp_a())
3571	{
3572	res->data=(void *)naMap0P(n);
3573	}
3574	#ifdef HAVE_RINGS
3575	else if (rField_is_Ring_Z())
3576	{
3577	res->data=(void *)nrzMapQ(n);
3578	}
3579	else if (rField_is_Ring_ModN())
3580	{
3581	res->data=(void *)nrnMapQ(n);
3582	}
3583	else if (rField_is_Ring_PtoM())
3584	{
3585	res->data=(void *)nrnMapQ(n);
3586	}
3587	else if (rField_is_Ring_2toM())
3588	{
3589	res->data=(void *)nr2mMapQ(n);
3590	}
3591	#endif
3592	else
3593	{
3594	WerrorS("cannot convert bigint to this field");
3595	bo=TRUE;
3596	}
3597	nlDelete(&n,NULL);
3598	return bo;
3599	}
3600	}
3601	static BOOLEAN jjBI2P(leftv res, leftv u)
3602	{
3603	sleftv tmp;
3604	BOOLEAN bo=jjBI2N(&tmp,u);
3605	if (!bo)
3606	{
3607	number n=(number) tmp.data;
3608	if (nIsZero(n)) { res->data=NULL;nDelete(&n); }
3609	else
3610	{
3611	poly p=pOne();
3612	pSetCoeff(p,n);
3613	res->data=(void *)p;
3614	}
3615	}
3616	return bo;
3617	}
3618	static BOOLEAN jjCALL1MANY(leftv res, leftv u)
3619	{
3620	return iiExprArithM(res,u,iiOp);
3621	}
3622	static BOOLEAN jjCHAR(leftv res, leftv v)
3623	{
3624	res->data = (char *)(long)rChar((ring)v->Data());
3625	return FALSE;
3626	}
3627	static BOOLEAN jjCOLS(leftv res, leftv v)
3628	{
3629	res->data = (char *)(long)MATCOLS((matrix)(v->Data()));
3630	return FALSE;
3631	}
3632	static BOOLEAN jjCOLS_IV(leftv res, leftv v)
3633	{
3634	res->data = (char )(long)((intvec)(v->Data()))->cols();
3635	return FALSE;
3636	}
3637	static BOOLEAN jjCONTENT(leftv res, leftv v)
3638	{
3639	// CopyD for POLY_CMD and VECTOR_CMD are identical:
3640	poly p=(poly)v->CopyD(POLY_CMD);
3641	if (p!=NULL) pCleardenom(p);
3642	res->data = (char *)p;
3643	return FALSE;
3644	}
3645	static BOOLEAN jjCOUNT_N(leftv res, leftv v)
3646	{
3647	res->data = (char *)(long)nSize((number)v->Data());
3648	return FALSE;
3649	}
3650	static BOOLEAN jjCOUNT_L(leftv res, leftv v)
3651	{
3652	lists l=(lists)v->Data();
3653	res->data = (char *)(long)(l->nr+1);
3654	return FALSE;
3655	}
3656	static BOOLEAN jjCOUNT_M(leftv res, leftv v)
3657	{
3658	matrix m=(matrix)v->Data();
3659	res->data = (char )(long)(MATROWS(m)MATCOLS(m));
3660	return FALSE;
3661	}
3662	static BOOLEAN jjCOUNT_IV(leftv res, leftv v)
3663	{
3664	res->data = (char )(long)((intvec)(v->Data()))->length();
3665	return FALSE;
3666	}
3667	static BOOLEAN jjCOUNT_RG(leftv res, leftv v)
3668	{
3669	ring r=(ring)v->Data();
3670	int elems=-1;
3671	if (rField_is_Zp(r)\|\|rField_is_GF(r)) elems=rInternalChar(r);
3672	else if (rField_is_Zp_a(r) && (r->minpoly!=NULL))
3673	{
3674	#ifdef HAVE_FACTORY
3675	extern int ipower ( int b, int n ); /* factory/cf_util */
3676	elems=ipower(ABS(rInternalChar(r)),naParDeg(r->minpoly));
3677	#else
3678	elems=(int)pow(ABS((double) rInternalChar(r)),(double)naParDeg(r->minpoly));
3679	#endif
3680	}
3681	res->data = (char *)(long)elems;
3682	return FALSE;
3683	}
3684	static BOOLEAN jjDEG(leftv res, leftv v)
3685	{
3686	int dummy;
3687	poly p=(poly)v->Data();
3688	if (p!=NULL) res->data = (char *)pLDeg(p,&dummy,currRing);
3689	else res->data=(char *)-1;
3690	return FALSE;
3691	}
3692	static BOOLEAN jjDEG_M(leftv res, leftv u)
3693	{
3694	ideal I=(ideal)u->Data();
3695	int d=-1;
3696	int dummy;
3697	int i;
3698	for(i=IDELEMS(I)-1;i>=0;i--)
3699	if (I->m[i]!=NULL) d=si_max(d,(int)pLDeg(I->m[i],&dummy,currRing));
3700	res->data = (char *)(long)d;
3701	return FALSE;
3702	}
3703	static BOOLEAN jjDEGREE(leftv res, leftv v)
3704	{
3705	assumeStdFlag(v);
3706	intvec module_w=(intvec)atGet(v,"isHomog",INTVEC_CMD);
3707	scDegree((ideal)v->Data(),module_w,currQuotient);
3708	return FALSE;
3709	}
3710	static BOOLEAN jjDEFINED(leftv res, leftv v)
3711	{
3712	if ((v->rtyp==IDHDL)
3713	&& ((myynest==IDLEV((idhdl)v->data))\|\|(0==IDLEV((idhdl)v->data))))
3714	{
3715	res->data=(void *)(long)(IDLEV((idhdl)v->data)+1);
3716	}
3717	else if (v->rtyp!=0) res->data=(void *)(-1);
3718	return FALSE;
3719	}
3720	#ifdef HAVE_FACTORY
3721	static BOOLEAN jjDET(leftv res, leftv v)
3722	{
3723	matrix m=(matrix)v->Data();
3724	poly p;
3725	if (smCheckDet((ideal)m,m->cols(),TRUE))
3726	{
3727	ideal I=idMatrix2Module(mpCopy(m));
3728	p=smCallDet(I);
3729	idDelete(&I);
3730	}
3731	else
3732	p=singclap_det(m);
3733	res ->data = (char *)p;
3734	return FALSE;
3735	}
3736	static BOOLEAN jjDET_I(leftv res, leftv v)
3737	{
3738	intvec * m=(intvec*)v->Data();
3739	int i,j;
3740	i=m->rows();j=m->cols();
3741	if(i==j)
3742	res->data = (char *)(long)singclap_det_i(m);
3743	else
3744	{
3745	Werror("det of %d x %d intmat",i,j);
3746	return TRUE;
3747	}
3748	return FALSE;
3749	}
3750	static BOOLEAN jjDET_S(leftv res, leftv v)
3751	{
3752	ideal I=(ideal)v->Data();
3753	poly p;
3754	if (IDELEMS(I)<1) return TRUE;
3755	if (smCheckDet(I,IDELEMS(I),FALSE))
3756	{
3757	matrix m=idModule2Matrix(idCopy(I));
3758	p=singclap_det(m);
3759	idDelete((ideal *)&m);
3760	}
3761	else
3762	p=smCallDet(I);
3763	res->data = (char *)p;
3764	return FALSE;
3765	}
3766	#endif
3767	static BOOLEAN jjDIM(leftv res, leftv v)
3768	{
3769	assumeStdFlag(v);
3770	res->data = (char *)(long)scDimInt((ideal)(v->Data()),currQuotient);
3771	return FALSE;
3772	}
3773	static BOOLEAN jjDUMP(leftv res, leftv v)
3774	{
3775	si_link l = (si_link)v->Data();
3776	if (slDump(l))
3777	{
3778	const char *s;
3779	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
3780	else s=sNoName;
3781	Werror("cannot dump to `%s`",s);
3782	return TRUE;
3783	}
3784	else
3785	return FALSE;
3786	}
3787	static BOOLEAN jjE(leftv res, leftv v)
3788	{
3789	res->data = (char *)pOne();
3790	int co=(int)(long)v->Data();
3791	if (co>0)
3792	{
3793	pSetComp((poly)res->data,co);
3794	pSetm((poly)res->data);
3795	}
3796	else WerrorS("argument of gen must be positive");
3797	return (co<=0);
3798	}
3799	static BOOLEAN jjEXECUTE(leftv res, leftv v)
3800	{
3801	char * d = (char *)v->Data();
3802	char * s = (char *)omAlloc(strlen(d) + 13);
3803	strcpy( s, (char *)d);
3804	strcat( s, "\n;RETURN();\n");
3805	newBuffer(s,BT_execute);
3806	return yyparse();
3807	}
3808	#ifdef HAVE_FACTORY
3809	static BOOLEAN jjFACSTD(leftv res, leftv v)
3810	{
3811	ideal_list p,h;
3812	h=kStdfac((ideal)v->Data(),NULL,testHomog,NULL);
3813	p=h;
3814	int l=0;
3815	while (p!=NULL) { p=p->next;l++; }
3816	lists L=(lists)omAllocBin(slists_bin);
3817	L->Init(l);
3818	l=0;
3819	while(h!=NULL)
3820	{
3821	L->m[l].data=(char *)h->d;
3822	L->m[l].rtyp=IDEAL_CMD;
3823	p=h->next;
3824	omFreeSize(h,sizeof(*h));
3825	h=p;
3826	l++;
3827	}
3828	res->data=(void *)L;
3829	return FALSE;
3830	}
3831	static BOOLEAN jjFAC_P(leftv res, leftv u)
3832	{
3833	intvec *v=NULL;
3834	singclap_factorize_retry=0;
3835	ideal f=singclap_factorize((poly)(u->CopyD()), &v, 0);
3836	if (f==NULL) return TRUE;
3837	ivTest(v);
3838	lists l=(lists)omAllocBin(slists_bin);
3839	l->Init(2);
3840	l->m[0].rtyp=IDEAL_CMD;
3841	l->m[0].data=(void *)f;
3842	l->m[1].rtyp=INTVEC_CMD;
3843	l->m[1].data=(void *)v;
3844	res->data=(void *)l;
3845	return FALSE;
3846	}
3847	#endif
3848	static BOOLEAN jjGETDUMP(leftv res, leftv v)
3849	{
3850	si_link l = (si_link)v->Data();
3851	if (slGetDump(l))
3852	{
3853	const char *s;
3854	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
3855	else s=sNoName;
3856	Werror("cannot get dump from `%s`",s);
3857	return TRUE;
3858	}
3859	else
3860	return FALSE;
3861	}
3862	static BOOLEAN jjHIGHCORNER(leftv res, leftv v)
3863	{
3864	assumeStdFlag(v);
3865	ideal I=(ideal)v->Data();
3866	res->data=(void *)iiHighCorner(I,0);
3867	return FALSE;
3868	}
3869	static BOOLEAN jjHIGHCORNER_M(leftv res, leftv v)
3870	{
3871	assumeStdFlag(v);
3872	intvec w=(intvec)atGet(v,"isHomog",INTVEC_CMD);
3873	BOOLEAN delete_w=FALSE;
3874	ideal I=(ideal)v->Data();
3875	int i;
3876	poly p=NULL,po=NULL;
3877	int rk=idRankFreeModule(I);
3878	if (w==NULL)
3879	{
3880	w = new intvec(rk);
3881	delete_w=TRUE;
3882	}
3883	for(i=rk;i>0;i--)
3884	{
3885	p=iiHighCorner(I,i);
3886	if (p==NULL)
3887	{
3888	WerrorS("module must be zero-dimensional");
3889	if (delete_w) delete w;
3890	return TRUE;
3891	}
3892	if (po==NULL)
3893	{
3894	po=p;
3895	}
3896	else
3897	{
3898	// now po!=NULL, p!=NULL
3899	int d=(pFDeg(po,currRing)-(w)[pGetComp(po)-1] - pFDeg(p,currRing)+(w)[i-1]);
3900	if (d==0)
3901	d=pLmCmp(po,p);
3902	if (d > 0)
3903	{
3904	pDelete(&p);
3905	}
3906	else // (d < 0)
3907	{
3908	pDelete(&po); po=p;
3909	}
3910	}
3911	}
3912	if (delete_w) delete w;
3913	res->data=(void *)po;
3914	return FALSE;
3915	}
3916	static BOOLEAN jjHILBERT(leftv res, leftv v)
3917	{
3918	assumeStdFlag(v);
3919	intvec module_w=(intvec)atGet(v,"isHomog",INTVEC_CMD);
3920	//scHilbertPoly((ideal)v->Data(),currQuotient);
3921	hLookSeries((ideal)v->Data(),module_w,currQuotient);
3922	return FALSE;
3923	}
3924	static BOOLEAN jjHILBERT_IV(leftv res, leftv v)
3925	{
3926	res->data=(void )hSecondSeries((intvec )v->Data());
3927	return FALSE;
3928	}
3929	static BOOLEAN jjHOMOG1(leftv res, leftv v)
3930	{
3931	intvec w=(intvec)atGet(v,"isHomog",INTVEC_CMD);
3932	ideal v_id=(ideal)v->Data();
3933	if (w==NULL)
3934	{
3935	res->data=(void *)(long)idHomModule(v_id,currQuotient,&w);
3936	if ((res->data!=NULL) && (v->rtyp==IDHDL))
3937	{
3938	char *isHomog=omStrDup("isHomog");
3939	if (v->e==NULL)
3940	atSet((idhdl)(v->data),isHomog,w,INTVEC_CMD);
3941	else
3942	atSet((idhdl)(v->LData()),isHomog,w,INTVEC_CMD);
3943	}
3944	else if (w!=NULL) delete w;
3945	}
3946	else
3947	res->data=(void *)(long)idTestHomModule(v_id,currQuotient,w);
3948	return FALSE;
3949	}
3950	static BOOLEAN jjIDEAL_Ma(leftv res, leftv v)
3951	{
3952	matrix mat=(matrix)v->CopyD(MATRIX_CMD);
3953	IDELEMS((ideal)mat)=MATCOLS(mat)*MATROWS(mat);
3954	if (IDELEMS((ideal)mat)==0)
3955	{
3956	idDelete((ideal *)&mat);
3957	mat=(matrix)idInit(1,1);
3958	}
3959	else
3960	{
3961	MATROWS(mat)=1;
3962	mat->rank=1;
3963	idTest((ideal)mat);
3964	}
3965	res->data=(char *)mat;
3966	return FALSE;
3967	}
3968	static BOOLEAN jjIDEAL_Map(leftv res, leftv v)
3969	{
3970	map m=(map)v->CopyD(MAP_CMD);
3971	omFree((ADDRESS)m->preimage);
3972	m->preimage=NULL;
3973	ideal I=(ideal)m;
3974	I->rank=1;
3975	res->data=(char *)I;
3976	return FALSE;
3977	}
3978	static BOOLEAN jjIDEAL_R(leftv res, leftv v)
3979	{
3980	if (currRing!=NULL)
3981	{
3982	ring q=(ring)v->Data();
3983	if (rSamePolyRep(currRing, q))
3984	{
3985	if (q->qideal==NULL)
3986	res->data=(char *)idInit(1,1);
3987	else
3988	res->data=(char *)idCopy(q->qideal);
3989	return FALSE;
3990	}
3991	}
3992	WerrorS("can only get ideal from identical qring");
3993	return TRUE;
3994	}
3995	static BOOLEAN jjIm2Iv(leftv res, leftv v)
3996	{
3997	intvec iv = (intvec )v->CopyD(INTMAT_CMD);
3998	iv->makeVector();
3999	res->data = iv;
4000	return FALSE;
4001	}
4002	static BOOLEAN jjIMPART(leftv res, leftv v)
4003	{
4004	res->data = (char *)nImPart((number)v->Data());
4005	return FALSE;
4006	}
4007	static BOOLEAN jjINDEPSET(leftv res, leftv v)
4008	{
4009	assumeStdFlag(v);
4010	res->data=(void *)scIndIntvec((ideal)(v->Data()),currQuotient);
4011	return FALSE;
4012	}
4013	static BOOLEAN jjINTERRED(leftv res, leftv v)
4014	{
4015	ideal result=kInterRed((ideal)(v->Data()), currQuotient);
4016	if (TEST_OPT_PROT) { PrintLn(); mflush(); }
4017	res->data = result;
4018	return FALSE;
4019	}
4020	static BOOLEAN jjIS_RINGVAR_P(leftv res, leftv v)
4021	{
4022	res->data = (char *)(long)pVar((poly)v->Data());
4023	return FALSE;
4024	}
4025	static BOOLEAN jjIS_RINGVAR_S(leftv res, leftv v)
4026	{
4027	res->data = (char )(long)(r_IsRingVar((char )v->Data(), currRing)+1);
4028	return FALSE;
4029	}
4030	static BOOLEAN jjIS_RINGVAR0(leftv res, leftv v)
4031	{
4032	res->data = (char *)0;
4033	return FALSE;
4034	}
4035	static BOOLEAN jjJACOB_P(leftv res, leftv v)
4036	{
4037	ideal i=idInit(pVariables,1);
4038	int k;
4039	poly p=(poly)(v->Data());
4040	for (k=pVariables;k>0;k--)
4041	{
4042	i->m[k-1]=pDiff(p,k);
4043	}
4044	res->data = (char *)i;
4045	return FALSE;
4046	}
4047	static BOOLEAN jjKBASE(leftv res, leftv v)
4048	{
4049	assumeStdFlag(v);
4050	res->data = (char *)scKBase(-1,(ideal)(v->Data()),currQuotient);
4051	return FALSE;
4052	}
4053	#ifdef MDEBUG
4054	static BOOLEAN jjpHead(leftv res, leftv v)
4055	{
4056	res->data=(char *)pHead((poly)v->Data());
4057	return FALSE;
4058	}
4059	#endif
4060	static BOOLEAN jjL2R(leftv res, leftv v)
4061	{
4062	res->data=(char *)syConvList((lists)v->Data());
4063	if (res->data != NULL)
4064	return FALSE;
4065	else
4066	return TRUE;
4067	}
4068	static BOOLEAN jjLEADCOEF(leftv res, leftv v)
4069	{
4070	poly p=(poly)v->Data();
4071	if (p==NULL)
4072	{
4073	res->data=(char *)nInit(0);
4074	}
4075	else
4076	{
4077	res->data=(char *)nCopy(pGetCoeff(p));
4078	}
4079	return FALSE;
4080	}
4081	static BOOLEAN jjLEADEXP(leftv res, leftv v)
4082	{
4083	poly p=(poly)v->Data();
4084	int s=pVariables;
4085	if (v->Typ()==VECTOR_CMD) s++;
4086	intvec *iv=new intvec(s);
4087	if (p!=NULL)
4088	{
4089	for(int i = pVariables;i;i--)
4090	{
4091	(*iv)[i-1]=pGetExp(p,i);
4092	}
4093	if (s!=pVariables)
4094	(*iv)[pVariables]=pGetComp(p);
4095	}
4096	res->data=(char *)iv;
4097	return FALSE;
4098	}
4099	static BOOLEAN jjLEADMONOM(leftv res, leftv v)
4100	{
4101	poly p=(poly)v->Data();
4102	if (p == NULL)
4103	{
4104	res->data = (char*) NULL;
4105	}
4106	else
4107	{
4108	poly lm = pLmInit(p);
4109	pSetCoeff(lm, nInit(1));
4110	res->data = (char*) lm;
4111	}
4112	return FALSE;
4113	}
4114	static BOOLEAN jjLISTRING(leftv res, leftv v)
4115	{
4116	ring r=rCompose((lists)v->Data());
4117	if (r==NULL) return TRUE;
4118	if (r->qideal!=NULL) res->rtyp=QRING_CMD;
4119	res->data=(char *)r;
4120	return FALSE;
4121	}
4122	#if SIZEOF_LONG == 8
4123	static number jjLONG2N(long d)
4124	{
4125	int i=(int)d;
4126	if ((long)i == d)
4127	{
4128	return nlInit(i);
4129	}
4130	else
4131	{
4132	number z=(number)omAllocBin(rnumber_bin);
4133	#if defined(LDEBUG)
4134	z->debug=123456;
4135	#endif
4136	mpz_init_set_si(&z->z,d);
4137	return z;
4138	}
4139	}
4140	#else
4141	#define jjLONG2N(D) nlInit((int)D)
4142	#endif
4143	static BOOLEAN jjMEMORY(leftv res, leftv v)
4144	{
4145	omUpdateInfo();
4146	long d;
4147	switch(((int)(long)v->Data()))
4148	{
4149	case 0:
4150	res->data=(char *)jjLONG2N(om_Info.UsedBytes);
4151	break;
4152	case 1:
4153	res->data = (char *)jjLONG2N(om_Info.CurrentBytesSystem);
4154	break;
4155	case 2:
4156	res->data = (char *)jjLONG2N(om_Info.MaxBytesSystem);
4157	break;
4158	default:
4159	omPrintStats(stdout);
4160	omPrintInfo(stdout);
4161	omPrintBinStats(stdout);
4162	res->data = (char *)0;
4163	res->rtyp = NONE;
4164	}
4165	return FALSE;
4166	res->data = (char *)0;
4167	return FALSE;
4168	}
4169	#if SIZEOF_LONG == 8
4170	static number jjBI2N(long d)
4171	{
4172	if (d<((long)INT_MAX)) return nlInit((int)d);
4173	else
4174	{
4175	number n=nlRInit(0);
4176	mpz_set_si(&n->z,d);
4177	return n;
4178	}
4179	}
4180	#endif
4181	//static BOOLEAN jjMONITOR1(leftv res, leftv v)
4182	//{
4183	// return jjMONITOR2(res,v,NULL);
4184	//}
4185	static BOOLEAN jjMSTD(leftv res, leftv v)
4186	{
4187	int t=v->Typ();
4188	ideal r,m;
4189	r=kMin_std((ideal)v->Data(),currQuotient,testHomog,NULL,m);
4190	lists l=(lists)omAllocBin(slists_bin);
4191	l->Init(2);
4192	l->m[0].rtyp=t;
4193	l->m[0].data=(char *)r;
4194	setFlag(&(l->m[0]),FLAG_STD);
4195	l->m[1].rtyp=t;
4196	l->m[1].data=(char *)m;
4197	res->data=(char *)l;
4198	return FALSE;
4199	}
4200	static BOOLEAN jjMULT(leftv res, leftv v)
4201	{
4202	assumeStdFlag(v);
4203	res->data = (char *)(long)scMultInt((ideal)(v->Data()),currQuotient);
4204	return FALSE;
4205	}
4206	static BOOLEAN jjMINRES_R(leftv res, leftv v)
4207	{
4208	intvec weights=(intvec)atGet(v,"isHomog",INTVEC_CMD);
4209	res->data=(char *)syMinimize((syStrategy)v->Data());
4210	if (weights!=NULL)
4211	atSet(res, omStrDup("isHomog"),ivCopy(weights),INTVEC_CMD);
4212	return FALSE;
4213	}
4214	static BOOLEAN jjN2BI(leftv res, leftv v)
4215	{
4216	number n,i; i=(number)v->Data();
4217	if (rField_is_Zp())
4218	{
4219	if (((long)i)>(npPrimeM>>1))
4220	n=nlInit((int)(((long)i)-npPrimeM));
4221	else
4222	n=nlInit((int)(long)i);
4223	}
4224	else if (rField_is_Q()) n=nlBigInt(i);
4225	#ifdef HAVE_RINGS
4226	else if (rField_is_Ring_Z() \|\| rField_is_Ring_ModN() \|\| rField_is_Ring_PtoM()) n=nlMapGMP(i);
4227	else if (rField_is_Ring_2toM()) n=nlInit((unsigned long) i);
4228	#endif
4229	else goto err;
4230	res->data=(void *)n;
4231	return FALSE;
4232	err:
4233	WerrorS("cannot convert to bigint"); return TRUE;
4234	}
4235	static BOOLEAN jjNAMEOF(leftv res, leftv v)
4236	{
4237	res->data = (char *)v->name;
4238	if (res->data==NULL) res->data=omStrDup("");
4239	v->name=NULL;
4240	return FALSE;
4241	}
4242	static BOOLEAN jjNAMES(leftv res, leftv v)
4243	{
4244	res->data=ipNameList(((ring)v->Data())->idroot);
4245	return FALSE;
4246	}
4247	static BOOLEAN jjNVARS(leftv res, leftv v)
4248	{
4249	res->data = (char *)(long)(((ring)(v->Data()))->N);
4250	return FALSE;
4251	}
4252	static BOOLEAN jjOpenClose(leftv res, leftv v)
4253	{
4254	si_link l=(si_link)v->Data();
4255	if (iiOp==OPEN_CMD) return slOpen(l, SI_LINK_OPEN);
4256	else return slClose(l);
4257	}
4258	static BOOLEAN jjORD(leftv res, leftv v)
4259	{
4260	poly p=(poly)v->Data();
4261	res->data=(char *)( p==NULL ? -1 : pFDeg(p,currRing) );
4262	return FALSE;
4263	}
4264	static BOOLEAN jjPAR1(leftv res, leftv v)
4265	{
4266	int i=(int)(long)v->Data();
4267	int p=0;
4268	p=rPar(currRing);
4269	if ((0<i) && (i<=p))
4270	{
4271	res->data=(char *)nPar(i);
4272	}
4273	else
4274	{
4275	Werror("par number %d out of range 1..%d",i,p);
4276	return TRUE;
4277	}
4278	return FALSE;
4279	}
4280	static BOOLEAN jjPARDEG(leftv res, leftv v)
4281	{
4282	res->data = (char *)(long)nParDeg((number)v->Data());
4283	return FALSE;
4284	}
4285	static BOOLEAN jjPARSTR1(leftv res, leftv v)
4286	{
4287	if (currRing==NULL)
4288	{
4289	WerrorS("no ring active");
4290	return TRUE;
4291	}
4292	int i=(int)(long)v->Data();
4293	int p=0;
4294	if ((0<i) && (currRing->parameter!=NULL) && (i<=(p=rPar(currRing))))
4295	res->data=omStrDup(currRing->parameter[i-1]);
4296	else
4297	{
4298	Werror("par number %d out of range 1..%d",i,p);
4299	return TRUE;
4300	}
4301	return FALSE;
4302	}
4303	static BOOLEAN jjP2I(leftv res, leftv v)
4304	{
4305	poly p=(poly)v->Data();
4306	if (p==NULL) { /res->data=(char )0;*/ return FALSE; }
4307	if ((pNext(p)!=NULL)\|\| (!pIsConstant(p)))
4308	{
4309	WerrorS("poly must be constant");
4310	return TRUE;
4311	}
4312	res->data = (char *)(long)nInt(pGetCoeff(p));
4313	return FALSE;
4314	}
4315	static BOOLEAN jjPREIMAGE_R(leftv res, leftv v)
4316	{
4317	map mapping=(map)v->Data();
4318	syMake(res,omStrDup(mapping->preimage));
4319	return FALSE;
4320	}
4321	static BOOLEAN jjPRIME(leftv res, leftv v)
4322	{
4323	int i = IsPrime((int)(long)(v->Data()));
4324	res->data = (char *)(long)(i > 1 ? i : 2);
4325	return FALSE;
4326	}
4327	static BOOLEAN jjPRUNE(leftv res, leftv v)
4328	{
4329	intvec w=(intvec )atGet(v,"isHomog",INTVEC_CMD);
4330	ideal v_id=(ideal)v->Data();
4331	if (w!=NULL)
4332	{
4333	if (!idTestHomModule(v_id,currQuotient,w))
4334	{
4335	WarnS("wrong weights");
4336	w=NULL;
4337	// and continue at the non-homog case below
4338	}
4339	else
4340	{
4341	w=ivCopy(w);
4342	intvec **ww=&w;
4343	res->data = (char *)idMinEmbedding(v_id,FALSE,ww);
4344	atSet(res,omStrDup("isHomog"),*ww,INTVEC_CMD);
4345	return FALSE;
4346	}
4347	}
4348	res->data = (char *)idMinEmbedding(v_id);
4349	return FALSE;
4350	}
4351	static BOOLEAN jjP2N(leftv res, leftv v)
4352	{
4353	number n;
4354	poly p;
4355	if (((p=(poly)v->Data())!=NULL)
4356	&& (pIsConstant(p)))
4357	{
4358	n=nCopy(pGetCoeff(p));
4359	}
4360	else
4361	{
4362	n=nInit(0);
4363	}
4364	res->data = (char *)n;
4365	return FALSE;
4366	}
4367	static BOOLEAN jjRESERVEDNAME(leftv res, leftv v)
4368	{
4369	char s= (char )v->Data();
4370	int i = 1;
4371	int l = strlen(s);
4372	for(i=0; i<sArithBase.nCmdUsed; i++)
4373	{
4374	//Print("test %d, >>%s<<, tab:>>%s<<\n",i,s,sArithBase.sCmds[i].name);
4375	if (strcmp(s, sArithBase.sCmds[i].name) == 0)
4376	{
4377	res->data = (char *)1;
4378	return FALSE;
4379	}
4380	}
4381	//res->data = (char *)0;
4382	return FALSE;
4383	}
4384	static BOOLEAN jjREAD(leftv res, leftv v)
4385	{
4386	return jjREAD2(res,v,NULL);
4387	}
4388	static BOOLEAN jjREGULARITY(leftv res, leftv v)
4389	{
4390	res->data = (char *)(long)iiRegularity((lists)v->Data());
4391	return FALSE;
4392	}
4393	static BOOLEAN jjREPART(leftv res, leftv v)
4394	{
4395	res->data = (char *)nRePart((number)v->Data());
4396	return FALSE;
4397	}
4398	static BOOLEAN jjRINGLIST(leftv res, leftv v)
4399	{
4400	ring r=(ring)v->Data();
4401	if (r!=NULL)
4402	res->data = (char *)rDecompose((ring)v->Data());
4403	return (r==NULL)\|\|(res->data==NULL);
4404	}
4405	static BOOLEAN jjROWS(leftv res, leftv v)
4406	{
4407	ideal i = (ideal)v->Data();
4408	res->data = (char *)i->rank;
4409	return FALSE;
4410	}
4411	static BOOLEAN jjROWS_IV(leftv res, leftv v)
4412	{
4413	res->data = (char )(long)((intvec)(v->Data()))->rows();
4414	return FALSE;
4415	}
4416	static BOOLEAN jjRPAR(leftv res, leftv v)
4417	{
4418	res->data = (char *)(long)rPar(((ring)v->Data()));
4419	return FALSE;
4420	}
4421	static BOOLEAN jjSLIM_GB(leftv res, leftv u)
4422	{
4423	#ifdef HAVE_PLURAL
4424	const bool bIsSCA = rIsSCA(currRing);
4425	#else
4426	const bool bIsSCA = false;
4427	#endif
4428
4429	if ((currQuotient!=NULL) && !bIsSCA)
4430	{
4431	WerrorS("qring not supported by slimgb at the moment");
4432	return TRUE;
4433	}
4434	if (rHasLocalOrMixedOrdering_currRing())
4435	{
4436	WerrorS("ordering must be global for slimgb");
4437	return TRUE;
4438	}
4439	intvec w=(intvec )atGet(u,"isHomog",INTVEC_CMD);
4440	tHomog hom=testHomog;
4441	ideal u_id=(ideal)u->Data();
4442	if (w!=NULL)
4443	{
4444	if (!idTestHomModule(u_id,currQuotient,w))
4445	{
4446	WarnS("wrong weights");
4447	w=NULL;
4448	}
4449	else
4450	{
4451	w=ivCopy(w);
4452	hom=isHomog;
4453	}
4454	}
4455
4456	assume(u_id->rank>=idRankFreeModule(u_id));
4457	res->data=(char *)t_rep_gb(currRing,
4458	u_id,u_id->rank);
4459	//res->data=(char *)t_rep_gb(currRing, u_id);
4460
4461	if(!TEST_OPT_DEGBOUND) setFlag(res,FLAG_STD);
4462	if (w!=NULL) atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
4463	return FALSE;
4464	}
4465	static BOOLEAN jjSTD(leftv res, leftv v)
4466	{
4467	ideal result;
4468	ideal v_id=(ideal)v->Data();
4469	intvec w=(intvec )atGet(v,"isHomog",INTVEC_CMD);
4470	tHomog hom=testHomog;
4471	if (w!=NULL)
4472	{
4473	if (!idTestHomModule(v_id,currQuotient,w))
4474	{
4475	WarnS("wrong weights");
4476	w=NULL;
4477	}
4478	else
4479	{
4480	hom=isHomog;
4481	w=ivCopy(w);
4482	}
4483	}
4484	result=kStd(v_id,currQuotient,hom,&w);
4485	idSkipZeroes(result);
4486	res->data = (char *)result;
4487	if(!TEST_OPT_DEGBOUND) setFlag(res,FLAG_STD);
4488	if (w!=NULL) atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
4489	return FALSE;
4490	}
4491	static BOOLEAN jjSort_Id(leftv res, leftv v)
4492	{
4493	res->data = (char *)idSort((ideal)v->Data());
4494	return FALSE;
4495	}
4496	#ifdef HAVE_FACTORY
4497	extern int singclap_factorize_retry;
4498	static BOOLEAN jjSQR_FREE(leftv res, leftv u)
4499	{
4500	intvec *v=NULL;
4501	singclap_factorize_retry=0;
4502	ideal f=singclap_sqrfree((poly)(u->CopyD()));
4503	if (f==NULL)
4504	return TRUE;
4505	res->data=(void *)f;
4506	return FALSE;
4507	}
4508	#endif
4509	#if 1
4510	static BOOLEAN jjSYZYGY(leftv res, leftv v)
4511	{
4512	intvec *w=NULL;
4513	res->data = (char *)idSyzygies((ideal)v->Data(),testHomog,&w);
4514	if (w!=NULL) delete w;
4515	return FALSE;
4516	}
4517	#else
4518	// activate, if idSyz handle module weights correctly !
4519	static BOOLEAN jjSYZYGY(leftv res, leftv v)
4520	{
4521	intvec w=(intvec )atGet(v,"isHomog",INTVEC_CMD);
4522	ideal v_id=(ideal)v->Data();
4523	tHomog hom=testHomog;
4524	int add_row_shift=0;
4525	if (w!=NULL)
4526	{
4527	w=ivCopy(w);
4528	add_row_shift=w->min_in();
4529	(*w)-=add_row_shift;
4530	if (idTestHomModule(v_id,currQuotient,w))
4531	hom=isHomog;
4532	else
4533	{
4534	//WarnS("wrong weights");
4535	delete w; w=NULL;
4536	hom=testHomog;
4537	}
4538	}
4539	res->data = (char *)idSyzygies(v_id,hom,&w);
4540	if (w!=NULL)
4541	{
4542	atSet(res,omStrDup("isHomog"),w,INTVEC_CMD);
4543	}
4544	return FALSE;
4545	}
4546	#endif
4547	static BOOLEAN jjTRACE_IV(leftv res, leftv v)
4548	{
4549	res->data = (char )(long)ivTrace((intvec)(v->Data()));
4550	return FALSE;
4551	}
4552	static BOOLEAN jjTRANSP_IV(leftv res, leftv v)
4553	{
4554	res->data = (char )ivTranp((intvec)(v->Data()));
4555	return FALSE;
4556	}
4557	#ifdef HAVE_PLURAL
4558	static BOOLEAN jjOPPOSITE(leftv res, leftv a)
4559	{
4560	ring r = (ring)a->Data();
4561	if (rIsPluralRing(r))
4562	{
4563	res->data = rOpposite(r);
4564	}
4565	else res->data = rCopy(r);
4566	return FALSE;
4567	}
4568	static BOOLEAN jjENVELOPE(leftv res, leftv a)
4569	{
4570	ring r = (ring)a->Data();
4571	if (rIsPluralRing(r))
4572	{
4573	// ideal i;
4574	// if (a->rtyp == QRING_CMD)
4575	// {
4576	// i = r->qideal;
4577	// r->qideal = NULL;
4578	// }
4579	ring s = rEnvelope(r);
4580	// if (a->rtyp == QRING_CMD)
4581	// {
4582	// ideal is = idOppose(r,i); /* twostd? */
4583	// is = idAdd(is,i);
4584	// s->qideal = i;
4585	// }
4586	res->data = s;
4587	}
4588	else res->data = rCopy(r);
4589	return FALSE;
4590	}
4591	static BOOLEAN jjTWOSTD(leftv res, leftv a)
4592	{
4593	if (rIsPluralRing(currRing)) res->data=(ideal)twostd((ideal)a->Data());
4594	else res->data=(ideal)a->CopyD();
4595	setFlag(res,FLAG_STD);
4596	setFlag(res,FLAG_TWOSTD);
4597	return FALSE;
4598	}
4599	#endif
4600
4601	static BOOLEAN jjTYPEOF(leftv res, leftv v)
4602	{
4603	switch ((int)(long)v->data)
4604	{
4605	case INT_CMD: res->data=omStrDup("int"); break;
4606	case POLY_CMD: res->data=omStrDup("poly"); break;
4607	case VECTOR_CMD: res->data=omStrDup("vector"); break;
4608	case STRING_CMD: res->data=omStrDup("string"); break;
4609	case INTVEC_CMD: res->data=omStrDup("intvec"); break;
4610	case IDEAL_CMD: res->data=omStrDup("ideal"); break;
4611	case MATRIX_CMD: res->data=omStrDup("matrix"); break;
4612	case MODUL_CMD: res->data=omStrDup("module"); break;
4613	case MAP_CMD: res->data=omStrDup("map"); break;
4614	case PROC_CMD: res->data=omStrDup("proc"); break;
4615	case RING_CMD: res->data=omStrDup("ring"); break;
4616	case QRING_CMD: res->data=omStrDup("qring"); break;
4617	case INTMAT_CMD: res->data=omStrDup("intmat"); break;
4618	case NUMBER_CMD: res->data=omStrDup("number"); break;
4619	case BIGINT_CMD: res->data=omStrDup("bigint"); break;
4620	case LIST_CMD: res->data=omStrDup("list"); break;
4621	case PACKAGE_CMD: res->data=omStrDup("package"); break;
4622	case LINK_CMD: res->data=omStrDup("link"); break;
4623	case RESOLUTION_CMD:res->data=omStrDup("resolution");break;
4624	case DEF_CMD:
4625	case NONE: res->data=omStrDup("none"); break;
4626	default: res->data=omStrDup("?unknown type?");
4627	}
4628	return FALSE;
4629	}
4630	static BOOLEAN jjUNIVARIATE(leftv res, leftv v)
4631	{
4632	res->data=(char *)pIsUnivariate((poly)v->Data());
4633	return FALSE;
4634	}
4635	static BOOLEAN jjVAR1(leftv res, leftv v)
4636	{
4637	int i=(int)(long)v->Data();
4638	if ((0<i) && (i<=currRing->N))
4639	{
4640	poly p=pOne();
4641	pSetExp(p,i,1);
4642	pSetm(p);
4643	res->data=(char *)p;
4644	}
4645	else
4646	{
4647	Werror("var number %d out of range 1..%d",i,currRing->N);
4648	return TRUE;
4649	}
4650	return FALSE;
4651	}
4652	static BOOLEAN jjVARSTR1(leftv res, leftv v)
4653	{
4654	if (currRing==NULL)
4655	{
4656	WerrorS("no ring active");
4657	return TRUE;
4658	}
4659	int i=(int)(long)v->Data();
4660	if ((0<i) && (i<=currRing->N))
4661	res->data=omStrDup(currRing->names[i-1]);
4662	else
4663	{
4664	Werror("var number %d out of range 1..%d",i,currRing->N);
4665	return TRUE;
4666	}
4667	return FALSE;
4668	}
4669	static BOOLEAN jjVDIM(leftv res, leftv v)
4670	{
4671	assumeStdFlag(v);
4672	res->data = (char *)(long)scMult0Int((ideal)v->Data(),currQuotient);
4673	return FALSE;
4674	}
4675
4676	static BOOLEAN jjLOAD1(leftv res, leftv v)
4677	{
4678	return jjLOAD(res, v,iiOp==LIB_CMD);
4679	}
4680	static BOOLEAN jjLOAD(leftv res, leftv v, BOOLEAN autoexport)
4681	{
4682	#ifdef HAVE_NS
4683	char * s=(char *)v->CopyD();
4684	char libnamebuf[256];
4685	lib_types LT = type_of_LIB(s, libnamebuf);
4686	#ifdef HAVE_DYNAMIC_LOADING
4687	extern BOOLEAN load_modules(char newlib, char fullpath, BOOLEAN autoexport);
4688	#endif /* HAVE_DYNAMIC_LOADING */
4689	switch(LT)
4690	{
4691	default:
4692	case LT_NONE:
4693	Werror("%s: unknown type", s);
4694	break;
4695	case LT_NOTFOUND:
4696	Werror("cannot open %s", s);
4697	break;
4698
4699	case LT_SINGULAR:
4700	{
4701	char *plib = iiConvName(s);
4702	idhdl pl = IDROOT->get(plib,0);
4703	if (pl==NULL)
4704	{
4705	pl = enterid( plib,0, PACKAGE_CMD, &(basePack->idroot), TRUE );
4706	IDPACKAGE(pl)->language = LANG_SINGULAR;
4707	IDPACKAGE(pl)->libname=omStrDup(plib);
4708	}
4709	else if (IDTYP(pl)!=PACKAGE_CMD)
4710	{
4711	Werror("can not create package `%s`",plib);
4712	omFree(plib);
4713	return TRUE;
4714	}
4715	package savepack=currPack;
4716	currPack=IDPACKAGE(pl);
4717	IDPACKAGE(pl)->loaded=TRUE;
4718	char libnamebuf[256];
4719	FILE * fp = feFopen( s, "r", libnamebuf, TRUE );
4720	BOOLEAN bo=iiLoadLIB(fp, libnamebuf, s, pl, autoexport, TRUE);
4721	currPack=savepack;
4722	IDPACKAGE(pl)->loaded=(!bo);
4723	return bo;
4724	}
4725	case LT_MACH_O:
4726	case LT_ELF:
4727	case LT_HPUX:
4728	#ifdef HAVE_DYNAMIC_LOADING
4729	return load_modules(s, libnamebuf, autoexport);
4730	#else /* HAVE_DYNAMIC_LOADING */
4731	WerrorS("Dynamic modules are not supported by this version of Singular");
4732	break;
4733	#endif /* HAVE_DYNAMIC_LOADING */
4734	}
4735	#endif
4736	return TRUE;
4737	}
4738
4739	/=================== operations with 1 arg.: table =================/
4740
4741	#ifdef INIT_BUG
4742	#define XS(A) -((short)A)
4743	#define jjstrlen (proc1)1
4744	#define jjpLength (proc1)2
4745	#define jjidElem (proc1)3
4746	#define jjmpDetBareiss (proc1)4
4747	#define jjidFreeModule (proc1)5
4748	#define jjidVec2Ideal (proc1)6
4749	#define jjrCharStr (proc1)7
4750	#ifndef MDEBUG
4751	#define jjpHead (proc1)8
4752	#endif
4753	#define jjidHead (proc1)9
4754	#define jjidMaxIdeal (proc1)10
4755	#define jjidMinBase (proc1)11
4756	#define jjsyMinBase (proc1)12
4757	#define jjpMaxComp (proc1)13
4758	#define jjmpTrace (proc1)14
4759	#define jjmpTransp (proc1)15
4760	#define jjrOrdStr (proc1)16
4761	#define jjrVarStr (proc1)18
4762	#define jjrParStr (proc1)19
4763	#define jjCOUNT_RES (proc1)22
4764	#define jjDIM_R (proc1)23
4765	#define jjidTransp (proc1)24
4766
4767	extern struct sValCmd1 dArith1[];
4768	void jjInitTab1()
4769	{
4770	int i=0;
4771	for (;dArith1[i].cmd!=0;i++)
4772	{
4773	if (dArith1[i].res<0)
4774	{
4775	switch ((int)dArith1[i].p)
4776	{
4777	case (int)jjstrlen: dArith1[i].p=(proc1)strlen; break;
4778	case (int)jjpLength: dArith1[i].p=(proc1)pLength; break;
4779	case (int)jjidElem: dArith1[i].p=(proc1)idElem; break;
4780	case (int)jjidVec2Ideal: dArith1[i].p=(proc1)idVec2Ideal; break;
4781	#ifndef HAVE_FACTORY
4782	case (int)jjmpDetBareiss: dArith1[i].p=(proc1)mpDetBareiss; break;
4783	#endif
4784	case (int)jjidFreeModule: dArith1[i].p=(proc1)idFreeModule; break;
4785	case (int)jjrCharStr: dArith1[i].p=(proc1)rCharStr; break;
4786	#ifndef MDEBUG
4787	case (int)jjpHead: dArith1[i].p=(proc1)pHeadProc; break;
4788	#endif
4789	case (int)jjidHead: dArith1[i].p=(proc1)idHead; break;
4790	case (int)jjidMaxIdeal: dArith1[i].p=(proc1)idMaxIdeal; break;
4791	case (int)jjidMinBase: dArith1[i].p=(proc1)idMinBase; break;
4792	case (int)jjsyMinBase: dArith1[i].p=(proc1)syMinBase; break;
4793	case (int)jjpMaxComp: dArith1[i].p=(proc1)pMaxCompProc; break;
4794	case (int)jjmpTrace: dArith1[i].p=(proc1)mpTrace; break;
4795	case (int)jjmpTransp: dArith1[i].p=(proc1)mpTransp; break;
4796	case (int)jjrOrdStr: dArith1[i].p=(proc1)rOrdStr; break;
4797	case (int)jjrVarStr: dArith1[i].p=(proc1)rVarStr; break;
4798	case (int)jjrParStr: dArith1[i].p=(proc1)rParStr; break;
4799	case (int)jjCOUNT_RES: dArith1[i].p=(proc1)syLength; break;
4800	case (int)jjDIM_R: dArith1[i].p=(proc1)syDim; break;
4801	case (int)jjidTransp: dArith1[i].p=(proc1)idTransp; break;
4802	#ifdef GENTABLE
4803	default: Werror("missing proc1-definition for %d",(int)(long)dArith1[i].p);
4804	#endif
4805	}
4806	}
4807	}
4808	}
4809	#else
4810	#if defined(PROC_BUG)
4811	#define XS(A) A
4812	static BOOLEAN jjstrlen(leftv res, leftv v)
4813	{
4814	res->data = (char )strlen((char )v->Data());
4815	return FALSE;
4816	}
4817	static BOOLEAN jjpLength(leftv res, leftv v)
4818	{
4819	res->data = (char *)pLength((poly)v->Data());
4820	return FALSE;
4821	}
4822	static BOOLEAN jjidElem(leftv res, leftv v)
4823	{
4824	res->data = (char *)idElem((ideal)v->Data());
4825	return FALSE;
4826	}
4827	static BOOLEAN jjmpDetBareiss(leftv res, leftv v)
4828	{
4829	res->data = (char *)mpDetBareiss((matrix)v->Data());
4830	return FALSE;
4831	}
4832	static BOOLEAN jjidFreeModule(leftv res, leftv v)
4833	{
4834	res->data = (char *)idFreeModule((int)(long)v->Data());
4835	return FALSE;
4836	}
4837	static BOOLEAN jjidVec2Ideal(leftv res, leftv v)
4838	{
4839	res->data = (char *)idVec2Ideal((poly)v->Data());
4840	return FALSE;
4841	}
4842	static BOOLEAN jjrCharStr(leftv res, leftv v)
4843	{
4844	res->data = rCharStr((ring)v->Data());
4845	return FALSE;
4846	}
4847	#ifndef MDEBUG
4848	static BOOLEAN jjpHead(leftv res, leftv v)
4849	{
4850	res->data = (char *)pHead((poly)v->Data());
4851	return FALSE;
4852	}
4853	#endif
4854	static BOOLEAN jjidHead(leftv res, leftv v)
4855	{
4856	res->data = (char *)idHead((ideal)v->Data());
4857	return FALSE;
4858	}
4859	static BOOLEAN jjidMaxIdeal(leftv res, leftv v)
4860	{
4861	res->data = (char *)idMaxIdeal((int)(long)v->Data());
4862	return FALSE;
4863	}
4864	static BOOLEAN jjidMinBase(leftv res, leftv v)
4865	{
4866	res->data = (char *)idMinBase((ideal)v->Data());
4867	return FALSE;
4868	}
4869	static BOOLEAN jjsyMinBase(leftv res, leftv v)
4870	{
4871	res->data = (char *)syMinBase((ideal)v->Data());
4872	return FALSE;
4873	}
4874	static BOOLEAN jjpMaxComp(leftv res, leftv v)
4875	{
4876	res->data = (char *)pMaxComp((poly)v->Data());
4877	return FALSE;
4878	}
4879	static BOOLEAN jjmpTrace(leftv res, leftv v)
4880	{
4881	res->data = (char *)mpTrace((matrix)v->Data());
4882	return FALSE;
4883	}
4884	static BOOLEAN jjmpTransp(leftv res, leftv v)
4885	{
4886	res->data = (char *)mpTransp((matrix)v->Data());
4887	return FALSE;
4888	}
4889	static BOOLEAN jjrOrdStr(leftv res, leftv v)
4890	{
4891	res->data = rOrdStr((ring)v->Data());
4892	return FALSE;
4893	}
4894	static BOOLEAN jjrVarStr(leftv res, leftv v)
4895	{
4896	res->data = rVarStr((ring)v->Data());
4897	return FALSE;
4898	}
4899	static BOOLEAN jjrParStr(leftv res, leftv v)
4900	{
4901	res->data = rParStr((ring)v->Data());
4902	return FALSE;
4903	}
4904	static BOOLEAN jjCOUNT_RES(leftv res, leftv v)
4905	{
4906	res->data=(char *)syLength((syStrategy)v->Data());
4907	return FALSE;
4908	}
4909	static BOOLEAN jjDIM_R(leftv res, leftv v)
4910	{
4911	res->data = (char *)syDim((syStrategy)v->Data());
4912	return FALSE;
4913	}
4914	static BOOLEAN jjidTransp(leftv res, leftv v)
4915	{
4916	res->data = (char *)idTransp((ideal)v->Data());
4917	return FALSE;
4918	}
4919	#else
4920	#define XS(A) -((short)A)
4921	#define jjstrlen (proc1)strlen
4922	#define jjpLength (proc1)pLength
4923	#define jjidElem (proc1)idElem
4924	#define jjmpDetBareiss (proc1)mpDetBareiss
4925	#define jjidFreeModule (proc1)idFreeModule
4926	#define jjidVec2Ideal (proc1)idVec2Ideal
4927	#define jjrCharStr (proc1)rCharStr
4928	#ifndef MDEBUG
4929	#define jjpHead (proc1)pHeadProc
4930	#endif
4931	#define jjidHead (proc1)idHead
4932	#define jjidMaxIdeal (proc1)idMaxIdeal
4933	#define jjidMinBase (proc1)idMinBase
4934	#define jjsyMinBase (proc1)syMinBase
4935	#define jjpMaxComp (proc1)pMaxCompProc
4936	#define jjmpTrace (proc1)mpTrace
4937	#define jjmpTransp (proc1)mpTransp
4938	#define jjrOrdStr (proc1)rOrdStr
4939	#define jjrVarStr (proc1)rVarStr
4940	#define jjrParStr (proc1)rParStr
4941	#define jjCOUNT_RES (proc1)syLength
4942	#define jjDIM_R (proc1)syDim
4943	#define jjidTransp (proc1)idTransp
4944	#endif
4945	#endif
4946	static BOOLEAN jjnInt(leftv res, leftv u)
4947	{
4948	number n=(number)u->Data();
4949	res->data=(char *)(long)nInt(n);
4950	return FALSE;
4951	}
4952	static BOOLEAN jjnlInt(leftv res, leftv u)
4953	{
4954	number n=(number)u->Data();
4955	res->data=(char *)(long)nlInt(n);
4956	return FALSE;
4957	}
4958	#define s short
4959	struct sValCmd1 dArith1[]=
4960	{
4961	// operations:
4962	// proc cmd res arg plural
4963	// {jjPLUSPLUS, PLUSPLUS, INT_CMD, INT_CMD ALLOW_PLURAL}
4964	//,{jjMINUSMINUS, MINUSMINUS, INT_CMD, INT_CMD ALLOW_PLURAL}
4965	{jjPLUSPLUS, PLUSPLUS, NONE, IDHDL ALLOW_PLURAL}
4966	,{jjPLUSPLUS, MINUSMINUS, NONE, IDHDL ALLOW_PLURAL}
4967	,{jjUMINUS_I, '-', INT_CMD, INT_CMD ALLOW_PLURAL}
4968	,{jjUMINUS_BI, '-', BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
4969	,{jjUMINUS_N, '-', NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
4970	,{jjUMINUS_P, '-', POLY_CMD, POLY_CMD ALLOW_PLURAL}
4971	,{jjUMINUS_P, '-', VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
4972	,{jjUMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
4973	,{jjUMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
4974	,{jjUMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
4975	,{jjPROC1, '(', ANY_TYPE/set by p/,PROC_CMD ALLOW_PLURAL}
4976	,{jjLOAD1, '(', NONE, STRING_CMD ALLOW_PLURAL}
4977	// and the procedures with 1 argument:
4978	,{atATTRIB1, ATTRIB_CMD, NONE, DEF_CMD ALLOW_PLURAL}
4979	//,{jjBAREISS_IM, BAREISS_CMD, INTMAT_CMD, INTMAT_CMD NO_PLURAL}
4980	,{jjBAREISS, BAREISS_CMD, LIST_CMD, MODUL_CMD NO_PLURAL}
4981	,{jjBETTI, BETTI_CMD, INTMAT_CMD, LIST_CMD ALLOW_PLURAL}
4982	,{syBetti1, BETTI_CMD, INTMAT_CMD, RESOLUTION_CMD ALLOW_PLURAL}
4983	,{jjBETTI, BETTI_CMD, INTMAT_CMD, IDEAL_CMD ALLOW_PLURAL}
4984	,{jjBETTI, BETTI_CMD, INTMAT_CMD, MODUL_CMD ALLOW_PLURAL}
4985	,{jjDUMMY, BIGINT_CMD, BIGINT_CMD, BIGINT_CMD ALLOW_PLURAL}
4986	,{jjN2BI, BIGINT_CMD, BIGINT_CMD, NUMBER_CMD ALLOW_PLURAL}
4987	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, RING_CMD ALLOW_PLURAL}
4988	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, QRING_CMD ALLOW_PLURAL}
4989	#ifdef HAVE_FACTORY
4990	,{jjCHARSERIES, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD NO_PLURAL}
4991	#else
4992	,{jjWRONG, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD NO_PLURAL}
4993	#endif
4994	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), RING_CMD ALLOW_PLURAL}
4995	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), QRING_CMD ALLOW_PLURAL}
4996	,{jjOpenClose, CLOSE_CMD, NONE, LINK_CMD ALLOW_PLURAL}
4997	//,{jjWRONG, COLS_CMD, 0, VECTOR_CMD ALLOW_PLURAL}
4998	,{jjCOLS, COLS_CMD, INT_CMD, MATRIX_CMD ALLOW_PLURAL}
4999	,{jjCOLS, COLS_CMD, INT_CMD, IDEAL_CMD ALLOW_PLURAL}
5000	,{jjCOLS, COLS_CMD, INT_CMD, MODUL_CMD ALLOW_PLURAL}
5001	,{jjCOLS_IV, COLS_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5002	,{jjWRONG, COLS_CMD, 0, INTVEC_CMD ALLOW_PLURAL}
5003	,{jjCONTENT, CONTENT_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
5004	,{jjCONTENT, CONTENT_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
5005	,{jjCOUNT_N, COUNT_CMD, INT_CMD, NUMBER_CMD ALLOW_PLURAL}
5006	,{jjCOUNT_RES, COUNT_CMD, XS(INT_CMD), RESOLUTION_CMD ALLOW_PLURAL}
5007	,{jjstrlen, COUNT_CMD, XS(INT_CMD), STRING_CMD ALLOW_PLURAL}
5008	,{jjpLength, COUNT_CMD, XS(INT_CMD), POLY_CMD ALLOW_PLURAL}
5009	,{jjpLength, COUNT_CMD, XS(INT_CMD), VECTOR_CMD ALLOW_PLURAL}
5010	,{jjidElem, COUNT_CMD, XS(INT_CMD), IDEAL_CMD ALLOW_PLURAL}
5011	,{jjidElem, COUNT_CMD, XS(INT_CMD), MODUL_CMD ALLOW_PLURAL}
5012	,{jjCOUNT_M, COUNT_CMD, INT_CMD, MATRIX_CMD ALLOW_PLURAL}
5013	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
5014	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5015	,{jjCOUNT_L, COUNT_CMD, INT_CMD, LIST_CMD ALLOW_PLURAL}
5016	,{jjCOUNT_RG, COUNT_CMD, INT_CMD, RING_CMD ALLOW_PLURAL}
5017	,{jjNULL, DEF_CMD, DEF_CMD, INT_CMD ALLOW_PLURAL}
5018	,{jjWRONG, DEF_CMD, 0, ANY_TYPE ALLOW_PLURAL}
5019	,{jjDEG, DEG_CMD, INT_CMD, POLY_CMD ALLOW_PLURAL}
5020	,{jjDEG, DEG_CMD, INT_CMD, VECTOR_CMD ALLOW_PLURAL}
5021	,{jjDEG_M, DEG_CMD, INT_CMD, MATRIX_CMD ALLOW_PLURAL}
5022	,{jjDEGREE, DEGREE_CMD, NONE, IDEAL_CMD NO_PLURAL}
5023	,{jjDEGREE, DEGREE_CMD, NONE, MODUL_CMD NO_PLURAL}
5024	,{jjDEFINED, DEFINED_CMD, INT_CMD, DEF_CMD ALLOW_PLURAL}
5025	#ifdef HAVE_FACTORY
5026	,{jjDET_I, DET_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5027	,{jjDET, DET_CMD, POLY_CMD, MATRIX_CMD NO_PLURAL}
5028	,{jjDET_S, DET_CMD, POLY_CMD, MODUL_CMD NO_PLURAL}
5029	#else
5030	,{jjWRONG, DET_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5031	,{jjmpDetBareiss,DET_CMD, XS(POLY_CMD), MATRIX_CMD NO_PLURAL}
5032	#endif
5033	,{jjDIM, DIM_CMD, INT_CMD, IDEAL_CMD NO_PLURAL}
5034	,{jjDIM, DIM_CMD, INT_CMD, MODUL_CMD NO_PLURAL}
5035	,{jjDIM_R, DIM_CMD, XS(INT_CMD), RESOLUTION_CMD NO_PLURAL}
5036	,{jjDUMP, DUMP_CMD, NONE, LINK_CMD ALLOW_PLURAL}
5037	,{jjE, E_CMD, VECTOR_CMD, INT_CMD ALLOW_PLURAL}
5038	,{jjEXECUTE, EXECUTE_CMD, NONE, STRING_CMD ALLOW_PLURAL}
5039	,{jjERROR, ERROR_CMD, NONE, STRING_CMD ALLOW_PLURAL}
5040	#ifdef HAVE_FACTORY
5041	,{jjFAC_P, FAC_CMD, LIST_CMD, POLY_CMD NO_PLURAL}
5042	#else
5043	,{jjWRONG, FAC_CMD, LIST_CMD, POLY_CMD NO_PLURAL}
5044	#endif
5045	#ifdef HAVE_FGLM
5046	,{findUniProc, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
5047	#else
5048	,{jjWRONG, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD NO_PLURAL}
5049	#endif
5050	,{jjidFreeModule,FREEMODULE_CMD, XS(MODUL_CMD), INT_CMD ALLOW_PLURAL}
5051	#ifdef HAVE_FACTORY
5052	,{jjFACSTD, FACSTD_CMD, LIST_CMD, IDEAL_CMD NO_PLURAL}
5053	#else
5054	,{jjWRONG, FACSTD_CMD, LIST_CMD, IDEAL_CMD NO_PLURAL}
5055	#endif
5056	,{jjGETDUMP, GETDUMP_CMD, NONE, LINK_CMD ALLOW_PLURAL}
5057	,{jjHIGHCORNER, HIGHCORNER_CMD, POLY_CMD, IDEAL_CMD NO_PLURAL}
5058	,{jjHIGHCORNER_M, HIGHCORNER_CMD,VECTOR_CMD, MODUL_CMD NO_PLURAL}
5059	,{jjHILBERT, HILBERT_CMD, NONE, IDEAL_CMD NO_PLURAL}
5060	,{jjHILBERT, HILBERT_CMD, NONE, MODUL_CMD NO_PLURAL}
5061	,{jjHILBERT_IV, HILBERT_CMD, INTVEC_CMD, INTVEC_CMD NO_PLURAL}
5062	,{jjHOMOG1, HOMOG_CMD, INT_CMD, IDEAL_CMD ALLOW_PLURAL}
5063	,{jjHOMOG1, HOMOG_CMD, INT_CMD, MODUL_CMD ALLOW_PLURAL}
5064	,{jjDUMMY, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5065	,{jjidVec2Ideal,IDEAL_CMD, XS(IDEAL_CMD), VECTOR_CMD ALLOW_PLURAL}
5066	,{jjIDEAL_Ma, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD ALLOW_PLURAL}
5067	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, QRING_CMD ALLOW_PLURAL}
5068	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, RING_CMD ALLOW_PLURAL}
5069	,{jjIDEAL_Map, IDEAL_CMD, IDEAL_CMD, MAP_CMD ALLOW_PLURAL}
5070	,{jjIMPART, IMPART_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
5071	,{jjINDEPSET, INDEPSET_CMD, INTVEC_CMD, IDEAL_CMD NO_PLURAL}
5072	,{jjDUMMY, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
5073	,{jjnlInt, INT_CMD, INT_CMD, BIGINT_CMD ALLOW_PLURAL}
5074	,{jjnInt, INT_CMD, INT_CMD, NUMBER_CMD ALLOW_PLURAL}
5075	,{jjP2I, INT_CMD, INT_CMD, POLY_CMD ALLOW_PLURAL}
5076	,{jjINTERRED, INTERRED_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5077	,{jjINTERRED, INTERRED_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5078	,{jjDUMMY, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
5079	,{jjIm2Iv, INTVEC_CMD, INTVEC_CMD, INTMAT_CMD ALLOW_PLURAL}
5080	,{jjDUMMY, INTVEC_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
5081	,{jjIS_RINGVAR_P, IS_RINGVAR, INT_CMD, POLY_CMD ALLOW_PLURAL}
5082	,{jjIS_RINGVAR_S, IS_RINGVAR, INT_CMD, STRING_CMD ALLOW_PLURAL}
5083	,{jjIS_RINGVAR0,IS_RINGVAR, INT_CMD, ANY_TYPE ALLOW_PLURAL}
5084	,{jjJACOB_P, JACOB_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
5085	,{mpJacobi, JACOB_CMD, MATRIX_CMD, IDEAL_CMD ALLOW_PLURAL}
5086	,{jjJanetBasis, JANET_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5087	,{jjKBASE, KBASE_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5088	,{jjKBASE, KBASE_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5089	,{atKILLATTR1, KILLATTR_CMD, NONE, IDHDL ALLOW_PLURAL}
5090	#ifdef MDEBUG
5091	,{jjpHead, LEAD_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
5092	#else
5093	,{jjpHead, LEAD_CMD, XS(POLY_CMD), POLY_CMD ALLOW_PLURAL}
5094	#endif
5095	,{jjidHead, LEAD_CMD, XS(IDEAL_CMD), IDEAL_CMD ALLOW_PLURAL}
5096	#ifdef MDEBUG
5097	,{jjpHead, LEAD_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
5098	#else
5099	,{jjpHead, LEAD_CMD, XS(VECTOR_CMD), VECTOR_CMD ALLOW_PLURAL}
5100	#endif
5101	,{jjidHead, LEAD_CMD, XS(MODUL_CMD), MODUL_CMD ALLOW_PLURAL}
5102	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, POLY_CMD ALLOW_PLURAL}
5103	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, VECTOR_CMD ALLOW_PLURAL}
5104	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, POLY_CMD ALLOW_PLURAL}
5105	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, VECTOR_CMD ALLOW_PLURAL}
5106	,{jjLEADMONOM, LEADMONOM_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
5107	,{jjLEADMONOM, LEADMONOM_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
5108	,{jjLOAD1, LIB_CMD, NONE, STRING_CMD ALLOW_PLURAL}
5109	,{jjDUMMY, LINK_CMD, LINK_CMD, LINK_CMD ALLOW_PLURAL}
5110	,{jjCALL1MANY, LIST_CMD, LIST_CMD, DEF_CMD ALLOW_PLURAL}
5111	,{jjWRONG, MAP_CMD, 0, ANY_TYPE ALLOW_PLURAL}
5112	,{jjDUMMY, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD ALLOW_PLURAL}
5113	,{jjidMaxIdeal, MAXID_CMD, XS(IDEAL_CMD), INT_CMD ALLOW_PLURAL}
5114	,{jjMEMORY, MEMORY_CMD, BIGINT_CMD, INT_CMD ALLOW_PLURAL}
5115	,{jjidMinBase, MINBASE_CMD, XS(IDEAL_CMD), IDEAL_CMD NO_PLURAL}
5116	,{jjidMinBase, MINBASE_CMD, XS(MODUL_CMD), MODUL_CMD NO_PLURAL}
5117	,{jjMINRES, MINRES_CMD, LIST_CMD, LIST_CMD ALLOW_PLURAL}
5118	,{jjMINRES_R, MINRES_CMD, RESOLUTION_CMD, RESOLUTION_CMD ALLOW_PLURAL}
5119	,{jjDUMMY, MODUL_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5120	,{jjMONITOR1, MONITOR_CMD, NONE, LINK_CMD ALLOW_PLURAL}
5121	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, IDEAL_CMD NO_PLURAL}
5122	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, MODUL_CMD NO_PLURAL}
5123	,{jjMSTD, MSTD_CMD, LIST_CMD, IDEAL_CMD NO_PLURAL}
5124	,{jjMSTD, MSTD_CMD, LIST_CMD, MODUL_CMD NO_PLURAL}
5125	,{jjNAMEOF, NAMEOF_CMD, STRING_CMD, ANY_TYPE ALLOW_PLURAL}
5126	,{jjNAMES, NAMES_CMD, LIST_CMD, PACKAGE_CMD ALLOW_PLURAL}
5127	,{jjNAMES, NAMES_CMD, LIST_CMD, RING_CMD ALLOW_PLURAL}
5128	,{jjNAMES, NAMES_CMD, LIST_CMD, QRING_CMD ALLOW_PLURAL}
5129	,{jjDUMMY, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
5130	,{jjP2N, NUMBER_CMD, NUMBER_CMD, POLY_CMD ALLOW_PLURAL}
5131	,{jjBI2N, NUMBER_CMD, NUMBER_CMD, BIGINT_CMD ALLOW_PLURAL}
5132	,{jjRPAR, NPARS_CMD, INT_CMD, RING_CMD ALLOW_PLURAL}
5133	,{jjRPAR, NPARS_CMD, INT_CMD, QRING_CMD ALLOW_PLURAL}
5134	,{jjNVARS, NVARS_CMD, INT_CMD, RING_CMD ALLOW_PLURAL}
5135	,{jjNVARS, NVARS_CMD, INT_CMD, QRING_CMD ALLOW_PLURAL}
5136	,{jjOpenClose, OPEN_CMD, NONE, LINK_CMD ALLOW_PLURAL}
5137	,{jjORD, ORD_CMD, INT_CMD, POLY_CMD ALLOW_PLURAL}
5138	,{jjORD, ORD_CMD, INT_CMD, VECTOR_CMD ALLOW_PLURAL}
5139	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), RING_CMD ALLOW_PLURAL}
5140	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), QRING_CMD ALLOW_PLURAL}
5141	,{jjPAR1, PAR_CMD, NUMBER_CMD, INT_CMD ALLOW_PLURAL}
5142	,{jjPARDEG, PARDEG_CMD, INT_CMD, NUMBER_CMD ALLOW_PLURAL}
5143	,{jjPARSTR1, PARSTR_CMD, STRING_CMD, INT_CMD ALLOW_PLURAL}
5144	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), RING_CMD ALLOW_PLURAL}
5145	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), QRING_CMD ALLOW_PLURAL}
5146	,{jjDUMMY, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
5147	,{jjBI2P, POLY_CMD, POLY_CMD, BIGINT_CMD ALLOW_PLURAL}
5148	,{jjPREIMAGE_R, PREIMAGE_CMD, RING_CMD, MAP_CMD NO_PLURAL}
5149	,{jjPRIME, PRIME_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
5150	,{jjPRINT, PRINT_CMD, NONE, LIST_CMD ALLOW_PLURAL}
5151	,{jjPRINT, PRINT_CMD, NONE, DEF_CMD ALLOW_PLURAL}
5152	,{jjPRUNE, PRUNE_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5153	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, IDEAL_CMD ALLOW_PLURAL}
5154	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, MODUL_CMD ALLOW_PLURAL}
5155	,{jjWRONG, QRING_CMD, 0, ANY_TYPE ALLOW_PLURAL}
5156	,{jjREAD, READ_CMD, STRING_CMD, LINK_CMD ALLOW_PLURAL}
5157	,{jjREGULARITY, REGULARITY_CMD, INT_CMD, LIST_CMD NO_PLURAL}
5158	,{jjREPART, REPART_CMD, NUMBER_CMD, NUMBER_CMD ALLOW_PLURAL}
5159	,{jjRESERVEDNAME,RESERVEDNAME_CMD, INT_CMD, STRING_CMD ALLOW_PLURAL}
5160	,{jjL2R, RESOLUTION_CMD, RESOLUTION_CMD, LIST_CMD ALLOW_PLURAL}
5161	,{jjDUMMY, RESOLUTION_CMD, RESOLUTION_CMD, RESOLUTION_CMD ALLOW_PLURAL}
5162	,{jjRINGLIST, RINGLIST_CMD, LIST_CMD, RING_CMD ALLOW_PLURAL}
5163	,{jjRINGLIST, RINGLIST_CMD, LIST_CMD, QRING_CMD ALLOW_PLURAL}
5164	,{jjDUMMY, RING_CMD, RING_CMD, RING_CMD ALLOW_PLURAL}
5165	,{jjLISTRING, RING_CMD, RING_CMD, LIST_CMD ALLOW_PLURAL}
5166	//,{jjWRONG, ROWS_CMD, 0, POLY_CMD ALLOW_PLURAL}
5167	,{jjpMaxComp, ROWS_CMD, XS(INT_CMD), VECTOR_CMD ALLOW_PLURAL}
5168	,{jjROWS, ROWS_CMD, INT_CMD, MODUL_CMD ALLOW_PLURAL}
5169	,{jjROWS, ROWS_CMD, INT_CMD, MATRIX_CMD ALLOW_PLURAL}
5170	,{jjROWS_IV, ROWS_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5171	,{jjCOUNT_IV, ROWS_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
5172	,{jjSLIM_GB, SLIM_GB_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5173	,{jjSLIM_GB, SLIM_GB_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5174	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, IDEAL_CMD ALLOW_PLURAL}
5175	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, MODUL_CMD ALLOW_PLURAL}
5176	,{jjSQR_FREE, SQR_FREE_CMD, IDEAL_CMD, POLY_CMD NO_PLURAL}
5177	,{jjSTD, STD_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5178	,{jjSTD, STD_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5179	,{jjDUMMY, STRING_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
5180	,{jjSYSTEM, SYSTEM_CMD, NONE, STRING_CMD ALLOW_PLURAL}
5181	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, IDEAL_CMD ALLOW_PLURAL}
5182	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, MODUL_CMD ALLOW_PLURAL}
5183	#ifdef HAVE_PLURAL
5184	,{jjENVELOPE, ENVELOPE_CMD, RING_CMD, RING_CMD ALLOW_PLURAL}
5185	,{jjENVELOPE, ENVELOPE_CMD, QRING_CMD, QRING_CMD ALLOW_PLURAL}
5186	,{jjOPPOSITE, OPPOSITE_CMD, RING_CMD, RING_CMD ALLOW_PLURAL}
5187	,{jjOPPOSITE, OPPOSITE_CMD, QRING_CMD, QRING_CMD ALLOW_PLURAL}
5188	,{jjTWOSTD, TWOSTD_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5189	#endif
5190	,{jjWRONG, TRACE_CMD, 0, INTVEC_CMD ALLOW_PLURAL}
5191	,{jjWRONG, TRACE_CMD, 0, IDEAL_CMD ALLOW_PLURAL}
5192	,{jjTRACE_IV, TRACE_CMD, INT_CMD, INTMAT_CMD ALLOW_PLURAL}
5193	,{jjmpTrace, TRACE_CMD, XS(POLY_CMD), MATRIX_CMD ALLOW_PLURAL}
5194	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTVEC_CMD ALLOW_PLURAL}
5195	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTMAT_CMD ALLOW_PLURAL}
5196	,{jjmpTransp, TRANSPOSE_CMD, XS(MATRIX_CMD), MATRIX_CMD ALLOW_PLURAL}
5197	,{jjidTransp, TRANSPOSE_CMD, XS(MODUL_CMD), MODUL_CMD ALLOW_PLURAL}
5198	,{jjTYPEOF, TYPEOF_CMD, STRING_CMD, ANY_TYPE ALLOW_PLURAL}
5199	,{jjUNIVARIATE, UNIVARIATE_CMD, INT_CMD, POLY_CMD ALLOW_PLURAL}
5200	,{jjVARIABLES_P,VARIABLES_CMD, LIST_CMD, POLY_CMD ALLOW_PLURAL}
5201	,{jjVARIABLES_ID,VARIABLES_CMD, LIST_CMD, IDEAL_CMD ALLOW_PLURAL}
5202	,{jjVARIABLES_ID,VARIABLES_CMD, LIST_CMD, MATRIX_CMD ALLOW_PLURAL}
5203	,{jjDUMMY, VECTOR_CMD, VECTOR_CMD, VECTOR_CMD ALLOW_PLURAL}
5204	,{jjVDIM, VDIM_CMD, INT_CMD, IDEAL_CMD ALLOW_PLURAL}
5205	,{jjVDIM, VDIM_CMD, INT_CMD, MODUL_CMD ALLOW_PLURAL}
5206	,{jjVAR1, VAR_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
5207	,{jjVARSTR1, VARSTR_CMD, STRING_CMD, INT_CMD ALLOW_PLURAL}
5208	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), RING_CMD ALLOW_PLURAL}
5209	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), QRING_CMD ALLOW_PLURAL}
5210	,{kWeight, WEIGHT_CMD, INTVEC_CMD, IDEAL_CMD ALLOW_PLURAL}
5211	,{kWeight, WEIGHT_CMD, INTVEC_CMD, MODUL_CMD ALLOW_PLURAL}
5212	,{jjLOAD1, LOAD_CMD, NONE, STRING_CMD ALLOW_PLURAL}
5213	,{loNewtonP, NEWTONPOLY_CMD, IDEAL_CMD, IDEAL_CMD ALLOW_PLURAL}
5214	,{NULL, 0, 0, 0 NO_PLURAL}
5215	};
5216	#undef s
5217	/=================== operations with 3 args.: static proc =================/
5218	static BOOLEAN jjBRACK_S(leftv res, leftv u, leftv v,leftv w)
5219	{
5220	char s= (char )u->Data();
5221	int r = (int)(long)v->Data();
5222	int c = (int)(long)w->Data();
5223	int l = strlen(s);
5224
5225	if ( (r<1) \|\| (r>l) \|\| (c<0) )
5226	{
5227	Werror("wrong range[%d,%d] in string %s",r,c,u->Fullname());
5228	return TRUE;
5229	}
5230	res->data = (char *)omAlloc((long)(c+1));
5231	sprintf((char )res->data,"%-.*s",c,c,s+r-1);
5232	return FALSE;
5233	}
5234	static BOOLEAN jjBRACK_Im(leftv res, leftv u, leftv v,leftv w)
5235	{
5236	intvec iv = (intvec )u->Data();
5237	int r = (int)(long)v->Data();
5238	int c = (int)(long)w->Data();
5239	if ((r<1)\|\|(r>iv->rows())\|\|(c<1)\|\|(c>iv->cols()))
5240	{
5241	Werror("wrong range[%d,%d] in intmat %s(%d x %d)",
5242	r,c,u->Fullname(),iv->rows(),iv->cols());
5243	return TRUE;
5244	}
5245	res->data=u->data; u->data=NULL;
5246	res->rtyp=u->rtyp; u->rtyp=0;
5247	res->name=u->name; u->name=NULL;
5248	res->attribute=u->attribute; u->attribute=NULL;
5249	Subexpr e=jjMakeSub(v);
5250	e->next=jjMakeSub(w);
5251	if (u->e==NULL) res->e=e;
5252	else
5253	{
5254	Subexpr h=u->e;
5255	while (h->next!=NULL) h=h->next;
5256	h->next=e;
5257	res->e=u->e;
5258	u->e=NULL;
5259	}
5260	return FALSE;
5261	}
5262	static BOOLEAN jjBRACK_Ma(leftv res, leftv u, leftv v,leftv w)
5263	{
5264	matrix m= (matrix)u->Data();
5265	int r = (int)(long)v->Data();
5266	int c = (int)(long)w->Data();
5267	//Print("gen. elem %d, %d\n",r,c);
5268	if ((r<1)\|\|(r>MATROWS(m))\|\|(c<1)\|\|(c>MATCOLS(m)))
5269	{
5270	Werror("wrong range[%d,%d] in matrix %s(%d x %d)",r,c,u->Fullname(),
5271	MATROWS(m),MATCOLS(m));
5272	return TRUE;
5273	}
5274	res->data=u->data; u->data=NULL;
5275	res->rtyp=u->rtyp; u->rtyp=0;
5276	res->name=u->name; u->name=NULL;
5277	res->attribute=u->attribute; u->attribute=NULL;
5278	Subexpr e=jjMakeSub(v);
5279	e->next=jjMakeSub(w);
5280	if (u->e==NULL)
5281	res->e=e;
5282	else
5283	{
5284	Subexpr h=u->e;
5285	while (h->next!=NULL) h=h->next;
5286	h->next=e;
5287	res->e=u->e;
5288	u->e=NULL;
5289	}
5290	return FALSE;
5291	}
5292	static BOOLEAN jjBRACK_Ma_I_IV(leftv res, leftv u, leftv v,leftv w)
5293	{
5294	sleftv t;
5295	sleftv ut;
5296	leftv p=NULL;
5297	intvec iv=(intvec )w->Data();
5298	int l;
5299	BOOLEAN nok;
5300
5301	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
5302	{
5303	WerrorS("cannot build expression lists from unnamed objects");
5304	return TRUE;
5305	}
5306	memcpy(&ut,u,sizeof(ut));
5307	memset(&t,0,sizeof(t));
5308	t.rtyp=INT_CMD;
5309	for (l=0;l< iv->length(); l++)
5310	{
5311	t.data=(char )(long)((iv)[l]);
5312	if (p==NULL)
5313	{
5314	p=res;
5315	}
5316	else
5317	{
5318	p->next=(leftv)omAlloc0Bin(sleftv_bin);
5319	p=p->next;
5320	}
5321	memcpy(u,&ut,sizeof(ut));
5322	if (u->Typ() == MATRIX_CMD)
5323	nok=jjBRACK_Ma(p,u,v,&t);
5324	else /* INTMAT_CMD */
5325	nok=jjBRACK_Im(p,u,v,&t);
5326	if (nok)
5327	{
5328	while (res->next!=NULL)
5329	{
5330	p=res->next->next;
5331	omFreeBin((ADDRESS)res->next, sleftv_bin);
5332	// res->e aufraeumen !!!!
5333	res->next=p;
5334	}
5335	return TRUE;
5336	}
5337	}
5338	return FALSE;
5339	}
5340	static BOOLEAN jjBRACK_Ma_IV_I(leftv res, leftv u, leftv v,leftv w)
5341	{
5342	sleftv t;
5343	sleftv ut;
5344	leftv p=NULL;
5345	intvec iv=(intvec )v->Data();
5346	int l;
5347	BOOLEAN nok;
5348
5349	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
5350	{
5351	WerrorS("cannot build expression lists from unnamed objects");
5352	return TRUE;
5353	}
5354	memcpy(&ut,u,sizeof(ut));
5355	memset(&t,0,sizeof(t));
5356	t.rtyp=INT_CMD;
5357	for (l=0;l< iv->length(); l++)
5358	{
5359	t.data=(char )(long)((iv)[l]);
5360	if (p==NULL)
5361	{
5362	p=res;
5363	}
5364	else
5365	{
5366	p->next=(leftv)omAlloc0Bin(sleftv_bin);
5367	p=p->next;
5368	}
5369	memcpy(u,&ut,sizeof(ut));
5370	if (u->Typ() == MATRIX_CMD)
5371	nok=jjBRACK_Ma(p,u,&t,w);
5372	else /* INTMAT_CMD */
5373	nok=jjBRACK_Im(p,u,&t,w);
5374	if (nok)
5375	{
5376	while (res->next!=NULL)
5377	{
5378	p=res->next->next;
5379	omFreeBin((ADDRESS)res->next, sleftv_bin);
5380	// res->e aufraeumen !!
5381	res->next=p;
5382	}
5383	return TRUE;
5384	}
5385	}
5386	return FALSE;
5387	}
5388	static BOOLEAN jjBRACK_Ma_IV_IV(leftv res, leftv u, leftv v,leftv w)
5389	{
5390	sleftv t1,t2,ut;
5391	leftv p=NULL;
5392	intvec vv=(intvec )v->Data();
5393	intvec wv=(intvec )w->Data();
5394	int vl;
5395	int wl;
5396	BOOLEAN nok;
5397
5398	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
5399	{
5400	WerrorS("cannot build expression lists from unnamed objects");
5401	return TRUE;
5402	}
5403	memcpy(&ut,u,sizeof(ut));
5404	memset(&t1,0,sizeof(sleftv));
5405	memset(&t2,0,sizeof(sleftv));
5406	t1.rtyp=INT_CMD;
5407	t2.rtyp=INT_CMD;
5408	for (vl=0;vl< vv->length(); vl++)
5409	{
5410	t1.data=(char )(long)((vv)[vl]);
5411	for (wl=0;wl< wv->length(); wl++)
5412	{
5413	t2.data=(char )(long)((wv)[wl]);
5414	if (p==NULL)
5415	{
5416	p=res;
5417	}
5418	else
5419	{
5420	p->next=(leftv)omAlloc0Bin(sleftv_bin);
5421	p=p->next;
5422	}
5423	memcpy(u,&ut,sizeof(ut));
5424	if (u->Typ() == MATRIX_CMD)
5425	nok=jjBRACK_Ma(p,u,&t1,&t2);
5426	else /* INTMAT_CMD */
5427	nok=jjBRACK_Im(p,u,&t1,&t2);
5428	if (nok)
5429	{
5430	res->CleanUp();
5431	return TRUE;
5432	}
5433	}
5434	}
5435	return FALSE;
5436	}
5437	static BOOLEAN jjPROC3(leftv res, leftv u, leftv v, leftv w)
5438	{
5439	v->next=(leftv)omAllocBin(sleftv_bin);
5440	memcpy(v->next,w,sizeof(sleftv));
5441	memset(w,0,sizeof(sleftv));
5442	return jjPROC(res,u,v);
5443	}
5444	static BOOLEAN jjCALL3MANY(leftv res, leftv u, leftv v, leftv w)
5445	{
5446	u->next=(leftv)omAllocBin(sleftv_bin);
5447	memcpy(u->next,v,sizeof(sleftv));
5448	u->next->next=(leftv)omAllocBin(sleftv_bin);
5449	memcpy(u->next->next,w,sizeof(sleftv));
5450	BOOLEAN r=iiExprArithM(res,u,iiOp);
5451	v->Init();
5452	w->Init();
5453	//w->rtyp=0; w->data=NULL;
5454	// iiExprArithM did the CleanUp
5455	return r;
5456	}
5457	static BOOLEAN jjBAREISS3(leftv res, leftv u, leftv v, leftv w)
5458	{
5459	intvec *iv;
5460	ideal m;
5461	lists l=(lists)omAllocBin(slists_bin);
5462	int k=(int)(long)w->Data();
5463	if (k>=0)
5464	{
5465	smCallNewBareiss((ideal)u->Data(),(int)(long)v->Data(),(int)(long)w->Data(),m,&iv);
5466	l->Init(2);
5467	l->m[0].rtyp=MODUL_CMD;
5468	l->m[1].rtyp=INTVEC_CMD;
5469	l->m[0].data=(void *)m;
5470	l->m[1].data=(void *)iv;
5471	}
5472	else
5473	{
5474	m=smCallSolv((ideal)u->Data());
5475	l->Init(1);
5476	l->m[0].rtyp=IDEAL_CMD;
5477	l->m[0].data=(void *)m;
5478	}
5479	res->data = (char *)l;
5480	return FALSE;
5481	}
5482	static BOOLEAN jjCOEFFS3_Id(leftv res, leftv u, leftv v, leftv w)
5483	{
5484	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
5485	{
5486	WerrorS("3rd argument must be a name of a matrix");
5487	return TRUE;
5488	}
5489	ideal i=(ideal)u->Data();
5490	int rank=(int)i->rank;
5491	BOOLEAN r=jjCOEFFS_Id(res,u,v);
5492	if (r) return TRUE;
5493	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
5494	return FALSE;
5495	}
5496	static BOOLEAN jjCOEFFS3_KB(leftv res, leftv u, leftv v, leftv w)
5497	{
5498	res->data=(void*)idCoeffOfKBase((ideal)(u->Data()),
5499	(ideal)(v->Data()),(poly)(w->Data()));
5500	return FALSE;
5501	}
5502	static BOOLEAN jjCOEFFS3_P(leftv res, leftv u, leftv v, leftv w)
5503	{
5504	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
5505	{
5506	WerrorS("3rd argument must be a name of a matrix");
5507	return TRUE;
5508	}
5509	// CopyD for POLY_CMD and VECTOR_CMD are identical:
5510	poly p=(poly)u->CopyD(POLY_CMD);
5511	ideal i=idInit(1,1);
5512	i->m[0]=p;
5513	sleftv t;
5514	memset(&t,0,sizeof(t));
5515	t.data=(char *)i;
5516	t.rtyp=IDEAL_CMD;
5517	int rank=1;
5518	if (u->Typ()==VECTOR_CMD)
5519	{
5520	i->rank=rank=pMaxComp(p);
5521	t.rtyp=MODUL_CMD;
5522	}
5523	BOOLEAN r=jjCOEFFS_Id(res,&t,v);
5524	t.CleanUp();
5525	if (r) return TRUE;
5526	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
5527	return FALSE;
5528	}
5529	static BOOLEAN jjELIMIN_HILB(leftv res, leftv u, leftv v, leftv w)
5530	{
5531	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data(),
5532	(intvec *)w->Data());
5533	//setFlag(res,FLAG_STD);
5534	return FALSE;
5535	}
5536	static BOOLEAN jjFIND3(leftv res, leftv u, leftv v, leftv w)
5537	{
5538	/*4
5539	* look for the substring what in the string where
5540	* starting at position n
5541	* return the position of the first char of what in where
5542	* or 0
5543	*/
5544	int n=(int)(long)w->Data();
5545	char where=(char )u->Data();
5546	char what=(char )v->Data();
5547	char *found;
5548	if ((1>n)\|\|(n>(int)strlen(where)))
5549	{
5550	Werror("start position %d out of range",n);
5551	return TRUE;
5552	}
5553	found = strchr(where+n-1,*what);
5554	if (*(what+1)!='\0')
5555	{
5556	while((found !=NULL) && (strncmp(found+1,what+1,strlen(what+1))!=0))
5557	{
5558	found=strchr(found+1,*what);
5559	}
5560	}
5561	if (found != NULL)
5562	{
5563	res->data=(char *)((found-where)+1);
5564	}
5565	return FALSE;
5566	}
5567	static BOOLEAN jjFWALK3(leftv res, leftv u, leftv v, leftv w)
5568	{
5569	if ((int)(long)w->Data()==0)
5570	res->data=(char *)walkProc(u,v);
5571	else
5572	res->data=(char *)fractalWalkProc(u,v);
5573	setFlag( res, FLAG_STD );
5574	return FALSE;
5575	}
5576	static BOOLEAN jjHILBERT3(leftv res, leftv u, leftv v, leftv w)
5577	{
5578	assumeStdFlag(u);
5579	intvec module_w=(intvec )atGet(u,"isHomog",INTVEC_CMD);
5580	intvec wdegree=(intvec)w->Data();
5581	if (wdegree->length()!=pVariables)
5582	{
5583	Werror("weight vector must have size %d, not %d",
5584	pVariables,wdegree->length());
5585	return TRUE;
5586	}
5587	intvec *iv=hFirstSeries((ideal)u->Data(),module_w,currQuotient,wdegree);
5588	switch((int)(long)v->Data())
5589	{
5590	case 1:
5591	res->data=(void *)iv;
5592	return FALSE;
5593	case 2:
5594	res->data=(void *)hSecondSeries(iv);
5595	delete iv;
5596	return FALSE;
5597	}
5598	WerrorS(feNotImplemented);
5599	delete iv;
5600	return TRUE;
5601	}
5602	static BOOLEAN jjINTMAT3(leftv res, leftv u, leftv v,leftv w)
5603	{
5604	intvec* im= new intvec((int)(long)v->Data(),(int)(long)w->Data(), 0);
5605	intvec* arg = (intvec*) u->Data();
5606	int i, n = si_min(im->cols()im->rows(), arg->cols()arg->rows());
5607
5608	for (i=0; i<n; i++)
5609	{
5610	(im)[i] = (arg)[i];
5611	}
5612
5613	res->data = (char *)im;
5614	return FALSE;
5615	}
5616	static BOOLEAN jjJET_P_IV(leftv res, leftv u, leftv v, leftv w)
5617	{
5618	short iw=iv2array((intvec )w->Data());
5619	res->data = (char *)ppJetW((poly)u->Data(),(int)(long)v->Data(),iw);
5620	omFreeSize((ADDRESS)iw,(pVariables+1)*sizeof(short));
5621	return FALSE;
5622	}
5623	static BOOLEAN jjJET_P_P(leftv res, leftv u, leftv v, leftv w)
5624	{
5625	if (!pIsUnit((poly)v->Data()))
5626	{
5627	WerrorS("2nd argument must be a unit");
5628	return TRUE;
5629	}
5630	res->data = (char *)pSeries((int)(long)w->Data(),(poly)u->CopyD(),(poly)v->CopyD());
5631	return FALSE;
5632	}
5633	static BOOLEAN jjJET_ID_IV(leftv res, leftv u, leftv v, leftv w)
5634	{
5635	res->data = (char *)idJetW((ideal)u->Data(),(int)(long)v->Data(),
5636	(intvec *)w->Data());
5637	return FALSE;
5638	}
5639	static BOOLEAN jjJET_ID_M(leftv res, leftv u, leftv v, leftv w)
5640	{
5641	if (!mpIsDiagUnit((matrix)v->Data()))
5642	{
5643	WerrorS("2nd argument must be a diagonal matrix of units");
5644	return TRUE;
5645	}
5646	res->data = (char *)idSeries((int)(long)w->Data(),(ideal)u->CopyD(),
5647	(matrix)v->CopyD());
5648	return FALSE;
5649	}
5650	static BOOLEAN jjMINOR3(leftv res, leftv u, leftv v, leftv w)
5651	{
5652	assumeStdFlag(w);
5653	res->data = (char *)idMinors(
5654	(matrix)u->Data(),(int)(long)v->Data(),(ideal)w->Data());
5655	return FALSE;
5656	}
5657	static BOOLEAN jjPREIMAGE(leftv res, leftv u, leftv v, leftv w)
5658	{
5659	// handles preimage(r,phi,i) and kernel(r,phi)
5660	idhdl h;
5661	ring rr;
5662	map mapping;
5663	BOOLEAN kernel_cmd= (iiOp==KERNEL_CMD);
5664
5665	if ((v->name==NULL) \|\| (!kernel_cmd && (w->name==NULL)))
5666	{
5667	WerrorS("2nd/3rd arguments must have names");
5668	return TRUE;
5669	}
5670	rr=(ring)u->Data();
5671	const char *ring_name=u->Name();
5672	if ((h=rr->idroot->get(v->name,myynest))!=NULL)
5673	{
5674	if (h->typ==MAP_CMD)
5675	{
5676	mapping=IDMAP(h);
5677	idhdl preim_ring=IDROOT->get(mapping->preimage,myynest);
5678	if ((preim_ring==NULL)
5679	\|\| (IDRING(preim_ring)!=currRing))
5680	{
5681	Werror("preimage ring `%s` is not the basering",mapping->preimage);
5682	return TRUE;
5683	}
5684	}
5685	else if (h->typ==IDEAL_CMD)
5686	{
5687	mapping=IDMAP(h);
5688	}
5689	else
5690	{
5691	Werror("`%s` is no map nor ideal",IDID(h));
5692	return TRUE;
5693	}
5694	}
5695	else
5696	{
5697	Werror("`%s` is not defined in `%s`",v->name,ring_name);
5698	return TRUE;
5699	}
5700	ideal image;
5701	if (kernel_cmd) image=idInit(1,1);
5702	else
5703	{
5704	if ((h=rr->idroot->get(w->name,myynest))!=NULL)
5705	{
5706	if (h->typ==IDEAL_CMD)
5707	{
5708	image=IDIDEAL(h);
5709	}
5710	else
5711	{
5712	Werror("`%s` is no ideal",IDID(h));
5713	return TRUE;
5714	}
5715	}
5716	else
5717	{
5718	Werror("`%s` is not defined in `%s`",w->name,ring_name);
5719	return TRUE;
5720	}
5721	}
5722	if (((currRing->qideal!=NULL) && (rHasLocalOrMixedOrdering_currRing()))
5723	\|\| ((rr->qideal!=NULL) && (rHasLocalOrMixedOrdering(rr))))
5724	{
5725	WarnS("preimage in local qring may be wrong: use Ring::preimageLoc instead");
5726	}
5727	res->data=(char *)maGetPreimage(rr,mapping,image);
5728	if (kernel_cmd) idDelete(&image);
5729	return (res->data==NULL/* is of type ideal, should not be NULL*/);
5730	}
5731	static BOOLEAN jjRANDOM_Im(leftv res, leftv u, leftv v, leftv w)
5732	{
5733	int di, k;
5734	int i=(int)(long)u->Data();
5735	int r=(int)(long)v->Data();
5736	int c=(int)(long)w->Data();
5737	if ((r<=0) \|\| (c<=0)) return TRUE;
5738	intvec *iv = new intvec(r, c, 0);
5739	if (iv->rows()==0)
5740	{
5741	delete iv;
5742	return TRUE;
5743	}
5744	if (i!=0)
5745	{
5746	if (i<0) i = -i;
5747	di = 2 * i + 1;
5748	for (k=0; k<iv->length(); k++)
5749	{
5750	#ifdef buildin_rand
5751	(*iv)[k] = ((siRand() % di) - i);
5752	#else
5753	(*iv)[k] = ((rand() % di) - i);
5754	#endif
5755	}
5756	}
5757	res->data = (char *)iv;
5758	return FALSE;
5759	}
5760	static BOOLEAN jjSUBST_Test(leftv v,leftv w,
5761	int &ringvar, poly &monomexpr)
5762	{
5763	monomexpr=(poly)w->Data();
5764	poly p=(poly)v->Data();
5765	#if 0
5766	if (pLength(monomexpr)>1)
5767	{
5768	Werror("`%s` substitutes a ringvar only by a term",
5769	Tok2Cmdname(SUBST_CMD));
5770	return TRUE;
5771	}
5772	#endif
5773	if (!(ringvar=pVar(p)))
5774	{
5775	if (rField_is_Extension(currRing))
5776	{
5777	assume(currRing->algring!=NULL);
5778	lnumber n=(lnumber)pGetCoeff(p);
5779	ringvar=-p_Var(n->z,currRing->algring);
5780	}
5781	if(ringvar==0)
5782	{
5783	WerrorS("ringvar/par expected");
5784	return TRUE;
5785	}
5786	}
5787	return FALSE;
5788	}
5789	static BOOLEAN jjSUBST_P(leftv res, leftv u, leftv v,leftv w)
5790	{
5791	int ringvar;
5792	poly monomexpr;
5793	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
5794	if (nok) return TRUE;
5795	if (ringvar>0)
5796	{
5797	if ((monomexpr==NULL)\|\|(pNext(monomexpr)==NULL))
5798	res->data = pSubst((poly)u->CopyD(res->rtyp),ringvar,monomexpr);
5799	else
5800	res->data= pSubstPoly((poly)u->Data(),ringvar,monomexpr);
5801	}
5802	else
5803	{
5804	res->data=pSubstPar((poly)u->Data(),-ringvar,monomexpr);
5805	}
5806	return FALSE;
5807	}
5808	static BOOLEAN jjSUBST_Id(leftv res, leftv u, leftv v,leftv w)
5809	{
5810	int ringvar;
5811	poly monomexpr;
5812	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
5813	if (nok) return TRUE;
5814	if (ringvar>0)
5815	{
5816	if ((monomexpr==NULL)\|\|(pNext(monomexpr)==NULL))
5817	res->data = idSubst((ideal)u->CopyD(res->rtyp),ringvar,monomexpr);
5818	else
5819	res->data = idSubstPoly((ideal)u->Data(),ringvar,monomexpr);
5820	}
5821	else
5822	{
5823	res->data = idSubstPar((ideal)u->Data(),-ringvar,monomexpr);
5824	}
5825	return FALSE;
5826	}
5827	// we do not want to have jjSUBST_Id_X inlined:
5828	static BOOLEAN jjSUBST_Id_X(leftv res, leftv u, leftv v,leftv w,
5829	int input_type);
5830	static BOOLEAN jjSUBST_Id_I(leftv res, leftv u, leftv v,leftv w)
5831	{
5832	return jjSUBST_Id_X(res,u,v,w,INT_CMD);
5833	}
5834	static BOOLEAN jjSUBST_Id_N(leftv res, leftv u, leftv v,leftv w)
5835	{
5836	return jjSUBST_Id_X(res,u,v,w,NUMBER_CMD);
5837	}
5838	static BOOLEAN jjSUBST_Id_X(leftv res, leftv u, leftv v,leftv w, int input_type)
5839	{
5840	sleftv tmp;
5841	memset(&tmp,0,sizeof(tmp));
5842	// do not check the result, conversion from int/number to poly works always
5843	iiConvert(input_type,POLY_CMD,iiTestConvert(input_type,POLY_CMD),w,&tmp);
5844	BOOLEAN b=jjSUBST_Id(res,u,v,&tmp);
5845	tmp.CleanUp();
5846	return b;
5847	}
5848	static BOOLEAN jjMATRIX_Id(leftv res, leftv u, leftv v,leftv w)
5849	{
5850	matrix m=mpNew((int)(long)v->Data(),(int)(long)w->Data());
5851	ideal I=(ideal)u->CopyD(IDEAL_CMD);
5852	int i=si_min(IDELEMS(I),(int)(long)v->Data()*(int)(long)w->Data());
5853	//for(i=i-1;i>=0;i--)
5854	//{
5855	// m->m[i]=I->m[i];
5856	// I->m[i]=NULL;
5857	//}
5858	memcpy4(m->m,I->m,i*sizeof(poly));
5859	memset(I->m,0,i*sizeof(poly));
5860	idDelete(&I);
5861	res->data = (char *)m;
5862	return FALSE;
5863	}
5864	static BOOLEAN jjMATRIX_Mo(leftv res, leftv u, leftv v,leftv w)
5865	{
5866	res->data = (char *)idModule2formatedMatrix((ideal)u->CopyD(MODUL_CMD),
5867	(int)(long)v->Data(),(int)(long)w->Data());
5868	return FALSE;
5869	}
5870	static BOOLEAN jjMATRIX_Ma(leftv res, leftv u, leftv v,leftv w)
5871	{
5872	matrix m=mpNew((int)(long)v->Data(),(int)(long)w->Data());
5873	matrix I=(matrix)u->CopyD(MATRIX_CMD);
5874	int r=si_min(MATROWS(I),(int)(long)v->Data());
5875	int c=si_min(MATCOLS(I),(int)(long)w->Data());
5876	int i,j;
5877	for(i=r;i>0;i--)
5878	{
5879	for(j=c;j>0;j--)
5880	{
5881	MATELEM(m,i,j)=MATELEM(I,i,j);
5882	MATELEM(I,i,j)=NULL;
5883	}
5884	}
5885	idDelete((ideal *)&I);
5886	res->data = (char *)m;
5887	return FALSE;
5888	}
5889	static BOOLEAN jjLIFT3(leftv res, leftv u, leftv v, leftv w)
5890	{
5891	if (w->rtyp!=IDHDL) return TRUE;
5892	BITSET save_test=test;
5893	int ul= IDELEMS((ideal)u->Data());
5894	int vl= IDELEMS((ideal)v->Data());
5895	ideal m
5896	= idLift((ideal)u->Data(),(ideal)v->Data(),NULL,FALSE,hasFlag(u,FLAG_STD),
5897	FALSE, (matrix *)(&(IDMATRIX((idhdl)(w->data)))));
5898	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
5899	test=save_test;
5900	return FALSE;
5901	}
5902	static BOOLEAN jjREDUCE3_CP(leftv res, leftv u, leftv v, leftv w)
5903	{
5904	assumeStdFlag(v);
5905	if (!idIsZeroDim((ideal)v->Data()))
5906	{
5907	Werror("`%s` must be 0-dimensional",v->Name());
5908	return TRUE;
5909	}
5910	res->data = (char *)redNF((ideal)v->CopyD(),(poly)u->CopyD(),
5911	(poly)w->CopyD());
5912	return FALSE;
5913	}
5914	static BOOLEAN jjREDUCE3_CID(leftv res, leftv u, leftv v, leftv w)
5915	{
5916	assumeStdFlag(v);
5917	if (!idIsZeroDim((ideal)v->Data()))
5918	{
5919	Werror("`%s` must be 0-dimensional",v->Name());
5920	return TRUE;
5921	}
5922	res->data = (char *)redNF((ideal)v->CopyD(),(ideal)u->CopyD(),
5923	(matrix)w->CopyD());
5924	return FALSE;
5925	}
5926	static BOOLEAN jjREDUCE3_P(leftv res, leftv u, leftv v, leftv w)
5927	{
5928	assumeStdFlag(v);
5929	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data(),
5930	0,(int)(long)w->Data());
5931	return FALSE;
5932	}
5933	static BOOLEAN jjREDUCE3_ID(leftv res, leftv u, leftv v, leftv w)
5934	{
5935	assumeStdFlag(v);
5936	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data(),
5937	0,(int)(long)w->Data());
5938	return FALSE;
5939	}
5940	#ifdef OLD_RES
5941	static BOOLEAN jjRES3(leftv res, leftv u, leftv v, leftv w)
5942	{
5943	int maxl=(int)v->Data();
5944	ideal u_id=(ideal)u->Data();
5945	int l=0;
5946	resolvente r;
5947	intvec **weights=NULL;
5948	int wmaxl=maxl;
5949	maxl--;
5950	if ((maxl==-1) && (iiOp!=MRES_CMD))
5951	maxl = pVariables-1;
5952	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
5953	{
5954	intvec * iv=(intvec*)atGet(u,"isHomog",INTVEC_CMD);
5955	if (iv!=NULL)
5956	{
5957	l=1;
5958	if (!idTestHomModule(u_id,currQuotient,iv))
5959	{
5960	WarnS("wrong weights");
5961	iv=NULL;
5962	}
5963	else
5964	{
5965	weights = (intvec**)omAlloc0Bin(void_ptr_bin);
5966	weights[0] = ivCopy(iv);
5967	}
5968	}
5969	r=syResolvente(u_id,maxl,&l, &weights, iiOp==MRES_CMD);
5970	}
5971	else
5972	r=sySchreyerResolvente((ideal)u->Data(),maxl+1,&l);
5973	if (r==NULL) return TRUE;
5974	int t3=u->Typ();
5975	iiMakeResolv(r,l,wmaxl,w->name,t3,weights);
5976	return FALSE;
5977	}
5978	#endif
5979	static BOOLEAN jjRING3(leftv res, leftv u, leftv v, leftv w)
5980	{
5981	res->data=(void *)rInit(u,v,w);
5982	return (res->data==NULL);
5983	}
5984	static BOOLEAN jjSTATUS3(leftv res, leftv u, leftv v, leftv w)
5985	{
5986	int yes;
5987	jjSTATUS2(res, u, v);
5988	yes = (strcmp((char ) res->data, (char ) w->Data()) == 0);
5989	omFree((ADDRESS) res->data);
5990	res->data = (void *)(long)yes;
5991	return FALSE;
5992	}
5993	static BOOLEAN jjSTD_HILB_W(leftv res, leftv u, leftv v, leftv w)
5994	{
5995	intvec vw=(intvec )w->Data(); // weights of vars
5996	if (vw->length()!=currRing->N)
5997	{
5998	Werror("%d weights for %d variables",vw->length(),currRing->N);
5999	return TRUE;
6000	}
6001	ideal result;
6002	intvec ww=(intvec )atGet(u,"isHomog",INTVEC_CMD);
6003	tHomog hom=testHomog;
6004	ideal u_id=(ideal)(u->Data());
6005	if (ww!=NULL)
6006	{
6007	if (!idTestHomModule(u_id,currQuotient,ww))
6008	{
6009	WarnS("wrong weights");
6010	ww=NULL;
6011	}
6012	else
6013	{
6014	ww=ivCopy(ww);
6015	hom=isHomog;
6016	}
6017	}
6018	result=kStd(u_id,
6019	currQuotient,
6020	hom,
6021	&ww, // module weights
6022	(intvec *)v->Data(), // hilbert series
6023	0,0, // syzComp, newIdeal
6024	vw); // weights of vars
6025	idSkipZeroes(result);
6026	res->data = (char *)result;
6027	setFlag(res,FLAG_STD);
6028	if (ww!=NULL) atSet(res,omStrDup("isHomog"),ww,INTVEC_CMD);
6029	return FALSE;
6030	}
6031
6032	/=================== operations with 3 args.: table =================/
6033	struct sValCmd3 dArith3[]=
6034	{
6035	// operations:
6036	// proc cmd res arg1 arg2 arg3 plural
6037	{jjBRACK_S, '[', STRING_CMD, STRING_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6038	,{jjBRACK_Im, '[', INT_CMD, INTMAT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6039	,{jjBRACK_Ma_I_IV, '[', INT_CMD, INTMAT_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6040	,{jjBRACK_Ma_IV_I, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
6041	,{jjBRACK_Ma_IV_IV, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
6042	,{jjBRACK_Ma, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6043	,{jjBRACK_Ma_I_IV, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6044	,{jjBRACK_Ma_IV_I, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INT_CMD ALLOW_PLURAL}
6045	,{jjBRACK_Ma_IV_IV, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INTVEC_CMD ALLOW_PLURAL}
6046	,{jjPROC3, '(', ANY_TYPE, PROC_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6047	,{atATTRIB3, ATTRIB_CMD, NONE, IDHDL, STRING_CMD, DEF_CMD ALLOW_PLURAL}
6048	,{jjBAREISS3, BAREISS_CMD,LIST_CMD, MODUL_CMD, INT_CMD, INT_CMD NO_PLURAL}
6049	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD, MATRIX_CMD ALLOW_PLURAL}
6050	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, VECTOR_CMD, POLY_CMD, MATRIX_CMD ALLOW_PLURAL}
6051	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD, MATRIX_CMD ALLOW_PLURAL}
6052	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD, MATRIX_CMD ALLOW_PLURAL}
6053	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD ALLOW_PLURAL}
6054	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD ALLOW_PLURAL}
6055	,{jjELIMIN_HILB, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD, INTVEC_CMD NO_PLURAL}
6056	,{jjELIMIN_HILB, ELIMINATION_CMD,MODUL_CMD, MODUL_CMD, POLY_CMD, INTVEC_CMD NO_PLURAL}
6057	,{jjFIND3, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD, INT_CMD ALLOW_PLURAL}
6058	,{jjFWALK3, FWALK_CMD, IDEAL_CMD, RING_CMD, DEF_CMD, INT_CMD NO_PLURAL}
6059	,{jjHILBERT3, HILBERT_CMD,INTVEC_CMD, IDEAL_CMD, INT_CMD, INTVEC_CMD NO_PLURAL}
6060	,{jjHILBERT3, HILBERT_CMD,INTVEC_CMD, MODUL_CMD, INT_CMD, INTVEC_CMD NO_PLURAL}
6061	,{jjCALL3MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6062	,{lInsert3, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD, INT_CMD ALLOW_PLURAL}
6063	//,{jjCALL3MANY, INTERSECT_CMD, NONE, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6064	,{jjINTMAT3, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6065	,{jjCALL3MANY, INTVEC_CMD, INTVEC_CMD, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6066	,{jjJET_P_IV, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6067	,{jjJET_ID_IV, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6068	,{jjJET_P_IV, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6069	,{jjJET_ID_IV, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD, INTVEC_CMD ALLOW_PLURAL}
6070	,{jjJET_P_P, JET_CMD, POLY_CMD, POLY_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
6071	,{jjJET_P_P, JET_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
6072	,{jjJET_ID_M, JET_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD, INT_CMD ALLOW_PLURAL}
6073	,{jjJET_ID_M, JET_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD, INT_CMD ALLOW_PLURAL}
6074	,{jjWRONG3, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6075	,{mpKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD, IDEAL_CMD NO_PLURAL}
6076	,{jjCALL3MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6077	,{jjMATRIX_Id, MATRIX_CMD, MATRIX_CMD, IDEAL_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6078	,{jjMATRIX_Mo, MATRIX_CMD, MATRIX_CMD, MODUL_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6079	,{jjMATRIX_Ma, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6080	,{jjMINOR3, MINOR_CMD, IDEAL_CMD, MATRIX_CMD, INT_CMD, IDEAL_CMD NO_PLURAL}
6081	,{jjCALL3MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6082	#ifdef OLD_RES
6083	,{jjRES3, MRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE ALLOW_PLURAL}
6084	,{jjRES3, MRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE ALLOW_PLURAL}
6085	#endif
6086	,{jjLIFT3, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD ALLOW_PLURAL}
6087	,{jjLIFT3, LIFT_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD ALLOW_PLURAL}
6088	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, RING_CMD, ANY_TYPE, ANY_TYPE ALLOW_PLURAL}
6089	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, QRING_CMD, ANY_TYPE, ANY_TYPE ALLOW_PLURAL}
6090	,{jjRANDOM_Im, RANDOM_CMD, INTMAT_CMD, INT_CMD, INT_CMD, INT_CMD ALLOW_PLURAL}
6091	,{jjREDUCE3_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
6092	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
6093	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
6094	,{jjREDUCE3_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
6095	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD, INT_CMD ALLOW_PLURAL}
6096	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD ALLOW_PLURAL}
6097	,{jjREDUCE3_CP, REDUCE_CMD, POLY_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD ALLOW_PLURAL}
6098	,{jjREDUCE3_CP, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, MODUL_CMD ALLOW_PLURAL}
6099	,{jjREDUCE3_CID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD ALLOW_PLURAL}
6100	,{jjREDUCE3_CID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD ALLOW_PLURAL}
6101	#ifdef OLD_RES
6102	,{jjRES3, RES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE ALLOW_PLURAL}
6103	,{jjRES3, RES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE ALLOW_PLURAL}
6104	#endif
6105	#ifdef HAVE_FACTORY
6106	,{jjRESULTANT, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
6107	#else
6108	,{jjWRONG3, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD NO_PLURAL}
6109	#endif
6110	,{jjRING3, RING_CMD, RING_CMD, DEF_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6111	#ifdef OLD_RES
6112	,{jjRES3, SRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE NO_PLURAL}
6113	,{jjRES3, SRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE NO_PLURAL}
6114	#endif
6115	,{jjSTATUS3, STATUS_CMD, INT_CMD, LINK_CMD, STRING_CMD, STRING_CMD ALLOW_PLURAL}
6116	,{jjSTD_HILB_W, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD, INTVEC_CMD NO_PLURAL}
6117	,{jjSTD_HILB_W, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD, INTVEC_CMD NO_PLURAL}
6118	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6119	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6120	,{jjSUBST_P, SUBST_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6121	,{jjSUBST_Id, SUBST_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6122	,{jjSUBST_Id, SUBST_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6123	,{jjSUBST_Id, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD ALLOW_PLURAL}
6124	,{jjSUBST_Id_I, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, INT_CMD ALLOW_PLURAL}
6125	,{jjSUBST_Id_N, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, NUMBER_CMD ALLOW_PLURAL}
6126	,{jjCALL3MANY, SYSTEM_CMD, NONE, STRING_CMD, DEF_CMD, DEF_CMD ALLOW_PLURAL}
6127	,{nuLagSolve, LAGSOLVE_CMD,LIST_CMD, POLY_CMD, INT_CMD, INT_CMD NO_PLURAL}
6128	,{nuVanderSys, VANDER_CMD, POLY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD NO_PLURAL}
6129	,{NULL, 0, 0, 0, 0, 0 NO_PLURAL}
6130	};
6131	/=================== operations with many arg.: static proc =================/
6132	static BOOLEAN jjBREAK0(leftv res, leftv v)
6133	{
6134	#ifdef HAVE_SDB
6135	sdb_show_bp();
6136	#endif
6137	return FALSE;
6138	}
6139	static BOOLEAN jjBREAK1(leftv res, leftv v)
6140	{
6141	#ifdef HAVE_SDB
6142	if(v->Typ()==PROC_CMD)
6143	{
6144	int lineno=0;
6145	if((v->next!=NULL) && (v->next->Typ()==INT_CMD))
6146	{
6147	lineno=(int)(long)v->next->Data();
6148	}
6149	return sdb_set_breakpoint(v->Name(),lineno);
6150	}
6151	return TRUE;
6152	#else
6153	return FALSE;
6154	#endif
6155	}
6156	static BOOLEAN jjCALL1ARG(leftv res, leftv v)
6157	{
6158	return iiExprArith1(res,v,iiOp);
6159	}
6160	static BOOLEAN jjCALL2ARG(leftv res, leftv u)
6161	{
6162	leftv v=u->next;
6163	u->next=NULL;
6164	BOOLEAN b=iiExprArith2(res,u,iiOp,v, (iiOp > 255));
6165	u->next=v;
6166	return b;
6167	}
6168	static BOOLEAN jjCALL3ARG(leftv res, leftv u)
6169	{
6170	leftv v = u->next;
6171	leftv w = v->next;
6172	u->next = NULL;
6173	v->next = NULL;
6174	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
6175	u->next = v;
6176	v->next = w;
6177	return b;
6178	}
6179
6180	static BOOLEAN jjCOEF_M(leftv res, leftv v)
6181	{
6182	if((v->Typ() != VECTOR_CMD)
6183	\|\| (v->next->Typ() != POLY_CMD)
6184	\|\| (v->next->next->Typ() != MATRIX_CMD)
6185	\|\| (v->next->next->next->Typ() != MATRIX_CMD))
6186	return TRUE;
6187	if (v->next->next->rtyp!=IDHDL) return TRUE;
6188	idhdl c=(idhdl)v->next->next->data;
6189	if (v->next->next->next->rtyp!=IDHDL) return TRUE;
6190	idhdl m=(idhdl)v->next->next->next->data;
6191	idDelete((ideal *)&(c->data.uideal));
6192	idDelete((ideal *)&(m->data.uideal));
6193	mpCoef2((poly)v->Data(),(poly)v->next->Data(),
6194	(matrix )&(c->data.umatrix),(matrix )&(m->data.umatrix));
6195	return FALSE;
6196	}
6197
6198	static BOOLEAN jjDIVISION4(leftv res, leftv v)
6199	{ // may have 3 or 4 arguments
6200	leftv v1=v;
6201	leftv v2=v1->next;
6202	leftv v3=v2->next;
6203	leftv v4=v3->next;
6204	assumeStdFlag(v2);
6205
6206	int i1=iiTestConvert(v1->Typ(),MODUL_CMD);
6207	int i2=iiTestConvert(v2->Typ(),MODUL_CMD);
6208
6209	if((i1==0)\|\|(i2==0)
6210	\|\|(v3->Typ()!=INT_CMD)\|\|((v4!=NULL)&&(v4->Typ()!=INTVEC_CMD)))
6211	{
6212	WarnS("<module>,<module>,<int>[,<intvec>] expected!");
6213	return TRUE;
6214	}
6215
6216	sleftv w1,w2;
6217	iiConvert(v1->Typ(),MODUL_CMD,i1,v1,&w1);
6218	iiConvert(v2->Typ(),MODUL_CMD,i2,v2,&w2);
6219	ideal P=(ideal)w1.Data();
6220	ideal Q=(ideal)w2.Data();
6221
6222	int n=(int)(long)v3->Data();
6223	short *w=NULL;
6224	if(v4!=NULL)
6225	{
6226	w=iv2array((intvec *)v4->Data());
6227	short *w0=w+1;
6228	int i=pVariables;
6229	while(i>0&&*w0>0)
6230	{
6231	w0++;
6232	i--;
6233	}
6234	if(i>0)
6235	WarnS("not all weights are positive!");
6236	}
6237
6238	matrix T;
6239	ideal R;
6240	idLiftW(P,Q,n,T,R,w);
6241
6242	w1.CleanUp();
6243	w2.CleanUp();
6244	if(w!=NULL)
6245	omFree(w);
6246
6247	lists L=(lists) omAllocBin(slists_bin);
6248	L->Init(2);
6249	L->m[1].rtyp=v1->Typ();
6250	if(v1->Typ()==POLY_CMD\|\|v1->Typ()==VECTOR_CMD)
6251	{
6252	if(v1->Typ()==POLY_CMD)
6253	pShift(&R->m[0],-1);
6254	L->m[1].data=(void *)R->m[0];
6255	R->m[0]=NULL;
6256	idDelete(&R);
6257	}
6258	else if(v1->Typ()==IDEAL_CMD\|\|v1->Typ()==MATRIX_CMD)
6259	L->m[1].data=(void *)idModule2Matrix(R);
6260	else
6261	{
6262	L->m[1].rtyp=MODUL_CMD;
6263	L->m[1].data=(void *)R;
6264	}
6265	L->m[0].rtyp=MATRIX_CMD;
6266	L->m[0].data=(char *)T;
6267
6268	res->data=L;
6269	res->rtyp=LIST_CMD;
6270
6271	return FALSE;
6272	}
6273
6274	//static BOOLEAN jjEXPORTTO_M(leftv res, leftv u)
6275	//{
6276	// int l=u->listLength();
6277	// if (l<2) return TRUE;
6278	// BOOLEAN b;
6279	// leftv v=u->next;
6280	// leftv zz=v;
6281	// leftv z=zz;
6282	// u->next=NULL;
6283	// do
6284	// {
6285	// leftv z=z->next;
6286	// b=iiExprArith2(res,u,iiOp,z, (iiOp > 255));
6287	// if (b) break;
6288	// } while (z!=NULL);
6289	// u->next=zz;
6290	// return b;
6291	//}
6292	static BOOLEAN jjIDEAL_PL(leftv res, leftv v)
6293	{
6294	int s=1;
6295	leftv h=v;
6296	if (h!=NULL) s=exprlist_length(h);
6297	ideal id=idInit(s,1);
6298	int rank=1;
6299	int i=0;
6300	poly p;
6301	while (h!=NULL)
6302	{
6303	switch(h->Typ())
6304	{
6305	case POLY_CMD:
6306	{
6307	p=(poly)h->CopyD(POLY_CMD);
6308	break;
6309	}
6310	case INT_CMD:
6311	{
6312	number n=nInit((int)(long)h->Data());
6313	if (!nIsZero(n))
6314	{
6315	p=pOne();
6316	pSetCoeff(p,n);
6317	}
6318	else
6319	{
6320	p=NULL;
6321	nDelete(&n);
6322	}
6323	break;
6324	}
6325	case BIGINT_CMD:
6326	{
6327	number b=(number)h->Data();
6328	number n=nInit_bigint(b);
6329	if (!nIsZero(n))
6330	{
6331	p=pOne();
6332	pSetCoeff(p,n);
6333	}
6334	else
6335	{
6336	p=NULL;
6337	nDelete(&n);
6338	}
6339	break;
6340	}
6341	case NUMBER_CMD:
6342	{
6343	number n=(number)h->CopyD(NUMBER_CMD);
6344	if (!nIsZero(n))
6345	{
6346	p=pOne();
6347	pSetCoeff(p,n);
6348	}
6349	else
6350	{
6351	p=NULL;
6352	nDelete(&n);
6353	}
6354	break;
6355	}
6356	case VECTOR_CMD:
6357	{
6358	p=(poly)h->CopyD(VECTOR_CMD);
6359	if (iiOp!=MODUL_CMD)
6360	{
6361	idDelete(&id);
6362	pDelete(&p);
6363	return TRUE;
6364	}
6365	rank=si_max(rank,(int)pMaxComp(p));
6366	break;
6367	}
6368	default:
6369	{
6370	idDelete(&id);
6371	return TRUE;
6372	}
6373	}
6374	if ((iiOp==MODUL_CMD)&&(p!=NULL)&&(pGetComp(p)==0))
6375	{
6376	pSetCompP(p,1);
6377	}
6378	id->m[i]=p;
6379	i++;
6380	h=h->next;
6381	}
6382	id->rank=rank;
6383	res->data=(char *)id;
6384	return FALSE;
6385	}
6386	static BOOLEAN jjINTERSECT_PL(leftv res, leftv v)
6387	{
6388	leftv h=v;
6389	int l=v->listLength();
6390	resolvente r=(resolvente)omAlloc0(l*sizeof(ideal));
6391	BOOLEAN copied=(BOOLEAN )omAlloc0(l*sizeof(BOOLEAN));
6392	int t=0;
6393	// try to convert to IDEAL_CMD
6394	while (h!=NULL)
6395	{
6396	if (iiTestConvert(h->Typ(),IDEAL_CMD)!=0)
6397	{
6398	t=IDEAL_CMD;
6399	}
6400	else break;
6401	h=h->next;
6402	}
6403	// if failure, try MODUL_CMD
6404	if (t==0)
6405	{
6406	h=v;
6407	while (h!=NULL)
6408	{
6409	if (iiTestConvert(h->Typ(),MODUL_CMD)!=0)
6410	{
6411	t=MODUL_CMD;
6412	}
6413	else break;
6414	h=h->next;
6415	}
6416	}
6417	// check for success in converting
6418	if (t==0)
6419	{
6420	WerrorS("cannot convert to ideal or module");
6421	return TRUE;
6422	}
6423	// call idMultSect
6424	h=v;
6425	int i=0;
6426	sleftv tmp;
6427	while (h!=NULL)
6428	{
6429	if (h->Typ()==t)
6430	{
6431	r[i]=(ideal)h->Data(); /no copy/
6432	h=h->next;
6433	}
6434	else if(iiConvert(h->Typ(),t,iiTestConvert(h->Typ(),t),h,&tmp))
6435	{
6436	omFreeSize((ADDRESS)copied,l*sizeof(BOOLEAN));
6437	omFreeSize((ADDRESS)r,l*sizeof(ideal));
6438	Werror("cannot convert arg. %d to %s",i+1,Tok2Cmdname(t));
6439	return TRUE;
6440	}
6441	else
6442	{
6443	r[i]=(ideal)tmp.Data(); /now it's a copy/
6444	copied[i]=TRUE;
6445	h=tmp.next;
6446	}
6447	i++;
6448	}
6449	res->rtyp=t;
6450	res->data=(char *)idMultSect(r,i);
6451	while(i>0)
6452	{
6453	i--;
6454	if (copied[i]) idDelete(&(r[i]));
6455	}
6456	omFreeSize((ADDRESS)copied,l*sizeof(BOOLEAN));
6457	omFreeSize((ADDRESS)r,l*sizeof(ideal));
6458	return FALSE;
6459	}
6460	static BOOLEAN jjINTVEC_PL(leftv res, leftv v)
6461	{
6462	int i=0;
6463	leftv h=v;
6464	if (h!=NULL) i=exprlist_length(h);
6465	intvec *iv=new intvec(i);
6466	i=0;
6467	while (h!=NULL)
6468	{
6469	if(h->Typ()==INT_CMD)
6470	{
6471	(*iv)[i]=(int)(long)h->Data();
6472	}
6473	else
6474	{
6475	delete iv;
6476	return TRUE;
6477	}
6478	i++;
6479	h=h->next;
6480	}
6481	res->data=(char *)iv;
6482	return FALSE;
6483	}
6484	static BOOLEAN jjJET4(leftv res, leftv u)
6485	{
6486	leftv u1=u;
6487	leftv u2=u1->next;
6488	leftv u3=u2->next;
6489	leftv u4=u3->next;
6490	if((u1->Typ()==POLY_CMD)&&(u2->Typ()==POLY_CMD)&&(u3->Typ()==INT_CMD)&&
6491	(u4->Typ()==INTVEC_CMD)\|\|
6492	(u1->Typ()==VECTOR_CMD)&&(u2->Typ()==POLY_CMD)&&(u3->Typ()==INT_CMD)&&
6493	(u4->Typ()==INTVEC_CMD))
6494	{
6495	if(!pIsUnit((poly)u2->Data()))
6496	{
6497	WerrorS("2nd argument must be a unit");
6498	return TRUE;
6499	}
6500	res->rtyp=u1->Typ();
6501	res->data=(char*)pSeries((int)(long)u3->Data(),pCopy((poly)u1->Data()),
6502	pCopy((poly)u2->Data()),(intvec*)u4->Data());
6503	return FALSE;
6504	}
6505	else
6506	if((u1->Typ()==IDEAL_CMD)&&(u2->Typ()==MATRIX_CMD)&&(u3->Typ()==INT_CMD)&&
6507	(u4->Typ()==INTVEC_CMD)\|\|
6508	(u1->Typ()==MODUL_CMD)&&(u2->Typ()==MATRIX_CMD)&&(u3->Typ()==INT_CMD)&&
6509	(u4->Typ()==INTVEC_CMD))
6510	{
6511	if(!mpIsDiagUnit((matrix)u2->Data()))
6512	{
6513	WerrorS("2nd argument must be a diagonal matrix of units");
6514	return TRUE;
6515	}
6516	res->rtyp=u1->Typ();
6517	res->data=(char*)idSeries((int)(long)u3->Data(),idCopy((ideal)u1->Data()),
6518	mpCopy((matrix)u2->Data()),(intvec*)u4->Data());
6519	return FALSE;
6520	}
6521	else
6522	{
6523	Werror("%s(`poly`,`poly`,`int`,`intvec`) exppected",
6524	Tok2Cmdname(iiOp));
6525	return TRUE;
6526	}
6527	}
6528	static BOOLEAN jjKLAMMER_PL(leftv res, leftv u)
6529	{
6530	if ((yyInRingConstruction)
6531	&& ((strcmp(u->Name(),"real")==0) \|\| (strcmp(u->Name(),"complex")==0)))
6532	{
6533	memcpy(res,u,sizeof(sleftv));
6534	memset(u,0,sizeof(sleftv));
6535	return FALSE;
6536	}
6537	leftv v=u->next;
6538	BOOLEAN b;
6539	if(v==NULL)
6540	b=iiExprArith1(res,u,iiOp);
6541	else
6542	{
6543	u->next=NULL;
6544	b=iiExprArith2(res,u,iiOp,v);
6545	u->next=v;
6546	}
6547	return b;
6548	}
6549	static BOOLEAN jjLIST_PL(leftv res, leftv v)
6550	{
6551	int sl=0;
6552	if (v!=NULL) sl = v->listLength();
6553	lists L;
6554	if((sl==1)&&(v->Typ()==RESOLUTION_CMD))
6555	{
6556	int add_row_shift = 0;
6557	intvec weights=(intvec)atGet(v,"isHomog",INTVEC_CMD);
6558	if (weights!=NULL) add_row_shift=weights->min_in();
6559	L=syConvRes((syStrategy)v->Data(),FALSE,add_row_shift);
6560	}
6561	else
6562	{
6563	L=(lists)omAllocBin(slists_bin);
6564	leftv h=NULL;
6565	int i;
6566	int rt;
6567
6568	L->Init(sl);
6569	for (i=0;i<sl;i++)
6570	{
6571	if (h!=NULL)
6572	{ /* e.g. not in the first step:
6573	* h is the pointer to the old sleftv,
6574	* v is the pointer to the next sleftv
6575	* (in this moment) */
6576	h->next=v;
6577	}
6578	h=v;
6579	v=v->next;
6580	h->next=NULL;
6581	rt=h->Typ();
6582	if (rt==0)
6583	{
6584	L->Clean();
6585	Werror("`%s` is undefined",h->Fullname());
6586	return TRUE;
6587	}
6588	if ((rt==RING_CMD)\|\|(rt==QRING_CMD))
6589	{
6590	L->m[i].rtyp=rt; L->m[i].data=h->Data();
6591	((ring)L->m[i].data)->ref++;
6592	}
6593	else
6594	L->m[i].Copy(h);
6595	}
6596	}
6597	res->data=(char *)L;
6598	return FALSE;
6599	}
6600	static BOOLEAN jjNAMES0(leftv res, leftv v)
6601	{
6602	res->data=(void *)ipNameList(IDROOT);
6603	return FALSE;
6604	}
6605	static BOOLEAN jjOPTION_PL(leftv res, leftv v)
6606	{
6607	if(v==NULL)
6608	{
6609	res->data=(char *)showOption();
6610	return FALSE;
6611	}
6612	res->rtyp=NONE;
6613	return setOption(res,v);
6614	}
6615	static BOOLEAN jjREDUCE4(leftv res, leftv u)
6616	{
6617	leftv u1=u;
6618	leftv u2=u1->next;
6619	leftv u3=u2->next;
6620	leftv u4=u3->next;
6621	if((u3->Typ()==INT_CMD)&&(u4->Typ()==INTVEC_CMD))
6622	{
6623	int save_d=Kstd1_deg;
6624	Kstd1_deg=(int)(long)u3->Data();
6625	kModW=(intvec *)u4->Data();
6626	BITSET save=verbose;
6627	verbose\|=Sy_bit(V_DEG_STOP);
6628	u2->next=NULL;
6629	BOOLEAN r=jjCALL2ARG(res,u);
6630	kModW=NULL;
6631	Kstd1_deg=save_d;
6632	verbose=save;
6633	u->next->next=u3;
6634	return r;
6635	}
6636	else
6637	if((u1->Typ()==IDEAL_CMD)&&(u2->Typ()==MATRIX_CMD)&&(u3->Typ()==IDEAL_CMD)&&
6638	(u4->Typ()==INT_CMD))
6639	{
6640	assumeStdFlag(u3);
6641	if(!mpIsDiagUnit((matrix)u2->Data()))
6642	{
6643	WerrorS("2nd argument must be a diagonal matrix of units");
6644	return TRUE;
6645	}
6646	res->rtyp=IDEAL_CMD;
6647	res->data=(char*)redNF(idCopy((ideal)u3->Data()),idCopy((ideal)u1->Data()),
6648	mpCopy((matrix)u2->Data()),(int)(long)u4->Data());
6649	return FALSE;
6650	}
6651	else
6652	if((u1->Typ()==POLY_CMD)&&(u2->Typ()==POLY_CMD)&&(u3->Typ()==IDEAL_CMD)&&
6653	(u4->Typ()==INT_CMD))
6654	{
6655	assumeStdFlag(u3);
6656	if(!pIsUnit((poly)u2->Data()))
6657	{
6658	WerrorS("2nd argument must be a unit");
6659	return TRUE;
6660	}
6661	res->rtyp=POLY_CMD;
6662	res->data=(char*)redNF(idCopy((ideal)u3->Data()),pCopy((poly)u1->Data()),
6663	pCopy((poly)u2->Data()),(int)(long)u4->Data());
6664	return FALSE;
6665	}
6666	else
6667	{
6668	Werror("%s(`poly`,`ideal`,`int`,`intvec`) expected",Tok2Cmdname(iiOp));
6669	return TRUE;
6670	}
6671	}
6672	static BOOLEAN jjREDUCE5(leftv res, leftv u)
6673	{
6674	leftv u1=u;
6675	leftv u2=u1->next;
6676	leftv u3=u2->next;
6677	leftv u4=u3->next;
6678	leftv u5=u4->next;
6679	if((u1->Typ()==IDEAL_CMD)&&(u2->Typ()==MATRIX_CMD)&&(u3->Typ()==IDEAL_CMD)&&
6680	(u4->Typ()==INT_CMD)&&(u5->Typ()==INTVEC_CMD))
6681	{
6682	assumeStdFlag(u3);
6683	if(!mpIsDiagUnit((matrix)u2->Data()))
6684	{
6685	WerrorS("2nd argument must be a diagonal matrix of units");
6686	return TRUE;
6687	}
6688	res->rtyp=IDEAL_CMD;
6689	res->data=(char*)redNF(idCopy((ideal)u3->Data()),idCopy((ideal)u1->Data()),
6690	mpCopy((matrix)u2->Data()),
6691	(int)(long)u4->Data(),(intvec*)u5->Data());
6692	return FALSE;
6693	}
6694	else
6695	if((u1->Typ()==POLY_CMD)&&(u2->Typ()==POLY_CMD)&&(u3->Typ()==IDEAL_CMD)&&
6696	(u4->Typ()==INT_CMD)&&(u5->Typ()==INTVEC_CMD))
6697	{
6698	assumeStdFlag(u3);
6699	if(!pIsUnit((poly)u2->Data()))
6700	{
6701	WerrorS("2nd argument must be a unit");
6702	return TRUE;
6703	}
6704	res->rtyp=POLY_CMD;
6705	res->data=(char*)redNF(idCopy((ideal)u3->Data()),pCopy((poly)u1->Data()),
6706	pCopy((poly)u2->Data()),
6707	(int)(long)u4->Data(),(intvec*)u5->Data());
6708	return FALSE;
6709	}
6710	else
6711	{
6712	Werror("%s(`ideal`,`ideal`,`matrix`,`int`,`intvec`) exppected",
6713	Tok2Cmdname(iiOp));
6714	return TRUE;
6715	}
6716	}
6717	static BOOLEAN jjRESERVED0(leftv res, leftv v)
6718	{
6719	int i=1;
6720	int nCount = (sArithBase.nCmdUsed-1)/3;
6721	if((3*nCount)<sArithBase.nCmdUsed) nCount++;
6722	//Print("CMDS: %d/%d\n", sArithBase.nCmdUsed,
6723	// sArithBase.nCmdAllocated);
6724	for(i=0; i<nCount; i++)
6725	{
6726	Print("%-20s",sArithBase.sCmds[i+1].name);
6727	if(i+1+nCount<sArithBase.nCmdUsed)
6728	Print("%-20s",sArithBase.sCmds[i+1+nCount].name);
6729	if(i+1+2*nCount<sArithBase.nCmdUsed)
6730	Print("%-20s",sArithBase.sCmds[i+1+2*nCount].name);
6731	//if ((i%3)==1) PrintLn();
6732	PrintLn();
6733	}
6734	PrintLn();
6735	return FALSE;
6736	}
6737	static BOOLEAN jjSTRING_PL(leftv res, leftv v)
6738	{
6739	if (v == NULL)
6740	{
6741	res->data = omStrDup("");
6742	return FALSE;
6743	}
6744	int n = v->listLength();
6745	if (n == 1)
6746	{
6747	res->data = v->String();
6748	return FALSE;
6749	}
6750
6751	char slist = (char) omAlloc(nsizeof(char));
6752	int i, j;
6753
6754	for (i=0, j=0; i<n; i++, v = v ->next)
6755	{
6756	slist[i] = v->String();
6757	assume(slist[i] != NULL);
6758	j+=strlen(slist[i]);
6759	}
6760	char* s = (char) omAlloc((j+1)sizeof(char));
6761	*s='\0';
6762	for (i=0;i<n;i++)
6763	{
6764	strcat(s, slist[i]);
6765	omFree(slist[i]);
6766	}
6767	omFreeSize(slist, nsizeof(char));
6768	res->data = s;
6769	return FALSE;
6770	}
6771	static BOOLEAN jjTEST(leftv res, leftv v)
6772	{
6773	do
6774	{
6775	if (v->Typ()!=INT_CMD)
6776	return TRUE;
6777	test_cmd((int)(long)v->Data());
6778	v=v->next;
6779	}
6780	while (v!=NULL);
6781	return FALSE;
6782	}
6783
6784	#if defined(__alpha) && !defined(linux)
6785	extern "C"
6786	{
6787	void usleep(unsigned long usec);
6788	};
6789	#endif
6790
6791	static BOOLEAN jjSTATUS_M(leftv res, leftv v)
6792	{
6793	if ((v->Typ() != LINK_CMD) \|\|
6794	(v->next->Typ() != STRING_CMD) \|\|
6795	(v->next->next->Typ() != STRING_CMD) \|\|
6796	(v->next->next->next->Typ() != INT_CMD))
6797	return TRUE;
6798	jjSTATUS3(res, v, v->next, v->next->next);
6799	#if defined(HAVE_USLEEP)
6800	if (((long) res->data) == 0L)
6801	{
6802	int i_s = (int)(long) v->next->next->next->Data();
6803	if (i_s > 0)
6804	{
6805	usleep((int)(long) v->next->next->next->Data());
6806	jjSTATUS3(res, v, v->next, v->next->next);
6807	}
6808	}
6809	#elif defined(HAVE_SLEEP)
6810	if (((int) res->data) == 0)
6811	{
6812	int i_s = (int) v->next->next->next->Data();
6813	if (i_s > 0)
6814	{
6815	sleep((is - 1)/1000000 + 1);
6816	jjSTATUS3(res, v, v->next, v->next->next);
6817	}
6818	}
6819	#endif
6820	return FALSE;
6821	}
6822	static BOOLEAN jjSUBST_M(leftv res, leftv u)
6823	{
6824	leftv v = u->next; // number of args > 0
6825	if (v==NULL) return TRUE;
6826	leftv w = v->next;
6827	if (w==NULL) return TRUE;
6828	leftv rest = w->next;;
6829
6830	u->next = NULL;
6831	v->next = NULL;
6832	w->next = NULL;
6833	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
6834	if ((rest!=NULL) && (!b))
6835	{
6836	sleftv tmp_res;
6837	leftv tmp_next=res->next;
6838	res->next=rest;
6839	memset(&tmp_res,0,sizeof(tmp_res));
6840	b = iiExprArithM(&tmp_res,res,iiOp);
6841	memcpy(res,&tmp_res,sizeof(tmp_res));
6842	res->next=tmp_next;
6843	}
6844	u->next = v;
6845	v->next = w;
6846	// rest was w->next, but is already cleaned
6847	return b;
6848	}
6849
6850	/=================== operations with many arg.: table =================/
6851	/* number_of_args: -1: any, -2: any >0, .. */
6852	struct sValCmdM dArithM[]=
6853	{
6854	// operations:
6855	// proc cmd res number_of_args plural
6856	{jjKLAMMER_PL, '(', ANY_TYPE, -2 ALLOW_PLURAL}
6857	,{jjBREAK0, BREAKPOINT_CMD, NONE, 0 ALLOW_PLURAL}
6858	,{jjBREAK1, BREAKPOINT_CMD, NONE, -2 ALLOW_PLURAL}
6859	,{jjCALL2ARG, COEF_CMD, MATRIX_CMD, 2 ALLOW_PLURAL}
6860	,{jjCOEF_M, COEF_CMD, NONE, 4 ALLOW_PLURAL}
6861	,{jjCALL2ARG, DIVISION_CMD, ANY_TYPE/or set by p/,2 ALLOW_PLURAL}
6862	,{jjDIVISION4, DIVISION_CMD, ANY_TYPE/or set by p/,3 NO_PLURAL}
6863	,{jjDIVISION4, DIVISION_CMD, ANY_TYPE/or set by p/,4 NO_PLURAL}
6864	,{jjDBPRINT, DBPRINT_CMD, NONE, -2 ALLOW_PLURAL}
6865	//,{jjEXPORTTO_M, EXPORTTO_CMD, NONE, -2 ALLOW_PLURAL}
6866	,{jjCALL1ARG, IDEAL_CMD, IDEAL_CMD, 1 ALLOW_PLURAL}
6867	,{jjIDEAL_PL, IDEAL_CMD, IDEAL_CMD, -1 ALLOW_PLURAL}
6868	,{jjCALL2ARG, INTERSECT_CMD, IDEAL_CMD, 2 ALLOW_PLURAL}
6869	,{jjINTERSECT_PL,INTERSECT_CMD, IDEAL_CMD, -2 ALLOW_PLURAL}
6870	,{jjCALL1ARG, INTVEC_CMD, INTVEC_CMD, 1 ALLOW_PLURAL}
6871	,{jjINTVEC_PL, INTVEC_CMD, INTVEC_CMD, -2 ALLOW_PLURAL}
6872	,{jjCALL2ARG, JET_CMD, POLY_CMD,/or set by p/ 2 ALLOW_PLURAL}
6873	,{jjCALL3ARG, JET_CMD, POLY_CMD,/or set by p/ 3 ALLOW_PLURAL}
6874	,{jjJET4, JET_CMD, POLY_CMD,/or set by p/ 4 ALLOW_PLURAL}
6875	,{jjLIST_PL, LIST_CMD, LIST_CMD, -1 ALLOW_PLURAL}
6876	,{jjCALL1ARG, MODUL_CMD, MODUL_CMD, 1 ALLOW_PLURAL}
6877	,{jjIDEAL_PL, MODUL_CMD, MODUL_CMD, -1 ALLOW_PLURAL}
6878	,{jjCALL1ARG, NAMES_CMD, LIST_CMD, 1 ALLOW_PLURAL}
6879	,{jjNAMES0, NAMES_CMD, LIST_CMD, 0 ALLOW_PLURAL}
6880	,{jjOPTION_PL, OPTION_CMD, STRING_CMD/or set by p/,-1 ALLOW_PLURAL}
6881	,{jjCALL2ARG, REDUCE_CMD, IDEAL_CMD/or set by p/, 2 ALLOW_PLURAL}
6882	,{jjCALL3ARG, REDUCE_CMD, IDEAL_CMD/or set by p/, 3 ALLOW_PLURAL}
6883	,{jjREDUCE4, REDUCE_CMD, IDEAL_CMD/or set by p/, 4 ALLOW_PLURAL}
6884	,{jjREDUCE5, REDUCE_CMD, IDEAL_CMD/or set by p/, 5 ALLOW_PLURAL}
6885	,{jjCALL1ARG, RESERVEDNAME_CMD, INT_CMD, 1 ALLOW_PLURAL}
6886	,{jjRESERVED0, RESERVEDNAME_CMD, NONE, 0 ALLOW_PLURAL}
6887	,{jjSTRING_PL, STRING_CMD, STRING_CMD, -1 ALLOW_PLURAL}
6888	,{jjCALL3ARG, SUBST_CMD, NONE/set by p/, 3 ALLOW_PLURAL}
6889	,{jjSUBST_M, SUBST_CMD, NONE/set by p/, -2 ALLOW_PLURAL}
6890	,{jjSYSTEM, SYSTEM_CMD, NONE/or set by p/,-2 ALLOW_PLURAL}
6891	,{jjTEST, TEST_CMD, NONE, -2 ALLOW_PLURAL}
6892	,{iiWRITE, WRITE_CMD, NONE, -2 ALLOW_PLURAL}
6893	,{jjCALL2ARG, STATUS_CMD, STRING_CMD, 2 ALLOW_PLURAL}
6894	,{jjCALL3ARG, STATUS_CMD, INT_CMD, 3 ALLOW_PLURAL}
6895	,{jjSTATUS_M, STATUS_CMD, INT_CMD, 4 ALLOW_PLURAL}
6896	,{loSimplex, SIMPLEX_CMD, LIST_CMD, 6 NO_PLURAL}
6897	,{nuUResSolve, URSOLVE_CMD, LIST_CMD, 4 NO_PLURAL}
6898	,{NULL, 0, 0, 0 NO_PLURAL}
6899	};
6900	#ifdef MDEBUG
6901	static Subexpr jjDBMakeSub(leftv e,const char *f,const int l)
6902	#else
6903	static Subexpr jjMakeSub(leftv e)
6904	#endif
6905	{
6906	assume( e->Typ()==INT_CMD );
6907	Subexpr r=(Subexpr)omAlloc0Bin(sSubexpr_bin);
6908	r->start =(int)(long)e->Data();
6909	return r;
6910	}
6911
6912	/================ generating tables ============================/
6913	#ifdef GENTABLE
6914	extern struct sValAssign dAssign[];
6915	struct sValCmdTab dArithTab1[]={ {0,0}};
6916	#define JJTAB1LEN 0
6917	struct sValCmdTab dArithTab2[]={ {0,0}};
6918	#define JJTAB2LEN 0
6919	void ttGen1()
6920	{
6921	FILE *outfile = myfopen("iparith.inc","w");
6922	int i,j,l1=0,l2=0;
6923	currRing=(ring)omAllocBin(sip_sring_bin);
6924	fprintf(outfile,
6925	"/****************************************\n"
6926	"* Computer Algebra System SINGULAR *\n"
6927	"****************************************/\n\n");
6928	/-------------------------------------------------------------------/
6929	fprintf(outfile,"// syntax table for Singular\n//\n");
6930	fprintf(outfile,"// - search for an exact match of the argument types\n");
6931	fprintf(outfile,"// - otherwise search for the first possibility\n");
6932	fprintf(outfile,"// with converted types of the arguments\n");
6933	fprintf(outfile,"// - otherwise report an error\n//\n");
6934
6935	int op;
6936	i=0;
6937	while ((op=dArith1[i].cmd)!=0)
6938	{
6939	if (dArith1[i].p==jjWRONG)
6940	fprintf(outfile,"// DUMMY ");
6941	const char *s = iiTwoOps(op);
6942	fprintf(outfile,"// operation: %s (%s) -> %s\n",
6943	s,
6944	Tok2Cmdname(dArith1[i].arg),
6945	Tok2Cmdname(ABS(dArith1[i].res)));
6946	i++;
6947	}
6948	fprintf(outfile,"/---------------------------------------------/\n");
6949	i=0;
6950	while ((op=dArith2[i].cmd)!=0)
6951	{
6952	if (dArith2[i].p==jjWRONG2)
6953	fprintf(outfile,"// DUMMY ");
6954	const char *s = iiTwoOps(op);
6955	fprintf(outfile,"// operation: %s (%s, %s) -> %s\n",
6956	s,
6957	Tok2Cmdname(dArith2[i].arg1),
6958	Tok2Cmdname(dArith2[i].arg2),
6959	Tok2Cmdname(dArith2[i].res));
6960	i++;
6961	}
6962	fprintf(outfile,"/---------------------------------------------/\n");
6963	i=0;
6964	while ((op=dArith3[i].cmd)!=0)
6965	{
6966	const char *s = iiTwoOps(op);
6967	if (dArith3[i].p==jjWRONG3)
6968	fprintf(outfile,"// DUMMY ");
6969	fprintf(outfile,"// operation: %s (%s, %s, %s) -> %s\n",
6970	s,
6971	Tok2Cmdname(dArith3[i].arg1),
6972	Tok2Cmdname(dArith3[i].arg2),
6973	Tok2Cmdname(dArith3[i].arg3),
6974	Tok2Cmdname(dArith3[i].res));
6975	i++;
6976	}
6977	fprintf(outfile,"/---------------------------------------------/\n");
6978	i=0;
6979	while ((op=dArithM[i].cmd)!=0)
6980	{
6981	const char *s = iiTwoOps(op);
6982	fprintf(outfile,"// operation: %s (...) -> %s",
6983	s,
6984	Tok2Cmdname(dArithM[i].res));
6985	switch(dArithM[i].number_of_args)
6986	{
6987	case -2:
6988	fprintf(outfile," ( number of arguments >0 )\n");
6989	break;
6990	case -1:
6991	fprintf(outfile," ( any number of arguments )\n");
6992	break;
6993	default:
6994	fprintf(outfile," ( %d arguments )\n",dArithM[i].number_of_args);
6995	break;
6996	}
6997	i++;
6998	}
6999	fprintf(outfile,"/---------------------------------------------/\n");
7000	i=0;
7001	while ((op=dAssign[i].res)!=0)
7002	{
7003	fprintf(outfile,"// assign: %s = %s\n",
7004	Tok2Cmdname(op/dAssign[i].res/),
7005	Tok2Cmdname(dAssign[i].arg));
7006	i++;
7007	}
7008	/-------------------------------------------------------------------/
7009	fprintf(outfile,"/---------------------------------------------/\n");
7010	for (j=257;j<=MAX_TOK+1;j++)
7011	{
7012	for(i=257;i<=MAX_TOK+1;i++)
7013	{
7014	if ((i!=j) && (j!=IDHDL) && (j!=DEF_CMD) && (j!=ANY_TYPE)
7015	&& iiTestConvert(i,j))
7016	{
7017	fprintf(outfile,"// convert %s -> %s\n",
7018	Tok2Cmdname(i), Tok2Cmdname(j));
7019	if (j==ANY_TYPE) break;
7020	}
7021	}
7022	}
7023	fprintf(outfile,"/---------------------------------------------/\n");
7024	char ops[]="=><+*/[.^,%(;";
7025	for(i=0;ops[i]!='\0';i++)
7026	fprintf(outfile,"// token %d : %c\n", (int)ops[i], ops[i]);
7027	for (i=257;i<=MAX_TOK;i++)
7028	{
7029	const char *s=iiTwoOps(i);
7030	if (s[0]!='$')
7031	{
7032	fprintf(outfile,"// token %d : %s\n", i, s);
7033	}
7034	}
7035	/-------------------------------------------------------------------/
7036	fprintf(outfile,"/--max. token: %d, gr: %d --/\n",MAX_TOK,UMINUS);
7037	/-------------------------------------------------------------------/
7038	fprintf(outfile,"/---------------------------------------------/\n");
7039	fprintf(outfile,
7040	"struct sValCmdTab dArithTab1[]=\n"
7041	"{\n");
7042	for (j=1;j<=MAX_TOK+1;j++)
7043	{
7044	for(i=0;dArith1[i].cmd!=0;i++)
7045	{
7046	if (dArith1[i].cmd==j)
7047	{
7048	fprintf(outfile," { %d,%d },\n",j,i);
7049	l1++;
7050	break;
7051	}
7052	}
7053	}
7054	fprintf(outfile," { 10000,0 }\n};\n");
7055	fprintf(outfile,"#define JJTAB1LEN %d\n",l1);
7056	/-------------------------------------------------------------------/
7057	fprintf(outfile,
7058	"struct sValCmdTab dArithTab2[]=\n"
7059	"{\n");
7060	for (j=1;j<=MAX_TOK+1;j++)
7061	{
7062	for(i=0;dArith2[i].cmd!=0;i++)
7063	{
7064	if (dArith2[i].cmd==j)
7065	{
7066	fprintf(outfile," { %d,%d },\n",j,i);
7067	l2++;
7068	break;
7069	}
7070	}
7071	}
7072	fprintf(outfile," { 10000,0 }\n};\n");
7073	fprintf(outfile,"#define JJTAB2LEN %d\n",l2);
7074	fclose(outfile);
7075	}
7076	/-------------------------------------------------------------------/
7077	#if 0
7078	void ttGen2()
7079	{
7080	FILE *outfile = myfopen("iparith.inc","a");
7081	fprintf(outfile,
7082	"/****************************************\n"
7083	"* Computer Algebra System SINGULAR *\n"
7084	"****************************************/\n\n");
7085	/-------------------------------------------------------------------/
7086	fprintf(outfile,"// identifier table for Singular\n//\n");
7087
7088	fprintf(outfile,
7089	"cmdnames OLDcmds[] =\n"
7090	"{ // name-string alias tokval toktype\n"
7091	"{ \"$INVALID$\", 0, -1, 0},\n");
7092	int i=1;
7093	int m=-1;
7094	int id_nr=0;
7095	BOOLEAN f=FALSE;
7096	loop
7097	{
7098	while (cmds[i].tokval!=0)
7099	{
7100	if ((cmds[i].tokval!=-1)&&(cmds[i].name!=NULL))
7101	{
7102	if(m==-1)
7103	{
7104	m=i;
7105	f=TRUE;
7106	}
7107	else if(strcmp(cmds[m].name,cmds[i].name)>0)
7108	{
7109	m=i;
7110	f=TRUE;
7111	}
7112	}
7113	i++;
7114	}
7115	if(f)
7116	{
7117	id_nr++;
7118	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#ifdef HAVE_RTIMER\n");
7119	fprintf(outfile," {\"%s\", %*d, %3d, ",cmds[m].name,
7120	20-strlen(cmds[m].name),
7121	cmds[m].alias,
7122	cmds[m].tokval);
7123	switch(cmds[m].toktype)
7124	{
7125	case CMD_1: fprintf(outfile,"CMD_1 },\n"); break;
7126	case CMD_2: fprintf(outfile,"CMD_2 },\n"); break;
7127	case CMD_3: fprintf(outfile,"CMD_3 },\n"); break;
7128	case CMD_12: fprintf(outfile,"CMD_12 },\n"); break;
7129	case CMD_123 : fprintf(outfile,"CMD_123 },\n"); break;
7130	case CMD_23: fprintf(outfile,"CMD_23 },\n"); break;
7131	case CMD_M: fprintf(outfile,"CMD_M },\n"); break;
7132	case SYSVAR: fprintf(outfile,"SYSVAR },\n"); break;
7133	case ROOT_DECL: fprintf(outfile,"ROOT_DECL },\n"); break;
7134	case ROOT_DECL_LIST: fprintf(outfile,"ROOT_DECL_LIST },\n"); break;
7135	case RING_DECL: fprintf(outfile,"RING_DECL },\n"); break;
7136	case NONE: fprintf(outfile,"NONE },\n"); break;
7137	default: if((cmds[m].toktype>' ')
7138	&&(cmds[m].toktype<127))
7139	{
7140	fprintf(outfile,"'%c' },\n",cmds[m].toktype);
7141	}
7142	else
7143	{
7144	fprintf(outfile,"%d },\n",cmds[m].toktype);
7145	}
7146	break;
7147	}
7148	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#endif\n");
7149	cmds[m].name=NULL;
7150	m=-1;
7151	i=1;
7152	f=FALSE;
7153	}
7154	else break;
7155	}
7156	fprintf(outfile,
7157	"/* list of scanner identifiers/only for feread/reservedName */\n");
7158	f=FALSE;
7159	i=1;m=-1;
7160	loop
7161	{
7162	while (cmds[i].tokval!=0)
7163	{
7164	if (cmds[i].name!=NULL)
7165	{
7166	if(m==-1)
7167	{
7168	m=i;
7169	f=TRUE;
7170	}
7171	else if(strcmp(cmds[m].name,cmds[i].name)>0)
7172	{
7173	m=i;
7174	f=TRUE;
7175	}
7176	}
7177	i++;
7178	}
7179	if(f)
7180	{
7181	fprintf(outfile," {\"%s\", %*d, -1, 0 },\n",cmds[m].name,
7182	20-strlen(cmds[m].name),
7183	0/cmds[m].alias/
7184	/-1 cmds[m].tokval/
7185	/0 cmds[m].toktype/);
7186	cmds[m].name=NULL;
7187	m=-1;
7188	i=1;
7189	f=FALSE;
7190	}
7191	else break;
7192	}
7193	fprintf(outfile,
7194	"/* end of list marker */\n"
7195	" { NULL, 0, 0, 0}\n"
7196	"};\n"
7197	"#ifdef HAVE_RTIMER\n"
7198	"#define LAST_IDENTIFIER %d\n"
7199	"#else\n"
7200	"#define LAST_IDENTIFIER %d\n"
7201	"#endif\n",id_nr,id_nr-1);
7202	fclose(outfile);
7203	}
7204	#endif
7205	/---------------------------------------------------------------------/
7206	/**
7207	* @brief generate cmds initialisation
7208	**/
7209	/---------------------------------------------------------------------/
7210
7211	void ttGen2b()
7212	{
7213	int cmd_size = (sizeof(cmds)/sizeof(cmdnames))-1;
7214
7215	FILE *outfile = myfopen("iparith.inc","a");
7216	fprintf(outfile,
7217	"/****************************************\n"
7218	"* Computer Algebra System SINGULAR *\n"
7219	"****************************************/\n\n");
7220	/-------------------------------------------------------------------/
7221	fprintf(outfile,"// identifier table for Singular\n//\n");
7222
7223	fprintf(
7224	outfile,
7225	"#ifdef MODULE_GENERATOR\n"
7226	"#define omAlloc0(A) malloc(A)\n"
7227	"#endif\n"
7228	"void iiInitCmdName()\n{\n"
7229	" sArithBase.nCmdUsed = 0;\n"
7230	" sArithBase.nCmdAllocated = %d;\n"
7231	" sArithBase.sCmds = (cmdnames)omAlloc0(sArithBase.nCmdAllocatedsizeof(cmdnames));\n"
7232	"\n"
7233	" // name-string alias tokval toktype index\n",
7234	cmd_size);
7235	int m=0;
7236	int id_nr=0;
7237
7238	qsort(&cmds, cmd_size, sizeof(cmdnames), (&_gentable_sort_cmds));
7239
7240	for(m=0; m<cmd_size; m++)
7241	{
7242	if(cmds[m].tokval>0) id_nr++;
7243	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#ifdef HAVE_RTIMER\n");
7244	fprintf(outfile," iiArithAddCmd(\"%s\", %*d, %3d, ",cmds[m].name,
7245	20-strlen(cmds[m].name),
7246	cmds[m].alias,
7247	cmds[m].tokval);
7248	switch(cmds[m].toktype)
7249	{
7250	case CMD_1: fprintf(outfile,"CMD_1"); break;
7251	case CMD_2: fprintf(outfile,"CMD_2"); break;
7252	case CMD_3: fprintf(outfile,"CMD_3"); break;
7253	case CMD_12: fprintf(outfile,"CMD_12"); break;
7254	case CMD_123 : fprintf(outfile,"CMD_123"); break;
7255	case CMD_23: fprintf(outfile,"CMD_23"); break;
7256	case CMD_M: fprintf(outfile,"CMD_M"); break;
7257	case SYSVAR: fprintf(outfile,"SYSVAR"); break;
7258	case ROOT_DECL: fprintf(outfile,"ROOT_DECL"); break;
7259	case ROOT_DECL_LIST: fprintf(outfile,"ROOT_DECL_LIST"); break;
7260	case RING_DECL: fprintf(outfile,"RING_DECL"); break;
7261	case NONE: fprintf(outfile,"NONE"); break;
7262	default:
7263	if((cmds[m].toktype>' ') &&(cmds[m].toktype<127))
7264	{
7265	fprintf(outfile,"'%c'",cmds[m].toktype);
7266	}
7267	else
7268	{
7269	fprintf(outfile,"%d",cmds[m].toktype);
7270	}
7271	break;
7272	#if 0
7273	fprintf(outfile," iiArithAddCmd(\"%s\", %*d, -1, 0 );\n",
7274	cmds[m].name, 20-strlen(cmds[m].name),
7275	0/cmds[m].alias/
7276	/-1 cmds[m].tokval/
7277	/0 cmds[m].toktype/);
7278	#endif
7279	}
7280	fprintf(outfile,", %d);\n", m);
7281	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#endif\n");
7282	}
7283	fprintf(outfile, "/* end of list marker */\n");
7284	fprintf(outfile,
7285	"#ifdef HAVE_RTIMER\n"
7286	" sArithBase.nLastIdentifier = %d;\n"
7287	"#else /* HAVE_RTIMER */\n"
7288	" sArithBase.nLastIdentifier = %d;\n"
7289	"#endif /* HAVE_RTIMER */\n",
7290	id_nr,id_nr-1);
7291
7292
7293	fprintf(outfile,
7294	"}\n"
7295	"#ifdef HAVE_RTIMER\n"
7296	"#define LAST_IDENTIFIER %d\n"
7297	"#else\n"
7298	"#define LAST_IDENTIFIER %d\n"
7299	"#endif\n",id_nr,id_nr-1);
7300	fclose(outfile);
7301	}
7302	/-------------------------------------------------------------------/
7303	#if 0
7304	void ttGen3()
7305	{
7306	FILE *outfile = myfopen("mpsr_tok.inc","w");
7307	fprintf(outfile,
7308	"/****************************************\n"
7309	"* Computer Algebra System SINGULAR *\n"
7310	"****************************************/\n\n");
7311	/-------------------------------------------------------------------/
7312	fprintf(outfile,"// token table for Singular\n//\n");
7313
7314	fprintf(outfile,
7315	"short vtok[] =\n"
7316	"{\n");
7317	// operations with 1 arg: ===========================================
7318	int i=0;
7319	while (dArith1[i].cmd!=0)
7320	{
7321	if ((dArith1[i].p!=jjWRONG)
7322	&&((i==0)\|\|(dArith1[i].cmd!=dArith1[i-1].cmd)))
7323	{
7324	fprintf(outfile," %d,\n",dArith1[i].cmd);
7325	}
7326	i++;
7327	}
7328	// operations with 2 args: ===========================================
7329	i=0;
7330	while (dArith2[i].cmd!=0)
7331	{
7332	if ((dArith2[i].p!=jjWRONG2)
7333	&&((i==0)\|\|(dArith2[i].cmd!=dArith2[i-1].cmd)))
7334	{
7335	fprintf(outfile," %d,\n",dArith2[i].cmd);
7336	}
7337	i++;
7338	}
7339	// operations with 3 args: ===========================================
7340	i=0;
7341	while (dArith3[i].cmd!=0)
7342	{
7343	if (
7344	((i==0)\|\|(dArith3[i].cmd!=dArith3[i-1].cmd)))
7345	{
7346	fprintf(outfile," %d,\n",dArith3[i].cmd);
7347	}
7348	i++;
7349	}
7350	// operations with many args: ===========================================
7351	i=0;
7352	while (dArithM[i].cmd!=0)
7353	{
7354	if (
7355	((i==0)\|\|(dArithM[i].cmd!=dArithM[i-1].cmd)))
7356	{
7357	fprintf(outfile," %d,\n",dArithM[i].cmd);
7358	}
7359	i++;
7360	}
7361	// ====================================================================
7362	fprintf(outfile,
7363	"/* end of list marker */\n"
7364	" %d };\n",MAX_TOK);
7365	fclose(outfile);
7366	}
7367	#endif
7368	void ttGen4()
7369	{
7370	FILE *outfile = myfopen("plural_cmd.inc","w");
7371	int i;
7372	const char *old_s="";
7373	fprintf(outfile,
7374	"@c *****************************************\n"
7375	"@c * Computer Algebra System SINGULAR *\n"
7376	"@c *****************************************\n\n");
7377	/-------------------------------------------------------------------/
7378	fprintf(outfile,"@multicolumn .45 .45\n");
7379	int op;
7380	i=0;
7381	while ((op=dArith1[i].cmd)!=0)
7382	{
7383	if (dArith1[i].p!=jjWRONG)
7384	{
7385	const char *s = iiTwoOps(op);
7386	if ((s!=NULL) && (isalpha(s[0])) && (strcmp(s,old_s)!=0))
7387	{
7388	old_s=s;
7389	#ifdef HAVE_PLURAL
7390	switch (dArith1[i].valid_for_plural)
7391	{
7392	case NO_PLURAL_N:
7393	fprintf(outfile,"@item @ref{%s} @tab @code{---}\n",s);
7394	break;
7395	case ALLOW_PLURAL_N:
7396	fprintf(outfile,"@item @ref{%s} @tab @ref{%s (plural)}\n",s,s);
7397	break;
7398	case COMM_PLURAL_N:
7399	fprintf(outfile,"@item @ref{%s} @tab %s\n",s,s);
7400	break;
7401	}
7402	#endif
7403	}
7404	}
7405	i++;
7406	}
7407	fprintf(outfile,"@c ---------------------------------------------\n");
7408	i=0;
7409	while ((op=dArith2[i].cmd)!=0)
7410	{
7411	if (dArith2[i].p!=jjWRONG2)
7412	{
7413	const char *s = iiTwoOps(op);
7414	if ((s!=NULL) && (isalpha(s[0])) && (strcmp(s,old_s)!=0))
7415	{
7416	old_s=s;
7417	#ifdef HAVE_PLURAL
7418	switch (dArith2[i].valid_for_plural)
7419	{
7420	case NO_PLURAL_N:
7421	fprintf(outfile,"@item @ref{%s} @tab @code{---}\n",s);
7422	break;
7423	case ALLOW_PLURAL_N:
7424	fprintf(outfile,"@item @ref{%s} @tab @ref{%s (plural)}\n",s,s);
7425	break;
7426	case COMM_PLURAL_N:
7427	fprintf(outfile,"@item @ref{%s} @tab %s\n",s,s);
7428	break;
7429	}
7430	#endif
7431	}
7432	}
7433	i++;
7434	}
7435	fprintf(outfile,"@c ---------------------------------------------\n");
7436	i=0;
7437	while ((op=dArith3[i].cmd)!=0)
7438	{
7439	const char *s = iiTwoOps(op);
7440	if (dArith3[i].p!=jjWRONG3)
7441	{
7442	if ((s!=NULL) && (isalpha(s[0])) && (strcmp(s,old_s)!=0))
7443	{
7444	old_s=s;
7445	#ifdef HAVE_PLURAL
7446	switch (dArith3[i].valid_for_plural)
7447	{
7448	case NO_PLURAL_N:
7449	fprintf(outfile,"@item @ref{%s} @tab @code{---}\n",s);
7450	break;
7451	case ALLOW_PLURAL_N:
7452	fprintf(outfile,"@item @ref{%s} @tab @ref{%s (plural)}\n",s,s);
7453	break;
7454	case COMM_PLURAL_N:
7455	fprintf(outfile,"@item @ref{%s} @tab %s\n",s,s);
7456	break;
7457	}
7458	#endif
7459	}
7460	}
7461	i++;
7462	}
7463	fprintf(outfile,"@c ---------------------------------------------\n");
7464	i=0;
7465	while ((op=dArithM[i].cmd)!=0)
7466	{
7467	const char *s = iiTwoOps(op);
7468	if ((s!=NULL) && (isalpha(s[0])) && (strcmp(s,old_s)!=0))
7469	{
7470	old_s=s;
7471	#ifdef HAVE_PLURAL
7472	switch (dArithM[i].valid_for_plural)
7473	{
7474	case NO_PLURAL_N:
7475	fprintf(outfile,"@item @ref{%s} @tab @code{---}\n",s);
7476	break;
7477	case ALLOW_PLURAL_N:
7478	fprintf(outfile,"@item @ref{%s} @tab @ref{%s (plural)}\n",s,s);
7479	break;
7480	case COMM_PLURAL_N:
7481	fprintf(outfile,"@item @ref{%s} @tab %s\n",s,s);
7482	break;
7483	}
7484	#endif
7485	}
7486	i++;
7487	}
7488	fprintf(outfile,"@c ---------------------------------------------\n");
7489	fprintf(outfile,"@end table\n");
7490	fclose(outfile);
7491	}
7492	/-------------------------------------------------------------------/
7493	#else
7494	#include "iparith.inc"
7495	#endif
7496
7497	/=================== operations with 2 args. ============================/
7498
7499	BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
7500	{
7501	#ifndef GENTABLE
7502	memset(res,0,sizeof(sleftv));
7503	BOOLEAN call_failed=FALSE;
7504
7505	if (!errorreported)
7506	{
7507	#ifdef SIQ
7508	if (siq>0)
7509	{
7510	//Print("siq:%d\n",siq);
7511	command d=(command)omAlloc0Bin(ip_command_bin);
7512	memcpy(&d->arg1,a,sizeof(sleftv));
7513	//a->Init();
7514	memcpy(&d->arg2,b,sizeof(sleftv));
7515	//b->Init();
7516	d->argc=2;
7517	d->op=op;
7518	res->data=(char *)d;
7519	res->rtyp=COMMAND;
7520	return FALSE;
7521	}
7522	#endif
7523	int at=a->Typ();
7524	int bt=b->Typ();
7525	int i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
7526	int index=i;
7527
7528	iiOp=op;
7529	while (dArith2[i].cmd==op)
7530	{
7531	if ((at==dArith2[i].arg1)
7532	&& (bt==dArith2[i].arg2))
7533	{
7534	res->rtyp=dArith2[i].res;
7535	#ifdef HAVE_PLURAL
7536	if ((currRing!=NULL) && (rIsPluralRing(currRing)))
7537	{
7538	if (dArith2[i].valid_for_plural==0 /NO_PLURAL/)
7539	{
7540	WerrorS(ii_not_for_plural);
7541	break;
7542	}
7543	else if (dArith2[i].valid_for_plural==2 /* COMM_PLURAL */)
7544	{
7545	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
7546	}
7547	/* else ALLOW_PLURAL */
7548	}
7549	#endif
7550	if ((call_failed=dArith2[i].p(res,a,b)))
7551	{
7552	break;// leave loop, goto error handling
7553	}
7554	a->CleanUp();
7555	b->CleanUp();
7556	//Print("op: %d,result typ:%d\n",op,res->rtyp);
7557	return FALSE;
7558	}
7559	i++;
7560	}
7561	// implicite type conversion ----------------------------------------------
7562	if (dArith2[i].cmd!=op)
7563	{
7564	int ai,bi;
7565	leftv an = (leftv)omAlloc0Bin(sleftv_bin);
7566	leftv bn = (leftv)omAlloc0Bin(sleftv_bin);
7567	BOOLEAN failed=FALSE;
7568	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
7569	//Print("op: %c, type: %s %s\n",op,Tok2Cmdname(at),Tok2Cmdname(bt));
7570	while (dArith2[i].cmd==op)
7571	{
7572	//Print("test %s %s\n",Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
7573	if ((ai=iiTestConvert(at,dArith2[i].arg1))!=0)
7574	{
7575	if ((bi=iiTestConvert(bt,dArith2[i].arg2))!=0)
7576	{
7577	res->rtyp=dArith2[i].res;
7578	#ifdef HAVE_PLURAL
7579	if ((currRing!=NULL) && (rIsPluralRing(currRing)))
7580	{
7581	if (dArith2[i].valid_for_plural==0 /NO_PLURAL/)
7582	{
7583	WerrorS(ii_not_for_plural);
7584	break;
7585	}
7586	else if (dArith2[i].valid_for_plural==2 /* COMM_PLURAL */)
7587	{
7588	Warn("assume commutative subalgebra for cmd `%s`",
7589	Tok2Cmdname(i));
7590	}
7591	/* else ALLOW_PLURAL */
7592	}
7593	#endif
7594	failed= ((iiConvert(at,dArith2[i].arg1,ai,a,an))
7595	\|\| (iiConvert(bt,dArith2[i].arg2,bi,b,bn))
7596	\|\| (call_failed=dArith2[i].p(res,an,bn)));
7597	// everything done, clean up temp. variables
7598	if (failed)
7599	{
7600	// leave loop, goto error handling
7601	break;
7602	}
7603	else
7604	{
7605	// everything ok, clean up and return
7606	an->CleanUp();
7607	bn->CleanUp();
7608	omFreeBin((ADDRESS)an, sleftv_bin);
7609	omFreeBin((ADDRESS)bn, sleftv_bin);
7610	a->CleanUp();
7611	b->CleanUp();
7612	return FALSE;
7613	}
7614	}
7615	}
7616	i++;
7617	}
7618	an->CleanUp();
7619	bn->CleanUp();
7620	omFreeBin((ADDRESS)an, sleftv_bin);
7621	omFreeBin((ADDRESS)bn, sleftv_bin);
7622	}
7623	// error handling ---------------------------------------------------
7624	const char *s=NULL;
7625	if (!errorreported)
7626	{
7627	if ((at==0) && (a->Fullname()!=sNoName))
7628	{
7629	s=a->Fullname();
7630	}
7631	else if ((bt==0) && (b->Fullname()!=sNoName))
7632	{
7633	s=b->Fullname();
7634	}
7635	if (s!=NULL)
7636	Werror("`%s` is not defined",s);
7637	else
7638	{
7639	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
7640	s = iiTwoOps(op);
7641	if (proccall)
7642	{
7643	Werror("%s(`%s`,`%s`) failed"
7644	,s,Tok2Cmdname(at),Tok2Cmdname(bt));
7645	}
7646	else
7647	{
7648	Werror("`%s` %s `%s` failed"
7649	,Tok2Cmdname(at),s,Tok2Cmdname(bt));
7650	}
7651	if ((!call_failed) && BVERBOSE(V_SHOW_USE))
7652	{
7653	while (dArith2[i].cmd==op)
7654	{
7655	if(((at==dArith2[i].arg1)\|\|(bt==dArith2[i].arg2))
7656	&& (dArith2[i].res!=0)
7657	&& (dArith2[i].p!=jjWRONG2))
7658	{
7659	if (proccall)
7660	Werror("expected %s(`%s`,`%s`)"
7661	,s,Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
7662	else
7663	Werror("expected `%s` %s `%s`"
7664	,Tok2Cmdname(dArith2[i].arg1),s,Tok2Cmdname(dArith2[i].arg2));
7665	}
7666	i++;
7667	}
7668	}
7669	}
7670	}
7671	res->rtyp = UNKNOWN;
7672	}
7673	a->CleanUp();
7674	b->CleanUp();
7675	#endif
7676	return TRUE;
7677	}
7678
7679	/==================== operations with 1 arg. ===============================/
7680
7681	BOOLEAN iiExprArith1(leftv res, leftv a, int op)
7682	{
7683	#ifndef GENTABLE
7684	memset(res,0,sizeof(sleftv));
7685	BOOLEAN call_failed=FALSE;
7686
7687	if (!errorreported)
7688	{
7689	#ifdef SIQ
7690	if (siq>0)
7691	{
7692	//Print("siq:%d\n",siq);
7693	command d=(command)omAlloc0Bin(ip_command_bin);
7694	memcpy(&d->arg1,a,sizeof(sleftv));
7695	//a->Init();
7696	d->op=op;
7697	d->argc=1;
7698	res->data=(char *)d;
7699	res->rtyp=COMMAND;
7700	return FALSE;
7701	}
7702	#endif
7703	int at=a->Typ();
7704	BOOLEAN failed=FALSE;
7705
7706	iiOp=op;
7707	int i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
7708	int ti = i;
7709	while (dArith1[i].cmd==op)
7710	{
7711	if (at==dArith1[i].arg)
7712	{
7713	int r=res->rtyp=dArith1[i].res;
7714	#ifdef HAVE_PLURAL
7715	if ((currRing!=NULL) && (rIsPluralRing(currRing)))
7716	{
7717	if (dArith1[i].valid_for_plural==0 /NO_PLURAL/)
7718	{
7719	WerrorS(ii_not_for_plural);
7720	break;
7721	}
7722	else if (dArith1[i].valid_for_plural==2 /* COMM_PLURAL */)
7723	{
7724	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
7725	}
7726	/* else ALLOW_PLURAL */
7727	}
7728	#endif
7729	if (r<0)
7730	{
7731	res->rtyp=-r;
7732	#ifdef PROC_BUG
7733	dArith1[i].p(res,a);
7734	#else
7735	res->data=(char )((Proc1)dArith1[i].p)((char )a->Data());
7736	#endif
7737	}
7738	else if ((call_failed=dArith1[i].p(res,a)))
7739	{
7740	break;// leave loop, goto error handling
7741	}
7742	if (a->Next()!=NULL)
7743	{
7744	res->next=(leftv)omAllocBin(sleftv_bin);
7745	failed=iiExprArith1(res->next,a->next,op);
7746	}
7747	a->CleanUp();
7748	return failed;
7749	}
7750	i++;
7751	}
7752	// implicite type conversion --------------------------------------------
7753	if (dArith1[i].cmd!=op)
7754	{
7755	leftv an = (leftv)omAlloc0Bin(sleftv_bin);
7756	i=ti;
7757	//Print("fuer %c , typ: %s\n",op,Tok2Cmdname(at));
7758	while (dArith1[i].cmd==op)
7759	{
7760	int ai;
7761	//Print("test %s\n",Tok2Cmdname(dArith1[i].arg));
7762	if ((ai=iiTestConvert(at,dArith1[i].arg))!=0)
7763	{
7764	int r=res->rtyp=dArith1[i].res;
7765	#ifdef HAVE_PLURAL
7766	if ((currRing!=NULL) && (rIsPluralRing(currRing)))
7767	{
7768	if (dArith1[i].valid_for_plural==0 /NO_PLURAL/)
7769	{
7770	WerrorS(ii_not_for_plural);
7771	break;
7772	}
7773	else if (dArith1[i].valid_for_plural==2 /* COMM_PLURAL */)
7774	{
7775	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
7776	}
7777	/* else ALLOW_PLURAL */
7778	}
7779	#endif
7780	if (r<0)
7781	{
7782	res->rtyp=-r;
7783	failed= iiConvert(at,dArith1[i].arg,ai,a,an);
7784	if (!failed)
7785	{
7786	#ifdef PROC_BUG
7787	dArith1[i].p(res,a);
7788	#else
7789	res->data=(char )((Proc1)dArith1[i].p)((char )an->Data());
7790	#endif
7791	}
7792	}
7793	else
7794	{
7795	failed= ((iiConvert(at,dArith1[i].arg,ai,a,an))
7796	\|\| (call_failed=dArith1[i].p(res,an)));
7797	}
7798	// everything done, clean up temp. variables
7799	if (failed)
7800	{
7801	// leave loop, goto error handling
7802	break;
7803	}
7804	else
7805	{
7806	if (an->Next() != NULL)
7807	{
7808	res->next = (leftv)omAllocBin(sleftv_bin);
7809	failed=iiExprArith1(res->next,an->next,op);
7810	}
7811	// everything ok, clean up and return
7812	an->CleanUp();
7813	omFreeBin((ADDRESS)an, sleftv_bin);
7814	a->CleanUp();
7815	return failed;
7816	}
7817	}
7818	i++;
7819	}
7820	an->CleanUp();
7821	omFreeBin((ADDRESS)an, sleftv_bin);
7822	}
7823	// error handling
7824	if (!errorreported)
7825	{
7826	if ((at==0) && (a->Fullname()!=sNoName))
7827	{
7828	Werror("`%s` is not defined",a->Fullname());
7829	}
7830	else
7831	{
7832	i=ti;
7833	const char *s = iiTwoOps(op);
7834	Werror("%s(`%s`) failed"
7835	,s,Tok2Cmdname(at));
7836	if ((!call_failed) && BVERBOSE(V_SHOW_USE))
7837	{
7838	while (dArith1[i].cmd==op)
7839	{
7840	if ((dArith1[i].res!=0)
7841	&& (dArith1[i].p!=jjWRONG))
7842	Werror("expected %s(`%s`)"
7843	,s,Tok2Cmdname(dArith1[i].arg));
7844	i++;
7845	}
7846	}
7847	}
7848	}
7849	res->rtyp = UNKNOWN;
7850	}
7851	a->CleanUp();
7852	#endif
7853	return TRUE;
7854	}
7855
7856	/=================== operations with 3 args. ============================/
7857
7858	BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
7859	{
7860	#ifndef GENTABLE
7861	memset(res,0,sizeof(sleftv));
7862	BOOLEAN call_failed=FALSE;
7863
7864	if (!errorreported)
7865	{
7866	#ifdef SIQ
7867	if (siq>0)
7868	{
7869	//Print("siq:%d\n",siq);
7870	command d=(command)omAlloc0Bin(ip_command_bin);
7871	memcpy(&d->arg1,a,sizeof(sleftv));
7872	//a->Init();
7873	memcpy(&d->arg2,b,sizeof(sleftv));
7874	//b->Init();
7875	memcpy(&d->arg3,c,sizeof(sleftv));
7876	//c->Init();
7877	d->op=op;
7878	d->argc=3;
7879	res->data=(char *)d;
7880	res->rtyp=COMMAND;
7881	return FALSE;
7882	}
7883	#endif
7884	int at=a->Typ();
7885	int bt=b->Typ();
7886	int ct=c->Typ();
7887
7888	iiOp=op;
7889	int i=0;
7890	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
7891	while (dArith3[i].cmd==op)
7892	{
7893	if ((at==dArith3[i].arg1)
7894	&& (bt==dArith3[i].arg2)
7895	&& (ct==dArith3[i].arg3))
7896	{
7897	res->rtyp=dArith3[i].res;
7898	#ifdef HAVE_PLURAL
7899	if ((currRing!=NULL) && (rIsPluralRing(currRing)))
7900	{
7901	if (dArith3[i].valid_for_plural==0 /NO_PLURAL/)
7902	{
7903	WerrorS(ii_not_for_plural);
7904	break;
7905	}
7906	else if (dArith3[i].valid_for_plural==2 /* COMM_PLURAL */)
7907	{
7908	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
7909	}
7910	/* else ALLOW_PLURAL */
7911	}
7912	#endif
7913	if ((call_failed=dArith3[i].p(res,a,b,c)))
7914	{
7915	break;// leave loop, goto error handling
7916	}
7917	a->CleanUp();
7918	b->CleanUp();
7919	c->CleanUp();
7920	return FALSE;
7921	}
7922	i++;
7923	}
7924	// implicite type conversion ----------------------------------------------
7925	if (dArith3[i].cmd!=op)
7926	{
7927	int ai,bi,ci;
7928	leftv an = (leftv)omAlloc0Bin(sleftv_bin);
7929	leftv bn = (leftv)omAlloc0Bin(sleftv_bin);
7930	leftv cn = (leftv)omAlloc0Bin(sleftv_bin);
7931	BOOLEAN failed=FALSE;
7932	i=0;
7933	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
7934	while (dArith3[i].cmd==op)
7935	{
7936	if ((ai=iiTestConvert(at,dArith3[i].arg1))!=0)
7937	{
7938	if ((bi=iiTestConvert(bt,dArith3[i].arg2))!=0)
7939	{
7940	if ((ci=iiTestConvert(ct,dArith3[i].arg3))!=0)
7941	{
7942	res->rtyp=dArith3[i].res;
7943	#ifdef HAVE_PLURAL
7944	if ((currRing!=NULL)
7945	&& (rIsPluralRing(currRing)))
7946	{
7947	if (dArith3[i].valid_for_plural==0 /NO_PLURAL/)
7948	{
7949	WerrorS(ii_not_for_plural);
7950	break;
7951	}
7952	else if (dArith3[i].valid_for_plural==2 /* COMM_PLURAL */)
7953	{
7954	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
7955	}
7956	/* else ALLOW_PLURAL */
7957	}
7958	#endif
7959	failed= ((iiConvert(at,dArith3[i].arg1,ai,a,an))
7960	\|\| (iiConvert(bt,dArith3[i].arg2,bi,b,bn))
7961	\|\| (iiConvert(ct,dArith3[i].arg3,ci,c,cn))
7962	\|\| (call_failed=dArith3[i].p(res,an,bn,cn)));
7963	// everything done, clean up temp. variables
7964	if (failed)
7965	{
7966	// leave loop, goto error handling
7967	break;
7968	}
7969	else
7970	{
7971	// everything ok, clean up and return
7972	an->CleanUp();
7973	bn->CleanUp();
7974	cn->CleanUp();
7975	omFreeBin((ADDRESS)an, sleftv_bin);
7976	omFreeBin((ADDRESS)bn, sleftv_bin);
7977	omFreeBin((ADDRESS)cn, sleftv_bin);
7978	a->CleanUp();
7979	b->CleanUp();
7980	c->CleanUp();
7981	//Print("op: %d,result typ:%d\n",op,res->rtyp);
7982	return FALSE;
7983	}
7984	}
7985	}
7986	}
7987	i++;
7988	}
7989	an->CleanUp();
7990	bn->CleanUp();
7991	cn->CleanUp();
7992	omFreeBin((ADDRESS)an, sleftv_bin);
7993	omFreeBin((ADDRESS)bn, sleftv_bin);
7994	omFreeBin((ADDRESS)cn, sleftv_bin);
7995	}
7996	// error handling ---------------------------------------------------
7997	if (!errorreported)
7998	{
7999	const char *s=NULL;
8000	if ((at==0) && (a->Fullname()!=sNoName))
8001	{
8002	s=a->Fullname();
8003	}
8004	else if ((bt==0) && (b->Fullname()!=sNoName))
8005	{
8006	s=b->Fullname();
8007	}
8008	else if ((ct==0) && (c->Fullname()!=sNoName))
8009	{
8010	s=c->Fullname();
8011	}
8012	if (s!=NULL)
8013	Werror("`%s` is not defined",s);
8014	else
8015	{
8016	i=0;
8017	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
8018	const char *s = iiTwoOps(op);
8019	Werror("%s(`%s`,`%s`,`%s`) failed"
8020	,s,Tok2Cmdname(at),Tok2Cmdname(bt),Tok2Cmdname(ct));
8021	if ((!call_failed) && BVERBOSE(V_SHOW_USE))
8022	{
8023	while (dArith3[i].cmd==op)
8024	{
8025	if(((at==dArith3[i].arg1)
8026	\|\|(bt==dArith3[i].arg2)
8027	\|\|(ct==dArith3[i].arg3))
8028	&& (dArith3[i].res!=0))
8029	{
8030	Werror("expected %s(`%s`,`%s`,`%s`)"
8031	,s,Tok2Cmdname(dArith3[i].arg1)
8032	,Tok2Cmdname(dArith3[i].arg2)
8033	,Tok2Cmdname(dArith3[i].arg3));
8034	}
8035	i++;
8036	}
8037	}
8038	}
8039	}
8040	res->rtyp = UNKNOWN;
8041	}
8042	a->CleanUp();
8043	b->CleanUp();
8044	c->CleanUp();
8045	//Print("op: %d,result typ:%d\n",op,res->rtyp);
8046	#endif
8047	return TRUE;
8048	}
8049	/==================== operations with many arg. ===============================/
8050
8051	BOOLEAN jjANY2LIST(leftv res, leftv v, int cnt)
8052	{
8053	// cnt = 0: all
8054	// cnt = 1: only first one
8055	leftv next;
8056	BOOLEAN failed = TRUE;
8057	if(v==NULL) return failed;
8058	res->rtyp = LIST_CMD;
8059	if(cnt) v->next = NULL;
8060	next = v->next; // saving next-pointer
8061	failed = jjLIST_PL(res, v);
8062	v->next = next; // writeback next-pointer
8063	return failed;
8064	}
8065
8066	BOOLEAN iiExprArithM(leftv res, leftv a, int op)
8067	{
8068	#ifndef GENTABLE
8069	memset(res,0,sizeof(sleftv));
8070
8071	if (!errorreported)
8072	{
8073	#ifdef SIQ
8074	if (siq>0)
8075	{
8076	//Print("siq:%d\n",siq);
8077	command d=(command)omAlloc0Bin(ip_command_bin);
8078	d->op=op;
8079	res->data=(char *)d;
8080	if (a!=NULL)
8081	{
8082	d->argc=a->listLength();
8083	// else : d->argc=0;
8084	memcpy(&d->arg1,a,sizeof(sleftv));
8085	switch(d->argc)
8086	{
8087	case 3:
8088	memcpy(&d->arg3,a->next->next,sizeof(sleftv));
8089	a->next->next->Init();
8090	/* no break */
8091	case 2:
8092	memcpy(&d->arg2,a->next,sizeof(sleftv));
8093	a->next->Init();
8094	a->next->next=d->arg2.next;
8095	d->arg2.next=NULL;
8096	/* no break */
8097	case 1:
8098	a->Init();
8099	a->next=d->arg1.next;
8100	d->arg1.next=NULL;
8101	}
8102	if (d->argc>3) a->next=NULL;
8103	a->name=NULL;
8104	a->rtyp=0;
8105	a->data=NULL;
8106	a->e=NULL;
8107	a->attribute=NULL;
8108	a->CleanUp();
8109	}
8110	res->rtyp=COMMAND;
8111	return FALSE;
8112	}
8113	#endif
8114	BOOLEAN failed=FALSE;
8115	int args=0;
8116	if (a!=NULL) args=a->listLength();
8117
8118	iiOp=op;
8119	int i=0;
8120	while ((dArithM[i].cmd!=op)&&(dArithM[i].cmd!=0)) i++;
8121	while (dArithM[i].cmd==op)
8122	{
8123	if ((args==dArithM[i].number_of_args)
8124	\|\| (dArithM[i].number_of_args==-1)
8125	\|\| ((dArithM[i].number_of_args==-2)&&(args>0)))
8126	{
8127	res->rtyp=dArithM[i].res;
8128	#ifdef HAVE_PLURAL
8129	if ((currRing!=NULL)
8130	&& (rIsPluralRing(currRing)))
8131	{
8132	if (dArithM[i].valid_for_plural==0 /NO_PLURAL/)
8133	{
8134	WerrorS(ii_not_for_plural);
8135	break;
8136	}
8137	else if (dArithM[i].valid_for_plural==2 /* COMM_PLURAL */)
8138	{
8139	Warn("assume commutative subalgebra for cmd `%s`",Tok2Cmdname(i));
8140	}
8141	/* else ALLOW_PLURAL */
8142	}
8143	#endif
8144	if (dArithM[i].p(res,a))
8145	{
8146	break;// leave loop, goto error handling
8147	}
8148	if (a!=NULL) a->CleanUp();
8149	//Print("op: %d,result typ:%d\n",op,res->rtyp);
8150	return failed;
8151	}
8152	i++;
8153	}
8154	// error handling
8155	if (!errorreported)
8156	{
8157	if ((args>0) && (a->rtyp==0) && (a->Name()!=sNoName))
8158	{
8159	Werror("`%s` is not defined",a->Fullname());
8160	}
8161	else
8162	{
8163	const char *s = iiTwoOps(op);
8164	Werror("%s(...) failed",s);
8165	}
8166	}
8167	res->rtyp = UNKNOWN;
8168	}
8169	if (a!=NULL) a->CleanUp();
8170	//Print("op: %d,result typ:%d\n",op,res->rtyp);
8171	#endif
8172	return TRUE;
8173	}
8174
8175	/=================== general utilities ============================/
8176	int IsCmd(const char *n, int & tok)
8177	{
8178	#ifndef GENTABLE
8179	int i;
8180	int an=1;
8181	int en=sArithBase.nLastIdentifier;
8182
8183	loop
8184	//for(an=0; an<sArithBase.nCmdUsed; )
8185	{
8186	if(an>=en-1)
8187	{
8188	if (strcmp(n, sArithBase.sCmds[an].name) == 0)
8189	{
8190	i=an;
8191	break;
8192	}
8193	else if ((an!=en) && (strcmp(n, sArithBase.sCmds[en].name) == 0))
8194	{
8195	i=en;
8196	break;
8197	}
8198	else
8199	{
8200	return 0;
8201	}
8202	}
8203	i=(an+en)/2;
8204	if (n < (sArithBase.sCmds[i].name))
8205	{
8206	en=i-1;
8207	}
8208	else if (n > (sArithBase.sCmds[i].name))
8209	{
8210	an=i+1;
8211	}
8212	else
8213	{
8214	int v=strcmp(n,sArithBase.sCmds[i].name);
8215	if(v<0)
8216	{
8217	en=i-1;
8218	}
8219	else if(v>0)
8220	{
8221	an=i+1;
8222	}
8223	else /v==0/
8224	{
8225	break;
8226	}
8227	}
8228	}
8229	lastreserved=sArithBase.sCmds[i].name;
8230	tok=sArithBase.sCmds[i].tokval;
8231	if(sArithBase.sCmds[i].alias==2)
8232	{
8233	Warn("outdated identifier `%s` used - please change your code",
8234	sArithBase.sCmds[i].name);
8235	sArithBase.sCmds[i].alias=1;
8236	}
8237	if (currRingHdl==NULL)
8238	{
8239	#ifdef SIQ
8240	if (siq<=0)
8241	{
8242	#endif
8243	if ((tok>=BEGIN_RING) && (tok<=END_RING))
8244	{
8245	WerrorS("no ring active");
8246	return 0;
8247	}
8248	#ifdef SIQ
8249	}
8250	#endif
8251	}
8252	if (!expected_parms)
8253	{
8254	switch (tok)
8255	{
8256	case IDEAL_CMD:
8257	case INT_CMD:
8258	case INTVEC_CMD:
8259	case MAP_CMD:
8260	case MATRIX_CMD:
8261	case MODUL_CMD:
8262	case POLY_CMD:
8263	case PROC_CMD:
8264	case RING_CMD:
8265	case STRING_CMD:
8266	cmdtok = tok;
8267	break;
8268	}
8269	}
8270	return sArithBase.sCmds[i].toktype;
8271	#else
8272	return 0;
8273	#endif
8274	}
8275	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op)
8276	{
8277	#ifndef GENTABLE
8278	int a=0;
8279	int e=len;
8280	int p=len/2;
8281	do
8282	{
8283	if (op==dArithTab[p].cmd) return dArithTab[p].start;
8284	if (op<dArithTab[p].cmd) e=p-1;
8285	else a = p+1;
8286	p=a+(e-a)/2;
8287	}
8288	while ( a <= e);
8289
8290	#endif
8291	assume(0);
8292	return 0;
8293	}
8294
8295	#ifdef GENTABLE
8296	const char * Tok2Cmdname(int tok)
8297	{
8298	int i = 0;
8299	if (tok < 0)
8300	{
8301	return cmds[0].name;
8302	}
8303	if (tok==ANY_TYPE) return "any_type";
8304	if (tok==NONE) return "nothing";
8305	//if (tok==IFBREAK) return "if_break";
8306	//if (tok==VECTOR_FROM_POLYS) return "vector_from_polys";
8307	//if (tok==ORDER_VECTOR) return "ordering";
8308	//if (tok==REF_VAR) return "ref";
8309	//if (tok==OBJECT) return "object";
8310	//if (tok==PRINT_EXPR) return "print_expr";
8311	if (tok==IDHDL) return "identifier";
8312	while (cmds[i].tokval!=0)
8313	{
8314	if ((cmds[i].tokval == tok)&&(cmds[i].alias==0))
8315	{
8316	return cmds[i].name;
8317	}
8318	i++;
8319	}
8320	return cmds[0].name;
8321	}
8322	#else /* GENTABLE */
8323	const char * Tok2Cmdname(int tok)
8324	{
8325	int i = 0;
8326	if (tok <= 0)
8327	{
8328	return sArithBase.sCmds[0].name;
8329	}
8330	if (tok==ANY_TYPE) return "any_type";
8331	if (tok==NONE) return "nothing";
8332	//if (tok==IFBREAK) return "if_break";
8333	//if (tok==VECTOR_FROM_POLYS) return "vector_from_polys";
8334	//if (tok==ORDER_VECTOR) return "ordering";
8335	//if (tok==REF_VAR) return "ref";
8336	//if (tok==OBJECT) return "object";
8337	//if (tok==PRINT_EXPR) return "print_expr";
8338	if (tok==IDHDL) return "identifier";
8339	for(i=0; i<sArithBase.nCmdUsed; i++)
8340	//while (sArithBase.sCmds[i].tokval!=0)
8341	{
8342	if ((sArithBase.sCmds[i].tokval == tok)&&
8343	(sArithBase.sCmds[i].alias==0))
8344	{
8345	return sArithBase.sCmds[i].name;
8346	}
8347	}
8348	return sArithBase.sCmds[0].name;
8349	}
8350	#endif /* GENTABLE */
8351
8352
8353	/---------------------------------------------------------------------/
8354	/**
8355	* @brief compares to entry of cmdsname-list
8356
8357	@param[in] a
8358	@param[in] b
8359
8360	@return <ReturnValue>
8361	**/
8362	/---------------------------------------------------------------------/
8363	static int _gentable_sort_cmds( const void a, const void b )
8364	{
8365	cmdnames pCmdL = (cmdnames)a;
8366	cmdnames pCmdR = (cmdnames)b;
8367
8368	if(a==NULL \|\| b==NULL) return 0;
8369
8370	/* empty entries goes to the end of the list for later reuse */
8371	if(pCmdL->name==NULL) return 1;
8372	if(pCmdR->name==NULL) return -1;
8373
8374	/* $INVALID$ must come first */
8375	if(strcmp(pCmdL->name, "$INVALID$")==0) return -1;
8376	if(strcmp(pCmdR->name, "$INVALID$")==0) return 1;
8377
8378	/* tokval=-1 are reserved names at the end */
8379	if (pCmdL->tokval==-1)
8380	{
8381	if (pCmdR->tokval==-1)
8382	return strcmp(pCmdL->name, pCmdR->name);
8383	/* pCmdL->tokval==-1, pCmdL goes at the end */
8384	return 1;
8385	}
8386	/* pCmdR->tokval==-1, pCmdR goes at the end */
8387	if(pCmdR->tokval==-1) return -1;
8388
8389	return strcmp(pCmdL->name, pCmdR->name);
8390	}
8391
8392	/---------------------------------------------------------------------/
8393	/**
8394	* @brief initialisation of arithmetic structured data
8395
8396	@retval 0 on success
8397
8398	**/
8399	/---------------------------------------------------------------------/
8400	int iiInitArithmetic()
8401	{
8402	int i;
8403	//printf("iiInitArithmetic()\n");
8404	#ifndef GENTABLE
8405	memset(&sArithBase, 0, sizeof(sArithBase));
8406	iiInitCmdName();
8407	/* fix last-identifier */
8408	#if 0
8409	/* we expect that gentable allready did every thing */
8410	for(sArithBase.nLastIdentifier=sArithBase.nCmdUsed-1;
8411	sArithBase.nLastIdentifier>0; sArithBase.nLastIdentifier--) {
8412	if(sArithBase.sCmds[sArithBase.nLastIdentifier].tokval>=0) break;
8413	}
8414	#endif
8415	//Print("L=%d\n", sArithBase.nLastIdentifier);
8416
8417	//iiArithAddCmd(szName, nAlias, nTokval, nToktype);
8418	//iiArithAddCmd("mygcd", 1, GCD_CMD, CMD_2);
8419
8420	//iiArithAddCmd("Top", 0,-1,0);
8421
8422
8423	//for(i=0; i<sArithBase.nCmdUsed; i++) {
8424	// printf("CMD[%03d] %s, %d, %d, %d\n", i,
8425	// sArithBase.sCmds[i].name,
8426	// sArithBase.sCmds[i].alias,
8427	// sArithBase.sCmds[i].tokval,
8428	// sArithBase.sCmds[i].toktype);
8429	//}
8430	//iiArithRemoveCmd("Top");
8431	//iiArithAddCmd("mygcd", 2, GCD_CMD, CMD_2);
8432	//iiArithRemoveCmd("mygcd");
8433	//iiArithAddCmd("kkk", 1, 1234, CMD_1);
8434	#endif /* !GENTABLE */
8435	return 0;
8436	}
8437
8438	/---------------------------------------------------------------------/
8439	/**
8440	* @brief append newitem of size sizeofitem to the list named list.
8441
8442	@param[in,out] list
8443	@param[in,out] item_count
8444	@param[in] sizeofitem
8445	@param[in] newitem
8446
8447	@retval 0 success
8448	@retval -1 failure
8449	**/
8450	/---------------------------------------------------------------------/
8451	int iiArithAddItem2list(
8452	void **list,
8453	long *item_count,
8454	long sizeofitem,
8455	void *newitem
8456	)
8457	{
8458	int count = *item_count;
8459
8460	//TRACE(0, "add_item_to_list(%p, %p, %ld, %p)\n", list, item_count,
8461	// sizeofitem, newitem);
8462
8463	if(count==0)
8464	{
8465	list = (void )omAlloc(sizeofitem);
8466	}
8467	else
8468	{
8469	list = (void )omRealloc(list, (count+1) sizeofitem);
8470	}
8471	if((*list)==NULL) return -1;
8472
8473	//memset((list)+countsizeofitem, 0, sizeofitem);
8474	//memcpy((list)+countsizeofitem, newitem, sizeofitem);
8475
8476	/* erhoehe counter um 1 */
8477	(count)++;
8478	*item_count = count;
8479	return 0;
8480	}
8481
8482	int iiArithFindCmd(const char *szName)
8483	{
8484	#ifndef GENTABLE
8485	int an=0;
8486	int i = 0,v = 0;
8487	int en=sArithBase.nLastIdentifier;
8488
8489	loop
8490	//for(an=0; an<sArithBase.nCmdUsed; )
8491	{
8492	if(an>=en-1)
8493	{
8494	if (strcmp(szName, sArithBase.sCmds[an].name) == 0)
8495	{
8496	//Print("RET-an=%d %s\n", an, sArithBase.sCmds[an].name);
8497	return an;
8498	}
8499	else if (strcmp(szName, sArithBase.sCmds[en].name) == 0)
8500	{
8501	//Print("RET-en=%d %s\n", en, sArithBase.sCmds[en].name);
8502	return en;
8503	}
8504	else
8505	{
8506	//Print("RET- 1\n");
8507	return -1;
8508	}
8509	}
8510	i=(an+en)/2;
8511	if (szName < (sArithBase.sCmds[i].name))
8512	{
8513	en=i-1;
8514	}
8515	else if (szName > (sArithBase.sCmds[i].name))
8516	{
8517	an=i+1;
8518	}
8519	else
8520	{
8521	v=strcmp(szName,sArithBase.sCmds[i].name);
8522	if(v<0)
8523	{
8524	en=i-1;
8525	}
8526	else if(v>0)
8527	{
8528	an=i+1;
8529	}
8530	else /v==0/
8531	{
8532	//Print("RET-i=%d %s\n", i, sArithBase.sCmds[i].name);
8533	return i;
8534	}
8535	}
8536	}
8537	//if(i>=0 && i<sArithBase.nCmdUsed)
8538	// return i;
8539	//Print("RET-2\n");
8540	return -2;
8541	#else
8542	return 0;
8543	#endif
8544	}
8545
8546	char *iiArithGetCmd( int nPos )
8547	{
8548	if(nPos<0) return NULL;
8549	if(nPos<sArithBase.nCmdUsed)
8550	return sArithBase.sCmds[nPos].name;
8551	return NULL;
8552	}
8553
8554	int iiArithRemoveCmd(const char *szName)
8555	{
8556	int nIndex;
8557	if(szName==NULL) return -1;
8558
8559	nIndex = iiArithFindCmd(szName);
8560	if(nIndex<0 \|\| nIndex>=sArithBase.nCmdUsed)
8561	{
8562	Print("'%s' not found (%d)\n", szName, nIndex);
8563	return -1;
8564	}
8565	omFree(sArithBase.sCmds[nIndex].name);
8566	sArithBase.sCmds[nIndex].name=NULL;
8567	qsort(sArithBase.sCmds, sArithBase.nCmdUsed, sizeof(cmdnames),
8568	(&_gentable_sort_cmds));
8569	sArithBase.nCmdUsed--;
8570
8571	/* fix last-identifier */
8572	for(sArithBase.nLastIdentifier=sArithBase.nCmdUsed-1;
8573	sArithBase.nLastIdentifier>0; sArithBase.nLastIdentifier--)
8574	{
8575	if(sArithBase.sCmds[sArithBase.nLastIdentifier].tokval>=0) break;
8576	}
8577	//Print("L=%d\n", sArithBase.nLastIdentifier);
8578	return 0;
8579	}
8580
8581	int iiArithAddCmd(
8582	const char *szName,
8583	short nAlias,
8584	short nTokval,
8585	short nToktype,
8586	short nPos
8587	)
8588	{
8589	//printf("AddCmd(%s, %d, %d, %d, %d)\n", szName, nAlias,
8590	// nTokval, nToktype, nPos);
8591	if(nPos>=0)
8592	{
8593	// no checks: we rely on a correct generated code in iparith.inc
8594	assume(nPos < sArithBase.nCmdAllocated);
8595	assume(szName!=NULL);
8596	sArithBase.sCmds[nPos].name = omStrDup(szName);
8597	sArithBase.sCmds[nPos].alias = nAlias;
8598	sArithBase.sCmds[nPos].tokval = nTokval;
8599	sArithBase.sCmds[nPos].toktype = nToktype;
8600	sArithBase.nCmdUsed++;
8601	//if(nTokval>0) sArithBase.nLastIdentifier++;
8602	}
8603	else
8604	{
8605	if(szName==NULL) return -1;
8606	int nIndex = iiArithFindCmd(szName);
8607	if(nIndex>=0)
8608	{
8609	Print("'%s' already exists at %d\n", szName, nIndex);
8610	return -1;
8611	}
8612
8613	if(sArithBase.nCmdUsed>=sArithBase.nCmdAllocated)
8614	{
8615	/* needs to create new slots */
8616	unsigned long nSize = (sArithBase.nCmdAllocated+1)*sizeof(cmdnames);
8617	sArithBase.sCmds = (cmdnames *)omRealloc(sArithBase.sCmds, nSize);
8618	if(sArithBase.sCmds==NULL) return -1;
8619	sArithBase.nCmdAllocated++;
8620	}
8621	/* still free slots available */
8622	sArithBase.sCmds[sArithBase.nCmdUsed].name = omStrDup(szName);
8623	sArithBase.sCmds[sArithBase.nCmdUsed].alias = nAlias;
8624	sArithBase.sCmds[sArithBase.nCmdUsed].tokval = nTokval;
8625	sArithBase.sCmds[sArithBase.nCmdUsed].toktype = nToktype;
8626	sArithBase.nCmdUsed++;
8627
8628	qsort(sArithBase.sCmds, sArithBase.nCmdUsed, sizeof(cmdnames),
8629	(&_gentable_sort_cmds));
8630	for(sArithBase.nLastIdentifier=sArithBase.nCmdUsed-1;
8631	sArithBase.nLastIdentifier>0; sArithBase.nLastIdentifier--)
8632	{
8633	if(sArithBase.sCmds[sArithBase.nLastIdentifier].tokval>=0) break;
8634	}
8635	//Print("L=%d\n", sArithBase.nLastIdentifier);
8636	}
8637	return 0;
8638	}
8639
8640	#ifdef GENTABLE
8641	// some special cmds which do not fit in with the others, and
8642	// nevertheless need to be transmitted
8643	short ExtraCmds[] =
8644	{
8645	OPTION_CMD,
8646	NAMES_CMD,
8647	// RESERVEDNAME_CMD,
8648	PROC_CMD,
8649	MAP_CMD,
8650	PACKAGE_CMD,
8651	'=',
8652	0
8653	};
8654
8655	// This returns 1 if tok is a token which can appear in a Singular
8656	// (quoted) command, and 0 otherwise
8657	short IsCmdToken(short tok)
8658	{
8659	int i = 0;
8660	// cmds with one arg
8661	while (dArith1[i].cmd != 0)
8662	if (dArith1[i].cmd == tok) return 1;
8663	else i++;
8664
8665	// cmds with two args
8666	i=0;
8667	while (dArith2[i].cmd != 0)
8668	if (dArith2[i].cmd == tok) return 1;
8669	else i++;
8670
8671	// cmds with three args
8672	i=0;
8673	while (dArith3[i].cmd != 0)
8674	if (dArith3[i].cmd == tok) return 1;
8675	else i++;
8676
8677	// cmds with many args
8678	i=0;
8679	while (dArithM[i].cmd != 0)
8680	if (dArithM[i].cmd == tok) return 1;
8681	else i++;
8682
8683	// cmds which are somewhat special (like those having 0 args)
8684	i=0;
8685	while (ExtraCmds[i] != 0)
8686	if (ExtraCmds[i] == tok) return 1;
8687	else i++;
8688
8689	return 0;
8690	}
8691	#endif

Note: See TracBrowser for help on using the repository browser.

Download in other formats: