Home
last modified time | relevance | path

Searched refs:degreelist (Results 1 – 10 of 10) sorted by relevance

/dports/math/plantri/plantri52/
H A Dallowed_deg.c59 static int degreelist[MAXN]; /* a list of allowed degrees ended by 0 */ variable
77 for (run=0; degreelist[run]; run++) anzahl[degreelist[run]]=0; in ad_filter()
79 for (run=0; degreelist[run]; run++) in ad_filter()
80 if ((anzahl[degreelist[run]]<minnumber[degreelist[run]]) || in ad_filter()
81 (anzahl[degreelist[run]]>maxnumber[degreelist[run]])) return(0); in ad_filter()
151 for(i=0;i<MAXN;i++) degreelist[i]=0; in list_of_allowed_degrees()
163 for (run=0; degreelist[run]; run++); degreelist[run]=n; in list_of_allowed_degrees()
/dports/math/reduce/Reduce-svn5758-src/packages/taylor/
H A Dtayutils.red175 % dl the degreelist of a coefficient.
249 symbolic procedure get!-min!-degreelist cfl;
251 if null cfl then confusion 'get!-min!-degreelist
254 get!-min!-degreelist cdr cfl);
270 else dl1 := get!-min!-degreelist cf1;
273 else dl2 := get!-min!-degreelist cf2;
313 else dl := get!-degreelist taycfpl car cf;
333 % both are of the form (degreelist . sq)
387 % equal than those in the degreelist ordlis
398 % equal than those in the degreelist ordlis
[all …]
H A Dtaysimp.red47 get!-degreelist, has!-tayvars, invert!-powerlist,
422 tp := addto!-all!-taytpelorders(tp,get!-degreelist l);
437 tp := addto!-all!-taytpelorders(tp,get!-degreelist l1);
H A Dtaylor.red347 % Added get!-min!-degreelist to find minimum degree list of a
382 % Introduced get!-degreelist.
986 get!-degree, get!-degreelist, has!-taylor!*, has!-tayvars,
1053 % Builds a coefficient from degreelist and s.q.
1248 symbolic inline procedure get!-degreelist dgl;
1262 % so generate an appropriate degreelist by adding the degrees.
H A Dtayintrf.red226 % (degreelist . coefficient)
H A Dtaybasic.red375 % plmin the list of the smallest terms, dgl the degreelist
/dports/math/singular/Singular-Release-4-2-1/factory/
H A DfacAlgFuncUtil.h70 getDegOfExt (IntList & degreelist, int n);
H A DfacAlgFuncUtil.cc539 getDegOfExt (IntList & degreelist, int n) in getDegOfExt() argument
543 int k= 1, m= 1, length= degreelist.length(); in getDegOfExt()
546 for (i= degreelist; i.hasItem(); i++) in getDegOfExt()
557 for (i= degreelist; i.hasItem(); i++) in getDegOfExt()
H A DfacAlgFunc.cc990 IntList degreelist; in facAlgFunc2() local
993 degreelist.append (degree (i.getItem())); in facAlgFunc2()
995 int extdeg= getDegOfExt (degreelist, degree (f)); in facAlgFunc2()
/dports/math/reduce/Reduce-svn5758-src/csl/generated-c/
H A Dprofile.dat26537 (get!-min!-degreelist 8744899286662908442 91 565360)
27271 (get!-min!-degreelist 8744899286662908442 91 29040)
30512 (get!-min!-degreelist 8744899286662908442 91 141884)