Pythagorean triples: Difference between revisions

Content added Content deleted

Inline

@@ Line 177: / Line 177: @@
 __gshared xint total, prim;
-void triples(in xint in0, in xint in1, in xint in2,
+void triples(in xint maxPeri,
-             in xint maxPeri) nothrow {
+             in xint in0=3, in xint in1=4, in xint in2=5) nothrow {
     static enum xint[9][3] U = [[ 1, -2, 2,  2, -1, 2,  2, -2, 3],
                                 [ 1,  2, 2,  2,  1, 2,  2,  2, 3],
@@ Line 193: / Line 193: @@
     // recursively produce next tier by multiplying the matrices
     foreach (i; TypeTuple!(0, 1, 2))
-        triples(U[i][0] * in0 + U[i][1] * in1 + U[i][2] * in2,
+        triples(maxPeri,
+                U[i][0] * in0 + U[i][1] * in1 + U[i][2] * in2,
                 U[i][3] * in0 + U[i][4] * in1 + U[i][5] * in2,
-                U[i][6] * in0 + U[i][7] * in1 + U[i][8] * in2,
+                U[i][6] * in0 + U[i][7] * in1 + U[i][8] * in2);
-                maxPeri);
 }
@@ Line 202: / Line 202: @@
     foreach (p; 1 .. 10) {
         total = prim = 0;
-        triples(3, 4, 5, 10 ^^ p);
+        triples(10 ^^ p);
         writefln("Up to %10d: %10d triples, %8d primitives.",
 ^^ p, total, prim);