re2js 2.2.1 → 2.2.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +1 -1
- package/build/index.cjs.cjs +8 -4
- package/build/index.cjs.cjs.map +1 -1
- package/build/index.esm.d.ts.map +1 -1
- package/build/index.esm.js +8 -4
- package/build/index.esm.js.map +1 -1
- package/build/index.umd.js +8 -4
- package/build/index.umd.js.map +1 -1
- package/package.json +2 -2
package/build/index.umd.js
CHANGED
|
@@ -2,8 +2,8 @@
|
|
|
2
2
|
* re2js
|
|
3
3
|
* RE2JS is the JavaScript port of RE2, a regular expression engine that provides linear time matching
|
|
4
4
|
*
|
|
5
|
-
* @version v2.2.
|
|
6
|
-
* @author
|
|
5
|
+
* @version v2.2.2
|
|
6
|
+
* @author Oleksii Vasyliev
|
|
7
7
|
* @homepage https://github.com/le0pard/re2js#readme
|
|
8
8
|
* @repository github:le0pard/re2js
|
|
9
9
|
* @license MIT
|
|
@@ -3347,7 +3347,9 @@
|
|
|
3347
3347
|
}
|
|
3348
3348
|
runes.sort((a, b) => a - b);
|
|
3349
3349
|
} else {
|
|
3350
|
-
|
|
3350
|
+
for (let j = 0; j < inst.runes.length; j++) {
|
|
3351
|
+
runes.push(inst.runes[j]);
|
|
3352
|
+
}
|
|
3351
3353
|
}
|
|
3352
3354
|
onePassRunes[pc] = runes;
|
|
3353
3355
|
inst.next = new Uint32Array(Math.floor(runes.length / 2) + 1).fill(inst.out);
|
|
@@ -4174,7 +4176,9 @@
|
|
|
4174
4176
|
return new Prefilter(Prefilter.Type.NONE);
|
|
4175
4177
|
}
|
|
4176
4178
|
if (s.type === Prefilter.Type.OR) {
|
|
4177
|
-
|
|
4179
|
+
for (let j = 0; j < s.subs.length; j++) {
|
|
4180
|
+
newSubs.push(s.subs[j]);
|
|
4181
|
+
}
|
|
4178
4182
|
} else {
|
|
4179
4183
|
newSubs.push(s);
|
|
4180
4184
|
}
|