Initial commit

.gitignore

@@ -0,0 +1,42 @@
+.gradle
+build/
+!gradle/wrapper/gradle-wrapper.jar
+!**/src/main/**/build/
+!**/src/test/**/build/
+
+### IntelliJ IDEA ###
+.idea/modules.xml
+.idea/jarRepositories.xml
+.idea/compiler.xml
+.idea/libraries/
+*.iws
+*.iml
+*.ipr
+out/
+!**/src/main/**/out/
+!**/src/test/**/out/
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+bin/
+!**/src/main/**/bin/
+!**/src/test/**/bin/
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store

build.gradle.kts

@@ -0,0 +1,28 @@
+plugins {
+    kotlin("jvm") version "1.9.21"
+    application
+}
+
+application {
+    mainClass = "me.alex_s168.kreflect.TermKt"
+}
+
+group = "me.alex_s168"
+version = "0.1"
+
+repositories {
+    mavenCentral()
+}
+
+dependencies {
+    testImplementation("org.jetbrains.kotlin:kotlin-test")
+    implementation("org.jetbrains.kotlinx:kotlinx-io-core:0.3.1")
+    implementation("org.jetbrains.kotlinx:kotlinx-io-bytestring:0.3.1")
+}
+
+tasks.test {
+    useJUnitPlatform()
+}
+kotlin {
+    jvmToolchain(17)
+}

gradle.properties

@@ -0,0 +1 @@
+kotlin.code.style=official

gradlew

@@ -0,0 +1,234 @@
+#!/bin/sh
+
+#
+# Copyright © 2015-2021 the original authors.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#      https://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#
+
+##############################################################################
+#
+#   Gradle start up script for POSIX generated by Gradle.
+#
+#   Important for running:
+#
+#   (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is
+#       noncompliant, but you have some other compliant shell such as ksh or
+#       bash, then to run this script, type that shell name before the whole
+#       command line, like:
+#
+#           ksh Gradle
+#
+#       Busybox and similar reduced shells will NOT work, because this script
+#       requires all of these POSIX shell features:
+#         * functions;
+#         * expansions «$var», «${var}», «${var:-default}», «${var+SET}»,
+#           «${var#prefix}», «${var%suffix}», and «$( cmd )»;
+#         * compound commands having a testable exit status, especially «case»;
+#         * various built-in commands including «command», «set», and «ulimit».
+#
+#   Important for patching:
+#
+#   (2) This script targets any POSIX shell, so it avoids extensions provided
+#       by Bash, Ksh, etc; in particular arrays are avoided.
+#
+#       The "traditional" practice of packing multiple parameters into a
+#       space-separated string is a well documented source of bugs and security
+#       problems, so this is (mostly) avoided, by progressively accumulating
+#       options in "$@", and eventually passing that to Java.
+#
+#       Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS,
+#       and GRADLE_OPTS) rely on word-splitting, this is performed explicitly;
+#       see the in-line comments for details.
+#
+#       There are tweaks for specific operating systems such as AIX, CygWin,
+#       Darwin, MinGW, and NonStop.
+#
+#   (3) This script is generated from the Groovy template
+#       https://github.com/gradle/gradle/blob/master/subprojects/plugins/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt
+#       within the Gradle project.
+#
+#       You can find Gradle at https://github.com/gradle/gradle/.
+#
+##############################################################################
+
+# Attempt to set APP_HOME
+
+# Resolve links: $0 may be a link
+app_path=$0
+
+# Need this for daisy-chained symlinks.
+while
+    APP_HOME=${app_path%"${app_path##*/}"}  # leaves a trailing /; empty if no leading path
+    [ -h "$app_path" ]
+do
+    ls=$( ls -ld "$app_path" )
+    link=${ls#*' -> '}
+    case $link in             #(
+      /*)   app_path=$link ;; #(
+      *)    app_path=$APP_HOME$link ;;
+    esac
+done
+
+APP_HOME=$( cd "${APP_HOME:-./}" && pwd -P ) || exit
+
+APP_NAME="Gradle"
+APP_BASE_NAME=${0##*/}
+
+# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"'
+
+# Use the maximum available, or set MAX_FD != -1 to use that value.
+MAX_FD=maximum
+
+warn () {
+    echo "$*"
+} >&2
+
+die () {
+    echo
+    echo "$*"
+    echo
+    exit 1
+} >&2
+
+# OS specific support (must be 'true' or 'false').
+cygwin=false
+msys=false
+darwin=false
+nonstop=false
+case "$( uname )" in                #(
+  CYGWIN* )         cygwin=true  ;; #(
+  Darwin* )         darwin=true  ;; #(
+  MSYS* | MINGW* )  msys=true    ;; #(
+  NONSTOP* )        nonstop=true ;;
+esac
+
+CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
+
+
+# Determine the Java command to use to start the JVM.
+if [ -n "$JAVA_HOME" ] ; then
+    if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
+        # IBM's JDK on AIX uses strange locations for the executables
+        JAVACMD=$JAVA_HOME/jre/sh/java
+    else
+        JAVACMD=$JAVA_HOME/bin/java
+    fi
+    if [ ! -x "$JAVACMD" ] ; then
+        die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+    fi
+else
+    JAVACMD=java
+    which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
+
+Please set the JAVA_HOME variable in your environment to match the
+location of your Java installation."
+fi
+
+# Increase the maximum file descriptors if we can.
+if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then
+    case $MAX_FD in #(
+      max*)
+        MAX_FD=$( ulimit -H -n ) ||
+            warn "Could not query maximum file descriptor limit"
+    esac
+    case $MAX_FD in  #(
+      '' | soft) :;; #(
+      *)
+        ulimit -n "$MAX_FD" ||
+            warn "Could not set maximum file descriptor limit to $MAX_FD"
+    esac
+fi
+
+# Collect all arguments for the java command, stacking in reverse order:
+#   * args from the command line
+#   * the main class name
+#   * -classpath
+#   * -D...appname settings
+#   * --module-path (only if needed)
+#   * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables.
+
+# For Cygwin or MSYS, switch paths to Windows format before running java
+if "$cygwin" || "$msys" ; then
+    APP_HOME=$( cygpath --path --mixed "$APP_HOME" )
+    CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" )
+
+    JAVACMD=$( cygpath --unix "$JAVACMD" )
+
+    # Now convert the arguments - kludge to limit ourselves to /bin/sh
+    for arg do
+        if
+            case $arg in                                #(
+              -*)   false ;;                            # don't mess with options #(
+              /?*)  t=${arg#/} t=/${t%%/*}              # looks like a POSIX filepath
+                    [ -e "$t" ] ;;                      #(
+              *)    false ;;
+            esac
+        then
+            arg=$( cygpath --path --ignore --mixed "$arg" )
+        fi
+        # Roll the args list around exactly as many times as the number of
+        # args, so each arg winds up back in the position where it started, but
+        # possibly modified.
+        #
+        # NB: a `for` loop captures its iteration list before it begins, so
+        # changing the positional parameters here affects neither the number of
+        # iterations, nor the values presented in `arg`.
+        shift                   # remove old arg
+        set -- "$@" "$arg"      # push replacement arg
+    done
+fi
+
+# Collect all arguments for the java command;
+#   * $DEFAULT_JVM_OPTS, $JAVA_OPTS, and $GRADLE_OPTS can contain fragments of
+#     shell script including quotes and variable substitutions, so put them in
+#     double quotes to make sure that they get re-expanded; and
+#   * put everything else in single quotes, so that it's not re-expanded.
+
+set -- \
+        "-Dorg.gradle.appname=$APP_BASE_NAME" \
+        -classpath "$CLASSPATH" \
+        org.gradle.wrapper.GradleWrapperMain \
+        "$@"
+
+# Use "xargs" to parse quoted args.
+#
+# With -n1 it outputs one arg per line, with the quotes and backslashes removed.
+#
+# In Bash we could simply go:
+#
+#   readarray ARGS < <( xargs -n1 <<<"$var" ) &&
+#   set -- "${ARGS[@]}" "$@"
+#
+# but POSIX shell has neither arrays nor command substitution, so instead we
+# post-process each arg (as a line of input to sed) to backslash-escape any
+# character that might be a shell metacharacter, then use eval to reverse
+# that process (while maintaining the separation between arguments), and wrap
+# the whole thing up as a single "set" statement.
+#
+# This will of course break if any of these variables contains a newline or
+# an unmatched quote.
+#
+
+eval "set -- $(
+        printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" |
+        xargs -n1 |
+        sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' |
+        tr '\n' ' '
+    )" '"$@"'
+
+exec "$JAVACMD" "$@"

gradlew.bat

@@ -0,0 +1,89 @@
+@rem
+@rem Copyright 2015 the original author or authors.
+@rem
+@rem Licensed under the Apache License, Version 2.0 (the "License");
+@rem you may not use this file except in compliance with the License.
+@rem You may obtain a copy of the License at
+@rem
+@rem      https://www.apache.org/licenses/LICENSE-2.0
+@rem
+@rem Unless required by applicable law or agreed to in writing, software
+@rem distributed under the License is distributed on an "AS IS" BASIS,
+@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+@rem See the License for the specific language governing permissions and
+@rem limitations under the License.
+@rem
+
+@if "%DEBUG%" == "" @echo off
+@rem ##########################################################################
+@rem
+@rem  Gradle startup script for Windows
+@rem
+@rem ##########################################################################
+
+@rem Set local scope for the variables with windows NT shell
+if "%OS%"=="Windows_NT" setlocal
+
+set DIRNAME=%~dp0
+if "%DIRNAME%" == "" set DIRNAME=.
+set APP_BASE_NAME=%~n0
+set APP_HOME=%DIRNAME%
+
+@rem Resolve any "." and ".." in APP_HOME to make it shorter.
+for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi
+
+@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
+set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m"
+
+@rem Find java.exe
+if defined JAVA_HOME goto findJavaFromJavaHome
+
+set JAVA_EXE=java.exe
+%JAVA_EXE% -version >NUL 2>&1
+if "%ERRORLEVEL%" == "0" goto execute
+
+echo.
+echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
+echo.
+echo Please set the JAVA_HOME variable in your environment to match the
+echo location of your Java installation.
+
+goto fail
+
+:findJavaFromJavaHome
+set JAVA_HOME=%JAVA_HOME:"=%
+set JAVA_EXE=%JAVA_HOME%/bin/java.exe
+
+if exist "%JAVA_EXE%" goto execute
+
+echo.
+echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
+echo.
+echo Please set the JAVA_HOME variable in your environment to match the
+echo location of your Java installation.
+
+goto fail
+
+:execute
+@rem Setup the command line
+
+set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
+
+
+@rem Execute Gradle
+"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %*
+
+:end
+@rem End local scope for the variables with windows NT shell
+if "%ERRORLEVEL%"=="0" goto mainEnd
+
+:fail
+rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
+rem the _cmd.exe /c_ return code!
+if  not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
+exit /b 1
+
+:mainEnd
+if "%OS%"=="Windows_NT" endlocal
+
+:omega

settings.gradle.kts

@@ -0,0 +1,5 @@
+plugins {
+    id("org.gradle.toolchains.foojay-resolver-convention") version "0.5.0"
+}
+rootProject.name = "kReflect"
+

src/main/kotlin/me/alex_s168/kreflect/Clazz.kt

@@ -0,0 +1,480 @@
+package me.alex_s168.kreflect
+
+import kotlinx.io.Buffer
+import kotlinx.io.RawSource
+import kotlinx.io.files.Path
+import kotlinx.io.files.SystemFileSystem
+import kotlinx.io.readByteArray
+import kotlinx.io.readTo
+import kotlin.math.max
+import kotlin.math.min
+
+interface IndexableSequence<T>: Sequence<T> {
+    operator fun get(index: Int): T
+}
+
+fun <T> lazySequence(vararg init: Pair<Int, T>, f: (Int, (Int) -> T) -> T): IndexableSequence<T> =
+    object : IndexableSequence<T> {
+        val map = mutableMapOf(*init)
+
+        fun comp(iIn: Int): T {
+            val i = max(0, iIn)
+            return map[i] ?: f(i, ::comp).also { map[i] = it }
+        }
+
+        override fun get(index: Int) = comp(index)
+
+        override fun iterator(): Iterator<T> =
+            object : Iterator<T> {
+                override fun hasNext() = true
+
+                private var i = 0
+
+                override fun next(): T =
+                    comp(i ++)
+            }
+    }
+
+typealias Operator<I, O> = (I) -> O
+
+fun <T, O: Any> caching(tiedGet: () -> T, calc: (T) -> O) = object : Lazy<O> {
+    private var lastTiedV = tiedGet()
+    private var lastV: O? = null
+
+    override val value: O get() {
+        val nTied = tiedGet()
+        if (lastTiedV != nTied) {
+            lastTiedV = nTied
+            lastV = calc(nTied)
+            return lastV!!
+        }
+        if (lastV == null)
+            lastV = calc(nTied)
+        return lastV!!
+    }
+
+    override fun isInitialized(): Boolean =
+        lastTiedV == tiedGet() && lastV != null
+}
+
+fun <T> selfInitializingSequence(block: () -> Sequence<T>): Sequence<T> =
+    object : Sequence<T> {
+        val seq by lazy(block)
+
+        inner class Iter : Iterator<T> {
+            val iter = seq.iterator()
+
+            override fun hasNext(): Boolean =
+                iter.hasNext()
+
+            override fun next(): T =
+                iter.next()
+        }
+
+        override fun iterator(): Iterator<T> =
+            Iter()
+    }
+
+class OperationChain<I, O> private constructor(
+    private val impl: Impl = Impl()
+) {
+    private var until = 0
+
+    private class Impl {
+        val seqe = mutableListOf<(Sequence<Any?>) -> Sequence<Any?>>()
+
+        var finalized = false
+
+        fun add(op: Operator<*, *>) {
+            seqe += { seq: Sequence<Any?> ->
+                seq.map(op as Operator<Any?, Any?>)
+            }
+        }
+
+        fun addFlat(op: Operator<*, Sequence<*>>) {
+            seqe += { seq: Sequence<Any?> ->
+                seq.flatMap(op as Operator<Any?, Sequence<Any?>>)
+            }
+        }
+    }
+
+    fun <NO> map(op: Operator<O, NO>): OperationChain<I, NO> =
+        OperationChain<I, NO>(impl.also { it.add(op) })
+            .also { it.until = this.until + 1 }
+
+    fun <NO> flatMap(op: Operator<O, Sequence<NO>>): OperationChain<I, NO> =
+        OperationChain<I, NO>(impl.also { it.addFlat(op) })
+            .also { it.until = this.until + 1 }
+
+    fun <NO> map(op: OperationChain<O, NO>): OperationChain<I, NO> {
+        if (!op.impl.finalized)
+            throw Exception("Can not map un-finalized operation chain onto operation chain!")
+        return flatMap(op::process)
+    }
+
+    fun <NO> modifier(op: Operator<Sequence<O>, Sequence<NO>>): OperationChain<I, NO> =
+        OperationChain<I, NO>(impl.also { it.seqe.add(op as (Sequence<Any?>) -> Sequence<Any?>) })
+            .also { it.until = this.until + 1 }
+
+    fun finalize(): OperationChain<I, O> {
+        if (impl.finalized)
+            throw Exception("Can't finalize a finalized OperationChain!")
+        impl.finalized = true
+        return this
+    }
+
+    fun process(v: I): Sequence<O> =
+        selfInitializingSequence {
+            var seq = sequenceOf<Any?>(v)
+            impl.seqe
+                .asSequence()
+                .take(until)
+                .forEach { op ->
+                    seq = op(seq)
+                }
+            seq as Sequence<O>
+        }
+
+    fun processAll(v: Sequence<I>): Sequence<O> =
+        v.flatMap { process(it) }
+
+    companion object {
+        internal fun <I> create(): OperationChain<I, I> =
+            OperationChain()
+    }
+}
+
+class Contents<T> internal constructor(
+    private val iterable: Iterable<T>
+): Iterable<T> {
+    override fun iterator(): Iterator<T> =
+        iterable.iterator()
+
+    override fun equals(other: Any?): Boolean {
+        if (other !is Contents<*>)
+            return false
+
+        val it1 = this.iterable.iterator()
+        val it2 = other.iterable.iterator()
+
+        while (true) {
+            val hasNext1 = it1.hasNext()
+            val hasNext2 = it2.hasNext()
+
+            if ((hasNext1 && !hasNext2) || (hasNext2 && !hasNext1))
+                return false
+
+            if (!hasNext1)
+                return true
+
+            if (it1.next() != it2.next())
+                return false
+        }
+    }
+
+    override fun hashCode(): Int =
+        iterable.hashCode()
+
+    override fun toString(): String =
+        joinToString(
+            separator = ", ",
+            prefix = "[",
+            postfix = "]"
+        ) {
+            it.toString()
+        }
+}
+
+val <T> Iterable<T>.contents get() =
+    Contents(this)
+
+val <T> Sequence<T>.contents get() =
+    Contents(this.asIterable())
+
+fun <T, O> Sequence<T>.map(chain: OperationChain<T, O>): Sequence<O> =
+    chain.processAll(this)
+
+fun <I> chain(): OperationChain<I, I> =
+    OperationChain.create()
+
+fun <I, O> OperationChain<I, O>.chunked(size: Int): OperationChain<I, List<O>> =
+    modifier { it.chunked(size) }
+
+fun <I, O, R> OperationChain<I, O>.chunked(size: Int, transform: (List<O>) -> R): OperationChain<I, R> =
+    modifier { it.chunked(size, transform) }
+
+fun <I, O> OperationChain<I, O>.filter(predicate: (O) -> Boolean): OperationChain<I, O> =
+    modifier { it.filter(predicate) }
+
+fun <T> MutableList<T>.removeFirst(count: Int) {
+    repeat(count) {
+        removeFirst()
+    }
+}
+
+fun <T> MutableList<T>.removeLast(count: Int) {
+    repeat(count) {
+        removeLast()
+    }
+}
+
+interface BatchIterator<T>: Iterator<T> {
+    fun next(limit: Int): List<T>
+    fun next(dest: Array<T>): Int
+    fun next(dest: MutableList<T>, limit: Int)
+}
+
+interface ByteBatchIterator: BatchIterator<Byte> {
+    fun nextBytes(limit: Int): ByteArray
+
+    fun nextBytes(dest: ByteArray): Int
+}
+
+interface BatchSequence<T>: Sequence<T> {
+    override fun iterator(): BatchIterator<T>
+}
+
+interface ByteBatchSequence: BatchSequence<Byte> {
+    override fun iterator(): ByteBatchIterator
+}
+
+/**
+ * Batches all get operations on the sequence.
+ */
+fun <T> BatchSequence<T>.batched(count: Int): BatchSequence<T> =
+    object : BatchSequence<T> {
+        inner class Iter: BatchIterator<T> {
+            val parent = this@batched.iterator()
+
+            var batch = mutableListOf<T>()
+
+            override fun next(limit: Int): List<T> {
+                if (!hasNext())
+                    throw Exception("no next")
+
+                val c = min(limit, batch.size)
+                val ret = batch.take(c)
+                batch.removeFirst(c)
+                return ret
+            }
+
+            override fun next(dest: MutableList<T>, limit: Int) {
+                if (!hasNext())
+                    throw Exception("no next")
+
+                val c = min(limit, batch.size)
+                dest.addAll(batch.subList(0, max(0, c-1)))
+                batch.removeFirst(c)
+                return
+            }
+
+            override fun next(dest: Array<T>): Int {
+                if (!hasNext())
+                    throw Exception("no next")
+
+                val c = min(dest.size, batch.size)
+                batch.subList(0, max(0, c-1)).forEachIndexed { i, t ->
+                    dest[i] = t
+                }
+                batch.removeFirst(c)
+                return c
+            }
+
+            override fun next(): T {
+                if (!hasNext())
+                    throw Exception("no next")
+                val v = batch.first()
+                batch.removeFirst()
+                return v
+            }
+
+            override fun hasNext(): Boolean {
+                while (batch.isEmpty()) {
+                    if (!parent.hasNext())
+                        return false
+                    parent.next(batch, count)
+                }
+                return true
+            }
+        }
+
+        override fun iterator(): BatchIterator<T> =
+            Iter()
+    }
+
+fun <T> Sequence<T>.asBatch(): BatchSequence<T> =
+    object : BatchSequence<T> {
+        inner class Iter: BatchIterator<T> {
+            var iter = this@asBatch.iterator()
+
+            override fun next(limit: Int): List<T> =
+                mutableListOf<T>()
+                    .also { next(it, limit) }
+
+            override fun next(dest: MutableList<T>, limit: Int) {
+                for (i in 0..<limit) {
+                    if (!iter.hasNext())
+                        break
+                    dest.add(iter.next())
+                }
+            }
+
+            override fun next(dest: Array<T>): Int {
+                var i = 0
+                while (i < dest.size) {
+                    if (!iter.hasNext())
+                        break
+                    dest[i ++] = iter.next()
+                }
+                return i
+            }
+
+            override fun next(): T {
+                return iter.next()
+            }
+
+            override fun hasNext(): Boolean {
+                return iter.hasNext()
+            }
+        }
+
+        override fun iterator(): BatchIterator<T> =
+            Iter()
+    }
+
+/*
+# Batched sequences
+## Source
+You should make all your sources return `BatchSequence<T>`
+and then you can use the `.batched(count: Int)` function
+to drastically decrease the amount of single reads in the original source.
+Example:
+```kt
+File("text.txt")  // File
+  .openRead()     // BatchSequence<Byte>
+  .batched(64)    // BatchSequence<Byte>
+```
+with this, if `.openRead()` returns a dumb sequence that always only gets one byte at once,
+you can speed up the reading process by a lot
+
+## Sink
+You should make all your sinks take `BatchSequence<T>`
+and then you can use the `.asBatch()` function to allow
+the sink to get multiple bytes at once
+Example:
+```kt
+val data = myData  // Sequence<Byte>
+  .asBatch()       // BatchSequence<Byte>
+
+File("text.txt")
+  .write(data)
+```
+
+# Lazy Sequences
+When writing recursive functions like Fibonacci, it is often easier and faster to use
+lazy sequences.
+Example:
+```kt
+val fib = lazySequence(0 to 1) { i, f ->
+  f(i-1) + f(i-2)
+}
+
+println(fib[10])
+```
+Note: If we call f for any number below 0, it will call f(0) instead.
+
+# Operation Chains
+TODO
+
+# Contents
+TODO
+ */
+
+data class Monad<O>(
+    val impure: () -> O
+)
+
+fun <O> unit(v: O): Monad<O> =
+    Monad { v }
+
+fun unit(): Monad<Unit> =
+    Monad { Unit }
+
+fun <I, O> Monad<I>.bind(op: (I) -> O): Monad<O> =
+    Monad { op(this@bind.impure()) }
+
+fun Monad<String>.print() =
+    bind { print(it) }
+
+fun Monad<String>.asPath() =
+    bind { Path(it) }
+
+fun ByteBatchSequence.stringify(batch: Int): Sequence<String> {
+    val iter = iterator()
+    return sequence {
+        if (iter.hasNext())
+            yield(iter.nextBytes(batch).decodeToString())
+    }
+}
+
+fun (() -> RawSource).readerSequence(): ByteBatchSequence =
+    object : ByteBatchSequence {
+        inner class Iter: ByteBatchIterator {
+            val src = this@readerSequence()
+            val buffer = Buffer()
+
+            override fun nextBytes(limit: Int): ByteArray {
+                src.readAtMostTo(buffer, limit - buffer.size)
+                return buffer.readByteArray()
+            }
+
+            override fun nextBytes(dest: ByteArray): Int {
+                src.readAtMostTo(buffer, max(0, dest.size - buffer.size))
+                val c = buffer.size
+                buffer.readTo(dest)
+                return min(c.toInt(), dest.size)
+            }
+
+            override fun next(limit: Int): List<Byte> =
+                nextBytes(limit).toList()
+
+            override fun next(dest: MutableList<Byte>, limit: Int) {
+                for (x in nextBytes(limit)) {
+                    dest.add(x)
+                }
+            }
+
+            override fun next(dest: Array<Byte>): Int {
+                var i = 0
+                for (x in nextBytes(dest.size)) {
+                    dest[i ++] = x
+                }
+                return i
+            }
+
+            override fun next(): Byte =
+                nextBytes(1).first()
+
+            override fun hasNext(): Boolean {
+                return src.readAtMostTo(buffer, 1) > 0
+            }
+        }
+
+        override fun iterator(): ByteBatchIterator =
+            Iter()
+    }
+
+fun Monad<Path>.read() =
+    bind { p -> { SystemFileSystem.source(p) }.readerSequence() }
+
+fun readIn() =
+    Monad { generateSequence { readln() } }
+
+/*
+fun main() {
+    val chain = chain<Int>()
+        .map(Int::toString)
+        .map(String::reversed)
+        .finalize()
+    println(chain.process(120).contents)
+}*/

src/main/kotlin/me/alex_s168/kreflect/Fnp.kt

@@ -0,0 +1,16 @@
+package me.alex_s168.kreflect
+
+import kotlinx.io.files.Path
+
+fun main() {
+
+}
+
+fun pureMain(args: Array<String>): Monad<Unit> =
+    args.map {
+        if (it == "-") readIn()
+        else unit(it)
+            .asPath()
+            .read()
+            .bind { it.stringify(64) }
+    }

src/main/kotlin/me/alex_s168/kreflect/Term.kt

@@ -0,0 +1,35 @@
+package me.alex_s168.kreflect
+
+object Ansi {
+    const val ESC = (0x1B).toChar()
+
+    object Cursor {
+        fun home() =
+            print("$ESC[H")
+
+        fun goto(line: Int, col: Int) =
+            print("$ESC[${line};${col}H")
+
+        fun up(lines: Int) =
+            print("$ESC[${lines}A")
+
+        fun down(lines: Int) =
+            print("$ESC[${lines}B")
+
+        fun right(cols: Int) =
+            print("$ESC[${cols}C")
+
+        fun left(cols: Int) =
+            print("$ESC[${cols}D")
+    }
+
+    fun printAndBack(text: String) {
+        print(text)
+        Cursor.left(text.length)
+    }
+}
+
+fun main() {
+    Ansi.printAndBack("001")
+    print("002")
+}