move entrypoints into test dir

Author: breandan

build.gradle.kts

@@ -81,21 +81,14 @@ tasks {
     }
   }
 
-  listOf("HelloKaliningraph", "Rewriter",
-    "PrefAttach", "rewriting.CipherSolver").forEach { fileName ->
+  listOf("HelloKaliningraph", "Rewriter", "PrefAttach",
+    "rewriting.CipherSolver", "RegexDemo").forEach { fileName ->
     register(fileName, JavaExec::class) {
       main = "edu.mcgill.kaliningraph.${fileName}Kt"
       classpath = sourceSets["test"].runtimeClasspath
     }
   }
 
-  listOf("RegexDemo").forEach { fileName ->
-    register(fileName, JavaExec::class) {
-      main = "edu.mcgill.kaliningraph.automata.${fileName}Kt"
-      classpath = sourceSets["main"].runtimeClasspath
-    }
-  }
-
   test {
     useJUnitPlatform()
     testLogging { events("passed", "skipped", "failed") }

src/main/kotlin/edu/mcgill/kaliningraph/CyclicalReference.kt

@@ -124,18 +124,4 @@ open class UnlabeledEdge(override val source: Gate, override val target: Gate):
   CGF, Edge<ComputationGraph, UnlabeledEdge, Gate>(source, target) {
   override fun render() = (target.render() - source.render()).add(Label.of(""))
     .add(if (source.neighbors.size == 1) BLACK else if (source.outgoing.indexOf(this) % 2 == 0) BLUE else RED)
-}
-
-fun main() {
-  CircuitBuilder {
-    val funA by def(a, b, c) { a + b + c }
-    j = funA(3, 2, 1)
-    j = b * c
-    d = e * f
-    g = 1 - h
-    i = a + d + g
-  }
-    //.reversed() //TODO: What is this even supposed to mean?
-    // Maybe this whole tower of abstractions wasn't such a good idea after all
-    .show()
 }

src/main/kotlin/edu/mcgill/kaliningraph/circuits/ComputationGraph.kt

@@ -0,0 +1,5 @@
+package edu.mcgill.kaliningraph.experimental
+
+// Immutable circular reference
+class Owl(lay: Owl.() -> Egg) { val egg by lazy { lay() } }
+class Egg(hatch: () -> Owl) { val owl by lazy { hatch() } }

src/main/kotlin/edu/mcgill/kaliningraph/experimental/CyclicalReference.kt

@@ -1,25 +1,4 @@
-package edu.mcgill.kaliningraph
-
-
-fun main() {
-  var head = DLL("a").let { ('c'..'f').fold(it) { a, b -> a + b.toString() } }
-//  println(head)
-  assertDLL(head)
-
-  head = head.insert("b")
-  println(head + head)
-  assertDLL(head)
-  println(head.reversed())
-}
-
-private fun assertDLL(head: DLL<String>) =
-  (1 until head.size - 1).map { head[it] }.forEach {
-    val isDLLForward = it.next.prev === it
-    val isDLLBack = it.prev.next === it
-    println(head)
-    assert(isDLLForward) { "${it.next.prev} != $it" }
-    assert(isDLLBack) { "${it.prev.next} != $it" }
-  }
+package edu.mcgill.kaliningraph.experimental
 
 class LL<T>(val head: T, val next: LL<T>? = null) {
   operator fun plus(t: T): LL<T> =

…/mcgill/kaliningraph/DoublyLinkedList.kt …ingraph/experimental/DoublyLinkedList.ktsrc/main/kotlin/edu/mcgill/kaliningraph/DoublyLinkedList.kt renamed to src/main/kotlin/edu/mcgill/kaliningraph/experimental/DoublyLinkedList.kt src/main/kotlin/edu/mcgill/kaliningraph/DoublyLinkedList.kt renamed to src/main/kotlin/edu/mcgill/kaliningraph/experimental/DoublyLinkedList.kt

@@ -0,0 +1,20 @@
+package edu.mcgill.kaliningraph.circuits
+
+import org.junit.jupiter.api.Test
+
+class CGraphTest {
+  @Test
+  fun testCircuitBuilder() {
+    CircuitBuilder {
+      val funA by def(a, b, c) { a + b + c }
+      j = funA(3, 2, 1)
+      j = b * c
+      d = e * f
+      g = 1 - h
+      i = a + d + g
+    }
+      //.reversed() //TODO: What is this even supposed to mean?
+      // Maybe this whole tower of abstractions wasn't such a good idea after all
+//      .show()
+  }
+}

…mcgill/kaliningraph/HelloKaliningraph.kt …mcgill/kaliningraph/HelloKaliningraph.ktsrc/main/kotlin/edu/mcgill/kaliningraph/HelloKaliningraph.kt renamed to src/test/kotlin/edu/mcgill/kaliningraph/HelloKaliningraph.kt src/main/kotlin/edu/mcgill/kaliningraph/HelloKaliningraph.kt renamed to src/test/kotlin/edu/mcgill/kaliningraph/HelloKaliningraph.kt

@@ -0,0 +1,17 @@
+package edu.mcgill.kaliningraph.experimental
+
+import org.junit.jupiter.api.Assertions.assertTrue
+import org.junit.jupiter.api.Test
+
+class CyclicalReferenceTest {
+  @Test
+  fun testCyclicalReference() {
+    val owl = Owl { Egg { this } }
+    println(owl)
+    println(owl.egg)
+    println(owl.egg.owl)
+    println(owl.egg.owl.egg)
+    assertTrue(owl === owl.egg.owl)
+    assertTrue(owl.egg === owl.egg.owl.egg)
+  }
+}

src/test/kotlin/edu/mcgill/kaliningraph/circuits/CGraphTest.kt

@@ -0,0 +1,27 @@
+package edu.mcgill.kaliningraph.experimental
+
+import org.junit.jupiter.api.Assertions.assertTrue
+import org.junit.jupiter.api.Test
+
+class DoublyLinkedListTest {
+  @Test
+  fun testDLL() {
+    var head = DLL("a").let { ('c'..'f').fold(it) { a, b -> a + b.toString() } }
+//  println(head)
+    assertDLL(head)
+
+    head = head.insert("b")
+    println(head + head)
+    assertDLL(head)
+    println(head.reversed())
+  }
+
+  private fun assertDLL(head: DLL<String>) =
+    (1 until head.size - 1).map { head[it] }.forEach {
+      val isDLLForward = it.next.prev === it
+      val isDLLBack = it.prev.next === it
+      println(head)
+      assertTrue(isDLLForward) { "${it.next.prev} != $it" }
+      assertTrue(isDLLBack) { "${it.prev.next} != $it" }
+    }
+}