re2js 0.4.2 → 0.4.3

package/README.md

@@ -131,6 +131,20 @@ RE2JS.compile('ab+c').matcher('cbbba').find() // false
 RE2JS.compile('ab+c', RE2JS.CASE_INSENSITIVE).matcher('abBBc').find() // true
 ```
 
+Example to collect all matches in string
+
+```js
+import { RE2JS } from 're2js'
+
+const p = RE2JS.compile('abc+')
+const matchString = p.matcher('abc abcccc abcc')
+const results = []
+while (matchString.find()) {
+  results.push(matchString.group())
+}
+results // ['abc', 'abcccc', 'abcc']
+```
+
 The `find()` method searches for a pattern match in a string starting from a specific index
 
 ```js

package/build/index.cjs.cjs

@@ -2,7 +2,7 @@
  * re2js
  * RE2JS is the JavaScript port of RE2, a regular expression engine that provides linear time matching
  *
- * @version v0.4.2
+ * @version v0.4.3
  * @author Alexey Vasiliev
  * @homepage https://github.com/le0pard/re2js#readme
  * @repository github:le0pard/re2js
@@ -324,7 +324,7 @@ class Unicode {
   // Minimum and maximum runes involved in folding.
   // Checked during test.
   static MIN_FOLD = 0x0041;
-  static MAX_FOLD = 0x1044f;
+  static MAX_FOLD = 0x1e943;
 
   // is32 uses binary search to test whether rune is in the specified
   // slice of 32-bit ranges.