Changeset 360741 in git

Timestamp:

Jan 21, 2020, 4:38:40 PM (4 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

f47408b1fbaa5550e599a333fbef837cbffa286d

Parents:

b262f1218ae1112aa4dde91dcd16243c0b6acfeecbf01b413214dc520717e4af698cf40a2a2954e4

Message:

Merge branch 'sachinkm308-execute' into spielwiese

Files:

• Singular/LIB/autgradalg.lib (modified) (5 diffs)
• Singular/LIB/ring.lib (modified) (5 diffs)
• Singular/LIB/solve.lib (modified) (7 diffs)
• Singular/LIB/spcurve.lib (modified) (3 diffs)
• Singular/LIB/standard.lib (modified) (8 diffs)
• Singular/LIB/tropical.lib (modified) (6 diffs)
• Singular/LIB/zeroset.lib (modified) (6 diffs)
• Tst/Manual/laguerre_solve.res.gz.uu (modified) (1 diff)
• Tst/Manual/laguerre_solve.stat (modified) (1 diff)

Singular/LIB/autgradalg.lib

@@ -1548 +1548 @@
   def R = basering;
 
-  string Sstr = "ring S = (" + charstr(basering)  + "), Y(nvars(basering)..1), dp;";
-  execute(Sstr);
+  list l6;
+  for (int zz = 1; zz <= nvars(basering); zz++)
+  {
+   l6[zz] = "Y("+string(nvars(basering)+1-zz)+")";
+  }
+  ring S = create_ring(ringlist(basering)[1], l6, "dp", "no_minpoly");
   setring S;  //creates a ring of shape '0, Y(nvars(basering)..1), dp'
 
@@ -2482 +2486 @@
 // helper
 static proc adjoinVar(int n0){
-  string S2str = "ring S2 = (" + charstr(basering) + "),((";
+  string S2str = "(";
 
   for(int i = n0 + 1; i <= nvars(basering); i++){
@@ -2490 +2494 @@
       S2str = S2str + ", ";
     } else {
-      S2str = S2str + "), Z),(dp(nvars(basering) - n0), dp(1))";
-    }
-  }
-
-  execute(S2str);
+      S2str = S2str + ", Z)";
+    }
+  }
+  ring S2 = create_ring(ringlist(basering)[1], S2str, "(dp("+string(nvars(basering) - n0)+"), dp(1))", "no_minpoly");
   return(S2);
 }
@@ -3313 +3316 @@
   }
 
-  string s  = "ring S = ("+ charstr(R) + "), ("; //charstr: e.g. 0,a
+  string s  = "(";
   int firstone = 1;
   int n = 0; // no of variables in new ring
@@ -3330 +3333 @@
   }
 
-  s = s + "),(dp(" + string(n-1) + "), dp(1));";
-  execute(s);
+  s = s + ")";
+  ring S = create_ring(ringlist(R)[1], s, "(dp(" + string(n-1) + "), dp(1))", "no_minpoly");     //charstr: e.g. 0,a
 
   // map the ideal to Small:

Singular/LIB/ring.lib

@@ -250 +250 @@
    if (n >26)
    {
-      string s="ring S ="+string(p)+",x(1.."+string(n)+"),ds;";
+    list l1;
+    for (int zz = 1; zz <= n; zz++)
+    {
+     l1[zz] = "x("+string(zz)+")";
+    }
+    ring S = create_ring(p, l1, "ds");
    }
    else
    {
-      string s="ring S ="+string(p)+",("+A_Z("x",n)+"),ds;";
-   }
-   execute(s);
+    ring S = create_ring(p, "("+A_Z("x",n)+")", "ds");
+   }
    dbprint(printlevel-voice+2,"
 // 'defrings' created a ring. To see the ring, type (if the name R was
@@ -286 +290 @@
    if (n >26)
    {
-      string s="ring P="+string(p)+",x(1.."+string(n)+"),dp;";
+    list l2;
+    for (int zz = 1; zz <= n; zz++)
+    {
+     l2[zz] = "x("+string(zz)+")";
+    }
+    ring P = create_ring(p, l2, "dp");
    }
    else
    {
-     string s="ring P="+string(p)+",("+A_Z("x",n)+"),dp;";
-   }
-   execute(s);
+    ring P = create_ring(p, "("+A_Z("x",n)+")", "dp");
+   }
    dbprint(printlevel-voice+2,"
 // 'defringp' created a ring. To see the ring, type (if the name R was
@@ -761 +769 @@
     {
       ideal I=ideal(S);
-      newRing="ring S0=("+charstr(S)+"),("+varstr(S)+"),dp;";
       minpoly_string=string(minpoly);
-      execute(newRing);
+      list l8 = ringlist(S)[2];
+      ring S0 = create_ring(ringlist(S)[1], l8, "dp", "no_minpoly");
       execute("minpoly="+minpoly_string+";");
       ideal I=imap(S,I);
       list pr=primdecGTZ(I);
-      newRing="ring SL=("+charstr(S)+"),("+varstr(S)+"),("+ordstr(S)+");";
-      execute(newRing);
+      ring SL = create_ring(ringlist(S)[1], l8, "("+ordstr(S)+")", "no_minpoly");
       execute("minpoly="+minpoly_string+";");
       list pr=imap(S0,pr);
@@ -799 +806 @@
     {
       ideal J=ideal(@R);
-      newRing="ring R0=("+charstr(@R)+"),("+varstr(@R)+"),dp;";
+      list l9 = ringlist(@R)[2];
       minpoly_string=string(minpoly);
-      execute(newRing);
+      ring R0 = create_ring(ringlist(@R)[1], l9, "dp", "no_minpoly");
       execute("minpoly="+minpoly_string+";");
       ideal J=imap(@R,J);
       list pr=primdecGTZ(J);
-      newRing="ring RL=("+charstr(@R)+"),("+varstr(@R)+"),("+ordstr(@R)+");";
-      execute(newRing);
+      setring(@R);
+      ring RL = create_ring(ringlist(@R)[1], l9, "("+ordstr(@R)+")", "no_minpoly");
       execute("minpoly="+minpoly_string+";");
       list pr=imap(R0,pr);
@@ -1165 +1172 @@
 }
 example
-{ "EXAMPLE:", echo=2;
+{ "EXAMPLE:"; echo=2;
  ring r=0,(x,y,z),dp;
  hasCommutativeVars(r);

Singular/LIB/solve.lib

@@ -59 +59 @@
   if ((charstr(basering)[1]=="0") and (npars(basering)!=0))
     {ERROR("basering has parameters");}
-  int OLD_COMPLEX=0;
   int iv=checkv(f);  // check for variable appearing in f
   if(iv==0){ERROR("Wrong polynomial!");}
@@ -90 +89 @@
   if(npars(basering)==1)
   {
-    if(OLD_COMPLEX)
-    {
-      tt="1,"+string(par(1));
-      if(tt==charstr(basering))
-      {ss=tt;ringprec=system("getPrecDigits");}
-    }
-    else
-    {
-      tt=charstr(basering);
-      if(size(tt)>7)
-      {
-        if(string(tt[1..7])=="complex")
-        {
-          ss=tt;
-          ringprec=system("getPrecDigits");
-        }
+    tt=charstr(basering);
+    if(size(tt)>7)
+    {
+      if(string(tt[1..7])=="complex")
+      {
+        ss=tt;
+        ringprec=system("getPrecDigits");
       }
     }
@@ -135 +125 @@
   if (ringprec<numberprec)
   {
-    tt="ring lagc=(complex,"+string(numberprec)+","+string(numberprec)+
-       "),"+string(var(iv))+",lp;";
-    execute(tt);
+    ring lagc = create_ring("(complex,"+string(numberprec)+","+string(numberprec)+")", string(var(iv)), "lp");
     poly p=imap(rn,p);
     poly v=var(1);
@@ -173 +161 @@
       else
       {
-        oo="ring exa=0,"+string(var(1))+",lp;";
-        execute(oo);
+        ring exa = create_ring(0, string(var(1)), "lp");
         ideal SQQQQ=splitsqrfree(imap(rn,p),var(1));
         setring lagc;
@@ -237 +224 @@
   if((solutionprec<numberprec)&&(size(ss)==0))// shorter output
   {
-    oo="ring lout=(complex,"+string(solutionprec)+",1),"
-    +string(var(1))+",lp;";
-    execute(oo);
+    ring lout = create_ring("(complex,"+string(solutionprec)+",1)", string(var(1)), "lp");
     list roots=imap(lagc,roots);
     roots=transroots(roots);
@@ -1858 +1843 @@
 
     // change the ground field to complex numbers
-    string nrings= "ring RC =(complex,"+string(prec)
-        +"),("+varstr(basering)+"),lp;";
-    execute(nrings);
+    list l1 = ringlist(basering)[2];
+    ring RC = create_ring("(complex,"+string(prec)+")", l1, "lp");
 
     // map fi from old to new ring
@@ -2059 +2043 @@
 
     // change the ground field to complex numbers
-    string nrings= "ring RC =(complex,"+string(prec)
-        +",I),("+varstr(basering)+"),lp;";
-    execute(nrings);
+    list l2 = ringlist(basering)[2];
+    ring RC = create_ring("(complex,"+string(prec)+",I)", l2, "lp");
 
     // list with entry 0 (number)

Singular/LIB/spcurve.lib

@@ -360 +360 @@
 //---------------------------------------------------------------------------
   intvec a=weight(m);
-  string tempstr="ring rneu=" + charstr(r) + ",(" + varstr(r) + "),Ws(" + string(a) + ");";
-  execute(tempstr);
+  list l1 = ringlist(r)[2];
+  ring rneu = create_ring(ringlist(r)[1], l1, "Ws(" + string(a) + ")", "no_minpoly");
   def M=imap(r,M);
   int difset=0;
@@ -786 +786 @@
     ERROR("The matrix was not n x (n+1) or not quasihomogenous");
   }
-  string ringre=" ring r=" + charstr(rt) + ",(x,y,z), Ws(" + string(wl[1]) + ");";
-  execute(ringre);
+  string orderKSK;
+  ring r = create_ring(ringlist(rt)[1], "(x,y,z)", "Ws(" + string(wl[1]) + ")", "no_minpoly");
   matrix M=imap(rt,M);
   int ne=size(M);
@@ -827 +827 @@
   if(defined(desiredorder)>1)
   {
-    ringre="ring re=" + charstr(r) +",(e(1.." + string(ne) + "),"+
-                        varstr(basering) + "),Ws(";
+    orderKSK ="Ws(";
     intvec tempiv=intvec(wl[2]);
     for(i=1;i<=ne;i++)
     {
-      ringre=ringre + string((-1)*tempiv[desiredorder[i]]) + ",";
-    }
-    ringre= ringre  + string(wl[1]) + ");";
+      orderKSK = orderKSK + string((-1)*tempiv[desiredorder[i]]) + ",";
+    }
+    orderKSK = orderKSK  + string(wl[1]) + ");";
+    list l2;
+    for (int zz = 1; zz <= ne; zz++)
+    {
+     l2[zz] = "e("+string(zz)+")";
+    }
+    list l3 = ringlist(basering)[2];
+    l2 = l2+l3;
+    ring re = create_ring(ringlist(r)[1], l2, orderKSK, "no_minpoly");
   }
   else
   {
-    ringre="ring re=" + charstr(r) +",(e(1.." + string(ne) + "),"+ varstr(basering)
-                        + "),Ws(" + string((-1)*intvec(wl[2])) + ","
-                        + string(wl[1]) + ");";
-  }
-  execute(ringre);
+    list l4;
+    for (int zz = 1; zz <= ne; zz++)
+    {
+     l4[zz] = "e("+string(zz)+")";
+    }
+    list l5 = ringlist(basering)[2];
+    l4 = l4+l5;
+    ring re = create_ring(ringlist(r)[1], l4, "Ws(" + string((-1)*intvec(wl[2])) + ","+ string(wl[1]) + ")", "no_minpoly");
+  }
   module temp=imap(r,t1qh);
   ideal t1qh=mod2id(temp,iv);

Singular/LIB/standard.lib

@@ -1352 +1352 @@
    if(find(ordstr(P),"s")==0)
    {
-      string ri= "ring Phelp ="
-                  +string(char(P))+",("+varstr_P+"),(dp,C);";
-      ri = ri + "minpoly = "+string(minpoly) + ";";
-      execute(ri);
+      ring Phelp = create_ring("+string(char(P))+", "("+varstr_P+")", "(dp,C)", "+string(minpoly)+");
       def m=imap(P,m);
       if (p_opt) { "using mres in another ring";}
@@ -1368 +1365 @@
    if(size(#)<=2)
    {
-      string ri= "ring Phelp ="
-                  +string(char(P))+",("+varstr_P+"),(ls,c);";
-      ri = ri + "minpoly = "+string(minpoly) + ";";
-      execute(ri);
+      ring Phelp = create_ring("+string(char(P))+", "("+varstr_P+")", "(ls,c)", "+string(minpoly)+");
       def m=imap(P,m);
       m=std(m);
@@ -1382 +1376 @@
 
    //mres for the local case and minimal resolution
-   string ri= "ring Phelp ="
-                  +string(char(P))+",("+varstr_P+"),(ls,C);";
-   ri = ri + "minpoly = "+string(minpoly) + ";";
-   execute(ri);
+   ring Phelp = create_ring("+string(char(P))+", "("+varstr_P+")", "(ls,C)", "+string(minpoly)+");
    def m=imap(P,m);
     if (p_opt) { "using mres in another ring";}
@@ -1589 +1580 @@
 RETURN:  the quotient of m1 and m2"
 {
-  string s="ring @newr=("+charstr(basering)+
-           "),("+varstr(basering)+",@t,@w),dp;";
   def @newP=basering;
-  execute(s);
+  ring @newr = create_ring(ringlist(basering)[1], "("+varstr(basering)+", @t, @w)", "dp", "no_minpoly");
   module b=imap(@newP,b);
   module a=imap(@newP,a);
@@ -1612 +1601 @@
 RETURN:  the quotient of m1 and m2"
 {
-  string s="ring @newr=("+charstr(basering)+
-           "),("+varstr(basering)+",@t),dp;";
   def @newP=basering;
-  execute(s);
+  ring @newr = create_ring(ringlist(basering)[1], "("+varstr(basering)+", @t)", "dp", "no_minpoly");
   module b=imap(@newP,b);
   module a=imap(@newP,a);
@@ -1636 +1623 @@
 RETURN:  the quotient of m1 and m2"
 {
-  string s="ring @newr=("+charstr(basering)+
-           "),("+varstr(basering)+",@t),dp;";
   def @newP=basering;
-  execute(s);
+  ring @newr = create_ring(ringlist(basering)[1], "("+varstr(basering)+", @t)", "dp", "no_minpoly");
   module b=imap(@newP,b);
   module a=imap(@newP,a);
@@ -2759 +2744 @@
 
   /* return ring */
-  def S = ring(L);
+  //L;
+  def S = ring(L); 
   if (kill_ring)
   {
@@ -2770 +2756 @@
   "EXAMPLE:"; echo = 2;
   ring R = (0,a), x, lp;
+  ringlist(R);
   minpoly = a^2+1;
   qring Q = ideal(x^3-2);

Singular/LIB/tropical.lib

@@ -4885 +4885 @@
     if (anzahlvariablen+numberdeletedvariables<nvars(basering))
     {
-      execute("ring PARARing=("+charstr(basering)+",X("+string(1)+".."+string(nvars(basering)-anzahlvariablen-numberdeletedvariables)+")),t,ls;");
+      list l2; 
+      for (int zz = 1; zz <= (nvars(basering)-anzahlvariablen-numberdeletedvariables); zz++)
+      {
+       l2[zz] = "X("+string(zz)+")";
+      }
+      ring PARARing = create_ring("("+charstr(basering)+","+string(l2)+")", "t", "ls");
     }
     else
@@ -5078 +5083 @@
       variablen=variablen+var(j);
     }
-    execute("ring TRANSFORMRING=("+charstr(basering)+"),("+string(variablen)+",X("+string(nvars(BASERING)-anzahlvariablen+1)+".."+string(nvars(BASERING)-anzahlvariablen+neuvar)+"),t),(dp("+string(anzahlvariablen-1)+"),dp("+string(nvars(BASERING)+neuvar-anzahlvariablen)+"),lp(1));");
+    list l3; 
+    for (int zz = string(nvars(BASERING)-anzahlvariablen+1); zz <= string(nvars(BASERING)-anzahlvariablen+neuvar); zz++)
+    {
+     l3[zz] = "X("+string(zz)+")";
+    }
+    ring TRANSFORMRING = create_ring(ringlist(basering)[1], "("+string(variablen)+","+string(l3)+",t)", "(dp("+string(anzahlvariablen-1)+"),dp("+string(nvars(BASERING)+neuvar-anzahlvariablen)+"),lp(1))", "no_minpoly");
     // map i into the new ring
     ideal i=imap(BASERING,i);
@@ -6181 +6191 @@
       if (anzahlvariablen>2)
       {
-        string elring="ring ELIMINATERING=("+charstr(basering)+"),("+string(simplify(reduce(maxideal(1),std(var(lastvar))),2))+"),(dp("+string(anzahlvariablen-2)+"),";
+        string elring="(dp("+string(anzahlvariablen-2)+"),";
       }
       else
       {
-        string elring="ring ELIMINATERING=("+charstr(basering)+"),("+string(simplify(reduce(maxideal(1),std(var(lastvar))),2))+"),(";
+        string elring="(";
       }
       if (anzahlvariablen<nvars(basering)) // if @a was present, the
@@ -6192 +6202 @@
       }
       elring=elring+"lp(1));";
-      execute(elring);
+      ring ELIMINATERING = create_ring(ringlist(basering)[1], "("+string(simplify(reduce(maxideal(1),std(var(lastvar))),2))+")", elring, "no_minpoly");
       ideal i=imap(BASERING,I); // move the ideal I to the new ring
       // if not yet all variables have been checked,
@@ -6315 +6325 @@
     if (anzahlvariablen>1)
     {
-      string elring="ring ELIMINATERING=("+charstr(basering)+"),("+string(variablen)+"),(dp("+string(anzahlvariablen-1)+"),";
+      string elring="(dp("+string(anzahlvariablen-1)+"),";
     }
     else
     {
-      string elring="ring ELIMINATERING=("+charstr(basering)+"),("+string(variablen)+"),(";
+      string elring="(";
     }
     if (size(deletedvariables)+1<nvars(basering)) // if @a was present,
@@ -6326 +6336 @@
     }
     elring=elring+"lp(1));";
-    execute(elring);
+    ring ELIMINATERING = create_ring(ringlist(basering)[1], "("+string(variablen)+")", elring, "no_minpoly");
     ideal i=imap(BASERING,i);
     ideal m=imap(BASERING,m);

Singular/LIB/zeroset.lib

@@ -421 +421 @@
   int n = nvars(basering);
   def RINB = basering;
-  string ringSTR = "ring RINR = 0, " + string(var(n)) + ", dp;";
-  execute(ringSTR);        // new ring = Q[a]
+  ring RINR = create_ring(0, string(var(n)), "dp");       // new ring = Q[a]
 
   list gcdList;
@@ -637 +636 @@
   if(npars(basering) == 0) { @parName = "0";}
   else { @parName = "(0, " + parstr(basering) + ")"; }
-  @str = "ring @RGCD = " + @parName + ", " + string(var(varIndex)) + ", dp;";
-  execute(@str);
+  ring @RGCD = create_ring(@parName, string(var(varIndex)), "dp");
   if(@mp != "0") { execute ("minpoly = " + @mp + ";"); }
   execute("poly @f = " + @sf + ";");
@@ -717 +715 @@
   g = f;
 
-  ringSTR = "ring SNRM1 = 0, " + string(var(1)) + ", dp;";  // univariate ring
-  execute(ringSTR);
+  ring SNRM1 = create_ring(0, string(var(1)), "dp");     // univariate ring
   poly N, N1, h;        // N, N1 do not contain 'a', use built-in gcd
   h = gcd(imap(SNRMB, N), imap(SNRMB, N1));
@@ -1100 +1097 @@
       // create univariate ring
 
-      ringSTR = "ring RIS1 = 0, (" + string(var(vars[1])) + ", " + string(var(n+1)) + "), lp;";
-      execute(ringSTR);
+      ring RIS1 = create_ring(0, "(" + string(var(vars[1])) + ", " + string(var(n+1)) + ")", "lp");
       ideal mpoly = std(imap(NLZR, mpoly));
       list roots;
@@ -1405 +1401 @@
     minPoly = string(minpoly);
   }
-  ringSTR = "ring TR = 0, (" + varstr(basering) + "," + parName + "), lp;";
-
-  execute(ringSTR);
+  ring TR = create_ring(0, "(" + varstr(basering) + "," + parName + ")", "lp");
   execute("ideal mpoly = std(" + minPoly + ");");
   export(mpoly);
@@ -1444 +1438 @@
   varString = varString + string(var(n-1));
 
-  ringSTR = "ring TR = " + parName + ", (" + varString + "), lp;";
-  execute(ringSTR);
+  ring TR = create_ring(parName, "(" + varString + ")", "lp");
   if(MP) { minpoly = number(imap(BR, mpoly)[1]); }
   setring BR;

Tst/Manual/laguerre_solve.res.gz.uu

@@ -1 +1 @@
 begin 640 laguerre_solve.res.gz
-M'XL(",E%,4\``VQA9W5E<G)E7W-O;'9E+G)E<P!M5%UOVC`4?>=77%63%MH0
-M_!$G#A4\5.VF2E5?NK=JJT(PQ:I)4.P`W:_?=8#PL4)$D._Q_3CGV"^_[A^?
-M`8!.X.GQ#JZ<=9'1TZM;P']ONM0NZ-_V_!LF$S#Y>Z/J6KW9RJQ55*I-9%WN
-M>B_[+&R?91=N\W0Q/H'A$'[H<@:Y,5!7E;-0S2$OH2GU.J]U[A2L*O-95DN=
-M&VBL+M_A:5_RNX6E<HMJ-NHRQA'4'E);.@82!MOPLQ^:U;&DF+3Y8`YCH&(K
-MX`:VW/\P&``E1V#2]D8)S/2[QK96M2JTU579(=+H8OA@'E*"U+S2WZ,>`D@D
-M,Q8G/(W3K/?*=HO!@$0ISU@J.9?\1E^32'`A:$9(*ON]5_X5;/`?+-[#2,0R
-M3N($OW&+0@`GA/$L093X`G5SB3K,(]N)GZL-;+1;0%$M5T9M\:WF<UUH53H;
-M=N`L\F!=.E67*$S'#F@+O",MF*EYWAC7%:$D0BQN,VJMS)AU?%-TVUZY8@S!
-MOCCR&>I^N#V5D+(3"0,J(C^1Z%]O_W@Q`R8BH@8,UYA?.]'V6A]SH/.,M@X,
-MYK@4$14<#N\>?B+P/(3+156ZNC*CCIVVYY:O(P6<(')3U1\^ILL1[%"8K!AW
-MDW&"SV$TI/+P.7'[(K=?JH!PNS)X_'0)AS*^PJ@+^(:JQD&M++*/RP_/]Y?#
-M'*B(D8JC9[WOI!`I3Q,I6.L5M%V:)#&5WG<G+A9QPF0FA)2M\9(T2Y)$RI2?
-MN)A$)$9`G$G"LYWS*.<L2VB:G;E8$#PF1+(T:Y-)(O"ADLDS%V-+,:$Q%VF;
-MBU$\7`GA/#X:3+0N+A:J^-B/'\(Z-XWR%XMMIM9IUS@U.R7:(EEF!E,%I<IK
-M<!7\5775I4Q:K]=JJ993A>%%[HWCK9#KTD*^LY)/[[P,MMN8[@\);E%0Y+;M
-M(<?#,9^K&I5L5>O0,MKUA]<(N@(%02.2+II-SJ+L+,K(I+V<_<W;V(#V;[_U
-*_@%`).JWQP4`````
+M'XL("$H8)UX"`VQA9W5E<G)E7W-O;'9E+G)E<P!M5%UOXC`0?.=7K*J3+K0A
+M^"-.'"IXJ-H[5:KZTGNK[JH03+%J$A0[E-ZOOW4(@7(%!,@[&>_.C/WTZ_;^
+M$0#H#![N;^#"61<9/;^X!OSWHDOM@N'UP/_";`8F?VU47:L76YFMBDKU'EF7
+MN\%3Q\(ZEGVYY>EK?`;C,?S0Y0)R8Z"N*F>A6D)>0E/J;5[KW"G85.:CK-8Z
+M-]!87;["0[?E=PMKY5;58M(SQA'4'E);.@42!KOP8QB:S7%+,6OY8`E3H&(G
+MX`IVW'\Q&`$E1V#2]D8)+/2KQK8VM2JTU579(]+H;/A@&5*"TCS3WY,!`D@D
+M,Q8G/(W3;/#,]HO!B$0ISU@J.9?\2E^22'`A:$9(*H>#9_X5;/0?+.Y@)&(9
+M)W&"[[A%(8`3PGB6($I\@;HZ1QWFD>W$C]4[O&NW@J):;XS:X:]:+G6A5>EL
+MV(.SR(-UZ51=HC&].J`M\%ZT8*&6>6-<OPDE$6+Q,:.VRDQ9KS?%M'7.%5,(
+MNLU1SU`/P]VIA92=6!A0$?F)Q/!R]\>;&3`1$35BN,;\VHFWE_K(@<DSVCHP
+MR'%N(CHX'M_<_43@YQ(N%U7IZLI,>G7:GEN]CA)P@LCWJG[S-5U.`$[&\1-A
+M&0ZODW2O<ONEZ@BW&X/'39=PH/7[3OJ";Z!J'-3*HMJX?/=X>][\8?081^\R
+MZD,FA4AYFDC!VF!@QM(DB:GT(6,=1L0)DYD04K812](L21(I4][E%?-%8JS&
+MF20\VP>,<LZRA*99%U;$"()'@4B69BV-)`(_5#+9)37PW;"8T)B+M&5A%$]/
+M0CB/CPD2;4R+E2K>NGE#V.:F4?[FL,W<.NT:IQ:GREI4QRQ@KJ!4>0VN@K^J
+MKGK*I`USK=9J/5=87N4^&=[K7)<6\GU6/+WSNMO^P;0[!?B(@B*W;0\YIG^Y
+M5#5:U]K4HV6T[P_O"4PT.H!)(WTUFWVJLD]51F;M[>NOUL8&='C];?`/=/QS
+%OJ@%````
 `
 end

Tst/Manual/laguerre_solve.stat

@@ -1 @@
-1 >> tst_memory_0 :: 1328629193:3140- 14542 :3-1-4:ix86-Linux:snork:242252
-1 >> tst_memory_1 :: 1328629193:3140- 14542 :3-1-4:ix86-Linux:snork:2244900
-1 >> tst_memory_2 :: 1328629193:3140- 14542 :3-1-4:ix86-Linux:snork:2282860
-1 >> tst_timer_1 :: 1328629193:3140- 14542 :3-1-4:ix86-Linux:snork:11
+1 >> tst_memory_0 :: 1579620426:4122, 64 bit:4.1.2:x86_64-Linux:nepomuck:191256
+1 >> tst_memory_1 :: 1579620426:4122, 64 bit:4.1.2:x86_64-Linux:nepomuck:2183168
+1 >> tst_memory_2 :: 1579620426:4122, 64 bit:4.1.2:x86_64-Linux:nepomuck:2291472
+1 >> tst_timer_1 :: 1579620426:4122, 64 bit:4.1.2:x86_64-Linux:nepomuck:6