kt_path stringlengths 35 167 | kt_source stringlengths 626 28.9k | classes listlengths 1 17 |
|---|---|---|
lernejo__korekto-toolkit__df998e7/src/main/kotlin/com/github/lernejo/korekto/toolkit/misc/Distances.kt | package com.github.lernejo.korekto.toolkit.misc
import java.util.*
import java.util.stream.Collectors
import java.util.stream.Stream
import kotlin.math.min
object Distances {
private fun minimum(a: Int, b: Int, c: Int): Int {
return min(min(a, b), c)
}
fun levenshteinDistance(lhs: CharSequence?, ... | [
{
"class_path": "lernejo__korekto-toolkit__df998e7/com/github/lernejo/korekto/toolkit/misc/Distances.class",
"javap": "Compiled from \"Distances.kt\"\npublic final class com.github.lernejo.korekto.toolkit.misc.Distances {\n public static final com.github.lernejo.korekto.toolkit.misc.Distances INSTANCE;\n\n... |
asher-stern__sudoku__73ee63a/src/main/kotlin/com/learn/sudoku/Sudoku.kt | package com.learn.sudoku
import java.io.File
typealias Board = Array<Array<Int?>> // Row first. For example, b[1][3] means second row forth column.
fun main(args: Array<String>)
{
val board = Sudoku.read(args[0])
println(Sudoku.print(board))
println((1..11).joinToString("") { "=" } )
if(!Sudoku.solv... | [
{
"class_path": "asher-stern__sudoku__73ee63a/com/learn/sudoku/SudokuKt.class",
"javap": "Compiled from \"Sudoku.kt\"\npublic final class com.learn.sudoku.SudokuKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // String arg... |
GirZ0n__SPBU-Homework-2__05f2bda/src/main/kotlin/homeworks/homework8/task1/model/MinimaxAlgorithm.kt | package homeworks.homework7.task2.model
object MinimaxAlgorithm {
private const val MAX_VALUE = 1000
private const val MIN_VALUE = -MAX_VALUE
private const val BASIC_VALUE = 10
fun getBestMove(board: Array<CharArray>, playerSign: Char, opponentSign: Char, emptySign: Char): Pair<Int, Int> {
var... | [
{
"class_path": "GirZ0n__SPBU-Homework-2__05f2bda/homeworks/homework7/task2/model/MinimaxAlgorithm.class",
"javap": "Compiled from \"MinimaxAlgorithm.kt\"\npublic final class homeworks.homework7.task2.model.MinimaxAlgorithm {\n public static final homeworks.homework7.task2.model.MinimaxAlgorithm INSTANCE;\... |
nschulzke__mancala-puzzle-solver__b130d3b/src/main/kotlin/Main.kt | package com.nschulzke
enum class Stars {
One, Two, Three;
}
private val mancalaIndices = setOf(6, 13)
data class Puzzle(
private val board: List<Int>,
private val turns: Int,
private val targets: List<Pair<Stars, Int>>,
val steps: List<Int> = emptyList(),
) {
fun onBottom(pit: Int): Boolean =... | [
{
"class_path": "nschulzke__mancala-puzzle-solver__b130d3b/com/nschulzke/MainKt.class",
"javap": "Compiled from \"Main.kt\"\npublic final class com.nschulzke.MainKt {\n private static final java.util.Set<java.lang.Integer> mancalaIndices;\n\n public static final java.util.Set access$getMancalaIndices$p();... |
analogrelay__advent-of-code__006343d/2019/src/main/kotlin/adventofcode/day04/main.kt | package adventofcode.day04
fun main(args: Array<String>) {
if (args.size < 2) {
System.err.println("Usage: adventofcode day04 <START> <END>")
System.exit(1)
}
val start = args[0].toInt()
val end = args[1].toInt()
println("Computing passwords in range $start - $end")
val part1... | [
{
"class_path": "analogrelay__advent-of-code__006343d/adventofcode/day04/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class adventofcode.day04.MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // Stri... |
analogrelay__advent-of-code__006343d/2019/src/main/kotlin/adventofcode/day03/main.kt | package adventofcode.day03
import java.io.File
data class Point(val x: Int, val y: Int) {
public fun moveLeft(distance: Int)= Point(x - distance, y)
public fun moveRight(distance: Int)= Point(x + distance, y)
public fun moveUp(distance: Int)= Point(x, y + distance)
public fun moveDown(distance: Int)= ... | [
{
"class_path": "analogrelay__advent-of-code__006343d/adventofcode/day03/MainKt.class",
"javap": "Compiled from \"main.kt\"\npublic final class adventofcode.day03.MainKt {\n public static final void main(java.lang.String[]);\n Code:\n 0: aload_0\n 1: ldc #9 // Stri... |
dwbullok__kool__5121acb/common/src/main/kotlin/com/codeviking/kxg/math/Partition.kt | package com.codeviking.kxg.math
import kotlin.math.*
/**
* Partitions items with the given comparator. After partitioning, all elements left of k are smaller
* than all elements right of k with respect to the given comparator function.
*
* This method implements the Floyd-Rivest selection algorithm:
* https://e... | [
{
"class_path": "dwbullok__kool__5121acb/com/codeviking/kxg/math/PartitionKt.class",
"javap": "Compiled from \"Partition.kt\"\npublic final class com.codeviking.kxg.math.PartitionKt {\n public static final <T> void partition(java.util.List<T>, int, kotlin.jvm.functions.Function2<? super T, ? super T, java.... |
borisskert__kotlin-katas__0659b33/src/main/kotlin/helpthebookseller/StockList.kt | package solution
/**
* https://www.codewars.com/kata/54dc6f5a224c26032800005c/train/kotlin
*/
object StockList {
fun stockSummary(lstOfArt: Array<String>, lstOfCat: Array<String>): String {
if (lstOfArt.isEmpty()) {
return ""
}
val stock = lstOfArt
.map(::readOne)... | [
{
"class_path": "borisskert__kotlin-katas__0659b33/solution/StockList.class",
"javap": "Compiled from \"StockList.kt\"\npublic final class solution.StockList {\n public static final solution.StockList INSTANCE;\n\n private solution.StockList();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day15.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import java.util.PriorityQueue
object Day15 {
data class RiskPath(val currentCost: Int, val row: Int, val col: Int)
private fun solve(lines: List<String>, shouldExpandGrid: Boolean = false): Int {
val rawGrid = parseLines(lines)... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day15.class",
"javap": "Compiled from \"Day15.kt\"\npublic final class org.aoc2021.Day15 {\n public static final org.aoc2021.Day15 INSTANCE;\n\n private org.aoc2021.Day15();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day24.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
private fun <K, V> Map<K, V>.replaceKeyValue(k: K, v: V): Map<K, V> {
return this.entries.associate { (thisKey, thisValue) ->
if (thisKey == k) (k to v) else (thisKey to thisValue)
}
}
object Day24 {
data class Instruction(v... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day24$Compare.class",
"javap": "Compiled from \"Day24.kt\"\npublic final class org.aoc2021.Day24$Compare implements org.aoc2021.Day24$Expression {\n private final org.aoc2021.Day24$Expression a;\n\n private final org.aoc2021.Day24$Expressi... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day23.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
object Day23 {
private const val hallwayLength = 11
private val amphipodChars = setOf('A', 'B', 'C', 'D')
private val roomIndices = setOf(2, 4, ... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day23$Room.class",
"javap": "Compiled from \"Day23.kt\"\npublic final class org.aoc2021.Day23$Room implements org.aoc2021.Day23$HallwayPosition {\n private final java.util.List<org.aoc2021.Day23$Amphipod> occupants;\n\n public org.aoc2021.... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day9.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day9 {
data class Point(val x: Int, val y: Int)
private fun solvePart1(lines: List<String>): Int {
val heights = lines.map { line ->
line.map(Char::digitToInt)
}
val lowPoints = findLowPoints(h... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day9$Point.class",
"javap": "Compiled from \"Day9.kt\"\npublic final class org.aoc2021.Day9$Point {\n private final int x;\n\n private final int y;\n\n public org.aoc2021.Day9$Point(int, int);\n Code:\n 0: aload_0\n 1: invo... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day22.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import kotlin.math.max
import kotlin.math.min
private fun IntRange.size(): Int {
return if (this.last >= this.first) {
this.last - this.first + 1
} else {
0
}
}
object Day22 {
data class Cube(val x: IntRange, val... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day22Kt.class",
"javap": "Compiled from \"Day22.kt\"\npublic final class org.aoc2021.Day22Kt {\n private static final int size(kotlin.ranges.IntRange);\n Code:\n 0: aload_0\n 1: invokevirtual #12 // Method kot... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day5.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min
import kotlin.math.sign
object Day5 {
data class Vent(val x1: Int, val y1: Int, val x2: Int, val y2: Int)
private fun solvePart1(filename: String): Int {
val v... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day5$Vent.class",
"javap": "Compiled from \"Day5.kt\"\npublic final class org.aoc2021.Day5$Vent {\n private final int x1;\n\n private final int y1;\n\n private final int x2;\n\n private final int y2;\n\n public org.aoc2021.Day5$Vent(int... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day16.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day16 {
interface Packet {
val version: Int
val typeId: Int
fun sumSubPacketVersions(): Int
fun evaluate(): Long
}
data class LiteralValuePacket(
override val version: Int,
ov... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day16$Packet.class",
"javap": "Compiled from \"Day16.kt\"\npublic interface org.aoc2021.Day16$Packet {\n public abstract int getVersion();\n\n public abstract int getTypeId();\n\n public abstract int sumSubPacketVersions();\n\n public ab... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day3.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day3 {
private fun solvePart1(filename: String): Int {
val lines = Files.readAllLines(Path.of(filename), Charsets.UTF_8)
val numBits = lines[0].length
val oneCounts = Array(numBits) { 0 }
lines.forEach... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day3.class",
"javap": "Compiled from \"Day3.kt\"\npublic final class org.aoc2021.Day3 {\n public static final org.aoc2021.Day3 INSTANCE;\n\n private org.aoc2021.Day3();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day13.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day13 {
data class Point(val x: Int, val y: Int)
data class Fold(val direction: String, val coordinate: Int)
private fun solvePart1(lines: List<String>): Int {
val (points, folds) = parseLines(lines)
val (co... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day13.class",
"javap": "Compiled from \"Day13.kt\"\npublic final class org.aoc2021.Day13 {\n public static final org.aoc2021.Day13 INSTANCE;\n\n private org.aoc2021.Day13();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day19.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import kotlin.math.abs
typealias Vector = List<Int>
typealias Matrix = List<List<Int>>
private fun Vector.vectorAdd(vector: Vector): Vector {
return this.mapIndexed { i, value ->
value + vector[i]
}
}
private fun Vector.vectorS... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day19$ScannerLocation.class",
"javap": "Compiled from \"Day19.kt\"\npublic final class org.aoc2021.Day19$ScannerLocation {\n private final java.util.List<java.lang.Integer> coordinates;\n\n private final java.util.List<java.util.List<java.... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day14.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day14 {
private const val iterationsPart1 = 10
private const val iterationsPart2 = 40
private fun solve(lines: List<String>, iterations: Int): Long {
val start = lines[0]
val rules = lines.drop(2).map { it.sp... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day14.class",
"javap": "Compiled from \"Day14.kt\"\npublic final class org.aoc2021.Day14 {\n public static final org.aoc2021.Day14 INSTANCE;\n\n private static final int iterationsPart1;\n\n private static final int iterationsPart2;\n\n ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day4.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
class Board(boardLines: List<String>) {
companion object {
const val boardSize = 5
}
private val board: List<List<Int>>
private val chosenNumbers: Array<Array<Boolean>> = Array(boardSize) { Array(boardSize) { false } }
... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day4.class",
"javap": "Compiled from \"Day4.kt\"\npublic final class org.aoc2021.Day4 {\n public static final org.aoc2021.Day4 INSTANCE;\n\n private org.aoc2021.Day4();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day10.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day10 {
private val values = mapOf(
')' to 3,
']' to 57,
'}' to 1197,
'>' to 25137,
)
private fun solvePart1(lines: List<String>): Int {
return lines.sumOf { line ->
doLine(... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day10.class",
"javap": "Compiled from \"Day10.kt\"\npublic final class org.aoc2021.Day10 {\n public static final org.aoc2021.Day10 INSTANCE;\n\n private static final java.util.Map<java.lang.Character, java.lang.Integer> values;\n\n privat... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day12.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day12 {
private fun solvePart1(lines: List<String>): Int {
val points = parseLines(lines)
return search("start", points)
}
private fun solvePart2(lines: List<String>): Int {
val points = parseLines(li... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day12.class",
"javap": "Compiled from \"Day12.kt\"\npublic final class org.aoc2021.Day12 {\n public static final org.aoc2021.Day12 INSTANCE;\n\n private org.aoc2021.Day12();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day21.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
import kotlin.math.max
object Day21 {
data class Key(val p1Pos: Int, val p1Score: Int, val p2Pos: Int, val p2Score: Int, val isP1Turn: Boolean)
private fun solvePart1(lines: List<String>): Int {
var (p1Pos, p2Pos) = parseStartin... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day21.class",
"javap": "Compiled from \"Day21.kt\"\npublic final class org.aoc2021.Day21 {\n public static final org.aoc2021.Day21 INSTANCE;\n\n private org.aoc2021.Day21();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day20.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day20 {
private const val iterationsPart1 = 2
private const val iterationsPart2 = 50
data class Image(
val lit: Set<Pair<Int, Int>>,
val outOfBoundsLit: Boolean,
)
private fun solve(lines: List<String... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day20$Image.class",
"javap": "Compiled from \"Day20.kt\"\npublic final class org.aoc2021.Day20$Image {\n private final java.util.Set<kotlin.Pair<java.lang.Integer, java.lang.Integer>> lit;\n\n private final boolean outOfBoundsLit;\n\n pub... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day8.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day8 {
private fun solvePart1(lines: List<String>): Int {
return lines.sumOf { line ->
val outputDigits = line.split(" | ")[1].split(" ")
outputDigits.count { setOf(2, 3, 4, 7).contains(it.length) }
... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day8.class",
"javap": "Compiled from \"Day8.kt\"\npublic final class org.aoc2021.Day8 {\n public static final org.aoc2021.Day8 INSTANCE;\n\n private org.aoc2021.Day8();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day25.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day25 {
private fun solve(lines: List<String>): Int {
var grid = parseInput(lines)
var turns = 0
while (true) {
turns++
val prevGrid = grid
grid = simulateTurn(grid)
... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day25.class",
"javap": "Compiled from \"Day25.kt\"\npublic final class org.aoc2021.Day25 {\n public static final org.aoc2021.Day25 INSTANCE;\n\n private org.aoc2021.Day25();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
jsgroth__advent-of-code-2021__ba81fad/src/org/aoc2021/Day18.kt | package org.aoc2021
import java.nio.file.Files
import java.nio.file.Path
object Day18 {
data class TreeNode(val left: TreeNode? = null, val right: TreeNode? = null, val value: Int? = null)
private fun solvePart1(lines: List<String>): Int {
val snailfishNumbers = lines.map(Day18::parseSnailfishNumber)... | [
{
"class_path": "jsgroth__advent-of-code-2021__ba81fad/org/aoc2021/Day18.class",
"javap": "Compiled from \"Day18.kt\"\npublic final class org.aoc2021.Day18 {\n public static final org.aoc2021.Day18 INSTANCE;\n\n private org.aoc2021.Day18();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
techstay__algorithm-study__1380ce1/kotlin-algorithm-sample/src/main/kotlin/yitian/study/algorithm/problem/ModProblem.kt | package yitian.study.algorithm.problem
/**
* 一筐鸡蛋：
* 1个1个拿，正好拿完。
* 2个2个拿，还剩1个。
* 3个3个拿，正好拿完。
* 4个4个拿，还剩1个。
* 5个5个拿，还差1个。
* 6个6个拿，还剩3个。
* 7个7个拿，正好拿完。
* 8个8个拿，还剩1个。
* 9个9个拿，正好拿完。
* 问:筐里最少有几个鸡蛋？
*
*/
class ModProblem
/**
* 直接暴力穷举
*/
fun answer1() {
var n = 0
while (true) {
if (n % 2 == 1 &... | [
{
"class_path": "techstay__algorithm-study__1380ce1/yitian/study/algorithm/problem/ModProblem.class",
"javap": "Compiled from \"ModProblem.kt\"\npublic final class yitian.study.algorithm.problem.ModProblem {\n public yitian.study.algorithm.problem.ModProblem();\n Code:\n 0: aload_0\n 1: invo... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/JaroWinkler.kt | package com.aallam.similarity
import kotlin.math.max
import kotlin.math.min
/**
* The Jaro–Winkler distance metric is designed and best suited for short strings such as person names, and to detect
* typos; it is (roughly) a variation of Damerau-Levenshtein, where the substitution of 2 close characters is considered... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/JaroWinkler$Companion.class",
"javap": "Compiled from \"JaroWinkler.kt\"\npublic final class com.aallam.similarity.JaroWinkler$Companion {\n private com.aallam.similarity.JaroWinkler$Companion();\n Code:\n 0: aload_0\... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/OptimalStringAlignment.kt | package com.aallam.similarity
import kotlin.math.min
/**
* Implementation of the Optimal String Alignment (sometimes called the restricted edit distance) variant
* of the Damerau-Levenshtein distance.
*
* The difference between the two algorithms consists in that the Optimal String Alignment algorithm computes th... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/OptimalStringAlignment.class",
"javap": "Compiled from \"OptimalStringAlignment.kt\"\npublic final class com.aallam.similarity.OptimalStringAlignment {\n public com.aallam.similarity.OptimalStringAlignment();\n Code:\n ... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/SorensenDice.kt | package com.aallam.similarity
import com.aallam.similarity.internal.Shingle
/**
* Sorensen-Dice coefficient, aka Sørensen index, Dice's coefficient or Czekanowski's binary (non-quantitative) index.
*
* The strings are first converted to boolean sets of k-shingles (sequences of k characters), then the similarity is... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/SorensenDice.class",
"javap": "Compiled from \"SorensenDice.kt\"\npublic final class com.aallam.similarity.SorensenDice {\n private final int k;\n\n public com.aallam.similarity.SorensenDice(int);\n Code:\n 0: aload_... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/LongestCommonSubsequence.kt | package com.aallam.similarity
import kotlin.math.max
/**
* The longest common subsequence (LCS) problem consists in finding the longest subsequence common to two (or more)
* sequences. It differs from problems of finding common substrings: unlike substrings, subsequences are not required
* to occupy consecutive po... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/LongestCommonSubsequence.class",
"javap": "Compiled from \"LongestCommonSubsequence.kt\"\npublic final class com.aallam.similarity.LongestCommonSubsequence {\n public com.aallam.similarity.LongestCommonSubsequence();\n Code... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/NGram.kt | package com.aallam.similarity
import kotlin.math.max
import kotlin.math.min
/**
* N-Gram Similarity as defined by Kondrak, "N-Gram Similarity and Distance", String Processing and Information
* Retrieval, Lecture Notes in Computer Science Volume 3772, 2005, pp 115-126.
*
* The algorithm uses affixing with special... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/NGram.class",
"javap": "Compiled from \"NGram.kt\"\npublic final class com.aallam.similarity.NGram {\n private final int n;\n\n public com.aallam.similarity.NGram(int);\n Code:\n 0: aload_0\n 1: invokespecial #... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/QGram.kt | package com.aallam.similarity
import com.aallam.similarity.internal.Profile
import com.aallam.similarity.internal.Shingle
import kotlin.math.abs
/**
* Q-gram distance, as defined by Ukkonen in [Approximate string-matching with q-grams and maximal matches](http://www.sciencedirect.com/science/article/pii/030439759290... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/QGram.class",
"javap": "Compiled from \"QGram.kt\"\npublic final class com.aallam.similarity.QGram {\n private final int k;\n\n public com.aallam.similarity.QGram(int);\n Code:\n 0: aload_0\n 1: invokespecial #... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/WeightedLevenshtein.kt | package com.aallam.similarity
import kotlin.math.min
/**
* Implementation of Levenshtein that allows to define different weights for different character substitutions.
*
* @param weights the strategy to determine character operations weights.
*/
public class WeightedLevenshtein(
private val weights: Operation... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/WeightedLevenshtein.class",
"javap": "Compiled from \"WeightedLevenshtein.kt\"\npublic final class com.aallam.similarity.WeightedLevenshtein {\n private final com.aallam.similarity.OperationsWeights weights;\n\n public com.aa... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/DamerauLevenshtein.kt | package com.aallam.similarity
/**
* Damerau-Levenshtein distance with transposition (*unrestricted Damerau-Levenshtein* distance).
*
* The distance is the minimum number of operations needed to transform one string into the other, where an operation
* is defined as an insertion, deletion, or substitution of a sing... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/DamerauLevenshtein.class",
"javap": "Compiled from \"DamerauLevenshtein.kt\"\npublic final class com.aallam.similarity.DamerauLevenshtein {\n public com.aallam.similarity.DamerauLevenshtein();\n Code:\n 0: aload_0\n ... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/Cosine.kt | package com.aallam.similarity
import com.aallam.similarity.internal.Profile
import com.aallam.similarity.internal.Shingle
import kotlin.math.sqrt
/**
* Implements Cosine Similarity between strings.
*
* The strings are first transformed in vectors of occurrences of k-shingles (sequences of [k] characters).
* In th... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/Cosine.class",
"javap": "Compiled from \"Cosine.kt\"\npublic final class com.aallam.similarity.Cosine {\n private final int k;\n\n public com.aallam.similarity.Cosine(int);\n Code:\n 0: aload_0\n 1: invokespeci... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/Levenshtein.kt | package com.aallam.similarity
import kotlin.math.min
/**
* The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or
* substitutions) required to change one string into the other.
*
* This implementation uses dynamic programming (Wagner–Fischer algorithm)... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/Levenshtein.class",
"javap": "Compiled from \"Levenshtein.kt\"\npublic final class com.aallam.similarity.Levenshtein {\n public com.aallam.similarity.Levenshtein();\n Code:\n 0: aload_0\n 1: invokespecial #8 ... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/NormalizedLevenshtein.kt | package com.aallam.similarity
import kotlin.math.max
/**
* This distance is computed as levenshtein distance divided by the length of the longest string.
* The resulting value is always in the interval 0 to 1.
*
* [Levenshtein Distance](https://en.wikipedia.org/wiki/Levenshtein_distance)
*/
public class Normaliz... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/NormalizedLevenshtein.class",
"javap": "Compiled from \"NormalizedLevenshtein.kt\"\npublic final class com.aallam.similarity.NormalizedLevenshtein {\n private final com.aallam.similarity.Levenshtein levenshtein;\n\n public co... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/Jaccard.kt | package com.aallam.similarity
import com.aallam.similarity.internal.Shingle
/**
* Each input string is converted into a set of n-grams, the Jaccard index is then computed as `|A ∩ B| / |A ∪ B|`.
*
* Like Q-Gram distance, the input strings are first converted into sets of n-grams (sequences of n characters, also
*... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/Jaccard.class",
"javap": "Compiled from \"Jaccard.kt\"\npublic final class com.aallam.similarity.Jaccard {\n private final int k;\n\n public com.aallam.similarity.Jaccard(int);\n Code:\n 0: aload_0\n 1: invokes... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/RatcliffObershelp.kt | package com.aallam.similarity
/**
* The Ratcliff/Obershelp algorithm computes the similarity of two strings the doubled number of matching characters
* divided by the total number of characters in the two strings. Matching characters are those in the longest common
* subsequence plus, recursively, matching characte... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/RatcliffObershelp.class",
"javap": "Compiled from \"RatcliffObershelp.kt\"\npublic final class com.aallam.similarity.RatcliffObershelp {\n public com.aallam.similarity.RatcliffObershelp();\n Code:\n 0: aload_0\n ... |
aallam__string-similarity-kotlin__40cd4eb/string-similarity/src/commonMain/kotlin/com/aallam/similarity/internal/Shingle.kt | package com.aallam.similarity.internal
/**
* Similarities that rely on set operations (like cosine similarity or jaccard index).
*/
internal interface Shingle {
/**
* Compute and return the profile of string as defined by [Ukkonen](https://www.cs.helsinki.fi/u/ukkonen/TCS92.pdf).
*
* The profile ... | [
{
"class_path": "aallam__string-similarity-kotlin__40cd4eb/com/aallam/similarity/internal/Shingle$DefaultImpls.class",
"javap": "Compiled from \"Shingle.kt\"\npublic final class com.aallam.similarity.internal.Shingle$DefaultImpls {\n public static java.util.Map<java.lang.String, java.lang.Integer> profile(... |
Malo-T__AoC-2022__f4edefa/src/main/kotlin/day07/Day07.kt | package day07
data class File(
val name: String,
val size: Int,
)
data class Directory(
val name: String,
val directories: MutableList<Directory> = mutableListOf(),
val files: MutableList<File> = mutableListOf(),
) {
// must not be in the constructor
lateinit var parent: Directory
fu... | [
{
"class_path": "Malo-T__AoC-2022__f4edefa/day07/Day07Kt.class",
"javap": "Compiled from \"Day07.kt\"\npublic final class day07.Day07Kt {\n private static final day07.Directory root();\n Code:\n 0: new #8 // class day07/Directory\n 3: dup\n 4: ldc #... |
Malo-T__AoC-2022__f4edefa/src/main/kotlin/day04/Day04.kt | package day04
private typealias Assignments = Pair<IntRange, IntRange>
private fun String.toIntRange(): IntRange = split("-").map { it.toInt() }.let { it[0]..it[1] }
// anonymous function
private val hasCompleteOverlap = fun(assignments: Assignments): Boolean {
with(assignments) {
return first.subtract(s... | [
{
"class_path": "Malo-T__AoC-2022__f4edefa/day04/Day04Kt.class",
"javap": "Compiled from \"Day04.kt\"\npublic final class day04.Day04Kt {\n private static final kotlin.jvm.functions.Function1<kotlin.Pair<kotlin.ranges.IntRange, kotlin.ranges.IntRange>, java.lang.Boolean> hasCompleteOverlap;\n\n private st... |
Malo-T__AoC-2022__f4edefa/src/main/kotlin/day03/Day03.kt | package day03
private val itemPriorities: Map<Char, Int> = (('a'..'z') + ('A'..'Z')).mapIndexed { i, c -> c to i + 1 }.toMap()
private typealias RuckSack = Pair<Set<Char>, Set<Char>>
class Day03 {
fun parse(input: String): List<RuckSack> =
input.lines().map { line ->
RuckSack(
... | [
{
"class_path": "Malo-T__AoC-2022__f4edefa/day03/Day03Kt.class",
"javap": "Compiled from \"Day03.kt\"\npublic final class day03.Day03Kt {\n private static final java.util.Map<java.lang.Character, java.lang.Integer> itemPriorities;\n\n public static final java.util.Map access$getItemPriorities$p();\n Co... |
Malo-T__AoC-2022__f4edefa/src/main/kotlin/day02/Day02.kt | package day02
class Day02 {
enum class Play(val points: Int) {
ROCK(1) {
override fun scoreAgainst(other: Play) = when (other) {
ROCK -> Result.DRAW
PAPER -> Result.LOSS
SCISSORS -> Result.WIN
}.points + points
},
PAPE... | [
{
"class_path": "Malo-T__AoC-2022__f4edefa/day02/Day02$Play.class",
"javap": "Compiled from \"Day02.kt\"\npublic abstract class day02.Day02$Play extends java.lang.Enum<day02.Day02$Play> {\n private final int points;\n\n public static final day02.Day02$Play ROCK;\n\n public static final day02.Day02$Play P... |
Malo-T__AoC-2022__f4edefa/src/main/kotlin/day05/Day05.kt | package day05
import day05.Day05.Step
private typealias Stack = MutableList<Char>
private typealias Storage = MutableList<Stack>
private const val EMPTY = ' '
private fun List<String>.indexOfStackNumbers() = indexOfFirst { it.startsWith(" 1") }
private val stepRegex = """move (\d+) from (\d+) to (\d+)""".toRegex()... | [
{
"class_path": "Malo-T__AoC-2022__f4edefa/day05/Day05Kt.class",
"javap": "Compiled from \"Day05.kt\"\npublic final class day05.Day05Kt {\n private static final char EMPTY;\n\n private static final kotlin.text.Regex stepRegex;\n\n private static final int indexOfStackNumbers(java.util.List<java.lang.Stri... |
mikhalchenko-alexander__advent-of-kotlin-2018-week1__c483ade/src/main/kotlin/com/anahoret/pathfinding/MarkingWayOnMap.kt | package com.anahoret.pathfinding
import java.lang.IllegalArgumentException
import java.util.*
fun addPath(map: String): String = Graph.getMapWithPath(map)
object Graph {
private const val STRAIGHT_LENGTH = 2
private const val DIAGONAL_LENGTH = 3
fun getMapWithPath(map: String): String {
val (no... | [
{
"class_path": "mikhalchenko-alexander__advent-of-kotlin-2018-week1__c483ade/com/anahoret/pathfinding/MarkingWayOnMapKt.class",
"javap": "Compiled from \"MarkingWayOnMap.kt\"\npublic final class com.anahoret.pathfinding.MarkingWayOnMapKt {\n public static final java.lang.String addPath(java.lang.String);\... |
ani03sha__RedQuarkTutorials__67b6eba/ConceptOfTheDay/Kotlin/src/main/java/org/redquark/conceptoftheday/AnagramSubstringSearch.kt | package org.redquark.conceptoftheday
/**
* @author <NAME>
*
* We are given two strings "text" and "pattern" of size n and m respectively where m < n.
* Find all the indices in text where anagrams of pattern are found.
*/
private fun findIndices(text: String, pattern: String): List<Int> {
// Lengths of strings... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/conceptoftheday/AnagramSubstringSearchKt.class",
"javap": "Compiled from \"AnagramSubstringSearch.kt\"\npublic final class org.redquark.conceptoftheday.AnagramSubstringSearchKt {\n private static final java.util.List<java.lang.Integer> find... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/SubstringWithConcatenationOfAllWords.kt | package org.redquark.tutorials.leetcode
class SubstringWithConcatenationOfAllWords {
fun findSubstring(s: String, words: Array<String>): List<Int> {
// Resultant list
val indices: MutableList<Int> = ArrayList()
// Base conditions
if (s.isEmpty() || words.isEmpty()) {
r... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/SubstringWithConcatenationOfAllWords.class",
"javap": "Compiled from \"SubstringWithConcatenationOfAllWords.kt\"\npublic final class org.redquark.tutorials.leetcode.SubstringWithConcatenationOfAllWords {\n public org.redq... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumber.kt | package org.redquark.tutorials.leetcode
fun letterCombinations(digits: String): List<String> {
// Resultant list
val combinations: MutableList<String> = mutableListOf()
// Base condition
if (digits.isEmpty()) {
return combinations
}
// Mappings of letters and numbers
val lettersAndN... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/LetterCombinationsOfAPhoneNumberKt.class",
"javap": "Compiled from \"LetterCombinationsOfAPhoneNumber.kt\"\npublic final class org.redquark.tutorials.leetcode.LetterCombinationsOfAPhoneNumberKt {\n public static final jav... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MergeKSortedLists.kt | package org.redquark.tutorials.leetcode
class MergeKSortedLists {
internal fun mergeKLists(lists: Array<ListNode?>): ListNode? {
// Base condition
return if (lists.isEmpty()) {
null
} else mergeKLists(lists, 0, lists.size - 1)
}
private fun mergeKLists(lists: Array<Lis... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/MergeKSortedLists$ListNode.class",
"javap": "Compiled from \"MergeKSortedLists.kt\"\npublic final class org.redquark.tutorials.leetcode.MergeKSortedLists$ListNode {\n private final int val;\n\n private org.redquark.tutor... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/FourSum.kt | package org.redquark.tutorials.leetcode
import java.util.*
import kotlin.collections.ArrayList
fun fourSum(nums: IntArray, target: Int): List<List<Int>> {
// Resultant list
val quadruplets: MutableList<List<Int>> = ArrayList()
// Base condition
if (nums.size < 4) {
return quadruplets
}
... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/FourSumKt.class",
"javap": "Compiled from \"FourSum.kt\"\npublic final class org.redquark.tutorials.leetcode.FourSumKt {\n public static final java.util.List<java.util.List<java.lang.Integer>> fourSum(int[], int);\n Co... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/MedianOfTwoSortedArrays.kt | package org.redquark.tutorials.leetcode
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {
// Check if num1 is smaller than num2
// If not, then we will swap num1 with num2
if (nums1.size > nums2.size) {
return findMedianSortedArrays(nums2, nums1)
}
// Lengths of two arr... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/MedianOfTwoSortedArraysKt.class",
"javap": "Compiled from \"MedianOfTwoSortedArrays.kt\"\npublic final class org.redquark.tutorials.leetcode.MedianOfTwoSortedArraysKt {\n public static final double findMedianSortedArrays(... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/RegularExpressionMatching.kt | package org.redquark.tutorials.leetcode
fun isMatch(s: String, p: String): Boolean {
val rows = s.length
val columns = p.length
/// Base conditions
if (rows == 0 && columns == 0) {
return true
}
if (columns == 0) {
return false
}
// DP array
val dp = Array(rows + 1) ... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/RegularExpressionMatchingKt.class",
"javap": "Compiled from \"RegularExpressionMatching.kt\"\npublic final class org.redquark.tutorials.leetcode.RegularExpressionMatchingKt {\n public static final boolean isMatch(java.lan... |
ani03sha__RedQuarkTutorials__67b6eba/LeetCode/Kotlin/src/main/kotlin/org/redquark/tutorials/leetcode/LongestPalindromeSubstring.kt | package org.redquark.tutorials.leetcode
fun longestPalindrome(s: String): String {
// Update the string to put hash "#" at the beginning, end and in between each character
val updatedString = getUpdatedString(s)
// Length of the array that will store the window of palindromic substring
val length = 2 *... | [
{
"class_path": "ani03sha__RedQuarkTutorials__67b6eba/org/redquark/tutorials/leetcode/LongestPalindromeSubstringKt.class",
"javap": "Compiled from \"LongestPalindromeSubstring.kt\"\npublic final class org.redquark.tutorials.leetcode.LongestPalindromeSubstringKt {\n public static final java.lang.String long... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.