@kerebron/tree-sitter 0.5.5 → 0.6.0

package/esm/deno-tree-sitter/main/tree_sitter/lookahead_iterator.js

@@ -1,66 +0,0 @@
-import { C, assertInternal } from "./constants.js";
-import { Language } from "./language.js";
-export class LookaheadIterator {
-    /** @internal */
-    [0] = 0; // Internal handle for Wasm
-    /** @internal */
-    language;
-    /** @internal */
-    constructor(internal, address, language) {
-        assertInternal(internal);
-        this[0] = address;
-        this.language = language;
-    }
-    /** Get the current symbol of the lookahead iterator. */
-    get currentTypeId() {
-        return C._ts_lookahead_iterator_current_symbol(this[0]);
-    }
-    /** Get the current symbol name of the lookahead iterator. */
-    get currentType() {
-        return this.language.types[this.currentTypeId] || "ERROR";
-    }
-    /** Delete the lookahead iterator, freeing its resources. */
-    delete() {
-        C._ts_lookahead_iterator_delete(this[0]);
-        this[0] = 0;
-    }
-    /**
-     * Reset the lookahead iterator.
-     *
-     * This returns `true` if the language was set successfully and `false`
-     * otherwise.
-     */
-    reset(language, stateId) {
-        if (C._ts_lookahead_iterator_reset(this[0], language[0], stateId)) {
-            this.language = language;
-            return true;
-        }
-        return false;
-    }
-    /**
-     * Reset the lookahead iterator to another state.
-     *
-     * This returns `true` if the iterator was reset to the given state and
-     * `false` otherwise.
-     */
-    resetState(stateId) {
-        return Boolean(C._ts_lookahead_iterator_reset_state(this[0], stateId));
-    }
-    /**
-     * Returns an iterator that iterates over the symbols of the lookahead iterator.
-     *
-     * The iterator will yield the current symbol name as a string for each step
-     * until there are no more symbols to iterate over.
-     */
-    [Symbol.iterator]() {
-        return {
-            next: () => {
-                if (C._ts_lookahead_iterator_next(this[0])) {
-                    return { done: false, value: this.currentType };
-                }
-                return { done: true, value: "" };
-            },
-        };
-    }
-}
-//# sourceMappingURL=lookahead_iterator.js.map

package/esm/deno-tree-sitter/main/tree_sitter/lookahead_iterator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lookahead_iterator.js","sourceRoot":"","sources":["../../../../src/deno-tree-sitter/main/tree_sitter/lookahead_iterator.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAExC,MAAM,OAAO,iBAAiB;IAC1B,gBAAgB;IAChB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,2BAA2B;IAEnC,gBAAgB;IAChB,QAAQ,CAAA;IAER,gBAAgB;IAChB,YAAY,QAAQ,EAAE,OAAO,EAAE,QAAQ;QACnC,cAAc,CAAC,QAAQ,CAAC,CAAA;QACxB,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAA;QACjB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;IAC5B,CAAC;IAED,wDAAwD;IACxD,IAAI,aAAa;QACb,OAAO,CAAC,CAAC,qCAAqC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3D,CAAC;IAED,6DAA6D;IAC7D,IAAI,WAAW;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,OAAO,CAAA;IAC7D,CAAC;IAED,4DAA4D;IAC5D,MAAM;QACF,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACxC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,QAAQ,EAAE,OAAO;QACnB,IAAI,CAAC,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;YAChE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YACxB,OAAO,IAAI,CAAA;QACf,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,OAAO;QACd,OAAO,OAAO,CAAC,CAAC,CAAC,kCAAkC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;IAC1E,CAAC;IAED;;;;;OAKG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACb,OAAO;YACH,IAAI,EAAE,GAAG,EAAE;gBACP,IAAI,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAA;gBACnD,CAAC;gBACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAA;YACpC,CAAC;SACJ,CAAA;IACL,CAAC;CACJ"}

package/esm/deno-tree-sitter/main/tree_sitter/marshal.d.ts

@@ -1,85 +0,0 @@
-/**
- * @internal
- *
- * Unmarshals a {@link QueryMatch} to the transfer buffer.
- */
-export function unmarshalCaptures(query: any, tree: any, address: any, patternIndex: any, result: any): any;
-/**
- * @internal
- *
- * Marshals a {@link Node} to the transfer buffer.
- */
-export function marshalNode(node: any, index?: number): void;
-/**
- * @internal
- *
- * Unmarshals a {@link Node} from the transfer buffer.
- */
-export function unmarshalNode(tree: any, address?: any): any;
-/**
- * @internal
- *
- * Marshals a {@link TreeCursor} to the transfer buffer.
- */
-export function marshalTreeCursor(cursor: any, address?: any): void;
-/**
- * @internal
- *
- * Unmarshals a {@link TreeCursor} from the transfer buffer.
- */
-export function unmarshalTreeCursor(cursor: any): void;
-/**
- * @internal
- *
- * Marshals a {@link Point} to the transfer buffer.
- */
-export function marshalPoint(address: any, point: any): void;
-/**
- * @internal
- *
- * Unmarshals a {@link Point} from the transfer buffer.
- */
-export function unmarshalPoint(address: any): {
-    row: number;
-    column: number;
-};
-/**
- * @internal
- *
- * Marshals a {@link Range} to the transfer buffer.
- */
-export function marshalRange(address: any, range: any): void;
-/**
- * @internal
- *
- * Unmarshals a {@link Range} from the transfer buffer.
- */
-export function unmarshalRange(address: any): {
-    startPosition: {
-        row: number;
-        column: number;
-    };
-    endPosition: {
-        row: number;
-        column: number;
-    };
-    startIndex: number;
-    endIndex: number;
-};
-/**
- * @internal
- *
- * Marshals an {@link Edit} to the transfer buffer.
- */
-export function marshalEdit(edit: any, address?: any): void;
-/**
- * @internal
- *
- * Unmarshals a {@link LanguageMetadata} from the transfer buffer.
- */
-export function unmarshalLanguageMetadata(address: any): {
-    major_version: any;
-    minor_version: any;
-    field_count: any;
-};
-//# sourceMappingURL=marshal.d.ts.map

package/esm/deno-tree-sitter/main/tree_sitter/marshal.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"marshal.d.ts","sourceRoot":"","sources":["../../../../src/deno-tree-sitter/main/tree_sitter/marshal.js"],"names":[],"mappings":"AASA;;;;GAIG;AACH,4GASC;AAED;;;;GAIG;AACH,6DAWC;AAED;;;;GAIG;AACH,6DAsBC;AAED;;;;GAIG;AACH,oEAKC;AAED;;;;GAIG;AACH,uDAKC;AAED;;;;GAIG;AACH,6DAGC;AAED;;;;GAIG;AACH;;;EAMC;AAED;;;;GAIG;AACH,6DASC;AAED;;;;GAIG;AACH;;;;;;;;;;;EAUC;AAED;;;;GAIG;AACH,4DAaC;AAED;;;;GAIG;AACH;;;;EAQC"}

package/esm/deno-tree-sitter/main/tree_sitter/marshal.js

@@ -1,174 +0,0 @@
-import { INTERNAL, SIZE_OF_INT, SIZE_OF_NODE, SIZE_OF_POINT, C } from "./constants.js";
-import { Node } from "./node.js";
-import { Tree } from "./tree.js";
-// eslint-disable-next-line @typescript-eslint/no-unused-vars
-import { Query } from "./query.js";
-import { TreeCursor } from "./tree_cursor.js";
-import { TRANSFER_BUFFER } from "./parser.js";
-import { LanguageMetadata } from "./language.js";
-/**
- * @internal
- *
- * Unmarshals a {@link QueryMatch} to the transfer buffer.
- */
-export function unmarshalCaptures(query, tree, address, patternIndex, result) {
-    for (let i = 0, n = result.length; i < n; i++) {
-        const captureIndex = C.getValue(address, "i32");
-        address += SIZE_OF_INT;
-        const node = unmarshalNode(tree, address);
-        address += SIZE_OF_NODE;
-        result[i] = { patternIndex, name: query.captureNames[captureIndex], node };
-    }
-    return address;
-}
-/**
- * @internal
- *
- * Marshals a {@link Node} to the transfer buffer.
- */
-export function marshalNode(node, index = 0) {
-    let address = TRANSFER_BUFFER + index * SIZE_OF_NODE;
-    C.setValue(address, node.id, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, node.startIndex, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, node.startPosition.row, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, node.startPosition.column, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, node[0], "i32");
-}
-/**
- * @internal
- *
- * Unmarshals a {@link Node} from the transfer buffer.
- */
-export function unmarshalNode(tree, address = TRANSFER_BUFFER) {
-    const id = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    if (id === 0)
-        return null;
-    const index = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    const row = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    const column = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    const other = C.getValue(address, "i32");
-    const result = new Node(INTERNAL, {
-        id,
-        tree,
-        startIndex: index,
-        startPosition: { row, column },
-        other,
-    });
-    return result;
-}
-/**
- * @internal
- *
- * Marshals a {@link TreeCursor} to the transfer buffer.
- */
-export function marshalTreeCursor(cursor, address = TRANSFER_BUFFER) {
-    C.setValue(address + 0 * SIZE_OF_INT, cursor[0], "i32");
-    C.setValue(address + 1 * SIZE_OF_INT, cursor[1], "i32");
-    C.setValue(address + 2 * SIZE_OF_INT, cursor[2], "i32");
-    C.setValue(address + 3 * SIZE_OF_INT, cursor[3], "i32");
-}
-/**
- * @internal
- *
- * Unmarshals a {@link TreeCursor} from the transfer buffer.
- */
-export function unmarshalTreeCursor(cursor) {
-    cursor[0] = C.getValue(TRANSFER_BUFFER + 0 * SIZE_OF_INT, "i32");
-    cursor[1] = C.getValue(TRANSFER_BUFFER + 1 * SIZE_OF_INT, "i32");
-    cursor[2] = C.getValue(TRANSFER_BUFFER + 2 * SIZE_OF_INT, "i32");
-    cursor[3] = C.getValue(TRANSFER_BUFFER + 3 * SIZE_OF_INT, "i32");
-}
-/**
- * @internal
- *
- * Marshals a {@link Point} to the transfer buffer.
- */
-export function marshalPoint(address, point) {
-    C.setValue(address, point.row, "i32");
-    C.setValue(address + SIZE_OF_INT, point.column, "i32");
-}
-/**
- * @internal
- *
- * Unmarshals a {@link Point} from the transfer buffer.
- */
-export function unmarshalPoint(address) {
-    const result = {
-        row: C.getValue(address, "i32") >>> 0,
-        column: C.getValue(address + SIZE_OF_INT, "i32") >>> 0,
-    };
-    return result;
-}
-/**
- * @internal
- *
- * Marshals a {@link Range} to the transfer buffer.
- */
-export function marshalRange(address, range) {
-    marshalPoint(address, range.startPosition);
-    address += SIZE_OF_POINT;
-    marshalPoint(address, range.endPosition);
-    address += SIZE_OF_POINT;
-    C.setValue(address, range.startIndex, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, range.endIndex, "i32");
-    address += SIZE_OF_INT;
-}
-/**
- * @internal
- *
- * Unmarshals a {@link Range} from the transfer buffer.
- */
-export function unmarshalRange(address) {
-    const result = {};
-    result.startPosition = unmarshalPoint(address);
-    address += SIZE_OF_POINT;
-    result.endPosition = unmarshalPoint(address);
-    address += SIZE_OF_POINT;
-    result.startIndex = C.getValue(address, "i32") >>> 0;
-    address += SIZE_OF_INT;
-    result.endIndex = C.getValue(address, "i32") >>> 0;
-    return result;
-}
-/**
- * @internal
- *
- * Marshals an {@link Edit} to the transfer buffer.
- */
-export function marshalEdit(edit, address = TRANSFER_BUFFER) {
-    marshalPoint(address, edit.startPosition);
-    address += SIZE_OF_POINT;
-    marshalPoint(address, edit.oldEndPosition);
-    address += SIZE_OF_POINT;
-    marshalPoint(address, edit.newEndPosition);
-    address += SIZE_OF_POINT;
-    C.setValue(address, edit.startIndex, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, edit.oldEndIndex, "i32");
-    address += SIZE_OF_INT;
-    C.setValue(address, edit.newEndIndex, "i32");
-    address += SIZE_OF_INT;
-}
-/**
- * @internal
- *
- * Unmarshals a {@link LanguageMetadata} from the transfer buffer.
- */
-export function unmarshalLanguageMetadata(address) {
-    const result = {};
-    result.major_version = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    result.minor_version = C.getValue(address, "i32");
-    address += SIZE_OF_INT;
-    result.field_count = C.getValue(address, "i32");
-    return result;
-}
-//# sourceMappingURL=marshal.js.map

package/esm/deno-tree-sitter/main/tree_sitter/marshal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"marshal.js","sourceRoot":"","sources":["../../../../src/deno-tree-sitter/main/tree_sitter/marshal.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,gBAAgB,CAAA;AACtF,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,6DAA6D;AAC7D,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAA;AAEhD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,YAAY,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;QAC/C,OAAO,IAAI,WAAW,CAAA;QACtB,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;QACzC,OAAO,IAAI,YAAY,CAAA;QACvB,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,CAAA;IAC9E,CAAC;IACD,OAAO,OAAO,CAAA;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;IACvC,IAAI,OAAO,GAAG,eAAe,GAAG,KAAK,GAAG,YAAY,CAAA;IACpD,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;IACnC,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IAC3C,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAClD,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACrD,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AACvC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAI,EAAE,OAAO,GAAG,eAAe;IACzD,MAAM,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACrC,OAAO,IAAI,WAAW,CAAA;IACtB,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAEzB,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACxC,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACtC,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACzC,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE;QAC9B,EAAE;QACF,IAAI;QACJ,UAAU,EAAE,KAAK;QACjB,aAAa,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE;QAC9B,KAAK;KACR,CAAC,CAAA;IAEF,OAAO,MAAM,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAM,EAAE,OAAO,GAAG,eAAe;IAC/D,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACvD,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACvD,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACvD,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AAC3D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAM;IACtC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,eAAe,GAAG,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,CAAA;IAChE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,eAAe,GAAG,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,CAAA;IAChE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,eAAe,GAAG,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,CAAA;IAChE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,eAAe,GAAG,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,CAAA;AACpE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,OAAO,EAAE,KAAK;IACvC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC1D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAO;IAClC,MAAM,MAAM,GAAG;QACX,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC;QACrC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC;KACzD,CAAA;IACD,OAAO,MAAM,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,OAAO,EAAE,KAAK;IACvC,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,aAAa,CAAC,CAAA;IAC1C,OAAO,IAAI,aAAa,CAAA;IACxB,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,WAAW,CAAC,CAAA;IACxC,OAAO,IAAI,aAAa,CAAA;IACxB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IAC5C,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;IAC1C,OAAO,IAAI,WAAW,CAAA;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAO;IAClC,MAAM,MAAM,GAAG,EAAE,CAAA;IACjB,MAAM,CAAC,aAAa,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;IAC9C,OAAO,IAAI,aAAa,CAAA;IACxB,MAAM,CAAC,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,CAAA;IAC5C,OAAO,IAAI,aAAa,CAAA;IACxB,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IACpD,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IAClD,OAAO,MAAM,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAI,EAAE,OAAO,GAAG,eAAe;IACvD,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAA;IACzC,OAAO,IAAI,aAAa,CAAA;IACxB,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IAC1C,OAAO,IAAI,aAAa,CAAA;IACxB,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IAC1C,OAAO,IAAI,aAAa,CAAA;IACxB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IAC3C,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IAC5C,OAAO,IAAI,WAAW,CAAA;IACtB,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;IAC5C,OAAO,IAAI,WAAW,CAAA;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAO;IAC7C,MAAM,MAAM,GAAG,EAAE,CAAA;IACjB,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACjD,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACjD,OAAO,IAAI,WAAW,CAAA;IACtB,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IAC/C,OAAO,MAAM,CAAA;AACjB,CAAC"}

package/esm/deno-tree-sitter/main/tree_sitter/node.d.ts

@@ -1,260 +0,0 @@
-/** A single node within a syntax {@link Tree}. */
-export class Node {
-    /** @internal */
-    constructor(internal: any, { id, tree, startIndex, startPosition, other }: {
-        id: any;
-        tree: any;
-        startIndex: any;
-        startPosition: any;
-        other: any;
-    });
-    /** @internal */
-    0: number;
-    /** @internal */
-    _children: any;
-    /** @internal */
-    _namedChildren: any;
-    /**
-     * The numeric id for this node that is unique.
-     *
-     * Within a given syntax tree, no two nodes have the same id. However:
-     *
-     * * If a new tree is created based on an older tree, and a node from the old tree is reused in
-     *   the process, then that node will have the same id in both trees.
-     *
-     * * A node not marked as having changes does not guarantee it was reused.
-     *
-     * * If a node is marked as having changed in the old tree, it will not be reused.
-     */
-    id: any;
-    /** The tree that this node belongs to. */
-    tree: any;
-    /** The byte index where this node starts. */
-    startIndex: any;
-    /** The position where this node starts. */
-    startPosition: any;
-    /** Get this node's type as a numerical id. */
-    get typeId(): any;
-    /**
-     * Get the node's type as a numerical id as it appears in the grammar,
-     * ignoring aliases.
-     */
-    get grammarId(): any;
-    /** Get this node's type as a string. */
-    get type(): any;
-    /**
-     * Get this node's symbol name as it appears in the grammar, ignoring
-     * aliases as a string.
-     */
-    get grammarType(): any;
-    /**
-     * Check if this node is *named*.
-     *
-     * Named nodes correspond to named rules in the grammar, whereas
-     * *anonymous* nodes correspond to string literals in the grammar.
-     */
-    get isNamed(): boolean;
-    /**
-     * Check if this node is *extra*.
-     *
-     * Extra nodes represent things like comments, which are not required
-     * by the grammar, but can appear anywhere.
-     */
-    get isExtra(): boolean;
-    /**
-     * Check if this node represents a syntax error.
-     *
-     * Syntax errors represent parts of the code that could not be incorporated
-     * into a valid syntax tree.
-     */
-    get isError(): boolean;
-    /**
-     * Check if this node is *missing*.
-     *
-     * Missing nodes are inserted by the parser in order to recover from
-     * certain kinds of syntax errors.
-     */
-    get isMissing(): boolean;
-    /** Check if this node has been edited. */
-    get hasChanges(): boolean;
-    /**
-     * Check if this node represents a syntax error or contains any syntax
-     * errors anywhere within it.
-     */
-    get hasError(): boolean;
-    /** Get the byte index where this node ends. */
-    get endIndex(): any;
-    /** Get the position where this node ends. */
-    get endPosition(): {
-        row: number;
-        column: number;
-    };
-    /** Get the string content of this node. */
-    get text(): any;
-    /** Get this node's parse state. */
-    get parseState(): any;
-    /** Get the parse state after this node. */
-    get nextParseState(): any;
-    /** Check if this node is equal to another node. */
-    equals(other: any): boolean;
-    /**
-     * Get the node's child at the given index, where zero represents the first child.
-     *
-     * This method is fairly fast, but its cost is technically log(n), so if
-     * you might be iterating over a long list of children, you should use
-     * {@link Node#children} instead.
-     */
-    child(index: any): any;
-    /**
-     * Get this node's *named* child at the given index.
-     *
-     * See also {@link Node#isNamed}.
-     * This method is fairly fast, but its cost is technically log(n), so if
-     * you might be iterating over a long list of children, you should use
-     * {@link Node#namedChildren} instead.
-     */
-    namedChild(index: any): any;
-    /**
-     * Get this node's child with the given numerical field id.
-     *
-     * See also {@link Node#childForFieldName}. You can
-     * convert a field name to an id using {@link Language#fieldIdForName}.
-     */
-    childForFieldId(fieldId: any): any;
-    /**
-     * Get the first child with the given field name.
-     *
-     * If multiple children may have the same field name, access them using
-     * {@link Node#childrenForFieldName}.
-     */
-    childForFieldName(fieldName: any): any;
-    /** Get the field name of this node's child at the given index. */
-    fieldNameForChild(index: any): any;
-    /** Get the field name of this node's named child at the given index. */
-    fieldNameForNamedChild(index: any): any;
-    /**
-     * Get an array of this node's children with a given field name.
-     *
-     * See also {@link Node#children}.
-     */
-    childrenForFieldName(fieldName: any): any[];
-    /**
-     * Get an array of this node's children with a given field id.
-     *
-     * See also {@link Node#childrenForFieldName}.
-     */
-    childrenForFieldId(fieldId: any): any[];
-    /** Get the node's first child that contains or starts after the given byte offset. */
-    firstChildForIndex(index: any): any;
-    /** Get the node's first named child that contains or starts after the given byte offset. */
-    firstNamedChildForIndex(index: any): any;
-    /** Get this node's number of children. */
-    get childCount(): any;
-    /**
-     * Get this node's number of *named* children.
-     *
-     * See also {@link Node#isNamed}.
-     */
-    get namedChildCount(): any;
-    /** Get this node's first child. */
-    get firstChild(): any;
-    /**
-     * Get this node's first named child.
-     *
-     * See also {@link Node#isNamed}.
-     */
-    get firstNamedChild(): any;
-    /** Get this node's last child. */
-    get lastChild(): any;
-    /**
-     * Get this node's last named child.
-     *
-     * See also {@link Node#isNamed}.
-     */
-    get lastNamedChild(): any;
-    /**
-     * Iterate over this node's children.
-     *
-     * If you're walking the tree recursively, you may want to use the
-     * {@link TreeCursor} APIs directly instead.
-     */
-    get children(): any;
-    /**
-     * Iterate over this node's named children.
-     *
-     * See also {@link Node#children}.
-     */
-    get namedChildren(): any;
-    /**
-     * Get the descendants of this node that are the given type, or in the given types array.
-     *
-     * The types array should contain node type strings, which can be retrieved from {@link Language#types}.
-     *
-     * Additionally, a `startPosition` and `endPosition` can be passed in to restrict the search to a byte range.
-     */
-    descendantsOfType(types: any, startPosition?: {
-        row: number;
-        column: number;
-    }, endPosition?: {
-        row: number;
-        column: number;
-    }): any[];
-    /** Get this node's next sibling. */
-    get nextSibling(): any;
-    /** Get this node's previous sibling. */
-    get previousSibling(): any;
-    /**
-     * Get this node's next *named* sibling.
-     *
-     * See also {@link Node#isNamed}.
-     */
-    get nextNamedSibling(): any;
-    /**
-     * Get this node's previous *named* sibling.
-     *
-     * See also {@link Node#isNamed}.
-     */
-    get previousNamedSibling(): any;
-    /** Get the node's number of descendants, including one for the node itself. */
-    get descendantCount(): any;
-    /**
-     * Get this node's immediate parent.
-     * Prefer {@link Node#childWithDescendant} for iterating over this node's ancestors.
-     */
-    get parent(): any;
-    /**
-     * Get the node that contains `descendant`.
-     *
-     * Note that this can return `descendant` itself.
-     */
-    childWithDescendant(descendant: any): any;
-    /** Get the smallest node within this node that spans the given byte range. */
-    descendantForIndex(start: any, end?: any): any;
-    /** Get the smallest named node within this node that spans the given byte range. */
-    namedDescendantForIndex(start: any, end?: any): any;
-    /** Get the smallest node within this node that spans the given point range. */
-    descendantForPosition(start: any, end?: any): any;
-    /** Get the smallest named node within this node that spans the given point range. */
-    namedDescendantForPosition(start: any, end?: any): any;
-    /**
-     * Create a new {@link TreeCursor} starting from this node.
-     *
-     * Note that the given node is considered the root of the cursor,
-     * and the cursor cannot walk outside this node.
-     */
-    walk(): TreeCursor;
-    /**
-     * Edit this node to keep it in-sync with source code that has been edited.
-     *
-     * This function is only rarely needed. When you edit a syntax tree with
-     * the {@link Tree#edit} method, all of the nodes that you retrieve from
-     * the tree afterward will already reflect the edit. You only need to
-     * use {@link Node#edit} when you have a specific {@link Node} instance that
-     * you want to keep and continue to use after an edit.
-     */
-    edit(edit: any): void;
-    /** Get the S-expression representation of this node. */
-    toString(): any;
-}
-import { TreeCursor } from "./tree_cursor.js";
-//# sourceMappingURL=node.d.ts.map

package/esm/deno-tree-sitter/main/tree_sitter/node.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../../src/deno-tree-sitter/main/tree_sitter/node.js"],"names":[],"mappings":"AAQA,kDAAkD;AAClD;IAUI,gBAAgB;IAChB;;;;;;OAOC;IAjBD,gBAAgB;IAChB,UAAO;IAEP,gBAAgB;IAChB,eAAS;IAET,gBAAgB;IAChB,oBAAc;IAYd;;;;;;;;;;;OAWG;IACH,QAAE;IAQF,0CAA0C;IAC1C,UAAI;IAPJ,6CAA6C;IAC7C,gBAAU;IAEV,2CAA2C;IAC3C,mBAAa;IAKb,8CAA8C;IAC9C,kBAGC;IAED;;;OAGG;IACH,qBAGC;IAED,wCAAwC;IACxC,gBAEC;IAED;;;OAGG;IACH,uBAEC;IAED;;;;;OAKG;IACH,uBAGC;IAED;;;;;OAKG;IACH,uBAGC;IAED;;;;;OAKG;IACH,uBAGC;IAED;;;;;OAKG;IACH,yBAGC;IAED,0CAA0C;IAC1C,0BAGC;IAED;;;OAGG;IACH,wBAGC;IAED,+CAA+C;IAC/C,oBAGC;IAED,6CAA6C;IAC7C;;;MAIC;IAED,2CAA2C;IAC3C,gBAEC;IAED,mCAAmC;IACnC,sBAGC;IAED,2CAA2C;IAC3C,0BAGC;IAED,mDAAmD;IACnD,4BAEC;IAED;;;;;;OAMG;IACH,uBAIC;IAED;;;;;;;OAOG;IACH,4BAIC;IAED;;;;;OAKG;IACH,mCAIC;IAED;;;;;OAKG;IACH,uCAIC;IAED,kEAAkE;IAClE,mCAKC;IAED,wEAAwE;IACxE,wCAKC;IACD;;;;OAIG;IACH,4CAIC;IAED;;;;OAIG;IACH,wCAgBC;IAED,sFAAsF;IACtF,oCAMC;IAED,4FAA4F;IAC5F,yCAMC;IAED,0CAA0C;IAC1C,sBAGC;IAED;;;;OAIG;IACH,2BAGC;IAED,mCAAmC;IACnC,sBAEC;IAED;;;;OAIG;IACH,2BAEC;IAED,kCAAkC;IAClC,qBAEC;IAED;;;;OAIG;IACH,0BAEC;IAED;;;;;OAKG;IACH,oBAiBC;IAED;;;;OAIG;IACH,yBAiBC;IAED;;;;;;OAMG;IACH;;;;;;cA2CC;IAED,oCAAoC;IACpC,uBAIC;IAED,wCAAwC;IACxC,2BAIC;IAED;;;;OAIG;IACH,4BAIC;IAED;;;;OAIG;IACH,gCAIC;IAED,+EAA+E;IAC/E,2BAGC;IAED;;;OAGG;IACH,kBAIC;IAED;;;;OAIG;IACH,0CAKC;IAED,8EAA8E;IAC9E,+CAWC;IAED,oFAAoF;IACpF,oDAWC;IAED,+EAA+E;IAC/E,kDAWC;IAED,qFAAqF;IACrF,uDAWC;IAED;;;;;OAKG;IACH,mBAIC;IAED;;;;;;;;OAQG;IACH,sBA2BC;IAED,wDAAwD;IACxD,gBAMC;CACJ;2BArmB0B,kBAAkB"}