@signaldb/localstorage 2.0.0-beta.5 → 2.0.0-beta.7

package/dist/base/core/src/utils/isEqual.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Compares two values for deep equality.
+ * @param a - The first value to compare.
+ * @param b - The second value to compare.
+ * @returns - Returns `true` if the two values are deeply equal, otherwise `false`.
+ * @example
+ * isEqual({ a: 1 }, { a: 1 }); // true
+ * isEqual([1, 2], [1, 2]);     // true
+ * isEqual(new Date(0), new Date(0)); // true
+ * isEqual(/abc/, /abc/);       // true
+ * isEqual({ a: 1 }, { a: 2 }); // false
+ * isEqual(null, null);         // true
+ */
+export default function isEqual<T, K>(a: T, b: K): boolean;

package/dist/base/core/src/utils/isFieldExpression.d.ts

@@ -0,0 +1,11 @@
+import type { FieldExpression } from '../types/Selector';
+/**
+ * Determines whether a given object is a valid field expression.
+ * A field expression is an object containing query operators supported by MongoDB-style queries.
+ * @template T - The type of the field expression.
+ * @param expression - The object to test.
+ * @returns A boolean indicating whether the object is a valid field expression.
+ *   - `true` if the object contains only recognized query operators.
+ *   - `false` otherwise.
+ */
+export default function isFieldExpression<T>(expression: any): expression is FieldExpression<T>;

package/dist/base/core/src/utils/match.d.ts

@@ -0,0 +1,12 @@
+import type Selector from '../types/Selector';
+type BaseItem = Record<string, any>;
+/**
+ * Tests whether a given item matches a specified selector.
+ * Uses the `mingo` library to evaluate the query.
+ * @template T - The type of the item being tested.
+ * @param item - The item to test against the selector.
+ * @param selector - The query selector used to match the item.
+ * @returns A boolean indicating whether the item matches the selector.
+ */
+export default function match<T extends BaseItem = BaseItem>(item: T, selector: Selector<T>): boolean;
+export {};

package/dist/base/core/src/utils/modify.d.ts

@@ -0,0 +1,14 @@
+import type Modifier from '../types/Modifier';
+/**
+ * Applies a modifier to an object and returns a new modified object.
+ * @template T - The type of the object to be modified.
+ * @param item - The object to be modified.
+ * @param modifier - The modifier to apply. This can be any transformation logic.
+ * @returns - Returns a new object with the modifications applied.
+ * @example
+ * const item = { a: 1, b: 2 }
+ * const modifier = { $set: { b: 3, c: 4 } }
+ * const result = modify(item, modifier)
+ * // result: { a: 1, b: 3, c: 4 }
+ */
+export default function modify<T extends Record<string, any>>(item: T, modifier: Modifier): T;

package/dist/base/core/src/utils/project.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Projects the fields of an object based on a specified fields configuration.
+ * Supports inclusion (`1`) and exclusion (`0`) of specific fields. Creates a new object
+ * with the desired fields included or excluded, based on the configuration.
+ * @template T - The type of the object being projected.
+ * @param item - The original object to project fields from.
+ * @param fields - An object defining the fields to include (`1`) or exclude (`0`).
+ *   - Keys are the field names, and values are either `1` (include) or `0` (exclude).
+ * @returns A new object with the specified fields included or excluded.
+ *   - If all fields are set to `0`, the excluded fields are removed from the result.
+ *   - If fields are set to `1`, only the included fields are retained.
+ */
+export default function project<T extends Record<string, any>>(item: T, fields: {
+    [P in keyof T]?: 0 | 1;
+} & Record<string, 0 | 1>): T;

package/dist/base/core/src/utils/queryId.d.ts

@@ -0,0 +1,9 @@
+import type { QueryOptions } from '../DataAdapter';
+import type Selector from '../types/Selector';
+/**
+ * Generates a unique identifier for a query based on its selector and options.
+ * @param selector - The selector object.
+ * @param options - The query options object (optional).
+ * @returns A unique identifier string for the query.
+ */
+export default function queryId(selector: Selector<any>, options?: QueryOptions<any>): string;

package/dist/base/core/src/utils/randomId.d.ts

@@ -0,0 +1,7 @@
+/**
+ * creates a random id
+ * @returns a random string of 16 characters
+ * @example
+ * randomId() // '1234567890abcdef'
+ */
+export default function randomId(): string;

package/dist/base/core/src/utils/reactiveOrAsync.d.ts

@@ -0,0 +1,59 @@
+export type MaybePromise<T> = T | Promise<T>;
+/**
+ * Options that control execution mode (and potential future mode-specific behavior).
+ * Keep this minimal; you can extend it later (e.g. signal, timeoutMs, debugLabel).
+ */
+export type ModeOptions = {
+    async?: boolean;
+};
+/**
+ * A generator helper that makes TypeScript infer the “synchronous value type” for maybe-async expressions.
+ *
+ * Usage:
+ *   const doc = yield* unwrap(Collection.findOne(...))
+ *   const list = yield* unwrap(Collection.find(...).fetch())
+ *
+ * Runtime note:
+ *   This does not “unwrap” Promises by itself. It yields the value/Promise to the runner and returns the
+ *   value that the runner feeds back via `.next(...)`.
+ * @param value The value (or Promise of a value) to yield to the runner.
+ * @returns A generator that yields `value` and resolves to the runner-supplied unwrapped `T`.
+ */
+export declare function unwrap<T>(value: MaybePromise<T>): Generator<MaybePromise<T>, T, T>;
+/**
+ * Generator shape used by the factory.
+ *
+ * `TThis` is the type of `this` inside the generator.
+ * `Args` are the method parameters (excluding the mode flag).
+ * `TReturn` is the final return value of the workflow.
+ * `TNext` is the type that is yielded/awaited and fed back via `.next(...)`.
+ *
+ * Note:
+ * - For best inference at yield sites, prefer `yield* unwrap(expr)` for maybe-async expressions.
+ */
+export type ReactiveOrAsyncGen<TThis, Arguments extends any[], TReturn, TNext> = (this: TThis, a: boolean, ...args: Arguments) => Generator<MaybePromise<TNext>, TReturn, TNext>;
+/**
+ * The method type produced from the generator signature.
+ * Adds overloads so that `{ async: true }` yields a `Promise<...>` return type.
+ */
+export type ReactiveOrAsyncMethod<TThis, P extends any[], R, N> = {
+    (this: TThis, ...args: P): R;
+    (this: TThis, ...args: [...P, ModeOptions?]): MaybePromise<R>;
+    (this: TThis, ...args: [...P, {
+        async: true;
+    }]): Promise<R>;
+} & {
+    /** Exposes the underlying generator for composition via `yield* method.generator.call(this, a, ...)` */
+    generator: (this: TThis, a: boolean, ...args: P) => Generator<MaybePromise<N>, R, N>;
+};
+/**
+ * Factory that turns a generator workflow into a callable method that can run in sync (reactive) or async mode.
+ *
+ * Call style:
+ *   fn(a, b)                        -> sync/reactive return
+ *   await fn(a, b, { async: true }) -> async return
+ * @param gen Generator workflow. Receives `(a)` which indicates async mode and should `yield`/`yield* unwrap(...)`
+ *   any values that may be Promises.
+ * @returns A callable method with overloads plus a `.generator` property for composition.
+ */
+export default function reactiveOrAsync<TThis, P extends any[], R, N>(gen: (this: TThis, a: boolean, ...args: P) => Generator<MaybePromise<N>, R, N>): ReactiveOrAsyncMethod<TThis, P, R, N>;

package/dist/base/core/src/utils/serializeValue.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Serializes a value into a string representation.
+ * Handles various types, including strings, numbers, booleans, dates, and objects.
+ * Falls back to JSON stringification for unsupported types.
+ * @param value - The value to serialize.
+ *   - Strings are returned as-is.
+ *   - Numbers and booleans are converted to their string representation.
+ *   - Dates are converted to ISO string format.
+ *   - Other values are stringified using `JSON.stringify`.
+ * @returns A string representation of the value.
+ */
+export default function serializeValue(value: any): string | null;

package/dist/base/core/src/utils/set.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Sets a value at a specified path within an object. Creates nested structures
+ * (arrays or objects) as needed to set the value at the correct location. Supports
+ * deleting the key if the value is `undefined` and the `deleteIfUndefined` flag is set to `true`.
+ * @template T - The type of the object to modify.
+ * @template K - The type of the value to set.
+ * @param object - The object to modify. The object is mutated directly.
+ * @param path - The path (dot or bracket notation) where the value should be set.
+ * @param value - The value to set at the specified path.
+ * @param deleteIfUndefined - A boolean indicating whether to delete the key if the value is `undefined` (default: `false`).
+ * @returns The modified object.
+ */
+export default function set<T extends object, K>(object: T, path: string, value: K, deleteIfUndefined?: boolean): T;

package/dist/base/core/src/utils/sortItems.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Sorts an array of items based on multiple fields and their specified sort order.
+ * Uses the `fast-sort` library for efficient sorting.
+ * @template T - The type of the items in the array.
+ * @param items - The array of items to be sorted.
+ * @param sortFields - An object defining the sort order for each field.
+ *   - Keys are the field names, and values are either `1` (ascending) or `-1` (descending).
+ * @returns A new array of items sorted based on the specified fields and their order.
+ */
+export default function sortItems<T extends Record<string, any>>(items: T[], sortFields: {
+    [P in keyof T]?: -1 | 1;
+} & Record<string, -1 | 1>): T[];

package/dist/base/core/src/utils/uniqueBy.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Filters an array to ensure unique values based on a specified key or transformation function.
+ * @template T - The type of the elements in the array.
+ * @param array - The array to filter for unique values.
+ * @param fn - A key or transformation function to determine uniqueness.
+ *   - If a key is provided, it will use the corresponding property of each element for uniqueness.
+ *   - If a function is provided, it will use the return value of the function applied to each element for uniqueness.
+ * @returns A new array containing only unique elements based on the specified key or transformation.
+ */
+export default function uniqueBy<T>(array: T[], fn: keyof T | ((item: T) => any)): T[];

package/dist/index.mjs

@@ -1,166 +1,152 @@
-import { createStorageAdapter as C, get as f, serializeValue as E } from "@signaldb/core";
-function T(M, g) {
-  const c = globalThis.localStorage;
-  if (c == null)
-    throw new Error("localStorage is not available in this environment");
-  const y = g?.serialize || ((e) => JSON.stringify(e)), w = g?.deserialize || ((e) => JSON.parse(e)), $ = g?.databaseName || "signaldb", b = `${M}`, d = `${$}-${b}`, u = (e) => `${d}-index-${e}`, i = [], l = () => {
-    const e = c.getItem(d);
-    if (!e)
-      return [];
-    try {
-      const o = w(e);
-      return Array.isArray(o) ? o : [];
-    } catch {
-      return [];
-    }
-  }, h = (e) => {
-    c.setItem(d, y(e));
-  }, z = async (e) => {
-    const o = c.getItem(u(e));
-    if (!o)
-      throw new Error(`Index on field "${e}" does not exist`);
-    let t;
-    try {
-      t = w(o);
-    } catch {
-      throw new Error(`Corrupted index on field "${e}"`);
-    }
-    const n = /* @__PURE__ */ new Map();
-    return Object.entries(t).forEach(([s, r]) => {
-      n.has(s) || n.set(s, /* @__PURE__ */ new Set()), r.forEach((a) => n.get(s)?.add(a));
-    }), n;
-  }, v = (e, o) => {
-    const t = {};
-    o.forEach((n, s) => {
-      t[String(E(s))] = [...n];
-    }), c.setItem(u(e), y(t));
-  }, A = async (e, o = l()) => {
-    const t = /* @__PURE__ */ new Map();
-    o.forEach((n) => {
-      const s = f(n, e);
-      s != null && (t.has(s) || t.set(s, /* @__PURE__ */ new Set()), t.get(s)?.add(n.id));
-    }), v(e, t);
-  }, m = (e) => String(E(e)), D = (e) => {
-    const o = c.getItem(u(e));
-    if (!o)
-      return;
-    let t;
-    try {
-      t = w(o);
-    } catch {
-      throw new Error(`Corrupted index on field "${e}"`);
-    }
-    const n = /* @__PURE__ */ new Map();
-    return Object.entries(t).forEach(([s, r]) => {
-      n.set(s, new Set(r));
-    }), n;
-  }, p = (e, o, t, n, s) => {
-    e.has(o) || e.set(o, { adds: /* @__PURE__ */ new Map(), removes: /* @__PURE__ */ new Map() });
-    const r = e.get(o);
-    if (!r)
-      return;
-    const a = t === "add" ? r.adds : r.removes;
-    a.has(n) || a.set(n, /* @__PURE__ */ new Set()), a.get(n)?.add(s);
-  }, I = (e) => {
-    e.forEach((o, t) => {
-      const n = D(t);
-      n && (o.removes.forEach((s, r) => {
-        const a = n.get(r);
-        a && (s.forEach((x) => a.delete(x)), a.size === 0 && n.delete(r));
-      }), o.adds.forEach((s, r) => {
-        let a = n.get(r);
-        a || (a = /* @__PURE__ */ new Set(), n.set(r, a)), s.forEach((x) => a.add(x));
-      }), v(t, n));
-    });
-  }, K = (e, o, t, n, s) => {
-    const r = t == null ? void 0 : m(t), a = n == null ? void 0 : m(n);
-    r !== a && (r != null && p(e, o, "remove", r, s), a != null && p(e, o, "add", a, s));
-  }, N = (e, o, t) => {
-    if (o)
-      for (const n of i)
-        K(e, n, f(o, n), f(t, n), t.id);
-    else
-      for (const n of i) {
-        const s = f(t, n);
-        s != null && p(e, n, "add", m(s), t.id);
-      }
-  }, O = (e, o) => {
-    for (const t of i) {
-      const n = f(o, t);
-      n != null && p(e, t, "remove", m(n), o.id);
-    }
-  }, S = (e) => {
-    const o = l(), t = new Map(o.map((s) => [s.id, s])), n = /* @__PURE__ */ new Map();
-    for (const s of e) {
-      const r = t.get(s.id);
-      N(n, r, s), t.set(s.id, s);
-    }
-    h([...t.values()]), I(n);
-  };
-  return C({
-    // lifecycle methods
-    setup: async () => {
-      c.getItem(d) == null && h([]);
-      const e = `${d}-index-`;
-      for (let o = 0; o < c.length; o++) {
-        const t = c.key(o);
-        if (t && t.startsWith(e)) {
-          const n = t.slice(e.length);
-          i.includes(n) || i.push(n);
-        }
-      }
-    },
-    teardown: async () => {
-    },
-    // data retrieval methods
-    readAll: async () => l(),
-    readIds: async (e) => {
-      const o = l(), t = new Set(e);
-      return o.filter((n) => t.has(n.id));
-    },
-    // index methods
-    createIndex: async (e) => {
-      if (e === "id")
-        throw new Error("Cannot create index on id field");
-      i.includes(e) || i.push(e), await A(e);
-    },
-    dropIndex: async (e) => {
-      if (i.includes(e)) {
-        const t = i.indexOf(e);
-        i.splice(t, 1);
-      }
-      const o = u(e);
-      if (c.getItem(o) == null)
-        throw new Error(`Index on field "${e}" does not exist`);
-      c.removeItem(o);
-    },
-    readIndex: z,
-    // data manipulation methods
-    insert: async (e) => {
-      S(e);
-    },
-    replace: async (e) => {
-      S(e);
-    },
-    remove: async (e) => {
-      const o = l(), t = new Map(o.map((r) => [r.id, r])), n = /* @__PURE__ */ new Map();
-      new Set(e.map((r) => r.id)).forEach((r) => {
-        const a = t.get(r);
-        a && (O(n, a), t.delete(r));
-      }), h([...t.values()]), I(n);
-    },
-    removeAll: async () => {
-      h([]);
-      const e = `${d}-index-`, o = [];
-      for (let t = 0; t < c.length; t++) {
-        const n = c.key(t);
-        n && n.startsWith(e) && o.push(n);
-      }
-      o.forEach((t) => c.removeItem(t)), i.splice(0);
-    }
-  });
+import { createStorageAdapter as e, get as t, serializeValue as n } from "@signaldb/core";
+//#region src/index.ts
+function r(r, i) {
+	let a = globalThis.localStorage;
+	if (a == null) throw Error("localStorage is not available in this environment");
+	let o = i?.serialize || ((e) => JSON.stringify(e)), s = i?.deserialize || ((e) => JSON.parse(e)), c = `${i?.databaseName || "signaldb"}-${`${r}`}`, l = (e) => `${c}-index-${e}`, u = [], d = () => {
+		let e = a.getItem(c);
+		if (!e) return [];
+		try {
+			let t = s(e);
+			return Array.isArray(t) ? t : [];
+		} catch {
+			return [];
+		}
+	}, f = (e) => {
+		a.setItem(c, o(e));
+	}, p = async (e) => {
+		let t = a.getItem(l(e));
+		if (!t) throw Error(`Index on field "${e}" does not exist`);
+		let n;
+		try {
+			n = s(t);
+		} catch {
+			throw Error(`Corrupted index on field "${e}"`);
+		}
+		let r = /* @__PURE__ */ new Map();
+		return Object.entries(n).forEach(([e, t]) => {
+			r.has(e) || r.set(e, /* @__PURE__ */ new Set()), t.forEach((t) => r.get(e)?.add(t));
+		}), r;
+	}, m = (e, t) => {
+		let r = {};
+		t.forEach((e, t) => {
+			r[String(n(t))] = [...e];
+		}), a.setItem(l(e), o(r));
+	}, h = async (e, n = d()) => {
+		let r = /* @__PURE__ */ new Map();
+		n.forEach((n) => {
+			let i = t(n, e);
+			i != null && (r.has(i) || r.set(i, /* @__PURE__ */ new Set()), r.get(i)?.add(n.id));
+		}), m(e, r);
+	}, g = (e) => String(n(e)), _ = (e) => {
+		let t = a.getItem(l(e));
+		if (!t) return;
+		let n;
+		try {
+			n = s(t);
+		} catch {
+			throw Error(`Corrupted index on field "${e}"`);
+		}
+		let r = /* @__PURE__ */ new Map();
+		return Object.entries(n).forEach(([e, t]) => {
+			r.set(e, new Set(t));
+		}), r;
+	}, v = (e, t, n, r, i) => {
+		e.has(t) || e.set(t, {
+			adds: /* @__PURE__ */ new Map(),
+			removes: /* @__PURE__ */ new Map()
+		});
+		let a = e.get(t);
+		if (!a) return;
+		let o = n === "add" ? a.adds : a.removes;
+		o.has(r) || o.set(r, /* @__PURE__ */ new Set()), o.get(r)?.add(i);
+	}, y = (e) => {
+		e.forEach((e, t) => {
+			let n = _(t);
+			n && (e.removes.forEach((e, t) => {
+				let r = n.get(t);
+				r && (e.forEach((e) => r.delete(e)), r.size === 0 && n.delete(t));
+			}), e.adds.forEach((e, t) => {
+				let r = n.get(t);
+				r || (r = /* @__PURE__ */ new Set(), n.set(t, r)), e.forEach((e) => r.add(e));
+			}), m(t, n));
+		});
+	}, b = (e, t, n, r, i) => {
+		let a = n == null ? void 0 : g(n), o = r == null ? void 0 : g(r);
+		a !== o && (a != null && v(e, t, "remove", a, i), o != null && v(e, t, "add", o, i));
+	}, x = (e, n, r) => {
+		if (n) for (let i of u) b(e, i, t(n, i), t(r, i), r.id);
+		else for (let n of u) {
+			let i = t(r, n);
+			i != null && v(e, n, "add", g(i), r.id);
+		}
+	}, S = (e, n) => {
+		for (let r of u) {
+			let i = t(n, r);
+			i != null && v(e, r, "remove", g(i), n.id);
+		}
+	}, C = (e) => {
+		let t = d(), n = new Map(t.map((e) => [e.id, e])), r = /* @__PURE__ */ new Map();
+		for (let t of e) x(r, n.get(t.id), t), n.set(t.id, t);
+		f([...n.values()]), y(r);
+	};
+	return e({
+		setup: async () => {
+			a.getItem(c) ?? f([]);
+			let e = `${c}-index-`;
+			for (let t = 0; t < a.length; t++) {
+				let n = a.key(t);
+				if (n && n.startsWith(e)) {
+					let t = n.slice(e.length);
+					u.includes(t) || u.push(t);
+				}
+			}
+		},
+		teardown: async () => {},
+		readAll: async () => d(),
+		readIds: async (e) => {
+			let t = d(), n = new Set(e);
+			return t.filter((e) => n.has(e.id));
+		},
+		createIndex: async (e) => {
+			if (e === "id") throw Error("Cannot create index on id field");
+			u.includes(e) || u.push(e), await h(e);
+		},
+		dropIndex: async (e) => {
+			if (u.includes(e)) {
+				let t = u.indexOf(e);
+				u.splice(t, 1);
+			}
+			let t = l(e);
+			if (a.getItem(t) == null) throw Error(`Index on field "${e}" does not exist`);
+			a.removeItem(t);
+		},
+		readIndex: p,
+		insert: async (e) => {
+			C(e);
+		},
+		replace: async (e) => {
+			C(e);
+		},
+		remove: async (e) => {
+			let t = d(), n = new Map(t.map((e) => [e.id, e])), r = /* @__PURE__ */ new Map();
+			new Set(e.map((e) => e.id)).forEach((e) => {
+				let t = n.get(e);
+				t && (S(r, t), n.delete(e));
+			}), f([...n.values()]), y(r);
+		},
+		removeAll: async () => {
+			f([]);
+			let e = `${c}-index-`, t = [];
+			for (let n = 0; n < a.length; n++) {
+				let r = a.key(n);
+				r && r.startsWith(e) && t.push(r);
+			}
+			t.forEach((e) => a.removeItem(e)), u.splice(0);
+		}
+	});
 }
-export {
-  T as default
-};
-//# sourceMappingURL=index.mjs.map
+//#endregion
+export { r as default };
+
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":["../src/index.ts"],"sourcesContent":["import { createStorageAdapter, get, serializeValue } from '@signaldb/core';\n/**\n * Creates a storage adapter for managing a SignalDB collection using localStorage.\n * @param name - A unique name for the collection, used as part of the localStorage key.\n * @param options - Optional configuration for the adapter.\n * @param options.databaseName - An optional name for the database to namespace the storage (default: 'signaldb').\n * @param options.serialize - A function to serialize items to a string (default: `JSON.stringify`).\n * @param options.deserialize - A function to deserialize a string into items (default: `JSON.parse`).\n * @returns A SignalDB storage adapter for managing data in localStorage.\n */\nexport default function createLocalStorageAdapter(name, options) {\n    const localStorage = globalThis.localStorage;\n    if (localStorage == null) {\n        throw new Error('localStorage is not available in this environment');\n    }\n    const serialize = options?.serialize || (data => JSON.stringify(data));\n    const deserialize = options?.deserialize || (input => JSON.parse(input));\n    const databaseName = options?.databaseName || 'signaldb';\n    const storeName = `${name}`;\n    // We use a single key that namespaces by database and store names\n    const storageKey = `${databaseName}-${storeName}`;\n    const indexKeyFor = (field) => `${storageKey}-index-${field}`;\n    const indices = [];\n    const readFromStorage = () => {\n        const serialized = localStorage.getItem(storageKey);\n        if (!serialized)\n            return [];\n        try {\n            const parsed = deserialize(serialized);\n            return Array.isArray(parsed) ? parsed : [];\n        }\n        catch {\n            // If parsing fails, treat as empty to avoid corrupting runtime\n            return [];\n        }\n    };\n    const writeToStorage = (items) => {\n        localStorage.setItem(storageKey, serialize(items));\n    };\n    const readIndex = async (field) => {\n        const serialized = localStorage.getItem(indexKeyFor(field));\n        if (!serialized)\n            throw new Error(`Index on field \"${field}\" does not exist`);\n        let data;\n        try {\n            data = deserialize(serialized);\n        }\n        catch {\n            throw new Error(`Corrupted index on field \"${field}\"`);\n        }\n        const index = new Map();\n        Object.entries(data).forEach(([key, ids]) => {\n            if (!index.has(key))\n                index.set(key, new Set());\n            ids.forEach(id => index.get(key)?.add(id));\n        });\n        return index;\n    };\n    const saveIndexMap = (field, index) => {\n        const safeIndex = {};\n        index.forEach((ids, key) => {\n            safeIndex[String(serializeValue(key))] = [...ids];\n        });\n        localStorage.setItem(indexKeyFor(field), serialize(safeIndex));\n    };\n    const ensureIndex = async (field, items = readFromStorage()) => {\n        const index = new Map();\n        items.forEach((item) => {\n            const fieldValue = get(item, field);\n            if (fieldValue == null)\n                return;\n            if (!index.has(fieldValue))\n                index.set(fieldValue, new Set());\n            index.get(fieldValue)?.add(item.id);\n        });\n        saveIndexMap(field, index);\n    };\n    // --- Delta indexing helpers ---\n    const safeKeyFor = (value) => String(serializeValue(value));\n    const loadIndexMap = (field) => {\n        const serialized = localStorage.getItem(indexKeyFor(field));\n        if (!serialized)\n            return undefined;\n        let data;\n        try {\n            data = deserialize(serialized);\n        }\n        catch {\n            throw new Error(`Corrupted index on field \"${field}\"`);\n        }\n        const index = new Map();\n        Object.entries(data).forEach(([key, ids]) => {\n            index.set(key, new Set(ids));\n        });\n        return index;\n    };\n    const addToDelta = (deltas, field, kind, key, id) => {\n        if (!deltas.has(field)) {\n            deltas.set(field, { adds: new Map(), removes: new Map() });\n        }\n        const delta = deltas.get(field);\n        if (!delta)\n            return;\n        const target = kind === 'add' ? delta.adds : delta.removes;\n        if (!target.has(key))\n            target.set(key, new Set());\n        target.get(key)?.add(id);\n    };\n    const applyIndexDeltas = (deltas) => {\n        // Update only the indices that have changes\n        deltas.forEach((delta, field) => {\n            const index = loadIndexMap(field);\n            // If the index doesn't exist, skip (we only maintain indices that were created)\n            if (!index)\n                return;\n            // Apply removals\n            delta.removes.forEach((ids, key) => {\n                const set = index.get(key);\n                if (!set)\n                    return;\n                ids.forEach(id => set.delete(id));\n                if (set.size === 0)\n                    index.delete(key);\n            });\n            // Apply additions\n            delta.adds.forEach((ids, key) => {\n                let set = index.get(key);\n                if (!set) {\n                    set = new Set();\n                    index.set(key, set);\n                }\n                ids.forEach(id => set.add(id));\n            });\n            saveIndexMap(field, index);\n        });\n    };\n    const addDeltaForChange = (deltas, field, oldValue, newValue, id) => {\n        const oldKey = oldValue == null ? undefined : safeKeyFor(oldValue);\n        const newKey = newValue == null ? undefined : safeKeyFor(newValue);\n        if (oldKey === newKey)\n            return;\n        if (oldKey != null)\n            addToDelta(deltas, field, 'remove', oldKey, id);\n        if (newKey != null)\n            addToDelta(deltas, field, 'add', newKey, id);\n    };\n    const accumulateUpsertDelta = (deltas, existing, next) => {\n        if (existing) {\n            for (const field of indices) {\n                addDeltaForChange(deltas, field, get(existing, field), get(next, field), next.id);\n            }\n        }\n        else {\n            for (const field of indices) {\n                const value = get(next, field);\n                if (value == null)\n                    continue;\n                addToDelta(deltas, field, 'add', safeKeyFor(value), next.id);\n            }\n        }\n    };\n    const accumulateRemoveDelta = (deltas, existing) => {\n        for (const field of indices) {\n            const value = get(existing, field);\n            if (value == null)\n                continue;\n            addToDelta(deltas, field, 'remove', safeKeyFor(value), existing.id);\n        }\n    };\n    const upsertItems = (itemsToUpsert) => {\n        const items = readFromStorage();\n        const byId = new Map(items.map(item => [item.id, item]));\n        const deltas = new Map();\n        for (const item of itemsToUpsert) {\n            const existing = byId.get(item.id);\n            accumulateUpsertDelta(deltas, existing, item);\n            byId.set(item.id, item);\n        }\n        writeToStorage([...byId.values()]);\n        applyIndexDeltas(deltas);\n    };\n    return createStorageAdapter({\n        // lifecycle methods\n        setup: async () => {\n            // For localStorage, there is no database to open; we just ensure the key exists\n            if (localStorage.getItem(storageKey) == null) {\n                writeToStorage([]);\n            }\n            // Hydrate known index fields from existing keys so that we can keep them updated across sessions\n            const prefix = `${storageKey}-index-`;\n            for (let i = 0; i < localStorage.length; i++) {\n                const k = localStorage.key(i);\n                if (k && k.startsWith(prefix)) {\n                    const field = k.slice(prefix.length);\n                    if (!indices.includes(field))\n                        indices.push(field);\n                }\n            }\n        },\n        teardown: async () => {\n            // no-op\n        },\n        // data retrieval methods\n        readAll: async () => {\n            return readFromStorage();\n        },\n        readIds: async (ids) => {\n            const items = readFromStorage();\n            const idSet = new Set(ids);\n            return items.filter(item => idSet.has(item.id));\n        },\n        // index methods\n        createIndex: async (field) => {\n            if (field === 'id')\n                throw new Error('Cannot create index on id field');\n            if (!indices.includes(field))\n                indices.push(field);\n            await ensureIndex(field);\n        },\n        dropIndex: async (field) => {\n            if (indices.includes(field)) {\n                const i = indices.indexOf(field);\n                indices.splice(i, 1);\n            }\n            const key = indexKeyFor(field);\n            if (localStorage.getItem(key) == null) {\n                throw new Error(`Index on field \"${field}\" does not exist`);\n            }\n            localStorage.removeItem(key);\n        },\n        readIndex,\n        // data manipulation methods\n        insert: async (newItems) => {\n            upsertItems(newItems);\n        },\n        replace: async (itemsToReplace) => {\n            upsertItems(itemsToReplace);\n        },\n        remove: async (itemsToRemove) => {\n            const items = readFromStorage();\n            const byId = new Map(items.map(item => [item.id, item]));\n            const deltas = new Map();\n            const removeSet = new Set(itemsToRemove.map(item => item.id));\n            removeSet.forEach((id) => {\n                const existing = byId.get(id);\n                if (!existing)\n                    return;\n                accumulateRemoveDelta(deltas, existing);\n                byId.delete(id);\n            });\n            writeToStorage([...byId.values()]);\n            applyIndexDeltas(deltas);\n        },\n        removeAll: async () => {\n            writeToStorage([]);\n            // remove all index keys for this store\n            const prefix = `${storageKey}-index-`;\n            const keysToRemove = [];\n            for (let i = 0; i < localStorage.length; i++) {\n                const k = localStorage.key(i);\n                if (k && k.startsWith(prefix))\n                    keysToRemove.push(k);\n            }\n            keysToRemove.forEach(k => localStorage.removeItem(k));\n            indices.splice(0);\n        },\n    });\n}\n"],"names":["createLocalStorageAdapter","name","options","localStorage","serialize","data","deserialize","input","databaseName","storeName","storageKey","indexKeyFor","field","indices","readFromStorage","serialized","parsed","writeToStorage","items","readIndex","index","key","ids","id","saveIndexMap","safeIndex","serializeValue","ensureIndex","item","fieldValue","get","safeKeyFor","value","loadIndexMap","addToDelta","deltas","kind","delta","target","applyIndexDeltas","set","addDeltaForChange","oldValue","newValue","oldKey","newKey","accumulateUpsertDelta","existing","next","accumulateRemoveDelta","upsertItems","itemsToUpsert","byId","createStorageAdapter","prefix","i","k","idSet","newItems","itemsToReplace","itemsToRemove","keysToRemove"],"mappings":";AAUA,SAAwBA,EAA0BC,GAAMC,GAAS;AAC7D,QAAMC,IAAe,WAAW;AAChC,MAAIA,KAAgB;AAChB,UAAM,IAAI,MAAM,mDAAmD;AAEvE,QAAMC,IAAYF,GAAS,cAAc,CAAAG,MAAQ,KAAK,UAAUA,CAAI,IAC9DC,IAAcJ,GAAS,gBAAgB,CAAAK,MAAS,KAAK,MAAMA,CAAK,IAChEC,IAAeN,GAAS,gBAAgB,YACxCO,IAAY,GAAGR,CAAI,IAEnBS,IAAa,GAAGF,CAAY,IAAIC,CAAS,IACzCE,IAAc,CAACC,MAAU,GAAGF,CAAU,UAAUE,CAAK,IACrDC,IAAU,CAAA,GACVC,IAAkB,MAAM;AAC1B,UAAMC,IAAaZ,EAAa,QAAQO,CAAU;AAClD,QAAI,CAACK;AACD,aAAO,CAAA;AACX,QAAI;AACA,YAAMC,IAASV,EAAYS,CAAU;AACrC,aAAO,MAAM,QAAQC,CAAM,IAAIA,IAAS,CAAA;AAAA,IAC5C,QACM;AAEF,aAAO,CAAA;AAAA,IACX;AAAA,EACJ,GACMC,IAAiB,CAACC,MAAU;AAC9B,IAAAf,EAAa,QAAQO,GAAYN,EAAUc,CAAK,CAAC;AAAA,EACrD,GACMC,IAAY,OAAOP,MAAU;AAC/B,UAAMG,IAAaZ,EAAa,QAAQQ,EAAYC,CAAK,CAAC;AAC1D,QAAI,CAACG;AACD,YAAM,IAAI,MAAM,mBAAmBH,CAAK,kBAAkB;AAC9D,QAAIP;AACJ,QAAI;AACA,MAAAA,IAAOC,EAAYS,CAAU;AAAA,IACjC,QACM;AACF,YAAM,IAAI,MAAM,6BAA6BH,CAAK,GAAG;AAAA,IACzD;AACA,UAAMQ,wBAAY,IAAA;AAClB,kBAAO,QAAQf,CAAI,EAAE,QAAQ,CAAC,CAACgB,GAAKC,CAAG,MAAM;AACzC,MAAKF,EAAM,IAAIC,CAAG,KACdD,EAAM,IAAIC,GAAK,oBAAI,IAAA,CAAK,GAC5BC,EAAI,QAAQ,OAAMF,EAAM,IAAIC,CAAG,GAAG,IAAIE,CAAE,CAAC;AAAA,IAC7C,CAAC,GACMH;AAAA,EACX,GACMI,IAAe,CAACZ,GAAOQ,MAAU;AACnC,UAAMK,IAAY,CAAA;AAClB,IAAAL,EAAM,QAAQ,CAACE,GAAKD,MAAQ;AACxB,MAAAI,EAAU,OAAOC,EAAeL,CAAG,CAAC,CAAC,IAAI,CAAC,GAAGC,CAAG;AAAA,IACpD,CAAC,GACDnB,EAAa,QAAQQ,EAAYC,CAAK,GAAGR,EAAUqB,CAAS,CAAC;AAAA,EACjE,GACME,IAAc,OAAOf,GAAOM,IAAQJ,QAAsB;AAC5D,UAAMM,wBAAY,IAAA;AAClB,IAAAF,EAAM,QAAQ,CAACU,MAAS;AACpB,YAAMC,IAAaC,EAAIF,GAAMhB,CAAK;AAClC,MAAIiB,KAAc,SAEbT,EAAM,IAAIS,CAAU,KACrBT,EAAM,IAAIS,GAAY,oBAAI,IAAA,CAAK,GACnCT,EAAM,IAAIS,CAAU,GAAG,IAAID,EAAK,EAAE;AAAA,IACtC,CAAC,GACDJ,EAAaZ,GAAOQ,CAAK;AAAA,EAC7B,GAEMW,IAAa,CAACC,MAAU,OAAON,EAAeM,CAAK,CAAC,GACpDC,IAAe,CAACrB,MAAU;AAC5B,UAAMG,IAAaZ,EAAa,QAAQQ,EAAYC,CAAK,CAAC;AAC1D,QAAI,CAACG;AACD;AACJ,QAAIV;AACJ,QAAI;AACA,MAAAA,IAAOC,EAAYS,CAAU;AAAA,IACjC,QACM;AACF,YAAM,IAAI,MAAM,6BAA6BH,CAAK,GAAG;AAAA,IACzD;AACA,UAAMQ,wBAAY,IAAA;AAClB,kBAAO,QAAQf,CAAI,EAAE,QAAQ,CAAC,CAACgB,GAAKC,CAAG,MAAM;AACzC,MAAAF,EAAM,IAAIC,GAAK,IAAI,IAAIC,CAAG,CAAC;AAAA,IAC/B,CAAC,GACMF;AAAA,EACX,GACMc,IAAa,CAACC,GAAQvB,GAAOwB,GAAMf,GAAKE,MAAO;AACjD,IAAKY,EAAO,IAAIvB,CAAK,KACjBuB,EAAO,IAAIvB,GAAO,EAAE,MAAM,oBAAI,IAAA,GAAO,SAAS,oBAAI,IAAA,GAAO;AAE7D,UAAMyB,IAAQF,EAAO,IAAIvB,CAAK;AAC9B,QAAI,CAACyB;AACD;AACJ,UAAMC,IAASF,MAAS,QAAQC,EAAM,OAAOA,EAAM;AACnD,IAAKC,EAAO,IAAIjB,CAAG,KACfiB,EAAO,IAAIjB,GAAK,oBAAI,IAAA,CAAK,GAC7BiB,EAAO,IAAIjB,CAAG,GAAG,IAAIE,CAAE;AAAA,EAC3B,GACMgB,IAAmB,CAACJ,MAAW;AAEjC,IAAAA,EAAO,QAAQ,CAACE,GAAOzB,MAAU;AAC7B,YAAMQ,IAAQa,EAAarB,CAAK;AAEhC,MAAKQ,MAGLiB,EAAM,QAAQ,QAAQ,CAACf,GAAKD,MAAQ;AAChC,cAAMmB,IAAMpB,EAAM,IAAIC,CAAG;AACzB,QAAKmB,MAELlB,EAAI,QAAQ,CAAAC,MAAMiB,EAAI,OAAOjB,CAAE,CAAC,GAC5BiB,EAAI,SAAS,KACbpB,EAAM,OAAOC,CAAG;AAAA,MACxB,CAAC,GAEDgB,EAAM,KAAK,QAAQ,CAACf,GAAKD,MAAQ;AAC7B,YAAImB,IAAMpB,EAAM,IAAIC,CAAG;AACvB,QAAKmB,MACDA,wBAAU,IAAA,GACVpB,EAAM,IAAIC,GAAKmB,CAAG,IAEtBlB,EAAI,QAAQ,CAAAC,MAAMiB,EAAI,IAAIjB,CAAE,CAAC;AAAA,MACjC,CAAC,GACDC,EAAaZ,GAAOQ,CAAK;AAAA,IAC7B,CAAC;AAAA,EACL,GACMqB,IAAoB,CAACN,GAAQvB,GAAO8B,GAAUC,GAAUpB,MAAO;AACjE,UAAMqB,IAASF,KAAY,OAAO,SAAYX,EAAWW,CAAQ,GAC3DG,IAASF,KAAY,OAAO,SAAYZ,EAAWY,CAAQ;AACjE,IAAIC,MAAWC,MAEXD,KAAU,QACVV,EAAWC,GAAQvB,GAAO,UAAUgC,GAAQrB,CAAE,GAC9CsB,KAAU,QACVX,EAAWC,GAAQvB,GAAO,OAAOiC,GAAQtB,CAAE;AAAA,EACnD,GACMuB,IAAwB,CAACX,GAAQY,GAAUC,MAAS;AACtD,QAAID;AACA,iBAAWnC,KAASC;AAChB,QAAA4B,EAAkBN,GAAQvB,GAAOkB,EAAIiB,GAAUnC,CAAK,GAAGkB,EAAIkB,GAAMpC,CAAK,GAAGoC,EAAK,EAAE;AAAA;AAIpF,iBAAWpC,KAASC,GAAS;AACzB,cAAMmB,IAAQF,EAAIkB,GAAMpC,CAAK;AAC7B,QAAIoB,KAAS,QAEbE,EAAWC,GAAQvB,GAAO,OAAOmB,EAAWC,CAAK,GAAGgB,EAAK,EAAE;AAAA,MAC/D;AAAA,EAER,GACMC,IAAwB,CAACd,GAAQY,MAAa;AAChD,eAAWnC,KAASC,GAAS;AACzB,YAAMmB,IAAQF,EAAIiB,GAAUnC,CAAK;AACjC,MAAIoB,KAAS,QAEbE,EAAWC,GAAQvB,GAAO,UAAUmB,EAAWC,CAAK,GAAGe,EAAS,EAAE;AAAA,IACtE;AAAA,EACJ,GACMG,IAAc,CAACC,MAAkB;AACnC,UAAMjC,IAAQJ,EAAA,GACRsC,IAAO,IAAI,IAAIlC,EAAM,IAAI,CAAAU,MAAQ,CAACA,EAAK,IAAIA,CAAI,CAAC,CAAC,GACjDO,wBAAa,IAAA;AACnB,eAAWP,KAAQuB,GAAe;AAC9B,YAAMJ,IAAWK,EAAK,IAAIxB,EAAK,EAAE;AACjC,MAAAkB,EAAsBX,GAAQY,GAAUnB,CAAI,GAC5CwB,EAAK,IAAIxB,EAAK,IAAIA,CAAI;AAAA,IAC1B;AACA,IAAAX,EAAe,CAAC,GAAGmC,EAAK,OAAA,CAAQ,CAAC,GACjCb,EAAiBJ,CAAM;AAAA,EAC3B;AACA,SAAOkB,EAAqB;AAAA;AAAA,IAExB,OAAO,YAAY;AAEf,MAAIlD,EAAa,QAAQO,CAAU,KAAK,QACpCO,EAAe,CAAA,CAAE;AAGrB,YAAMqC,IAAS,GAAG5C,CAAU;AAC5B,eAAS6C,IAAI,GAAGA,IAAIpD,EAAa,QAAQoD,KAAK;AAC1C,cAAMC,IAAIrD,EAAa,IAAIoD,CAAC;AAC5B,YAAIC,KAAKA,EAAE,WAAWF,CAAM,GAAG;AAC3B,gBAAM1C,IAAQ4C,EAAE,MAAMF,EAAO,MAAM;AACnC,UAAKzC,EAAQ,SAASD,CAAK,KACvBC,EAAQ,KAAKD,CAAK;AAAA,QAC1B;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,UAAU,YAAY;AAAA,IAEtB;AAAA;AAAA,IAEA,SAAS,YACEE,EAAA;AAAA,IAEX,SAAS,OAAOQ,MAAQ;AACpB,YAAMJ,IAAQJ,EAAA,GACR2C,IAAQ,IAAI,IAAInC,CAAG;AACzB,aAAOJ,EAAM,OAAO,CAAAU,MAAQ6B,EAAM,IAAI7B,EAAK,EAAE,CAAC;AAAA,IAClD;AAAA;AAAA,IAEA,aAAa,OAAOhB,MAAU;AAC1B,UAAIA,MAAU;AACV,cAAM,IAAI,MAAM,iCAAiC;AACrD,MAAKC,EAAQ,SAASD,CAAK,KACvBC,EAAQ,KAAKD,CAAK,GACtB,MAAMe,EAAYf,CAAK;AAAA,IAC3B;AAAA,IACA,WAAW,OAAOA,MAAU;AACxB,UAAIC,EAAQ,SAASD,CAAK,GAAG;AACzB,cAAM2C,IAAI1C,EAAQ,QAAQD,CAAK;AAC/B,QAAAC,EAAQ,OAAO0C,GAAG,CAAC;AAAA,MACvB;AACA,YAAMlC,IAAMV,EAAYC,CAAK;AAC7B,UAAIT,EAAa,QAAQkB,CAAG,KAAK;AAC7B,cAAM,IAAI,MAAM,mBAAmBT,CAAK,kBAAkB;AAE9D,MAAAT,EAAa,WAAWkB,CAAG;AAAA,IAC/B;AAAA,IACA,WAAAF;AAAA;AAAA,IAEA,QAAQ,OAAOuC,MAAa;AACxB,MAAAR,EAAYQ,CAAQ;AAAA,IACxB;AAAA,IACA,SAAS,OAAOC,MAAmB;AAC/B,MAAAT,EAAYS,CAAc;AAAA,IAC9B;AAAA,IACA,QAAQ,OAAOC,MAAkB;AAC7B,YAAM1C,IAAQJ,EAAA,GACRsC,IAAO,IAAI,IAAIlC,EAAM,IAAI,CAAAU,MAAQ,CAACA,EAAK,IAAIA,CAAI,CAAC,CAAC,GACjDO,wBAAa,IAAA;AAEnB,MADkB,IAAI,IAAIyB,EAAc,IAAI,CAAAhC,MAAQA,EAAK,EAAE,CAAC,EAClD,QAAQ,CAACL,MAAO;AACtB,cAAMwB,IAAWK,EAAK,IAAI7B,CAAE;AAC5B,QAAKwB,MAELE,EAAsBd,GAAQY,CAAQ,GACtCK,EAAK,OAAO7B,CAAE;AAAA,MAClB,CAAC,GACDN,EAAe,CAAC,GAAGmC,EAAK,OAAA,CAAQ,CAAC,GACjCb,EAAiBJ,CAAM;AAAA,IAC3B;AAAA,IACA,WAAW,YAAY;AACnB,MAAAlB,EAAe,CAAA,CAAE;AAEjB,YAAMqC,IAAS,GAAG5C,CAAU,WACtBmD,IAAe,CAAA;AACrB,eAASN,IAAI,GAAGA,IAAIpD,EAAa,QAAQoD,KAAK;AAC1C,cAAMC,IAAIrD,EAAa,IAAIoD,CAAC;AAC5B,QAAIC,KAAKA,EAAE,WAAWF,CAAM,KACxBO,EAAa,KAAKL,CAAC;AAAA,MAC3B;AACA,MAAAK,EAAa,QAAQ,CAAAL,MAAKrD,EAAa,WAAWqD,CAAC,CAAC,GACpD3C,EAAQ,OAAO,CAAC;AAAA,IACpB;AAAA,EAAA,CACH;AACL;"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../src/index.ts"],"sourcesContent":["import { createStorageAdapter, get, serializeValue } from '@signaldb/core'\n\n/**\n * Creates a storage adapter for managing a SignalDB collection using localStorage.\n * @param name - A unique name for the collection, used as part of the localStorage key.\n * @param options - Optional configuration for the adapter.\n * @param options.databaseName - An optional name for the database to namespace the storage (default: 'signaldb').\n * @param options.serialize - A function to serialize items to a string (default: `JSON.stringify`).\n * @param options.deserialize - A function to deserialize a string into items (default: `JSON.parse`).\n * @returns A SignalDB storage adapter for managing data in localStorage.\n */\nexport default function createLocalStorageAdapter<\n  T extends { id: I } & Record<string, any>,\n  I,\n>(\n  name: string,\n  options?: {\n    databaseName?: string,\n    serialize?: (items: any) => string,\n    deserialize?: (itemsString: string) => any,\n  },\n\n) {\n  const localStorage = globalThis.localStorage\n  if (localStorage == null) {\n    throw new Error('localStorage is not available in this environment')\n  }\n\n  const serialize = options?.serialize || (data => JSON.stringify(data))\n  const deserialize = options?.deserialize || (input => JSON.parse(input))\n  const databaseName = options?.databaseName || 'signaldb'\n  const storeName = `${name}`\n\n  // We use a single key that namespaces by database and store names\n  const storageKey = `${databaseName}-${storeName}`\n\n  const indexKeyFor = (field: string) => `${storageKey}-index-${field}`\n  const indices: string[] = []\n\n  const readFromStorage = (): T[] => {\n    const serialized = localStorage.getItem(storageKey)\n    if (!serialized) return []\n    try {\n      const parsed = deserialize(serialized)\n      return Array.isArray(parsed) ? (parsed as T[]) : []\n    } catch {\n      // If parsing fails, treat as empty to avoid corrupting runtime\n      return []\n    }\n  }\n\n  const writeToStorage = (items: T[]) => {\n    localStorage.setItem(storageKey, serialize(items))\n  }\n\n  const readIndex = async (field: string) => {\n    const serialized = localStorage.getItem(indexKeyFor(field))\n    if (!serialized) throw new Error(`Index on field \"${field}\" does not exist`)\n    let data: Record<string, I[]>\n    try {\n      data = deserialize(serialized)\n    } catch {\n      throw new Error(`Corrupted index on field \"${field}\"`)\n    }\n    const index = new Map<any, Set<I>>()\n    Object.entries(data).forEach(([key, ids]) => {\n      if (!index.has(key)) index.set(key, new Set())\n      ids.forEach(id => index.get(key)?.add(id))\n    })\n    return index\n  }\n\n  const saveIndexMap = (field: string, index: Map<any, Set<I>>) => {\n    const safeIndex: Record<string, I[]> = {}\n    index.forEach((ids, key) => {\n      safeIndex[String(serializeValue(key))] = [...ids]\n    })\n    localStorage.setItem(indexKeyFor(field), serialize(safeIndex))\n  }\n\n  const ensureIndex = async (\n    field: string,\n    items: T[] = readFromStorage(),\n  ) => {\n    const index = new Map<any, Set<I>>()\n    items.forEach((item) => {\n      const fieldValue = get(item, field)\n      if (fieldValue == null) return\n      if (!index.has(fieldValue)) index.set(fieldValue, new Set())\n      index.get(fieldValue)?.add(item.id)\n    })\n    saveIndexMap(field, index)\n  }\n\n  // --- Delta indexing helpers ---\n  const safeKeyFor = (value: any) => String(serializeValue(value))\n\n  const loadIndexMap = (field: string): Map<string, Set<I>> | undefined => {\n    const serialized = localStorage.getItem(indexKeyFor(field))\n    if (!serialized) return undefined\n    let data: Record<string, I[]>\n    try {\n      data = deserialize(serialized)\n    } catch {\n      throw new Error(`Corrupted index on field \"${field}\"`)\n    }\n    const index = new Map<string, Set<I>>()\n    Object.entries(data).forEach(([key, ids]) => {\n      index.set(key, new Set(ids))\n    })\n    return index\n  }\n\n  type IndexDelta = {\n    adds: Map<string, Set<I>>,\n    removes: Map<string, Set<I>>,\n  }\n\n  const addToDelta = (\n    deltas: Map<string, IndexDelta>,\n    field: string,\n    kind: 'add' | 'remove',\n    key: string,\n    id: I,\n  ) => {\n    if (!deltas.has(field)) {\n      deltas.set(field, { adds: new Map(), removes: new Map() })\n    }\n    const delta = deltas.get(field)\n    if (!delta) return\n    const target = kind === 'add' ? delta.adds : delta.removes\n    if (!target.has(key)) target.set(key, new Set<I>())\n    target.get(key)?.add(id)\n  }\n\n  const applyIndexDeltas = (deltas: Map<string, IndexDelta>) => {\n    // Update only the indices that have changes\n    deltas.forEach((delta, field) => {\n      const index = loadIndexMap(field)\n      // If the index doesn't exist, skip (we only maintain indices that were created)\n      if (!index) return\n\n      // Apply removals\n      delta.removes.forEach((ids, key) => {\n        const set = index.get(key)\n        if (!set) return\n        ids.forEach(id => set.delete(id))\n        if (set.size === 0) index.delete(key)\n      })\n\n      // Apply additions\n      delta.adds.forEach((ids, key) => {\n        let set = index.get(key)\n        if (!set) {\n          set = new Set<I>()\n          index.set(key, set)\n        }\n        ids.forEach(id => set.add(id))\n      })\n\n      saveIndexMap(field, index)\n    })\n  }\n\n  const addDeltaForChange = (\n    deltas: Map<string, IndexDelta>,\n    field: string,\n    oldValue: any,\n    newValue: any,\n    id: I,\n  ) => {\n    const oldKey = oldValue == null ? undefined : safeKeyFor(oldValue)\n    const newKey = newValue == null ? undefined : safeKeyFor(newValue)\n    if (oldKey === newKey) return\n    if (oldKey != null) addToDelta(deltas, field, 'remove', oldKey, id)\n    if (newKey != null) addToDelta(deltas, field, 'add', newKey, id)\n  }\n\n  const accumulateUpsertDelta = (\n    deltas: Map<string, IndexDelta>,\n    existing: T | undefined,\n    next: T,\n  ) => {\n    if (existing) {\n      for (const field of indices) {\n        addDeltaForChange(deltas, field, get(existing, field), get(next, field), next.id)\n      }\n    } else {\n      for (const field of indices) {\n        const value = get(next, field)\n        if (value == null) continue\n        addToDelta(deltas, field, 'add', safeKeyFor(value), next.id)\n      }\n    }\n  }\n\n  const accumulateRemoveDelta = (\n    deltas: Map<string, IndexDelta>,\n    existing: T,\n  ) => {\n    for (const field of indices) {\n      const value = get(existing, field)\n      if (value == null) continue\n      addToDelta(deltas, field, 'remove', safeKeyFor(value), existing.id)\n    }\n  }\n\n  const upsertItems = (itemsToUpsert: T[]) => {\n    const items = readFromStorage()\n    const byId = new Map<I, T>(items.map(item => [item.id, item]))\n\n    const deltas = new Map<string, IndexDelta>()\n\n    for (const item of itemsToUpsert) {\n      const existing = byId.get(item.id)\n      accumulateUpsertDelta(deltas, existing, item)\n      byId.set(item.id, item)\n    }\n\n    writeToStorage([...byId.values()])\n    applyIndexDeltas(deltas)\n  }\n\n  return createStorageAdapter<T, I>({\n    // lifecycle methods\n    setup: async () => {\n      // For localStorage, there is no database to open; we just ensure the key exists\n      if (localStorage.getItem(storageKey) == null) {\n        writeToStorage([])\n      }\n      // Hydrate known index fields from existing keys so that we can keep them updated across sessions\n      const prefix = `${storageKey}-index-`\n      for (let i = 0; i < localStorage.length; i++) {\n        const k = localStorage.key(i)\n        if (k && k.startsWith(prefix)) {\n          const field = k.slice(prefix.length)\n          if (!indices.includes(field)) indices.push(field)\n        }\n      }\n    },\n    teardown: async () => {\n      // no-op\n    },\n\n    // data retrieval methods\n    readAll: async () => {\n      return readFromStorage()\n    },\n    readIds: async (ids) => {\n      const items = readFromStorage()\n      const idSet = new Set<I>(ids)\n      return items.filter(item => idSet.has(item.id))\n    },\n\n    // index methods\n    createIndex: async (field) => {\n      if (field === 'id') throw new Error('Cannot create index on id field')\n      if (!indices.includes(field)) indices.push(field)\n      await ensureIndex(field)\n    },\n    dropIndex: async (field) => {\n      if (indices.includes(field)) {\n        const i = indices.indexOf(field)\n        indices.splice(i, 1)\n      }\n      const key = indexKeyFor(field)\n      if (localStorage.getItem(key) == null) {\n        throw new Error(`Index on field \"${field}\" does not exist`)\n      }\n      localStorage.removeItem(key)\n    },\n    readIndex,\n\n    // data manipulation methods\n    insert: async (newItems) => {\n      upsertItems(newItems)\n    },\n    replace: async (itemsToReplace) => {\n      upsertItems(itemsToReplace)\n    },\n    remove: async (itemsToRemove) => {\n      const items = readFromStorage()\n      const byId = new Map<I, T>(items.map(item => [item.id, item]))\n\n      const deltas = new Map<string, IndexDelta>()\n      const removeSet = new Set<I>(itemsToRemove.map(item => item.id))\n\n      removeSet.forEach((id) => {\n        const existing = byId.get(id)\n        if (!existing) return\n        accumulateRemoveDelta(deltas, existing)\n        byId.delete(id)\n      })\n\n      writeToStorage([...byId.values()])\n      applyIndexDeltas(deltas)\n    },\n    removeAll: async () => {\n      writeToStorage([])\n      // remove all index keys for this store\n      const prefix = `${storageKey}-index-`\n      const keysToRemove: string[] = []\n      for (let i = 0; i < localStorage.length; i++) {\n        const k = localStorage.key(i)\n        if (k && k.startsWith(prefix)) keysToRemove.push(k)\n      }\n      keysToRemove.forEach(k => localStorage.removeItem(k))\n      indices.splice(0)\n    },\n  })\n}\n"],"mappings":";;AAWA,SAAwB,EAItB,GACA,GAMA;CACA,IAAM,IAAe,WAAW;CAChC,IAAI,KAAgB,MAClB,MAAU,MAAM,mDAAmD;CAGrE,IAAM,IAAY,GAAS,eAAc,MAAQ,KAAK,UAAU,CAAI,IAC9D,IAAc,GAAS,iBAAgB,MAAS,KAAK,MAAM,CAAK,IAKhE,IAAa,GAJE,GAAS,gBAAgB,WAIX,GAAG,GAHjB,OAKf,KAAe,MAAkB,GAAG,EAAW,SAAS,KACxD,IAAoB,CAAC,GAErB,UAA6B;EACjC,IAAM,IAAa,EAAa,QAAQ,CAAU;EAClD,IAAI,CAAC,GAAY,OAAO,CAAC;EACzB,IAAI;GACF,IAAM,IAAS,EAAY,CAAU;GACrC,OAAO,MAAM,QAAQ,CAAM,IAAK,IAAiB,CAAC;EACpD,QAAQ;GAEN,OAAO,CAAC;EACV;CACF,GAEM,KAAkB,MAAe;EACrC,EAAa,QAAQ,GAAY,EAAU,CAAK,CAAC;CACnD,GAEM,IAAY,OAAO,MAAkB;EACzC,IAAM,IAAa,EAAa,QAAQ,EAAY,CAAK,CAAC;EAC1D,IAAI,CAAC,GAAY,MAAU,MAAM,mBAAmB,EAAM,iBAAiB;EAC3E,IAAI;EACJ,IAAI;GACF,IAAO,EAAY,CAAU;EAC/B,QAAQ;GACN,MAAU,MAAM,6BAA6B,EAAM,EAAE;EACvD;EACA,IAAM,oBAAQ,IAAI,IAAiB;EAKnC,OAJA,OAAO,QAAQ,CAAI,EAAE,SAAS,CAAC,GAAK,OAAS;GAE3C,AADK,EAAM,IAAI,CAAG,KAAG,EAAM,IAAI,mBAAK,IAAI,IAAI,CAAC,GAC7C,EAAI,SAAQ,MAAM,EAAM,IAAI,CAAG,GAAG,IAAI,CAAE,CAAC;EAC3C,CAAC,GACM;CACT,GAEM,KAAgB,GAAe,MAA4B;EAC/D,IAAM,IAAiC,CAAC;EAIxC,AAHA,EAAM,SAAS,GAAK,MAAQ;GAC1B,EAAU,OAAO,EAAe,CAAG,CAAC,KAAK,CAAC,GAAG,CAAG;EAClD,CAAC,GACD,EAAa,QAAQ,EAAY,CAAK,GAAG,EAAU,CAAS,CAAC;CAC/D,GAEM,IAAc,OAClB,GACA,IAAa,EAAgB,MAC1B;EACH,IAAM,oBAAQ,IAAI,IAAiB;EAOnC,AANA,EAAM,SAAS,MAAS;GACtB,IAAM,IAAa,EAAI,GAAM,CAAK;GAC9B,KAAc,SACb,EAAM,IAAI,CAAU,KAAG,EAAM,IAAI,mBAAY,IAAI,IAAI,CAAC,GAC3D,EAAM,IAAI,CAAU,GAAG,IAAI,EAAK,EAAE;EACpC,CAAC,GACD,EAAa,GAAO,CAAK;CAC3B,GAGM,KAAc,MAAe,OAAO,EAAe,CAAK,CAAC,GAEzD,KAAgB,MAAmD;EACvE,IAAM,IAAa,EAAa,QAAQ,EAAY,CAAK,CAAC;EAC1D,IAAI,CAAC,GAAY;EACjB,IAAI;EACJ,IAAI;GACF,IAAO,EAAY,CAAU;EAC/B,QAAQ;GACN,MAAU,MAAM,6BAA6B,EAAM,EAAE;EACvD;EACA,IAAM,oBAAQ,IAAI,IAAoB;EAItC,OAHA,OAAO,QAAQ,CAAI,EAAE,SAAS,CAAC,GAAK,OAAS;GAC3C,EAAM,IAAI,GAAK,IAAI,IAAI,CAAG,CAAC;EAC7B,CAAC,GACM;CACT,GAOM,KACJ,GACA,GACA,GACA,GACA,MACG;EACH,AAAK,EAAO,IAAI,CAAK,KACnB,EAAO,IAAI,GAAO;GAAE,sBAAM,IAAI,IAAI;GAAG,yBAAS,IAAI,IAAI;EAAE,CAAC;EAE3D,IAAM,IAAQ,EAAO,IAAI,CAAK;EAC9B,IAAI,CAAC,GAAO;EACZ,IAAM,IAAS,MAAS,QAAQ,EAAM,OAAO,EAAM;EAEnD,AADK,EAAO,IAAI,CAAG,KAAG,EAAO,IAAI,mBAAK,IAAI,IAAO,CAAC,GAClD,EAAO,IAAI,CAAG,GAAG,IAAI,CAAE;CACzB,GAEM,KAAoB,MAAoC;EAE5D,EAAO,SAAS,GAAO,MAAU;GAC/B,IAAM,IAAQ,EAAa,CAAK;GAE3B,MAGL,EAAM,QAAQ,SAAS,GAAK,MAAQ;IAClC,IAAM,IAAM,EAAM,IAAI,CAAG;IACpB,MACL,EAAI,SAAQ,MAAM,EAAI,OAAO,CAAE,CAAC,GAC5B,EAAI,SAAS,KAAG,EAAM,OAAO,CAAG;GACtC,CAAC,GAGD,EAAM,KAAK,SAAS,GAAK,MAAQ;IAC/B,IAAI,IAAM,EAAM,IAAI,CAAG;IAKvB,AAJK,MACH,oBAAM,IAAI,IAAO,GACjB,EAAM,IAAI,GAAK,CAAG,IAEpB,EAAI,SAAQ,MAAM,EAAI,IAAI,CAAE,CAAC;GAC/B,CAAC,GAED,EAAa,GAAO,CAAK;EAC3B,CAAC;CACH,GAEM,KACJ,GACA,GACA,GACA,GACA,MACG;EACH,IAAM,IAAS,KAAY,OAAO,KAAA,IAAY,EAAW,CAAQ,GAC3D,IAAS,KAAY,OAAO,KAAA,IAAY,EAAW,CAAQ;EAC7D,MAAW,MACX,KAAU,QAAM,EAAW,GAAQ,GAAO,UAAU,GAAQ,CAAE,GAC9D,KAAU,QAAM,EAAW,GAAQ,GAAO,OAAO,GAAQ,CAAE;CACjE,GAEM,KACJ,GACA,GACA,MACG;EACH,IAAI,GACF,KAAK,IAAM,KAAS,GAClB,EAAkB,GAAQ,GAAO,EAAI,GAAU,CAAK,GAAG,EAAI,GAAM,CAAK,GAAG,EAAK,EAAE;OAGlF,KAAK,IAAM,KAAS,GAAS;GAC3B,IAAM,IAAQ,EAAI,GAAM,CAAK;GACzB,KAAS,QACb,EAAW,GAAQ,GAAO,OAAO,EAAW,CAAK,GAAG,EAAK,EAAE;EAC7D;CAEJ,GAEM,KACJ,GACA,MACG;EACH,KAAK,IAAM,KAAS,GAAS;GAC3B,IAAM,IAAQ,EAAI,GAAU,CAAK;GAC7B,KAAS,QACb,EAAW,GAAQ,GAAO,UAAU,EAAW,CAAK,GAAG,EAAS,EAAE;EACpE;CACF,GAEM,KAAe,MAAuB;EAC1C,IAAM,IAAQ,EAAgB,GACxB,IAAO,IAAI,IAAU,EAAM,KAAI,MAAQ,CAAC,EAAK,IAAI,CAAI,CAAC,CAAC,GAEvD,oBAAS,IAAI,IAAwB;EAE3C,KAAK,IAAM,KAAQ,GAGjB,AADA,EAAsB,GADL,EAAK,IAAI,EAAK,EACD,GAAU,CAAI,GAC5C,EAAK,IAAI,EAAK,IAAI,CAAI;EAIxB,AADA,EAAe,CAAC,GAAG,EAAK,OAAO,CAAC,CAAC,GACjC,EAAiB,CAAM;CACzB;CAEA,OAAO,EAA2B;EAEhC,OAAO,YAAY;GAEjB,AAAI,EAAa,QAAQ,CAAU,KACjC,EAAe,CAAC,CAAC;GAGnB,IAAM,IAAS,GAAG,EAAW;GAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAa,QAAQ,KAAK;IAC5C,IAAM,IAAI,EAAa,IAAI,CAAC;IAC5B,IAAI,KAAK,EAAE,WAAW,CAAM,GAAG;KAC7B,IAAM,IAAQ,EAAE,MAAM,EAAO,MAAM;KACnC,AAAK,EAAQ,SAAS,CAAK,KAAG,EAAQ,KAAK,CAAK;IAClD;GACF;EACF;EACA,UAAU,YAAY,CAEtB;EAGA,SAAS,YACA,EAAgB;EAEzB,SAAS,OAAO,MAAQ;GACtB,IAAM,IAAQ,EAAgB,GACxB,IAAQ,IAAI,IAAO,CAAG;GAC5B,OAAO,EAAM,QAAO,MAAQ,EAAM,IAAI,EAAK,EAAE,CAAC;EAChD;EAGA,aAAa,OAAO,MAAU;GAC5B,IAAI,MAAU,MAAM,MAAU,MAAM,iCAAiC;GAErE,AADK,EAAQ,SAAS,CAAK,KAAG,EAAQ,KAAK,CAAK,GAChD,MAAM,EAAY,CAAK;EACzB;EACA,WAAW,OAAO,MAAU;GAC1B,IAAI,EAAQ,SAAS,CAAK,GAAG;IAC3B,IAAM,IAAI,EAAQ,QAAQ,CAAK;IAC/B,EAAQ,OAAO,GAAG,CAAC;GACrB;GACA,IAAM,IAAM,EAAY,CAAK;GAC7B,IAAI,EAAa,QAAQ,CAAG,KAAK,MAC/B,MAAU,MAAM,mBAAmB,EAAM,iBAAiB;GAE5D,EAAa,WAAW,CAAG;EAC7B;EACA;EAGA,QAAQ,OAAO,MAAa;GAC1B,EAAY,CAAQ;EACtB;EACA,SAAS,OAAO,MAAmB;GACjC,EAAY,CAAc;EAC5B;EACA,QAAQ,OAAO,MAAkB;GAC/B,IAAM,IAAQ,EAAgB,GACxB,IAAO,IAAI,IAAU,EAAM,KAAI,MAAQ,CAAC,EAAK,IAAI,CAAI,CAAC,CAAC,GAEvD,oBAAS,IAAI,IAAwB;GAW3C,AARA,IAFsB,IAAO,EAAc,KAAI,MAAQ,EAAK,EAAE,CAE9D,EAAU,SAAS,MAAO;IACxB,IAAM,IAAW,EAAK,IAAI,CAAE;IACvB,MACL,EAAsB,GAAQ,CAAQ,GACtC,EAAK,OAAO,CAAE;GAChB,CAAC,GAED,EAAe,CAAC,GAAG,EAAK,OAAO,CAAC,CAAC,GACjC,EAAiB,CAAM;EACzB;EACA,WAAW,YAAY;GACrB,EAAe,CAAC,CAAC;GAEjB,IAAM,IAAS,GAAG,EAAW,UACvB,IAAyB,CAAC;GAChC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAa,QAAQ,KAAK;IAC5C,IAAM,IAAI,EAAa,IAAI,CAAC;IAC5B,AAAI,KAAK,EAAE,WAAW,CAAM,KAAG,EAAa,KAAK,CAAC;GACpD;GAEA,AADA,EAAa,SAAQ,MAAK,EAAa,WAAW,CAAC,CAAC,GACpD,EAAQ,OAAO,CAAC;EAClB;CACF,CAAC;AACH"}