Initial commit

Author: ath0s

src/main/kotlin/Binary.kt

@@ -18,7 +18,7 @@ internal class Binary(
         bits[index]
 
     operator fun not() =
-        Binary(bits.map { !it }.toTypedArray())
+        Binary(bits.mapToArray { !it })
 
     override fun iterator() =
         bits.iterator()
@@ -28,7 +28,7 @@ internal fun Collection<Bit>.toBinary() =
     Binary(toTypedArray())
 
 internal fun String.toBinary() =
-    Binary(map { it.toBit() }.toTypedArray())
+    Binary(mapToArray { it.toBit() })
 
 internal fun Path.readBinaries() =
     readLines().map { it.toBinary() }

src/main/kotlin/Day00.kt

@@ -0,0 +1,14 @@
+class Day00: Day {
+    override fun partOne(filename: String, verbose: Boolean): Any {
+        TODO("Not yet implemented")
+    }
+
+    override fun partTwo(filename: String, verbose: Boolean): Any {
+        TODO("Not yet implemented")
+    }
+
+    companion object : Day.Main("Day00.txt") {
+        @JvmStatic
+        fun main(args: Array<String>) = main()
+    }
+}

src/main/kotlin/Matrix.kt

@@ -26,14 +26,10 @@ val <T> Matrix<T>.width
  * Interpret [this] as a filename and parse its contents to a matrix
  */
 internal inline fun <reified T> Path.parseMatrix(charTransformer: (Char) -> T): Matrix<T> =
-        readLines()
-        .map { it.map(charTransformer).toTypedArray() }
-        .toTypedArray()
+    readLines().mapToArray { it.mapToArray(charTransformer) }
 
 internal inline fun <reified T> String.parseMatrix(charTransformer: (Char) -> T): Matrix<T> =
-    lines()
-        .map { it.map(charTransformer).toTypedArray() }
-        .toTypedArray()
+    lines().mapToArray { it.mapToArray(charTransformer) }
 
 fun Path.parseMatrix() =
     parseMatrix { it }

src/main/kotlin/Utils.kt

@@ -43,6 +43,15 @@ fun <T> Set<T>.filter(predicate: (T) -> Boolean): Set<T> =
 fun <K, V> Iterable<Pair<K, V>>.toMutableMap() =
     toMap(mutableMapOf())
 
+inline fun <T, reified R> List<T>.mapToArray(transform: (T) -> R) =
+    Array(size) { transform(get(it)) }
+
+inline fun <reified R> CharSequence.mapToArray(transform: (Char) -> R) =
+    Array(length) { transform(get(it)) }
+
+inline fun <T, reified R> Array<T>.mapToArray(transform: (T) -> R) =
+    Array(size) { transform(get(it)) }
+
 fun <T> List<T>.allPairs(): List<Pair<T, T>> =
     dropLast(1).flatMapIndexed { index, element -> drop(index + 1).map { element to it } }
 

src/main/kotlin/dijkstra/Dijkstra.kt

@@ -5,7 +5,7 @@ fun <T> calculateShortestPathFromSource(source: Node<T>) {
     val settledNodes = mutableSetOf<Node<T>>()
     val unsettledNodes = mutableSetOf(source)
 
-    while (unsettledNodes.size != 0) {
+    while (unsettledNodes.isNotEmpty()) {
         val currentNode = getLowestDistanceNode(unsettledNodes)
         unsettledNodes -= currentNode
         for ((adjacentNode, edgeWeigh) in currentNode.adjacentNodes) {

src/test/kotlin/Day00Test.kt

@@ -0,0 +1,19 @@
+import org.junit.jupiter.api.assertThrows
+import kotlin.test.Test
+
+class Day00Test : DayTest<Day00>() {
+
+    @Test
+    override fun `Part One`() {
+        assertThrows<NotImplementedError> {
+            target.partOne("", true)
+        }
+    }
+
+    @Test
+    override fun `Part Two`() {
+        assertThrows<NotImplementedError> {
+            target.partTwo("", true)
+        }
+    }
+}