spliterator 6.2.0 → 6.3.1

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 (162) hide show
  1. package/out/lib/core/AsyncSpliterator.d.ts +1 -1
  2. package/out/lib/core/AsyncSpliterator.d.ts.map +1 -1
  3. package/out/lib/core/AsyncSpliterator.js +2 -2
  4. package/out/lib/core/AsyncSpliterator.js.map +1 -1
  5. package/out/lib/core/SlidingWindow.d.ts +1 -1
  6. package/out/lib/core/SlidingWindow.d.ts.map +1 -1
  7. package/out/lib/core/SlidingWindow.js.map +1 -1
  8. package/out/lib/core/Spliterator.d.ts +1 -1
  9. package/out/lib/core/Spliterator.d.ts.map +1 -1
  10. package/out/lib/core/Spliterator.js +1 -1
  11. package/out/lib/core/Spliterator.js.map +1 -1
  12. package/out/lib/formats/CSVSpliterator.d.ts +2 -2
  13. package/out/lib/formats/CSVSpliterator.d.ts.map +1 -1
  14. package/out/lib/formats/CSVSpliterator.js +92 -1
  15. package/out/lib/formats/CSVSpliterator.js.map +1 -1
  16. package/out/lib/formats/XLSXSpliterator.d.ts +1 -1
  17. package/out/lib/formats/XLSXSpliterator.d.ts.map +1 -1
  18. package/package.json +2 -3
  19. package/out/lib/AsyncSequence.d.ts +0 -180
  20. package/out/lib/AsyncSequence.d.ts.map +0 -1
  21. package/out/lib/AsyncSequence.js +0 -432
  22. package/out/lib/AsyncSequence.js.map +0 -1
  23. package/out/lib/AsyncSpliterator.d.ts +0 -227
  24. package/out/lib/AsyncSpliterator.d.ts.map +0 -1
  25. package/out/lib/AsyncSpliterator.js +0 -510
  26. package/out/lib/AsyncSpliterator.js.map +0 -1
  27. package/out/lib/BufferController.d.ts +0 -77
  28. package/out/lib/BufferController.d.ts.map +0 -1
  29. package/out/lib/BufferController.js +0 -118
  30. package/out/lib/BufferController.js.map +0 -1
  31. package/out/lib/CSVSpliterator.d.ts +0 -131
  32. package/out/lib/CSVSpliterator.d.ts.map +0 -1
  33. package/out/lib/CSVSpliterator.js +0 -172
  34. package/out/lib/CSVSpliterator.js.map +0 -1
  35. package/out/lib/CharacterSequence.d.ts +0 -72
  36. package/out/lib/CharacterSequence.d.ts.map +0 -1
  37. package/out/lib/CharacterSequence.js +0 -347
  38. package/out/lib/CharacterSequence.js.map +0 -1
  39. package/out/lib/CompositeDataView.d.ts +0 -111
  40. package/out/lib/CompositeDataView.d.ts.map +0 -1
  41. package/out/lib/CompositeDataView.js +0 -241
  42. package/out/lib/CompositeDataView.js.map +0 -1
  43. package/out/lib/IndexQueue.d.ts +0 -48
  44. package/out/lib/IndexQueue.d.ts.map +0 -1
  45. package/out/lib/IndexQueue.js +0 -111
  46. package/out/lib/IndexQueue.js.map +0 -1
  47. package/out/lib/JSONSpliterator.d.ts +0 -44
  48. package/out/lib/JSONSpliterator.d.ts.map +0 -1
  49. package/out/lib/JSONSpliterator.js +0 -77
  50. package/out/lib/JSONSpliterator.js.map +0 -1
  51. package/out/lib/PSVSpliterator.d.ts +0 -21
  52. package/out/lib/PSVSpliterator.d.ts.map +0 -1
  53. package/out/lib/PSVSpliterator.js +0 -22
  54. package/out/lib/PSVSpliterator.js.map +0 -1
  55. package/out/lib/SlidingWindow.d.ts +0 -47
  56. package/out/lib/SlidingWindow.d.ts.map +0 -1
  57. package/out/lib/SlidingWindow.js +0 -63
  58. package/out/lib/SlidingWindow.js.map +0 -1
  59. package/out/lib/Spliterator.d.ts +0 -96
  60. package/out/lib/Spliterator.d.ts.map +0 -1
  61. package/out/lib/Spliterator.js +0 -330
  62. package/out/lib/Spliterator.js.map +0 -1
  63. package/out/lib/TSVSpliterator.d.ts +0 -21
  64. package/out/lib/TSVSpliterator.d.ts.map +0 -1
  65. package/out/lib/TSVSpliterator.js +0 -22
  66. package/out/lib/TSVSpliterator.js.map +0 -1
  67. package/out/lib/TextSpliterator.d.ts +0 -53
  68. package/out/lib/TextSpliterator.d.ts.map +0 -1
  69. package/out/lib/TextSpliterator.js +0 -67
  70. package/out/lib/TextSpliterator.js.map +0 -1
  71. package/out/lib/XLSXSpliterator.d.ts +0 -143
  72. package/out/lib/XLSXSpliterator.d.ts.map +0 -1
  73. package/out/lib/XLSXSpliterator.js +0 -161
  74. package/out/lib/XLSXSpliterator.js.map +0 -1
  75. package/out/lib/adaptive-source.d.ts +0 -39
  76. package/out/lib/adaptive-source.d.ts.map +0 -1
  77. package/out/lib/adaptive-source.js +0 -95
  78. package/out/lib/adaptive-source.js.map +0 -1
  79. package/out/lib/casing.d.ts +0 -27
  80. package/out/lib/casing.d.ts.map +0 -1
  81. package/out/lib/casing.js +0 -68
  82. package/out/lib/casing.js.map +0 -1
  83. package/out/lib/chunks.d.ts +0 -20
  84. package/out/lib/chunks.d.ts.map +0 -1
  85. package/out/lib/chunks.js +0 -36
  86. package/out/lib/chunks.js.map +0 -1
  87. package/out/lib/merge-async-iterators.d.ts +0 -12
  88. package/out/lib/merge-async-iterators.d.ts.map +0 -1
  89. package/out/lib/merge-async-iterators.js +0 -39
  90. package/out/lib/merge-async-iterators.js.map +0 -1
  91. package/out/lib/parallel-map-runtime.d.ts +0 -22
  92. package/out/lib/parallel-map-runtime.d.ts.map +0 -1
  93. package/out/lib/parallel-map-runtime.js +0 -60
  94. package/out/lib/parallel-map-runtime.js.map +0 -1
  95. package/out/lib/parallel-map-worker-entry.d.ts +0 -11
  96. package/out/lib/parallel-map-worker-entry.d.ts.map +0 -1
  97. package/out/lib/parallel-map-worker-entry.js +0 -41
  98. package/out/lib/parallel-map-worker-entry.js.map +0 -1
  99. package/out/lib/parallel-map-workers.d.ts +0 -57
  100. package/out/lib/parallel-map-workers.d.ts.map +0 -1
  101. package/out/lib/parallel-map-workers.js +0 -82
  102. package/out/lib/parallel-map-workers.js.map +0 -1
  103. package/out/lib/parallel-map.d.ts +0 -28
  104. package/out/lib/parallel-map.d.ts.map +0 -1
  105. package/out/lib/parallel-map.js +0 -30
  106. package/out/lib/parallel-map.js.map +0 -1
  107. package/out/lib/pivot.d.ts +0 -30
  108. package/out/lib/pivot.d.ts.map +0 -1
  109. package/out/lib/pivot.js +0 -47
  110. package/out/lib/pivot.js.map +0 -1
  111. package/out/lib/row-emitters.d.ts +0 -35
  112. package/out/lib/row-emitters.d.ts.map +0 -1
  113. package/out/lib/row-emitters.js +0 -50
  114. package/out/lib/row-emitters.js.map +0 -1
  115. package/out/lib/segment-runtime.d.ts +0 -27
  116. package/out/lib/segment-runtime.d.ts.map +0 -1
  117. package/out/lib/segment-runtime.js +0 -41
  118. package/out/lib/segment-runtime.js.map +0 -1
  119. package/out/lib/segment-worker-entry.d.ts +0 -10
  120. package/out/lib/segment-worker-entry.d.ts.map +0 -1
  121. package/out/lib/segment-worker-entry.js +0 -59
  122. package/out/lib/segment-worker-entry.js.map +0 -1
  123. package/out/lib/segment-workers.d.ts +0 -56
  124. package/out/lib/segment-workers.d.ts.map +0 -1
  125. package/out/lib/segment-workers.js +0 -110
  126. package/out/lib/segment-workers.js.map +0 -1
  127. package/out/lib/segments.d.ts +0 -31
  128. package/out/lib/segments.d.ts.map +0 -1
  129. package/out/lib/segments.js +0 -52
  130. package/out/lib/segments.js.map +0 -1
  131. package/out/lib/shared.d.ts +0 -155
  132. package/out/lib/shared.d.ts.map +0 -1
  133. package/out/lib/shared.js +0 -41
  134. package/out/lib/shared.js.map +0 -1
  135. package/out/lib/take.d.ts +0 -42
  136. package/out/lib/take.d.ts.map +0 -1
  137. package/out/lib/take.js +0 -101
  138. package/out/lib/take.js.map +0 -1
  139. package/out/lib/utils.d.ts +0 -37
  140. package/out/lib/utils.d.ts.map +0 -1
  141. package/out/lib/utils.js +0 -39
  142. package/out/lib/utils.js.map +0 -1
  143. package/out/lib/wasm_base64.d.ts +0 -19
  144. package/out/lib/wasm_base64.d.ts.map +0 -1
  145. package/out/lib/wasm_base64.js +0 -19
  146. package/out/lib/wasm_base64.js.map +0 -1
  147. package/out/lib/wasm_module.d.ts +0 -57
  148. package/out/lib/wasm_module.d.ts.map +0 -1
  149. package/out/lib/wasm_module.js +0 -34
  150. package/out/lib/wasm_module.js.map +0 -1
  151. package/out/lib/writer.d.ts +0 -45
  152. package/out/lib/writer.d.ts.map +0 -1
  153. package/out/lib/writer.js +0 -57
  154. package/out/lib/writer.js.map +0 -1
  155. package/out/lib/zip.d.ts +0 -33
  156. package/out/lib/zip.d.ts.map +0 -1
  157. package/out/lib/zip.js +0 -59
  158. package/out/lib/zip.js.map +0 -1
  159. package/out/node/cli/parse-args.d.ts +0 -120
  160. package/out/node/cli/parse-args.d.ts.map +0 -1
  161. package/out/node/cli/parse-args.js +0 -118
  162. package/out/node/cli/parse-args.js.map +0 -1
package/out/lib/shared.js DELETED
@@ -1,41 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- /**
7
- * Type-predicate to determine if a value is a file handle.
8
- */
9
- export function isFileHandleLike(input) {
10
- return Boolean(input && typeof input === "object" && "fd" in input);
11
- }
12
- /**
13
- * Type-predicate to determine if a value is a file resource.
14
- */
15
- export function isFileResourceLike(input) {
16
- return Boolean(input && typeof input === "object" && "slice" in input);
17
- }
18
- /**
19
- * Given a file resource, adds a `read` method to read a range of bytes.
20
- *
21
- * This allows the web `File` interface to be used as a byte range reader.
22
- */
23
- export function applyReaderPolyfill(file) {
24
- if ("read" in file && typeof file.read === "function") {
25
- return;
26
- }
27
- Object.assign(file, {
28
- async read(options = {}) {
29
- const { position: start = 0, length = file.size, offset = 0 } = options;
30
- const windowed = file.slice(start, start + length);
31
- const bytes = (await windowed.bytes());
32
- if (options.buffer) {
33
- const destination = options.buffer;
34
- destination.set(bytes, offset);
35
- return destination;
36
- }
37
- return bytes;
38
- },
39
- });
40
- }
41
- //# sourceMappingURL=shared.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"shared.js","sourceRoot":"","sources":["../../lib/shared.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAyDH;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAc;IAC9C,OAAO,OAAO,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,IAAI,IAAI,KAAK,CAAC,CAAA;AACpE,CAAC;AAuED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAChD,OAAO,OAAO,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,CAAC,CAAA;AACvE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAA6B,IAAO;IACtE,IAAI,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACvD,OAAM;IACP,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE;QACnB,KAAK,CAAC,IAAI,CAAuB,OAAO,GAAsC,EAAE;YAC/E,MAAM,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,GAAG,OAAO,CAAA;YACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,CAAA;YAElD,MAAM,KAAK,GAAG,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,CAA0B,CAAA;YAE/D,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACpB,MAAM,WAAW,GAAG,OAAO,CAAC,MAA+B,CAAA;gBAC3D,WAAW,CAAC,GAAG,CAAC,KAAY,EAAE,MAAM,CAAC,CAAA;gBAErC,OAAO,WAAW,CAAA;YACnB,CAAC;YAED,OAAO,KAAK,CAAA;QACb,CAAC;KACD,CAAC,CAAA;AACH,CAAC"}
package/out/lib/take.d.ts DELETED
@@ -1,42 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- /**
7
- * Given an iterable collection, returns an async iterable, executing the callback on each batch.
8
- *
9
- * This is useful for batching asynchronous operations.
10
- *
11
- * @param collection The collection to batch.
12
- * @param batchSize The size of each batch.
13
- * @param callback The async callback to execute on each batch.
14
- *
15
- * @yields The result of each callback execution
16
- */
17
- export declare function asyncParallelIterator<T, C extends (entry: T) => Promise<unknown>>(collection: Iterable<T> | AsyncIterable<T>, batchSize: number, callback: C, abortSignal?: AbortSignal): AsyncIterable<Awaited<ReturnType<C>>>;
18
- /**
19
- * Given an iterable, returns an array of arrays of the specified size.
20
- *
21
- * This is useful for batching asynchronous operations.
22
- *
23
- * @param collection The collection to batch.
24
- * @param batchSize The size of each batch.
25
- *
26
- * @returns An iterable of arrays of the specified size.
27
- * @see {@linkcode takeAsync} for the asynchronous version.
28
- */
29
- export declare function take<T>(collection: Iterable<T>, batchSize: number): Iterable<T[]>;
30
- /**
31
- * Given an async iterable collection, returns an async iterable, yielding batches of items.
32
- *
33
- * This is useful for emitting asynchronous items in batches, such as when processing a stream of data.
34
- *
35
- * @param collection The async iterable collection to batch.
36
- * @param batchSize The size of each batch.
37
- *
38
- * @yields Each batch of items.
39
- * @see {@linkcode take} for the synchronous version.
40
- */
41
- export declare function takeAsync<T>(collection: AsyncIterable<T>, batchSize: number): AsyncIterable<T[]>;
42
- //# sourceMappingURL=take.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"take.d.ts","sourceRoot":"","sources":["../../lib/take.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;GAUG;AACH,wBAAuB,qBAAqB,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,EACvF,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,EAC1C,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,CAAC,EACX,WAAW,CAAC,EAAE,WAAW,GACvB,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAqDvC;AAED;;;;;;;;;;GAUG;AACH,wBAAiB,IAAI,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,CAgBlF;AAED;;;;;;;;;;GAUG;AACH,wBAAuB,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAgBvG"}
package/out/lib/take.js DELETED
@@ -1,101 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- /**
7
- * Given an iterable collection, returns an async iterable, executing the callback on each batch.
8
- *
9
- * This is useful for batching asynchronous operations.
10
- *
11
- * @param collection The collection to batch.
12
- * @param batchSize The size of each batch.
13
- * @param callback The async callback to execute on each batch.
14
- *
15
- * @yields The result of each callback execution
16
- */
17
- export async function* asyncParallelIterator(collection, batchSize, callback, abortSignal) {
18
- const iterator = Symbol.asyncIterator in collection ? collection[Symbol.asyncIterator]() : collection[Symbol.iterator]();
19
- const runningTasks = new Map();
20
- const results = new Map();
21
- let iterationResult = await iterator.next();
22
- // oxlint-disable-next-line no-unmodified-loop-condition
23
- while ((!iterationResult.done || results.size) && !abortSignal?.aborted) {
24
- for (const [key, result] of results) {
25
- yield result;
26
- results.delete(key);
27
- }
28
- if (runningTasks.size >= batchSize) {
29
- await Promise.race(runningTasks.values());
30
- continue;
31
- }
32
- if (iterationResult.done) {
33
- await Promise.all(runningTasks.values());
34
- break;
35
- }
36
- const entry = iterationResult.value;
37
- const futureResult = callback(entry).then((result) => {
38
- runningTasks.delete(entry);
39
- results.set(entry, result);
40
- return void 0;
41
- });
42
- runningTasks.set(entry, futureResult);
43
- iterationResult = await iterator.next();
44
- }
45
- if (!abortSignal || !abortSignal.aborted) {
46
- await Promise.all(runningTasks.values());
47
- for (const [key, result] of results) {
48
- yield result;
49
- results.delete(key);
50
- }
51
- }
52
- }
53
- /**
54
- * Given an iterable, returns an array of arrays of the specified size.
55
- *
56
- * This is useful for batching asynchronous operations.
57
- *
58
- * @param collection The collection to batch.
59
- * @param batchSize The size of each batch.
60
- *
61
- * @returns An iterable of arrays of the specified size.
62
- * @see {@linkcode takeAsync} for the asynchronous version.
63
- */
64
- export function* take(collection, batchSize) {
65
- const batch = [];
66
- for (const item of collection) {
67
- batch.push(item);
68
- if (batch.length === batchSize) {
69
- yield batch;
70
- batch.length = 0;
71
- }
72
- }
73
- if (batch.length) {
74
- yield batch;
75
- }
76
- }
77
- /**
78
- * Given an async iterable collection, returns an async iterable, yielding batches of items.
79
- *
80
- * This is useful for emitting asynchronous items in batches, such as when processing a stream of data.
81
- *
82
- * @param collection The async iterable collection to batch.
83
- * @param batchSize The size of each batch.
84
- *
85
- * @yields Each batch of items.
86
- * @see {@linkcode take} for the synchronous version.
87
- */
88
- export async function* takeAsync(collection, batchSize) {
89
- let buffer = [];
90
- for await (const item of collection) {
91
- buffer.push(item);
92
- if (buffer.length === batchSize) {
93
- yield buffer;
94
- buffer = [];
95
- }
96
- }
97
- if (buffer.length) {
98
- yield buffer;
99
- }
100
- }
101
- //# sourceMappingURL=take.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"take.js","sourceRoot":"","sources":["../../lib/take.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,qBAAqB,CAC3C,UAA0C,EAC1C,SAAiB,EACjB,QAAW,EACX,WAAyB;IAEzB,MAAM,QAAQ,GACb,MAAM,CAAC,aAAa,IAAI,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAExG,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAA;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAA;IAE3C,IAAI,eAAe,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAA;IAE3C,wDAAwD;IACxD,OAAO,CAAC,CAAC,eAAe,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC;QACzE,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACrC,MAAM,MAAM,CAAA;YAEZ,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACpB,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC;YACpC,MAAM,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;YAEzC,SAAQ;QACT,CAAC;QAED,IAAI,eAAe,CAAC,IAAI,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;YAExC,MAAK;QACN,CAAC;QAED,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAA;QAEnC,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;YACpD,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAE1B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAuB,CAAC,CAAA;YAE3C,OAAO,KAAK,CAAC,CAAA;QACd,CAAC,CAAC,CAAA;QAEF,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAA;QAErC,eAAe,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAA;IACxC,CAAC;IAED,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QAC1C,MAAM,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;QAExC,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACrC,MAAM,MAAM,CAAA;YAEZ,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACpB,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,SAAS,CAAC,CAAC,IAAI,CAAI,UAAuB,EAAE,SAAiB;IAClE,MAAM,KAAK,GAAQ,EAAE,CAAA;IAErB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEhB,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAChC,MAAM,KAAK,CAAA;YAEX,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;QACjB,CAAC;IACF,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,MAAM,KAAK,CAAA;IACZ,CAAC;AACF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,SAAS,CAAI,UAA4B,EAAE,SAAiB;IAClF,IAAI,MAAM,GAAQ,EAAE,CAAA;IAEpB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEjB,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,MAAM,CAAA;YAEZ,MAAM,GAAG,EAAE,CAAA;QACZ,CAAC;IACF,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACnB,MAAM,MAAM,CAAA;IACb,CAAC;AACF,CAAC"}
@@ -1,37 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- /**
7
- * Convenience function to await an async iterable.
8
- */
9
- export declare function iterateInParallel<T>(asyncIterable: AsyncIterable<T>): Promise<void>;
10
- /**
11
- * Type-predicate for checking if a value is iterable.
12
- *
13
- * @category Type Guard
14
- * @category Object
15
- */
16
- export declare function isIterable<T>(input: unknown): input is Iterable<T>;
17
- /**
18
- * Iterable that can be checked for the existence of a member.
19
- */
20
- export interface IndexedIterable<T = unknown> extends Iterable<T> {
21
- has(value: T): boolean;
22
- }
23
- /**
24
- * Type-predicate for checking if an member within an iterable can be checked for existence.
25
- */
26
- export declare function isIndexedIterable<T>(value: Iterable<T>): value is IndexedIterable<T>;
27
- /**
28
- * Extracts the property keys of an object that are of type `number`.
29
- */
30
- export type NumericProperties<T> = {
31
- [K in keyof T]: T[K] extends number ? K : never;
32
- }[keyof T];
33
- /**
34
- * Given an iterable of objects, returns the sum of the specified property.
35
- */
36
- export declare function sumOf<T extends object>(iterable: Iterable<T>, prop: NumericProperties<T>): number;
37
- //# sourceMappingURL=utils.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../lib/utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAIzF;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAElE;AAED;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,GAAG,OAAO,CAAE,SAAQ,QAAQ,CAAC,CAAC,CAAC;IAChE,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAA;CACtB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,eAAe,CAAC,CAAC,CAAC,CAEpF;AAED;;GAEG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,IAAI;KACjC,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,MAAM,GAAG,CAAC,GAAG,KAAK;CAC/C,CAAC,MAAM,CAAC,CAAC,CAAA;AAEV;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAQjG"}
package/out/lib/utils.js DELETED
@@ -1,39 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- /**
7
- * Convenience function to await an async iterable.
8
- */
9
- export async function iterateInParallel(asyncIterable) {
10
- for await (const _ of asyncIterable) {
11
- /* empty */
12
- }
13
- }
14
- /**
15
- * Type-predicate for checking if a value is iterable.
16
- *
17
- * @category Type Guard
18
- * @category Object
19
- */
20
- export function isIterable(input) {
21
- return Symbol.iterator in new Object(input);
22
- }
23
- /**
24
- * Type-predicate for checking if an member within an iterable can be checked for existence.
25
- */
26
- export function isIndexedIterable(value) {
27
- return value && typeof value.has === "function";
28
- }
29
- /**
30
- * Given an iterable of objects, returns the sum of the specified property.
31
- */
32
- export function sumOf(iterable, prop) {
33
- let total = 0;
34
- for (const item of iterable) {
35
- total += item[prop];
36
- }
37
- return total;
38
- }
39
- //# sourceMappingURL=utils.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"utils.js","sourceRoot":"","sources":["../../lib/utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAI,aAA+B;IACzE,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QACrC,WAAW;IACZ,CAAC;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAI,KAAc;IAC3C,OAAO,MAAM,CAAC,QAAQ,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAA;AAC5C,CAAC;AASD;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAI,KAAkB;IACtD,OAAO,KAAK,IAAI,OAAQ,KAAyB,CAAC,GAAG,KAAK,UAAU,CAAA;AACrE,CAAC;AASD;;GAEG;AACH,MAAM,UAAU,KAAK,CAAmB,QAAqB,EAAE,IAA0B;IACxF,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,IAAI,IAAI,CAAC,IAAI,CAAW,CAAA;IAC9B,CAAC;IAED,OAAO,KAAK,CAAA;AACb,CAAC"}
@@ -1,19 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- * Base64-encoded WASM module for SIMD-accelerated delimiter scanning.
6
- * Generated by wasm/build.sh — do not edit by hand.
7
- * The module exports:
8
- * - memory: WebAssembly.Memory (1 page = 64KB initial, grows on demand, no fixed maximum)
9
- * - find_delimiter(haystack_offset, haystack_len, pattern_offset, pattern_len) → i32
10
- * Returns the byte offset of the first match, or -1.
11
- * - find_all_delimiters(haystack_offset, haystack_len, pattern_offset, pattern_len,
12
- * results_offset, max_results) → usize
13
- * Writes (start, end) i32 pairs to results_offset, returns count.
14
- * - scan_delimited_ranges(haystack_offset, haystack_len, scan_start, pending_slice_start,
15
- * delimiter, quote, inside_quotes, results_offset, max_ranges) → usize
16
- * Writes resumable scan state followed by bounded (start, end) i32 pairs.
17
- */
18
- export declare const WASM_BASE64 = "AGFzbQEAAAABKwRgBH9/f38Bf2AGf39/f39/AX9gB39/f39/f38Bf2AJf39/f39/f39/AX8DBgUAAQIAAwUDAQABB1wFBm1lbW9yeQIAE2ZpbmRfYWxsX2RlbGltaXRlcnMAARBmaW5kX2FsbF9tYXRjaGVzAAIOZmluZF9kZWxpbWl0ZXIAAxVzY2FuX2RlbGltaXRlZF9yYW5nZXMABArfDwXEAgINfwF7IAItAAAhCyABIANBAWsiDWsiBEEAIAEgBE8bIglBEE8EQCAL/Q8hESAAIQpBECEEA0AgBSEMIAQhBSAAIAxq/QAAACAR/SP9ZCIGBEADQCABIAZoIgQgDGoiDiADak8EQCAEIApqIQcgAyEEIAIhCANAIARFBEAgDg8LIARBAWshBCAILQAAIActAAAgCEEBaiEIIAdBAWohB0YNAAsLIAZBAWsgBnEiBg0ACwsgCkEQaiEKIAVBEGoiBCAJTQ0ACwsgBSAJSQRAIAJBAWohASAAIAVqQQFqIQYDQCANIQQgASEHIAYhCAJAIAAgBWotAAAgC0cNAANAIAQEQCAEQQFrIQQgBy0AACAILQAAIAdBAWohByAIQQFqIQhGDQEMAgsLIAUPCyAGQQFqIQYgBUEBaiIFIAlJDQALC0F/C5MCAgl/AXsCQCAFRSABRSADRXJyRQRAIAEgA0kNASADQQFHIQ0DQCAAIAlqIQogASAJayELAn8gDUUEQCACLQAAIg79DyEPQQAhBgJAA0AgBkEQaiIHIAtLDQEgBiAKaiAHIQb9AAAAIA/9I/1kIgdFDQALIAdoIAZBEGtqDAILA0AgBiALTw0FIAYgCmogBkEBaiEGLQAAIA5HDQALIAZBAWsMAQsgCiALIAIgAxAACyIGQQBIDQIgBCAIQQN0aiIMIAYgCWoiBzYCBCAMIAk2AgAgASADIAdqIgkgA2pPIAhBAWoiCCAFSSIHcQ0ACyAHDQELIAgPCyAEIAhBA3RqIgAgATYCBCAAIAk2AgAgCEEBaguDBgILfwN7AkAgBkUgAyAEckUgAUVycg0AIAIgA2ohDiADQQFGIhAgBEEBRnFFBEADQCABIAxrIQsCfwJAAkAgEEUEQCADDQFB/////wcMAwsgACAMaiEKIAItAAAiDf0PIRJBACEHAkADQCAHQRBqIgkgC0sNASAHIApqIAkhB/0AAAAgEv0j/WQiCUUNAAsgCWggB0EQa2oMAwsDQCAHIAtJBEAgByAKaiEJIAdBAWohByANIAktAABHDQEMAwsLQX8MAgsgACAMaiALIAIgAxAADAELIAdBAWsLIgkCfwJAAkAgBEEBRgRAIAAgDGohDSAOLQAAIg/9DyESQQAhBwJAA0AgB0EQaiIKIAtLDQEgByANaiAKIQf9AAAAIBL9I/1kIgpFDQALIApoIAdBEGtqDAQLA0AgByALSQRAIAcgDWohCiAHQQFqIQcgDyAKLQAARw0BDAMLC0F/DAMLIAQNAUH/////BwwCCyAHQQFrDAELIAAgDGogCyAOIAQQAAsiB3FBAEgNAiAFIAhBA3RqIgsgByAJSCAHQQBOcSAJQQBIciIKNgIEIAsgByAJIAobIAxqIgc2AgAgCEEBaiEIIAcgBCADIAobaiIMIAFPDQIgBiAISw0ACwwBCyAOLQAAIQogAi0AACEDAkAgAUEQSQ0AIAr9DyESIAP9DyETQRAhB0EAIQIDQCAHIQkCQCAAIAJq/QAAACIUIBP9I/1kIgQgFCAS/SP9ZHIiB0UNACAEQX9zIQwgBSAIQQN0aiEEA0AgBCAHaCILIAJqNgIAIARBBGogDCALdkEBcTYCACAIQQFqIQggB0EBayAHcSIHRQ0BIARBCGohBCAGIAhLDQALCyAJQRBqIgcgAUsNASAJIQIgBiAISw0ACwsgASAJTSAGIAhNcg0AA0ACQCADIAAgCWotAAAiAkYEf0EABSACIApHDQFBAQshByAFIAhBA3RqIgIgBzYCBCACIAk2AgAgCEEBaiEICyAJQQFqIgkgAU8NASAGIAhLDQALCyAIC5IBAgN/AXtBfyEFAkAgA0EBayABTw0AIANBAUYEQCACLQAAIgL9DyEHQQAhAwNAIAEgA0EQaiIESQRAA0AgASADTQ0EIAAgA2ogA0EBaiEDLQAAIAJHDQALIANBAWsPCyAAIANqIAQhA/0AAAAgB/0j/WQiBEUNAAsgBGggA0EQa2oPCyAAIAEgAiADEAAhBQsgBQvoAwIIfwN7IAEgAyABIANJGyEKIAZBAEchBiAHAn8CQCABIAEgAiABIAJJGyICQRBqIgNPBEAgBf0PIREgBP0PIRIgBUEATiENA0AgAiELIAMhAiAAIAtq/QAAACITIBH9I/1kQQAgDRsiDiATIBL9I/1kIg9yIgMEQANAIANoIQwCQAJAAkACQCAFQQBIDQBBASAMdCIQIA9xDQAgDiAQcQ0BCyAGQQFxRQ0BQQEhBgwCCyAGQQFzIQYMAQsgCyAMaiEGIAggCUsEQCAHIAlBA3RqIgxBEGogBjYCACAMQQxqIAo2AgAgBkEBaiEKIAlBAWohCUEAIQYMAQsgByAKNgIEIAcgBjYCAAwFCyADQQFrIANxIgMNAAsLIAJBEGoiAyABTQ0ACwsgASACSwRAIARB/wFxIQMgBUEATiEEA0ACQCADIAAgAmotAAAiC0cEQCAGIAQgCyAFQf8BcUZxcyEGDAELIAZBAXEEQEEBIQYMAQsgCCAJSwRAIAcgCUEDdGoiBkEQaiACNgIAIAZBDGogCjYCACACQQFqIQogCUEBaiEJQQAhBgwBCyAHIAo2AgQgByACNgIADAMLIAEgAkEBaiICRw0ACwsgByAKNgIEIAcgATYCACAGQQFxDAELQQALNgIIIAkL";
19
- //# sourceMappingURL=wasm_base64.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"wasm_base64.d.ts","sourceRoot":"","sources":["../../lib/wasm_base64.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,WAAW,61FACm0F,CAAA"}
@@ -1,19 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- * Base64-encoded WASM module for SIMD-accelerated delimiter scanning.
6
- * Generated by wasm/build.sh — do not edit by hand.
7
- * The module exports:
8
- * - memory: WebAssembly.Memory (1 page = 64KB initial, grows on demand, no fixed maximum)
9
- * - find_delimiter(haystack_offset, haystack_len, pattern_offset, pattern_len) → i32
10
- * Returns the byte offset of the first match, or -1.
11
- * - find_all_delimiters(haystack_offset, haystack_len, pattern_offset, pattern_len,
12
- * results_offset, max_results) → usize
13
- * Writes (start, end) i32 pairs to results_offset, returns count.
14
- * - scan_delimited_ranges(haystack_offset, haystack_len, scan_start, pending_slice_start,
15
- * delimiter, quote, inside_quotes, results_offset, max_ranges) → usize
16
- * Writes resumable scan state followed by bounded (start, end) i32 pairs.
17
- */
18
- export const WASM_BASE64 = "AGFzbQEAAAABKwRgBH9/f38Bf2AGf39/f39/AX9gB39/f39/f38Bf2AJf39/f39/f39/AX8DBgUAAQIAAwUDAQABB1wFBm1lbW9yeQIAE2ZpbmRfYWxsX2RlbGltaXRlcnMAARBmaW5kX2FsbF9tYXRjaGVzAAIOZmluZF9kZWxpbWl0ZXIAAxVzY2FuX2RlbGltaXRlZF9yYW5nZXMABArfDwXEAgINfwF7IAItAAAhCyABIANBAWsiDWsiBEEAIAEgBE8bIglBEE8EQCAL/Q8hESAAIQpBECEEA0AgBSEMIAQhBSAAIAxq/QAAACAR/SP9ZCIGBEADQCABIAZoIgQgDGoiDiADak8EQCAEIApqIQcgAyEEIAIhCANAIARFBEAgDg8LIARBAWshBCAILQAAIActAAAgCEEBaiEIIAdBAWohB0YNAAsLIAZBAWsgBnEiBg0ACwsgCkEQaiEKIAVBEGoiBCAJTQ0ACwsgBSAJSQRAIAJBAWohASAAIAVqQQFqIQYDQCANIQQgASEHIAYhCAJAIAAgBWotAAAgC0cNAANAIAQEQCAEQQFrIQQgBy0AACAILQAAIAdBAWohByAIQQFqIQhGDQEMAgsLIAUPCyAGQQFqIQYgBUEBaiIFIAlJDQALC0F/C5MCAgl/AXsCQCAFRSABRSADRXJyRQRAIAEgA0kNASADQQFHIQ0DQCAAIAlqIQogASAJayELAn8gDUUEQCACLQAAIg79DyEPQQAhBgJAA0AgBkEQaiIHIAtLDQEgBiAKaiAHIQb9AAAAIA/9I/1kIgdFDQALIAdoIAZBEGtqDAILA0AgBiALTw0FIAYgCmogBkEBaiEGLQAAIA5HDQALIAZBAWsMAQsgCiALIAIgAxAACyIGQQBIDQIgBCAIQQN0aiIMIAYgCWoiBzYCBCAMIAk2AgAgASADIAdqIgkgA2pPIAhBAWoiCCAFSSIHcQ0ACyAHDQELIAgPCyAEIAhBA3RqIgAgATYCBCAAIAk2AgAgCEEBaguDBgILfwN7AkAgBkUgAyAEckUgAUVycg0AIAIgA2ohDiADQQFGIhAgBEEBRnFFBEADQCABIAxrIQsCfwJAAkAgEEUEQCADDQFB/////wcMAwsgACAMaiEKIAItAAAiDf0PIRJBACEHAkADQCAHQRBqIgkgC0sNASAHIApqIAkhB/0AAAAgEv0j/WQiCUUNAAsgCWggB0EQa2oMAwsDQCAHIAtJBEAgByAKaiEJIAdBAWohByANIAktAABHDQEMAwsLQX8MAgsgACAMaiALIAIgAxAADAELIAdBAWsLIgkCfwJAAkAgBEEBRgRAIAAgDGohDSAOLQAAIg/9DyESQQAhBwJAA0AgB0EQaiIKIAtLDQEgByANaiAKIQf9AAAAIBL9I/1kIgpFDQALIApoIAdBEGtqDAQLA0AgByALSQRAIAcgDWohCiAHQQFqIQcgDyAKLQAARw0BDAMLC0F/DAMLIAQNAUH/////BwwCCyAHQQFrDAELIAAgDGogCyAOIAQQAAsiB3FBAEgNAiAFIAhBA3RqIgsgByAJSCAHQQBOcSAJQQBIciIKNgIEIAsgByAJIAobIAxqIgc2AgAgCEEBaiEIIAcgBCADIAobaiIMIAFPDQIgBiAISw0ACwwBCyAOLQAAIQogAi0AACEDAkAgAUEQSQ0AIAr9DyESIAP9DyETQRAhB0EAIQIDQCAHIQkCQCAAIAJq/QAAACIUIBP9I/1kIgQgFCAS/SP9ZHIiB0UNACAEQX9zIQwgBSAIQQN0aiEEA0AgBCAHaCILIAJqNgIAIARBBGogDCALdkEBcTYCACAIQQFqIQggB0EBayAHcSIHRQ0BIARBCGohBCAGIAhLDQALCyAJQRBqIgcgAUsNASAJIQIgBiAISw0ACwsgASAJTSAGIAhNcg0AA0ACQCADIAAgCWotAAAiAkYEf0EABSACIApHDQFBAQshByAFIAhBA3RqIgIgBzYCBCACIAk2AgAgCEEBaiEICyAJQQFqIgkgAU8NASAGIAhLDQALCyAIC5IBAgN/AXtBfyEFAkAgA0EBayABTw0AIANBAUYEQCACLQAAIgL9DyEHQQAhAwNAIAEgA0EQaiIESQRAA0AgASADTQ0EIAAgA2ogA0EBaiEDLQAAIAJHDQALIANBAWsPCyAAIANqIAQhA/0AAAAgB/0j/WQiBEUNAAsgBGggA0EQa2oPCyAAIAEgAiADEAAhBQsgBQvoAwIIfwN7IAEgAyABIANJGyEKIAZBAEchBiAHAn8CQCABIAEgAiABIAJJGyICQRBqIgNPBEAgBf0PIREgBP0PIRIgBUEATiENA0AgAiELIAMhAiAAIAtq/QAAACITIBH9I/1kQQAgDRsiDiATIBL9I/1kIg9yIgMEQANAIANoIQwCQAJAAkACQCAFQQBIDQBBASAMdCIQIA9xDQAgDiAQcQ0BCyAGQQFxRQ0BQQEhBgwCCyAGQQFzIQYMAQsgCyAMaiEGIAggCUsEQCAHIAlBA3RqIgxBEGogBjYCACAMQQxqIAo2AgAgBkEBaiEKIAlBAWohCUEAIQYMAQsgByAKNgIEIAcgBjYCAAwFCyADQQFrIANxIgMNAAsLIAJBEGoiAyABTQ0ACwsgASACSwRAIARB/wFxIQMgBUEATiEEA0ACQCADIAAgAmotAAAiC0cEQCAGIAQgCyAFQf8BcUZxcyEGDAELIAZBAXEEQEEBIQYMAQsgCCAJSwRAIAcgCUEDdGoiBkEQaiACNgIAIAZBDGogCjYCACACQQFqIQogCUEBaiEJQQAhBgwBCyAHIAo2AgQgByACNgIADAMLIAEgAkEBaiICRw0ACwsgByAKNgIEIAcgATYCACAGQQFxDAELQQALNgIIIAkL";
19
- //# sourceMappingURL=wasm_base64.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"wasm_base64.js","sourceRoot":"","sources":["../../lib/wasm_base64.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,WAAW,GACvB,01FAA01F,CAAA"}
@@ -1,57 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- export declare function loadWasmModule(): Promise<WasmDelimiterScanner | null>;
7
- type WasmFindDelimiter = (ho: number, hl: number, po: number, pl: number) => number;
8
- type WasmFindAllDelimiters = (ho: number, hl: number, po: number, pl: number, ro: number, mr: number) => number;
9
- type WasmFindAllMatches = (ho: number, hl: number, p1o: number, p1l: number, p2l: number, ro: number, mr: number) => number;
10
- type WasmScanDelimitedRanges = (ho: number, hl: number, ss: number, pss: number, delimiter: number, quote: number, insideQuotes: number, ro: number, mr: number) => number;
11
- export interface WasmMemory {
12
- readonly buffer: ArrayBuffer;
13
- grow(pages: number): number;
14
- }
15
- export interface WasmDelimiterScanner {
16
- memory: WasmMemory;
17
- findDelimiter: WasmFindDelimiter;
18
- findAllDelimiters: WasmFindAllDelimiters;
19
- findAllMatches: WasmFindAllMatches;
20
- scanDelimitedRanges: WasmScanDelimitedRanges;
21
- }
22
- /**
23
- * Match result from find_all_matches: [offset, pattern_id].
24
- */
25
- export interface MatchResult {
26
- /**
27
- * Byte offset of the match within the haystack.
28
- */
29
- offset: number;
30
- /**
31
- * 0 = pattern 1 (delimiter), 1 = pattern 2 (quote).
32
- */
33
- patternId: number;
34
- }
35
- /**
36
- * Minimum haystack size (bytes) at which the WASM SIMD scanner is used instead of the JS scan, once the module has
37
- * loaded. Empirically WASM wins well below this — ~8x for single-byte `searchAll` and ~3x for multi-byte `search` at
38
- * 512 bytes, with sub-µs fixed overhead — so 512 captures typical delimited rows while skipping only the tiny-buffer
39
- * regime where it doesn't matter.
40
- */
41
- export declare const WASM_THRESHOLD = 512;
42
- export declare const WASM_MAX_RESULTS = 4096;
43
- /**
44
- * State returned by the bounded, resumable range scanner.
45
- */
46
- export interface WasmRangeScanResult {
47
- /**
48
- * A shared-memory view of `[start, end]` pairs. Consume it before the next WASM scan.
49
- */
50
- ranges: Int32Array;
51
- count: number;
52
- scanCursor: number;
53
- pendingSliceStart: number;
54
- insideQuotes: boolean;
55
- }
56
- export {};
57
- //# sourceMappingURL=wasm_module.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"wasm_module.d.ts","sourceRoot":"","sources":["../../lib/wasm_module.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAiBH,wBAAsB,cAAc,IAAI,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAmB3E;AAED,KAAK,iBAAiB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,MAAM,CAAA;AAEnF,KAAK,qBAAqB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,MAAM,CAAA;AAE/G,KAAK,kBAAkB,GAAG,CACzB,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,KACN,MAAM,CAAA;AAGX,KAAK,uBAAuB,GAAG,CAC9B,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,MAAM,EACpB,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,KACN,MAAM,CAAA;AAEX,MAAM,WAAW,UAAU;IAC1B,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAA;IAC5B,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CAC3B;AAED,MAAM,WAAW,oBAAoB;IACpC,MAAM,EAAE,UAAU,CAAA;IAClB,aAAa,EAAE,iBAAiB,CAAA;IAChC,iBAAiB,EAAE,qBAAqB,CAAA;IACxC,cAAc,EAAE,kBAAkB,CAAA;IAClC,mBAAmB,EAAE,uBAAuB,CAAA;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B;;OAEG;IACH,MAAM,EAAE,MAAM,CAAA;IACd;;OAEG;IACH,SAAS,EAAE,MAAM,CAAA;CACjB;AAED;;;;;GAKG;AACH,eAAO,MAAM,cAAc,MAAM,CAAA;AACjC,eAAO,MAAM,gBAAgB,OAAO,CAAA;AAEpC;;GAEG;AACH,MAAM,WAAW,mBAAmB;IACnC;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;IAClB,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,MAAM,CAAA;IAClB,iBAAiB,EAAE,MAAM,CAAA;IACzB,YAAY,EAAE,OAAO,CAAA;CACrB"}
@@ -1,34 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- import { WASM_BASE64 } from "./wasm_base64.js";
7
- export async function loadWasmModule() {
8
- if (!WASM_BASE64)
9
- return null;
10
- try {
11
- const bytes = Uint8Array.from(atob(WASM_BASE64), (c) => c.charCodeAt(0));
12
- const module = await WebAssembly.compile(bytes);
13
- const instance = await WebAssembly.instantiate(module, {});
14
- const e = instance.exports;
15
- const memory = e.memory;
16
- const findDelimiter = e.find_delimiter;
17
- const findAllDelimiters = e.find_all_delimiters;
18
- const findAllMatches = e.find_all_matches;
19
- const scanDelimitedRanges = e.scan_delimited_ranges;
20
- return { memory, findDelimiter, findAllDelimiters, findAllMatches, scanDelimitedRanges };
21
- }
22
- catch {
23
- return null;
24
- }
25
- }
26
- /**
27
- * Minimum haystack size (bytes) at which the WASM SIMD scanner is used instead of the JS scan, once the module has
28
- * loaded. Empirically WASM wins well below this — ~8x for single-byte `searchAll` and ~3x for multi-byte `search` at
29
- * 512 bytes, with sub-µs fixed overhead — so 512 captures typical delimited rows while skipping only the tiny-buffer
30
- * regime where it doesn't matter.
31
- */
32
- export const WASM_THRESHOLD = 512;
33
- export const WASM_MAX_RESULTS = 4096;
34
- //# sourceMappingURL=wasm_module.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"wasm_module.js","sourceRoot":"","sources":["../../lib/wasm_module.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAe9C,MAAM,CAAC,KAAK,UAAU,cAAc;IACnC,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAA;IAE7B,IAAI,CAAC;QACJ,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;QACxE,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAC/C,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QAC1D,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAA;QAE1B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAoB,CAAA;QACrC,MAAM,aAAa,GAAG,CAAC,CAAC,cAAmC,CAAA;QAC3D,MAAM,iBAAiB,GAAG,CAAC,CAAC,mBAA4C,CAAA;QACxE,MAAM,cAAc,GAAG,CAAC,CAAC,gBAAsC,CAAA;QAC/D,MAAM,mBAAmB,GAAG,CAAC,CAAC,qBAAgD,CAAA;QAE9E,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,iBAAiB,EAAE,cAAc,EAAE,mBAAmB,EAAE,CAAA;IACzF,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,IAAI,CAAA;IACZ,CAAC;AACF,CAAC;AAwDD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,GAAG,CAAA;AACjC,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAA"}
@@ -1,45 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- import { type WriteStream, type PathLike } from "node:fs";
7
- /**
8
- * Callback for writing a line to a newline-delimited file.
9
- *
10
- * The trailing newline is appended for you — pass the content alone.
11
- */
12
- export interface WriteLineCallback {
13
- /**
14
- * Write a line to the file, terminated with a newline. The content should not contain one itself.
15
- */
16
- (content: string): Promise<void>;
17
- /**
18
- * Write a chunk to the file, terminated with a newline. The chunk should not contain one itself.
19
- */
20
- (chunk: any, encoding: BufferEncoding): Promise<void>;
21
- }
22
- export interface NewlineWriter extends AsyncDisposable {
23
- /**
24
- * Write a line to the file, terminated with a newline.
25
- *
26
- * The content should not contain a newline character — the writer supplies the delimiter.
27
- */
28
- write: WriteLineCallback;
29
- dispose: () => Promise<void>;
30
- writer: WriteStream;
31
- }
32
- /**
33
- * Creates a writer for newline-delimited files.
34
- *
35
- * Every {@linkcode NewlineWriter.write} terminates its content with `\n`, so the file is delimited (and round-trips
36
- * through {@linkcode TextSpliterator}) without the caller appending anything:
37
- *
38
- * ```ts
39
- * await using out = createNewlineWriter("rows.jsonl")
40
- *
41
- * for (const row of rows) await out.write(JSON.stringify(row))
42
- * ```
43
- */
44
- export declare function createNewlineWriter(filePath: PathLike): NewlineWriter;
45
- //# sourceMappingURL=writer.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"writer.d.ts","sourceRoot":"","sources":["../../lib/writer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,KAAK,WAAW,EAAqB,KAAK,QAAQ,EAAE,MAAM,SAAS,CAAA;AAE5E;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IACjC;;OAEG;IACH,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IAChC;;OAEG;IACH,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;CACrD;AAED,MAAM,WAAW,aAAc,SAAQ,eAAe;IACrD;;;;OAIG;IACH,KAAK,EAAE,iBAAiB,CAAA;IACxB,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAA;IAC5B,MAAM,EAAE,WAAW,CAAA;CACnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,GAAG,aAAa,CA6CrE"}
package/out/lib/writer.js DELETED
@@ -1,57 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- import { createWriteStream } from "node:fs";
7
- /**
8
- * Creates a writer for newline-delimited files.
9
- *
10
- * Every {@linkcode NewlineWriter.write} terminates its content with `\n`, so the file is delimited (and round-trips
11
- * through {@linkcode TextSpliterator}) without the caller appending anything:
12
- *
13
- * ```ts
14
- * await using out = createNewlineWriter("rows.jsonl")
15
- *
16
- * for (const row of rows) await out.write(JSON.stringify(row))
17
- * ```
18
- */
19
- export function createNewlineWriter(filePath) {
20
- const writer = createWriteStream(filePath);
21
- const write = (content, encoding) => {
22
- return new Promise((resolve, reject) => {
23
- const settle = (error) => {
24
- if (error) {
25
- reject(error);
26
- return;
27
- }
28
- resolve();
29
- };
30
- // The delimiter goes out as its own chunk rather than concatenated onto `content`: the
31
- // two-argument overload accepts a Buffer, and `buffer + "\n"` would stringify it via
32
- // `toString()` and corrupt the bytes. Stream writes are ordered, so the newline always
33
- // follows its content, and settling on the delimiter's callback resolves once the whole
34
- // line has flushed.
35
- writer.write(content, encoding ?? "utf8");
36
- writer.write("\n", "utf8", settle);
37
- });
38
- };
39
- const dispose = () => {
40
- return new Promise((resolve, reject) => {
41
- writer.close((error) => {
42
- if (error) {
43
- reject(error);
44
- return;
45
- }
46
- resolve();
47
- });
48
- });
49
- };
50
- return {
51
- write,
52
- writer,
53
- dispose,
54
- [Symbol.asyncDispose]: dispose,
55
- };
56
- }
57
- //# sourceMappingURL=writer.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"writer.js","sourceRoot":"","sources":["../../lib/writer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAoB,iBAAiB,EAAiB,MAAM,SAAS,CAAA;AA6B5E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAkB;IACrD,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAA;IAE1C,MAAM,KAAK,GAAsB,CAAC,OAAY,EAAE,QAAyB,EAAE,EAAE;QAC5E,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACtC,MAAM,MAAM,GAAG,CAAC,KAA+B,EAAQ,EAAE;gBACxD,IAAI,KAAK,EAAE,CAAC;oBACX,MAAM,CAAC,KAAK,CAAC,CAAA;oBAEb,OAAM;gBACP,CAAC;gBAED,OAAO,EAAE,CAAA;YACV,CAAC,CAAA;YAED,uFAAuF;YACvF,qFAAqF;YACrF,uFAAuF;YACvF,wFAAwF;YACxF,oBAAoB;YACpB,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,IAAI,MAAM,CAAC,CAAA;YACzC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;QACnC,CAAC,CAAC,CAAA;IACH,CAAC,CAAA;IAED,MAAM,OAAO,GAAG,GAAG,EAAE;QACpB,OAAO,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YAC5C,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtB,IAAI,KAAK,EAAE,CAAC;oBACX,MAAM,CAAC,KAAK,CAAC,CAAA;oBAEb,OAAM;gBACP,CAAC;gBAED,OAAO,EAAE,CAAA;YACV,CAAC,CAAC,CAAA;QACH,CAAC,CAAC,CAAA;IACH,CAAC,CAAA;IAED,OAAO;QACN,KAAK;QACL,MAAM;QACN,OAAO;QACP,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,OAAO;KAC9B,CAAA;AACF,CAAC"}
package/out/lib/zip.d.ts DELETED
@@ -1,33 +0,0 @@
1
- /**
2
- * @copyright Sister Software
3
- * @license MIT
4
- * @author Teffen Ellis, et al.
5
- */
6
- export type Zipped<T, U> = [a: T | undefined, b: U | undefined, idx: number];
7
- export type ZippedEntries<Z> = Z extends Zipped<infer T, infer U> ? [T, U] : never;
8
- export declare function zippedEntries<T, U>(zipped: Zipped<T, U>): ZippedEntries<Zipped<T, U>>;
9
- /**
10
- * Given two iterables, zip them together into a single iterable which yields pairs of elements.
11
- *
12
- * If one iterable is longer than the other, the shorter iterable will be padded with `undefined`.
13
- *
14
- * @param a The first iterable to zip.
15
- * @param b The second iterable to zip.
16
- *
17
- * @yields Pairs of elements from the two iterables.
18
- * @see {@linkcode zipAsync} for the asynchronous version.
19
- */
20
- export declare function zipSync<T, U>(a: Iterable<T>, b: Iterable<U>): Generator<Zipped<T, U>>;
21
- /**
22
- * Given two iterables, zip them together into a single iterable which yields pairs of elements.
23
- *
24
- * If one iterable is longer than the other, the shorter iterable will be padded with `undefined`.
25
- *
26
- * @param a The first iterable to zip.
27
- * @param b The second iterable to zip.
28
- *
29
- * @yields Pairs of elements from the two iterables.
30
- * @see {@linkcode zipSync} for the synchronous version.
31
- */
32
- export declare function zipAsync<T, U>(a: AsyncIterable<T> | Iterable<T>, b: AsyncIterable<U> | Iterable<U>): AsyncGenerator<[a: T | undefined, b: U | undefined, idx: number]>;
33
- //# sourceMappingURL=zip.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"zip.d.ts","sourceRoot":"","sources":["../../lib/zip.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;AAE5E,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAA;AAElF,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAErF;AAED;;;;;;;;;;GAUG;AACH,wBAAiB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAkBtF;AAED;;;;;;;;;;GAUG;AACH,wBAAuB,QAAQ,CAAC,CAAC,EAAE,CAAC,EACnC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EACjC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAC/B,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAkBnE"}