@hashtree/core 0.1.0

package/dist/hashtree.js

@@ -0,0 +1,557 @@
+/**
+ * HashTree - Unified merkle tree operations
+ *
+ * Single class for creating, reading, and editing content-addressed merkle trees.
+ *
+ * All files are encrypted by default using CHK (Content Hash Key) encryption.
+ * Use the "Public" variants (putFilePublic, readFilePublic) for unencrypted storage.
+ */
+import { LinkType, toHex, cid } from './types.js';
+import { tryDecodeTreeNode } from './codec.js';
+import { StreamWriter } from './streaming.js';
+export { StreamWriter } from './streaming.js';
+export { verifyTree } from './verify.js';
+import * as create from './tree/create.js';
+import * as read from './tree/read.js';
+import * as edit from './tree/edit.js';
+import { putFileEncrypted, readFileEncrypted, readFileEncryptedStream, readFileEncryptedRange, putDirectoryEncrypted, listDirectoryEncrypted, getTreeNodeEncrypted, } from './encrypted.js';
+import * as editEncrypted from './tree/editEncrypted.js';
+import * as writeAtOps from './tree/writeAt.js';
+/** Default chunk size: 2MB (optimized for blossom uploads) */
+export const DEFAULT_CHUNK_SIZE = 2 * 1024 * 1024;
+/**
+ * HashTree - create, read, and edit merkle trees
+ */
+export class HashTree {
+    store;
+    chunkSize;
+    constructor(config) {
+        this.store = config.store;
+        this.chunkSize = config.chunkSize ?? DEFAULT_CHUNK_SIZE;
+    }
+    get config() {
+        return { store: this.store, chunkSize: this.chunkSize };
+    }
+    // Create (encrypted by default)
+    async putBlob(data) {
+        return create.putBlob(this.store, data);
+    }
+    /**
+     * Store a file
+     * @param data - File data to store
+     * @param options - { unencrypted?: boolean } - if true, store without encryption
+     * @returns { cid, size }
+     */
+    async putFile(data, options) {
+        if (options?.unencrypted) {
+            const result = await create.putFile(this.config, data);
+            return { cid: { hash: result.hash }, size: result.size };
+        }
+        const result = await putFileEncrypted(this.config, data);
+        return { cid: cid(result.hash, result.key), size: result.size };
+    }
+    /**
+     * Store a directory
+     * @param entries - Directory entries
+     * @param options - { unencrypted?: boolean } - if true, store without encryption
+     * @returns { cid, size }
+     */
+    async putDirectory(entries, options) {
+        const size = entries.reduce((sum, e) => sum + e.size, 0);
+        if (options?.unencrypted) {
+            const dirEntries = entries.map(e => ({
+                name: e.name,
+                cid: e.cid,
+                size: e.size,
+                type: e.type,
+                meta: e.meta,
+            }));
+            const hash = await create.putDirectory(this.config, dirEntries);
+            return { cid: { hash }, size };
+        }
+        // Encrypted by default
+        const encryptedEntries = entries.map(e => ({
+            name: e.name,
+            hash: e.cid.hash,
+            size: e.size,
+            key: e.cid.key,
+            type: e.type,
+            meta: e.meta,
+        }));
+        const result = await putDirectoryEncrypted(this.config, encryptedEntries);
+        return { cid: cid(result.hash, result.key), size };
+    }
+    // Read
+    async getBlob(hash) {
+        return read.getBlob(this.store, hash);
+    }
+    /**
+     * Get a tree node
+     */
+    async getTreeNode(id) {
+        if (id.key) {
+            return getTreeNodeEncrypted(this.store, id.hash, id.key);
+        }
+        return read.getTreeNode(this.store, id.hash);
+    }
+    async getType(id) {
+        if (!id?.hash)
+            return LinkType.Blob;
+        return read.getType(this.store, id.hash);
+    }
+    async isDirectory(id) {
+        if (!id?.hash)
+            return false;
+        // For encrypted directories, we need to decrypt to check the node type
+        if (id.key) {
+            try {
+                // Try to get the tree node (will decrypt and validate)
+                const node = await getTreeNodeEncrypted(this.store, id.hash, id.key);
+                if (!node)
+                    return false;
+                // Empty directory is still a directory
+                if (node.links.length === 0)
+                    return true;
+                // Check if it's a directory (has named entries) vs chunked file (no names)
+                return node.links.some(l => l.name !== undefined && !l.name.startsWith('_'));
+            }
+            catch {
+                return false;
+            }
+        }
+        return read.isDirectory(this.store, id.hash);
+    }
+    /**
+     * Read a file
+     */
+    async readFile(id) {
+        if (id.key) {
+            return readFileEncrypted(this.store, id.hash, id.key);
+        }
+        return read.readFile(this.store, id.hash);
+    }
+    /**
+     * Stream a file
+     * @param id - CID of the file
+     * @param options - { offset?: number, prefetch?: number }
+     */
+    async *readFileStream(id, options = {}) {
+        if (id.key) {
+            yield* readFileEncryptedStream(this.store, id.hash, id.key, options);
+        }
+        else {
+            yield* read.readFileStream(this.store, id.hash, options);
+        }
+    }
+    /**
+     * Read a range of bytes from a file
+     */
+    async readFileRange(id, start, end) {
+        if (id.key) {
+            return readFileEncryptedRange(this.store, id.hash, id.key, start, end);
+        }
+        return read.readFileRange(this.store, id.hash, start, end);
+    }
+    /**
+     * List directory entries
+     */
+    async listDirectory(id) {
+        if (id.key) {
+            const entries = await listDirectoryEncrypted(this.store, id.hash, id.key);
+            return entries.map(e => ({
+                name: e.name,
+                cid: cid(e.hash, e.key),
+                size: e.size,
+                type: e.type ?? LinkType.Blob,
+                meta: e.meta,
+            }));
+        }
+        const entries = await read.listDirectory(this.store, id.hash);
+        return entries.map(e => ({
+            name: e.name,
+            cid: e.cid,
+            size: e.size,
+            type: e.type,
+            meta: e.meta,
+        }));
+    }
+    /**
+     * Resolve a path to get the entry's CID
+     *
+     * @param root - Root CID of the tree
+     * @param path - Path to resolve (string like 'a/b/file.txt' or array like ['a', 'b', 'file.txt'])
+     * @returns { cid, type } or null if not found
+     */
+    async resolvePath(root, path) {
+        const parts = Array.isArray(path)
+            ? path
+            : path.split('/').filter(p => p.length > 0);
+        let current = root;
+        let entryType = LinkType.Dir;
+        for (const segment of parts) {
+            const entries = await this.listDirectory(current);
+            const entry = entries.find(e => e.name === segment);
+            if (!entry) {
+                return null;
+            }
+            current = entry.cid;
+            entryType = entry.type;
+        }
+        return { cid: current, type: entryType };
+    }
+    async getSize(hash) {
+        return read.getSize(this.store, hash);
+    }
+    async *walk(hash, path = '') {
+        yield* read.walk(this.store, hash, path);
+    }
+    /**
+     * Walk entire tree and return all entries as an array
+     * More convenient than the async generator for most use cases
+     * @param id - Root CID of the tree
+     * @param options.includeData - If true, include file data in results
+     * @param options.filesOnly - If true, only return files (not directories)
+     */
+    async walkTree(id, options) {
+        const results = [];
+        const walkRecursive = async (currentCid, currentPath) => {
+            const isDir = await this.isDirectory(currentCid);
+            if (isDir) {
+                if (!options?.filesOnly) {
+                    const entries = await this.listDirectory(currentCid);
+                    const dirSize = entries.reduce((sum, e) => sum + e.size, 0);
+                    results.push({ path: currentPath, cid: currentCid, type: LinkType.Dir, size: dirSize });
+                }
+                const entries = await this.listDirectory(currentCid);
+                for (const entry of entries) {
+                    const childPath = currentPath ? `${currentPath}/${entry.name}` : entry.name;
+                    await walkRecursive(entry.cid, childPath);
+                }
+            }
+            else {
+                // File or blob
+                const type = await this.getType(currentCid);
+                const size = await this.getSize(currentCid.hash);
+                const result = {
+                    path: currentPath,
+                    cid: currentCid,
+                    type,
+                    size,
+                };
+                if (options?.includeData) {
+                    const data = await this.readFile(currentCid);
+                    if (data)
+                        result.data = data;
+                }
+                results.push(result);
+            }
+        };
+        await walkRecursive(id, '');
+        return results;
+    }
+    /**
+     * Iterate over all raw blocks in a merkle tree
+     * Yields each block's hash and data, traversing encrypted nodes correctly
+     * Useful for syncing to remote stores (e.g., Blossom push)
+     */
+    async *walkBlocks(id) {
+        const visited = new Set();
+        const traverse = async function* (store, hash, key) {
+            const hex = toHex(hash);
+            if (visited.has(hex))
+                return;
+            visited.add(hex);
+            const data = await store.get(hash);
+            if (!data)
+                return;
+            yield { hash, data };
+            // Handle encrypted vs unencrypted tree nodes
+            if (key) {
+                const decrypted = await getTreeNodeEncrypted(store, hash, key);
+                if (decrypted) {
+                    for (const link of decrypted.links) {
+                        yield* traverse(store, link.hash, link.key);
+                    }
+                }
+            }
+            else {
+                const node = tryDecodeTreeNode(data);
+                if (node) {
+                    for (const link of node.links) {
+                        yield* traverse(store, link.hash, link.key);
+                    }
+                }
+            }
+        };
+        yield* traverse(this.store, id.hash, id.key);
+    }
+    /**
+     * Pull (fetch) all chunks for a tree recursively
+     * Triggers WebRTC fetches for any missing chunks
+     * Uses parallel fetching within each tree level for better performance
+     * @returns { cid, chunks, bytes } - The CID and stats about what was pulled
+     */
+    async pull(id) {
+        const visited = new Set();
+        let chunks = 0;
+        let bytes = 0;
+        const fetch = async (hash, key) => {
+            const hex = toHex(hash);
+            if (visited.has(hex))
+                return;
+            visited.add(hex);
+            // Fetch the chunk (will go to WebRTC peers if not local)
+            const data = await this.store.get(hash);
+            if (!data) {
+                return;
+            }
+            chunks++;
+            bytes += data.length;
+            // If there's an encryption key, try to decrypt and check if it's a tree node
+            // For encrypted data, we can't use isTreeNode on the raw bytes
+            if (key) {
+                const decrypted = await getTreeNodeEncrypted(this.store, hash, key);
+                if (decrypted) {
+                    // It's an encrypted tree node - fetch all children in parallel
+                    await Promise.all(decrypted.links.map(link => fetch(link.hash, link.key)));
+                }
+                // If decryption failed or not a tree node, it's a blob (already fetched)
+            }
+            else {
+                // Unencrypted data - check directly
+                const node = tryDecodeTreeNode(data);
+                if (node) {
+                    // Fetch all children in parallel
+                    await Promise.all(node.links.map(link => fetch(link.hash, link.key)));
+                }
+                // If not a tree node, it's a blob (already fetched)
+            }
+        };
+        await fetch(id.hash, id.key);
+        return { cid: id, chunks, bytes };
+    }
+    /**
+     * Push all chunks for a tree to a target store
+     * Useful for syncing to remote stores (e.g., Blossom servers)
+     * @param id - CID of the tree to push
+     * @param targetStore - Store to push blocks to (must support put())
+     * @param options - callbacks for progress and per-block status
+     * @returns { cid, pushed, skipped, failed, bytes, errors } - The CID and detailed stats
+     */
+    async push(id, targetStore, options) {
+        // First pull to ensure all blocks are available locally
+        await this.pull(id);
+        // Check if already aborted
+        if (options?.signal?.aborted) {
+            return { cid: id, pushed: 0, skipped: 0, failed: 0, bytes: 0, errors: [], cancelled: true };
+        }
+        let pushed = 0;
+        let skipped = 0;
+        let failed = 0;
+        let bytes = 0;
+        let completed = 0;
+        let discovered = 0;
+        let walkDone = false;
+        const errors = [];
+        const concurrency = options?.concurrency ?? 4;
+        // Bounded queue for producer-consumer pattern
+        const queue = [];
+        const maxQueueSize = concurrency * 2;
+        let queueResolve = null;
+        let consumerResolve = null;
+        // Process a single block
+        const processBlock = async (block) => {
+            if (options?.signal?.aborted)
+                return;
+            const { hash, data } = block;
+            try {
+                const isNew = await targetStore.put(hash, data);
+                if (isNew === false) {
+                    skipped++;
+                    options?.onBlock?.(hash, 'skipped');
+                }
+                else {
+                    pushed++;
+                    bytes += data.length;
+                    options?.onBlock?.(hash, 'success');
+                }
+            }
+            catch (e) {
+                failed++;
+                const error = e instanceof Error ? e : new Error(String(e));
+                errors.push({ hash, error });
+                options?.onBlock?.(hash, 'error', error);
+            }
+            completed++;
+            // Report progress: completed / discovered (discovered grows as we walk)
+            options?.onProgress?.(completed, discovered);
+        };
+        // Consumer: pull from queue and process
+        const runConsumer = async () => {
+            const active = [];
+            while (!walkDone || queue.length > 0 || active.length > 0) {
+                if (options?.signal?.aborted)
+                    break;
+                // Start new tasks from queue
+                while (active.length < concurrency && queue.length > 0) {
+                    const block = queue.shift();
+                    // Signal producer that queue has space
+                    if (queueResolve && queue.length < maxQueueSize) {
+                        queueResolve();
+                        queueResolve = null;
+                    }
+                    const promise = processBlock(block).then(() => {
+                        active.splice(active.indexOf(promise), 1);
+                    });
+                    active.push(promise);
+                }
+                // If queue empty but walk not done, wait for producer
+                if (queue.length === 0 && !walkDone && active.length < concurrency) {
+                    await new Promise(resolve => {
+                        consumerResolve = resolve;
+                    });
+                    continue;
+                }
+                // Wait for at least one task to complete
+                if (active.length > 0) {
+                    await Promise.race(active);
+                }
+            }
+            await Promise.all(active);
+        };
+        // Producer: walk tree and push to queue
+        const runProducer = async () => {
+            for await (const block of this.walkBlocks(id)) {
+                if (options?.signal?.aborted)
+                    break;
+                discovered++;
+                // Wait if queue is full
+                while (queue.length >= maxQueueSize) {
+                    await new Promise(resolve => {
+                        queueResolve = resolve;
+                    });
+                    if (options?.signal?.aborted)
+                        break;
+                }
+                queue.push(block);
+                // Wake up consumer
+                if (consumerResolve) {
+                    consumerResolve();
+                    consumerResolve = null;
+                }
+            }
+            walkDone = true;
+            // Wake consumer one last time
+            if (consumerResolve) {
+                consumerResolve();
+                consumerResolve = null;
+            }
+        };
+        // Run producer and consumer in parallel
+        await Promise.all([runProducer(), runConsumer()]);
+        return { cid: id, pushed, skipped, failed, bytes, errors, cancelled: options?.signal?.aborted ?? false };
+    }
+    // Edit operations
+    /**
+     * Add or update an entry in a directory
+     * @param root - Root CID of the tree
+     * @param path - Path to the directory containing the entry
+     * @param name - Name of the entry
+     * @param entry - CID of the entry content
+     * @param size - Size of the content
+     * @param type - Type of the entry (LinkType.Blob, LinkType.File, or LinkType.Dir)
+     * @returns New root CID
+     */
+    async setEntry(root, path, name, entry, size, type = LinkType.Blob, meta) {
+        if (root.key) {
+            const result = await editEncrypted.setEntryEncrypted(this.config, root.hash, root.key, path, name, entry.hash, size, entry.key, type, meta);
+            return cid(result.hash, result.key);
+        }
+        const hash = await edit.setEntry(this.config, root.hash, path, name, entry, size, type, meta);
+        return { hash };
+    }
+    /**
+     * Remove an entry from a directory
+     * @param root - Root CID of the tree
+     * @param path - Path to the directory containing the entry
+     * @param name - Name of the entry to remove
+     * @returns New root CID
+     */
+    async removeEntry(root, path, name) {
+        if (root.key) {
+            const result = await editEncrypted.removeEntryEncrypted(this.config, root.hash, root.key, path, name);
+            return cid(result.hash, result.key);
+        }
+        const hash = await edit.removeEntry(this.config, root.hash, path, name);
+        return { hash };
+    }
+    /**
+     * Rename an entry in a directory
+     * @param root - Root CID of the tree
+     * @param path - Path to the directory containing the entry
+     * @param oldName - Current name
+     * @param newName - New name
+     * @returns New root CID
+     */
+    async renameEntry(root, path, oldName, newName) {
+        if (root.key) {
+            const result = await editEncrypted.renameEntryEncrypted(this.config, root.hash, root.key, path, oldName, newName);
+            return cid(result.hash, result.key);
+        }
+        const hash = await edit.renameEntry(this.config, root.hash, path, oldName, newName);
+        return { hash };
+    }
+    /**
+     * Move an entry to a different directory
+     * @param root - Root CID of the tree
+     * @param sourcePath - Path to the source directory
+     * @param name - Name of the entry to move
+     * @param targetPath - Path to the target directory
+     * @returns New root CID
+     */
+    async moveEntry(root, sourcePath, name, targetPath) {
+        if (root.key) {
+            const result = await editEncrypted.moveEntryEncrypted(this.config, root.hash, root.key, sourcePath, name, targetPath);
+            return cid(result.hash, result.key);
+        }
+        const hash = await edit.moveEntry(this.config, root.hash, sourcePath, name, targetPath);
+        return { hash };
+    }
+    /**
+     * Write data at a specific offset in a file
+     * Only affected chunks are rewritten - efficient for small patches to large files.
+     * Useful for updating file headers (e.g., WebM duration) without rewriting entire file.
+     *
+     * @param fileCid - CID of the file to modify
+     * @param offset - Byte offset to write at
+     * @param data - Data to write
+     * @returns New file CID
+     */
+    async writeAt(fileCid, offset, data) {
+        if (fileCid.key) {
+            const result = await writeAtOps.writeAtEncrypted(this.config, fileCid.hash, fileCid.key, offset, data);
+            return cid(result.hash, result.key);
+        }
+        const result = await writeAtOps.writeAt(this.config, fileCid.hash, offset, data);
+        return { hash: result.hash };
+    }
+    // Utility
+    getStore() {
+        return this.store;
+    }
+    /**
+     * Create a streaming file writer for incremental appends
+     * Useful for writing large files chunk by chunk (e.g., video recording)
+     * @param options.unencrypted - if true, create without encryption
+     * @param options.chunker - custom chunker for variable chunk sizes (e.g., videoChunker for faster start)
+     */
+    createStream(options) {
+        return new StreamWriter({
+            store: this.store,
+            chunkSize: this.chunkSize,
+            chunker: options?.chunker,
+            unencrypted: options?.unencrypted ?? false,
+        });
+    }
+}
+//# sourceMappingURL=hashtree.js.map

package/dist/hashtree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hashtree.js","sourceRoot":"","sources":["../src/hashtree.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAA8B,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAC9E,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,MAAM,MAAM,kBAAkB,CAAC;AAC3C,OAAO,KAAK,IAAI,MAAM,gBAAgB,CAAC;AACvC,OAAO,KAAK,IAAI,MAAM,gBAAgB,CAAC;AACvC,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB,EACrB,sBAAsB,EACtB,oBAAoB,GAErB,MAAM,gBAAgB,CAAC;AACxB,OAAO,KAAK,aAAa,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAC;AAEhD,8DAA8D;AAC9D,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAuBlD;;GAEG;AACH,MAAM,OAAO,QAAQ;IACX,KAAK,CAAQ;IACb,SAAS,CAAS;IAE1B,YAAY,MAAsB;QAChC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,kBAAkB,CAAC;IAC1D,CAAC;IAED,IAAY,MAAM;QAChB,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IAC1D,CAAC;IAED,gCAAgC;IAEhC,KAAK,CAAC,OAAO,CAAC,IAAgB;QAC5B,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CACX,IAAgB,EAChB,OAAmC;QAEnC,IAAI,OAAO,EAAE,WAAW,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACvD,OAAO,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3D,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACzD,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;IAClE,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAChB,OAAmB,EACnB,OAAmC;QAEnC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzD,IAAI,OAAO,EAAE,WAAW,EAAE,CAAC;YACzB,MAAM,UAAU,GAAsB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,GAAG,EAAE,CAAC,CAAC,GAAG;gBACV,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC,CAAC;YACJ,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAChE,OAAO,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC;QACjC,CAAC;QACD,uBAAuB;QACvB,MAAM,gBAAgB,GAAwB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9D,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI;YAChB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;SACb,CAAC,CAAC,CAAC;QACJ,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;QAC1E,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;IACrD,CAAC;IAED,OAAO;IAEP,KAAK,CAAC,OAAO,CAAC,IAAU;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,EAAO;QACvB,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,oBAAoB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAO;QACnB,IAAI,CAAC,EAAE,EAAE,IAAI;YAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;QACpC,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,EAAO;QACvB,IAAI,CAAC,EAAE,EAAE,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5B,uEAAuE;QACvE,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,IAAI,CAAC;gBACH,uDAAuD;gBACvD,MAAM,IAAI,GAAG,MAAM,oBAAoB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBACrE,IAAI,CAAC,IAAI;oBAAE,OAAO,KAAK,CAAC;gBACxB,uCAAuC;gBACvC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACzC,2EAA2E;gBAC3E,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAO;QACpB,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAC,cAAc,CACnB,EAAO,EACP,UAAkD,EAAE;QAEpD,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,KAAK,CAAC,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,EAAO,EAAE,KAAa,EAAE,GAAY;QACtD,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,sBAAsB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,EAAO;QACzB,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YACX,MAAM,OAAO,GAAG,MAAM,sBAAsB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1E,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACvB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC;gBACvB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI;gBAC7B,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC,CAAC;QACN,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9D,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACvB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;SACb,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,WAAW,CACf,IAAS,EACT,IAAuB;QAEvB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YAC/B,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE9C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,SAAS,GAAa,QAAQ,CAAC,GAAG,CAAC;QAEvC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC;YACpB,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC;QACzB,CAAC;QAED,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,IAAU;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,CAAC,IAAI,CACT,IAAU,EACV,OAAe,EAAE;QAEjB,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ,CACZ,EAAO,EACP,OAAwD;QAExD,MAAM,OAAO,GAAuF,EAAE,CAAC;QAEvG,MAAM,aAAa,GAAG,KAAK,EAAE,UAAe,EAAE,WAAmB,EAAiB,EAAE;YAClF,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAEjD,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;oBACrD,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;oBAC5D,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;gBAC1F,CAAC;gBAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;gBACrD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC5B,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;oBAC5E,MAAM,aAAa,CAAC,KAAK,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,eAAe;gBACf,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBAC5C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;gBACjD,MAAM,MAAM,GAAgF;oBAC1F,IAAI,EAAE,WAAW;oBACjB,GAAG,EAAE,UAAU;oBACf,IAAI;oBACJ,IAAI;iBACL,CAAC;gBAEF,IAAI,OAAO,EAAE,WAAW,EAAE,CAAC;oBACzB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBAC7C,IAAI,IAAI;wBAAE,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC/B,CAAC;gBAED,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAC,UAAU,CAAC,EAAO;QACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,QAAQ,GAAG,KAAK,SAAS,CAAC,EAC9B,KAAY,EACZ,IAAU,EACV,GAAgB;YAEhB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACxB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO;YAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEjB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAErB,6CAA6C;YAC7C,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC/D,IAAI,SAAS,EAAE,CAAC;oBACd,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;wBACnC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC9C,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBACrC,IAAI,IAAI,EAAE,CAAC;oBACT,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;wBAC9B,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC9C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,IAAI,CAAC,EAAO;QAChB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,MAAM,KAAK,GAAG,KAAK,EAAE,IAAU,EAAE,GAAgB,EAAiB,EAAE;YAClE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACxB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO;YAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEjB,yDAAyD;YACzD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO;YACT,CAAC;YAED,MAAM,EAAE,CAAC;YACT,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;YAErB,6EAA6E;YAC7E,+DAA+D;YAC/D,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBACpE,IAAI,SAAS,EAAE,CAAC;oBACd,+DAA+D;oBAC/D,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC7E,CAAC;gBACD,yEAAyE;YAC3E,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBACrC,IAAI,IAAI,EAAE,CAAC;oBACT,iCAAiC;oBACjC,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;gBACD,oDAAoD;YACtD,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,IAAI,CACR,EAAO,EACP,WAAkB,EAClB,OAOC;QAUD,wDAAwD;QACxD,MAAM,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEpB,2BAA2B;QAC3B,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;YAC7B,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;QAC9F,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,MAAM,GAAwC,EAAE,CAAC;QAEvD,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,CAAC,CAAC;QAE9C,8CAA8C;QAC9C,MAAM,KAAK,GAA4C,EAAE,CAAC;QAC1D,MAAM,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC;QACrC,IAAI,YAAY,GAAwB,IAAI,CAAC;QAC7C,IAAI,eAAe,GAAwB,IAAI,CAAC;QAEhD,yBAAyB;QACzB,MAAM,YAAY,GAAG,KAAK,EAAE,KAAuC,EAAE,EAAE;YACrE,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO;gBAAE,OAAO;YAErC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAChD,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;oBACpB,OAAO,EAAE,CAAC;oBACV,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,MAAM,EAAE,CAAC;oBACT,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;oBACrB,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,MAAM,EAAE,CAAC;gBACT,MAAM,KAAK,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC7B,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YAC3C,CAAC;YACD,SAAS,EAAE,CAAC;YACZ,wEAAwE;YACxE,OAAO,EAAE,UAAU,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAC/C,CAAC,CAAC;QAEF,wCAAwC;QACxC,MAAM,WAAW,GAAG,KAAK,IAAI,EAAE;YAC7B,MAAM,MAAM,GAAoB,EAAE,CAAC;YAEnC,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1D,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO;oBAAE,MAAM;gBAEpC,6BAA6B;gBAC7B,OAAO,MAAM,CAAC,MAAM,GAAG,WAAW,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;oBAC7B,uCAAuC;oBACvC,IAAI,YAAY,IAAI,KAAK,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;wBAChD,YAAY,EAAE,CAAC;wBACf,YAAY,GAAG,IAAI,CAAC;oBACtB,CAAC;oBACD,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;wBAC5C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC5C,CAAC,CAAC,CAAC;oBACH,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACvB,CAAC;gBAED,sDAAsD;gBACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,MAAM,GAAG,WAAW,EAAE,CAAC;oBACnE,MAAM,IAAI,OAAO,CAAO,OAAO,CAAC,EAAE;wBAChC,eAAe,GAAG,OAAO,CAAC;oBAC5B,CAAC,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBAED,yCAAyC;gBACzC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YAED,MAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC,CAAC;QAEF,wCAAwC;QACxC,MAAM,WAAW,GAAG,KAAK,IAAI,EAAE;YAC7B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO;oBAAE,MAAM;gBAEpC,UAAU,EAAE,CAAC;gBAEb,wBAAwB;gBACxB,OAAO,KAAK,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;oBACpC,MAAM,IAAI,OAAO,CAAO,OAAO,CAAC,EAAE;wBAChC,YAAY,GAAG,OAAO,CAAC;oBACzB,CAAC,CAAC,CAAC;oBACH,IAAI,OAAO,EAAE,MAAM,EAAE,OAAO;wBAAE,MAAM;gBACtC,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAElB,mBAAmB;gBACnB,IAAI,eAAe,EAAE,CAAC;oBACpB,eAAe,EAAE,CAAC;oBAClB,eAAe,GAAG,IAAI,CAAC;gBACzB,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;YAChB,8BAA8B;YAC9B,IAAI,eAAe,EAAE,CAAC;gBACpB,eAAe,EAAE,CAAC;gBAClB,eAAe,GAAG,IAAI,CAAC;YACzB,CAAC;QACH,CAAC,CAAC;QAEF,wCAAwC;QACxC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QAElD,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,IAAI,KAAK,EAAE,CAAC;IAC3G,CAAC;IAED,kBAAkB;IAElB;;;;;;;;;OASG;IACH,KAAK,CAAC,QAAQ,CACZ,IAAS,EACT,IAAc,EACd,IAAY,EACZ,KAAU,EACV,IAAY,EACZ,OAAiB,QAAQ,CAAC,IAAI,EAC9B,IAA8B;QAE9B,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,iBAAiB,CAClD,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,GAAG,EACR,IAAI,EACJ,IAAI,EACJ,KAAK,CAAC,IAAI,EACV,IAAI,EACJ,KAAK,CAAC,GAAG,EACT,IAAI,EACJ,IAAI,CACL,CAAC;YACF,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9F,OAAO,EAAE,IAAI,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,WAAW,CAAC,IAAS,EAAE,IAAc,EAAE,IAAY;QACvD,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,oBAAoB,CACrD,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,GAAG,EACR,IAAI,EACJ,IAAI,CACL,CAAC;YACF,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACxE,OAAO,EAAE,IAAI,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,WAAW,CACf,IAAS,EACT,IAAc,EACd,OAAe,EACf,OAAe;QAEf,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,oBAAoB,CACrD,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,GAAG,EACR,IAAI,EACJ,OAAO,EACP,OAAO,CACR,CAAC;YACF,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACpF,OAAO,EAAE,IAAI,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,SAAS,CACb,IAAS,EACT,UAAoB,EACpB,IAAY,EACZ,UAAoB;QAEpB,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,kBAAkB,CACnD,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,GAAG,EACR,UAAU,EACV,IAAI,EACJ,UAAU,CACX,CAAC;YACF,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,OAAO,CAAC,OAAY,EAAE,MAAc,EAAE,IAAgB;QAC1D,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,gBAAgB,CAC9C,IAAI,CAAC,MAAM,EACX,OAAO,CAAC,IAAI,EACZ,OAAO,CAAC,GAAG,EACX,MAAM,EACN,IAAI,CACL,CAAC;YACF,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;IAC/B,CAAC;IAED,UAAU;IAEV,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,OAAgE;QAC3E,OAAO,IAAI,YAAY,CAAC;YACtB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,OAAO,EAAE,OAAO;YACzB,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,KAAK;SAC3C,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * HashTree - Simple content-addressed merkle tree storage
+ *
+ * Browser-first, ESM-only library for building merkle trees
+ * with content-hash addressing: SHA256(content) -> content
+ */
+export type { Hash, CID, TreeNode, Blob, Link, Store, StoreWithMeta, RefResolver, RefResolverListEntry, SubscribeVisibilityInfo, PublishOptions, PublishResult, RefResolver as RootResolver, } from './types.js';
+export { LinkType, toHex, fromHex, cid, } from './types.js';
+export { sha256 } from './hash.js';
+export { encryptChk, decryptChk, contentHash, encryptedSizeChk, encrypt, decrypt, generateKey, keyToHex, keyFromHex, encryptedSize, plaintextSize, type EncryptionKey, } from './crypto.js';
+export { encodeTreeNode, decodeTreeNode, tryDecodeTreeNode, encodeAndHash, getNodeType, } from './codec.js';
+export { MemoryStore } from './store/memory.js';
+export { OpfsStore, type OpfsStoreOptions } from './store/opfs.js';
+export { BlossomStore, type BlossomStoreConfig, type BlossomServer, type BlossomSigner, type BlossomAuthEvent, type BlossomLogEntry, type BlossomLogger, type BlossomUploadCallback, } from './store/blossom.js';
+export { DexieStore } from './store/dexie.js';
+export { HashTree, StreamWriter, verifyTree, DEFAULT_CHUNK_SIZE, type HashTreeConfig, type TreeEntry, type DirEntry, } from './hashtree.js';
+export type { StreamOptions } from './tree/read.js';
+export { type Chunker, fixedChunker, videoChunker, } from './builder.js';
+export { WebRTCStore, DEFAULT_RELAYS, Peer, PeerId, generateUuid, type SignalingMessage, type WebRTCStoreConfig, type PeerStatus, type WebRTCStoreEvent, type WebRTCStoreEventHandler, type EventSigner, type EventEncrypter, type EventDecrypter, type GiftWrapper, type GiftUnwrapper, type SignedEvent, type PeerPool, type PeerClassifier, type PoolConfig, type WebRTCStats, } from './webrtc/index.js';
+export { BEP52_BLOCK_SIZE, ZERO_HASH, Bep52TreeBuilder, Bep52StreamBuilder, type Bep52Result, type Bep52Config, } from './bep52.js';
+export * as bep52 from './bep52.js';
+export { createNostrRefResolver, createNostrRefResolver as createNostrRootResolver, type NostrRefResolverConfig, type NostrRefResolverConfig as NostrRootResolverConfig, type NostrEvent, type NostrFilter, type Nip19Like, type VisibilityCallbacks, } from './resolver/index.js';
+export { nhashEncode, nhashDecode, npathEncode, npathDecode, decode, isNHash, isNPath, NHashTypeGuard, BECH32_REGEX, type NHashData, type NPathData, type DecodeResult, } from './nhash.js';
+export { generateLinkKey, computeKeyId, encryptKeyForLink, decryptKeyFromLink, hex as visibilityHex, type TreeVisibility, } from './visibility.js';
+export type { WorkerRequest, WorkerResponse, WorkerConfig, NostrFilter as WorkerNostrFilter, UnsignedEvent as WorkerUnsignedEvent, SignedEvent as WorkerSignedEvent, PeerStats as WorkerPeerStats, RelayStats as WorkerRelayStats, DirEntry as WorkerDirEntry, SocialGraphEvent as WorkerSocialGraphEvent, BlossomUploadProgress as WorkerBlossomUploadProgress, BlossomServerStatus as WorkerBlossomServerStatus, BlossomServerConfig as WorkerBlossomServerConfig, MediaRequest, MediaResponse, WebRTCCommand, WebRTCEvent, } from './worker/protocol.js';
+export { generateRequestId } from './worker/protocol.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,YAAY,EACV,IAAI,EACJ,GAAG,EACH,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,aAAa,EACb,WAAW,EACX,oBAAoB,EACpB,uBAAuB,EACvB,cAAc,EACd,aAAa,EAEb,WAAW,IAAI,YAAY,GAC5B,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,QAAQ,EACR,KAAK,EACL,OAAO,EACP,GAAG,GACJ,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAGnC,OAAO,EAEL,UAAU,EACV,UAAU,EACV,WAAW,EACX,gBAAgB,EAEhB,OAAO,EACP,OAAO,EACP,WAAW,EACX,QAAQ,EACR,UAAU,EACV,aAAa,EACb,aAAa,EACb,KAAK,aAAa,GACnB,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,cAAc,EACd,cAAc,EACd,iBAAiB,EACjB,aAAa,EACb,WAAW,GACZ,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,KAAK,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnE,OAAO,EACL,YAAY,EACZ,KAAK,kBAAkB,EACvB,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACpB,KAAK,aAAa,EAClB,KAAK,qBAAqB,GAC3B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAG9C,OAAO,EACL,QAAQ,EACR,YAAY,EACZ,UAAU,EACV,kBAAkB,EAClB,KAAK,cAAc,EACnB,KAAK,SAAS,EACd,KAAK,QAAQ,GACd,MAAM,eAAe,CAAC;AAGvB,YAAY,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAGpD,OAAO,EACL,KAAK,OAAO,EACZ,YAAY,EACZ,YAAY,GACb,MAAM,cAAc,CAAC;AAGtB,OAAO,EACL,WAAW,EACX,cAAc,EACd,IAAI,EACJ,MAAM,EACN,YAAY,EACZ,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,KAAK,UAAU,EACf,KAAK,gBAAgB,EACrB,KAAK,uBAAuB,EAC5B,KAAK,WAAW,EAChB,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,KAAK,WAAW,EAChB,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,QAAQ,EACb,KAAK,cAAc,EACnB,KAAK,UAAU,EACf,KAAK,WAAW,GACjB,MAAM,mBAAmB,CAAC;AAK3B,OAAO,EACL,gBAAgB,EAChB,SAAS,EACT,gBAAgB,EAChB,kBAAkB,EAClB,KAAK,WAAW,EAChB,KAAK,WAAW,GACjB,MAAM,YAAY,CAAC;AAGpB,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAGpC,OAAO,EACL,sBAAsB,EAEtB,sBAAsB,IAAI,uBAAuB,EACjD,KAAK,sBAAsB,EAE3B,KAAK,sBAAsB,IAAI,uBAAuB,EACtD,KAAK,UAAU,EACf,KAAK,WAAW,EAChB,KAAK,SAAS,EACd,KAAK,mBAAmB,GACzB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,WAAW,EACX,WAAW,EACX,WAAW,EACX,WAAW,EACX,MAAM,EACN,OAAO,EACP,OAAO,EACP,cAAc,EACd,YAAY,EACZ,KAAK,SAAS,EACd,KAAK,SAAS,EACd,KAAK,YAAY,GAClB,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,eAAe,EACf,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,EAClB,GAAG,IAAI,aAAa,EACpB,KAAK,cAAc,GACpB,MAAM,iBAAiB,CAAC;AAGzB,YAAY,EACV,aAAa,EACb,cAAc,EACd,YAAY,EACZ,WAAW,IAAI,iBAAiB,EAChC,aAAa,IAAI,mBAAmB,EACpC,WAAW,IAAI,iBAAiB,EAChC,SAAS,IAAI,eAAe,EAC5B,UAAU,IAAI,gBAAgB,EAC9B,QAAQ,IAAI,cAAc,EAC1B,gBAAgB,IAAI,sBAAsB,EAC1C,qBAAqB,IAAI,2BAA2B,EACpD,mBAAmB,IAAI,yBAAyB,EAChD,mBAAmB,IAAI,yBAAyB,EAChD,YAAY,EACZ,aAAa,EAEb,aAAa,EACb,WAAW,GACZ,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/index.js

@@ -0,0 +1,44 @@
+/**
+ * HashTree - Simple content-addressed merkle tree storage
+ *
+ * Browser-first, ESM-only library for building merkle trees
+ * with content-hash addressing: SHA256(content) -> content
+ */
+export { LinkType, toHex, fromHex, cid, } from './types.js';
+// Hash utilities
+export { sha256 } from './hash.js';
+// Encryption utilities
+export { 
+// CHK (Content Hash Key) encryption - deterministic, enables deduplication
+encryptChk, decryptChk, contentHash, encryptedSizeChk, 
+// Legacy encryption with random IV (deprecated, use CHK)
+encrypt, decrypt, generateKey, keyToHex, keyFromHex, encryptedSize, plaintextSize, } from './crypto.js';
+// MessagePack codec
+export { encodeTreeNode, decodeTreeNode, tryDecodeTreeNode, encodeAndHash, getNodeType, } from './codec.js';
+// Storage adapters
+export { MemoryStore } from './store/memory.js';
+export { OpfsStore } from './store/opfs.js';
+export { BlossomStore, } from './store/blossom.js';
+export { DexieStore } from './store/dexie.js';
+// HashTree - unified tree operations (create, read, edit, stream)
+export { HashTree, StreamWriter, verifyTree, DEFAULT_CHUNK_SIZE, } from './hashtree.js';
+// Chunker utilities
+export { fixedChunker, videoChunker, } from './builder.js';
+// WebRTC P2P store
+export { WebRTCStore, DEFAULT_RELAYS, Peer, PeerId, generateUuid, } from './webrtc/index.js';
+// BEP52 (BitTorrent v2) compatible merkle tree
+// Main API: Bep52TreeBuilder, Bep52StreamBuilder
+// Low-level functions available via: import { bep52 } from '@hashtree/core'
+export { BEP52_BLOCK_SIZE, ZERO_HASH, Bep52TreeBuilder, Bep52StreamBuilder, } from './bep52.js';
+// Re-export low-level BEP52 merkle functions as namespace
+export * as bep52 from './bep52.js';
+// Ref resolvers
+export { createNostrRefResolver, 
+// Legacy alias
+createNostrRefResolver as createNostrRootResolver, } from './resolver/index.js';
+// Bech32 identifiers (nhash, npath)
+export { nhashEncode, nhashDecode, npathEncode, npathDecode, decode, isNHash, isNPath, NHashTypeGuard, BECH32_REGEX, } from './nhash.js';
+// Tree visibility utilities (public/link-visible/private)
+export { generateLinkKey, computeKeyId, encryptKeyForLink, decryptKeyFromLink, hex as visibilityHex, } from './visibility.js';
+export { generateRequestId } from './worker/protocol.js';
+//# sourceMappingURL=index.js.map