@kerebron/tree-sitter 0.5.5 → 0.6.1

package/README.md

@@ -1,4 +1,3 @@
 Project [deno-tree-sitter](https://github.com/jeff-hykin/deno-tree-sitter/) contains several patches and extensions over
 web-tree-sitter. Unfortunately deno-tree-sitter is not available as npm package and cannot be used with nodejs.
-Therefor we add it as submodule and package inside @kerebron/tree-sitter
-
+Therefor we add fork and refactor it.

package/esm/{deno-tree-sitter/main/extended → extended}/base_node.d.ts

@@ -1,17 +1,17 @@
-export const _shadows: {};
-export class BaseNode {
+export declare const _shadows: {};
+export declare class BaseNode {
     constructor(data: any);
     /** @type {number} */
-    get depth(): number;
-    _depth: any;
+    get depth(): any;
     /** @type {number} */
-    get length(): number;
+    get length(): any;
+    [Symbol.iterator](): Generator<any, void, any>;
     get hasChildren(): boolean;
     get hardChildren(): any;
     get fields(): {};
     get fieldNames(): never[];
     /** @type {string} */
-    get indent(): string;
+    get indent(): any;
     /** @type {Object} */
     toJSON(): {
         children: any;
@@ -21,8 +21,7 @@ export class BaseNode {
         startPosition: any;
         startIndex: any;
         endPosition: any;
-        endIndex: any;
-        indent: string;
+        indent: any;
     } | {
         text: any;
         children: never[];
@@ -32,8 +31,7 @@ export class BaseNode {
         startPosition: any;
         startIndex: any;
         endPosition: any;
-        endIndex: any;
-        indent: string;
+        indent: any;
     };
     iterFlattened(): Generator<never, void, unknown>;
     flattened(): never[];
@@ -42,7 +40,6 @@ export class BaseNode {
      *
      * @param {string} replacement - description
      */
-    replaceInnards(replacement: string): void;
-    [Symbol.iterator](): Generator<any, void, any>;
+    replaceInnards(replacement: any): void;
 }
 //# sourceMappingURL=base_node.d.ts.map

package/esm/extended/base_node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"base_node.d.ts","sourceRoot":"","sources":["../../src/extended/base_node.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,QAAQ,IAAK,CAAC;AAC3B,qBAAa,QAAQ;gBAUP,IAAI,KAAA;IAIhB,qBAAqB;IACrB,IAAI,KAAK,QASR;IAED,qBAAqB;IACrB,IAAI,MAAM,QAET;IAEA,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIlB,IAAI,WAAW,YAEd;IAED,IAAI,YAAY,QAEf;IAED,IAAI,MAAM,OAET;IAED,IAAI,UAAU,YAEb;IAED,qBAAqB;IACrB,IAAI,MAAM,QAMT;IAED,qBAAqB;IACrB,MAAM;;;;;;;;;;;;;;;;;;;;IA4DL,aAAa;IAEd,SAAS;IAIT;;;;OAIG;IACH,cAAc,CAAC,WAAW,KAAA;CAuC3B"}

package/esm/{deno-tree-sitter/main/extended → extended}/base_node.js

@@ -1,4 +1,4 @@
-import { Node } from "../tree_sitter/node.js";
+import { Node } from 'web-tree-sitter';
 export const _shadows = {};
 export class BaseNode {
     // type = ""
@@ -35,7 +35,7 @@ export class BaseNode {
         return (this.children?.length || 0) > 0;
     }
     get hardChildren() {
-        return (this.children || []).filter(each => each instanceof Node);
+        return (this.children || []).filter((each) => each instanceof Node);
     }
     get fields() {
         return {};
@@ -60,11 +60,9 @@ export class BaseNode {
                 startPosition: this.startPosition,
                 startIndex: this.startIndex,
                 endPosition: this.endPosition,
-                startIndex: this.startIndex,
-                endIndex: this.endIndex,
                 indent: this.indent,
                 ...optionalData,
-                children: this.children.map(each => each.toJSON()),
+                children: this.children.map((each) => each.toJSON()),
             };
         }
         else {
@@ -75,8 +73,6 @@ export class BaseNode {
                 startPosition: this.startPosition,
                 startIndex: this.startIndex,
                 endPosition: this.endPosition,
-                startIndex: this.startIndex,
-                endIndex: this.endIndex,
                 indent: this.indent,
                 ...optionalData,
                 text: this.text,
@@ -84,7 +80,7 @@ export class BaseNode {
             };
         }
     }
-    [Symbol.for("Deno.customInspect")](inspect, options) {
+    [Symbol.for('Deno.customInspect')](inspect, options) {
         const optional = {};
         let text;
         try {
@@ -97,15 +93,15 @@ export class BaseNode {
             return this;
         }
         return inspect({
-            '': text.length < 60 ? text : text.slice(0, 30) + "..." + text.slice(-27),
+            '': text.length < 60
+                ? text
+                : text.slice(0, 30) + '...' + text.slice(-27),
             type: this.type,
             typeId: this.typeId,
             fieldNames: this.fieldNames,
             startPosition: this.startPosition,
             startIndex: this.startIndex,
             endPosition: this.endPosition,
-            startIndex: this.startIndex,
-            endIndex: this.endIndex,
             indent: this.indent,
             ...optional,
             hasChildren: this.hasChildren,
@@ -138,7 +134,7 @@ export class BaseNode {
             newEndCol = originalStart.column + replacement.length;
         }
         else {
-            newEndCol = replacement.split("\n").slice(-1)[0].length;
+            newEndCol = replacement.split('\n').slice(-1)[0].length;
         }
         // updates all the indices of all the nodes
         tree.edit({
@@ -147,9 +143,13 @@ export class BaseNode {
             newEndIndex: originalStartIndex + replacement.length,
             startPosition: originalStart,
             oldEndPosition: originalEnd,
-            newEndPosition: { row: originalStart.row + newNumberOfLines, column: newEndCol },
+            newEndPosition: {
+                row: originalStart.row + newNumberOfLines,
+                column: newEndCol,
+            },
         });
-        this.tree.codeString = sourceCode.slice(0, originalStartIndex) + replacement + sourceCode.slice(originalEndIndex);
+        this.tree.codeString = sourceCode.slice(0, originalStartIndex) +
+            replacement + sourceCode.slice(originalEndIndex);
     }
 }
 //# sourceMappingURL=base_node.js.map

package/esm/extended/base_node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base_node.js","sourceRoot":"","sources":["../../src/extended/base_node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAEvC,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,CAAC;AAC3B,MAAM,OAAO,QAAQ;IACnB,YAAY;IACZ,aAAa;IACb,oBAAoB;IACpB,iBAAiB;IACjB,kBAAkB;IAClB,iBAAiB;IACjB,eAAe;IACf,cAAc;IAEd,YAAY,IAAI;QACd,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,qBAAqB;IACrB,IAAI,KAAK;QACP,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,qBAAqB;IACrB,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,IAAI,WAAW;QACb,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,YAAY;QACd,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,YAAY,IAAI,CAAC,CAAC;IACtE,CAAC;IAED,IAAI,MAAM;QACR,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qBAAqB;IACrB,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAC/B,IAAI,MAAM,CAAC,kBAAkB,IAAI,CAAC,aAAa,CAAC,GAAG,SAAS,CAAC,CAC9D,CAAC,CAAC,CAAC,CAAC;QACL,sCAAsC;QACtC,mFAAmF;IACrF,CAAC;IAED,qBAAqB;IACrB,MAAM;QACJ,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC;YAC1B,OAAO;gBACL,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,GAAG,YAAY;gBACf,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;aACrD,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,OAAO;gBACL,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,GAAG,YAAY;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,EAAE;aACb,CAAC;QACJ,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO;QACjD,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC;QACT,IAAI,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,IAAI,IAAI,SAAS,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CACZ;YACE,EAAE,EAAE,IAAI,CAAC,MAAM,GAAG,EAAE;gBAClB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/C,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,GAAG,QAAQ;YACX,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,QAAQ,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;SACrC,EACD,OAAO,CACR,CAAC;IACJ,CAAC;IACD,CAAC,aAAa;IACd,CAAC;IACD,SAAS;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,WAAW;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;QACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;QACvC,sDAAsD;QACtD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,6BAA6B;QAC7B,MAAM,EACJ,aAAa,EAAE,aAAa,EAC5B,WAAW,EAAE,WAAW,EACxB,UAAU,EAAE,kBAAkB,EAC9B,QAAQ,EAAE,gBAAgB,GAC3B,GAAG,IAAI,CAAC;QAET,0CAA0C;QAC1C,MAAM,gBAAgB,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QAC/D,IAAI,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC;QACrC,IAAI,gBAAgB,IAAI,CAAC,EAAE,CAAC;YAC1B,SAAS,GAAG,aAAa,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QACxD,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1D,CAAC;QACD,2CAA2C;QAC3C,IAAI,CAAC,IAAI,CAAC;YACR,UAAU,EAAE,kBAAkB;YAC9B,WAAW,EAAE,gBAAgB;YAC7B,WAAW,EAAE,kBAAkB,GAAG,WAAW,CAAC,MAAM;YACpD,aAAa,EAAE,aAAa;YAC5B,cAAc,EAAE,WAAW;YAC3B,cAAc,EAAE;gBACd,GAAG,EAAE,aAAa,CAAC,GAAG,GAAG,gBAAgB;gBACzC,MAAM,EAAE,SAAS;aAClB;SACF,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC;YAC5D,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;IACrD,CAAC;CACF"}

package/esm/extended/node_extended.d.ts

@@ -0,0 +1,243 @@
+import { Node } from 'web-tree-sitter';
+import { Tree } from 'web-tree-sitter';
+import { BaseNode } from './base_node.js';
+export declare class ExtendedTree extends Tree {
+    /** @type {HardNode} */
+    rootNode: any;
+}
+export declare class HardNode extends BaseNode {
+    /** @internal */
+    _children: any;
+    /** @internal */
+    _fields: any;
+    /** @internal */
+    _depth: any;
+    /** @type {number} */
+    id: any;
+    /** @type {number} */
+    startIndex: any;
+    /** @type {Position} */
+    startPosition: any;
+    /** @type {ExtendedTree} */
+    tree: any;
+    /** @type {string} */
+    type: any;
+    /** @type {Boolean} */
+    isExtra: any;
+    /** @type {Boolean} */
+    isError: any;
+    /** @type {Boolean} */
+    isMissing: any;
+    /** @type {Boolean} */
+    hasChanges: any;
+    /** @type {Boolean} */
+    hasError: any;
+    /**
+     * @param {HardNode} other -
+     * @returns {Boolean} output -
+     */
+    equals: ((other: Node) => boolean) | undefined;
+    /** @type {HardNode} */
+    get parent(): any;
+    /** @type {string} */
+    get text(): string;
+    /** @type {Number} */
+    get endIndex(): any;
+    /** @type {Position} */
+    get endPosition(): {
+        row: any;
+        column: any;
+    };
+    /** @type {Array<HardNode|SoftNode>} */
+    get children(): any;
+    set children(value: any);
+    /**
+     * Yields each child
+     *
+     * @generator
+     * @yields {HardNode} The current child or grandchild in the structure.
+     */
+    traverse(arg?: {
+        _parentNodes: never[];
+    }): Generator<any, void, unknown>;
+    /**
+     * A generator function that flattens the hierarchical structure of `children` and their descendants.
+     * It yields each child and their flattened descendants recursively.
+     *
+     * @param {Function} opts.filter - A function to filter the flattened elements.
+     * @param {Boolean} opts.includeSelf -
+     * @generator
+     * @yields {HardNode} The current child or grandchild in the structure.
+     */
+    iterFlattened({ filter, includeSelf }?: {
+        includeSelf?: boolean | undefined;
+    }): Generator<any, void, unknown>;
+    /** @internal */
+    iterFlatten(): void;
+    /**
+     * Flattens the structure of `children` using the provided filter function.
+     * This method returns an array containing the flattened elements.
+     *
+     * @param {Function} opts.filter - A function to filter the flattened elements.
+     * @param {Boolean} opts.includeSelf -
+     * @returns {Array} An array containing the flattened elements that pass the filter.
+     */
+    flattened({ filter, includeSelf }?: {
+        includeSelf?: boolean | undefined;
+    }): any[];
+    /** @internal */
+    flatten(): void;
+    /**
+     * Query
+     *
+     * @example
+     * ```js
+     * import { createParser } from "https://deno.land/x/deno_tree_sitter/main/main.js"
+     * import javascript from "https://github.com/jeff-hykin/common_tree_sitter_languages/raw/4d8a6d34d7f6263ff570f333cdcf5ded6be89e3d/main/javascript.js"
+     * const parser = await createParser(javascript) // path or Uint8Array
+     * const tree = parser.parse('let a = 1;let b = 1;let c = 1;')
+     *
+     * tree.rootNode.query(`(identifier) @blahBlahBlah`, {matchLimit: 2})
+     * // returns:
+     * [
+     *   {
+     *     pattern: 0,
+     *     captures: [
+     *       {
+     *         name: "blahBlahBlah",
+     *         node: {
+     *           type: "identifier",
+     *           typeId: 1,
+     *           startPosition: { row: 0, column: 4 },
+     *           startIndex: 4,
+     *           endPosition: { row: 0, column: 5 },
+     *           endIndex: 5,
+     *           indent: undefined,
+     *           hasChildren: false,
+     *           children: []
+     *         }
+     *       }
+     *     ]
+     *   },
+     *   {
+     *     pattern: 0,
+     *     captures: [
+     *       {
+     *         name: "blahBlahBlah",
+     *         node: {
+     *           type: "identifier",
+     *           typeId: 1,
+     *           startPosition: { row: 0, column: 14 },
+     *           startIndex: 14,
+     *           endPosition: { row: 0, column: 15 },
+     *           endIndex: 15,
+     *           indent: undefined,
+     *           hasChildren: false,
+     *           children: []
+     *         }
+     *       }
+     *     ]
+     *   },
+     *   {
+     *     pattern: 0,
+     *     captures: [
+     *       {
+     *         name: "blahBlahBlah",
+     *         node: {
+     *           type: "identifier",
+     *           typeId: 1,
+     *           startPosition: { row: 0, column: 24 },
+     *           startIndex: 24,
+     *           endPosition: { row: 0, column: 25 },
+     *           endIndex: 25,
+     *           indent: undefined,
+     *           hasChildren: false,
+     *           children: []
+     *         }
+     *       }
+     *     ]
+     *   }
+     * ]
+     * ```
+     *
+     * @param {String} queryString - see https://tree-sitter.github.io/tree-sitter/using-parsers#query-syntax
+     * @param options.matchLimit - max number of results
+     * @param options.startPosition - {row: Number, column: number}
+     * @param options.endPosition - {row: Number, column: number}
+     * @param options.maxResultDepth - depth relative to the current node (1 = direct children, 2 = grandchildren, etc)
+     * @returns {[Object]} output
+     */
+    query(queryString: any, options: any): import("web-tree-sitter").QueryMatch[];
+    /**
+     * quickQuery
+     *
+     * @example
+     * ```js
+     * import { createParser } from "https://deno.land/x/deno_tree_sitter/main/main.js"
+     * import javascript from "https://github.com/jeff-hykin/common_tree_sitter_languages/raw/676ffa3b93768b8ac628fd5c61656f7dc41ba413/main/javascript.js"
+     * const parser = await createParser(javascript) // path or Uint8Array
+     * const tree = parser.parse('let a = 1;let b = 1;let c = 1;')
+     * // ex1: no capture names
+     * const nodes = tree.rootNode.quickQuery(
+     *     `(identifier)`, {matchLimit: 2}
+     * )
+     * // ex2: with capture names
+     * const groups = tree.rootNode.quickQuery(
+     *     `'(binding (attrpath) @myKey (list_expression) @myList ("\\"")? @optionalThing )`
+     * )
+     * groups[0].myKey // node
+     * groups[0].myList // node
+     * groups[0].optionalThing // node or null
+     * groups[0][0] // node (the whole match)
+     * ```
+     *
+     * @param {String} queryString - see https://tree-sitter.github.io/tree-sitter/using-parsers#query-syntax
+     * @param options.matchLimit - max number of results
+     * @param options.startPosition - {row: Number, column: number}
+     * @param options.endPosition - {row: Number, column: number}
+     * @param options.maxResultDepth - depth relative to the current node (1 = direct children, 2 = grandchildren, etc)
+     * @returns {Array<HardNode|Record<any, HardNode>>} nodesOrObjsOfNodes
+     */
+    quickQuery(queryString: any, options: any): (Node | {
+        [k: string]: Node;
+    })[];
+    /**
+     * quickQueryFirst
+     *
+     * @example
+     * ```js
+     * import { createParser } from "https://deno.land/x/deno_tree_sitter/main/main.js"
+     * import javascript from "https://github.com/jeff-hykin/common_tree_sitter_languages/raw/4d8a6d34d7f6263ff570f333cdcf5ded6be89e3d/main/javascript.js"
+     * const parser = await createParser(javascript) // path or Uint8Array
+     * const tree = parser.parse('let a = 1;let b = 1;let c = 1;')
+     *
+     * // ex1: no capture names
+     * const node = tree.rootNode.quickQueryFirst(`(identifier)`)
+     *
+     * // ex2: with capture names
+     * const { myKey, myList, optionalThing } = tree.rootNode.quickQueryFirst(
+     *     `'(binding (attrpath) @myKey (list_expression) @myList ("\\"")? @optionalThing )`
+     * )
+     * myKey // node
+     * myList // node
+     * optionalThing // node or null
+     * ```
+     *
+     * @param {String} queryString - see https://tree-sitter.github.io/tree-sitter/using-parsers#query-syntax
+     * @param options.startPosition - {row: Number, column: number}
+     * @param options.endPosition - {row: Number, column: number}
+     * @param options.maxResultDepth - depth relative to the current node (1 = direct children, 2 = grandchildren, etc)
+     * @returns {HardNode|Record<any,HardNode>|null} nodeOrObjOfNodes
+     */
+    quickQueryFirst(queryString: any, options: any): Node | {
+        [k: string]: Node;
+    };
+    get fields(): any;
+    get fieldNames(): string[];
+    getQueryForSelf(): string;
+    /** @returns {string} */
+    asLispString(): string;
+}
+export { Node };
+export declare const _childrenWithSoftNodes: (node: any, children: any, string: any) => any[] | undefined;
+//# sourceMappingURL=node_extended.d.ts.map

package/esm/extended/node_extended.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node_extended.d.ts","sourceRoot":"","sources":["../../src/extended/node_extended.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAGvC,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAEvC,OAAO,EAAY,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AA+DpD,qBAAa,YAAa,SAAQ,IAAI;IACpC,uBAAuB;IACvB,QAAQ,MAAC;CACV;AAmBD,qBAAa,QAAS,SAAQ,QAAQ;IACpC,gBAAgB;IAChB,SAAS,MAAC;IACV,gBAAgB;IAChB,OAAO,MAAC;IACR,gBAAgB;IAChB,MAAM,MAAC;IAEP,qBAAqB;IACrB,EAAE,MAAC;IACH,qBAAqB;IACrB,UAAU,MAAC;IACX,uBAAuB;IACvB,aAAa,MAAC;IACd,2BAA2B;IAC3B,IAAI,MAAC;IACL,qBAAqB;IACrB,IAAI,MAAC;IACL,sBAAsB;IACtB,OAAO,MAAC;IACR,sBAAsB;IACtB,OAAO,MAAC;IACR,sBAAsB;IACtB,SAAS,MAAC;IACV,sBAAsB;IACtB,UAAU,MAAC;IACX,sBAAsB;IACtB,QAAQ,MAAC;IACT;;;OAGG;IACH,MAAM,yCAAkB;IAExB,uBAAuB;IACvB,IAAI,MAAM,QAGT;IAED,qBAAqB;IACrB,IAAI,IAAI,WAEP;IAED,qBAAqB;IACrB,IAAI,QAAQ,QAKX;IAED,uBAAuB;IACvB,IAAI,WAAW;;;MASd;IAED,uCAAuC;IACvC,IAAI,QAAQ,QAcX;IAED,IAAI,QAAQ,CAAC,KAAK,KAAA,EAEjB;IAED;;;;;OAKG;IACF,QAAQ,CAAC,GAAG;;KAAuB;IAsBpC;;;;;;;;OAQG;IACF,aAAa,CAAC,EAAE,MAAM,EAAE,WAAmB,EAAE;;KAAK;IAuBnD,gBAAgB;IAChB,WAAW;IAIX;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,MAAM,EAAE,WAAmB,EAAE;;KAAK;IAG9C,gBAAgB;IAChB,OAAO;IAIP;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA+EG;IACH,KAAK,CAAC,WAAW,KAAA,EAAE,OAAO,KAAA;IA6C1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,UAAU,CAAC,WAAW,KAAA,EAAE,OAAO,KAAA;;;IA8B/B;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,eAAe,CAAC,WAAW,KAAA,EAAE,OAAO,KAAA;;;IAGpC,IAAI,MAAM,QAiBT;IACD,IAAI,UAAU,aAEb;IAED,eAAe;IAqBf,wBAAwB;IACxB,YAAY;CAGb;AASD,OAAO,EAAE,IAAI,EAAE,CAAC;AAGhB,eAAO,MAAM,sBAAsB,GAAI,SAAI,EAAE,aAAQ,EAAE,WAAM,sBAsH5D,CAAC"}