re2js 1.1.0 → 1.2.1

package/README.md

@@ -98,18 +98,6 @@ RE2JS.DISABLE_UNICODE_GROUPS
 RE2JS.LONGEST_MATCH
 ```
 
-### Program size
-
-The program size represents a very approximate measure of a regexp's "cost". Larger numbers are more expensive than smaller numbers.
-
-```js
-import { RE2JS } from 're2js'
-
-console.log(RE2JS.compile('^').programSize()); // Outputs: 3
-console.log(RE2JS.compile('a+b').programSize()); // Outputs: 5
-console.log(RE2JS.compile('(a+b?)').programSize()); // Outputs: 8
-```
-
 ### Checking for Matches
 
 RE2JS allows you to check if a string matches a given regex pattern using the `matches()` function
@@ -385,9 +373,21 @@ RE2JS.matches(regexp, 'ab+c') // true
 RE2JS.matches(regexp, 'abc') // false
 ```
 
+### Program size
+
+The program size represents a very approximate measure of a regexp's "cost". Larger numbers are more expensive than smaller numbers
+
+```js
+import { RE2JS } from 're2js'
+
+console.log(RE2JS.compile('^').programSize()); // Outputs: 3
+console.log(RE2JS.compile('a+b').programSize()); // Outputs: 5
+console.log(RE2JS.compile('(a+b?)').programSize()); // Outputs: 8
+```
+
 ## Performance
 
-The RE2JS engine runs more slowly compared to native RegExp objects. This reduced speed is also noticeable when comparing RE2JS to the original RE2 engine. The C++ implementation of the RE2 engine includes both NFA (Nondeterministic Finite Automaton) and DFA (Deterministic Finite Automaton) engines, as well as a variety of optimizations. Russ Cox ported a simplified version of the NFA engine to Go. Later, Alan Donovan ported the NFA-based Go implementation to Java. I then ported the NFA-based Java implementation to a pure JS version. This is another reason why the pure JS version will perform more slowly compared to the original RE2 engine.
+The RE2JS engine runs more slowly compared to native RegExp objects. This reduced speed is also noticeable when comparing RE2JS to the original RE2 engine. The C++ implementation of the RE2 engine includes both NFA (Nondeterministic Finite Automaton) and DFA (Deterministic Finite Automaton) engines, as well as a variety of optimizations. Russ Cox ported a simplified version of the NFA engine to Go. Later, Alan Donovan ported the NFA-based Go implementation to Java. I then ported the NFA-based Java implementation (plus Golang stuff, which are not present in Java implementation, like checks for regular expression complexity) to a pure JS version. This is another reason why the pure JS version will perform more slowly compared to the original RE2 engine.
 
 Should you require high performance on the server side when using RE2, it would be beneficial to consider the following packages for JS: