@topgunbuild/core 0.1.0

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/HLC.ts","../src/utils/hash.ts","../src/MerkleTree.ts","../src/LWWMap.ts","../src/ORMap.ts","../src/serializer.ts","../src/predicate.ts","../src/schemas.ts"],"sourcesContent":["import { HLC, Timestamp } from './HLC';\nimport { LWWMap, LWWRecord } from './LWWMap';\nimport { ORMap, ORMapRecord } from './ORMap';\nimport { MerkleTree } from './MerkleTree';\n\nexport { HLC, LWWMap, ORMap, MerkleTree };\nexport * from './utils/hash';\nexport * from './serializer';\nexport * from './predicate';\nexport * from './security';\nexport * from './schemas';\nexport type { Timestamp, LWWRecord, ORMapRecord };\n","export interface Timestamp {\n  millis: number;\n  counter: number;\n  nodeId: string;\n}\n\nexport class HLC {\n  private lastMillis: number;\n  private lastCounter: number;\n  private readonly nodeId: string;\n\n  // Max allowable drift in milliseconds (1 minute)\n  private static readonly MAX_DRIFT = 60000;\n\n  constructor(nodeId: string) {\n    this.nodeId = nodeId;\n    this.lastMillis = 0;\n    this.lastCounter = 0;\n  }\n\n  public get getNodeId(): string {\n    return this.nodeId;\n  }\n\n  /**\n   * Generates a new unique timestamp for a local event.\n   * Ensures monotonicity: always greater than any previously generated or received timestamp.\n   */\n  public now(): Timestamp {\n    const systemTime = Date.now();\n    \n    // If local physical time catches up to logical time, reset counter\n    if (systemTime > this.lastMillis) {\n      this.lastMillis = systemTime;\n      this.lastCounter = 0;\n    } else {\n      // Else, just increment the logical counter\n      this.lastCounter++;\n    }\n\n    return {\n      millis: this.lastMillis,\n      counter: this.lastCounter,\n      nodeId: this.nodeId\n    };\n  }\n\n  /**\n   * Updates the local clock based on a received remote timestamp.\n   * Must be called whenever a message/event is received from another node.\n   */\n  public update(remote: Timestamp): void {\n    const systemTime = Date.now();\n\n    // Validate drift (optional but good practice)\n    if (remote.millis > systemTime + HLC.MAX_DRIFT) {\n      console.warn(`Clock drift detected: Remote time ${remote.millis} is far ahead of local ${systemTime}`);\n      // In strict systems we might reject, but in AP systems we usually accept and fast-forward\n    }\n\n    const maxMillis = Math.max(this.lastMillis, systemTime, remote.millis);\n\n    if (maxMillis === this.lastMillis && maxMillis === remote.millis) {\n      // Both clocks are on the same millisecond, take max counter\n      this.lastCounter = Math.max(this.lastCounter, remote.counter) + 1;\n    } else if (maxMillis === this.lastMillis) {\n      // Local logical clock is ahead in millis (or same as remote but remote millis < local)\n      this.lastCounter++;\n    } else if (maxMillis === remote.millis) {\n      // Remote clock is ahead, fast-forward local\n      this.lastCounter = remote.counter + 1;\n    } else {\n      // System time is ahead of both\n      this.lastCounter = 0;\n    }\n\n    this.lastMillis = maxMillis;\n  }\n\n  /**\n   * Compares two timestamps.\n   * Returns -1 if a < b, 1 if a > b, 0 if equal.\n   */\n  public static compare(a: Timestamp, b: Timestamp): number {\n    if (a.millis !== b.millis) {\n      return a.millis - b.millis;\n    }\n    if (a.counter !== b.counter) {\n      return a.counter - b.counter;\n    }\n    return a.nodeId.localeCompare(b.nodeId);\n  }\n\n  /**\n   * Serializes timestamp to a string representation (e.g., for storage/network).\n   * Format: \"<millis>:<counter>:<nodeId>\"\n   */\n  public static toString(ts: Timestamp): string {\n    return `${ts.millis}:${ts.counter}:${ts.nodeId}`;\n  }\n\n  /**\n   * Parses a string representation back to a Timestamp object.\n   */\n  public static parse(str: string): Timestamp {\n    const parts = str.split(':');\n    if (parts.length !== 3) {\n      throw new Error(`Invalid timestamp format: ${str}`);\n    }\n    return {\n      millis: parseInt(parts[0], 10),\n      counter: parseInt(parts[1], 10),\n      nodeId: parts[2]\n    };\n  }\n}\n","/**\n * FNV-1a Hash implementation for strings.\n * Fast, non-cryptographic, synchronous.\n * Good enough for data synchronization checks.\n */\nexport function hashString(str: string): number {\n  let hash = 0x811c9dc5;\n  for (let i = 0; i < str.length; i++) {\n    hash ^= str.charCodeAt(i);\n    hash = Math.imul(hash, 0x01000193);\n  }\n  return hash >>> 0; // Ensure positive 32-bit integer\n}\n\n/**\n * Combines multiple hash numbers into one order-independent hash.\n * Used for combining bucket hashes.\n * XOR is simple and effective for order-independent combination, \n * but for Merkle trees we usually want position dependence if it's a Trie, \n * or order-independence if it's a Set.\n * Here we simply sum or XOR.\n */\nexport function combineHashes(hashes: number[]): number {\n  let result = 0;\n  for (const h of hashes) {\n    result = (result + h) | 0; // Simple sum\n  }\n  return result >>> 0;\n}\n\n","import { LWWRecord } from './LWWMap';\nimport { hashString } from './utils/hash';\n\nexport interface MerkleNode {\n  hash: number;\n  children?: { [key: string]: MerkleNode }; // Keyed by bucket index (hex char)\n  entries?: Map<string, number>; // Leaf node: Key -> ContentHash\n}\n\n/**\n * A specific implementation of Merkle Tree for syncing LWW-Maps.\n * It uses a Prefix Trie structure based on the hash of the Record Key.\n * \n * Structure:\n * - Level 0: Root\n * - Level 1..N: Buckets based on hex digits of Key Hash.\n * \n * This allows us to quickly identify which \"bucket\" of keys is out of sync.\n */\nexport class MerkleTree {\n  private root: MerkleNode;\n  private readonly depth: number;\n\n  constructor(records: Map<string, LWWRecord<any>> = new Map(), depth: number = 3) {\n    this.depth = depth;\n    this.root = { hash: 0, children: {} };\n    // Build initial tree\n    for (const [key, record] of records) {\n        this.update(key, record);\n    }\n  }\n\n  /**\n   * Incrementally updates the Merkle Tree with a single record.\n   * @param key The key of the record\n   * @param record The record (value + timestamp)\n   */\n  public update(key: string, record: LWWRecord<any>) {\n    const itemHash = hashString(`${key}:${record.timestamp.millis}:${record.timestamp.counter}:${record.timestamp.nodeId}`);\n    // We use the hash of the KEY for routing, so the record stays in the same bucket\n    // regardless of timestamp changes.\n    const pathHash = hashString(key).toString(16).padStart(8, '0'); \n    \n    this.updateNode(this.root, key, itemHash, pathHash, 0);\n  }\n\n  /**\n   * Removes a key from the Merkle Tree.\n   * Necessary for Garbage Collection of tombstones.\n   */\n  public remove(key: string) {\n    const pathHash = hashString(key).toString(16).padStart(8, '0');\n    this.removeNode(this.root, key, pathHash, 0);\n  }\n\n  private removeNode(node: MerkleNode, key: string, pathHash: string, level: number): number {\n    // Leaf Node Logic\n    if (level >= this.depth) {\n      if (node.entries) {\n        node.entries.delete(key);\n        \n        // Recalculate leaf hash\n        let h = 0;\n        for (const val of node.entries.values()) {\n          h = (h + val) | 0;\n        }\n        node.hash = h >>> 0;\n      }\n      return node.hash;\n    }\n\n    // Intermediate Node Logic\n    const bucketChar = pathHash[level];\n    if (node.children && node.children[bucketChar]) {\n      const childHash = this.removeNode(node.children[bucketChar], key, pathHash, level + 1);\n      \n      // Optimization: if child is empty/zero, we might want to remove it, but for now just recalc.\n    }\n    \n    // Recalculate this node's hash from children\n    let h = 0;\n    if (node.children) {\n      for (const child of Object.values(node.children)) {\n        h = (h + child.hash) | 0;\n      }\n    }\n    node.hash = h >>> 0;\n    return node.hash;\n  }\n\n  private updateNode(node: MerkleNode, key: string, itemHash: number, pathHash: string, level: number): number {\n    // Leaf Node Logic\n    if (level >= this.depth) {\n      if (!node.entries) node.entries = new Map();\n      node.entries.set(key, itemHash);\n      \n      // Recalculate leaf hash (Sum of item hashes)\n      let h = 0;\n      for (const val of node.entries.values()) {\n        h = (h + val) | 0;\n      }\n      node.hash = h >>> 0;\n      return node.hash;\n    }\n\n    // Intermediate Node Logic\n    const bucketChar = pathHash[level];\n    if (!node.children) node.children = {};\n    \n    if (!node.children[bucketChar]) {\n      node.children[bucketChar] = { hash: 0 };\n    }\n    \n    this.updateNode(node.children[bucketChar], key, itemHash, pathHash, level + 1);\n    \n    // Recalculate this node's hash from children\n    let h = 0;\n    for (const child of Object.values(node.children)) {\n      h = (h + child.hash) | 0;\n    }\n    node.hash = h >>> 0;\n    return node.hash;\n  }\n\n  public getRootHash(): number {\n    return this.root.hash;\n  }\n\n  public getNode(path: string): MerkleNode | undefined {\n    let current = this.root;\n    for (const char of path) {\n      if (!current.children || !current.children[char]) {\n        return undefined;\n      }\n      current = current.children[char];\n    }\n    return current;\n  }\n\n  /**\n   * Returns the hashes of the children at the given path.\n   * Used by the client/server to compare buckets.\n   */\n  public getBuckets(path: string): Record<string, number> {\n    const node = this.getNode(path);\n    if (!node || !node.children) return {};\n    \n    const result: Record<string, number> = {};\n    for (const [key, child] of Object.entries(node.children)) {\n      result[key] = child.hash;\n    }\n    return result;\n  }\n\n  /**\n   * For a leaf node (bucket), returns the actual keys it contains.\n   * Used to request specific keys when a bucket differs.\n   */\n  public getKeysInBucket(path: string): string[] {\n    const node = this.getNode(path);\n    if (!node || !node.entries) return [];\n    return Array.from(node.entries.keys());\n  }\n}\n","import { HLC, Timestamp } from './HLC';\nimport { MerkleTree } from './MerkleTree';\n\n/**\n * A record in the LWW-Map.\n * Can represent a value or a deletion (tombstone).\n */\nexport interface LWWRecord<V> {\n  value: V | null;\n  timestamp: Timestamp;\n  ttlMs?: number;\n}\n\n/**\n * Last-Write-Wins Map Implementation.\n * This structure guarantees convergence by always keeping the entry with the highest timestamp.\n */\nexport class LWWMap<K, V> {\n  private data: Map<K, LWWRecord<V>>;\n  private readonly hlc: HLC;\n  private listeners: Array<() => void> = [];\n  private merkleTree: MerkleTree;\n\n  constructor(hlc: HLC) {\n    this.hlc = hlc;\n    this.data = new Map();\n    this.merkleTree = new MerkleTree();\n  }\n\n  public onChange(callback: () => void): () => void {\n    this.listeners.push(callback);\n    return () => {\n      this.listeners = this.listeners.filter(cb => cb !== callback);\n    };\n  }\n\n  private notify(): void {\n    this.listeners.forEach(cb => cb());\n  }\n\n  public getMerkleTree(): MerkleTree {\n    return this.merkleTree;\n  }\n\n  public get size(): number {\n    return this.data.size;\n  }\n\n  /**\n   * Sets a value for a key.\n   * Generates a new timestamp using the local HLC.\n   */\n  public set(key: K, value: V, ttlMs?: number): LWWRecord<V> {\n    const timestamp = this.hlc.now();\n    const record: LWWRecord<V> = { value, timestamp };\n    \n    if (ttlMs !== undefined) {\n      if (typeof ttlMs !== 'number' || ttlMs <= 0 || !Number.isFinite(ttlMs)) {\n        // We could throw, but to be resilient we might just ignore invalid TTL or log warning.\n        // Given this is core lib, throwing is safer to alert dev.\n        throw new Error('TTL must be a positive finite number');\n      }\n      record.ttlMs = ttlMs;\n    }\n    \n    // We assume K is string for MerkleTree compatibility in this system\n    // If K is not string, we might need to stringify it.\n    // The project seems to use string keys for maps.\n    this.data.set(key, record);\n    this.merkleTree.update(String(key), record);\n    \n    this.notify();\n    return record;\n  }\n\n  /**\n   * Retrieves the value for a key.\n   * Returns undefined if key doesn't exist, is a tombstone, or is expired.\n   */\n  public get(key: K): V | undefined {\n    const record = this.data.get(key);\n    if (!record || record.value === null) {\n      return undefined;\n    }\n\n    // Check for expiration\n    if (record.ttlMs) {\n      const now = Date.now();\n      if (record.timestamp.millis + record.ttlMs < now) {\n        return undefined;\n      }\n    }\n\n    return record.value;\n  }\n\n  /**\n   * Returns the full record (including timestamp).\n   * Useful for synchronization.\n   */\n  public getRecord(key: K): LWWRecord<V> | undefined {\n    return this.data.get(key);\n  }\n\n  /**\n   * Removes a key (creates a tombstone).\n   */\n  public remove(key: K): LWWRecord<V> {\n    const timestamp = this.hlc.now();\n    const tombstone: LWWRecord<V> = { value: null, timestamp };\n    \n    this.data.set(key, tombstone);\n    this.merkleTree.update(String(key), tombstone);\n    \n    this.notify();\n    return tombstone;\n  }\n\n  /**\n   * Merges a record from a remote source.\n   * Returns true if the local state was updated.\n   */\n  public merge(key: K, remoteRecord: LWWRecord<V>): boolean {\n    // Update our clock to ensure causality for future events\n    this.hlc.update(remoteRecord.timestamp);\n\n    const localRecord = this.data.get(key);\n\n    // LWW Logic:\n    // 1. If no local record, accept remote.\n    // 2. If remote is strictly greater than local, accept remote.\n    // 3. If equal, we can arbitrarily choose (e.g. by NodeID) to ensure convergence, \n    //    but HLC.compare handles nodeId tie-breaking already.\n    \n    if (!localRecord || HLC.compare(remoteRecord.timestamp, localRecord.timestamp) > 0) {\n      this.data.set(key, remoteRecord);\n      this.merkleTree.update(String(key), remoteRecord);\n      \n      this.notify();\n      return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Garbage Collection: Prunes tombstones older than the specified timestamp.\n   * Only removes records that are tombstones (deleted) AND older than the threshold.\n   * \n   * @param olderThan The timestamp threshold. Tombstones older than this will be removed.\n   * @returns The number of tombstones removed.\n   */\n  public prune(olderThan: Timestamp): K[] {\n    const removedKeys: K[] = [];\n    \n    for (const [key, record] of this.data.entries()) {\n      // Only prune tombstones (value === null)\n      if (record.value === null) {\n        // Check if timestamp is strictly older than the threshold\n        // HLC.compare(a, b) returns < 0 if a < b\n        if (HLC.compare(record.timestamp, olderThan) < 0) {\n          this.data.delete(key);\n          this.merkleTree.remove(String(key));\n          removedKeys.push(key);\n        }\n      }\n    }\n\n    if (removedKeys.length > 0) {\n      this.notify();\n    }\n\n    return removedKeys;\n  }\n\n  /**\n   * Clears all data and tombstones.\n   * Resets the MerkleTree.\n   */\n  public clear(): void {\n    this.data.clear();\n    this.merkleTree = new MerkleTree();\n    this.notify();\n  }\n\n  /**\n   * Returns an iterator over all non-deleted entries.\n   */\n  public entries(): IterableIterator<[K, V]> {\n    const iterator = this.data.entries();\n    const now = Date.now();\n    \n    return {\n      [Symbol.iterator]() { return this; },\n      next: () => {\n        let result = iterator.next();\n        while (!result.done) {\n          const [key, record] = result.value;\n          if (record.value !== null) {\n            // Check TTL\n            if (record.ttlMs && record.timestamp.millis + record.ttlMs < now) {\n                result = iterator.next();\n                continue;\n            }\n            return { value: [key, record.value], done: false };\n          }\n          result = iterator.next();\n        }\n        return { value: undefined, done: true };\n      }\n    };\n  }\n\n  /**\n   * Returns all keys (including tombstones).\n   */\n  public allKeys(): IterableIterator<K> {\n    return this.data.keys();\n  }\n}\n","import { HLC, Timestamp } from './HLC';\n\n/**\n * A record in the OR-Map (Observed-Remove Map).\n * Represents a single value instance with a unique tag.\n */\nexport interface ORMapRecord<V> {\n  value: V;\n  timestamp: Timestamp;\n  tag: string; // Unique identifier (UUID + Timestamp)\n  ttlMs?: number;\n}\n\n/**\n * OR-Map (Observed-Remove Map) Implementation.\n * \n * Acts as a Multimap where each Key holds a Set of Values.\n * Supports concurrent additions to the same key without data loss.\n * \n * Logic:\n * - Add(K, V): Generates a unique tag. Stores (V, tag) under K.\n * - Remove(K, V): Finds all *currently observed* tags for V under K, and moves them to a Remove Set (Tombstones).\n * - Merge: Union of items minus Union of tombstones.\n */\nexport class ORMap<K, V> {\n  // Key -> Map<Tag, Record>\n  // Stores active records.\n  private items: Map<K, Map<string, ORMapRecord<V>>>;\n\n  // Set of removed tags (Tombstones).\n  private tombstones: Set<string>;\n\n  // Set of expired tags (Local only cache for fast filtering)\n  // Note: We don't persist this directly, but rely on filtering. \n  // For now, we will just filter on get()\n\n  private readonly hlc: HLC;\n\n  constructor(hlc: HLC) {\n    this.hlc = hlc;\n    this.items = new Map();\n    this.tombstones = new Set();\n  }\n\n  private listeners: Array<() => void> = [];\n\n  public onChange(callback: () => void): () => void {\n    this.listeners.push(callback);\n    return () => {\n      this.listeners = this.listeners.filter(cb => cb !== callback);\n    };\n  }\n\n  private notify(): void {\n    this.listeners.forEach(cb => cb());\n  }\n\n  public get size(): number {\n    return this.items.size;\n  }\n\n  public get totalRecords(): number {\n    let count = 0;\n    for (const keyMap of this.items.values()) {\n      count += keyMap.size;\n    }\n    return count;\n  }\n\n  /**\n   * Adds a value to the set associated with the key.\n   * Generates a unique tag for this specific addition.\n   */\n  public add(key: K, value: V, ttlMs?: number): ORMapRecord<V> {\n    const timestamp = this.hlc.now();\n    // Tag must be unique globally. HLC.toString() provides unique string per node+time.\n    const tag = HLC.toString(timestamp);\n\n    const record: ORMapRecord<V> = {\n      value,\n      timestamp,\n      tag\n    };\n\n    if (ttlMs !== undefined) {\n      if (typeof ttlMs !== 'number' || ttlMs <= 0 || !Number.isFinite(ttlMs)) {\n        throw new Error('TTL must be a positive finite number');\n      }\n      record.ttlMs = ttlMs;\n    }\n\n    let keyMap = this.items.get(key);\n    if (!keyMap) {\n      keyMap = new Map();\n      this.items.set(key, keyMap);\n    }\n\n    keyMap.set(tag, record);\n    this.notify();\n    return record;\n  }\n\n  /**\n   * Removes a specific value from the set associated with the key.\n   * Marks all *currently observed* instances of this value as removed (tombstones).\n   * Returns the list of tags that were removed (useful for sync).\n   */\n  public remove(key: K, value: V): string[] {\n    const keyMap = this.items.get(key);\n    if (!keyMap) return [];\n\n    // Find all tags for this value\n    const tagsToRemove: string[] = [];\n\n    for (const [tag, record] of keyMap.entries()) {\n      // Using strict equality. For objects, this requires the exact instance.\n      if (record.value === value) {\n        tagsToRemove.push(tag);\n      }\n    }\n\n    for (const tag of tagsToRemove) {\n      this.tombstones.add(tag);\n      keyMap.delete(tag);\n    }\n\n    if (keyMap.size === 0) {\n      this.items.delete(key);\n    }\n\n    this.notify();\n    return tagsToRemove;\n  }\n\n  /**\n   * Clears all data and tombstones.\n   */\n  public clear(): void {\n    this.items.clear();\n    this.tombstones.clear();\n    this.notify();\n  }\n\n  /**\n   * Returns all active values for a key.\n   * Filters out expired records.\n   */\n  public get(key: K): V[] {\n    const keyMap = this.items.get(key);\n    if (!keyMap) return [];\n\n    const values: V[] = [];\n    const now = Date.now();\n\n    for (const [tag, record] of keyMap.entries()) {\n      if (!this.tombstones.has(tag)) {\n        // Check expiration\n        if (record.ttlMs && record.timestamp.millis + record.ttlMs < now) {\n          continue;\n        }\n        values.push(record.value);\n      }\n    }\n    return values;\n  }\n\n  /**\n   * Returns all active records for a key.\n   * Useful for persistence and sync.\n   * Filters out expired records.\n   */\n  public getRecords(key: K): ORMapRecord<V>[] {\n    const keyMap = this.items.get(key);\n    if (!keyMap) return [];\n\n    const records: ORMapRecord<V>[] = [];\n    const now = Date.now();\n\n    for (const [tag, record] of keyMap.entries()) {\n      if (!this.tombstones.has(tag)) {\n        // Check expiration\n        if (record.ttlMs && record.timestamp.millis + record.ttlMs < now) {\n          continue;\n        }\n        records.push(record);\n      }\n    }\n    return records;\n  }\n\n  /**\n   * Returns all tombstone tags.\n   */\n  public getTombstones(): string[] {\n    return Array.from(this.tombstones);\n  }\n\n  /**\n   * Applies a record from a remote source (Sync).\n   */\n  public apply(key: K, record: ORMapRecord<V>): void {\n    if (this.tombstones.has(record.tag)) return;\n\n    let keyMap = this.items.get(key);\n    if (!keyMap) {\n      keyMap = new Map();\n      this.items.set(key, keyMap);\n    }\n    keyMap.set(record.tag, record);\n    this.hlc.update(record.timestamp);\n    this.notify();\n  }\n\n  /**\n   * Applies a tombstone (deletion) from a remote source.\n   */\n  public applyTombstone(tag: string): void {\n    this.tombstones.add(tag);\n    // Cleanup active items if present\n    for (const [key, keyMap] of this.items) {\n      if (keyMap.has(tag)) {\n        keyMap.delete(tag);\n        if (keyMap.size === 0) this.items.delete(key);\n        // We found it, so we can stop searching (tag is unique globally)\n        break;\n      }\n    }\n    this.notify();\n  }\n\n  /**\n   * Merges state from another ORMap.\n   * - Adds all new tombstones from 'other'.\n   * - Adds all new items from 'other' that are not in tombstones.\n   * - Updates HLC with observed timestamps.\n   */\n  public merge(other: ORMap<K, V>): void {\n    // 1. Merge tombstones\n    for (const tag of other.tombstones) {\n      this.tombstones.add(tag);\n    }\n\n    // 2. Merge items\n    for (const [key, otherKeyMap] of other.items) {\n      let localKeyMap = this.items.get(key);\n      if (!localKeyMap) {\n        localKeyMap = new Map();\n        this.items.set(key, localKeyMap);\n      }\n\n      for (const [tag, record] of otherKeyMap) {\n        // Only accept if not deleted\n        if (!this.tombstones.has(tag)) {\n          if (!localKeyMap.has(tag)) {\n            localKeyMap.set(tag, record);\n          }\n          // Always update causality\n          this.hlc.update(record.timestamp);\n        }\n      }\n    }\n\n    // 3. Cleanup: Remove any local items that are now in the merged tombstones\n    for (const [key, localKeyMap] of this.items) {\n      for (const tag of localKeyMap.keys()) {\n        if (this.tombstones.has(tag)) {\n          localKeyMap.delete(tag);\n        }\n      }\n      if (localKeyMap.size === 0) {\n        this.items.delete(key);\n      }\n    }\n    this.notify();\n  }\n\n  /**\n   * Garbage Collection: Prunes tombstones older than the specified timestamp.\n   */\n  public prune(olderThan: Timestamp): string[] {\n    const removedTags: string[] = [];\n\n    for (const tag of this.tombstones) {\n      try {\n        const timestamp = HLC.parse(tag);\n        if (HLC.compare(timestamp, olderThan) < 0) {\n          this.tombstones.delete(tag);\n          removedTags.push(tag);\n        }\n      } catch (e) {\n        // Ignore invalid tags\n      }\n    }\n\n    return removedTags;\n  }\n}\n","import { encode, decode } from '@msgpack/msgpack';\n\n/**\n * Serializes a JavaScript object to MessagePack binary format.\n * @param data The data to serialize.\n * @returns A Uint8Array containing the serialized data.\n */\nexport function serialize(data: unknown): Uint8Array {\n  return encode(data);\n}\n\n/**\n * Deserializes MessagePack binary data to a JavaScript object.\n * @param data The binary data to deserialize (Uint8Array or ArrayBuffer).\n * @returns The deserialized object.\n */\nexport function deserialize<T = unknown>(data: Uint8Array | ArrayBuffer): T {\n  // @msgpack/msgpack decode accepts Uint8Array, ArrayBuffer, etc.\n  return decode(data) as T;\n}\n\n","\nexport type PredicateOp = \n  | 'eq' | 'neq' \n  | 'gt' | 'gte' \n  | 'lt' | 'lte' \n  | 'like' | 'regex' \n  | 'and' | 'or' | 'not';\n\nexport interface PredicateNode {\n  op: PredicateOp;\n  attribute?: string;\n  value?: any;\n  children?: PredicateNode[];\n}\n\nexport class Predicates {\n  static equal(attribute: string, value: any): PredicateNode { \n    return { op: 'eq', attribute, value }; \n  }\n  \n  static notEqual(attribute: string, value: any): PredicateNode { \n    return { op: 'neq', attribute, value }; \n  }\n  \n  static greaterThan(attribute: string, value: any): PredicateNode { \n    return { op: 'gt', attribute, value }; \n  }\n  \n  static greaterThanOrEqual(attribute: string, value: any): PredicateNode { \n    return { op: 'gte', attribute, value }; \n  }\n  \n  static lessThan(attribute: string, value: any): PredicateNode { \n    return { op: 'lt', attribute, value }; \n  }\n  \n  static lessThanOrEqual(attribute: string, value: any): PredicateNode { \n    return { op: 'lte', attribute, value }; \n  }\n  \n  static like(attribute: string, pattern: string): PredicateNode { \n    return { op: 'like', attribute, value: pattern }; \n  }\n  \n  static regex(attribute: string, pattern: string): PredicateNode { \n    return { op: 'regex', attribute, value: pattern }; \n  }\n\n  static between(attribute: string, from: any, to: any): PredicateNode {\n    return {\n      op: 'and',\n      children: [\n        { op: 'gte', attribute, value: from },\n        { op: 'lte', attribute, value: to }\n      ]\n    };\n  }\n\n  static and(...predicates: PredicateNode[]): PredicateNode { \n    return { op: 'and', children: predicates }; \n  }\n  \n  static or(...predicates: PredicateNode[]): PredicateNode { \n    return { op: 'or', children: predicates }; \n  }\n  \n  static not(predicate: PredicateNode): PredicateNode { \n    return { op: 'not', children: [predicate] }; \n  }\n}\n\nexport function evaluatePredicate(predicate: PredicateNode, data: any): boolean {\n  if (!data) return false;\n  \n  switch (predicate.op) {\n    case 'and':\n      return (predicate.children || []).every(p => evaluatePredicate(p, data));\n    case 'or':\n      return (predicate.children || []).some(p => evaluatePredicate(p, data));\n    case 'not': {\n      const child = (predicate.children || [])[0];\n      if (!child) return true; // NOT of nothing is true (vacuous)\n      return !evaluatePredicate(child, data);\n    }\n  }\n\n  // Leaf nodes require an attribute\n  if (!predicate.attribute) return false;\n  \n  const value = data[predicate.attribute];\n  const target = predicate.value;\n\n  switch (predicate.op) {\n    case 'eq':\n      return value === target;\n    case 'neq':\n      return value !== target;\n    case 'gt':\n      return value > target;\n    case 'gte':\n      return value >= target;\n    case 'lt':\n      return value < target;\n    case 'lte':\n      return value <= target;\n    case 'like':\n      if (typeof value !== 'string' || typeof target !== 'string') return false;\n      const pattern = target\n        .replace(/[.+^${}()|[\\]\\\\]/g, '\\\\$&')\n        .replace(/%/g, '.*')\n        .replace(/_/g, '.');\n      return new RegExp(`^${pattern}$`, 'i').test(value);\n    case 'regex':\n      if (typeof value !== 'string' || typeof target !== 'string') return false;\n      return new RegExp(target).test(value);\n    default:\n      return false;\n  }\n}\n","import { z } from 'zod';\n\n// --- Basic Types ---\n\nexport const TimestampSchema = z.object({\n  millis: z.number(),\n  counter: z.number(),\n  nodeId: z.string(),\n});\n\nexport const LWWRecordSchema = z.object({\n  value: z.any().nullable(),\n  timestamp: TimestampSchema,\n  ttlMs: z.number().optional(),\n});\n\nexport const ORMapRecordSchema = z.object({\n  value: z.any(),\n  timestamp: TimestampSchema,\n  tag: z.string(),\n  ttlMs: z.number().optional(),\n});\n\n// --- Predicate Types ---\n\nexport const PredicateOpSchema = z.enum([\n  'eq', 'neq', 'gt', 'gte', 'lt', 'lte', 'like', 'regex', 'and', 'or', 'not'\n]);\n\n// Recursive schema for PredicateNode\nexport const PredicateNodeSchema: z.ZodType<any> = z.lazy(() => z.object({\n  op: PredicateOpSchema,\n  attribute: z.string().optional(),\n  value: z.any().optional(),\n  children: z.array(PredicateNodeSchema).optional(),\n}));\n\n// --- Query Types ---\n\nexport const QuerySchema = z.object({\n  where: z.record(z.string(), z.any()).optional(),\n  predicate: PredicateNodeSchema.optional(),\n  sort: z.record(z.string(), z.enum(['asc', 'desc'])).optional(),\n  limit: z.number().optional(),\n  offset: z.number().optional(),\n});\n\n// --- Client Operation Types ---\n\nexport const ClientOpSchema = z.object({\n  id: z.string().optional(),\n  mapName: z.string(),\n  key: z.string(),\n  // Permissive opType to match ServerCoordinator behavior logic\n  // It can be 'REMOVE', 'OR_ADD', 'OR_REMOVE' or undefined/other (implies PUT/LWW)\n  opType: z.string().optional(), \n  record: LWWRecordSchema.nullable().optional(),\n  orRecord: ORMapRecordSchema.nullable().optional(),\n  orTag: z.string().nullable().optional(),\n});\n\n// --- Message Schemas ---\n\nexport const AuthMessageSchema = z.object({\n  type: z.literal('AUTH'),\n  token: z.string(),\n});\n\nexport const QuerySubMessageSchema = z.object({\n  type: z.literal('QUERY_SUB'),\n  payload: z.object({\n    queryId: z.string(),\n    mapName: z.string(),\n    query: QuerySchema,\n  }),\n});\n\nexport const QueryUnsubMessageSchema = z.object({\n  type: z.literal('QUERY_UNSUB'),\n  payload: z.object({\n    queryId: z.string(),\n  }),\n});\n\nexport const ClientOpMessageSchema = z.object({\n  type: z.literal('CLIENT_OP'),\n  payload: ClientOpSchema,\n});\n\nexport const OpBatchMessageSchema = z.object({\n  type: z.literal('OP_BATCH'),\n  payload: z.object({\n    ops: z.array(ClientOpSchema),\n  }),\n});\n\nexport const SyncInitMessageSchema = z.object({\n  type: z.literal('SYNC_INIT'),\n  mapName: z.string(),\n  lastSyncTimestamp: z.number().optional(),\n});\n\nexport const SyncRespRootMessageSchema = z.object({\n  type: z.literal('SYNC_RESP_ROOT'),\n  payload: z.object({\n    mapName: z.string(),\n    rootHash: z.number(),\n    timestamp: TimestampSchema,\n  }),\n});\n\nexport const SyncRespBucketsMessageSchema = z.object({\n  type: z.literal('SYNC_RESP_BUCKETS'),\n  payload: z.object({\n    mapName: z.string(),\n    path: z.string(),\n    buckets: z.record(z.string(), z.number()),\n  }),\n});\n\nexport const SyncRespLeafMessageSchema = z.object({\n  type: z.literal('SYNC_RESP_LEAF'),\n  payload: z.object({\n    mapName: z.string(),\n    path: z.string(),\n    records: z.array(z.object({\n      key: z.string(),\n      record: LWWRecordSchema,\n    })),\n  }),\n});\n\nexport const MerkleReqBucketMessageSchema = z.object({\n  type: z.literal('MERKLE_REQ_BUCKET'),\n  payload: z.object({\n    mapName: z.string(),\n    path: z.string(),\n  }),\n});\n\nexport const LockRequestSchema = z.object({\n  type: z.literal('LOCK_REQUEST'),\n  payload: z.object({\n    requestId: z.string(),\n    name: z.string(),\n    ttl: z.number().optional(),\n  }),\n});\n\nexport const LockReleaseSchema = z.object({\n  type: z.literal('LOCK_RELEASE'),\n  payload: z.object({\n    requestId: z.string().optional(),\n    name: z.string(),\n    fencingToken: z.number(),\n  }),\n});\n\n// --- Topic Messages ---\n\nexport const TopicSubSchema = z.object({\n  type: z.literal('TOPIC_SUB'),\n  payload: z.object({\n    topic: z.string(),\n  }),\n});\n\nexport const TopicUnsubSchema = z.object({\n  type: z.literal('TOPIC_UNSUB'),\n  payload: z.object({\n    topic: z.string(),\n  }),\n});\n\nexport const TopicPubSchema = z.object({\n  type: z.literal('TOPIC_PUB'),\n  payload: z.object({\n    topic: z.string(),\n    data: z.any(),\n  }),\n});\n\nexport const TopicMessageEventSchema = z.object({\n  type: z.literal('TOPIC_MESSAGE'),\n  payload: z.object({\n    topic: z.string(),\n    data: z.any(),\n    publisherId: z.string().optional(),\n    timestamp: z.number(),\n  }),\n});\n\n// --- Union Schema ---\n\nexport const MessageSchema = z.discriminatedUnion('type', [\n  AuthMessageSchema,\n  QuerySubMessageSchema,\n  QueryUnsubMessageSchema,\n  ClientOpMessageSchema,\n  OpBatchMessageSchema,\n  SyncInitMessageSchema,\n  SyncRespRootMessageSchema,\n  SyncRespBucketsMessageSchema,\n  SyncRespLeafMessageSchema,\n  MerkleReqBucketMessageSchema,\n  LockRequestSchema,\n  LockReleaseSchema,\n  TopicSubSchema,\n  TopicUnsubSchema,\n  TopicPubSchema,\n]);\n\n// --- Type Inference ---\n\nexport type Timestamp = z.infer<typeof TimestampSchema>;\nexport type LWWRecord<V = any> = z.infer<typeof LWWRecordSchema>; // Generic placeholder\nexport type ORMapRecord<V = any> = z.infer<typeof ORMapRecordSchema>; // Generic placeholder\n// export type PredicateNode = z.infer<typeof PredicateNodeSchema>; // Conflict with predicate.ts\nexport type Query = z.infer<typeof QuerySchema>;\nexport type ClientOp = z.infer<typeof ClientOpSchema>;\nexport type Message = z.infer<typeof MessageSchema>;\n\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACMO,IAAM,OAAN,MAAM,KAAI;AAAA,EAQf,YAAY,QAAgB;AAC1B,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,IAAW,YAAoB;AAC7B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,MAAiB;AACtB,UAAM,aAAa,KAAK,IAAI;AAG5B,QAAI,aAAa,KAAK,YAAY;AAChC,WAAK,aAAa;AAClB,WAAK,cAAc;AAAA,IACrB,OAAO;AAEL,WAAK;AAAA,IACP;AAEA,WAAO;AAAA,MACL,QAAQ,KAAK;AAAA,MACb,SAAS,KAAK;AAAA,MACd,QAAQ,KAAK;AAAA,IACf;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,OAAO,QAAyB;AACrC,UAAM,aAAa,KAAK,IAAI;AAG5B,QAAI,OAAO,SAAS,aAAa,KAAI,WAAW;AAC9C,cAAQ,KAAK,qCAAqC,OAAO,MAAM,0BAA0B,UAAU,EAAE;AAAA,IAEvG;AAEA,UAAM,YAAY,KAAK,IAAI,KAAK,YAAY,YAAY,OAAO,MAAM;AAErE,QAAI,cAAc,KAAK,cAAc,cAAc,OAAO,QAAQ;AAEhE,WAAK,cAAc,KAAK,IAAI,KAAK,aAAa,OAAO,OAAO,IAAI;AAAA,IAClE,WAAW,cAAc,KAAK,YAAY;AAExC,WAAK;AAAA,IACP,WAAW,cAAc,OAAO,QAAQ;AAEtC,WAAK,cAAc,OAAO,UAAU;AAAA,IACtC,OAAO;AAEL,WAAK,cAAc;AAAA,IACrB;AAEA,SAAK,aAAa;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAc,QAAQ,GAAc,GAAsB;AACxD,QAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,aAAO,EAAE,SAAS,EAAE;AAAA,IACtB;AACA,QAAI,EAAE,YAAY,EAAE,SAAS;AAC3B,aAAO,EAAE,UAAU,EAAE;AAAA,IACvB;AACA,WAAO,EAAE,OAAO,cAAc,EAAE,MAAM;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAc,SAAS,IAAuB;AAC5C,WAAO,GAAG,GAAG,MAAM,IAAI,GAAG,OAAO,IAAI,GAAG,MAAM;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAc,MAAM,KAAwB;AAC1C,UAAM,QAAQ,IAAI,MAAM,GAAG;AAC3B,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,MAAM,6BAA6B,GAAG,EAAE;AAAA,IACpD;AACA,WAAO;AAAA,MACL,QAAQ,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC7B,SAAS,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC9B,QAAQ,MAAM,CAAC;AAAA,IACjB;AAAA,EACF;AACF;AAAA;AA7Ga,KAMa,YAAY;AAN/B,IAAM,MAAN;;;ACDA,SAAS,WAAW,KAAqB;AAC9C,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAQ,IAAI,WAAW,CAAC;AACxB,WAAO,KAAK,KAAK,MAAM,QAAU;AAAA,EACnC;AACA,SAAO,SAAS;AAClB;AAUO,SAAS,cAAc,QAA0B;AACtD,MAAI,SAAS;AACb,aAAW,KAAK,QAAQ;AACtB,aAAU,SAAS,IAAK;AAAA,EAC1B;AACA,SAAO,WAAW;AACpB;;;ACTO,IAAM,aAAN,MAAiB;AAAA,EAItB,YAAY,UAAuC,oBAAI,IAAI,GAAG,QAAgB,GAAG;AAC/E,SAAK,QAAQ;AACb,SAAK,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC,EAAE;AAEpC,eAAW,CAAC,KAAK,MAAM,KAAK,SAAS;AACjC,WAAK,OAAO,KAAK,MAAM;AAAA,IAC3B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,OAAO,KAAa,QAAwB;AACjD,UAAM,WAAW,WAAW,GAAG,GAAG,IAAI,OAAO,UAAU,MAAM,IAAI,OAAO,UAAU,OAAO,IAAI,OAAO,UAAU,MAAM,EAAE;AAGtH,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAE7D,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,UAAU,CAAC;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,OAAO,KAAa;AACzB,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC7D,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,EAC7C;AAAA,EAEQ,WAAW,MAAkB,KAAa,UAAkB,OAAuB;AAEzF,QAAI,SAAS,KAAK,OAAO;AACvB,UAAI,KAAK,SAAS;AAChB,aAAK,QAAQ,OAAO,GAAG;AAGvB,YAAIA,KAAI;AACR,mBAAW,OAAO,KAAK,QAAQ,OAAO,GAAG;AACvC,UAAAA,KAAKA,KAAI,MAAO;AAAA,QAClB;AACA,aAAK,OAAOA,OAAM;AAAA,MACpB;AACA,aAAO,KAAK;AAAA,IACd;AAGA,UAAM,aAAa,SAAS,KAAK;AACjC,QAAI,KAAK,YAAY,KAAK,SAAS,UAAU,GAAG;AAC9C,YAAM,YAAY,KAAK,WAAW,KAAK,SAAS,UAAU,GAAG,KAAK,UAAU,QAAQ,CAAC;AAAA,IAGvF;AAGA,QAAI,IAAI;AACR,QAAI,KAAK,UAAU;AACjB,iBAAW,SAAS,OAAO,OAAO,KAAK,QAAQ,GAAG;AAChD,YAAK,IAAI,MAAM,OAAQ;AAAA,MACzB;AAAA,IACF;AACA,SAAK,OAAO,MAAM;AAClB,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,WAAW,MAAkB,KAAa,UAAkB,UAAkB,OAAuB;AAE3G,QAAI,SAAS,KAAK,OAAO;AACvB,UAAI,CAAC,KAAK,QAAS,MAAK,UAAU,oBAAI,IAAI;AAC1C,WAAK,QAAQ,IAAI,KAAK,QAAQ;AAG9B,UAAIA,KAAI;AACR,iBAAW,OAAO,KAAK,QAAQ,OAAO,GAAG;AACvC,QAAAA,KAAKA,KAAI,MAAO;AAAA,MAClB;AACA,WAAK,OAAOA,OAAM;AAClB,aAAO,KAAK;AAAA,IACd;AAGA,UAAM,aAAa,SAAS,KAAK;AACjC,QAAI,CAAC,KAAK,SAAU,MAAK,WAAW,CAAC;AAErC,QAAI,CAAC,KAAK,SAAS,UAAU,GAAG;AAC9B,WAAK,SAAS,UAAU,IAAI,EAAE,MAAM,EAAE;AAAA,IACxC;AAEA,SAAK,WAAW,KAAK,SAAS,UAAU,GAAG,KAAK,UAAU,UAAU,QAAQ,CAAC;AAG7E,QAAI,IAAI;AACR,eAAW,SAAS,OAAO,OAAO,KAAK,QAAQ,GAAG;AAChD,UAAK,IAAI,MAAM,OAAQ;AAAA,IACzB;AACA,SAAK,OAAO,MAAM;AAClB,WAAO,KAAK;AAAA,EACd;AAAA,EAEO,cAAsB;AAC3B,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEO,QAAQ,MAAsC;AACnD,QAAI,UAAU,KAAK;AACnB,eAAW,QAAQ,MAAM;AACvB,UAAI,CAAC,QAAQ,YAAY,CAAC,QAAQ,SAAS,IAAI,GAAG;AAChD,eAAO;AAAA,MACT;AACA,gBAAU,QAAQ,SAAS,IAAI;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,WAAW,MAAsC;AACtD,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,CAAC,KAAK,SAAU,QAAO,CAAC;AAErC,UAAM,SAAiC,CAAC;AACxC,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,QAAQ,GAAG;AACxD,aAAO,GAAG,IAAI,MAAM;AAAA,IACtB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,gBAAgB,MAAwB;AAC7C,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,CAAC,KAAK,QAAS,QAAO,CAAC;AACpC,WAAO,MAAM,KAAK,KAAK,QAAQ,KAAK,CAAC;AAAA,EACvC;AACF;;;AClJO,IAAM,SAAN,MAAmB;AAAA,EAMxB,YAAY,KAAU;AAHtB,SAAQ,YAA+B,CAAC;AAItC,SAAK,MAAM;AACX,SAAK,OAAO,oBAAI,IAAI;AACpB,SAAK,aAAa,IAAI,WAAW;AAAA,EACnC;AAAA,EAEO,SAAS,UAAkC;AAChD,SAAK,UAAU,KAAK,QAAQ;AAC5B,WAAO,MAAM;AACX,WAAK,YAAY,KAAK,UAAU,OAAO,QAAM,OAAO,QAAQ;AAAA,IAC9D;AAAA,EACF;AAAA,EAEQ,SAAe;AACrB,SAAK,UAAU,QAAQ,QAAM,GAAG,CAAC;AAAA,EACnC;AAAA,EAEO,gBAA4B;AACjC,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAW,OAAe;AACxB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,IAAI,KAAQ,OAAU,OAA8B;AACzD,UAAM,YAAY,KAAK,IAAI,IAAI;AAC/B,UAAM,SAAuB,EAAE,OAAO,UAAU;AAEhD,QAAI,UAAU,QAAW;AACvB,UAAI,OAAO,UAAU,YAAY,SAAS,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAGtE,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AACA,aAAO,QAAQ;AAAA,IACjB;AAKA,SAAK,KAAK,IAAI,KAAK,MAAM;AACzB,SAAK,WAAW,OAAO,OAAO,GAAG,GAAG,MAAM;AAE1C,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,IAAI,KAAuB;AAChC,UAAM,SAAS,KAAK,KAAK,IAAI,GAAG;AAChC,QAAI,CAAC,UAAU,OAAO,UAAU,MAAM;AACpC,aAAO;AAAA,IACT;AAGA,QAAI,OAAO,OAAO;AAChB,YAAM,MAAM,KAAK,IAAI;AACrB,UAAI,OAAO,UAAU,SAAS,OAAO,QAAQ,KAAK;AAChD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,OAAO;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,UAAU,KAAkC;AACjD,WAAO,KAAK,KAAK,IAAI,GAAG;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKO,OAAO,KAAsB;AAClC,UAAM,YAAY,KAAK,IAAI,IAAI;AAC/B,UAAM,YAA0B,EAAE,OAAO,MAAM,UAAU;AAEzD,SAAK,KAAK,IAAI,KAAK,SAAS;AAC5B,SAAK,WAAW,OAAO,OAAO,GAAG,GAAG,SAAS;AAE7C,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,MAAM,KAAQ,cAAqC;AAExD,SAAK,IAAI,OAAO,aAAa,SAAS;AAEtC,UAAM,cAAc,KAAK,KAAK,IAAI,GAAG;AAQrC,QAAI,CAAC,eAAe,IAAI,QAAQ,aAAa,WAAW,YAAY,SAAS,IAAI,GAAG;AAClF,WAAK,KAAK,IAAI,KAAK,YAAY;AAC/B,WAAK,WAAW,OAAO,OAAO,GAAG,GAAG,YAAY;AAEhD,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASO,MAAM,WAA2B;AACtC,UAAM,cAAmB,CAAC;AAE1B,eAAW,CAAC,KAAK,MAAM,KAAK,KAAK,KAAK,QAAQ,GAAG;AAE/C,UAAI,OAAO,UAAU,MAAM;AAGzB,YAAI,IAAI,QAAQ,OAAO,WAAW,SAAS,IAAI,GAAG;AAChD,eAAK,KAAK,OAAO,GAAG;AACpB,eAAK,WAAW,OAAO,OAAO,GAAG,CAAC;AAClC,sBAAY,KAAK,GAAG;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,WAAK,OAAO;AAAA,IACd;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,QAAc;AACnB,SAAK,KAAK,MAAM;AAChB,SAAK,aAAa,IAAI,WAAW;AACjC,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,UAAoC;AACzC,UAAM,WAAW,KAAK,KAAK,QAAQ;AACnC,UAAM,MAAM,KAAK,IAAI;AAErB,WAAO;AAAA,MACL,CAAC,OAAO,QAAQ,IAAI;AAAE,eAAO;AAAA,MAAM;AAAA,MACnC,MAAM,MAAM;AACV,YAAI,SAAS,SAAS,KAAK;AAC3B,eAAO,CAAC,OAAO,MAAM;AACnB,gBAAM,CAAC,KAAK,MAAM,IAAI,OAAO;AAC7B,cAAI,OAAO,UAAU,MAAM;AAEzB,gBAAI,OAAO,SAAS,OAAO,UAAU,SAAS,OAAO,QAAQ,KAAK;AAC9D,uBAAS,SAAS,KAAK;AACvB;AAAA,YACJ;AACA,mBAAO,EAAE,OAAO,CAAC,KAAK,OAAO,KAAK,GAAG,MAAM,MAAM;AAAA,UACnD;AACA,mBAAS,SAAS,KAAK;AAAA,QACzB;AACA,eAAO,EAAE,OAAO,QAAW,MAAM,KAAK;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,UAA+B;AACpC,WAAO,KAAK,KAAK,KAAK;AAAA,EACxB;AACF;;;ACnMO,IAAM,QAAN,MAAkB;AAAA,EAcvB,YAAY,KAAU;AAMtB,SAAQ,YAA+B,CAAC;AALtC,SAAK,MAAM;AACX,SAAK,QAAQ,oBAAI,IAAI;AACrB,SAAK,aAAa,oBAAI,IAAI;AAAA,EAC5B;AAAA,EAIO,SAAS,UAAkC;AAChD,SAAK,UAAU,KAAK,QAAQ;AAC5B,WAAO,MAAM;AACX,WAAK,YAAY,KAAK,UAAU,OAAO,QAAM,OAAO,QAAQ;AAAA,IAC9D;AAAA,EACF;AAAA,EAEQ,SAAe;AACrB,SAAK,UAAU,QAAQ,QAAM,GAAG,CAAC;AAAA,EACnC;AAAA,EAEA,IAAW,OAAe;AACxB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,IAAW,eAAuB;AAChC,QAAI,QAAQ;AACZ,eAAW,UAAU,KAAK,MAAM,OAAO,GAAG;AACxC,eAAS,OAAO;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,IAAI,KAAQ,OAAU,OAAgC;AAC3D,UAAM,YAAY,KAAK,IAAI,IAAI;AAE/B,UAAM,MAAM,IAAI,SAAS,SAAS;AAElC,UAAM,SAAyB;AAAA,MAC7B;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,UAAU,QAAW;AACvB,UAAI,OAAO,UAAU,YAAY,SAAS,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AACtE,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AACA,aAAO,QAAQ;AAAA,IACjB;AAEA,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAC/B,QAAI,CAAC,QAAQ;AACX,eAAS,oBAAI,IAAI;AACjB,WAAK,MAAM,IAAI,KAAK,MAAM;AAAA,IAC5B;AAEA,WAAO,IAAI,KAAK,MAAM;AACtB,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,OAAO,KAAQ,OAAoB;AACxC,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AACjC,QAAI,CAAC,OAAQ,QAAO,CAAC;AAGrB,UAAM,eAAyB,CAAC;AAEhC,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,GAAG;AAE5C,UAAI,OAAO,UAAU,OAAO;AAC1B,qBAAa,KAAK,GAAG;AAAA,MACvB;AAAA,IACF;AAEA,eAAW,OAAO,cAAc;AAC9B,WAAK,WAAW,IAAI,GAAG;AACvB,aAAO,OAAO,GAAG;AAAA,IACnB;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,WAAK,MAAM,OAAO,GAAG;AAAA,IACvB;AAEA,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,QAAc;AACnB,SAAK,MAAM,MAAM;AACjB,SAAK,WAAW,MAAM;AACtB,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,IAAI,KAAa;AACtB,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AACjC,QAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,UAAM,SAAc,CAAC;AACrB,UAAM,MAAM,KAAK,IAAI;AAErB,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,GAAG;AAC5C,UAAI,CAAC,KAAK,WAAW,IAAI,GAAG,GAAG;AAE7B,YAAI,OAAO,SAAS,OAAO,UAAU,SAAS,OAAO,QAAQ,KAAK;AAChE;AAAA,QACF;AACA,eAAO,KAAK,OAAO,KAAK;AAAA,MAC1B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,WAAW,KAA0B;AAC1C,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AACjC,QAAI,CAAC,OAAQ,QAAO,CAAC;AAErB,UAAM,UAA4B,CAAC;AACnC,UAAM,MAAM,KAAK,IAAI;AAErB,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,GAAG;AAC5C,UAAI,CAAC,KAAK,WAAW,IAAI,GAAG,GAAG;AAE7B,YAAI,OAAO,SAAS,OAAO,UAAU,SAAS,OAAO,QAAQ,KAAK;AAChE;AAAA,QACF;AACA,gBAAQ,KAAK,MAAM;AAAA,MACrB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,gBAA0B;AAC/B,WAAO,MAAM,KAAK,KAAK,UAAU;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKO,MAAM,KAAQ,QAA8B;AACjD,QAAI,KAAK,WAAW,IAAI,OAAO,GAAG,EAAG;AAErC,QAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAC/B,QAAI,CAAC,QAAQ;AACX,eAAS,oBAAI,IAAI;AACjB,WAAK,MAAM,IAAI,KAAK,MAAM;AAAA,IAC5B;AACA,WAAO,IAAI,OAAO,KAAK,MAAM;AAC7B,SAAK,IAAI,OAAO,OAAO,SAAS;AAChC,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,eAAe,KAAmB;AACvC,SAAK,WAAW,IAAI,GAAG;AAEvB,eAAW,CAAC,KAAK,MAAM,KAAK,KAAK,OAAO;AACtC,UAAI,OAAO,IAAI,GAAG,GAAG;AACnB,eAAO,OAAO,GAAG;AACjB,YAAI,OAAO,SAAS,EAAG,MAAK,MAAM,OAAO,GAAG;AAE5C;AAAA,MACF;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,MAAM,OAA0B;AAErC,eAAW,OAAO,MAAM,YAAY;AAClC,WAAK,WAAW,IAAI,GAAG;AAAA,IACzB;AAGA,eAAW,CAAC,KAAK,WAAW,KAAK,MAAM,OAAO;AAC5C,UAAI,cAAc,KAAK,MAAM,IAAI,GAAG;AACpC,UAAI,CAAC,aAAa;AAChB,sBAAc,oBAAI,IAAI;AACtB,aAAK,MAAM,IAAI,KAAK,WAAW;AAAA,MACjC;AAEA,iBAAW,CAAC,KAAK,MAAM,KAAK,aAAa;AAEvC,YAAI,CAAC,KAAK,WAAW,IAAI,GAAG,GAAG;AAC7B,cAAI,CAAC,YAAY,IAAI,GAAG,GAAG;AACzB,wBAAY,IAAI,KAAK,MAAM;AAAA,UAC7B;AAEA,eAAK,IAAI,OAAO,OAAO,SAAS;AAAA,QAClC;AAAA,MACF;AAAA,IACF;AAGA,eAAW,CAAC,KAAK,WAAW,KAAK,KAAK,OAAO;AAC3C,iBAAW,OAAO,YAAY,KAAK,GAAG;AACpC,YAAI,KAAK,WAAW,IAAI,GAAG,GAAG;AAC5B,sBAAY,OAAO,GAAG;AAAA,QACxB;AAAA,MACF;AACA,UAAI,YAAY,SAAS,GAAG;AAC1B,aAAK,MAAM,OAAO,GAAG;AAAA,MACvB;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,MAAM,WAAgC;AAC3C,UAAM,cAAwB,CAAC;AAE/B,eAAW,OAAO,KAAK,YAAY;AACjC,UAAI;AACF,cAAM,YAAY,IAAI,MAAM,GAAG;AAC/B,YAAI,IAAI,QAAQ,WAAW,SAAS,IAAI,GAAG;AACzC,eAAK,WAAW,OAAO,GAAG;AAC1B,sBAAY,KAAK,GAAG;AAAA,QACtB;AAAA,MACF,SAAS,GAAG;AAAA,MAEZ;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;;;ACxSA,qBAA+B;AAOxB,SAAS,UAAU,MAA2B;AACnD,aAAO,uBAAO,IAAI;AACpB;AAOO,SAAS,YAAyB,MAAmC;AAE1E,aAAO,uBAAO,IAAI;AACpB;;;ACJO,IAAM,aAAN,MAAiB;AAAA,EACtB,OAAO,MAAM,WAAmB,OAA2B;AACzD,WAAO,EAAE,IAAI,MAAM,WAAW,MAAM;AAAA,EACtC;AAAA,EAEA,OAAO,SAAS,WAAmB,OAA2B;AAC5D,WAAO,EAAE,IAAI,OAAO,WAAW,MAAM;AAAA,EACvC;AAAA,EAEA,OAAO,YAAY,WAAmB,OAA2B;AAC/D,WAAO,EAAE,IAAI,MAAM,WAAW,MAAM;AAAA,EACtC;AAAA,EAEA,OAAO,mBAAmB,WAAmB,OAA2B;AACtE,WAAO,EAAE,IAAI,OAAO,WAAW,MAAM;AAAA,EACvC;AAAA,EAEA,OAAO,SAAS,WAAmB,OAA2B;AAC5D,WAAO,EAAE,IAAI,MAAM,WAAW,MAAM;AAAA,EACtC;AAAA,EAEA,OAAO,gBAAgB,WAAmB,OAA2B;AACnE,WAAO,EAAE,IAAI,OAAO,WAAW,MAAM;AAAA,EACvC;AAAA,EAEA,OAAO,KAAK,WAAmB,SAAgC;AAC7D,WAAO,EAAE,IAAI,QAAQ,WAAW,OAAO,QAAQ;AAAA,EACjD;AAAA,EAEA,OAAO,MAAM,WAAmB,SAAgC;AAC9D,WAAO,EAAE,IAAI,SAAS,WAAW,OAAO,QAAQ;AAAA,EAClD;AAAA,EAEA,OAAO,QAAQ,WAAmB,MAAW,IAAwB;AACnE,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,UAAU;AAAA,QACR,EAAE,IAAI,OAAO,WAAW,OAAO,KAAK;AAAA,QACpC,EAAE,IAAI,OAAO,WAAW,OAAO,GAAG;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAAO,OAAO,YAA4C;AACxD,WAAO,EAAE,IAAI,OAAO,UAAU,WAAW;AAAA,EAC3C;AAAA,EAEA,OAAO,MAAM,YAA4C;AACvD,WAAO,EAAE,IAAI,MAAM,UAAU,WAAW;AAAA,EAC1C;AAAA,EAEA,OAAO,IAAI,WAAyC;AAClD,WAAO,EAAE,IAAI,OAAO,UAAU,CAAC,SAAS,EAAE;AAAA,EAC5C;AACF;AAEO,SAAS,kBAAkB,WAA0B,MAAoB;AAC9E,MAAI,CAAC,KAAM,QAAO;AAElB,UAAQ,UAAU,IAAI;AAAA,IACpB,KAAK;AACH,cAAQ,UAAU,YAAY,CAAC,GAAG,MAAM,OAAK,kBAAkB,GAAG,IAAI,CAAC;AAAA,IACzE,KAAK;AACH,cAAQ,UAAU,YAAY,CAAC,GAAG,KAAK,OAAK,kBAAkB,GAAG,IAAI,CAAC;AAAA,IACxE,KAAK,OAAO;AACV,YAAM,SAAS,UAAU,YAAY,CAAC,GAAG,CAAC;AAC1C,UAAI,CAAC,MAAO,QAAO;AACnB,aAAO,CAAC,kBAAkB,OAAO,IAAI;AAAA,IACvC;AAAA,EACF;AAGA,MAAI,CAAC,UAAU,UAAW,QAAO;AAEjC,QAAM,QAAQ,KAAK,UAAU,SAAS;AACtC,QAAM,SAAS,UAAU;AAEzB,UAAQ,UAAU,IAAI;AAAA,IACpB,KAAK;AACH,aAAO,UAAU;AAAA,IACnB,KAAK;AACH,aAAO,UAAU;AAAA,IACnB,KAAK;AACH,aAAO,QAAQ;AAAA,IACjB,KAAK;AACH,aAAO,SAAS;AAAA,IAClB,KAAK;AACH,aAAO,QAAQ;AAAA,IACjB,KAAK;AACH,aAAO,SAAS;AAAA,IAClB,KAAK;AACH,UAAI,OAAO,UAAU,YAAY,OAAO,WAAW,SAAU,QAAO;AACpE,YAAM,UAAU,OACb,QAAQ,qBAAqB,MAAM,EACnC,QAAQ,MAAM,IAAI,EAClB,QAAQ,MAAM,GAAG;AACpB,aAAO,IAAI,OAAO,IAAI,OAAO,KAAK,GAAG,EAAE,KAAK,KAAK;AAAA,IACnD,KAAK;AACH,UAAI,OAAO,UAAU,YAAY,OAAO,WAAW,SAAU,QAAO;AACpE,aAAO,IAAI,OAAO,MAAM,EAAE,KAAK,KAAK;AAAA,IACtC;AACE,aAAO;AAAA,EACX;AACF;;;ACtHA,iBAAkB;AAIX,IAAM,kBAAkB,aAAE,OAAO;AAAA,EACtC,QAAQ,aAAE,OAAO;AAAA,EACjB,SAAS,aAAE,OAAO;AAAA,EAClB,QAAQ,aAAE,OAAO;AACnB,CAAC;AAEM,IAAM,kBAAkB,aAAE,OAAO;AAAA,EACtC,OAAO,aAAE,IAAI,EAAE,SAAS;AAAA,EACxB,WAAW;AAAA,EACX,OAAO,aAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAEM,IAAM,oBAAoB,aAAE,OAAO;AAAA,EACxC,OAAO,aAAE,IAAI;AAAA,EACb,WAAW;AAAA,EACX,KAAK,aAAE,OAAO;AAAA,EACd,OAAO,aAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAIM,IAAM,oBAAoB,aAAE,KAAK;AAAA,EACtC;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAM;AACvE,CAAC;AAGM,IAAM,sBAAsC,aAAE,KAAK,MAAM,aAAE,OAAO;AAAA,EACvE,IAAI;AAAA,EACJ,WAAW,aAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,OAAO,aAAE,IAAI,EAAE,SAAS;AAAA,EACxB,UAAU,aAAE,MAAM,mBAAmB,EAAE,SAAS;AAClD,CAAC,CAAC;AAIK,IAAM,cAAc,aAAE,OAAO;AAAA,EAClC,OAAO,aAAE,OAAO,aAAE,OAAO,GAAG,aAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,WAAW,oBAAoB,SAAS;AAAA,EACxC,MAAM,aAAE,OAAO,aAAE,OAAO,GAAG,aAAE,KAAK,CAAC,OAAO,MAAM,CAAC,CAAC,EAAE,SAAS;AAAA,EAC7D,OAAO,aAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,QAAQ,aAAE,OAAO,EAAE,SAAS;AAC9B,CAAC;AAIM,IAAM,iBAAiB,aAAE,OAAO;AAAA,EACrC,IAAI,aAAE,OAAO,EAAE,SAAS;AAAA,EACxB,SAAS,aAAE,OAAO;AAAA,EAClB,KAAK,aAAE,OAAO;AAAA;AAAA;AAAA,EAGd,QAAQ,aAAE,OAAO,EAAE,SAAS;AAAA,EAC5B,QAAQ,gBAAgB,SAAS,EAAE,SAAS;AAAA,EAC5C,UAAU,kBAAkB,SAAS,EAAE,SAAS;AAAA,EAChD,OAAO,aAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AACxC,CAAC;AAIM,IAAM,oBAAoB,aAAE,OAAO;AAAA,EACxC,MAAM,aAAE,QAAQ,MAAM;AAAA,EACtB,OAAO,aAAE,OAAO;AAClB,CAAC;AAEM,IAAM,wBAAwB,aAAE,OAAO;AAAA,EAC5C,MAAM,aAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,IAClB,SAAS,aAAE,OAAO;AAAA,IAClB,OAAO;AAAA,EACT,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,aAAE,OAAO;AAAA,EAC9C,MAAM,aAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,EACpB,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,aAAE,OAAO;AAAA,EAC5C,MAAM,aAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS;AACX,CAAC;AAEM,IAAM,uBAAuB,aAAE,OAAO;AAAA,EAC3C,MAAM,aAAE,QAAQ,UAAU;AAAA,EAC1B,SAAS,aAAE,OAAO;AAAA,IAChB,KAAK,aAAE,MAAM,cAAc;AAAA,EAC7B,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,aAAE,OAAO;AAAA,EAC5C,MAAM,aAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,aAAE,OAAO;AAAA,EAClB,mBAAmB,aAAE,OAAO,EAAE,SAAS;AACzC,CAAC;AAEM,IAAM,4BAA4B,aAAE,OAAO;AAAA,EAChD,MAAM,aAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,IAClB,UAAU,aAAE,OAAO;AAAA,IACnB,WAAW;AAAA,EACb,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,aAAE,OAAO;AAAA,EACnD,MAAM,aAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,IAClB,MAAM,aAAE,OAAO;AAAA,IACf,SAAS,aAAE,OAAO,aAAE,OAAO,GAAG,aAAE,OAAO,CAAC;AAAA,EAC1C,CAAC;AACH,CAAC;AAEM,IAAM,4BAA4B,aAAE,OAAO;AAAA,EAChD,MAAM,aAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,IAClB,MAAM,aAAE,OAAO;AAAA,IACf,SAAS,aAAE,MAAM,aAAE,OAAO;AAAA,MACxB,KAAK,aAAE,OAAO;AAAA,MACd,QAAQ;AAAA,IACV,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,aAAE,OAAO;AAAA,EACnD,MAAM,aAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,aAAE,OAAO;AAAA,IAChB,SAAS,aAAE,OAAO;AAAA,IAClB,MAAM,aAAE,OAAO;AAAA,EACjB,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,aAAE,OAAO;AAAA,EACxC,MAAM,aAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,aAAE,OAAO;AAAA,IAChB,WAAW,aAAE,OAAO;AAAA,IACpB,MAAM,aAAE,OAAO;AAAA,IACf,KAAK,aAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,aAAE,OAAO;AAAA,EACxC,MAAM,aAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,aAAE,OAAO;AAAA,IAChB,WAAW,aAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,MAAM,aAAE,OAAO;AAAA,IACf,cAAc,aAAE,OAAO;AAAA,EACzB,CAAC;AACH,CAAC;AAIM,IAAM,iBAAiB,aAAE,OAAO;AAAA,EACrC,MAAM,aAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,aAAE,OAAO;AAAA,IAChB,OAAO,aAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,mBAAmB,aAAE,OAAO;AAAA,EACvC,MAAM,aAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,aAAE,OAAO;AAAA,IAChB,OAAO,aAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,iBAAiB,aAAE,OAAO;AAAA,EACrC,MAAM,aAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,aAAE,OAAO;AAAA,IAChB,OAAO,aAAE,OAAO;AAAA,IAChB,MAAM,aAAE,IAAI;AAAA,EACd,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,aAAE,OAAO;AAAA,EAC9C,MAAM,aAAE,QAAQ,eAAe;AAAA,EAC/B,SAAS,aAAE,OAAO;AAAA,IAChB,OAAO,aAAE,OAAO;AAAA,IAChB,MAAM,aAAE,IAAI;AAAA,IACZ,aAAa,aAAE,OAAO,EAAE,SAAS;AAAA,IACjC,WAAW,aAAE,OAAO;AAAA,EACtB,CAAC;AACH,CAAC;AAIM,IAAM,gBAAgB,aAAE,mBAAmB,QAAQ;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;","names":["h"]}