mirror of
https://github.com/DanilaFe/abacus
synced 2026-01-25 16:15:19 +00:00
Compare commits
28 Commits
context
...
number-ran
| Author | SHA1 | Date | |
|---|---|---|---|
| fd3f56aa8f | |||
| e364f4e94b | |||
| 4c94abb18b | |||
| ba63dd7874 | |||
| 566598b702 | |||
| eb91a5b875 | |||
| fcd4694203 | |||
| 566831246c | |||
| ad8a0a9b2a | |||
| e430e738cf | |||
| f6e326e0f1 | |||
| 07581557c7 | |||
| 14ac9c67f4 | |||
| 0ff071e212 | |||
| 88e3bb7109 | |||
| 540e5d6099 | |||
| c9e93d87a2 | |||
| 337edd68fa | |||
| 08967fbb8f | |||
| 46f78bb2ed | |||
| 5b4773dee1 | |||
| be94394a5c | |||
| 45de25cd50 | |||
| 52ab357fe1 | |||
| 1575d3e574 | |||
| 87529da15f | |||
| 7cd117dac1 | |||
| 8975bfdb99 |
4
.gitignore
vendored
4
.gitignore
vendored
@@ -24,7 +24,9 @@ hs_err_pid*
|
||||
# Custom Stuff
|
||||
# Gradle
|
||||
.gradle/*
|
||||
build/*
|
||||
**/build/*
|
||||
**/out/**
|
||||
**/.DS_Store
|
||||
|
||||
# IntelliJ
|
||||
.idea/*
|
||||
|
||||
@@ -0,0 +1,9 @@
|
||||
package org.nwapw.abacus.exception;
|
||||
|
||||
public class AbacusException extends RuntimeException {
|
||||
|
||||
public AbacusException(String baseMessage, String description){
|
||||
super(baseMessage + ((description.equals("")) ? "." : (": " + description)));
|
||||
}
|
||||
|
||||
}
|
||||
@@ -1,16 +1,16 @@
|
||||
package org.nwapw.abacus.number;
|
||||
package org.nwapw.abacus.exception;
|
||||
|
||||
/**
|
||||
* Exception thrown when the computation is interrupted by
|
||||
* the user.
|
||||
*/
|
||||
public class ComputationInterruptedException extends RuntimeException {
|
||||
public class ComputationInterruptedException extends AbacusException {
|
||||
|
||||
/**
|
||||
* Creates a new exception of this type.
|
||||
*/
|
||||
public ComputationInterruptedException() {
|
||||
super("Computation interrupted by user.");
|
||||
super("Computation interrupted", "");
|
||||
}
|
||||
|
||||
}
|
||||
@@ -1,24 +1,24 @@
|
||||
package org.nwapw.abacus.function;
|
||||
package org.nwapw.abacus.exception;
|
||||
|
||||
/**
|
||||
* Exception thrown if the function parameters do not match
|
||||
* requirements.
|
||||
*/
|
||||
public class DomainException extends RuntimeException {
|
||||
public class DomainException extends AbacusException {
|
||||
|
||||
/**
|
||||
* Creates a new DomainException.
|
||||
* @param reason the reason for which the exception is thrown.
|
||||
*/
|
||||
public DomainException(String reason) {
|
||||
super(reason);
|
||||
super("Domain error", reason);
|
||||
}
|
||||
|
||||
/**
|
||||
* Creates a new DomainException with a default message.
|
||||
*/
|
||||
public DomainException(){
|
||||
this("Domain Error");
|
||||
this("");
|
||||
}
|
||||
|
||||
}
|
||||
@@ -1,17 +1,17 @@
|
||||
package org.nwapw.abacus.function;
|
||||
package org.nwapw.abacus.exception;
|
||||
|
||||
/**
|
||||
* An exception thrown primarily from Tree Value operators and functions,
|
||||
* which have to deal with the result of a Reducer as well as the results
|
||||
* of Applicable.
|
||||
*/
|
||||
public class EvaluationException extends RuntimeException {
|
||||
public class EvaluationException extends AbacusException {
|
||||
|
||||
/**
|
||||
* Creates a new EvaluationException with the default string.
|
||||
*/
|
||||
public EvaluationException() {
|
||||
super("Error evaluating expression.");
|
||||
this("");
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -19,7 +19,7 @@ public class EvaluationException extends RuntimeException {
|
||||
* @param message the message string.
|
||||
*/
|
||||
public EvaluationException(String message) {
|
||||
super(message);
|
||||
super("Evaluation error", message);
|
||||
}
|
||||
|
||||
}
|
||||
@@ -0,0 +1,24 @@
|
||||
package org.nwapw.abacus.exception;
|
||||
|
||||
/**
|
||||
* Exception thrown when a promotion fails.
|
||||
*/
|
||||
public class PromotionException extends AbacusException {
|
||||
|
||||
/**
|
||||
* Creates a new PromotionException with the default message
|
||||
* and no additional information.
|
||||
*/
|
||||
public PromotionException() {
|
||||
this("");
|
||||
}
|
||||
|
||||
/**
|
||||
* Creates a new PromotionException with the given additional message.
|
||||
* @param message the additional message to include with the error.
|
||||
*/
|
||||
public PromotionException(String message) {
|
||||
super("Failed to promote number instances", message);
|
||||
}
|
||||
|
||||
}
|
||||
@@ -1,9 +1,11 @@
|
||||
package org.nwapw.abacus.number;
|
||||
|
||||
import org.nwapw.abacus.exception.ComputationInterruptedException;
|
||||
|
||||
/**
|
||||
* An interface used to represent a number.
|
||||
*/
|
||||
public abstract class NumberInterface {
|
||||
public abstract class NumberInterface implements Comparable<NumberInterface> {
|
||||
|
||||
/**
|
||||
* Check if the thread was interrupted and
|
||||
@@ -156,14 +158,6 @@ public abstract class NumberInterface {
|
||||
return intPowInternal(exponent);
|
||||
}
|
||||
|
||||
/**
|
||||
* Compares this number to another.
|
||||
*
|
||||
* @param number the number to compare to.
|
||||
* @return same as Integer.compare();
|
||||
*/
|
||||
public abstract int compareTo(NumberInterface number);
|
||||
|
||||
/**
|
||||
* Same as Math.signum().
|
||||
*
|
||||
@@ -244,4 +238,16 @@ public abstract class NumberInterface {
|
||||
*/
|
||||
public abstract NumberInterface getMaxError();
|
||||
|
||||
/**
|
||||
* Returns a NumberRangeBuilder object, which is used to create a range.
|
||||
* The reason that this returns a builder and not an actual range is that
|
||||
* the NumberRange needs to promote values passed to it, which
|
||||
* requires an abacus instance.
|
||||
* @param other the value at the bottom of the range.
|
||||
* @return the resulting range builder.
|
||||
*/
|
||||
public NumberRangeBuilder rangeTo(NumberInterface other){
|
||||
return new NumberRangeBuilder(this, other);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
@@ -154,19 +154,20 @@ public class ShuntingYardParser implements Parser<Match<TokenType>>, PluginListe
|
||||
return new VariableNode(match.getContent());
|
||||
} else if (matchType == TokenType.FUNCTION || matchType == TokenType.TREE_VALUE_FUNCTION) {
|
||||
String functionName = match.getContent();
|
||||
CallNode node;
|
||||
if (matchType == TokenType.FUNCTION) {
|
||||
node = new FunctionNode(functionName);
|
||||
} else {
|
||||
node = new TreeValueFunctionNode(functionName);
|
||||
}
|
||||
List<TreeNode> children = new ArrayList<>();
|
||||
while (!matches.isEmpty() && matches.get(0).getType() != TokenType.INTERNAL_FUNCTION_END) {
|
||||
TreeNode argument = constructRecursive(matches);
|
||||
if (argument == null) return null;
|
||||
node.getChildren().add(0, argument);
|
||||
children.add(0, argument);
|
||||
}
|
||||
if (matches.isEmpty()) return null;
|
||||
matches.remove(0);
|
||||
CallNode node;
|
||||
if (matchType == TokenType.FUNCTION) {
|
||||
node = new FunctionNode(functionName, children);
|
||||
} else {
|
||||
node = new TreeValueFunctionNode(functionName, children);
|
||||
}
|
||||
return node;
|
||||
}
|
||||
return null;
|
||||
|
||||
@@ -141,6 +141,7 @@ public class PluginManager {
|
||||
registeredNumberImplementations.put(name, implementation);
|
||||
interfaceImplementationNames.put(implementation.getImplementation(), name);
|
||||
interfaceImplementations.put(implementation.getImplementation(), implementation);
|
||||
cachedPi.put(implementation.getImplementation(), implementation.instanceForPi());
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -218,10 +219,6 @@ public class PluginManager {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (toReturn == null) {
|
||||
toReturn = new Documentation(name, "", "", "", type);
|
||||
registerDocumentation(toReturn);
|
||||
}
|
||||
return toReturn;
|
||||
}
|
||||
|
||||
@@ -252,14 +249,7 @@ public class PluginManager {
|
||||
* @return pi
|
||||
*/
|
||||
public NumberInterface piFor(Class<? extends NumberInterface> forClass) {
|
||||
if (cachedPi.containsKey(forClass)) return cachedPi.get(forClass);
|
||||
NumberImplementation implementation = interfaceImplementationFor(forClass);
|
||||
NumberInterface generatedPi = null;
|
||||
if (implementation != null) {
|
||||
generatedPi = implementation.instanceForPi();
|
||||
}
|
||||
cachedPi.put(forClass, generatedPi);
|
||||
return generatedPi;
|
||||
return cachedPi.get(forClass);
|
||||
}
|
||||
|
||||
/**
|
||||
|
||||
@@ -29,8 +29,7 @@ public class StandardPlugin extends Plugin {
|
||||
@Override
|
||||
public NumberInterface applyInternal(MutableEvaluationContext context, TreeNode[] params) {
|
||||
String assignTo = ((VariableNode) params[0]).getVariable();
|
||||
NumberInterface value = params[1].reduce(context.getReducer());
|
||||
if(value == null) throw new EvaluationException();
|
||||
NumberInterface value = params[1].reduce(context.getInheritedReducer());
|
||||
context.setVariable(assignTo, value);
|
||||
return value;
|
||||
}
|
||||
@@ -48,9 +47,7 @@ public class StandardPlugin extends Plugin {
|
||||
public NumberInterface applyInternal(MutableEvaluationContext context, TreeNode[] params) {
|
||||
String assignTo = ((VariableNode) params[0]).getVariable();
|
||||
context.setDefinition(assignTo, params[1]);
|
||||
NumberInterface value = params[1].reduce(context.getReducer());
|
||||
if(value == null) throw new EvaluationException();
|
||||
return value;
|
||||
return params[1].reduce(context.getInheritedReducer());
|
||||
}
|
||||
};
|
||||
/**
|
||||
@@ -696,8 +693,7 @@ public class StandardPlugin extends Plugin {
|
||||
* @param n non-negative integer.
|
||||
* @return a number of numClass with value n factorial.
|
||||
*/
|
||||
public static NumberInterface factorial(NumberImplementation implementation, int n) {
|
||||
|
||||
synchronized public static NumberInterface factorial(NumberImplementation implementation, int n) {
|
||||
if (!FACTORIAL_LISTS.containsKey(implementation)) {
|
||||
FACTORIAL_LISTS.put(implementation, new ArrayList<>());
|
||||
FACTORIAL_LISTS.get(implementation).add(implementation.instanceForString("1"));
|
||||
|
||||
@@ -68,6 +68,7 @@ class Abacus(val configuration: Configuration) {
|
||||
pluginManager.reload()
|
||||
with(mutableContext) {
|
||||
numberImplementation = pluginManager.numberImplementationFor(configuration.numberImplementation)
|
||||
?: StandardPlugin.IMPLEMENTATION_NAIVE
|
||||
clearVariables()
|
||||
clearDefinitions()
|
||||
}
|
||||
|
||||
@@ -1,7 +1,7 @@
|
||||
package org.nwapw.abacus.function.applicable
|
||||
|
||||
import org.nwapw.abacus.context.MutableEvaluationContext
|
||||
import org.nwapw.abacus.function.DomainException
|
||||
import org.nwapw.abacus.exception.DomainException
|
||||
|
||||
/**
|
||||
* A class that can be applied to arguments.
|
||||
@@ -36,7 +36,8 @@ interface Applicable<in T : Any, out O : Any> {
|
||||
* @return the result of the operation, or null if parameters do not match.
|
||||
*/
|
||||
fun apply(context: MutableEvaluationContext, vararg params: T): O {
|
||||
if (!matchesParams(context, params)) throw DomainException()
|
||||
if (!matchesParams(context, params))
|
||||
throw DomainException("parameters do not match function requirements.")
|
||||
return applyInternal(context, params)
|
||||
}
|
||||
|
||||
|
||||
28
core/src/main/kotlin/org/nwapw/abacus/number/NumberRange.kt
Normal file
28
core/src/main/kotlin/org/nwapw/abacus/number/NumberRange.kt
Normal file
@@ -0,0 +1,28 @@
|
||||
package org.nwapw.abacus.number
|
||||
|
||||
import org.nwapw.abacus.Abacus
|
||||
|
||||
/**
|
||||
* A closed range designed specifically for [NumberInterface]
|
||||
*
|
||||
* Besides providing the usual functionality of a [ClosedRange], this range
|
||||
* also handles promotion - that is, it's safe to use it with numbers of different
|
||||
* implementations, even as starting and ending points.
|
||||
*
|
||||
* @property abacus the abacus instance used for promotion.
|
||||
* @property start the starting point of the range.
|
||||
* @property endInclusive the ending point of the range.
|
||||
*/
|
||||
class NumberRange(val abacus: Abacus,
|
||||
override val start: NumberInterface,
|
||||
override val endInclusive: NumberInterface): ClosedRange<NumberInterface> {
|
||||
|
||||
override operator fun contains(value: NumberInterface): Boolean {
|
||||
val promotionResult = abacus.promotionManager.promote(start, endInclusive, value)
|
||||
val newStart = promotionResult.items[0]
|
||||
val newEnd = promotionResult.items[1]
|
||||
val newValue = promotionResult.items[2]
|
||||
return newValue >= newStart && newValue <= newEnd
|
||||
}
|
||||
|
||||
}
|
||||
@@ -0,0 +1,24 @@
|
||||
package org.nwapw.abacus.number
|
||||
|
||||
import org.nwapw.abacus.Abacus
|
||||
|
||||
/**
|
||||
* A utility class for creating [NumberRange] instances.
|
||||
*
|
||||
* Unlike a regular [ClosedRange], a NumberRange must have a third parameter,
|
||||
* which is the [Abacus] instance that is used for promotion. However, the ".." operator
|
||||
* is infix, and can only take two parameters. The solution is, instead of returning instances
|
||||
* of NumberRange directly, to return a builder, which then provides a [with] infix function
|
||||
* to attach it to an instance of Abacus.
|
||||
* @property start the beginning of the range.
|
||||
* @property endInclusive the end of the range.
|
||||
*/
|
||||
class NumberRangeBuilder(private val start: NumberInterface, private val endInclusive: NumberInterface) {
|
||||
|
||||
/**
|
||||
* Generate a [NumberRange] with the given instance of [abacus].
|
||||
* @return a new range with the given instance of Abacus.
|
||||
*/
|
||||
infix fun with(abacus: Abacus) = NumberRange(abacus, start, endInclusive)
|
||||
|
||||
}
|
||||
@@ -1,6 +1,7 @@
|
||||
package org.nwapw.abacus.number
|
||||
|
||||
import org.nwapw.abacus.Abacus
|
||||
import org.nwapw.abacus.exception.PromotionException
|
||||
import org.nwapw.abacus.plugin.NumberImplementation
|
||||
import org.nwapw.abacus.plugin.PluginListener
|
||||
import org.nwapw.abacus.plugin.PluginManager
|
||||
@@ -37,21 +38,6 @@ class PromotionManager(val abacus: Abacus) : PluginListener {
|
||||
return null
|
||||
}
|
||||
|
||||
/**
|
||||
* If a path between the given implementations has already been computed, uses
|
||||
* the already calculated path. Otherwise, calls [computePathBetween] to compute a new
|
||||
* path.
|
||||
*
|
||||
* @param from the implementation to start from.
|
||||
* @param to the implementation to get to.
|
||||
* @return the resulting promotion path, or null if it is not found
|
||||
*/
|
||||
fun getPathBetween(from: NumberImplementation, to: NumberImplementation): PromotionPath? {
|
||||
return computePaths.computeIfAbsent(from to to, {
|
||||
computePathBetween(it.first, it.second)
|
||||
})
|
||||
}
|
||||
|
||||
/**
|
||||
* Promote all the numbers in the list to the same number implementation, to ensure
|
||||
* they can be used with each other. Finds the highest priority implementation
|
||||
@@ -60,22 +46,30 @@ class PromotionManager(val abacus: Abacus) : PluginListener {
|
||||
* @param numbers the numbers to promote.
|
||||
* @return the resulting promotion result.
|
||||
*/
|
||||
fun promote(vararg numbers: NumberInterface): PromotionResult? {
|
||||
fun promote(vararg numbers: NumberInterface): PromotionResult {
|
||||
val pluginManager = abacus.pluginManager
|
||||
val implementations = numbers.map { pluginManager.interfaceImplementationFor(it.javaClass) }
|
||||
val highestPriority = implementations.sortedBy { it.priority }.last()
|
||||
return PromotionResult(items = numbers.map {
|
||||
if(it.javaClass == highestPriority.implementation) it
|
||||
else getPathBetween(pluginManager.interfaceImplementationFor(it.javaClass), highestPriority)
|
||||
?.promote(it) ?: return null
|
||||
else computePaths[pluginManager.interfaceImplementationFor(it.javaClass) to highestPriority]
|
||||
?.promote(it) ?: throw PromotionException()
|
||||
}.toTypedArray(), promotedTo = highestPriority)
|
||||
}
|
||||
|
||||
override fun onLoad(manager: PluginManager?) {
|
||||
|
||||
override fun onLoad(manager: PluginManager) {
|
||||
val implementations = manager.allNumberImplementations.map { manager.numberImplementationFor(it) }
|
||||
for(first in implementations) {
|
||||
for(second in implementations) {
|
||||
val promoteFrom = if(second.priority > first.priority) first else second
|
||||
val promoteTo = if(second.priority > first.priority) second else first
|
||||
val path = computePathBetween(promoteFrom, promoteTo)
|
||||
computePaths[promoteFrom to promoteTo] = path
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
override fun onUnload(manager: PluginManager?) {
|
||||
override fun onUnload(manager: PluginManager) {
|
||||
computePaths.clear()
|
||||
}
|
||||
|
||||
|
||||
@@ -11,10 +11,10 @@ package org.nwapw.abacus.tree
|
||||
* @param left the left node.
|
||||
* @param right the right node.
|
||||
*/
|
||||
abstract class BinaryNode(val operation: String, val left: TreeNode? = null, val right: TreeNode?) : TreeNode() {
|
||||
abstract class BinaryNode(val operation: String, val left: TreeNode, val right: TreeNode) : TreeNode() {
|
||||
|
||||
override fun toString(): String {
|
||||
return "(" + (left?.toString() ?: "null") + operation + (right?.toString() ?: "null") + ")"
|
||||
return "(" + left.toString() + operation + right.toString() + ")"
|
||||
}
|
||||
|
||||
}
|
||||
@@ -7,13 +7,9 @@ package org.nwapw.abacus.tree
|
||||
* to extend this functionality.
|
||||
*
|
||||
* @param callTo the name of the things being called.
|
||||
* @param children the children of this node.
|
||||
*/
|
||||
abstract class CallNode(val callTo: String) : TreeNode() {
|
||||
|
||||
/**
|
||||
* The list of children this node has.
|
||||
*/
|
||||
val children: MutableList<TreeNode> = mutableListOf()
|
||||
abstract class CallNode(val callTo: String, val children: List<TreeNode>) : TreeNode() {
|
||||
|
||||
override fun toString(): String {
|
||||
val buffer = StringBuffer()
|
||||
|
||||
@@ -3,4 +3,4 @@ package org.nwapw.abacus.tree
|
||||
import org.nwapw.abacus.context.MutableEvaluationContext
|
||||
import org.nwapw.abacus.number.NumberInterface
|
||||
|
||||
data class EvaluationResult(val value: NumberInterface?, val resultingContext: MutableEvaluationContext)
|
||||
data class EvaluationResult(val value: NumberInterface, val resultingContext: MutableEvaluationContext)
|
||||
@@ -8,10 +8,10 @@ package org.nwapw.abacus.tree
|
||||
*
|
||||
* @param function the function string.
|
||||
*/
|
||||
class FunctionNode(function: String) : CallNode(function) {
|
||||
class FunctionNode(function: String, children: List<TreeNode>) : CallNode(function, children) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
val children = Array<Any>(children.size, { children[it].reduce(reducer) ?: return null; })
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
val children = Array<Any>(children.size, { children[it].reduce(reducer) })
|
||||
return reducer.reduceNode(this, *children)
|
||||
}
|
||||
|
||||
|
||||
@@ -10,12 +10,12 @@ package org.nwapw.abacus.tree
|
||||
* @param left the left child of this node.
|
||||
* @param right the right child of this node.
|
||||
*/
|
||||
class NumberBinaryNode(operation: String, left: TreeNode?, right: TreeNode?)
|
||||
class NumberBinaryNode(operation: String, left: TreeNode, right: TreeNode)
|
||||
: BinaryNode(operation, left, right) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
val left = left?.reduce(reducer) ?: return null
|
||||
val right = right?.reduce(reducer) ?: return null
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
val left = left.reduce(reducer)
|
||||
val right = right.reduce(reducer)
|
||||
return reducer.reduceNode(this, left, right)
|
||||
}
|
||||
|
||||
|
||||
@@ -10,7 +10,7 @@ package org.nwapw.abacus.tree
|
||||
*/
|
||||
class NumberNode(val number: String) : TreeNode() {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
return reducer.reduceNode(this)
|
||||
}
|
||||
|
||||
|
||||
@@ -2,6 +2,7 @@ package org.nwapw.abacus.tree
|
||||
|
||||
import org.nwapw.abacus.Abacus
|
||||
import org.nwapw.abacus.context.EvaluationContext
|
||||
import org.nwapw.abacus.exception.EvaluationException
|
||||
import org.nwapw.abacus.number.NumberInterface
|
||||
|
||||
class NumberReducer(val abacus: Abacus, context: EvaluationContext) : Reducer<NumberInterface> {
|
||||
@@ -12,18 +13,19 @@ class NumberReducer(val abacus: Abacus, context: EvaluationContext) : Reducer<Nu
|
||||
this.context.reducer = this
|
||||
}
|
||||
|
||||
override fun reduceNode(treeNode: TreeNode, vararg children: Any): NumberInterface? {
|
||||
override fun reduceNode(treeNode: TreeNode, vararg children: Any): NumberInterface {
|
||||
val promotionManager = abacus.promotionManager
|
||||
return when(treeNode){
|
||||
is NumberNode -> {
|
||||
context.inheritedNumberImplementation?.instanceForString(treeNode.number)
|
||||
?: throw EvaluationException("no number implementation selected.")
|
||||
}
|
||||
is VariableNode -> {
|
||||
val variable = context.getVariable(treeNode.variable)
|
||||
if(variable != null) return variable
|
||||
val definition = context.getDefinition(treeNode.variable)
|
||||
if(definition != null) return definition.reduce(this)
|
||||
null
|
||||
throw EvaluationException("variable is not defined.")
|
||||
}
|
||||
is NumberUnaryNode -> {
|
||||
val child = children[0] as NumberInterface
|
||||
@@ -34,29 +36,29 @@ class NumberReducer(val abacus: Abacus, context: EvaluationContext) : Reducer<Nu
|
||||
is NumberBinaryNode -> {
|
||||
val left = children[0] as NumberInterface
|
||||
val right = children[1] as NumberInterface
|
||||
val promotionResult = promotionManager.promote(left, right) ?: return null
|
||||
val promotionResult = promotionManager.promote(left, right)
|
||||
context.numberImplementation = promotionResult.promotedTo
|
||||
abacus.pluginManager.operatorFor(treeNode.operation).apply(context, *promotionResult.items)
|
||||
}
|
||||
is FunctionNode -> {
|
||||
val promotionResult = promotionManager
|
||||
.promote(*children.map { it as NumberInterface }.toTypedArray()) ?: return null
|
||||
.promote(*children.map { it as NumberInterface }.toTypedArray())
|
||||
context.numberImplementation = promotionResult.promotedTo
|
||||
abacus.pluginManager.functionFor(treeNode.callTo).apply(context, *promotionResult.items)
|
||||
}
|
||||
is TreeValueUnaryNode -> {
|
||||
abacus.pluginManager.treeValueOperatorFor(treeNode.operation)
|
||||
.apply(context, treeNode.applyTo ?: return null)
|
||||
.apply(context, treeNode.applyTo)
|
||||
}
|
||||
is TreeValueBinaryNode -> {
|
||||
abacus.pluginManager.treeValueOperatorFor(treeNode.operation)
|
||||
.apply(context, treeNode.left ?: return null, treeNode.right ?: return null)
|
||||
.apply(context, treeNode.left, treeNode.right)
|
||||
}
|
||||
is TreeValueFunctionNode -> {
|
||||
abacus.pluginManager.treeValueFunctionFor(treeNode.callTo)
|
||||
.apply(context, *treeNode.children.toTypedArray())
|
||||
}
|
||||
else -> null
|
||||
else -> throw EvaluationException("unrecognized tree node.")
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@@ -8,11 +8,11 @@ package org.nwapw.abacus.tree
|
||||
* @param operation the operation this node performs.
|
||||
* @param child the child this node should be applied to.
|
||||
*/
|
||||
class NumberUnaryNode(operation: String, child: TreeNode?)
|
||||
class NumberUnaryNode(operation: String, child: TreeNode)
|
||||
: UnaryNode(operation, child) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
val child = applyTo?.reduce(reducer) ?: return null
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
val child = applyTo.reduce(reducer)
|
||||
return reducer.reduceNode(this, child)
|
||||
}
|
||||
|
||||
|
||||
@@ -14,6 +14,6 @@ interface Reducer<out T> {
|
||||
* @param treeNode the tree node to reduce.
|
||||
* @param children the list of children, of type T.
|
||||
*/
|
||||
fun reduceNode(treeNode: TreeNode, vararg children: Any): T?
|
||||
fun reduceNode(treeNode: TreeNode, vararg children: Any): T
|
||||
|
||||
}
|
||||
@@ -5,6 +5,6 @@ package org.nwapw.abacus.tree
|
||||
*/
|
||||
abstract class TreeNode {
|
||||
|
||||
abstract fun <T : Any> reduce(reducer: Reducer<T>): T?
|
||||
abstract fun <T : Any> reduce(reducer: Reducer<T>): T
|
||||
|
||||
}
|
||||
@@ -11,10 +11,10 @@ package org.nwapw.abacus.tree
|
||||
* @param left the left child of this node.
|
||||
* @param right the right child of this node.
|
||||
*/
|
||||
class TreeValueBinaryNode(operation: String, left: TreeNode?, right: TreeNode?)
|
||||
class TreeValueBinaryNode(operation: String, left: TreeNode, right: TreeNode)
|
||||
: BinaryNode(operation, left, right) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
return reducer.reduceNode(this)
|
||||
}
|
||||
|
||||
|
||||
@@ -7,9 +7,9 @@ package org.nwapw.abacus.tree
|
||||
* is mostly to help the reducer. Besides that, this class also does not
|
||||
* even attempt to reduce its children.
|
||||
*/
|
||||
class TreeValueFunctionNode(name: String) : CallNode(name) {
|
||||
class TreeValueFunctionNode(name: String, children: List<TreeNode>) : CallNode(name, children) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
return reducer.reduceNode(this)
|
||||
}
|
||||
|
||||
|
||||
@@ -9,11 +9,11 @@ package org.nwapw.abacus.tree
|
||||
* @param operation the operation this node performs.
|
||||
* @param child the node the operation should be applied to.
|
||||
*/
|
||||
class TreeValueUnaryNode(operation: String, child: TreeNode?)
|
||||
class TreeValueUnaryNode(operation: String, child: TreeNode)
|
||||
: UnaryNode(operation, child) {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
return reducer.reduceNode(this);
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
return reducer.reduceNode(this)
|
||||
}
|
||||
|
||||
}
|
||||
@@ -9,10 +9,10 @@ package org.nwapw.abacus.tree
|
||||
* @param operation the operation applied to the given node.
|
||||
* @param applyTo the node to which the operation will be applied.
|
||||
*/
|
||||
abstract class UnaryNode(val operation: String, val applyTo: TreeNode? = null) : TreeNode() {
|
||||
abstract class UnaryNode(val operation: String, val applyTo: TreeNode) : TreeNode() {
|
||||
|
||||
override fun toString(): String {
|
||||
return "(" + (applyTo?.toString() ?: "null") + ")" + operation
|
||||
return "(" + applyTo.toString() + ")" + operation
|
||||
}
|
||||
|
||||
}
|
||||
@@ -10,7 +10,7 @@ package org.nwapw.abacus.tree
|
||||
*/
|
||||
class VariableNode(val variable: String) : TreeNode() {
|
||||
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T? {
|
||||
override fun <T : Any> reduce(reducer: Reducer<T>): T {
|
||||
return reducer.reduceNode(this)
|
||||
}
|
||||
|
||||
|
||||
@@ -5,7 +5,7 @@ import org.junit.BeforeClass;
|
||||
import org.junit.Test;
|
||||
import org.nwapw.abacus.Abacus;
|
||||
import org.nwapw.abacus.config.Configuration;
|
||||
import org.nwapw.abacus.function.DomainException;
|
||||
import org.nwapw.abacus.exception.DomainException;
|
||||
import org.nwapw.abacus.number.NumberInterface;
|
||||
import org.nwapw.abacus.plugin.StandardPlugin;
|
||||
import org.nwapw.abacus.tree.TreeNode;
|
||||
|
||||
97
core/src/test/java/org/nwapw/abacus/tests/RangeTests.java
Normal file
97
core/src/test/java/org/nwapw/abacus/tests/RangeTests.java
Normal file
@@ -0,0 +1,97 @@
|
||||
package org.nwapw.abacus.tests;
|
||||
|
||||
import org.junit.Assert;
|
||||
import org.junit.BeforeClass;
|
||||
import org.junit.Test;
|
||||
import org.nwapw.abacus.Abacus;
|
||||
import org.nwapw.abacus.config.Configuration;
|
||||
import org.nwapw.abacus.number.NaiveNumber;
|
||||
import org.nwapw.abacus.number.NumberInterface;
|
||||
import org.nwapw.abacus.number.NumberRange;
|
||||
import org.nwapw.abacus.number.PreciseNumber;
|
||||
import org.nwapw.abacus.plugin.StandardPlugin;
|
||||
|
||||
import java.util.function.Function;
|
||||
|
||||
public class RangeTests {
|
||||
|
||||
private static Abacus abacus = new Abacus(new Configuration( "precise", new String[]{}));
|
||||
private static Function<NumberInterface, NumberInterface> naivePromotion = i -> new NaiveNumber((i.toString()));
|
||||
private static Function<NumberInterface, NumberInterface> precisePromotion = i -> new PreciseNumber((i.toString()));
|
||||
|
||||
@BeforeClass
|
||||
public static void prepareTests() {
|
||||
abacus.getPluginManager().addInstantiated(new StandardPlugin(abacus.getPluginManager()));
|
||||
abacus.reload();
|
||||
}
|
||||
|
||||
public static NumberRange naiveRange(String bottom, String top) {
|
||||
return new NaiveNumber(bottom).rangeTo(new NaiveNumber(top)).with(abacus);
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRange(){
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertTrue(range.getStart().toString().startsWith("0"));
|
||||
Assert.assertTrue(range.getEndInclusive().toString().startsWith("10"));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRangeBelow() {
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertFalse(range.contains(new NaiveNumber("-10")));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRangeAbove() {
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertFalse(range.contains(new NaiveNumber("20")));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRangeJustWithinBottom() {
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertTrue(range.contains(new NaiveNumber("0")));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRangeJustWithinTop() {
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertTrue(range.contains(new NaiveNumber("10")));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testNaiveRangeWithin() {
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertTrue(range.contains(new NaiveNumber("5")));
|
||||
}
|
||||
|
||||
public static void addTestPromotionPaths() {
|
||||
StandardPlugin.IMPLEMENTATION_NAIVE.getPromotionPaths().put("precise", precisePromotion);
|
||||
StandardPlugin.IMPLEMENTATION_PRECISE.getPromotionPaths().put("naive", naivePromotion);
|
||||
abacus.reload();
|
||||
}
|
||||
|
||||
public static void removeTestPromotionPaths() {
|
||||
StandardPlugin.IMPLEMENTATION_NAIVE.getPromotionPaths().remove("precise");
|
||||
StandardPlugin.IMPLEMENTATION_NAIVE.getPromotionPaths().remove("naive");
|
||||
abacus.reload();
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testPromotionWithin() {
|
||||
addTestPromotionPaths();
|
||||
NumberRange range = naiveRange("0", "10");
|
||||
Assert.assertTrue(range.contains(new PreciseNumber("5")));
|
||||
removeTestPromotionPaths();
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testPromotionOutside(){
|
||||
addTestPromotionPaths();
|
||||
NumberRange range = naiveRange("0","10");
|
||||
Assert.assertFalse(range.contains(new PreciseNumber("20")));
|
||||
removeTestPromotionPaths();
|
||||
}
|
||||
|
||||
}
|
||||
@@ -12,9 +12,12 @@ import javafx.util.Callback;
|
||||
import javafx.util.StringConverter;
|
||||
import org.nwapw.abacus.Abacus;
|
||||
import org.nwapw.abacus.config.Configuration;
|
||||
import org.nwapw.abacus.exception.AbacusException;
|
||||
import org.nwapw.abacus.exception.ComputationInterruptedException;
|
||||
import org.nwapw.abacus.function.Documentation;
|
||||
import org.nwapw.abacus.function.DocumentationType;
|
||||
import org.nwapw.abacus.function.DomainException;
|
||||
import org.nwapw.abacus.exception.DomainException;
|
||||
import org.nwapw.abacus.exception.EvaluationException;
|
||||
import org.nwapw.abacus.number.*;
|
||||
import org.nwapw.abacus.plugin.ClassFinder;
|
||||
import org.nwapw.abacus.plugin.PluginListener;
|
||||
@@ -147,16 +150,11 @@ public class AbacusController implements PluginListener {
|
||||
}
|
||||
EvaluationResult result = abacus.evaluateTree(constructedTree);
|
||||
NumberInterface evaluatedNumber = result.getValue();
|
||||
if (evaluatedNumber == null) {
|
||||
return ERR_EVAL;
|
||||
}
|
||||
String resultingString = evaluatedNumber.toString();
|
||||
historyData.add(new HistoryModel(inputField.getText(), constructedTree.toString(), resultingString));
|
||||
abacus.applyToContext(result.getResultingContext());
|
||||
return resultingString;
|
||||
} catch (ComputationInterruptedException exception) {
|
||||
return ERR_STOP;
|
||||
} catch (DomainException exception) {
|
||||
} catch (AbacusException exception) {
|
||||
return exception.getMessage();
|
||||
} catch (RuntimeException exception) {
|
||||
exception.printStackTrace();
|
||||
@@ -363,7 +361,12 @@ public class AbacusController implements PluginListener {
|
||||
enabledPlugins.add(plugin);
|
||||
}
|
||||
PluginManager pluginManager = abacus.getPluginManager();
|
||||
functionList.addAll(manager.getAllFunctions().stream().map(name -> pluginManager.documentationFor(name, DocumentationType.FUNCTION))
|
||||
functionList.addAll(manager.getAllFunctions().stream().map(name -> {
|
||||
Documentation documentationInstance = pluginManager.documentationFor(name, DocumentationType.FUNCTION);
|
||||
if(documentationInstance == null)
|
||||
documentationInstance = new Documentation(name, "", "", "", DocumentationType.FUNCTION);
|
||||
return documentationInstance;
|
||||
})
|
||||
.collect(Collectors.toCollection(ArrayList::new)));
|
||||
functionList.addAll(manager.getAllTreeValueFunctions().stream().map(name -> pluginManager.documentationFor(name, DocumentationType.TREE_VALUE_FUNCTION))
|
||||
.collect(Collectors.toCollection(ArrayList::new)));
|
||||
|
||||
Reference in New Issue
Block a user