@helloao/tools 0.0.6 → 0.0.10

package/dist/esm/parser/commentary-csv-parser.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../parser/commentary-csv-parser.ts"],
+  "sourcesContent": ["import {\r\n    CommentaryBookNode,\r\n    CommentaryChapterNode,\r\n    CommentaryParseTree,\r\n} from './types';\r\nimport { getBookId, parseVerseReference } from '../utils';\r\nimport { parse } from 'papaparse';\r\n\r\nexport interface CsvLine {\r\n    book: string;\r\n    chapter: string;\r\n    verse: string;\r\n    commentaries: string;\r\n}\r\n\r\nexport class CommentaryCsvParser {\r\n    parse(data: string): CommentaryParseTree {\r\n        // remove header automatically\r\n        const firstLine = data.indexOf('\\n');\r\n        data = data.substring(firstLine + 1);\r\n\r\n        const lines = parse<string[]>(data, {\r\n            header: false,\r\n            // transformHeader: (_, index) => {\r\n            //     const headers = ['book', 'chapter', 'verse', 'commentaries'];\r\n            //     if (index < headers.length) {\r\n            //         return headers[index];\r\n            //     } else {\r\n            //         return '';\r\n            //     }\r\n            // },\r\n            delimiter: ',',\r\n            escapeChar: '\"',\r\n            quoteChar: '\"',\r\n        });\r\n        return this.parseLines(\r\n            lines.data.map((line: string[]) => ({\r\n                book: line[0],\r\n                chapter: line[1],\r\n                verse: line[2],\r\n                commentaries: line[3],\r\n            }))\r\n        );\r\n    }\r\n\r\n    parseLines(data: CsvLine[]): CommentaryParseTree {\r\n        let tree: CommentaryParseTree = {\r\n            type: 'commentary/root',\r\n            books: [],\r\n        };\r\n\r\n        let book: CommentaryBookNode | null = null;\r\n        let chapter: CommentaryChapterNode | null = null;\r\n        for (let line of data) {\r\n            if (hasValue(line.book)) {\r\n                const id = getBookId(line.book);\r\n                if (!id) {\r\n                    throw new Error('Invalid book: ' + line.book);\r\n                }\r\n\r\n                book = tree.books.find((b) => b.book === id) ?? null;\r\n                if (!book) {\r\n                    book = {\r\n                        type: 'book',\r\n                        book: id,\r\n                        introduction: null,\r\n                        chapters: [],\r\n                    };\r\n                    tree.books.push(book);\r\n                }\r\n\r\n                if (!book.introduction) {\r\n                    book.introduction = hasValue(line.commentaries)\r\n                        ? line.commentaries\r\n                        : null;\r\n                }\r\n            } else if (hasValue(line.chapter)) {\r\n                const number = parseInt(line.chapter);\r\n                if (isNaN(number)) {\r\n                    throw new Error('Invalid chapter number: ' + line.chapter);\r\n                }\r\n\r\n                if (!book) {\r\n                    // console.log(line);\r\n                    throw new Error('Chapter without book');\r\n                }\r\n\r\n                chapter = {\r\n                    type: 'chapter',\r\n                    number,\r\n                    introduction: hasValue(line.commentaries)\r\n                        ? line.commentaries\r\n                        : null,\r\n                    verses: [],\r\n                };\r\n                book.chapters.push(chapter);\r\n            } else if (hasValue(line.verse)) {\r\n                const ref = parseVerseReference(line.verse);\r\n                if (ref) {\r\n                    if (ref.book === book?.book) {\r\n                        // @ts-ignore\r\n                        if (ref.chapter === chapter?.number) {\r\n                            chapter.verses.push({\r\n                                type: 'verse',\r\n                                number: ref.verse,\r\n                                content: [line.commentaries],\r\n                            });\r\n                        } else {\r\n                            chapter = {\r\n                                type: 'chapter',\r\n                                number: ref.chapter,\r\n                                introduction: null,\r\n                                verses: [\r\n                                    {\r\n                                        type: 'verse',\r\n                                        number: ref.verse,\r\n                                        content: [line.commentaries],\r\n                                    },\r\n                                ],\r\n                            };\r\n\r\n                            book.chapters.push(chapter);\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        return tree;\r\n    }\r\n}\r\n\r\nfunction hasValue(value: string | null): boolean {\r\n    return (\r\n        value !== null &&\r\n        value !== undefined &&\r\n        value !== '' &&\r\n        value.trim() !== ''\r\n    );\r\n}\r\n"],
+  "mappings": ";AAKA,SAAS,WAAW,2BAA2B;AAC/C,SAAS,aAAa;AASf,aAAM,oBAAoB;AAAA,EAC7B,MAAM,MAAmC;AAErC,UAAM,YAAY,KAAK,QAAQ,IAAI;AACnC,WAAO,KAAK,UAAU,YAAY,CAAC;AAEnC,UAAM,QAAQ,MAAgB,MAAM;AAAA,MAChC,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASR,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,WAAW;AAAA,IACf,CAAC;AACD,WAAO,KAAK;AAAA,MACR,MAAM,KAAK,IAAI,CAAC,UAAoB;AAAA,QAChC,MAAM,KAAK,CAAC;AAAA,QACZ,SAAS,KAAK,CAAC;AAAA,QACf,OAAO,KAAK,CAAC;AAAA,QACb,cAAc,KAAK,CAAC;AAAA,MACxB,EAAE;AAAA,IACN;AAAA,EACJ;AAAA,EAEA,WAAW,MAAsC;AAC7C,QAAI,OAA4B;AAAA,MAC5B,MAAM;AAAA,MACN,OAAO,CAAC;AAAA,IACZ;AAEA,QAAI,OAAkC;AACtC,QAAI,UAAwC;AAC5C,aAAS,QAAQ,MAAM;AACnB,UAAI,SAAS,KAAK,IAAI,GAAG;AACrB,cAAM,KAAK,UAAU,KAAK,IAAI;AAC9B,YAAI,CAAC,IAAI;AACL,gBAAM,IAAI,MAAM,mBAAmB,KAAK,IAAI;AAAA,QAChD;AAEA,eAAO,KAAK,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK;AAChD,YAAI,CAAC,MAAM;AACP,iBAAO;AAAA,YACH,MAAM;AAAA,YACN,MAAM;AAAA,YACN,cAAc;AAAA,YACd,UAAU,CAAC;AAAA,UACf;AACA,eAAK,MAAM,KAAK,IAAI;AAAA,QACxB;AAEA,YAAI,CAAC,KAAK,cAAc;AACpB,eAAK,eAAe,SAAS,KAAK,YAAY,IACxC,KAAK,eACL;AAAA,QACV;AAAA,MACJ,WAAW,SAAS,KAAK,OAAO,GAAG;AAC/B,cAAM,SAAS,SAAS,KAAK,OAAO;AACpC,YAAI,MAAM,MAAM,GAAG;AACf,gBAAM,IAAI,MAAM,6BAA6B,KAAK,OAAO;AAAA,QAC7D;AAEA,YAAI,CAAC,MAAM;AAEP,gBAAM,IAAI,MAAM,sBAAsB;AAAA,QAC1C;AAEA,kBAAU;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA,cAAc,SAAS,KAAK,YAAY,IAClC,KAAK,eACL;AAAA,UACN,QAAQ,CAAC;AAAA,QACb;AACA,aAAK,SAAS,KAAK,OAAO;AAAA,MAC9B,WAAW,SAAS,KAAK,KAAK,GAAG;AAC7B,cAAM,MAAM,oBAAoB,KAAK,KAAK;AAC1C,YAAI,KAAK;AACL,cAAI,IAAI,SAAS,MAAM,MAAM;AAEzB,gBAAI,IAAI,YAAY,SAAS,QAAQ;AACjC,sBAAQ,OAAO,KAAK;AAAA,gBAChB,MAAM;AAAA,gBACN,QAAQ,IAAI;AAAA,gBACZ,SAAS,CAAC,KAAK,YAAY;AAAA,cAC/B,CAAC;AAAA,YACL,OAAO;AACH,wBAAU;AAAA,gBACN,MAAM;AAAA,gBACN,QAAQ,IAAI;AAAA,gBACZ,cAAc;AAAA,gBACd,QAAQ;AAAA,kBACJ;AAAA,oBACI,MAAM;AAAA,oBACN,QAAQ,IAAI;AAAA,oBACZ,SAAS,CAAC,KAAK,YAAY;AAAA,kBAC/B;AAAA,gBACJ;AAAA,cACJ;AAEA,mBAAK,SAAS,KAAK,OAAO;AAAA,YAC9B;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AACJ;AAEA,SAAS,SAAS,OAA+B;AAC7C,SACI,UAAU,QACV,UAAU,UACV,UAAU,MACV,MAAM,KAAK,MAAM;AAEzB;",
+  "names": []
+}

package/dist/esm/parser/index.js

@@ -0,0 +1,9 @@
+"use strict";
+export * from "./types.js";
+export * from "./usfm-parser.js";
+export * from "./usx-parser.js";
+export * from "./codex-parser.js";
+export * from "./commentary-csv-parser.js";
+import * as iterators from "./iterators.js";
+export { iterators };
+//# sourceMappingURL=index.js.map

package/dist/esm/parser/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../parser/index.ts"],
+  "sourcesContent": ["export * from './types.js';\r\nexport * from './usfm-parser.js';\r\nexport * from './usx-parser.js';\r\nexport * from './codex-parser.js';\r\nexport * from './commentary-csv-parser.js';\r\nimport * as iterators from './iterators.js';\r\n\r\nexport { iterators };\r\n"],
+  "mappings": ";AAAA,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,cAAc;AACd,YAAY,eAAe;AAE3B,SAAS;",
+  "names": []
+}

package/dist/esm/parser/iterators.js

@@ -0,0 +1,152 @@
+"use strict";
+export class Rewindable {
+  buffer = [];
+  _bufferSize = 0;
+  _position = -1;
+  _iterator;
+  constructor(iterator, bufferSize = 2) {
+    this._iterator = iterator;
+    this._bufferSize = bufferSize;
+    if (this._iterator.return) {
+      this.return = (value) => {
+        return this._iterator.return(value);
+      };
+    }
+    if (this._iterator.throw) {
+      this.throw = (value) => {
+        return this._iterator.throw(value);
+      };
+    }
+  }
+  rewind(number) {
+    this._position += number;
+  }
+  [Symbol.iterator]() {
+    return this;
+  }
+  next(...args) {
+    if (this._position >= 0) {
+      let item = this.buffer[this._position];
+      this._position--;
+      return {
+        value: item,
+        done: false
+      };
+    }
+    let result = this._iterator.next(...args);
+    this.buffer.unshift(result.value);
+    if (this.buffer.length > this._bufferSize) {
+      this.buffer.splice(this._bufferSize, this.buffer.length - this._bufferSize);
+    }
+    return result;
+  }
+}
+export function* debug(label, iterator) {
+  for (let value of uncompletable(iterator)) {
+    if (value instanceof Element) {
+      console.log(label, value.outerHTML);
+    } else if (value instanceof Node) {
+      console.log(label, value.textContent);
+    } else {
+      console.log(label, value);
+    }
+    yield value;
+  }
+}
+export function rewindable(iterator, bufferSize = 2) {
+  return new Rewindable(iterator, bufferSize);
+}
+function* iterateNodes(node) {
+  for (let i = 0; i < node.childNodes.length; i++) {
+    yield node.childNodes[i];
+  }
+}
+export function parentChar(node) {
+  return matchingParent(node, (n) => n instanceof Element && n.nodeName === "char");
+}
+export function parentNote(node) {
+  return matchingParent(node, (n) => n instanceof Element && n.nodeName === "note");
+}
+export function matchingParent(node, filter) {
+  let parent = node.parentNode;
+  while (parent) {
+    if (filter(parent)) {
+      return parent;
+    }
+    parent = parent.parentNode;
+  }
+  return null;
+}
+export function isParent(node, parent) {
+  let parentNode = node.parentNode;
+  while (parentNode) {
+    if (parentNode === parent) {
+      return true;
+    }
+    parentNode = parentNode.parentNode;
+  }
+  return false;
+}
+export function iterateAll(node) {
+  return rewindable(_iterateAll(node));
+}
+export function* iterateUntil(iterator, predicate) {
+  for (let value of iterator) {
+    if (predicate(value)) {
+      return;
+    }
+    yield value;
+  }
+}
+function* _iterateAll(node) {
+  for (let child of node.childNodes) {
+    yield child;
+    yield* iterateAll(child);
+  }
+}
+export function* elements(iterator) {
+  for (let node of uncompletable(iterator)) {
+    if (node instanceof Element) {
+      yield node;
+    }
+  }
+}
+export function* children(iterator, parent) {
+  for (let node of uncompletable(iterator)) {
+    if (!isParent(node, parent)) {
+      iterator.rewind(1);
+      return;
+    }
+    yield node;
+  }
+}
+export function* uncompletable(iterable) {
+  while (true) {
+    const { done, value } = iterable.next();
+    if (done) {
+      return;
+    }
+    yield value;
+  }
+}
+export async function* toAsyncIterable(input) {
+  for (let item of input) {
+    yield item;
+  }
+}
+export function* batch(input, batchSize) {
+  while (true) {
+    let batch2 = [];
+    for (let item of input) {
+      batch2.push(item);
+      if (batch2.length >= batchSize) {
+        break;
+      }
+    }
+    if (batch2.length === 0) {
+      return;
+    }
+    yield batch2;
+  }
+}
+//# sourceMappingURL=iterators.js.map

package/dist/esm/parser/iterators.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../parser/iterators.ts"],
+  "sourcesContent": ["\r\n/**\r\n * Defines an interface that represents an iterator that can be rewound.\r\n */\r\nexport interface RewindableIterator<T> extends IterableIterator<T> {\r\n    /**\r\n     * Rewinds the iterator by the specified number of elements.\r\n     * @param number The number of elements to rewind.\r\n     */\r\n    rewind(number: number): void;\r\n}\r\n\r\n/**\r\n * Defines a class that implements an iterator that can be rewound.\r\n */\r\nexport class Rewindable<T> implements RewindableIterator<T> {\r\n    buffer: T[] = [];\r\n\r\n    private _bufferSize: number = 0;\r\n    private _position: number = -1;\r\n    private _iterator: IterableIterator<T>;\r\n\r\n    constructor(iterator: IterableIterator<T>, bufferSize: number = 2) {\r\n        this._iterator = iterator;\r\n        this._bufferSize = bufferSize;\r\n\r\n        if(this._iterator.return) {\r\n            this.return = (value?: any) => {\r\n                return this._iterator.return!(value);\r\n            };\r\n        }\r\n        if(this._iterator.throw) {\r\n            this.throw = (value?: any) => {\r\n                return this._iterator.throw!(value);\r\n            };\r\n        }\r\n    }\r\n\r\n    rewind(number: number): void {\r\n        this._position += number;\r\n    }\r\n\r\n    [Symbol.iterator](): IterableIterator<T> {\r\n        return this;\r\n    }\r\n\r\n    next(...args: [] | [undefined]): IteratorResult<T, any> {\r\n        if (this._position >= 0) {\r\n            let item = this.buffer[this._position];\r\n            this._position--;\r\n            return {\r\n                value: item,\r\n                done: false\r\n            };\r\n        }\r\n\r\n        let result = this._iterator.next(...args);\r\n        this.buffer.unshift(result.value);\r\n        if (this.buffer.length > this._bufferSize) {\r\n            this.buffer.splice(this._bufferSize, this.buffer.length - this._bufferSize);\r\n        }\r\n        return result;\r\n    }\r\n\r\n    return?(value?: any): IteratorResult<T, any>;\r\n    throw?(e?: any): IteratorResult<T, any>;\r\n}\r\n\r\nexport function *debug(label: string, iterator: IterableIterator<any>) {\r\n    for (let value of uncompletable(iterator)) {\r\n        if (value instanceof Element) {\r\n            console.log(label, value.outerHTML);\r\n        } else if(value instanceof Node) {\r\n            console.log(label, value.textContent);\r\n        } else {\r\n            console.log(label, value);\r\n        }\r\n        yield value;\r\n    }\r\n}\r\n\r\n/**\r\n * Creates a new rewindable iterator from the given iterator.\r\n * @param iterator The iterator.\r\n * @param bufferSize The size of the buffer.\r\n */\r\nexport function rewindable<T>(iterator: IterableIterator<T>, bufferSize: number = 2): Rewindable<T> {\r\n    return new Rewindable(iterator, bufferSize);\r\n}\r\n\r\n\r\nfunction *iterateNodes(node: Node) {\r\n    for(let i = 0; i < node.childNodes.length; i++) {\r\n        yield node.childNodes[i];\r\n    }\r\n}\r\n\r\n/**\r\n * Gets the char element that is the parent of the given node.\r\n * @param node The node.\r\n */\r\nexport function parentChar(node: Node): Element | null {\r\n    return matchingParent(node, n => n instanceof Element && n.nodeName === 'char') as Element | null;\r\n}\r\n\r\n/**\r\n * Gets the note element that is the parent of the given node.\r\n * @param node The node.\r\n */\r\nexport function parentNote(node: Node): Element | null {\r\n    return matchingParent(node, n => n instanceof Element && n.nodeName === 'note') as Element | null;\r\n}\r\n\r\n/**\r\n * Gets the parent node that matches the given filter.\r\n * @param node The node to start the search from.\r\n * @param filter The filter that should be used.\r\n */\r\nexport function matchingParent(node: Node, filter: (node: Node) => boolean): Node | null {\r\n    let parent = node.parentNode;\r\n    while(parent) {\r\n        if (filter(parent)) {\r\n            return parent;\r\n        }\r\n        parent = parent.parentNode;\r\n    }\r\n    return null;\r\n}\r\n\r\n/**\r\n * Determines if the given node is a child of the parent node.\r\n * @param node The node to test.\r\n * @param parent The parent.\r\n * @returns \r\n */\r\nexport function isParent(node: Node, parent: Node): boolean {\r\n    let parentNode = node.parentNode;\r\n    while(parentNode) {\r\n        if (parentNode === parent) {\r\n            return true;\r\n        }\r\n        parentNode = parentNode.parentNode;\r\n    }\r\n    return false;\r\n}\r\n\r\n/**\r\n * Iterates through all of the nodes in the tree in a depth-first traversal.\r\n * @param node The node to start the traversal from. \r\n */\r\nexport function iterateAll(node: Node): RewindableIterator<Node> {\r\n    return rewindable(_iterateAll(node));\r\n}\r\n\r\nexport function *iterateUntil<T>(iterator: IterableIterator<T>, predicate: (value: T) => boolean): IterableIterator<T> {\r\n    for(let value of iterator) {\r\n        if (predicate(value)) {\r\n            return;\r\n        }\r\n        yield value;\r\n    }\r\n}\r\n\r\nfunction *_iterateAll(node: Node): IterableIterator<Node> {\r\n    for(let child of node.childNodes) {\r\n        yield child;\r\n        yield *iterateAll(child);\r\n    }\r\n}\r\n\r\n/**\r\n * Iterates only the elements in the iterator.\r\n * @param iterator The iterator that should be used.\r\n */\r\nexport function *elements(iterator: IterableIterator<Node>): IterableIterator<Element> {\r\n    for (let node of uncompletable(iterator)) {\r\n        if (node instanceof Element) {\r\n            yield node;\r\n        }\r\n    }\r\n}\r\n\r\n/**\r\n * Iterates only the children of the given node in the iterator.\r\n * @param iterator The iterator that should be used.\r\n * @param parent The parent node.\r\n */\r\nexport function *children(iterator: RewindableIterator<Node>, parent: Node): IterableIterator<Node> {\r\n    for (let node of uncompletable(iterator)) {\r\n        if (!isParent(node, parent)) {\r\n            iterator.rewind(1);\r\n            return;\r\n        }\r\n\r\n        yield node;\r\n    }\r\n}\r\n\r\n/**\r\n * Wraps the given iterable in a generator that will prevent consumers from calling return() on the iterator.\r\n * @param iterable The iterable.\r\n */\r\nexport function *uncompletable<T>(iterable: IterableIterator<T>): IterableIterator<T> {\r\n    while(true) {\r\n        const { done, value } = iterable.next();\r\n        if (done) {\r\n            return;\r\n        }\r\n        yield value;\r\n    }\r\n}\r\n\r\n/**\r\n * Converts the given iterable into an async iterable.\r\n * @param input The input iterable.\r\n */\r\nexport async function *toAsyncIterable<T>(input: Iterable<T>): AsyncIterable<T> {\r\n    for (let item of input) {\r\n        yield item;\r\n    }\r\n}\r\n\r\n/**\r\n * Batches items from the given iterator.\r\n * @param input The input iterator.\r\n * @param batchSize The size of each batch.\r\n */\r\nexport function* batch<T>(input: Iterable<T>, batchSize: number): Iterable<T[]> {\r\n    while(true) {\r\n        let batch = [] as T[];\r\n        for (let item of input) {\r\n            batch.push(item);\r\n            if (batch.length >= batchSize) {\r\n                break;\r\n            }\r\n        }\r\n\r\n        if (batch.length === 0) {\r\n            return;\r\n        }\r\n\r\n        yield batch;\r\n    }\r\n}"],
+  "mappings": ";AAeO,aAAM,WAA+C;AAAA,EACxD,SAAc,CAAC;AAAA,EAEP,cAAsB;AAAA,EACtB,YAAoB;AAAA,EACpB;AAAA,EAER,YAAY,UAA+B,aAAqB,GAAG;AAC/D,SAAK,YAAY;AACjB,SAAK,cAAc;AAEnB,QAAG,KAAK,UAAU,QAAQ;AACtB,WAAK,SAAS,CAAC,UAAgB;AAC3B,eAAO,KAAK,UAAU,OAAQ,KAAK;AAAA,MACvC;AAAA,IACJ;AACA,QAAG,KAAK,UAAU,OAAO;AACrB,WAAK,QAAQ,CAAC,UAAgB;AAC1B,eAAO,KAAK,UAAU,MAAO,KAAK;AAAA,MACtC;AAAA,IACJ;AAAA,EACJ;AAAA,EAEA,OAAO,QAAsB;AACzB,SAAK,aAAa;AAAA,EACtB;AAAA,EAEA,CAAC,OAAO,QAAQ,IAAyB;AACrC,WAAO;AAAA,EACX;AAAA,EAEA,QAAQ,MAAgD;AACpD,QAAI,KAAK,aAAa,GAAG;AACrB,UAAI,OAAO,KAAK,OAAO,KAAK,SAAS;AACrC,WAAK;AACL,aAAO;AAAA,QACH,OAAO;AAAA,QACP,MAAM;AAAA,MACV;AAAA,IACJ;AAEA,QAAI,SAAS,KAAK,UAAU,KAAK,GAAG,IAAI;AACxC,SAAK,OAAO,QAAQ,OAAO,KAAK;AAChC,QAAI,KAAK,OAAO,SAAS,KAAK,aAAa;AACvC,WAAK,OAAO,OAAO,KAAK,aAAa,KAAK,OAAO,SAAS,KAAK,WAAW;AAAA,IAC9E;AACA,WAAO;AAAA,EACX;AAIJ;AAEO,iBAAU,MAAM,OAAe,UAAiC;AACnE,WAAS,SAAS,cAAc,QAAQ,GAAG;AACvC,QAAI,iBAAiB,SAAS;AAC1B,cAAQ,IAAI,OAAO,MAAM,SAAS;AAAA,IACtC,WAAU,iBAAiB,MAAM;AAC7B,cAAQ,IAAI,OAAO,MAAM,WAAW;AAAA,IACxC,OAAO;AACH,cAAQ,IAAI,OAAO,KAAK;AAAA,IAC5B;AACA,UAAM;AAAA,EACV;AACJ;AAOO,gBAAS,WAAc,UAA+B,aAAqB,GAAkB;AAChG,SAAO,IAAI,WAAW,UAAU,UAAU;AAC9C;AAGA,UAAU,aAAa,MAAY;AAC/B,WAAQ,IAAI,GAAG,IAAI,KAAK,WAAW,QAAQ,KAAK;AAC5C,UAAM,KAAK,WAAW,CAAC;AAAA,EAC3B;AACJ;AAMO,gBAAS,WAAW,MAA4B;AACnD,SAAO,eAAe,MAAM,OAAK,aAAa,WAAW,EAAE,aAAa,MAAM;AAClF;AAMO,gBAAS,WAAW,MAA4B;AACnD,SAAO,eAAe,MAAM,OAAK,aAAa,WAAW,EAAE,aAAa,MAAM;AAClF;AAOO,gBAAS,eAAe,MAAY,QAA8C;AACrF,MAAI,SAAS,KAAK;AAClB,SAAM,QAAQ;AACV,QAAI,OAAO,MAAM,GAAG;AAChB,aAAO;AAAA,IACX;AACA,aAAS,OAAO;AAAA,EACpB;AACA,SAAO;AACX;AAQO,gBAAS,SAAS,MAAY,QAAuB;AACxD,MAAI,aAAa,KAAK;AACtB,SAAM,YAAY;AACd,QAAI,eAAe,QAAQ;AACvB,aAAO;AAAA,IACX;AACA,iBAAa,WAAW;AAAA,EAC5B;AACA,SAAO;AACX;AAMO,gBAAS,WAAW,MAAsC;AAC7D,SAAO,WAAW,YAAY,IAAI,CAAC;AACvC;AAEO,iBAAU,aAAgB,UAA+B,WAAuD;AACnH,WAAQ,SAAS,UAAU;AACvB,QAAI,UAAU,KAAK,GAAG;AAClB;AAAA,IACJ;AACA,UAAM;AAAA,EACV;AACJ;AAEA,UAAU,YAAY,MAAoC;AACtD,WAAQ,SAAS,KAAK,YAAY;AAC9B,UAAM;AACN,WAAO,WAAW,KAAK;AAAA,EAC3B;AACJ;AAMO,iBAAU,SAAS,UAA6D;AACnF,WAAS,QAAQ,cAAc,QAAQ,GAAG;AACtC,QAAI,gBAAgB,SAAS;AACzB,YAAM;AAAA,IACV;AAAA,EACJ;AACJ;AAOO,iBAAU,SAAS,UAAoC,QAAsC;AAChG,WAAS,QAAQ,cAAc,QAAQ,GAAG;AACtC,QAAI,CAAC,SAAS,MAAM,MAAM,GAAG;AACzB,eAAS,OAAO,CAAC;AACjB;AAAA,IACJ;AAEA,UAAM;AAAA,EACV;AACJ;AAMO,iBAAU,cAAiB,UAAoD;AAClF,SAAM,MAAM;AACR,UAAM,EAAE,MAAM,MAAM,IAAI,SAAS,KAAK;AACtC,QAAI,MAAM;AACN;AAAA,IACJ;AACA,UAAM;AAAA,EACV;AACJ;AAMA,uBAAuB,gBAAmB,OAAsC;AAC5E,WAAS,QAAQ,OAAO;AACpB,UAAM;AAAA,EACV;AACJ;AAOO,iBAAU,MAAS,OAAoB,WAAkC;AAC5E,SAAM,MAAM;AACR,QAAIA,SAAQ,CAAC;AACb,aAAS,QAAQ,OAAO;AACpB,MAAAA,OAAM,KAAK,IAAI;AACf,UAAIA,OAAM,UAAU,WAAW;AAC3B;AAAA,MACJ;AAAA,IACJ;AAEA,QAAIA,OAAM,WAAW,GAAG;AACpB;AAAA,IACJ;AAEA,UAAMA;AAAA,EACV;AACJ;",
+  "names": ["batch"]
+}

package/dist/esm/parser/types.js

@@ -0,0 +1,2 @@
+"use strict";
+//# sourceMappingURL=types.js.map

package/dist/esm/parser/types.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": [],
+  "sourcesContent": [],
+  "mappings": "",
+  "names": []
+}