@procedures/collections 0.0.0-stage → 0.2.0

package/dist/interfaces/set.d.ts

@@ -0,0 +1,137 @@
+/**
+ * Set interfaces that mirror Java's Set interface hierarchy.
+ *
+ * Sets are collections that contain no duplicate elements.
+ * They provide efficient membership testing.
+ */
+import type { Collection, ReadonlyCollection } from "./collection.js";
+import type { Compare } from "../core/traits.js";
+/**
+ * ReadonlySet<T> - Readonly set with no duplicates.
+ */
+export interface ReadonlySet<T> extends ReadonlyCollection<T> {
+    /**
+     * Returns true if this set contains the specified element.
+     */
+    contains(element: T): boolean;
+    /**
+     * Returns true if this set contains all elements in the specified collection.
+     */
+    containsAll(other: Iterable<T>): boolean;
+}
+/**
+ * Set<T> - Mutable set with no duplicates.
+ *
+ * Mirrors java.util.Set.
+ * Elements are unique based on the set's equality function.
+ */
+export interface Set<T> extends ReadonlySet<T>, Collection<T> {
+    /**
+     * Adds the specified element to this set if it is not already present.
+     *
+     * @returns true if this set did not already contain the element
+     */
+    add(element: T): boolean;
+    /**
+     * Removes the specified element from this set if it is present.
+     *
+     * @returns true if this set contained the element
+     */
+    remove(element: T): boolean;
+    /**
+     * Adds all elements in the specified collection to this set.
+     * This is a union operation.
+     *
+     * @returns true if this set changed
+     */
+    addAll(other: Iterable<T>): boolean;
+    /**
+     * Removes from this set all of its elements that are contained in the specified collection.
+     * This is a difference operation.
+     *
+     * @returns true if this set changed
+     */
+    removeAll(other: Iterable<T>): boolean;
+    /**
+     * Retains only the elements in this set that are contained in the specified collection.
+     * This is an intersection operation.
+     *
+     * @returns true if this set changed
+     */
+    retainAll(other: Iterable<T>): boolean;
+}
+/**
+ * SortedSet<T> - Set that maintains elements in sorted order.
+ *
+ * Mirrors java.util.SortedSet.
+ */
+export interface SortedSet<T> extends Set<T> {
+    /**
+     * Returns the comparator used to order elements in this set.
+     */
+    readonly comparator: Compare<T>;
+    /**
+     * Returns the first (lowest) element in this set.
+     *
+     * @throws Error if set is empty
+     */
+    first(): T;
+    /**
+     * Returns the last (highest) element in this set.
+     *
+     * @throws Error if set is empty
+     */
+    last(): T;
+    /**
+     * Returns a view of the portion of this set whose elements are strictly less than toElement.
+     */
+    headSet(toElement: T): SortedSet<T>;
+    /**
+     * Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
+     */
+    tailSet(fromElement: T): SortedSet<T>;
+    /**
+     * Returns a view of the portion of this set whose elements range from fromElement to toElement.
+     */
+    subSet(fromElement: T, toElement: T): SortedSet<T>;
+}
+/**
+ * NavigableSet<T> - Extended sorted set with navigation methods.
+ *
+ * Mirrors java.util.NavigableSet.
+ */
+export interface NavigableSet<T> extends SortedSet<T> {
+    /**
+     * Returns the greatest element less than or equal to the given element, or undefined if none.
+     */
+    floor(element: T): T | undefined;
+    /**
+     * Returns the least element greater than or equal to the given element, or undefined if none.
+     */
+    ceiling(element: T): T | undefined;
+    /**
+     * Returns the greatest element strictly less than the given element, or undefined if none.
+     */
+    lower(element: T): T | undefined;
+    /**
+     * Returns the least element strictly greater than the given element, or undefined if none.
+     */
+    higher(element: T): T | undefined;
+    /**
+     * Retrieves and removes the first (lowest) element, or returns undefined if empty.
+     */
+    pollFirst(): T | undefined;
+    /**
+     * Retrieves and removes the last (highest) element, or returns undefined if empty.
+     */
+    pollLast(): T | undefined;
+    /**
+     * Returns a reverse order view of this set.
+     */
+    descendingSet(): NavigableSet<T>;
+    /**
+     * Returns a reverse order iterator over the elements in this set.
+     */
+    descendingIterator(): Iterator<T>;
+}
+//# sourceMappingURL=set.d.ts.map

package/dist/interfaces/set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"set.d.ts","sourceRoot":"","sources":["../../src/interfaces/set.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAEjD;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC,CAAE,SAAQ,kBAAkB,CAAC,CAAC,CAAC;IAC3D;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE9B;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;CAC1C;AAED;;;;;GAKG;AACH,MAAM,WAAW,GAAG,CAAC,CAAC,CAAE,SAAQ,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAC3D;;;;OAIG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAEzB;;;;OAIG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE5B;;;;;OAKG;IACH,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEpC;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEvC;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;CACxC;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,CAAE,SAAQ,GAAG,CAAC,CAAC,CAAC;IAC1C;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC;;;;OAIG;IACH,KAAK,IAAI,CAAC,CAAC;IAEX;;;;OAIG;IACH,IAAI,IAAI,CAAC,CAAC;IAEV;;OAEG;IACH,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAEpC;;OAEG;IACH,OAAO,CAAC,WAAW,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAEtC;;OAEG;IACH,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;CACpD;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IACnD;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEjC;;OAEG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEnC;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEjC;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAElC;;OAEG;IACH,SAAS,IAAI,CAAC,GAAG,SAAS,CAAC;IAE3B;;OAEG;IACH,QAAQ,IAAI,CAAC,GAAG,SAAS,CAAC;IAE1B;;OAEG;IACH,aAAa,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAEjC;;OAEG;IACH,kBAAkB,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;CACnC"}

package/dist/interfaces/set.js

@@ -0,0 +1,8 @@
+/**
+ * Set interfaces that mirror Java's Set interface hierarchy.
+ *
+ * Sets are collections that contain no duplicate elements.
+ * They provide efficient membership testing.
+ */
+export {};
+//# sourceMappingURL=set.js.map

package/dist/interfaces/set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set.js","sourceRoot":"","sources":["../../src/interfaces/set.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/register.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Registration Entry Point for client-collections
+ *
+ * This package provides collection interfaces and storage abstractions.
+ * No procedures to register - just re-exports the main module.
+ */
+export * from "./index.js";
+//# sourceMappingURL=register.d.ts.map

package/dist/register.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"register.d.ts","sourceRoot":"","sources":["../src/register.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC"}

package/dist/register.js

@@ -0,0 +1,8 @@
+/**
+ * Registration Entry Point for client-collections
+ *
+ * This package provides collection interfaces and storage abstractions.
+ * No procedures to register - just re-exports the main module.
+ */
+export * from "./index.js";
+//# sourceMappingURL=register.js.map

package/dist/register.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"register.js","sourceRoot":"","sources":["../src/register.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,YAAY,CAAC"}

package/dist/storage/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Collection Storage Backends
+ *
+ * Abstract storage layer enabling collections to be backed by:
+ * - In-memory (fast, volatile)
+ *
+ * The backends that need an RPC Client (ApiStorage: remote API, HybridStorage: local
+ * cache + remote sync) live in @procedures/client and are exported from
+ * "@procedures/client/collections". Keeping them there means this package
+ * does not depend on the client package.
+ */
+export type { CollectionStorage, StorageMetadata } from "./interface.js";
+export { normalizeStorageResult } from "./interface.js";
+export { InMemoryStorage } from "./memory.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/storage/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/storage/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,YAAY,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAExD,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/storage/index.js

@@ -0,0 +1,14 @@
+/**
+ * Collection Storage Backends
+ *
+ * Abstract storage layer enabling collections to be backed by:
+ * - In-memory (fast, volatile)
+ *
+ * The backends that need an RPC Client (ApiStorage: remote API, HybridStorage: local
+ * cache + remote sync) live in @procedures/client and are exported from
+ * "@procedures/client/collections". Keeping them there means this package
+ * does not depend on the client package.
+ */
+export { normalizeStorageResult } from "./interface.js";
+export { InMemoryStorage } from "./memory.js";
+//# sourceMappingURL=index.js.map

package/dist/storage/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/storage/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAExD,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/storage/interface.d.ts

@@ -0,0 +1,141 @@
+/**
+ * Collection Storage Interface
+ *
+ * Abstract storage layer for collections, enabling different backends:
+ * - InMemoryStorage: Fast, volatile storage using Map
+ * - ApiStorage: Remote persistence via universal client
+ * - HybridStorage: Local cache + remote sync with conflict resolution
+ * - SyncedStorage: Periodic background sync with offline support
+ *
+ * IMPORTANT: All methods return Promise to ensure client code is
+ * transport-agnostic (cannot distinguish local from remote storage).
+ */
+/**
+ * Storage backend interface for collections.
+ *
+ * All methods return Promise<T> to ensure consistent async behavior.
+ * This guarantees client code remains agnostic to the storage backend,
+ * enabling seamless switching between local and remote storage.
+ */
+export interface CollectionStorage<T> {
+    /**
+     * Get item by ID.
+     *
+     * @param id - Item identifier
+     * @returns Promise resolving to item or undefined if not found
+     */
+    get(id: string): Promise<T | undefined>;
+    /**
+     * Get all items in collection.
+     *
+     * @returns Promise resolving to array of all items
+     */
+    getAll(): Promise<T[]>;
+    /**
+     * Find items matching predicate.
+     *
+     * @param predicate - Filter function
+     * @returns Promise resolving to array of matching items
+     */
+    find(predicate: (item: T) => boolean): Promise<T[]>;
+    /**
+     * Check if item exists.
+     *
+     * @param id - Item identifier
+     * @returns Promise resolving to true if item exists
+     */
+    has(id: string): Promise<boolean>;
+    /**
+     * Get number of items in collection.
+     *
+     * @returns Promise resolving to count of items
+     */
+    size(): Promise<number>;
+    /**
+     * Set/update item by ID.
+     *
+     * @param id - Item identifier
+     * @param value - Item to store
+     * @returns Promise resolving when operation completes
+     */
+    set(id: string, value: T): Promise<void>;
+    /**
+     * Delete item by ID.
+     *
+     * @param id - Item identifier
+     * @returns Promise resolving to true if item was deleted, false if not found
+     */
+    delete(id: string): Promise<boolean>;
+    /**
+     * Clear all items from collection.
+     *
+     * @returns Promise resolving when operation completes
+     */
+    clear(): Promise<void>;
+    /**
+     * Set multiple items at once (more efficient than individual sets).
+     *
+     * @param items - Array of [id, value] tuples
+     * @returns Promise resolving when operation completes
+     */
+    setBatch(items: Array<[string, T]>): Promise<void>;
+    /**
+     * Delete multiple items at once.
+     *
+     * @param ids - Array of item identifiers
+     * @returns Promise resolving to number of items actually deleted
+     */
+    deleteBatch(ids: string[]): Promise<number>;
+    /**
+     * Get multiple items by ID at once.
+     *
+     * @param ids - Array of item identifiers
+     * @returns Promise resolving to Map of found items (missing IDs are omitted)
+     */
+    getBatch(ids: string[]): Promise<Map<string, T>>;
+    /**
+     * Close storage and cleanup resources.
+     * Should be called when collection is no longer needed.
+     *
+     * @returns Promise resolving when cleanup completes
+     */
+    close(): Promise<void>;
+    /**
+     * Get storage metadata/stats (optional).
+     * Useful for monitoring and debugging.
+     *
+     * @returns Promise resolving to storage-specific metadata
+     */
+    getMetadata?(): Promise<StorageMetadata>;
+}
+/**
+ * Optional storage metadata for monitoring.
+ */
+export interface StorageMetadata {
+    /** Storage backend type */
+    type: "memory" | "api" | "hybrid" | "synced" | "custom";
+    /** Number of items */
+    size: number;
+    /** Storage-specific stats */
+    stats?: {
+        /** Cache hit rate (for hybrid/synced storage) */
+        hitRate?: number;
+        /** Last sync timestamp (for synced storage) */
+        lastSync?: number;
+        /** Pending sync operations (for synced storage) */
+        pendingOps?: number;
+        /** Memory usage in bytes (for memory storage) */
+        memoryUsage?: number;
+        /** Custom stats */
+        [key: string]: unknown;
+    };
+}
+/**
+ * @deprecated All storage methods now return Promise.
+ * This helper is kept for backward compatibility but is no longer needed.
+ *
+ * @param value - Promise value
+ * @returns The same Promise
+ */
+export declare function normalizeStorageResult<T>(value: Promise<T>): Promise<T>;
+//# sourceMappingURL=interface.d.ts.map

package/dist/storage/interface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interface.d.ts","sourceRoot":"","sources":["../../src/storage/interface.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAKlC;;;;;OAKG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IAExC;;;;OAIG;IACH,MAAM,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAEvB;;;;;OAKG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAEpD;;;;;OAKG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAElC;;;;OAIG;IACH,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAMxB;;;;;;OAMG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEzC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAErC;;;;OAIG;IACH,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAMvB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnD;;;;;OAKG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAE5C;;;;;OAKG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IAMjD;;;;;OAKG;IACH,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAEvB;;;;;OAKG;IACH,WAAW,CAAC,IAAI,OAAO,CAAC,eAAe,CAAC,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,2BAA2B;IAC3B,IAAI,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IAExD,sBAAsB;IACtB,IAAI,EAAE,MAAM,CAAC;IAEb,6BAA6B;IAC7B,KAAK,CAAC,EAAE;QACN,iDAAiD;QACjD,OAAO,CAAC,EAAE,MAAM,CAAC;QAEjB,+CAA+C;QAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;QAElB,mDAAmD;QACnD,UAAU,CAAC,EAAE,MAAM,CAAC;QAEpB,iDAAiD;QACjD,WAAW,CAAC,EAAE,MAAM,CAAC;QAErB,mBAAmB;QACnB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;KACxB,CAAC;CACH;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAEvE"}

package/dist/storage/interface.js

@@ -0,0 +1,23 @@
+/**
+ * Collection Storage Interface
+ *
+ * Abstract storage layer for collections, enabling different backends:
+ * - InMemoryStorage: Fast, volatile storage using Map
+ * - ApiStorage: Remote persistence via universal client
+ * - HybridStorage: Local cache + remote sync with conflict resolution
+ * - SyncedStorage: Periodic background sync with offline support
+ *
+ * IMPORTANT: All methods return Promise to ensure client code is
+ * transport-agnostic (cannot distinguish local from remote storage).
+ */
+/**
+ * @deprecated All storage methods now return Promise.
+ * This helper is kept for backward compatibility but is no longer needed.
+ *
+ * @param value - Promise value
+ * @returns The same Promise
+ */
+export function normalizeStorageResult(value) {
+    return value;
+}
+//# sourceMappingURL=interface.js.map

package/dist/storage/interface.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interface.js","sourceRoot":"","sources":["../../src/storage/interface.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA8JH;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAI,KAAiB;IACzD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/storage/memory.d.ts

@@ -0,0 +1,68 @@
+/**
+ * In-Memory Storage Implementation
+ *
+ * Fast, volatile storage using JavaScript Map.
+ * All operations return Promises for interface consistency.
+ */
+import type { CollectionStorage, StorageMetadata } from "./interface.js";
+/**
+ * In-memory storage backed by JavaScript Map.
+ *
+ * Features:
+ * - Fast lookups O(1)
+ * - No persistence (data lost on restart)
+ * - Memory-bound (limited by available RAM)
+ * - Returns Promises for API consistency with remote storage
+ *
+ * @example
+ * ```typescript
+ * const storage = new InMemoryStorage<User>();
+ * await storage.set("123", { id: "123", name: "John" });
+ * const user = await storage.get("123"); // { id: "123", name: "John" }
+ * ```
+ */
+export declare class InMemoryStorage<T> implements CollectionStorage<T> {
+    private data;
+    get(id: string): Promise<T | undefined>;
+    getAll(): Promise<T[]>;
+    find(predicate: (item: T) => boolean): Promise<T[]>;
+    has(id: string): Promise<boolean>;
+    size(): Promise<number>;
+    set(id: string, value: T): Promise<void>;
+    delete(id: string): Promise<boolean>;
+    clear(): Promise<void>;
+    setBatch(items: Array<[string, T]>): Promise<void>;
+    deleteBatch(ids: string[]): Promise<number>;
+    getBatch(ids: string[]): Promise<Map<string, T>>;
+    close(): Promise<void>;
+    getMetadata(): Promise<StorageMetadata>;
+    /**
+     * Get all keys in storage.
+     *
+     * @returns Iterator of keys
+     */
+    keys(): IterableIterator<string>;
+    /**
+     * Get all values in storage.
+     *
+     * @returns Iterator of values
+     */
+    values(): IterableIterator<T>;
+    /**
+     * Get all entries in storage.
+     *
+     * @returns Iterator of [id, value] tuples
+     */
+    entries(): IterableIterator<[string, T]>;
+    /**
+     * Iterate over storage entries.
+     *
+     * @param callback - Function to call for each entry
+     */
+    forEach(callback: (value: T, key: string, map: Map<string, T>) => void): void;
+    /**
+     * Make storage iterable.
+     */
+    [Symbol.iterator](): IterableIterator<[string, T]>;
+}
+//# sourceMappingURL=memory.d.ts.map

package/dist/storage/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/storage/memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEzE;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,eAAe,CAAC,CAAC,CAAE,YAAW,iBAAiB,CAAC,CAAC,CAAC;IAC7D,OAAO,CAAC,IAAI,CAAwB;IAMpC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAEtC;IAED,MAAM,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAErB;IAED,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAQlD;IAED,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEhC;IAED,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,CAEtB;IAMD,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAGvC;IAED,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAEnC;IAED,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAGrB;IAMD,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAKjD;IAED,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAQ1C;IAED,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAS/C;IAMD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAIrB;IAED,WAAW,IAAI,OAAO,CAAC,eAAe,CAAC,CAatC;IAMD;;;;OAIG;IACH,IAAI,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAE/B;IAED;;;;OAIG;IACH,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAE5B;IAED;;;;OAIG;IACH,OAAO,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAEvC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI,CAE5E;IAED;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAEjD;CACF"}

package/dist/storage/memory.js

@@ -0,0 +1,154 @@
+/**
+ * In-Memory Storage Implementation
+ *
+ * Fast, volatile storage using JavaScript Map.
+ * All operations return Promises for interface consistency.
+ */
+/**
+ * In-memory storage backed by JavaScript Map.
+ *
+ * Features:
+ * - Fast lookups O(1)
+ * - No persistence (data lost on restart)
+ * - Memory-bound (limited by available RAM)
+ * - Returns Promises for API consistency with remote storage
+ *
+ * @example
+ * ```typescript
+ * const storage = new InMemoryStorage<User>();
+ * await storage.set("123", { id: "123", name: "John" });
+ * const user = await storage.get("123"); // { id: "123", name: "John" }
+ * ```
+ */
+export class InMemoryStorage {
+    data = new Map();
+    //
+    // ═══ Read Operations ═══
+    //
+    get(id) {
+        return Promise.resolve(this.data.get(id));
+    }
+    getAll() {
+        return Promise.resolve(Array.from(this.data.values()));
+    }
+    find(predicate) {
+        const results = [];
+        for (const item of this.data.values()) {
+            if (predicate(item)) {
+                results.push(item);
+            }
+        }
+        return Promise.resolve(results);
+    }
+    has(id) {
+        return Promise.resolve(this.data.has(id));
+    }
+    size() {
+        return Promise.resolve(this.data.size);
+    }
+    //
+    // ═══ Write Operations ═══
+    //
+    set(id, value) {
+        this.data.set(id, value);
+        return Promise.resolve();
+    }
+    delete(id) {
+        return Promise.resolve(this.data.delete(id));
+    }
+    clear() {
+        this.data.clear();
+        return Promise.resolve();
+    }
+    //
+    // ═══ Bulk Operations ═══
+    //
+    setBatch(items) {
+        for (const [id, value] of items) {
+            this.data.set(id, value);
+        }
+        return Promise.resolve();
+    }
+    deleteBatch(ids) {
+        let deleted = 0;
+        for (const id of ids) {
+            if (this.data.delete(id)) {
+                deleted++;
+            }
+        }
+        return Promise.resolve(deleted);
+    }
+    getBatch(ids) {
+        const result = new Map();
+        for (const id of ids) {
+            const value = this.data.get(id);
+            if (value !== undefined) {
+                result.set(id, value);
+            }
+        }
+        return Promise.resolve(result);
+    }
+    //
+    // ═══ Lifecycle & Metadata ═══
+    //
+    close() {
+        // No cleanup needed for in-memory storage
+        this.data.clear();
+        return Promise.resolve();
+    }
+    getMetadata() {
+        // Rough memory estimation:
+        // Each entry has ~overhead of 100 bytes (key string + Map entry overhead)
+        const estimatedEntrySize = 100;
+        const memoryUsage = this.data.size * estimatedEntrySize;
+        return Promise.resolve({
+            type: "memory",
+            size: this.data.size,
+            stats: {
+                memoryUsage,
+            },
+        });
+    }
+    //
+    // ═══ Additional Methods (Map compatibility) ═══
+    //
+    /**
+     * Get all keys in storage.
+     *
+     * @returns Iterator of keys
+     */
+    keys() {
+        return this.data.keys();
+    }
+    /**
+     * Get all values in storage.
+     *
+     * @returns Iterator of values
+     */
+    values() {
+        return this.data.values();
+    }
+    /**
+     * Get all entries in storage.
+     *
+     * @returns Iterator of [id, value] tuples
+     */
+    entries() {
+        return this.data.entries();
+    }
+    /**
+     * Iterate over storage entries.
+     *
+     * @param callback - Function to call for each entry
+     */
+    forEach(callback) {
+        this.data.forEach(callback);
+    }
+    /**
+     * Make storage iterable.
+     */
+    [Symbol.iterator]() {
+        return this.data.entries();
+    }
+}
+//# sourceMappingURL=memory.js.map

package/dist/storage/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/storage/memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,eAAe;IAClB,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;IAEpC,EAAE;IACF,0BAA0B;IAC1B,EAAE;IAEF,GAAG,CAAC,EAAU;QACZ,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM;QACJ,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,CAAC,SAA+B;QAClC,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI;QACF,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,EAAE;IACF,2BAA2B;IAC3B,EAAE;IAEF,GAAG,CAAC,EAAU,EAAE,KAAQ;QACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED,MAAM,CAAC,EAAU;QACf,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED,EAAE;IACF,0BAA0B;IAC1B,EAAE;IAEF,QAAQ,CAAC,KAAyB;QAChC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED,WAAW,CAAC,GAAa;QACvB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,QAAQ,CAAC,GAAa;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;QACpC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED,EAAE;IACF,+BAA+B;IAC/B,EAAE;IAEF,KAAK;QACH,0CAA0C;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED,WAAW;QACT,2BAA2B;QAC3B,0EAA0E;QAC1E,MAAM,kBAAkB,GAAG,GAAG,CAAC;QAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;QAExD,OAAO,OAAO,CAAC,OAAO,CAAC;YACrB,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;YACpB,KAAK,EAAE;gBACL,WAAW;aACZ;SACF,CAAC,CAAC;IACL,CAAC;IAED,EAAE;IACF,iDAAiD;IACjD,EAAE;IAEF;;;;OAIG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAA8D;QACpE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;CACF"}