@optimystic/db-core 0.0.1

package/dist/src/blocks/block-store.d.ts

@@ -0,0 +1,12 @@
+import type { BlockType, IBlock, BlockId, BlockHeader, BlockOperation } from "./index.js";
+export type BlockSource<T extends IBlock> = {
+    createBlockHeader(type: BlockType, newId?: BlockId): BlockHeader;
+    tryGet(id: BlockId): Promise<T | undefined>;
+    generateId(): BlockId;
+};
+export type BlockStore<T extends IBlock> = BlockSource<T> & {
+    insert(block: T): void;
+    update(blockId: BlockId, op: BlockOperation): void;
+    delete(blockId: BlockId): void;
+};
+//# sourceMappingURL=block-store.d.ts.map

package/dist/src/blocks/block-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"block-store.d.ts","sourceRoot":"","sources":["../../../src/blocks/block-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE1F,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,MAAM,IAAI;IAC3C,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,OAAO,GAAG,WAAW,CAAC;IACjE,MAAM,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5C,UAAU,IAAI,OAAO,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG;IAC3D,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACvB,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,cAAc,GAAG,IAAI,CAAC;IACnD,MAAM,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;CAC/B,CAAC"}

package/dist/src/blocks/block-store.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=block-store.js.map

package/dist/src/blocks/block-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"block-store.js","sourceRoot":"","sources":["../../../src/blocks/block-store.ts"],"names":[],"mappings":""}

package/dist/src/blocks/block-types.d.ts

@@ -0,0 +1,3 @@
+import type { BlockType } from ".";
+export declare function registerBlockType(blockType: BlockType, name: string): string;
+//# sourceMappingURL=block-types.d.ts.map

package/dist/src/blocks/block-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"block-types.d.ts","sourceRoot":"","sources":["../../../src/blocks/block-types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC;AAInC,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,UAMnE"}

package/dist/src/blocks/block-types.js

@@ -0,0 +1,9 @@
+const blockTypes = new Map();
+export function registerBlockType(blockType, name) {
+    if (blockTypes.has(blockType)) {
+        throw new Error(`Block type ${blockType} (${name}) already registered (${blockTypes.get(blockType)})`);
+    }
+    blockTypes.set(blockType, name);
+    return blockType;
+}
+//# sourceMappingURL=block-types.js.map

package/dist/src/blocks/block-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"block-types.js","sourceRoot":"","sources":["../../../src/blocks/block-types.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;AAEhD,MAAM,UAAU,iBAAiB,CAAC,SAAoB,EAAE,IAAY;IACnE,IAAI,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,cAAc,SAAS,KAAK,IAAI,yBAAyB,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IACxG,CAAC;IACD,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAChC,OAAO,SAAS,CAAC;AAClB,CAAC"}

package/dist/src/blocks/helpers.d.ts

@@ -0,0 +1,4 @@
+import type { BlockOperation, IBlock, BlockId, BlockStore } from "../index.js";
+export declare function get<T extends IBlock>(store: BlockStore<T>, id: BlockId): Promise<T>;
+export declare function apply<T extends IBlock>(store: BlockStore<T>, block: IBlock, op: BlockOperation): void;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/src/blocks/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/blocks/helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAG/E,wBAAsB,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAIzF;AAED,wBAAgB,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,QAG9F"}

package/dist/src/blocks/helpers.js

@@ -0,0 +1,12 @@
+import { applyOperation } from "../transform/helpers.js";
+export async function get(store, id) {
+    const block = await store.tryGet(id);
+    if (!block)
+        throw Error(`Missing block (${id})`);
+    return block;
+}
+export function apply(store, block, op) {
+    applyOperation(block, op);
+    store.update(block.header.id, op);
+}
+//# sourceMappingURL=helpers.js.map

package/dist/src/blocks/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../src/blocks/helpers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEzD,MAAM,CAAC,KAAK,UAAU,GAAG,CAAmB,KAAoB,EAAE,EAAW;IAC5E,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK;QAAE,MAAM,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,UAAU,KAAK,CAAmB,KAAoB,EAAE,KAAa,EAAE,EAAkB;IAC9F,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC1B,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC"}

package/dist/src/blocks/index.d.ts

@@ -0,0 +1,5 @@
+export * from "./block-store.js";
+export * from "./block-types.js";
+export * from "./helpers.js";
+export * from "./structs.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/blocks/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/blocks/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC"}

package/dist/src/blocks/index.js

@@ -0,0 +1,5 @@
+export * from "./block-store.js";
+export * from "./block-types.js";
+export * from "./helpers.js";
+export * from "./structs.js";
+//# sourceMappingURL=index.js.map

package/dist/src/blocks/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/blocks/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC;AAC7B,cAAc,cAAc,CAAC"}

package/dist/src/blocks/structs.d.ts

@@ -0,0 +1,14 @@
+export type BlockId = string;
+export type BlockType = string;
+export type BlockHeader = {
+    id: BlockId;
+    type: BlockType;
+    collectionId: BlockId;
+};
+/** A simple block with only a header.  Blocks should be treated as immutable */
+export type IBlock = {
+    header: BlockHeader;
+};
+export type BlockOperation = [entity: string, index: number, deleteCount: number, inserted: unknown[] | unknown];
+export type BlockOperations = BlockOperation[];
+//# sourceMappingURL=structs.d.ts.map

package/dist/src/blocks/structs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structs.d.ts","sourceRoot":"","sources":["../../../src/blocks/structs.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAC7B,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAE/B,MAAM,MAAM,WAAW,GAAG;IACzB,EAAE,EAAE,OAAO,CAAC;IACZ,IAAI,EAAE,SAAS,CAAC;IAChB,YAAY,EAAE,OAAO,CAAC;CACtB,CAAA;AAED,gFAAgF;AAChF,MAAM,MAAM,MAAM,GAAG;IACpB,MAAM,EAAE,WAAW,CAAC;CACpB,CAAA;AAED,MAAM,MAAM,cAAc,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,CAAA;AAChH,MAAM,MAAM,eAAe,GAAG,cAAc,EAAE,CAAC"}

package/dist/src/blocks/structs.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=structs.js.map

package/dist/src/blocks/structs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"structs.js","sourceRoot":"","sources":["../../../src/blocks/structs.ts"],"names":[],"mappings":""}

package/dist/src/btree/btree.d.ts

@@ -0,0 +1,135 @@
+import { Path, type ITreeTrunk, type KeyRange, type getTrunkFunc } from "./index.js";
+import type { BlockId, BlockStore } from "../blocks/index.js";
+import type { BranchNode, ITreeNode, LeafNode } from "./nodes.js";
+import type { TreeBlock } from "./tree-block.js";
+export declare const NodeCapacity = 64;
+/**
+ * Represents a lightweight B+(ish)Tree (data at leaves, but no linked list of leaves).
+ * Allows for efficient storage and retrieval of data in a sorted manner.
+ * @template TEntry The type of entries stored in the B-tree.
+ * @template TKey The type of keys used for indexing the entries.  This might be an element of TEntry, or TEntry itself.
+ */
+export declare class BTree<TKey, TEntry> {
+    readonly store: BlockStore<ITreeNode>;
+    readonly trunk: ITreeTrunk;
+    readonly keyFromEntry: (entry: TEntry) => TKey;
+    readonly compare: (a: TKey, b: TKey) => number;
+    protected _version: number;
+    /**
+     * @param [compare=(a: TKey, b: TKey) => a < b ? -1 : a > b ? 1 : 0] a comparison function for keys.  The default uses < and > operators.
+     * @param [keyFromEntry=(entry: TEntry) => entry as unknown as TKey] a function to extract the key from an entry.  The default assumes the key is the entry itself.
+     */
+    constructor(store: BlockStore<ITreeNode>, trunk: ITreeTrunk, keyFromEntry?: (entry: TEntry) => TKey, compare?: (a: TKey, b: TKey) => number);
+    static createRoot(store: BlockStore<ITreeNode>): LeafNode<never>;
+    static create<TKey, TEntry>(store: BlockStore<ITreeNode | TreeBlock>, createTrunk: getTrunkFunc, keyFromEntry?: (entry: TEntry) => TKey, compare?: (a: TKey, b: TKey) => 0 | 1 | -1, newId?: BlockId): BTree<TKey, TEntry>;
+    /** @returns a path to the first entry (on = false if no entries) */
+    first(): Promise<Path<TKey, TEntry>>;
+    /** @returns a path to the last entry (on = false if no entries) */
+    last(): Promise<Path<TKey, TEntry>>;
+    /** Attempts to find the given key
+     * @returns Path to the key or the "crack" before it.  If `on` is true on the resulting path, the key was found.
+     * 	If `on` is false, next() and prior() can attempt to move to the nearest match. */
+    find(key: TKey): Promise<Path<TKey, TEntry>>;
+    /** Retrieves the entry for the given key.
+     * Use find instead for a path to the key, the nearest match, or as a basis for navigation.
+     * @returns the entry for the given key if found; undefined otherwise. */
+    get(key: TKey): Promise<TEntry | undefined>;
+    /** @returns the entry for the given path if on an entry; undefined otherwise. */
+    at(path: Path<TKey, TEntry>): TEntry | undefined;
+    /** Iterates based on the given range
+     * WARNING: mutation during iteration will result in an exception
+    */
+    range(range: KeyRange<TKey>): AsyncIterableIterator<Path<TKey, TEntry>>;
+    /** @returns true if the given path remains valid; false if the tree has been mutated, invalidating the path. */
+    isValid(path: Path<TKey, TEntry>): boolean;
+    /**
+     * Adds a value to the tree.  Be sure to check the result, as the tree does not allow duplicate keys.
+     * Added entries are frozen to ensure immutability
+     * @returns path to the new (on = true) or conflicting (on = false) row. */
+    insert(entry: TEntry): Promise<Path<TKey, TEntry>>;
+    /** Updates the entry at the given path to the given value.  Deletes and inserts if the key changes.
+     * @returns path to resulting entry and whether it was an update (as opposed to an insert).
+     * 	* on = true if update/insert succeeded.
+     * 		* wasUpdate = true if updated; false if inserted.
+     * 		* Returned path is on entry
+     * 	* on = false if update/insert failed.
+     * 		* wasUpdate = true, given path is not on an entry
+     * 		* else newEntry's new key already present; returned path is "near" existing entry */
+    updateAt(path: Path<TKey, TEntry>, newEntry: TEntry): Promise<[path: Path<TKey, TEntry>, wasUpdate: boolean]>;
+    /** Inserts the entry if it doesn't exist, or updates it if it does.
+     * The entry is frozen to ensure immutability.
+     * @returns path to the new entry.  on = true if existing; on = false if new. */
+    upsert(entry: TEntry): Promise<Path<TKey, TEntry>>;
+    /** Inserts or updates depending on the existence of the given key, using callbacks to generate the new value.
+     * @param newEntry the new entry to insert if the key doesn't exist.
+     * @param getUpdated a callback to generate an updated entry if the key does exist.  WARNING: mutation in this callback will cause merge to error.
+     * @returns path to new entry and whether an update or insert attempted.
+     * If getUpdated callback returns a row that is already present, the resulting path will not be on. */
+    merge(newEntry: TEntry, getUpdated: (existing: TEntry) => TEntry): Promise<[path: Path<TKey, TEntry>, wasUpdate: boolean]>;
+    /** Deletes the entry at the given path.
+     * The on property of the path will be cleared.
+     * @returns true if the delete succeeded (the key was found); false otherwise.
+    */
+    deleteAt(path: Path<TKey, TEntry>): Promise<boolean>;
+    drop(): Promise<void>;
+    /** Iterates forward starting from the path location (inclusive) to the end.
+     * WARNING: mutation during iteration will result in an exception.
+    */
+    ascending(path: Path<TKey, TEntry>): AsyncIterableIterator<Path<TKey, TEntry>>;
+    /** Iterates backward starting from the path location (inclusive) to the end.
+     * WARNING: mutation during iteration will result in an exception
+    */
+    descending(path: Path<TKey, TEntry>): AsyncIterableIterator<Path<TKey, TEntry>>;
+    /** Computed (not stored) count.  Computes the sum using leaf-node lengths.  O(n/af) where af is average fill.
+     * @param from if provided, the count will start from the given path (inclusive).  If ascending is false,
+     * 	the count will start from the end of the tree.  Ascending is true by default.
+     */
+    getCount(from?: {
+        path: Path<TKey, TEntry>;
+        ascending?: boolean;
+    }): Promise<number>;
+    /** @returns a path one step forward.  on will be true if the path hasn't hit the end. */
+    next(path: Path<TKey, TEntry>): Promise<Path<TKey, TEntry>>;
+    /** Attempts to advance the given path one step forward. (mutates the path) */
+    moveNext(path: Path<TKey, TEntry>): Promise<void>;
+    /** @returns a path one step backward.  on will be true if the path hasn't hit the end. */
+    prior(path: Path<TKey, TEntry>): Promise<Path<TKey, TEntry>>;
+    /** Attempts to advance the given path one step backwards. (mutates the path) */
+    movePrior(path: Path<TKey, TEntry>): Promise<void>;
+    /** @remarks Assumes the path is "on" */
+    protected keyFromPath(path: Path<TKey, TEntry>): TKey;
+    private internalAscending;
+    private internalDescending;
+    private findFirst;
+    private findLast;
+    protected getPath(node: ITreeNode, key: TKey): Promise<Path<TKey, TEntry>>;
+    private indexOfEntry;
+    protected indexOfKey(keys: TKey[], key: TKey): number;
+    private internalNext;
+    private internalPrior;
+    private internalUpdate;
+    protected internalDelete(path: Path<TKey, TEntry>): Promise<boolean>;
+    private internalInsert;
+    private internalInsertAt;
+    /** Starting from the given node, recursively working down to the leaf, build onto the path based on the beginning-most entry. */
+    private moveToFirst;
+    /** Starting from the given node, recursively working down to the leaf, build onto the path based on the end-most entry. */
+    private moveToLast;
+    /** Construct a path based on the first-most edge of the given. */
+    private getFirst;
+    /** Construct a path based on the last-most edge of the given node */
+    private getLast;
+    private leafInsert;
+    private branchInsert;
+    protected rebalanceLeaf(path: Path<TKey, TEntry>, depth: number): Promise<ITreeNode | undefined>;
+    protected rebalanceBranch(path: Path<TKey, TEntry>, depth: number): Promise<ITreeNode | undefined>;
+    protected updatePartition(nodeIndex: number, path: Path<TKey, TEntry>, depth: number, newKey: TKey): void;
+    protected insertPartition(branch: BranchNode<TKey>, index: number, key: TKey, node: BlockId, nodeOffset?: number): void;
+    protected deletePartition(branch: BranchNode<TKey>, index: number, nodeOffset?: number): void;
+    private validatePath;
+    /** Iterates every node ID below and including the given node. */
+    private nodeIds;
+    protected getEntry(path: Path<TKey, TEntry>): TEntry;
+    protected updateEntry(path: Path<TKey, TEntry>, entry: TEntry): void;
+}
+//# sourceMappingURL=btree.d.ts.map

package/dist/src/btree/btree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.d.ts","sourceRoot":"","sources":["../../../src/btree/btree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAc,KAAK,UAAU,EAAE,KAAK,QAAQ,EAAE,KAAK,YAAY,EAAE,MAAM,YAAY,CAAC;AACjG,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAG9D,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,eAAO,MAAM,YAAY,KAAK,CAAC;AAE/B;;;;;GAKG;AACH,qBAAa,KAAK,CAAC,IAAI,EAAE,MAAM;aAQb,KAAK,EAAE,UAAU,CAAC,SAAS,CAAC;aAC5B,KAAK,EAAE,UAAU;aACjB,YAAY,GAAI,OAAO,MAAM,KAAyB,IAAI;aAC1D,OAAO,GAAI,GAAG,IAAI,EAAE,GAAG,IAAI;IAV5C,SAAS,CAAC,QAAQ,SAAK;IAEvB;;;OAGG;gBAEc,KAAK,EAAE,UAAU,CAAC,SAAS,CAAC,EAC5B,KAAK,EAAE,UAAU,EACjB,YAAY,IAAI,OAAO,MAAM,KAAyB,IAAI,EAC1D,OAAO,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,WAAyC;IAIrF,MAAM,CAAC,UAAU,CAChB,KAAK,EAAE,UAAU,CAAC,SAAS,CAAC;IAK7B,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EACzB,KAAK,EAAE,UAAU,CAAC,SAAS,GAAG,SAAS,CAAC,EACxC,WAAW,EAAE,YAAY,EACzB,YAAY,IAAI,OAAO,MAAM,KAAyB,IAAI,EAC1D,OAAO,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,eAA+B,EAC1D,KAAK,CAAC,EAAE,OAAO;IAQhB,oEAAoE;IAC9D,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAI1C,mEAAmE;IAC7D,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAIzC;;yFAEqF;IAC/E,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAIlD;;6EAEyE;IACnE,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAIjD,iFAAiF;IACjF,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM,GAAG,SAAS;IAKhD;;MAEE;IACK,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IA4B9E,gHAAgH;IAChH,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;IAIhC;;;+EAG2E;IACrE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IASxD;;;;;;;6FAOyF;IACnF,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAYnH;;oFAEgF;IAC1E,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAYxD;;;;0GAIsG;IAChG,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,MAAM,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAiBhI;;;MAGE;IACI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;IASpD,IAAI;IAOV;;MAEE;IACF,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAK9E;;MAEE;IACF,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,qBAAqB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAK/E;;;OAGG;IACG,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAAC,SAAS,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAmBzF,yFAAyF;IACnF,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAMjE,8EAA8E;IACxE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;IAKvC,0FAA0F;IACpF,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAMlE,gFAAgF;IAC1E,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;IAKxC,wCAAwC;IACxC,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI;YAItC,iBAAiB;YAQjB,kBAAkB;YAQnB,SAAS;YAYT,QAAQ;cAYN,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAchF,OAAO,CAAC,YAAY;IAqBpB,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,MAAM;YAqBvC,YAAY;YAmCZ,aAAa;YA8Bb,cAAc;cAkBZ,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;YAqB5D,cAAc;YAWd,gBAAgB;IAe9B,iIAAiI;YACnH,WAAW;IAYzB,2HAA2H;YAC7G,UAAU;IAexB,kEAAkE;YACpD,QAAQ;IAYtB,qEAAqE;YACvD,OAAO;IAcrB,OAAO,CAAC,UAAU;YA+BJ,YAAY;cAqCV,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;cAmDtF,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC;IAgExG,SAAS,CAAC,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI;IASlG,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,SAAI;IAK3G,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,SAAI;IAKjF,OAAO,CAAC,YAAY;IAMpB,iEAAiE;YAClD,OAAO;IAWtB,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM;IAIpD,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM;CAG7D"}