@telecrypt-io/storage 0.5.29 → 0.5.31

package/dist/TeleCryptIOStorage.js

@@ -132,7 +132,7 @@ function matrixRequestTimeout(options) {
     const value = options?.timeoutMs ?? options?.localTimeoutMs ?? MATRIX_HTTP_TIMEOUT_MS;
     if (!Number.isFinite(value) || value <= 0)
         throw new Error("invalid Matrix request timeout");
-    return Math.min(value, MATRIX_HTTP_TIMEOUT_MS);
+    return value;
 }
 function matrixRequestSignal(options) {
     return options?.signal ?? options?.abortSignal;

package/dist/core/index.d.ts

@@ -4,4 +4,4 @@ export * from "./operations.js";
 export * from "./errors.js";
 export * from "./oidc.js";
 export * from "./constants.js";
-export { isValidName, MAX_NAME_LENGTH, validateName } from "./validation.js";
+export { isValidName, validateName } from "./validation.js";

package/dist/core/index.js

@@ -4,4 +4,4 @@ export * from "./operations.js";
 export * from "./errors.js";
 export * from "./oidc.js";
 export * from "./constants.js";
-export { isValidName, MAX_NAME_LENGTH, validateName } from "./validation.js";
+export { isValidName, validateName } from "./validation.js";

package/dist/core/operations.d.ts

@@ -13,9 +13,9 @@
 import { TeleCryptIOStorage } from "../TeleCryptIOStorage.js";
 import type { DownloadedFile, FolderDetails, FolderInfo, FileDetails, FileInfo, VaultDetails, VaultInfo, DeleteResult, JoinResult, Member, RecoveryRestore, RecoverySetup, RenameResult, ShareResult, UnshareResult } from "./types.js";
 export interface OperationOptions {
-    /** Cancels bounded waits and rate-limit backoff before the next mutation. */
+    /** Cancels waits and rate-limit backoff before the next mutation. */
     signal?: AbortSignal;
-    /** Total wall-clock budget for one mutation, including all descendants. */
+    /** Optional wall-clock budget supplied by the caller. */
     timeoutMs?: number;
 }
 export declare function createVault(storage: TeleCryptIOStorage, name: string, options?: OperationOptions): Promise<VaultInfo>;

package/dist/core/operations.js

@@ -31,13 +31,10 @@ const RATE_LIMIT_DEFAULT_DELAY_MS = 15_000;
 // JavaScript timers cannot represent a longer delay reliably. The operation's
 // own deadline remains the authority that stops retrying.
 const MAX_TIMER_DELAY_MS = 2_147_483_647;
-const MAX_DELETION_ROOMS = 4096;
-const MAX_DELETION_DEPTH = 128;
-const DEFAULT_MUTATION_TIMEOUT_MS = 5 * 60_000;
-const MAX_MUTATION_TIMEOUT_MS = 15 * 60_000;
 function createOperationDeadline(options) {
-    const timeoutMs = options?.timeoutMs ?? DEFAULT_MUTATION_TIMEOUT_MS;
-    if (!Number.isSafeInteger(timeoutMs) || timeoutMs <= 0 || timeoutMs > MAX_MUTATION_TIMEOUT_MS) {
+    const timeoutMs = options?.timeoutMs;
+    if (timeoutMs !== undefined &&
+        (!Number.isSafeInteger(timeoutMs) || timeoutMs <= 0 || timeoutMs > MAX_TIMER_DELAY_MS)) {
         throw new StorageError("invalid operation timeout");
     }
     const controller = new AbortController();
@@ -45,11 +42,14 @@ function createOperationDeadline(options) {
     options?.signal?.addEventListener("abort", onAbort, { once: true });
     if (options?.signal?.aborted)
         onAbort();
-    const timer = setTimeout(() => controller.abort(new Error("operation timed out")), timeoutMs);
+    const timer = timeoutMs === undefined
+        ? undefined
+        : setTimeout(() => controller.abort(new Error("operation timed out")), timeoutMs);
     return {
         signal: controller.signal,
         close: () => {
-            clearTimeout(timer);
+            if (timer !== undefined)
+                clearTimeout(timer);
             options?.signal?.removeEventListener("abort", onAbort);
         },
     };
@@ -205,37 +205,6 @@ async function resolveFile(storage, tree, fileId, signal) {
         throw new StorageError("file lookup failed", { cause: error });
     }
 }
-function snapshotTreeSpaces(root, tooLargeMessage = "storage tree is too large") {
-    const spaces = [];
-    const seen = new Set();
-    const pending = [{ tree: root, depth: 0 }];
-    while (pending.length > 0) {
-        const next = pending.pop();
-        if (!next)
-            continue;
-        const { tree, depth } = next;
-        if (seen.has(tree.id))
-            continue;
-        if (depth > MAX_DELETION_DEPTH || spaces.length >= MAX_DELETION_ROOMS) {
-            throw new StorageError(tooLargeMessage);
-        }
-        seen.add(tree.id);
-        spaces.push(tree);
-        let children;
-        try {
-            children = tree.getDirectories();
-        }
-        catch (error) {
-            throw new StorageError("could not enumerate storage space descendants safely", { cause: error });
-        }
-        if (children.length > MAX_DELETION_ROOMS) {
-            throw new StorageError(tooLargeMessage);
-        }
-        for (const child of children)
-            pending.push({ tree: child, depth: depth + 1 });
-    }
-    return spaces;
-}
 /**
  * Deleting a tree is deliberately a one-room operation.  File versions are
  * physical Matrix media events, so callers must delete files explicitly and
@@ -318,6 +287,55 @@ function isActiveRelationEvent(event) {
         !Array.isArray(content) &&
         Object.keys(content).length > 0);
 }
+function activeTreeDirectories(client, tree) {
+    const childEvents = readRelationEvents(client, tree.id, EventType.SpaceChild);
+    if (childEvents === null)
+        throw new StorageError("delete graph is unsafe");
+    const activeChildIds = new Set();
+    for (const event of childEvents) {
+        if (!isActiveRelationEvent(event))
+            continue;
+        const childId = relationStateKey(event);
+        if (!childId)
+            throw new StorageError("delete graph is unsafe");
+        activeChildIds.add(childId);
+    }
+    const knownChildren = new Map(tree.getDirectories().map((child) => [child.id, child]));
+    return [...activeChildIds].map((childId) => {
+        const child = knownChildren.get(childId);
+        if (!child)
+            throw new StorageError("delete graph is unsafe");
+        return child;
+    });
+}
+function snapshotTreeSpaces(root, activeRelationClient) {
+    const spaces = [];
+    const seen = new Set();
+    const pending = [root];
+    while (pending.length > 0) {
+        const tree = pending.pop();
+        if (!tree)
+            continue;
+        if (seen.has(tree.id))
+            continue;
+        seen.add(tree.id);
+        spaces.push(tree);
+        let children;
+        try {
+            children = activeRelationClient
+                ? activeTreeDirectories(activeRelationClient, tree)
+                : tree.getDirectories();
+        }
+        catch (error) {
+            if (error instanceof StorageError)
+                throw error;
+            throw new StorageError("could not enumerate storage space descendants safely", { cause: error });
+        }
+        for (const child of children)
+            pending.push(child);
+    }
+    return spaces;
+}
 /**
  * A deleted MSC3089 branch is represented by an authoritative empty state
  * event. Inactive branches with metadata are historical versions, and a
@@ -358,13 +376,7 @@ function validateDeletionGraph(client, root, ids, deletedRooms) {
         const tree = client.unstableGetFileTreeSpace(id);
         if (!tree)
             throw new StorageError("delete graph is unsafe");
-        let directories;
-        try {
-            directories = tree.getDirectories();
-        }
-        catch (error) {
-            throw new StorageError("delete graph is unsafe", { cause: error });
-        }
+        const directories = activeTreeDirectories(client, tree);
         for (const child of directories)
             addEdge(id, child.id);
         const childEvents = readRelationEvents(client, id, EventType.SpaceChild);
@@ -1013,8 +1025,7 @@ export async function listSubfolders(storage, parentId, options) {
         const tree = await resolveTree(storage, parentId, signal);
         await storage.refreshRoomState(parentId, { signal });
         ensureOperationActive(signal);
-        const directories = tree
-            .getDirectories()
+        const directories = activeTreeDirectories(storage.getClient(), tree)
             .filter((directory) => !isMarkedTreeDeleted(storage, directory.id));
         return directories.map((d) => ({ id: d.id, name: d.room.name }));
     });
@@ -1094,7 +1105,7 @@ async function deleteTree(storage, treeId, options) {
                 // part of this operation and must not block deletion merely because
                 // their membership is not joined.
                 await refreshDeletionRooms(storage, tree.id, operation.signal);
-                const spaces = snapshotTreeSpaces(tree, "delete graph is too large");
+                const spaces = snapshotTreeSpaces(tree, client);
                 const activeSpaces = spaces.filter((space) => !removedRooms.has(space.id));
                 const ids = new Set(activeSpaces.map((space) => space.id));
                 if (!ids.has(tree.id)) {

package/dist/core/validation.d.ts

@@ -1,4 +1,3 @@
 /** Shared name contract used by SDK inputs and remote projections. */
-export declare const MAX_NAME_LENGTH = 512;
 export declare function isValidName(value: unknown): value is string;
 export declare function validateName(value: unknown, label: string): asserts value is string;

package/dist/core/validation.js

@@ -1,9 +1,7 @@
 /** Shared name contract used by SDK inputs and remote projections. */
-export const MAX_NAME_LENGTH = 512;
 export function isValidName(value) {
     return (typeof value === "string" &&
         value.length > 0 &&
-        value.length <= MAX_NAME_LENGTH &&
         !/[\u0000-\u001f\u007f]/.test(value));
 }
 export function validateName(value, label) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@telecrypt-io/storage",
-  "version": "0.5.29",
+  "version": "0.5.31",
   "license": "BUSL-1.1",
   "type": "module",
   "packageManager": "npm@11.19.0",