swarm-deploy 0.1.0 → 0.3.0

package/dist/storage/tree-fs.js

@@ -0,0 +1,580 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.assertSymlinkCapable = assertSymlinkCapable;
+exports.createTreeRoot = createTreeRoot;
+exports.createTreeSubdirectory = createTreeSubdirectory;
+exports.openTreeFile = openTreeFile;
+exports.syncTreeDirectories = syncTreeDirectories;
+exports.walkTree = walkTree;
+exports.digestTree = digestTree;
+exports.inspectTreePath = inspectTreePath;
+exports.removeTree = removeTree;
+/**
+ * Safe recursive tree primitives over a {@link StorageAdapter}.
+ *
+ * Guarantees, stated precisely:
+ *
+ * - Containment is absolute. A tree root must be a normalized absolute path that
+ *   is a valid, direct child of its managed parent and is never a protected
+ *   layout directory. Tree-relative paths are validated component by component,
+ *   so no traversal, absolute path, or separator ever reaches the adapter.
+ * - Symbolic links, hard links, special files, and directory cycles are rejected
+ *   or never followed: members are classified with `lstat`, file opens use
+ *   `O_NOFOLLOW`, and removal unlinks links instead of traversing them.
+ * - Concurrent replacement of a directory is **detected, not prevented**. The
+ *   adapter is path-based (there is no `openat`), so a local actor swapping a
+ *   directory between a check and the following call cannot be excluded. Every
+ *   operation therefore captures the identity (`dev:ino`) of each ancestor it
+ *   relies on, verifies the whole chain immediately before and after each
+ *   mutating call, and fails closed when any identity changed. A mutation that
+ *   lands inside that unavoidable window is reported, not silently accepted.
+ *   Local actors remain outside the threat model; remote input can only reach
+ *   these functions through validated relative paths.
+ */
+const b4a_1 = __importDefault(require("b4a"));
+const error_code_js_1 = require("../error-code.js");
+const _path_1 = __importDefault(require("#path"));
+const errors_js_1 = require("../errors.js");
+const files_js_1 = require("../files.js");
+const hash_js_1 = require("../tar-protocol/hash.js");
+const tree_js_1 = require("../tar-protocol/tree.js");
+const layout_js_1 = require("./layout.js");
+const READ_BYTES = 64 * 1024;
+const INTERNAL_NAME = '.swarm-deploy';
+function treeError(code, message, cause = null) {
+    return new errors_js_1.SwarmDeployError(code, message, cause);
+}
+/** Keeps a stable coded error as is and wraps anything else, keeping it as the cause. */
+function coded(error, code, message) {
+    return error instanceof errors_js_1.SwarmDeployError ? error : treeError(code, message, error);
+}
+function assertSymlinkCapable(storage) {
+    if (typeof storage.symlink !== 'function' || typeof storage.readlink !== 'function') {
+        throw treeError(errors_js_1.ERRORS.UNSUPPORTED_STORAGE, 'Storage adapter does not support symbolic links');
+    }
+}
+// ---------------------------------------------------------------------------
+// Containment
+// ---------------------------------------------------------------------------
+function assertNormalizedAbsolute(value, label) {
+    if (typeof value !== 'string' ||
+        value.length === 0 ||
+        value.includes('\u0000') ||
+        !_path_1.default.isAbsolute(value) ||
+        _path_1.default.resolve(value) !== value) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, `Tree ${label} must be a normalized absolute path`);
+    }
+    return value;
+}
+function isProtectedPath(target, options) {
+    if (_path_1.default.basename(target) === INTERNAL_NAME)
+        return true;
+    if (_path_1.default.basename(_path_1.default.dirname(target)) === INTERNAL_NAME)
+        return true;
+    const { layout } = options;
+    if (!layout)
+        return false;
+    if ([...(0, layout_js_1.protectedDirectories)(layout), layout.lock].includes(target))
+        return true;
+    // Never address an ancestor of the storage root: that would contain everything.
+    const prefix = target.endsWith(_path_1.default.sep) ? target : `${target}${_path_1.default.sep}`;
+    return layout.root === target || layout.root.startsWith(prefix);
+}
+/** A mutable tree root: normalized, absolute, and not itself a protected directory. */
+function assertTreeRoot(treePath, options) {
+    const root = assertNormalizedAbsolute(treePath, 'root');
+    if (isProtectedPath(root, options)) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree root is a protected storage directory');
+    }
+    return root;
+}
+/** `treePath` must be a valid direct child of `parent`, and neither may be protected. */
+function assertManagedChild(treePath, parent, options) {
+    const child = assertNormalizedAbsolute(treePath, 'root');
+    const managedParent = assertNormalizedAbsolute(parent, 'parent');
+    if (child === managedParent) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree root cannot be its managed parent');
+    }
+    if (isProtectedPath(child, options)) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree root is a protected storage directory');
+    }
+    if (_path_1.default.dirname(child) !== managedParent) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree root must be a direct child of its parent');
+    }
+    (0, files_js_1.validateBasename)(_path_1.default.basename(child));
+    return { treePath: child, parent: managedParent };
+}
+// ---------------------------------------------------------------------------
+// Identity anchors
+// ---------------------------------------------------------------------------
+function isIdentityValue(value) {
+    return ((typeof value === 'number' && Number.isSafeInteger(value) && value >= 0) ||
+        (typeof value === 'bigint' && value >= 0n));
+}
+function anchorFrom(directory, stat, code) {
+    if (stat.isSymbolicLink() || !stat.isDirectory()) {
+        throw treeError(code, 'Unsafe tree directory');
+    }
+    if (!isIdentityValue(stat.dev) || !isIdentityValue(stat.ino)) {
+        throw treeError(code, 'Tree directory identity is unavailable');
+    }
+    return { path: directory, dev: stat.dev, ino: stat.ino };
+}
+async function captureAnchor(directory, storage, code) {
+    let stat;
+    try {
+        stat = await storage.lstat(directory);
+    }
+    catch (error) {
+        throw treeError(code, 'Unable to inspect tree directory', error);
+    }
+    return anchorFrom(directory, stat, code);
+}
+async function verifyAnchors(anchors, storage, code) {
+    for (const anchor of anchors) {
+        const actual = await captureAnchor(anchor.path, storage, code);
+        if (actual.dev !== anchor.dev || actual.ino !== anchor.ino) {
+            throw treeError(code, 'Tree directory was replaced during the operation');
+        }
+    }
+}
+/**
+ * Runs one adapter call between two verifications of every ancestor identity.
+ * An error raised by the call itself always wins over a verification failure
+ * that follows it, and is kept as the cause of the stable error.
+ */
+async function guarded(anchors, storage, code, message, operation) {
+    await verifyAnchors(anchors, storage, code);
+    let result;
+    try {
+        result = await operation();
+    }
+    catch (error) {
+        await verifyAnchors(anchors, storage, code).catch(() => { });
+        throw coded(error, code, message);
+    }
+    await verifyAnchors(anchors, storage, code);
+    return result;
+}
+/**
+ * Like {@link guarded}, for a leaf call whose own target may legitimately vanish.
+ * Only an ENOENT raised by the call itself is reported as `missing`, and only
+ * after the whole ancestor chain was verified again: if any ancestor, the root,
+ * or the managed parent is gone or replaced, verification throws instead.
+ */
+async function guardedLeaf(anchors, storage, code, message, operation) {
+    await verifyAnchors(anchors, storage, code);
+    let value;
+    try {
+        value = await operation();
+    }
+    catch (error) {
+        if ((0, error_code_js_1.isMissing)(error)) {
+            await verifyAnchors(anchors, storage, code);
+            return { missing: true };
+        }
+        await verifyAnchors(anchors, storage, code).catch(() => { });
+        throw coded(error, code, message);
+    }
+    await verifyAnchors(anchors, storage, code);
+    return { missing: false, value };
+}
+async function syncDirectory(directory, anchors, storage, code) {
+    await guarded(anchors, storage, code, 'Unable to synchronize tree directory', async () => {
+        const handle = await storage.open(directory, 'r');
+        try {
+            await handle.sync();
+        }
+        finally {
+            await handle.close();
+        }
+    });
+}
+// ---------------------------------------------------------------------------
+// Creation
+// ---------------------------------------------------------------------------
+/**
+ * Validates `relativePath`, then captures the identity of the tree root and of
+ * every intermediate directory, rejecting symbolic links and missing members.
+ */
+async function resolveParent(treePath, relativePath, kind, storage, options) {
+    const root = assertTreeRoot(treePath, options);
+    (0, tree_js_1.assertTreeEntryPath)(relativePath, kind);
+    const components = relativePath.split('/');
+    const anchors = [await captureAnchor(root, storage, errors_js_1.ERRORS.PROTOCOL_INVALID)];
+    let parent = root;
+    for (const component of components.slice(0, -1)) {
+        parent = _path_1.default.join(parent, component);
+        anchors.push(await captureAnchor(parent, storage, errors_js_1.ERRORS.PROTOCOL_INVALID));
+    }
+    return { anchors, parent, target: _path_1.default.join(parent, components[components.length - 1]) };
+}
+async function createTreeRoot(treePath, parent, storage, options = {}) {
+    const managed = assertManagedChild(treePath, parent, options);
+    const anchors = [await captureAnchor(managed.parent, storage, errors_js_1.ERRORS.PROTOCOL_INVALID)];
+    await guarded(anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to create tree root', () => storage.mkdir(managed.treePath, { mode: 0o700 }));
+    await syncDirectory(managed.parent, anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID);
+}
+async function createTreeSubdirectory(treePath, relativePath, storage, options = {}) {
+    const { anchors, target } = await resolveParent(treePath, relativePath, 'directory', storage, options);
+    await guarded(anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to create tree directory', () => storage.mkdir(target, { mode: 0o700 }));
+}
+async function openTreeFile(treePath, relativePath, storage, options = {}) {
+    const { anchors, target } = await resolveParent(treePath, relativePath, 'file', storage, options);
+    await verifyAnchors(anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID);
+    let handle;
+    try {
+        handle = await (0, layout_js_1.openSafeRegularFile)(target, 'create', storage);
+    }
+    catch (error) {
+        await verifyAnchors(anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID).catch(() => { });
+        throw coded(error, errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to create tree file');
+    }
+    try {
+        await verifyAnchors(anchors, storage, errors_js_1.ERRORS.PROTOCOL_INVALID);
+    }
+    catch (error) {
+        await handle.close().catch(() => { });
+        throw error;
+    }
+    return handle;
+}
+/** Synchronizes every directory in the tree, deepest first. */
+async function syncTreeDirectories(treePath, storage) {
+    const { root, entries } = await walkIdentities(treePath, storage);
+    const directories = [root];
+    for (const entry of entries) {
+        if (entry.kind === 'directory') {
+            directories.push({
+                path: _path_1.default.join(root.path, ...entry.path.split('/')),
+                dev: entry.identity.dev,
+                ino: entry.identity.ino
+            });
+        }
+    }
+    for (const directory of directories.reverse()) {
+        await syncDirectory(directory.path, [directory], storage, errors_js_1.ERRORS.PROTOCOL_INVALID);
+    }
+}
+// ---------------------------------------------------------------------------
+// Walking and digesting
+// ---------------------------------------------------------------------------
+async function walkIdentities(treePath, storage) {
+    const code = errors_js_1.ERRORS.PROTOCOL_INVALID;
+    const rootPath = assertNormalizedAbsolute(treePath, 'root');
+    const root = await captureAnchor(rootPath, storage, code);
+    const seen = new Set([`${root.dev}:${root.ino}`]);
+    const entries = [];
+    const walk = async (chain, prefix) => {
+        const directory = chain[chain.length - 1].path;
+        const names = await guarded(chain, storage, code, 'Unable to read tree directory', () => storage.readdir(directory));
+        names.sort((left, right) => (0, tree_js_1.compareTreePaths)(left, right));
+        for (const name of names) {
+            const entryPath = prefix === '' ? name : `${prefix}/${name}`;
+            const entryAbsolute = _path_1.default.join(directory, name);
+            let stat;
+            try {
+                stat = await storage.lstat(entryAbsolute);
+            }
+            catch (error) {
+                throw treeError(code, 'Unable to inspect tree entry', error);
+            }
+            const kind = (0, tree_js_1.classifyTreeEntry)(stat);
+            (0, tree_js_1.assertTreeEntryPath)(entryPath, kind);
+            if (entries.length >= tree_js_1.MAX_TREE_ENTRIES)
+                throw treeError(code, 'Tree has too many entries');
+            const identity = {
+                dev: stat.dev,
+                ino: stat.ino,
+                size: kind === 'directory' ? 0 : stat.size,
+                ...(typeof stat.mtimeMs === 'number' ? { mtimeMs: stat.mtimeMs } : {})
+            };
+            if (kind === 'directory') {
+                const key = `${stat.dev}:${stat.ino}`;
+                if (seen.has(key)) {
+                    throw treeError(errors_js_1.ERRORS.INVALID_FILENAME, 'Tree contains a filesystem cycle');
+                }
+                seen.add(key);
+                const child = anchorFrom(entryAbsolute, stat, code);
+                entries.push({ kind, path: entryPath, size: 0, identity });
+                await walk([...chain, child], entryPath);
+                continue;
+            }
+            entries.push({ kind, path: entryPath, size: stat.size, identity });
+        }
+        await verifyAnchors(chain, storage, code);
+    };
+    await walk([root], '');
+    // Depth-first order is not bytewise order (`a-x` sorts before `a/c`), so the
+    // canonical order is established over full paths, as the snapshot does.
+    entries.sort((left, right) => (0, tree_js_1.compareTreePaths)(left.path, right.path));
+    (0, tree_js_1.assertCanonicalTreeEntries)(entries);
+    return { root, entries };
+}
+async function walkTree(treePath, storage) {
+    const { entries } = await walkIdentities(treePath, storage);
+    return entries.map(({ kind, path: entryPath, size }) => ({ kind, path: entryPath, size }));
+}
+function busy(message, cause = null) {
+    return treeError(errors_js_1.ERRORS.FILE_BUSY, message, cause);
+}
+function sameStamp(left, right) {
+    return (left.dev === right.dev &&
+        left.ino === right.ino &&
+        left.size === right.size &&
+        (left.mtimeMs === undefined || right.mtimeMs === undefined || left.mtimeMs === right.mtimeMs));
+}
+async function digestTreeFile(filePath, entry, anchors, storage) {
+    await verifyAnchors(anchors, storage, errors_js_1.ERRORS.FILE_BUSY);
+    let handle;
+    try {
+        handle = await (0, layout_js_1.openSafeRegularFile)(filePath, 'read', storage);
+    }
+    catch (error) {
+        if ((0, error_code_js_1.isMissing)(error))
+            throw busy('Tree file changed during digest', error);
+        throw coded(error, errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to open tree file');
+    }
+    let outcome;
+    try {
+        const before = await handle.stat();
+        if (!before.isFile())
+            throw busy('Tree file changed during digest');
+        if (typeof before.nlink === 'number' && before.nlink > 1) {
+            throw treeError(errors_js_1.ERRORS.INVALID_FILENAME, 'Tree entries cannot be hard links');
+        }
+        if (!sameStamp(entry.identity, before))
+            throw busy('Tree file changed during digest');
+        const hash = new hash_js_1.SodiumSha256();
+        let position = 0;
+        while (position < entry.size) {
+            const bytes = b4a_1.default.alloc(Math.min(READ_BYTES, entry.size - position));
+            let offset = 0;
+            while (offset < bytes.byteLength) {
+                let read;
+                try {
+                    read = await handle.read(bytes, offset, bytes.byteLength - offset, position + offset);
+                }
+                catch (error) {
+                    throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to read tree file', error);
+                }
+                const count = typeof read === 'number' ? read : read.bytesRead;
+                if (!Number.isSafeInteger(count) || count <= 0)
+                    throw busy('Tree file was truncated');
+                offset += count;
+            }
+            hash.update(bytes);
+            position += bytes.byteLength;
+        }
+        const after = await handle.stat();
+        if (!after.isFile() || !sameStamp(entry.identity, after)) {
+            throw busy('Tree file changed during digest');
+        }
+        outcome = hash.digest();
+    }
+    catch (error) {
+        await handle.close().catch(() => { });
+        throw coded(error, errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to digest tree file');
+    }
+    try {
+        await handle.close();
+    }
+    catch (error) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Unable to close tree file', error);
+    }
+    await verifyAnchors(anchors, storage, errors_js_1.ERRORS.FILE_BUSY);
+    return outcome;
+}
+/**
+ * Recomputes the canonical tree digest from the extracted contents alone, then
+ * walks the tree again and requires the same entries and identities, so an
+ * addition, removal, or replacement during hashing fails with FILE_BUSY.
+ */
+async function digestTree(treePath, storage) {
+    const first = await walkIdentities(treePath, storage);
+    const directories = new Map([['', first.root]]);
+    for (const entry of first.entries) {
+        if (entry.kind === 'directory') {
+            directories.set(entry.path, {
+                path: _path_1.default.join(first.root.path, ...entry.path.split('/')),
+                dev: entry.identity.dev,
+                ino: entry.identity.ino
+            });
+        }
+    }
+    const digests = [];
+    let payloadBytes = 0;
+    for (const entry of first.entries) {
+        if (entry.kind === 'directory') {
+            digests.push({ entry: { kind: 'directory', path: entry.path, size: 0 } });
+            continue;
+        }
+        const components = entry.path.split('/');
+        const anchors = [];
+        for (let depth = 0; depth < components.length; depth++) {
+            const anchor = directories.get(components.slice(0, depth).join('/'));
+            if (!anchor)
+                throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree entry has no parent directory');
+            anchors.push(anchor);
+        }
+        const absolute = _path_1.default.join(first.root.path, ...components);
+        const sha256 = await digestTreeFile(absolute, entry, anchors, storage);
+        if (payloadBytes > Number.MAX_SAFE_INTEGER - entry.size) {
+            throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Tree payload exceeds safe integer range');
+        }
+        payloadBytes += entry.size;
+        digests.push({ entry: { kind: 'file', path: entry.path, size: entry.size }, sha256 });
+    }
+    let second;
+    try {
+        second = await walkIdentities(treePath, storage);
+    }
+    catch (error) {
+        throw busy('Tree changed during digest', error);
+    }
+    const unchanged = second.root.dev === first.root.dev &&
+        second.root.ino === first.root.ino &&
+        second.entries.length === first.entries.length &&
+        second.entries.every((entry, index) => {
+            const original = first.entries[index];
+            return (entry.path === original.path &&
+                entry.kind === original.kind &&
+                sameStamp(entry.identity, original.identity));
+        });
+    if (!unchanged)
+        throw busy('Tree changed during digest');
+    const entries = first.entries.map(({ kind, path: entryPath, size }) => ({
+        kind,
+        path: entryPath,
+        size
+    }));
+    return {
+        entries,
+        entryCount: entries.length,
+        payloadBytes,
+        treeSha256: (0, tree_js_1.treeDigest)(digests)
+    };
+}
+// ---------------------------------------------------------------------------
+// Inspection and removal
+// ---------------------------------------------------------------------------
+async function inspect(treePath, parent, storage, code, options) {
+    const managed = assertManagedChild(treePath, parent, options);
+    const anchors = [await captureAnchor(managed.parent, storage, code)];
+    let stat = null;
+    try {
+        stat = await guarded(anchors, storage, code, 'Unable to inspect tree path', async () => {
+            try {
+                return await storage.lstat(managed.treePath);
+            }
+            catch (error) {
+                if ((0, error_code_js_1.isMissing)(error))
+                    return null;
+                throw error;
+            }
+        });
+    }
+    catch (error) {
+        throw coded(error, code, 'Unable to inspect tree path');
+    }
+    if (stat === null)
+        return { state: 'MISSING', anchors, tree: null };
+    if (stat.isSymbolicLink() || !stat.isDirectory()) {
+        return { state: 'UNMANAGED', anchors, tree: null };
+    }
+    return { state: 'DIRECTORY', anchors, tree: anchorFrom(managed.treePath, stat, code) };
+}
+async function inspectTreePath(treePath, parent, storage, options = {}) {
+    return (await inspect(treePath, parent, storage, errors_js_1.ERRORS.PROTOCOL_INVALID, options)).state;
+}
+/**
+ * Removes `treePath` iteratively using only `lstat`, `unlink`, and `rmdir`; it
+ * never calls a recursive remove. A symbolic link inside the tree is unlinked,
+ * never traversed. Depth and entry count are bounded by the canonical tree
+ * limits; exceeding either, or any failure, throws CLEANUP_FAILED and leaves
+ * the remaining tree in place as residue. Only the leaf entry a call targets may
+ * vanish concurrently (ENOENT), and only after the whole identity chain was
+ * verified again; a missing or moved root, directory, or parent is never a
+ * vanished member and throws CLEANUP_FAILED. Returns `false` only when the path
+ * was already absent; `true` means the original path is gone and the parent
+ * still matches its captured identity.
+ *
+ * Before and after every mutating call the identity of the parent, the tree
+ * root, and every directory above the entry is verified; a replaced directory
+ * aborts the removal (detected, not prevented — see the module guarantee).
+ */
+async function removeTree(treePath, parent, storage, options = {}) {
+    const code = errors_js_1.ERRORS.CLEANUP_FAILED;
+    const found = await inspect(treePath, parent, storage, code, options);
+    if (found.state === 'MISSING')
+        return false;
+    if (found.state === 'UNMANAGED' || found.tree === null) {
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Refusing to remove an unmanaged tree path');
+    }
+    const [parentAnchor] = found.anchors;
+    const rootAnchor = found.tree;
+    const stack = [{ anchor: rootAnchor, depth: 0, names: null, index: 0 }];
+    // A directory holding the private storage directory is a storage root, never a tree.
+    try {
+        await storage.lstat(_path_1.default.join(found.tree.path, INTERNAL_NAME));
+        throw treeError(errors_js_1.ERRORS.PROTOCOL_INVALID, 'Refusing to remove a storage root');
+    }
+    catch (error) {
+        if (!(0, error_code_js_1.isMissing)(error))
+            throw coded(error, code, 'Unable to inspect tree root');
+    }
+    const chain = () => [parentAnchor, ...stack.map((frame) => frame.anchor)];
+    let visited = 0;
+    while (stack.length > 0) {
+        const frame = stack[stack.length - 1];
+        if (frame.names === null) {
+            // The directory is part of the verified chain, so a listing that reports
+            // it missing is never a vanished member: it fails the removal.
+            frame.names = await guarded(chain(), storage, code, 'Unable to read tree directory for removal', () => storage.readdir(frame.anchor.path));
+            frame.names.sort();
+        }
+        if (frame.index < frame.names.length) {
+            const child = _path_1.default.join(frame.anchor.path, frame.names[frame.index++]);
+            visited++;
+            if (visited > tree_js_1.MAX_TREE_ENTRIES) {
+                throw treeError(code, 'Tree has too many entries to remove');
+            }
+            // Only the leaf's own target may vanish, and only while the chain still matches.
+            const inspected = await guardedLeaf(chain(), storage, code, 'Unable to inspect tree entry', () => storage.lstat(child));
+            if (inspected.missing)
+                continue;
+            const stat = inspected.value;
+            if (!stat.isSymbolicLink() && stat.isDirectory()) {
+                if (frame.depth + 1 > tree_js_1.MAX_TREE_DEPTH)
+                    throw treeError(code, 'Tree is too deep to remove');
+                stack.push({
+                    anchor: anchorFrom(child, stat, code),
+                    depth: frame.depth + 1,
+                    names: null,
+                    index: 0
+                });
+                continue;
+            }
+            await guardedLeaf(chain(), storage, code, 'Unable to remove tree entry', () => storage.unlink(child));
+            continue;
+        }
+        // The directory itself disappears with the call, so only its ancestors can
+        // be verified afterwards; the directory is verified immediately before. A
+        // directory that is already missing here was moved, not removed.
+        const ancestors = chain().slice(0, -1);
+        await verifyAnchors([...ancestors, frame.anchor], storage, code);
+        await guarded(ancestors, storage, code, 'Unable to remove tree directory', () => storage.rmdir(frame.anchor.path));
+        stack.pop();
+    }
+    // `true` is only returned once the original path is observably gone while the
+    // managed parent still matches its captured identity.
+    const remaining = await guardedLeaf([parentAnchor], storage, code, 'Unable to confirm tree removal', () => storage.lstat(rootAnchor.path));
+    if (!remaining.missing)
+        throw treeError(code, 'Tree path still exists after removal');
+    await syncDirectory(parentAnchor.path, [parentAnchor], storage, code);
+    return true;
+}
+//# sourceMappingURL=tree-fs.js.map

package/dist/storage/tree-fs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-fs.js","sourceRoot":"","sources":["../../src/storage/tree-fs.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,8CAAqB;AACrB,oDAA4C;AAC5C,kDAAwB;AACxB,4CAAuD;AACvD,0CAA8C;AAC9C,qDAAsD;AACtD,qDAUgC;AAChC,2CAAuE;AASvE,MAAM,UAAU,GAAG,EAAE,GAAG,IAAI,CAAA;AAC5B,MAAM,aAAa,GAAG,eAAe,CAAA;AAwCrC,SAAS,SAAS,CAAC,IAAe,EAAE,OAAe,EAAE,KAAK,GAAY,IAAI;IACxE,OAAO,IAAI,4BAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AACnD,CAAC;AAED,yFAAyF;AACzF,SAAS,KAAK,CAAC,KAAc,EAAE,IAAe,EAAE,OAAe;IAC7D,OAAO,KAAK,YAAY,4BAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AACpF,CAAC;AAED,8BACE,OAAuB;IAEvB,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,IAAI,OAAO,OAAO,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;QACpF,MAAM,SAAS,CAAC,kBAAM,CAAC,mBAAmB,EAAE,iDAAiD,CAAC,CAAA;IAChG,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,SAAS,wBAAwB,CAAC,KAAc,EAAE,KAAa;IAC7D,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,CAAC,MAAM,KAAK,CAAC;QAClB,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACxB,CAAC,eAAI,CAAC,UAAU,CAAC,KAAK,CAAC;QACvB,eAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,EAC7B,CAAC;QACD,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,QAAQ,KAAK,qCAAqC,CAAC,CAAA;IAC9F,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,OAA+B;IACtE,IAAI,eAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,aAAa;QAAE,OAAO,IAAI,CAAA;IACxD,IAAI,eAAI,CAAC,QAAQ,CAAC,eAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,aAAa;QAAE,OAAO,IAAI,CAAA;IACtE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IAC1B,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IACzB,IAAI,CAAC,GAAG,IAAA,gCAAoB,EAAC,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAA;IAChF,gFAAgF;IAChF,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,eAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,eAAI,CAAC,GAAG,EAAE,CAAA;IAC1E,OAAO,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;AACjE,CAAC;AAED,uFAAuF;AACvF,SAAS,cAAc,CAAC,QAAiB,EAAE,OAA+B;IACxE,MAAM,IAAI,GAAG,wBAAwB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IACvD,IAAI,eAAe,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;QACnC,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,4CAA4C,CAAC,CAAA;IACxF,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,yFAAyF;AACzF,SAAS,kBAAkB,CACzB,QAAiB,EACjB,MAAe,EACf,OAA+B;IAE/B,MAAM,KAAK,GAAG,wBAAwB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IACxD,MAAM,aAAa,GAAG,wBAAwB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IAChE,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;QAC5B,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,wCAAwC,CAAC,CAAA;IACpF,CAAC;IACD,IAAI,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;QACpC,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,4CAA4C,CAAC,CAAA;IACxF,CAAC;IACD,IAAI,eAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,aAAa,EAAE,CAAC;QAC1C,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,gDAAgD,CAAC,CAAA;IAC5F,CAAC;IACD,IAAA,2BAAgB,EAAC,eAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;IACtC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,CAAA;AACnD,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,SAAS,eAAe,CAAC,KAAc;IACrC,OAAO,CACL,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACxE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,EAAE,CAAC,CAC3C,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,SAAiB,EAAE,IAAkB,EAAE,IAAe;IACxE,IAAI,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAA;IAChD,CAAC;IACD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,SAAS,CAAC,IAAI,EAAE,wCAAwC,CAAC,CAAA;IACjE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAA;AAC1D,CAAC;AAED,KAAK,UAAU,aAAa,CAC1B,SAAiB,EACjB,OAAuB,EACvB,IAAe;IAEf,IAAI,IAAkB,CAAA;IACtB,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;IACvC,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,SAAS,CAAC,IAAI,EAAE,kCAAkC,EAAE,KAAK,CAAC,CAAA;IAClE,CAAC;IACD,OAAO,UAAU,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAC1C,CAAC;AAED,KAAK,UAAU,aAAa,CAC1B,OAA0B,EAC1B,OAAuB,EACvB,IAAe;IAEf,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QAC9D,IAAI,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC;YAC3D,MAAM,SAAS,CAAC,IAAI,EAAE,kDAAkD,CAAC,CAAA;QAC3E,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,OAAO,CACpB,OAA0B,EAC1B,OAAuB,EACvB,IAAe,EACf,OAAe,EACf,SAA+B;IAE/B,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IAC3C,IAAI,MAAS,CAAA;IACb,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,SAAS,EAAE,CAAA;IAC5B,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QAC3D,MAAM,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IACnC,CAAC;IACD,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IAC3C,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,WAAW,CACxB,OAA0B,EAC1B,OAAuB,EACvB,IAAe,EACf,OAAe,EACf,SAA+B;IAE/B,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IAC3C,IAAI,KAAQ,CAAA;IACZ,IAAI,CAAC;QACH,KAAK,GAAG,MAAM,SAAS,EAAE,CAAA;IAC3B,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAI,IAAA,yBAAS,EAAC,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;YAC3C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAA;QAC1B,CAAC;QACD,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QAC3D,MAAM,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IACnC,CAAC;IACD,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IAC3C,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;AAClC,CAAC;AAED,KAAK,UAAU,aAAa,CAC1B,SAAiB,EACjB,OAA0B,EAC1B,OAAuB,EACvB,IAAe;IAEf,MAAM,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACvF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;QACjD,IAAI,CAAC;YACH,MAAM,MAAM,CAAC,IAAI,EAAE,CAAA;QACrB,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,CAAC,KAAK,EAAE,CAAA;QACtB,CAAC;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAED,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E;;;GAGG;AACH,KAAK,UAAU,aAAa,CAC1B,QAAgB,EAChB,YAAoB,EACpB,IAA0B,EAC1B,OAAuB,EACvB,OAA+B;IAE/B,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC9C,IAAA,6BAAmB,EAAC,YAAY,EAAE,IAAI,CAAC,CAAA;IACvC,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC1C,MAAM,OAAO,GAAG,CAAC,MAAM,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAC,CAAA;IAC7E,IAAI,MAAM,GAAG,IAAI,CAAA;IACjB,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,GAAG,eAAI,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;QACrC,OAAO,CAAC,IAAI,CAAC,MAAM,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAC,CAAA;IAC7E,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,eAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;AAC1F,CAAC;AAEM,KAAK,yBACV,QAAgB,EAChB,MAAc,EACd,OAAuB,EACvB,OAAO,GAA2B,EAAE;IAEpC,MAAM,OAAO,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IAC7D,MAAM,OAAO,GAAG,CAAC,MAAM,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAC,CAAA;IACvF,MAAM,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,EAAE,4BAA4B,EAAE,GAAG,EAAE,CAC1F,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CACjD,CAAA;IACD,MAAM,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAA;AAChF,CAAC;AAEM,KAAK,iCACV,QAAgB,EAChB,YAAoB,EACpB,OAAuB,EACvB,OAAO,GAA2B,EAAE;IAEpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,CAC7C,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,OAAO,EACP,OAAO,CACR,CAAA;IACD,MAAM,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,EAAE,iCAAiC,EAAE,GAAG,EAAE,CAC/F,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CACvC,CAAA;AACH,CAAC;AAEM,KAAK,uBACV,QAAgB,EAChB,YAAoB,EACpB,OAAuB,EACvB,OAAO,GAA2B,EAAE;IAEpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IACjG,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAA;IAC9D,IAAI,MAAyB,CAAA;IAC7B,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,IAAA,+BAAmB,EAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC/D,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QAC9E,MAAM,KAAK,CAAC,KAAK,EAAE,kBAAM,CAAC,gBAAgB,EAAE,4BAA4B,CAAC,CAAA;IAC3E,CAAC;IACD,IAAI,CAAC;QACH,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAA;IAChE,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACpC,MAAM,KAAK,CAAA;IACb,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,+DAA+D;AACxD,KAAK,8BACV,QAAgB,EAChB,OAAuB;IAEvB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IACjE,MAAM,WAAW,GAAa,CAAC,IAAI,CAAC,CAAA;IACpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,eAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACpD,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG;gBACvB,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG;aACxB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,MAAM,aAAa,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,CAAC,CAAA;IACpF,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E,KAAK,UAAU,cAAc,CAAC,QAAgB,EAAE,OAAuB;IACrE,MAAM,IAAI,GAAG,kBAAM,CAAC,gBAAgB,CAAA;IACpC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IAC3D,MAAM,IAAI,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACzD,MAAM,OAAO,GAAkB,EAAE,CAAA;IAEjC,MAAM,IAAI,GAAG,KAAK,EAAE,KAAwB,EAAE,MAAc,EAAiB,EAAE;QAC7E,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAA;QAC9C,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,+BAA+B,EAAE,GAAG,EAAE,CACtF,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAC3B,CAAA;QACD,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAA,0BAAgB,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;QAC1D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,EAAE,CAAA;YAC5D,MAAM,aAAa,GAAG,eAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;YAChD,IAAI,IAAkB,CAAA;YACtB,IAAI,CAAC;gBACH,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;YAC3C,CAAC;YAAC,OAAO,KAAc,EAAE,CAAC;gBACxB,MAAM,SAAS,CAAC,IAAI,EAAE,8BAA8B,EAAE,KAAK,CAAC,CAAA;YAC9D,CAAC;YACD,MAAM,IAAI,GAAG,IAAA,2BAAiB,EAAC,IAAI,CAAC,CAAA;YACpC,IAAA,6BAAmB,EAAC,SAAS,EAAE,IAAI,CAAC,CAAA;YACpC,IAAI,OAAO,CAAC,MAAM,IAAI,0BAAgB;gBAAE,MAAM,SAAS,CAAC,IAAI,EAAE,2BAA2B,CAAC,CAAA;YAC1F,MAAM,QAAQ,GAAsB;gBAClC,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,IAAI,EAAE,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;gBAC1C,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvE,CAAA;YACD,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAA;gBACrC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClB,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,kCAAkC,CAAC,CAAA;gBAC9E,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,MAAM,KAAK,GAAG,UAAU,CAAC,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACnD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAA;gBAC1D,MAAM,IAAI,CAAC,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,EAAE,SAAS,CAAC,CAAA;gBACxC,SAAQ;YACV,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAA;QACpE,CAAC;QACD,MAAM,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IAC3C,CAAC,CAAA;IAED,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IACtB,6EAA6E;IAC7E,wEAAwE;IACxE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAA,0BAAgB,EAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IACtE,IAAA,oCAA0B,EAAC,OAAO,CAAC,CAAA;IACnC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;AAC1B,CAAC;AAEM,KAAK,mBAAmB,QAAgB,EAAE,OAAuB;IACtE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC3D,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;AAC5F,CAAC;AAED,SAAS,IAAI,CAAC,OAAe,EAAE,KAAK,GAAY,IAAI;IAClD,OAAO,SAAS,CAAC,kBAAM,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;AACpD,CAAC;AAED,SAAS,SAAS,CAAC,IAAuB,EAAE,KAAwB;IAClE,OAAO,CACL,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG;QACtB,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG;QACtB,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;QACxB,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC,CAC9F,CAAA;AACH,CAAC;AAED,KAAK,UAAU,cAAc,CAC3B,QAAgB,EAChB,KAAkB,EAClB,OAA0B,EAC1B,OAAuB;IAEvB,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,SAAS,CAAC,CAAA;IACvD,IAAI,MAAyB,CAAA;IAC7B,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,IAAA,+BAAmB,EAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IAC/D,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAI,IAAA,yBAAS,EAAC,KAAK,CAAC;YAAE,MAAM,IAAI,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAA;QAC1E,MAAM,KAAK,CAAC,KAAK,EAAE,kBAAM,CAAC,gBAAgB,EAAE,0BAA0B,CAAC,CAAA;IACzE,CAAC;IACD,IAAI,OAAe,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,CAAA;QAClC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAAE,MAAM,IAAI,CAAC,iCAAiC,CAAC,CAAA;QACnE,IAAI,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACzD,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,mCAAmC,CAAC,CAAA;QAC/E,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC;YAAE,MAAM,IAAI,CAAC,iCAAiC,CAAC,CAAA;QACrF,MAAM,IAAI,GAAG,IAAI,sBAAY,EAAE,CAAA;QAC/B,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,OAAO,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,aAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAA;YACpE,IAAI,MAAM,GAAG,CAAC,CAAA;YACd,OAAO,MAAM,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;gBACjC,IAAI,IAAoC,CAAA;gBACxC,IAAI,CAAC;oBACH,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,UAAU,GAAG,MAAM,EAAE,QAAQ,GAAG,MAAM,CAAC,CAAA;gBACvF,CAAC;gBAAC,OAAO,KAAc,EAAE,CAAC;oBACxB,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,0BAA0B,EAAE,KAAK,CAAC,CAAA;gBAC7E,CAAC;gBACD,MAAM,KAAK,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAA;gBAC9D,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;oBAAE,MAAM,IAAI,CAAC,yBAAyB,CAAC,CAAA;gBACrF,MAAM,IAAI,KAAK,CAAA;YACjB,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAClB,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAA;QAC9B,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,IAAI,EAAE,CAAA;QACjC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,CAAC,iCAAiC,CAAC,CAAA;QAC/C,CAAC;QACD,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;IACzB,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACpC,MAAM,KAAK,CAAC,KAAK,EAAE,kBAAM,CAAC,gBAAgB,EAAE,4BAA4B,CAAC,CAAA;IAC3E,CAAC;IACD,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,KAAK,EAAE,CAAA;IACtB,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,2BAA2B,EAAE,KAAK,CAAC,CAAA;IAC9E,CAAC;IACD,MAAM,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAM,CAAC,SAAS,CAAC,CAAA;IACvD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;GAIG;AACI,KAAK,qBACV,QAAgB,EAChB,OAAuB;IAEvB,MAAM,KAAK,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IACrD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC/D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE;gBAC1B,IAAI,EAAE,eAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC1D,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG;gBACvB,GAAG,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG;aACxB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAsB,EAAE,CAAA;IACrC,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAA;YACzE,SAAQ;QACV,CAAC;QACD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACxC,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;YACpE,IAAI,CAAC,MAAM;gBAAE,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,oCAAoC,CAAC,CAAA;YAC3F,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACtB,CAAC;QACD,MAAM,QAAQ,GAAG,eAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,UAAU,CAAC,CAAA;QAC1D,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;QACtE,IAAI,YAAY,GAAG,MAAM,CAAC,gBAAgB,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;YACxD,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,yCAAyC,CAAC,CAAA;QACrF,CAAC;QACD,YAAY,IAAI,KAAK,CAAC,IAAI,CAAA;QAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAA;IACvF,CAAC;IAED,IAAI,MAAkB,CAAA;IACtB,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IAClD,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,IAAI,CAAC,4BAA4B,EAAE,KAAK,CAAC,CAAA;IACjD,CAAC;IACD,MAAM,SAAS,GACb,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG;QAClC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG;QAClC,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,MAAM;QAC9C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACrC,OAAO,CACL,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;gBAC5B,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;gBAC5B,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAC7C,CAAA;QACH,CAAC,CAAC,CAAA;IACJ,IAAI,CAAC,SAAS;QAAE,MAAM,IAAI,CAAC,4BAA4B,CAAC,CAAA;IAExD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,IAAI;QACJ,IAAI,EAAE,SAAS;QACf,IAAI;KACL,CAAC,CAAC,CAAA;IACH,OAAO;QACL,OAAO;QACP,UAAU,EAAE,OAAO,CAAC,MAAM;QAC1B,YAAY;QACZ,UAAU,EAAE,IAAA,oBAAU,EAAC,OAAO,CAAC;KAChC,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E,KAAK,UAAU,OAAO,CACpB,QAAgB,EAChB,MAAc,EACd,OAAuB,EACvB,IAAe,EACf,OAA+B;IAE/B,MAAM,OAAO,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IAC7D,MAAM,OAAO,GAAG,CAAC,MAAM,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;IACpE,IAAI,IAAI,GAAwB,IAAI,CAAA;IACpC,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,6BAA6B,EAAE,KAAK,IAAI,EAAE;YACrF,IAAI,CAAC;gBACH,OAAO,MAAM,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YAC9C,CAAC;YAAC,OAAO,KAAc,EAAE,CAAC;gBACxB,IAAI,IAAA,yBAAS,EAAC,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAA;gBACjC,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,MAAM,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,6BAA6B,CAAC,CAAA;IACzD,CAAC;IACD,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACnE,IAAI,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACjD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;IACpD,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAA;AACxF,CAAC;AAEM,KAAK,0BACV,QAAgB,EAChB,MAAc,EACd,OAAuB,EACvB,OAAO,GAA2B,EAAE;IAEpC,OAAO,CAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAM,CAAC,gBAAgB,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,CAAA;AAC3F,CAAC;AASD;;;;;;;;;;;;;;;GAeG;AACI,KAAK,qBACV,QAAgB,EAChB,MAAc,EACd,OAAuB,EACvB,OAAO,GAA2B,EAAE;IAEpC,MAAM,IAAI,GAAG,kBAAM,CAAC,cAAc,CAAA;IAClC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IACrE,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IAC3C,IAAI,KAAK,CAAC,KAAK,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACvD,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,2CAA2C,CAAC,CAAA;IACvF,CAAC;IACD,MAAM,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,OAAO,CAAA;IACpC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAA;IAC7B,MAAM,KAAK,GAAmB,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;IAEvF,qFAAqF;IACrF,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,KAAK,CAAC,eAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAA;QAC9D,MAAM,SAAS,CAAC,kBAAM,CAAC,gBAAgB,EAAE,mCAAmC,CAAC,CAAA;IAC/E,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IAAI,CAAC,IAAA,yBAAS,EAAC,KAAK,CAAC;YAAE,MAAM,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,6BAA6B,CAAC,CAAA;IAChF,CAAC;IAED,MAAM,KAAK,GAAG,GAAa,EAAE,CAAC,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;IACnF,IAAI,OAAO,GAAG,CAAC,CAAA;IAEf,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACrC,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACzB,yEAAyE;YACzE,+DAA+D;YAC/D,KAAK,CAAC,KAAK,GAAG,MAAM,OAAO,CACzB,KAAK,EAAE,EACP,OAAO,EACP,IAAI,EACJ,2CAA2C,EAC3C,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CACzC,CAAA;YACD,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;QACpB,CAAC;QAED,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,eAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;YACtE,OAAO,EAAE,CAAA;YACT,IAAI,OAAO,GAAG,0BAAgB,EAAE,CAAC;gBAC/B,MAAM,SAAS,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAA;YAC9D,CAAC;YACD,iFAAiF;YACjF,MAAM,SAAS,GAAG,MAAM,WAAW,CACjC,KAAK,EAAE,EACP,OAAO,EACP,IAAI,EACJ,8BAA8B,EAC9B,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAC3B,CAAA;YACD,IAAI,SAAS,CAAC,OAAO;gBAAE,SAAQ;YAC/B,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAA;YAC5B,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACjD,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,wBAAc;oBAAE,MAAM,SAAS,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAA;gBACzF,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;oBACrC,KAAK,EAAE,KAAK,CAAC,KAAK,GAAG,CAAC;oBACtB,KAAK,EAAE,IAAI;oBACX,KAAK,EAAE,CAAC;iBACT,CAAC,CAAA;gBACF,SAAQ;YACV,CAAC;YACD,MAAM,WAAW,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,6BAA6B,EAAE,GAAG,EAAE,CAC5E,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CACtB,CAAA;YACD,SAAQ;QACV,CAAC;QAED,2EAA2E;QAC3E,0EAA0E;QAC1E,iEAAiE;QACjE,MAAM,SAAS,GAAG,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtC,MAAM,aAAa,CAAC,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QAChE,MAAM,OAAO,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,iCAAiC,EAAE,GAAG,EAAE,CAC9E,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CACjC,CAAA;QACD,KAAK,CAAC,GAAG,EAAE,CAAA;IACb,CAAC;IAED,8EAA8E;IAC9E,sDAAsD;IACtD,MAAM,SAAS,GAAG,MAAM,WAAW,CACjC,CAAC,YAAY,CAAC,EACd,OAAO,EACP,IAAI,EACJ,gCAAgC,EAChC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CACrC,CAAA;IACD,IAAI,CAAC,SAAS,CAAC,OAAO;QAAE,MAAM,SAAS,CAAC,IAAI,EAAE,sCAAsC,CAAC,CAAA;IACrF,MAAM,aAAa,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;IACrE,OAAO,IAAI,CAAA;AACb,CAAC"}

package/dist/storage/tree-staging.d.ts

@@ -0,0 +1,9 @@
+import type { TreeExtractionTarget } from '../tar-protocol/tree-extract.js';
+import type { StorageAdapter, StorageLayout } from './types.js';
+/**
+ * Writes an extracted tree into `treePath`, which must live directly under
+ * `parent`. Every path is created exclusively, with no-follow opens, from
+ * validated components only, and every call carries the storage layout so the
+ * protected directories are refused by identity.
+ */
+export declare function createTreeStagingTarget(treePath: string, parent: string, storage: StorageAdapter, layout: StorageLayout): TreeExtractionTarget;