@quereus/quereus 0.1.0

package/dist/src/vtab/memory/layer/transaction.js

@@ -0,0 +1,183 @@
+import { BTree } from 'inheritree';
+import { MemoryIndex } from '../index.js';
+import { createLogger } from '../../../common/logger.js';
+import { createPrimaryKeyFunctions } from '../utils/primary-key.js';
+import { QuereusError } from '../../../common/errors.js';
+const log = createLogger('vtab:memory:layer:transaction');
+const warnLog = log.extend('warn');
+let transactionLayerCounter = 1000;
+/**
+ * Represents a set of modifications (inserts, updates, deletes) applied
+ * on top of a parent Layer using inherited BTrees with copy-on-write semantics.
+ * These layers are immutable once committed.
+ */
+export class TransactionLayer {
+    layerId;
+    parentLayer;
+    tableSchemaAtCreation; // Schema when this layer was started
+    // Primary modifications BTree that inherits from parent
+    primaryModifications;
+    // Secondary index BTrees that inherit from parent's indexes
+    secondaryIndexes;
+    _isCommitted = false;
+    // Cache for BTree funcs to avoid recalculation
+    btreeFuncsCacheForKeyExtraction = new Map();
+    constructor(parent) {
+        this.layerId = transactionLayerCounter++;
+        this.parentLayer = parent;
+        this.tableSchemaAtCreation = parent.getSchema(); // Schema is fixed at creation
+        // Initialize primary modifications BTree with parent's primary tree as base
+        const { primaryKeyExtractorFromRow, primaryKeyComparator } = this.getPkExtractorsAndComparators(this.tableSchemaAtCreation);
+        const btreeKeyFromValue = (value) => {
+            const result = primaryKeyExtractorFromRow(value);
+            return result;
+        };
+        const parentPrimaryTree = parent.getModificationTree('primary');
+        this.primaryModifications = new BTree(btreeKeyFromValue, primaryKeyComparator, parentPrimaryTree || undefined // Use parent's primary tree as base
+        );
+        // Initialize secondary indexes that inherit from parent's secondary indexes
+        this.secondaryIndexes = new Map();
+        this.initializeSecondaryIndexes();
+    }
+    initializeSecondaryIndexes() {
+        const schema = this.tableSchemaAtCreation;
+        if (!schema.indexes)
+            return;
+        for (const indexSchema of schema.indexes) {
+            const parentSecondaryTree = this.parentLayer.getSecondaryIndexTree?.(indexSchema.name);
+            // Create MemoryIndex with inherited BTree
+            const memoryIndex = new MemoryIndex(indexSchema, schema.columns, parentSecondaryTree || undefined // Use parent's secondary index tree as base
+            );
+            this.secondaryIndexes.set(indexSchema.name, memoryIndex);
+        }
+    }
+    getLayerId() {
+        return this.layerId;
+    }
+    getParent() {
+        return this.parentLayer;
+    }
+    getSchema() {
+        // Return the schema as it was when this transaction started
+        return this.tableSchemaAtCreation;
+    }
+    isCommitted() {
+        return this._isCommitted;
+    }
+    /** Marks this layer as committed. Should only be done by MemoryTable. */
+    markCommitted() {
+        if (!this._isCommitted) {
+            this._isCommitted = true;
+            // With inherited BTrees, we don't need to freeze complex change tracking structures
+        }
+    }
+    getPkExtractorsAndComparators(schema) {
+        if (schema !== this.tableSchemaAtCreation) {
+            warnLog("TransactionLayer.getPkExtractorsAndComparators called with a schema different from its creation schema. Using creation schema.");
+        }
+        // Use the centralized primary key functions instead of duplicating the logic
+        // This ensures consistent handling of empty primary key definitions
+        const pkFunctions = createPrimaryKeyFunctions(this.tableSchemaAtCreation);
+        return {
+            primaryKeyExtractorFromRow: pkFunctions.extractFromRow,
+            primaryKeyComparator: pkFunctions.compare
+        };
+    }
+    getModificationTree(indexName) {
+        if (indexName === 'primary')
+            return this.primaryModifications;
+        return null; // Secondary indexes are accessed via getSecondaryIndexTree
+    }
+    getSecondaryIndexTree(indexName) {
+        return this.secondaryIndexes.get(indexName)?.data ?? null;
+    }
+    /** Records an insert or update in this transaction layer */
+    recordUpsert(primaryKey, newRowData, oldRowDataIfUpdate) {
+        if (this._isCommitted)
+            throw new QuereusError("Cannot modify a committed layer");
+        this.primaryModifications.upsert(newRowData);
+        // Update secondary indexes
+        const schema = this.getSchema();
+        if (schema.indexes) {
+            for (const indexSchema of schema.indexes) {
+                const memoryIndex = this.secondaryIndexes.get(indexSchema.name);
+                if (!memoryIndex)
+                    continue;
+                if (oldRowDataIfUpdate) { // UPDATE
+                    const oldIndexKey = memoryIndex.keyFromRow(oldRowDataIfUpdate);
+                    const newIndexKey = memoryIndex.keyFromRow(newRowData);
+                    // If index key changed, remove old and add new
+                    if (memoryIndex.compareKeys(oldIndexKey, newIndexKey) !== 0) {
+                        memoryIndex.removeEntry(oldIndexKey, primaryKey);
+                        memoryIndex.addEntry(newIndexKey, primaryKey);
+                    }
+                    else {
+                        // Index key is same, but we might need to update the entry
+                        // With inherited BTrees, the existing entry will be copied on write
+                        memoryIndex.addEntry(newIndexKey, primaryKey);
+                    }
+                }
+                else { // INSERT
+                    const newIndexKey = memoryIndex.keyFromRow(newRowData);
+                    memoryIndex.addEntry(newIndexKey, primaryKey);
+                }
+            }
+        }
+    }
+    /** Records a delete in this transaction layer */
+    recordDelete(primaryKey, oldRowDataForIndexes) {
+        if (this._isCommitted)
+            throw new QuereusError("Cannot modify a committed layer");
+        // Find the existing entry
+        const existingPath = this.primaryModifications.find(primaryKey);
+        if (existingPath.on) {
+            // Entry exists (locally or inherited) - use deleteAt to remove it
+            this.primaryModifications.deleteAt(existingPath);
+        }
+        // If key doesn't exist, there's nothing to delete - no deletion marker needed
+        // Inheritree's copy-on-write semantics handle this properly
+        // Update secondary indexes to remove entries
+        const schema = this.getSchema();
+        if (schema.indexes) {
+            for (const indexSchema of schema.indexes) {
+                const memoryIndex = this.secondaryIndexes.get(indexSchema.name);
+                if (!memoryIndex)
+                    continue;
+                const oldIndexKey = memoryIndex.keyFromRow(oldRowDataForIndexes);
+                memoryIndex.removeEntry(oldIndexKey, primaryKey);
+            }
+        }
+    }
+    hasChanges() {
+        // Check if primary modifications BTree has any entries beyond its base
+        if (this.primaryModifications.getCount() > 0) {
+            // Note: getCount() might include inherited entries, so we need a better way
+            // to check if this layer has modifications. This depends on inheritree's API.
+            // For now, assume any count > 0 means changes (might need refinement)
+            return true;
+        }
+        // Check secondary indexes for changes
+        for (const memoryIndex of this.secondaryIndexes.values()) {
+            if (memoryIndex.size > 0) {
+                // Same caveat as above - this might include inherited entries
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Detaches this layer's BTrees from their base, making them self-contained.
+     * This should be called when the layer becomes the new effective base.
+     */
+    clearBase() {
+        // Clear base for primary modifications
+        if (typeof this.primaryModifications.clearBase === 'function') {
+            this.primaryModifications.clearBase();
+        }
+        // Clear base for secondary indexes
+        for (const memoryIndex of this.secondaryIndexes.values()) {
+            memoryIndex.clearBase();
+        }
+    }
+}
+//# sourceMappingURL=transaction.js.map

package/dist/src/vtab/memory/layer/transaction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/transaction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,MAAM,GAAG,GAAG,YAAY,CAAC,+BAA+B,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAEnC,IAAI,uBAAuB,GAAG,IAAI,CAAC;AAEnC;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACX,OAAO,CAAS;IACjB,WAAW,CAAQ;IAClB,qBAAqB,CAAc,CAAC,qCAAqC;IAE1F,wDAAwD;IAChD,oBAAoB,CAAiC;IAE7D,4DAA4D;IACpD,gBAAgB,CAA2B;IAE3C,YAAY,GAAY,KAAK,CAAC;IAEtC,+CAA+C;IACvC,+BAA+B,GAKlC,IAAI,GAAG,EAAE,CAAC;IAEf,YAAY,MAAa;QACxB,IAAI,CAAC,OAAO,GAAG,uBAAuB,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,IAAI,CAAC,qBAAqB,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,8BAA8B;QAE/E,4EAA4E;QAC5E,MAAM,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5H,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAsB,EAAE;YAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhE,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,CACpC,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,IAAI,SAAS,CAAC,oCAAoC;SACnE,CAAC;QAEF,4EAA4E;QAC5E,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACnC,CAAC;IAEO,0BAA0B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QAE5B,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,MAAM,CAAC,OAAO,EACd,mBAAmB,IAAI,SAAS,CAAC,4CAA4C;aAC7E,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED,SAAS;QACR,4DAA4D;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED,yEAAyE;IACzE,aAAa;QACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,oFAAoF;QACrF,CAAC;IACF,CAAC;IAEM,6BAA6B,CAAC,MAAmB;QAIvD,IAAI,MAAM,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC3C,OAAO,CAAC,gIAAgI,CAAC,CAAC;QAC3I,CAAC;QAED,6EAA6E;QAC7E,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC1E,OAAO;YACN,0BAA0B,EAAE,WAAW,CAAC,cAAc;YACtD,oBAAoB,EAAE,WAAW,CAAC,OAAO;SACzC,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,SAA6B;QAChD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAC9D,OAAO,IAAI,CAAC,CAAC,2DAA2D;IACzE,CAAC;IAED,qBAAqB,CAAC,SAAiB;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,UAA8B,EAAE,UAAe,EAAE,kBAA+B;QAC5F,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,IAAI,kBAAkB,EAAE,CAAC,CAAC,SAAS;oBAClC,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBAEvD,+CAA+C;oBAC/C,IAAI,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACP,2DAA2D;wBAC3D,oEAAoE;wBACpE,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;gBACF,CAAC;qBAAM,CAAC,CAAC,SAAS;oBACjB,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,UAA8B,EAAE,oBAAyB;QACrE,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,EAAE,EAAE,CAAC;YACrB,kEAAkE;YAClE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,8EAA8E;QAC9E,4DAA4D;QAE5D,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;gBACjE,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;IACF,CAAC;IAEM,UAAU;QAChB,uEAAuE;QACvE,IAAI,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;YAC9C,4EAA4E;YAC5E,8EAA8E;YAC9E,sEAAsE;YACtE,OAAO,IAAI,CAAC;QACb,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1B,8DAA8D;gBAC9D,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,SAAS;QACf,uCAAuC;QACvC,IAAI,OAAQ,IAAI,CAAC,oBAA4B,CAAC,SAAS,KAAK,UAAU,EAAE,CAAC;YACvE,IAAI,CAAC,oBAA4B,CAAC,SAAS,EAAE,CAAC;QAChD,CAAC;QAED,mCAAmC;QACnC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,WAAW,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC;IACF,CAAC;CACD"}

package/dist/src/vtab/memory/module.d.ts

@@ -0,0 +1,89 @@
+import type { Database } from '../../core/database.js';
+import { type TableSchema, type IndexSchema } from '../../schema/table.js';
+import { MemoryTable } from './table.js';
+import type { VirtualTableModule } from '../module.js';
+import type { IndexInfo } from '../index-info.js';
+import { MemoryTableManager } from './layer/manager.js';
+import type { MemoryTableConfig } from './types.js';
+import type { BestAccessPlanRequest, BestAccessPlanResult } from '../best-access-plan.js';
+/**
+ * A module that provides in-memory table functionality using digitree.
+ * Tables created with this module persist only for the lifetime of the
+ * database connection.
+ */
+export declare class MemoryTableModule implements VirtualTableModule<MemoryTable, MemoryTableConfig> {
+    readonly tables: Map<string, MemoryTableManager>;
+    constructor();
+    /**
+     * Creates a new memory table definition
+     */
+    xCreate(db: Database, tableSchema: TableSchema): MemoryTable;
+    /**
+     * Connects to an existing memory table definition
+     */
+    xConnect(db: Database, pAux: unknown, moduleName: string, schemaName: string, tableName: string, _options: MemoryTableConfig): MemoryTable;
+    /**
+     * Modern, type-safe access planning interface
+     */
+    getBestAccessPlan(db: Database, tableInfo: TableSchema, request: BestAccessPlanRequest): BestAccessPlanResult;
+    /**
+     * Build column metadata for access planning
+     */
+    private buildColumnMetadata;
+    /**
+     * Find the best access plan for the given request
+     */
+    private findBestAccessPlan;
+    /**
+     * Evaluate access via a specific index
+     */
+    private evaluateIndexAccess;
+    /**
+     * Find equality matches for index columns
+     */
+    private findEqualityMatches;
+    /**
+     * Find range match for a column
+     */
+    private findRangeMatch;
+    /**
+     * Adjust plan to account for ordering requirements
+     */
+    private adjustPlanForOrdering;
+    /**
+     * Check if an index can satisfy ordering requirements
+     */
+    private indexSatisfiesOrdering;
+    /**
+     * Determines the best query plan for executing a query against a memory table
+     * @deprecated Use getBestAccessPlan instead for better type safety and extensibility
+     */
+    xBestIndex(db: Database, tableInfo: TableSchema, indexInfo: IndexInfo): number;
+    private createPlanningContext;
+    private gatherAvailableIndexes;
+    private findBestPlan;
+    private createInitialPlan;
+    private evaluateIndexPlan;
+    private evaluateEqualityPlan;
+    private findEqualityConstraints;
+    private canUseEqualityPlan;
+    private evaluateRangePlan;
+    private findRangeBounds;
+    private evaluateOrderByConsumption;
+    private checkOrderByConsumption;
+    private adjustPlanTypeForOrder;
+    private ensureFallbackPlan;
+    private populateIndexInfoOutput;
+    private buildConstraintUsage;
+    private buildIndexString;
+    private createArgvMapping;
+    /**
+     * Destroys a memory table and frees associated resources
+     */
+    xDestroy(db: Database, pAux: unknown, moduleName: string, schemaName: string, tableName: string): Promise<void>;
+    /**
+     * Creates an index on a memory table
+     */
+    xCreateIndex(db: Database, schemaName: string, tableName: string, indexSchema: IndexSchema): Promise<void>;
+}
+//# sourceMappingURL=module.d.ts.map

package/dist/src/vtab/memory/module.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"module.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/module.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAC3E,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAEvD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,oBAAoB,EAAmC,MAAM,wBAAwB,CAAC;AAI3H;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAC3F,SAAgB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAa;;IAIpE;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,WAAW;IA4B5D;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,iBAAiB,GAAG,WAAW;IAc1I;;OAEG;IACH,iBAAiB,CAChB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,qBAAqB,GAC5B,oBAAoB;IAiBvB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAU3B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAgC1B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA0C3B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA6B3B;;OAEG;IACH,OAAO,CAAC,cAAc;IAwBtB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAwB7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAqB9B;;;OAGG;IACH,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,GAAG,MAAM;IAW9E,OAAO,CAAC,qBAAqB;IAmB7B,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,YAAY;IAapB,OAAO,CAAC,iBAAiB;IAYzB,OAAO,CAAC,iBAAiB;IAyBzB,OAAO,CAAC,oBAAoB;IAyB5B,OAAO,CAAC,uBAAuB;IA4B/B,OAAO,CAAC,kBAAkB;IAI1B,OAAO,CAAC,iBAAiB;IA8BzB,OAAO,CAAC,eAAe;IAsBvB,OAAO,CAAC,0BAA0B;IA6BlC,OAAO,CAAC,uBAAuB;IAmB/B,OAAO,CAAC,sBAAsB;IAQ9B,OAAO,CAAC,kBAAkB;IAa1B,OAAO,CAAC,uBAAuB;IAa/B,OAAO,CAAC,oBAAoB;IAe5B,OAAO,CAAC,gBAAgB;IAqBxB,OAAO,CAAC,iBAAiB;IASzB;;OAEG;IACG,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAYrH;;OAEG;IACG,YAAY,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;CAiBhH"}