remove commented code at eof

Author: ollieclarke8787

M2/Macaulay2/packages/AllMarkovBases.m2

@@ -1431,72 +1431,3 @@ installPackage "AllMarkovBases"
 check AllMarkovBases
 
 viewHelp AllMarkovBases
-
-
-
-
-
--- computeFiberInternalDecompose = method(
---     Options => {
---         ReturnConnectedComponents => false,
---         FiberAlgorithm => "fast"
---         }
---     );
--- computeFiberInternalDecompose (Matrix,List) := opts -> (A,val) -> (
---     if opts.FiberAlgorithm == "decompose" and not A.cache#?"Ring" then(
---         A.cache#"Ring" = ZZ(monoid[Variables => 2*numRows A + numColumns A,MonomialOrder=>Eliminate (2*numRows A)]);
---         A.cache#"RingGenerators" = gens A.cache#"Ring";
---         A.cache#"toricIdeal"=toricGroebner(id_(ZZ^(numRows A)) | -id_(ZZ^(numRows A)) | A, A.cache#"Ring");
---         );
---     if (A.cache#"fiberStarters")#?val and opts.ReturnConnectedComponents then (
---         out := for z in pairs A.cache#"fiberValues" list(
--- 	    print z#1;
---             if z#1==val or not (z#1 << val) then continue;
---             resid := val-z#1;
---             if not (A.cache#"fibers")#?resid then fibRecursion(A,resid,FiberAlgorithm=>opts.FiberAlgorithm);
---             if #((A.cache#"fibers")#resid)==0 then continue;
---             fibAdd((A.cache#"posNeg")#(z#0),(A.cache#"fibers")#resid)
---             );
---         G := new HashTable from for i from 0 to #out-1 list (out#i,for j from i+1 to #out-1 list if not  #intersect(out#i,out#j)==0 then out#j else continue);
---         out = apply(connectedComponents graph(out,pairs G),z->toList union z);
---         out = out | apply(toList ((A.cache#"fiberStarters")#val - (flatten out)),v->{v});
---         (A.cache#"fiberComponents")#val = out;
---         (A.cache#"fibers")#val = flatten out;
---         )else fibRecursion(A,val,FiberAlgorithm=>opts.FiberAlgorithm);
---     );
-
--- -- recursive method using decompose algorithm (unexported)
--- fibRecursion = method(
---     Options => {
---         FiberAlgorithm => "decompose"
---         }
-
---     );
--- fibRecursion (Matrix,List) := opts -> (A, val) -> (
---     print val;
---     out := union for z in pairs A.cache#"fiberValues" list(
---         if not (z#1 << val) then continue;
---         if z#1==val and (A.cache#"fiberStarters")#?val then continue (A.cache#"posNeg")#(z#0);
---         resid := val-z#1;
---         if not (A.cache#"fibers")#?resid then fibRecursion(A,resid,FiberAlgorithm=>opts.FiberAlgorithm);
---         if #((A.cache#"fibers")#resid) == 0 then continue;
---         fibAdd((A.cache#"posNeg")#(z#0),(A.cache#"fibers")#resid)
---         );
---     if #out==0 then(
---         if opts.FiberAlgorithm == "markov" then (
---             for row in entries toricMarkov ((matrix vector val) | A) do(
---                 r := drop(row,1);
---                 if row#0 == 1 and all(r,z->z<=0) then (out = set{-r}; break;);
---                 );
---             )else (
---             e:=first exponents (product(for i from 0 to #val-1 list if val#i>0 then ((A.cache#"RingGenerators")#i)^(val#i) else ((A.cache#"RingGenerators")#(i+numRows A))^(-val#i)) % A.cache#"toricIdeal");
---             if take(e,2*numRows A) == toList((2*numRows A):0) then out = set{take(e,-numColumns A)};
---             );
---         );
---     (A.cache#"fibers")#val = out;
---     );
-
--- fibAdd = method();
--- fibAdd (Set,Set) := (L1,L2) -> (
---     set flatten for l1 in keys L1 list for l2 in keys L2 list l1+l2
---     );