@routier/core 0.3.0 → 0.5.0

package/dist/utilities/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"utilities/index.cjs","sources":["webpack://@routier/core/./src/assertions/index.ts","webpack://@routier/core/./src/expressions/utils.ts","webpack://@routier/core/./src/plugins/query/QueryOptionsCollection.ts","webpack://@routier/core/./src/utilities/dates.ts","webpack://@routier/core/./src/utilities/logger.ts","webpack://@routier/core/./src/utilities/strings.ts","webpack://@routier/core/./src/utilities/uuid.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/webpack/runtime/make_namespace_object","webpack://@routier/core/./src/utilities/arrays.ts","webpack://@routier/core/./src/utilities/objects.ts","webpack://@routier/core/./src/utilities/runtime.ts","webpack://@routier/core/./src/utilities/replication.ts","webpack://@routier/core/./src/utilities/queryOptionsCollection.ts","webpack://@routier/core/./src/utilities/dbPluginEventUtils.ts","webpack://@routier/core/./src/utilities/functions.ts","webpack://@routier/core/./src/utilities/unsafeCast.ts","webpack://@routier/core/./src/utilities/index.ts"],"sourcesContent":["import { EXPRESSION_TYPES } from \"../expressions/constants\";\nimport { ComparatorExpression, EmptyExpression, Expression, ExpressionType, NotParsableExpression, OperatorExpression, PropertyExpression, ValueExpression } from \"../expressions/types\";\nimport { isDate } from \"../utilities\";\n\nexport function assertDate(data: unknown): asserts data is Date {\n    if (isDate(data) === false) {\n        throw new TypeError('Value is not a Date');\n    }\n}\n\nexport function assertIsNotNull<T>(data: T | null | undefined, message?: string | (() => string)): asserts data is NonNullable<T> {\n    if (data == null) {\n        if (message == null) {\n            throw new TypeError('Assertion failed, data is null');\n        }\n\n        if (typeof message === \"string\") {\n            throw new TypeError(message);\n        }\n\n        throw new TypeError(message());\n    }\n}\n\nexport function assertIsArray<T>(data: unknown, message?: string): asserts data is T[] {\n    if (!Array.isArray(data)) {\n        throw new TypeError(message ?? 'Assertion failed, data is not of type Array');\n    }\n}\n\nexport function assertString(data: unknown, message?: string): asserts data is string {\n    if (typeof data !== \"string\") {\n        throw new TypeError(message ?? 'Assertion failed, data is not of type String');\n    }\n}\n\nexport function assertInstanceOf<T extends new (...args: any[]) => any>(value: unknown, Instance: T): asserts value is T {\n    if (value instanceof Instance) {\n        return;\n    }\n\n    if (value != null && typeof value === \"object\" && \"constructor\" in value) {\n        throw new TypeError(`value is not instance of type.  Type: ${value.constructor.name}`);\n    }\n\n    throw new TypeError(`value is not instance of type`);\n}\n\nexport function assertIsNumber(value: unknown): asserts value is number {\n    if (typeof value !== \"number\") {\n        throw new TypeError(\"value is not of type `number`\");\n    }\n}\n\n\nfunction isObjectWithType(value: unknown): value is Record<\"type\", unknown> {\n    return typeof value === \"object\" && value !== null && \"type\" in value;\n}\n\n/**\n * Type guard: narrows `value` to `Expression` when it is an object with a valid `type` property.\n */\nexport function isExpression(value: unknown): value is Expression {\n    return isObjectWithType(value) && EXPRESSION_TYPES.includes(value.type as ExpressionType);\n}\n\n/**\n * Type guard: narrows `value` to `OperatorExpression` when it is an object with `type === \"operator\"`.\n */\nexport function isOperatorExpression(value: unknown): value is OperatorExpression {\n    return isObjectWithType(value) && value.type === \"operator\";\n}\n\n/**\n * Type guard: narrows `value` to `ComparatorExpression` when it is an object with `type === \"comparator\"`.\n */\nexport function isComparatorExpression(value: unknown): value is ComparatorExpression {\n    return isObjectWithType(value) && value.type === \"comparator\";\n}\n\n/**\n * Type guard: narrows `value` to `PropertyExpression` when it is an object with `type === \"property\"`.\n */\nexport function isPropertyExpression(value: unknown): value is PropertyExpression {\n    return isObjectWithType(value) && value.type === \"property\";\n}\n\n/**\n * Type guard: narrows `value` to `ValueExpression` when it is an object with `type === \"value\"`.\n */\nexport function isValueExpression(value: unknown): value is ValueExpression {\n    return isObjectWithType(value) && value.type === \"value\";\n}\n\n/**\n * Type guard: narrows `value` to `EmptyExpression` when it is an object with `type === \"empty\"`.\n */\nexport function isEmptyExpression(value: unknown): value is EmptyExpression {\n    return isObjectWithType(value) && value.type === \"empty\";\n}\n\n/**\n * Type guard: narrows `value` to `NotParsableExpression` when it is an object with `type === \"not-parsable\"`.\n */\nexport function isNotParsableExpression(value: unknown): value is NotParsableExpression {\n    return isObjectWithType(value) && value.type === \"not-parsable\";\n}","import { PropertyInfo } from \"../schema\";\nimport { Expression, PropertyExpression } from \"./types\";\n\n/**\n * Extracts all properties referenced in an expression\n * @param expression The expression to analyze\n * @returns Array of PropertyInfo objects referenced in the expression\n */\nexport function getProperties(expression: Expression): PropertyInfo<any>[] {\n    const properties: PropertyInfo<any>[] = [];\n\n    function traverse(expr: Expression) {\n        // If this is a property expression, add it to our collection\n        if (expr.type === \"property\") {\n            properties.push((expr as PropertyExpression).property);\n        }\n\n        // Traverse left and right expressions if they exist\n        if (expr.left) {\n            traverse(expr.left);\n        }\n        if (expr.right) {\n            traverse(expr.right);\n        }\n    }\n\n    traverse(expression);\n    return properties;\n}\n\nexport function forEach(expression: Expression, callback: (expression: Expression) => boolean) {\n    function traverse(expr: Expression): boolean {\n        // Call the callback for this expression\n        // If callback returns false, stop traversing\n        if (!callback(expr)) {\n            return false;\n        }\n\n        // Traverse left and right expressions if they exist\n        if (expr.left) {\n            if (!traverse(expr.left)) {\n                return false;\n            }\n        }\n        if (expr.right) {\n            if (!traverse(expr.right)) {\n                return false;\n            }\n        }\n\n        return true;\n    }\n\n    traverse(expression);\n}","import { isPropertyExpression } from \"../../assertions\";\nimport { forEach } from \"../../expressions/utils\";\nimport { QueryOption, QueryOptionName, QueryOptionExecutionTarget, QueryOptionValueMap } from \"./types\";\n\nexport type QueryCollectionItem<T, K extends QueryOptionName> = { index: number, option: QueryOption<T, K> };\n\nexport class QueryOptionsCollection<T> {\n\n    private options: Map<QueryOptionName, QueryCollectionItem<any, any>[]> = new Map<QueryOptionName, QueryCollectionItem<any, any>[]>();\n    private nextExecutionTarget: QueryOptionExecutionTarget = \"database\";\n    private nextIndex: number = 0;\n    private enumeratedItems: QueryCollectionItem<any, any>[] = [];\n\n    get items() {\n        return this.options;\n    }\n\n    get isEmpty() {\n        return this.items.size === 0;\n    }\n\n    static EMPTY<R>() {\n        return new QueryOptionsCollection<R>();\n    }\n\n    static isEmpty<T>(options: QueryOptionsCollection<T>) {\n        return options.isEmpty;\n    }\n\n    add<K extends QueryOptionName>(name: K, value: QueryOption<T, K>[\"value\"]) {\n\n        if (name === \"map\") {\n            const mapValue = value as QueryOptionValueMap<T>[\"map\"];\n\n            // Evaluate the map value to see if we are renaming properties, \n            // if we are we need to perform everything after in memory\n            if (mapValue.fields.some(x => x.isRename === true) || mapValue.fields.some(x => x.property?.isUnmapped === true)) {\n                // Cut over to memory execution since we are renaming a property with .map\n                // We do not want to figure out how the new name flows through the entire query\n                this.nextExecutionTarget = \"memory\";\n            }\n        }\n\n        if (name === \"filter\") {\n            // Need to check for unmapped and renamed properties\n            const filterValue = value as QueryOptionValueMap<T>[\"filter\"];\n\n            // A tautology (`x => true`) filters nothing — skip it entirely so\n            // plugins never see it\n            if (filterValue.expression.type === \"empty\") {\n                return;\n            }\n\n            if (filterValue.expression.type === \"not-parsable\") {\n                this.nextExecutionTarget = \"memory\";\n            } else {\n                forEach(filterValue.expression, (expression) => {\n\n                    if (isPropertyExpression(expression) && expression.property.isUnmapped) {\n                        // Cut over to memory execution, unmapped properties are not in the database and\n                        // cannot be queried\n                        this.nextExecutionTarget = \"memory\";\n                        return false;\n                    }\n\n                    if (isPropertyExpression(expression) && expression.property.hasRenamedSegments) {\n                        // Cut over to memory execution: the plugin stores data under the\n                        // `from` (storage) names, but filter selectors reference the\n                        // in-memory names.  Memory execution runs after deserialization,\n                        // where the in-memory names exist\n                        this.nextExecutionTarget = \"memory\";\n                        return false;\n                    }\n\n                    return true;\n                });\n            }\n        }\n\n        if (name === \"sort\") {\n            const sortValue = value as QueryOptionValueMap<T>[\"sort\"];\n\n            // Same rule as filters: sort selectors reference in-memory names, which\n            // only exist after deserialization when the property is renamed or unmapped\n            if (sortValue.property != null && (sortValue.property.isUnmapped || sortValue.property.hasRenamedSegments)) {\n                this.nextExecutionTarget = \"memory\";\n            }\n        }\n\n        if (name === \"nearest\") {\n            const nearestValue = value as QueryOptionValueMap<T>[\"nearest\"];\n\n            // Same rule as sort, and for the same reason: the plugin stores the vector under\n            // the `from` name, and an unmapped property is not stored at all. Both are only\n            // readable after deserialization, which is where memory execution runs.\n            //\n            // This is also what lets every translator's in-memory fallback read the column by\n            // its resolved name — anything whose storage name differs never reaches them.\n            if (nearestValue.property != null && (nearestValue.property.isUnmapped || nearestValue.property.hasRenamedSegments)) {\n                this.nextExecutionTarget = \"memory\";\n            }\n        }\n\n        if (name === \"join\") {\n            const joinValue = value as QueryOptionValueMap<T>[\"join\"];\n\n            // A join whose two sides live on different plugins cannot be sent to EITHER of\n            // them — neither can read the other's rows — so the option itself belongs to the\n            // memory half, where the datastore interprets it.\n            //\n            // Set BEFORE the item is created, unlike `nearest`'s ratchet below, because this\n            // moves the join option itself rather than everything after it.\n            if (joinValue.crossPlugin === true) {\n                this.nextExecutionTarget = \"memory\";\n            }\n        }\n\n        const item: QueryCollectionItem<T, K> = {\n            index: this.nextIndex,\n            option: {\n                name,\n                target: this.nextExecutionTarget,\n                value\n            }\n        }\n\n        this.nextIndex++;\n\n        const found = this.options.get(name);\n\n        this.options.set(name, [...found ?? [], item]);\n\n        if (name === \"nearest\") {\n            // Everything AFTER a similarity search runs in memory, whatever the backend.\n            //\n            // Whether the search was pushed down is a fact about the plugin, which this\n            // collection cannot see — so a later option is only safe if it runs after the\n            // scoring definitely happened, and in memory is the only place that is true of.\n            //\n            // The failure this prevents is silent. `.nearest(x => x.embedding, v, 10).take(3)`\n            // sends `LIMIT 3` to a backend that ignored the ordering, so three arbitrary rows\n            // come back and get scored — three real rows, in a plausible order, and not the\n            // three nearest. Nothing errors.\n            //\n            // A plugin that DID push the search down loses nothing but the chance to also\n            // push down what follows it, which is a limit over ten rows.\n            this.nextExecutionTarget = \"memory\";\n        }\n\n        if (name === \"join\") {\n            // Everything AFTER a join runs in memory, for the same reason as `nearest`: this\n            // collection cannot see HOW the plugin executed the join, and the rows it produced\n            // are TUPLES rather than entities of the root schema.\n            //\n            // A `take` sent to a backend that hash-joined in its translator would limit the\n            // OUTER rows read, not the pairs produced — a plausible-looking result with the\n            // wrong number of rows in it. Conjuncts that can safely run earlier are split off\n            // by the query builder BEFORE dispatch, which is the only exception.\n            this.nextExecutionTarget = \"memory\";\n        }\n    }\n\n    /**\n     * Splits the collection around the FIRST occurrence of `name`, preserving order.\n     *\n     * For a join: the options recorded before it operate on entity rows, the option itself\n     * produces tuples, and the ones after it operate on tuples. Three different shapes, so the\n     * caller has to run them in three steps rather than one pass.\n     */\n    splitAt<K extends QueryOptionName>(name: K): { before: QueryOptionsCollection<T>, at: QueryOption<T, K> | null, after: QueryOptionsCollection<T> } {\n        this.resolveEnumeration();\n\n        const sortedItems = this.enumeratedItems.toSorted((a, b) => a.index - b.index);\n        const before = new QueryOptionsCollection<T>();\n        const after = new QueryOptionsCollection<T>();\n        let at: QueryOption<T, K> | null = null;\n\n        for (let i = 0, length = sortedItems.length; i < length; i++) {\n            const { option } = sortedItems[i];\n\n            if (at == null && option.name === name) {\n                at = option as QueryOption<T, K>;\n                continue;\n            }\n\n            const destination = at == null ? before : after;\n            destination.add(option.name, option.value);\n        }\n\n        return { before, at, after };\n    }\n\n    /**\n     * Captures the collection's current state and returns a function that restores it.\n     *\n     * Terminal queryable operations (count, first, aggregates, …) record their option on\n     * the shared collection before executing. Without restoring, a re-executed terminal —\n     * the whole point of a subscribed queryable — stacks its option a second time and\n     * runs it over the first execution's scalar result.\n     */\n    snapshot(): () => void {\n        const options = new Map([...this.options.entries()].map(([key, items]): [QueryOptionName, QueryCollectionItem<any, any>[]] => [key, [...items]]));\n        const nextExecutionTarget = this.nextExecutionTarget;\n        const nextIndex = this.nextIndex;\n\n        return () => {\n            this.options = new Map(options);\n            this.nextExecutionTarget = nextExecutionTarget;\n            this.nextIndex = nextIndex;\n            this.enumeratedItems = [];\n        };\n    }\n\n    split(): { memory: QueryOptionsCollection<T>, database: QueryOptionsCollection<T> } {\n        this.resolveEnumeration();\n\n        const sortedItems = this.enumeratedItems.toSorted((a, b) => a.index - b.index);\n        const memoryQueryOptionsCollection = new QueryOptionsCollection<T>();\n        const databaseQueryOptionsCollection = new QueryOptionsCollection<T>();\n\n        for (let i = 0, length = sortedItems.length; i < length; i++) {\n            const sortedItem = sortedItems[i];\n\n            if (sortedItem.option.target === \"database\") {\n                databaseQueryOptionsCollection.add(sortedItem.option.name, sortedItem.option.value);\n                continue;\n            }\n\n            memoryQueryOptionsCollection.add(sortedItem.option.name, sortedItem.option.value);\n        }\n\n        return {\n            memory: memoryQueryOptionsCollection,\n            database: databaseQueryOptionsCollection\n        }\n    }\n\n    hasTransformations(): boolean {\n        const transformationOptions: QueryOptionName[] = [\"map\", \"group\", \"min\", \"max\", \"count\", \"sum\"];\n        return transformationOptions.some((name) => this.options.has(name));\n    }\n\n    has<K extends QueryOptionName>(name: K): boolean {\n        return this.options.has(name);\n    }\n\n    get<K extends QueryOptionName>(name: K): QueryCollectionItem<T, K>[] {\n        return this.options.get(name) ?? [] as QueryCollectionItem<T, K>[];\n    }\n\n    getLast<K extends QueryOptionName>(name: K): QueryOption<T, K> | null {\n        this.resolveEnumeration();\n\n        for (let i = this.enumeratedItems.length - 1; i >= 0; i--) {\n            const item = this.enumeratedItems[i];\n\n            if (item.option.name === name) {\n                return item.option;\n            }\n        }\n\n        return null\n    }\n\n    getValues<K extends QueryOptionName>(name: K): QueryCollectionItem<T, K>[\"option\"][\"value\"][] | undefined {\n\n        const found = this.options.get(name);\n\n        if (found == null) {\n            return [];\n        }\n\n        return found.map(w => w.option.value) as QueryCollectionItem<T, K>[\"option\"][\"value\"][];\n    }\n\n    private getEnumeration() {\n        return [...this.options.values()].flat().toSorted((a, b) => a.index - b.index);\n    }\n\n    private resolveEnumeration() {\n        if (this.enumeratedItems.length != this.nextIndex) {\n            this.enumeratedItems = this.getEnumeration();\n        }\n    }\n\n    forEach(iterator: (item: QueryCollectionItem<T, any>[\"option\"]) => void) {\n        this.resolveEnumeration();\n\n        for (let i = 0, length = this.enumeratedItems.length; i < length; i++) {\n            iterator(this.enumeratedItems[i].option);\n        }\n    }\n}","export const isDate = (data: unknown): data is Date => {\n    if (data == null) {\n        return false;\n    }\n\n    if (typeof data !== \"object\") {\n        return false;\n    }\n\n    return data instanceof Date;\n}","/**\n * Levelled logging, resolved once.\n *\n * Three things about the previous implementation drove this shape:\n *\n *  - **There was no way to turn logging off.** `globalThis.__ROUTIER_DEBUG__` was only ever\n *    compared against `true`, so setting it to `false` did nothing — while\n *    `docs/how-to/debug-logging.md` documented exactly that as the way to force logging off.\n *    A documented switch that silently does nothing is worse than no switch.\n *  - **`NODE_ENV === 'test'` enabled it.** Every Jest run therefore logged, because Jest always\n *    sets `NODE_ENV=test`. Measured on the S7 stress scenario, which drives ~2,000 saves through\n *    a plugin that logs three lines per query: 12.4s with logging, ~6s without. Test runners also\n *    capture console output by snapshotting a stack trace per call, so the cost is far above what\n *    writing to a terminal would suggest — and the output buries whatever the failure was.\n *  - **It was all-or-nothing, and re-resolved per call.** An error could not be kept while debug\n *    was dropped, and every one of the ~97 call sites re-read `globalThis` and `process.env`.\n *\n * Levels are compared numerically against a value cached at module load. Measured against a\n * no-op console at 200k calls: an enabled call costs ~70ns, a call rejected by the gate ~3ns.\n * Building the arguments the call site passes in accounts for ~0.2ns of that 3ns, which is why\n * this keeps the ordinary `logger.debug(msg, payload)` signature instead of taking a thunk —\n * a lazy API would recover 0.3% of an enabled call's cost and would have to change every call\n * site to do it.\n */\n\n/** Ordered from most severe to most verbose. `silent` discards everything. */\nexport const LOG_LEVELS = ['silent', 'error', 'warn', 'info', 'debug'] as const;\n\nexport type LogLevel = (typeof LOG_LEVELS)[number];\n\n/** Numeric rank, so a gate is one integer comparison. */\nconst RANK: Record<LogLevel, number> = {\n    silent: 0,\n    error: 1,\n    warn: 2,\n    info: 3,\n    debug: 4,\n};\n\nconst isLogLevel = (value: unknown): value is LogLevel =>\n    typeof value === 'string' && (LOG_LEVELS as readonly string[]).includes(value);\n\n/**\n * Resolves the configured level, in precedence order.\n *\n * Ordered most specific first: an explicit level beats a boolean flag, a boolean flag beats an\n * environment variable, and an environment variable beats an inference from `NODE_ENV`. Anything\n * unrecognised is ignored rather than treated as an error — a typo'd level should not take down\n * an application, and `silent` is the safe direction to fall back to.\n */\nconst resolveLevel = (): LogLevel => {\n    if (typeof globalThis !== 'undefined') {\n        const g = globalThis as { __ROUTIER_LOG_LEVEL__?: unknown; __ROUTIER_DEBUG__?: unknown };\n\n        if (isLogLevel(g.__ROUTIER_LOG_LEVEL__)) {\n            return g.__ROUTIER_LOG_LEVEL__;\n        }\n\n        // Both directions honoured. `=== false` used to fall through to the NODE_ENV checks\n        // below and re-enable the logging it was asked to suppress.\n        if (g.__ROUTIER_DEBUG__ === true) return 'debug';\n        if (g.__ROUTIER_DEBUG__ === false) return 'silent';\n    }\n\n    // There is deliberately no `import.meta.env` branch, although the documentation used to\n    // promise one. It could never work: this package is bundled with rspack, which replaces\n    // `import.meta` with `undefined`, so the check would read the *library's* build-time\n    // environment rather than the application's — and referencing `import.meta` at all is a parse\n    // error under a CommonJS build target, which is how the test suite loads this file. Vite and\n    // similar apps set `__ROUTIER_LOG_LEVEL__` or `__ROUTIER_DEBUG__` from their own\n    // `import.meta.env`, which is what the docs now describe.\n    if (typeof process !== 'undefined' && process.env != null) {\n        if (isLogLevel(process.env.ROUTIER_LOG_LEVEL)) {\n            return process.env.ROUTIER_LOG_LEVEL as LogLevel;\n        }\n\n        const debug = process.env.DEBUG;\n        if (debug === 'routier' || debug === '*') return 'debug';\n\n        const env = process.env.NODE_ENV?.toLowerCase();\n\n        // `test` is deliberately absent. It used to be here, which meant no test suite anywhere\n        // could run Routier quietly. Opt in with DEBUG=routier or ROUTIER_LOG_LEVEL when a test\n        // needs the output.\n        if (env === 'dev' || env === 'development') return 'debug';\n    }\n\n    return 'silent';\n};\n\nlet level: LogLevel = resolveLevel();\nlet rank = RANK[level];\n\n/**\n * Overrides the level for the rest of the process.\n *\n * The configuration above is read once, at import, which is what makes the gate cheap — but it\n * also means an application that decides its verbosity after startup, or a test that wants to\n * assert on output, has no way in. This is that way in.\n */\nexport const setLogLevel = (next: LogLevel): void => {\n    if (isLogLevel(next) === false) {\n        throw new Error(`Unknown log level \"${next}\". Expected one of: ${LOG_LEVELS.join(', ')}`);\n    }\n\n    level = next;\n    rank = RANK[next];\n};\n\nexport const getLogLevel = (): LogLevel => level;\n\n/** Re-reads the environment. For tests that change it after this module was imported. */\nexport const resetLogLevel = (): void => {\n    level = resolveLevel();\n    rank = RANK[level];\n};\n\n/**\n * Whether a message at this level would be emitted.\n *\n * For the rare call site whose *arguments* are expensive to build — a serialization, a deep\n * clone, a join over a large collection. An ordinary payload object is not worth guarding; see\n * the measurement in the header.\n */\nexport const isLogLevelEnabled = (at: LogLevel): boolean => rank >= RANK[at];\n\ntype ConsoleMethod = 'log' | 'info' | 'warn' | 'error' | 'debug' | 'table';\n\nconst emit = (at: LogLevel, method: ConsoleMethod, args: unknown[]) => {\n    if (rank < RANK[at]) {\n        return;\n    }\n\n    // Resolved at call time rather than captured once: test harnesses and browser devtools both\n    // replace console methods after modules have loaded, and a captured reference would keep\n    // writing past the replacement.\n    (console[method] as (...a: unknown[]) => void)(...args);\n};\n\nexport const logger = {\n    /** General-purpose output. Carried at `info`, since `log` names a console method, not a level. */\n    log: (...args: unknown[]): void => emit('info', 'log', args),\n    info: (...args: unknown[]): void => emit('info', 'info', args),\n    warn: (...args: unknown[]): void => emit('warn', 'warn', args),\n    error: (...args: unknown[]): void => emit('error', 'error', args),\n    debug: (...args: unknown[]): void => emit('debug', 'debug', args),\n    /** Diagnostic tabular output; verbose by nature, so it sits at `debug`. */\n    table: (...args: unknown[]): void => emit('debug', 'table', args),\n};\n","export const hash = (value: string, seed: number = 0) => {\n    // From Stack Overflow\n    // https://stackoverflow.com/a/52171480/3329760\n    let h1 = 0xdeadbeef ^ seed, h2 = 0x41c6ce57 ^ seed;\n\n    for (let i = 0, ch: number; i < value.length; i++) {\n        ch = value.charCodeAt(i);\n        h1 = Math.imul(h1 ^ ch, 2654435761);\n        h2 = Math.imul(h2 ^ ch, 1597334677);\n    }\n\n    h1 = Math.imul(h1 ^ (h1 >>> 16), 2246822507);\n    h1 ^= Math.imul(h2 ^ (h2 >>> 13), 3266489909);\n    h2 = Math.imul(h2 ^ (h2 >>> 16), 2246822507);\n    h2 ^= Math.imul(h1 ^ (h1 >>> 13), 3266489909);\n\n    return 4294967296 * (2097151 & h2) + (h1 >>> 0);\n}\n\n/**\n * Fast string hash optimized for comparisons.\n * Uses djb2 algorithm - very fast and good distribution for short to medium strings.\n * Same input always produces same output (deterministic).\n * \n * @param value - The string to hash\n * @param seed - Optional seed value (default: 5381)\n * @returns A positive 32-bit integer hash value\n * \n * @example\n * ```ts\n * fastHash(\"test\") === fastHash(\"test\") // true\n * fastHash(\"test\") !== fastHash(\"test2\") // true\n * ```\n */\nexport const fastHash = (value: string, seed: number = 5381): number => {\n    let hash = seed;\n    for (let i = 0; i < value.length; i++) {\n        hash = ((hash << 5) + hash) + value.charCodeAt(i);\n    }\n    return hash >>> 0; // Convert to unsigned 32-bit integer\n}\n\n/**\n * Converts any value to a readable string representation.\n * Handles primitives, objects, arrays, classes, dates, errors, and functions.\n * Supports depth limiting to prevent infinite recursion on circular references.\n * \n * @param obj - The value to stringify\n * @param maxDepth - Maximum depth for nested objects (default: 3)\n * @param currentDepth - Current recursion depth (default: 0)\n * @returns String representation of the value\n * \n * @example\n * ```ts\n * stringifyObject({ name: \"test\", count: 5 }) // '{ name: \"test\", count: 5 }'\n * stringifyObject([1, 2, 3]) // '[1, 2, 3]'\n * stringifyObject(new Date()) // 'Date(2024-01-01T00:00:00.000Z)'\n * ```\n */\nexport function stringifyObject(obj: unknown, maxDepth: number = 3, currentDepth: number = 0): string {\n    if (obj === null) return 'null';\n    if (obj === undefined) return 'undefined';\n\n    const type = typeof obj;\n\n    switch (type) {\n        case 'string':\n            return `\"${obj}\"`;\n        case 'number':\n        case 'boolean':\n            return String(obj);\n        case 'function':\n            return `[Function: ${getFunctionName(obj as Function)}]`;\n        case 'object':\n            if (currentDepth >= maxDepth) {\n                return '[Max Depth Reached]';\n            }\n            return stringifyObjectValue(obj, maxDepth, currentDepth);\n        default:\n            return `[${type}]`;\n    }\n}\n\nfunction getFunctionName(fn: Function): string {\n    const name = fn.name;\n    return name || 'anonymous';\n}\n\nfunction getObjectProperties(obj: any): Record<string, any> {\n    const properties: Record<string, any> = {};\n\n    for (const key in obj) {\n        if (obj.hasOwnProperty(key)) {\n            properties[key] = obj[key];\n        }\n    }\n\n    return properties;\n}\n\nfunction stringifyObjectValue(obj: any, maxDepth: number, currentDepth: number): string {\n    if (obj === null) return 'null';\n\n    if (obj instanceof Date) {\n        return `Date(${obj.toISOString()})`;\n    }\n\n    if (obj instanceof Error) {\n        return `Error(${obj.message})`;\n    }\n\n    if (obj instanceof RegExp) {\n        return obj.toString();\n    }\n\n    if (Array.isArray(obj)) {\n        return stringifyArray(obj, maxDepth, currentDepth);\n    }\n\n    if (obj.constructor && obj.constructor.name !== 'Object') {\n        return stringifyClassInstance(obj, maxDepth, currentDepth);\n    }\n\n    return stringifyPlainObject(obj, maxDepth, currentDepth);\n}\n\nfunction stringifyArray(arr: any[], maxDepth: number, currentDepth: number): string {\n    if (arr.length === 0) return '[]';\n\n    const items = arr.slice(0, 5).map(item =>\n        stringifyObject(item, maxDepth, currentDepth + 1)\n    );\n\n    const suffix = arr.length > 5 ? `... (+${arr.length - 5} more)` : '';\n    return `[${items.join(', ')}${suffix}]`;\n}\n\nfunction stringifyClassInstance(obj: any, maxDepth: number, currentDepth: number): string {\n    const className = obj.constructor.name;\n    const properties = getObjectProperties(obj);\n\n    if (Object.keys(properties).length === 0) {\n        return `${className} {}`;\n    }\n\n    const props = Object.entries(properties)\n        .slice(0, 5)\n        .map(([key, value]) => {\n            const isPrimitive = value === null || value === undefined ||\n                (typeof value !== 'object' && typeof value !== 'function');\n            const depth = isPrimitive ? currentDepth : currentDepth + 1;\n            return `${key}: ${stringifyObject(value, maxDepth, depth)}`;\n        });\n\n    const suffix = Object.keys(properties).length > 5 ?\n        `... (+${Object.keys(properties).length - 5} more)` : '';\n\n    return `${className} { ${props.join(', ')}${suffix} }`;\n}\n\nfunction stringifyPlainObject(obj: any, maxDepth: number, currentDepth: number): string {\n    const properties = getObjectProperties(obj);\n\n    if (Object.keys(properties).length === 0) {\n        return '{}';\n    }\n\n    const props = Object.entries(properties)\n        .slice(0, 5)\n        .map(([key, value]) => {\n            const isPrimitive = value === null || value === undefined ||\n                (typeof value !== 'object' && typeof value !== 'function');\n            const depth = isPrimitive ? currentDepth : currentDepth + 1;\n            return `${key}: ${stringifyObject(value, maxDepth, depth)}`;\n        });\n\n    const suffix = Object.keys(properties).length > 5 ?\n        `... (+${Object.keys(properties).length - 5} more)` : '';\n\n    return `{ ${props.join(', ')}${suffix} }`;\n}","export const uuid = (length: number = 16): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n    const charLength = chars.length;\n    let result = '';\n\n    for (let i = 0; i < length; i++) {\n        result += chars[Math.random() * charLength | 0];\n    }\n    return result;\n}\n\nconst HEX_CHARS = '0123456789abcdef';\nconst UUID_TEMPLATE = 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx';\n\nconst hasCrypto =\n    typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function';\n\nconst hasRandomUUID =\n    typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function';\n\nexport const uuidv4 = (): string => {\n    if (hasRandomUUID) {\n        return crypto.randomUUID();\n    }\n\n    return uuidv4Fallback();\n};\n\nconst uuidv4Fallback = (): string => {\n    let randomBytes: Uint8Array | null = null;\n    if (hasCrypto) {\n        randomBytes = crypto.getRandomValues(new Uint8Array(16));\n    }\n\n    let byteIndex = 0;\n    let uuid = '';\n\n    for (let i = 0; i < UUID_TEMPLATE.length; i++) {\n        const c = UUID_TEMPLATE[i];\n        if (c === '-') {\n            uuid += '-';\n            continue;\n        }\n\n        let r: number;\n        if (hasCrypto && randomBytes) {\n            // Each byte gives two hex digits (nibbles)\n            r =\n                (i % 2 === 0\n                    ? randomBytes[byteIndex] >> 4\n                    : randomBytes[byteIndex++] & 0x0f);\n        } else {\n            r = Math.floor(Math.random() * 16);\n        }\n\n        if (c === 'x') {\n            uuid += HEX_CHARS[r];\n        } else if (c === 'y') {\n            // Variant bits: 8, 9, A, or B\n            uuid += HEX_CHARS[(r & 0x3) | 0x8];\n        } else if (c === '4') {\n            uuid += '4';\n        }\n    }\n\n    return uuid;\n};\n","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export const toMap = <T extends {}>(data: T[], keySelector: (item: T) => T[keyof T] | string) => {\n\n    const result = new Map<T[keyof T] | string, T>();\n\n    for (let i = 0; i < data.length; i++) {\n        const item = data[i];\n        const key = keySelector(item);\n        result.set(key, item);\n    }\n\n    return result;\n}\n","export const cast = <TIn, TOut>(item: TIn) => {\n    return item as unknown as TOut;\n}\n\nexport function clone<T extends {}>(data: T): T {\n    return JSON.parse(JSON.stringify(data)) as T;\n}","export const isNodeRuntime = () => typeof process !== 'undefined' &&\n    process.versions != null &&\n    process.versions.node != null;","import { BulkPersistResult, BulkPersistChanges } from \"../collections\";\nimport { DbPluginBulkPersistEvent } from \"../plugins\";\n\nexport const resolveBulkPersistChanges = (event: DbPluginBulkPersistEvent, result: BulkPersistResult, bulkPersistChanges: BulkPersistChanges) => {\n    // make sure we swap the adds here, that way we can make sure other persist events\n    // don't take their additions and try to change subsequent calls\n    for (const [schemaId, changes] of event.operation) {\n\n        const schemmaBulkPersistResult = result.get(schemaId);\n        const schemaBulkPersistChanges = bulkPersistChanges.resolve(schemaId);\n\n        // Set the original removes\n        schemaBulkPersistChanges.removes = changes.removes;\n\n        // Set the original updates\n        schemaBulkPersistChanges.updates = changes.updates;\n\n        // Take the adds from the result and set them to be persisted\n        // in the replicated plugins because the id's are set in the \n        // memory data store\n        schemaBulkPersistChanges.adds = schemmaBulkPersistResult.adds;\n    }\n}","import { QueryOptionsCollection } from \"../plugins/query\";\n\nexport const combineQueryOptionsCollections = <T>(...collections: QueryOptionsCollection<T>[]) => {\n    const result = new QueryOptionsCollection<T>();\n\n    for (let i = 0, length = collections.length; i < length; i++) {\n        const collection = collections[i];\n\n        // Add scoped items first\n        collection.forEach(item => {\n            result.add(item.name, item.value);\n        });\n    }\n\n    return result;\n}","import { InferCreateType, InferType, SchemaId } from \"../schema\";\nimport { DbPluginBulkPersistEvent, EntityUpdateInfo } from \"../plugins\";\n\ntype DbEvent = {\n    type: \"add\",\n    data: InferCreateType<unknown>;\n} | {\n    type: \"update\",\n    data: EntityUpdateInfo<unknown>;\n} | {\n    type: \"remove\",\n    data: InferType<unknown>;\n}\n\nexport const toEventArray = (event: DbPluginBulkPersistEvent): [SchemaId, DbEvent][] => {\n\n    const result: [SchemaId, DbEvent][] = [];\n    for (const [schemaId, changes] of event.operation) {\n\n        if (changes.hasItems === false) {\n            continue;\n        }\n\n        if (changes.adds.length > 0) {\n            result.push(...changes.adds.map(add => {\n                return [schemaId as SchemaId, { data: { ...add }, type: \"add\" }] as [SchemaId, DbEvent];\n            }));\n        }\n\n        if (changes.updates.length > 0) {\n            result.push(...changes.updates.map(update => {\n                return [schemaId as SchemaId, { data: { ...update }, type: \"update\" }] as [SchemaId, DbEvent];\n            }));\n        }\n\n        if (changes.removes.length > 0) {\n            result.push(...changes.removes.map(remove => {\n                return [schemaId as SchemaId, { data: { ...remove }, type: \"remove\" }] as [SchemaId, DbEvent];\n            }));\n        }\n    }\n\n    return result\n}","export const noop = (..._args: any[]) => { };","export const unsafeCast = <T>(value: unknown): T => {\n    return value as T\n}","export * from './arrays';\nexport * from './strings';\nexport * from './dates';\nexport * from './objects';\nexport * from './runtime';\nexport * from './uuid';\nexport * from './replication';\nexport * from './types';\nexport * from './queryOptionsCollection';\nexport * from './dbPluginEventUtils';\nexport * from './functions';\nexport * from './unsafeCast';\nexport * from './logger';"],"names":["EXPRESSION_TYPES","isDate","assertDate","data","TypeError","assertIsNotNull","message","assertIsArray","Array","assertString","assertInstanceOf","value","Instance","assertIsNumber","isObjectWithType","isExpression","isOperatorExpression","isComparatorExpression","isPropertyExpression","isValueExpression","isEmptyExpression","isNotParsableExpression","getProperties","expression","properties","traverse","expr","forEach","callback","QueryOptionsCollection","Map","options","name","mapValue","x","filterValue","sortValue","nearestValue","joinValue","item","found","sortedItems","a","b","before","after","at","i","length","option","destination","key","items","nextExecutionTarget","nextIndex","memoryQueryOptionsCollection","databaseQueryOptionsCollection","sortedItem","transformationOptions","w","iterator","Date","LOG_LEVELS","RANK","isLogLevel","resolveLevel","globalThis","g","process","debug","env","level","rank","setLogLevel","next","Error","getLogLevel","resetLogLevel","isLogLevelEnabled","emit","method","args","console","logger","hash","seed","h1","h2","ch","Math","fastHash","stringifyObject","obj","maxDepth","currentDepth","undefined","type","String","getFunctionName","stringifyObjectValue","fn","getObjectProperties","RegExp","stringifyArray","stringifyClassInstance","stringifyPlainObject","arr","suffix","className","Object","props","isPrimitive","depth","uuid","chars","charLength","result","HEX_CHARS","UUID_TEMPLATE","hasCrypto","crypto","hasRandomUUID","uuidv4","uuidv4Fallback","randomBytes","Uint8Array","byteIndex","c","r","toMap","keySelector","cast","clone","JSON","isNodeRuntime","resolveBulkPersistChanges","event","bulkPersistChanges","schemaId","changes","schemmaBulkPersistResult","schemaBulkPersistChanges","combineQueryOptionsCollections","collections","collection","toEventArray","add","update","remove","noop","_args","unsafeCast"],"mappings":";;;;;;;AAA4D;AAEtB;AAE/B,SAASE,WAAWC,IAAa;IACpC,IAAIF,OAAOE,UAAU,OAAO;QACxB,MAAM,IAAIC,UAAU;IACxB;AACJ;AAEO,SAASC,gBAAmBF,IAA0B,EAAEG,OAAiC;IAC5F,IAAIH,QAAQ,MAAM;QACd,IAAIG,WAAW,MAAM;YACjB,MAAM,IAAIF,UAAU;QACxB;QAEA,IAAI,OAAOE,YAAY,UAAU;YAC7B,MAAM,IAAIF,UAAUE;QACxB;QAEA,MAAM,IAAIF,UAAUE;IACxB;AACJ;AAEO,SAASC,cAAiBJ,IAAa,EAAEG,OAAgB;IAC5D,IAAI,CAACE,MAAM,OAAO,CAACL,OAAO;QACtB,MAAM,IAAIC,UAAUE,WAAW;IACnC;AACJ;AAEO,SAASG,aAAaN,IAAa,EAAEG,OAAgB;IACxD,IAAI,OAAOH,SAAS,UAAU;QAC1B,MAAM,IAAIC,UAAUE,WAAW;IACnC;AACJ;AAEO,SAASI,iBAAwDC,KAAc,EAAEC,QAAW;IAC/F,IAAID,iBAAiBC,UAAU;QAC3B;IACJ;IAEA,IAAID,SAAS,QAAQ,OAAOA,UAAU,YAAY,iBAAiBA,OAAO;QACtE,MAAM,IAAIP,UAAU,CAAC,sCAAsC,EAAEO,MAAM,WAAW,CAAC,IAAI,EAAE;IACzF;IAEA,MAAM,IAAIP,UAAU,CAAC,6BAA6B,CAAC;AACvD;AAEO,SAASS,eAAeF,KAAc;IACzC,IAAI,OAAOA,UAAU,UAAU;QAC3B,MAAM,IAAIP,UAAU;IACxB;AACJ;AAGA,SAASU,iBAAiBH,KAAc;IACpC,OAAO,OAAOA,UAAU,YAAYA,UAAU,QAAQ,UAAUA;AACpE;AAEA;;CAEC,GACM,SAASI,aAAaJ,KAAc;IACvC,OAAOG,iBAAiBH,UAAUX,iBAAiB,QAAQ,CAACW,MAAM,IAAI;AAC1E;AAEA;;CAEC,GACM,SAASK,qBAAqBL,KAAc;IAC/C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASM,uBAAuBN,KAAc;IACjD,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASO,qBAAqBP,KAAc;IAC/C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASQ,kBAAkBR,KAAc;IAC5C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASS,kBAAkBT,KAAc;IAC5C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASU,wBAAwBV,KAAc;IAClD,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;;;;;;;;ACvGA;;;;CAIC,GACM,SAASW,cAAcC,UAAsB;IAChD,MAAMC,aAAkC,EAAE;IAE1C,SAASC,SAASC,IAAgB;QAC9B,6DAA6D;QAC7D,IAAIA,KAAK,IAAI,KAAK,YAAY;YAC1BF,WAAW,IAAI,CAAEE,KAA4B,QAAQ;QACzD;QAEA,oDAAoD;QACpD,IAAIA,KAAK,IAAI,EAAE;YACXD,SAASC,KAAK,IAAI;QACtB;QACA,IAAIA,KAAK,KAAK,EAAE;YACZD,SAASC,KAAK,KAAK;QACvB;IACJ;IAEAD,SAASF;IACT,OAAOC;AACX;AAEO,SAASG,QAAQJ,UAAsB,EAAEK,QAA6C;IACzF,SAASH,SAASC,IAAgB;QAC9B,wCAAwC;QACxC,6CAA6C;QAC7C,IAAI,CAACE,SAASF,OAAO;YACjB,OAAO;QACX;QAEA,oDAAoD;QACpD,IAAIA,KAAK,IAAI,EAAE;YACX,IAAI,CAACD,SAASC,KAAK,IAAI,GAAG;gBACtB,OAAO;YACX;QACJ;QACA,IAAIA,KAAK,KAAK,EAAE;YACZ,IAAI,CAACD,SAASC,KAAK,KAAK,GAAG;gBACvB,OAAO;YACX;QACJ;QAEA,OAAO;IACX;IAEAD,SAASF;AACb;;;;;;;;;;ACtDwD;AACN;AAK3C,MAAMM;IAED,UAAiE,IAAIC,MAAwD;IAC7H,sBAAkD,WAAW;IAC7D,YAAoB,EAAE;IACtB,kBAAmD,EAAE,CAAC;IAE9D,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,OAAO;IACvB;IAEA,IAAI,UAAU;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK;IAC/B;IAEA,OAAO,QAAW;QACd,OAAO,IAAID;IACf;IAEA,OAAO,QAAWE,OAAkC,EAAE;QAClD,OAAOA,QAAQ,OAAO;IAC1B;IAEA,IAA+BC,IAAO,EAAErB,KAAiC,EAAE;QAEvE,IAAIqB,SAAS,OAAO;YAChB,MAAMC,WAAWtB;YAEjB,gEAAgE;YAChE,0DAA0D;YAC1D,IAAIsB,SAAS,MAAM,CAAC,IAAI,CAACC,CAAAA,IAAKA,EAAE,QAAQ,KAAK,SAASD,SAAS,MAAM,CAAC,IAAI,CAACC,CAAAA,IAAKA,EAAE,QAAQ,EAAE,eAAe,OAAO;gBAC9G,0EAA0E;gBAC1E,+EAA+E;gBAC/E,IAAI,CAAC,mBAAmB,GAAG;YAC/B;QACJ;QAEA,IAAIF,SAAS,UAAU;YACnB,oDAAoD;YACpD,MAAMG,cAAcxB;YAEpB,kEAAkE;YAClE,uBAAuB;YACvB,IAAIwB,YAAY,UAAU,CAAC,IAAI,KAAK,SAAS;gBACzC;YACJ;YAEA,IAAIA,YAAY,UAAU,CAAC,IAAI,KAAK,gBAAgB;gBAChD,IAAI,CAAC,mBAAmB,GAAG;YAC/B,OAAO;gBACHR,uDAAOA,CAACQ,YAAY,UAAU,EAAE,CAACZ;oBAE7B,IAAIL,qDAAoBA,CAACK,eAAeA,WAAW,QAAQ,CAAC,UAAU,EAAE;wBACpE,gFAAgF;wBAChF,oBAAoB;wBACpB,IAAI,CAAC,mBAAmB,GAAG;wBAC3B,OAAO;oBACX;oBAEA,IAAIL,qDAAoBA,CAACK,eAAeA,WAAW,QAAQ,CAAC,kBAAkB,EAAE;wBAC5E,iEAAiE;wBACjE,6DAA6D;wBAC7D,iEAAiE;wBACjE,kCAAkC;wBAClC,IAAI,CAAC,mBAAmB,GAAG;wBAC3B,OAAO;oBACX;oBAEA,OAAO;gBACX;YACJ;QACJ;QAEA,IAAIS,SAAS,QAAQ;YACjB,MAAMI,YAAYzB;YAElB,wEAAwE;YACxE,4EAA4E;YAC5E,IAAIyB,UAAU,QAAQ,IAAI,QAASA,CAAAA,UAAU,QAAQ,CAAC,UAAU,IAAIA,UAAU,QAAQ,CAAC,kBAAiB,GAAI;gBACxG,IAAI,CAAC,mBAAmB,GAAG;YAC/B;QACJ;QAEA,IAAIJ,SAAS,WAAW;YACpB,MAAMK,eAAe1B;YAErB,iFAAiF;YACjF,gFAAgF;YAChF,wEAAwE;YACxE,EAAE;YACF,kFAAkF;YAClF,8EAA8E;YAC9E,IAAI0B,aAAa,QAAQ,IAAI,QAASA,CAAAA,aAAa,QAAQ,CAAC,UAAU,IAAIA,aAAa,QAAQ,CAAC,kBAAiB,GAAI;gBACjH,IAAI,CAAC,mBAAmB,GAAG;YAC/B;QACJ;QAEA,IAAIL,SAAS,QAAQ;YACjB,MAAMM,YAAY3B;YAElB,+EAA+E;YAC/E,iFAAiF;YACjF,kDAAkD;YAClD,EAAE;YACF,iFAAiF;YACjF,gEAAgE;YAChE,IAAI2B,UAAU,WAAW,KAAK,MAAM;gBAChC,IAAI,CAAC,mBAAmB,GAAG;YAC/B;QACJ;QAEA,MAAMC,OAAkC;YACpC,OAAO,IAAI,CAAC,SAAS;YACrB,QAAQ;gBACJP;gBACA,QAAQ,IAAI,CAAC,mBAAmB;gBAChCrB;YACJ;QACJ;QAEA,IAAI,CAAC,SAAS;QAEd,MAAM6B,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAACR;QAE/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA,MAAM;eAAIQ,SAAS,EAAE;YAAED;SAAK;QAE7C,IAAIP,SAAS,WAAW;YACpB,6EAA6E;YAC7E,EAAE;YACF,4EAA4E;YAC5E,8EAA8E;YAC9E,gFAAgF;YAChF,EAAE;YACF,mFAAmF;YACnF,kFAAkF;YAClF,gFAAgF;YAChF,iCAAiC;YACjC,EAAE;YACF,8EAA8E;YAC9E,6DAA6D;YAC7D,IAAI,CAAC,mBAAmB,GAAG;QAC/B;QAEA,IAAIA,SAAS,QAAQ;YACjB,iFAAiF;YACjF,mFAAmF;YACnF,sDAAsD;YACtD,EAAE;YACF,gFAAgF;YAChF,gFAAgF;YAChF,kFAAkF;YAClF,qEAAqE;YACrE,IAAI,CAAC,mBAAmB,GAAG;QAC/B;IACJ;IAEA;;;;;;KAMC,GACD,QAAmCA,IAAO,EAAyG;QAC/I,IAAI,CAAC,kBAAkB;QAEvB,MAAMS,cAAc,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAACC,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;QAC7E,MAAMC,SAAS,IAAIf;QACnB,MAAMgB,QAAQ,IAAIhB;QAClB,IAAIiB,KAA+B;QAEnC,IAAK,IAAIC,IAAI,GAAGC,SAASP,YAAY,MAAM,EAAEM,IAAIC,QAAQD,IAAK;YAC1D,MAAM,EAAEE,MAAM,EAAE,GAAGR,WAAW,CAACM,EAAE;YAEjC,IAAID,MAAM,QAAQG,OAAO,IAAI,KAAKjB,MAAM;gBACpCc,KAAKG;gBACL;YACJ;YAEA,MAAMC,cAAcJ,MAAM,OAAOF,SAASC;YAC1CK,YAAY,GAAG,CAACD,OAAO,IAAI,EAAEA,OAAO,KAAK;QAC7C;QAEA,OAAO;YAAEL;YAAQE;YAAID;QAAM;IAC/B;IAEA;;;;;;;KAOC,GACD,WAAuB;QACnB,MAAMd,UAAU,IAAID,IAAI;eAAI,IAAI,CAAC,OAAO,CAAC,OAAO;SAAG,CAAC,GAAG,CAAC,CAAC,CAACqB,KAAKC,MAAM,GAAyD;gBAACD;gBAAK;uBAAIC;iBAAM;aAAC;QAC/I,MAAMC,sBAAsB,IAAI,CAAC,mBAAmB;QACpD,MAAMC,YAAY,IAAI,CAAC,SAAS;QAEhC,OAAO;YACH,IAAI,CAAC,OAAO,GAAG,IAAIxB,IAAIC;YACvB,IAAI,CAAC,mBAAmB,GAAGsB;YAC3B,IAAI,CAAC,SAAS,GAAGC;YACjB,IAAI,CAAC,eAAe,GAAG,EAAE;QAC7B;IACJ;IAEA,QAAoF;QAChF,IAAI,CAAC,kBAAkB;QAEvB,MAAMb,cAAc,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAACC,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;QAC7E,MAAMY,+BAA+B,IAAI1B;QACzC,MAAM2B,iCAAiC,IAAI3B;QAE3C,IAAK,IAAIkB,IAAI,GAAGC,SAASP,YAAY,MAAM,EAAEM,IAAIC,QAAQD,IAAK;YAC1D,MAAMU,aAAahB,WAAW,CAACM,EAAE;YAEjC,IAAIU,WAAW,MAAM,CAAC,MAAM,KAAK,YAAY;gBACzCD,+BAA+B,GAAG,CAACC,WAAW,MAAM,CAAC,IAAI,EAAEA,WAAW,MAAM,CAAC,KAAK;gBAClF;YACJ;YAEAF,6BAA6B,GAAG,CAACE,WAAW,MAAM,CAAC,IAAI,EAAEA,WAAW,MAAM,CAAC,KAAK;QACpF;QAEA,OAAO;YACH,QAAQF;YACR,UAAUC;QACd;IACJ;IAEA,qBAA8B;QAC1B,MAAME,wBAA2C;YAAC;YAAO;YAAS;YAAO;YAAO;YAAS;SAAM;QAC/F,OAAOA,sBAAsB,IAAI,CAAC,CAAC1B,OAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA;IACjE;IAEA,IAA+BA,IAAO,EAAW;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA;IAC5B;IAEA,IAA+BA,IAAO,EAA+B;QACjE,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA,SAAS,EAAE;IACvC;IAEA,QAAmCA,IAAO,EAA4B;QAClE,IAAI,CAAC,kBAAkB;QAEvB,IAAK,IAAIe,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,GAAGA,KAAK,GAAGA,IAAK;YACvD,MAAMR,OAAO,IAAI,CAAC,eAAe,CAACQ,EAAE;YAEpC,IAAIR,KAAK,MAAM,CAAC,IAAI,KAAKP,MAAM;gBAC3B,OAAOO,KAAK,MAAM;YACtB;QACJ;QAEA,OAAO;IACX;IAEA,UAAqCP,IAAO,EAA8D;QAEtG,MAAMQ,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAACR;QAE/B,IAAIQ,SAAS,MAAM;YACf,OAAO,EAAE;QACb;QAEA,OAAOA,MAAM,GAAG,CAACmB,CAAAA,IAAKA,EAAE,MAAM,CAAC,KAAK;IACxC;IAEQ,iBAAiB;QACrB,OAAO;eAAI,IAAI,CAAC,OAAO,CAAC,MAAM;SAAG,CAAC,IAAI,GAAG,QAAQ,CAAC,CAACjB,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;IACjF;IAEQ,qBAAqB;QACzB,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE;YAC/C,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,cAAc;QAC9C;IACJ;IAEA,QAAQiB,QAA+D,EAAE;QACrE,IAAI,CAAC,kBAAkB;QAEvB,IAAK,IAAIb,IAAI,GAAGC,SAAS,IAAI,CAAC,eAAe,CAAC,MAAM,EAAED,IAAIC,QAAQD,IAAK;YACnEa,SAAS,IAAI,CAAC,eAAe,CAACb,EAAE,CAAC,MAAM;QAC3C;IACJ;AACJ;;;;;;;;ACpSO,MAAM9C,SAAS,CAACE;IACnB,IAAIA,QAAQ,MAAM;QACd,OAAO;IACX;IAEA,IAAI,OAAOA,SAAS,UAAU;QAC1B,OAAO;IACX;IAEA,OAAOA,gBAAgB0D;AAC3B,EAAC;;;;;;;;;;;;;ACVD;;;;;;;;;;;;;;;;;;;;;;;CAuBC,GAED,4EAA4E,GACrE,MAAMC,aAAa;IAAC;IAAU;IAAS;IAAQ;IAAQ;CAAQ,CAAU;AAIhF,uDAAuD,GACvD,MAAMC,OAAiC;IACnC,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,OAAO;AACX;AAEA,MAAMC,aAAa,CAACrD,QAChB,OAAOA,UAAU,YAAamD,WAAiC,QAAQ,CAACnD;AAE5E;;;;;;;CAOC,GACD,MAAMsD,eAAe;IACjB,IAAI,OAAOC,eAAe,aAAa;QACnC,MAAMC,IAAID;QAEV,IAAIF,WAAWG,EAAE,qBAAqB,GAAG;YACrC,OAAOA,EAAE,qBAAqB;QAClC;QAEA,oFAAoF;QACpF,4DAA4D;QAC5D,IAAIA,EAAE,iBAAiB,KAAK,MAAM,OAAO;QACzC,IAAIA,EAAE,iBAAiB,KAAK,OAAO,OAAO;IAC9C;IAEA,wFAAwF;IACxF,wFAAwF;IACxF,qFAAqF;IACrF,8FAA8F;IAC9F,6FAA6F;IAC7F,iFAAiF;IACjF,0DAA0D;IAC1D,IAAI,OAAOC,YAAY,eAAeA,QAAQ,GAAG,IAAI,MAAM;QACvD,IAAIJ,WAAWI,QAAQ,GAAG,CAAC,iBAAiB,GAAG;YAC3C,OAAOA,QAAQ,GAAG,CAAC,iBAAiB;QACxC;QAEA,MAAMC,QAAQD,QAAQ,GAAG,CAAC,KAAK;QAC/B,IAAIC,UAAU,aAAaA,UAAU,KAAK,OAAO;QAEjD,MAAMC,MAAMF,YAAoB,EAAE;QAElC,wFAAwF;QACxF,wFAAwF;QACxF,oBAAoB;QACpB,IAAIE,QAAQ,SAASA,QAAQ,eAAe,OAAO;IACvD;IAEA,OAAO;AACX;AAEA,IAAIC,QAAkBN;AACtB,IAAIO,OAAOT,IAAI,CAACQ,MAAM;AAEtB;;;;;;CAMC,GACM,MAAME,cAAc,CAACC;IACxB,IAAIV,WAAWU,UAAU,OAAO;QAC5B,MAAM,IAAIC,MAAM,CAAC,mBAAmB,EAAED,KAAK,oBAAoB,EAAEZ,WAAW,IAAI,CAAC,OAAO;IAC5F;IAEAS,QAAQG;IACRF,OAAOT,IAAI,CAACW,KAAK;AACrB,EAAE;AAEK,MAAME,cAAc,IAAgBL,MAAM;AAEjD,uFAAuF,GAChF,MAAMM,gBAAgB;IACzBN,QAAQN;IACRO,OAAOT,IAAI,CAACQ,MAAM;AACtB,EAAE;AAEF;;;;;;CAMC,GACM,MAAMO,oBAAoB,CAAChC,KAA0B0B,QAAQT,IAAI,CAACjB,GAAG,CAAC;AAI7E,MAAMiC,OAAO,CAACjC,IAAckC,QAAuBC;IAC/C,IAAIT,OAAOT,IAAI,CAACjB,GAAG,EAAE;QACjB;IACJ;IAEA,4FAA4F;IAC5F,yFAAyF;IACzF,gCAAgC;IAC/BoC,OAAO,CAACF,OAAO,IAAkCC;AACtD;AAEO,MAAME,SAAS;IAClB,gGAAgG,GAChG,KAAK,CAAC,GAAGF,OAA0BF,KAAK,QAAQ,OAAOE;IACvD,MAAM,CAAC,GAAGA,OAA0BF,KAAK,QAAQ,QAAQE;IACzD,MAAM,CAAC,GAAGA,OAA0BF,KAAK,QAAQ,QAAQE;IACzD,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;IAC5D,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;IAC5D,yEAAyE,GACzE,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;AAChE,EAAE;;;;;;;;;;ACpJK,MAAMG,OAAO,CAACzE,OAAe0E,OAAe,CAAC;IAChD,sBAAsB;IACtB,+CAA+C;IAC/C,IAAIC,KAAK,aAAaD,MAAME,KAAK,aAAaF;IAE9C,IAAK,IAAItC,IAAI,GAAGyC,IAAYzC,IAAIpC,MAAM,MAAM,EAAEoC,IAAK;QAC/CyC,KAAK7E,MAAM,UAAU,CAACoC;QACtBuC,KAAKG,KAAK,IAAI,CAACH,KAAKE,IAAI;QACxBD,KAAKE,KAAK,IAAI,CAACF,KAAKC,IAAI;IAC5B;IAEAF,KAAKG,KAAK,IAAI,CAACH,KAAMA,OAAO,IAAK;IACjCA,MAAMG,KAAK,IAAI,CAACF,KAAMA,OAAO,IAAK;IAClCA,KAAKE,KAAK,IAAI,CAACF,KAAMA,OAAO,IAAK;IACjCA,MAAME,KAAK,IAAI,CAACH,KAAMA,OAAO,IAAK;IAElC,OAAO,aAAc,WAAUC,EAAC,IAAMD,CAAAA,OAAO;AACjD,EAAC;AAED;;;;;;;;;;;;;;CAcC,GACM,MAAMI,WAAW,CAAC/E,OAAe0E,OAAe,IAAI;IACvD,IAAID,OAAOC;IACX,IAAK,IAAItC,IAAI,GAAGA,IAAIpC,MAAM,MAAM,EAAEoC,IAAK;QACnCqC,OAASA,CAAAA,QAAQ,KAAKA,OAAQzE,MAAM,UAAU,CAACoC;IACnD;IACA,OAAOqC,SAAS,GAAG,qCAAqC;AAC5D,EAAC;AAED;;;;;;;;;;;;;;;;CAgBC,GACM,SAASO,gBAAgBC,GAAY,EAAEC,WAAmB,CAAC,EAAEC,eAAuB,CAAC;IACxF,IAAIF,QAAQ,MAAM,OAAO;IACzB,IAAIA,QAAQG,WAAW,OAAO;IAE9B,MAAMC,OAAO,OAAOJ;IAEpB,OAAQI;QACJ,KAAK;YACD,OAAO,CAAC,CAAC,EAAEJ,IAAI,CAAC,CAAC;QACrB,KAAK;QACL,KAAK;YACD,OAAOK,OAAOL;QAClB,KAAK;YACD,OAAO,CAAC,WAAW,EAAEM,gBAAgBN,KAAiB,CAAC,CAAC;QAC5D,KAAK;YACD,IAAIE,gBAAgBD,UAAU;gBAC1B,OAAO;YACX;YACA,OAAOM,qBAAqBP,KAAKC,UAAUC;QAC/C;YACI,OAAO,CAAC,CAAC,EAAEE,KAAK,CAAC,CAAC;IAC1B;AACJ;AAEA,SAASE,gBAAgBE,EAAY;IACjC,MAAMpE,OAAOoE,GAAG,IAAI;IACpB,OAAOpE,QAAQ;AACnB;AAEA,SAASqE,oBAAoBT,GAAQ;IACjC,MAAMpE,aAAkC,CAAC;IAEzC,IAAK,MAAM2B,OAAOyC,IAAK;QACnB,IAAIA,IAAI,cAAc,CAACzC,MAAM;YACzB3B,UAAU,CAAC2B,IAAI,GAAGyC,GAAG,CAACzC,IAAI;QAC9B;IACJ;IAEA,OAAO3B;AACX;AAEA,SAAS2E,qBAAqBP,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC1E,IAAIF,QAAQ,MAAM,OAAO;IAEzB,IAAIA,eAAe/B,MAAM;QACrB,OAAO,CAAC,KAAK,EAAE+B,IAAI,WAAW,GAAG,CAAC,CAAC;IACvC;IAEA,IAAIA,eAAejB,OAAO;QACtB,OAAO,CAAC,MAAM,EAAEiB,IAAI,OAAO,CAAC,CAAC,CAAC;IAClC;IAEA,IAAIA,eAAeU,QAAQ;QACvB,OAAOV,IAAI,QAAQ;IACvB;IAEA,IAAIpF,MAAM,OAAO,CAACoF,MAAM;QACpB,OAAOW,eAAeX,KAAKC,UAAUC;IACzC;IAEA,IAAIF,IAAI,WAAW,IAAIA,IAAI,WAAW,CAAC,IAAI,KAAK,UAAU;QACtD,OAAOY,uBAAuBZ,KAAKC,UAAUC;IACjD;IAEA,OAAOW,qBAAqBb,KAAKC,UAAUC;AAC/C;AAEA,SAASS,eAAeG,GAAU,EAAEb,QAAgB,EAAEC,YAAoB;IACtE,IAAIY,IAAI,MAAM,KAAK,GAAG,OAAO;IAE7B,MAAMtD,QAAQsD,IAAI,KAAK,CAAC,GAAG,GAAG,GAAG,CAACnE,CAAAA,OAC9BoD,gBAAgBpD,MAAMsD,UAAUC,eAAe;IAGnD,MAAMa,SAASD,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAEA,IAAI,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAClE,OAAO,CAAC,CAAC,EAAEtD,MAAM,IAAI,CAAC,QAAQuD,OAAO,CAAC,CAAC;AAC3C;AAEA,SAASH,uBAAuBZ,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC5E,MAAMc,YAAYhB,IAAI,WAAW,CAAC,IAAI;IACtC,MAAMpE,aAAa6E,oBAAoBT;IAEvC,IAAIiB,OAAO,IAAI,CAACrF,YAAY,MAAM,KAAK,GAAG;QACtC,OAAO,GAAGoF,UAAU,GAAG,CAAC;IAC5B;IAEA,MAAME,QAAQD,OAAO,OAAO,CAACrF,YACxB,KAAK,CAAC,GAAG,GACT,GAAG,CAAC,CAAC,CAAC2B,KAAKxC,MAAM;QACd,MAAMoG,cAAcpG,UAAU,QAAQA,UAAUoF,aAC3C,OAAOpF,UAAU,YAAY,OAAOA,UAAU;QACnD,MAAMqG,QAAQD,cAAcjB,eAAeA,eAAe;QAC1D,OAAO,GAAG3C,IAAI,EAAE,EAAEwC,gBAAgBhF,OAAOkF,UAAUmB,QAAQ;IAC/D;IAEJ,MAAML,SAASE,OAAO,IAAI,CAACrF,YAAY,MAAM,GAAG,IAC5C,CAAC,MAAM,EAAEqF,OAAO,IAAI,CAACrF,YAAY,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAE1D,OAAO,GAAGoF,UAAU,GAAG,EAAEE,MAAM,IAAI,CAAC,QAAQH,OAAO,EAAE,CAAC;AAC1D;AAEA,SAASF,qBAAqBb,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC1E,MAAMtE,aAAa6E,oBAAoBT;IAEvC,IAAIiB,OAAO,IAAI,CAACrF,YAAY,MAAM,KAAK,GAAG;QACtC,OAAO;IACX;IAEA,MAAMsF,QAAQD,OAAO,OAAO,CAACrF,YACxB,KAAK,CAAC,GAAG,GACT,GAAG,CAAC,CAAC,CAAC2B,KAAKxC,MAAM;QACd,MAAMoG,cAAcpG,UAAU,QAAQA,UAAUoF,aAC3C,OAAOpF,UAAU,YAAY,OAAOA,UAAU;QACnD,MAAMqG,QAAQD,cAAcjB,eAAeA,eAAe;QAC1D,OAAO,GAAG3C,IAAI,EAAE,EAAEwC,gBAAgBhF,OAAOkF,UAAUmB,QAAQ;IAC/D;IAEJ,MAAML,SAASE,OAAO,IAAI,CAACrF,YAAY,MAAM,GAAG,IAC5C,CAAC,MAAM,EAAEqF,OAAO,IAAI,CAACrF,YAAY,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAE1D,OAAO,CAAC,EAAE,EAAEsF,MAAM,IAAI,CAAC,QAAQH,OAAO,EAAE,CAAC;AAC7C;;;;;;;;;ACpLO,MAAMM,OAAO,CAACjE,SAAiB,EAAE;IACpC,MAAMkE,QAAQ;IACd,MAAMC,aAAaD,MAAM,MAAM;IAC/B,IAAIE,SAAS;IAEb,IAAK,IAAIrE,IAAI,GAAGA,IAAIC,QAAQD,IAAK;QAC7BqE,UAAUF,KAAK,CAACzB,KAAK,MAAM,KAAK0B,aAAa,EAAE;IACnD;IACA,OAAOC;AACX,EAAC;AAED,MAAMC,YAAY;AAClB,MAAMC,gBAAgB;AAEtB,MAAMC,YACF,OAAOC,WAAW,eAAe,OAAOA,OAAO,eAAe,KAAK;AAEvE,MAAMC,gBACF,OAAOD,WAAW,eAAe,OAAOA,OAAO,UAAU,KAAK;AAE3D,MAAME,SAAS;IAClB,IAAID,eAAe;QACf,OAAOD,OAAO,UAAU;IAC5B;IAEA,OAAOG;AACX,EAAE;AAEF,MAAMA,iBAAiB;IACnB,IAAIC,cAAiC;IACrC,IAAIL,WAAW;QACXK,cAAcJ,OAAO,eAAe,CAAC,IAAIK,WAAW;IACxD;IAEA,IAAIC,YAAY;IAChB,IAAIb,OAAO;IAEX,IAAK,IAAIlE,IAAI,GAAGA,IAAIuE,cAAc,MAAM,EAAEvE,IAAK;QAC3C,MAAMgF,IAAIT,aAAa,CAACvE,EAAE;QAC1B,IAAIgF,MAAM,KAAK;YACXd,QAAQ;YACR;QACJ;QAEA,IAAIe;QACJ,IAAIT,aAAaK,aAAa;YAC1B,2CAA2C;YAC3CI,IACKjF,IAAI,MAAM,IACL6E,WAAW,CAACE,UAAU,IAAI,IAC1BF,WAAW,CAACE,YAAY,GAAG;QACzC,OAAO;YACHE,IAAIvC,KAAK,KAAK,CAACA,KAAK,MAAM,KAAK;QACnC;QAEA,IAAIsC,MAAM,KAAK;YACXd,QAAQI,SAAS,CAACW,EAAE;QACxB,OAAO,IAAID,MAAM,KAAK;YAClB,8BAA8B;YAC9Bd,QAAQI,SAAS,CAAEW,IAAI,MAAO,IAAI;QACtC,OAAO,IAAID,MAAM,KAAK;YAClBd,QAAQ;QACZ;IACJ;IAEA,OAAOA;AACX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClEA;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACNO,MAAMgB,QAAQ,CAAe9H,MAAW+H;IAE3C,MAAMd,SAAS,IAAItF;IAEnB,IAAK,IAAIiB,IAAI,GAAGA,IAAI5C,KAAK,MAAM,EAAE4C,IAAK;QAClC,MAAMR,OAAOpC,IAAI,CAAC4C,EAAE;QACpB,MAAMI,MAAM+E,YAAY3F;QACxB6E,OAAO,GAAG,CAACjE,KAAKZ;IACpB;IAEA,OAAO6E;AACX,EAAC;;;;;;;ACXM,MAAMe,OAAO,CAAY5F;IAC5B,OAAOA;AACX,EAAC;AAEM,SAAS6F,MAAoBjI,IAAO;IACvC,OAAOkI,KAAK,KAAK,CAACA,KAAK,SAAS,CAAClI;AACrC;;;ACNO,MAAMmI,gBAAgB,IAAM,OAAOlE,YAAY,eAClDA,QAAQ,QAAQ,IAAI,QACpBA,QAAQ,QAAQ,CAAC,IAAI,IAAI,KAAK;;;;;ACC3B,MAAMmE,4BAA4B,CAACC,OAAiCpB,QAA2BqB;IAClG,kFAAkF;IAClF,gEAAgE;IAChE,KAAK,MAAM,CAACC,UAAUC,QAAQ,IAAIH,MAAM,SAAS,CAAE;QAE/C,MAAMI,2BAA2BxB,OAAO,GAAG,CAACsB;QAC5C,MAAMG,2BAA2BJ,mBAAmB,OAAO,CAACC;QAE5D,2BAA2B;QAC3BG,yBAAyB,OAAO,GAAGF,QAAQ,OAAO;QAElD,2BAA2B;QAC3BE,yBAAyB,OAAO,GAAGF,QAAQ,OAAO;QAElD,6DAA6D;QAC7D,6DAA6D;QAC7D,oBAAoB;QACpBE,yBAAyB,IAAI,GAAGD,yBAAyB,IAAI;IACjE;AACJ,EAAC;;;;;ACtByD;AAEnD,MAAME,iCAAiC,CAAI,GAAGC;IACjD,MAAM3B,SAAS,IAAIvF,qDAAsBA;IAEzC,IAAK,IAAIkB,IAAI,GAAGC,SAAS+F,YAAY,MAAM,EAAEhG,IAAIC,QAAQD,IAAK;QAC1D,MAAMiG,aAAaD,WAAW,CAAChG,EAAE;QAEjC,yBAAyB;QACzBiG,WAAW,OAAO,CAACzG,CAAAA;YACf6E,OAAO,GAAG,CAAC7E,KAAK,IAAI,EAAEA,KAAK,KAAK;QACpC;IACJ;IAEA,OAAO6E;AACX,EAAC;;;ACDM,MAAM6B,eAAe,CAACT;IAEzB,MAAMpB,SAAgC,EAAE;IACxC,KAAK,MAAM,CAACsB,UAAUC,QAAQ,IAAIH,MAAM,SAAS,CAAE;QAE/C,IAAIG,QAAQ,QAAQ,KAAK,OAAO;YAC5B;QACJ;QAEA,IAAIA,QAAQ,IAAI,CAAC,MAAM,GAAG,GAAG;YACzBvB,OAAO,IAAI,IAAIuB,QAAQ,IAAI,CAAC,GAAG,CAACO,CAAAA;gBAC5B,OAAO;oBAACR;oBAAsB;wBAAE,MAAM;4BAAE,GAAGQ,GAAG;wBAAC;wBAAG,MAAM;oBAAM;iBAAE;YACpE;QACJ;QAEA,IAAIP,QAAQ,OAAO,CAAC,MAAM,GAAG,GAAG;YAC5BvB,OAAO,IAAI,IAAIuB,QAAQ,OAAO,CAAC,GAAG,CAACQ,CAAAA;gBAC/B,OAAO;oBAACT;oBAAsB;wBAAE,MAAM;4BAAE,GAAGS,MAAM;wBAAC;wBAAG,MAAM;oBAAS;iBAAE;YAC1E;QACJ;QAEA,IAAIR,QAAQ,OAAO,CAAC,MAAM,GAAG,GAAG;YAC5BvB,OAAO,IAAI,IAAIuB,QAAQ,OAAO,CAAC,GAAG,CAACS,CAAAA;gBAC/B,OAAO;oBAACV;oBAAsB;wBAAE,MAAM;4BAAE,GAAGU,MAAM;wBAAC;wBAAG,MAAM;oBAAS;iBAAE;YAC1E;QACJ;IACJ;IAEA,OAAOhC;AACX,EAAC;;;AC3CM,MAAMiC,OAAO,CAAC,GAAGC,SAAmB,EAAE;;;ACAtC,MAAMC,aAAa,CAAI5I;IAC1B,OAAOA;AACX,EAAC;;;;;ACFwB;AACC;AACF;AACE;AACA;AACH;AACO;AACN;AACiB;AACJ;AACT;AACC;AACJ"}
+{"version":3,"file":"utilities/index.cjs","sources":["webpack://@routier/core/./src/assertions/index.ts","webpack://@routier/core/./src/expressions/utils.ts","webpack://@routier/core/./src/plugins/query/QueryOptionsCollection.ts","webpack://@routier/core/./src/utilities/dates.ts","webpack://@routier/core/./src/utilities/logger.ts","webpack://@routier/core/./src/utilities/strings.ts","webpack://@routier/core/./src/utilities/uuid.ts","webpack://@routier/core/webpack/runtime/define_property_getters","webpack://@routier/core/webpack/runtime/has_own_property","webpack://@routier/core/webpack/runtime/make_namespace_object","webpack://@routier/core/./src/utilities/arrays.ts","webpack://@routier/core/./src/utilities/objects.ts","webpack://@routier/core/./src/utilities/runtime.ts","webpack://@routier/core/./src/utilities/replication.ts","webpack://@routier/core/./src/utilities/queryOptionsCollection.ts","webpack://@routier/core/./src/utilities/dbPluginEventUtils.ts","webpack://@routier/core/./src/utilities/functions.ts","webpack://@routier/core/./src/utilities/unsafeCast.ts","webpack://@routier/core/./src/utilities/index.ts"],"sourcesContent":["import { EXPRESSION_TYPES } from \"../expressions/constants\";\nimport { ComparatorExpression, EmptyExpression, Expression, ExpressionType, NotParsableExpression, OperatorExpression, PropertyExpression, ValueExpression } from \"../expressions/types\";\nimport { isDate } from \"../utilities\";\n\nexport function assertDate(data: unknown): asserts data is Date {\n    if (isDate(data) === false) {\n        throw new TypeError('Value is not a Date');\n    }\n}\n\nexport function assertIsNotNull<T>(data: T | null | undefined, message?: string | (() => string)): asserts data is NonNullable<T> {\n    if (data == null) {\n        if (message == null) {\n            throw new TypeError('Assertion failed, data is null');\n        }\n\n        if (typeof message === \"string\") {\n            throw new TypeError(message);\n        }\n\n        throw new TypeError(message());\n    }\n}\n\nexport function assertIsArray<T>(data: unknown, message?: string): asserts data is T[] {\n    if (!Array.isArray(data)) {\n        throw new TypeError(message ?? 'Assertion failed, data is not of type Array');\n    }\n}\n\nexport function assertString(data: unknown, message?: string): asserts data is string {\n    if (typeof data !== \"string\") {\n        throw new TypeError(message ?? 'Assertion failed, data is not of type String');\n    }\n}\n\nexport function assertInstanceOf<T extends new (...args: any[]) => any>(value: unknown, Instance: T): asserts value is T {\n    if (value instanceof Instance) {\n        return;\n    }\n\n    if (value != null && typeof value === \"object\" && \"constructor\" in value) {\n        throw new TypeError(`value is not instance of type.  Type: ${value.constructor.name}`);\n    }\n\n    throw new TypeError(`value is not instance of type`);\n}\n\nexport function assertIsNumber(value: unknown): asserts value is number {\n    if (typeof value !== \"number\") {\n        throw new TypeError(\"value is not of type `number`\");\n    }\n}\n\n\nfunction isObjectWithType(value: unknown): value is Record<\"type\", unknown> {\n    return typeof value === \"object\" && value !== null && \"type\" in value;\n}\n\n/**\n * Type guard: narrows `value` to `Expression` when it is an object with a valid `type` property.\n */\nexport function isExpression(value: unknown): value is Expression {\n    return isObjectWithType(value) && EXPRESSION_TYPES.includes(value.type as ExpressionType);\n}\n\n/**\n * Type guard: narrows `value` to `OperatorExpression` when it is an object with `type === \"operator\"`.\n */\nexport function isOperatorExpression(value: unknown): value is OperatorExpression {\n    return isObjectWithType(value) && value.type === \"operator\";\n}\n\n/**\n * Type guard: narrows `value` to `ComparatorExpression` when it is an object with `type === \"comparator\"`.\n */\nexport function isComparatorExpression(value: unknown): value is ComparatorExpression {\n    return isObjectWithType(value) && value.type === \"comparator\";\n}\n\n/**\n * Type guard: narrows `value` to `PropertyExpression` when it is an object with `type === \"property\"`.\n */\nexport function isPropertyExpression(value: unknown): value is PropertyExpression {\n    return isObjectWithType(value) && value.type === \"property\";\n}\n\n/**\n * Type guard: narrows `value` to `ValueExpression` when it is an object with `type === \"value\"`.\n */\nexport function isValueExpression(value: unknown): value is ValueExpression {\n    return isObjectWithType(value) && value.type === \"value\";\n}\n\n/**\n * Type guard: narrows `value` to `EmptyExpression` when it is an object with `type === \"empty\"`.\n */\nexport function isEmptyExpression(value: unknown): value is EmptyExpression {\n    return isObjectWithType(value) && value.type === \"empty\";\n}\n\n/**\n * Type guard: narrows `value` to `NotParsableExpression` when it is an object with `type === \"not-parsable\"`.\n */\nexport function isNotParsableExpression(value: unknown): value is NotParsableExpression {\n    return isObjectWithType(value) && value.type === \"not-parsable\";\n}","import { PropertyInfo } from \"../schema\";\nimport { Expression, PropertyExpression } from \"./types\";\n\n/**\n * Extracts all properties referenced in an expression\n * @param expression The expression to analyze\n * @returns Array of PropertyInfo objects referenced in the expression\n */\nexport function getProperties(expression: Expression): PropertyInfo<any>[] {\n    const properties: PropertyInfo<any>[] = [];\n\n    function traverse(expr: Expression) {\n        // If this is a property expression, add it to our collection\n        if (expr.type === \"property\") {\n            properties.push((expr as PropertyExpression).property);\n        }\n\n        // Traverse left and right expressions if they exist\n        if (expr.left) {\n            traverse(expr.left);\n        }\n        if (expr.right) {\n            traverse(expr.right);\n        }\n    }\n\n    traverse(expression);\n    return properties;\n}\n\nexport function forEach(expression: Expression, callback: (expression: Expression) => boolean) {\n    function traverse(expr: Expression): boolean {\n        // Call the callback for this expression\n        // If callback returns false, stop traversing\n        if (!callback(expr)) {\n            return false;\n        }\n\n        // Traverse left and right expressions if they exist\n        if (expr.left) {\n            if (!traverse(expr.left)) {\n                return false;\n            }\n        }\n        if (expr.right) {\n            if (!traverse(expr.right)) {\n                return false;\n            }\n        }\n\n        return true;\n    }\n\n    traverse(expression);\n}","import { isPropertyExpression } from \"../../assertions\";\nimport { forEach } from \"../../expressions/utils\";\nimport { MemoryExecutionReason, QueryOption, QueryOptionName, QueryOptionExecutionTarget, QueryOptionValueMap } from \"./types\";\n\nexport type QueryCollectionItem<T, K extends QueryOptionName> = { index: number, option: QueryOption<T, K> };\n\nexport class QueryOptionsCollection<T> {\n\n    private options: Map<QueryOptionName, QueryCollectionItem<any, any>[]> = new Map<QueryOptionName, QueryCollectionItem<any, any>[]>();\n    private nextExecutionTarget: QueryOptionExecutionTarget = \"database\";\n    private nextExecutionReason: MemoryExecutionReason | null = null;\n    private nextIndex: number = 0;\n    private enumeratedItems: QueryCollectionItem<any, any>[] = [];\n\n    /** Cuts over to memory execution, keeping the first cause. See `MemoryExecutionReason`. */\n    private cutOverToMemory(reason: MemoryExecutionReason) {\n        this.nextExecutionTarget = \"memory\";\n\n        if (this.nextExecutionReason == null) {\n            this.nextExecutionReason = reason;\n        }\n    }\n\n    /**\n     * True when `split()` or `splitAt()` produced this collection.\n     *\n     * Those rebuild each half by re-adding its options, which re-derives execution targets\n     * without the options that caused them — a post-join filter alone in the memory half\n     * derives back to `\"database\"`. Anything reading `target` as a report of where work runs\n     * has to reject a derived collection; see `explainQuery`.\n     */\n    private derived: boolean = false;\n\n    get isDerived() {\n        return this.derived;\n    }\n\n    get items() {\n        return this.options;\n    }\n\n    get isEmpty() {\n        return this.items.size === 0;\n    }\n\n    static EMPTY<R>() {\n        return new QueryOptionsCollection<R>();\n    }\n\n    static isEmpty<T>(options: QueryOptionsCollection<T>) {\n        return options.isEmpty;\n    }\n\n    add<K extends QueryOptionName>(name: K, value: QueryOption<T, K>[\"value\"]) {\n\n        if (name === \"map\") {\n            const mapValue = value as QueryOptionValueMap<T>[\"map\"];\n\n            // Evaluate the map value to see if we are renaming properties, \n            // if we are we need to perform everything after in memory\n            if (mapValue.fields.some(x => x.isRename === true) || mapValue.fields.some(x => x.property?.isUnmapped === true)) {\n                // Cut over to memory execution since we are renaming a property with .map\n                // We do not want to figure out how the new name flows through the entire query\n                this.cutOverToMemory(\"map-rename\");\n            }\n        }\n\n        if (name === \"filter\") {\n            // Need to check for unmapped and renamed properties\n            const filterValue = value as QueryOptionValueMap<T>[\"filter\"];\n\n            // A tautology (`x => true`) filters nothing — skip it entirely so\n            // plugins never see it\n            if (filterValue.expression.type === \"empty\") {\n                return;\n            }\n\n            if (filterValue.expression.type === \"not-parsable\") {\n                this.cutOverToMemory(\"not-parsable\");\n            } else {\n                forEach(filterValue.expression, (expression) => {\n\n                    if (isPropertyExpression(expression) && expression.property.isUnmapped) {\n                        // Cut over to memory execution, unmapped properties are not in the database and\n                        // cannot be queried\n                        this.cutOverToMemory(\"unmapped-property\");\n                        return false;\n                    }\n\n                    if (isPropertyExpression(expression) && expression.property.hasRenamedSegments) {\n                        // Cut over to memory execution: the plugin stores data under the\n                        // `from` (storage) names, but filter selectors reference the\n                        // in-memory names.  Memory execution runs after deserialization,\n                        // where the in-memory names exist\n                        this.cutOverToMemory(\"renamed-property\");\n                        return false;\n                    }\n\n                    return true;\n                });\n            }\n        }\n\n        if (name === \"sort\") {\n            const sortValue = value as QueryOptionValueMap<T>[\"sort\"];\n\n            // Same rule as filters: sort selectors reference in-memory names, which\n            // only exist after deserialization when the property is renamed or unmapped\n            if (sortValue.property != null && sortValue.property.isUnmapped) {\n                this.cutOverToMemory(\"unmapped-property\");\n            } else if (sortValue.property != null && sortValue.property.hasRenamedSegments) {\n                this.cutOverToMemory(\"renamed-property\");\n            }\n        }\n\n        if (name === \"nearest\") {\n            const nearestValue = value as QueryOptionValueMap<T>[\"nearest\"];\n\n            // Same rule as sort, and for the same reason: the plugin stores the vector under\n            // the `from` name, and an unmapped property is not stored at all. Both are only\n            // readable after deserialization, which is where memory execution runs.\n            //\n            // This is also what lets every translator's in-memory fallback read the column by\n            // its resolved name — anything whose storage name differs never reaches them.\n            if (nearestValue.property != null && nearestValue.property.isUnmapped) {\n                this.cutOverToMemory(\"unmapped-property\");\n            } else if (nearestValue.property != null && nearestValue.property.hasRenamedSegments) {\n                this.cutOverToMemory(\"renamed-property\");\n            }\n        }\n\n        if (name === \"join\") {\n            const joinValue = value as QueryOptionValueMap<T>[\"join\"];\n\n            // A join whose two sides live on different plugins cannot be sent to EITHER of\n            // them — neither can read the other's rows — so the option itself belongs to the\n            // memory half, where the datastore interprets it.\n            //\n            // Set BEFORE the item is created, unlike `nearest`'s ratchet below, because this\n            // moves the join option itself rather than everything after it.\n            if (joinValue.crossPlugin === true) {\n                this.cutOverToMemory(\"cross-plugin-join\");\n            }\n        }\n\n        const item: QueryCollectionItem<T, K> = {\n            index: this.nextIndex,\n            option: {\n                name,\n                target: this.nextExecutionTarget,\n                value,\n                ...(this.nextExecutionReason == null ? {} : { reason: this.nextExecutionReason })\n            }\n        }\n\n        this.nextIndex++;\n\n        const found = this.options.get(name);\n\n        this.options.set(name, [...found ?? [], item]);\n\n        if (name === \"nearest\") {\n            // Everything AFTER a similarity search runs in memory, whatever the backend.\n            //\n            // Whether the search was pushed down is a fact about the plugin, which this\n            // collection cannot see — so a later option is only safe if it runs after the\n            // scoring definitely happened, and in memory is the only place that is true of.\n            //\n            // The failure this prevents is silent. `.nearest(x => x.embedding, v, 10).take(3)`\n            // sends `LIMIT 3` to a backend that ignored the ordering, so three arbitrary rows\n            // come back and get scored — three real rows, in a plausible order, and not the\n            // three nearest. Nothing errors.\n            //\n            // A plugin that DID push the search down loses nothing but the chance to also\n            // push down what follows it, which is a limit over ten rows.\n            this.cutOverToMemory(\"after-nearest\");\n        }\n\n        if (name === \"join\") {\n            // Everything AFTER a join runs in memory, for the same reason as `nearest`: this\n            // collection cannot see HOW the plugin executed the join, and the rows it produced\n            // are TUPLES rather than entities of the root schema.\n            //\n            // A `take` sent to a backend that hash-joined in its translator would limit the\n            // OUTER rows read, not the pairs produced — a plausible-looking result with the\n            // wrong number of rows in it. Conjuncts that can safely run earlier are split off\n            // by the query builder BEFORE dispatch, which is the only exception.\n            this.cutOverToMemory(\"after-join\");\n        }\n    }\n\n    /**\n     * Splits the collection around the FIRST occurrence of `name`, preserving order.\n     *\n     * For a join: the options recorded before it operate on entity rows, the option itself\n     * produces tuples, and the ones after it operate on tuples. Three different shapes, so the\n     * caller has to run them in three steps rather than one pass.\n     */\n    splitAt<K extends QueryOptionName>(name: K): { before: QueryOptionsCollection<T>, at: QueryOption<T, K> | null, after: QueryOptionsCollection<T> } {\n        this.resolveEnumeration();\n\n        const sortedItems = this.enumeratedItems.toSorted((a, b) => a.index - b.index);\n        const before = new QueryOptionsCollection<T>();\n        const after = new QueryOptionsCollection<T>();\n\n        before.derived = true;\n        after.derived = true;\n        let at: QueryOption<T, K> | null = null;\n\n        for (let i = 0, length = sortedItems.length; i < length; i++) {\n            const { option } = sortedItems[i];\n\n            if (at == null && option.name === name) {\n                at = option as QueryOption<T, K>;\n                continue;\n            }\n\n            const destination = at == null ? before : after;\n            destination.add(option.name, option.value);\n        }\n\n        return { before, at, after };\n    }\n\n    /**\n     * Captures the collection's current state and returns a function that restores it.\n     *\n     * Terminal queryable operations (count, first, aggregates, …) record their option on\n     * the shared collection before executing. Without restoring, a re-executed terminal —\n     * the whole point of a subscribed queryable — stacks its option a second time and\n     * runs it over the first execution's scalar result.\n     */\n    snapshot(): () => void {\n        const options = new Map([...this.options.entries()].map(([key, items]): [QueryOptionName, QueryCollectionItem<any, any>[]] => [key, [...items]]));\n        const nextExecutionTarget = this.nextExecutionTarget;\n        const nextExecutionReason = this.nextExecutionReason;\n        const nextIndex = this.nextIndex;\n\n        return () => {\n            this.options = new Map(options);\n            this.nextExecutionTarget = nextExecutionTarget;\n            this.nextExecutionReason = nextExecutionReason;\n            this.nextIndex = nextIndex;\n            this.enumeratedItems = [];\n        };\n    }\n\n    split(): { memory: QueryOptionsCollection<T>, database: QueryOptionsCollection<T> } {\n        this.resolveEnumeration();\n\n        const sortedItems = this.enumeratedItems.toSorted((a, b) => a.index - b.index);\n        const memoryQueryOptionsCollection = new QueryOptionsCollection<T>();\n        const databaseQueryOptionsCollection = new QueryOptionsCollection<T>();\n\n        memoryQueryOptionsCollection.derived = true;\n        databaseQueryOptionsCollection.derived = true;\n\n        for (let i = 0, length = sortedItems.length; i < length; i++) {\n            const sortedItem = sortedItems[i];\n\n            if (sortedItem.option.target === \"database\") {\n                databaseQueryOptionsCollection.add(sortedItem.option.name, sortedItem.option.value);\n                continue;\n            }\n\n            memoryQueryOptionsCollection.add(sortedItem.option.name, sortedItem.option.value);\n        }\n\n        return {\n            memory: memoryQueryOptionsCollection,\n            database: databaseQueryOptionsCollection\n        }\n    }\n\n    hasTransformations(): boolean {\n        const transformationOptions: QueryOptionName[] = [\"map\", \"group\", \"min\", \"max\", \"count\", \"sum\"];\n        return transformationOptions.some((name) => this.options.has(name));\n    }\n\n    has<K extends QueryOptionName>(name: K): boolean {\n        return this.options.has(name);\n    }\n\n    get<K extends QueryOptionName>(name: K): QueryCollectionItem<T, K>[] {\n        return this.options.get(name) ?? [] as QueryCollectionItem<T, K>[];\n    }\n\n    getLast<K extends QueryOptionName>(name: K): QueryOption<T, K> | null {\n        this.resolveEnumeration();\n\n        for (let i = this.enumeratedItems.length - 1; i >= 0; i--) {\n            const item = this.enumeratedItems[i];\n\n            if (item.option.name === name) {\n                return item.option;\n            }\n        }\n\n        return null\n    }\n\n    getValues<K extends QueryOptionName>(name: K): QueryCollectionItem<T, K>[\"option\"][\"value\"][] | undefined {\n\n        const found = this.options.get(name);\n\n        if (found == null) {\n            return [];\n        }\n\n        return found.map(w => w.option.value) as QueryCollectionItem<T, K>[\"option\"][\"value\"][];\n    }\n\n    private getEnumeration() {\n        return [...this.options.values()].flat().toSorted((a, b) => a.index - b.index);\n    }\n\n    private resolveEnumeration() {\n        if (this.enumeratedItems.length != this.nextIndex) {\n            this.enumeratedItems = this.getEnumeration();\n        }\n    }\n\n    forEach(iterator: (item: QueryCollectionItem<T, any>[\"option\"]) => void) {\n        this.resolveEnumeration();\n\n        for (let i = 0, length = this.enumeratedItems.length; i < length; i++) {\n            iterator(this.enumeratedItems[i].option);\n        }\n    }\n}","export const isDate = (data: unknown): data is Date => {\n    if (data == null) {\n        return false;\n    }\n\n    if (typeof data !== \"object\") {\n        return false;\n    }\n\n    return data instanceof Date;\n}","/**\n * Levelled logging, resolved once.\n *\n * Three things about the previous implementation drove this shape:\n *\n *  - **There was no way to turn logging off.** `globalThis.__ROUTIER_DEBUG__` was only ever\n *    compared against `true`, so setting it to `false` did nothing — while\n *    `docs/how-to/debug-logging.md` documented exactly that as the way to force logging off.\n *    A documented switch that silently does nothing is worse than no switch.\n *  - **`NODE_ENV === 'test'` enabled it.** Every Jest run therefore logged, because Jest always\n *    sets `NODE_ENV=test`. Measured on the S7 stress scenario, which drives ~2,000 saves through\n *    a plugin that logs three lines per query: 12.4s with logging, ~6s without. Test runners also\n *    capture console output by snapshotting a stack trace per call, so the cost is far above what\n *    writing to a terminal would suggest — and the output buries whatever the failure was.\n *  - **It was all-or-nothing, and re-resolved per call.** An error could not be kept while debug\n *    was dropped, and every one of the ~97 call sites re-read `globalThis` and `process.env`.\n *\n * Levels are compared numerically against a value cached at module load. Measured against a\n * no-op console at 200k calls: an enabled call costs ~70ns, a call rejected by the gate ~3ns.\n * Building the arguments the call site passes in accounts for ~0.2ns of that 3ns, which is why\n * this keeps the ordinary `logger.debug(msg, payload)` signature instead of taking a thunk —\n * a lazy API would recover 0.3% of an enabled call's cost and would have to change every call\n * site to do it.\n */\n\n/** Ordered from most severe to most verbose. `silent` discards everything. */\nexport const LOG_LEVELS = ['silent', 'error', 'warn', 'info', 'debug'] as const;\n\nexport type LogLevel = (typeof LOG_LEVELS)[number];\n\n/** Numeric rank, so a gate is one integer comparison. */\nconst RANK: Record<LogLevel, number> = {\n    silent: 0,\n    error: 1,\n    warn: 2,\n    info: 3,\n    debug: 4,\n};\n\nconst isLogLevel = (value: unknown): value is LogLevel =>\n    typeof value === 'string' && (LOG_LEVELS as readonly string[]).includes(value);\n\n/**\n * Resolves the configured level, in precedence order.\n *\n * Ordered most specific first: an explicit level beats a boolean flag, a boolean flag beats an\n * environment variable, and an environment variable beats an inference from `NODE_ENV`. Anything\n * unrecognised is ignored rather than treated as an error — a typo'd level should not take down\n * an application, and `silent` is the safe direction to fall back to.\n */\nconst resolveLevel = (): LogLevel => {\n    if (typeof globalThis !== 'undefined') {\n        const g = globalThis as { __ROUTIER_LOG_LEVEL__?: unknown; __ROUTIER_DEBUG__?: unknown };\n\n        if (isLogLevel(g.__ROUTIER_LOG_LEVEL__)) {\n            return g.__ROUTIER_LOG_LEVEL__;\n        }\n\n        // Both directions honoured. `=== false` used to fall through to the NODE_ENV checks\n        // below and re-enable the logging it was asked to suppress.\n        if (g.__ROUTIER_DEBUG__ === true) return 'debug';\n        if (g.__ROUTIER_DEBUG__ === false) return 'silent';\n    }\n\n    // There is deliberately no `import.meta.env` branch, although the documentation used to\n    // promise one. It could never work: this package is bundled with rspack, which replaces\n    // `import.meta` with `undefined`, so the check would read the *library's* build-time\n    // environment rather than the application's — and referencing `import.meta` at all is a parse\n    // error under a CommonJS build target, which is how the test suite loads this file. Vite and\n    // similar apps set `__ROUTIER_LOG_LEVEL__` or `__ROUTIER_DEBUG__` from their own\n    // `import.meta.env`, which is what the docs now describe.\n    if (typeof process !== 'undefined' && process.env != null) {\n        if (isLogLevel(process.env.ROUTIER_LOG_LEVEL)) {\n            return process.env.ROUTIER_LOG_LEVEL as LogLevel;\n        }\n\n        const debug = process.env.DEBUG;\n        if (debug === 'routier' || debug === '*') return 'debug';\n\n        const env = process.env.NODE_ENV?.toLowerCase();\n\n        // `test` is deliberately absent. It used to be here, which meant no test suite anywhere\n        // could run Routier quietly. Opt in with DEBUG=routier or ROUTIER_LOG_LEVEL when a test\n        // needs the output.\n        if (env === 'dev' || env === 'development') return 'debug';\n    }\n\n    return 'silent';\n};\n\nlet level: LogLevel = resolveLevel();\nlet rank = RANK[level];\n\n/**\n * Overrides the level for the rest of the process.\n *\n * The configuration above is read once, at import, which is what makes the gate cheap — but it\n * also means an application that decides its verbosity after startup, or a test that wants to\n * assert on output, has no way in. This is that way in.\n */\nexport const setLogLevel = (next: LogLevel): void => {\n    if (isLogLevel(next) === false) {\n        throw new Error(`Unknown log level \"${next}\". Expected one of: ${LOG_LEVELS.join(', ')}`);\n    }\n\n    level = next;\n    rank = RANK[next];\n};\n\nexport const getLogLevel = (): LogLevel => level;\n\n/** Re-reads the environment. For tests that change it after this module was imported. */\nexport const resetLogLevel = (): void => {\n    level = resolveLevel();\n    rank = RANK[level];\n};\n\n/**\n * Whether a message at this level would be emitted.\n *\n * For the rare call site whose *arguments* are expensive to build — a serialization, a deep\n * clone, a join over a large collection. An ordinary payload object is not worth guarding; see\n * the measurement in the header.\n */\nexport const isLogLevelEnabled = (at: LogLevel): boolean => rank >= RANK[at];\n\ntype ConsoleMethod = 'log' | 'info' | 'warn' | 'error' | 'debug' | 'table';\n\nconst emit = (at: LogLevel, method: ConsoleMethod, args: unknown[]) => {\n    if (rank < RANK[at]) {\n        return;\n    }\n\n    // Resolved at call time rather than captured once: test harnesses and browser devtools both\n    // replace console methods after modules have loaded, and a captured reference would keep\n    // writing past the replacement.\n    (console[method] as (...a: unknown[]) => void)(...args);\n};\n\nexport const logger = {\n    /** General-purpose output. Carried at `info`, since `log` names a console method, not a level. */\n    log: (...args: unknown[]): void => emit('info', 'log', args),\n    info: (...args: unknown[]): void => emit('info', 'info', args),\n    warn: (...args: unknown[]): void => emit('warn', 'warn', args),\n    error: (...args: unknown[]): void => emit('error', 'error', args),\n    debug: (...args: unknown[]): void => emit('debug', 'debug', args),\n    /** Diagnostic tabular output; verbose by nature, so it sits at `debug`. */\n    table: (...args: unknown[]): void => emit('debug', 'table', args),\n};\n","export const hash = (value: string, seed: number = 0) => {\n    // From Stack Overflow\n    // https://stackoverflow.com/a/52171480/3329760\n    let h1 = 0xdeadbeef ^ seed, h2 = 0x41c6ce57 ^ seed;\n\n    for (let i = 0, ch: number; i < value.length; i++) {\n        ch = value.charCodeAt(i);\n        h1 = Math.imul(h1 ^ ch, 2654435761);\n        h2 = Math.imul(h2 ^ ch, 1597334677);\n    }\n\n    h1 = Math.imul(h1 ^ (h1 >>> 16), 2246822507);\n    h1 ^= Math.imul(h2 ^ (h2 >>> 13), 3266489909);\n    h2 = Math.imul(h2 ^ (h2 >>> 16), 2246822507);\n    h2 ^= Math.imul(h1 ^ (h1 >>> 13), 3266489909);\n\n    return 4294967296 * (2097151 & h2) + (h1 >>> 0);\n}\n\n/**\n * Fast string hash optimized for comparisons.\n * Uses djb2 algorithm - very fast and good distribution for short to medium strings.\n * Same input always produces same output (deterministic).\n * \n * @param value - The string to hash\n * @param seed - Optional seed value (default: 5381)\n * @returns A positive 32-bit integer hash value\n * \n * @example\n * ```ts\n * fastHash(\"test\") === fastHash(\"test\") // true\n * fastHash(\"test\") !== fastHash(\"test2\") // true\n * ```\n */\nexport const fastHash = (value: string, seed: number = 5381): number => {\n    let hash = seed;\n    for (let i = 0; i < value.length; i++) {\n        hash = ((hash << 5) + hash) + value.charCodeAt(i);\n    }\n    return hash >>> 0; // Convert to unsigned 32-bit integer\n}\n\n/**\n * Converts any value to a readable string representation.\n * Handles primitives, objects, arrays, classes, dates, errors, and functions.\n * Supports depth limiting to prevent infinite recursion on circular references.\n * \n * @param obj - The value to stringify\n * @param maxDepth - Maximum depth for nested objects (default: 3)\n * @param currentDepth - Current recursion depth (default: 0)\n * @returns String representation of the value\n * \n * @example\n * ```ts\n * stringifyObject({ name: \"test\", count: 5 }) // '{ name: \"test\", count: 5 }'\n * stringifyObject([1, 2, 3]) // '[1, 2, 3]'\n * stringifyObject(new Date()) // 'Date(2024-01-01T00:00:00.000Z)'\n * ```\n */\nexport function stringifyObject(obj: unknown, maxDepth: number = 3, currentDepth: number = 0): string {\n    if (obj === null) return 'null';\n    if (obj === undefined) return 'undefined';\n\n    const type = typeof obj;\n\n    switch (type) {\n        case 'string':\n            return `\"${obj}\"`;\n        case 'number':\n        case 'boolean':\n            return String(obj);\n        case 'function':\n            return `[Function: ${getFunctionName(obj as Function)}]`;\n        case 'object':\n            if (currentDepth >= maxDepth) {\n                return '[Max Depth Reached]';\n            }\n            return stringifyObjectValue(obj, maxDepth, currentDepth);\n        default:\n            return `[${type}]`;\n    }\n}\n\nfunction getFunctionName(fn: Function): string {\n    const name = fn.name;\n    return name || 'anonymous';\n}\n\nfunction getObjectProperties(obj: any): Record<string, any> {\n    const properties: Record<string, any> = {};\n\n    for (const key in obj) {\n        if (obj.hasOwnProperty(key)) {\n            properties[key] = obj[key];\n        }\n    }\n\n    return properties;\n}\n\nfunction stringifyObjectValue(obj: any, maxDepth: number, currentDepth: number): string {\n    if (obj === null) return 'null';\n\n    if (obj instanceof Date) {\n        return `Date(${obj.toISOString()})`;\n    }\n\n    if (obj instanceof Error) {\n        return `Error(${obj.message})`;\n    }\n\n    if (obj instanceof RegExp) {\n        return obj.toString();\n    }\n\n    if (Array.isArray(obj)) {\n        return stringifyArray(obj, maxDepth, currentDepth);\n    }\n\n    if (obj.constructor && obj.constructor.name !== 'Object') {\n        return stringifyClassInstance(obj, maxDepth, currentDepth);\n    }\n\n    return stringifyPlainObject(obj, maxDepth, currentDepth);\n}\n\nfunction stringifyArray(arr: any[], maxDepth: number, currentDepth: number): string {\n    if (arr.length === 0) return '[]';\n\n    const items = arr.slice(0, 5).map(item =>\n        stringifyObject(item, maxDepth, currentDepth + 1)\n    );\n\n    const suffix = arr.length > 5 ? `... (+${arr.length - 5} more)` : '';\n    return `[${items.join(', ')}${suffix}]`;\n}\n\nfunction stringifyClassInstance(obj: any, maxDepth: number, currentDepth: number): string {\n    const className = obj.constructor.name;\n    const properties = getObjectProperties(obj);\n\n    if (Object.keys(properties).length === 0) {\n        return `${className} {}`;\n    }\n\n    const props = Object.entries(properties)\n        .slice(0, 5)\n        .map(([key, value]) => {\n            const isPrimitive = value === null || value === undefined ||\n                (typeof value !== 'object' && typeof value !== 'function');\n            const depth = isPrimitive ? currentDepth : currentDepth + 1;\n            return `${key}: ${stringifyObject(value, maxDepth, depth)}`;\n        });\n\n    const suffix = Object.keys(properties).length > 5 ?\n        `... (+${Object.keys(properties).length - 5} more)` : '';\n\n    return `${className} { ${props.join(', ')}${suffix} }`;\n}\n\nfunction stringifyPlainObject(obj: any, maxDepth: number, currentDepth: number): string {\n    const properties = getObjectProperties(obj);\n\n    if (Object.keys(properties).length === 0) {\n        return '{}';\n    }\n\n    const props = Object.entries(properties)\n        .slice(0, 5)\n        .map(([key, value]) => {\n            const isPrimitive = value === null || value === undefined ||\n                (typeof value !== 'object' && typeof value !== 'function');\n            const depth = isPrimitive ? currentDepth : currentDepth + 1;\n            return `${key}: ${stringifyObject(value, maxDepth, depth)}`;\n        });\n\n    const suffix = Object.keys(properties).length > 5 ?\n        `... (+${Object.keys(properties).length - 5} more)` : '';\n\n    return `{ ${props.join(', ')}${suffix} }`;\n}","export const uuid = (length: number = 16): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n    const charLength = chars.length;\n    let result = '';\n\n    for (let i = 0; i < length; i++) {\n        result += chars[Math.random() * charLength | 0];\n    }\n    return result;\n}\n\nconst HEX_CHARS = '0123456789abcdef';\nconst UUID_TEMPLATE = 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx';\n\nconst hasCrypto =\n    typeof crypto !== 'undefined' && typeof crypto.getRandomValues === 'function';\n\nconst hasRandomUUID =\n    typeof crypto !== 'undefined' && typeof crypto.randomUUID === 'function';\n\nexport const uuidv4 = (): string => {\n    if (hasRandomUUID) {\n        return crypto.randomUUID();\n    }\n\n    return uuidv4Fallback();\n};\n\nconst uuidv4Fallback = (): string => {\n    let randomBytes: Uint8Array | null = null;\n    if (hasCrypto) {\n        randomBytes = crypto.getRandomValues(new Uint8Array(16));\n    }\n\n    let byteIndex = 0;\n    let uuid = '';\n\n    for (let i = 0; i < UUID_TEMPLATE.length; i++) {\n        const c = UUID_TEMPLATE[i];\n        if (c === '-') {\n            uuid += '-';\n            continue;\n        }\n\n        let r: number;\n        if (hasCrypto && randomBytes) {\n            // Each byte gives two hex digits (nibbles)\n            r =\n                (i % 2 === 0\n                    ? randomBytes[byteIndex] >> 4\n                    : randomBytes[byteIndex++] & 0x0f);\n        } else {\n            r = Math.floor(Math.random() * 16);\n        }\n\n        if (c === 'x') {\n            uuid += HEX_CHARS[r];\n        } else if (c === 'y') {\n            // Variant bits: 8, 9, A, or B\n            uuid += HEX_CHARS[(r & 0x3) | 0x8];\n        } else if (c === '4') {\n            uuid += '4';\n        }\n    }\n\n    return uuid;\n};\n","__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n        if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n            Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n        }\n    }\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","export const toMap = <T extends {}>(data: T[], keySelector: (item: T) => T[keyof T] | string) => {\n\n    const result = new Map<T[keyof T] | string, T>();\n\n    for (let i = 0; i < data.length; i++) {\n        const item = data[i];\n        const key = keySelector(item);\n        result.set(key, item);\n    }\n\n    return result;\n}\n","export const cast = <TIn, TOut>(item: TIn) => {\n    return item as unknown as TOut;\n}\n\nexport function clone<T extends {}>(data: T): T {\n    return JSON.parse(JSON.stringify(data)) as T;\n}","export const isNodeRuntime = () => typeof process !== 'undefined' &&\n    process.versions != null &&\n    process.versions.node != null;","import { BulkPersistResult, BulkPersistChanges } from \"../collections\";\nimport { DbPluginBulkPersistEvent } from \"../plugins\";\n\nexport const resolveBulkPersistChanges = (event: DbPluginBulkPersistEvent, result: BulkPersistResult, bulkPersistChanges: BulkPersistChanges) => {\n    // make sure we swap the adds here, that way we can make sure other persist events\n    // don't take their additions and try to change subsequent calls\n    for (const [schemaId, changes] of event.operation) {\n\n        const schemmaBulkPersistResult = result.get(schemaId);\n        const schemaBulkPersistChanges = bulkPersistChanges.resolve(schemaId);\n\n        // Set the original removes\n        schemaBulkPersistChanges.removes = changes.removes;\n\n        // Set the original updates\n        schemaBulkPersistChanges.updates = changes.updates;\n\n        // Take the adds from the result and set them to be persisted\n        // in the replicated plugins because the id's are set in the \n        // memory data store\n        schemaBulkPersistChanges.adds = schemmaBulkPersistResult.adds;\n    }\n}","import { QueryOptionsCollection } from \"../plugins/query\";\n\nexport const combineQueryOptionsCollections = <T>(...collections: QueryOptionsCollection<T>[]) => {\n    const result = new QueryOptionsCollection<T>();\n\n    for (let i = 0, length = collections.length; i < length; i++) {\n        const collection = collections[i];\n\n        // Add scoped items first\n        collection.forEach(item => {\n            result.add(item.name, item.value);\n        });\n    }\n\n    return result;\n}","import { InferCreateType, InferType, SchemaId } from \"../schema\";\nimport { DbPluginBulkPersistEvent, EntityUpdateInfo } from \"../plugins\";\n\ntype DbEvent = {\n    type: \"add\",\n    data: InferCreateType<unknown>;\n} | {\n    type: \"update\",\n    data: EntityUpdateInfo<unknown>;\n} | {\n    type: \"remove\",\n    data: InferType<unknown>;\n}\n\nexport const toEventArray = (event: DbPluginBulkPersistEvent): [SchemaId, DbEvent][] => {\n\n    const result: [SchemaId, DbEvent][] = [];\n    for (const [schemaId, changes] of event.operation) {\n\n        if (changes.hasItems === false) {\n            continue;\n        }\n\n        if (changes.adds.length > 0) {\n            result.push(...changes.adds.map(add => {\n                return [schemaId as SchemaId, { data: { ...add }, type: \"add\" }] as [SchemaId, DbEvent];\n            }));\n        }\n\n        if (changes.updates.length > 0) {\n            result.push(...changes.updates.map(update => {\n                return [schemaId as SchemaId, { data: { ...update }, type: \"update\" }] as [SchemaId, DbEvent];\n            }));\n        }\n\n        if (changes.removes.length > 0) {\n            result.push(...changes.removes.map(remove => {\n                return [schemaId as SchemaId, { data: { ...remove }, type: \"remove\" }] as [SchemaId, DbEvent];\n            }));\n        }\n    }\n\n    return result\n}","export const noop = (..._args: any[]) => { };","export const unsafeCast = <T>(value: unknown): T => {\n    return value as T\n}","export * from './arrays';\nexport * from './strings';\nexport * from './dates';\nexport * from './objects';\nexport * from './runtime';\nexport * from './uuid';\nexport * from './replication';\nexport * from './types';\nexport * from './queryOptionsCollection';\nexport * from './dbPluginEventUtils';\nexport * from './functions';\nexport * from './unsafeCast';\nexport * from './logger';"],"names":["EXPRESSION_TYPES","isDate","assertDate","data","TypeError","assertIsNotNull","message","assertIsArray","Array","assertString","assertInstanceOf","value","Instance","assertIsNumber","isObjectWithType","isExpression","isOperatorExpression","isComparatorExpression","isPropertyExpression","isValueExpression","isEmptyExpression","isNotParsableExpression","getProperties","expression","properties","traverse","expr","forEach","callback","QueryOptionsCollection","Map","reason","options","name","mapValue","x","filterValue","sortValue","nearestValue","joinValue","item","found","sortedItems","a","b","before","after","at","i","length","option","destination","key","items","nextExecutionTarget","nextExecutionReason","nextIndex","memoryQueryOptionsCollection","databaseQueryOptionsCollection","sortedItem","transformationOptions","w","iterator","Date","LOG_LEVELS","RANK","isLogLevel","resolveLevel","globalThis","g","process","debug","env","level","rank","setLogLevel","next","Error","getLogLevel","resetLogLevel","isLogLevelEnabled","emit","method","args","console","logger","hash","seed","h1","h2","ch","Math","fastHash","stringifyObject","obj","maxDepth","currentDepth","undefined","type","String","getFunctionName","stringifyObjectValue","fn","getObjectProperties","RegExp","stringifyArray","stringifyClassInstance","stringifyPlainObject","arr","suffix","className","Object","props","isPrimitive","depth","uuid","chars","charLength","result","HEX_CHARS","UUID_TEMPLATE","hasCrypto","crypto","hasRandomUUID","uuidv4","uuidv4Fallback","randomBytes","Uint8Array","byteIndex","c","r","toMap","keySelector","cast","clone","JSON","isNodeRuntime","resolveBulkPersistChanges","event","bulkPersistChanges","schemaId","changes","schemmaBulkPersistResult","schemaBulkPersistChanges","combineQueryOptionsCollections","collections","collection","toEventArray","add","update","remove","noop","_args","unsafeCast"],"mappings":";;;;;;;AAA4D;AAEtB;AAE/B,SAASE,WAAWC,IAAa;IACpC,IAAIF,OAAOE,UAAU,OAAO;QACxB,MAAM,IAAIC,UAAU;IACxB;AACJ;AAEO,SAASC,gBAAmBF,IAA0B,EAAEG,OAAiC;IAC5F,IAAIH,QAAQ,MAAM;QACd,IAAIG,WAAW,MAAM;YACjB,MAAM,IAAIF,UAAU;QACxB;QAEA,IAAI,OAAOE,YAAY,UAAU;YAC7B,MAAM,IAAIF,UAAUE;QACxB;QAEA,MAAM,IAAIF,UAAUE;IACxB;AACJ;AAEO,SAASC,cAAiBJ,IAAa,EAAEG,OAAgB;IAC5D,IAAI,CAACE,MAAM,OAAO,CAACL,OAAO;QACtB,MAAM,IAAIC,UAAUE,WAAW;IACnC;AACJ;AAEO,SAASG,aAAaN,IAAa,EAAEG,OAAgB;IACxD,IAAI,OAAOH,SAAS,UAAU;QAC1B,MAAM,IAAIC,UAAUE,WAAW;IACnC;AACJ;AAEO,SAASI,iBAAwDC,KAAc,EAAEC,QAAW;IAC/F,IAAID,iBAAiBC,UAAU;QAC3B;IACJ;IAEA,IAAID,SAAS,QAAQ,OAAOA,UAAU,YAAY,iBAAiBA,OAAO;QACtE,MAAM,IAAIP,UAAU,CAAC,sCAAsC,EAAEO,MAAM,WAAW,CAAC,IAAI,EAAE;IACzF;IAEA,MAAM,IAAIP,UAAU,CAAC,6BAA6B,CAAC;AACvD;AAEO,SAASS,eAAeF,KAAc;IACzC,IAAI,OAAOA,UAAU,UAAU;QAC3B,MAAM,IAAIP,UAAU;IACxB;AACJ;AAGA,SAASU,iBAAiBH,KAAc;IACpC,OAAO,OAAOA,UAAU,YAAYA,UAAU,QAAQ,UAAUA;AACpE;AAEA;;CAEC,GACM,SAASI,aAAaJ,KAAc;IACvC,OAAOG,iBAAiBH,UAAUX,iBAAiB,QAAQ,CAACW,MAAM,IAAI;AAC1E;AAEA;;CAEC,GACM,SAASK,qBAAqBL,KAAc;IAC/C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASM,uBAAuBN,KAAc;IACjD,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASO,qBAAqBP,KAAc;IAC/C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASQ,kBAAkBR,KAAc;IAC5C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASS,kBAAkBT,KAAc;IAC5C,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;AAEA;;CAEC,GACM,SAASU,wBAAwBV,KAAc;IAClD,OAAOG,iBAAiBH,UAAUA,MAAM,IAAI,KAAK;AACrD;;;;;;;;ACvGA;;;;CAIC,GACM,SAASW,cAAcC,UAAsB;IAChD,MAAMC,aAAkC,EAAE;IAE1C,SAASC,SAASC,IAAgB;QAC9B,6DAA6D;QAC7D,IAAIA,KAAK,IAAI,KAAK,YAAY;YAC1BF,WAAW,IAAI,CAAEE,KAA4B,QAAQ;QACzD;QAEA,oDAAoD;QACpD,IAAIA,KAAK,IAAI,EAAE;YACXD,SAASC,KAAK,IAAI;QACtB;QACA,IAAIA,KAAK,KAAK,EAAE;YACZD,SAASC,KAAK,KAAK;QACvB;IACJ;IAEAD,SAASF;IACT,OAAOC;AACX;AAEO,SAASG,QAAQJ,UAAsB,EAAEK,QAA6C;IACzF,SAASH,SAASC,IAAgB;QAC9B,wCAAwC;QACxC,6CAA6C;QAC7C,IAAI,CAACE,SAASF,OAAO;YACjB,OAAO;QACX;QAEA,oDAAoD;QACpD,IAAIA,KAAK,IAAI,EAAE;YACX,IAAI,CAACD,SAASC,KAAK,IAAI,GAAG;gBACtB,OAAO;YACX;QACJ;QACA,IAAIA,KAAK,KAAK,EAAE;YACZ,IAAI,CAACD,SAASC,KAAK,KAAK,GAAG;gBACvB,OAAO;YACX;QACJ;QAEA,OAAO;IACX;IAEAD,SAASF;AACb;;;;;;;;;;ACtDwD;AACN;AAK3C,MAAMM;IAED,UAAiE,IAAIC,MAAwD;IAC7H,sBAAkD,WAAW;IAC7D,sBAAoD,KAAK;IACzD,YAAoB,EAAE;IACtB,kBAAmD,EAAE,CAAC;IAE9D,yFAAyF,GACjF,gBAAgBC,MAA6B,EAAE;QACnD,IAAI,CAAC,mBAAmB,GAAG;QAE3B,IAAI,IAAI,CAAC,mBAAmB,IAAI,MAAM;YAClC,IAAI,CAAC,mBAAmB,GAAGA;QAC/B;IACJ;IAEA;;;;;;;KAOC,GACO,UAAmB,MAAM;IAEjC,IAAI,YAAY;QACZ,OAAO,IAAI,CAAC,OAAO;IACvB;IAEA,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,OAAO;IACvB;IAEA,IAAI,UAAU;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK;IAC/B;IAEA,OAAO,QAAW;QACd,OAAO,IAAIF;IACf;IAEA,OAAO,QAAWG,OAAkC,EAAE;QAClD,OAAOA,QAAQ,OAAO;IAC1B;IAEA,IAA+BC,IAAO,EAAEtB,KAAiC,EAAE;QAEvE,IAAIsB,SAAS,OAAO;YAChB,MAAMC,WAAWvB;YAEjB,gEAAgE;YAChE,0DAA0D;YAC1D,IAAIuB,SAAS,MAAM,CAAC,IAAI,CAACC,CAAAA,IAAKA,EAAE,QAAQ,KAAK,SAASD,SAAS,MAAM,CAAC,IAAI,CAACC,CAAAA,IAAKA,EAAE,QAAQ,EAAE,eAAe,OAAO;gBAC9G,0EAA0E;gBAC1E,+EAA+E;gBAC/E,IAAI,CAAC,eAAe,CAAC;YACzB;QACJ;QAEA,IAAIF,SAAS,UAAU;YACnB,oDAAoD;YACpD,MAAMG,cAAczB;YAEpB,kEAAkE;YAClE,uBAAuB;YACvB,IAAIyB,YAAY,UAAU,CAAC,IAAI,KAAK,SAAS;gBACzC;YACJ;YAEA,IAAIA,YAAY,UAAU,CAAC,IAAI,KAAK,gBAAgB;gBAChD,IAAI,CAAC,eAAe,CAAC;YACzB,OAAO;gBACHT,uDAAOA,CAACS,YAAY,UAAU,EAAE,CAACb;oBAE7B,IAAIL,qDAAoBA,CAACK,eAAeA,WAAW,QAAQ,CAAC,UAAU,EAAE;wBACpE,gFAAgF;wBAChF,oBAAoB;wBACpB,IAAI,CAAC,eAAe,CAAC;wBACrB,OAAO;oBACX;oBAEA,IAAIL,qDAAoBA,CAACK,eAAeA,WAAW,QAAQ,CAAC,kBAAkB,EAAE;wBAC5E,iEAAiE;wBACjE,6DAA6D;wBAC7D,iEAAiE;wBACjE,kCAAkC;wBAClC,IAAI,CAAC,eAAe,CAAC;wBACrB,OAAO;oBACX;oBAEA,OAAO;gBACX;YACJ;QACJ;QAEA,IAAIU,SAAS,QAAQ;YACjB,MAAMI,YAAY1B;YAElB,wEAAwE;YACxE,4EAA4E;YAC5E,IAAI0B,UAAU,QAAQ,IAAI,QAAQA,UAAU,QAAQ,CAAC,UAAU,EAAE;gBAC7D,IAAI,CAAC,eAAe,CAAC;YACzB,OAAO,IAAIA,UAAU,QAAQ,IAAI,QAAQA,UAAU,QAAQ,CAAC,kBAAkB,EAAE;gBAC5E,IAAI,CAAC,eAAe,CAAC;YACzB;QACJ;QAEA,IAAIJ,SAAS,WAAW;YACpB,MAAMK,eAAe3B;YAErB,iFAAiF;YACjF,gFAAgF;YAChF,wEAAwE;YACxE,EAAE;YACF,kFAAkF;YAClF,8EAA8E;YAC9E,IAAI2B,aAAa,QAAQ,IAAI,QAAQA,aAAa,QAAQ,CAAC,UAAU,EAAE;gBACnE,IAAI,CAAC,eAAe,CAAC;YACzB,OAAO,IAAIA,aAAa,QAAQ,IAAI,QAAQA,aAAa,QAAQ,CAAC,kBAAkB,EAAE;gBAClF,IAAI,CAAC,eAAe,CAAC;YACzB;QACJ;QAEA,IAAIL,SAAS,QAAQ;YACjB,MAAMM,YAAY5B;YAElB,+EAA+E;YAC/E,iFAAiF;YACjF,kDAAkD;YAClD,EAAE;YACF,iFAAiF;YACjF,gEAAgE;YAChE,IAAI4B,UAAU,WAAW,KAAK,MAAM;gBAChC,IAAI,CAAC,eAAe,CAAC;YACzB;QACJ;QAEA,MAAMC,OAAkC;YACpC,OAAO,IAAI,CAAC,SAAS;YACrB,QAAQ;gBACJP;gBACA,QAAQ,IAAI,CAAC,mBAAmB;gBAChCtB;gBACA,GAAI,IAAI,CAAC,mBAAmB,IAAI,OAAO,CAAC,IAAI;oBAAE,QAAQ,IAAI,CAAC,mBAAmB;gBAAC,CAAC;YACpF;QACJ;QAEA,IAAI,CAAC,SAAS;QAEd,MAAM8B,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAACR;QAE/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA,MAAM;eAAIQ,SAAS,EAAE;YAAED;SAAK;QAE7C,IAAIP,SAAS,WAAW;YACpB,6EAA6E;YAC7E,EAAE;YACF,4EAA4E;YAC5E,8EAA8E;YAC9E,gFAAgF;YAChF,EAAE;YACF,mFAAmF;YACnF,kFAAkF;YAClF,gFAAgF;YAChF,iCAAiC;YACjC,EAAE;YACF,8EAA8E;YAC9E,6DAA6D;YAC7D,IAAI,CAAC,eAAe,CAAC;QACzB;QAEA,IAAIA,SAAS,QAAQ;YACjB,iFAAiF;YACjF,mFAAmF;YACnF,sDAAsD;YACtD,EAAE;YACF,gFAAgF;YAChF,gFAAgF;YAChF,kFAAkF;YAClF,qEAAqE;YACrE,IAAI,CAAC,eAAe,CAAC;QACzB;IACJ;IAEA;;;;;;KAMC,GACD,QAAmCA,IAAO,EAAyG;QAC/I,IAAI,CAAC,kBAAkB;QAEvB,MAAMS,cAAc,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAACC,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;QAC7E,MAAMC,SAAS,IAAIhB;QACnB,MAAMiB,QAAQ,IAAIjB;QAElBgB,OAAO,OAAO,GAAG;QACjBC,MAAM,OAAO,GAAG;QAChB,IAAIC,KAA+B;QAEnC,IAAK,IAAIC,IAAI,GAAGC,SAASP,YAAY,MAAM,EAAEM,IAAIC,QAAQD,IAAK;YAC1D,MAAM,EAAEE,MAAM,EAAE,GAAGR,WAAW,CAACM,EAAE;YAEjC,IAAID,MAAM,QAAQG,OAAO,IAAI,KAAKjB,MAAM;gBACpCc,KAAKG;gBACL;YACJ;YAEA,MAAMC,cAAcJ,MAAM,OAAOF,SAASC;YAC1CK,YAAY,GAAG,CAACD,OAAO,IAAI,EAAEA,OAAO,KAAK;QAC7C;QAEA,OAAO;YAAEL;YAAQE;YAAID;QAAM;IAC/B;IAEA;;;;;;;KAOC,GACD,WAAuB;QACnB,MAAMd,UAAU,IAAIF,IAAI;eAAI,IAAI,CAAC,OAAO,CAAC,OAAO;SAAG,CAAC,GAAG,CAAC,CAAC,CAACsB,KAAKC,MAAM,GAAyD;gBAACD;gBAAK;uBAAIC;iBAAM;aAAC;QAC/I,MAAMC,sBAAsB,IAAI,CAAC,mBAAmB;QACpD,MAAMC,sBAAsB,IAAI,CAAC,mBAAmB;QACpD,MAAMC,YAAY,IAAI,CAAC,SAAS;QAEhC,OAAO;YACH,IAAI,CAAC,OAAO,GAAG,IAAI1B,IAAIE;YACvB,IAAI,CAAC,mBAAmB,GAAGsB;YAC3B,IAAI,CAAC,mBAAmB,GAAGC;YAC3B,IAAI,CAAC,SAAS,GAAGC;YACjB,IAAI,CAAC,eAAe,GAAG,EAAE;QAC7B;IACJ;IAEA,QAAoF;QAChF,IAAI,CAAC,kBAAkB;QAEvB,MAAMd,cAAc,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAACC,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;QAC7E,MAAMa,+BAA+B,IAAI5B;QACzC,MAAM6B,iCAAiC,IAAI7B;QAE3C4B,6BAA6B,OAAO,GAAG;QACvCC,+BAA+B,OAAO,GAAG;QAEzC,IAAK,IAAIV,IAAI,GAAGC,SAASP,YAAY,MAAM,EAAEM,IAAIC,QAAQD,IAAK;YAC1D,MAAMW,aAAajB,WAAW,CAACM,EAAE;YAEjC,IAAIW,WAAW,MAAM,CAAC,MAAM,KAAK,YAAY;gBACzCD,+BAA+B,GAAG,CAACC,WAAW,MAAM,CAAC,IAAI,EAAEA,WAAW,MAAM,CAAC,KAAK;gBAClF;YACJ;YAEAF,6BAA6B,GAAG,CAACE,WAAW,MAAM,CAAC,IAAI,EAAEA,WAAW,MAAM,CAAC,KAAK;QACpF;QAEA,OAAO;YACH,QAAQF;YACR,UAAUC;QACd;IACJ;IAEA,qBAA8B;QAC1B,MAAME,wBAA2C;YAAC;YAAO;YAAS;YAAO;YAAO;YAAS;SAAM;QAC/F,OAAOA,sBAAsB,IAAI,CAAC,CAAC3B,OAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA;IACjE;IAEA,IAA+BA,IAAO,EAAW;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA;IAC5B;IAEA,IAA+BA,IAAO,EAA+B;QACjE,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAACA,SAAS,EAAE;IACvC;IAEA,QAAmCA,IAAO,EAA4B;QAClE,IAAI,CAAC,kBAAkB;QAEvB,IAAK,IAAIe,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,GAAG,GAAGA,KAAK,GAAGA,IAAK;YACvD,MAAMR,OAAO,IAAI,CAAC,eAAe,CAACQ,EAAE;YAEpC,IAAIR,KAAK,MAAM,CAAC,IAAI,KAAKP,MAAM;gBAC3B,OAAOO,KAAK,MAAM;YACtB;QACJ;QAEA,OAAO;IACX;IAEA,UAAqCP,IAAO,EAA8D;QAEtG,MAAMQ,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAACR;QAE/B,IAAIQ,SAAS,MAAM;YACf,OAAO,EAAE;QACb;QAEA,OAAOA,MAAM,GAAG,CAACoB,CAAAA,IAAKA,EAAE,MAAM,CAAC,KAAK;IACxC;IAEQ,iBAAiB;QACrB,OAAO;eAAI,IAAI,CAAC,OAAO,CAAC,MAAM;SAAG,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAClB,GAAGC,IAAMD,EAAE,KAAK,GAAGC,EAAE,KAAK;IACjF;IAEQ,qBAAqB;QACzB,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE;YAC/C,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,cAAc;QAC9C;IACJ;IAEA,QAAQkB,QAA+D,EAAE;QACrE,IAAI,CAAC,kBAAkB;QAEvB,IAAK,IAAId,IAAI,GAAGC,SAAS,IAAI,CAAC,eAAe,CAAC,MAAM,EAAED,IAAIC,QAAQD,IAAK;YACnEc,SAAS,IAAI,CAAC,eAAe,CAACd,EAAE,CAAC,MAAM;QAC3C;IACJ;AACJ;;;;;;;;ACzUO,MAAM/C,SAAS,CAACE;IACnB,IAAIA,QAAQ,MAAM;QACd,OAAO;IACX;IAEA,IAAI,OAAOA,SAAS,UAAU;QAC1B,OAAO;IACX;IAEA,OAAOA,gBAAgB4D;AAC3B,EAAC;;;;;;;;;;;;;ACVD;;;;;;;;;;;;;;;;;;;;;;;CAuBC,GAED,4EAA4E,GACrE,MAAMC,aAAa;IAAC;IAAU;IAAS;IAAQ;IAAQ;CAAQ,CAAU;AAIhF,uDAAuD,GACvD,MAAMC,OAAiC;IACnC,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,OAAO;AACX;AAEA,MAAMC,aAAa,CAACvD,QAChB,OAAOA,UAAU,YAAaqD,WAAiC,QAAQ,CAACrD;AAE5E;;;;;;;CAOC,GACD,MAAMwD,eAAe;IACjB,IAAI,OAAOC,eAAe,aAAa;QACnC,MAAMC,IAAID;QAEV,IAAIF,WAAWG,EAAE,qBAAqB,GAAG;YACrC,OAAOA,EAAE,qBAAqB;QAClC;QAEA,oFAAoF;QACpF,4DAA4D;QAC5D,IAAIA,EAAE,iBAAiB,KAAK,MAAM,OAAO;QACzC,IAAIA,EAAE,iBAAiB,KAAK,OAAO,OAAO;IAC9C;IAEA,wFAAwF;IACxF,wFAAwF;IACxF,qFAAqF;IACrF,8FAA8F;IAC9F,6FAA6F;IAC7F,iFAAiF;IACjF,0DAA0D;IAC1D,IAAI,OAAOC,YAAY,eAAeA,QAAQ,GAAG,IAAI,MAAM;QACvD,IAAIJ,WAAWI,QAAQ,GAAG,CAAC,iBAAiB,GAAG;YAC3C,OAAOA,QAAQ,GAAG,CAAC,iBAAiB;QACxC;QAEA,MAAMC,QAAQD,QAAQ,GAAG,CAAC,KAAK;QAC/B,IAAIC,UAAU,aAAaA,UAAU,KAAK,OAAO;QAEjD,MAAMC,MAAMF,YAAoB,EAAE;QAElC,wFAAwF;QACxF,wFAAwF;QACxF,oBAAoB;QACpB,IAAIE,QAAQ,SAASA,QAAQ,eAAe,OAAO;IACvD;IAEA,OAAO;AACX;AAEA,IAAIC,QAAkBN;AACtB,IAAIO,OAAOT,IAAI,CAACQ,MAAM;AAEtB;;;;;;CAMC,GACM,MAAME,cAAc,CAACC;IACxB,IAAIV,WAAWU,UAAU,OAAO;QAC5B,MAAM,IAAIC,MAAM,CAAC,mBAAmB,EAAED,KAAK,oBAAoB,EAAEZ,WAAW,IAAI,CAAC,OAAO;IAC5F;IAEAS,QAAQG;IACRF,OAAOT,IAAI,CAACW,KAAK;AACrB,EAAE;AAEK,MAAME,cAAc,IAAgBL,MAAM;AAEjD,uFAAuF,GAChF,MAAMM,gBAAgB;IACzBN,QAAQN;IACRO,OAAOT,IAAI,CAACQ,MAAM;AACtB,EAAE;AAEF;;;;;;CAMC,GACM,MAAMO,oBAAoB,CAACjC,KAA0B2B,QAAQT,IAAI,CAAClB,GAAG,CAAC;AAI7E,MAAMkC,OAAO,CAAClC,IAAcmC,QAAuBC;IAC/C,IAAIT,OAAOT,IAAI,CAAClB,GAAG,EAAE;QACjB;IACJ;IAEA,4FAA4F;IAC5F,yFAAyF;IACzF,gCAAgC;IAC/BqC,OAAO,CAACF,OAAO,IAAkCC;AACtD;AAEO,MAAME,SAAS;IAClB,gGAAgG,GAChG,KAAK,CAAC,GAAGF,OAA0BF,KAAK,QAAQ,OAAOE;IACvD,MAAM,CAAC,GAAGA,OAA0BF,KAAK,QAAQ,QAAQE;IACzD,MAAM,CAAC,GAAGA,OAA0BF,KAAK,QAAQ,QAAQE;IACzD,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;IAC5D,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;IAC5D,yEAAyE,GACzE,OAAO,CAAC,GAAGA,OAA0BF,KAAK,SAAS,SAASE;AAChE,EAAE;;;;;;;;;;ACpJK,MAAMG,OAAO,CAAC3E,OAAe4E,OAAe,CAAC;IAChD,sBAAsB;IACtB,+CAA+C;IAC/C,IAAIC,KAAK,aAAaD,MAAME,KAAK,aAAaF;IAE9C,IAAK,IAAIvC,IAAI,GAAG0C,IAAY1C,IAAIrC,MAAM,MAAM,EAAEqC,IAAK;QAC/C0C,KAAK/E,MAAM,UAAU,CAACqC;QACtBwC,KAAKG,KAAK,IAAI,CAACH,KAAKE,IAAI;QACxBD,KAAKE,KAAK,IAAI,CAACF,KAAKC,IAAI;IAC5B;IAEAF,KAAKG,KAAK,IAAI,CAACH,KAAMA,OAAO,IAAK;IACjCA,MAAMG,KAAK,IAAI,CAACF,KAAMA,OAAO,IAAK;IAClCA,KAAKE,KAAK,IAAI,CAACF,KAAMA,OAAO,IAAK;IACjCA,MAAME,KAAK,IAAI,CAACH,KAAMA,OAAO,IAAK;IAElC,OAAO,aAAc,WAAUC,EAAC,IAAMD,CAAAA,OAAO;AACjD,EAAC;AAED;;;;;;;;;;;;;;CAcC,GACM,MAAMI,WAAW,CAACjF,OAAe4E,OAAe,IAAI;IACvD,IAAID,OAAOC;IACX,IAAK,IAAIvC,IAAI,GAAGA,IAAIrC,MAAM,MAAM,EAAEqC,IAAK;QACnCsC,OAASA,CAAAA,QAAQ,KAAKA,OAAQ3E,MAAM,UAAU,CAACqC;IACnD;IACA,OAAOsC,SAAS,GAAG,qCAAqC;AAC5D,EAAC;AAED;;;;;;;;;;;;;;;;CAgBC,GACM,SAASO,gBAAgBC,GAAY,EAAEC,WAAmB,CAAC,EAAEC,eAAuB,CAAC;IACxF,IAAIF,QAAQ,MAAM,OAAO;IACzB,IAAIA,QAAQG,WAAW,OAAO;IAE9B,MAAMC,OAAO,OAAOJ;IAEpB,OAAQI;QACJ,KAAK;YACD,OAAO,CAAC,CAAC,EAAEJ,IAAI,CAAC,CAAC;QACrB,KAAK;QACL,KAAK;YACD,OAAOK,OAAOL;QAClB,KAAK;YACD,OAAO,CAAC,WAAW,EAAEM,gBAAgBN,KAAiB,CAAC,CAAC;QAC5D,KAAK;YACD,IAAIE,gBAAgBD,UAAU;gBAC1B,OAAO;YACX;YACA,OAAOM,qBAAqBP,KAAKC,UAAUC;QAC/C;YACI,OAAO,CAAC,CAAC,EAAEE,KAAK,CAAC,CAAC;IAC1B;AACJ;AAEA,SAASE,gBAAgBE,EAAY;IACjC,MAAMrE,OAAOqE,GAAG,IAAI;IACpB,OAAOrE,QAAQ;AACnB;AAEA,SAASsE,oBAAoBT,GAAQ;IACjC,MAAMtE,aAAkC,CAAC;IAEzC,IAAK,MAAM4B,OAAO0C,IAAK;QACnB,IAAIA,IAAI,cAAc,CAAC1C,MAAM;YACzB5B,UAAU,CAAC4B,IAAI,GAAG0C,GAAG,CAAC1C,IAAI;QAC9B;IACJ;IAEA,OAAO5B;AACX;AAEA,SAAS6E,qBAAqBP,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC1E,IAAIF,QAAQ,MAAM,OAAO;IAEzB,IAAIA,eAAe/B,MAAM;QACrB,OAAO,CAAC,KAAK,EAAE+B,IAAI,WAAW,GAAG,CAAC,CAAC;IACvC;IAEA,IAAIA,eAAejB,OAAO;QACtB,OAAO,CAAC,MAAM,EAAEiB,IAAI,OAAO,CAAC,CAAC,CAAC;IAClC;IAEA,IAAIA,eAAeU,QAAQ;QACvB,OAAOV,IAAI,QAAQ;IACvB;IAEA,IAAItF,MAAM,OAAO,CAACsF,MAAM;QACpB,OAAOW,eAAeX,KAAKC,UAAUC;IACzC;IAEA,IAAIF,IAAI,WAAW,IAAIA,IAAI,WAAW,CAAC,IAAI,KAAK,UAAU;QACtD,OAAOY,uBAAuBZ,KAAKC,UAAUC;IACjD;IAEA,OAAOW,qBAAqBb,KAAKC,UAAUC;AAC/C;AAEA,SAASS,eAAeG,GAAU,EAAEb,QAAgB,EAAEC,YAAoB;IACtE,IAAIY,IAAI,MAAM,KAAK,GAAG,OAAO;IAE7B,MAAMvD,QAAQuD,IAAI,KAAK,CAAC,GAAG,GAAG,GAAG,CAACpE,CAAAA,OAC9BqD,gBAAgBrD,MAAMuD,UAAUC,eAAe;IAGnD,MAAMa,SAASD,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAEA,IAAI,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAClE,OAAO,CAAC,CAAC,EAAEvD,MAAM,IAAI,CAAC,QAAQwD,OAAO,CAAC,CAAC;AAC3C;AAEA,SAASH,uBAAuBZ,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC5E,MAAMc,YAAYhB,IAAI,WAAW,CAAC,IAAI;IACtC,MAAMtE,aAAa+E,oBAAoBT;IAEvC,IAAIiB,OAAO,IAAI,CAACvF,YAAY,MAAM,KAAK,GAAG;QACtC,OAAO,GAAGsF,UAAU,GAAG,CAAC;IAC5B;IAEA,MAAME,QAAQD,OAAO,OAAO,CAACvF,YACxB,KAAK,CAAC,GAAG,GACT,GAAG,CAAC,CAAC,CAAC4B,KAAKzC,MAAM;QACd,MAAMsG,cAActG,UAAU,QAAQA,UAAUsF,aAC3C,OAAOtF,UAAU,YAAY,OAAOA,UAAU;QACnD,MAAMuG,QAAQD,cAAcjB,eAAeA,eAAe;QAC1D,OAAO,GAAG5C,IAAI,EAAE,EAAEyC,gBAAgBlF,OAAOoF,UAAUmB,QAAQ;IAC/D;IAEJ,MAAML,SAASE,OAAO,IAAI,CAACvF,YAAY,MAAM,GAAG,IAC5C,CAAC,MAAM,EAAEuF,OAAO,IAAI,CAACvF,YAAY,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAE1D,OAAO,GAAGsF,UAAU,GAAG,EAAEE,MAAM,IAAI,CAAC,QAAQH,OAAO,EAAE,CAAC;AAC1D;AAEA,SAASF,qBAAqBb,GAAQ,EAAEC,QAAgB,EAAEC,YAAoB;IAC1E,MAAMxE,aAAa+E,oBAAoBT;IAEvC,IAAIiB,OAAO,IAAI,CAACvF,YAAY,MAAM,KAAK,GAAG;QACtC,OAAO;IACX;IAEA,MAAMwF,QAAQD,OAAO,OAAO,CAACvF,YACxB,KAAK,CAAC,GAAG,GACT,GAAG,CAAC,CAAC,CAAC4B,KAAKzC,MAAM;QACd,MAAMsG,cAActG,UAAU,QAAQA,UAAUsF,aAC3C,OAAOtF,UAAU,YAAY,OAAOA,UAAU;QACnD,MAAMuG,QAAQD,cAAcjB,eAAeA,eAAe;QAC1D,OAAO,GAAG5C,IAAI,EAAE,EAAEyC,gBAAgBlF,OAAOoF,UAAUmB,QAAQ;IAC/D;IAEJ,MAAML,SAASE,OAAO,IAAI,CAACvF,YAAY,MAAM,GAAG,IAC5C,CAAC,MAAM,EAAEuF,OAAO,IAAI,CAACvF,YAAY,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG;IAE1D,OAAO,CAAC,EAAE,EAAEwF,MAAM,IAAI,CAAC,QAAQH,OAAO,EAAE,CAAC;AAC7C;;;;;;;;;ACpLO,MAAMM,OAAO,CAAClE,SAAiB,EAAE;IACpC,MAAMmE,QAAQ;IACd,MAAMC,aAAaD,MAAM,MAAM;IAC/B,IAAIE,SAAS;IAEb,IAAK,IAAItE,IAAI,GAAGA,IAAIC,QAAQD,IAAK;QAC7BsE,UAAUF,KAAK,CAACzB,KAAK,MAAM,KAAK0B,aAAa,EAAE;IACnD;IACA,OAAOC;AACX,EAAC;AAED,MAAMC,YAAY;AAClB,MAAMC,gBAAgB;AAEtB,MAAMC,YACF,OAAOC,WAAW,eAAe,OAAOA,OAAO,eAAe,KAAK;AAEvE,MAAMC,gBACF,OAAOD,WAAW,eAAe,OAAOA,OAAO,UAAU,KAAK;AAE3D,MAAME,SAAS;IAClB,IAAID,eAAe;QACf,OAAOD,OAAO,UAAU;IAC5B;IAEA,OAAOG;AACX,EAAE;AAEF,MAAMA,iBAAiB;IACnB,IAAIC,cAAiC;IACrC,IAAIL,WAAW;QACXK,cAAcJ,OAAO,eAAe,CAAC,IAAIK,WAAW;IACxD;IAEA,IAAIC,YAAY;IAChB,IAAIb,OAAO;IAEX,IAAK,IAAInE,IAAI,GAAGA,IAAIwE,cAAc,MAAM,EAAExE,IAAK;QAC3C,MAAMiF,IAAIT,aAAa,CAACxE,EAAE;QAC1B,IAAIiF,MAAM,KAAK;YACXd,QAAQ;YACR;QACJ;QAEA,IAAIe;QACJ,IAAIT,aAAaK,aAAa;YAC1B,2CAA2C;YAC3CI,IACKlF,IAAI,MAAM,IACL8E,WAAW,CAACE,UAAU,IAAI,IAC1BF,WAAW,CAACE,YAAY,GAAG;QACzC,OAAO;YACHE,IAAIvC,KAAK,KAAK,CAACA,KAAK,MAAM,KAAK;QACnC;QAEA,IAAIsC,MAAM,KAAK;YACXd,QAAQI,SAAS,CAACW,EAAE;QACxB,OAAO,IAAID,MAAM,KAAK;YAClB,8BAA8B;YAC9Bd,QAAQI,SAAS,CAAEW,IAAI,MAAO,IAAI;QACtC,OAAO,IAAID,MAAM,KAAK;YAClBd,QAAQ;QACZ;IACJ;IAEA,OAAOA;AACX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClEA;AACA;AACA;AACA,kDAAkD,wCAAwC;AAC1F;AACA;AACA,E;;;;ACNA,wF;;;;ACAA;AACA;AACA;AACA,uDAAuD,iBAAiB;AACxE;AACA,gDAAgD,aAAa;AAC7D,E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACNO,MAAMgB,QAAQ,CAAehI,MAAWiI;IAE3C,MAAMd,SAAS,IAAIxF;IAEnB,IAAK,IAAIkB,IAAI,GAAGA,IAAI7C,KAAK,MAAM,EAAE6C,IAAK;QAClC,MAAMR,OAAOrC,IAAI,CAAC6C,EAAE;QACpB,MAAMI,MAAMgF,YAAY5F;QACxB8E,OAAO,GAAG,CAAClE,KAAKZ;IACpB;IAEA,OAAO8E;AACX,EAAC;;;;;;;ACXM,MAAMe,OAAO,CAAY7F;IAC5B,OAAOA;AACX,EAAC;AAEM,SAAS8F,MAAoBnI,IAAO;IACvC,OAAOoI,KAAK,KAAK,CAACA,KAAK,SAAS,CAACpI;AACrC;;;ACNO,MAAMqI,gBAAgB,IAAM,OAAOlE,YAAY,eAClDA,QAAQ,QAAQ,IAAI,QACpBA,QAAQ,QAAQ,CAAC,IAAI,IAAI,KAAK;;;;;ACC3B,MAAMmE,4BAA4B,CAACC,OAAiCpB,QAA2BqB;IAClG,kFAAkF;IAClF,gEAAgE;IAChE,KAAK,MAAM,CAACC,UAAUC,QAAQ,IAAIH,MAAM,SAAS,CAAE;QAE/C,MAAMI,2BAA2BxB,OAAO,GAAG,CAACsB;QAC5C,MAAMG,2BAA2BJ,mBAAmB,OAAO,CAACC;QAE5D,2BAA2B;QAC3BG,yBAAyB,OAAO,GAAGF,QAAQ,OAAO;QAElD,2BAA2B;QAC3BE,yBAAyB,OAAO,GAAGF,QAAQ,OAAO;QAElD,6DAA6D;QAC7D,6DAA6D;QAC7D,oBAAoB;QACpBE,yBAAyB,IAAI,GAAGD,yBAAyB,IAAI;IACjE;AACJ,EAAC;;;;;ACtByD;AAEnD,MAAME,iCAAiC,CAAI,GAAGC;IACjD,MAAM3B,SAAS,IAAIzF,qDAAsBA;IAEzC,IAAK,IAAImB,IAAI,GAAGC,SAASgG,YAAY,MAAM,EAAEjG,IAAIC,QAAQD,IAAK;QAC1D,MAAMkG,aAAaD,WAAW,CAACjG,EAAE;QAEjC,yBAAyB;QACzBkG,WAAW,OAAO,CAAC1G,CAAAA;YACf8E,OAAO,GAAG,CAAC9E,KAAK,IAAI,EAAEA,KAAK,KAAK;QACpC;IACJ;IAEA,OAAO8E;AACX,EAAC;;;ACDM,MAAM6B,eAAe,CAACT;IAEzB,MAAMpB,SAAgC,EAAE;IACxC,KAAK,MAAM,CAACsB,UAAUC,QAAQ,IAAIH,MAAM,SAAS,CAAE;QAE/C,IAAIG,QAAQ,QAAQ,KAAK,OAAO;YAC5B;QACJ;QAEA,IAAIA,QAAQ,IAAI,CAAC,MAAM,GAAG,GAAG;YACzBvB,OAAO,IAAI,IAAIuB,QAAQ,IAAI,CAAC,GAAG,CAACO,CAAAA;gBAC5B,OAAO;oBAACR;oBAAsB;wBAAE,MAAM;4BAAE,GAAGQ,GAAG;wBAAC;wBAAG,MAAM;oBAAM;iBAAE;YACpE;QACJ;QAEA,IAAIP,QAAQ,OAAO,CAAC,MAAM,GAAG,GAAG;YAC5BvB,OAAO,IAAI,IAAIuB,QAAQ,OAAO,CAAC,GAAG,CAACQ,CAAAA;gBAC/B,OAAO;oBAACT;oBAAsB;wBAAE,MAAM;4BAAE,GAAGS,MAAM;wBAAC;wBAAG,MAAM;oBAAS;iBAAE;YAC1E;QACJ;QAEA,IAAIR,QAAQ,OAAO,CAAC,MAAM,GAAG,GAAG;YAC5BvB,OAAO,IAAI,IAAIuB,QAAQ,OAAO,CAAC,GAAG,CAACS,CAAAA;gBAC/B,OAAO;oBAACV;oBAAsB;wBAAE,MAAM;4BAAE,GAAGU,MAAM;wBAAC;wBAAG,MAAM;oBAAS;iBAAE;YAC1E;QACJ;IACJ;IAEA,OAAOhC;AACX,EAAC;;;AC3CM,MAAMiC,OAAO,CAAC,GAAGC,SAAmB,EAAE;;;ACAtC,MAAMC,aAAa,CAAI9I;IAC1B,OAAOA;AACX,EAAC;;;;;ACFwB;AACC;AACF;AACE;AACA;AACH;AACO;AACN;AACiB;AACJ;AACT;AACC;AACJ"}

package/dist/utilities/index.js

@@ -148,8 +148,26 @@ __webpack_require__.d(__webpack_exports__, {
 class QueryOptionsCollection {
     options = new Map();
     nextExecutionTarget = "database";
+    nextExecutionReason = null;
     nextIndex = 0;
     enumeratedItems = [];
+    /** Cuts over to memory execution, keeping the first cause. See `MemoryExecutionReason`. */ cutOverToMemory(reason) {
+        this.nextExecutionTarget = "memory";
+        if (this.nextExecutionReason == null) {
+            this.nextExecutionReason = reason;
+        }
+    }
+    /**
+     * True when `split()` or `splitAt()` produced this collection.
+     *
+     * Those rebuild each half by re-adding its options, which re-derives execution targets
+     * without the options that caused them — a post-join filter alone in the memory half
+     * derives back to `"database"`. Anything reading `target` as a report of where work runs
+     * has to reject a derived collection; see `explainQuery`.
+     */ derived = false;
+    get isDerived() {
+        return this.derived;
+    }
     get items() {
         return this.options;
     }
@@ -170,7 +188,7 @@ class QueryOptionsCollection {
             if (mapValue.fields.some((x)=>x.isRename === true) || mapValue.fields.some((x)=>x.property?.isUnmapped === true)) {
                 // Cut over to memory execution since we are renaming a property with .map
                 // We do not want to figure out how the new name flows through the entire query
-                this.nextExecutionTarget = "memory";
+                this.cutOverToMemory("map-rename");
             }
         }
         if (name === "filter") {
@@ -182,13 +200,13 @@ class QueryOptionsCollection {
                 return;
             }
             if (filterValue.expression.type === "not-parsable") {
-                this.nextExecutionTarget = "memory";
+                this.cutOverToMemory("not-parsable");
             } else {
                 (0,_expressions_utils__rspack_import_0/* .forEach */.j)(filterValue.expression, (expression)=>{
                     if ((0,_assertions__rspack_import_1/* .isPropertyExpression */.e3)(expression) && expression.property.isUnmapped) {
                         // Cut over to memory execution, unmapped properties are not in the database and
                         // cannot be queried
-                        this.nextExecutionTarget = "memory";
+                        this.cutOverToMemory("unmapped-property");
                         return false;
                     }
                     if ((0,_assertions__rspack_import_1/* .isPropertyExpression */.e3)(expression) && expression.property.hasRenamedSegments) {
@@ -196,7 +214,7 @@ class QueryOptionsCollection {
                         // `from` (storage) names, but filter selectors reference the
                         // in-memory names.  Memory execution runs after deserialization,
                         // where the in-memory names exist
-                        this.nextExecutionTarget = "memory";
+                        this.cutOverToMemory("renamed-property");
                         return false;
                     }
                     return true;
@@ -207,8 +225,10 @@ class QueryOptionsCollection {
             const sortValue = value;
             // Same rule as filters: sort selectors reference in-memory names, which
             // only exist after deserialization when the property is renamed or unmapped
-            if (sortValue.property != null && (sortValue.property.isUnmapped || sortValue.property.hasRenamedSegments)) {
-                this.nextExecutionTarget = "memory";
+            if (sortValue.property != null && sortValue.property.isUnmapped) {
+                this.cutOverToMemory("unmapped-property");
+            } else if (sortValue.property != null && sortValue.property.hasRenamedSegments) {
+                this.cutOverToMemory("renamed-property");
             }
         }
         if (name === "nearest") {
@@ -219,8 +239,10 @@ class QueryOptionsCollection {
             //
             // This is also what lets every translator's in-memory fallback read the column by
             // its resolved name — anything whose storage name differs never reaches them.
-            if (nearestValue.property != null && (nearestValue.property.isUnmapped || nearestValue.property.hasRenamedSegments)) {
-                this.nextExecutionTarget = "memory";
+            if (nearestValue.property != null && nearestValue.property.isUnmapped) {
+                this.cutOverToMemory("unmapped-property");
+            } else if (nearestValue.property != null && nearestValue.property.hasRenamedSegments) {
+                this.cutOverToMemory("renamed-property");
             }
         }
         if (name === "join") {
@@ -232,7 +254,7 @@ class QueryOptionsCollection {
             // Set BEFORE the item is created, unlike `nearest`'s ratchet below, because this
             // moves the join option itself rather than everything after it.
             if (joinValue.crossPlugin === true) {
-                this.nextExecutionTarget = "memory";
+                this.cutOverToMemory("cross-plugin-join");
             }
         }
         const item = {
@@ -240,7 +262,10 @@ class QueryOptionsCollection {
             option: {
                 name,
                 target: this.nextExecutionTarget,
-                value
+                value,
+                ...this.nextExecutionReason == null ? {} : {
+                    reason: this.nextExecutionReason
+                }
             }
         };
         this.nextIndex++;
@@ -263,7 +288,7 @@ class QueryOptionsCollection {
             //
             // A plugin that DID push the search down loses nothing but the chance to also
             // push down what follows it, which is a limit over ten rows.
-            this.nextExecutionTarget = "memory";
+            this.cutOverToMemory("after-nearest");
         }
         if (name === "join") {
             // Everything AFTER a join runs in memory, for the same reason as `nearest`: this
@@ -274,7 +299,7 @@ class QueryOptionsCollection {
             // OUTER rows read, not the pairs produced — a plausible-looking result with the
             // wrong number of rows in it. Conjuncts that can safely run earlier are split off
             // by the query builder BEFORE dispatch, which is the only exception.
-            this.nextExecutionTarget = "memory";
+            this.cutOverToMemory("after-join");
         }
     }
     /**
@@ -288,6 +313,8 @@ class QueryOptionsCollection {
         const sortedItems = this.enumeratedItems.toSorted((a, b)=>a.index - b.index);
         const before = new QueryOptionsCollection();
         const after = new QueryOptionsCollection();
+        before.derived = true;
+        after.derived = true;
         let at = null;
         for(let i = 0, length = sortedItems.length; i < length; i++){
             const { option } = sortedItems[i];
@@ -321,10 +348,12 @@ class QueryOptionsCollection {
                 ]
             ]));
         const nextExecutionTarget = this.nextExecutionTarget;
+        const nextExecutionReason = this.nextExecutionReason;
         const nextIndex = this.nextIndex;
         return ()=>{
             this.options = new Map(options);
             this.nextExecutionTarget = nextExecutionTarget;
+            this.nextExecutionReason = nextExecutionReason;
             this.nextIndex = nextIndex;
             this.enumeratedItems = [];
         };
@@ -334,6 +363,8 @@ class QueryOptionsCollection {
         const sortedItems = this.enumeratedItems.toSorted((a, b)=>a.index - b.index);
         const memoryQueryOptionsCollection = new QueryOptionsCollection();
         const databaseQueryOptionsCollection = new QueryOptionsCollection();
+        memoryQueryOptionsCollection.derived = true;
+        databaseQueryOptionsCollection.derived = true;
         for(let i = 0, length = sortedItems.length; i < length; i++){
             const sortedItem = sortedItems[i];
             if (sortedItem.option.target === "database") {