npm - @topgunbuild/core - Versions diffs - 0.2.0 → 0.2.1 - Mend

@topgunbuild/core 0.2.0 → 0.2.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (7) hide show

package/dist/index.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/HLC.ts","../src/utils/hash.ts","../src/MerkleTree.ts","../src/LWWMap.ts","../src/ORMapMerkle.ts","../src/ORMapMerkleTree.ts","../src/ORMap.ts","../src/serializer.ts","../src/predicate.ts","../src/schemas.ts"],"sourcesContent":["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 { ORMapRecord } from './ORMap';\nimport { Timestamp } from './HLC';\nimport { hashString } from './utils/hash';\n\n/\n Convert Timestamp to deterministic string for hashing.\n * Format: millis:counter:nodeId\n /\nexport function timestampToString(ts: Timestamp): string {\n return `${ts.millis}:${ts.counter}:${ts.nodeId}`;\n}\n\n/\n Stringify a value in a deterministic way for hashing.\n /\nfunction stringifyValue(value: unknown): string {\n if (value === null \|\| value === undefined) {\n return String(value);\n }\n if (typeof value === 'object') {\n // Sort object keys for deterministic JSON\n return JSON.stringify(value, Object.keys(value as Record<string, unknown>).sort());\n }\n return String(value);\n}\n\n/\n Hash an ORMap entry (key + all its records).\n * Must be deterministic regardless of insertion order.\n \n @param key The key of the entry\n * @param records Map of tag -> record for this key\n * @returns Hash as a number (FNV-1a hash)\n /\nexport function hashORMapEntry<V>(\n key: string,\n records: Map<string, ORMapRecord<V>>\n): number {\n // Sort records by tag for deterministic ordering\n const sortedTags = Array.from(records.keys()).sort();\n\n // Build deterministic string representation\n const parts: string[] = [`key:${key}`];\n\n for (const tag of sortedTags) {\n const record = records.get(tag)!;\n // Include tag, value (JSON-stringified), timestamp, and ttl if present\n const valuePart = stringifyValue(record.value);\n\n let recordStr = `${tag}:${valuePart}:${timestampToString(record.timestamp)}`;\n if (record.ttlMs !== undefined) {\n recordStr += `:ttl=${record.ttlMs}`;\n }\n parts.push(recordStr);\n }\n\n return hashString(parts.join('\|'));\n}\n\n/\n Hash a single ORMapRecord for comparison.\n * Used when comparing individual records during merge.\n /\nexport function hashORMapRecord<V>(record: ORMapRecord<V>): number {\n const valuePart = stringifyValue(record.value);\n\n let str = `${record.tag}:${valuePart}:${timestampToString(record.timestamp)}`;\n if (record.ttlMs !== undefined) {\n str += `:ttl=${record.ttlMs}`;\n }\n\n return hashString(str);\n}\n\n/\n Compare two timestamps.\n * Returns:\n * < 0 if a < b\n * > 0 if a > b\n * = 0 if a == b\n /\nexport function compareTimestamps(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","import { ORMap, ORMapRecord } from './ORMap';\nimport { hashString, combineHashes } from './utils/hash';\nimport { hashORMapEntry } from './ORMapMerkle';\n\n/\n Merkle Node for ORMap.\n * Uses a prefix trie structure based on key hash (similar to LWWMap MerkleTree).\n /\nexport interface ORMapMerkleNode {\n hash: number;\n children?: { [key: string]: ORMapMerkleNode }; // Keyed by bucket index (hex char)\n entries?: Map<string, number>; // Leaf node: Key -> ContentHash\n}\n\n/\n A Merkle Tree implementation specifically for ORMap synchronization.\n * 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 Key difference from LWWMap MerkleTree:\n * - Each key can have multiple records (tags), so the entry hash includes all records for that key.\n /\nexport class ORMapMerkleTree {\n private root: ORMapMerkleNode;\n private readonly depth: number;\n\n constructor(depth: number = 3) {\n this.depth = depth;\n this.root = { hash: 0, children: {} };\n }\n\n /\n Update tree from ORMap data.\n * Rebuilds hashes for all entries in the map.\n /\n updateFromORMap<K, V>(map: ORMap<K, V>): void {\n // Clear and rebuild\n this.root = { hash: 0, children: {} };\n\n // Access internal items through available methods\n // We need to iterate over all keys and get their records\n const snapshot = map.getSnapshot();\n\n for (const [key, records] of snapshot.items) {\n if (records.size > 0) {\n const keyStr = String(key);\n const entryHash = hashORMapEntry(keyStr, records);\n const pathHash = hashString(keyStr).toString(16).padStart(8, '0');\n this.updateNode(this.root, keyStr, entryHash, pathHash, 0);\n }\n }\n }\n\n /\n Incrementally update a single key's hash.\n * Call this when records for a key change.\n /\n update<V>(key: string, records: Map<string, ORMapRecord<V>>): void {\n const pathHash = hashString(key).toString(16).padStart(8, '0');\n\n if (records.size === 0) {\n // Key has no records, remove from tree\n this.removeNode(this.root, key, pathHash, 0);\n } else {\n const entryHash = hashORMapEntry(key, records);\n this.updateNode(this.root, key, entryHash, pathHash, 0);\n }\n }\n\n /\n Remove a key from the tree.\n * Called when all records for a key are removed.\n /\n remove(key: string): void {\n const pathHash = hashString(key).toString(16).padStart(8, '0');\n this.removeNode(this.root, key, pathHash, 0);\n }\n\n private updateNode(\n node: ORMapMerkleNode,\n key: string,\n entryHash: number,\n pathHash: string,\n level: number\n ): number {\n // Leaf Node Logic\n if (level >= this.depth) {\n if (!node.entries) node.entries = new Map();\n node.entries.set(key, entryHash);\n\n // Recalculate leaf hash (Sum of entry 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, entryHash, 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 private removeNode(\n node: ORMapMerkleNode,\n key: string,\n pathHash: string,\n level: number\n ): 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 this.removeNode(node.children[bucketChar], key, pathHash, level + 1);\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 /\n Get the root hash for quick comparison.\n /\n getRootHash(): number {\n return this.root.hash;\n }\n\n /\n Get node at a specific path.\n /\n getNode(path: string): ORMapMerkleNode \| 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 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 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 /\n Find keys that differ between this tree and bucket info from remote.\n * Returns keys that:\n * - Exist locally but have different hash on remote\n * - Exist on remote but not locally\n * - Exist locally but not on remote\n /\n findDiffKeys(path: string, remoteEntries: Map<string, number>): Set<string> {\n const diffKeys = new Set<string>();\n const node = this.getNode(path);\n const localEntries = node?.entries \|\| new Map();\n\n // Keys in local but not remote, or different hash\n for (const [key, hash] of localEntries) {\n const remoteHash = remoteEntries.get(key);\n if (remoteHash === undefined \|\| remoteHash !== hash) {\n diffKeys.add(key);\n }\n }\n\n // Keys in remote but not local\n for (const key of remoteEntries.keys()) {\n if (!localEntries.has(key)) {\n diffKeys.add(key);\n }\n }\n\n return diffKeys;\n }\n\n /\n Get all entry hashes at a leaf path.\n * Used when sending bucket details to remote.\n /\n getEntryHashes(path: string): Map<string, number> {\n const node = this.getNode(path);\n return node?.entries \|\| new Map();\n }\n\n /\n Check if a path leads to a leaf node.\n /\n isLeaf(path: string): boolean {\n const node = this.getNode(path);\n return node !== undefined && node.entries !== undefined && node.entries.size > 0;\n }\n}\n","import { HLC, Timestamp } from './HLC';\nimport { ORMapMerkleTree } from './ORMapMerkleTree';\nimport { compareTimestamps } from './ORMapMerkle';\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 Result of merging records for a key.\n /\nexport interface MergeKeyResult {\n added: number;\n updated: number;\n}\n\n/\n Snapshot of ORMap internal state for Merkle Tree synchronization.\n /\nexport interface ORMapSnapshot<K, V> {\n items: Map<K, Map<string, ORMapRecord<V>>>;\n tombstones: Set<string>;\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 // Merkle Tree for efficient sync\n private merkleTree: ORMapMerkleTree;\n\n constructor(hlc: HLC) {\n this.hlc = hlc;\n this.items = new Map();\n this.tombstones = new Set();\n this.merkleTree = new ORMapMerkleTree();\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.updateMerkleTree(key);\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.updateMerkleTree(key);\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.merkleTree = new ORMapMerkleTree();\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 * Returns true if the record was applied (not tombstoned).\n /\n public apply(key: K, record: ORMapRecord<V>): boolean {\n if (this.tombstones.has(record.tag)) return false;\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.updateMerkleTree(key);\n this.notify();\n return true;\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 this.updateMerkleTree(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 const changedKeys = new Set<K>();\n\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 changedKeys.add(key);\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 changedKeys.add(key);\n }\n }\n if (localKeyMap.size === 0) {\n this.items.delete(key);\n }\n }\n\n // Update Merkle Tree for changed keys\n for (const key of changedKeys) {\n this.updateMerkleTree(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 // ============ Merkle Sync Methods ============\n\n /\n Get the Merkle Tree for this ORMap.\n * Used for efficient synchronization.\n /\n public getMerkleTree(): ORMapMerkleTree {\n return this.merkleTree;\n }\n\n /\n Get a snapshot of internal state for Merkle Tree synchronization.\n * Returns references to internal structures - do not modify!\n /\n public getSnapshot(): ORMapSnapshot<K, V> {\n return {\n items: this.items,\n tombstones: this.tombstones\n };\n }\n\n /\n Get all keys in this ORMap.\n /\n public allKeys(): K[] {\n return Array.from(this.items.keys());\n }\n\n /\n Get the internal records map for a key.\n * Returns Map<tag, record> or undefined if key doesn't exist.\n * Used for Merkle sync.\n /\n public getRecordsMap(key: K): Map<string, ORMapRecord<V>> \| undefined {\n return this.items.get(key);\n }\n\n /\n Merge remote records for a specific key into local state.\n * Implements Observed-Remove CRDT semantics.\n * Used during Merkle Tree synchronization.\n \n @param key The key to merge\n * @param remoteRecords Array of records from remote\n * @param remoteTombstones Array of tombstone tags from remote\n * @returns Result with count of added and updated records\n /\n public mergeKey(\n key: K,\n remoteRecords: ORMapRecord<V>[],\n remoteTombstones: string[] = []\n ): MergeKeyResult {\n let added = 0;\n let updated = 0;\n\n // First apply remote tombstones\n for (const tag of remoteTombstones) {\n if (!this.tombstones.has(tag)) {\n this.tombstones.add(tag);\n }\n }\n\n // Get or create local key map\n let localKeyMap = this.items.get(key);\n if (!localKeyMap) {\n localKeyMap = new Map();\n this.items.set(key, localKeyMap);\n }\n\n // Remove any local records that are now tombstoned\n for (const tag of localKeyMap.keys()) {\n if (this.tombstones.has(tag)) {\n localKeyMap.delete(tag);\n }\n }\n\n // Merge remote records\n for (const remoteRecord of remoteRecords) {\n // Skip if tombstoned\n if (this.tombstones.has(remoteRecord.tag)) {\n continue;\n }\n\n const localRecord = localKeyMap.get(remoteRecord.tag);\n\n if (!localRecord) {\n // New record - add it\n localKeyMap.set(remoteRecord.tag, remoteRecord);\n added++;\n } else if (compareTimestamps(remoteRecord.timestamp, localRecord.timestamp) > 0) {\n // Remote is newer - update\n localKeyMap.set(remoteRecord.tag, remoteRecord);\n updated++;\n }\n // Else: local is newer or equal, keep local\n\n // Always update causality\n this.hlc.update(remoteRecord.timestamp);\n }\n\n // Cleanup empty key map\n if (localKeyMap.size === 0) {\n this.items.delete(key);\n }\n\n // Update Merkle Tree\n this.updateMerkleTree(key);\n\n if (added > 0 \|\| updated > 0) {\n this.notify();\n }\n\n return { added, updated };\n }\n\n /\n Check if a tag is tombstoned.\n /\n public isTombstoned(tag: string): boolean {\n return this.tombstones.has(tag);\n }\n\n /\n Update the Merkle Tree for a specific key.\n * Called internally after any modification.\n /\n private updateMerkleTree(key: K): void {\n const keyStr = String(key);\n const keyMap = this.items.get(key);\n\n if (!keyMap \|\| keyMap.size === 0) {\n this.merkleTree.remove(keyStr);\n } else {\n this.merkleTree.update(keyStr, keyMap);\n }\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// --- Heartbeat Messages ---\n\nexport const PingMessageSchema = z.object({\n type: z.literal('PING'),\n timestamp: z.number(), // Client's Date.now()\n});\n\nexport const PongMessageSchema = z.object({\n type: z.literal('PONG'),\n timestamp: z.number(), // Echo back client's timestamp\n serverTime: z.number(), // Server's Date.now() (for clock skew detection)\n});\n\n// --- ORMap Sync Messages ---\n\n/*\n ORMAP_SYNC_INIT: Client initiates ORMap sync\n * Sends root hash and bucket hashes to server\n /\nexport const ORMapSyncInitSchema = z.object({\n type: z.literal('ORMAP_SYNC_INIT'),\n mapName: z.string(),\n rootHash: z.number(),\n bucketHashes: z.record(z.string(), z.number()), // path -> hash\n lastSyncTimestamp: z.number().optional(),\n});\n\n/\n ORMAP_SYNC_RESP_ROOT: Server responds with its root hash\n /\nexport const ORMapSyncRespRootSchema = z.object({\n type: z.literal('ORMAP_SYNC_RESP_ROOT'),\n payload: z.object({\n mapName: z.string(),\n rootHash: z.number(),\n timestamp: TimestampSchema,\n }),\n});\n\n/\n ORMAP_SYNC_RESP_BUCKETS: Server sends bucket hashes for comparison\n /\nexport const ORMapSyncRespBucketsSchema = z.object({\n type: z.literal('ORMAP_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\n/\n ORMAP_MERKLE_REQ_BUCKET: Client requests bucket details\n /\nexport const ORMapMerkleReqBucketSchema = z.object({\n type: z.literal('ORMAP_MERKLE_REQ_BUCKET'),\n payload: z.object({\n mapName: z.string(),\n path: z.string(),\n }),\n});\n\n/\n ORMAP_SYNC_RESP_LEAF: Server sends actual records for differing keys\n /\nexport const ORMapSyncRespLeafSchema = z.object({\n type: z.literal('ORMAP_SYNC_RESP_LEAF'),\n payload: z.object({\n mapName: z.string(),\n path: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()), // Tombstone tags for this key's records\n })),\n }),\n});\n\n/\n ORMAP_DIFF_REQUEST: Client requests data for specific keys\n /\nexport const ORMapDiffRequestSchema = z.object({\n type: z.literal('ORMAP_DIFF_REQUEST'),\n payload: z.object({\n mapName: z.string(),\n keys: z.array(z.string()),\n }),\n});\n\n/\n ORMAP_DIFF_RESPONSE: Server responds with data for requested keys\n /\nexport const ORMapDiffResponseSchema = z.object({\n type: z.literal('ORMAP_DIFF_RESPONSE'),\n payload: z.object({\n mapName: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()),\n })),\n }),\n});\n\n/\n ORMAP_PUSH_DIFF: Client pushes local diffs to server\n */\nexport const ORMapPushDiffSchema = z.object({\n type: z.literal('ORMAP_PUSH_DIFF'),\n payload: z.object({\n mapName: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()),\n })),\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 PingMessageSchema,\n PongMessageSchema,\n // ORMap Sync Messages\n ORMapSyncInitSchema,\n ORMapSyncRespRootSchema,\n ORMapSyncRespBucketsSchema,\n ORMapMerkleReqBucketSchema,\n ORMapSyncRespLeafSchema,\n ORMapDiffRequestSchema,\n ORMapDiffResponseSchema,\n ORMapPushDiffSchema,\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>;\nexport type PingMessage = z.infer<typeof PingMessageSchema>;\nexport type PongMessage = z.infer<typeof PongMessageSchema>;\n\n"],"mappings":";AAMO,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;;;ACnNO,SAAS,kBAAkB,IAAuB;AACvD,SAAO,GAAG,GAAG,MAAM,IAAI,GAAG,OAAO,IAAI,GAAG,MAAM;AAChD;AAKA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,OAAO,UAAU,UAAU;AAE7B,WAAO,KAAK,UAAU,OAAO,OAAO,KAAK,KAAgC,EAAE,KAAK,CAAC;AAAA,EACnF;AACA,SAAO,OAAO,KAAK;AACrB;AAUO,SAAS,eACd,KACA,SACQ;AAER,QAAM,aAAa,MAAM,KAAK,QAAQ,KAAK,CAAC,EAAE,KAAK;AAGnD,QAAM,QAAkB,CAAC,OAAO,GAAG,EAAE;AAErC,aAAW,OAAO,YAAY;AAC5B,UAAM,SAAS,QAAQ,IAAI,GAAG;AAE9B,UAAM,YAAY,eAAe,OAAO,KAAK;AAE7C,QAAI,YAAY,GAAG,GAAG,IAAI,SAAS,IAAI,kBAAkB,OAAO,SAAS,CAAC;AAC1E,QAAI,OAAO,UAAU,QAAW;AAC9B,mBAAa,QAAQ,OAAO,KAAK;AAAA,IACnC;AACA,UAAM,KAAK,SAAS;AAAA,EACtB;AAEA,SAAO,WAAW,MAAM,KAAK,GAAG,CAAC;AACnC;AAMO,SAAS,gBAAmB,QAAgC;AACjE,QAAM,YAAY,eAAe,OAAO,KAAK;AAE7C,MAAI,MAAM,GAAG,OAAO,GAAG,IAAI,SAAS,IAAI,kBAAkB,OAAO,SAAS,CAAC;AAC3E,MAAI,OAAO,UAAU,QAAW;AAC9B,WAAO,QAAQ,OAAO,KAAK;AAAA,EAC7B;AAEA,SAAO,WAAW,GAAG;AACvB;AASO,SAAS,kBAAkB,GAAc,GAAsB;AACpE,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,WAAO,EAAE,SAAS,EAAE;AAAA,EACtB;AACA,MAAI,EAAE,YAAY,EAAE,SAAS;AAC3B,WAAO,EAAE,UAAU,EAAE;AAAA,EACvB;AACA,SAAO,EAAE,OAAO,cAAc,EAAE,MAAM;AACxC;;;AChEO,IAAM,kBAAN,MAAsB;AAAA,EAI3B,YAAY,QAAgB,GAAG;AAC7B,SAAK,QAAQ;AACb,SAAK,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC,EAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAsB,KAAwB;AAE5C,SAAK,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC,EAAE;AAIpC,UAAM,WAAW,IAAI,YAAY;AAEjC,eAAW,CAAC,KAAK,OAAO,KAAK,SAAS,OAAO;AAC3C,UAAI,QAAQ,OAAO,GAAG;AACpB,cAAM,SAAS,OAAO,GAAG;AACzB,cAAM,YAAY,eAAe,QAAQ,OAAO;AAChD,cAAM,WAAW,WAAW,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAChE,aAAK,WAAW,KAAK,MAAM,QAAQ,WAAW,UAAU,CAAC;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAU,KAAa,SAA4C;AACjE,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAE7D,QAAI,QAAQ,SAAS,GAAG;AAEtB,WAAK,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,IAC7C,OAAO;AACL,YAAM,YAAY,eAAe,KAAK,OAAO;AAC7C,WAAK,WAAW,KAAK,MAAM,KAAK,WAAW,UAAU,CAAC;AAAA,IACxD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAAmB;AACxB,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC7D,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,EAC7C;AAAA,EAEQ,WACN,MACA,KACA,WACA,UACA,OACQ;AAER,QAAI,SAAS,KAAK,OAAO;AACvB,UAAI,CAAC,KAAK,QAAS,MAAK,UAAU,oBAAI,IAAI;AAC1C,WAAK,QAAQ,IAAI,KAAK,SAAS;AAG/B,UAAIC,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,WAAW,UAAU,QAAQ,CAAC;AAG9E,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,EAEQ,WACN,MACA,KACA,UACA,OACQ;AAER,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,WAAK,WAAW,KAAK,SAAS,UAAU,GAAG,KAAK,UAAU,QAAQ,CAAC;AAAA,IACrE;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;AAAA;AAAA;AAAA,EAKA,cAAsB;AACpB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,MAA2C;AACjD,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,EAMA,WAAW,MAAsC;AAC/C,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,EAMA,gBAAgB,MAAwB;AACtC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,CAAC,KAAK,QAAS,QAAO,CAAC;AACpC,WAAO,MAAM,KAAK,KAAK,QAAQ,KAAK,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,MAAc,eAAiD;AAC1E,UAAM,WAAW,oBAAI,IAAY;AACjC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,UAAM,eAAe,MAAM,WAAW,oBAAI,IAAI;AAG9C,eAAW,CAAC,KAAK,IAAI,KAAK,cAAc;AACtC,YAAM,aAAa,cAAc,IAAI,GAAG;AACxC,UAAI,eAAe,UAAa,eAAe,MAAM;AACnD,iBAAS,IAAI,GAAG;AAAA,MAClB;AAAA,IACF;AAGA,eAAW,OAAO,cAAc,KAAK,GAAG;AACtC,UAAI,CAAC,aAAa,IAAI,GAAG,GAAG;AAC1B,iBAAS,IAAI,GAAG;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,MAAmC;AAChD,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,WAAO,MAAM,WAAW,oBAAI,IAAI;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,MAAuB;AAC5B,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,WAAO,SAAS,UAAa,KAAK,YAAY,UAAa,KAAK,QAAQ,OAAO;AAAA,EACjF;AACF;;;ACjNO,IAAM,QAAN,MAAkB;AAAA,EAiBvB,YAAY,KAAU;AAOtB,SAAQ,YAA+B,CAAC;AANtC,SAAK,MAAM;AACX,SAAK,QAAQ,oBAAI,IAAI;AACrB,SAAK,aAAa,oBAAI,IAAI;AAC1B,SAAK,aAAa,IAAI,gBAAgB;AAAA,EACxC;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,iBAAiB,GAAG;AACzB,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,iBAAiB,GAAG;AACzB,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,QAAc;AACnB,SAAK,MAAM,MAAM;AACjB,SAAK,WAAW,MAAM;AACtB,SAAK,aAAa,IAAI,gBAAgB;AACtC,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;AAAA,EAMO,MAAM,KAAQ,QAAiC;AACpD,QAAI,KAAK,WAAW,IAAI,OAAO,GAAG,EAAG,QAAO;AAE5C,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,iBAAiB,GAAG;AACzB,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;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;AAC5C,aAAK,iBAAiB,GAAG;AAEzB;AAAA,MACF;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,MAAM,OAA0B;AACrC,UAAM,cAAc,oBAAI,IAAO;AAG/B,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;AAC3B,wBAAY,IAAI,GAAG;AAAA,UACrB;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;AACtB,sBAAY,IAAI,GAAG;AAAA,QACrB;AAAA,MACF;AACA,UAAI,YAAY,SAAS,GAAG;AAC1B,aAAK,MAAM,OAAO,GAAG;AAAA,MACvB;AAAA,IACF;AAGA,eAAW,OAAO,aAAa;AAC7B,WAAK,iBAAiB,GAAG;AAAA,IAC3B;AAEA,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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,gBAAiC;AACtC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,cAAmC;AACxC,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,YAAY,KAAK;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,UAAe;AACpB,WAAO,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,cAAc,KAAiD;AACpE,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYO,SACL,KACA,eACA,mBAA6B,CAAC,GACd;AAChB,QAAI,QAAQ;AACZ,QAAI,UAAU;AAGd,eAAW,OAAO,kBAAkB;AAClC,UAAI,CAAC,KAAK,WAAW,IAAI,GAAG,GAAG;AAC7B,aAAK,WAAW,IAAI,GAAG;AAAA,MACzB;AAAA,IACF;AAGA,QAAI,cAAc,KAAK,MAAM,IAAI,GAAG;AACpC,QAAI,CAAC,aAAa;AAChB,oBAAc,oBAAI,IAAI;AACtB,WAAK,MAAM,IAAI,KAAK,WAAW;AAAA,IACjC;AAGA,eAAW,OAAO,YAAY,KAAK,GAAG;AACpC,UAAI,KAAK,WAAW,IAAI,GAAG,GAAG;AAC5B,oBAAY,OAAO,GAAG;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,gBAAgB,eAAe;AAExC,UAAI,KAAK,WAAW,IAAI,aAAa,GAAG,GAAG;AACzC;AAAA,MACF;AAEA,YAAM,cAAc,YAAY,IAAI,aAAa,GAAG;AAEpD,UAAI,CAAC,aAAa;AAEhB,oBAAY,IAAI,aAAa,KAAK,YAAY;AAC9C;AAAA,MACF,WAAW,kBAAkB,aAAa,WAAW,YAAY,SAAS,IAAI,GAAG;AAE/E,oBAAY,IAAI,aAAa,KAAK,YAAY;AAC9C;AAAA,MACF;AAIA,WAAK,IAAI,OAAO,aAAa,SAAS;AAAA,IACxC;AAGA,QAAI,YAAY,SAAS,GAAG;AAC1B,WAAK,MAAM,OAAO,GAAG;AAAA,IACvB;AAGA,SAAK,iBAAiB,GAAG;AAEzB,QAAI,QAAQ,KAAK,UAAU,GAAG;AAC5B,WAAK,OAAO;AAAA,IACd;AAEA,WAAO,EAAE,OAAO,QAAQ;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKO,aAAa,KAAsB;AACxC,WAAO,KAAK,WAAW,IAAI,GAAG;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAiB,KAAc;AACrC,UAAM,SAAS,OAAO,GAAG;AACzB,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AAEjC,QAAI,CAAC,UAAU,OAAO,SAAS,GAAG;AAChC,WAAK,WAAW,OAAO,MAAM;AAAA,IAC/B,OAAO;AACL,WAAK,WAAW,OAAO,QAAQ,MAAM;AAAA,IACvC;AAAA,EACF;AACF;;;ACxdA,SAAS,QAAQ,cAAc;AAOxB,SAAS,UAAU,MAA2B;AACnD,SAAO,OAAO,IAAI;AACpB;AAOO,SAAS,YAAyB,MAAmC;AAE1E,SAAO,OAAO,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,SAAS,SAAS;AAIX,IAAM,kBAAkB,EAAE,OAAO;AAAA,EACtC,QAAQ,EAAE,OAAO;AAAA,EACjB,SAAS,EAAE,OAAO;AAAA,EAClB,QAAQ,EAAE,OAAO;AACnB,CAAC;AAEM,IAAM,kBAAkB,EAAE,OAAO;AAAA,EACtC,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACxB,WAAW;AAAA,EACX,OAAO,EAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,OAAO,EAAE,IAAI;AAAA,EACb,WAAW;AAAA,EACX,KAAK,EAAE,OAAO;AAAA,EACd,OAAO,EAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAIM,IAAM,oBAAoB,EAAE,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,EAAE,KAAK,MAAM,EAAE,OAAO;AAAA,EACvE,IAAI;AAAA,EACJ,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACxB,UAAU,EAAE,MAAM,mBAAmB,EAAE,SAAS;AAClD,CAAC,CAAC;AAIK,IAAM,cAAc,EAAE,OAAO;AAAA,EAClC,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,WAAW,oBAAoB,SAAS;AAAA,EACxC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,KAAK,CAAC,OAAO,MAAM,CAAC,CAAC,EAAE,SAAS;AAAA,EAC7D,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,QAAQ,EAAE,OAAO,EAAE,SAAS;AAC9B,CAAC;AAIM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,IAAI,EAAE,OAAO,EAAE,SAAS;AAAA,EACxB,SAAS,EAAE,OAAO;AAAA,EAClB,KAAK,EAAE,OAAO;AAAA;AAAA;AAAA,EAGd,QAAQ,EAAE,OAAO,EAAE,SAAS;AAAA,EAC5B,QAAQ,gBAAgB,SAAS,EAAE,SAAS;AAAA,EAC5C,UAAU,kBAAkB,SAAS,EAAE,SAAS;AAAA,EAChD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AACxC,CAAC;AAIM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,OAAO,EAAE,OAAO;AAClB,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,OAAO;AAAA,IAClB,OAAO;AAAA,EACT,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,EACpB,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS;AACX,CAAC;AAEM,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,MAAM,EAAE,QAAQ,UAAU;AAAA,EAC1B,SAAS,EAAE,OAAO;AAAA,IAChB,KAAK,EAAE,MAAM,cAAc;AAAA,EAC7B,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,EAClB,mBAAmB,EAAE,OAAO,EAAE,SAAS;AACzC,CAAC;AAEM,IAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,MAAM,EAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,UAAU,EAAE,OAAO;AAAA,IACnB,WAAW;AAAA,EACb,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,EAAE,OAAO;AAAA,EACnD,MAAM,EAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA,EAC1C,CAAC;AACH,CAAC;AAEM,IAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,MAAM,EAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,QAAQ;AAAA,IACV,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,EAAE,OAAO;AAAA,EACnD,MAAM,EAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,EACjB,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO;AAAA,IACpB,MAAM,EAAE,OAAO;AAAA,IACf,KAAK,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,MAAM,EAAE,OAAO;AAAA,IACf,cAAc,EAAE,OAAO;AAAA,EACzB,CAAC;AACH,CAAC;AAIM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,mBAAmB,EAAE,OAAO;AAAA,EACvC,MAAM,EAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,IAChB,MAAM,EAAE,IAAI;AAAA,EACd,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,eAAe;AAAA,EAC/B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,IAChB,MAAM,EAAE,IAAI;AAAA,IACZ,aAAa,EAAE,OAAO,EAAE,SAAS;AAAA,IACjC,WAAW,EAAE,OAAO;AAAA,EACtB,CAAC;AACH,CAAC;AAIM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,WAAW,EAAE,OAAO;AAAA;AACtB,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,WAAW,EAAE,OAAO;AAAA;AAAA,EACpB,YAAY,EAAE,OAAO;AAAA;AACvB,CAAC;AAQM,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,MAAM,EAAE,QAAQ,iBAAiB;AAAA,EACjC,SAAS,EAAE,OAAO;AAAA,EAClB,UAAU,EAAE,OAAO;AAAA,EACnB,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA;AAAA,EAC7C,mBAAmB,EAAE,OAAO,EAAE,SAAS;AACzC,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,sBAAsB;AAAA,EACtC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,UAAU,EAAE,OAAO;AAAA,IACnB,WAAW;AAAA,EACb,CAAC;AACH,CAAC;AAKM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,MAAM,EAAE,QAAQ,yBAAyB;AAAA,EACzC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA,EAC1C,CAAC;AACH,CAAC;AAKM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,MAAM,EAAE,QAAQ,yBAAyB;AAAA,EACzC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,EACjB,CAAC;AACH,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,sBAAsB;AAAA,EACtC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAKM,IAAM,yBAAyB,EAAE,OAAO;AAAA,EAC7C,MAAM,EAAE,QAAQ,oBAAoB;AAAA,EACpC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,EAC1B,CAAC;AACH,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,qBAAqB;AAAA,EACrC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAKM,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,MAAM,EAAE,QAAQ,iBAAiB;AAAA,EACjC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAIM,IAAM,gBAAgB,EAAE,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;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;","names":["h","h"]}
1	+ {"version":3,"sources":["../src/HLC.ts","../src/utils/hash.ts","../src/MerkleTree.ts","../src/LWWMap.ts","../src/ORMapMerkle.ts","../src/ORMapMerkleTree.ts","../src/ORMap.ts","../src/serializer.ts","../src/predicate.ts","../src/schemas.ts","../src/types/WriteConcern.ts"],"sourcesContent":["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 Hash utilities for TopGun\n \n Uses native xxHash64 when available (via @topgunbuild/native),\n * falls back to FNV-1a for JS-only environments.\n \n Phase 3.05: Native Hash Integration\n /\n\n// Try to load native hash module\nlet nativeHash: {\n hashString: (str: string) => number;\n isNativeHashAvailable: () => boolean;\n} \| null = null;\n\nlet nativeLoadAttempted = false;\n\nfunction tryLoadNative(): void {\n if (nativeLoadAttempted) return;\n nativeLoadAttempted = true;\n\n try {\n // eslint-disable-next-line @typescript-eslint/no-require-imports\n nativeHash = require('@topgunbuild/native');\n } catch {\n // Native module not available, will use FNV-1a fallback\n }\n}\n\n/\n FNV-1a Hash implementation for strings.\n * Fast, non-cryptographic, synchronous.\n * Used as fallback when native module is unavailable.\n /\nfunction fnv1aHash(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 Hash a string to a 32-bit unsigned integer.\n \n Uses native xxHash64 (truncated to 32 bits) when available,\n * otherwise falls back to FNV-1a.\n \n @param str - String to hash\n * @returns 32-bit unsigned integer hash\n /\nexport function hashString(str: string): number {\n tryLoadNative();\n\n if (nativeHash && nativeHash.isNativeHashAvailable()) {\n return nativeHash.hashString(str);\n }\n\n return fnv1aHash(str);\n}\n\n/\n Combines multiple hash numbers into one order-independent hash.\n * Used for combining bucket hashes in Merkle trees.\n \n Uses simple sum (with overflow handling) for order-independence.\n \n @param hashes - Array of hash values to combine\n * @returns Combined hash as 32-bit unsigned integer\n /\nexport function combineHashes(hashes: number[]): number {\n let result = 0;\n for (const h of hashes) {\n result = (result + h) \| 0; // Simple sum with overflow\n }\n return result >>> 0;\n}\n\n/\n Check if native hash module is being used.\n * Useful for diagnostics and testing.\n /\nexport function isUsingNativeHash(): boolean {\n tryLoadNative();\n return nativeHash?.isNativeHashAvailable() === true;\n}\n\n/\n Force use of FNV-1a hash (for testing/compatibility).\n * After calling this, hashString will always use FNV-1a.\n /\nexport function disableNativeHash(): void {\n nativeHash = null;\n nativeLoadAttempted = true;\n}\n\n/\n Re-enable native hash loading (for testing).\n * Resets the load state so native module can be loaded again.\n /\nexport function resetNativeHash(): void {\n nativeHash = null;\n nativeLoadAttempted = false;\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 { ORMapRecord } from './ORMap';\nimport { Timestamp } from './HLC';\nimport { hashString } from './utils/hash';\n\n/\n Convert Timestamp to deterministic string for hashing.\n * Format: millis:counter:nodeId\n /\nexport function timestampToString(ts: Timestamp): string {\n return `${ts.millis}:${ts.counter}:${ts.nodeId}`;\n}\n\n/\n Stringify a value in a deterministic way for hashing.\n /\nfunction stringifyValue(value: unknown): string {\n if (value === null \|\| value === undefined) {\n return String(value);\n }\n if (typeof value === 'object') {\n // Sort object keys for deterministic JSON\n return JSON.stringify(value, Object.keys(value as Record<string, unknown>).sort());\n }\n return String(value);\n}\n\n/\n Hash an ORMap entry (key + all its records).\n * Must be deterministic regardless of insertion order.\n \n @param key The key of the entry\n * @param records Map of tag -> record for this key\n * @returns Hash as a number (FNV-1a hash)\n /\nexport function hashORMapEntry<V>(\n key: string,\n records: Map<string, ORMapRecord<V>>\n): number {\n // Sort records by tag for deterministic ordering\n const sortedTags = Array.from(records.keys()).sort();\n\n // Build deterministic string representation\n const parts: string[] = [`key:${key}`];\n\n for (const tag of sortedTags) {\n const record = records.get(tag)!;\n // Include tag, value (JSON-stringified), timestamp, and ttl if present\n const valuePart = stringifyValue(record.value);\n\n let recordStr = `${tag}:${valuePart}:${timestampToString(record.timestamp)}`;\n if (record.ttlMs !== undefined) {\n recordStr += `:ttl=${record.ttlMs}`;\n }\n parts.push(recordStr);\n }\n\n return hashString(parts.join('\|'));\n}\n\n/\n Hash a single ORMapRecord for comparison.\n * Used when comparing individual records during merge.\n /\nexport function hashORMapRecord<V>(record: ORMapRecord<V>): number {\n const valuePart = stringifyValue(record.value);\n\n let str = `${record.tag}:${valuePart}:${timestampToString(record.timestamp)}`;\n if (record.ttlMs !== undefined) {\n str += `:ttl=${record.ttlMs}`;\n }\n\n return hashString(str);\n}\n\n/\n Compare two timestamps.\n * Returns:\n * < 0 if a < b\n * > 0 if a > b\n * = 0 if a == b\n /\nexport function compareTimestamps(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","import { ORMap, ORMapRecord } from './ORMap';\nimport { hashString, combineHashes } from './utils/hash';\nimport { hashORMapEntry } from './ORMapMerkle';\n\n/\n Merkle Node for ORMap.\n * Uses a prefix trie structure based on key hash (similar to LWWMap MerkleTree).\n /\nexport interface ORMapMerkleNode {\n hash: number;\n children?: { [key: string]: ORMapMerkleNode }; // Keyed by bucket index (hex char)\n entries?: Map<string, number>; // Leaf node: Key -> ContentHash\n}\n\n/\n A Merkle Tree implementation specifically for ORMap synchronization.\n * 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 Key difference from LWWMap MerkleTree:\n * - Each key can have multiple records (tags), so the entry hash includes all records for that key.\n /\nexport class ORMapMerkleTree {\n private root: ORMapMerkleNode;\n private readonly depth: number;\n\n constructor(depth: number = 3) {\n this.depth = depth;\n this.root = { hash: 0, children: {} };\n }\n\n /\n Update tree from ORMap data.\n * Rebuilds hashes for all entries in the map.\n /\n updateFromORMap<K, V>(map: ORMap<K, V>): void {\n // Clear and rebuild\n this.root = { hash: 0, children: {} };\n\n // Access internal items through available methods\n // We need to iterate over all keys and get their records\n const snapshot = map.getSnapshot();\n\n for (const [key, records] of snapshot.items) {\n if (records.size > 0) {\n const keyStr = String(key);\n const entryHash = hashORMapEntry(keyStr, records);\n const pathHash = hashString(keyStr).toString(16).padStart(8, '0');\n this.updateNode(this.root, keyStr, entryHash, pathHash, 0);\n }\n }\n }\n\n /\n Incrementally update a single key's hash.\n * Call this when records for a key change.\n /\n update<V>(key: string, records: Map<string, ORMapRecord<V>>): void {\n const pathHash = hashString(key).toString(16).padStart(8, '0');\n\n if (records.size === 0) {\n // Key has no records, remove from tree\n this.removeNode(this.root, key, pathHash, 0);\n } else {\n const entryHash = hashORMapEntry(key, records);\n this.updateNode(this.root, key, entryHash, pathHash, 0);\n }\n }\n\n /\n Remove a key from the tree.\n * Called when all records for a key are removed.\n /\n remove(key: string): void {\n const pathHash = hashString(key).toString(16).padStart(8, '0');\n this.removeNode(this.root, key, pathHash, 0);\n }\n\n private updateNode(\n node: ORMapMerkleNode,\n key: string,\n entryHash: number,\n pathHash: string,\n level: number\n ): number {\n // Leaf Node Logic\n if (level >= this.depth) {\n if (!node.entries) node.entries = new Map();\n node.entries.set(key, entryHash);\n\n // Recalculate leaf hash (Sum of entry 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, entryHash, 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 private removeNode(\n node: ORMapMerkleNode,\n key: string,\n pathHash: string,\n level: number\n ): 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 this.removeNode(node.children[bucketChar], key, pathHash, level + 1);\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 /\n Get the root hash for quick comparison.\n /\n getRootHash(): number {\n return this.root.hash;\n }\n\n /\n Get node at a specific path.\n /\n getNode(path: string): ORMapMerkleNode \| 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 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 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 /\n Find keys that differ between this tree and bucket info from remote.\n * Returns keys that:\n * - Exist locally but have different hash on remote\n * - Exist on remote but not locally\n * - Exist locally but not on remote\n /\n findDiffKeys(path: string, remoteEntries: Map<string, number>): Set<string> {\n const diffKeys = new Set<string>();\n const node = this.getNode(path);\n const localEntries = node?.entries \|\| new Map();\n\n // Keys in local but not remote, or different hash\n for (const [key, hash] of localEntries) {\n const remoteHash = remoteEntries.get(key);\n if (remoteHash === undefined \|\| remoteHash !== hash) {\n diffKeys.add(key);\n }\n }\n\n // Keys in remote but not local\n for (const key of remoteEntries.keys()) {\n if (!localEntries.has(key)) {\n diffKeys.add(key);\n }\n }\n\n return diffKeys;\n }\n\n /\n Get all entry hashes at a leaf path.\n * Used when sending bucket details to remote.\n /\n getEntryHashes(path: string): Map<string, number> {\n const node = this.getNode(path);\n return node?.entries \|\| new Map();\n }\n\n /\n Check if a path leads to a leaf node.\n /\n isLeaf(path: string): boolean {\n const node = this.getNode(path);\n return node !== undefined && node.entries !== undefined && node.entries.size > 0;\n }\n}\n","import { HLC, Timestamp } from './HLC';\nimport { ORMapMerkleTree } from './ORMapMerkleTree';\nimport { compareTimestamps } from './ORMapMerkle';\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 Result of merging records for a key.\n /\nexport interface MergeKeyResult {\n added: number;\n updated: number;\n}\n\n/\n Snapshot of ORMap internal state for Merkle Tree synchronization.\n /\nexport interface ORMapSnapshot<K, V> {\n items: Map<K, Map<string, ORMapRecord<V>>>;\n tombstones: Set<string>;\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 // Merkle Tree for efficient sync\n private merkleTree: ORMapMerkleTree;\n\n constructor(hlc: HLC) {\n this.hlc = hlc;\n this.items = new Map();\n this.tombstones = new Set();\n this.merkleTree = new ORMapMerkleTree();\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.updateMerkleTree(key);\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.updateMerkleTree(key);\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.merkleTree = new ORMapMerkleTree();\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 * Returns true if the record was applied (not tombstoned).\n /\n public apply(key: K, record: ORMapRecord<V>): boolean {\n if (this.tombstones.has(record.tag)) return false;\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.updateMerkleTree(key);\n this.notify();\n return true;\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 this.updateMerkleTree(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 const changedKeys = new Set<K>();\n\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 changedKeys.add(key);\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 changedKeys.add(key);\n }\n }\n if (localKeyMap.size === 0) {\n this.items.delete(key);\n }\n }\n\n // Update Merkle Tree for changed keys\n for (const key of changedKeys) {\n this.updateMerkleTree(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 // ============ Merkle Sync Methods ============\n\n /\n Get the Merkle Tree for this ORMap.\n * Used for efficient synchronization.\n /\n public getMerkleTree(): ORMapMerkleTree {\n return this.merkleTree;\n }\n\n /\n Get a snapshot of internal state for Merkle Tree synchronization.\n * Returns references to internal structures - do not modify!\n /\n public getSnapshot(): ORMapSnapshot<K, V> {\n return {\n items: this.items,\n tombstones: this.tombstones\n };\n }\n\n /\n Get all keys in this ORMap.\n /\n public allKeys(): K[] {\n return Array.from(this.items.keys());\n }\n\n /\n Get the internal records map for a key.\n * Returns Map<tag, record> or undefined if key doesn't exist.\n * Used for Merkle sync.\n /\n public getRecordsMap(key: K): Map<string, ORMapRecord<V>> \| undefined {\n return this.items.get(key);\n }\n\n /\n Merge remote records for a specific key into local state.\n * Implements Observed-Remove CRDT semantics.\n * Used during Merkle Tree synchronization.\n \n @param key The key to merge\n * @param remoteRecords Array of records from remote\n * @param remoteTombstones Array of tombstone tags from remote\n * @returns Result with count of added and updated records\n /\n public mergeKey(\n key: K,\n remoteRecords: ORMapRecord<V>[],\n remoteTombstones: string[] = []\n ): MergeKeyResult {\n let added = 0;\n let updated = 0;\n\n // First apply remote tombstones\n for (const tag of remoteTombstones) {\n if (!this.tombstones.has(tag)) {\n this.tombstones.add(tag);\n }\n }\n\n // Get or create local key map\n let localKeyMap = this.items.get(key);\n if (!localKeyMap) {\n localKeyMap = new Map();\n this.items.set(key, localKeyMap);\n }\n\n // Remove any local records that are now tombstoned\n for (const tag of localKeyMap.keys()) {\n if (this.tombstones.has(tag)) {\n localKeyMap.delete(tag);\n }\n }\n\n // Merge remote records\n for (const remoteRecord of remoteRecords) {\n // Skip if tombstoned\n if (this.tombstones.has(remoteRecord.tag)) {\n continue;\n }\n\n const localRecord = localKeyMap.get(remoteRecord.tag);\n\n if (!localRecord) {\n // New record - add it\n localKeyMap.set(remoteRecord.tag, remoteRecord);\n added++;\n } else if (compareTimestamps(remoteRecord.timestamp, localRecord.timestamp) > 0) {\n // Remote is newer - update\n localKeyMap.set(remoteRecord.tag, remoteRecord);\n updated++;\n }\n // Else: local is newer or equal, keep local\n\n // Always update causality\n this.hlc.update(remoteRecord.timestamp);\n }\n\n // Cleanup empty key map\n if (localKeyMap.size === 0) {\n this.items.delete(key);\n }\n\n // Update Merkle Tree\n this.updateMerkleTree(key);\n\n if (added > 0 \|\| updated > 0) {\n this.notify();\n }\n\n return { added, updated };\n }\n\n /\n Check if a tag is tombstoned.\n /\n public isTombstoned(tag: string): boolean {\n return this.tombstones.has(tag);\n }\n\n /\n Update the Merkle Tree for a specific key.\n * Called internally after any modification.\n /\n private updateMerkleTree(key: K): void {\n const keyStr = String(key);\n const keyMap = this.items.get(key);\n\n if (!keyMap \|\| keyMap.size === 0) {\n this.merkleTree.remove(keyStr);\n } else {\n this.merkleTree.update(keyStr, keyMap);\n }\n }\n}\n","import { pack, unpack } from 'msgpackr';\n\n/\n Serializes a JavaScript object to MessagePack binary format.\n * Uses msgpackr for 2-5x faster serialization compared to @msgpack/msgpack.\n * @param data The data to serialize.\n * @returns A Uint8Array containing the serialized data.\n /\nexport function serialize(data: unknown): Uint8Array {\n return pack(data);\n}\n\n/\n Deserializes MessagePack binary data to a JavaScript object.\n * Uses msgpackr for 2-5x faster deserialization compared to @msgpack/msgpack.\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 // msgpackr unpack accepts Uint8Array, Buffer, ArrayBuffer\n const buffer = data instanceof ArrayBuffer ? new Uint8Array(data) : data;\n return unpack(buffer) 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// --- Write Concern Types ---\n\n/*\n Write Concern schema - defines when an operation is considered acknowledged.\n /\nexport const WriteConcernSchema = z.enum([\n 'FIRE_AND_FORGET',\n 'MEMORY',\n 'APPLIED',\n 'REPLICATED',\n 'PERSISTED',\n]);\n\nexport type WriteConcernValue = z.infer<typeof WriteConcernSchema>;\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 // Write Concern fields (Phase 5.01)\n writeConcern: WriteConcernSchema.optional(),\n timeout: z.number().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 // Batch-level Write Concern (can be overridden per-op)\n writeConcern: WriteConcernSchema.optional(),\n timeout: z.number().optional(),\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// --- Heartbeat Messages ---\n\nexport const PingMessageSchema = z.object({\n type: z.literal('PING'),\n timestamp: z.number(), // Client's Date.now()\n});\n\nexport const PongMessageSchema = z.object({\n type: z.literal('PONG'),\n timestamp: z.number(), // Echo back client's timestamp\n serverTime: z.number(), // Server's Date.now() (for clock skew detection)\n});\n\n// --- Batched Messages ---\n\n/\n BATCH: Server sends multiple messages batched together.\n * Uses length-prefixed binary format for efficiency.\n * Format: [4 bytes: count][4 bytes: len1][msg1][4 bytes: len2][msg2]...\n /\nexport const BatchMessageSchema = z.object({\n type: z.literal('BATCH'),\n count: z.number(),\n data: z.instanceof(Uint8Array),\n});\n\n// --- ORMap Sync Messages ---\n\n/\n ORMAP_SYNC_INIT: Client initiates ORMap sync\n * Sends root hash and bucket hashes to server\n /\nexport const ORMapSyncInitSchema = z.object({\n type: z.literal('ORMAP_SYNC_INIT'),\n mapName: z.string(),\n rootHash: z.number(),\n bucketHashes: z.record(z.string(), z.number()), // path -> hash\n lastSyncTimestamp: z.number().optional(),\n});\n\n/\n ORMAP_SYNC_RESP_ROOT: Server responds with its root hash\n /\nexport const ORMapSyncRespRootSchema = z.object({\n type: z.literal('ORMAP_SYNC_RESP_ROOT'),\n payload: z.object({\n mapName: z.string(),\n rootHash: z.number(),\n timestamp: TimestampSchema,\n }),\n});\n\n/\n ORMAP_SYNC_RESP_BUCKETS: Server sends bucket hashes for comparison\n /\nexport const ORMapSyncRespBucketsSchema = z.object({\n type: z.literal('ORMAP_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\n/\n ORMAP_MERKLE_REQ_BUCKET: Client requests bucket details\n /\nexport const ORMapMerkleReqBucketSchema = z.object({\n type: z.literal('ORMAP_MERKLE_REQ_BUCKET'),\n payload: z.object({\n mapName: z.string(),\n path: z.string(),\n }),\n});\n\n/\n ORMAP_SYNC_RESP_LEAF: Server sends actual records for differing keys\n /\nexport const ORMapSyncRespLeafSchema = z.object({\n type: z.literal('ORMAP_SYNC_RESP_LEAF'),\n payload: z.object({\n mapName: z.string(),\n path: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()), // Tombstone tags for this key's records\n })),\n }),\n});\n\n/\n ORMAP_DIFF_REQUEST: Client requests data for specific keys\n /\nexport const ORMapDiffRequestSchema = z.object({\n type: z.literal('ORMAP_DIFF_REQUEST'),\n payload: z.object({\n mapName: z.string(),\n keys: z.array(z.string()),\n }),\n});\n\n/\n ORMAP_DIFF_RESPONSE: Server responds with data for requested keys\n /\nexport const ORMapDiffResponseSchema = z.object({\n type: z.literal('ORMAP_DIFF_RESPONSE'),\n payload: z.object({\n mapName: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()),\n })),\n }),\n});\n\n/\n ORMAP_PUSH_DIFF: Client pushes local diffs to server\n /\nexport const ORMapPushDiffSchema = z.object({\n type: z.literal('ORMAP_PUSH_DIFF'),\n payload: z.object({\n mapName: z.string(),\n entries: z.array(z.object({\n key: z.string(),\n records: z.array(ORMapRecordSchema),\n tombstones: z.array(z.string()),\n })),\n }),\n});\n\n// --- Write Concern Response Schemas (Phase 5.01) ---\n\n/\n Individual operation result within a batch ACK\n /\nexport const OpResultSchema = z.object({\n opId: z.string(),\n success: z.boolean(),\n achievedLevel: WriteConcernSchema,\n error: z.string().optional(),\n});\n\n/\n OP_ACK: Server acknowledges write operations\n * Extended to support Write Concern levels\n /\nexport const OpAckMessageSchema = z.object({\n type: z.literal('OP_ACK'),\n payload: z.object({\n /* ID of the last operation in the batch (for backwards compatibility) /\n lastId: z.string(),\n /* Write Concern level achieved (for simple ACKs) /\n achievedLevel: WriteConcernSchema.optional(),\n /* Per-operation results (for batch operations with mixed Write Concern) /\n results: z.array(OpResultSchema).optional(),\n }),\n});\n\n/\n OP_REJECTED: Server rejects a write operation\n /\nexport const OpRejectedMessageSchema = z.object({\n type: z.literal('OP_REJECTED'),\n payload: z.object({\n /* Operation ID that was rejected /\n opId: z.string(),\n /* Reason for rejection /\n reason: z.string(),\n /* Error code /\n code: z.number().optional(),\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 PingMessageSchema,\n PongMessageSchema,\n // ORMap Sync Messages\n ORMapSyncInitSchema,\n ORMapSyncRespRootSchema,\n ORMapSyncRespBucketsSchema,\n ORMapMerkleReqBucketSchema,\n ORMapSyncRespLeafSchema,\n ORMapDiffRequestSchema,\n ORMapDiffResponseSchema,\n ORMapPushDiffSchema,\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>;\nexport type PingMessage = z.infer<typeof PingMessageSchema>;\nexport type PongMessage = z.infer<typeof PongMessageSchema>;\nexport type BatchMessage = z.infer<typeof BatchMessageSchema>;\n\n// Write Concern types (Phase 5.01)\nexport type OpAckMessage = z.infer<typeof OpAckMessageSchema>;\nexport type OpRejectedMessage = z.infer<typeof OpRejectedMessageSchema>;\nexport type OpResult = z.infer<typeof OpResultSchema>;\n\n","/\n Write Concern - Configurable Acknowledgment Levels\n \n Write Concern defines when a write operation is considered successful.\n * Similar to MongoDB's writeConcern, Kafka's acks, and Cassandra's consistency levels.\n /\n\n/\n Write Concern levels - determines when an operation is acknowledged.\n \n Levels are ordered by durability guarantee (lowest to highest):\n * FIRE_AND_FORGET < MEMORY < APPLIED < REPLICATED < PERSISTED\n /\nexport enum WriteConcern {\n /\n FIRE_AND_FORGET (acks=0)\n * - ACK sent immediately after server receives the message\n * - Operation may be lost if server crashes before processing\n * - Maximum throughput, minimum latency\n * - Use case: metrics, logs, non-critical data\n /\n FIRE_AND_FORGET = 'FIRE_AND_FORGET',\n\n /\n MEMORY (acks=1, default) - current Early ACK behavior\n * - ACK sent after validation and queuing for processing\n * - Operation is in memory but not yet applied to CRDT\n * - Use case: most operations, real-time updates\n /\n MEMORY = 'MEMORY',\n\n /\n APPLIED\n * - ACK sent after operation is applied to CRDT in memory\n * - Data is readable on this node immediately after ACK\n * - Use case: operations requiring immediate consistency on the node\n /\n APPLIED = 'APPLIED',\n\n /\n REPLICATED\n * - ACK sent after operation is broadcast to cluster (CLUSTER_EVENT sent)\n * - Data survives primary node failure\n * - Use case: important data requiring cluster durability\n /\n REPLICATED = 'REPLICATED',\n\n /\n PERSISTED\n * - ACK sent after operation is written to storage on primary node\n * - Data survives node restart\n * - Use case: critical data (financial transactions, audit logs)\n /\n PERSISTED = 'PERSISTED',\n}\n\n/\n Default timeout for Write Concern acknowledgments (ms)\n /\nexport const DEFAULT_WRITE_CONCERN_TIMEOUT = 5000;\n\n/\n Write options for PUT/REMOVE operations\n /\nexport interface WriteOptions {\n /\n Write acknowledgment level.\n * @default WriteConcern.MEMORY\n /\n writeConcern?: WriteConcern;\n\n /\n Timeout for waiting for acknowledgment (ms).\n * Applies to APPLIED, REPLICATED, PERSISTED levels.\n * @default 5000\n /\n timeout?: number;\n}\n\n/\n Result of a write operation\n /\nexport interface WriteResult {\n /* Whether the operation achieved the requested Write Concern level /\n success: boolean;\n\n /* Operation ID /\n opId: string;\n\n /* The Write Concern level actually achieved /\n achievedLevel: WriteConcern;\n\n /* Time taken to achieve the level (ms) /\n latencyMs: number;\n\n /* Error message if success=false /\n error?: string;\n}\n\n/\n Internal structure for tracking pending write acknowledgments\n /\nexport interface PendingWrite {\n /* Operation ID /\n opId: string;\n\n /* Target Write Concern level /\n writeConcern: WriteConcern;\n\n /* Timestamp when operation was registered /\n timestamp: number;\n\n /* Timeout duration (ms) /\n timeout: number;\n\n /* Promise resolve callback /\n resolve: (result: WriteResult) => void;\n\n /* Promise reject callback /\n reject: (error: Error) => void;\n\n /* Timeout handle for cleanup /\n timeoutHandle?: ReturnType<typeof setTimeout>;\n\n /* Set of levels that have been achieved /\n achievedLevels: Set<WriteConcern>;\n}\n\n/\n Ordered list of Write Concern levels (lowest to highest)\n /\nexport const WRITE_CONCERN_ORDER: readonly WriteConcern[] = [\n WriteConcern.FIRE_AND_FORGET,\n WriteConcern.MEMORY,\n WriteConcern.APPLIED,\n WriteConcern.REPLICATED,\n WriteConcern.PERSISTED,\n] as const;\n\n/\n Check if a target Write Concern level is achieved based on achieved levels.\n \n @param achieved - Set of achieved Write Concern levels\n * @param target - Target Write Concern level to check\n * @returns true if target level (or higher) is achieved\n /\nexport function isWriteConcernAchieved(\n achieved: Set<WriteConcern>,\n target: WriteConcern\n): boolean {\n const targetIndex = WRITE_CONCERN_ORDER.indexOf(target);\n const achievedIndex = Math.max(\n ...Array.from(achieved).map((l) => WRITE_CONCERN_ORDER.indexOf(l))\n );\n return achievedIndex >= targetIndex;\n}\n\n/\n Get the highest achieved Write Concern level from a set of achieved levels.\n \n @param achieved - Set of achieved Write Concern levels\n * @returns The highest achieved level\n */\nexport function getHighestWriteConcernLevel(\n achieved: Set<WriteConcern>\n): WriteConcern {\n for (let i = WRITE_CONCERN_ORDER.length - 1; i >= 0; i--) {\n if (achieved.has(WRITE_CONCERN_ORDER[i])) {\n return WRITE_CONCERN_ORDER[i];\n }\n }\n return WriteConcern.FIRE_AND_FORGET;\n}\n"],"mappings":";;;;;;;;AAMO,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;;;ACIP,IAAI,aAGO;AAEX,IAAI,sBAAsB;AAE1B,SAAS,gBAAsB;AAC7B,MAAI,oBAAqB;AACzB,wBAAsB;AAEtB,MAAI;AAEF,iBAAa,UAAQ,qBAAqB;AAAA,EAC5C,QAAQ;AAAA,EAER;AACF;AAOA,SAAS,UAAU,KAAqB;AACtC,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;AAWO,SAAS,WAAW,KAAqB;AAC9C,gBAAc;AAEd,MAAI,cAAc,WAAW,sBAAsB,GAAG;AACpD,WAAO,WAAW,WAAW,GAAG;AAAA,EAClC;AAEA,SAAO,UAAU,GAAG;AACtB;AAWO,SAAS,cAAc,QAA0B;AACtD,MAAI,SAAS;AACb,aAAW,KAAK,QAAQ;AACtB,aAAU,SAAS,IAAK;AAAA,EAC1B;AACA,SAAO,WAAW;AACpB;AAMO,SAAS,oBAA6B;AAC3C,gBAAc;AACd,SAAO,YAAY,sBAAsB,MAAM;AACjD;AAMO,SAAS,oBAA0B;AACxC,eAAa;AACb,wBAAsB;AACxB;AAMO,SAAS,kBAAwB;AACtC,eAAa;AACb,wBAAsB;AACxB;;;ACrFO,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;;;ACnNO,SAAS,kBAAkB,IAAuB;AACvD,SAAO,GAAG,GAAG,MAAM,IAAI,GAAG,OAAO,IAAI,GAAG,MAAM;AAChD;AAKA,SAAS,eAAe,OAAwB;AAC9C,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,OAAO,UAAU,UAAU;AAE7B,WAAO,KAAK,UAAU,OAAO,OAAO,KAAK,KAAgC,EAAE,KAAK,CAAC;AAAA,EACnF;AACA,SAAO,OAAO,KAAK;AACrB;AAUO,SAAS,eACd,KACA,SACQ;AAER,QAAM,aAAa,MAAM,KAAK,QAAQ,KAAK,CAAC,EAAE,KAAK;AAGnD,QAAM,QAAkB,CAAC,OAAO,GAAG,EAAE;AAErC,aAAW,OAAO,YAAY;AAC5B,UAAM,SAAS,QAAQ,IAAI,GAAG;AAE9B,UAAM,YAAY,eAAe,OAAO,KAAK;AAE7C,QAAI,YAAY,GAAG,GAAG,IAAI,SAAS,IAAI,kBAAkB,OAAO,SAAS,CAAC;AAC1E,QAAI,OAAO,UAAU,QAAW;AAC9B,mBAAa,QAAQ,OAAO,KAAK;AAAA,IACnC;AACA,UAAM,KAAK,SAAS;AAAA,EACtB;AAEA,SAAO,WAAW,MAAM,KAAK,GAAG,CAAC;AACnC;AAMO,SAAS,gBAAmB,QAAgC;AACjE,QAAM,YAAY,eAAe,OAAO,KAAK;AAE7C,MAAI,MAAM,GAAG,OAAO,GAAG,IAAI,SAAS,IAAI,kBAAkB,OAAO,SAAS,CAAC;AAC3E,MAAI,OAAO,UAAU,QAAW;AAC9B,WAAO,QAAQ,OAAO,KAAK;AAAA,EAC7B;AAEA,SAAO,WAAW,GAAG;AACvB;AASO,SAAS,kBAAkB,GAAc,GAAsB;AACpE,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,WAAO,EAAE,SAAS,EAAE;AAAA,EACtB;AACA,MAAI,EAAE,YAAY,EAAE,SAAS;AAC3B,WAAO,EAAE,UAAU,EAAE;AAAA,EACvB;AACA,SAAO,EAAE,OAAO,cAAc,EAAE,MAAM;AACxC;;;AChEO,IAAM,kBAAN,MAAsB;AAAA,EAI3B,YAAY,QAAgB,GAAG;AAC7B,SAAK,QAAQ;AACb,SAAK,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC,EAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAsB,KAAwB;AAE5C,SAAK,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC,EAAE;AAIpC,UAAM,WAAW,IAAI,YAAY;AAEjC,eAAW,CAAC,KAAK,OAAO,KAAK,SAAS,OAAO;AAC3C,UAAI,QAAQ,OAAO,GAAG;AACpB,cAAM,SAAS,OAAO,GAAG;AACzB,cAAM,YAAY,eAAe,QAAQ,OAAO;AAChD,cAAM,WAAW,WAAW,MAAM,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAChE,aAAK,WAAW,KAAK,MAAM,QAAQ,WAAW,UAAU,CAAC;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAU,KAAa,SAA4C;AACjE,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAE7D,QAAI,QAAQ,SAAS,GAAG;AAEtB,WAAK,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,IAC7C,OAAO;AACL,YAAM,YAAY,eAAe,KAAK,OAAO;AAC7C,WAAK,WAAW,KAAK,MAAM,KAAK,WAAW,UAAU,CAAC;AAAA,IACxD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAO,KAAmB;AACxB,UAAM,WAAW,WAAW,GAAG,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC7D,SAAK,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,EAC7C;AAAA,EAEQ,WACN,MACA,KACA,WACA,UACA,OACQ;AAER,QAAI,SAAS,KAAK,OAAO;AACvB,UAAI,CAAC,KAAK,QAAS,MAAK,UAAU,oBAAI,IAAI;AAC1C,WAAK,QAAQ,IAAI,KAAK,SAAS;AAG/B,UAAIC,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,WAAW,UAAU,QAAQ,CAAC;AAG9E,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,EAEQ,WACN,MACA,KACA,UACA,OACQ;AAER,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,WAAK,WAAW,KAAK,SAAS,UAAU,GAAG,KAAK,UAAU,QAAQ,CAAC;AAAA,IACrE;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;AAAA;AAAA;AAAA,EAKA,cAAsB;AACpB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,MAA2C;AACjD,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,EAMA,WAAW,MAAsC;AAC/C,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,EAMA,gBAAgB,MAAwB;AACtC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,QAAI,CAAC,QAAQ,CAAC,KAAK,QAAS,QAAO,CAAC;AACpC,WAAO,MAAM,KAAK,KAAK,QAAQ,KAAK,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,MAAc,eAAiD;AAC1E,UAAM,WAAW,oBAAI,IAAY;AACjC,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,UAAM,eAAe,MAAM,WAAW,oBAAI,IAAI;AAG9C,eAAW,CAAC,KAAK,IAAI,KAAK,cAAc;AACtC,YAAM,aAAa,cAAc,IAAI,GAAG;AACxC,UAAI,eAAe,UAAa,eAAe,MAAM;AACnD,iBAAS,IAAI,GAAG;AAAA,MAClB;AAAA,IACF;AAGA,eAAW,OAAO,cAAc,KAAK,GAAG;AACtC,UAAI,CAAC,aAAa,IAAI,GAAG,GAAG;AAC1B,iBAAS,IAAI,GAAG;AAAA,MAClB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,MAAmC;AAChD,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,WAAO,MAAM,WAAW,oBAAI,IAAI;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,MAAuB;AAC5B,UAAM,OAAO,KAAK,QAAQ,IAAI;AAC9B,WAAO,SAAS,UAAa,KAAK,YAAY,UAAa,KAAK,QAAQ,OAAO;AAAA,EACjF;AACF;;;ACjNO,IAAM,QAAN,MAAkB;AAAA,EAiBvB,YAAY,KAAU;AAOtB,SAAQ,YAA+B,CAAC;AANtC,SAAK,MAAM;AACX,SAAK,QAAQ,oBAAI,IAAI;AACrB,SAAK,aAAa,oBAAI,IAAI;AAC1B,SAAK,aAAa,IAAI,gBAAgB;AAAA,EACxC;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,iBAAiB,GAAG;AACzB,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,iBAAiB,GAAG;AACzB,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKO,QAAc;AACnB,SAAK,MAAM,MAAM;AACjB,SAAK,WAAW,MAAM;AACtB,SAAK,aAAa,IAAI,gBAAgB;AACtC,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;AAAA,EAMO,MAAM,KAAQ,QAAiC;AACpD,QAAI,KAAK,WAAW,IAAI,OAAO,GAAG,EAAG,QAAO;AAE5C,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,iBAAiB,GAAG;AACzB,SAAK,OAAO;AACZ,WAAO;AAAA,EACT;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;AAC5C,aAAK,iBAAiB,GAAG;AAEzB;AAAA,MACF;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,MAAM,OAA0B;AACrC,UAAM,cAAc,oBAAI,IAAO;AAG/B,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;AAC3B,wBAAY,IAAI,GAAG;AAAA,UACrB;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;AACtB,sBAAY,IAAI,GAAG;AAAA,QACrB;AAAA,MACF;AACA,UAAI,YAAY,SAAS,GAAG;AAC1B,aAAK,MAAM,OAAO,GAAG;AAAA,MACvB;AAAA,IACF;AAGA,eAAW,OAAO,aAAa;AAC7B,WAAK,iBAAiB,GAAG;AAAA,IAC3B;AAEA,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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,gBAAiC;AACtC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,cAAmC;AACxC,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,YAAY,KAAK;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,UAAe;AACpB,WAAO,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,cAAc,KAAiD;AACpE,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYO,SACL,KACA,eACA,mBAA6B,CAAC,GACd;AAChB,QAAI,QAAQ;AACZ,QAAI,UAAU;AAGd,eAAW,OAAO,kBAAkB;AAClC,UAAI,CAAC,KAAK,WAAW,IAAI,GAAG,GAAG;AAC7B,aAAK,WAAW,IAAI,GAAG;AAAA,MACzB;AAAA,IACF;AAGA,QAAI,cAAc,KAAK,MAAM,IAAI,GAAG;AACpC,QAAI,CAAC,aAAa;AAChB,oBAAc,oBAAI,IAAI;AACtB,WAAK,MAAM,IAAI,KAAK,WAAW;AAAA,IACjC;AAGA,eAAW,OAAO,YAAY,KAAK,GAAG;AACpC,UAAI,KAAK,WAAW,IAAI,GAAG,GAAG;AAC5B,oBAAY,OAAO,GAAG;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,gBAAgB,eAAe;AAExC,UAAI,KAAK,WAAW,IAAI,aAAa,GAAG,GAAG;AACzC;AAAA,MACF;AAEA,YAAM,cAAc,YAAY,IAAI,aAAa,GAAG;AAEpD,UAAI,CAAC,aAAa;AAEhB,oBAAY,IAAI,aAAa,KAAK,YAAY;AAC9C;AAAA,MACF,WAAW,kBAAkB,aAAa,WAAW,YAAY,SAAS,IAAI,GAAG;AAE/E,oBAAY,IAAI,aAAa,KAAK,YAAY;AAC9C;AAAA,MACF;AAIA,WAAK,IAAI,OAAO,aAAa,SAAS;AAAA,IACxC;AAGA,QAAI,YAAY,SAAS,GAAG;AAC1B,WAAK,MAAM,OAAO,GAAG;AAAA,IACvB;AAGA,SAAK,iBAAiB,GAAG;AAEzB,QAAI,QAAQ,KAAK,UAAU,GAAG;AAC5B,WAAK,OAAO;AAAA,IACd;AAEA,WAAO,EAAE,OAAO,QAAQ;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKO,aAAa,KAAsB;AACxC,WAAO,KAAK,WAAW,IAAI,GAAG;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAiB,KAAc;AACrC,UAAM,SAAS,OAAO,GAAG;AACzB,UAAM,SAAS,KAAK,MAAM,IAAI,GAAG;AAEjC,QAAI,CAAC,UAAU,OAAO,SAAS,GAAG;AAChC,WAAK,WAAW,OAAO,MAAM;AAAA,IAC/B,OAAO;AACL,WAAK,WAAW,OAAO,QAAQ,MAAM;AAAA,IACvC;AAAA,EACF;AACF;;;ACxdA,SAAS,MAAM,cAAc;AAQtB,SAAS,UAAU,MAA2B;AACnD,SAAO,KAAK,IAAI;AAClB;AAQO,SAAS,YAAyB,MAAmC;AAE1E,QAAM,SAAS,gBAAgB,cAAc,IAAI,WAAW,IAAI,IAAI;AACpE,SAAO,OAAO,MAAM;AACtB;;;ACPO,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,SAAS,SAAS;AAOX,IAAM,qBAAqB,EAAE,KAAK;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAMM,IAAM,kBAAkB,EAAE,OAAO;AAAA,EACtC,QAAQ,EAAE,OAAO;AAAA,EACjB,SAAS,EAAE,OAAO;AAAA,EAClB,QAAQ,EAAE,OAAO;AACnB,CAAC;AAEM,IAAM,kBAAkB,EAAE,OAAO;AAAA,EACtC,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACxB,WAAW;AAAA,EACX,OAAO,EAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,OAAO,EAAE,IAAI;AAAA,EACb,WAAW;AAAA,EACX,KAAK,EAAE,OAAO;AAAA,EACd,OAAO,EAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAIM,IAAM,oBAAoB,EAAE,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,EAAE,KAAK,MAAM,EAAE,OAAO;AAAA,EACvE,IAAI;AAAA,EACJ,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACxB,UAAU,EAAE,MAAM,mBAAmB,EAAE,SAAS;AAClD,CAAC,CAAC;AAIK,IAAM,cAAc,EAAE,OAAO;AAAA,EAClC,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,WAAW,oBAAoB,SAAS;AAAA,EACxC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,KAAK,CAAC,OAAO,MAAM,CAAC,CAAC,EAAE,SAAS;AAAA,EAC7D,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,QAAQ,EAAE,OAAO,EAAE,SAAS;AAC9B,CAAC;AAIM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,IAAI,EAAE,OAAO,EAAE,SAAS;AAAA,EACxB,SAAS,EAAE,OAAO;AAAA,EAClB,KAAK,EAAE,OAAO;AAAA;AAAA;AAAA,EAGd,QAAQ,EAAE,OAAO,EAAE,SAAS;AAAA,EAC5B,QAAQ,gBAAgB,SAAS,EAAE,SAAS;AAAA,EAC5C,UAAU,kBAAkB,SAAS,EAAE,SAAS;AAAA,EAChD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA;AAAA,EAEtC,cAAc,mBAAmB,SAAS;AAAA,EAC1C,SAAS,EAAE,OAAO,EAAE,SAAS;AAC/B,CAAC;AAIM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,OAAO,EAAE,OAAO;AAClB,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,OAAO;AAAA,IAClB,OAAO;AAAA,EACT,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,EACpB,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS;AACX,CAAC;AAEM,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,MAAM,EAAE,QAAQ,UAAU;AAAA,EAC1B,SAAS,EAAE,OAAO;AAAA,IAChB,KAAK,EAAE,MAAM,cAAc;AAAA;AAAA,IAE3B,cAAc,mBAAmB,SAAS;AAAA,IAC1C,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,CAAC;AACH,CAAC;AAEM,IAAM,wBAAwB,EAAE,OAAO;AAAA,EAC5C,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,EAClB,mBAAmB,EAAE,OAAO,EAAE,SAAS;AACzC,CAAC;AAEM,IAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,MAAM,EAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,UAAU,EAAE,OAAO;AAAA,IACnB,WAAW;AAAA,EACb,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,EAAE,OAAO;AAAA,EACnD,MAAM,EAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA,EAC1C,CAAC;AACH,CAAC;AAEM,IAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,MAAM,EAAE,QAAQ,gBAAgB;AAAA,EAChC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,QAAQ;AAAA,IACV,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAEM,IAAM,+BAA+B,EAAE,OAAO;AAAA,EACnD,MAAM,EAAE,QAAQ,mBAAmB;AAAA,EACnC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,EACjB,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO;AAAA,IACpB,MAAM,EAAE,OAAO;AAAA,IACf,KAAK,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,CAAC;AACH,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,cAAc;AAAA,EAC9B,SAAS,EAAE,OAAO;AAAA,IAChB,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,IAC/B,MAAM,EAAE,OAAO;AAAA,IACf,cAAc,EAAE,OAAO;AAAA,EACzB,CAAC;AACH,CAAC;AAIM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,mBAAmB,EAAE,OAAO;AAAA,EACvC,MAAM,EAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,EAClB,CAAC;AACH,CAAC;AAEM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,MAAM,EAAE,QAAQ,WAAW;AAAA,EAC3B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,IAChB,MAAM,EAAE,IAAI;AAAA,EACd,CAAC;AACH,CAAC;AAEM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,eAAe;AAAA,EAC/B,SAAS,EAAE,OAAO;AAAA,IAChB,OAAO,EAAE,OAAO;AAAA,IAChB,MAAM,EAAE,IAAI;AAAA,IACZ,aAAa,EAAE,OAAO,EAAE,SAAS;AAAA,IACjC,WAAW,EAAE,OAAO;AAAA,EACtB,CAAC;AACH,CAAC;AAIM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,WAAW,EAAE,OAAO;AAAA;AACtB,CAAC;AAEM,IAAM,oBAAoB,EAAE,OAAO;AAAA,EACxC,MAAM,EAAE,QAAQ,MAAM;AAAA,EACtB,WAAW,EAAE,OAAO;AAAA;AAAA,EACpB,YAAY,EAAE,OAAO;AAAA;AACvB,CAAC;AASM,IAAM,qBAAqB,EAAE,OAAO;AAAA,EACzC,MAAM,EAAE,QAAQ,OAAO;AAAA,EACvB,OAAO,EAAE,OAAO;AAAA,EAChB,MAAM,EAAE,WAAW,UAAU;AAC/B,CAAC;AAQM,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,MAAM,EAAE,QAAQ,iBAAiB;AAAA,EACjC,SAAS,EAAE,OAAO;AAAA,EAClB,UAAU,EAAE,OAAO;AAAA,EACnB,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA;AAAA,EAC7C,mBAAmB,EAAE,OAAO,EAAE,SAAS;AACzC,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,sBAAsB;AAAA,EACtC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,UAAU,EAAE,OAAO;AAAA,IACnB,WAAW;AAAA,EACb,CAAC;AACH,CAAC;AAKM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,MAAM,EAAE,QAAQ,yBAAyB;AAAA,EACzC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAAA,EAC1C,CAAC;AACH,CAAC;AAKM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,MAAM,EAAE,QAAQ,yBAAyB;AAAA,EACzC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,EACjB,CAAC;AACH,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,sBAAsB;AAAA,EACtC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,OAAO;AAAA,IACf,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAKM,IAAM,yBAAyB,EAAE,OAAO;AAAA,EAC7C,MAAM,EAAE,QAAQ,oBAAoB;AAAA,EACpC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,EAC1B,CAAC;AACH,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,qBAAqB;AAAA,EACrC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAKM,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,MAAM,EAAE,QAAQ,iBAAiB;AAAA,EACjC,SAAS,EAAE,OAAO;AAAA,IAChB,SAAS,EAAE,OAAO;AAAA,IAClB,SAAS,EAAE,MAAM,EAAE,OAAO;AAAA,MACxB,KAAK,EAAE,OAAO;AAAA,MACd,SAAS,EAAE,MAAM,iBAAiB;AAAA,MAClC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA,IAChC,CAAC,CAAC;AAAA,EACJ,CAAC;AACH,CAAC;AAOM,IAAM,iBAAiB,EAAE,OAAO;AAAA,EACrC,MAAM,EAAE,OAAO;AAAA,EACf,SAAS,EAAE,QAAQ;AAAA,EACnB,eAAe;AAAA,EACf,OAAO,EAAE,OAAO,EAAE,SAAS;AAC7B,CAAC;AAMM,IAAM,qBAAqB,EAAE,OAAO;AAAA,EACzC,MAAM,EAAE,QAAQ,QAAQ;AAAA,EACxB,SAAS,EAAE,OAAO;AAAA;AAAA,IAEhB,QAAQ,EAAE,OAAO;AAAA;AAAA,IAEjB,eAAe,mBAAmB,SAAS;AAAA;AAAA,IAE3C,SAAS,EAAE,MAAM,cAAc,EAAE,SAAS;AAAA,EAC5C,CAAC;AACH,CAAC;AAKM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,MAAM,EAAE,QAAQ,aAAa;AAAA,EAC7B,SAAS,EAAE,OAAO;AAAA;AAAA,IAEhB,MAAM,EAAE,OAAO;AAAA;AAAA,IAEf,QAAQ,EAAE,OAAO;AAAA;AAAA,IAEjB,MAAM,EAAE,OAAO,EAAE,SAAS;AAAA,EAC5B,CAAC;AACH,CAAC;AAIM,IAAM,gBAAgB,EAAE,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;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;;;ACpZM,IAAK,eAAL,kBAAKC,kBAAL;AAQL,EAAAA,cAAA,qBAAkB;AAQlB,EAAAA,cAAA,YAAS;AAQT,EAAAA,cAAA,aAAU;AAQV,EAAAA,cAAA,gBAAa;AAQb,EAAAA,cAAA,eAAY;AAxCF,SAAAA;AAAA,GAAA;AA8CL,IAAM,gCAAgC;AAwEtC,IAAM,sBAA+C;AAAA,EAC1D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AASO,SAAS,uBACd,UACA,QACS;AACT,QAAM,cAAc,oBAAoB,QAAQ,MAAM;AACtD,QAAM,gBAAgB,KAAK;AAAA,IACzB,GAAG,MAAM,KAAK,QAAQ,EAAE,IAAI,CAAC,MAAM,oBAAoB,QAAQ,CAAC,CAAC;AAAA,EACnE;AACA,SAAO,iBAAiB;AAC1B;AAQO,SAAS,4BACd,UACc;AACd,WAAS,IAAI,oBAAoB,SAAS,GAAG,KAAK,GAAG,KAAK;AACxD,QAAI,SAAS,IAAI,oBAAoB,CAAC,CAAC,GAAG;AACxC,aAAO,oBAAoB,CAAC;AAAA,IAC9B;AAAA,EACF;AACA,SAAO;AACT;","names":["h","h","WriteConcern"]}

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@topgunbuild/core",
-  "version": "0.2.0",
+  "version": "0.2.1",
   "main": "./dist/index.js",
   "module": "./dist/index.mjs",
   "types": "./dist/index.d.ts",
@@ -19,12 +19,17 @@
     "access": "public"
   },
   "devDependencies": {
-    "typescript": "^5.0.0"
+    "fast-check": "^4.4.0",
+    "typescript": "^5.0.0",
+    "vitest": "^4.0.16"
   },
   "dependencies": {
-    "@msgpack/msgpack": "^3.1.2",
+    "msgpackr": "^1.11.8",
     "zod": "^4.1.13"
   },
+  "optionalDependencies": {
+    "@topgunbuild/native": "0.2.1"
+  },
   "engines": {
     "node": ">=18"
   },
@@ -32,6 +37,8 @@
   "scripts": {
     "build": "tsup",
     "test": "jest",
-    "test:coverage": "jest --coverage"
+    "test:coverage": "jest --coverage",
+    "bench": "vitest bench --run",
+    "bench:watch": "vitest bench"
   }
 }