change ordering of function definitions

Author: slightknack

gate.c

@@ -4,38 +4,6 @@
 
 typedef uint64_t cell;
 
-// human attempt, 54 gates
-cell conway_clayton(cell in[9]) {
-    // pairs
-    cell p00 = ~(in[0] | in[1]);
-    cell p10 = ~(in[2] | in[3]);
-    cell p20 = ~(in[5] | in[6]);
-    cell p30 = ~(in[7] | in[8]);
-    cell p01 = in[0] ^ in[1];
-    cell p11 = in[2] ^ in[3];
-    cell p21 = in[5] ^ in[6];
-    cell p31 = in[7] ^ in[8];
-    cell p02 = in[0] & in[1];
-    cell p12 = in[2] & in[3];
-    cell p22 = in[5] & in[6];
-    cell p32 = in[7] & in[8];
-    // halfs
-    cell h00 = p00 & p10;
-    cell h10 = p20 & p30;
-    cell h01 = (p00 & p11) | (p10 & p01);
-    cell h11 = (p20 & p31) | (p30 & p21);
-    cell h03 = (p02 & p11) | (p12 & p01);
-    cell h13 = (p22 & p31) | (p32 & p21);
-    cell h02 = (p02 & p10) | (p00 & p12) | (p01 & p11);
-    cell h12 = (p22 & p30) | (p20 & p32) | (p21 & p31);
-    // neighbors
-    cell n2 = (h01 & h11) | (h02 & h10) | (h00 & h12);
-    cell n3 = (h03 & h10) | (h13 & h00) | (h02 & h11 ) | (h12 & h01);
-    // rule
-    cell out = n3 | (in[4] & n2);
-    return out;
-}
-
 cell conway(cell in[9]) {
     cell in_0 = in[0];
     cell in_1 = in[1];
@@ -223,6 +191,38 @@ cell conway(cell in[9]) {
     return out;
 }
 
+// human attempt, 54 gates
+cell conway_clayton(cell in[9]) {
+    // pairs
+    cell p00 = ~(in[0] | in[1]);
+    cell p10 = ~(in[2] | in[3]);
+    cell p20 = ~(in[5] | in[6]);
+    cell p30 = ~(in[7] | in[8]);
+    cell p01 = in[0] ^ in[1];
+    cell p11 = in[2] ^ in[3];
+    cell p21 = in[5] ^ in[6];
+    cell p31 = in[7] ^ in[8];
+    cell p02 = in[0] & in[1];
+    cell p12 = in[2] & in[3];
+    cell p22 = in[5] & in[6];
+    cell p32 = in[7] & in[8];
+    // halfs
+    cell h00 = p00 & p10;
+    cell h10 = p20 & p30;
+    cell h01 = (p00 & p11) | (p10 & p01);
+    cell h11 = (p20 & p31) | (p30 & p21);
+    cell h03 = (p02 & p11) | (p12 & p01);
+    cell h13 = (p22 & p31) | (p32 & p21);
+    cell h02 = (p02 & p10) | (p00 & p12) | (p01 & p11);
+    cell h12 = (p22 & p30) | (p20 & p32) | (p21 & p31);
+    // neighbors
+    cell n2 = (h01 & h11) | (h02 & h10) | (h00 & h12);
+    cell n3 = (h03 & h10) | (h13 & h00) | (h02 & h11 ) | (h12 & h01);
+    // rule
+    cell out = n3 | (in[4] & n2);
+    return out;
+}
+
 typedef struct {
     cell* cells;
     size_t cells_len;

gate.c.template

@@ -4,6 +4,20 @@
 
 typedef uint64_t cell;
 
+cell conway(cell in[9]) {
+    cell in_0 = in[0];
+    cell in_1 = in[1];
+    cell in_2 = in[2];
+    cell in_3 = in[3];
+    cell in_4 = in[4];
+    cell in_5 = in[5];
+    cell in_6 = in[6];
+    cell in_7 = in[7];
+    cell in_8 = in[8];
+    {{ logic }}
+    return out;
+}
+
 // human attempt, 54 gates
 cell conway_clayton(cell in[9]) {
     // pairs
@@ -36,20 +50,6 @@ cell conway_clayton(cell in[9]) {
     return out;
 }
 
-cell conway(cell in[9]) {
-    cell in_0 = in[0];
-    cell in_1 = in[1];
-    cell in_2 = in[2];
-    cell in_3 = in[3];
-    cell in_4 = in[4];
-    cell in_5 = in[5];
-    cell in_6 = in[6];
-    cell in_7 = in[7];
-    cell in_8 = in[8];
-    {{ logic }}
-    return out;
-}
-
 typedef struct {
     cell* cells;
     size_t cells_len;