forked from kscience/kmath
Alexander Nozik
5032523bbf
# Conflicts: # build.gradle.kts # examples/src/main/kotlin/scientifik/kmath/linear/LinearAlgebraBenchmark.kt # kmath-ast/build.gradle.kts # kmath-ast/src/commonMain/kotlin/scientifik/kmath/ast/MstAlgebra.kt # kmath-commons/build.gradle.kts # kmath-core/src/commonMain/kotlin/scientifik/kmath/misc/AutoDiff.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/operations/Complex.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/structures/Buffers.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/structures/FlaggedBuffer.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/structures/IntBuffer.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/structures/RealBuffer.kt # kmath-core/src/commonMain/kotlin/scientifik/kmath/structures/ShortBuffer.kt # kmath-for-real/build.gradle.kts # kmath-functions/build.gradle.kts # kmath-memory/build.gradle.kts # kmath-prob/build.gradle.kts |
||
---|---|---|
.. | ||
reference | ||
src | ||
build.gradle.kts | ||
README.md |
Abstract Syntax Tree Expression Representation and Operations (kmath-ast
)
This subproject implements the following features:
- Expression Language and its parser.
- MST (Mathematical Syntax Tree) as expression language's syntax intermediate representation.
- Type-safe builder for MST.
- Evaluating expressions by traversing MST.
Artifact:
This module is distributed in the artifact
scientifik:kmath-ast:0.1.4-dev-8
.Gradle:
repositories { maven { url 'https://dl.bintray.com/mipt-npm/scientifik' } maven { url 'https://dl.bintray.com/mipt-npm/dev' } maven { url https://dl.bintray.com/hotkeytlt/maven' } } dependencies { implementation 'scientifik:kmath-ast:0.1.4-dev-8' }
Gradle Kotlin DSL:
repositories { maven("https://dl.bintray.com/mipt-npm/scientifik") maven("https://dl.bintray.com/mipt-npm/dev") maven("https://dl.bintray.com/hotkeytlt/maven") } dependencies { implementation("scientifik:kmath-ast:0.1.4-dev-8") }
Dynamic Expression Code Generation with ObjectWeb ASM
kmath-ast
JVM module supports runtime code generation to eliminate overhead of tree traversal. Code generator builds
a special implementation of Expression<T>
with implemented invoke
function.
For example, the following builder:
RealField.mstInField { symbol("x") + 2 }.compile()
… leads to generation of bytecode, which can be decompiled to the following Java class:
package scientifik.kmath.asm.generated;
import java.util.Map;
import scientifik.kmath.asm.internal.MapIntrinsics;
import scientifik.kmath.expressions.Expression;
import scientifik.kmath.operations.RealField;
public final class AsmCompiledExpression_1073786867_0 implements Expression<Double> {
private final RealField algebra;
public final Double invoke(Map<String, ? extends Double> arguments) {
return (Double)this.algebra.add(((Double)MapIntrinsics.getOrFail(arguments, "x")).doubleValue(), 2.0D);
}
public AsmCompiledExpression_1073786867_0(RealField algebra) {
this.algebra = algebra;
}
}
Example Usage
This API extends MST and MstExpression, so you may optimize as both of them:
RealField.mstInField { symbol("x") + 2 }.compile()
RealField.expression("x+2".parseMath())
Known issues
- The same classes may be generated and loaded twice, so it is recommended to cache compiled expressions to avoid class loading overhead.
- This API is not supported by non-dynamic JVM implementations (like TeaVM and GraalVM) because of using class loaders.
Contributed by Iaroslav Postovalov.