JFEP - Java Fast Expression Parser by Bertoli Marco. JFEP is designed to be lightweight and fast, suitable for multiple evaluations of the same function with minimum overhead. JFEP Home page: http://jfep.sourceforge.net
JFEP supports implicit multiplication, when a number in input string if followed by a character
Power | ^ |
Unary Minus | -n |
Modulus | % |
Division | / |
Multiplication | * |
Addition, Subtraction | +, - |
Sine | sin() |
Cosine | cos() |
Tangent | tan() |
Arc Sine | asin() |
Arc Cosine | acos() |
Arc Tangent | atan() |
Hyperbolic Sine | sinh() |
Hyperbolic Cosine | cosh() |
Hyperbolic Tangent | tanh() |
Inverse Hyperbolic Sine | asinh() |
Inverse Hyperbolic Cosine | acosh() |
Inverse Hyperbolic Tangent | atanh() |
Natural Logarithm | ln() |
Logarithm base 10 | log() |
Logarithm base 2 | log2() |
Absolute Value / Magnitude | abs() |
Random number (between 0 and given argument) | rand() |
Square Root | sqrt() |
Error Function | erf() |
Complementary Error Function | erfc() |
Gamma function | gamma() |
Exponential | exp() |
Cotangent | cot() |
pi = 3.14159265358979323846 | pi |
e = 2.7182818284590452354 | e |
Copyright 2006, Bertoli Marco
Licensed under the Apache License, Version 2.0