@hashtree/core 0.1.0

package/dist/tree/read.js

@@ -0,0 +1,389 @@
+/**
+ * Tree reading operations
+ */
+import { LinkType, toHex, cid } from '../types.js';
+import { decodeTreeNode, tryDecodeTreeNode, getNodeType } from '../codec.js';
+/**
+ * Get raw data by hash
+ */
+export async function getBlob(store, hash) {
+    return store.get(hash);
+}
+/**
+ * Get and decode a tree node
+ */
+export async function getTreeNode(store, hash) {
+    const data = await store.get(hash);
+    if (!data)
+        return null;
+    return tryDecodeTreeNode(data);
+}
+/**
+ * Get the type of a chunk by hash: File, Dir, or Blob
+ */
+export async function getType(store, hash) {
+    if (!hash)
+        return LinkType.Blob;
+    const data = await store.get(hash);
+    if (!data)
+        return LinkType.Blob;
+    return getNodeType(data);
+}
+/**
+ * Check if hash points to a directory (tree with named links)
+ */
+export async function isDirectory(store, hash) {
+    if (!hash)
+        return false;
+    const data = await store.get(hash);
+    if (!data)
+        return false;
+    const node = tryDecodeTreeNode(data);
+    return node?.type === LinkType.Dir;
+}
+/**
+ * Read a complete file (reassemble chunks if needed)
+ */
+export async function readFile(store, hash) {
+    if (!hash)
+        return null;
+    const data = await store.get(hash);
+    if (!data)
+        return null;
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        return data;
+    }
+    return assembleChunks(store, node);
+}
+async function assembleChunks(store, node) {
+    // Fetch all children in parallel
+    const childPromises = node.links.map(async (link) => {
+        const childData = await store.get(link.hash);
+        if (!childData) {
+            throw new Error(`Missing chunk: ${toHex(link.hash)}`);
+        }
+        if (link.type !== LinkType.Blob) {
+            // Intermediate tree node - decode and recurse (parallel recursion)
+            const childNode = decodeTreeNode(childData);
+            return assembleChunks(store, childNode);
+        }
+        else {
+            // Leaf chunk - raw blob
+            return childData;
+        }
+    });
+    // Wait for all children to complete
+    const parts = await Promise.all(childPromises);
+    const totalLength = parts.reduce((sum, p) => sum + p.length, 0);
+    const result = new Uint8Array(totalLength);
+    let offset = 0;
+    for (const part of parts) {
+        result.set(part, offset);
+        offset += part.length;
+    }
+    return result;
+}
+/**
+ * Read a file with streaming
+ * Supports prefetching for better network performance
+ */
+export async function* readFileStream(store, hash, options = {}) {
+    const { offset = 0, prefetch = 1 } = options;
+    const data = await store.get(hash);
+    if (!data)
+        return;
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        if (offset >= data.length)
+            return;
+        yield offset > 0 ? data.slice(offset) : data;
+        return;
+    }
+    yield* streamChunksWithOffset(store, node, offset, prefetch);
+}
+/**
+ * Stream chunks starting from an offset with prefetching
+ * Uses link.size to efficiently skip chunks before offset
+ * Prefetches N chunks ahead for better network performance
+ */
+async function* streamChunksWithOffset(store, node, offset, prefetch = 1) {
+    let position = 0;
+    // Find first link index that we need (skip those before offset)
+    let startIdx = 0;
+    for (let i = 0; i < node.links.length; i++) {
+        const linkSize = node.links[i].size ?? 0;
+        if (linkSize > 0 && position + linkSize <= offset) {
+            position += linkSize;
+            startIdx = i + 1;
+        }
+        else {
+            break;
+        }
+    }
+    // Build list of links to process
+    const linksToProcess = node.links.slice(startIdx);
+    if (linksToProcess.length === 0)
+        return;
+    const prefetchQueue = [];
+    // Start initial prefetch
+    let prefetchPosition = position;
+    for (let i = 0; i < Math.min(prefetch, linksToProcess.length); i++) {
+        const link = linksToProcess[i];
+        prefetchQueue.push({
+            promise: store.get(link.hash),
+            link,
+            position: prefetchPosition,
+        });
+        prefetchPosition += link.size ?? 0;
+    }
+    // Process links
+    let nextPrefetchIdx = prefetch;
+    for (const link of linksToProcess) {
+        // Get data from prefetch queue (should be first item)
+        const entry = prefetchQueue.shift();
+        if (!entry) {
+            throw new Error('Prefetch queue empty unexpectedly');
+        }
+        const childData = await entry.promise;
+        if (!childData) {
+            throw new Error(`Missing chunk: ${toHex(link.hash)}`);
+        }
+        // Start prefetching next chunk
+        if (nextPrefetchIdx < linksToProcess.length) {
+            const nextLink = linksToProcess[nextPrefetchIdx];
+            prefetchQueue.push({
+                promise: store.get(nextLink.hash),
+                link: nextLink,
+                position: prefetchPosition,
+            });
+            prefetchPosition += nextLink.size ?? 0;
+            nextPrefetchIdx++;
+        }
+        if (link.type !== LinkType.Blob) {
+            // Intermediate tree node - decode and recurse with prefetch
+            const childNode = decodeTreeNode(childData);
+            const childOffset = Math.max(0, offset - entry.position);
+            yield* streamChunksWithOffset(store, childNode, childOffset, prefetch);
+            position = entry.position + (link.size ?? 0);
+        }
+        else {
+            // Leaf chunk - raw blob
+            const chunkStart = entry.position;
+            const chunkEnd = entry.position + childData.length;
+            position = chunkEnd;
+            if (chunkEnd <= offset) {
+                // Entire chunk is before offset, skip
+                continue;
+            }
+            if (chunkStart >= offset) {
+                // Entire chunk is after offset, yield all
+                yield childData;
+            }
+            else {
+                // Partial chunk - slice from offset
+                const sliceStart = offset - chunkStart;
+                yield childData.slice(sliceStart);
+            }
+        }
+    }
+}
+/**
+ * Read a range of bytes from a file
+ */
+export async function readFileRange(store, hash, start, end) {
+    const data = await store.get(hash);
+    if (!data)
+        return null;
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        // Single blob
+        if (start >= data.length)
+            return new Uint8Array(0);
+        const actualEnd = end !== undefined ? Math.min(end, data.length) : data.length;
+        return data.slice(start, actualEnd);
+    }
+    return readRangeFromNode(store, node, start, end);
+}
+async function readRangeFromNode(store, node, start, end) {
+    const parts = [];
+    let position = 0;
+    let bytesCollected = 0;
+    const maxBytes = end !== undefined ? end - start : Infinity;
+    for (const link of node.links) {
+        if (bytesCollected >= maxBytes)
+            break;
+        const linkSize = link.size ?? 0;
+        // Skip chunks entirely before start
+        if (linkSize > 0 && position + linkSize <= start) {
+            position += linkSize;
+            continue;
+        }
+        const childData = await store.get(link.hash);
+        if (!childData) {
+            throw new Error(`Missing chunk: ${toHex(link.hash)}`);
+        }
+        if (link.type !== LinkType.Blob) {
+            // Intermediate tree node - decode and recurse
+            const childNode = decodeTreeNode(childData);
+            const childStart = Math.max(0, start - position);
+            const childEnd = end !== undefined ? end - position : undefined;
+            const childData2 = await readRangeFromNode(store, childNode, childStart, childEnd);
+            if (childData2.length > 0) {
+                const take = Math.min(childData2.length, maxBytes - bytesCollected);
+                parts.push(childData2.slice(0, take));
+                bytesCollected += take;
+            }
+            position += linkSize;
+        }
+        else {
+            // Leaf chunk - raw blob
+            const chunkStart = position;
+            const chunkEnd = position + childData.length;
+            position = chunkEnd;
+            if (chunkEnd <= start) {
+                continue;
+            }
+            // Calculate slice bounds within this chunk
+            const sliceStart = Math.max(0, start - chunkStart);
+            const sliceEnd = end !== undefined
+                ? Math.min(childData.length, end - chunkStart)
+                : childData.length;
+            if (sliceStart < sliceEnd) {
+                const take = Math.min(sliceEnd - sliceStart, maxBytes - bytesCollected);
+                parts.push(childData.slice(sliceStart, sliceStart + take));
+                bytesCollected += take;
+            }
+        }
+    }
+    // Concatenate parts
+    const totalLength = parts.reduce((sum, p) => sum + p.length, 0);
+    const result = new Uint8Array(totalLength);
+    let offset = 0;
+    for (const part of parts) {
+        result.set(part, offset);
+        offset += part.length;
+    }
+    return result;
+}
+/**
+ * Get directory node, handling chunked directories
+ *
+ * For chunked directories (encoded blob > chunkSize), the chunks are assembled
+ * first, then decoded as a TreeNode.
+ */
+async function getDirectoryNode(store, hash) {
+    const data = await store.get(hash);
+    if (!data)
+        return null;
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        return null; // Not a tree node at all
+    }
+    // Check if it's a directory (has named links) vs chunked blob (no names)
+    if (node.type === LinkType.Dir) {
+        return node;
+    }
+    // It's a chunked blob - could be a chunked directory
+    // Assemble the chunks and check if result is a directory
+    const assembled = await assembleChunks(store, node);
+    const assembledNode = tryDecodeTreeNode(assembled);
+    if (assembledNode?.type === LinkType.Dir) {
+        return assembledNode;
+    }
+    return null; // Not a directory
+}
+/**
+ * List directory entries
+ *
+ * Handles both small directories (single node) and large directories
+ * (chunked by bytes like files - reassembled then decoded).
+ */
+export async function listDirectory(store, hash) {
+    const node = await getDirectoryNode(store, hash);
+    if (!node)
+        return [];
+    const entries = [];
+    for (const link of node.links) {
+        if (!link.name)
+            continue; // Skip unnamed links (shouldn't happen in directories)
+        entries.push({
+            name: link.name,
+            cid: cid(link.hash, link.key),
+            size: link.size,
+            type: link.type,
+            meta: link.meta,
+        });
+    }
+    return entries;
+}
+/**
+ * Resolve a path within a tree
+ *
+ * Handles chunked directories (reassembles bytes to get the full TreeNode).
+ */
+export async function resolvePath(store, rootHash, path) {
+    const parts = path.split('/').filter(p => p.length > 0);
+    let currentHash = rootHash;
+    for (const part of parts) {
+        const node = await getDirectoryNode(store, currentHash);
+        if (!node)
+            return null;
+        const link = node.links.find(l => l.name === part);
+        if (!link)
+            return null;
+        currentHash = link.hash;
+    }
+    return currentHash;
+}
+/**
+ * Get total size of a tree
+ */
+export async function getSize(store, hash) {
+    const data = await store.get(hash);
+    if (!data)
+        return 0;
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        return data.length;
+    }
+    let total = 0;
+    for (const link of node.links) {
+        total += link.size;
+    }
+    return total;
+}
+/**
+ * Walk entire tree depth-first
+ *
+ * Handles chunked directories (reassembles bytes to get the full TreeNode).
+ */
+export async function* walk(store, hash, path = '') {
+    const data = await store.get(hash);
+    if (!data)
+        return;
+    // Check if it's a directory
+    const dirNode = await getDirectoryNode(store, hash);
+    if (dirNode) {
+        const dirSize = dirNode.links.reduce((sum, l) => sum + l.size, 0);
+        yield { path, hash, type: LinkType.Dir, size: dirSize };
+        for (const link of dirNode.links) {
+            if (!link.name)
+                continue;
+            const childPath = path ? `${path}/${link.name}` : link.name;
+            yield* walk(store, link.hash, childPath);
+        }
+        return;
+    }
+    // Not a directory - could be a file (single blob or chunked)
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        // Single blob file
+        yield { path, hash, type: LinkType.Blob, size: data.length };
+        return;
+    }
+    // Chunked file - sum link sizes
+    const fileSize = node.links.reduce((sum, l) => sum + l.size, 0);
+    yield { path, hash, type: LinkType.File, size: fileSize };
+}
+//# sourceMappingURL=read.js.map

package/dist/tree/read.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"read.js","sourceRoot":"","sources":["../../src/tree/read.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAyB,QAAQ,EAAE,KAAK,EAAO,GAAG,EAAE,MAAM,aAAa,CAAC;AAC/E,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAU7E;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,KAAY,EAAE,IAAU;IACpD,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAY,EAAE,IAAU;IACxD,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,KAAY,EAAE,IAAU;IACpD,IAAI,CAAC,IAAI;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;IAChC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAY,EAAE,IAAU;IACxD,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACxB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,OAAO,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,GAAG,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,KAAY,EAAE,IAAU;IACrD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACrC,CAAC;AAED,KAAK,UAAU,cAAc,CAAC,KAAY,EAAE,IAAc;IACxD,iCAAiC;IACjC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QAClD,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,mEAAmE;YACnE,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,OAAO,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,oCAAoC;IACpC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAE/C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACzB,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AASD;;;GAGG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,cAAc,CACnC,KAAY,EACZ,IAAU,EACV,UAAyB,EAAE;IAE3B,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;IAE7C,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO;IAElB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QAClC,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,OAAO;IACT,CAAC;IAED,KAAK,CAAC,CAAC,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC/D,CAAC;AAED;;;;GAIG;AACH,KAAK,SAAS,CAAC,CAAC,sBAAsB,CACpC,KAAY,EACZ,IAAc,EACd,MAAc,EACd,WAAmB,CAAC;IAEpB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,gEAAgE;IAChE,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC;YAClD,QAAQ,IAAI,QAAQ,CAAC;YACrB,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM;QACR,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAQxC,MAAM,aAAa,GAAoB,EAAE,CAAC;IAE1C,yBAAyB;IACzB,IAAI,gBAAgB,GAAG,QAAQ,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnE,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC/B,aAAa,CAAC,IAAI,CAAC;YACjB,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAC7B,IAAI;YACJ,QAAQ,EAAE,gBAAgB;SAC3B,CAAC,CAAC;QACH,gBAAgB,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,gBAAgB;IAChB,IAAI,eAAe,GAAG,QAAQ,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,sDAAsD;QACtD,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC;QACtC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,+BAA+B;QAC/B,IAAI,eAAe,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,QAAQ,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC;YACjD,aAAa,CAAC,IAAI,CAAC;gBACjB,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACjC,IAAI,EAAE,QAAQ;gBACd,QAAQ,EAAE,gBAAgB;aAC3B,CAAC,CAAC;YACH,gBAAgB,IAAI,QAAQ,CAAC,IAAI,IAAI,CAAC,CAAC;YACvC,eAAe,EAAE,CAAC;QACpB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,4DAA4D;YAC5D,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;YACzD,KAAK,CAAC,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;YACvE,QAAQ,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;YACnD,QAAQ,GAAG,QAAQ,CAAC;YAEpB,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;gBACvB,sCAAsC;gBACtC,SAAS;YACX,CAAC;YAED,IAAI,UAAU,IAAI,MAAM,EAAE,CAAC;gBACzB,0CAA0C;gBAC1C,MAAM,SAAS,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,MAAM,UAAU,GAAG,MAAM,GAAG,UAAU,CAAC;gBACvC,MAAM,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,KAAY,EACZ,IAAU,EACV,KAAa,EACb,GAAY;IAEZ,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,cAAc;QACd,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QAC/E,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;AACpD,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,KAAY,EACZ,IAAc,EACd,KAAa,EACb,GAAY;IAEZ,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,MAAM,QAAQ,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;IAE5D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,cAAc,IAAI,QAAQ;YAAE,MAAM;QAEtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;QAEhC,oCAAoC;QACpC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,QAAQ,IAAI,KAAK,EAAE,CAAC;YACjD,QAAQ,IAAI,QAAQ,CAAC;YACrB,SAAS;QACX,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,8CAA8C;YAC9C,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC;YACjD,MAAM,QAAQ,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YAChE,MAAM,UAAU,GAAG,MAAM,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;YACnF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,cAAc,CAAC,CAAC;gBACpE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,cAAc,IAAI,IAAI,CAAC;YACzB,CAAC;YACD,QAAQ,IAAI,QAAQ,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,MAAM,UAAU,GAAG,QAAQ,CAAC;YAC5B,MAAM,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;YAC7C,QAAQ,GAAG,QAAQ,CAAC;YAEpB,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;gBACtB,SAAS;YACX,CAAC;YAED,2CAA2C;YAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,CAAC;YACnD,MAAM,QAAQ,GAAG,GAAG,KAAK,SAAS;gBAChC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,GAAG,UAAU,CAAC;gBAC9C,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;YAErB,IAAI,UAAU,GAAG,QAAQ,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,UAAU,EAAE,QAAQ,GAAG,cAAc,CAAC,CAAC;gBACxE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC3D,cAAc,IAAI,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACzB,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IACxB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,gBAAgB,CAAC,KAAY,EAAE,IAAU;IACtD,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,CAAC,CAAC,yBAAyB;IACxC,CAAC;IAED,yEAAyE;IACzE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qDAAqD;IACrD,yDAAyD;IACzD,MAAM,SAAS,GAAG,MAAM,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAEpD,MAAM,aAAa,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACnD,IAAI,aAAa,EAAE,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,CAAC;QACzC,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,kBAAkB;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,KAAY,EAAE,IAAU;IAC1D,MAAM,IAAI,GAAG,MAAM,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjD,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,SAAS,CAAC,uDAAuD;QAEjF,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAY,EAAE,QAAc,EAAE,IAAY;IAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAExD,IAAI,WAAW,GAAG,QAAQ,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,gBAAgB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAEvB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAAC,KAAY,EAAE,IAAU;IACpD,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IAEpB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,IAAI,CACzB,KAAY,EACZ,IAAU,EACV,OAAe,EAAE;IAEjB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO;IAElB,4BAA4B;IAC5B,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpD,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAExD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEzB,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5D,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO;IACT,CAAC;IAED,6DAA6D;IAC7D,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,mBAAmB;QACnB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7D,OAAO;IACT,CAAC;IAED,gCAAgC;IAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAChE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAC5D,CAAC"}

package/dist/tree/writeAt.d.ts

@@ -0,0 +1,44 @@
+/**
+ * writeAt - Efficiently patch bytes at a specific offset without rewriting entire file
+ *
+ * Only affected chunks and their parent nodes are rewritten.
+ * For a large file with a small patch, this is much more efficient than putFile.
+ */
+import { Store, Hash } from '../types.js';
+import { type EncryptionKey } from '../crypto.js';
+export interface WriteAtConfig {
+    store: Store;
+    chunkSize: number;
+}
+export interface WriteAtResult {
+    /** New root hash after modification */
+    hash: Hash;
+    /** Total file size (unchanged) */
+    size: number;
+}
+export interface WriteAtEncryptedResult extends WriteAtResult {
+    /** New encryption key for the root */
+    key: EncryptionKey;
+}
+/**
+ * Write data at a specific offset in an unencrypted file
+ *
+ * @param config - Tree configuration
+ * @param rootHash - Current root hash of the file
+ * @param offset - Byte offset to write at
+ * @param data - Data to write
+ * @returns New root hash
+ */
+export declare function writeAt(config: WriteAtConfig, rootHash: Hash, offset: number, data: Uint8Array): Promise<WriteAtResult>;
+/**
+ * Write data at a specific offset in an encrypted file
+ *
+ * @param config - Tree configuration
+ * @param rootHash - Current root hash of the encrypted file
+ * @param rootKey - Current encryption key for the root
+ * @param offset - Byte offset to write at
+ * @param data - Data to write (plaintext)
+ * @returns New root hash and key
+ */
+export declare function writeAtEncrypted(config: WriteAtConfig, rootHash: Hash, rootKey: EncryptionKey, offset: number, data: Uint8Array): Promise<WriteAtEncryptedResult>;
+//# sourceMappingURL=writeAt.d.ts.map

package/dist/tree/writeAt.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"writeAt.d.ts","sourceRoot":"","sources":["../../src/tree/writeAt.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAmC,MAAM,aAAa,CAAC;AAG3E,OAAO,EAA0B,KAAK,aAAa,EAAE,MAAM,cAAc,CAAC;AAE1E,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,KAAK,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC5B,uCAAuC;IACvC,IAAI,EAAE,IAAI,CAAC;IACX,kCAAkC;IAClC,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,sBAAuB,SAAQ,aAAa;IAC3D,sCAAsC;IACtC,GAAG,EAAE,aAAa,CAAC;CACpB;AAED;;;;;;;;GAQG;AACH,wBAAsB,OAAO,CAC3B,MAAM,EAAE,aAAa,EACrB,QAAQ,EAAE,IAAI,EACd,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,aAAa,CAAC,CAuCxB;AAED;;;;;;;;;GASG;AACH,wBAAsB,gBAAgB,CACpC,MAAM,EAAE,aAAa,EACrB,QAAQ,EAAE,IAAI,EACd,OAAO,EAAE,aAAa,EACtB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,sBAAsB,CAAC,CA2CjC"}