kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
reactivedevelopment__aoc-2022-5__f9f78bc/src/main/kotlin/com/adventofcode/Day.kt | package com.adventofcode
import com.adventofcode.Day.process
import com.adventofcode.Day.solution
import java.util.*
object Day {
private var script = false
private val scheme = mutableListOf<String>()
private val stackedColumns = mutableListOf<LinkedList<Char>>()
fun process(line: String) {
if (script)... | [
{
"class_path": "reactivedevelopment__aoc-2022-5__f9f78bc/com/adventofcode/DayKt$main$2.class",
"javap": "Compiled from \"Day.kt\"\nfinal class com.adventofcode.DayKt$main$2 extends kotlin.jvm.internal.FunctionReferenceImpl implements kotlin.jvm.functions.Function1<java.lang.String, kotlin.Unit> {\n com.ad... |
rainer-gepardec__aoc2022__c920692/src/main/kotlin/aoc10/Solution10.kt | package aoc10
import java.nio.file.Paths
fun main() {
val lines = Paths.get("src/main/resources/aoc_10.txt").toFile().useLines { it.toList() }
println(solution1(lines))
println(solution2(lines))
}
fun solution1(lines: List<String>): Int {
return solve(lines)
.filter { it.first == 20 || ((it.... | [
{
"class_path": "rainer-gepardec__aoc2022__c920692/aoc10/Solution10Kt.class",
"javap": "Compiled from \"Solution10.kt\"\npublic final class aoc10.Solution10Kt {\n public static final void main();\n Code:\n 0: ldc #10 // String src/main/resources/aoc_10.txt\n 2: icon... |
rainer-gepardec__aoc2022__c920692/src/main/kotlin/aoc03/Solution03.kt | package aoc03
import java.nio.file.Paths
val valueMap = calculateValueMap();
fun calculateValueMap(): Map<Char, Int> {
val tmpMap = mutableMapOf<Char, Int>()
var c = 'a';
while (c <= 'z') {
tmpMap[c] = c.code - 96;
c++
}
c = 'A'
while (c <= 'Z') {
tmpMap[c] = c.code -... | [
{
"class_path": "rainer-gepardec__aoc2022__c920692/aoc03/Solution03Kt.class",
"javap": "Compiled from \"Solution03.kt\"\npublic final class aoc03.Solution03Kt {\n private static final java.util.Map<java.lang.Character, java.lang.Integer> valueMap;\n\n public static final java.util.Map<java.lang.Character,... |
rainer-gepardec__aoc2022__c920692/src/main/kotlin/aoc05/Solution05.kt | package aoc05
import java.nio.file.Paths
/*
[D]
[N] [C]
[Z] [M] [P]
1 2 3
[J] [Z] [G]
[Z] [T] [S] [P] [R]
[R] [Q] [V] [B] [G] [J]
[W] [W] [N] [L] [V] [W] [C]
[F] [Q] [T] [G] [C] [T] [T] [W]
[H] [D] [W] [W] [H] [T] [R] [M] [B]
[T] [G] [T] [R] [B] [P] [B] [G] [G]
[S] ... | [
{
"class_path": "rainer-gepardec__aoc2022__c920692/aoc05/Solution05Kt.class",
"javap": "Compiled from \"Solution05.kt\"\npublic final class aoc05.Solution05Kt {\n public static final java.util.Map<java.lang.Integer, kotlin.collections.ArrayDeque<java.lang.String>> createStorage();\n Code:\n 0: new... |
rainer-gepardec__aoc2022__c920692/src/main/kotlin/aoc07/Solution07.kt | package aoc07
import java.nio.file.Paths
import kotlin.math.abs
class Node(val parent: Node?, val name: String, val type: String, val size: Int = 0) {
val children = mutableListOf<Node>()
override fun toString(): String {
return "$name ($type)"
}
}
fun main() {
val lines = Paths.get("src/mai... | [
{
"class_path": "rainer-gepardec__aoc2022__c920692/aoc07/Solution07Kt.class",
"javap": "Compiled from \"Solution07.kt\"\npublic final class aoc07.Solution07Kt {\n public static final void main();\n Code:\n 0: ldc #10 // String src/main/resources/aoc_07.txt\n 2: icon... |
rainer-gepardec__aoc2022__c920692/src/main/kotlin/aoc08/Solution08.kt | package aoc08
import java.nio.file.Paths
inline fun <T> Iterable<T>.takeWhileInclusive(
predicate: (T) -> Boolean
): List<T> {
var shouldContinue = true
return takeWhile {
val result = shouldContinue
shouldContinue = predicate(it)
result
}
}
fun main() {
val lines = Paths.... | [
{
"class_path": "rainer-gepardec__aoc2022__c920692/aoc08/Solution08Kt.class",
"javap": "Compiled from \"Solution08.kt\"\npublic final class aoc08.Solution08Kt {\n public static final <T> java.util.List<T> takeWhileInclusive(java.lang.Iterable<? extends T>, kotlin.jvm.functions.Function1<? super T, java.lan... |
chskela__adventofcode-2022-kotlin__951d38a/src/day01/Day01.kt | package day01
import java.io.File
import java.util.PriorityQueue
fun main() {
fun parseInput(input: String) = input.split("\n\n").map { str ->
str.lines().map { it.toInt() }
}
fun List<List<Int>>.topNElves(n: Int): Int {
val best = PriorityQueue<Int>()
for (calories in map { it.su... | [
{
"class_path": "chskela__adventofcode-2022-kotlin__951d38a/day01/Day01Kt.class",
"javap": "Compiled from \"Day01.kt\"\npublic final class day01.Day01Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
chskela__adventofcode-2022-kotlin__951d38a/src/day04/Day04.kt | package day04
import java.io.File
fun main() {
fun parseInput(input: String) = input
.lines()
.map {
it.split(",")
.map { s ->
s.split("-")
}
.map { (a, b) -> (a.toInt()..b.toInt()).toSet() }
}
fun part1(... | [
{
"class_path": "chskela__adventofcode-2022-kotlin__951d38a/day04/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class day04.Day04Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
chskela__adventofcode-2022-kotlin__951d38a/src/day03/Day03.kt | package day03
import java.io.File
fun main() {
fun Char.getPriorities(): Int = when {
isLowerCase() -> code - 96
isUpperCase() -> code - 38
else -> 0
}
fun parseInput(input: String) = input.lines()
fun part1(input: String): Int {
val data = parseInput(input)
... | [
{
"class_path": "chskela__adventofcode-2022-kotlin__951d38a/day03/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class day03.Day03Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
chskela__adventofcode-2022-kotlin__951d38a/src/day02/Day02.kt | package day02
import java.io.File
fun main() {
fun parseInput(input: String) = input.lines().map { it.split(" ") }.map { it.first() to it.last() }
val points = mapOf("X" to 1, "Y" to 2, "Z" to 3)
val winsPlayer = listOf("A" to "Y", "B" to "Z", "C" to "X")
val drawPlayer = listOf("A" to "X", "B" to "... | [
{
"class_path": "chskela__adventofcode-2022-kotlin__951d38a/day02/Day02Kt.class",
"javap": "Compiled from \"Day02.kt\"\npublic final class day02.Day02Kt {\n public static final void main();\n Code:\n 0: iconst_3\n 1: anewarray #8 // class kotlin/Pair\n 4: astore_1\... |
chskela__adventofcode-2022-kotlin__951d38a/src/day05/Day05.kt | package day05
import java.io.File
class Stack<T> {
private val mutableList = mutableListOf<T>()
fun push(vararg element: T) {
mutableList.addAll(element)
}
fun pop(): T? {
return if (mutableList.isNotEmpty()) {
mutableList.removeLast()
} else {
null
... | [
{
"class_path": "chskela__adventofcode-2022-kotlin__951d38a/day05/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class day05.Day05Kt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
chriscoomber__manydice__88b4823/src/commonMain/kotlin/chriscoomber/manydice/Theory.kt | package chriscoomber.manydice
/**
* A probability is close enough to another one if it's within this threshold.
*/
const val PROBABILITY_FLOAT_THRESHOLD = 0.0000001f
/**
* A probability is a real number between 0 and 1 inclusive. Users of this type
* should check it is within those bounds.
*/
typealias Probabil... | [
{
"class_path": "chriscoomber__manydice__88b4823/chriscoomber/manydice/TheoryKt.class",
"javap": "Compiled from \"Theory.kt\"\npublic final class chriscoomber.manydice.TheoryKt {\n public static final float PROBABILITY_FLOAT_THRESHOLD;\n\n public static final boolean equalsWithinThreshold(float, float);\n... |
Maxwell6635__TicTacToe__62f8035/app/src/main/java/com/jackson/tictactoe/utils/MinMaxAlgorithm.kt | package com.jackson.tictactoe.utils
object MinMaxAlgorithm {
private var player = 'x'
private var opponent = 'o'
private fun isMovesLeft(board: Array<CharArray>): Boolean {
for (i in 0..2) for (j in 0..2) if (board[i][j] == '_') return true
return false
}
private fun evaluate(b: A... | [
{
"class_path": "Maxwell6635__TicTacToe__62f8035/com/jackson/tictactoe/utils/MinMaxAlgorithm.class",
"javap": "Compiled from \"MinMaxAlgorithm.kt\"\npublic final class com.jackson.tictactoe.utils.MinMaxAlgorithm {\n public static final com.jackson.tictactoe.utils.MinMaxAlgorithm INSTANCE;\n\n private stat... |
ljuns__Practise__365062b/app/src/main/java/com/itscoder/ljuns/practise/algorithm/InsertionSort.kt | package com.itscoder.ljuns.practise.algorithm
/**
* Created by ljuns at 2019/1/5.
* I am just a developer.
* 插入排序
* 从第 2 个元素开始和前面的元素比较并排序
* 例如：1, 3, 2
* 1、第一次 for 循环：3 和 1 比较，不需要改变
* 2.1、第二次 for 循环：2 和 3 比较，调换位置变成 1, 2, 3，此时 j == 1
* 2.2、2 再和 1 比较，不需要改变，排序结束
*/
class InsertionSort {
fun main(args: Array... | [
{
"class_path": "ljuns__Practise__365062b/com/itscoder/ljuns/practise/algorithm/InsertionSort.class",
"javap": "Compiled from \"InsertionSort.kt\"\npublic final class com.itscoder.ljuns.practise.algorithm.InsertionSort {\n public com.itscoder.ljuns.practise.algorithm.InsertionSort();\n Code:\n 0: ... |
ljuns__Practise__365062b/app/src/main/java/com/itscoder/ljuns/practise/algorithm/ShellSort.kt | package com.itscoder.ljuns.practise.algorithm
/**
* Created by ljuns at 2019/1/9.
* I am just a developer.
* 希尔排序
*/
fun main(args: Array<String>) {
val arr = intArrayOf(3, 1, 1, 6, 2, 4, 19)
shellSort(arr)
arr.forEach { println(it) }
}
/**
* 3, 1, 1, 6, 2, 4, 19
* 1、gap = arr.size / 2，即分成 gap 组（偶... | [
{
"class_path": "ljuns__Practise__365062b/com/itscoder/ljuns/practise/algorithm/ShellSortKt.class",
"javap": "Compiled from \"ShellSort.kt\"\npublic final class com.itscoder.ljuns.practise.algorithm.ShellSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ... |
ljuns__Practise__365062b/app/src/main/java/com/itscoder/ljuns/practise/algorithm/MergeSort.kt | package com.itscoder.ljuns.practise.algorithm
/**
* Created by ljuns at 2019/1/8.
* I am just a developer.
* 归并排序
* 1、先将数组中间分割，直到无法分割
* 3, 1, 1, 6, 2, 4, 19
* 3, 1, 1, 6
* ... | [
{
"class_path": "ljuns__Practise__365062b/com/itscoder/ljuns/practise/algorithm/MergeSortKt.class",
"javap": "Compiled from \"MergeSort.kt\"\npublic final class com.itscoder.ljuns.practise.algorithm.MergeSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ... |
ljuns__Practise__365062b/app/src/main/java/com/itscoder/ljuns/practise/algorithm/HeadSort.kt | package com.itscoder.ljuns.practise.algorithm
import java.util.Collections.swap
/**
* Created by ljuns at 2019/1/7.
* I am just a developer.
* 堆排序
* 大顶堆：根节点 >= 左子节点 && 根节点 >= 右子节点
* 小顶堆：根节点 <= 左子节点 && 根节点 <= 右子节点
* 1、升序构建大顶堆，降序构建小顶堆
* 2、交换根节点和最后一个子节点，此时的最后一个子节点不再参与排序
* 3、重复 1、2
*/
fun main(args: Array<Strin... | [
{
"class_path": "ljuns__Practise__365062b/com/itscoder/ljuns/practise/algorithm/HeadSortKt.class",
"javap": "Compiled from \"HeadSort.kt\"\npublic final class com.itscoder.ljuns.practise.algorithm.HeadSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc... |
ljuns__Practise__365062b/app/src/main/java/com/itscoder/ljuns/practise/algorithm/QuickSort.kt | package com.itscoder.ljuns.practise.algorithm
/**
* Created by ljuns at 2019/1/5.
* I am just a developer.
* 快速排序
* 例如：3, 1, 1, 6, 2, 4, 19
* 1、定义 left 为最左边，right 为最右边；
* 2、选定 left 位置的元素为 temp；
* 3、用 temp 从最右边开始比较，大于等于 temp 就 right--，否则 right 位置的元素替换掉 left 的元素，并且 left++；
* 4、用 temp 从 left 开始比较，小于等于 temp 就 left... | [
{
"class_path": "ljuns__Practise__365062b/com/itscoder/ljuns/practise/algorithm/QuickSortKt.class",
"javap": "Compiled from \"QuickSort.kt\"\npublic final class com.itscoder.ljuns.practise.algorithm.QuickSortKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ... |
JakubMifek__WFC-Kotlin__2e86233/src/commonMain/kotlin/org/mifek/wfc/utils/Formatters.kt | package org.mifek.wfc.utils
/**
* Format waves
*
* @param waves
* @return
*/
fun formatWaves(waves: Array<BooleanArray>): String {
return " " + waves.indices.joinToString(" ") { idx ->
val s = waves[idx].sumBy {
when (it) {
true -> 1
else -> 0
}
... | [
{
"class_path": "JakubMifek__WFC-Kotlin__2e86233/org/mifek/wfc/utils/FormattersKt.class",
"javap": "Compiled from \"Formatters.kt\"\npublic final class org.mifek.wfc.utils.FormattersKt {\n public static final java.lang.String formatWaves(boolean[][]);\n Code:\n 0: aload_0\n 1: ldc ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week1/UnionFind.kt | package com.radix2.algorithms.week1
interface UF {
fun union(p: Int, q: Int)
fun connected(p: Int, q: Int): Boolean
}
class QuickFindUF(size: Int) : UF {
private val ids: IntArray = IntArray(size) { it }
override fun connected(p: Int, q: Int): Boolean = ids[p] == ids[q]
override fun union(p: In... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week1/UnionFindKt.class",
"javap": "Compiled from \"UnionFind.kt\"\npublic final class com.radix2.algorithms.week1.UnionFindKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week2/Sorting.kt | package com.radix2.algorithms.week2
fun IntArray.selectionSort() {
for (i in 0 until size) {
var j = i
var minIndex = j
while (j < size) {
if (this[minIndex] > this[j]) {
minIndex = j
}
j++
}
val temp = this[i]
t... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week2/SortingKt.class",
"javap": "Compiled from \"Sorting.kt\"\npublic final class com.radix2.algorithms.week2.SortingKt {\n public static final void selectionSort(int[]);\n Code:\n 0: aload_0\n 1: ldc ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week5/LLRBTree.kt | package com.radix2.algorithms.week5
import com.radix2.algorithms.week4.SymbolTable
import com.radix2.algorithms.week4.put
import java.lang.StringBuilder
import java.util.*
class LLRBTree<K : Comparable<K>, V> : SymbolTable<K, V> {
private var root: Node<K, V>? = null
private enum class Color { RED, BLACK }
... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week5/LLRBTreeKt.class",
"javap": "Compiled from \"LLRBTree.kt\"\npublic final class com.radix2.algorithms.week5.LLRBTreeKt {\n public static final void main();\n Code:\n 0: new #8 // ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week4/BST.kt | package com.radix2.algorithms.week4
import java.util.*
interface SymbolTable<K : Comparable<K>, V> {
fun put(key: K, value: V)
fun get(key: K): V?
fun min(): Pair<K, V>?
fun max(): Pair<K, V>?
fun floor(key: K): Pair<K, V>?
fun ceil(key: K): Pair<K, V>?
fun size(): Int
fun rank(... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week4/BST$Node.class",
"javap": "Compiled from \"BST.kt\"\nfinal class com.radix2.algorithms.week4.BST$Node<K, V> {\n private K key;\n\n private V data;\n\n private com.radix2.algorithms.week4.BST$Node<K, V> left;\n\n ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week4/MaxPQ.kt | package com.radix2.algorithms.week4
class MaxPQ<T : Comparable<T>>(capacity: Int) {
private var array = Array<Comparable<Any>?>(capacity) { null }
private var n = 0
companion object {
@Suppress("UNCHECKED_CAST")
fun <T : Comparable<T>> sort(array: Array<Comparable<T>>) {
for ... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week4/MaxPQ$Companion.class",
"javap": "Compiled from \"MaxPQ.kt\"\npublic final class com.radix2.algorithms.week4.MaxPQ$Companion {\n private com.radix2.algorithms.week4.MaxPQ$Companion();\n Code:\n 0: aload_0\... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/SortingLinkedList.kt | package com.radix2.algorithms.week3
import kotlin.random.Random
class LinkedList<T : Comparable<T>> {
private var head: Node<T>? = null
private val toss = intArrayOf(-1, 1)
fun add(data: T) {
val n = Node(data)
n.next = head
head = n
}
fun reverse() {
var trav = h... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/SortingLinkedListKt.class",
"javap": "Compiled from \"SortingLinkedList.kt\"\npublic final class com.radix2.algorithms.week3.SortingLinkedListKt {\n public static final void main(java.lang.String[]);\n Code:\n ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/CountingInversionsV1.kt | package com.radix2.algorithms.week3
fun sort(array: Array<Int>): Long {
return sort(array, Array(array.size) { 0 }, 0, array.size - 1)
}
fun sort(array: Array<Int>, aux: Array<Int>, lo: Int, hi: Int): Long {
if (lo >= hi) return 0
val mid = lo + (hi - lo) / 2
var inversions: Long
inversions = s... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/CountingInversionsV1Kt.class",
"javap": "Compiled from \"CountingInversionsV1.kt\"\npublic final class com.radix2.algorithms.week3.CountingInversionsV1Kt {\n public static final long sort(java.lang.Integer[]);\n ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/TraditionalMergeSort.kt | package com.radix2.algorithms.week3
object TraditionalMergeSort {
fun sort(array: IntArray) {
val aux = IntArray(array.size)
sort(array, aux, 0, array.size - 1)
}
fun sort(array: IntArray, aux: IntArray, lo: Int, hi: Int) {
if (lo >= hi) return
val mid = lo + (hi - lo) / 2... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/TraditionalMergeSortKt.class",
"javap": "Compiled from \"TraditionalMergeSort.kt\"\npublic final class com.radix2.algorithms.week3.TraditionalMergeSortKt {\n public static final void main(java.lang.String[]);\n ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/HalfSizedAuxArray.kt | package com.radix2.algorithms.week3
// Merging with smaller auxiliary array.
// Suppose that the sub array 𝚊[𝟶] to 𝚊[𝚗−𝟷] is sorted and the subarray 𝚊[𝚗] to 𝚊[𝟸 ∗ 𝚗 − 𝟷] is sorted.
// How can you merge the two sub arrays so that 𝚊[𝟶] to 𝚊[𝟸 ∗ 𝚗−𝟷] is sorted using an auxiliary array of length n (instea... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/HalfSizedAuxArrayKt.class",
"javap": "Compiled from \"HalfSizedAuxArray.kt\"\npublic final class com.radix2.algorithms.week3.HalfSizedAuxArrayKt {\n public static final void mergeWithSmallerAux(int[], int[], int, i... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/CountingInversionsV2.kt | package com.radix2.algorithms.week3
import java.util.*
// Counting inversions. An inversion in an array a[] is a pair of entries a[i] and a[j] such that i < j but a[i] > a[j].
// Given an array, design a linear arithmetic algorithm to count the number of inversions.
fun sort(array: IntArray, aux: IntArray, lo: Int, ... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/CountingInversionsV2Kt.class",
"javap": "Compiled from \"CountingInversionsV2.kt\"\npublic final class com.radix2.algorithms.week3.CountingInversionsV2Kt {\n public static final long sort(int[], int[], int, int);\n... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/TraditionalQuickSort.kt | package com.radix2.algorithms.week3
import java.util.*
fun less(lhs: Int, rhs: Int) = lhs < rhs
fun exch(array: IntArray, i: Int, j: Int) {
val temp = array[i]
array[i] = array[j]
array[j] = temp
}
fun shuffle(array: IntArray) {
val rnd = Random()
for (i in 1 until array.size) {
val ran... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/TraditionalQuickSortKt.class",
"javap": "Compiled from \"TraditionalQuickSort.kt\"\npublic final class com.radix2.algorithms.week3.TraditionalQuickSortKt {\n public static final boolean less(int, int);\n Code:\n... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/week3/NutsAndBolts.kt | package com.radix2.algorithms.week3
import java.util.*
class NutsAndBolts {
fun solve(nuts: IntArray, bolts: IntArray) {
shuffle(nuts)
shuffle(bolts)
solve(nuts, bolts, 0, nuts.size - 1)
}
private fun solve(nuts: IntArray, bolts: IntArray, lo: Int, hi: Int) {
if (lo >= h... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/week3/NutsAndBoltsKt.class",
"javap": "Compiled from \"NutsAndBolts.kt\"\npublic final class com.radix2.algorithms.week3.NutsAndBoltsKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/extras/MinAvg.kt | package com.radix2.algorithms.extras
import java.util.*
fun minimumAverage(orders: Sequence<Order>): Long {
val arrivalTimes = PriorityQueue<Order> { o1, o2 -> o1.arrivalTime.compareTo(o2.arrivalTime) }
val burstTimes = PriorityQueue<Order> { o1, o2 -> o1.burstTime.compareTo(o2.burstTime) }
for (order in... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/extras/MinAvgKt.class",
"javap": "Compiled from \"MinAvg.kt\"\npublic final class com.radix2.algorithms.extras.MinAvgKt {\n public static final long minimumAverage(kotlin.sequences.Sequence<com.radix2.algorithms.extras.O... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/extras/Scribble.kt | package com.radix2.algorithms.extras
import java.util.*
fun print(array: IntArray, lo: Int, hi: Int) {
if (lo == hi) {
println(array[lo])
} else {
println(array[lo])
print(array, lo + 1, hi)
}
}
fun map(array: IntArray, lo: Int, hi: Int, transform: (Int) -> Int) {
array[lo] = ... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/extras/ScribbleKt.class",
"javap": "Compiled from \"Scribble.kt\"\npublic final class com.radix2.algorithms.extras.ScribbleKt {\n public static final void print(int[], int, int);\n Code:\n 0: aload_0\n 1: ... |
rupeshsasne__coursera-algorithms-part1__341634c/classroom/src/main/kotlin/com/radix2/algorithms/extras/RunningMedian.kt | package com.radix2.algorithms.extras
import java.util.PriorityQueue
fun runningMedian(a: Array<Int>): Array<Double> {
val minPQ = PriorityQueue<Int> { o1, o2 -> o2.compareTo(o1) }
val maxPQ = PriorityQueue<Int>()
val medians = Array(a.size) { 0.0 }
for (i in 0..a.lastIndex) {
add(a[i], minPQ... | [
{
"class_path": "rupeshsasne__coursera-algorithms-part1__341634c/com/radix2/algorithms/extras/RunningMedianKt.class",
"javap": "Compiled from \"RunningMedian.kt\"\npublic final class com.radix2.algorithms.extras.RunningMedianKt {\n public static final java.lang.Double[] runningMedian(java.lang.Integer[]);\... |
Kanishk-Pandey__MyRoboticsCode__e5d6c96/src/main/kotlin/frc/kyberlib/math/Polynomial.kt | package frc.kyberlib.math
import kotlin.math.pow
import kotlin.math.sqrt
/**
* Representation and calculator of a polynomial
*/
class Polynomial(
vararg val coeffs: Double,
private val variableName: Char = 'x'
) {
companion object {
fun regress(args: DoubleArray, outputs: DoubleArray, order: In... | [
{
"class_path": "Kanishk-Pandey__MyRoboticsCode__e5d6c96/frc/kyberlib/math/Polynomial.class",
"javap": "Compiled from \"Polynomial.kt\"\npublic final class frc.kyberlib.math.Polynomial {\n public static final frc.kyberlib.math.Polynomial$Companion Companion;\n\n private final double[] coeffs;\n\n private... |
DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/src/main/kotlin/structures/GraphWithWeights.kt | package structures
/**
*
* data structure: directed graph with weights
*
* description: made up of vertices connected by edges that have direction and weight
*
*/
class GraphWithWeights<T> {
private val data = linkedMapOf<Vertex<T>, MutableList<VertexConnection<T>>>()
/**
* adds a new vertex with... | [
{
"class_path": "DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/structures/GraphWithWeights.class",
"javap": "Compiled from \"GraphWithWeights.kt\"\npublic final class structures.GraphWithWeights<T> {\n private final java.util.LinkedHashMap<structures.Vertex<T>, java.util.List<structures.Ve... |
DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/src/main/kotlin/structures/Graph.kt | package structures
import java.util.LinkedList
import kotlin.collections.LinkedHashSet
/**
*
* data structure: undirected graph without weights
*
* description: made up of vertices connected by edges
*
*/
class Graph<T> {
private val data = mutableMapOf<Vertex<T>, MutableList<Vertex<T>>>()
/**
*... | [
{
"class_path": "DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/structures/Graph.class",
"javap": "Compiled from \"Graph.kt\"\npublic final class structures.Graph<T> {\n private final java.util.Map<structures.Vertex<T>, java.util.List<structures.Vertex<T>>> data;\n\n public structures.Grap... |
DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/src/main/kotlin/structures/BinaryTree.kt | package structures
/**
*
* data structure: binary tree
*
* description: consists of nodes, each of which has a maximum of two children,
* child nodes satisfy the following requirements:
* - the left child is less than the parent;
* - right child is larger than parent;
*
* average search time: log(n)
* wors... | [
{
"class_path": "DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/structures/BinaryTree.class",
"javap": "Compiled from \"BinaryTree.kt\"\npublic final class structures.BinaryTree {\n private structures.Node root;\n\n public structures.BinaryTree();\n Code:\n 0: aload_0\n 1: i... |
DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/src/main/kotlin/other/FactorialAdvanced.kt | package other
import java.math.BigInteger
/**
*
* This algorithm is taken from Google Guava library
*
*/
class FactorialAdvanced {
// precomputed factorials
private val factorials = longArrayOf(
1L,
1L,
1L * 2,
1L * 2 * 3,
1L * 2 * 3 * 4,
1L * 2 * 3 * 4 * ... | [
{
"class_path": "DmitryTsyvtsyn__Kotlin-Algorithms-and-Design-Patterns__7ec0bf4/other/FactorialAdvanced.class",
"javap": "Compiled from \"FactorialAdvanced.kt\"\npublic final class other.FactorialAdvanced {\n private final long[] factorials;\n\n public other.FactorialAdvanced();\n Code:\n 0: aloa... |
akkinoc__atcoder-workspace__e650a9c/kotlin/src/main/kotlin/dev/akkinoc/atcoder/workspace/kotlin/algo/ListAlgo.kt | package dev.akkinoc.atcoder.workspace.kotlin.algo
/**
* The algorithms for [List].
*/
object ListAlgo {
/**
* Generate a sequence of permutations.
*
* @receiver The source elements.
* @param T The element type.
* @param r The number of elements to select.
* @return A sequence of pe... | [
{
"class_path": "akkinoc__atcoder-workspace__e650a9c/dev/akkinoc/atcoder/workspace/kotlin/algo/ListAlgo.class",
"javap": "Compiled from \"ListAlgo.kt\"\npublic final class dev.akkinoc.atcoder.workspace.kotlin.algo.ListAlgo {\n public static final dev.akkinoc.atcoder.workspace.kotlin.algo.ListAlgo INSTANCE;... |
cdome__aoc23__459a654/src/main/kotlin/day07/cards.kt | package day07
import java.io.File
fun main() {
val file = File("src/main/resources/day07-cards").readLines()
file
.map { line ->
val (cards, bid) = line.split(" ")
Hand(cards.trim(), bid.trim().toInt())
}
.sorted()
.mapIndexed { order, hand -> (order + 1... | [
{
"class_path": "cdome__aoc23__459a654/day07/CardsKt.class",
"javap": "Compiled from \"cards.kt\"\npublic final class day07.CardsKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
cdome__aoc23__459a654/src/main/kotlin/day08/map.kt | package day08
import java.io.File
fun main() {
val file = File("src/main/resources/day08-map").readLines()
val instructions = file[0]
val map = file.stream().skip(2).map { line ->
val (def, dirs) = line.split(" = ")
val (l, r) = dirs.split(", ")
def.trim() to Pair(l.removePrefix("... | [
{
"class_path": "cdome__aoc23__459a654/day08/MapKt.class",
"javap": "Compiled from \"map.kt\"\npublic final class day08.MapKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 // Str... |
cdome__aoc23__459a654/src/main/kotlin/day06/boats.kt | package day06
import java.io.File
import kotlin.math.ceil
import kotlin.math.sqrt
fun main() {
races()
singleRace()
}
private fun races() {
val file = File("src/main/resources/day06-boats").readLines()
val times = file[0].split(":")[1].trim().split(" ").filter { it.isNotBlank() }.map { it.toLong() }
... | [
{
"class_path": "cdome__aoc23__459a654/day06/BoatsKt.class",
"javap": "Compiled from \"boats.kt\"\npublic final class day06.BoatsKt {\n public static final void main();\n Code:\n 0: invokestatic #9 // Method races:()V\n 3: invokestatic #12 // Method singleR... |
cdome__aoc23__459a654/src/main/kotlin/day01/trebuchet.kt | package day01
import java.io.File
val numericNumbers = arrayOf("1", "2", "3", "4", "5", "6", "7", "8", "9")
val wordNumbers = arrayOf("one", "two", "three", "four", "five", "six", "seven", "eight", "nine")
val numbers = wordNumbers + numericNumbers
fun main() {
val instructions = File("src/main/resources/day01-t... | [
{
"class_path": "cdome__aoc23__459a654/day01/TrebuchetKt.class",
"javap": "Compiled from \"trebuchet.kt\"\npublic final class day01.TrebuchetKt {\n private static final java.lang.String[] numericNumbers;\n\n private static final java.lang.String[] wordNumbers;\n\n private static final java.lang.String[] ... |
cdome__aoc23__459a654/src/main/kotlin/day03/engine.kt | package day03
import java.io.File
import kotlin.text.StringBuilder
fun main() {
val lines = File("src/main/resources/day03-engine").readLines()
println("Sum of part numbers: ${engineSum(lines)}")
println("Sum of gear ratios: ${gears(lines)}")
}
fun gears(lines: List<String>): Int {
val emptyLine = "... | [
{
"class_path": "cdome__aoc23__459a654/day03/EngineKt.class",
"javap": "Compiled from \"engine.kt\"\npublic final class day03.EngineKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #10 ... |
cdome__aoc23__459a654/src/main/kotlin/day02/cubes.kt | package day02
import java.io.File
data class Game(val number: Int, val hands: List<Hand>) {
fun maxRed() = hands.maxOfOrNull { it.red } ?: 0
fun maxBlue() = hands.maxOfOrNull { it.blue } ?: 0
fun maxGreen() = hands.maxOfOrNull { it.green } ?: 0
}
data class Hand(val red: Int, val blue: Int, val green: In... | [
{
"class_path": "cdome__aoc23__459a654/day02/CubesKt.class",
"javap": "Compiled from \"cubes.kt\"\npublic final class day02.CubesKt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/main/resources/day02-cubes\n 2: invokestatic #12 ... |
mouredev__Weekly-Challenge-2022-Kotlin__2118149/app/src/main/java/com/mouredev/weeklychallenge2022/Challenge39.kt | package com.mouredev.weeklychallenge2022
/*
* Reto #39
* TOP ALGORITMOS: QUICK SORT
* Fecha publicación enunciado: 27/09/22
* Fecha publicación resolución: 03/10/22
* Dificultad: MEDIA
*
* Enunciado: Implementa uno de los algoritmos de ordenación más famosos: el "Quick Sort",
* creado por <NAME>.
* - Entender... | [
{
"class_path": "mouredev__Weekly-Challenge-2022-Kotlin__2118149/com/mouredev/weeklychallenge2022/Challenge39Kt.class",
"javap": "Compiled from \"Challenge39.kt\"\npublic final class com.mouredev.weeklychallenge2022.Challenge39Kt {\n public static final void main();\n Code:\n 0: bipush 6\n ... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/top_interview_questions/easy/merge/Main.kt | package com.leetcode.top_interview_questions.easy.merge
fun main() {
println("Test case 1:")
val arr1 = intArrayOf(1, 2, 3, 0, 0, 0)
val arr2 = intArrayOf(2, 5, 6)
println(Solution().merge(arr1, 3, arr2, 3)) // [1,2,2,3,5,6]
println(arr1.toList())
println()
println("Test case 2:")
val ... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/top_interview_questions/easy/merge/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.top_interview_questions.easy.merge.MainKt {\n public static final void main();\n Code:\n 0: ldc #8 ... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/top100LikedQuestions/easy/maxim_depth_of_binary_tree/Main.kt | package com.leetcode.top100LikedQuestions.easy.maxim_depth_of_binary_tree
fun main() {
println("Test case 1:")
val t1 = TreeNode(1)
run {
val leftFirstLeaf = TreeNode(3)
val rightFirstLeaf = TreeNode(2)
val leftSecondLeaf = TreeNode(5)
val rightSecondLeaf = null
... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/top100LikedQuestions/easy/maxim_depth_of_binary_tree/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.top100LikedQuestions.easy.maxim_depth_of_binary_tree.MainKt {\n public static final void main();\n Co... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/top100LikedQuestions/easy/symetric_binary_tree/Main.kt | package com.leetcode.top100LikedQuestions.easy.symetric_binary_tree
fun main() {
println("Test case 1:")
val t1 = TreeNode(1)
t1.left = TreeNode(2)
t1.right = TreeNode(2)
t1.left!!.left = TreeNode(3)
t1.left!!.right = TreeNode(4)
t1.right!!.left = TreeNode(4)
t1.right!!.right = TreeN... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/top100LikedQuestions/easy/symetric_binary_tree/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.top100LikedQuestions.easy.symetric_binary_tree.MainKt {\n public static final void main();\n Code:\n ... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/top100LikedQuestions/easy/mergind_two_binaries_tree/Main.kt | package com.leetcode.top100LikedQuestions.easy.mergind_two_binaries_tree
/**
* Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
You need to merge them into a new binary tree. The merge rule is that if two nodes o... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/top100LikedQuestions/easy/mergind_two_binaries_tree/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.top100LikedQuestions.easy.mergind_two_binaries_tree.MainKt {\n public static final void main();\n Code... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/top100LikedQuestions/medium/add_two_numbers/Main.kt | package com.leetcode.top100LikedQuestions.medium.add_two_numbers
fun main() {
println("Test case 1:")
val ll1 = ListNode(2, ListNode(4, ListNode(3, null)))
val ll2 = ListNode(5, ListNode(6, ListNode(4, null)))
println(Solution().addTwoNumbers(ll1, ll2)) //[7,0,8]
println()
println("Test case 2... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/top100LikedQuestions/medium/add_two_numbers/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.top100LikedQuestions.medium.add_two_numbers.MainKt {\n public static final void main();\n Code:\n 0: ldc... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/random_problems/easy/maximum_product_in_array/Main.kt | package com.leetcode.random_problems.easy.maximum_product_in_array
fun main() {
println("Test case 1:")
// Explanation: We can choose indices 1 and 3 for the first pair (6, 7) and indices 2 and 4 for the second pair (2, 4).
// The product difference is (6 * 7) - (2 * 4) = 34.
println(Solution().maxProduc... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/random_problems/easy/maximum_product_in_array/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.random_problems.easy.maximum_product_in_array.MainKt {\n public static final void main();\n Code:\n 0:... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/random_problems/easy/substract_product_and_sum/Main.kt | package com.leetcode.random_problems.easy.substract_product_and_sum
fun main() {
println("SOLUTION 1")
println("Test case 1:")
println(Solution().subtractProductAndSum(234)) // 15
println()
println("Test case 2:")
println(Solution().subtractProductAndSum(4421)) // 21
println()
println... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/random_problems/easy/substract_product_and_sum/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.random_problems.easy.substract_product_and_sum.MainKt {\n public static final void main();\n Code:\n ... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/random_problems/easy/best_buy_sell_stock/Main.kt | package com.leetcode.random_problems.easy.best_buy_sell_stock
fun main() {
println("Test case 1:")
println(Solution().maxProfit(intArrayOf(7, 1, 5, 3, 6, 4))) // 5
println()
println("Test case 2:")
println(Solution().maxProfit(intArrayOf(7, 6, 4, 3, 1))) // 0
println()
println("Test case ... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/random_problems/easy/best_buy_sell_stock/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.random_problems.easy.best_buy_sell_stock.MainKt {\n public static final void main();\n Code:\n 0: ldc ... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/random_problems/easy/roman_to_integer/Main.kt | package com.leetcode.random_problems.easy.roman_to_integer
fun main() {
println("Test case 1:")
println(Solution().romanToInt("III")) // 3
println()
println("Test case 2:")
println(Solution().romanToInt("IV")) // 4
println()
println("Test case 3:")
println(Solution().romanToInt("IX"))... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/random_problems/easy/roman_to_integer/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.random_problems.easy.roman_to_integer.MainKt {\n public static final void main();\n Code:\n 0: ldc #... |
frikit__leet-code-problems__dda6831/src/main/kotlin/com/leetcode/random_problems/medium/atoi/Main.kt | package com.leetcode.random_problems.medium.atoi
fun main() {
println("Test case 1:")
println(Solution().myAtoi("42")) // 42
println()
println("Test case 2:")
println(Solution().myAtoi(" -42")) // -42
println()
println("Test case 3:")
println(Solution().myAtoi("4193 with words")) //... | [
{
"class_path": "frikit__leet-code-problems__dda6831/com/leetcode/random_problems/medium/atoi/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.leetcode.random_problems.medium.atoi.MainKt {\n public static final void main();\n Code:\n 0: ldc #8 /... |
davidcurrie__advent-of-code-2021__dd37372/src/day4/result.kt | package day4
import java.io.File
data class Board(val numbers: Map<Int, Pair<Int, Int>>) {
private val rows = numbers.values.maxOf { it.first } + 1
private val cols = numbers.values.maxOf { it.second } + 1
private val matches = mutableListOf<Int>()
private val rowCounts = MutableList(rows) { 0 }
p... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day4/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day4.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day3/result.kt | package day3
import java.io.File
import kotlin.reflect.KFunction1
fun main() {
val lines = File("src/day3/input.txt")
.readLines()
.map { line -> line.toList().map { char -> Character.getNumericValue(char) } }
val columns = lines.transpose()
println(columns.map { it.gamma() }.toDecimal() *... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day3/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day3.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day2/result.kt | package day2
import day2.Direction.*
import java.io.File
import java.util.*
fun main() {
val moves = File("src/day2/input.txt")
.readLines()
.map { it.split(" ") }
.map { Move(valueOf(it[0].uppercase(Locale.getDefault())), it[1].toInt()) }
println(calculate(PartOneState(), moves))
... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day2/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day2.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day5/result.kt | package day5
import java.io.File
import kotlin.math.absoluteValue
import kotlin.math.max
import kotlin.math.sign
data class Line(val x1: Int, val y1: Int, val x2: Int, val y2: Int)
fun main() {
val input = File("src/day5/input.txt").readLines()
val regex = Regex("([0-9]*),([0-9]*) -> ([0-9]*),([0-9]*)")
... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day5/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day5.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day23/result.kt | package day23
import java.io.File
import java.util.*
import kotlin.math.abs
fun main() {
println(solve("src/day23/input.txt"))
println(solve("src/day23/input-part2.txt"))
}
enum class Amphipod(val stepEnergy: Int) { A(1), B(10), C(100), D(1000) }
data class Room(val natives: Amphipod, val size: Int, val ent... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day23/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day23.ResultKt {\n public static final void main();\n Code:\n 0: ldc #8 // String src/day23/input.txt\n 2: invokestatic #12 ... |
davidcurrie__advent-of-code-2021__dd37372/src/day12/result.kt | package day12
import java.io.File
fun Map<String, List<String>>.partOne(path: List<String>) : List<List<String>> {
if (path.last() == "end") {
return listOf(path)
}
return this[path.last()]!!
.filter { it.uppercase() == it || !path.contains(it) }
.map{ partOne( path + it) }
... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day12/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day12.ResultKt {\n public static final java.util.List<java.util.List<java.lang.String>> partOne(java.util.Map<java.lang.String, ? extends java.util.List<java.lang.Stri... |
davidcurrie__advent-of-code-2021__dd37372/src/day15/result.kt | package day15
import java.io.File
import java.util.*
val deltas = listOf(Coord(-1, 0), Coord(1, 0), Coord(0, -1), Coord(0, 1))
data class Coord(val x: Int, val y: Int)
data class CoordRisk(val coord: Coord, val risk: Int)
fun Map<Coord, Int>.explore(): Int {
val end = Coord(keys.maxOf { it.x }, keys.maxOf { it.... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day15/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day15.ResultKt {\n private static final java.util.List<day15.Coord> deltas;\n\n public static final java.util.List<day15.Coord> getDeltas();\n Code:\n 0: get... |
davidcurrie__advent-of-code-2021__dd37372/src/day14/result.kt | package day14
import java.io.File
fun solve(rules: Map<Pair<Char, Char>, Char>, initialPairCounts: Map<Pair<Char, Char>, Long>, steps: Int): Long {
var pairCounts = initialPairCounts
for (step in 1..steps) {
pairCounts = pairCounts.entries.fold(emptyMap()) { acc, pairCount ->
val ch = rul... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day14/ResultKt$main$$inlined$groupingBy$1.class",
"javap": "Compiled from \"_Collections.kt\"\npublic final class day14.ResultKt$main$$inlined$groupingBy$1 implements kotlin.collections.Grouping<kotlin.Pair<? extends java.lang.Character, ? extends j... |
davidcurrie__advent-of-code-2021__dd37372/src/day13/result.kt | package day13
import java.io.File
import kotlin.math.abs
fun main() {
val input = File("src/day13/input.txt").readText()
val coords = Regex("([0-9]*),([0-9]*)").findAll(input)
.map { Pair(it.groupValues[1].toInt(), it.groupValues[2].toInt()) }
.toSet()
val folds = Regex("fold along ([xy])... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day13/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day13.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day25/result.kt | package day25
import java.io.File
fun main() {
val lines = File("src/day25/input.txt").readLines()
val seafloor = Seafloor(lines[0].length, lines.size,
Herd.values().associateWith { herd -> herd.parse(lines) }.toMutableMap())
while (seafloor.move()) {}
println(seafloor.steps)
}
data class S... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day25/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day25.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day22/result.kt | package day22
import java.io.File
import kotlin.math.max
import kotlin.math.min
data class Line(val min: Int, val max: Int) {
fun overlap(other: Line): Line? {
val start = max(min, other.min)
val end = min(max, other.max)
return if (start <= end) Line(start, end) else null
}
}
data cl... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day22/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day22.ResultKt {\n public static final long calculate(java.util.List<day22.Cuboid>);\n Code:\n 0: aload_0\n 1: ldc #10 // Stri... |
davidcurrie__advent-of-code-2021__dd37372/src/day9/result.kt | package day9
import java.io.File
data class Coord(val x: Int, val y: Int)
fun Map<Coord, Int>.neighbours(coord: Coord) =
listOf(Pair(-1, 0), Pair(0, -1), Pair(1, 0), Pair(0, 1))
.map { Coord(coord.x + it.first, coord.y + it.second) }
.filter { contains(it) }
.toSet()
fun Map<Coord, Int>.... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day9/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day9.ResultKt {\n public static final java.util.Set<day9.Coord> neighbours(java.util.Map<day9.Coord, java.lang.Integer>, day9.Coord);\n Code:\n 0: aload_0\n ... |
davidcurrie__advent-of-code-2021__dd37372/src/day8/result.kt | package day8
import java.io.File
data class Line(val input:Set<Set<Char>>, val output: List<Set<Char>>) {
private val from: Map<Set<Char>, Int>
init {
val to = mutableMapOf(
1 to input.find { it.size == 2 }!!,
4 to input.find { it.size == 4 }!!,
7 to input.find { it... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day8/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day8.ResultKt {\n public static final java.util.List<java.util.Set<java.lang.Character>> toSegments(java.lang.String);\n Code:\n 0: aload_0\n 1: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day18/result.kt | package day18
import java.io.File
import java.lang.IllegalStateException
interface Element
class RegularNumber(val value: Int) : Element
object Open : Element
object Close : Element
fun main() {
val elements = File("src/day18/input.txt").readLines().map { line ->
line.toList().map { ch ->
wh... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day18/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day18.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day20/result.kt | package day20
import java.io.File
fun Array<Array<Boolean>>.count() = sumOf { row -> row.count { it } }
fun Array<Array<Boolean>>.enhance(algo: List<Boolean>, infinity: Boolean) =
(-1..size).map { y ->
(-1..this[0].size).map { x ->
algo[index(x, y, infinity)]
}.toTypedArray()
}.to... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day20/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day20.ResultKt {\n public static final int count(java.lang.Boolean[][]);\n Code:\n 0: aload_0\n 1: ldc #9 // String <this>\n ... |
davidcurrie__advent-of-code-2021__dd37372/src/day16/result.kt | package day16
import java.io.File
import java.lang.IllegalStateException
import kotlin.math.max
import kotlin.math.min
data class Packet(val length: Int, val versionSum: Int, val value: Long)
data class Literal(val length: Int, val value: Long)
data class Bits(val input: String) {
private var index = 0
priva... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day16/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day16.ResultKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc ... |
davidcurrie__advent-of-code-2021__dd37372/src/day10/result.kt | package day10
import java.io.File
val closings = mapOf('(' to ')', '[' to ']', '{' to '}', '<' to '>')
val partOneScores = mapOf(null to 0, ')' to 3, ']' to 57, '}' to 1197, '>' to 25137)
val partTwoScores = mapOf(')' to 1, ']' to 2, '}' to 3, '>' to 4)
fun main() {
val lines = File("src/day10/input.txt").readLi... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day10/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day10.ResultKt {\n private static final java.util.Map<java.lang.Character, java.lang.Character> closings;\n\n private static final java.util.Map<java.lang.Character, ... |
davidcurrie__advent-of-code-2021__dd37372/src/day21/result.kt | package day21
import java.io.File
fun Int.mod(m: Int) = ((this - 1) % m) + 1
class Die(val sides: Int) {
var value = 1
var rolled = 0
fun roll() : Int {
return value.also {
value = (value + 1).mod(sides)
rolled++
}
}
}
fun partOne(initialPositions: List<Int>) ... | [
{
"class_path": "davidcurrie__advent-of-code-2021__dd37372/day21/ResultKt.class",
"javap": "Compiled from \"result.kt\"\npublic final class day21.ResultKt {\n public static final int mod(int, int);\n Code:\n 0: iload_0\n 1: iconst_1\n 2: isub\n 3: iload_1\n 4: irem\n ... |
apankowski__garcon__10f5126/src/main/kotlin/dev/pankowski/garcon/domain/Texts.kt | package dev.pankowski.garcon.domain
import java.text.BreakIterator
import java.util.*
import java.util.Collections.unmodifiableList
/**
* Calculates [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance)
* between given char sequences.
*/
fun levenshtein(a: CharSequence, b: CharSequence): Int {... | [
{
"class_path": "apankowski__garcon__10f5126/dev/pankowski/garcon/domain/TextsKt.class",
"javap": "Compiled from \"Texts.kt\"\npublic final class dev.pankowski.garcon.domain.TextsKt {\n public static final int levenshtein(java.lang.CharSequence, java.lang.CharSequence);\n Code:\n 0: aload_0\n ... |
samjdixon__git-training__c5ab05f/src/main/kotlin/com/gitTraining/Fibbonaci.kt | package com.gitTraining
fun computeFibbonaciNumber(position: Int, recursion: Boolean = false): Int {
if (recursion) return recursiveFibbonachi(position)
if (position == 0) return 0
if (position < 0) {
val positionIsOdd = position % 2 == -1
return if (positionIsOdd) computeFibbonaciNumber(-... | [
{
"class_path": "samjdixon__git-training__c5ab05f/com/gitTraining/FibbonaciKt.class",
"javap": "Compiled from \"Fibbonaci.kt\"\npublic final class com.gitTraining.FibbonaciKt {\n public static final int computeFibbonaciNumber(int, boolean);\n Code:\n 0: iload_1\n 1: ifeq 15\n ... |
SeanShubin__code-structure-2__f83b9e3/tree/src/main/kotlin/com/seanshubin/code/structure/tree/Tree.kt | package com.seanshubin.code.structure.tree
sealed interface Tree<KeyType, ValueType> {
fun setValue(path: List<KeyType>, value: ValueType): Tree<KeyType, ValueType>
fun getValue(path: List<KeyType>): ValueType?
fun toLines(
keyOrder: Comparator<KeyType>,
keyToString: (KeyType) -> String,
... | [
{
"class_path": "SeanShubin__code-structure-2__f83b9e3/com/seanshubin/code/structure/tree/Tree$Branch.class",
"javap": "Compiled from \"Tree.kt\"\npublic final class com.seanshubin.code.structure.tree.Tree$Branch<KeyType, ValueType> implements com.seanshubin.code.structure.tree.Tree<KeyType, ValueType> {\n ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day09/solution.kt | package day09
import java.io.File
private const val MAX_HEIGHT = 9
fun main() {
val lines = File("src/main/kotlin/day09/input.txt").readLines()
val mapSize = lines.size
val heightMap: Array<IntArray> = Array(mapSize) { i -> lines[i].map { it.digitToInt() }.toIntArray() }
var riskLevel = 0
val bas... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day09/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day09.SolutionKt {\n private static final int MAX_HEIGHT;\n\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day08/solution.kt | package day08
import java.io.File
import java.util.*
fun main() {
val lines =
File("src/main/kotlin/day08/input.txt").readLines()
val signalToOutputList = lines.map { line ->
line.substringBefore(" | ").split(" ").map { it.toSortedSet() } to line.substringAfter(" | ").split(" ")
.... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day08/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day08.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day06/solution.kt | package day06
import java.io.File
private const val REPRODUCTION_INTERVAL = 7
fun main() {
val fishReproductionTimers = File("src/main/kotlin/day06/input.txt").readLines().first().split(",").map { it.toInt() }
val fishCountByTimer = fishReproductionTimers.fold(Array(9) { 0L }) { acc, fishReproductionTimer ->... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day06/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day06.SolutionKt {\n private static final int REPRODUCTION_INTERVAL;\n\n public static final void main();\n Code:\n 0: new #8 // class ja... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day12/solution.kt | package day12
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day12/input.txt").readLines()
val cavesByName: MutableMap<String, Cave> = mutableMapOf()
lines.forEach {
val fromCaveName = it.substringBefore("-")
val toCaveName = it.substringAfter("-")
val fromCave... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day12/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day12.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day15/solution.kt | package day15
import java.io.File
import java.util.*
fun main() {
val lines = File("src/main/kotlin/day15/input.txt").readLines()
val mapSize = lines.size
val riskLevelGrid: Array<IntArray> = Array(mapSize) { i -> lines[i].map { it.digitToInt() }.toIntArray() }
val minimumRiskLevelGrid: Array<IntArra... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day15/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day15.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day14/solution.kt | package day14
import java.io.File
import java.util.*
fun main() {
var template: List<Char> = LinkedList()
var pairInsertionsRules: Map<Pair<Char, Char>, Char> = emptyMap()
File("src/main/kotlin/day14/input.txt").useLines { linesSequence ->
val linesIterator = linesSequence.iterator()
temp... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day14/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day14.SolutionKt {\n public static final void main();\n Code:\n 0: new #10 // class kotlin/jvm/internal/Ref$ObjectRef\n 3: dup\n ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day13/solution.kt | package day13
import java.io.File
fun main() {
var points: Set<Point> = emptySet()
var foldCommands: List<FoldCommand> = emptyList()
File("src/main/kotlin/day13/input.txt").useLines { linesSequence ->
val linesIterator = linesSequence.iterator()
points = linesIterator.asSequence().takeWhi... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day13/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day13.SolutionKt {\n public static final void main();\n Code:\n 0: aconst_null\n 1: astore_0\n 2: invokestatic #14 // Method kotlin/coll... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day25/solution.kt | package day25
import java.io.File
typealias SeaFloor = Array<Array<SeaCucumberType?>>
fun main() {
val lines = File("src/main/kotlin/day25/input.txt").readLines()
val seaFloor: SeaFloor =
SeaFloor(lines.size) { i -> lines[i].map { SeaCucumberType.fromSymbol(it) }.toTypedArray() }
var iterationCo... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day25/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day25.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day22/solution.kt | package day22
import java.io.File
fun main() {
val inputLineRegex = """(on|off) x=([-]?\d+)..([-]?\d+),y=([-]?\d+)..([-]?\d+),z=([-]?\d+)..([-]?\d+)""".toRegex()
val lines = File("src/main/kotlin/day22/input.txt").readLines()
val rebootSteps = lines.map { line ->
val (state, x0, x1, y0, y1, z0, z1... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day22/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day22.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/text/Regex\n 3: dup\n 4: ldc ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day04/solution.kt | package day04
import java.io.File
fun main() {
var drawnNumbers: List<Int> = listOf()
var bingoBoards: List<BingoBoard> = listOf()
File("src/main/kotlin/day04/input.txt").useLines { seq ->
val iterator = seq.iterator()
drawnNumbers = List(1) { iterator.next() }.single().split(",").map { it... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day04/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day04.SolutionKt {\n public static final void main();\n Code:\n 0: new #10 // class kotlin/jvm/internal/Ref$ObjectRef\n 3: dup\n ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day03/solution.kt | package day03
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day03/input.txt").readLines()
val binaryCodeCounts = IntArray(12) { 0 }
val reportDatBitsHistogram = lines
.map { it.toCharArray() }
.fold(binaryCodeCounts) { counter, reportLine ->
for (i in count... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day03/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day03.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day02/solution.kt | package day02
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day02/input.txt").readLines()
val submarineV1 = lines
.fold(SubmarineV1()) { submarine, commandString ->
submarine.execute(commandString.toCommand())
}
println(submarineV1.x * submarineV1.y)
... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day02/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day02.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day05/solution.kt | package day05
import java.io.File
import kotlin.math.abs
fun main() {
val segmentPattern = Regex("""(\d+),(\d+) -> (\d+),(\d+)""")
val inputLines = File("src/main/kotlin/day05/input.txt").readLines()
val segments = inputLines
.mapNotNull { segmentPattern.matchEntire(it) }
.map {
... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day05/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day05.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class kotlin/text/Regex\n 3: dup\n 4: ldc ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day18/solution.kt | package day18
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day18/input.txt").readLines()
val snailFishNumbers = lines.map { parseSnailFish(it) }
println(snailFishNumbers.reduce { acc, snailFishNumber -> acc.copy() + snailFishNumber.copy() }.magnitude())
var highestMagnitude = 0
... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day18/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day18.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day20/solution.kt | package day20
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day20/input.txt").readLines()
val imageEnhancementAlgorithm: BooleanArray = lines[0].map { it == '#' }.toBooleanArray()
val imageYSize = lines.size + 2
val imageXSize = lines[2].length + 4
val image = InfiniteImage(
... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day20/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day20.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day16/solution.kt | package day16
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day16/input.txt").readLines()
val bitsIterator =
lines.first().map { hexToBinary(it) }.joinToString(separator = "").iterator()
val packet = Packet.parse(bitsIterator)
println(packet.versionAggregate())
prin... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day16/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day16.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day11/solution.kt | package day11
import java.io.File
fun main() {
val lines = File("src/main/kotlin/day11/input.txt").readLines()
val mapSize = lines.size
val energyLevelsMap: Array<IntArray> = Array(mapSize) { i -> lines[i].map { it.digitToInt() }.toIntArray() }
val dumboOctopuses: MutableMap<Coordinate, DumboOctopus>... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day11/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day11.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day10/solution.kt | package day10
import java.io.File
val chunkPairs = mapOf(
'(' to ')',
'[' to ']',
'{' to '}',
'<' to '>',
)
val illegalCharacterPoints = mapOf(
')' to 3,
']' to 57,
'}' to 1197,
'>' to 25137,
)
val autocompleteCharacterPoints = mapOf(
')' to 1,
']' to 2,
'}' to 3,
'>' ... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day10/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day10.SolutionKt {\n private static final java.util.Map<java.lang.Character, java.lang.Character> chunkPairs;\n\n private static final java.util.Map<java.lang.Character, jav... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day17/solution.kt | package day17
import java.io.File
import kotlin.math.abs
import kotlin.math.round
import kotlin.math.sqrt
fun main() {
val lines = File("src/main/kotlin/day17/input.txt").readLines()
val (x1, x2) = lines.first().substringAfter("target area: x=").substringBefore(", y=").split("..")
.map { it.toInt() }
... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day17/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day17.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class java/io/File\n 3: dup\n 4: ldc #1... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day21/solution.kt | package day21
fun main() {
val player1 = Player(4)
val player2 = Player(3)
val die = DeterministicDie()
var roundNumber = 0
var losingPlayer: Player
while (player1.score < 1000 && player2.score < 1000) {
if (roundNumber % 2 == 0) {
val score = die.roll() + die.roll() + die.... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day21/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day21.SolutionKt {\n public static final void main();\n Code:\n 0: new #8 // class day21/Player\n 3: dup\n 4: iconst_4\n ... |
bukajsytlos__aoc-2021__f47d092/src/main/kotlin/day19/solution.kt | package day19
import java.io.File
import kotlin.math.abs
fun main() {
val unidentifiedScanners = mutableListOf<UnidentifiedScanner>()
File("src/main/kotlin/day19/input.txt").useLines { linesSeq ->
val linesIterator = linesSeq.iterator()
while (linesIterator.hasNext()) {
val scanner... | [
{
"class_path": "bukajsytlos__aoc-2021__f47d092/day19/SolutionKt.class",
"javap": "Compiled from \"solution.kt\"\npublic final class day19.SolutionKt {\n private static final java.util.List<day19.Matrix3D> TRANSFORMATIONS;\n\n public static final void main();\n Code:\n 0: new #10 ... |
TimothyEarley__rosetta-code-compiler__bb10aca/code-gen/src/main/kotlin/gen/CodeGen.kt | package gen
import java.io.File
import java.util.*
import kotlin.math.abs
fun main(args: Array<String>) {
require(args.size == 1) { "Please pass a file as the first argument" }
val source = File(args[0]).readText()
println(gen(source))
}
fun gen(input: String): String {
val ast = readAST(input.lineSequence().fil... | [
{
"class_path": "TimothyEarley__rosetta-code-compiler__bb10aca/gen/CodeGenKt.class",
"javap": "Compiled from \"CodeGen.kt\"\npublic final class gen.CodeGenKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String args\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.