@@ -289,10 +289,10 @@ function reducechain_costachunks(u,g,m,S,f,pseudoInverseMat,p,Ruvs,termorder,var
289289 if vars_reversed == false
290290 I = reverse (I) # parity issue due to Costa's code being reverse from ours
291291 end
292- println (" Expanded I: $I " )
292+ # println("Expanded I: $I")
293293
294294 gMat = g
295- println (gMat)
295+ # println(gMat)
296296 # chain = 0
297297 I_edgar = [x// 7 for x in I]
298298 # verbose && println("This is I: $I_edgar")
@@ -304,7 +304,7 @@ function reducechain_costachunks(u,g,m,S,f,pseudoInverseMat,p,Ruvs,termorder,var
304304 else
305305 V = chooseV (Array {Int} (divexact .(I,p)),d)
306306 end
307- println (" V: $V " )
307+ # println("V: $V")
308308 # verbose && println("LOOK! I=$I, V = $V")
309309
310310
@@ -340,7 +340,7 @@ function reducechain_costachunks(u,g,m,S,f,pseudoInverseMat,p,Ruvs,termorder,var
340340 # verbose && println("After step $i: $gMat")
341341
342342 i = i+ 1
343- println (gMat)
343+ # println(gMat)
344344 end
345345 end
346346 # TODO : test how much of a difference the fast evaluation actually makes
@@ -356,7 +356,7 @@ function reducechain_costachunks(u,g,m,S,f,pseudoInverseMat,p,Ruvs,termorder,var
356356 else
357357 y = tweak (J - i* V,d* n- n) - tweak (J - (i+ 1 )* V,d* n- n)
358358 end
359- println (" V: $y " )
359+ # println("V: $y")
360360 # verbose && println("Getting y direction reduction matrix for V = $(y)")
361361 # there's some sort of parity issue between our code and Costa's
362362 # A,B = computeRPoly_LAOneVar(y,rev_tweak(J - (i+1)*V,d*n-n) - y,S,n,d,f,pseudoInverseMat,R,PR,termorder)
@@ -369,7 +369,7 @@ function reducechain_costachunks(u,g,m,S,f,pseudoInverseMat,p,Ruvs,termorder,var
369369 end
370370
371371 gMat = (A+ B)* gMat
372- println (gMat)
372+ # println(gMat)
373373 # verbose && println("After step $(i+1): $gMat")
374374
375375 i = i+ 1
0 commit comments