1 | /**************************************** |
---|
2 | * Computer Algebra System SINGULAR * |
---|
3 | ****************************************/ |
---|
4 | /* |
---|
5 | * ABSTRACT: handling of the list type |
---|
6 | */ |
---|
7 | // to produce a non-inline version from lists.h |
---|
8 | #define LISTS_CC |
---|
9 | |
---|
10 | |
---|
11 | |
---|
12 | |
---|
13 | #include <kernel/mod2.h> |
---|
14 | #include <Singular/tok.h> |
---|
15 | //#include "ipid.h" |
---|
16 | #include <kernel/polys.h> |
---|
17 | #include <kernel/ideals.h> |
---|
18 | #include <Singular/attrib.h> |
---|
19 | #include <Singular/ipshell.h> |
---|
20 | #include <misc/intvec.h> |
---|
21 | #include <Singular/lists.h> |
---|
22 | |
---|
23 | omBin slists_bin = omGetSpecBin(sizeof(slists)); |
---|
24 | |
---|
25 | int lSize(lists L) |
---|
26 | { |
---|
27 | int n=L->nr; |
---|
28 | while ((n>=0)&&((L->m[n].rtyp==DEF_CMD)||(L->m[n].rtyp==0))) n--; |
---|
29 | return n; |
---|
30 | } |
---|
31 | |
---|
32 | lists lCopy(lists L) |
---|
33 | { |
---|
34 | lists N=(lists)omAlloc0Bin(slists_bin); |
---|
35 | int n=L->nr; |
---|
36 | if (L->nr>=0) |
---|
37 | N->Init(n+1); |
---|
38 | else |
---|
39 | N->Init(); |
---|
40 | for(;n>=0;n--) |
---|
41 | { |
---|
42 | N->m[n].Copy(&L->m[n]); |
---|
43 | } |
---|
44 | //Print("copy list with %d -> %d elems\n",L->nr,N->nr); |
---|
45 | return N; |
---|
46 | } |
---|
47 | |
---|
48 | /*2 |
---|
49 | * concat 2 lists |
---|
50 | */ |
---|
51 | BOOLEAN lAdd(leftv res, leftv u, leftv v) |
---|
52 | { |
---|
53 | lists l=(lists) omAllocBin(slists_bin); |
---|
54 | lists ul=(lists)u->CopyD(); |
---|
55 | lists vl=(lists)v->CopyD(); |
---|
56 | l->Init(ul->nr+vl->nr+2); |
---|
57 | int i; |
---|
58 | |
---|
59 | for(i=0;i<=ul->nr;i++) |
---|
60 | { |
---|
61 | //Print("u[%d]->r[%d]\n",i,i); |
---|
62 | l->m[i].rtyp=ul->m[i].rtyp; |
---|
63 | l->m[i].data=ul->m[i].data; |
---|
64 | } |
---|
65 | for(i=0;i<=vl->nr;i++) |
---|
66 | { |
---|
67 | //Print("v[%d]->r[%d]\n",i,i+ul->nr+1); |
---|
68 | l->m[i+ul->nr+1].rtyp=vl->m[i].rtyp; |
---|
69 | l->m[i+ul->nr+1].data=vl->m[i].data; |
---|
70 | } |
---|
71 | if (ul->m != NULL) |
---|
72 | omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv)); |
---|
73 | omFreeBin((ADDRESS)ul, slists_bin); |
---|
74 | if (vl->m != NULL) |
---|
75 | omFreeSize((ADDRESS)vl->m,(vl->nr+1)*sizeof(sleftv)); |
---|
76 | omFreeBin((ADDRESS)vl, slists_bin); |
---|
77 | memset(u,0,sizeof(*u)); |
---|
78 | memset(v,0,sizeof(*v)); |
---|
79 | res->data = (char *)l; |
---|
80 | //res->Print(); |
---|
81 | return FALSE; |
---|
82 | } |
---|
83 | |
---|
84 | /*2 |
---|
85 | * insert v into list ul, destroys u |
---|
86 | */ |
---|
87 | lists lInsert0(lists ul, leftv v, int pos) |
---|
88 | { |
---|
89 | if ((pos<0)||(v->rtyp==NONE)) |
---|
90 | return NULL; |
---|
91 | lists l=(lists) omAllocBin(slists_bin); |
---|
92 | l->Init(si_max(ul->nr+2,pos+1)); |
---|
93 | int i,j; |
---|
94 | |
---|
95 | for(i=j=0;i<=ul->nr;i++,j++) |
---|
96 | { |
---|
97 | if(j==pos) j++; |
---|
98 | l->m[j]=ul->m[i]; |
---|
99 | } |
---|
100 | for(j=ul->nr+1;j<pos;j++) |
---|
101 | l->m[j].rtyp=DEF_CMD; |
---|
102 | // memset(&(l->m[pos]),0,sizeof(sleftv)); - done by Init |
---|
103 | l->m[pos].rtyp=v->Typ(); |
---|
104 | l->m[pos].data=v->CopyD(); |
---|
105 | l->m[pos].flag=v->flag; |
---|
106 | attr *a=v->Attribute(); |
---|
107 | if ((a!=NULL)&&(*a!=NULL)) |
---|
108 | { |
---|
109 | l->m[pos].attribute=(*a)->Copy(); |
---|
110 | } |
---|
111 | if (ul->m != NULL) |
---|
112 | omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv)); |
---|
113 | omFreeBin((ADDRESS)ul, slists_bin); |
---|
114 | return l; |
---|
115 | } |
---|
116 | |
---|
117 | /*2 |
---|
118 | * insert v into list u, at the beginning |
---|
119 | */ |
---|
120 | BOOLEAN lInsert(leftv res, leftv u, leftv v) |
---|
121 | { |
---|
122 | lists ul=(lists)u->CopyD(); |
---|
123 | res->data=(char *)lInsert0(ul,v,0); |
---|
124 | if (res->data==NULL) |
---|
125 | { |
---|
126 | Werror("cannot insert type `%s`",Tok2Cmdname(v->Typ())); |
---|
127 | return TRUE; |
---|
128 | } |
---|
129 | return FALSE; |
---|
130 | } |
---|
131 | |
---|
132 | /*2 |
---|
133 | * insert v into list u at pos w |
---|
134 | */ |
---|
135 | BOOLEAN lInsert3(leftv res, leftv u, leftv v, leftv w) |
---|
136 | { |
---|
137 | lists ul=(lists)u->CopyD(); |
---|
138 | res->data=(char *)lInsert0(ul,v,(int)(long)w->Data()); |
---|
139 | if (res->data==NULL) |
---|
140 | { |
---|
141 | Werror("cannot insert type `%s` at pos. %d", |
---|
142 | Tok2Cmdname(v->Typ()),(int)(long)w->Data()); |
---|
143 | return TRUE; |
---|
144 | } |
---|
145 | return FALSE; |
---|
146 | } |
---|
147 | |
---|
148 | /*2 |
---|
149 | * append v to list u |
---|
150 | */ |
---|
151 | BOOLEAN lAppend(leftv res, leftv u, leftv v) |
---|
152 | { |
---|
153 | lists ul=(lists)u->CopyD(); |
---|
154 | res->data=(char *)lInsert0(ul,v,ul->nr+1); |
---|
155 | return (res->data==NULL); |
---|
156 | } |
---|
157 | |
---|
158 | /*2 |
---|
159 | * delete v-th element from list u |
---|
160 | */ |
---|
161 | BOOLEAN lDelete(leftv res, leftv u, leftv v) |
---|
162 | { |
---|
163 | lists ul=(lists)u->Data(); |
---|
164 | int VIndex=(int)(long)v->Data()-1; |
---|
165 | int EndIndex=lSize(ul); |
---|
166 | |
---|
167 | if((0<=VIndex)&&(VIndex<=ul->nr)) |
---|
168 | { |
---|
169 | ul=(lists)u->CopyD(); |
---|
170 | int i,j; |
---|
171 | lists l=(lists) omAllocBin(slists_bin); |
---|
172 | l->Init(EndIndex+(VIndex>EndIndex)); |
---|
173 | |
---|
174 | for(i=j=0;i<=EndIndex;i++,j++) |
---|
175 | { |
---|
176 | if (i!=VIndex) |
---|
177 | { |
---|
178 | l->m[j]=ul->m[i]; |
---|
179 | memset(&ul->m[i],0,sizeof(ul->m[i])); |
---|
180 | } |
---|
181 | else |
---|
182 | { |
---|
183 | j--; |
---|
184 | ul->m[i].CleanUp(); |
---|
185 | } |
---|
186 | } |
---|
187 | omFreeSize((ADDRESS)ul->m,(ul->nr+1)*sizeof(sleftv)); |
---|
188 | omFreeBin((ADDRESS)ul, slists_bin); |
---|
189 | res->data = (char *)l; |
---|
190 | return FALSE; |
---|
191 | } |
---|
192 | Werror("wrong index %d in list(%d)",VIndex+1,ul->nr+1); |
---|
193 | return TRUE; |
---|
194 | } |
---|
195 | |
---|
196 | /*2 |
---|
197 | * check, if a list contains any ring dependend data |
---|
198 | */ |
---|
199 | BOOLEAN lRingDependend(lists L) |
---|
200 | { |
---|
201 | if (L==NULL) return FALSE; |
---|
202 | int i=0; |
---|
203 | while (i<=L->nr) |
---|
204 | { |
---|
205 | if ((L->m[i].rtyp!=QRING_CMD) |
---|
206 | && (BEGIN_RING<L->m[i].rtyp) |
---|
207 | && (L->m[i].rtyp<END_RING)) |
---|
208 | return TRUE; |
---|
209 | if ((L->m[i].rtyp==LIST_CMD)&&lRingDependend((lists)L->m[i].data)) |
---|
210 | return TRUE; |
---|
211 | i++; |
---|
212 | } |
---|
213 | return FALSE; |
---|
214 | } |
---|
215 | |
---|
216 | lists liMakeResolv(resolvente r, int length, int reallen, |
---|
217 | int typ0, intvec ** weights, int add_row_shift) |
---|
218 | { |
---|
219 | lists L=(lists)omAlloc0Bin(slists_bin); |
---|
220 | if (length<=0) |
---|
221 | { |
---|
222 | // handle "empty" resolutions |
---|
223 | L->Init(0); |
---|
224 | } |
---|
225 | else |
---|
226 | { |
---|
227 | int oldlength=length; |
---|
228 | while (r[length-1]==NULL) length--; |
---|
229 | if (reallen<=0) reallen=currRing->N; |
---|
230 | reallen=si_max(reallen,length); |
---|
231 | L->Init(reallen); |
---|
232 | int i=0; |
---|
233 | |
---|
234 | while (i<length) |
---|
235 | { |
---|
236 | if (r[i]!=NULL) |
---|
237 | { |
---|
238 | if (i==0) |
---|
239 | { |
---|
240 | L->m[i].rtyp=typ0; |
---|
241 | int j=IDELEMS(r[0])-1; |
---|
242 | while ((j>0) && (r[0]->m[j]==NULL)) j--; |
---|
243 | j++; |
---|
244 | if (j!=IDELEMS(r[0])) |
---|
245 | { |
---|
246 | pEnlargeSet(&(r[0]->m),IDELEMS(r[0]),j-IDELEMS(r[0])); |
---|
247 | IDELEMS(r[0])=j; |
---|
248 | } |
---|
249 | } |
---|
250 | else |
---|
251 | { |
---|
252 | L->m[i].rtyp=MODUL_CMD; |
---|
253 | int rank=IDELEMS(r[i-1]); |
---|
254 | if (idIs0(r[i-1])) |
---|
255 | { |
---|
256 | idDelete(&(r[i])); |
---|
257 | r[i]=id_FreeModule(rank, currRing); |
---|
258 | } |
---|
259 | else |
---|
260 | { |
---|
261 | r[i]->rank=si_max(rank,(int)id_RankFreeModule(r[i], currRing)); |
---|
262 | } |
---|
263 | idSkipZeroes(r[i]); |
---|
264 | } |
---|
265 | L->m[i].data=(void *)r[i]; |
---|
266 | if ((weights!=NULL) && (weights[i]!=NULL)) |
---|
267 | { |
---|
268 | intvec *w=ivCopy(weights[i]); |
---|
269 | (*w) += add_row_shift; |
---|
270 | atSet((idhdl)&L->m[i],omStrDup("isHomog"),w,INTVEC_CMD); |
---|
271 | weights[i] = NULL; |
---|
272 | } |
---|
273 | } |
---|
274 | #ifdef TEST |
---|
275 | else |
---|
276 | { |
---|
277 | // should not happen: |
---|
278 | Warn("internal NULL in resolvente"); |
---|
279 | L->m[i].data=(void *)idInit(1,1); |
---|
280 | } |
---|
281 | #endif |
---|
282 | i++; |
---|
283 | } |
---|
284 | omFreeSize((ADDRESS)r,oldlength*sizeof(ideal)); |
---|
285 | if (i==0) |
---|
286 | { |
---|
287 | L->m[0].rtyp=typ0; |
---|
288 | L->m[0].data=(char *)idInit(1,1); |
---|
289 | i=1; |
---|
290 | } |
---|
291 | while (i<reallen) |
---|
292 | { |
---|
293 | L->m[i].rtyp=MODUL_CMD; |
---|
294 | ideal I=(ideal)L->m[i-1].data; |
---|
295 | ideal J; |
---|
296 | int rank=IDELEMS(I); |
---|
297 | if (idIs0(I)) |
---|
298 | { |
---|
299 | J=idFreeModule(rank); |
---|
300 | } |
---|
301 | else |
---|
302 | { |
---|
303 | J=idInit(1,rank); |
---|
304 | } |
---|
305 | L->m[i].data=(void *)J; |
---|
306 | i++; |
---|
307 | } |
---|
308 | //Print("make res of length %d (0..%d) L:%d\n",length,length-1,L->nr); |
---|
309 | } |
---|
310 | return L; |
---|
311 | } |
---|
312 | |
---|
313 | resolvente liFindRes(lists L, int * len, int *typ0,intvec *** weights) |
---|
314 | { |
---|
315 | resolvente r; |
---|
316 | intvec ** w=NULL,*tw=NULL; |
---|
317 | |
---|
318 | *len=L->nr+1; |
---|
319 | if (*len<=0) |
---|
320 | { |
---|
321 | WerrorS("empty list"); |
---|
322 | return NULL; |
---|
323 | } |
---|
324 | r=(ideal *)omAlloc0((*len)*sizeof(ideal)); |
---|
325 | w=(intvec**)omAlloc0((*len)*sizeof(intvec*)); |
---|
326 | int i=0; |
---|
327 | *typ0=MODUL_CMD; |
---|
328 | while (i<(*len)) |
---|
329 | { |
---|
330 | if (L->m[i].rtyp != MODUL_CMD) |
---|
331 | { |
---|
332 | if (L->m[i].rtyp!=IDEAL_CMD) |
---|
333 | { |
---|
334 | Werror("element %d is not of type module",i+1); |
---|
335 | omFreeSize((ADDRESS)r,(*len)*sizeof(ideal)); |
---|
336 | return NULL; |
---|
337 | } |
---|
338 | *typ0=IDEAL_CMD; |
---|
339 | } |
---|
340 | if ((i>0) && (idIs0(r[i-1]))) |
---|
341 | { |
---|
342 | //*len=i-1; |
---|
343 | break; |
---|
344 | } |
---|
345 | r[i]=(ideal)L->m[i].data; |
---|
346 | tw=(intvec*)atGet(&(L->m[i]),"isHomog",INTVEC_CMD); |
---|
347 | if (tw!=NULL) |
---|
348 | { |
---|
349 | w[i]=ivCopy(tw); |
---|
350 | } |
---|
351 | tw = NULL; |
---|
352 | i++; |
---|
353 | } |
---|
354 | BOOLEAN hom_complex=TRUE; |
---|
355 | int j=0; |
---|
356 | while ((j<i) && hom_complex) |
---|
357 | { |
---|
358 | hom_complex = hom_complex && (w[i]!=NULL); |
---|
359 | j++; |
---|
360 | } |
---|
361 | if ((!hom_complex) || (weights==NULL)) |
---|
362 | { |
---|
363 | for (j=0;j<i;j++) |
---|
364 | { |
---|
365 | if (w[j]!=NULL) delete w[j]; |
---|
366 | } |
---|
367 | omFreeSize((ADDRESS)w,(*len)*sizeof(intvec*)); |
---|
368 | if (weights!=NULL) *weights=NULL; |
---|
369 | } |
---|
370 | else |
---|
371 | { |
---|
372 | *weights = w; |
---|
373 | } |
---|
374 | //Print("find res of length %d (0..%d) L:%d\n",*len,(*len)-1,L->nr); |
---|
375 | return r; |
---|
376 | } |
---|
377 | |
---|
378 | char* lString(lists l, BOOLEAN typed, int dim) |
---|
379 | { |
---|
380 | if (l->nr == -1) |
---|
381 | { |
---|
382 | if (typed) return omStrDup("list()"); |
---|
383 | return omStrDup(""); |
---|
384 | } |
---|
385 | |
---|
386 | char** slist = (char**) omAlloc((l->nr+1) * sizeof(char*)); |
---|
387 | int i, j, k; |
---|
388 | char *s; |
---|
389 | for (i=0, j = 0, k = 0; i<=l->nr; i++) |
---|
390 | { |
---|
391 | slist[i] = l->m[i].String(NULL, typed, dim); |
---|
392 | assume(slist[i] != NULL); |
---|
393 | omCheckAddr(slist[i]); |
---|
394 | if (*(slist[i]) != '\0') |
---|
395 | { |
---|
396 | j += strlen(slist[i]); |
---|
397 | k++; |
---|
398 | } |
---|
399 | } |
---|
400 | s = (char*) omAlloc(j+k+2+(typed ? 10 : 0) + (dim == 2 ? k : 0)); |
---|
401 | |
---|
402 | if (typed) |
---|
403 | sprintf(s, "list("); |
---|
404 | else |
---|
405 | *s = '\0'; |
---|
406 | |
---|
407 | for (i=0; i<=l->nr; i++) |
---|
408 | { |
---|
409 | if (*(slist[i]) != '\0') |
---|
410 | { |
---|
411 | strcat(s, slist[i]); |
---|
412 | strcat(s, ","); |
---|
413 | if (dim == 2) strcat(s, "\n"); |
---|
414 | } |
---|
415 | omCheckAddr(s); |
---|
416 | omFree(slist[i]); |
---|
417 | } |
---|
418 | if (k > 0) s[strlen(s) - (dim == 2 ? 2 : 1)] = '\0'; |
---|
419 | if (typed) strcat(s, ")"); |
---|
420 | omCheckAddr(s); |
---|
421 | omFreeSize(slist, (l->nr+1) * sizeof(char*)); |
---|
422 | return s; |
---|
423 | } |
---|