@ssttevee/streamsearch 0.3.1 → 0.4.0

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.
Files changed (53) hide show
  1. package/README.md +57 -2
  2. package/lib/index.cjs +29 -265
  3. package/lib/index.cjs.map +1 -1
  4. package/lib/index.d.ts +13 -10
  5. package/lib/index.mjs +21 -301
  6. package/lib/index.mjs.map +1 -1
  7. package/lib/iterate-chunks-concatted.cjs +15 -0
  8. package/lib/iterate-chunks-concatted.cjs.map +1 -0
  9. package/lib/iterate-chunks-concatted.d.ts +2 -0
  10. package/lib/iterate-chunks-concatted.mjs +13 -0
  11. package/lib/iterate-chunks-concatted.mjs.map +1 -0
  12. package/lib/iterate-chunks.cjs +22 -0
  13. package/lib/iterate-chunks.cjs.map +1 -0
  14. package/lib/iterate-chunks.d.ts +2 -0
  15. package/lib/iterate-chunks.mjs +20 -0
  16. package/lib/iterate-chunks.mjs.map +1 -0
  17. package/lib/iterate-strings.cjs +16 -0
  18. package/lib/iterate-strings.cjs.map +1 -0
  19. package/lib/iterate-strings.d.ts +2 -0
  20. package/lib/iterate-strings.mjs +14 -0
  21. package/lib/iterate-strings.mjs.map +1 -0
  22. package/lib/iterator.cjs +42 -0
  23. package/lib/iterator.cjs.map +1 -0
  24. package/lib/iterator.d.ts +7 -0
  25. package/lib/iterator.mjs +40 -0
  26. package/lib/iterator.mjs.map +1 -0
  27. package/lib/queueable.cjs +55 -0
  28. package/lib/queueable.cjs.map +1 -0
  29. package/lib/queueable.d.ts +11 -11
  30. package/lib/queueable.mjs +53 -0
  31. package/lib/queueable.mjs.map +1 -0
  32. package/lib/readable.cjs +36 -0
  33. package/lib/readable.cjs.map +1 -0
  34. package/lib/readable.d.ts +7 -7
  35. package/lib/readable.mjs +34 -0
  36. package/lib/readable.mjs.map +1 -0
  37. package/lib/search-BXQkEs3p.js +97 -0
  38. package/lib/search-BXQkEs3p.js.map +1 -0
  39. package/lib/search-D_ihawrM.js +108 -0
  40. package/lib/search-D_ihawrM.js.map +1 -0
  41. package/lib/search.cjs +188 -0
  42. package/lib/search.cjs.map +1 -0
  43. package/lib/search.d.ts +13 -14
  44. package/lib/search.mjs +185 -0
  45. package/lib/search.mjs.map +1 -0
  46. package/lib/split.cjs +26 -0
  47. package/lib/split.cjs.map +1 -0
  48. package/lib/split.d.ts +1 -0
  49. package/lib/split.mjs +24 -0
  50. package/lib/split.mjs.map +1 -0
  51. package/package.json +85 -37
  52. package/lib/index.js +0 -318
  53. package/lib/index.js.map +0 -1
@@ -1,11 +1,11 @@
1
- import { Token } from './search';
2
- export declare class QueueableStreamSearch {
3
- private _search;
4
- private _chunksQueue;
5
- private _notify?;
6
- private _closed;
7
- constructor(needle: Uint8Array | string);
8
- push(...chunks: Uint8Array[]): void;
9
- close(): void;
10
- [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
11
- }
1
+ import { type Token } from "./search.js";
2
+ export declare class QueueableStreamSearch {
3
+ private _search;
4
+ private _chunksQueue;
5
+ private _notify?;
6
+ private _closed;
7
+ constructor(needle: Uint8Array | string);
8
+ push(...chunks: Uint8Array[]): void;
9
+ close(): void;
10
+ [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
11
+ }
@@ -0,0 +1,53 @@
1
+ import { StreamSearch } from './search.mjs';
2
+ import 'uint8arrays/concat';
3
+ import 'uint8arrays/from-string';
4
+
5
+ const EOQ = Symbol("End of Queue");
6
+ class QueueableStreamSearch {
7
+ _search;
8
+ _chunksQueue = [];
9
+ _notify;
10
+ _closed = false;
11
+ constructor(needle) {
12
+ this._search = new StreamSearch(needle);
13
+ }
14
+ push(...chunks) {
15
+ if (this._closed) {
16
+ throw new Error("cannot call push after close");
17
+ }
18
+ this._chunksQueue.push(...chunks);
19
+ if (this._notify) {
20
+ this._notify();
21
+ }
22
+ }
23
+ close() {
24
+ if (this._closed) {
25
+ throw new Error("close was already called");
26
+ }
27
+ this._closed = true;
28
+ this._chunksQueue.push(EOQ);
29
+ if (this._notify) {
30
+ this._notify();
31
+ }
32
+ }
33
+ async *[Symbol.asyncIterator]() {
34
+ while (true) {
35
+ let chunk;
36
+ while (!(chunk = this._chunksQueue.shift())) {
37
+ await new Promise((resolve) => (this._notify = resolve));
38
+ this._notify = undefined;
39
+ }
40
+ if (chunk === EOQ) {
41
+ break;
42
+ }
43
+ yield* this._search.feed(chunk);
44
+ }
45
+ const tail = this._search.end();
46
+ if (tail.length) {
47
+ yield tail;
48
+ }
49
+ }
50
+ }
51
+
52
+ export { QueueableStreamSearch };
53
+ //# sourceMappingURL=queueable.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"queueable.mjs","sources":["../src/queueable.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAEA,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC;MAErB,qBAAqB,CAAA;AACzB,IAAA,OAAO;IACP,YAAY,GAAmC,EAAE;AACjD,IAAA,OAAO;IACP,OAAO,GAAG,KAAK;AAEvB,IAAA,WAAA,CAAmB,MAA2B,EAAA;QAC7C,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC;IACxC;IAEO,IAAI,CAAC,GAAG,MAAoB,EAAA;AAClC,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;AACjB,YAAA,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;QAChD;QAEA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;AACjC,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,EAAE;QACf;IACD;IAEO,KAAK,GAAA;AACX,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;AACjB,YAAA,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC;QAC5C;AAEA,QAAA,IAAI,CAAC,OAAO,GAAG,IAAI;AACnB,QAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;AAC3B,QAAA,IAAI,IAAI,CAAC,OAAO,EAAE;YACjB,IAAI,CAAC,OAAO,EAAE;QACf;IACD;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,OAAO,IAAI,EAAE;AACZ,YAAA,IAAI,KAA0C;AAC9C,YAAA,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE;AAC5C,gBAAA,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,MAAM,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;AAC9D,gBAAA,IAAI,CAAC,OAAO,GAAG,SAAS;YACzB;AAEA,YAAA,IAAI,KAAK,KAAK,GAAG,EAAE;gBAClB;YACD;YAEA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;QAChC;QAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,QAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,YAAA,MAAM,IAAI;QACX;IACD;AACA;;;;"}
@@ -0,0 +1,36 @@
1
+ 'use strict';
2
+
3
+ var search = require('./search.cjs');
4
+ require('uint8arrays/concat');
5
+ require('uint8arrays/from-string');
6
+
7
+ class ReadableStreamSearch {
8
+ _readableStream;
9
+ _search;
10
+ constructor(needle, _readableStream) {
11
+ this._readableStream = _readableStream;
12
+ this._search = new search.StreamSearch(needle);
13
+ }
14
+ async *[Symbol.asyncIterator]() {
15
+ const reader = this._readableStream.getReader();
16
+ try {
17
+ while (true) {
18
+ const result = await reader.read();
19
+ if (result.done) {
20
+ break;
21
+ }
22
+ yield* this._search.feed(result.value);
23
+ }
24
+ const tail = this._search.end();
25
+ if (tail.length) {
26
+ yield tail;
27
+ }
28
+ }
29
+ finally {
30
+ reader.releaseLock();
31
+ }
32
+ }
33
+ }
34
+
35
+ exports.ReadableStreamSearch = ReadableStreamSearch;
36
+ //# sourceMappingURL=readable.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"readable.cjs","sources":["../src/readable.ts"],"sourcesContent":[null],"names":["StreamSearch"],"mappings":";;;;;;MAEa,oBAAoB,CAAA;AAKvB,IAAA,eAAA;AAJD,IAAA,OAAO;IAEf,WAAA,CACC,MAA2B,EACnB,eAA2C,EAAA;QAA3C,IAAA,CAAA,eAAe,GAAf,eAAe;QAEvB,IAAI,CAAC,OAAO,GAAG,IAAIA,mBAAY,CAAC,MAAM,CAAC;IACxC;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE;AAC/C,QAAA,IAAI;YACH,OAAO,IAAI,EAAE;AACZ,gBAAA,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE;AAClC,gBAAA,IAAI,MAAM,CAAC,IAAI,EAAE;oBAChB;gBACD;AAEA,gBAAA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YACvC;YAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,YAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,gBAAA,MAAM,IAAI;YACX;QACD;gBAAU;YACT,MAAM,CAAC,WAAW,EAAE;QACrB;IACD;AACA;;;;"}
package/lib/readable.d.ts CHANGED
@@ -1,7 +1,7 @@
1
- import { Token } from './search';
2
- export declare class ReadableStreamSearch {
3
- private _readableStream;
4
- private _search;
5
- constructor(needle: Uint8Array | string, _readableStream: ReadableStream<Uint8Array>);
6
- [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
7
- }
1
+ import { type Token } from "./search.js";
2
+ export declare class ReadableStreamSearch {
3
+ private _readableStream;
4
+ private _search;
5
+ constructor(needle: Uint8Array | string, _readableStream: ReadableStream<Uint8Array>);
6
+ [Symbol.asyncIterator](): AsyncIterableIterator<Token>;
7
+ }
@@ -0,0 +1,34 @@
1
+ import { StreamSearch } from './search.mjs';
2
+ import 'uint8arrays/concat';
3
+ import 'uint8arrays/from-string';
4
+
5
+ class ReadableStreamSearch {
6
+ _readableStream;
7
+ _search;
8
+ constructor(needle, _readableStream) {
9
+ this._readableStream = _readableStream;
10
+ this._search = new StreamSearch(needle);
11
+ }
12
+ async *[Symbol.asyncIterator]() {
13
+ const reader = this._readableStream.getReader();
14
+ try {
15
+ while (true) {
16
+ const result = await reader.read();
17
+ if (result.done) {
18
+ break;
19
+ }
20
+ yield* this._search.feed(result.value);
21
+ }
22
+ const tail = this._search.end();
23
+ if (tail.length) {
24
+ yield tail;
25
+ }
26
+ }
27
+ finally {
28
+ reader.releaseLock();
29
+ }
30
+ }
31
+ }
32
+
33
+ export { ReadableStreamSearch };
34
+ //# sourceMappingURL=readable.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"readable.mjs","sources":["../src/readable.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;MAEa,oBAAoB,CAAA;AAKvB,IAAA,eAAA;AAJD,IAAA,OAAO;IAEf,WAAA,CACC,MAA2B,EACnB,eAA2C,EAAA;QAA3C,IAAA,CAAA,eAAe,GAAf,eAAe;QAEvB,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC;IACxC;AAEO,IAAA,QAAQ,MAAM,CAAC,aAAa,CAAC,GAAA;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE;AAC/C,QAAA,IAAI;YACH,OAAO,IAAI,EAAE;AACZ,gBAAA,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE;AAClC,gBAAA,IAAI,MAAM,CAAC,IAAI,EAAE;oBAChB;gBACD;AAEA,gBAAA,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YACvC;YAEA,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;AAC/B,YAAA,IAAI,IAAI,CAAC,MAAM,EAAE;AAChB,gBAAA,MAAM,IAAI;YACX;QACD;gBAAU;YACT,MAAM,CAAC,WAAW,EAAE;QACrB;IACD;AACA;;;;"}
@@ -0,0 +1,97 @@
1
+ import { concat } from "uint8arrays/concat";
2
+ import { fromString } from "uint8arrays/from-string";
3
+
4
+ //#region src/search.ts
5
+ function jsmemcmp(buf1, pos1, buf2, pos2, len) {
6
+ for (let i = 0; i < len; i++) if (buf1[pos1 + i] !== buf2[pos2 + i]) return false;
7
+ return true;
8
+ }
9
+ function createOccurenceTable(s) {
10
+ const table = new Array(256).fill(s.length);
11
+ if (s.length > 1) for (let i = 0; i < s.length - 1; i++) table[s[i]] = s.length - 1 - i;
12
+ return table;
13
+ }
14
+ const MATCH = Symbol("Match");
15
+ var StreamSearch = class {
16
+ _needle;
17
+ _lastChar;
18
+ _occ;
19
+ _lookbehind = new Uint8Array();
20
+ constructor(needle) {
21
+ if (typeof needle === "string") this._needle = needle = fromString(needle);
22
+ else this._needle = needle;
23
+ this._lastChar = needle[needle.length - 1];
24
+ this._occ = createOccurenceTable(needle);
25
+ }
26
+ feed(chunk) {
27
+ let pos = 0;
28
+ let tokens;
29
+ const allTokens = [];
30
+ while (pos !== chunk.length) {
31
+ [pos, ...tokens] = this._feed(chunk, pos);
32
+ allTokens.push(...tokens);
33
+ }
34
+ return allTokens;
35
+ }
36
+ end() {
37
+ const tail = this._lookbehind;
38
+ this._lookbehind = new Uint8Array();
39
+ return tail;
40
+ }
41
+ _feed(data, buf_pos) {
42
+ const tokens = [];
43
+ let pos = -this._lookbehind.length;
44
+ if (pos < 0) {
45
+ while (pos < 0 && pos <= data.length - this._needle.length) {
46
+ const cpos = pos + this._needle.length - 1;
47
+ const ch = cpos < 0 ? this._lookbehind[this._lookbehind.length + cpos] : data[cpos];
48
+ if (ch === this._lastChar && this._memcmp(data, pos, this._needle.length - 1)) {
49
+ if (pos > -this._lookbehind.length) tokens.push(this._lookbehind.subarray(0, this._lookbehind.length + pos));
50
+ tokens.push(MATCH);
51
+ this._lookbehind = new Uint8Array();
52
+ return [pos + this._needle.length, ...tokens];
53
+ } else pos += this._occ[ch];
54
+ }
55
+ if (pos < 0) while (pos < 0 && !this._memcmp(data, pos, data.length - pos)) pos++;
56
+ if (pos >= 0) {
57
+ tokens.push(this._lookbehind);
58
+ this._lookbehind = new Uint8Array();
59
+ } else {
60
+ const bytesToCutOff = this._lookbehind.length + pos;
61
+ if (bytesToCutOff > 0) {
62
+ tokens.push(this._lookbehind.subarray(0, bytesToCutOff));
63
+ this._lookbehind = this._lookbehind.subarray(bytesToCutOff);
64
+ }
65
+ this._lookbehind = concat([this._lookbehind, data]);
66
+ return [data.length, ...tokens];
67
+ }
68
+ }
69
+ pos += buf_pos;
70
+ while (pos <= data.length - this._needle.length) {
71
+ const ch = data[pos + this._needle.length - 1];
72
+ if (ch === this._lastChar && data[pos] === this._needle[0] && jsmemcmp(this._needle, 0, data, pos, this._needle.length - 1)) {
73
+ if (pos > buf_pos) tokens.push(data.subarray(buf_pos, pos));
74
+ tokens.push(MATCH);
75
+ return [pos + this._needle.length, ...tokens];
76
+ } else pos += this._occ[ch];
77
+ }
78
+ if (pos < data.length) {
79
+ while (pos < data.length && (data[pos] !== this._needle[0] || !jsmemcmp(data, pos, this._needle, 0, data.length - pos))) ++pos;
80
+ if (pos < data.length) this._lookbehind = data.subarray(pos);
81
+ }
82
+ if (pos > 0) tokens.push(data.subarray(buf_pos, pos < data.length ? pos : data.length));
83
+ return [data.length, ...tokens];
84
+ }
85
+ _memcmp(data, pos, len) {
86
+ if (pos < 0) {
87
+ if (!jsmemcmp(this._lookbehind, this._lookbehind.length + pos, this._needle, 0, Math.min(-pos, len))) return false;
88
+ if (len < -pos) return true;
89
+ len += pos;
90
+ }
91
+ return jsmemcmp(data, Math.max(0, pos), this._needle, -Math.min(0, pos), len);
92
+ }
93
+ };
94
+
95
+ //#endregion
96
+ export { StreamSearch as n, MATCH as t };
97
+ //# sourceMappingURL=search-BXQkEs3p.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"search-BXQkEs3p.js","names":[],"sources":["../src/search.ts"],"sourcesContent":[],"mappings":";;;;AAQA,SAAS,SACL,MACA,MACA,MACA,MACA,KAAW;AAEX,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACrB,KAAI,KAAK,OAAO,OAAO,KAAK,OAAO,GAC/B,QAAO;AAIf,QAAO;;AAGX,SAAS,qBAAqB,GAAa;CAGvC,MAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,KAAK,EAAE,OAAO;AAC3C,KAAI,EAAE,SAAS,EACX,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,SAAS,GAAG,IAC9B,OAAM,EAAE,MAAM,EAAE,SAAS,IAAI;AAIrC,QAAO;;AAGX,MAAa,QAAQ,OAAO,QAAQ;AAIpC,IAAa,eAAb,MAAyB;CACb;CACA;CACA;CAEA,cAA0B,IAAI,YAAY;CAElD,YAAmB,QAA2B;AAC1C,MAAI,OAAO,WAAW,SAClB,MAAK,UAAU,SAAS,WAAW,OAAO;MAE1C,MAAK,UAAU;AAGnB,OAAK,YAAY,OAAO,OAAO,SAAS;AACxC,OAAK,OAAO,qBAAqB,OAAO;;CAGrC,KAAK,OAAiB;EACzB,IAAI,MAAM;EACV,IAAI;EACJ,MAAM,YAAqB,EAAE;AAC7B,SAAO,QAAQ,MAAM,QAAQ;AACzB,IAAC,QAAQ,UAAU,KAAK,MAAM,OAAO,IAAI;AACzC,aAAU,KAAK,GAAG,OAAO;;AAG7B,SAAO;;CAGJ,MAAG;EACN,MAAM,OAAO,KAAK;AAClB,OAAK,cAAc,IAAI,YAAY;AACnC,SAAO;;CAGH,MAAM,MAAkB,SAAe;EAC3C,MAAM,SAAkB,EAAE;EAM1B,IAAI,MAAM,CAAC,KAAK,YAAY;AAE5B,MAAI,MAAM,GAAG;AAaT,UAAO,MAAM,KAAK,OAAO,KAAK,SAAS,KAAK,QAAQ,QAAQ;IACxD,MAAM,OAAO,MAAM,KAAK,QAAQ,SAAS;IACzC,MAAM,KAAK,OAAO,IAAI,KAAK,YAAY,KAAK,YAAY,SAAS,QAAQ,KAAK;AAE9E,QAAI,OAAO,KAAK,aAAa,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,SAAS,EAAE,EAAE;AAC3E,SAAI,MAAM,CAAC,KAAK,YAAY,OACxB,QAAO,KAAK,KAAK,YAAY,SAAS,GAAG,KAAK,YAAY,SAAS,IAAI,CAAC;AAG5E,YAAO,KAAK,MAAM;AAElB,UAAK,cAAc,IAAI,YAAY;AAEnC,YAAO,CAAC,MAAM,KAAK,QAAQ,QAAQ,GAAG,OAAO;UAE7C,QAAO,KAAK,KAAK;;AAMzB,OAAI,MAAM,EASN,QAAO,MAAM,KAAK,CAAC,KAAK,QAAQ,MAAM,KAAK,KAAK,SAAS,IAAI,CACzD;AAIR,OAAI,OAAO,GAAG;AAEV,WAAO,KAAK,KAAK,YAAY;AAC7B,SAAK,cAAc,IAAI,YAAY;UAChC;IAIH,MAAM,gBAAgB,KAAK,YAAY,SAAS;AAEhD,QAAI,gBAAgB,GAAG;AAEnB,YAAO,KAAK,KAAK,YAAY,SAAS,GAAG,cAAc,CAAC;AACxD,UAAK,cAAc,KAAK,YAAY,SAAS,cAAc;;AAG/D,SAAK,cAAc,OAAO,CAAC,KAAK,aAAa,KAAK,CAAC;AAEnD,WAAO,CAAC,KAAK,QAAQ,GAAG,OAAO;;;AAIvC,SAAO;AAKP,SAAO,OAAO,KAAK,SAAS,KAAK,QAAQ,QAAQ;GAC7C,MAAM,KAAK,KAAK,MAAM,KAAK,QAAQ,SAAS;AAE5C,OAAI,OAAO,KAAK,aACT,KAAK,SAAS,KAAK,QAAQ,MAC3B,SAAS,KAAK,SAAS,GAAG,MAAM,KAAK,KAAK,QAAQ,SAAS,EAAE,EAAE;AAClE,QAAI,MAAM,QACN,QAAO,KAAK,KAAK,SAAS,SAAS,IAAI,CAAC;AAG5C,WAAO,KAAK,MAAM;AAElB,WAAO,CAAC,MAAM,KAAK,QAAQ,QAAQ,GAAG,OAAO;SAE7C,QAAO,KAAK,KAAK;;AAUzB,MAAI,MAAM,KAAK,QAAQ;AACnB,UAAO,MAAM,KAAK,WAAW,KAAK,SAAS,KAAK,QAAQ,MACjD,CAAC,SAAS,MAAM,KAAK,KAAK,SAAS,GAAG,KAAK,SAAS,IAAI,EAC3D,GAAE;AAGN,OAAI,MAAM,KAAK,OACX,MAAK,cAAc,KAAK,SAAS,IAAI;;AAK7C,MAAI,MAAM,EACN,QAAO,KAAK,KAAK,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,KAAK,OAAO,CAAC;AAG9E,SAAO,CAAC,KAAK,QAAQ,GAAG,OAAO;;CAG3B,QAAQ,MAAkB,KAAa,KAAW;AACtD,MAAI,MAAM,GAAG;AACT,OAAI,CAAC,SAAS,KAAK,aAAa,KAAK,YAAY,SAAS,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,CAChG,QAAO;AAGX,OAAI,MAAM,CAAC,IACP,QAAO;AAGX,UAAO;;AAGX,SAAO,SAAS,MAAM,KAAK,IAAI,GAAG,IAAI,EAAE,KAAK,SAAS,CAAC,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI"}
@@ -0,0 +1,108 @@
1
+ let uint8arrays_concat = require("uint8arrays/concat");
2
+ let uint8arrays_from_string = require("uint8arrays/from-string");
3
+
4
+ //#region src/search.ts
5
+ function jsmemcmp(buf1, pos1, buf2, pos2, len) {
6
+ for (let i = 0; i < len; i++) if (buf1[pos1 + i] !== buf2[pos2 + i]) return false;
7
+ return true;
8
+ }
9
+ function createOccurenceTable(s) {
10
+ const table = new Array(256).fill(s.length);
11
+ if (s.length > 1) for (let i = 0; i < s.length - 1; i++) table[s[i]] = s.length - 1 - i;
12
+ return table;
13
+ }
14
+ const MATCH = Symbol("Match");
15
+ var StreamSearch = class {
16
+ _needle;
17
+ _lastChar;
18
+ _occ;
19
+ _lookbehind = new Uint8Array();
20
+ constructor(needle) {
21
+ if (typeof needle === "string") this._needle = needle = (0, uint8arrays_from_string.fromString)(needle);
22
+ else this._needle = needle;
23
+ this._lastChar = needle[needle.length - 1];
24
+ this._occ = createOccurenceTable(needle);
25
+ }
26
+ feed(chunk) {
27
+ let pos = 0;
28
+ let tokens;
29
+ const allTokens = [];
30
+ while (pos !== chunk.length) {
31
+ [pos, ...tokens] = this._feed(chunk, pos);
32
+ allTokens.push(...tokens);
33
+ }
34
+ return allTokens;
35
+ }
36
+ end() {
37
+ const tail = this._lookbehind;
38
+ this._lookbehind = new Uint8Array();
39
+ return tail;
40
+ }
41
+ _feed(data, buf_pos) {
42
+ const tokens = [];
43
+ let pos = -this._lookbehind.length;
44
+ if (pos < 0) {
45
+ while (pos < 0 && pos <= data.length - this._needle.length) {
46
+ const cpos = pos + this._needle.length - 1;
47
+ const ch = cpos < 0 ? this._lookbehind[this._lookbehind.length + cpos] : data[cpos];
48
+ if (ch === this._lastChar && this._memcmp(data, pos, this._needle.length - 1)) {
49
+ if (pos > -this._lookbehind.length) tokens.push(this._lookbehind.subarray(0, this._lookbehind.length + pos));
50
+ tokens.push(MATCH);
51
+ this._lookbehind = new Uint8Array();
52
+ return [pos + this._needle.length, ...tokens];
53
+ } else pos += this._occ[ch];
54
+ }
55
+ if (pos < 0) while (pos < 0 && !this._memcmp(data, pos, data.length - pos)) pos++;
56
+ if (pos >= 0) {
57
+ tokens.push(this._lookbehind);
58
+ this._lookbehind = new Uint8Array();
59
+ } else {
60
+ const bytesToCutOff = this._lookbehind.length + pos;
61
+ if (bytesToCutOff > 0) {
62
+ tokens.push(this._lookbehind.subarray(0, bytesToCutOff));
63
+ this._lookbehind = this._lookbehind.subarray(bytesToCutOff);
64
+ }
65
+ this._lookbehind = (0, uint8arrays_concat.concat)([this._lookbehind, data]);
66
+ return [data.length, ...tokens];
67
+ }
68
+ }
69
+ pos += buf_pos;
70
+ while (pos <= data.length - this._needle.length) {
71
+ const ch = data[pos + this._needle.length - 1];
72
+ if (ch === this._lastChar && data[pos] === this._needle[0] && jsmemcmp(this._needle, 0, data, pos, this._needle.length - 1)) {
73
+ if (pos > buf_pos) tokens.push(data.subarray(buf_pos, pos));
74
+ tokens.push(MATCH);
75
+ return [pos + this._needle.length, ...tokens];
76
+ } else pos += this._occ[ch];
77
+ }
78
+ if (pos < data.length) {
79
+ while (pos < data.length && (data[pos] !== this._needle[0] || !jsmemcmp(data, pos, this._needle, 0, data.length - pos))) ++pos;
80
+ if (pos < data.length) this._lookbehind = data.subarray(pos);
81
+ }
82
+ if (pos > 0) tokens.push(data.subarray(buf_pos, pos < data.length ? pos : data.length));
83
+ return [data.length, ...tokens];
84
+ }
85
+ _memcmp(data, pos, len) {
86
+ if (pos < 0) {
87
+ if (!jsmemcmp(this._lookbehind, this._lookbehind.length + pos, this._needle, 0, Math.min(-pos, len))) return false;
88
+ if (len < -pos) return true;
89
+ len += pos;
90
+ }
91
+ return jsmemcmp(data, Math.max(0, pos), this._needle, -Math.min(0, pos), len);
92
+ }
93
+ };
94
+
95
+ //#endregion
96
+ Object.defineProperty(exports, 'MATCH', {
97
+ enumerable: true,
98
+ get: function () {
99
+ return MATCH;
100
+ }
101
+ });
102
+ Object.defineProperty(exports, 'StreamSearch', {
103
+ enumerable: true,
104
+ get: function () {
105
+ return StreamSearch;
106
+ }
107
+ });
108
+ //# sourceMappingURL=search-D_ihawrM.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"search-D_ihawrM.js","names":[],"sources":["../src/search.ts"],"sourcesContent":[],"mappings":";;;;AAQA,SAAS,SACL,MACA,MACA,MACA,MACA,KAAW;AAEX,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACrB,KAAI,KAAK,OAAO,OAAO,KAAK,OAAO,GAC/B,QAAO;AAIf,QAAO;;AAGX,SAAS,qBAAqB,GAAa;CAGvC,MAAM,QAAQ,IAAI,MAAM,IAAI,CAAC,KAAK,EAAE,OAAO;AAC3C,KAAI,EAAE,SAAS,EACX,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,SAAS,GAAG,IAC9B,OAAM,EAAE,MAAM,EAAE,SAAS,IAAI;AAIrC,QAAO;;AAGX,MAAa,QAAQ,OAAO,QAAQ;AAIpC,IAAa,eAAb,MAAyB;CACb;CACA;CACA;CAEA,cAA0B,IAAI,YAAY;CAElD,YAAmB,QAA2B;AAC1C,MAAI,OAAO,WAAW,SAClB,MAAK,UAAU,iDAAoB,OAAO;MAE1C,MAAK,UAAU;AAGnB,OAAK,YAAY,OAAO,OAAO,SAAS;AACxC,OAAK,OAAO,qBAAqB,OAAO;;CAGrC,KAAK,OAAiB;EACzB,IAAI,MAAM;EACV,IAAI;EACJ,MAAM,YAAqB,EAAE;AAC7B,SAAO,QAAQ,MAAM,QAAQ;AACzB,IAAC,QAAQ,UAAU,KAAK,MAAM,OAAO,IAAI;AACzC,aAAU,KAAK,GAAG,OAAO;;AAG7B,SAAO;;CAGJ,MAAG;EACN,MAAM,OAAO,KAAK;AAClB,OAAK,cAAc,IAAI,YAAY;AACnC,SAAO;;CAGH,MAAM,MAAkB,SAAe;EAC3C,MAAM,SAAkB,EAAE;EAM1B,IAAI,MAAM,CAAC,KAAK,YAAY;AAE5B,MAAI,MAAM,GAAG;AAaT,UAAO,MAAM,KAAK,OAAO,KAAK,SAAS,KAAK,QAAQ,QAAQ;IACxD,MAAM,OAAO,MAAM,KAAK,QAAQ,SAAS;IACzC,MAAM,KAAK,OAAO,IAAI,KAAK,YAAY,KAAK,YAAY,SAAS,QAAQ,KAAK;AAE9E,QAAI,OAAO,KAAK,aAAa,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,SAAS,EAAE,EAAE;AAC3E,SAAI,MAAM,CAAC,KAAK,YAAY,OACxB,QAAO,KAAK,KAAK,YAAY,SAAS,GAAG,KAAK,YAAY,SAAS,IAAI,CAAC;AAG5E,YAAO,KAAK,MAAM;AAElB,UAAK,cAAc,IAAI,YAAY;AAEnC,YAAO,CAAC,MAAM,KAAK,QAAQ,QAAQ,GAAG,OAAO;UAE7C,QAAO,KAAK,KAAK;;AAMzB,OAAI,MAAM,EASN,QAAO,MAAM,KAAK,CAAC,KAAK,QAAQ,MAAM,KAAK,KAAK,SAAS,IAAI,CACzD;AAIR,OAAI,OAAO,GAAG;AAEV,WAAO,KAAK,KAAK,YAAY;AAC7B,SAAK,cAAc,IAAI,YAAY;UAChC;IAIH,MAAM,gBAAgB,KAAK,YAAY,SAAS;AAEhD,QAAI,gBAAgB,GAAG;AAEnB,YAAO,KAAK,KAAK,YAAY,SAAS,GAAG,cAAc,CAAC;AACxD,UAAK,cAAc,KAAK,YAAY,SAAS,cAAc;;AAG/D,SAAK,6CAAqB,CAAC,KAAK,aAAa,KAAK,CAAC;AAEnD,WAAO,CAAC,KAAK,QAAQ,GAAG,OAAO;;;AAIvC,SAAO;AAKP,SAAO,OAAO,KAAK,SAAS,KAAK,QAAQ,QAAQ;GAC7C,MAAM,KAAK,KAAK,MAAM,KAAK,QAAQ,SAAS;AAE5C,OAAI,OAAO,KAAK,aACT,KAAK,SAAS,KAAK,QAAQ,MAC3B,SAAS,KAAK,SAAS,GAAG,MAAM,KAAK,KAAK,QAAQ,SAAS,EAAE,EAAE;AAClE,QAAI,MAAM,QACN,QAAO,KAAK,KAAK,SAAS,SAAS,IAAI,CAAC;AAG5C,WAAO,KAAK,MAAM;AAElB,WAAO,CAAC,MAAM,KAAK,QAAQ,QAAQ,GAAG,OAAO;SAE7C,QAAO,KAAK,KAAK;;AAUzB,MAAI,MAAM,KAAK,QAAQ;AACnB,UAAO,MAAM,KAAK,WAAW,KAAK,SAAS,KAAK,QAAQ,MACjD,CAAC,SAAS,MAAM,KAAK,KAAK,SAAS,GAAG,KAAK,SAAS,IAAI,EAC3D,GAAE;AAGN,OAAI,MAAM,KAAK,OACX,MAAK,cAAc,KAAK,SAAS,IAAI;;AAK7C,MAAI,MAAM,EACN,QAAO,KAAK,KAAK,SAAS,SAAS,MAAM,KAAK,SAAS,MAAM,KAAK,OAAO,CAAC;AAG9E,SAAO,CAAC,KAAK,QAAQ,GAAG,OAAO;;CAG3B,QAAQ,MAAkB,KAAa,KAAW;AACtD,MAAI,MAAM,GAAG;AACT,OAAI,CAAC,SAAS,KAAK,aAAa,KAAK,YAAY,SAAS,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,CAChG,QAAO;AAGX,OAAI,MAAM,CAAC,IACP,QAAO;AAGX,UAAO;;AAGX,SAAO,SAAS,MAAM,KAAK,IAAI,GAAG,IAAI,EAAE,KAAK,SAAS,CAAC,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI"}
package/lib/search.cjs ADDED
@@ -0,0 +1,188 @@
1
+ 'use strict';
2
+
3
+ var concat = require('uint8arrays/concat');
4
+ var fromString = require('uint8arrays/from-string');
5
+
6
+ /*
7
+ Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation
8
+ by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool
9
+ */
10
+ function jsmemcmp(buf1, pos1, buf2, pos2, len) {
11
+ for (let i = 0; i < len; i++) {
12
+ if (buf1[pos1 + i] !== buf2[pos2 + i]) {
13
+ return false;
14
+ }
15
+ }
16
+ return true;
17
+ }
18
+ function createOccurenceTable(s) {
19
+ // Populate occurrence table with analysis of the needle,
20
+ // ignoring last letter.
21
+ const table = new Array(256).fill(s.length);
22
+ if (s.length > 1) {
23
+ for (let i = 0; i < s.length - 1; i++) {
24
+ table[s[i]] = s.length - 1 - i;
25
+ }
26
+ }
27
+ return table;
28
+ }
29
+ const MATCH = Symbol("Match");
30
+ class StreamSearch {
31
+ _needle;
32
+ _lastChar;
33
+ _occ;
34
+ _lookbehind = new Uint8Array();
35
+ constructor(needle) {
36
+ if (typeof needle === "string") {
37
+ this._needle = needle = fromString.fromString(needle);
38
+ }
39
+ else {
40
+ this._needle = needle;
41
+ }
42
+ this._lastChar = needle[needle.length - 1];
43
+ this._occ = createOccurenceTable(needle);
44
+ }
45
+ feed(chunk) {
46
+ let pos = 0;
47
+ let tokens;
48
+ const allTokens = [];
49
+ while (pos !== chunk.length) {
50
+ [pos, ...tokens] = this._feed(chunk, pos);
51
+ allTokens.push(...tokens);
52
+ }
53
+ return allTokens;
54
+ }
55
+ end() {
56
+ const tail = this._lookbehind;
57
+ this._lookbehind = new Uint8Array();
58
+ return tail;
59
+ }
60
+ _feed(data, buf_pos) {
61
+ const tokens = [];
62
+ // Positive: points to a position in `data`
63
+ // pos == 3 points to data[3]
64
+ // Negative: points to a position in the lookbehind buffer
65
+ // pos == -2 points to lookbehind[lookbehind_size - 2]
66
+ let pos = -this._lookbehind.length;
67
+ if (pos < 0) {
68
+ // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool
69
+ // search with character lookup code that considers both the
70
+ // lookbehind buffer and the current round's haystack data.
71
+ //
72
+ // Loop until (condition 1)
73
+ // there is a match.
74
+ // or until
75
+ // we've moved past the position that requires the
76
+ // lookbehind buffer. In this case we switch to the
77
+ // optimized loop.
78
+ // or until (condition 3)
79
+ // the character to look at lies outside the haystack.
80
+ while (pos < 0 && pos <= data.length - this._needle.length) {
81
+ const cpos = pos + this._needle.length - 1;
82
+ const ch = cpos < 0
83
+ ? this._lookbehind[this._lookbehind.length + cpos]
84
+ : data[cpos];
85
+ if (ch === this._lastChar &&
86
+ this._memcmp(data, pos, this._needle.length - 1)) {
87
+ if (pos > -this._lookbehind.length) {
88
+ tokens.push(this._lookbehind.subarray(0, this._lookbehind.length + pos));
89
+ }
90
+ tokens.push(MATCH);
91
+ this._lookbehind = new Uint8Array();
92
+ return [pos + this._needle.length, ...tokens];
93
+ }
94
+ else {
95
+ pos += this._occ[ch];
96
+ }
97
+ }
98
+ // No match.
99
+ if (pos < 0) {
100
+ // There's too little data for Boyer-Moore-Horspool to run,
101
+ // so we'll use a different algorithm to skip as much as
102
+ // we can.
103
+ // Forward pos until
104
+ // the trailing part of lookbehind + data
105
+ // looks like the beginning of the needle
106
+ // or until
107
+ // pos == 0
108
+ while (pos < 0 && !this._memcmp(data, pos, data.length - pos)) {
109
+ pos++;
110
+ }
111
+ }
112
+ if (pos >= 0) {
113
+ // Discard lookbehind buffer.
114
+ tokens.push(this._lookbehind);
115
+ this._lookbehind = new Uint8Array();
116
+ }
117
+ else {
118
+ // Cut off part of the lookbehind buffer that has
119
+ // been processed and append the entire haystack
120
+ // into it.
121
+ const bytesToCutOff = this._lookbehind.length + pos;
122
+ if (bytesToCutOff > 0) {
123
+ // The cut off data is guaranteed not to contain the needle.
124
+ tokens.push(this._lookbehind.subarray(0, bytesToCutOff));
125
+ this._lookbehind = this._lookbehind.subarray(bytesToCutOff);
126
+ }
127
+ this._lookbehind = concat.concat([this._lookbehind, data]);
128
+ return [data.length, ...tokens];
129
+ }
130
+ }
131
+ pos += buf_pos;
132
+ // Lookbehind buffer is now empty. Perform Boyer-Moore-Horspool
133
+ // search with optimized character lookup code that only considers
134
+ // the current round's haystack data.
135
+ while (pos <= data.length - this._needle.length) {
136
+ const ch = data[pos + this._needle.length - 1];
137
+ if (ch === this._lastChar &&
138
+ data[pos] === this._needle[0] &&
139
+ jsmemcmp(this._needle, 0, data, pos, this._needle.length - 1)) {
140
+ if (pos > buf_pos) {
141
+ tokens.push(data.subarray(buf_pos, pos));
142
+ }
143
+ tokens.push(MATCH);
144
+ return [pos + this._needle.length, ...tokens];
145
+ }
146
+ else {
147
+ pos += this._occ[ch];
148
+ }
149
+ }
150
+ // There was no match. If there's trailing haystack data that we cannot
151
+ // match yet using the Boyer-Moore-Horspool algorithm (because the trailing
152
+ // data is less than the needle size) then match using a modified
153
+ // algorithm that starts matching from the beginning instead of the end.
154
+ // Whatever trailing data is left after running this algorithm is added to
155
+ // the lookbehind buffer.
156
+ if (pos < data.length) {
157
+ while (pos < data.length &&
158
+ (data[pos] !== this._needle[0] ||
159
+ !jsmemcmp(data, pos, this._needle, 0, data.length - pos))) {
160
+ ++pos;
161
+ }
162
+ if (pos < data.length) {
163
+ this._lookbehind = data.subarray(pos);
164
+ }
165
+ }
166
+ // Everything until pos is guaranteed not to contain needle data.
167
+ if (pos > 0) {
168
+ tokens.push(data.subarray(buf_pos, pos < data.length ? pos : data.length));
169
+ }
170
+ return [data.length, ...tokens];
171
+ }
172
+ _memcmp(data, pos, len) {
173
+ if (pos < 0) {
174
+ if (!jsmemcmp(this._lookbehind, this._lookbehind.length + pos, this._needle, 0, Math.min(-pos, len))) {
175
+ return false;
176
+ }
177
+ if (len < -pos) {
178
+ return true;
179
+ }
180
+ len += pos;
181
+ }
182
+ return jsmemcmp(data, Math.max(0, pos), this._needle, -Math.min(0, pos), len);
183
+ }
184
+ }
185
+
186
+ exports.MATCH = MATCH;
187
+ exports.StreamSearch = StreamSearch;
188
+ //# sourceMappingURL=search.cjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"search.cjs","sources":["../src/search.ts"],"sourcesContent":[null],"names":["fromString","concat"],"mappings":";;;;;AAAA;;;AAGE;AAKF,SAAS,QAAQ,CAChB,IAAgB,EAChB,IAAY,EACZ,IAAgB,EAChB,IAAY,EACZ,GAAW,EAAA;AAEX,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAC7B,QAAA,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE;AACtC,YAAA,OAAO,KAAK;QACb;IACD;AAEA,IAAA,OAAO,IAAI;AACZ;AAEA,SAAS,oBAAoB,CAAC,CAAa,EAAA;;;AAG1C,IAAA,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAC3C,IAAA,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACjB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACtC,YAAA,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;QAC/B;IACD;AAEA,IAAA,OAAO,KAAK;AACb;MAEa,KAAK,GAAG,MAAM,CAAC,OAAO;MAItB,YAAY,CAAA;AAChB,IAAA,OAAO;AACP,IAAA,SAAS;AACT,IAAA,IAAI;AAEJ,IAAA,WAAW,GAAe,IAAI,UAAU,EAAE;AAElD,IAAA,WAAA,CAAmB,MAA2B,EAAA;AAC7C,QAAA,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,GAAGA,qBAAU,CAAC,MAAM,CAAC;QAC3C;aAAO;AACN,YAAA,IAAI,CAAC,OAAO,GAAG,MAAM;QACtB;QAEA,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC1C,QAAA,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC,MAAM,CAAC;IACzC;AAEO,IAAA,IAAI,CAAC,KAAiB,EAAA;QAC5B,IAAI,GAAG,GAAG,CAAC;AACX,QAAA,IAAI,MAAe;QACnB,MAAM,SAAS,GAAY,EAAE;AAC7B,QAAA,OAAO,GAAG,KAAK,KAAK,CAAC,MAAM,EAAE;AAC5B,YAAA,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC;AACzC,YAAA,SAAS,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QAC1B;AAEA,QAAA,OAAO,SAAS;IACjB;IAEO,GAAG,GAAA;AACT,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW;AAC7B,QAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;AACnC,QAAA,OAAO,IAAI;IACZ;IAEQ,KAAK,CAAC,IAAgB,EAAE,OAAe,EAAA;QAC9C,MAAM,MAAM,GAAY,EAAE;;;;;QAM1B,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM;AAElC,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;;;;;AAaZ,YAAA,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;gBAC3D,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;AAC1C,gBAAA,MAAM,EAAE,GACP,IAAI,GAAG;AACN,sBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI;AACjD,sBAAE,IAAI,CAAC,IAAI,CAAC;AAEd,gBAAA,IACC,EAAE,KAAK,IAAI,CAAC,SAAS;AACrB,oBAAA,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAC/C;oBACD,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;wBACnC,MAAM,CAAC,IAAI,CACV,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,CAAC,CAC3D;oBACF;AAEA,oBAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;AAElB,oBAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;AAEnC,oBAAA,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;gBAC9C;qBAAO;AACN,oBAAA,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB;YACD;;AAIA,YAAA,IAAI,GAAG,GAAG,CAAC,EAAE;;;;;;;;;gBASZ,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE;AAC9D,oBAAA,GAAG,EAAE;gBACN;YACD;AAEA,YAAA,IAAI,GAAG,IAAI,CAAC,EAAE;;AAEb,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;AAC7B,gBAAA,IAAI,CAAC,WAAW,GAAG,IAAI,UAAU,EAAE;YACpC;iBAAO;;;;gBAIN,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG;AAEnD,gBAAA,IAAI,aAAa,GAAG,CAAC,EAAE;;AAEtB,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;oBACxD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,aAAa,CAAC;gBAC5D;AAEA,gBAAA,IAAI,CAAC,WAAW,GAAGC,aAAM,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;gBAEnD,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;YAChC;QACD;QAEA,GAAG,IAAI,OAAO;;;;AAKd,QAAA,OAAO,GAAG,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;AAChD,YAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAE9C,YAAA,IACC,EAAE,KAAK,IAAI,CAAC,SAAS;gBACrB,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC7B,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAC5D;AACD,gBAAA,IAAI,GAAG,GAAG,OAAO,EAAE;AAClB,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;gBACzC;AAEA,gBAAA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;AAElB,gBAAA,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;YAC9C;iBAAO;AACN,gBAAA,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB;QACD;;;;;;;AAQA,QAAA,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;AACtB,YAAA,OACC,GAAG,GAAG,IAAI,CAAC,MAAM;iBAChB,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC7B,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,EACzD;AACD,gBAAA,EAAE,GAAG;YACN;AAEA,YAAA,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE;gBACtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC;QACD;;AAGA,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;YACZ,MAAM,CAAC,IAAI,CACV,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAC7D;QACF;QAEA,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;IAChC;AAEQ,IAAA,OAAO,CAAC,IAAgB,EAAE,GAAW,EAAE,GAAW,EAAA;AACzD,QAAA,IAAI,GAAG,GAAG,CAAC,EAAE;AACZ,YAAA,IACC,CAAC,QAAQ,CACR,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,GAAG,EAC7B,IAAI,CAAC,OAAO,EACZ,CAAC,EACD,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CACnB,EACA;AACD,gBAAA,OAAO,KAAK;YACb;AAEA,YAAA,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE;AACf,gBAAA,OAAO,IAAI;YACZ;YAEA,GAAG,IAAI,GAAG;QACX;AAEA,QAAA,OAAO,QAAQ,CACd,IAAI,EACJ,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAChB,IAAI,CAAC,OAAO,EACZ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EACjB,GAAG,CACH;IACF;AACA;;;;;"}
package/lib/search.d.ts CHANGED
@@ -1,14 +1,13 @@
1
- export declare const MATCH: unique symbol;
2
- export declare type Token = Uint8Array | typeof MATCH;
3
- export declare class StreamSearch {
4
- private _needle;
5
- private _lastChar;
6
- private _occ;
7
- private _lookbehind;
8
- constructor(needle: Uint8Array | string);
9
- feed(chunk: Uint8Array): Token[];
10
- end(): Uint8Array;
11
- private _feed;
12
- private _charAt;
13
- private _memcmp;
14
- }
1
+ export declare const MATCH: unique symbol;
2
+ export type Token = Uint8Array | typeof MATCH;
3
+ export declare class StreamSearch {
4
+ private _needle;
5
+ private _lastChar;
6
+ private _occ;
7
+ private _lookbehind;
8
+ constructor(needle: Uint8Array | string);
9
+ feed(chunk: Uint8Array): Token[];
10
+ end(): Uint8Array;
11
+ private _feed;
12
+ private _memcmp;
13
+ }