update interface button styles

node_modules/@lezer/common/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (C) 2018 by Marijn Haverbeke <marijn@haverbeke.berlin> and others
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

node_modules/@lezer/common/README.md

@@ -0,0 +1,14 @@
+# @lezer/common
+
+[ [**WEBSITE**](http://lezer.codemirror.net) | [**ISSUES**](https://github.com/lezer-parser/lezer/issues) | [**FORUM**](https://discuss.codemirror.net/c/lezer) | [**CHANGELOG**](https://github.com/lezer-parser/common/blob/master/CHANGELOG.md) ]
+
+[Lezer](https://lezer.codemirror.net/) is an incremental parser system
+intended for use in an editor or similar system.
+
+@lezer/common provides the syntax tree data structure and parser
+abstractions for Lezer parsers.
+
+Its programming interface is documented on [the
+website](https://lezer.codemirror.net/docs/ref/#common).
+
+This code is licensed under an MIT license.

node_modules/@lezer/common/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { DefaultBufferLength, NodeProp, MountedTree, NodePropSource, NodeType, NodeSet, Tree, TreeBuffer, SyntaxNode, SyntaxNodeRef, TreeCursor, BufferCursor, NodeWeakMap, IterMode } from "./tree";
+export { ChangedRange, TreeFragment, PartialParse, Parser, Input, ParseWrapper } from "./parse";
+export { NestedParse, parseMixed } from "./mix";

node_modules/@lezer/common/dist/mix.d.ts

@@ -0,0 +1,13 @@
+import { SyntaxNodeRef } from "./tree";
+import { Input, Parser, ParseWrapper } from "./parse";
+export interface NestedParse {
+    parser: Parser;
+    overlay?: readonly {
+        from: number;
+        to: number;
+    }[] | ((node: SyntaxNodeRef) => {
+        from: number;
+        to: number;
+    } | boolean);
+}
+export declare function parseMixed(nest: (node: SyntaxNodeRef, input: Input) => NestedParse | null): ParseWrapper;

node_modules/@lezer/common/dist/parse.d.ts

@@ -0,0 +1,48 @@
+import { Tree } from "./tree";
+export interface ChangedRange {
+    fromA: number;
+    toA: number;
+    fromB: number;
+    toB: number;
+}
+export declare class TreeFragment {
+    readonly from: number;
+    readonly to: number;
+    readonly tree: Tree;
+    readonly offset: number;
+    constructor(from: number, to: number, tree: Tree, offset: number, openStart?: boolean, openEnd?: boolean);
+    get openStart(): boolean;
+    get openEnd(): boolean;
+    static addTree(tree: Tree, fragments?: readonly TreeFragment[], partial?: boolean): readonly TreeFragment[];
+    static applyChanges(fragments: readonly TreeFragment[], changes: readonly ChangedRange[], minGap?: number): readonly TreeFragment[];
+}
+export interface PartialParse {
+    advance(): Tree | null;
+    readonly parsedPos: number;
+    stopAt(pos: number): void;
+    readonly stoppedAt: number | null;
+}
+export declare abstract class Parser {
+    abstract createParse(input: Input, fragments: readonly TreeFragment[], ranges: readonly {
+        from: number;
+        to: number;
+    }[]): PartialParse;
+    startParse(input: Input | string, fragments?: readonly TreeFragment[], ranges?: readonly {
+        from: number;
+        to: number;
+    }[]): PartialParse;
+    parse(input: Input | string, fragments?: readonly TreeFragment[], ranges?: readonly {
+        from: number;
+        to: number;
+    }[]): Tree;
+}
+export interface Input {
+    readonly length: number;
+    chunk(from: number): string;
+    readonly lineChunks: boolean;
+    read(from: number, to: number): string;
+}
+export type ParseWrapper = (inner: PartialParse, input: Input, fragments: readonly TreeFragment[], ranges: readonly {
+    from: number;
+    to: number;
+}[]) => PartialParse;

node_modules/@lezer/common/dist/tree.d.ts

@@ -0,0 +1,262 @@
+import { Parser } from "./parse";
+export declare const DefaultBufferLength = 1024;
+export declare class Range {
+    readonly from: number;
+    readonly to: number;
+    constructor(from: number, to: number);
+}
+export declare class NodeProp<T> {
+    perNode: boolean;
+    deserialize: (str: string) => T;
+    constructor(config?: {
+        deserialize?: (str: string) => T;
+        perNode?: boolean;
+    });
+    add(match: {
+        [selector: string]: T;
+    } | ((type: NodeType) => T | undefined)): NodePropSource;
+    static closedBy: NodeProp<readonly string[]>;
+    static openedBy: NodeProp<readonly string[]>;
+    static group: NodeProp<readonly string[]>;
+    static contextHash: NodeProp<number>;
+    static lookAhead: NodeProp<number>;
+    static mounted: NodeProp<MountedTree>;
+}
+export declare class MountedTree {
+    readonly tree: Tree;
+    readonly overlay: readonly {
+        from: number;
+        to: number;
+    }[] | null;
+    readonly parser: Parser;
+    constructor(tree: Tree, overlay: readonly {
+        from: number;
+        to: number;
+    }[] | null, parser: Parser);
+}
+export type NodePropSource = (type: NodeType) => null | [NodeProp<any>, any];
+export declare class NodeType {
+    readonly name: string;
+    readonly id: number;
+    static define(spec: {
+        id: number;
+        name?: string;
+        props?: readonly ([NodeProp<any>, any] | NodePropSource)[];
+        top?: boolean;
+        error?: boolean;
+        skipped?: boolean;
+    }): NodeType;
+    prop<T>(prop: NodeProp<T>): T | undefined;
+    get isTop(): boolean;
+    get isSkipped(): boolean;
+    get isError(): boolean;
+    get isAnonymous(): boolean;
+    is(name: string | number): boolean;
+    static none: NodeType;
+    static match<T>(map: {
+        [selector: string]: T;
+    }): (node: NodeType) => T | undefined;
+}
+export declare class NodeSet {
+    readonly types: readonly NodeType[];
+    constructor(types: readonly NodeType[]);
+    extend(...props: NodePropSource[]): NodeSet;
+}
+export declare enum IterMode {
+    ExcludeBuffers = 1,
+    IncludeAnonymous = 2,
+    IgnoreMounts = 4,
+    IgnoreOverlays = 8
+}
+export declare class Tree {
+    readonly type: NodeType;
+    readonly children: readonly (Tree | TreeBuffer)[];
+    readonly positions: readonly number[];
+    readonly length: number;
+    constructor(type: NodeType, children: readonly (Tree | TreeBuffer)[], positions: readonly number[], length: number, props?: readonly [NodeProp<any> | number, any][]);
+    static empty: Tree;
+    cursor(mode?: IterMode): TreeCursor;
+    cursorAt(pos: number, side?: -1 | 0 | 1, mode?: IterMode): TreeCursor;
+    get topNode(): SyntaxNode;
+    resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    iterate(spec: {
+        enter(node: SyntaxNodeRef): boolean | void;
+        leave?(node: SyntaxNodeRef): void;
+        from?: number;
+        to?: number;
+        mode?: IterMode;
+    }): void;
+    prop<T>(prop: NodeProp<T>): T | undefined;
+    get propValues(): readonly [NodeProp<any> | number, any][];
+    balance(config?: {
+        makeTree?: (children: readonly (Tree | TreeBuffer)[], positions: readonly number[], length: number) => Tree;
+    }): Tree;
+    static build(data: BuildData): Tree;
+}
+type BuildData = {
+    buffer: BufferCursor | readonly number[];
+    nodeSet: NodeSet;
+    topID: number;
+    start?: number;
+    bufferStart?: number;
+    length?: number;
+    maxBufferLength?: number;
+    reused?: readonly Tree[];
+    minRepeatType?: number;
+};
+export interface BufferCursor {
+    pos: number;
+    id: number;
+    start: number;
+    end: number;
+    size: number;
+    next(): void;
+    fork(): BufferCursor;
+}
+export declare class TreeBuffer {
+    readonly buffer: Uint16Array;
+    readonly length: number;
+    readonly set: NodeSet;
+    constructor(buffer: Uint16Array, length: number, set: NodeSet);
+}
+export interface SyntaxNodeRef {
+    readonly from: number;
+    readonly to: number;
+    readonly type: NodeType;
+    readonly name: string;
+    readonly tree: Tree | null;
+    readonly node: SyntaxNode;
+    matchContext(context: readonly string[]): boolean;
+}
+export interface SyntaxNode extends SyntaxNodeRef {
+    parent: SyntaxNode | null;
+    firstChild: SyntaxNode | null;
+    lastChild: SyntaxNode | null;
+    childAfter(pos: number): SyntaxNode | null;
+    childBefore(pos: number): SyntaxNode | null;
+    enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): SyntaxNode | null;
+    nextSibling: SyntaxNode | null;
+    prevSibling: SyntaxNode | null;
+    cursor(mode?: IterMode): TreeCursor;
+    resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    enterUnfinishedNodesBefore(pos: number): SyntaxNode;
+    toTree(): Tree;
+    getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode | null;
+    getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[];
+    matchContext(context: readonly string[]): boolean;
+}
+declare const enum Side {
+    Before = -2,
+    AtOrBefore = -1,
+    Around = 0,
+    AtOrAfter = 1,
+    After = 2,
+    DontCare = 4
+}
+export declare class TreeNode implements SyntaxNode {
+    readonly _tree: Tree;
+    readonly from: number;
+    readonly index: number;
+    readonly _parent: TreeNode | null;
+    constructor(_tree: Tree, from: number, index: number, _parent: TreeNode | null);
+    get type(): NodeType;
+    get name(): string;
+    get to(): number;
+    nextChild(i: number, dir: 1 | -1, pos: number, side: Side, mode?: IterMode): TreeNode | BufferNode | null;
+    get firstChild(): TreeNode | BufferNode;
+    get lastChild(): TreeNode | BufferNode;
+    childAfter(pos: number): TreeNode | BufferNode;
+    childBefore(pos: number): TreeNode | BufferNode;
+    enter(pos: number, side: -1 | 0 | 1, mode?: number): TreeNode | BufferNode;
+    nextSignificantParent(): TreeNode;
+    get parent(): TreeNode | null;
+    get nextSibling(): SyntaxNode | null;
+    get prevSibling(): SyntaxNode | null;
+    cursor(mode?: IterMode): TreeCursor;
+    get tree(): Tree;
+    toTree(): Tree;
+    resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    enterUnfinishedNodesBefore(pos: number): SyntaxNode;
+    getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode;
+    getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[];
+    get node(): this;
+    matchContext(context: readonly string[]): boolean;
+}
+declare class BufferContext {
+    readonly parent: TreeNode;
+    readonly buffer: TreeBuffer;
+    readonly index: number;
+    readonly start: number;
+    constructor(parent: TreeNode, buffer: TreeBuffer, index: number, start: number);
+}
+declare class BufferNode implements SyntaxNode {
+    readonly context: BufferContext;
+    readonly _parent: BufferNode | null;
+    readonly index: number;
+    type: NodeType;
+    get name(): string;
+    get from(): number;
+    get to(): number;
+    constructor(context: BufferContext, _parent: BufferNode | null, index: number);
+    child(dir: 1 | -1, pos: number, side: Side): BufferNode | null;
+    get firstChild(): BufferNode;
+    get lastChild(): BufferNode;
+    childAfter(pos: number): BufferNode;
+    childBefore(pos: number): BufferNode;
+    enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): BufferNode;
+    get parent(): SyntaxNode | null;
+    externalSibling(dir: 1 | -1): TreeNode | BufferNode;
+    get nextSibling(): SyntaxNode | null;
+    get prevSibling(): SyntaxNode | null;
+    cursor(mode?: IterMode): TreeCursor;
+    get tree(): any;
+    toTree(): Tree;
+    resolve(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    resolveInner(pos: number, side?: -1 | 0 | 1): SyntaxNode;
+    enterUnfinishedNodesBefore(pos: number): SyntaxNode;
+    getChild(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode;
+    getChildren(type: string | number, before?: string | number | null, after?: string | number | null): SyntaxNode[];
+    get node(): this;
+    matchContext(context: readonly string[]): boolean;
+}
+export declare class TreeCursor implements SyntaxNodeRef {
+    type: NodeType;
+    get name(): string;
+    from: number;
+    to: number;
+    private stack;
+    private bufferNode;
+    private yieldNode;
+    private yieldBuf;
+    private yield;
+    firstChild(): boolean;
+    lastChild(): boolean;
+    childAfter(pos: number): boolean;
+    childBefore(pos: number): boolean;
+    enter(pos: number, side: -1 | 0 | 1, mode?: IterMode): boolean;
+    parent(): boolean;
+    nextSibling(): boolean;
+    prevSibling(): boolean;
+    private atLastNode;
+    private move;
+    next(enter?: boolean): boolean;
+    prev(enter?: boolean): boolean;
+    moveTo(pos: number, side?: -1 | 0 | 1): this;
+    get node(): SyntaxNode;
+    get tree(): Tree | null;
+    iterate(enter: (node: SyntaxNodeRef) => boolean | void, leave?: (node: SyntaxNodeRef) => void): void;
+    matchContext(context: readonly string[]): boolean;
+}
+export declare class NodeWeakMap<T> {
+    private map;
+    private setBuffer;
+    private getBuffer;
+    set(node: SyntaxNode, value: T): void;
+    get(node: SyntaxNode): T | undefined;
+    cursorSet(cursor: TreeCursor, value: T): void;
+    cursorGet(cursor: TreeCursor): T | undefined;
+}
+export {};

node_modules/@lezer/common/package.json

@@ -0,0 +1,36 @@
+{
+  "name": "@lezer/common",
+  "version": "1.0.3",
+  "description": "Syntax tree data structure and parser interfaces for the lezer parser",
+  "main": "dist/index.cjs",
+  "type": "module",
+  "exports": {
+    "import": "./dist/index.js",
+    "require": "./dist/index.cjs"
+  },
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "author": "Marijn Haverbeke <marijn@haverbeke.berlin>",
+  "license": "MIT",
+  "devDependencies": {
+    "ist": "^1.1.1",
+    "rollup": "^2.52.2",
+    "@rollup/plugin-commonjs": "^15.1.0",
+    "@rollup/plugin-node-resolve": "^9.0.0",
+    "rollup-plugin-typescript2": "^0.34.1",
+    "typescript": "^4.3.4",
+    "@types/mocha": "^5.2.6",
+    "ts-node": "^10.0.0",
+    "mocha": "^9.0.1"
+  },
+  "files": ["dist"],
+  "repository": {
+    "type" : "git",
+    "url" : "https://github.com/lezer-parser/common.git"
+  },
+  "scripts": {
+    "watch": "rollup -w -c rollup.config.js",
+    "prepare": "rollup -c rollup.config.js",
+    "test": "mocha"
+  }
+}