You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: LATEST.md
+3Lines changed: 3 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,5 +1,8 @@
1
1
# ParserNG
2
2
3
+
Parser 1.0.3 has been released on maven-central!
4
+
Maintaining the industry standard besting speeds of v1.0.x, it adds the functionality of rotational geometry.
5
+
In v1.0.3, you can use the rotor function, `rot` to rotate raw points in 3D space and other functions such as curves, lines, surfaces(both plane and curved) and 3D equations of all sorts.
3
6
4
7
ParserNG 1.0.2 has been released on maven-central!
5
8
Version 1.0.2 retains the wild speeds of Version 1.0.1. Adds an extra widening technique of variable passing to the Turbo mode,
Copy file name to clipboardExpand all lines: MORE.md
+29-29Lines changed: 29 additions & 29 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,5 +1,5 @@
1
1
# ParserNG
2
-
<b>ParserNG</b> is a powerful open-source math tool that parses and evaluates algebraic expressions and also knows how to handle a lot of mathematical expressions. Its latest release on mavn-central (version 0.2.1) can be used to plot 2D graphs(Geometric plots and function plots) It works seamlessly on all Java platforms.<br><br>
2
+
<b>ParserNG</b> is a powerful open-source math tool that parses and evaluates algebraic expressions and also knows how to handle a lot of mathematical expressions. Its latest release on mavn-central (version 1.0.31) can be used to plot 2D graphs(Geometric plots and function plots) It works seamlessly on all Java platforms.<br><br>
3
3
4
4
5
5
@@ -8,15 +8,15 @@
8
8
Click the Sponsor button to do this.
9
9
10
10
11
-
ParserNG v0.2.3 breaks the barrier in fully featured math parser frequencies!
12
-
With various other optimizations, v0.2.3 comes with inner loop optimizations which uses a blazing fast, post-fix style algorithm to quickly evaluate inner brackets with less checks and less string manipulations.
11
+
ParserNG v1.0.3 breaks the barrier in fully featured math parser frequencies!
12
+
With various other optimizations, v1.0.3 comes with inner loop optimizations which uses a blazing fast, post-fix style algorithm to quickly evaluate inner brackets with less checks and less string manipulations.
13
13
This obviously will make graphing and other iterative tasks super responsive.
14
14
15
-
ParserNG v0.2.4 is an extremely feature rich math tool which also doubles as (arguably) the fastest pure Java expression evaluator on the planet.
15
+
ParserNG v1.0.34 is an extremely feature rich math tool which also doubles as (arguably) the fastest pure Java expression evaluator on the planet.
16
16
In benchmarks, it beats com.expression.parser(Java Math Expression Parser) by almost (10x-14x) and edges out Exp4J (which is lightweight) in many benchmarks.
17
17
18
18
19
-
ParserNG 0.2.5 features strength reduction, constant folding and execution frame(array) based args passing(in contrast to Map based) to ensure O(1) complexity in passage of args to the evaluation stage.
19
+
ParserNG 1.0.35 features strength reduction, constant folding and execution frame(array) based args passing(in contrast to Map based) to ensure O(1) complexity in passage of args to the evaluation stage.
20
20
21
21
[Here are a few benchmarks here](./BENCHMARK_RESULTS.md)
22
22
@@ -68,7 +68,7 @@ If you need to access this library via Maven Central, do:
68
68
<dependency>
69
69
<groupId>com.github.gbenroscience</groupId>
70
70
<artifactId>parser-ng</artifactId>
71
-
<version>0.2.3</version>
71
+
<version>1.0.3</version>
72
72
</dependency>
73
73
74
74
@@ -101,20 +101,20 @@ ParserNG is written completely in (pure) Java and so is as cross-platform as Jav
101
101
## Using ParserNG as commandline tool
102
102
You can use jar directly as commandline calculus. Unless the tool is packed to your distribution:
103
103
```
104
-
java -jar parser-ng-0.2.3.jar 1+1
104
+
java -jar parser-ng-1.0.3.jar 1+1
105
105
2.0
106
106
```
107
107
Or as logical parser
108
108
```
109
-
java -jar parser-ng-0.2.3.jar -l true and true
109
+
java -jar parser-ng-1.0.3.jar -l true and true
110
110
true
111
-
java -jar parser-ng-0.2.3.jar -l "2 == (4-2)"
111
+
java -jar parser-ng-1.0.3.jar -l "2 == (4-2)"
112
112
true
113
113
```
114
114
You can get help by
115
115
```
116
-
java -jar parser-ng-0.2.3.jar -h
117
-
ParserNG 0.2.3 math.Main
116
+
java -jar parser-ng-1.0.3.jar -h
117
+
ParserNG 1.0.3 math.Main
118
118
-h/-H/--help this text; do not change for help (witout dashes), which lists functions
119
119
-v/-V/--verbose output is reprinted to stderr with some inter-steps
120
120
-l/-L/--logic will add logical expression wrapper around the expression
Copy file name to clipboardExpand all lines: PERFORMANCE_TUNING.md
+3-3Lines changed: 3 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,4 +1,4 @@
1
-
This section is designed to help you squeeze every last nanosecond out of **ParserNG 1.0.2**. Because the engine utilizes a JIT-native architecture via `MethodHandle` trees, its performance characteristics differ significantly from traditional interpreted parsers.
1
+
This section is designed to help you squeeze every last nanosecond out of **ParserNG 1.0.3**. Because the engine utilizes a JIT-native architecture via `MethodHandle` trees, its performance characteristics differ significantly from traditional interpreted parsers.
2
2
3
3
---
4
4
@@ -17,7 +17,7 @@ ParserNG offers two primary execution paths. Choosing the right one depends on y
17
17
---
18
18
19
19
### 2. The Power of Constant Folding
20
-
Version 1.0.2 introduces aggressive **Constant Folding**. This optimization happens during the compilation phase, where the parser identifies sub-expressions that result in a constant value and "pre-calculates" them.
20
+
Version 1.0.3 introduces aggressive **Constant Folding**. This optimization happens during the compilation phase, where the parser identifies sub-expressions that result in a constant value and "pre-calculates" them.
21
21
22
22
***Static Expression:**`sin(3.14159 / 2) + x`
23
23
***Folded Expression:**`1.0 + x`
@@ -72,7 +72,7 @@ for (int i = 0; i < 1_000_000; i++) {
72
72
---
73
73
74
74
### 6. JDK Version Matters
75
-
ParserNG 1.0.2 is optimized for **modern JDKs (17, 21, and 24)**. Improvements in the `java.lang.invoke` package in later versions directly translate to faster "Turbo" execution. If you are running on JDK 8 or 11, you may see slightly higher latencies due to less efficient `MethodHandle` inlining.
75
+
ParserNG 1.0.3 is optimized for **modern JDKs (17, 21, and 24)**. Improvements in the `java.lang.invoke` package in later versions directly translate to faster "Turbo" execution. If you are running on JDK 8 or 11, you may see slightly higher latencies due to less efficient `MethodHandle` inlining.
Copy file name to clipboardExpand all lines: README.md
+41-14Lines changed: 41 additions & 14 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,6 @@
1
1
# ParserNG 🧮⚡
2
2
3
-
**ParserNG 1.0.2** is a **blazing-fast**, nigh zero allocation(memory wise), **pure Java**, **zero-native-dependencies** math expression parser and evaluator.
3
+
**ParserNG 1.0.3** is a **blazing-fast**, nigh zero allocation(memory wise), **pure Java**, **zero-native-dependencies** math expression parser and evaluator.
4
4
5
5
It **beats Janino, exp4J, and com.expression.parser on evaluation speed** across every kind of expression — from simple algebra to heavy trig, matrices, and calculus.
6
6
The normal mode routinely does about **3-10 million evaluations per second** while the new Turbo mode easily peaks at about **10 million to 90 million evaluations per second**.
> **1.0.2** introduces **Turbo Scalar** and **Turbo Matrix** compiled paths + massive speed improvements via strength reduction, constant folding, and O(1) frame-based argument passing.
17
+
> **1.0.3** introduces **Turbo Scalar** and **Turbo Matrix** compiled paths + massive speed improvements via strength reduction, constant folding, and O(1) frame-based argument passing.
18
18
19
-
## ✨ Highlights (v1.0.2)
19
+
## ✨ Highlights (v1.0.3)
20
20
21
21
-**Speed champion** — beats Janino in most benchmarks, and exp4J, com.expression.parser and Parsii in every benchmark (see [BENCHMARK_RESULTS.md](BENCHMARK_RESULTS.md))
22
22
-**Turbo Mode** — compile once, evaluate millions of times per second (Scalar + Matrix paths)
0 commit comments