@tanstack/db 0.5.6 → 0.5.8

package/dist/esm/proxy.js.map

@@ -1 +1 @@
-{"version":3,"file":"proxy.js","sources":["../../src/proxy.ts"],"sourcesContent":["/**\n * A utility for creating a proxy that captures changes to an object\n * and provides a way to retrieve those changes.\n */\n\nimport { deepEquals, isTemporal } from \"./utils\"\n\n/**\n * Simple debug utility that only logs when debug mode is enabled\n * Set DEBUG to true in localStorage to enable debug logging\n */\nfunction debugLog(...args: Array<unknown>): void {\n  // Check if we're in a browser environment\n  const isBrowser =\n    typeof window !== `undefined` && typeof localStorage !== `undefined`\n\n  // In browser, check localStorage for debug flag\n  if (isBrowser && localStorage.getItem(`DEBUG`) === `true`) {\n    console.log(`[proxy]`, ...args)\n  }\n  // In Node.js environment, check for environment variable (though this is primarily for browser)\n  else if (\n    // true\n    !isBrowser &&\n    typeof process !== `undefined` &&\n    process.env.DEBUG === `true`\n  ) {\n    console.log(`[proxy]`, ...args)\n  }\n}\n\n// Add TypedArray interface with proper type\ninterface TypedArray {\n  length: number\n  [index: number]: number\n}\n\n// Update type for ChangeTracker\ninterface ChangeTracker<T extends object> {\n  originalObject: T\n  modified: boolean\n  copy_: T\n  proxyCount: number\n  assigned_: Record<string | symbol, boolean>\n  parent?:\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: string | symbol\n      }\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: string | symbol\n        updateMap: (newValue: unknown) => void\n      }\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: unknown\n        updateSet: (newValue: unknown) => void\n      }\n  target: T\n}\n\n/**\n * Deep clones an object while preserving special types like Date and RegExp\n */\n\nfunction deepClone<T extends unknown>(\n  obj: T,\n  visited = new WeakMap<object, unknown>()\n): T {\n  // Handle null and undefined\n  if (obj === null || obj === undefined) {\n    return obj\n  }\n\n  // Handle primitive types\n  if (typeof obj !== `object`) {\n    return obj\n  }\n\n  // If we've already cloned this object, return the cached clone\n  if (visited.has(obj as object)) {\n    return visited.get(obj as object) as T\n  }\n\n  if (obj instanceof Date) {\n    return new Date(obj.getTime()) as unknown as T\n  }\n\n  if (obj instanceof RegExp) {\n    return new RegExp(obj.source, obj.flags) as unknown as T\n  }\n\n  if (Array.isArray(obj)) {\n    const arrayClone = [] as Array<unknown>\n    visited.set(obj as object, arrayClone)\n    obj.forEach((item, index) => {\n      arrayClone[index] = deepClone(item, visited)\n    })\n    return arrayClone as unknown as T\n  }\n\n  // Handle TypedArrays\n  if (ArrayBuffer.isView(obj) && !(obj instanceof DataView)) {\n    // Get the constructor to create a new instance of the same type\n    const TypedArrayConstructor = Object.getPrototypeOf(obj).constructor\n    const clone = new TypedArrayConstructor(\n      (obj as unknown as TypedArray).length\n    ) as unknown as TypedArray\n    visited.set(obj as object, clone)\n\n    // Copy the values\n    for (let i = 0; i < (obj as unknown as TypedArray).length; i++) {\n      clone[i] = (obj as unknown as TypedArray)[i]!\n    }\n\n    return clone as unknown as T\n  }\n\n  if (obj instanceof Map) {\n    const clone = new Map() as Map<unknown, unknown>\n    visited.set(obj as object, clone)\n    obj.forEach((value, key) => {\n      clone.set(key, deepClone(value, visited))\n    })\n    return clone as unknown as T\n  }\n\n  if (obj instanceof Set) {\n    const clone = new Set()\n    visited.set(obj as object, clone)\n    obj.forEach((value) => {\n      clone.add(deepClone(value, visited))\n    })\n    return clone as unknown as T\n  }\n\n  // Handle Temporal objects\n  if (isTemporal(obj)) {\n    // Temporal objects are immutable, so we can return them directly\n    // This preserves all their internal state correctly\n    return obj\n  }\n\n  const clone = {} as Record<string | symbol, unknown>\n  visited.set(obj as object, clone)\n\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      clone[key] = deepClone(\n        (obj as Record<string | symbol, unknown>)[key],\n        visited\n      )\n    }\n  }\n\n  const symbolProps = Object.getOwnPropertySymbols(obj)\n  for (const sym of symbolProps) {\n    clone[sym] = deepClone(\n      (obj as Record<string | symbol, unknown>)[sym],\n      visited\n    )\n  }\n\n  return clone as T\n}\n\nlet count = 0\nfunction getProxyCount() {\n  count += 1\n  return count\n}\n\n/**\n * Creates a proxy that tracks changes to the target object\n *\n * @param target The object to proxy\n * @param parent Optional parent information\n * @returns An object containing the proxy and a function to get the changes\n */\nexport function createChangeProxy<\n  T extends Record<string | symbol, any | undefined>,\n>(\n  target: T,\n  parent?: {\n    tracker: ChangeTracker<Record<string | symbol, unknown>>\n    prop: string | symbol\n  }\n): {\n  proxy: T\n\n  getChanges: () => Record<string | symbol, any>\n} {\n  const changeProxyCache = new Map<object, object>()\n\n  function memoizedCreateChangeProxy<\n    TInner extends Record<string | symbol, any | undefined>,\n  >(\n    innerTarget: TInner,\n    innerParent?: {\n      tracker: ChangeTracker<Record<string | symbol, unknown>>\n      prop: string | symbol\n    }\n  ): {\n    proxy: TInner\n    getChanges: () => Record<string | symbol, any>\n  } {\n    debugLog(`Object ID:`, innerTarget.constructor.name)\n    if (changeProxyCache.has(innerTarget)) {\n      return changeProxyCache.get(innerTarget) as {\n        proxy: TInner\n        getChanges: () => Record<string | symbol, any>\n      }\n    } else {\n      const changeProxy = createChangeProxy(innerTarget, innerParent)\n      changeProxyCache.set(innerTarget, changeProxy)\n      return changeProxy\n    }\n  }\n  // Create a WeakMap to cache proxies for nested objects\n  // This prevents creating multiple proxies for the same object\n  // and handles circular references\n  const proxyCache = new Map<object, object>()\n\n  // Create a change tracker to track changes to the object\n  const changeTracker: ChangeTracker<T> = {\n    copy_: deepClone(target),\n    originalObject: deepClone(target),\n    proxyCount: getProxyCount(),\n    modified: false,\n    assigned_: {},\n    parent,\n    target, // Store reference to the target object\n  }\n\n  debugLog(\n    `createChangeProxy called for target`,\n    target,\n    changeTracker.proxyCount\n  )\n  // Mark this object and all its ancestors as modified\n  // Also propagate the actual changes up the chain\n  function markChanged(state: ChangeTracker<object>) {\n    if (!state.modified) {\n      state.modified = true\n    }\n\n    // Propagate the change up the parent chain\n    if (state.parent) {\n      debugLog(`propagating change to parent`)\n\n      // Check if this is a special Map parent with updateMap function\n      if (`updateMap` in state.parent) {\n        // Use the special updateMap function for Maps\n        state.parent.updateMap(state.copy_)\n      } else if (`updateSet` in state.parent) {\n        // Use the special updateSet function for Sets\n        state.parent.updateSet(state.copy_)\n      } else {\n        // Update parent's copy with this object's current state\n        state.parent.tracker.copy_[state.parent.prop] = state.copy_\n        state.parent.tracker.assigned_[state.parent.prop] = true\n      }\n\n      // Mark parent as changed\n      markChanged(state.parent.tracker)\n    }\n  }\n\n  // Check if all properties in the current state have reverted to original values\n  function checkIfReverted(\n    state: ChangeTracker<Record<string | symbol, unknown>>\n  ): boolean {\n    debugLog(\n      `checkIfReverted called with assigned keys:`,\n      Object.keys(state.assigned_)\n    )\n\n    // If there are no assigned properties, object is unchanged\n    if (\n      Object.keys(state.assigned_).length === 0 &&\n      Object.getOwnPropertySymbols(state.assigned_).length === 0\n    ) {\n      debugLog(`No assigned properties, returning true`)\n      return true\n    }\n\n    // Check each assigned regular property\n    for (const prop in state.assigned_) {\n      // If this property is marked as assigned\n      if (state.assigned_[prop] === true) {\n        const currentValue = state.copy_[prop]\n        const originalValue = (state.originalObject as any)[prop]\n\n        debugLog(\n          `Checking property ${String(prop)}, current:`,\n          currentValue,\n          `original:`,\n          originalValue\n        )\n\n        // If the value is not equal to original, something is still changed\n        if (!deepEquals(currentValue, originalValue)) {\n          debugLog(`Property ${String(prop)} is different, returning false`)\n          return false\n        }\n      } else if (state.assigned_[prop] === false) {\n        // Property was deleted, so it's different from original\n        debugLog(`Property ${String(prop)} was deleted, returning false`)\n        return false\n      }\n    }\n\n    // Check each assigned symbol property\n    const symbolProps = Object.getOwnPropertySymbols(state.assigned_)\n    for (const sym of symbolProps) {\n      if (state.assigned_[sym] === true) {\n        const currentValue = (state.copy_ as any)[sym]\n        const originalValue = (state.originalObject as any)[sym]\n\n        // If the value is not equal to original, something is still changed\n        if (!deepEquals(currentValue, originalValue)) {\n          debugLog(`Symbol property is different, returning false`)\n          return false\n        }\n      } else if (state.assigned_[sym] === false) {\n        // Property was deleted, so it's different from original\n        debugLog(`Symbol property was deleted, returning false`)\n        return false\n      }\n    }\n\n    debugLog(`All properties match original values, returning true`)\n    // All assigned properties match their original values\n    return true\n  }\n\n  // Update parent status based on child changes\n  function checkParentStatus(\n    parentState: ChangeTracker<Record<string | symbol, unknown>>,\n    childProp: string | symbol | unknown\n  ) {\n    debugLog(`checkParentStatus called for child prop:`, childProp)\n\n    // Check if all properties of the parent are reverted\n    const isReverted = checkIfReverted(parentState)\n    debugLog(`Parent checkIfReverted returned:`, isReverted)\n\n    if (isReverted) {\n      debugLog(`Parent is fully reverted, clearing tracking`)\n      // If everything is reverted, clear the tracking\n      parentState.modified = false\n      parentState.assigned_ = {}\n\n      // Continue up the chain\n      if (parentState.parent) {\n        debugLog(`Continuing up the parent chain`)\n        checkParentStatus(parentState.parent.tracker, parentState.parent.prop)\n      }\n    }\n  }\n\n  // Create a proxy for the target object\n  function createObjectProxy<TObj extends object>(obj: TObj): TObj {\n    debugLog(`createObjectProxy`, obj)\n    // If we've already created a proxy for this object, return it\n    if (proxyCache.has(obj)) {\n      debugLog(`proxyCache found match`)\n      return proxyCache.get(obj) as TObj\n    }\n\n    // Create a proxy for the object\n    const proxy = new Proxy(obj, {\n      get(ptarget, prop) {\n        debugLog(`get`, ptarget, prop)\n        const value =\n          changeTracker.copy_[prop as keyof T] ??\n          changeTracker.originalObject[prop as keyof T]\n\n        const originalValue = changeTracker.originalObject[prop as keyof T]\n\n        debugLog(`value (at top of proxy get)`, value)\n\n        // If it's a getter, return the value directly\n        const desc = Object.getOwnPropertyDescriptor(ptarget, prop)\n        if (desc?.get) {\n          return value\n        }\n\n        // If the value is a function, bind it to the ptarget\n        if (typeof value === `function`) {\n          // For Array methods that modify the array\n          if (Array.isArray(ptarget)) {\n            const methodName = prop.toString()\n            const modifyingMethods = new Set([\n              `pop`,\n              `push`,\n              `shift`,\n              `unshift`,\n              `splice`,\n              `sort`,\n              `reverse`,\n              `fill`,\n              `copyWithin`,\n            ])\n\n            if (modifyingMethods.has(methodName)) {\n              return function (...args: Array<unknown>) {\n                const result = value.apply(changeTracker.copy_, args)\n                markChanged(changeTracker)\n                return result\n              }\n            }\n          }\n\n          // For Map and Set methods that modify the collection\n          if (ptarget instanceof Map || ptarget instanceof Set) {\n            const methodName = prop.toString()\n            const modifyingMethods = new Set([\n              `set`,\n              `delete`,\n              `clear`,\n              `add`,\n              `pop`,\n              `push`,\n              `shift`,\n              `unshift`,\n              `splice`,\n              `sort`,\n              `reverse`,\n            ])\n\n            if (modifyingMethods.has(methodName)) {\n              return function (...args: Array<unknown>) {\n                const result = value.apply(changeTracker.copy_, args)\n                markChanged(changeTracker)\n                return result\n              }\n            }\n\n            // Handle iterator methods for Map and Set\n            const iteratorMethods = new Set([\n              `entries`,\n              `keys`,\n              `values`,\n              `forEach`,\n              Symbol.iterator,\n            ])\n\n            if (iteratorMethods.has(methodName) || prop === Symbol.iterator) {\n              return function (this: unknown, ...args: Array<unknown>) {\n                const result = value.apply(changeTracker.copy_, args)\n\n                // For forEach, we need to wrap the callback to track changes\n                if (methodName === `forEach`) {\n                  const callback = args[0]\n                  if (typeof callback === `function`) {\n                    // Replace the original callback with our wrapped version\n                    const wrappedCallback = function (\n                      this: unknown,\n                      // eslint-disable-next-line\n                      value: unknown,\n                      key: unknown,\n                      collection: unknown\n                    ) {\n                      // Call the original callback\n                      const cbresult = callback.call(\n                        this,\n                        value,\n                        key,\n                        collection\n                      )\n                      // Mark as changed since the callback might have modified the value\n                      markChanged(changeTracker)\n                      return cbresult\n                    }\n                    // Call forEach with our wrapped callback\n                    return value.apply(ptarget, [\n                      wrappedCallback,\n                      ...args.slice(1),\n                    ])\n                  }\n                }\n\n                // For iterators (entries, keys, values, Symbol.iterator)\n                if (\n                  methodName === `entries` ||\n                  methodName === `values` ||\n                  methodName === Symbol.iterator.toString() ||\n                  prop === Symbol.iterator\n                ) {\n                  // If it's an iterator, we need to wrap the returned iterator\n                  // to track changes when the values are accessed and potentially modified\n                  const originalIterator = result\n\n                  // For values() iterator on Maps, we need to create a value-to-key mapping\n                  const valueToKeyMap = new Map()\n                  if (methodName === `values` && ptarget instanceof Map) {\n                    // Build a mapping from value to key for reverse lookup\n                    // Use the copy_ (which is the current state) to build the mapping\n                    for (const [\n                      key,\n                      mapValue,\n                    ] of changeTracker.copy_.entries()) {\n                      valueToKeyMap.set(mapValue, key)\n                    }\n                  }\n\n                  // For Set iterators, we need to create an original-to-modified mapping\n                  const originalToModifiedMap = new Map()\n                  if (ptarget instanceof Set) {\n                    // Initialize with original values\n                    for (const setValue of changeTracker.copy_.values()) {\n                      originalToModifiedMap.set(setValue, setValue)\n                    }\n                  }\n\n                  // Create a proxy for the iterator that will mark changes when next() is called\n                  return {\n                    next() {\n                      const nextResult = originalIterator.next()\n\n                      // If we have a value and it's an object, we need to track it\n                      if (\n                        !nextResult.done &&\n                        nextResult.value &&\n                        typeof nextResult.value === `object`\n                      ) {\n                        // For entries, the value is a [key, value] pair\n                        if (\n                          methodName === `entries` &&\n                          Array.isArray(nextResult.value) &&\n                          nextResult.value.length === 2\n                        ) {\n                          // The value is at index 1 in the [key, value] pair\n                          if (\n                            nextResult.value[1] &&\n                            typeof nextResult.value[1] === `object`\n                          ) {\n                            const mapKey = nextResult.value[0]\n                            // Create a special parent tracker that knows how to update the Map\n                            const mapParent = {\n                              tracker: changeTracker,\n                              prop: mapKey,\n                              updateMap: (newValue: unknown) => {\n                                // Update the Map in the copy\n                                if (changeTracker.copy_ instanceof Map) {\n                                  changeTracker.copy_.set(mapKey, newValue)\n                                }\n                              },\n                            }\n\n                            // Create a proxy for the value and replace it in the result\n                            const { proxy: valueProxy } =\n                              memoizedCreateChangeProxy(\n                                nextResult.value[1],\n                                mapParent\n                              )\n                            nextResult.value[1] = valueProxy\n                          }\n                        } else if (\n                          methodName === `values` ||\n                          methodName === Symbol.iterator.toString() ||\n                          prop === Symbol.iterator\n                        ) {\n                          // If the value is an object, create a proxy for it\n                          if (\n                            typeof nextResult.value === `object` &&\n                            nextResult.value !== null\n                          ) {\n                            // For Map values(), try to find the key using our mapping\n                            if (\n                              methodName === `values` &&\n                              ptarget instanceof Map\n                            ) {\n                              const mapKey = valueToKeyMap.get(nextResult.value)\n                              if (mapKey !== undefined) {\n                                // Create a special parent tracker for this Map value\n                                const mapParent = {\n                                  tracker: changeTracker,\n                                  prop: mapKey,\n                                  updateMap: (newValue: unknown) => {\n                                    // Update the Map in the copy\n                                    if (changeTracker.copy_ instanceof Map) {\n                                      changeTracker.copy_.set(mapKey, newValue)\n                                    }\n                                  },\n                                }\n\n                                const { proxy: valueProxy } =\n                                  memoizedCreateChangeProxy(\n                                    nextResult.value,\n                                    mapParent\n                                  )\n                                nextResult.value = valueProxy\n                              }\n                            } else if (ptarget instanceof Set) {\n                              // For Set, we need to track modifications and update the Set accordingly\n                              const setOriginalValue = nextResult.value\n                              const setParent = {\n                                tracker: changeTracker,\n                                prop: setOriginalValue, // Use the original value as the prop\n                                updateSet: (newValue: unknown) => {\n                                  // Update the Set in the copy by removing old value and adding new one\n                                  if (changeTracker.copy_ instanceof Set) {\n                                    changeTracker.copy_.delete(setOriginalValue)\n                                    changeTracker.copy_.add(newValue)\n                                    // Update our mapping for future iterations\n                                    originalToModifiedMap.set(\n                                      setOriginalValue,\n                                      newValue\n                                    )\n                                  }\n                                },\n                              }\n\n                              const { proxy: valueProxy } =\n                                memoizedCreateChangeProxy(\n                                  nextResult.value,\n                                  setParent\n                                )\n                              nextResult.value = valueProxy\n                            } else {\n                              // For other cases, use a symbol as a placeholder\n                              const tempKey = Symbol(`iterator-value`)\n                              const { proxy: valueProxy } =\n                                memoizedCreateChangeProxy(nextResult.value, {\n                                  tracker: changeTracker,\n                                  prop: tempKey,\n                                })\n                              nextResult.value = valueProxy\n                            }\n                          }\n                        }\n                      }\n\n                      return nextResult\n                    },\n                    [Symbol.iterator]() {\n                      return this\n                    },\n                  }\n                }\n\n                return result\n              }\n            }\n          }\n          return value.bind(ptarget)\n        }\n\n        // If the value is an object (but not Date, RegExp, or Temporal), create a proxy for it\n        if (\n          value &&\n          typeof value === `object` &&\n          !((value as any) instanceof Date) &&\n          !((value as any) instanceof RegExp) &&\n          !isTemporal(value)\n        ) {\n          // Create a parent reference for the nested object\n          const nestedParent = {\n            tracker: changeTracker,\n            prop: String(prop),\n          }\n\n          // Create a proxy for the nested object\n          const { proxy: nestedProxy } = memoizedCreateChangeProxy(\n            originalValue,\n            nestedParent\n          )\n\n          // Cache the proxy\n          proxyCache.set(value, nestedProxy)\n\n          return nestedProxy\n        }\n\n        return value\n      },\n\n      set(_sobj, prop, value) {\n        const currentValue = changeTracker.copy_[prop as keyof T]\n        debugLog(\n          `set called for property ${String(prop)}, current:`,\n          currentValue,\n          `new:`,\n          value\n        )\n\n        // Only track the change if the value is actually different\n        if (!deepEquals(currentValue, value)) {\n          // Check if the new value is equal to the original value\n          // Important: Use the originalObject to get the true original value\n          const originalValue = changeTracker.originalObject[prop as keyof T]\n          const isRevertToOriginal = deepEquals(value, originalValue)\n          debugLog(\n            `value:`,\n            value,\n            `original:`,\n            originalValue,\n            `isRevertToOriginal:`,\n            isRevertToOriginal\n          )\n\n          if (isRevertToOriginal) {\n            debugLog(`Reverting property ${String(prop)} to original value`)\n            // If the value is reverted to its original state, remove it from changes\n            delete changeTracker.assigned_[prop.toString()]\n\n            // Make sure the copy is updated with the original value\n            debugLog(`Updating copy with original value for ${String(prop)}`)\n            changeTracker.copy_[prop as keyof T] = deepClone(originalValue)\n\n            // Check if all properties in this object have been reverted\n            debugLog(`Checking if all properties reverted`)\n            const allReverted = checkIfReverted(changeTracker)\n            debugLog(`All reverted:`, allReverted)\n\n            if (allReverted) {\n              debugLog(`All properties reverted, clearing tracking`)\n              // If all have been reverted, clear tracking\n              changeTracker.modified = false\n              changeTracker.assigned_ = {}\n\n              // If we're a nested object, check if the parent needs updating\n              if (parent) {\n                debugLog(`Updating parent for property:`, parent.prop)\n                checkParentStatus(parent.tracker, parent.prop)\n              }\n            } else {\n              // Some properties are still changed\n              debugLog(`Some properties still changed, keeping modified flag`)\n              changeTracker.modified = true\n            }\n          } else {\n            debugLog(`Setting new value for property ${String(prop)}`)\n\n            // Set the value on the copy\n            changeTracker.copy_[prop as keyof T] = value\n\n            // Track that this property was assigned - store using the actual property (symbol or string)\n            changeTracker.assigned_[prop.toString()] = true\n\n            // Mark this object and its ancestors as modified\n            debugLog(`Marking object and ancestors as modified`, changeTracker)\n            markChanged(changeTracker)\n          }\n        } else {\n          debugLog(`Value unchanged, not tracking`)\n        }\n\n        return true\n      },\n\n      defineProperty(_ptarget, prop, descriptor) {\n        // const result = Reflect.defineProperty(\n        //   changeTracker.copy_,\n        //   prop,\n        //   descriptor\n        // )\n        // if (result) {\n        if (`value` in descriptor) {\n          changeTracker.copy_[prop as keyof T] = deepClone(descriptor.value)\n          changeTracker.assigned_[prop.toString()] = true\n          markChanged(changeTracker)\n        }\n        // }\n        // return result\n        return true\n      },\n\n      deleteProperty(dobj, prop) {\n        debugLog(`deleteProperty`, dobj, prop)\n        const stringProp = typeof prop === `symbol` ? prop.toString() : prop\n\n        if (stringProp in dobj) {\n          // Check if the property exists in the original object\n          const hadPropertyInOriginal =\n            stringProp in changeTracker.originalObject\n\n          // Delete the property from the copy\n          // Use type assertion to tell TypeScript this is allowed\n          delete (changeTracker.copy_ as Record<string | symbol, unknown>)[prop]\n\n          // If the property didn't exist in the original object, removing it\n          // should revert to the original state\n          if (!hadPropertyInOriginal) {\n            delete changeTracker.copy_[stringProp]\n            delete changeTracker.assigned_[stringProp]\n\n            // If this is the last change and we're not a nested object,\n            // mark the object as unmodified\n            if (\n              Object.keys(changeTracker.assigned_).length === 0 &&\n              Object.getOwnPropertySymbols(changeTracker.assigned_).length === 0\n            ) {\n              changeTracker.modified = false\n            } else {\n              // We still have changes, keep as modified\n              changeTracker.modified = true\n            }\n          } else {\n            // Mark this property as deleted\n            changeTracker.assigned_[stringProp] = false\n            changeTracker.copy_[stringProp as keyof T] = undefined as T[keyof T]\n            markChanged(changeTracker)\n          }\n        }\n\n        return true\n      },\n    })\n\n    // Cache the proxy\n    proxyCache.set(obj, proxy)\n\n    return proxy\n  }\n\n  // Create a proxy for the target object\n  const proxy = createObjectProxy(target)\n\n  // Return the proxy and a function to get the changes\n  return {\n    proxy,\n    getChanges: () => {\n      debugLog(`getChanges called, modified:`, changeTracker.modified)\n      debugLog(changeTracker)\n\n      // First, check if the object is still considered modified\n      if (!changeTracker.modified) {\n        debugLog(`Object not modified, returning empty object`)\n        return {}\n      }\n\n      // If we have a copy, return it directly\n      // Check if valueObj is actually an object\n      if (\n        typeof changeTracker.copy_ !== `object` ||\n        Array.isArray(changeTracker.copy_)\n      ) {\n        return changeTracker.copy_\n      }\n\n      if (Object.keys(changeTracker.assigned_).length === 0) {\n        return changeTracker.copy_\n      }\n\n      const result: Record<string, any | undefined> = {}\n\n      // Iterate through keys in keyObj\n      for (const key in changeTracker.copy_) {\n        // If the key's value is true and the key exists in valueObj\n        if (\n          changeTracker.assigned_[key] === true &&\n          key in changeTracker.copy_\n        ) {\n          result[key] = changeTracker.copy_[key]\n        }\n      }\n      debugLog(`Returning copy:`, result)\n      return result as unknown as Record<string | symbol, unknown>\n    },\n  }\n}\n\n/**\n * Creates proxies for an array of objects and tracks changes to each\n *\n * @param targets Array of objects to proxy\n * @returns An object containing the array of proxies and a function to get all changes\n */\nexport function createArrayChangeProxy<T extends object>(\n  targets: Array<T>\n): {\n  proxies: Array<T>\n  getChanges: () => Array<Record<string | symbol, unknown>>\n} {\n  const proxiesWithChanges = targets.map((target) => createChangeProxy(target))\n\n  return {\n    proxies: proxiesWithChanges.map((p) => p.proxy),\n    getChanges: () => proxiesWithChanges.map((p) => p.getChanges()),\n  }\n}\n\n/**\n * Creates a proxy for an object, passes it to a callback function,\n * and returns the changes made by the callback\n *\n * @param target The object to proxy\n * @param callback Function that receives the proxy and can make changes to it\n * @returns The changes made to the object\n */\nexport function withChangeTracking<T extends object>(\n  target: T,\n  callback: (proxy: T) => void\n): Record<string | symbol, unknown> {\n  const { proxy, getChanges } = createChangeProxy(target)\n\n  callback(proxy)\n\n  return getChanges()\n}\n\n/**\n * Creates proxies for an array of objects, passes them to a callback function,\n * and returns the changes made by the callback for each object\n *\n * @param targets Array of objects to proxy\n * @param callback Function that receives the proxies and can make changes to them\n * @returns Array of changes made to each object\n */\nexport function withArrayChangeTracking<T extends object>(\n  targets: Array<T>,\n  callback: (proxies: Array<T>) => void\n): Array<Record<string | symbol, unknown>> {\n  const { proxies, getChanges } = createArrayChangeProxy(targets)\n\n  callback(proxies)\n\n  return getChanges()\n}\n"],"names":["clone","proxy","value"],"mappings":";AAWA,SAAS,YAAY,MAA4B;AAE/C,QAAM,YACJ,OAAO,WAAW,eAAe,OAAO,iBAAiB;AAG3D,MAAI,aAAa,aAAa,QAAQ,OAAO,MAAM,QAAQ;AACzD,YAAQ,IAAI,WAAW,GAAG,IAAI;AAAA,EAChC;AAAA;AAAA,IAIE,CAAC,aACD,OAAO,YAAY,eACnB,QAAQ,IAAI,UAAU;AAAA,IACtB;AACA,YAAQ,IAAI,WAAW,GAAG,IAAI;AAAA,EAChC;AACF;AAqCA,SAAS,UACP,KACA,UAAU,oBAAI,WACX;AAEH,MAAI,QAAQ,QAAQ,QAAQ,QAAW;AACrC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,IAAI,GAAa,GAAG;AAC9B,WAAO,QAAQ,IAAI,GAAa;AAAA,EAClC;AAEA,MAAI,eAAe,MAAM;AACvB,WAAO,IAAI,KAAK,IAAI,SAAS;AAAA,EAC/B;AAEA,MAAI,eAAe,QAAQ;AACzB,WAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,KAAK;AAAA,EACzC;AAEA,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,UAAM,aAAa,CAAA;AACnB,YAAQ,IAAI,KAAe,UAAU;AACrC,QAAI,QAAQ,CAAC,MAAM,UAAU;AAC3B,iBAAW,KAAK,IAAI,UAAU,MAAM,OAAO;AAAA,IAC7C,CAAC;AACD,WAAO;AAAA,EACT;AAGA,MAAI,YAAY,OAAO,GAAG,KAAK,EAAE,eAAe,WAAW;AAEzD,UAAM,wBAAwB,OAAO,eAAe,GAAG,EAAE;AACzD,UAAMA,SAAQ,IAAI;AAAA,MACf,IAA8B;AAAA,IAAA;AAEjC,YAAQ,IAAI,KAAeA,MAAK;AAGhC,aAAS,IAAI,GAAG,IAAK,IAA8B,QAAQ,KAAK;AAC9DA,aAAM,CAAC,IAAK,IAA8B,CAAC;AAAA,IAC7C;AAEA,WAAOA;AAAAA,EACT;AAEA,MAAI,eAAe,KAAK;AACtB,UAAMA,6BAAY,IAAA;AAClB,YAAQ,IAAI,KAAeA,MAAK;AAChC,QAAI,QAAQ,CAAC,OAAO,QAAQ;AAC1BA,aAAM,IAAI,KAAK,UAAU,OAAO,OAAO,CAAC;AAAA,IAC1C,CAAC;AACD,WAAOA;AAAAA,EACT;AAEA,MAAI,eAAe,KAAK;AACtB,UAAMA,6BAAY,IAAA;AAClB,YAAQ,IAAI,KAAeA,MAAK;AAChC,QAAI,QAAQ,CAAC,UAAU;AACrBA,aAAM,IAAI,UAAU,OAAO,OAAO,CAAC;AAAA,IACrC,CAAC;AACD,WAAOA;AAAAA,EACT;AAGA,MAAI,WAAW,GAAG,GAAG;AAGnB,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAA;AACd,UAAQ,IAAI,KAAe,KAAK;AAEhC,aAAW,OAAO,KAAK;AACrB,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAClD,YAAM,GAAG,IAAI;AAAA,QACV,IAAyC,GAAG;AAAA,QAC7C;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAEA,QAAM,cAAc,OAAO,sBAAsB,GAAG;AACpD,aAAW,OAAO,aAAa;AAC7B,UAAM,GAAG,IAAI;AAAA,MACV,IAAyC,GAAG;AAAA,MAC7C;AAAA,IAAA;AAAA,EAEJ;AAEA,SAAO;AACT;AAEA,IAAI,QAAQ;AACZ,SAAS,gBAAgB;AACvB,WAAS;AACT,SAAO;AACT;AASO,SAAS,kBAGd,QACA,QAQA;AACA,QAAM,uCAAuB,IAAA;AAE7B,WAAS,0BAGP,aACA,aAOA;AACA,aAAS,cAAc,YAAY,YAAY,IAAI;AACnD,QAAI,iBAAiB,IAAI,WAAW,GAAG;AACrC,aAAO,iBAAiB,IAAI,WAAW;AAAA,IAIzC,OAAO;AACL,YAAM,cAAc,kBAAkB,aAAa,WAAW;AAC9D,uBAAiB,IAAI,aAAa,WAAW;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAIA,QAAM,iCAAiB,IAAA;AAGvB,QAAM,gBAAkC;AAAA,IACtC,OAAO,UAAU,MAAM;AAAA,IACvB,gBAAgB,UAAU,MAAM;AAAA,IAChC,YAAY,cAAA;AAAA,IACZ,UAAU;AAAA,IACV,WAAW,CAAA;AAAA,IACX;AAAA,IACA;AAAA;AAAA,EAAA;AAGF;AAAA,IACE;AAAA,IACA;AAAA,IACA,cAAc;AAAA,EAAA;AAIhB,WAAS,YAAY,OAA8B;AACjD,QAAI,CAAC,MAAM,UAAU;AACnB,YAAM,WAAW;AAAA,IACnB;AAGA,QAAI,MAAM,QAAQ;AAChB,eAAS,8BAA8B;AAGvC,UAAI,eAAe,MAAM,QAAQ;AAE/B,cAAM,OAAO,UAAU,MAAM,KAAK;AAAA,MACpC,WAAW,eAAe,MAAM,QAAQ;AAEtC,cAAM,OAAO,UAAU,MAAM,KAAK;AAAA,MACpC,OAAO;AAEL,cAAM,OAAO,QAAQ,MAAM,MAAM,OAAO,IAAI,IAAI,MAAM;AACtD,cAAM,OAAO,QAAQ,UAAU,MAAM,OAAO,IAAI,IAAI;AAAA,MACtD;AAGA,kBAAY,MAAM,OAAO,OAAO;AAAA,IAClC;AAAA,EACF;AAGA,WAAS,gBACP,OACS;AACT;AAAA,MACE;AAAA,MACA,OAAO,KAAK,MAAM,SAAS;AAAA,IAAA;AAI7B,QACE,OAAO,KAAK,MAAM,SAAS,EAAE,WAAW,KACxC,OAAO,sBAAsB,MAAM,SAAS,EAAE,WAAW,GACzD;AACA,eAAS,wCAAwC;AACjD,aAAO;AAAA,IACT;AAGA,eAAW,QAAQ,MAAM,WAAW;AAElC,UAAI,MAAM,UAAU,IAAI,MAAM,MAAM;AAClC,cAAM,eAAe,MAAM,MAAM,IAAI;AACrC,cAAM,gBAAiB,MAAM,eAAuB,IAAI;AAExD;AAAA,UACE,qBAAqB,OAAO,IAAI,CAAC;AAAA,UACjC;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAIF,YAAI,CAAC,WAAW,cAAc,aAAa,GAAG;AAC5C,mBAAS,YAAY,OAAO,IAAI,CAAC,gCAAgC;AACjE,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,MAAM,UAAU,IAAI,MAAM,OAAO;AAE1C,iBAAS,YAAY,OAAO,IAAI,CAAC,+BAA+B;AAChE,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,cAAc,OAAO,sBAAsB,MAAM,SAAS;AAChE,eAAW,OAAO,aAAa;AAC7B,UAAI,MAAM,UAAU,GAAG,MAAM,MAAM;AACjC,cAAM,eAAgB,MAAM,MAAc,GAAG;AAC7C,cAAM,gBAAiB,MAAM,eAAuB,GAAG;AAGvD,YAAI,CAAC,WAAW,cAAc,aAAa,GAAG;AAC5C,mBAAS,+CAA+C;AACxD,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,MAAM,UAAU,GAAG,MAAM,OAAO;AAEzC,iBAAS,8CAA8C;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,sDAAsD;AAE/D,WAAO;AAAA,EACT;AAGA,WAAS,kBACP,aACA,WACA;AACA,aAAS,4CAA4C,SAAS;AAG9D,UAAM,aAAa,gBAAgB,WAAW;AAC9C,aAAS,oCAAoC,UAAU;AAEvD,QAAI,YAAY;AACd,eAAS,6CAA6C;AAEtD,kBAAY,WAAW;AACvB,kBAAY,YAAY,CAAA;AAGxB,UAAI,YAAY,QAAQ;AACtB,iBAAS,gCAAgC;AACzC,0BAAkB,YAAY,OAAO,SAAS,YAAY,OAAO,IAAI;AAAA,MACvE;AAAA,IACF;AAAA,EACF;AAGA,WAAS,kBAAuC,KAAiB;AAC/D,aAAS,qBAAqB,GAAG;AAEjC,QAAI,WAAW,IAAI,GAAG,GAAG;AACvB,eAAS,wBAAwB;AACjC,aAAO,WAAW,IAAI,GAAG;AAAA,IAC3B;AAGA,UAAMC,SAAQ,IAAI,MAAM,KAAK;AAAA,MAC3B,IAAI,SAAS,MAAM;AACjB,iBAAS,OAAO,SAAS,IAAI;AAC7B,cAAM,QACJ,cAAc,MAAM,IAAe,KACnC,cAAc,eAAe,IAAe;AAE9C,cAAM,gBAAgB,cAAc,eAAe,IAAe;AAElE,iBAAS,+BAA+B,KAAK;AAG7C,cAAM,OAAO,OAAO,yBAAyB,SAAS,IAAI;AAC1D,YAAI,MAAM,KAAK;AACb,iBAAO;AAAA,QACT;AAGA,YAAI,OAAO,UAAU,YAAY;AAE/B,cAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,kBAAM,aAAa,KAAK,SAAA;AACxB,kBAAM,uCAAuB,IAAI;AAAA,cAC/B;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YAAA,CACD;AAED,gBAAI,iBAAiB,IAAI,UAAU,GAAG;AACpC,qBAAO,YAAa,MAAsB;AACxC,sBAAM,SAAS,MAAM,MAAM,cAAc,OAAO,IAAI;AACpD,4BAAY,aAAa;AACzB,uBAAO;AAAA,cACT;AAAA,YACF;AAAA,UACF;AAGA,cAAI,mBAAmB,OAAO,mBAAmB,KAAK;AACpD,kBAAM,aAAa,KAAK,SAAA;AACxB,kBAAM,uCAAuB,IAAI;AAAA,cAC/B;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YAAA,CACD;AAED,gBAAI,iBAAiB,IAAI,UAAU,GAAG;AACpC,qBAAO,YAAa,MAAsB;AACxC,sBAAM,SAAS,MAAM,MAAM,cAAc,OAAO,IAAI;AACpD,4BAAY,aAAa;AACzB,uBAAO;AAAA,cACT;AAAA,YACF;AAGA,kBAAM,sCAAsB,IAAI;AAAA,cAC9B;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA,OAAO;AAAA,YAAA,CACR;AAED,gBAAI,gBAAgB,IAAI,UAAU,KAAK,SAAS,OAAO,UAAU;AAC/D,qBAAO,YAA4B,MAAsB;AACvD,sBAAM,SAAS,MAAM,MAAM,cAAc,OAAO,IAAI;AAGpD,oBAAI,eAAe,WAAW;AAC5B,wBAAM,WAAW,KAAK,CAAC;AACvB,sBAAI,OAAO,aAAa,YAAY;AAElC,0BAAM,kBAAkB,SAGtBC,QACA,KACA,YACA;AAEA,4BAAM,WAAW,SAAS;AAAA,wBACxB;AAAA,wBACAA;AAAAA,wBACA;AAAA,wBACA;AAAA,sBAAA;AAGF,kCAAY,aAAa;AACzB,6BAAO;AAAA,oBACT;AAEA,2BAAO,MAAM,MAAM,SAAS;AAAA,sBAC1B;AAAA,sBACA,GAAG,KAAK,MAAM,CAAC;AAAA,oBAAA,CAChB;AAAA,kBACH;AAAA,gBACF;AAGA,oBACE,eAAe,aACf,eAAe,YACf,eAAe,OAAO,SAAS,SAAA,KAC/B,SAAS,OAAO,UAChB;AAGA,wBAAM,mBAAmB;AAGzB,wBAAM,oCAAoB,IAAA;AAC1B,sBAAI,eAAe,YAAY,mBAAmB,KAAK;AAGrD,+BAAW;AAAA,sBACT;AAAA,sBACA;AAAA,oBAAA,KACG,cAAc,MAAM,WAAW;AAClC,oCAAc,IAAI,UAAU,GAAG;AAAA,oBACjC;AAAA,kBACF;AAGA,wBAAM,4CAA4B,IAAA;AAClC,sBAAI,mBAAmB,KAAK;AAE1B,+BAAW,YAAY,cAAc,MAAM,OAAA,GAAU;AACnD,4CAAsB,IAAI,UAAU,QAAQ;AAAA,oBAC9C;AAAA,kBACF;AAGA,yBAAO;AAAA,oBACL,OAAO;AACL,4BAAM,aAAa,iBAAiB,KAAA;AAGpC,0BACE,CAAC,WAAW,QACZ,WAAW,SACX,OAAO,WAAW,UAAU,UAC5B;AAEA,4BACE,eAAe,aACf,MAAM,QAAQ,WAAW,KAAK,KAC9B,WAAW,MAAM,WAAW,GAC5B;AAEA,8BACE,WAAW,MAAM,CAAC,KAClB,OAAO,WAAW,MAAM,CAAC,MAAM,UAC/B;AACA,kCAAM,SAAS,WAAW,MAAM,CAAC;AAEjC,kCAAM,YAAY;AAAA,8BAChB,SAAS;AAAA,8BACT,MAAM;AAAA,8BACN,WAAW,CAAC,aAAsB;AAEhC,oCAAI,cAAc,iBAAiB,KAAK;AACtC,gDAAc,MAAM,IAAI,QAAQ,QAAQ;AAAA,gCAC1C;AAAA,8BACF;AAAA,4BAAA;AAIF,kCAAM,EAAE,OAAO,WAAA,IACb;AAAA,8BACE,WAAW,MAAM,CAAC;AAAA,8BAClB;AAAA,4BAAA;AAEJ,uCAAW,MAAM,CAAC,IAAI;AAAA,0BACxB;AAAA,wBACF,WACE,eAAe,YACf,eAAe,OAAO,SAAS,SAAA,KAC/B,SAAS,OAAO,UAChB;AAEA,8BACE,OAAO,WAAW,UAAU,YAC5B,WAAW,UAAU,MACrB;AAEA,gCACE,eAAe,YACf,mBAAmB,KACnB;AACA,oCAAM,SAAS,cAAc,IAAI,WAAW,KAAK;AACjD,kCAAI,WAAW,QAAW;AAExB,sCAAM,YAAY;AAAA,kCAChB,SAAS;AAAA,kCACT,MAAM;AAAA,kCACN,WAAW,CAAC,aAAsB;AAEhC,wCAAI,cAAc,iBAAiB,KAAK;AACtC,oDAAc,MAAM,IAAI,QAAQ,QAAQ;AAAA,oCAC1C;AAAA,kCACF;AAAA,gCAAA;AAGF,sCAAM,EAAE,OAAO,WAAA,IACb;AAAA,kCACE,WAAW;AAAA,kCACX;AAAA,gCAAA;AAEJ,2CAAW,QAAQ;AAAA,8BACrB;AAAA,4BACF,WAAW,mBAAmB,KAAK;AAEjC,oCAAM,mBAAmB,WAAW;AACpC,oCAAM,YAAY;AAAA,gCAChB,SAAS;AAAA,gCACT,MAAM;AAAA;AAAA,gCACN,WAAW,CAAC,aAAsB;AAEhC,sCAAI,cAAc,iBAAiB,KAAK;AACtC,kDAAc,MAAM,OAAO,gBAAgB;AAC3C,kDAAc,MAAM,IAAI,QAAQ;AAEhC,0DAAsB;AAAA,sCACpB;AAAA,sCACA;AAAA,oCAAA;AAAA,kCAEJ;AAAA,gCACF;AAAA,8BAAA;AAGF,oCAAM,EAAE,OAAO,WAAA,IACb;AAAA,gCACE,WAAW;AAAA,gCACX;AAAA,8BAAA;AAEJ,yCAAW,QAAQ;AAAA,4BACrB,OAAO;AAEL,oCAAM,UAAU,OAAO,gBAAgB;AACvC,oCAAM,EAAE,OAAO,WAAA,IACb,0BAA0B,WAAW,OAAO;AAAA,gCAC1C,SAAS;AAAA,gCACT,MAAM;AAAA,8BAAA,CACP;AACH,yCAAW,QAAQ;AAAA,4BACrB;AAAA,0BACF;AAAA,wBACF;AAAA,sBACF;AAEA,6BAAO;AAAA,oBACT;AAAA,oBACA,CAAC,OAAO,QAAQ,IAAI;AAClB,6BAAO;AAAA,oBACT;AAAA,kBAAA;AAAA,gBAEJ;AAEA,uBAAO;AAAA,cACT;AAAA,YACF;AAAA,UACF;AACA,iBAAO,MAAM,KAAK,OAAO;AAAA,QAC3B;AAGA,YACE,SACA,OAAO,UAAU,YACjB,EAAG,iBAAyB,SAC5B,EAAG,iBAAyB,WAC5B,CAAC,WAAW,KAAK,GACjB;AAEA,gBAAM,eAAe;AAAA,YACnB,SAAS;AAAA,YACT,MAAM,OAAO,IAAI;AAAA,UAAA;AAInB,gBAAM,EAAE,OAAO,YAAA,IAAgB;AAAA,YAC7B;AAAA,YACA;AAAA,UAAA;AAIF,qBAAW,IAAI,OAAO,WAAW;AAEjC,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AAAA,MAEA,IAAI,OAAO,MAAM,OAAO;AACtB,cAAM,eAAe,cAAc,MAAM,IAAe;AACxD;AAAA,UACE,2BAA2B,OAAO,IAAI,CAAC;AAAA,UACvC;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAIF,YAAI,CAAC,WAAW,cAAc,KAAK,GAAG;AAGpC,gBAAM,gBAAgB,cAAc,eAAe,IAAe;AAClE,gBAAM,qBAAqB,WAAW,OAAO,aAAa;AAC1D;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UAAA;AAGF,cAAI,oBAAoB;AACtB,qBAAS,sBAAsB,OAAO,IAAI,CAAC,oBAAoB;AAE/D,mBAAO,cAAc,UAAU,KAAK,SAAA,CAAU;AAG9C,qBAAS,yCAAyC,OAAO,IAAI,CAAC,EAAE;AAChE,0BAAc,MAAM,IAAe,IAAI,UAAU,aAAa;AAG9D,qBAAS,qCAAqC;AAC9C,kBAAM,cAAc,gBAAgB,aAAa;AACjD,qBAAS,iBAAiB,WAAW;AAErC,gBAAI,aAAa;AACf,uBAAS,4CAA4C;AAErD,4BAAc,WAAW;AACzB,4BAAc,YAAY,CAAA;AAG1B,kBAAI,QAAQ;AACV,yBAAS,iCAAiC,OAAO,IAAI;AACrD,kCAAkB,OAAO,SAAS,OAAO,IAAI;AAAA,cAC/C;AAAA,YACF,OAAO;AAEL,uBAAS,sDAAsD;AAC/D,4BAAc,WAAW;AAAA,YAC3B;AAAA,UACF,OAAO;AACL,qBAAS,kCAAkC,OAAO,IAAI,CAAC,EAAE;AAGzD,0BAAc,MAAM,IAAe,IAAI;AAGvC,0BAAc,UAAU,KAAK,SAAA,CAAU,IAAI;AAG3C,qBAAS,4CAA4C,aAAa;AAClE,wBAAY,aAAa;AAAA,UAC3B;AAAA,QACF,OAAO;AACL,mBAAS,+BAA+B;AAAA,QAC1C;AAEA,eAAO;AAAA,MACT;AAAA,MAEA,eAAe,UAAU,MAAM,YAAY;AAOzC,YAAI,WAAW,YAAY;AACzB,wBAAc,MAAM,IAAe,IAAI,UAAU,WAAW,KAAK;AACjE,wBAAc,UAAU,KAAK,SAAA,CAAU,IAAI;AAC3C,sBAAY,aAAa;AAAA,QAC3B;AAGA,eAAO;AAAA,MACT;AAAA,MAEA,eAAe,MAAM,MAAM;AACzB,iBAAS,kBAAkB,MAAM,IAAI;AACrC,cAAM,aAAa,OAAO,SAAS,WAAW,KAAK,aAAa;AAEhE,YAAI,cAAc,MAAM;AAEtB,gBAAM,wBACJ,cAAc,cAAc;AAI9B,iBAAQ,cAAc,MAA2C,IAAI;AAIrE,cAAI,CAAC,uBAAuB;AAC1B,mBAAO,cAAc,MAAM,UAAU;AACrC,mBAAO,cAAc,UAAU,UAAU;AAIzC,gBACE,OAAO,KAAK,cAAc,SAAS,EAAE,WAAW,KAChD,OAAO,sBAAsB,cAAc,SAAS,EAAE,WAAW,GACjE;AACA,4BAAc,WAAW;AAAA,YAC3B,OAAO;AAEL,4BAAc,WAAW;AAAA,YAC3B;AAAA,UACF,OAAO;AAEL,0BAAc,UAAU,UAAU,IAAI;AACtC,0BAAc,MAAM,UAAqB,IAAI;AAC7C,wBAAY,aAAa;AAAA,UAC3B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA,IAAA,CACD;AAGD,eAAW,IAAI,KAAKD,MAAK;AAEzB,WAAOA;AAAAA,EACT;AAGA,QAAM,QAAQ,kBAAkB,MAAM;AAGtC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM;AAChB,eAAS,gCAAgC,cAAc,QAAQ;AAC/D,eAAS,aAAa;AAGtB,UAAI,CAAC,cAAc,UAAU;AAC3B,iBAAS,6CAA6C;AACtD,eAAO,CAAA;AAAA,MACT;AAIA,UACE,OAAO,cAAc,UAAU,YAC/B,MAAM,QAAQ,cAAc,KAAK,GACjC;AACA,eAAO,cAAc;AAAA,MACvB;AAEA,UAAI,OAAO,KAAK,cAAc,SAAS,EAAE,WAAW,GAAG;AACrD,eAAO,cAAc;AAAA,MACvB;AAEA,YAAM,SAA0C,CAAA;AAGhD,iBAAW,OAAO,cAAc,OAAO;AAErC,YACE,cAAc,UAAU,GAAG,MAAM,QACjC,OAAO,cAAc,OACrB;AACA,iBAAO,GAAG,IAAI,cAAc,MAAM,GAAG;AAAA,QACvC;AAAA,MACF;AACA,eAAS,mBAAmB,MAAM;AAClC,aAAO;AAAA,IACT;AAAA,EAAA;AAEJ;AAQO,SAAS,uBACd,SAIA;AACA,QAAM,qBAAqB,QAAQ,IAAI,CAAC,WAAW,kBAAkB,MAAM,CAAC;AAE5E,SAAO;AAAA,IACL,SAAS,mBAAmB,IAAI,CAAC,MAAM,EAAE,KAAK;AAAA,IAC9C,YAAY,MAAM,mBAAmB,IAAI,CAAC,MAAM,EAAE,YAAY;AAAA,EAAA;AAElE;AAUO,SAAS,mBACd,QACA,UACkC;AAClC,QAAM,EAAE,OAAO,eAAe,kBAAkB,MAAM;AAEtD,WAAS,KAAK;AAEd,SAAO,WAAA;AACT;AAUO,SAAS,wBACd,SACA,UACyC;AACzC,QAAM,EAAE,SAAS,eAAe,uBAAuB,OAAO;AAE9D,WAAS,OAAO;AAEhB,SAAO,WAAA;AACT;"}
+{"version":3,"file":"proxy.js","sources":["../../src/proxy.ts"],"sourcesContent":["/**\n * A utility for creating a proxy that captures changes to an object\n * and provides a way to retrieve those changes.\n */\n\nimport { deepEquals, isTemporal } from \"./utils\"\n\n/**\n * Set of array methods that iterate with callbacks and may return elements.\n * Hoisted to module scope to avoid creating a new Set on every property access.\n */\nconst CALLBACK_ITERATION_METHODS = new Set([\n  `find`,\n  `findLast`,\n  `findIndex`,\n  `findLastIndex`,\n  `filter`,\n  `map`,\n  `flatMap`,\n  `forEach`,\n  `some`,\n  `every`,\n  `reduce`,\n  `reduceRight`,\n])\n\n/**\n * Set of array methods that modify the array in place.\n */\nconst ARRAY_MODIFYING_METHODS = new Set([\n  `pop`,\n  `push`,\n  `shift`,\n  `unshift`,\n  `splice`,\n  `sort`,\n  `reverse`,\n  `fill`,\n  `copyWithin`,\n])\n\n/**\n * Set of Map/Set methods that modify the collection in place.\n */\nconst MAP_SET_MODIFYING_METHODS = new Set([`set`, `delete`, `clear`, `add`])\n\n/**\n * Set of Map/Set iterator methods.\n */\nconst MAP_SET_ITERATOR_METHODS = new Set([\n  `entries`,\n  `keys`,\n  `values`,\n  `forEach`,\n])\n\n/**\n * Check if a value is a proxiable object (not Date, RegExp, or Temporal)\n */\nfunction isProxiableObject(\n  value: unknown\n): value is Record<string | symbol, unknown> {\n  return (\n    value !== null &&\n    typeof value === `object` &&\n    !((value as any) instanceof Date) &&\n    !((value as any) instanceof RegExp) &&\n    !isTemporal(value)\n  )\n}\n\n/**\n * Creates a handler for array iteration methods that ensures proxied elements\n * are passed to callbacks and returned from methods like find/filter.\n */\nfunction createArrayIterationHandler<T extends object>(\n  methodName: string,\n  methodFn: (...args: Array<unknown>) => unknown,\n  changeTracker: ChangeTracker<T>,\n  memoizedCreateChangeProxy: (\n    obj: Record<string | symbol, unknown>,\n    parent?: {\n      tracker: ChangeTracker<Record<string | symbol, unknown>>\n      prop: string | symbol\n    }\n  ) => { proxy: Record<string | symbol, unknown> }\n): ((...args: Array<unknown>) => unknown) | undefined {\n  if (!CALLBACK_ITERATION_METHODS.has(methodName)) {\n    return undefined\n  }\n\n  return function (...args: Array<unknown>) {\n    const callback = args[0]\n    if (typeof callback !== `function`) {\n      return methodFn.apply(changeTracker.copy_, args)\n    }\n\n    // Create a helper to get proxied version of an array element\n    const getProxiedElement = (element: unknown, index: number): unknown => {\n      if (isProxiableObject(element)) {\n        const nestedParent = {\n          tracker: changeTracker as unknown as ChangeTracker<\n            Record<string | symbol, unknown>\n          >,\n          prop: String(index),\n        }\n        const { proxy: elementProxy } = memoizedCreateChangeProxy(\n          element,\n          nestedParent\n        )\n        return elementProxy\n      }\n      return element\n    }\n\n    // Wrap the callback to pass proxied elements\n    const wrappedCallback = function (\n      this: unknown,\n      element: unknown,\n      index: number,\n      array: unknown\n    ) {\n      const proxiedElement = getProxiedElement(element, index)\n      return callback.call(this, proxiedElement, index, array)\n    }\n\n    // For reduce/reduceRight, the callback signature is different\n    if (methodName === `reduce` || methodName === `reduceRight`) {\n      const reduceCallback = function (\n        this: unknown,\n        accumulator: unknown,\n        element: unknown,\n        index: number,\n        array: unknown\n      ) {\n        const proxiedElement = getProxiedElement(element, index)\n        return callback.call(this, accumulator, proxiedElement, index, array)\n      }\n      return methodFn.apply(changeTracker.copy_, [\n        reduceCallback,\n        ...args.slice(1),\n      ])\n    }\n\n    const result = methodFn.apply(changeTracker.copy_, [\n      wrappedCallback,\n      ...args.slice(1),\n    ])\n\n    // For find/findLast, proxy the returned element if it's an object\n    if (\n      (methodName === `find` || methodName === `findLast`) &&\n      result &&\n      typeof result === `object`\n    ) {\n      const foundIndex = (\n        changeTracker.copy_ as unknown as Array<unknown>\n      ).indexOf(result)\n      if (foundIndex !== -1) {\n        return getProxiedElement(result, foundIndex)\n      }\n    }\n\n    // For filter, proxy each element in the result array\n    if (methodName === `filter` && Array.isArray(result)) {\n      return result.map((element) => {\n        const originalIndex = (\n          changeTracker.copy_ as unknown as Array<unknown>\n        ).indexOf(element)\n        if (originalIndex !== -1) {\n          return getProxiedElement(element, originalIndex)\n        }\n        return element\n      })\n    }\n\n    return result\n  }\n}\n\n/**\n * Creates a Symbol.iterator handler for arrays that yields proxied elements.\n */\nfunction createArrayIteratorHandler<T extends object>(\n  changeTracker: ChangeTracker<T>,\n  memoizedCreateChangeProxy: (\n    obj: Record<string | symbol, unknown>,\n    parent?: {\n      tracker: ChangeTracker<Record<string | symbol, unknown>>\n      prop: string | symbol\n    }\n  ) => { proxy: Record<string | symbol, unknown> }\n): () => Iterator<unknown> {\n  return function () {\n    const array = changeTracker.copy_ as unknown as Array<unknown>\n    let index = 0\n\n    return {\n      next() {\n        if (index >= array.length) {\n          return { done: true, value: undefined }\n        }\n\n        const element = array[index]\n        let proxiedElement = element\n\n        if (isProxiableObject(element)) {\n          const nestedParent = {\n            tracker: changeTracker as unknown as ChangeTracker<\n              Record<string | symbol, unknown>\n            >,\n            prop: String(index),\n          }\n          const { proxy: elementProxy } = memoizedCreateChangeProxy(\n            element,\n            nestedParent\n          )\n          proxiedElement = elementProxy\n        }\n\n        index++\n        return { done: false, value: proxiedElement }\n      },\n      [Symbol.iterator]() {\n        return this\n      },\n    }\n  }\n}\n\n/**\n * Creates a wrapper for methods that modify a collection (array, Map, Set).\n * The wrapper calls the method and marks the change tracker as modified.\n */\nfunction createModifyingMethodHandler<T extends object>(\n  methodFn: (...args: Array<unknown>) => unknown,\n  changeTracker: ChangeTracker<T>,\n  markChanged: (tracker: ChangeTracker<T>) => void\n): (...args: Array<unknown>) => unknown {\n  return function (...args: Array<unknown>) {\n    const result = methodFn.apply(changeTracker.copy_, args)\n    markChanged(changeTracker)\n    return result\n  }\n}\n\n/**\n * Creates handlers for Map/Set iterator methods (entries, keys, values, forEach).\n * Returns proxied values for iteration to enable change tracking.\n */\nfunction createMapSetIteratorHandler<T extends object>(\n  methodName: string,\n  prop: string | symbol,\n  methodFn: (...args: Array<unknown>) => unknown,\n  target: Map<unknown, unknown> | Set<unknown>,\n  changeTracker: ChangeTracker<T>,\n  memoizedCreateChangeProxy: (\n    obj: Record<string | symbol, unknown>,\n    parent?: {\n      tracker: ChangeTracker<Record<string | symbol, unknown>>\n      prop: string | symbol\n    }\n  ) => { proxy: Record<string | symbol, unknown> },\n  markChanged: (tracker: ChangeTracker<T>) => void\n): ((...args: Array<unknown>) => unknown) | undefined {\n  const isIteratorMethod =\n    MAP_SET_ITERATOR_METHODS.has(methodName) || prop === Symbol.iterator\n\n  if (!isIteratorMethod) {\n    return undefined\n  }\n\n  return function (this: unknown, ...args: Array<unknown>) {\n    const result = methodFn.apply(changeTracker.copy_, args)\n\n    // For forEach, wrap the callback to track changes\n    if (methodName === `forEach`) {\n      const callback = args[0]\n      if (typeof callback === `function`) {\n        const wrappedCallback = function (\n          this: unknown,\n          value: unknown,\n          key: unknown,\n          collection: unknown\n        ) {\n          const cbresult = callback.call(this, value, key, collection)\n          markChanged(changeTracker)\n          return cbresult\n        }\n        return methodFn.apply(target, [wrappedCallback, ...args.slice(1)])\n      }\n    }\n\n    // For iterators (entries, keys, values, Symbol.iterator)\n    const isValueIterator =\n      methodName === `entries` ||\n      methodName === `values` ||\n      methodName === Symbol.iterator.toString() ||\n      prop === Symbol.iterator\n\n    if (isValueIterator) {\n      const originalIterator = result as Iterator<unknown>\n\n      // For values() iterator on Maps, create a value-to-key mapping\n      const valueToKeyMap = new Map()\n      if (methodName === `values` && target instanceof Map) {\n        for (const [key, mapValue] of (\n          changeTracker.copy_ as unknown as Map<unknown, unknown>\n        ).entries()) {\n          valueToKeyMap.set(mapValue, key)\n        }\n      }\n\n      // For Set iterators, create an original-to-modified mapping\n      const originalToModifiedMap = new Map()\n      if (target instanceof Set) {\n        for (const setValue of (\n          changeTracker.copy_ as unknown as Set<unknown>\n        ).values()) {\n          originalToModifiedMap.set(setValue, setValue)\n        }\n      }\n\n      // Return a wrapped iterator that proxies values\n      return {\n        next() {\n          const nextResult = originalIterator.next()\n\n          if (\n            !nextResult.done &&\n            nextResult.value &&\n            typeof nextResult.value === `object`\n          ) {\n            // For entries, the value is a [key, value] pair\n            if (\n              methodName === `entries` &&\n              Array.isArray(nextResult.value) &&\n              nextResult.value.length === 2\n            ) {\n              if (\n                nextResult.value[1] &&\n                typeof nextResult.value[1] === `object`\n              ) {\n                const mapKey = nextResult.value[0]\n                const mapParent = {\n                  tracker: changeTracker as unknown as ChangeTracker<\n                    Record<string | symbol, unknown>\n                  >,\n                  prop: mapKey as string | symbol,\n                  updateMap: (newValue: unknown) => {\n                    if (changeTracker.copy_ instanceof Map) {\n                      ;(changeTracker.copy_ as Map<unknown, unknown>).set(\n                        mapKey,\n                        newValue\n                      )\n                    }\n                  },\n                }\n                const { proxy: valueProxy } = memoizedCreateChangeProxy(\n                  nextResult.value[1] as Record<string | symbol, unknown>,\n                  mapParent as unknown as {\n                    tracker: ChangeTracker<Record<string | symbol, unknown>>\n                    prop: string | symbol\n                  }\n                )\n                nextResult.value[1] = valueProxy\n              }\n            } else if (\n              methodName === `values` ||\n              methodName === Symbol.iterator.toString() ||\n              prop === Symbol.iterator\n            ) {\n              // For Map values(), use the key mapping\n              if (methodName === `values` && target instanceof Map) {\n                const mapKey = valueToKeyMap.get(nextResult.value)\n                if (mapKey !== undefined) {\n                  const mapParent = {\n                    tracker: changeTracker as unknown as ChangeTracker<\n                      Record<string | symbol, unknown>\n                    >,\n                    prop: mapKey as string | symbol,\n                    updateMap: (newValue: unknown) => {\n                      if (changeTracker.copy_ instanceof Map) {\n                        ;(changeTracker.copy_ as Map<unknown, unknown>).set(\n                          mapKey,\n                          newValue\n                        )\n                      }\n                    },\n                  }\n                  const { proxy: valueProxy } = memoizedCreateChangeProxy(\n                    nextResult.value as Record<string | symbol, unknown>,\n                    mapParent as unknown as {\n                      tracker: ChangeTracker<Record<string | symbol, unknown>>\n                      prop: string | symbol\n                    }\n                  )\n                  nextResult.value = valueProxy\n                }\n              } else if (target instanceof Set) {\n                // For Set, track modifications\n                const setOriginalValue = nextResult.value\n                const setParent = {\n                  tracker: changeTracker as unknown as ChangeTracker<\n                    Record<string | symbol, unknown>\n                  >,\n                  prop: setOriginalValue as unknown as string | symbol,\n                  updateSet: (newValue: unknown) => {\n                    if (changeTracker.copy_ instanceof Set) {\n                      ;(changeTracker.copy_ as Set<unknown>).delete(\n                        setOriginalValue\n                      )\n                      ;(changeTracker.copy_ as Set<unknown>).add(newValue)\n                      originalToModifiedMap.set(setOriginalValue, newValue)\n                    }\n                  },\n                }\n                const { proxy: valueProxy } = memoizedCreateChangeProxy(\n                  nextResult.value as Record<string | symbol, unknown>,\n                  setParent as unknown as {\n                    tracker: ChangeTracker<Record<string | symbol, unknown>>\n                    prop: string | symbol\n                  }\n                )\n                nextResult.value = valueProxy\n              } else {\n                // For other cases, use a symbol placeholder\n                const tempKey = Symbol(`iterator-value`)\n                const { proxy: valueProxy } = memoizedCreateChangeProxy(\n                  nextResult.value as Record<string | symbol, unknown>,\n                  {\n                    tracker: changeTracker as unknown as ChangeTracker<\n                      Record<string | symbol, unknown>\n                    >,\n                    prop: tempKey,\n                  }\n                )\n                nextResult.value = valueProxy\n              }\n            }\n          }\n\n          return nextResult\n        },\n        [Symbol.iterator]() {\n          return this\n        },\n      }\n    }\n\n    return result\n  }\n}\n\n/**\n * Simple debug utility that only logs when debug mode is enabled\n * Set DEBUG to true in localStorage to enable debug logging\n */\nfunction debugLog(...args: Array<unknown>): void {\n  // Check if we're in a browser environment\n  const isBrowser =\n    typeof window !== `undefined` && typeof localStorage !== `undefined`\n\n  // In browser, check localStorage for debug flag\n  if (isBrowser && localStorage.getItem(`DEBUG`) === `true`) {\n    console.log(`[proxy]`, ...args)\n  }\n  // In Node.js environment, check for environment variable (though this is primarily for browser)\n  else if (\n    // true\n    !isBrowser &&\n    typeof process !== `undefined` &&\n    process.env.DEBUG === `true`\n  ) {\n    console.log(`[proxy]`, ...args)\n  }\n}\n\n// Add TypedArray interface with proper type\ninterface TypedArray {\n  length: number\n  [index: number]: number\n}\n\n// Update type for ChangeTracker\ninterface ChangeTracker<T extends object> {\n  originalObject: T\n  modified: boolean\n  copy_: T\n  proxyCount: number\n  assigned_: Record<string | symbol, boolean>\n  parent?:\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: string | symbol\n      }\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: string | symbol\n        updateMap: (newValue: unknown) => void\n      }\n    | {\n        tracker: ChangeTracker<Record<string | symbol, unknown>>\n        prop: unknown\n        updateSet: (newValue: unknown) => void\n      }\n  target: T\n}\n\n/**\n * Deep clones an object while preserving special types like Date and RegExp\n */\n\nfunction deepClone<T extends unknown>(\n  obj: T,\n  visited = new WeakMap<object, unknown>()\n): T {\n  // Handle null and undefined\n  if (obj === null || obj === undefined) {\n    return obj\n  }\n\n  // Handle primitive types\n  if (typeof obj !== `object`) {\n    return obj\n  }\n\n  // If we've already cloned this object, return the cached clone\n  if (visited.has(obj as object)) {\n    return visited.get(obj as object) as T\n  }\n\n  if (obj instanceof Date) {\n    return new Date(obj.getTime()) as unknown as T\n  }\n\n  if (obj instanceof RegExp) {\n    return new RegExp(obj.source, obj.flags) as unknown as T\n  }\n\n  if (Array.isArray(obj)) {\n    const arrayClone = [] as Array<unknown>\n    visited.set(obj as object, arrayClone)\n    obj.forEach((item, index) => {\n      arrayClone[index] = deepClone(item, visited)\n    })\n    return arrayClone as unknown as T\n  }\n\n  // Handle TypedArrays\n  if (ArrayBuffer.isView(obj) && !(obj instanceof DataView)) {\n    // Get the constructor to create a new instance of the same type\n    const TypedArrayConstructor = Object.getPrototypeOf(obj).constructor\n    const clone = new TypedArrayConstructor(\n      (obj as unknown as TypedArray).length\n    ) as unknown as TypedArray\n    visited.set(obj as object, clone)\n\n    // Copy the values\n    for (let i = 0; i < (obj as unknown as TypedArray).length; i++) {\n      clone[i] = (obj as unknown as TypedArray)[i]!\n    }\n\n    return clone as unknown as T\n  }\n\n  if (obj instanceof Map) {\n    const clone = new Map() as Map<unknown, unknown>\n    visited.set(obj as object, clone)\n    obj.forEach((value, key) => {\n      clone.set(key, deepClone(value, visited))\n    })\n    return clone as unknown as T\n  }\n\n  if (obj instanceof Set) {\n    const clone = new Set()\n    visited.set(obj as object, clone)\n    obj.forEach((value) => {\n      clone.add(deepClone(value, visited))\n    })\n    return clone as unknown as T\n  }\n\n  // Handle Temporal objects\n  if (isTemporal(obj)) {\n    // Temporal objects are immutable, so we can return them directly\n    // This preserves all their internal state correctly\n    return obj\n  }\n\n  const clone = {} as Record<string | symbol, unknown>\n  visited.set(obj as object, clone)\n\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      clone[key] = deepClone(\n        (obj as Record<string | symbol, unknown>)[key],\n        visited\n      )\n    }\n  }\n\n  const symbolProps = Object.getOwnPropertySymbols(obj)\n  for (const sym of symbolProps) {\n    clone[sym] = deepClone(\n      (obj as Record<string | symbol, unknown>)[sym],\n      visited\n    )\n  }\n\n  return clone as T\n}\n\nlet count = 0\nfunction getProxyCount() {\n  count += 1\n  return count\n}\n\n/**\n * Creates a proxy that tracks changes to the target object\n *\n * @param target The object to proxy\n * @param parent Optional parent information\n * @returns An object containing the proxy and a function to get the changes\n */\nexport function createChangeProxy<\n  T extends Record<string | symbol, any | undefined>,\n>(\n  target: T,\n  parent?: {\n    tracker: ChangeTracker<Record<string | symbol, unknown>>\n    prop: string | symbol\n  }\n): {\n  proxy: T\n\n  getChanges: () => Record<string | symbol, any>\n} {\n  const changeProxyCache = new Map<object, object>()\n\n  function memoizedCreateChangeProxy<\n    TInner extends Record<string | symbol, any | undefined>,\n  >(\n    innerTarget: TInner,\n    innerParent?: {\n      tracker: ChangeTracker<Record<string | symbol, unknown>>\n      prop: string | symbol\n    }\n  ): {\n    proxy: TInner\n    getChanges: () => Record<string | symbol, any>\n  } {\n    debugLog(`Object ID:`, innerTarget.constructor.name)\n    if (changeProxyCache.has(innerTarget)) {\n      return changeProxyCache.get(innerTarget) as {\n        proxy: TInner\n        getChanges: () => Record<string | symbol, any>\n      }\n    } else {\n      const changeProxy = createChangeProxy(innerTarget, innerParent)\n      changeProxyCache.set(innerTarget, changeProxy)\n      return changeProxy\n    }\n  }\n  // Create a WeakMap to cache proxies for nested objects\n  // This prevents creating multiple proxies for the same object\n  // and handles circular references\n  const proxyCache = new Map<object, object>()\n\n  // Create a change tracker to track changes to the object\n  const changeTracker: ChangeTracker<T> = {\n    copy_: deepClone(target),\n    originalObject: deepClone(target),\n    proxyCount: getProxyCount(),\n    modified: false,\n    assigned_: {},\n    parent,\n    target, // Store reference to the target object\n  }\n\n  debugLog(\n    `createChangeProxy called for target`,\n    target,\n    changeTracker.proxyCount\n  )\n  // Mark this object and all its ancestors as modified\n  // Also propagate the actual changes up the chain\n  function markChanged(state: ChangeTracker<object>) {\n    if (!state.modified) {\n      state.modified = true\n    }\n\n    // Propagate the change up the parent chain\n    if (state.parent) {\n      debugLog(`propagating change to parent`)\n\n      // Check if this is a special Map parent with updateMap function\n      if (`updateMap` in state.parent) {\n        // Use the special updateMap function for Maps\n        state.parent.updateMap(state.copy_)\n      } else if (`updateSet` in state.parent) {\n        // Use the special updateSet function for Sets\n        state.parent.updateSet(state.copy_)\n      } else {\n        // Update parent's copy with this object's current state\n        state.parent.tracker.copy_[state.parent.prop] = state.copy_\n        state.parent.tracker.assigned_[state.parent.prop] = true\n      }\n\n      // Mark parent as changed\n      markChanged(state.parent.tracker)\n    }\n  }\n\n  // Check if all properties in the current state have reverted to original values\n  function checkIfReverted(\n    state: ChangeTracker<Record<string | symbol, unknown>>\n  ): boolean {\n    debugLog(\n      `checkIfReverted called with assigned keys:`,\n      Object.keys(state.assigned_)\n    )\n\n    // If there are no assigned properties, object is unchanged\n    if (\n      Object.keys(state.assigned_).length === 0 &&\n      Object.getOwnPropertySymbols(state.assigned_).length === 0\n    ) {\n      debugLog(`No assigned properties, returning true`)\n      return true\n    }\n\n    // Check each assigned regular property\n    for (const prop in state.assigned_) {\n      // If this property is marked as assigned\n      if (state.assigned_[prop] === true) {\n        const currentValue = state.copy_[prop]\n        const originalValue = (state.originalObject as any)[prop]\n\n        debugLog(\n          `Checking property ${String(prop)}, current:`,\n          currentValue,\n          `original:`,\n          originalValue\n        )\n\n        // If the value is not equal to original, something is still changed\n        if (!deepEquals(currentValue, originalValue)) {\n          debugLog(`Property ${String(prop)} is different, returning false`)\n          return false\n        }\n      } else if (state.assigned_[prop] === false) {\n        // Property was deleted, so it's different from original\n        debugLog(`Property ${String(prop)} was deleted, returning false`)\n        return false\n      }\n    }\n\n    // Check each assigned symbol property\n    const symbolProps = Object.getOwnPropertySymbols(state.assigned_)\n    for (const sym of symbolProps) {\n      if (state.assigned_[sym] === true) {\n        const currentValue = (state.copy_ as any)[sym]\n        const originalValue = (state.originalObject as any)[sym]\n\n        // If the value is not equal to original, something is still changed\n        if (!deepEquals(currentValue, originalValue)) {\n          debugLog(`Symbol property is different, returning false`)\n          return false\n        }\n      } else if (state.assigned_[sym] === false) {\n        // Property was deleted, so it's different from original\n        debugLog(`Symbol property was deleted, returning false`)\n        return false\n      }\n    }\n\n    debugLog(`All properties match original values, returning true`)\n    // All assigned properties match their original values\n    return true\n  }\n\n  // Update parent status based on child changes\n  function checkParentStatus(\n    parentState: ChangeTracker<Record<string | symbol, unknown>>,\n    childProp: string | symbol | unknown\n  ) {\n    debugLog(`checkParentStatus called for child prop:`, childProp)\n\n    // Check if all properties of the parent are reverted\n    const isReverted = checkIfReverted(parentState)\n    debugLog(`Parent checkIfReverted returned:`, isReverted)\n\n    if (isReverted) {\n      debugLog(`Parent is fully reverted, clearing tracking`)\n      // If everything is reverted, clear the tracking\n      parentState.modified = false\n      parentState.assigned_ = {}\n\n      // Continue up the chain\n      if (parentState.parent) {\n        debugLog(`Continuing up the parent chain`)\n        checkParentStatus(parentState.parent.tracker, parentState.parent.prop)\n      }\n    }\n  }\n\n  // Create a proxy for the target object\n  function createObjectProxy<TObj extends object>(obj: TObj): TObj {\n    debugLog(`createObjectProxy`, obj)\n    // If we've already created a proxy for this object, return it\n    if (proxyCache.has(obj)) {\n      debugLog(`proxyCache found match`)\n      return proxyCache.get(obj) as TObj\n    }\n\n    // Create a proxy for the object\n    const proxy = new Proxy(obj, {\n      get(ptarget, prop) {\n        debugLog(`get`, ptarget, prop)\n        const value =\n          changeTracker.copy_[prop as keyof T] ??\n          changeTracker.originalObject[prop as keyof T]\n\n        const originalValue = changeTracker.originalObject[prop as keyof T]\n\n        debugLog(`value (at top of proxy get)`, value)\n\n        // If it's a getter, return the value directly\n        const desc = Object.getOwnPropertyDescriptor(ptarget, prop)\n        if (desc?.get) {\n          return value\n        }\n\n        // If the value is a function, bind it to the ptarget\n        if (typeof value === `function`) {\n          // For Array methods that modify the array\n          if (Array.isArray(ptarget)) {\n            const methodName = prop.toString()\n\n            if (ARRAY_MODIFYING_METHODS.has(methodName)) {\n              return createModifyingMethodHandler(\n                value,\n                changeTracker,\n                markChanged\n              )\n            }\n\n            // Handle array iteration methods (find, filter, forEach, etc.)\n            const iterationHandler = createArrayIterationHandler(\n              methodName,\n              value,\n              changeTracker,\n              memoizedCreateChangeProxy\n            )\n            if (iterationHandler) {\n              return iterationHandler\n            }\n\n            // Handle array Symbol.iterator for for...of loops\n            if (prop === Symbol.iterator) {\n              return createArrayIteratorHandler(\n                changeTracker,\n                memoizedCreateChangeProxy\n              )\n            }\n          }\n\n          // For Map and Set methods that modify the collection\n          if (ptarget instanceof Map || ptarget instanceof Set) {\n            const methodName = prop.toString()\n\n            if (MAP_SET_MODIFYING_METHODS.has(methodName)) {\n              return createModifyingMethodHandler(\n                value,\n                changeTracker,\n                markChanged\n              )\n            }\n\n            // Handle iterator methods for Map and Set\n            const iteratorHandler = createMapSetIteratorHandler(\n              methodName,\n              prop,\n              value,\n              ptarget,\n              changeTracker,\n              memoizedCreateChangeProxy,\n              markChanged\n            )\n            if (iteratorHandler) {\n              return iteratorHandler\n            }\n          }\n          return value.bind(ptarget)\n        }\n\n        // If the value is an object (but not Date, RegExp, or Temporal), create a proxy for it\n        if (isProxiableObject(value)) {\n          // Create a parent reference for the nested object\n          const nestedParent = {\n            tracker: changeTracker,\n            prop: String(prop),\n          }\n\n          // Create a proxy for the nested object\n          const { proxy: nestedProxy } = memoizedCreateChangeProxy(\n            originalValue,\n            nestedParent\n          )\n\n          // Cache the proxy\n          proxyCache.set(value, nestedProxy)\n\n          return nestedProxy\n        }\n\n        return value\n      },\n\n      set(_sobj, prop, value) {\n        const currentValue = changeTracker.copy_[prop as keyof T]\n        debugLog(\n          `set called for property ${String(prop)}, current:`,\n          currentValue,\n          `new:`,\n          value\n        )\n\n        // Only track the change if the value is actually different\n        if (!deepEquals(currentValue, value)) {\n          // Check if the new value is equal to the original value\n          // Important: Use the originalObject to get the true original value\n          const originalValue = changeTracker.originalObject[prop as keyof T]\n          const isRevertToOriginal = deepEquals(value, originalValue)\n          debugLog(\n            `value:`,\n            value,\n            `original:`,\n            originalValue,\n            `isRevertToOriginal:`,\n            isRevertToOriginal\n          )\n\n          if (isRevertToOriginal) {\n            debugLog(`Reverting property ${String(prop)} to original value`)\n            // If the value is reverted to its original state, remove it from changes\n            delete changeTracker.assigned_[prop.toString()]\n\n            // Make sure the copy is updated with the original value\n            debugLog(`Updating copy with original value for ${String(prop)}`)\n            changeTracker.copy_[prop as keyof T] = deepClone(originalValue)\n\n            // Check if all properties in this object have been reverted\n            debugLog(`Checking if all properties reverted`)\n            const allReverted = checkIfReverted(changeTracker)\n            debugLog(`All reverted:`, allReverted)\n\n            if (allReverted) {\n              debugLog(`All properties reverted, clearing tracking`)\n              // If all have been reverted, clear tracking\n              changeTracker.modified = false\n              changeTracker.assigned_ = {}\n\n              // If we're a nested object, check if the parent needs updating\n              if (parent) {\n                debugLog(`Updating parent for property:`, parent.prop)\n                checkParentStatus(parent.tracker, parent.prop)\n              }\n            } else {\n              // Some properties are still changed\n              debugLog(`Some properties still changed, keeping modified flag`)\n              changeTracker.modified = true\n            }\n          } else {\n            debugLog(`Setting new value for property ${String(prop)}`)\n\n            // Set the value on the copy\n            changeTracker.copy_[prop as keyof T] = value\n\n            // Track that this property was assigned - store using the actual property (symbol or string)\n            changeTracker.assigned_[prop.toString()] = true\n\n            // Mark this object and its ancestors as modified\n            debugLog(`Marking object and ancestors as modified`, changeTracker)\n            markChanged(changeTracker)\n          }\n        } else {\n          debugLog(`Value unchanged, not tracking`)\n        }\n\n        return true\n      },\n\n      defineProperty(_ptarget, prop, descriptor) {\n        // const result = Reflect.defineProperty(\n        //   changeTracker.copy_,\n        //   prop,\n        //   descriptor\n        // )\n        // if (result) {\n        if (`value` in descriptor) {\n          changeTracker.copy_[prop as keyof T] = deepClone(descriptor.value)\n          changeTracker.assigned_[prop.toString()] = true\n          markChanged(changeTracker)\n        }\n        // }\n        // return result\n        return true\n      },\n\n      deleteProperty(dobj, prop) {\n        debugLog(`deleteProperty`, dobj, prop)\n        const stringProp = typeof prop === `symbol` ? prop.toString() : prop\n\n        if (stringProp in dobj) {\n          // Check if the property exists in the original object\n          const hadPropertyInOriginal =\n            stringProp in changeTracker.originalObject\n\n          // Delete the property from the copy\n          // Use type assertion to tell TypeScript this is allowed\n          delete (changeTracker.copy_ as Record<string | symbol, unknown>)[prop]\n\n          // If the property didn't exist in the original object, removing it\n          // should revert to the original state\n          if (!hadPropertyInOriginal) {\n            delete changeTracker.copy_[stringProp]\n            delete changeTracker.assigned_[stringProp]\n\n            // If this is the last change and we're not a nested object,\n            // mark the object as unmodified\n            if (\n              Object.keys(changeTracker.assigned_).length === 0 &&\n              Object.getOwnPropertySymbols(changeTracker.assigned_).length === 0\n            ) {\n              changeTracker.modified = false\n            } else {\n              // We still have changes, keep as modified\n              changeTracker.modified = true\n            }\n          } else {\n            // Mark this property as deleted\n            changeTracker.assigned_[stringProp] = false\n            changeTracker.copy_[stringProp as keyof T] = undefined as T[keyof T]\n            markChanged(changeTracker)\n          }\n        }\n\n        return true\n      },\n    })\n\n    // Cache the proxy\n    proxyCache.set(obj, proxy)\n\n    return proxy\n  }\n\n  // Create a proxy for the target object\n  const proxy = createObjectProxy(target)\n\n  // Return the proxy and a function to get the changes\n  return {\n    proxy,\n    getChanges: () => {\n      debugLog(`getChanges called, modified:`, changeTracker.modified)\n      debugLog(changeTracker)\n\n      // First, check if the object is still considered modified\n      if (!changeTracker.modified) {\n        debugLog(`Object not modified, returning empty object`)\n        return {}\n      }\n\n      // If we have a copy, return it directly\n      // Check if valueObj is actually an object\n      if (\n        typeof changeTracker.copy_ !== `object` ||\n        Array.isArray(changeTracker.copy_)\n      ) {\n        return changeTracker.copy_\n      }\n\n      if (Object.keys(changeTracker.assigned_).length === 0) {\n        return changeTracker.copy_\n      }\n\n      const result: Record<string, any | undefined> = {}\n\n      // Iterate through keys in keyObj\n      for (const key in changeTracker.copy_) {\n        // If the key's value is true and the key exists in valueObj\n        if (\n          changeTracker.assigned_[key] === true &&\n          key in changeTracker.copy_\n        ) {\n          result[key] = changeTracker.copy_[key]\n        }\n      }\n      debugLog(`Returning copy:`, result)\n      return result as unknown as Record<string | symbol, unknown>\n    },\n  }\n}\n\n/**\n * Creates proxies for an array of objects and tracks changes to each\n *\n * @param targets Array of objects to proxy\n * @returns An object containing the array of proxies and a function to get all changes\n */\nexport function createArrayChangeProxy<T extends object>(\n  targets: Array<T>\n): {\n  proxies: Array<T>\n  getChanges: () => Array<Record<string | symbol, unknown>>\n} {\n  const proxiesWithChanges = targets.map((target) => createChangeProxy(target))\n\n  return {\n    proxies: proxiesWithChanges.map((p) => p.proxy),\n    getChanges: () => proxiesWithChanges.map((p) => p.getChanges()),\n  }\n}\n\n/**\n * Creates a proxy for an object, passes it to a callback function,\n * and returns the changes made by the callback\n *\n * @param target The object to proxy\n * @param callback Function that receives the proxy and can make changes to it\n * @returns The changes made to the object\n */\nexport function withChangeTracking<T extends object>(\n  target: T,\n  callback: (proxy: T) => void\n): Record<string | symbol, unknown> {\n  const { proxy, getChanges } = createChangeProxy(target)\n\n  callback(proxy)\n\n  return getChanges()\n}\n\n/**\n * Creates proxies for an array of objects, passes them to a callback function,\n * and returns the changes made by the callback for each object\n *\n * @param targets Array of objects to proxy\n * @param callback Function that receives the proxies and can make changes to them\n * @returns Array of changes made to each object\n */\nexport function withArrayChangeTracking<T extends object>(\n  targets: Array<T>,\n  callback: (proxies: Array<T>) => void\n): Array<Record<string | symbol, unknown>> {\n  const { proxies, getChanges } = createArrayChangeProxy(targets)\n\n  callback(proxies)\n\n  return getChanges()\n}\n"],"names":["clone","proxy"],"mappings":";AAWA,MAAM,iDAAiC,IAAI;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,MAAM,8CAA8B,IAAI;AAAA,EACtC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,MAAM,gDAAgC,IAAI,CAAC,OAAO,UAAU,SAAS,KAAK,CAAC;AAK3E,MAAM,+CAA+B,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAKD,SAAS,kBACP,OAC2C;AAC3C,SACE,UAAU,QACV,OAAO,UAAU,YACjB,EAAG,iBAAyB,SAC5B,EAAG,iBAAyB,WAC5B,CAAC,WAAW,KAAK;AAErB;AAMA,SAAS,4BACP,YACA,UACA,eACA,2BAOoD;AACpD,MAAI,CAAC,2BAA2B,IAAI,UAAU,GAAG;AAC/C,WAAO;AAAA,EACT;AAEA,SAAO,YAAa,MAAsB;AACxC,UAAM,WAAW,KAAK,CAAC;AACvB,QAAI,OAAO,aAAa,YAAY;AAClC,aAAO,SAAS,MAAM,cAAc,OAAO,IAAI;AAAA,IACjD;AAGA,UAAM,oBAAoB,CAAC,SAAkB,UAA2B;AACtE,UAAI,kBAAkB,OAAO,GAAG;AAC9B,cAAM,eAAe;AAAA,UACnB,SAAS;AAAA,UAGT,MAAM,OAAO,KAAK;AAAA,QAAA;AAEpB,cAAM,EAAE,OAAO,aAAA,IAAiB;AAAA,UAC9B;AAAA,UACA;AAAA,QAAA;AAEF,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,SAEtB,SACA,OACA,OACA;AACA,YAAM,iBAAiB,kBAAkB,SAAS,KAAK;AACvD,aAAO,SAAS,KAAK,MAAM,gBAAgB,OAAO,KAAK;AAAA,IACzD;AAGA,QAAI,eAAe,YAAY,eAAe,eAAe;AAC3D,YAAM,iBAAiB,SAErB,aACA,SACA,OACA,OACA;AACA,cAAM,iBAAiB,kBAAkB,SAAS,KAAK;AACvD,eAAO,SAAS,KAAK,MAAM,aAAa,gBAAgB,OAAO,KAAK;AAAA,MACtE;AACA,aAAO,SAAS,MAAM,cAAc,OAAO;AAAA,QACzC;AAAA,QACA,GAAG,KAAK,MAAM,CAAC;AAAA,MAAA,CAChB;AAAA,IACH;AAEA,UAAM,SAAS,SAAS,MAAM,cAAc,OAAO;AAAA,MACjD;AAAA,MACA,GAAG,KAAK,MAAM,CAAC;AAAA,IAAA,CAChB;AAGD,SACG,eAAe,UAAU,eAAe,eACzC,UACA,OAAO,WAAW,UAClB;AACA,YAAM,aACJ,cAAc,MACd,QAAQ,MAAM;AAChB,UAAI,eAAe,IAAI;AACrB,eAAO,kBAAkB,QAAQ,UAAU;AAAA,MAC7C;AAAA,IACF;AAGA,QAAI,eAAe,YAAY,MAAM,QAAQ,MAAM,GAAG;AACpD,aAAO,OAAO,IAAI,CAAC,YAAY;AAC7B,cAAM,gBACJ,cAAc,MACd,QAAQ,OAAO;AACjB,YAAI,kBAAkB,IAAI;AACxB,iBAAO,kBAAkB,SAAS,aAAa;AAAA,QACjD;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AACF;AAKA,SAAS,2BACP,eACA,2BAOyB;AACzB,SAAO,WAAY;AACjB,UAAM,QAAQ,cAAc;AAC5B,QAAI,QAAQ;AAEZ,WAAO;AAAA,MACL,OAAO;AACL,YAAI,SAAS,MAAM,QAAQ;AACzB,iBAAO,EAAE,MAAM,MAAM,OAAO,OAAA;AAAA,QAC9B;AAEA,cAAM,UAAU,MAAM,KAAK;AAC3B,YAAI,iBAAiB;AAErB,YAAI,kBAAkB,OAAO,GAAG;AAC9B,gBAAM,eAAe;AAAA,YACnB,SAAS;AAAA,YAGT,MAAM,OAAO,KAAK;AAAA,UAAA;AAEpB,gBAAM,EAAE,OAAO,aAAA,IAAiB;AAAA,YAC9B;AAAA,YACA;AAAA,UAAA;AAEF,2BAAiB;AAAA,QACnB;AAEA;AACA,eAAO,EAAE,MAAM,OAAO,OAAO,eAAA;AAAA,MAC/B;AAAA,MACA,CAAC,OAAO,QAAQ,IAAI;AAClB,eAAO;AAAA,MACT;AAAA,IAAA;AAAA,EAEJ;AACF;AAMA,SAAS,6BACP,UACA,eACA,aACsC;AACtC,SAAO,YAAa,MAAsB;AACxC,UAAM,SAAS,SAAS,MAAM,cAAc,OAAO,IAAI;AACvD,gBAAY,aAAa;AACzB,WAAO;AAAA,EACT;AACF;AAMA,SAAS,4BACP,YACA,MACA,UACA,QACA,eACA,2BAOA,aACoD;AACpD,QAAM,mBACJ,yBAAyB,IAAI,UAAU,KAAK,SAAS,OAAO;AAE9D,MAAI,CAAC,kBAAkB;AACrB,WAAO;AAAA,EACT;AAEA,SAAO,YAA4B,MAAsB;AACvD,UAAM,SAAS,SAAS,MAAM,cAAc,OAAO,IAAI;AAGvD,QAAI,eAAe,WAAW;AAC5B,YAAM,WAAW,KAAK,CAAC;AACvB,UAAI,OAAO,aAAa,YAAY;AAClC,cAAM,kBAAkB,SAEtB,OACA,KACA,YACA;AACA,gBAAM,WAAW,SAAS,KAAK,MAAM,OAAO,KAAK,UAAU;AAC3D,sBAAY,aAAa;AACzB,iBAAO;AAAA,QACT;AACA,eAAO,SAAS,MAAM,QAAQ,CAAC,iBAAiB,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC;AAAA,MACnE;AAAA,IACF;AAGA,UAAM,kBACJ,eAAe,aACf,eAAe,YACf,eAAe,OAAO,SAAS,SAAA,KAC/B,SAAS,OAAO;AAElB,QAAI,iBAAiB;AACnB,YAAM,mBAAmB;AAGzB,YAAM,oCAAoB,IAAA;AAC1B,UAAI,eAAe,YAAY,kBAAkB,KAAK;AACpD,mBAAW,CAAC,KAAK,QAAQ,KACvB,cAAc,MACd,WAAW;AACX,wBAAc,IAAI,UAAU,GAAG;AAAA,QACjC;AAAA,MACF;AAGA,YAAM,4CAA4B,IAAA;AAClC,UAAI,kBAAkB,KAAK;AACzB,mBAAW,YACT,cAAc,MACd,OAAA,GAAU;AACV,gCAAsB,IAAI,UAAU,QAAQ;AAAA,QAC9C;AAAA,MACF;AAGA,aAAO;AAAA,QACL,OAAO;AACL,gBAAM,aAAa,iBAAiB,KAAA;AAEpC,cACE,CAAC,WAAW,QACZ,WAAW,SACX,OAAO,WAAW,UAAU,UAC5B;AAEA,gBACE,eAAe,aACf,MAAM,QAAQ,WAAW,KAAK,KAC9B,WAAW,MAAM,WAAW,GAC5B;AACA,kBACE,WAAW,MAAM,CAAC,KAClB,OAAO,WAAW,MAAM,CAAC,MAAM,UAC/B;AACA,sBAAM,SAAS,WAAW,MAAM,CAAC;AACjC,sBAAM,YAAY;AAAA,kBAChB,SAAS;AAAA,kBAGT,MAAM;AAAA,kBACN,WAAW,CAAC,aAAsB;AAChC,wBAAI,cAAc,iBAAiB,KAAK;AACpC,oCAAc,MAAgC;AAAA,wBAC9C;AAAA,wBACA;AAAA,sBAAA;AAAA,oBAEJ;AAAA,kBACF;AAAA,gBAAA;AAEF,sBAAM,EAAE,OAAO,WAAA,IAAe;AAAA,kBAC5B,WAAW,MAAM,CAAC;AAAA,kBAClB;AAAA,gBAAA;AAKF,2BAAW,MAAM,CAAC,IAAI;AAAA,cACxB;AAAA,YACF,WACE,eAAe,YACf,eAAe,OAAO,SAAS,SAAA,KAC/B,SAAS,OAAO,UAChB;AAEA,kBAAI,eAAe,YAAY,kBAAkB,KAAK;AACpD,sBAAM,SAAS,cAAc,IAAI,WAAW,KAAK;AACjD,oBAAI,WAAW,QAAW;AACxB,wBAAM,YAAY;AAAA,oBAChB,SAAS;AAAA,oBAGT,MAAM;AAAA,oBACN,WAAW,CAAC,aAAsB;AAChC,0BAAI,cAAc,iBAAiB,KAAK;AACpC,sCAAc,MAAgC;AAAA,0BAC9C;AAAA,0BACA;AAAA,wBAAA;AAAA,sBAEJ;AAAA,oBACF;AAAA,kBAAA;AAEF,wBAAM,EAAE,OAAO,WAAA,IAAe;AAAA,oBAC5B,WAAW;AAAA,oBACX;AAAA,kBAAA;AAKF,6BAAW,QAAQ;AAAA,gBACrB;AAAA,cACF,WAAW,kBAAkB,KAAK;AAEhC,sBAAM,mBAAmB,WAAW;AACpC,sBAAM,YAAY;AAAA,kBAChB,SAAS;AAAA,kBAGT,MAAM;AAAA,kBACN,WAAW,CAAC,aAAsB;AAChC,wBAAI,cAAc,iBAAiB,KAAK;AACpC,oCAAc,MAAuB;AAAA,wBACrC;AAAA,sBAAA;AAEA,oCAAc,MAAuB,IAAI,QAAQ;AACnD,4CAAsB,IAAI,kBAAkB,QAAQ;AAAA,oBACtD;AAAA,kBACF;AAAA,gBAAA;AAEF,sBAAM,EAAE,OAAO,WAAA,IAAe;AAAA,kBAC5B,WAAW;AAAA,kBACX;AAAA,gBAAA;AAKF,2BAAW,QAAQ;AAAA,cACrB,OAAO;AAEL,sBAAM,UAAU,OAAO,gBAAgB;AACvC,sBAAM,EAAE,OAAO,WAAA,IAAe;AAAA,kBAC5B,WAAW;AAAA,kBACX;AAAA,oBACE,SAAS;AAAA,oBAGT,MAAM;AAAA,kBAAA;AAAA,gBACR;AAEF,2BAAW,QAAQ;AAAA,cACrB;AAAA,YACF;AAAA,UACF;AAEA,iBAAO;AAAA,QACT;AAAA,QACA,CAAC,OAAO,QAAQ,IAAI;AAClB,iBAAO;AAAA,QACT;AAAA,MAAA;AAAA,IAEJ;AAEA,WAAO;AAAA,EACT;AACF;AAMA,SAAS,YAAY,MAA4B;AAE/C,QAAM,YACJ,OAAO,WAAW,eAAe,OAAO,iBAAiB;AAG3D,MAAI,aAAa,aAAa,QAAQ,OAAO,MAAM,QAAQ;AACzD,YAAQ,IAAI,WAAW,GAAG,IAAI;AAAA,EAChC;AAAA;AAAA,IAIE,CAAC,aACD,OAAO,YAAY,eACnB,QAAQ,IAAI,UAAU;AAAA,IACtB;AACA,YAAQ,IAAI,WAAW,GAAG,IAAI;AAAA,EAChC;AACF;AAqCA,SAAS,UACP,KACA,UAAU,oBAAI,WACX;AAEH,MAAI,QAAQ,QAAQ,QAAQ,QAAW;AACrC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO;AAAA,EACT;AAGA,MAAI,QAAQ,IAAI,GAAa,GAAG;AAC9B,WAAO,QAAQ,IAAI,GAAa;AAAA,EAClC;AAEA,MAAI,eAAe,MAAM;AACvB,WAAO,IAAI,KAAK,IAAI,SAAS;AAAA,EAC/B;AAEA,MAAI,eAAe,QAAQ;AACzB,WAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,KAAK;AAAA,EACzC;AAEA,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,UAAM,aAAa,CAAA;AACnB,YAAQ,IAAI,KAAe,UAAU;AACrC,QAAI,QAAQ,CAAC,MAAM,UAAU;AAC3B,iBAAW,KAAK,IAAI,UAAU,MAAM,OAAO;AAAA,IAC7C,CAAC;AACD,WAAO;AAAA,EACT;AAGA,MAAI,YAAY,OAAO,GAAG,KAAK,EAAE,eAAe,WAAW;AAEzD,UAAM,wBAAwB,OAAO,eAAe,GAAG,EAAE;AACzD,UAAMA,SAAQ,IAAI;AAAA,MACf,IAA8B;AAAA,IAAA;AAEjC,YAAQ,IAAI,KAAeA,MAAK;AAGhC,aAAS,IAAI,GAAG,IAAK,IAA8B,QAAQ,KAAK;AAC9DA,aAAM,CAAC,IAAK,IAA8B,CAAC;AAAA,IAC7C;AAEA,WAAOA;AAAAA,EACT;AAEA,MAAI,eAAe,KAAK;AACtB,UAAMA,6BAAY,IAAA;AAClB,YAAQ,IAAI,KAAeA,MAAK;AAChC,QAAI,QAAQ,CAAC,OAAO,QAAQ;AAC1BA,aAAM,IAAI,KAAK,UAAU,OAAO,OAAO,CAAC;AAAA,IAC1C,CAAC;AACD,WAAOA;AAAAA,EACT;AAEA,MAAI,eAAe,KAAK;AACtB,UAAMA,6BAAY,IAAA;AAClB,YAAQ,IAAI,KAAeA,MAAK;AAChC,QAAI,QAAQ,CAAC,UAAU;AACrBA,aAAM,IAAI,UAAU,OAAO,OAAO,CAAC;AAAA,IACrC,CAAC;AACD,WAAOA;AAAAA,EACT;AAGA,MAAI,WAAW,GAAG,GAAG;AAGnB,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,CAAA;AACd,UAAQ,IAAI,KAAe,KAAK;AAEhC,aAAW,OAAO,KAAK;AACrB,QAAI,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,GAAG;AAClD,YAAM,GAAG,IAAI;AAAA,QACV,IAAyC,GAAG;AAAA,QAC7C;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAEA,QAAM,cAAc,OAAO,sBAAsB,GAAG;AACpD,aAAW,OAAO,aAAa;AAC7B,UAAM,GAAG,IAAI;AAAA,MACV,IAAyC,GAAG;AAAA,MAC7C;AAAA,IAAA;AAAA,EAEJ;AAEA,SAAO;AACT;AAEA,IAAI,QAAQ;AACZ,SAAS,gBAAgB;AACvB,WAAS;AACT,SAAO;AACT;AASO,SAAS,kBAGd,QACA,QAQA;AACA,QAAM,uCAAuB,IAAA;AAE7B,WAAS,0BAGP,aACA,aAOA;AACA,aAAS,cAAc,YAAY,YAAY,IAAI;AACnD,QAAI,iBAAiB,IAAI,WAAW,GAAG;AACrC,aAAO,iBAAiB,IAAI,WAAW;AAAA,IAIzC,OAAO;AACL,YAAM,cAAc,kBAAkB,aAAa,WAAW;AAC9D,uBAAiB,IAAI,aAAa,WAAW;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAIA,QAAM,iCAAiB,IAAA;AAGvB,QAAM,gBAAkC;AAAA,IACtC,OAAO,UAAU,MAAM;AAAA,IACvB,gBAAgB,UAAU,MAAM;AAAA,IAChC,YAAY,cAAA;AAAA,IACZ,UAAU;AAAA,IACV,WAAW,CAAA;AAAA,IACX;AAAA,IACA;AAAA;AAAA,EAAA;AAGF;AAAA,IACE;AAAA,IACA;AAAA,IACA,cAAc;AAAA,EAAA;AAIhB,WAAS,YAAY,OAA8B;AACjD,QAAI,CAAC,MAAM,UAAU;AACnB,YAAM,WAAW;AAAA,IACnB;AAGA,QAAI,MAAM,QAAQ;AAChB,eAAS,8BAA8B;AAGvC,UAAI,eAAe,MAAM,QAAQ;AAE/B,cAAM,OAAO,UAAU,MAAM,KAAK;AAAA,MACpC,WAAW,eAAe,MAAM,QAAQ;AAEtC,cAAM,OAAO,UAAU,MAAM,KAAK;AAAA,MACpC,OAAO;AAEL,cAAM,OAAO,QAAQ,MAAM,MAAM,OAAO,IAAI,IAAI,MAAM;AACtD,cAAM,OAAO,QAAQ,UAAU,MAAM,OAAO,IAAI,IAAI;AAAA,MACtD;AAGA,kBAAY,MAAM,OAAO,OAAO;AAAA,IAClC;AAAA,EACF;AAGA,WAAS,gBACP,OACS;AACT;AAAA,MACE;AAAA,MACA,OAAO,KAAK,MAAM,SAAS;AAAA,IAAA;AAI7B,QACE,OAAO,KAAK,MAAM,SAAS,EAAE,WAAW,KACxC,OAAO,sBAAsB,MAAM,SAAS,EAAE,WAAW,GACzD;AACA,eAAS,wCAAwC;AACjD,aAAO;AAAA,IACT;AAGA,eAAW,QAAQ,MAAM,WAAW;AAElC,UAAI,MAAM,UAAU,IAAI,MAAM,MAAM;AAClC,cAAM,eAAe,MAAM,MAAM,IAAI;AACrC,cAAM,gBAAiB,MAAM,eAAuB,IAAI;AAExD;AAAA,UACE,qBAAqB,OAAO,IAAI,CAAC;AAAA,UACjC;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAIF,YAAI,CAAC,WAAW,cAAc,aAAa,GAAG;AAC5C,mBAAS,YAAY,OAAO,IAAI,CAAC,gCAAgC;AACjE,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,MAAM,UAAU,IAAI,MAAM,OAAO;AAE1C,iBAAS,YAAY,OAAO,IAAI,CAAC,+BAA+B;AAChE,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,cAAc,OAAO,sBAAsB,MAAM,SAAS;AAChE,eAAW,OAAO,aAAa;AAC7B,UAAI,MAAM,UAAU,GAAG,MAAM,MAAM;AACjC,cAAM,eAAgB,MAAM,MAAc,GAAG;AAC7C,cAAM,gBAAiB,MAAM,eAAuB,GAAG;AAGvD,YAAI,CAAC,WAAW,cAAc,aAAa,GAAG;AAC5C,mBAAS,+CAA+C;AACxD,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,MAAM,UAAU,GAAG,MAAM,OAAO;AAEzC,iBAAS,8CAA8C;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,sDAAsD;AAE/D,WAAO;AAAA,EACT;AAGA,WAAS,kBACP,aACA,WACA;AACA,aAAS,4CAA4C,SAAS;AAG9D,UAAM,aAAa,gBAAgB,WAAW;AAC9C,aAAS,oCAAoC,UAAU;AAEvD,QAAI,YAAY;AACd,eAAS,6CAA6C;AAEtD,kBAAY,WAAW;AACvB,kBAAY,YAAY,CAAA;AAGxB,UAAI,YAAY,QAAQ;AACtB,iBAAS,gCAAgC;AACzC,0BAAkB,YAAY,OAAO,SAAS,YAAY,OAAO,IAAI;AAAA,MACvE;AAAA,IACF;AAAA,EACF;AAGA,WAAS,kBAAuC,KAAiB;AAC/D,aAAS,qBAAqB,GAAG;AAEjC,QAAI,WAAW,IAAI,GAAG,GAAG;AACvB,eAAS,wBAAwB;AACjC,aAAO,WAAW,IAAI,GAAG;AAAA,IAC3B;AAGA,UAAMC,SAAQ,IAAI,MAAM,KAAK;AAAA,MAC3B,IAAI,SAAS,MAAM;AACjB,iBAAS,OAAO,SAAS,IAAI;AAC7B,cAAM,QACJ,cAAc,MAAM,IAAe,KACnC,cAAc,eAAe,IAAe;AAE9C,cAAM,gBAAgB,cAAc,eAAe,IAAe;AAElE,iBAAS,+BAA+B,KAAK;AAG7C,cAAM,OAAO,OAAO,yBAAyB,SAAS,IAAI;AAC1D,YAAI,MAAM,KAAK;AACb,iBAAO;AAAA,QACT;AAGA,YAAI,OAAO,UAAU,YAAY;AAE/B,cAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,kBAAM,aAAa,KAAK,SAAA;AAExB,gBAAI,wBAAwB,IAAI,UAAU,GAAG;AAC3C,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA;AAAA,YAEJ;AAGA,kBAAM,mBAAmB;AAAA,cACvB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YAAA;AAEF,gBAAI,kBAAkB;AACpB,qBAAO;AAAA,YACT;AAGA,gBAAI,SAAS,OAAO,UAAU;AAC5B,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,cAAA;AAAA,YAEJ;AAAA,UACF;AAGA,cAAI,mBAAmB,OAAO,mBAAmB,KAAK;AACpD,kBAAM,aAAa,KAAK,SAAA;AAExB,gBAAI,0BAA0B,IAAI,UAAU,GAAG;AAC7C,qBAAO;AAAA,gBACL;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA;AAAA,YAEJ;AAGA,kBAAM,kBAAkB;AAAA,cACtB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YAAA;AAEF,gBAAI,iBAAiB;AACnB,qBAAO;AAAA,YACT;AAAA,UACF;AACA,iBAAO,MAAM,KAAK,OAAO;AAAA,QAC3B;AAGA,YAAI,kBAAkB,KAAK,GAAG;AAE5B,gBAAM,eAAe;AAAA,YACnB,SAAS;AAAA,YACT,MAAM,OAAO,IAAI;AAAA,UAAA;AAInB,gBAAM,EAAE,OAAO,YAAA,IAAgB;AAAA,YAC7B;AAAA,YACA;AAAA,UAAA;AAIF,qBAAW,IAAI,OAAO,WAAW;AAEjC,iBAAO;AAAA,QACT;AAEA,eAAO;AAAA,MACT;AAAA,MAEA,IAAI,OAAO,MAAM,OAAO;AACtB,cAAM,eAAe,cAAc,MAAM,IAAe;AACxD;AAAA,UACE,2BAA2B,OAAO,IAAI,CAAC;AAAA,UACvC;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAIF,YAAI,CAAC,WAAW,cAAc,KAAK,GAAG;AAGpC,gBAAM,gBAAgB,cAAc,eAAe,IAAe;AAClE,gBAAM,qBAAqB,WAAW,OAAO,aAAa;AAC1D;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UAAA;AAGF,cAAI,oBAAoB;AACtB,qBAAS,sBAAsB,OAAO,IAAI,CAAC,oBAAoB;AAE/D,mBAAO,cAAc,UAAU,KAAK,SAAA,CAAU;AAG9C,qBAAS,yCAAyC,OAAO,IAAI,CAAC,EAAE;AAChE,0BAAc,MAAM,IAAe,IAAI,UAAU,aAAa;AAG9D,qBAAS,qCAAqC;AAC9C,kBAAM,cAAc,gBAAgB,aAAa;AACjD,qBAAS,iBAAiB,WAAW;AAErC,gBAAI,aAAa;AACf,uBAAS,4CAA4C;AAErD,4BAAc,WAAW;AACzB,4BAAc,YAAY,CAAA;AAG1B,kBAAI,QAAQ;AACV,yBAAS,iCAAiC,OAAO,IAAI;AACrD,kCAAkB,OAAO,SAAS,OAAO,IAAI;AAAA,cAC/C;AAAA,YACF,OAAO;AAEL,uBAAS,sDAAsD;AAC/D,4BAAc,WAAW;AAAA,YAC3B;AAAA,UACF,OAAO;AACL,qBAAS,kCAAkC,OAAO,IAAI,CAAC,EAAE;AAGzD,0BAAc,MAAM,IAAe,IAAI;AAGvC,0BAAc,UAAU,KAAK,SAAA,CAAU,IAAI;AAG3C,qBAAS,4CAA4C,aAAa;AAClE,wBAAY,aAAa;AAAA,UAC3B;AAAA,QACF,OAAO;AACL,mBAAS,+BAA+B;AAAA,QAC1C;AAEA,eAAO;AAAA,MACT;AAAA,MAEA,eAAe,UAAU,MAAM,YAAY;AAOzC,YAAI,WAAW,YAAY;AACzB,wBAAc,MAAM,IAAe,IAAI,UAAU,WAAW,KAAK;AACjE,wBAAc,UAAU,KAAK,SAAA,CAAU,IAAI;AAC3C,sBAAY,aAAa;AAAA,QAC3B;AAGA,eAAO;AAAA,MACT;AAAA,MAEA,eAAe,MAAM,MAAM;AACzB,iBAAS,kBAAkB,MAAM,IAAI;AACrC,cAAM,aAAa,OAAO,SAAS,WAAW,KAAK,aAAa;AAEhE,YAAI,cAAc,MAAM;AAEtB,gBAAM,wBACJ,cAAc,cAAc;AAI9B,iBAAQ,cAAc,MAA2C,IAAI;AAIrE,cAAI,CAAC,uBAAuB;AAC1B,mBAAO,cAAc,MAAM,UAAU;AACrC,mBAAO,cAAc,UAAU,UAAU;AAIzC,gBACE,OAAO,KAAK,cAAc,SAAS,EAAE,WAAW,KAChD,OAAO,sBAAsB,cAAc,SAAS,EAAE,WAAW,GACjE;AACA,4BAAc,WAAW;AAAA,YAC3B,OAAO;AAEL,4BAAc,WAAW;AAAA,YAC3B;AAAA,UACF,OAAO;AAEL,0BAAc,UAAU,UAAU,IAAI;AACtC,0BAAc,MAAM,UAAqB,IAAI;AAC7C,wBAAY,aAAa;AAAA,UAC3B;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA,IAAA,CACD;AAGD,eAAW,IAAI,KAAKA,MAAK;AAEzB,WAAOA;AAAAA,EACT;AAGA,QAAM,QAAQ,kBAAkB,MAAM;AAGtC,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM;AAChB,eAAS,gCAAgC,cAAc,QAAQ;AAC/D,eAAS,aAAa;AAGtB,UAAI,CAAC,cAAc,UAAU;AAC3B,iBAAS,6CAA6C;AACtD,eAAO,CAAA;AAAA,MACT;AAIA,UACE,OAAO,cAAc,UAAU,YAC/B,MAAM,QAAQ,cAAc,KAAK,GACjC;AACA,eAAO,cAAc;AAAA,MACvB;AAEA,UAAI,OAAO,KAAK,cAAc,SAAS,EAAE,WAAW,GAAG;AACrD,eAAO,cAAc;AAAA,MACvB;AAEA,YAAM,SAA0C,CAAA;AAGhD,iBAAW,OAAO,cAAc,OAAO;AAErC,YACE,cAAc,UAAU,GAAG,MAAM,QACjC,OAAO,cAAc,OACrB;AACA,iBAAO,GAAG,IAAI,cAAc,MAAM,GAAG;AAAA,QACvC;AAAA,MACF;AACA,eAAS,mBAAmB,MAAM;AAClC,aAAO;AAAA,IACT;AAAA,EAAA;AAEJ;AAQO,SAAS,uBACd,SAIA;AACA,QAAM,qBAAqB,QAAQ,IAAI,CAAC,WAAW,kBAAkB,MAAM,CAAC;AAE5E,SAAO;AAAA,IACL,SAAS,mBAAmB,IAAI,CAAC,MAAM,EAAE,KAAK;AAAA,IAC9C,YAAY,MAAM,mBAAmB,IAAI,CAAC,MAAM,EAAE,YAAY;AAAA,EAAA;AAElE;AAUO,SAAS,mBACd,QACA,UACkC;AAClC,QAAM,EAAE,OAAO,eAAe,kBAAkB,MAAM;AAEtD,WAAS,KAAK;AAEd,SAAO,WAAA;AACT;AAUO,SAAS,wBACd,SACA,UACyC;AACzC,QAAM,EAAE,SAAS,eAAe,uBAAuB,OAAO;AAE9D,WAAS,OAAO;AAEhB,SAAO,WAAA;AACT;"}

package/dist/esm/query/predicate-utils.js

@@ -418,8 +418,23 @@ function isLimitSubset(subset, superset) {
   return subset <= superset;
 }
 function isPredicateSubset(subset, superset) {
+  if (superset.limit !== void 0) {
+    if (!areWhereClausesEqual(subset.where, superset.where)) {
+      return false;
+    }
+    return isOrderBySubset(subset.orderBy, superset.orderBy) && isLimitSubset(subset.limit, superset.limit);
+  }
   return isWhereSubset(subset.where, superset.where) && isOrderBySubset(subset.orderBy, superset.orderBy) && isLimitSubset(subset.limit, superset.limit);
 }
+function areWhereClausesEqual(a, b) {
+  if (a === void 0 && b === void 0) {
+    return true;
+  }
+  if (a === void 0 || b === void 0) {
+    return false;
+  }
+  return areExpressionsEqual(a, b);
+}
 function findCommonConditions(predicate1, predicate2) {
   const conditions1 = extractAllConditions(predicate1);
   const conditions2 = extractAllConditions(predicate2);

package/dist/esm/query/predicate-utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"predicate-utils.js","sources":["../../../src/query/predicate-utils.ts"],"sourcesContent":["import { Func, Value } from \"./ir.js\"\nimport type { BasicExpression, OrderBy, PropRef } from \"./ir.js\"\nimport type { LoadSubsetOptions } from \"../types.js\"\n\n/**\n * Check if one where clause is a logical subset of another.\n * Returns true if the subset predicate is more restrictive than (or equal to) the superset predicate.\n *\n * @example\n * // age > 20 is subset of age > 10 (more restrictive)\n * isWhereSubset(gt(ref('age'), val(20)), gt(ref('age'), val(10))) // true\n *\n * @example\n * // age > 10 AND name = 'X' is subset of age > 10 (more conditions)\n * isWhereSubset(and(gt(ref('age'), val(10)), eq(ref('name'), val('X'))), gt(ref('age'), val(10))) // true\n *\n * @param subset - The potentially more restrictive predicate\n * @param superset - The potentially less restrictive predicate\n * @returns true if subset logically implies superset\n */\nexport function isWhereSubset(\n  subset: BasicExpression<boolean> | undefined,\n  superset: BasicExpression<boolean> | undefined\n): boolean {\n  // undefined/missing where clause means \"no filter\" (all data)\n  // Both undefined means subset relationship holds (all data ⊆ all data)\n  if (subset === undefined && superset === undefined) {\n    return true\n  }\n\n  // If subset is undefined but superset is not, we're requesting ALL data\n  // but have only loaded SOME data - subset relationship does NOT hold\n  if (subset === undefined && superset !== undefined) {\n    return false\n  }\n\n  // If superset is undefined (no filter = all data loaded),\n  // then any constrained subset is contained\n  if (superset === undefined && subset !== undefined) {\n    return true\n  }\n\n  return isWhereSubsetInternal(subset!, superset!)\n}\n\nfunction makeDisjunction(\n  preds: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  if (preds.length === 0) {\n    return new Value(false)\n  }\n  if (preds.length === 1) {\n    return preds[0]!\n  }\n  return new Func(`or`, preds)\n}\n\nfunction convertInToOr(inField: InField) {\n  const equalities = inField.values.map(\n    (value) => new Func(`eq`, [inField.ref, new Value(value)])\n  )\n  return makeDisjunction(equalities)\n}\n\nfunction isWhereSubsetInternal(\n  subset: BasicExpression<boolean>,\n  superset: BasicExpression<boolean>\n): boolean {\n  // If subset is false it is requesting no data,\n  // thus the result set is empty\n  // and the empty set is a subset of any set\n  if (subset.type === `val` && subset.value === false) {\n    return true\n  }\n\n  // If expressions are structurally equal, subset relationship holds\n  if (areExpressionsEqual(subset, superset)) {\n    return true\n  }\n\n  // Handle superset being an AND: subset must imply ALL conjuncts\n  // If superset is (A AND B), then subset ⊆ (A AND B) only if subset ⊆ A AND subset ⊆ B\n  // Example: (age > 20) ⊆ (age > 10 AND status = 'active') is false (doesn't imply status condition)\n  if (superset.type === `func` && superset.name === `and`) {\n    return superset.args.every((arg) =>\n      isWhereSubsetInternal(subset, arg as BasicExpression<boolean>)\n    )\n  }\n\n  // Handle subset being an AND: (A AND B) implies both A and B\n  if (subset.type === `func` && subset.name === `and`) {\n    // For (A AND B) ⊆ C, since (A AND B) implies A, we check if any conjunct implies C\n    return subset.args.some((arg) =>\n      isWhereSubsetInternal(arg as BasicExpression<boolean>, superset)\n    )\n  }\n\n  // Turn x IN [A, B, C] into x = A OR x = B OR x = C\n  // for unified handling of IN and OR\n  if (subset.type === `func` && subset.name === `in`) {\n    const inField = extractInField(subset)\n    if (inField) {\n      return isWhereSubsetInternal(convertInToOr(inField), superset)\n    }\n  }\n\n  if (superset.type === `func` && superset.name === `in`) {\n    const inField = extractInField(superset)\n    if (inField) {\n      return isWhereSubsetInternal(subset, convertInToOr(inField))\n    }\n  }\n\n  // Handle OR in subset: (A OR B) is subset of C only if both A and B are subsets of C\n  if (subset.type === `func` && subset.name === `or`) {\n    return subset.args.every((arg) =>\n      isWhereSubsetInternal(arg as BasicExpression<boolean>, superset)\n    )\n  }\n\n  // Handle OR in superset: subset ⊆ (A OR B) if subset ⊆ A or subset ⊆ B\n  // (A OR B) as superset means data can satisfy A or B\n  // If subset is contained in any disjunct, it's contained in the union\n  if (superset.type === `func` && superset.name === `or`) {\n    return superset.args.some((arg) =>\n      isWhereSubsetInternal(subset, arg as BasicExpression<boolean>)\n    )\n  }\n\n  // Handle comparison operators on the same field\n  if (subset.type === `func` && superset.type === `func`) {\n    const subsetFunc = subset as Func\n    const supersetFunc = superset as Func\n\n    // Check if both are comparisons on the same field\n    const subsetField = extractComparisonField(subsetFunc)\n    const supersetField = extractComparisonField(supersetFunc)\n\n    if (\n      subsetField &&\n      supersetField &&\n      areRefsEqual(subsetField.ref, supersetField.ref)\n    ) {\n      return isComparisonSubset(\n        subsetFunc,\n        subsetField.value,\n        supersetFunc,\n        supersetField.value\n      )\n    }\n\n    /*\n    // Handle eq vs in\n    if (subsetFunc.name === `eq` && supersetFunc.name === `in`) {\n      const subsetFieldEq = extractEqualityField(subsetFunc)\n      const supersetFieldIn = extractInField(supersetFunc)\n      if (\n        subsetFieldEq &&\n        supersetFieldIn &&\n        areRefsEqual(subsetFieldEq.ref, supersetFieldIn.ref)\n      ) {\n        // field = X is subset of field IN [X, Y, Z] if X is in the array\n        // Use cached primitive set and metadata from extraction\n        return arrayIncludesWithSet(\n          supersetFieldIn.values,\n          subsetFieldEq.value,\n          supersetFieldIn.primitiveSet ?? null,\n          supersetFieldIn.areAllPrimitives\n        )\n      }\n    }\n\n    // Handle in vs in\n    if (subsetFunc.name === `in` && supersetFunc.name === `in`) {\n      const subsetFieldIn = extractInField(subsetFunc)\n      const supersetFieldIn = extractInField(supersetFunc)\n      if (\n        subsetFieldIn &&\n        supersetFieldIn &&\n        areRefsEqual(subsetFieldIn.ref, supersetFieldIn.ref)\n      ) {\n        // field IN [A, B] is subset of field IN [A, B, C] if all values in subset are in superset\n        // Use cached primitive set and metadata from extraction\n        return subsetFieldIn.values.every((subVal) =>\n          arrayIncludesWithSet(\n            supersetFieldIn.values,\n            subVal,\n            supersetFieldIn.primitiveSet ?? null,\n            supersetFieldIn.areAllPrimitives\n          )\n        )\n      }\n    }\n    */\n  }\n\n  // Conservative: if we can't determine, return false\n  return false\n}\n\n/**\n * Helper to combine where predicates with common logic for AND/OR operations\n */\nfunction combineWherePredicates(\n  predicates: Array<BasicExpression<boolean>>,\n  operation: `and` | `or`,\n  simplifyFn: (\n    preds: Array<BasicExpression<boolean>>\n  ) => BasicExpression<boolean> | null\n): BasicExpression<boolean> {\n  const emptyValue = operation === `and` ? true : false\n  const identityValue = operation === `and` ? true : false\n\n  if (predicates.length === 0) {\n    return { type: `val`, value: emptyValue } as BasicExpression<boolean>\n  }\n\n  if (predicates.length === 1) {\n    return predicates[0]!\n  }\n\n  // Flatten nested expressions of the same operation\n  const flatPredicates: Array<BasicExpression<boolean>> = []\n  for (const pred of predicates) {\n    if (pred.type === `func` && pred.name === operation) {\n      flatPredicates.push(...pred.args)\n    } else {\n      flatPredicates.push(pred)\n    }\n  }\n\n  // Group predicates by field for simplification\n  const grouped = groupPredicatesByField(flatPredicates)\n\n  // Simplify each group\n  const simplified: Array<BasicExpression<boolean>> = []\n  for (const [field, preds] of grouped.entries()) {\n    if (field === null) {\n      // Complex predicates that we can't group by field\n      simplified.push(...preds)\n    } else {\n      // Try to simplify same-field predicates\n      const result = simplifyFn(preds)\n\n      // For intersection: check for empty set (contradiction)\n      if (\n        operation === `and` &&\n        result &&\n        result.type === `val` &&\n        result.value === false\n      ) {\n        // Intersection is empty (conflicting constraints) - entire AND is false\n        return { type: `val`, value: false } as BasicExpression<boolean>\n      }\n\n      // For union: result may be null if simplification failed\n      if (result) {\n        simplified.push(result)\n      }\n    }\n  }\n\n  if (simplified.length === 0) {\n    return { type: `val`, value: identityValue } as BasicExpression<boolean>\n  }\n\n  if (simplified.length === 1) {\n    return simplified[0]!\n  }\n\n  // Return combined predicate\n  return {\n    type: `func`,\n    name: operation,\n    args: simplified,\n  } as BasicExpression<boolean>\n}\n\n/**\n * Combine multiple where predicates with OR logic (union).\n * Returns a predicate that is satisfied when any input predicate is satisfied.\n * Simplifies when possible (e.g., age > 10 OR age > 20 → age > 10).\n *\n * @example\n * // Take least restrictive\n * unionWherePredicates([gt(ref('age'), val(10)), gt(ref('age'), val(20))]) // age > 10\n *\n * @example\n * // Combine equals into IN\n * unionWherePredicates([eq(ref('age'), val(5)), eq(ref('age'), val(10))]) // age IN [5, 10]\n *\n * @param predicates - Array of where predicates to union\n * @returns Combined predicate representing the union\n */\nexport function unionWherePredicates(\n  predicates: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  return combineWherePredicates(predicates, `or`, unionSameFieldPredicates)\n}\n\n/**\n * Compute the difference between two where predicates: `fromPredicate AND NOT(subtractPredicate)`.\n * Returns the simplified predicate, or null if the difference cannot be simplified\n * (in which case the caller should fetch the full fromPredicate).\n *\n * @example\n * // Range difference\n * minusWherePredicates(\n *   gt(ref('age'), val(10)),      // age > 10\n *   gt(ref('age'), val(20))       // age > 20\n * ) // → age > 10 AND age <= 20\n *\n * @example\n * // Set difference\n * minusWherePredicates(\n *   inOp(ref('status'), ['A', 'B', 'C', 'D']),  // status IN ['A','B','C','D']\n *   inOp(ref('status'), ['B', 'C'])             // status IN ['B','C']\n * ) // → status IN ['A', 'D']\n *\n * @example\n * // Common conditions\n * minusWherePredicates(\n *   and(gt(ref('age'), val(10)), eq(ref('status'), val('active'))),  // age > 10 AND status = 'active'\n *   and(gt(ref('age'), val(20)), eq(ref('status'), val('active')))   // age > 20 AND status = 'active'\n * ) // → age > 10 AND age <= 20 AND status = 'active'\n *\n * @example\n * // Complete overlap - empty result\n * minusWherePredicates(\n *   gt(ref('age'), val(20)),     // age > 20\n *   gt(ref('age'), val(10))      // age > 10\n * ) // → {type: 'val', value: false} (empty set)\n *\n * @param fromPredicate - The predicate to subtract from\n * @param subtractPredicate - The predicate to subtract\n * @returns The simplified difference, or null if cannot be simplified\n */\nexport function minusWherePredicates(\n  fromPredicate: BasicExpression<boolean> | undefined,\n  subtractPredicate: BasicExpression<boolean> | undefined\n): BasicExpression<boolean> | null {\n  // If nothing to subtract, return the original\n  if (subtractPredicate === undefined) {\n    return (\n      fromPredicate ??\n      ({ type: `val`, value: true } as BasicExpression<boolean>)\n    )\n  }\n\n  // If from is undefined then we are asking for all data\n  // so we need to load all data minus what we already loaded\n  // i.e. we need to load NOT(subtractPredicate)\n  if (fromPredicate === undefined) {\n    return {\n      type: `func`,\n      name: `not`,\n      args: [subtractPredicate],\n    } as BasicExpression<boolean>\n  }\n\n  // Check if fromPredicate is entirely contained in subtractPredicate\n  // In that case, fromPredicate AND NOT(subtractPredicate) = empty set\n  if (isWhereSubset(fromPredicate, subtractPredicate)) {\n    return { type: `val`, value: false } as BasicExpression<boolean>\n  }\n\n  // Try to detect and handle common conditions\n  const commonConditions = findCommonConditions(\n    fromPredicate,\n    subtractPredicate\n  )\n  if (commonConditions.length > 0) {\n    // Extract predicates without common conditions\n    const fromWithoutCommon = removeConditions(fromPredicate, commonConditions)\n    const subtractWithoutCommon = removeConditions(\n      subtractPredicate,\n      commonConditions\n    )\n\n    // Recursively compute difference on simplified predicates\n    const simplifiedDifference = minusWherePredicates(\n      fromWithoutCommon,\n      subtractWithoutCommon\n    )\n\n    if (simplifiedDifference !== null) {\n      // Combine the simplified difference with common conditions\n      return combineConditions([...commonConditions, simplifiedDifference])\n    }\n  }\n\n  // Check if they are on the same field - if so, we can try to simplify\n  if (fromPredicate.type === `func` && subtractPredicate.type === `func`) {\n    const result = minusSameFieldPredicates(fromPredicate, subtractPredicate)\n    if (result !== null) {\n      return result\n    }\n  }\n\n  // Can't simplify - return null to indicate caller should fetch full fromPredicate\n  return null\n}\n\n/**\n * Helper function to compute difference for same-field predicates\n */\nfunction minusSameFieldPredicates(\n  fromPred: Func,\n  subtractPred: Func\n): BasicExpression<boolean> | null {\n  // Extract field information\n  const fromField =\n    extractComparisonField(fromPred) ||\n    extractEqualityField(fromPred) ||\n    extractInField(fromPred)\n  const subtractField =\n    extractComparisonField(subtractPred) ||\n    extractEqualityField(subtractPred) ||\n    extractInField(subtractPred)\n\n  // Must be on the same field\n  if (\n    !fromField ||\n    !subtractField ||\n    !areRefsEqual(fromField.ref, subtractField.ref)\n  ) {\n    return null\n  }\n\n  // Handle IN minus IN: status IN [A,B,C,D] - status IN [B,C] = status IN [A,D]\n  if (fromPred.name === `in` && subtractPred.name === `in`) {\n    const fromInField = fromField as InField\n    const subtractInField = subtractField as InField\n\n    // Filter out values that are in the subtract set\n    const remainingValues = fromInField.values.filter(\n      (v) =>\n        !arrayIncludesWithSet(\n          subtractInField.values,\n          v,\n          subtractInField.primitiveSet ?? null,\n          subtractInField.areAllPrimitives\n        )\n    )\n\n    if (remainingValues.length === 0) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    if (remainingValues.length === 1) {\n      return {\n        type: `func`,\n        name: `eq`,\n        args: [fromField.ref, { type: `val`, value: remainingValues[0] }],\n      } as BasicExpression<boolean>\n    }\n\n    return {\n      type: `func`,\n      name: `in`,\n      args: [fromField.ref, { type: `val`, value: remainingValues }],\n    } as BasicExpression<boolean>\n  }\n\n  // Handle IN minus equality: status IN [A,B,C] - status = B = status IN [A,C]\n  if (fromPred.name === `in` && subtractPred.name === `eq`) {\n    const fromInField = fromField as InField\n    const subtractValue = (subtractField as { ref: PropRef; value: any }).value\n\n    const remainingValues = fromInField.values.filter(\n      (v) => !areValuesEqual(v, subtractValue)\n    )\n\n    if (remainingValues.length === 0) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    if (remainingValues.length === 1) {\n      return {\n        type: `func`,\n        name: `eq`,\n        args: [fromField.ref, { type: `val`, value: remainingValues[0] }],\n      } as BasicExpression<boolean>\n    }\n\n    return {\n      type: `func`,\n      name: `in`,\n      args: [fromField.ref, { type: `val`, value: remainingValues }],\n    } as BasicExpression<boolean>\n  }\n\n  // Handle equality minus equality: age = 15 - age = 15 = empty, age = 15 - age = 20 = age = 15\n  if (fromPred.name === `eq` && subtractPred.name === `eq`) {\n    const fromValue = (fromField as { ref: PropRef; value: any }).value\n    const subtractValue = (subtractField as { ref: PropRef; value: any }).value\n\n    if (areValuesEqual(fromValue, subtractValue)) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    // No overlap - return original\n    return fromPred as BasicExpression<boolean>\n  }\n\n  // Handle range minus range: age > 10 - age > 20 = age > 10 AND age <= 20\n  const fromComp = extractComparisonField(fromPred)\n  const subtractComp = extractComparisonField(subtractPred)\n\n  if (\n    fromComp &&\n    subtractComp &&\n    areRefsEqual(fromComp.ref, subtractComp.ref)\n  ) {\n    // Try to compute the difference using range logic\n    const result = minusRangePredicates(\n      fromPred,\n      fromComp.value,\n      subtractPred,\n      subtractComp.value\n    )\n    return result\n  }\n\n  // Can't simplify\n  return null\n}\n\n/**\n * Helper to compute difference between range predicates\n */\nfunction minusRangePredicates(\n  fromFunc: Func,\n  fromValue: any,\n  subtractFunc: Func,\n  subtractValue: any\n): BasicExpression<boolean> | null {\n  const fromOp = fromFunc.name as `gt` | `gte` | `lt` | `lte` | `eq`\n  const subtractOp = subtractFunc.name as `gt` | `gte` | `lt` | `lte` | `eq`\n  const ref = (extractComparisonField(fromFunc) ||\n    extractEqualityField(fromFunc))!.ref\n\n  // age > 10 - age > 20 = (age > 10 AND age <= 20)\n  if (fromOp === `gt` && subtractOp === `gt`) {\n    if (fromValue < subtractValue) {\n      // Result is: fromValue < field <= subtractValue\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    // fromValue >= subtractValue means no overlap\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age >= 10 - age >= 20 = (age >= 10 AND age < 20)\n  if (fromOp === `gte` && subtractOp === `gte`) {\n    if (fromValue < subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age > 10 - age >= 20 = (age > 10 AND age < 20)\n  if (fromOp === `gt` && subtractOp === `gte`) {\n    if (fromValue < subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age >= 10 - age > 20 = (age >= 10 AND age <= 20)\n  if (fromOp === `gte` && subtractOp === `gt`) {\n    if (fromValue <= subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age < 30 - age < 20 = (age >= 20 AND age < 30)\n  if (fromOp === `lt` && subtractOp === `lt`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age <= 30 - age <= 20 = (age > 20 AND age <= 30)\n  if (fromOp === `lte` && subtractOp === `lte`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age < 30 - age <= 20 = (age > 20 AND age < 30)\n  if (fromOp === `lt` && subtractOp === `lte`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age <= 30 - age < 20 = (age >= 20 AND age <= 30)\n  if (fromOp === `lte` && subtractOp === `lt`) {\n    if (fromValue >= subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // Can't simplify other combinations\n  return null\n}\n\n/**\n * Check if one orderBy clause is a subset of another.\n * Returns true if the subset ordering requirements are satisfied by the superset ordering.\n *\n * @example\n * // Subset is prefix of superset\n * isOrderBySubset([{expr: age, asc}], [{expr: age, asc}, {expr: name, desc}]) // true\n *\n * @param subset - The ordering requirements to check\n * @param superset - The ordering that might satisfy the requirements\n * @returns true if subset is satisfied by superset\n */\nexport function isOrderBySubset(\n  subset: OrderBy | undefined,\n  superset: OrderBy | undefined\n): boolean {\n  // No ordering requirement is always satisfied\n  if (!subset || subset.length === 0) {\n    return true\n  }\n\n  // If there's no superset ordering but subset requires ordering, not satisfied\n  if (!superset || superset.length === 0) {\n    return false\n  }\n\n  // Check if subset is a prefix of superset with matching expressions and compare options\n  if (subset.length > superset.length) {\n    return false\n  }\n\n  for (let i = 0; i < subset.length; i++) {\n    const subClause = subset[i]!\n    const superClause = superset[i]!\n\n    // Check if expressions match\n    if (!areExpressionsEqual(subClause.expression, superClause.expression)) {\n      return false\n    }\n\n    // Check if compare options match\n    if (\n      !areCompareOptionsEqual(\n        subClause.compareOptions,\n        superClause.compareOptions\n      )\n    ) {\n      return false\n    }\n  }\n\n  return true\n}\n\n/**\n * Check if one limit is a subset of another.\n * Returns true if the subset limit requirements are satisfied by the superset limit.\n *\n * @example\n * isLimitSubset(10, 20) // true (requesting 10 items when 20 are available)\n * isLimitSubset(20, 10) // false (requesting 20 items when only 10 are available)\n * isLimitSubset(10, undefined) // true (requesting 10 items when unlimited are available)\n *\n * @param subset - The limit requirement to check\n * @param superset - The limit that might satisfy the requirement\n * @returns true if subset is satisfied by superset\n */\nexport function isLimitSubset(\n  subset: number | undefined,\n  superset: number | undefined\n): boolean {\n  // Unlimited superset satisfies any limit requirement\n  if (superset === undefined) {\n    return true\n  }\n\n  // If requesting all data (no limit), we need unlimited data to satisfy it\n  // But we know superset is not unlimited so we return false\n  if (subset === undefined) {\n    return false\n  }\n\n  // Otherwise, subset must be less than or equal to superset\n  return subset <= superset\n}\n\n/**\n * Check if one predicate (where + orderBy + limit) is a subset of another.\n * Returns true if all aspects of the subset predicate are satisfied by the superset.\n *\n * @example\n * isPredicateSubset(\n *   { where: gt(ref('age'), val(20)), limit: 10 },\n *   { where: gt(ref('age'), val(10)), limit: 20 }\n * ) // true\n *\n * @param subset - The predicate requirements to check\n * @param superset - The predicate that might satisfy the requirements\n * @returns true if subset is satisfied by superset\n */\nexport function isPredicateSubset(\n  subset: LoadSubsetOptions,\n  superset: LoadSubsetOptions\n): boolean {\n  return (\n    isWhereSubset(subset.where, superset.where) &&\n    isOrderBySubset(subset.orderBy, superset.orderBy) &&\n    isLimitSubset(subset.limit, superset.limit)\n  )\n}\n\n// ============================================================================\n// Helper functions\n// ============================================================================\n\n/**\n * Find common conditions between two predicates.\n * Returns an array of conditions that appear in both predicates.\n */\nfunction findCommonConditions(\n  predicate1: BasicExpression<boolean>,\n  predicate2: BasicExpression<boolean>\n): Array<BasicExpression<boolean>> {\n  const conditions1 = extractAllConditions(predicate1)\n  const conditions2 = extractAllConditions(predicate2)\n\n  const common: Array<BasicExpression<boolean>> = []\n\n  for (const cond1 of conditions1) {\n    for (const cond2 of conditions2) {\n      if (areExpressionsEqual(cond1, cond2)) {\n        // Avoid duplicates\n        if (!common.some((c) => areExpressionsEqual(c, cond1))) {\n          common.push(cond1)\n        }\n        break\n      }\n    }\n  }\n\n  return common\n}\n\n/**\n * Extract all individual conditions from a predicate, flattening AND operations.\n */\nfunction extractAllConditions(\n  predicate: BasicExpression<boolean>\n): Array<BasicExpression<boolean>> {\n  if (predicate.type === `func` && predicate.name === `and`) {\n    const conditions: Array<BasicExpression<boolean>> = []\n    for (const arg of predicate.args) {\n      conditions.push(...extractAllConditions(arg as BasicExpression<boolean>))\n    }\n    return conditions\n  }\n\n  return [predicate]\n}\n\n/**\n * Remove specified conditions from a predicate.\n * Returns the predicate with the specified conditions removed, or undefined if all conditions are removed.\n */\nfunction removeConditions(\n  predicate: BasicExpression<boolean>,\n  conditionsToRemove: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> | undefined {\n  if (predicate.type === `func` && predicate.name === `and`) {\n    const remainingArgs = predicate.args.filter(\n      (arg) =>\n        !conditionsToRemove.some((cond) =>\n          areExpressionsEqual(arg as BasicExpression<boolean>, cond)\n        )\n    )\n\n    if (remainingArgs.length === 0) {\n      return undefined\n    } else if (remainingArgs.length === 1) {\n      return remainingArgs[0]!\n    } else {\n      return {\n        type: `func`,\n        name: `and`,\n        args: remainingArgs,\n      } as BasicExpression<boolean>\n    }\n  }\n\n  // For non-AND predicates, don't remove anything\n  return predicate\n}\n\n/**\n * Combine multiple conditions into a single predicate using AND logic.\n * Flattens nested AND operations to avoid unnecessary nesting.\n */\nfunction combineConditions(\n  conditions: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  if (conditions.length === 0) {\n    return { type: `val`, value: true } as BasicExpression<boolean>\n  } else if (conditions.length === 1) {\n    return conditions[0]!\n  } else {\n    // Flatten all conditions, including those that are already AND operations\n    const flattenedConditions: Array<BasicExpression<boolean>> = []\n\n    for (const condition of conditions) {\n      if (condition.type === `func` && condition.name === `and`) {\n        // Flatten nested AND operations\n        flattenedConditions.push(...condition.args)\n      } else {\n        flattenedConditions.push(condition)\n      }\n    }\n\n    if (flattenedConditions.length === 1) {\n      return flattenedConditions[0]!\n    } else {\n      return {\n        type: `func`,\n        name: `and`,\n        args: flattenedConditions,\n      } as BasicExpression<boolean>\n    }\n  }\n}\n\n/**\n * Find a predicate with a specific operator and value\n */\nfunction findPredicateWithOperator(\n  predicates: Array<BasicExpression<boolean>>,\n  operator: string,\n  value: any\n): BasicExpression<boolean> | undefined {\n  return predicates.find((p) => {\n    if (p.type === `func`) {\n      const f = p as Func\n      const field = extractComparisonField(f)\n      return f.name === operator && field && areValuesEqual(field.value, value)\n    }\n    return false\n  })\n}\n\nfunction areExpressionsEqual(a: BasicExpression, b: BasicExpression): boolean {\n  if (a.type !== b.type) {\n    return false\n  }\n\n  if (a.type === `val` && b.type === `val`) {\n    return areValuesEqual(a.value, b.value)\n  }\n\n  if (a.type === `ref` && b.type === `ref`) {\n    return areRefsEqual(a, b)\n  }\n\n  if (a.type === `func` && b.type === `func`) {\n    const aFunc = a\n    const bFunc = b\n    if (aFunc.name !== bFunc.name) {\n      return false\n    }\n    if (aFunc.args.length !== bFunc.args.length) {\n      return false\n    }\n    return aFunc.args.every((arg, i) =>\n      areExpressionsEqual(arg, bFunc.args[i]!)\n    )\n  }\n\n  return false\n}\n\nfunction areValuesEqual(a: any, b: any): boolean {\n  // Simple equality check - could be enhanced for deep object comparison\n  if (a === b) {\n    return true\n  }\n\n  // Handle NaN\n  if (typeof a === `number` && typeof b === `number` && isNaN(a) && isNaN(b)) {\n    return true\n  }\n\n  // Handle Date objects\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() === b.getTime()\n  }\n\n  // For arrays and objects, use reference equality\n  // (In practice, we don't need deep equality for these cases -\n  // same object reference means same value for our use case)\n  if (\n    typeof a === `object` &&\n    typeof b === `object` &&\n    a !== null &&\n    b !== null\n  ) {\n    return a === b\n  }\n\n  return false\n}\n\nfunction areRefsEqual(a: PropRef, b: PropRef): boolean {\n  if (a.path.length !== b.path.length) {\n    return false\n  }\n  return a.path.every((segment, i) => segment === b.path[i])\n}\n\n/**\n * Check if a value is a primitive (string, number, boolean, null, undefined)\n * Primitives can use Set for fast lookups\n */\nfunction isPrimitive(value: any): boolean {\n  return (\n    value === null ||\n    value === undefined ||\n    typeof value === `string` ||\n    typeof value === `number` ||\n    typeof value === `boolean`\n  )\n}\n\n/**\n * Check if all values in an array are primitives\n */\nfunction areAllPrimitives(values: Array<any>): boolean {\n  return values.every(isPrimitive)\n}\n\n/**\n * Check if a value is in an array, with optional pre-built Set for optimization.\n * The primitiveSet is cached in InField during extraction and reused for all lookups.\n */\nfunction arrayIncludesWithSet(\n  array: Array<any>,\n  value: any,\n  primitiveSet: Set<any> | null,\n  arrayIsAllPrimitives?: boolean\n): boolean {\n  // Fast path: use pre-built Set for O(1) lookup\n  if (primitiveSet) {\n    // Skip isPrimitive check if we know the value must be primitive for a match\n    // (if array is all primitives, only primitives can match)\n    if (arrayIsAllPrimitives || isPrimitive(value)) {\n      return primitiveSet.has(value)\n    }\n    return false // Non-primitive can't be in primitive-only set\n  }\n\n  // Fallback: use areValuesEqual for Dates and objects\n  return array.some((v) => areValuesEqual(v, value))\n}\n\n/**\n * Get the maximum of two values, handling both numbers and Dates\n */\nfunction maxValue(a: any, b: any): any {\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() > b.getTime() ? a : b\n  }\n  return Math.max(a, b)\n}\n\n/**\n * Get the minimum of two values, handling both numbers and Dates\n */\nfunction minValue(a: any, b: any): any {\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() < b.getTime() ? a : b\n  }\n  return Math.min(a, b)\n}\n\nfunction areCompareOptionsEqual(\n  a: { direction?: `asc` | `desc`; [key: string]: any },\n  b: { direction?: `asc` | `desc`; [key: string]: any }\n): boolean {\n  // For now, just compare direction - could be enhanced for other options\n  return a.direction === b.direction\n}\n\ninterface ComparisonField {\n  ref: PropRef\n  value: any\n}\n\nfunction extractComparisonField(func: Func): ComparisonField | null {\n  // Handle comparison operators: eq, gt, gte, lt, lte\n  if ([`eq`, `gt`, `gte`, `lt`, `lte`].includes(func.name)) {\n    // Assume first arg is ref, second is value\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (firstArg?.type === `ref` && secondArg?.type === `val`) {\n      return {\n        ref: firstArg,\n        value: secondArg.value,\n      }\n    }\n  }\n\n  return null\n}\n\nfunction extractEqualityField(func: Func): ComparisonField | null {\n  if (func.name === `eq`) {\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (firstArg?.type === `ref` && secondArg?.type === `val`) {\n      return {\n        ref: firstArg,\n        value: secondArg.value,\n      }\n    }\n  }\n  return null\n}\n\ninterface InField {\n  ref: PropRef\n  values: Array<any>\n  // Cached optimization data (computed once, reused many times)\n  areAllPrimitives?: boolean\n  primitiveSet?: Set<any> | null\n}\n\nfunction extractInField(func: Func): InField | null {\n  if (func.name === `in`) {\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (\n      firstArg?.type === `ref` &&\n      secondArg?.type === `val` &&\n      Array.isArray(secondArg.value)\n    ) {\n      let values = secondArg.value\n      // Precompute optimization metadata once\n      const allPrimitives = areAllPrimitives(values)\n      let primitiveSet: Set<any> | null = null\n\n      if (allPrimitives && values.length > 10) {\n        // Build Set and dedupe values at the same time\n        primitiveSet = new Set(values)\n        // If we found duplicates, use the deduped array going forward\n        if (primitiveSet.size < values.length) {\n          values = Array.from(primitiveSet)\n        }\n      }\n\n      return {\n        ref: firstArg,\n        values,\n        areAllPrimitives: allPrimitives,\n        primitiveSet,\n      }\n    }\n  }\n  return null\n}\n\nfunction isComparisonSubset(\n  subsetFunc: Func,\n  subsetValue: any,\n  supersetFunc: Func,\n  supersetValue: any\n): boolean {\n  const subOp = subsetFunc.name\n  const superOp = supersetFunc.name\n\n  // Handle same operator\n  if (subOp === superOp) {\n    if (subOp === `eq`) {\n      // field = X is subset of field = X only\n      // Fast path: primitives can use strict equality\n      if (isPrimitive(subsetValue) && isPrimitive(supersetValue)) {\n        return subsetValue === supersetValue\n      }\n      return areValuesEqual(subsetValue, supersetValue)\n    } else if (subOp === `gt`) {\n      // field > 20 is subset of field > 10 if 20 > 10\n      return subsetValue >= supersetValue\n    } else if (subOp === `gte`) {\n      // field >= 20 is subset of field >= 10 if 20 >= 10\n      return subsetValue >= supersetValue\n    } else if (subOp === `lt`) {\n      // field < 10 is subset of field < 20 if 10 <= 20\n      return subsetValue <= supersetValue\n    } else if (subOp === `lte`) {\n      // field <= 10 is subset of field <= 20 if 10 <= 20\n      return subsetValue <= supersetValue\n    }\n  }\n\n  // Handle different operators on same field\n  // eq vs gt/gte: field = 15 is subset of field > 10 if 15 > 10\n  if (subOp === `eq` && superOp === `gt`) {\n    return subsetValue > supersetValue\n  }\n  if (subOp === `eq` && superOp === `gte`) {\n    return subsetValue >= supersetValue\n  }\n  if (subOp === `eq` && superOp === `lt`) {\n    return subsetValue < supersetValue\n  }\n  if (subOp === `eq` && superOp === `lte`) {\n    return subsetValue <= supersetValue\n  }\n\n  // gt/gte vs gte/gt\n  if (subOp === `gt` && superOp === `gte`) {\n    // field > 10 is subset of field >= 10 if 10 >= 10 (always true for same value)\n    return subsetValue >= supersetValue\n  }\n  if (subOp === `gte` && superOp === `gt`) {\n    // field >= 11 is subset of field > 10 if 11 > 10\n    return subsetValue > supersetValue\n  }\n\n  // lt/lte vs lte/lt\n  if (subOp === `lt` && superOp === `lte`) {\n    // field < 10 is subset of field <= 10 if 10 <= 10\n    return subsetValue <= supersetValue\n  }\n  if (subOp === `lte` && superOp === `lt`) {\n    // field <= 9 is subset of field < 10 if 9 < 10\n    return subsetValue < supersetValue\n  }\n\n  return false\n}\n\nfunction groupPredicatesByField(\n  predicates: Array<BasicExpression<boolean>>\n): Map<string | null, Array<BasicExpression<boolean>>> {\n  const groups = new Map<string | null, Array<BasicExpression<boolean>>>()\n\n  for (const pred of predicates) {\n    let fieldKey: string | null = null\n\n    if (pred.type === `func`) {\n      const func = pred as Func\n      const field =\n        extractComparisonField(func) ||\n        extractEqualityField(func) ||\n        extractInField(func)\n      if (field) {\n        fieldKey = field.ref.path.join(`.`)\n      }\n    }\n\n    const group = groups.get(fieldKey) || []\n    group.push(pred)\n    groups.set(fieldKey, group)\n  }\n\n  return groups\n}\n\nfunction unionSameFieldPredicates(\n  predicates: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> | null {\n  if (predicates.length === 1) {\n    return predicates[0]!\n  }\n\n  // Try to extract range constraints\n  let maxGt: number | null = null\n  let maxGte: number | null = null\n  let minLt: number | null = null\n  let minLte: number | null = null\n  const eqValues: Set<any> = new Set()\n  const inValues: Set<any> = new Set()\n  const otherPredicates: Array<BasicExpression<boolean>> = []\n\n  for (const pred of predicates) {\n    if (pred.type === `func`) {\n      const func = pred as Func\n      const field = extractComparisonField(func)\n\n      if (field) {\n        const value = field.value\n        if (func.name === `gt`) {\n          maxGt = maxGt === null ? value : minValue(maxGt, value)\n        } else if (func.name === `gte`) {\n          maxGte = maxGte === null ? value : minValue(maxGte, value)\n        } else if (func.name === `lt`) {\n          minLt = minLt === null ? value : maxValue(minLt, value)\n        } else if (func.name === `lte`) {\n          minLte = minLte === null ? value : maxValue(minLte, value)\n        } else if (func.name === `eq`) {\n          eqValues.add(value)\n        } else {\n          otherPredicates.push(pred)\n        }\n      } else {\n        const inField = extractInField(func)\n        if (inField) {\n          for (const val of inField.values) {\n            inValues.add(val)\n          }\n        } else {\n          otherPredicates.push(pred)\n        }\n      }\n    } else {\n      otherPredicates.push(pred)\n    }\n  }\n\n  // If we have multiple equality values, combine into IN\n  if (eqValues.size > 1 || (eqValues.size > 0 && inValues.size > 0)) {\n    const allValues = [...eqValues, ...inValues]\n    const ref = predicates.find((p) => {\n      if (p.type === `func`) {\n        const field =\n          extractComparisonField(p as Func) || extractInField(p as Func)\n        return field !== null\n      }\n      return false\n    })\n\n    if (ref && ref.type === `func`) {\n      const field =\n        extractComparisonField(ref as Func) || extractInField(ref as Func)\n      if (field) {\n        return {\n          type: `func`,\n          name: `in`,\n          args: [\n            field.ref,\n            { type: `val`, value: allValues } as BasicExpression,\n          ],\n        } as BasicExpression<boolean>\n      }\n    }\n  }\n\n  // Build the least restrictive range\n  const result: Array<BasicExpression<boolean>> = []\n\n  // Choose the least restrictive lower bound\n  if (maxGt !== null && maxGte !== null) {\n    // Take the smaller one (less restrictive)\n    const pred =\n      maxGte <= maxGt\n        ? findPredicateWithOperator(predicates, `gte`, maxGte)\n        : findPredicateWithOperator(predicates, `gt`, maxGt)\n    if (pred) result.push(pred)\n  } else if (maxGt !== null) {\n    const pred = findPredicateWithOperator(predicates, `gt`, maxGt)\n    if (pred) result.push(pred)\n  } else if (maxGte !== null) {\n    const pred = findPredicateWithOperator(predicates, `gte`, maxGte)\n    if (pred) result.push(pred)\n  }\n\n  // Choose the least restrictive upper bound\n  if (minLt !== null && minLte !== null) {\n    const pred =\n      minLte >= minLt\n        ? findPredicateWithOperator(predicates, `lte`, minLte)\n        : findPredicateWithOperator(predicates, `lt`, minLt)\n    if (pred) result.push(pred)\n  } else if (minLt !== null) {\n    const pred = findPredicateWithOperator(predicates, `lt`, minLt)\n    if (pred) result.push(pred)\n  } else if (minLte !== null) {\n    const pred = findPredicateWithOperator(predicates, `lte`, minLte)\n    if (pred) result.push(pred)\n  }\n\n  // Add single eq value\n  if (eqValues.size === 1 && inValues.size === 0) {\n    const pred = findPredicateWithOperator(predicates, `eq`, [...eqValues][0])\n    if (pred) result.push(pred)\n  }\n\n  // Add IN if only IN values\n  if (eqValues.size === 0 && inValues.size > 0) {\n    result.push(\n      predicates.find((p) => {\n        if (p.type === `func`) {\n          return (p as Func).name === `in`\n        }\n        return false\n      })!\n    )\n  }\n\n  // Add other predicates\n  result.push(...otherPredicates)\n\n  if (result.length === 0) {\n    return { type: `val`, value: true } as BasicExpression<boolean>\n  }\n\n  if (result.length === 1) {\n    return result[0]!\n  }\n\n  return {\n    type: `func`,\n    name: `or`,\n    args: result,\n  } as BasicExpression<boolean>\n}\n"],"names":[],"mappings":";AAoBO,SAAS,cACd,QACA,UACS;AAGT,MAAI,WAAW,UAAa,aAAa,QAAW;AAClD,WAAO;AAAA,EACT;AAIA,MAAI,WAAW,UAAa,aAAa,QAAW;AAClD,WAAO;AAAA,EACT;AAIA,MAAI,aAAa,UAAa,WAAW,QAAW;AAClD,WAAO;AAAA,EACT;AAEA,SAAO,sBAAsB,QAAS,QAAS;AACjD;AAEA,SAAS,gBACP,OAC0B;AAC1B,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,IAAI,MAAM,KAAK;AAAA,EACxB;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,IAAI,KAAK,MAAM,KAAK;AAC7B;AAEA,SAAS,cAAc,SAAkB;AACvC,QAAM,aAAa,QAAQ,OAAO;AAAA,IAChC,CAAC,UAAU,IAAI,KAAK,MAAM,CAAC,QAAQ,KAAK,IAAI,MAAM,KAAK,CAAC,CAAC;AAAA,EAAA;AAE3D,SAAO,gBAAgB,UAAU;AACnC;AAEA,SAAS,sBACP,QACA,UACS;AAIT,MAAI,OAAO,SAAS,SAAS,OAAO,UAAU,OAAO;AACnD,WAAO;AAAA,EACT;AAGA,MAAI,oBAAoB,QAAQ,QAAQ,GAAG;AACzC,WAAO;AAAA,EACT;AAKA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,OAAO;AACvD,WAAO,SAAS,KAAK;AAAA,MAAM,CAAC,QAC1B,sBAAsB,QAAQ,GAA+B;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,OAAO;AAEnD,WAAO,OAAO,KAAK;AAAA,MAAK,CAAC,QACvB,sBAAsB,KAAiC,QAAQ;AAAA,IAAA;AAAA,EAEnE;AAIA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,MAAM;AAClD,UAAM,UAAU,eAAe,MAAM;AACrC,QAAI,SAAS;AACX,aAAO,sBAAsB,cAAc,OAAO,GAAG,QAAQ;AAAA,IAC/D;AAAA,EACF;AAEA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,MAAM;AACtD,UAAM,UAAU,eAAe,QAAQ;AACvC,QAAI,SAAS;AACX,aAAO,sBAAsB,QAAQ,cAAc,OAAO,CAAC;AAAA,IAC7D;AAAA,EACF;AAGA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,MAAM;AAClD,WAAO,OAAO,KAAK;AAAA,MAAM,CAAC,QACxB,sBAAsB,KAAiC,QAAQ;AAAA,IAAA;AAAA,EAEnE;AAKA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,MAAM;AACtD,WAAO,SAAS,KAAK;AAAA,MAAK,CAAC,QACzB,sBAAsB,QAAQ,GAA+B;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,OAAO,SAAS,UAAU,SAAS,SAAS,QAAQ;AACtD,UAAM,aAAa;AACnB,UAAM,eAAe;AAGrB,UAAM,cAAc,uBAAuB,UAAU;AACrD,UAAM,gBAAgB,uBAAuB,YAAY;AAEzD,QACE,eACA,iBACA,aAAa,YAAY,KAAK,cAAc,GAAG,GAC/C;AACA,aAAO;AAAA,QACL;AAAA,QACA,YAAY;AAAA,QACZ;AAAA,QACA,cAAc;AAAA,MAAA;AAAA,IAElB;AAAA,EA6CF;AAGA,SAAO;AACT;AAKA,SAAS,uBACP,YACA,WACA,YAG0B;AAC1B,QAAM,aAAa,cAAc,QAAQ,OAAO;AAChD,QAAM,gBAAgB,cAAc,QAAQ,OAAO;AAEnD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,WAAA;AAAA,EAC/B;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,QAAM,iBAAkD,CAAA;AACxD,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,UAAU,KAAK,SAAS,WAAW;AACnD,qBAAe,KAAK,GAAG,KAAK,IAAI;AAAA,IAClC,OAAO;AACL,qBAAe,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,UAAU,uBAAuB,cAAc;AAGrD,QAAM,aAA8C,CAAA;AACpD,aAAW,CAAC,OAAO,KAAK,KAAK,QAAQ,WAAW;AAC9C,QAAI,UAAU,MAAM;AAElB,iBAAW,KAAK,GAAG,KAAK;AAAA,IAC1B,OAAO;AAEL,YAAM,SAAS,WAAW,KAAK;AAc/B,UAAI,QAAQ;AACV,mBAAW,KAAK,MAAM;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,cAAA;AAAA,EAC/B;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EAAA;AAEV;AAkBO,SAAS,qBACd,YAC0B;AAC1B,SAAO,uBAAuB,YAAY,MAAM,wBAAwB;AAC1E;AAuCO,SAAS,qBACd,eACA,mBACiC;AAEjC,MAAI,sBAAsB,QAAW;AACnC,WACE,iBACC,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAE3B;AAKA,MAAI,kBAAkB,QAAW;AAC/B,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,iBAAiB;AAAA,IAAA;AAAA,EAE5B;AAIA,MAAI,cAAc,eAAe,iBAAiB,GAAG;AACnD,WAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,EAC/B;AAGA,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA;AAAA,EAAA;AAEF,MAAI,iBAAiB,SAAS,GAAG;AAE/B,UAAM,oBAAoB,iBAAiB,eAAe,gBAAgB;AAC1E,UAAM,wBAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,IAAA;AAIF,UAAM,uBAAuB;AAAA,MAC3B;AAAA,MACA;AAAA,IAAA;AAGF,QAAI,yBAAyB,MAAM;AAEjC,aAAO,kBAAkB,CAAC,GAAG,kBAAkB,oBAAoB,CAAC;AAAA,IACtE;AAAA,EACF;AAGA,MAAI,cAAc,SAAS,UAAU,kBAAkB,SAAS,QAAQ;AACtE,UAAM,SAAS,yBAAyB,eAAe,iBAAiB;AACxE,QAAI,WAAW,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,yBACP,UACA,cACiC;AAEjC,QAAM,YACJ,uBAAuB,QAAQ,KAC/B,qBAAqB,QAAQ,KAC7B,eAAe,QAAQ;AACzB,QAAM,gBACJ,uBAAuB,YAAY,KACnC,qBAAqB,YAAY,KACjC,eAAe,YAAY;AAG7B,MACE,CAAC,aACD,CAAC,iBACD,CAAC,aAAa,UAAU,KAAK,cAAc,GAAG,GAC9C;AACA,WAAO;AAAA,EACT;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,cAAc;AACpB,UAAM,kBAAkB;AAGxB,UAAM,kBAAkB,YAAY,OAAO;AAAA,MACzC,CAAC,MACC,CAAC;AAAA,QACC,gBAAgB;AAAA,QAChB;AAAA,QACA,gBAAgB,gBAAgB;AAAA,QAChC,gBAAgB;AAAA,MAAA;AAAA,IAClB;AAGJ,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAgB,CAAC,EAAA,CAAG;AAAA,MAAA;AAAA,IAEpE;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAA,CAAiB;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,cAAc;AACpB,UAAM,gBAAiB,cAA+C;AAEtE,UAAM,kBAAkB,YAAY,OAAO;AAAA,MACzC,CAAC,MAAM,CAAC,eAAe,GAAG,aAAa;AAAA,IAAA;AAGzC,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAgB,CAAC,EAAA,CAAG;AAAA,MAAA;AAAA,IAEpE;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAA,CAAiB;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,YAAa,UAA2C;AAC9D,UAAM,gBAAiB,cAA+C;AAEtE,QAAI,eAAe,WAAW,aAAa,GAAG;AAC5C,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAGA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,uBAAuB,QAAQ;AAChD,QAAM,eAAe,uBAAuB,YAAY;AAExD,MACE,YACA,gBACA,aAAa,SAAS,KAAK,aAAa,GAAG,GAC3C;AAEA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,aAAa;AAAA,IAAA;AAEf,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAKA,SAAS,qBACP,UACA,WACA,cACA,eACiC;AACjC,QAAM,SAAS,SAAS;AACxB,QAAM,aAAa,aAAa;AAChC,QAAM,OAAO,uBAAuB,QAAQ,KAC1C,qBAAqB,QAAQ,GAAI;AAGnC,MAAI,WAAW,QAAQ,eAAe,MAAM;AAC1C,QAAI,YAAY,eAAe;AAE7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AAEA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,OAAO;AAC5C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,OAAO;AAC3C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,MAAM;AAC3C,QAAI,aAAa,eAAe;AAC9B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,MAAM;AAC1C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,OAAO;AAC5C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,OAAO;AAC3C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,MAAM;AAC3C,QAAI,aAAa,eAAe;AAC9B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAcO,SAAS,gBACd,QACA,UACS;AAET,MAAI,CAAC,UAAU,OAAO,WAAW,GAAG;AAClC,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,YAAY,SAAS,WAAW,GAAG;AACtC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,SAAS,SAAS,QAAQ;AACnC,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,YAAY,OAAO,CAAC;AAC1B,UAAM,cAAc,SAAS,CAAC;AAG9B,QAAI,CAAC,oBAAoB,UAAU,YAAY,YAAY,UAAU,GAAG;AACtE,aAAO;AAAA,IACT;AAGA,QACE,CAAC;AAAA,MACC,UAAU;AAAA,MACV,YAAY;AAAA,IAAA,GAEd;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAeO,SAAS,cACd,QACA,UACS;AAET,MAAI,aAAa,QAAW;AAC1B,WAAO;AAAA,EACT;AAIA,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AAGA,SAAO,UAAU;AACnB;AAgBO,SAAS,kBACd,QACA,UACS;AACT,SACE,cAAc,OAAO,OAAO,SAAS,KAAK,KAC1C,gBAAgB,OAAO,SAAS,SAAS,OAAO,KAChD,cAAc,OAAO,OAAO,SAAS,KAAK;AAE9C;AAUA,SAAS,qBACP,YACA,YACiC;AACjC,QAAM,cAAc,qBAAqB,UAAU;AACnD,QAAM,cAAc,qBAAqB,UAAU;AAEnD,QAAM,SAA0C,CAAA;AAEhD,aAAW,SAAS,aAAa;AAC/B,eAAW,SAAS,aAAa;AAC/B,UAAI,oBAAoB,OAAO,KAAK,GAAG;AAErC,YAAI,CAAC,OAAO,KAAK,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC,GAAG;AACtD,iBAAO,KAAK,KAAK;AAAA,QACnB;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,qBACP,WACiC;AACjC,MAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AACzD,UAAM,aAA8C,CAAA;AACpD,eAAW,OAAO,UAAU,MAAM;AAChC,iBAAW,KAAK,GAAG,qBAAqB,GAA+B,CAAC;AAAA,IAC1E;AACA,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,SAAS;AACnB;AAMA,SAAS,iBACP,WACA,oBACsC;AACtC,MAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AACzD,UAAM,gBAAgB,UAAU,KAAK;AAAA,MACnC,CAAC,QACC,CAAC,mBAAmB;AAAA,QAAK,CAAC,SACxB,oBAAoB,KAAiC,IAAI;AAAA,MAAA;AAAA,IAC3D;AAGJ,QAAI,cAAc,WAAW,GAAG;AAC9B,aAAO;AAAA,IACT,WAAW,cAAc,WAAW,GAAG;AACrC,aAAO,cAAc,CAAC;AAAA,IACxB,OAAO;AACL,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AAGA,SAAO;AACT;AAMA,SAAS,kBACP,YAC0B;AAC1B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAC/B,WAAW,WAAW,WAAW,GAAG;AAClC,WAAO,WAAW,CAAC;AAAA,EACrB,OAAO;AAEL,UAAM,sBAAuD,CAAA;AAE7D,eAAW,aAAa,YAAY;AAClC,UAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AAEzD,4BAAoB,KAAK,GAAG,UAAU,IAAI;AAAA,MAC5C,OAAO;AACL,4BAAoB,KAAK,SAAS;AAAA,MACpC;AAAA,IACF;AAEA,QAAI,oBAAoB,WAAW,GAAG;AACpC,aAAO,oBAAoB,CAAC;AAAA,IAC9B,OAAO;AACL,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AACF;AAKA,SAAS,0BACP,YACA,UACA,OACsC;AACtC,SAAO,WAAW,KAAK,CAAC,MAAM;AAC5B,QAAI,EAAE,SAAS,QAAQ;AACrB,YAAM,IAAI;AACV,YAAM,QAAQ,uBAAuB,CAAC;AACtC,aAAO,EAAE,SAAS,YAAY,SAAS,eAAe,MAAM,OAAO,KAAK;AAAA,IAC1E;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,oBAAoB,GAAoB,GAA6B;AAC5E,MAAI,EAAE,SAAS,EAAE,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO;AACxC,WAAO,eAAe,EAAE,OAAO,EAAE,KAAK;AAAA,EACxC;AAEA,MAAI,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO;AACxC,WAAO,aAAa,GAAG,CAAC;AAAA,EAC1B;AAEA,MAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;AAC1C,UAAM,QAAQ;AACd,UAAM,QAAQ;AACd,QAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,aAAO;AAAA,IACT;AACA,QAAI,MAAM,KAAK,WAAW,MAAM,KAAK,QAAQ;AAC3C,aAAO;AAAA,IACT;AACA,WAAO,MAAM,KAAK;AAAA,MAAM,CAAC,KAAK,MAC5B,oBAAoB,KAAK,MAAM,KAAK,CAAC,CAAE;AAAA,IAAA;AAAA,EAE3C;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,GAAQ,GAAiB;AAE/C,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AAC1E,WAAO;AAAA,EACT;AAGA,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,cAAc,EAAE,QAAA;AAAA,EAC3B;AAKA,MACE,OAAO,MAAM,YACb,OAAO,MAAM,YACb,MAAM,QACN,MAAM,MACN;AACA,WAAO,MAAM;AAAA,EACf;AAEA,SAAO;AACT;AAEA,SAAS,aAAa,GAAY,GAAqB;AACrD,MAAI,EAAE,KAAK,WAAW,EAAE,KAAK,QAAQ;AACnC,WAAO;AAAA,EACT;AACA,SAAO,EAAE,KAAK,MAAM,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,CAAC,CAAC;AAC3D;AAMA,SAAS,YAAY,OAAqB;AACxC,SACE,UAAU,QACV,UAAU,UACV,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU;AAErB;AAKA,SAAS,iBAAiB,QAA6B;AACrD,SAAO,OAAO,MAAM,WAAW;AACjC;AAMA,SAAS,qBACP,OACA,OACA,cACA,sBACS;AAET,MAAI,cAAc;AAGhB,QAAI,wBAAwB,YAAY,KAAK,GAAG;AAC9C,aAAO,aAAa,IAAI,KAAK;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AAGA,SAAO,MAAM,KAAK,CAAC,MAAM,eAAe,GAAG,KAAK,CAAC;AACnD;AAKA,SAAS,SAAS,GAAQ,GAAa;AACrC,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,QAAA,IAAY,EAAE,QAAA,IAAY,IAAI;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AAKA,SAAS,SAAS,GAAQ,GAAa;AACrC,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,QAAA,IAAY,EAAE,QAAA,IAAY,IAAI;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AAEA,SAAS,uBACP,GACA,GACS;AAET,SAAO,EAAE,cAAc,EAAE;AAC3B;AAOA,SAAS,uBAAuB,MAAoC;AAElE,MAAI,CAAC,MAAM,MAAM,OAAO,MAAM,KAAK,EAAE,SAAS,KAAK,IAAI,GAAG;AAExD,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QAAI,UAAU,SAAS,SAAS,WAAW,SAAS,OAAO;AACzD,aAAO;AAAA,QACL,KAAK;AAAA,QACL,OAAO,UAAU;AAAA,MAAA;AAAA,IAErB;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAoC;AAChE,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QAAI,UAAU,SAAS,SAAS,WAAW,SAAS,OAAO;AACzD,aAAO;AAAA,QACL,KAAK;AAAA,QACL,OAAO,UAAU;AAAA,MAAA;AAAA,IAErB;AAAA,EACF;AACA,SAAO;AACT;AAUA,SAAS,eAAe,MAA4B;AAClD,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QACE,UAAU,SAAS,SACnB,WAAW,SAAS,SACpB,MAAM,QAAQ,UAAU,KAAK,GAC7B;AACA,UAAI,SAAS,UAAU;AAEvB,YAAM,gBAAgB,iBAAiB,MAAM;AAC7C,UAAI,eAAgC;AAEpC,UAAI,iBAAiB,OAAO,SAAS,IAAI;AAEvC,uBAAe,IAAI,IAAI,MAAM;AAE7B,YAAI,aAAa,OAAO,OAAO,QAAQ;AACrC,mBAAS,MAAM,KAAK,YAAY;AAAA,QAClC;AAAA,MACF;AAEA,aAAO;AAAA,QACL,KAAK;AAAA,QACL;AAAA,QACA,kBAAkB;AAAA,QAClB;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,YACA,aACA,cACA,eACS;AACT,QAAM,QAAQ,WAAW;AACzB,QAAM,UAAU,aAAa;AAG7B,MAAI,UAAU,SAAS;AACrB,QAAI,UAAU,MAAM;AAGlB,UAAI,YAAY,WAAW,KAAK,YAAY,aAAa,GAAG;AAC1D,eAAO,gBAAgB;AAAA,MACzB;AACA,aAAO,eAAe,aAAa,aAAa;AAAA,IAClD,WAAW,UAAU,MAAM;AAEzB,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,OAAO;AAE1B,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,MAAM;AAEzB,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,OAAO;AAE1B,aAAO,eAAe;AAAA,IACxB;AAAA,EACF;AAIA,MAAI,UAAU,QAAQ,YAAY,MAAM;AACtC,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,UAAU,QAAQ,YAAY,OAAO;AACvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,QAAQ,YAAY,MAAM;AACtC,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,UAAU,QAAQ,YAAY,OAAO;AACvC,WAAO,eAAe;AAAA,EACxB;AAGA,MAAI,UAAU,QAAQ,YAAY,OAAO;AAEvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,YAAY,MAAM;AAEvC,WAAO,cAAc;AAAA,EACvB;AAGA,MAAI,UAAU,QAAQ,YAAY,OAAO;AAEvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,YAAY,MAAM;AAEvC,WAAO,cAAc;AAAA,EACvB;AAEA,SAAO;AACT;AAEA,SAAS,uBACP,YACqD;AACrD,QAAM,6BAAa,IAAA;AAEnB,aAAW,QAAQ,YAAY;AAC7B,QAAI,WAA0B;AAE9B,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,OAAO;AACb,YAAM,QACJ,uBAAuB,IAAI,KAC3B,qBAAqB,IAAI,KACzB,eAAe,IAAI;AACrB,UAAI,OAAO;AACT,mBAAW,MAAM,IAAI,KAAK,KAAK,GAAG;AAAA,MACpC;AAAA,IACF;AAEA,UAAM,QAAQ,OAAO,IAAI,QAAQ,KAAK,CAAA;AACtC,UAAM,KAAK,IAAI;AACf,WAAO,IAAI,UAAU,KAAK;AAAA,EAC5B;AAEA,SAAO;AACT;AAEA,SAAS,yBACP,YACiC;AACjC,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,MAAI,QAAuB;AAC3B,MAAI,SAAwB;AAC5B,MAAI,QAAuB;AAC3B,MAAI,SAAwB;AAC5B,QAAM,+BAAyB,IAAA;AAC/B,QAAM,+BAAyB,IAAA;AAC/B,QAAM,kBAAmD,CAAA;AAEzD,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,OAAO;AACb,YAAM,QAAQ,uBAAuB,IAAI;AAEzC,UAAI,OAAO;AACT,cAAM,QAAQ,MAAM;AACpB,YAAI,KAAK,SAAS,MAAM;AACtB,kBAAQ,UAAU,OAAO,QAAQ,SAAS,OAAO,KAAK;AAAA,QACxD,WAAW,KAAK,SAAS,OAAO;AAC9B,mBAAS,WAAW,OAAO,QAAQ,SAAS,QAAQ,KAAK;AAAA,QAC3D,WAAW,KAAK,SAAS,MAAM;AAC7B,kBAAQ,UAAU,OAAO,QAAQ,SAAS,OAAO,KAAK;AAAA,QACxD,WAAW,KAAK,SAAS,OAAO;AAC9B,mBAAS,WAAW,OAAO,QAAQ,SAAS,QAAQ,KAAK;AAAA,QAC3D,WAAW,KAAK,SAAS,MAAM;AAC7B,mBAAS,IAAI,KAAK;AAAA,QACpB,OAAO;AACL,0BAAgB,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF,OAAO;AACL,cAAM,UAAU,eAAe,IAAI;AACnC,YAAI,SAAS;AACX,qBAAW,OAAO,QAAQ,QAAQ;AAChC,qBAAS,IAAI,GAAG;AAAA,UAClB;AAAA,QACF,OAAO;AACL,0BAAgB,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF;AAAA,IACF,OAAO;AACL,sBAAgB,KAAK,IAAI;AAAA,IAC3B;AAAA,EACF;AAGA,MAAI,SAAS,OAAO,KAAM,SAAS,OAAO,KAAK,SAAS,OAAO,GAAI;AACjE,UAAM,YAAY,CAAC,GAAG,UAAU,GAAG,QAAQ;AAC3C,UAAM,MAAM,WAAW,KAAK,CAAC,MAAM;AACjC,UAAI,EAAE,SAAS,QAAQ;AACrB,cAAM,QACJ,uBAAuB,CAAS,KAAK,eAAe,CAAS;AAC/D,eAAO,UAAU;AAAA,MACnB;AACA,aAAO;AAAA,IACT,CAAC;AAED,QAAI,OAAO,IAAI,SAAS,QAAQ;AAC9B,YAAM,QACJ,uBAAuB,GAAW,KAAK,eAAe,GAAW;AACnE,UAAI,OAAO;AACT,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,YACJ,MAAM;AAAA,YACN,EAAE,MAAM,OAAO,OAAO,UAAA;AAAA,UAAU;AAAA,QAClC;AAAA,MAEJ;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAA0C,CAAA;AAGhD,MAAI,UAAU,QAAQ,WAAW,MAAM;AAErC,UAAM,OACJ,UAAU,QACN,0BAA0B,YAAY,OAAO,MAAM,IACnD,0BAA0B,YAAY,MAAM,KAAK;AACvD,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,UAAU,MAAM;AACzB,UAAM,OAAO,0BAA0B,YAAY,MAAM,KAAK;AAC9D,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,WAAW,MAAM;AAC1B,UAAM,OAAO,0BAA0B,YAAY,OAAO,MAAM;AAChE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,UAAU,QAAQ,WAAW,MAAM;AACrC,UAAM,OACJ,UAAU,QACN,0BAA0B,YAAY,OAAO,MAAM,IACnD,0BAA0B,YAAY,MAAM,KAAK;AACvD,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,UAAU,MAAM;AACzB,UAAM,OAAO,0BAA0B,YAAY,MAAM,KAAK;AAC9D,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,WAAW,MAAM;AAC1B,UAAM,OAAO,0BAA0B,YAAY,OAAO,MAAM;AAChE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,SAAS,SAAS,KAAK,SAAS,SAAS,GAAG;AAC9C,UAAM,OAAO,0BAA0B,YAAY,MAAM,CAAC,GAAG,QAAQ,EAAE,CAAC,CAAC;AACzE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,SAAS,SAAS,KAAK,SAAS,OAAO,GAAG;AAC5C,WAAO;AAAA,MACL,WAAW,KAAK,CAAC,MAAM;AACrB,YAAI,EAAE,SAAS,QAAQ;AACrB,iBAAQ,EAAW,SAAS;AAAA,QAC9B;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IAAA;AAAA,EAEL;AAGA,SAAO,KAAK,GAAG,eAAe;AAE9B,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAC/B;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,OAAO,CAAC;AAAA,EACjB;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EAAA;AAEV;"}
+{"version":3,"file":"predicate-utils.js","sources":["../../../src/query/predicate-utils.ts"],"sourcesContent":["import { Func, Value } from \"./ir.js\"\nimport type { BasicExpression, OrderBy, PropRef } from \"./ir.js\"\nimport type { LoadSubsetOptions } from \"../types.js\"\n\n/**\n * Check if one where clause is a logical subset of another.\n * Returns true if the subset predicate is more restrictive than (or equal to) the superset predicate.\n *\n * @example\n * // age > 20 is subset of age > 10 (more restrictive)\n * isWhereSubset(gt(ref('age'), val(20)), gt(ref('age'), val(10))) // true\n *\n * @example\n * // age > 10 AND name = 'X' is subset of age > 10 (more conditions)\n * isWhereSubset(and(gt(ref('age'), val(10)), eq(ref('name'), val('X'))), gt(ref('age'), val(10))) // true\n *\n * @param subset - The potentially more restrictive predicate\n * @param superset - The potentially less restrictive predicate\n * @returns true if subset logically implies superset\n */\nexport function isWhereSubset(\n  subset: BasicExpression<boolean> | undefined,\n  superset: BasicExpression<boolean> | undefined\n): boolean {\n  // undefined/missing where clause means \"no filter\" (all data)\n  // Both undefined means subset relationship holds (all data ⊆ all data)\n  if (subset === undefined && superset === undefined) {\n    return true\n  }\n\n  // If subset is undefined but superset is not, we're requesting ALL data\n  // but have only loaded SOME data - subset relationship does NOT hold\n  if (subset === undefined && superset !== undefined) {\n    return false\n  }\n\n  // If superset is undefined (no filter = all data loaded),\n  // then any constrained subset is contained\n  if (superset === undefined && subset !== undefined) {\n    return true\n  }\n\n  return isWhereSubsetInternal(subset!, superset!)\n}\n\nfunction makeDisjunction(\n  preds: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  if (preds.length === 0) {\n    return new Value(false)\n  }\n  if (preds.length === 1) {\n    return preds[0]!\n  }\n  return new Func(`or`, preds)\n}\n\nfunction convertInToOr(inField: InField) {\n  const equalities = inField.values.map(\n    (value) => new Func(`eq`, [inField.ref, new Value(value)])\n  )\n  return makeDisjunction(equalities)\n}\n\nfunction isWhereSubsetInternal(\n  subset: BasicExpression<boolean>,\n  superset: BasicExpression<boolean>\n): boolean {\n  // If subset is false it is requesting no data,\n  // thus the result set is empty\n  // and the empty set is a subset of any set\n  if (subset.type === `val` && subset.value === false) {\n    return true\n  }\n\n  // If expressions are structurally equal, subset relationship holds\n  if (areExpressionsEqual(subset, superset)) {\n    return true\n  }\n\n  // Handle superset being an AND: subset must imply ALL conjuncts\n  // If superset is (A AND B), then subset ⊆ (A AND B) only if subset ⊆ A AND subset ⊆ B\n  // Example: (age > 20) ⊆ (age > 10 AND status = 'active') is false (doesn't imply status condition)\n  if (superset.type === `func` && superset.name === `and`) {\n    return superset.args.every((arg) =>\n      isWhereSubsetInternal(subset, arg as BasicExpression<boolean>)\n    )\n  }\n\n  // Handle subset being an AND: (A AND B) implies both A and B\n  if (subset.type === `func` && subset.name === `and`) {\n    // For (A AND B) ⊆ C, since (A AND B) implies A, we check if any conjunct implies C\n    return subset.args.some((arg) =>\n      isWhereSubsetInternal(arg as BasicExpression<boolean>, superset)\n    )\n  }\n\n  // Turn x IN [A, B, C] into x = A OR x = B OR x = C\n  // for unified handling of IN and OR\n  if (subset.type === `func` && subset.name === `in`) {\n    const inField = extractInField(subset)\n    if (inField) {\n      return isWhereSubsetInternal(convertInToOr(inField), superset)\n    }\n  }\n\n  if (superset.type === `func` && superset.name === `in`) {\n    const inField = extractInField(superset)\n    if (inField) {\n      return isWhereSubsetInternal(subset, convertInToOr(inField))\n    }\n  }\n\n  // Handle OR in subset: (A OR B) is subset of C only if both A and B are subsets of C\n  if (subset.type === `func` && subset.name === `or`) {\n    return subset.args.every((arg) =>\n      isWhereSubsetInternal(arg as BasicExpression<boolean>, superset)\n    )\n  }\n\n  // Handle OR in superset: subset ⊆ (A OR B) if subset ⊆ A or subset ⊆ B\n  // (A OR B) as superset means data can satisfy A or B\n  // If subset is contained in any disjunct, it's contained in the union\n  if (superset.type === `func` && superset.name === `or`) {\n    return superset.args.some((arg) =>\n      isWhereSubsetInternal(subset, arg as BasicExpression<boolean>)\n    )\n  }\n\n  // Handle comparison operators on the same field\n  if (subset.type === `func` && superset.type === `func`) {\n    const subsetFunc = subset as Func\n    const supersetFunc = superset as Func\n\n    // Check if both are comparisons on the same field\n    const subsetField = extractComparisonField(subsetFunc)\n    const supersetField = extractComparisonField(supersetFunc)\n\n    if (\n      subsetField &&\n      supersetField &&\n      areRefsEqual(subsetField.ref, supersetField.ref)\n    ) {\n      return isComparisonSubset(\n        subsetFunc,\n        subsetField.value,\n        supersetFunc,\n        supersetField.value\n      )\n    }\n\n    /*\n    // Handle eq vs in\n    if (subsetFunc.name === `eq` && supersetFunc.name === `in`) {\n      const subsetFieldEq = extractEqualityField(subsetFunc)\n      const supersetFieldIn = extractInField(supersetFunc)\n      if (\n        subsetFieldEq &&\n        supersetFieldIn &&\n        areRefsEqual(subsetFieldEq.ref, supersetFieldIn.ref)\n      ) {\n        // field = X is subset of field IN [X, Y, Z] if X is in the array\n        // Use cached primitive set and metadata from extraction\n        return arrayIncludesWithSet(\n          supersetFieldIn.values,\n          subsetFieldEq.value,\n          supersetFieldIn.primitiveSet ?? null,\n          supersetFieldIn.areAllPrimitives\n        )\n      }\n    }\n\n    // Handle in vs in\n    if (subsetFunc.name === `in` && supersetFunc.name === `in`) {\n      const subsetFieldIn = extractInField(subsetFunc)\n      const supersetFieldIn = extractInField(supersetFunc)\n      if (\n        subsetFieldIn &&\n        supersetFieldIn &&\n        areRefsEqual(subsetFieldIn.ref, supersetFieldIn.ref)\n      ) {\n        // field IN [A, B] is subset of field IN [A, B, C] if all values in subset are in superset\n        // Use cached primitive set and metadata from extraction\n        return subsetFieldIn.values.every((subVal) =>\n          arrayIncludesWithSet(\n            supersetFieldIn.values,\n            subVal,\n            supersetFieldIn.primitiveSet ?? null,\n            supersetFieldIn.areAllPrimitives\n          )\n        )\n      }\n    }\n    */\n  }\n\n  // Conservative: if we can't determine, return false\n  return false\n}\n\n/**\n * Helper to combine where predicates with common logic for AND/OR operations\n */\nfunction combineWherePredicates(\n  predicates: Array<BasicExpression<boolean>>,\n  operation: `and` | `or`,\n  simplifyFn: (\n    preds: Array<BasicExpression<boolean>>\n  ) => BasicExpression<boolean> | null\n): BasicExpression<boolean> {\n  const emptyValue = operation === `and` ? true : false\n  const identityValue = operation === `and` ? true : false\n\n  if (predicates.length === 0) {\n    return { type: `val`, value: emptyValue } as BasicExpression<boolean>\n  }\n\n  if (predicates.length === 1) {\n    return predicates[0]!\n  }\n\n  // Flatten nested expressions of the same operation\n  const flatPredicates: Array<BasicExpression<boolean>> = []\n  for (const pred of predicates) {\n    if (pred.type === `func` && pred.name === operation) {\n      flatPredicates.push(...pred.args)\n    } else {\n      flatPredicates.push(pred)\n    }\n  }\n\n  // Group predicates by field for simplification\n  const grouped = groupPredicatesByField(flatPredicates)\n\n  // Simplify each group\n  const simplified: Array<BasicExpression<boolean>> = []\n  for (const [field, preds] of grouped.entries()) {\n    if (field === null) {\n      // Complex predicates that we can't group by field\n      simplified.push(...preds)\n    } else {\n      // Try to simplify same-field predicates\n      const result = simplifyFn(preds)\n\n      // For intersection: check for empty set (contradiction)\n      if (\n        operation === `and` &&\n        result &&\n        result.type === `val` &&\n        result.value === false\n      ) {\n        // Intersection is empty (conflicting constraints) - entire AND is false\n        return { type: `val`, value: false } as BasicExpression<boolean>\n      }\n\n      // For union: result may be null if simplification failed\n      if (result) {\n        simplified.push(result)\n      }\n    }\n  }\n\n  if (simplified.length === 0) {\n    return { type: `val`, value: identityValue } as BasicExpression<boolean>\n  }\n\n  if (simplified.length === 1) {\n    return simplified[0]!\n  }\n\n  // Return combined predicate\n  return {\n    type: `func`,\n    name: operation,\n    args: simplified,\n  } as BasicExpression<boolean>\n}\n\n/**\n * Combine multiple where predicates with OR logic (union).\n * Returns a predicate that is satisfied when any input predicate is satisfied.\n * Simplifies when possible (e.g., age > 10 OR age > 20 → age > 10).\n *\n * @example\n * // Take least restrictive\n * unionWherePredicates([gt(ref('age'), val(10)), gt(ref('age'), val(20))]) // age > 10\n *\n * @example\n * // Combine equals into IN\n * unionWherePredicates([eq(ref('age'), val(5)), eq(ref('age'), val(10))]) // age IN [5, 10]\n *\n * @param predicates - Array of where predicates to union\n * @returns Combined predicate representing the union\n */\nexport function unionWherePredicates(\n  predicates: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  return combineWherePredicates(predicates, `or`, unionSameFieldPredicates)\n}\n\n/**\n * Compute the difference between two where predicates: `fromPredicate AND NOT(subtractPredicate)`.\n * Returns the simplified predicate, or null if the difference cannot be simplified\n * (in which case the caller should fetch the full fromPredicate).\n *\n * @example\n * // Range difference\n * minusWherePredicates(\n *   gt(ref('age'), val(10)),      // age > 10\n *   gt(ref('age'), val(20))       // age > 20\n * ) // → age > 10 AND age <= 20\n *\n * @example\n * // Set difference\n * minusWherePredicates(\n *   inOp(ref('status'), ['A', 'B', 'C', 'D']),  // status IN ['A','B','C','D']\n *   inOp(ref('status'), ['B', 'C'])             // status IN ['B','C']\n * ) // → status IN ['A', 'D']\n *\n * @example\n * // Common conditions\n * minusWherePredicates(\n *   and(gt(ref('age'), val(10)), eq(ref('status'), val('active'))),  // age > 10 AND status = 'active'\n *   and(gt(ref('age'), val(20)), eq(ref('status'), val('active')))   // age > 20 AND status = 'active'\n * ) // → age > 10 AND age <= 20 AND status = 'active'\n *\n * @example\n * // Complete overlap - empty result\n * minusWherePredicates(\n *   gt(ref('age'), val(20)),     // age > 20\n *   gt(ref('age'), val(10))      // age > 10\n * ) // → {type: 'val', value: false} (empty set)\n *\n * @param fromPredicate - The predicate to subtract from\n * @param subtractPredicate - The predicate to subtract\n * @returns The simplified difference, or null if cannot be simplified\n */\nexport function minusWherePredicates(\n  fromPredicate: BasicExpression<boolean> | undefined,\n  subtractPredicate: BasicExpression<boolean> | undefined\n): BasicExpression<boolean> | null {\n  // If nothing to subtract, return the original\n  if (subtractPredicate === undefined) {\n    return (\n      fromPredicate ??\n      ({ type: `val`, value: true } as BasicExpression<boolean>)\n    )\n  }\n\n  // If from is undefined then we are asking for all data\n  // so we need to load all data minus what we already loaded\n  // i.e. we need to load NOT(subtractPredicate)\n  if (fromPredicate === undefined) {\n    return {\n      type: `func`,\n      name: `not`,\n      args: [subtractPredicate],\n    } as BasicExpression<boolean>\n  }\n\n  // Check if fromPredicate is entirely contained in subtractPredicate\n  // In that case, fromPredicate AND NOT(subtractPredicate) = empty set\n  if (isWhereSubset(fromPredicate, subtractPredicate)) {\n    return { type: `val`, value: false } as BasicExpression<boolean>\n  }\n\n  // Try to detect and handle common conditions\n  const commonConditions = findCommonConditions(\n    fromPredicate,\n    subtractPredicate\n  )\n  if (commonConditions.length > 0) {\n    // Extract predicates without common conditions\n    const fromWithoutCommon = removeConditions(fromPredicate, commonConditions)\n    const subtractWithoutCommon = removeConditions(\n      subtractPredicate,\n      commonConditions\n    )\n\n    // Recursively compute difference on simplified predicates\n    const simplifiedDifference = minusWherePredicates(\n      fromWithoutCommon,\n      subtractWithoutCommon\n    )\n\n    if (simplifiedDifference !== null) {\n      // Combine the simplified difference with common conditions\n      return combineConditions([...commonConditions, simplifiedDifference])\n    }\n  }\n\n  // Check if they are on the same field - if so, we can try to simplify\n  if (fromPredicate.type === `func` && subtractPredicate.type === `func`) {\n    const result = minusSameFieldPredicates(fromPredicate, subtractPredicate)\n    if (result !== null) {\n      return result\n    }\n  }\n\n  // Can't simplify - return null to indicate caller should fetch full fromPredicate\n  return null\n}\n\n/**\n * Helper function to compute difference for same-field predicates\n */\nfunction minusSameFieldPredicates(\n  fromPred: Func,\n  subtractPred: Func\n): BasicExpression<boolean> | null {\n  // Extract field information\n  const fromField =\n    extractComparisonField(fromPred) ||\n    extractEqualityField(fromPred) ||\n    extractInField(fromPred)\n  const subtractField =\n    extractComparisonField(subtractPred) ||\n    extractEqualityField(subtractPred) ||\n    extractInField(subtractPred)\n\n  // Must be on the same field\n  if (\n    !fromField ||\n    !subtractField ||\n    !areRefsEqual(fromField.ref, subtractField.ref)\n  ) {\n    return null\n  }\n\n  // Handle IN minus IN: status IN [A,B,C,D] - status IN [B,C] = status IN [A,D]\n  if (fromPred.name === `in` && subtractPred.name === `in`) {\n    const fromInField = fromField as InField\n    const subtractInField = subtractField as InField\n\n    // Filter out values that are in the subtract set\n    const remainingValues = fromInField.values.filter(\n      (v) =>\n        !arrayIncludesWithSet(\n          subtractInField.values,\n          v,\n          subtractInField.primitiveSet ?? null,\n          subtractInField.areAllPrimitives\n        )\n    )\n\n    if (remainingValues.length === 0) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    if (remainingValues.length === 1) {\n      return {\n        type: `func`,\n        name: `eq`,\n        args: [fromField.ref, { type: `val`, value: remainingValues[0] }],\n      } as BasicExpression<boolean>\n    }\n\n    return {\n      type: `func`,\n      name: `in`,\n      args: [fromField.ref, { type: `val`, value: remainingValues }],\n    } as BasicExpression<boolean>\n  }\n\n  // Handle IN minus equality: status IN [A,B,C] - status = B = status IN [A,C]\n  if (fromPred.name === `in` && subtractPred.name === `eq`) {\n    const fromInField = fromField as InField\n    const subtractValue = (subtractField as { ref: PropRef; value: any }).value\n\n    const remainingValues = fromInField.values.filter(\n      (v) => !areValuesEqual(v, subtractValue)\n    )\n\n    if (remainingValues.length === 0) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    if (remainingValues.length === 1) {\n      return {\n        type: `func`,\n        name: `eq`,\n        args: [fromField.ref, { type: `val`, value: remainingValues[0] }],\n      } as BasicExpression<boolean>\n    }\n\n    return {\n      type: `func`,\n      name: `in`,\n      args: [fromField.ref, { type: `val`, value: remainingValues }],\n    } as BasicExpression<boolean>\n  }\n\n  // Handle equality minus equality: age = 15 - age = 15 = empty, age = 15 - age = 20 = age = 15\n  if (fromPred.name === `eq` && subtractPred.name === `eq`) {\n    const fromValue = (fromField as { ref: PropRef; value: any }).value\n    const subtractValue = (subtractField as { ref: PropRef; value: any }).value\n\n    if (areValuesEqual(fromValue, subtractValue)) {\n      return { type: `val`, value: false } as BasicExpression<boolean>\n    }\n\n    // No overlap - return original\n    return fromPred as BasicExpression<boolean>\n  }\n\n  // Handle range minus range: age > 10 - age > 20 = age > 10 AND age <= 20\n  const fromComp = extractComparisonField(fromPred)\n  const subtractComp = extractComparisonField(subtractPred)\n\n  if (\n    fromComp &&\n    subtractComp &&\n    areRefsEqual(fromComp.ref, subtractComp.ref)\n  ) {\n    // Try to compute the difference using range logic\n    const result = minusRangePredicates(\n      fromPred,\n      fromComp.value,\n      subtractPred,\n      subtractComp.value\n    )\n    return result\n  }\n\n  // Can't simplify\n  return null\n}\n\n/**\n * Helper to compute difference between range predicates\n */\nfunction minusRangePredicates(\n  fromFunc: Func,\n  fromValue: any,\n  subtractFunc: Func,\n  subtractValue: any\n): BasicExpression<boolean> | null {\n  const fromOp = fromFunc.name as `gt` | `gte` | `lt` | `lte` | `eq`\n  const subtractOp = subtractFunc.name as `gt` | `gte` | `lt` | `lte` | `eq`\n  const ref = (extractComparisonField(fromFunc) ||\n    extractEqualityField(fromFunc))!.ref\n\n  // age > 10 - age > 20 = (age > 10 AND age <= 20)\n  if (fromOp === `gt` && subtractOp === `gt`) {\n    if (fromValue < subtractValue) {\n      // Result is: fromValue < field <= subtractValue\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    // fromValue >= subtractValue means no overlap\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age >= 10 - age >= 20 = (age >= 10 AND age < 20)\n  if (fromOp === `gte` && subtractOp === `gte`) {\n    if (fromValue < subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age > 10 - age >= 20 = (age > 10 AND age < 20)\n  if (fromOp === `gt` && subtractOp === `gte`) {\n    if (fromValue < subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age >= 10 - age > 20 = (age >= 10 AND age <= 20)\n  if (fromOp === `gte` && subtractOp === `gt`) {\n    if (fromValue <= subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          fromFunc as BasicExpression<boolean>,\n          {\n            type: `func`,\n            name: `lte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age < 30 - age < 20 = (age >= 20 AND age < 30)\n  if (fromOp === `lt` && subtractOp === `lt`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age <= 30 - age <= 20 = (age > 20 AND age <= 30)\n  if (fromOp === `lte` && subtractOp === `lte`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age < 30 - age <= 20 = (age > 20 AND age < 30)\n  if (fromOp === `lt` && subtractOp === `lte`) {\n    if (fromValue > subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gt`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // age <= 30 - age < 20 = (age >= 20 AND age <= 30)\n  if (fromOp === `lte` && subtractOp === `lt`) {\n    if (fromValue >= subtractValue) {\n      return {\n        type: `func`,\n        name: `and`,\n        args: [\n          {\n            type: `func`,\n            name: `gte`,\n            args: [ref, { type: `val`, value: subtractValue }],\n          } as BasicExpression<boolean>,\n          fromFunc as BasicExpression<boolean>,\n        ],\n      } as BasicExpression<boolean>\n    }\n    return fromFunc as BasicExpression<boolean>\n  }\n\n  // Can't simplify other combinations\n  return null\n}\n\n/**\n * Check if one orderBy clause is a subset of another.\n * Returns true if the subset ordering requirements are satisfied by the superset ordering.\n *\n * @example\n * // Subset is prefix of superset\n * isOrderBySubset([{expr: age, asc}], [{expr: age, asc}, {expr: name, desc}]) // true\n *\n * @param subset - The ordering requirements to check\n * @param superset - The ordering that might satisfy the requirements\n * @returns true if subset is satisfied by superset\n */\nexport function isOrderBySubset(\n  subset: OrderBy | undefined,\n  superset: OrderBy | undefined\n): boolean {\n  // No ordering requirement is always satisfied\n  if (!subset || subset.length === 0) {\n    return true\n  }\n\n  // If there's no superset ordering but subset requires ordering, not satisfied\n  if (!superset || superset.length === 0) {\n    return false\n  }\n\n  // Check if subset is a prefix of superset with matching expressions and compare options\n  if (subset.length > superset.length) {\n    return false\n  }\n\n  for (let i = 0; i < subset.length; i++) {\n    const subClause = subset[i]!\n    const superClause = superset[i]!\n\n    // Check if expressions match\n    if (!areExpressionsEqual(subClause.expression, superClause.expression)) {\n      return false\n    }\n\n    // Check if compare options match\n    if (\n      !areCompareOptionsEqual(\n        subClause.compareOptions,\n        superClause.compareOptions\n      )\n    ) {\n      return false\n    }\n  }\n\n  return true\n}\n\n/**\n * Check if one limit is a subset of another.\n * Returns true if the subset limit requirements are satisfied by the superset limit.\n *\n * @example\n * isLimitSubset(10, 20) // true (requesting 10 items when 20 are available)\n * isLimitSubset(20, 10) // false (requesting 20 items when only 10 are available)\n * isLimitSubset(10, undefined) // true (requesting 10 items when unlimited are available)\n *\n * @param subset - The limit requirement to check\n * @param superset - The limit that might satisfy the requirement\n * @returns true if subset is satisfied by superset\n */\nexport function isLimitSubset(\n  subset: number | undefined,\n  superset: number | undefined\n): boolean {\n  // Unlimited superset satisfies any limit requirement\n  if (superset === undefined) {\n    return true\n  }\n\n  // If requesting all data (no limit), we need unlimited data to satisfy it\n  // But we know superset is not unlimited so we return false\n  if (subset === undefined) {\n    return false\n  }\n\n  // Otherwise, subset must be less than or equal to superset\n  return subset <= superset\n}\n\n/**\n * Check if one predicate (where + orderBy + limit) is a subset of another.\n * Returns true if all aspects of the subset predicate are satisfied by the superset.\n *\n * @example\n * isPredicateSubset(\n *   { where: gt(ref('age'), val(20)), limit: 10 },\n *   { where: gt(ref('age'), val(10)), limit: 20 }\n * ) // true\n *\n * @param subset - The predicate requirements to check\n * @param superset - The predicate that might satisfy the requirements\n * @returns true if subset is satisfied by superset\n */\nexport function isPredicateSubset(\n  subset: LoadSubsetOptions,\n  superset: LoadSubsetOptions\n): boolean {\n  // When the superset has a limit, we can only determine subset relationship\n  // if the where clauses are equal (not just subset relationship).\n  //\n  // This is because a limited query only loads a portion of the matching rows.\n  // A more restrictive where clause might require rows outside that portion.\n  //\n  // Example: superset = {where: undefined, limit: 10, orderBy: desc}\n  //          subset = {where: LIKE 'search%', limit: 10, orderBy: desc}\n  // The top 10 items matching 'search%' might include items outside the overall top 10.\n  //\n  // However, if the where clauses are equal, then the subset relationship can\n  // be determined by orderBy and limit alone:\n  // Example: superset = {where: status='active', limit: 10, orderBy: desc}\n  //          subset = {where: status='active', limit: 5, orderBy: desc}\n  // The top 5 active items ARE contained in the top 10 active items.\n  if (superset.limit !== undefined) {\n    // For limited supersets, where clauses must be equal\n    if (!areWhereClausesEqual(subset.where, superset.where)) {\n      return false\n    }\n    return (\n      isOrderBySubset(subset.orderBy, superset.orderBy) &&\n      isLimitSubset(subset.limit, superset.limit)\n    )\n  }\n\n  // For unlimited supersets, use the normal subset logic\n  return (\n    isWhereSubset(subset.where, superset.where) &&\n    isOrderBySubset(subset.orderBy, superset.orderBy) &&\n    isLimitSubset(subset.limit, superset.limit)\n  )\n}\n\n/**\n * Check if two where clauses are structurally equal.\n * Used for limited query subset checks where subset relationship isn't sufficient.\n */\nfunction areWhereClausesEqual(\n  a: BasicExpression<boolean> | undefined,\n  b: BasicExpression<boolean> | undefined\n): boolean {\n  if (a === undefined && b === undefined) {\n    return true\n  }\n  if (a === undefined || b === undefined) {\n    return false\n  }\n  return areExpressionsEqual(a, b)\n}\n\n// ============================================================================\n// Helper functions\n// ============================================================================\n\n/**\n * Find common conditions between two predicates.\n * Returns an array of conditions that appear in both predicates.\n */\nfunction findCommonConditions(\n  predicate1: BasicExpression<boolean>,\n  predicate2: BasicExpression<boolean>\n): Array<BasicExpression<boolean>> {\n  const conditions1 = extractAllConditions(predicate1)\n  const conditions2 = extractAllConditions(predicate2)\n\n  const common: Array<BasicExpression<boolean>> = []\n\n  for (const cond1 of conditions1) {\n    for (const cond2 of conditions2) {\n      if (areExpressionsEqual(cond1, cond2)) {\n        // Avoid duplicates\n        if (!common.some((c) => areExpressionsEqual(c, cond1))) {\n          common.push(cond1)\n        }\n        break\n      }\n    }\n  }\n\n  return common\n}\n\n/**\n * Extract all individual conditions from a predicate, flattening AND operations.\n */\nfunction extractAllConditions(\n  predicate: BasicExpression<boolean>\n): Array<BasicExpression<boolean>> {\n  if (predicate.type === `func` && predicate.name === `and`) {\n    const conditions: Array<BasicExpression<boolean>> = []\n    for (const arg of predicate.args) {\n      conditions.push(...extractAllConditions(arg as BasicExpression<boolean>))\n    }\n    return conditions\n  }\n\n  return [predicate]\n}\n\n/**\n * Remove specified conditions from a predicate.\n * Returns the predicate with the specified conditions removed, or undefined if all conditions are removed.\n */\nfunction removeConditions(\n  predicate: BasicExpression<boolean>,\n  conditionsToRemove: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> | undefined {\n  if (predicate.type === `func` && predicate.name === `and`) {\n    const remainingArgs = predicate.args.filter(\n      (arg) =>\n        !conditionsToRemove.some((cond) =>\n          areExpressionsEqual(arg as BasicExpression<boolean>, cond)\n        )\n    )\n\n    if (remainingArgs.length === 0) {\n      return undefined\n    } else if (remainingArgs.length === 1) {\n      return remainingArgs[0]!\n    } else {\n      return {\n        type: `func`,\n        name: `and`,\n        args: remainingArgs,\n      } as BasicExpression<boolean>\n    }\n  }\n\n  // For non-AND predicates, don't remove anything\n  return predicate\n}\n\n/**\n * Combine multiple conditions into a single predicate using AND logic.\n * Flattens nested AND operations to avoid unnecessary nesting.\n */\nfunction combineConditions(\n  conditions: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> {\n  if (conditions.length === 0) {\n    return { type: `val`, value: true } as BasicExpression<boolean>\n  } else if (conditions.length === 1) {\n    return conditions[0]!\n  } else {\n    // Flatten all conditions, including those that are already AND operations\n    const flattenedConditions: Array<BasicExpression<boolean>> = []\n\n    for (const condition of conditions) {\n      if (condition.type === `func` && condition.name === `and`) {\n        // Flatten nested AND operations\n        flattenedConditions.push(...condition.args)\n      } else {\n        flattenedConditions.push(condition)\n      }\n    }\n\n    if (flattenedConditions.length === 1) {\n      return flattenedConditions[0]!\n    } else {\n      return {\n        type: `func`,\n        name: `and`,\n        args: flattenedConditions,\n      } as BasicExpression<boolean>\n    }\n  }\n}\n\n/**\n * Find a predicate with a specific operator and value\n */\nfunction findPredicateWithOperator(\n  predicates: Array<BasicExpression<boolean>>,\n  operator: string,\n  value: any\n): BasicExpression<boolean> | undefined {\n  return predicates.find((p) => {\n    if (p.type === `func`) {\n      const f = p as Func\n      const field = extractComparisonField(f)\n      return f.name === operator && field && areValuesEqual(field.value, value)\n    }\n    return false\n  })\n}\n\nfunction areExpressionsEqual(a: BasicExpression, b: BasicExpression): boolean {\n  if (a.type !== b.type) {\n    return false\n  }\n\n  if (a.type === `val` && b.type === `val`) {\n    return areValuesEqual(a.value, b.value)\n  }\n\n  if (a.type === `ref` && b.type === `ref`) {\n    return areRefsEqual(a, b)\n  }\n\n  if (a.type === `func` && b.type === `func`) {\n    const aFunc = a\n    const bFunc = b\n    if (aFunc.name !== bFunc.name) {\n      return false\n    }\n    if (aFunc.args.length !== bFunc.args.length) {\n      return false\n    }\n    return aFunc.args.every((arg, i) =>\n      areExpressionsEqual(arg, bFunc.args[i]!)\n    )\n  }\n\n  return false\n}\n\nfunction areValuesEqual(a: any, b: any): boolean {\n  // Simple equality check - could be enhanced for deep object comparison\n  if (a === b) {\n    return true\n  }\n\n  // Handle NaN\n  if (typeof a === `number` && typeof b === `number` && isNaN(a) && isNaN(b)) {\n    return true\n  }\n\n  // Handle Date objects\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() === b.getTime()\n  }\n\n  // For arrays and objects, use reference equality\n  // (In practice, we don't need deep equality for these cases -\n  // same object reference means same value for our use case)\n  if (\n    typeof a === `object` &&\n    typeof b === `object` &&\n    a !== null &&\n    b !== null\n  ) {\n    return a === b\n  }\n\n  return false\n}\n\nfunction areRefsEqual(a: PropRef, b: PropRef): boolean {\n  if (a.path.length !== b.path.length) {\n    return false\n  }\n  return a.path.every((segment, i) => segment === b.path[i])\n}\n\n/**\n * Check if a value is a primitive (string, number, boolean, null, undefined)\n * Primitives can use Set for fast lookups\n */\nfunction isPrimitive(value: any): boolean {\n  return (\n    value === null ||\n    value === undefined ||\n    typeof value === `string` ||\n    typeof value === `number` ||\n    typeof value === `boolean`\n  )\n}\n\n/**\n * Check if all values in an array are primitives\n */\nfunction areAllPrimitives(values: Array<any>): boolean {\n  return values.every(isPrimitive)\n}\n\n/**\n * Check if a value is in an array, with optional pre-built Set for optimization.\n * The primitiveSet is cached in InField during extraction and reused for all lookups.\n */\nfunction arrayIncludesWithSet(\n  array: Array<any>,\n  value: any,\n  primitiveSet: Set<any> | null,\n  arrayIsAllPrimitives?: boolean\n): boolean {\n  // Fast path: use pre-built Set for O(1) lookup\n  if (primitiveSet) {\n    // Skip isPrimitive check if we know the value must be primitive for a match\n    // (if array is all primitives, only primitives can match)\n    if (arrayIsAllPrimitives || isPrimitive(value)) {\n      return primitiveSet.has(value)\n    }\n    return false // Non-primitive can't be in primitive-only set\n  }\n\n  // Fallback: use areValuesEqual for Dates and objects\n  return array.some((v) => areValuesEqual(v, value))\n}\n\n/**\n * Get the maximum of two values, handling both numbers and Dates\n */\nfunction maxValue(a: any, b: any): any {\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() > b.getTime() ? a : b\n  }\n  return Math.max(a, b)\n}\n\n/**\n * Get the minimum of two values, handling both numbers and Dates\n */\nfunction minValue(a: any, b: any): any {\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() < b.getTime() ? a : b\n  }\n  return Math.min(a, b)\n}\n\nfunction areCompareOptionsEqual(\n  a: { direction?: `asc` | `desc`; [key: string]: any },\n  b: { direction?: `asc` | `desc`; [key: string]: any }\n): boolean {\n  // For now, just compare direction - could be enhanced for other options\n  return a.direction === b.direction\n}\n\ninterface ComparisonField {\n  ref: PropRef\n  value: any\n}\n\nfunction extractComparisonField(func: Func): ComparisonField | null {\n  // Handle comparison operators: eq, gt, gte, lt, lte\n  if ([`eq`, `gt`, `gte`, `lt`, `lte`].includes(func.name)) {\n    // Assume first arg is ref, second is value\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (firstArg?.type === `ref` && secondArg?.type === `val`) {\n      return {\n        ref: firstArg,\n        value: secondArg.value,\n      }\n    }\n  }\n\n  return null\n}\n\nfunction extractEqualityField(func: Func): ComparisonField | null {\n  if (func.name === `eq`) {\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (firstArg?.type === `ref` && secondArg?.type === `val`) {\n      return {\n        ref: firstArg,\n        value: secondArg.value,\n      }\n    }\n  }\n  return null\n}\n\ninterface InField {\n  ref: PropRef\n  values: Array<any>\n  // Cached optimization data (computed once, reused many times)\n  areAllPrimitives?: boolean\n  primitiveSet?: Set<any> | null\n}\n\nfunction extractInField(func: Func): InField | null {\n  if (func.name === `in`) {\n    const firstArg = func.args[0]\n    const secondArg = func.args[1]\n\n    if (\n      firstArg?.type === `ref` &&\n      secondArg?.type === `val` &&\n      Array.isArray(secondArg.value)\n    ) {\n      let values = secondArg.value\n      // Precompute optimization metadata once\n      const allPrimitives = areAllPrimitives(values)\n      let primitiveSet: Set<any> | null = null\n\n      if (allPrimitives && values.length > 10) {\n        // Build Set and dedupe values at the same time\n        primitiveSet = new Set(values)\n        // If we found duplicates, use the deduped array going forward\n        if (primitiveSet.size < values.length) {\n          values = Array.from(primitiveSet)\n        }\n      }\n\n      return {\n        ref: firstArg,\n        values,\n        areAllPrimitives: allPrimitives,\n        primitiveSet,\n      }\n    }\n  }\n  return null\n}\n\nfunction isComparisonSubset(\n  subsetFunc: Func,\n  subsetValue: any,\n  supersetFunc: Func,\n  supersetValue: any\n): boolean {\n  const subOp = subsetFunc.name\n  const superOp = supersetFunc.name\n\n  // Handle same operator\n  if (subOp === superOp) {\n    if (subOp === `eq`) {\n      // field = X is subset of field = X only\n      // Fast path: primitives can use strict equality\n      if (isPrimitive(subsetValue) && isPrimitive(supersetValue)) {\n        return subsetValue === supersetValue\n      }\n      return areValuesEqual(subsetValue, supersetValue)\n    } else if (subOp === `gt`) {\n      // field > 20 is subset of field > 10 if 20 > 10\n      return subsetValue >= supersetValue\n    } else if (subOp === `gte`) {\n      // field >= 20 is subset of field >= 10 if 20 >= 10\n      return subsetValue >= supersetValue\n    } else if (subOp === `lt`) {\n      // field < 10 is subset of field < 20 if 10 <= 20\n      return subsetValue <= supersetValue\n    } else if (subOp === `lte`) {\n      // field <= 10 is subset of field <= 20 if 10 <= 20\n      return subsetValue <= supersetValue\n    }\n  }\n\n  // Handle different operators on same field\n  // eq vs gt/gte: field = 15 is subset of field > 10 if 15 > 10\n  if (subOp === `eq` && superOp === `gt`) {\n    return subsetValue > supersetValue\n  }\n  if (subOp === `eq` && superOp === `gte`) {\n    return subsetValue >= supersetValue\n  }\n  if (subOp === `eq` && superOp === `lt`) {\n    return subsetValue < supersetValue\n  }\n  if (subOp === `eq` && superOp === `lte`) {\n    return subsetValue <= supersetValue\n  }\n\n  // gt/gte vs gte/gt\n  if (subOp === `gt` && superOp === `gte`) {\n    // field > 10 is subset of field >= 10 if 10 >= 10 (always true for same value)\n    return subsetValue >= supersetValue\n  }\n  if (subOp === `gte` && superOp === `gt`) {\n    // field >= 11 is subset of field > 10 if 11 > 10\n    return subsetValue > supersetValue\n  }\n\n  // lt/lte vs lte/lt\n  if (subOp === `lt` && superOp === `lte`) {\n    // field < 10 is subset of field <= 10 if 10 <= 10\n    return subsetValue <= supersetValue\n  }\n  if (subOp === `lte` && superOp === `lt`) {\n    // field <= 9 is subset of field < 10 if 9 < 10\n    return subsetValue < supersetValue\n  }\n\n  return false\n}\n\nfunction groupPredicatesByField(\n  predicates: Array<BasicExpression<boolean>>\n): Map<string | null, Array<BasicExpression<boolean>>> {\n  const groups = new Map<string | null, Array<BasicExpression<boolean>>>()\n\n  for (const pred of predicates) {\n    let fieldKey: string | null = null\n\n    if (pred.type === `func`) {\n      const func = pred as Func\n      const field =\n        extractComparisonField(func) ||\n        extractEqualityField(func) ||\n        extractInField(func)\n      if (field) {\n        fieldKey = field.ref.path.join(`.`)\n      }\n    }\n\n    const group = groups.get(fieldKey) || []\n    group.push(pred)\n    groups.set(fieldKey, group)\n  }\n\n  return groups\n}\n\nfunction unionSameFieldPredicates(\n  predicates: Array<BasicExpression<boolean>>\n): BasicExpression<boolean> | null {\n  if (predicates.length === 1) {\n    return predicates[0]!\n  }\n\n  // Try to extract range constraints\n  let maxGt: number | null = null\n  let maxGte: number | null = null\n  let minLt: number | null = null\n  let minLte: number | null = null\n  const eqValues: Set<any> = new Set()\n  const inValues: Set<any> = new Set()\n  const otherPredicates: Array<BasicExpression<boolean>> = []\n\n  for (const pred of predicates) {\n    if (pred.type === `func`) {\n      const func = pred as Func\n      const field = extractComparisonField(func)\n\n      if (field) {\n        const value = field.value\n        if (func.name === `gt`) {\n          maxGt = maxGt === null ? value : minValue(maxGt, value)\n        } else if (func.name === `gte`) {\n          maxGte = maxGte === null ? value : minValue(maxGte, value)\n        } else if (func.name === `lt`) {\n          minLt = minLt === null ? value : maxValue(minLt, value)\n        } else if (func.name === `lte`) {\n          minLte = minLte === null ? value : maxValue(minLte, value)\n        } else if (func.name === `eq`) {\n          eqValues.add(value)\n        } else {\n          otherPredicates.push(pred)\n        }\n      } else {\n        const inField = extractInField(func)\n        if (inField) {\n          for (const val of inField.values) {\n            inValues.add(val)\n          }\n        } else {\n          otherPredicates.push(pred)\n        }\n      }\n    } else {\n      otherPredicates.push(pred)\n    }\n  }\n\n  // If we have multiple equality values, combine into IN\n  if (eqValues.size > 1 || (eqValues.size > 0 && inValues.size > 0)) {\n    const allValues = [...eqValues, ...inValues]\n    const ref = predicates.find((p) => {\n      if (p.type === `func`) {\n        const field =\n          extractComparisonField(p as Func) || extractInField(p as Func)\n        return field !== null\n      }\n      return false\n    })\n\n    if (ref && ref.type === `func`) {\n      const field =\n        extractComparisonField(ref as Func) || extractInField(ref as Func)\n      if (field) {\n        return {\n          type: `func`,\n          name: `in`,\n          args: [\n            field.ref,\n            { type: `val`, value: allValues } as BasicExpression,\n          ],\n        } as BasicExpression<boolean>\n      }\n    }\n  }\n\n  // Build the least restrictive range\n  const result: Array<BasicExpression<boolean>> = []\n\n  // Choose the least restrictive lower bound\n  if (maxGt !== null && maxGte !== null) {\n    // Take the smaller one (less restrictive)\n    const pred =\n      maxGte <= maxGt\n        ? findPredicateWithOperator(predicates, `gte`, maxGte)\n        : findPredicateWithOperator(predicates, `gt`, maxGt)\n    if (pred) result.push(pred)\n  } else if (maxGt !== null) {\n    const pred = findPredicateWithOperator(predicates, `gt`, maxGt)\n    if (pred) result.push(pred)\n  } else if (maxGte !== null) {\n    const pred = findPredicateWithOperator(predicates, `gte`, maxGte)\n    if (pred) result.push(pred)\n  }\n\n  // Choose the least restrictive upper bound\n  if (minLt !== null && minLte !== null) {\n    const pred =\n      minLte >= minLt\n        ? findPredicateWithOperator(predicates, `lte`, minLte)\n        : findPredicateWithOperator(predicates, `lt`, minLt)\n    if (pred) result.push(pred)\n  } else if (minLt !== null) {\n    const pred = findPredicateWithOperator(predicates, `lt`, minLt)\n    if (pred) result.push(pred)\n  } else if (minLte !== null) {\n    const pred = findPredicateWithOperator(predicates, `lte`, minLte)\n    if (pred) result.push(pred)\n  }\n\n  // Add single eq value\n  if (eqValues.size === 1 && inValues.size === 0) {\n    const pred = findPredicateWithOperator(predicates, `eq`, [...eqValues][0])\n    if (pred) result.push(pred)\n  }\n\n  // Add IN if only IN values\n  if (eqValues.size === 0 && inValues.size > 0) {\n    result.push(\n      predicates.find((p) => {\n        if (p.type === `func`) {\n          return (p as Func).name === `in`\n        }\n        return false\n      })!\n    )\n  }\n\n  // Add other predicates\n  result.push(...otherPredicates)\n\n  if (result.length === 0) {\n    return { type: `val`, value: true } as BasicExpression<boolean>\n  }\n\n  if (result.length === 1) {\n    return result[0]!\n  }\n\n  return {\n    type: `func`,\n    name: `or`,\n    args: result,\n  } as BasicExpression<boolean>\n}\n"],"names":[],"mappings":";AAoBO,SAAS,cACd,QACA,UACS;AAGT,MAAI,WAAW,UAAa,aAAa,QAAW;AAClD,WAAO;AAAA,EACT;AAIA,MAAI,WAAW,UAAa,aAAa,QAAW;AAClD,WAAO;AAAA,EACT;AAIA,MAAI,aAAa,UAAa,WAAW,QAAW;AAClD,WAAO;AAAA,EACT;AAEA,SAAO,sBAAsB,QAAS,QAAS;AACjD;AAEA,SAAS,gBACP,OAC0B;AAC1B,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,IAAI,MAAM,KAAK;AAAA,EACxB;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,SAAO,IAAI,KAAK,MAAM,KAAK;AAC7B;AAEA,SAAS,cAAc,SAAkB;AACvC,QAAM,aAAa,QAAQ,OAAO;AAAA,IAChC,CAAC,UAAU,IAAI,KAAK,MAAM,CAAC,QAAQ,KAAK,IAAI,MAAM,KAAK,CAAC,CAAC;AAAA,EAAA;AAE3D,SAAO,gBAAgB,UAAU;AACnC;AAEA,SAAS,sBACP,QACA,UACS;AAIT,MAAI,OAAO,SAAS,SAAS,OAAO,UAAU,OAAO;AACnD,WAAO;AAAA,EACT;AAGA,MAAI,oBAAoB,QAAQ,QAAQ,GAAG;AACzC,WAAO;AAAA,EACT;AAKA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,OAAO;AACvD,WAAO,SAAS,KAAK;AAAA,MAAM,CAAC,QAC1B,sBAAsB,QAAQ,GAA+B;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,OAAO;AAEnD,WAAO,OAAO,KAAK;AAAA,MAAK,CAAC,QACvB,sBAAsB,KAAiC,QAAQ;AAAA,IAAA;AAAA,EAEnE;AAIA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,MAAM;AAClD,UAAM,UAAU,eAAe,MAAM;AACrC,QAAI,SAAS;AACX,aAAO,sBAAsB,cAAc,OAAO,GAAG,QAAQ;AAAA,IAC/D;AAAA,EACF;AAEA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,MAAM;AACtD,UAAM,UAAU,eAAe,QAAQ;AACvC,QAAI,SAAS;AACX,aAAO,sBAAsB,QAAQ,cAAc,OAAO,CAAC;AAAA,IAC7D;AAAA,EACF;AAGA,MAAI,OAAO,SAAS,UAAU,OAAO,SAAS,MAAM;AAClD,WAAO,OAAO,KAAK;AAAA,MAAM,CAAC,QACxB,sBAAsB,KAAiC,QAAQ;AAAA,IAAA;AAAA,EAEnE;AAKA,MAAI,SAAS,SAAS,UAAU,SAAS,SAAS,MAAM;AACtD,WAAO,SAAS,KAAK;AAAA,MAAK,CAAC,QACzB,sBAAsB,QAAQ,GAA+B;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,OAAO,SAAS,UAAU,SAAS,SAAS,QAAQ;AACtD,UAAM,aAAa;AACnB,UAAM,eAAe;AAGrB,UAAM,cAAc,uBAAuB,UAAU;AACrD,UAAM,gBAAgB,uBAAuB,YAAY;AAEzD,QACE,eACA,iBACA,aAAa,YAAY,KAAK,cAAc,GAAG,GAC/C;AACA,aAAO;AAAA,QACL;AAAA,QACA,YAAY;AAAA,QACZ;AAAA,QACA,cAAc;AAAA,MAAA;AAAA,IAElB;AAAA,EA6CF;AAGA,SAAO;AACT;AAKA,SAAS,uBACP,YACA,WACA,YAG0B;AAC1B,QAAM,aAAa,cAAc,QAAQ,OAAO;AAChD,QAAM,gBAAgB,cAAc,QAAQ,OAAO;AAEnD,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,WAAA;AAAA,EAC/B;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,QAAM,iBAAkD,CAAA;AACxD,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,UAAU,KAAK,SAAS,WAAW;AACnD,qBAAe,KAAK,GAAG,KAAK,IAAI;AAAA,IAClC,OAAO;AACL,qBAAe,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,UAAU,uBAAuB,cAAc;AAGrD,QAAM,aAA8C,CAAA;AACpD,aAAW,CAAC,OAAO,KAAK,KAAK,QAAQ,WAAW;AAC9C,QAAI,UAAU,MAAM;AAElB,iBAAW,KAAK,GAAG,KAAK;AAAA,IAC1B,OAAO;AAEL,YAAM,SAAS,WAAW,KAAK;AAc/B,UAAI,QAAQ;AACV,mBAAW,KAAK,MAAM;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,cAAA;AAAA,EAC/B;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EAAA;AAEV;AAkBO,SAAS,qBACd,YAC0B;AAC1B,SAAO,uBAAuB,YAAY,MAAM,wBAAwB;AAC1E;AAuCO,SAAS,qBACd,eACA,mBACiC;AAEjC,MAAI,sBAAsB,QAAW;AACnC,WACE,iBACC,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAE3B;AAKA,MAAI,kBAAkB,QAAW;AAC/B,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,iBAAiB;AAAA,IAAA;AAAA,EAE5B;AAIA,MAAI,cAAc,eAAe,iBAAiB,GAAG;AACnD,WAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,EAC/B;AAGA,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA;AAAA,EAAA;AAEF,MAAI,iBAAiB,SAAS,GAAG;AAE/B,UAAM,oBAAoB,iBAAiB,eAAe,gBAAgB;AAC1E,UAAM,wBAAwB;AAAA,MAC5B;AAAA,MACA;AAAA,IAAA;AAIF,UAAM,uBAAuB;AAAA,MAC3B;AAAA,MACA;AAAA,IAAA;AAGF,QAAI,yBAAyB,MAAM;AAEjC,aAAO,kBAAkB,CAAC,GAAG,kBAAkB,oBAAoB,CAAC;AAAA,IACtE;AAAA,EACF;AAGA,MAAI,cAAc,SAAS,UAAU,kBAAkB,SAAS,QAAQ;AACtE,UAAM,SAAS,yBAAyB,eAAe,iBAAiB;AACxE,QAAI,WAAW,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AAGA,SAAO;AACT;AAKA,SAAS,yBACP,UACA,cACiC;AAEjC,QAAM,YACJ,uBAAuB,QAAQ,KAC/B,qBAAqB,QAAQ,KAC7B,eAAe,QAAQ;AACzB,QAAM,gBACJ,uBAAuB,YAAY,KACnC,qBAAqB,YAAY,KACjC,eAAe,YAAY;AAG7B,MACE,CAAC,aACD,CAAC,iBACD,CAAC,aAAa,UAAU,KAAK,cAAc,GAAG,GAC9C;AACA,WAAO;AAAA,EACT;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,cAAc;AACpB,UAAM,kBAAkB;AAGxB,UAAM,kBAAkB,YAAY,OAAO;AAAA,MACzC,CAAC,MACC,CAAC;AAAA,QACC,gBAAgB;AAAA,QAChB;AAAA,QACA,gBAAgB,gBAAgB;AAAA,QAChC,gBAAgB;AAAA,MAAA;AAAA,IAClB;AAGJ,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAgB,CAAC,EAAA,CAAG;AAAA,MAAA;AAAA,IAEpE;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAA,CAAiB;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,cAAc;AACpB,UAAM,gBAAiB,cAA+C;AAEtE,UAAM,kBAAkB,YAAY,OAAO;AAAA,MACzC,CAAC,MAAM,CAAC,eAAe,GAAG,aAAa;AAAA,IAAA;AAGzC,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAEA,QAAI,gBAAgB,WAAW,GAAG;AAChC,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAgB,CAAC,EAAA,CAAG;AAAA,MAAA;AAAA,IAEpE;AAEA,WAAO;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM,CAAC,UAAU,KAAK,EAAE,MAAM,OAAO,OAAO,gBAAA,CAAiB;AAAA,IAAA;AAAA,EAEjE;AAGA,MAAI,SAAS,SAAS,QAAQ,aAAa,SAAS,MAAM;AACxD,UAAM,YAAa,UAA2C;AAC9D,UAAM,gBAAiB,cAA+C;AAEtE,QAAI,eAAe,WAAW,aAAa,GAAG;AAC5C,aAAO,EAAE,MAAM,OAAO,OAAO,MAAA;AAAA,IAC/B;AAGA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,uBAAuB,QAAQ;AAChD,QAAM,eAAe,uBAAuB,YAAY;AAExD,MACE,YACA,gBACA,aAAa,SAAS,KAAK,aAAa,GAAG,GAC3C;AAEA,UAAM,SAAS;AAAA,MACb;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA,aAAa;AAAA,IAAA;AAEf,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAKA,SAAS,qBACP,UACA,WACA,cACA,eACiC;AACjC,QAAM,SAAS,SAAS;AACxB,QAAM,aAAa,aAAa;AAChC,QAAM,OAAO,uBAAuB,QAAQ,KAC1C,qBAAqB,QAAQ,GAAI;AAGnC,MAAI,WAAW,QAAQ,eAAe,MAAM;AAC1C,QAAI,YAAY,eAAe;AAE7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AAEA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,OAAO;AAC5C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,OAAO;AAC3C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,MAAM;AAC3C,QAAI,aAAa,eAAe;AAC9B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,QACnD;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,MAAM;AAC1C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,OAAO;AAC5C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,QAAQ,eAAe,OAAO;AAC3C,QAAI,YAAY,eAAe;AAC7B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,SAAS,eAAe,MAAM;AAC3C,QAAI,aAAa,eAAe;AAC9B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,UACJ;AAAA,YACE,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM,CAAC,KAAK,EAAE,MAAM,OAAO,OAAO,eAAe;AAAA,UAAA;AAAA,UAEnD;AAAA,QAAA;AAAA,MACF;AAAA,IAEJ;AACA,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAcO,SAAS,gBACd,QACA,UACS;AAET,MAAI,CAAC,UAAU,OAAO,WAAW,GAAG;AAClC,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,YAAY,SAAS,WAAW,GAAG;AACtC,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,SAAS,SAAS,QAAQ;AACnC,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,YAAY,OAAO,CAAC;AAC1B,UAAM,cAAc,SAAS,CAAC;AAG9B,QAAI,CAAC,oBAAoB,UAAU,YAAY,YAAY,UAAU,GAAG;AACtE,aAAO;AAAA,IACT;AAGA,QACE,CAAC;AAAA,MACC,UAAU;AAAA,MACV,YAAY;AAAA,IAAA,GAEd;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAeO,SAAS,cACd,QACA,UACS;AAET,MAAI,aAAa,QAAW;AAC1B,WAAO;AAAA,EACT;AAIA,MAAI,WAAW,QAAW;AACxB,WAAO;AAAA,EACT;AAGA,SAAO,UAAU;AACnB;AAgBO,SAAS,kBACd,QACA,UACS;AAgBT,MAAI,SAAS,UAAU,QAAW;AAEhC,QAAI,CAAC,qBAAqB,OAAO,OAAO,SAAS,KAAK,GAAG;AACvD,aAAO;AAAA,IACT;AACA,WACE,gBAAgB,OAAO,SAAS,SAAS,OAAO,KAChD,cAAc,OAAO,OAAO,SAAS,KAAK;AAAA,EAE9C;AAGA,SACE,cAAc,OAAO,OAAO,SAAS,KAAK,KAC1C,gBAAgB,OAAO,SAAS,SAAS,OAAO,KAChD,cAAc,OAAO,OAAO,SAAS,KAAK;AAE9C;AAMA,SAAS,qBACP,GACA,GACS;AACT,MAAI,MAAM,UAAa,MAAM,QAAW;AACtC,WAAO;AAAA,EACT;AACA,MAAI,MAAM,UAAa,MAAM,QAAW;AACtC,WAAO;AAAA,EACT;AACA,SAAO,oBAAoB,GAAG,CAAC;AACjC;AAUA,SAAS,qBACP,YACA,YACiC;AACjC,QAAM,cAAc,qBAAqB,UAAU;AACnD,QAAM,cAAc,qBAAqB,UAAU;AAEnD,QAAM,SAA0C,CAAA;AAEhD,aAAW,SAAS,aAAa;AAC/B,eAAW,SAAS,aAAa;AAC/B,UAAI,oBAAoB,OAAO,KAAK,GAAG;AAErC,YAAI,CAAC,OAAO,KAAK,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC,GAAG;AACtD,iBAAO,KAAK,KAAK;AAAA,QACnB;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,qBACP,WACiC;AACjC,MAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AACzD,UAAM,aAA8C,CAAA;AACpD,eAAW,OAAO,UAAU,MAAM;AAChC,iBAAW,KAAK,GAAG,qBAAqB,GAA+B,CAAC;AAAA,IAC1E;AACA,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,SAAS;AACnB;AAMA,SAAS,iBACP,WACA,oBACsC;AACtC,MAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AACzD,UAAM,gBAAgB,UAAU,KAAK;AAAA,MACnC,CAAC,QACC,CAAC,mBAAmB;AAAA,QAAK,CAAC,SACxB,oBAAoB,KAAiC,IAAI;AAAA,MAAA;AAAA,IAC3D;AAGJ,QAAI,cAAc,WAAW,GAAG;AAC9B,aAAO;AAAA,IACT,WAAW,cAAc,WAAW,GAAG;AACrC,aAAO,cAAc,CAAC;AAAA,IACxB,OAAO;AACL,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AAGA,SAAO;AACT;AAMA,SAAS,kBACP,YAC0B;AAC1B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAC/B,WAAW,WAAW,WAAW,GAAG;AAClC,WAAO,WAAW,CAAC;AAAA,EACrB,OAAO;AAEL,UAAM,sBAAuD,CAAA;AAE7D,eAAW,aAAa,YAAY;AAClC,UAAI,UAAU,SAAS,UAAU,UAAU,SAAS,OAAO;AAEzD,4BAAoB,KAAK,GAAG,UAAU,IAAI;AAAA,MAC5C,OAAO;AACL,4BAAoB,KAAK,SAAS;AAAA,MACpC;AAAA,IACF;AAEA,QAAI,oBAAoB,WAAW,GAAG;AACpC,aAAO,oBAAoB,CAAC;AAAA,IAC9B,OAAO;AACL,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAAA,IAEV;AAAA,EACF;AACF;AAKA,SAAS,0BACP,YACA,UACA,OACsC;AACtC,SAAO,WAAW,KAAK,CAAC,MAAM;AAC5B,QAAI,EAAE,SAAS,QAAQ;AACrB,YAAM,IAAI;AACV,YAAM,QAAQ,uBAAuB,CAAC;AACtC,aAAO,EAAE,SAAS,YAAY,SAAS,eAAe,MAAM,OAAO,KAAK;AAAA,IAC1E;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,oBAAoB,GAAoB,GAA6B;AAC5E,MAAI,EAAE,SAAS,EAAE,MAAM;AACrB,WAAO;AAAA,EACT;AAEA,MAAI,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO;AACxC,WAAO,eAAe,EAAE,OAAO,EAAE,KAAK;AAAA,EACxC;AAEA,MAAI,EAAE,SAAS,SAAS,EAAE,SAAS,OAAO;AACxC,WAAO,aAAa,GAAG,CAAC;AAAA,EAC1B;AAEA,MAAI,EAAE,SAAS,UAAU,EAAE,SAAS,QAAQ;AAC1C,UAAM,QAAQ;AACd,UAAM,QAAQ;AACd,QAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,aAAO;AAAA,IACT;AACA,QAAI,MAAM,KAAK,WAAW,MAAM,KAAK,QAAQ;AAC3C,aAAO;AAAA,IACT;AACA,WAAO,MAAM,KAAK;AAAA,MAAM,CAAC,KAAK,MAC5B,oBAAoB,KAAK,MAAM,KAAK,CAAC,CAAE;AAAA,IAAA;AAAA,EAE3C;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,GAAQ,GAAiB;AAE/C,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAGA,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AAC1E,WAAO;AAAA,EACT;AAGA,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,cAAc,EAAE,QAAA;AAAA,EAC3B;AAKA,MACE,OAAO,MAAM,YACb,OAAO,MAAM,YACb,MAAM,QACN,MAAM,MACN;AACA,WAAO,MAAM;AAAA,EACf;AAEA,SAAO;AACT;AAEA,SAAS,aAAa,GAAY,GAAqB;AACrD,MAAI,EAAE,KAAK,WAAW,EAAE,KAAK,QAAQ;AACnC,WAAO;AAAA,EACT;AACA,SAAO,EAAE,KAAK,MAAM,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,CAAC,CAAC;AAC3D;AAMA,SAAS,YAAY,OAAqB;AACxC,SACE,UAAU,QACV,UAAU,UACV,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU;AAErB;AAKA,SAAS,iBAAiB,QAA6B;AACrD,SAAO,OAAO,MAAM,WAAW;AACjC;AAMA,SAAS,qBACP,OACA,OACA,cACA,sBACS;AAET,MAAI,cAAc;AAGhB,QAAI,wBAAwB,YAAY,KAAK,GAAG;AAC9C,aAAO,aAAa,IAAI,KAAK;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AAGA,SAAO,MAAM,KAAK,CAAC,MAAM,eAAe,GAAG,KAAK,CAAC;AACnD;AAKA,SAAS,SAAS,GAAQ,GAAa;AACrC,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,QAAA,IAAY,EAAE,QAAA,IAAY,IAAI;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AAKA,SAAS,SAAS,GAAQ,GAAa;AACrC,MAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,WAAO,EAAE,QAAA,IAAY,EAAE,QAAA,IAAY,IAAI;AAAA,EACzC;AACA,SAAO,KAAK,IAAI,GAAG,CAAC;AACtB;AAEA,SAAS,uBACP,GACA,GACS;AAET,SAAO,EAAE,cAAc,EAAE;AAC3B;AAOA,SAAS,uBAAuB,MAAoC;AAElE,MAAI,CAAC,MAAM,MAAM,OAAO,MAAM,KAAK,EAAE,SAAS,KAAK,IAAI,GAAG;AAExD,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QAAI,UAAU,SAAS,SAAS,WAAW,SAAS,OAAO;AACzD,aAAO;AAAA,QACL,KAAK;AAAA,QACL,OAAO,UAAU;AAAA,MAAA;AAAA,IAErB;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAoC;AAChE,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QAAI,UAAU,SAAS,SAAS,WAAW,SAAS,OAAO;AACzD,aAAO;AAAA,QACL,KAAK;AAAA,QACL,OAAO,UAAU;AAAA,MAAA;AAAA,IAErB;AAAA,EACF;AACA,SAAO;AACT;AAUA,SAAS,eAAe,MAA4B;AAClD,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,WAAW,KAAK,KAAK,CAAC;AAC5B,UAAM,YAAY,KAAK,KAAK,CAAC;AAE7B,QACE,UAAU,SAAS,SACnB,WAAW,SAAS,SACpB,MAAM,QAAQ,UAAU,KAAK,GAC7B;AACA,UAAI,SAAS,UAAU;AAEvB,YAAM,gBAAgB,iBAAiB,MAAM;AAC7C,UAAI,eAAgC;AAEpC,UAAI,iBAAiB,OAAO,SAAS,IAAI;AAEvC,uBAAe,IAAI,IAAI,MAAM;AAE7B,YAAI,aAAa,OAAO,OAAO,QAAQ;AACrC,mBAAS,MAAM,KAAK,YAAY;AAAA,QAClC;AAAA,MACF;AAEA,aAAO;AAAA,QACL,KAAK;AAAA,QACL;AAAA,QACA,kBAAkB;AAAA,QAClB;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,YACA,aACA,cACA,eACS;AACT,QAAM,QAAQ,WAAW;AACzB,QAAM,UAAU,aAAa;AAG7B,MAAI,UAAU,SAAS;AACrB,QAAI,UAAU,MAAM;AAGlB,UAAI,YAAY,WAAW,KAAK,YAAY,aAAa,GAAG;AAC1D,eAAO,gBAAgB;AAAA,MACzB;AACA,aAAO,eAAe,aAAa,aAAa;AAAA,IAClD,WAAW,UAAU,MAAM;AAEzB,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,OAAO;AAE1B,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,MAAM;AAEzB,aAAO,eAAe;AAAA,IACxB,WAAW,UAAU,OAAO;AAE1B,aAAO,eAAe;AAAA,IACxB;AAAA,EACF;AAIA,MAAI,UAAU,QAAQ,YAAY,MAAM;AACtC,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,UAAU,QAAQ,YAAY,OAAO;AACvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,QAAQ,YAAY,MAAM;AACtC,WAAO,cAAc;AAAA,EACvB;AACA,MAAI,UAAU,QAAQ,YAAY,OAAO;AACvC,WAAO,eAAe;AAAA,EACxB;AAGA,MAAI,UAAU,QAAQ,YAAY,OAAO;AAEvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,YAAY,MAAM;AAEvC,WAAO,cAAc;AAAA,EACvB;AAGA,MAAI,UAAU,QAAQ,YAAY,OAAO;AAEvC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,UAAU,SAAS,YAAY,MAAM;AAEvC,WAAO,cAAc;AAAA,EACvB;AAEA,SAAO;AACT;AAEA,SAAS,uBACP,YACqD;AACrD,QAAM,6BAAa,IAAA;AAEnB,aAAW,QAAQ,YAAY;AAC7B,QAAI,WAA0B;AAE9B,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,OAAO;AACb,YAAM,QACJ,uBAAuB,IAAI,KAC3B,qBAAqB,IAAI,KACzB,eAAe,IAAI;AACrB,UAAI,OAAO;AACT,mBAAW,MAAM,IAAI,KAAK,KAAK,GAAG;AAAA,MACpC;AAAA,IACF;AAEA,UAAM,QAAQ,OAAO,IAAI,QAAQ,KAAK,CAAA;AACtC,UAAM,KAAK,IAAI;AACf,WAAO,IAAI,UAAU,KAAK;AAAA,EAC5B;AAEA,SAAO;AACT;AAEA,SAAS,yBACP,YACiC;AACjC,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,WAAW,CAAC;AAAA,EACrB;AAGA,MAAI,QAAuB;AAC3B,MAAI,SAAwB;AAC5B,MAAI,QAAuB;AAC3B,MAAI,SAAwB;AAC5B,QAAM,+BAAyB,IAAA;AAC/B,QAAM,+BAAyB,IAAA;AAC/B,QAAM,kBAAmD,CAAA;AAEzD,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,OAAO;AACb,YAAM,QAAQ,uBAAuB,IAAI;AAEzC,UAAI,OAAO;AACT,cAAM,QAAQ,MAAM;AACpB,YAAI,KAAK,SAAS,MAAM;AACtB,kBAAQ,UAAU,OAAO,QAAQ,SAAS,OAAO,KAAK;AAAA,QACxD,WAAW,KAAK,SAAS,OAAO;AAC9B,mBAAS,WAAW,OAAO,QAAQ,SAAS,QAAQ,KAAK;AAAA,QAC3D,WAAW,KAAK,SAAS,MAAM;AAC7B,kBAAQ,UAAU,OAAO,QAAQ,SAAS,OAAO,KAAK;AAAA,QACxD,WAAW,KAAK,SAAS,OAAO;AAC9B,mBAAS,WAAW,OAAO,QAAQ,SAAS,QAAQ,KAAK;AAAA,QAC3D,WAAW,KAAK,SAAS,MAAM;AAC7B,mBAAS,IAAI,KAAK;AAAA,QACpB,OAAO;AACL,0BAAgB,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF,OAAO;AACL,cAAM,UAAU,eAAe,IAAI;AACnC,YAAI,SAAS;AACX,qBAAW,OAAO,QAAQ,QAAQ;AAChC,qBAAS,IAAI,GAAG;AAAA,UAClB;AAAA,QACF,OAAO;AACL,0BAAgB,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF;AAAA,IACF,OAAO;AACL,sBAAgB,KAAK,IAAI;AAAA,IAC3B;AAAA,EACF;AAGA,MAAI,SAAS,OAAO,KAAM,SAAS,OAAO,KAAK,SAAS,OAAO,GAAI;AACjE,UAAM,YAAY,CAAC,GAAG,UAAU,GAAG,QAAQ;AAC3C,UAAM,MAAM,WAAW,KAAK,CAAC,MAAM;AACjC,UAAI,EAAE,SAAS,QAAQ;AACrB,cAAM,QACJ,uBAAuB,CAAS,KAAK,eAAe,CAAS;AAC/D,eAAO,UAAU;AAAA,MACnB;AACA,aAAO;AAAA,IACT,CAAC;AAED,QAAI,OAAO,IAAI,SAAS,QAAQ;AAC9B,YAAM,QACJ,uBAAuB,GAAW,KAAK,eAAe,GAAW;AACnE,UAAI,OAAO;AACT,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,YACJ,MAAM;AAAA,YACN,EAAE,MAAM,OAAO,OAAO,UAAA;AAAA,UAAU;AAAA,QAClC;AAAA,MAEJ;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAA0C,CAAA;AAGhD,MAAI,UAAU,QAAQ,WAAW,MAAM;AAErC,UAAM,OACJ,UAAU,QACN,0BAA0B,YAAY,OAAO,MAAM,IACnD,0BAA0B,YAAY,MAAM,KAAK;AACvD,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,UAAU,MAAM;AACzB,UAAM,OAAO,0BAA0B,YAAY,MAAM,KAAK;AAC9D,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,WAAW,MAAM;AAC1B,UAAM,OAAO,0BAA0B,YAAY,OAAO,MAAM;AAChE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,UAAU,QAAQ,WAAW,MAAM;AACrC,UAAM,OACJ,UAAU,QACN,0BAA0B,YAAY,OAAO,MAAM,IACnD,0BAA0B,YAAY,MAAM,KAAK;AACvD,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,UAAU,MAAM;AACzB,UAAM,OAAO,0BAA0B,YAAY,MAAM,KAAK;AAC9D,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B,WAAW,WAAW,MAAM;AAC1B,UAAM,OAAO,0BAA0B,YAAY,OAAO,MAAM;AAChE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,SAAS,SAAS,KAAK,SAAS,SAAS,GAAG;AAC9C,UAAM,OAAO,0BAA0B,YAAY,MAAM,CAAC,GAAG,QAAQ,EAAE,CAAC,CAAC;AACzE,QAAI,KAAM,QAAO,KAAK,IAAI;AAAA,EAC5B;AAGA,MAAI,SAAS,SAAS,KAAK,SAAS,OAAO,GAAG;AAC5C,WAAO;AAAA,MACL,WAAW,KAAK,CAAC,MAAM;AACrB,YAAI,EAAE,SAAS,QAAQ;AACrB,iBAAQ,EAAW,SAAS;AAAA,QAC9B;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IAAA;AAAA,EAEL;AAGA,SAAO,KAAK,GAAG,eAAe;AAE9B,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,MAAM,OAAO,OAAO,KAAA;AAAA,EAC/B;AAEA,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,OAAO,CAAC;AAAA,EACjB;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EAAA;AAEV;"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@tanstack/db",
   "description": "A reactive client store for building super fast apps on sync",
-  "version": "0.5.6",
+  "version": "0.5.8",
   "dependencies": {
     "@standard-schema/spec": "^1.0.0",
     "@tanstack/pacer-lite": "^0.1.0",

package/src/collection/subscription.ts

@@ -1,5 +1,5 @@
 import { ensureIndexForExpression } from "../indexes/auto-index.js"
-import { and, eq, gt, lt } from "../query/builder/functions.js"
+import { and, eq, gt, gte, lt } from "../query/builder/functions.js"
 import { Value } from "../query/ir.js"
 import { EventEmitter } from "../event-emitter.js"
 import {
@@ -361,7 +361,19 @@ export class CollectionSubscription
     // First promise: load all values equal to minValue
     if (typeof minValue !== `undefined`) {
       const { expression } = orderBy[0]!
-      const exactValueFilter = eq(expression, new Value(minValue))
+
+      // For Date values, we need to handle precision differences between JS (ms) and backends (μs)
+      // A JS Date represents a 1ms range, so we query for all values within that range
+      let exactValueFilter
+      if (minValue instanceof Date) {
+        const minValuePlus1ms = new Date(minValue.getTime() + 1)
+        exactValueFilter = and(
+          gte(expression, new Value(minValue)),
+          lt(expression, new Value(minValuePlus1ms))
+        )
+      } else {
+        exactValueFilter = eq(expression, new Value(minValue))
+      }
 
       const loadOptions2: LoadSubsetOptions = {
         where: exactValueFilter,