@anuma/sdk 7.3.4 → 7.5.0

package/dist/expo/index.mjs

@@ -17095,9 +17095,51 @@ function isBorderline(input) {
   }
   return false;
 }
+function vaultDecayBackend(vaultCtx) {
+  return {
+    candidates: () => getDecayCandidatesRawOp(vaultCtx),
+    archive: async (rows, now) => {
+      const archived = /* @__PURE__ */ new Set();
+      for (const c of rows) {
+        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
+          now,
+          expectedUpdatedAt: c.updatedAt,
+          expectedLastObservedAt: c.lastObservedAt ?? null
+        });
+        if (ok) archived.add(c.uniqueId);
+      }
+      return archived;
+    },
+    hardDelete: async (rows, deleteOptions) => {
+      const deleted = /* @__PURE__ */ new Set();
+      for (const c of rows) {
+        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
+      }
+      return deleted;
+    }
+  };
+}
 function createDecaySweeper(options) {
-  const { vaultCtx, policy, classifier, onSwept, onError } = options;
+  const { vaultCtx, ...sweepOptions } = options;
   assertVaultScopeForSweep(vaultCtx);
+  return createDecaySweeperOver(vaultDecayBackend(vaultCtx), sweepOptions);
+}
+function ruleBasedDecayOptions(options = {}) {
+  if (options.classifier !== void 0)
+    throw new Error(
+      "MemoryStore.decay sweeps by rule only; a decay classifier needs decrypted content"
+    );
+  const { now, policy, onSwept, onError } = options;
+  return {
+    ...now !== void 0 && { now },
+    ...policy && { policy },
+    ...onSwept && { onSwept },
+    ...onError && { onError }
+  };
+}
+function createDecaySweeperOver(backend, options) {
+  const { policy, classifier, onSwept, onError } = options;
+  const maxTransitions = options.maxTransitionsPerSweep ?? Number.POSITIVE_INFINITY;
   const hardDeleteWindowMs = policy?.hardDeleteWindowMs ?? DEFAULT_DECAY_POLICY.hardDeleteWindowMs;
   const maxClassifierCalls = options.maxClassifierCallsPerSweep ?? DEFAULT_MAX_CLASSIFIER_CALLS_PER_SWEEP;
   const classifierCache = /* @__PURE__ */ new Map();
@@ -17139,7 +17181,7 @@ function createDecaySweeper(options) {
     const now = resolveNow(options.now);
     let candidates;
     try {
-      candidates = await getDecayCandidatesRawOp(vaultCtx);
+      candidates = await backend.candidates();
     } catch (err) {
       onError?.(err instanceof Error ? err : new Error(String(err)));
       return emptyResult();
@@ -17162,25 +17204,37 @@ function createDecaySweeper(options) {
     result.scanned = candidates.length;
     result.classifierCalls = sweep.classifierCalls;
     result.classifierCapHits = sweep.classifierCapHits;
+    let landed = 0;
+    const apply = async (queue, run, count2) => {
+      let next = 0;
+      while (next < queue.length && landed < maxTransitions) {
+        const batch = queue.slice(next, next + (maxTransitions - landed));
+        next += batch.length;
+        const done = await run(batch.map(({ candidate }) => candidate));
+        for (const { candidate, source } of batch) {
+          if (!done.has(candidate.uniqueId)) continue;
+          landed++;
+          count2(source);
+        }
+      }
+    };
     try {
-      for (const { candidate: c, source } of toArchive) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) {
+      await apply(
+        toArchive,
+        (rows) => backend.archive(rows, now),
+        (source) => {
           result.archived++;
           result[source].archived++;
         }
-      }
-      for (const { candidate: c, source } of toDelete) {
-        const ok = await hardDeleteDecayedOp(vaultCtx, c.uniqueId, { hardDeleteWindowMs, now });
-        if (ok) {
+      );
+      await apply(
+        toDelete,
+        (rows) => backend.hardDelete(rows, { hardDeleteWindowMs, now }),
+        (source) => {
           result.deleted++;
           result[source].deleted++;
         }
-      }
+      );
     } catch (err) {
       onError?.(err instanceof Error ? err : new Error(String(err)));
     }
@@ -19224,7 +19278,10 @@ function createLocalMemoryStore(options) {
       return () => subscriptions.forEach((s) => s.unsubscribe());
     },
     maintenance,
-    topicMaintenance: maintenance
+    topicMaintenance: maintenance,
+    decay: {
+      createDecaySweeper: (sweeperOptions) => createDecaySweeper({ ...ruleBasedDecayOptions(sweeperOptions), vaultCtx })
+    }
   };
 }
 
@@ -20614,6 +20671,9 @@ var MAX_QUERY_TOPICS = 100;
 var MAX_QUERY_FILTER = 20;
 var GRAPH_LANE_ROWS = 256;
 var TEMPORAL_LANE_ROWS = 256;
+var REPAIR_ROWS = 50;
+var REPAIR_SCAN = 2e3;
+var DECAY_TRANSITIONS_PER_SWEEP = 200;
 var RemoteMemoryPartialCreateError = class extends Error {
   constructor(created, cause) {
     super(`createMany stored ${created.length} memories before a batch failed`);
@@ -20622,6 +20682,9 @@ var RemoteMemoryPartialCreateError = class extends Error {
     this.name = "RemoteMemoryPartialCreateError";
   }
 };
+function rejectsInput(error) {
+  return error instanceof EmbeddingHttpError && error.status !== void 0 && error.status >= 400 && error.status < 500 && error.status !== 429 && !isFatalEmbeddingError(error);
+}
 function warnFailed(failed) {
   if (failed.length)
     getLogger().warn(
@@ -21127,6 +21190,42 @@ function createRemoteMemoryStore(options) {
     relinkTopics: () => Promise.resolve([]),
     backfillTopics: () => Promise.resolve([])
   };
+  const decayRow = (memory) => ({
+    uniqueId: memory.memory_id,
+    factType: memory.fact_type ?? null,
+    eventTimeEnd: memory.event_time_end ?? null,
+    eventTimeKind: memory.event_time_kind ?? null,
+    updatedAt: memory.updated_at,
+    lastObservedAt: memory.last_observed_at ?? null,
+    archivedAt: memory.archived_at ?? null,
+    source: memory.source ?? null,
+    trustTier: memory.trust_tier ?? null
+  });
+  const decayWrite = async (rows, change, edit) => {
+    if (rows.length === 0) return /* @__PURE__ */ new Set();
+    const seen2 = new Map(rows.map((row) => [row.uniqueId, row]));
+    const { saved, failed } = await mutateMany(
+      [...seen2.keys()],
+      () => change,
+      (memory) => edit(memory, seen2.get(memory.memory_id))
+    );
+    if (failed.size)
+      getLogger().warn("[memory/remote-store] Decay skipped memories:", [...failed.values()]);
+    return new Set(saved.keys());
+  };
+  const decayBackend = {
+    candidates: async () => (await pages(metadata2, { include_archived: true, include_quarantined: true })).filter(({ memory }) => memory.kind === void 0 || memory.kind === null).map(({ memory }) => decayRow(memory)),
+    archive: (rows, now) => decayWrite(
+      rows,
+      "edit",
+      (memory, seen2) => (memory.archived_at ?? null) === null && memory.updated_at === seen2.updatedAt && (memory.last_observed_at ?? null) === (seen2.lastObservedAt ?? null) ? { ...memory, archived_at: now } : null
+    ),
+    hardDelete: (rows, { hardDeleteWindowMs, now }) => decayWrite(
+      rows,
+      "membership",
+      (memory) => memory.archived_at !== void 0 && memory.archived_at !== null && now - memory.archived_at > hardDeleteWindowMs ? { ...memory, is_deleted: true } : null
+    )
+  };
   const everyState = {
     include_deleted: true,
     include_archived: true,
@@ -21202,9 +21301,104 @@ function createRemoteMemoryStore(options) {
       polling = false;
     });
   };
+  const unrepairable = /* @__PURE__ */ new Set();
+  let repairCursor;
+  const repairEmbeddings = async ({
+    maxRows = REPAIR_ROWS,
+    maxScan = REPAIR_SCAN,
+    cursor: start = repairCursor
+  } = {}) => {
+    const scannedRows = [];
+    let cursor2 = start;
+    do {
+      const page = await metadata2({
+        include_deleted: true,
+        include_archived: true,
+        include_quarantined: true,
+        include_superseded: true,
+        limit: Math.min(200, Math.max(1, maxScan - scannedRows.length)),
+        ...cursor2 && { cursor: cursor2 }
+      });
+      scannedRows.push(...page.items);
+      cursor2 = page.next_cursor;
+    } while (cursor2 && scannedRows.length < maxScan);
+    const allStale = scannedRows.filter(
+      ({ memory }) => memory.embedding_model !== model && !unrepairable.has(memory.memory_id)
+    );
+    const repaired = /* @__PURE__ */ new Set();
+    const result = {
+      scanned: scannedRows.length,
+      reembedded: 0,
+      failed: 0,
+      skippedConflict: 0
+    };
+    const finish = () => {
+      const settled = allStale.every(
+        ({ memory }) => repaired.has(memory.memory_id) || unrepairable.has(memory.memory_id)
+      );
+      repairCursor = settled ? cursor2 : start;
+      return repairCursor ? { ...result, cursor: repairCursor } : result;
+    };
+    const stale = allStale.slice(0, maxRows).map(({ memory }) => memory.memory_id);
+    if (stale.length === 0) return finish();
+    const { records, unreadable } = await readEveryState(stale);
+    result.failed += unreadable.size;
+    for (const id of stale)
+      if (unreadable.has(id) || !records.get(id)?.memory.content.trim()) unrepairable.add(id);
+    const targets = stale.filter((id) => !unrepairable.has(id)).map((id) => records.get(id));
+    if (targets.length === 0) return finish();
+    const vectors = await embedForRepair(targets);
+    if (!vectors) {
+      result.failed += targets.length;
+      return finish();
+    }
+    for (const [i, record2] of targets.entries()) {
+      const vector = vectors[i];
+      if (!vector) {
+        result.failed++;
+        continue;
+      }
+      await serialized(record2.memory.memory_id, async () => {
+        try {
+          const saved = await persistence.put(
+            { ...record2.memory, embedding: storedVector(vector), embedding_model: model },
+            record2
+          );
+          notify("embedding", [saved]);
+          repaired.add(record2.memory.memory_id);
+          result.reembedded++;
+        } catch (error) {
+          if (error instanceof RemoteMemoryError && error.code === "version_conflict")
+            result.skippedConflict++;
+          else result.failed++;
+        }
+      });
+    }
+    return finish();
+  };
+  const embedForRepair = async (targets) => {
+    const texts = targets.map(({ memory }) => memory.content);
+    try {
+      return await generateEmbeddings(texts, embeddingOptions);
+    } catch (error) {
+      getLogger().warn("[memory/remote-store] Failed to embed memories for repair:", error);
+      if (!rejectsInput(error)) return null;
+    }
+    const vectors = [];
+    for (const [i, text14] of texts.entries()) {
+      try {
+        [vectors[i]] = await generateEmbeddings([text14], embeddingOptions);
+      } catch (error) {
+        if (!rejectsInput(error)) return null;
+        unrepairable.add(targets[i].memory.memory_id);
+      }
+    }
+    return vectors;
+  };
   return {
     masksEmbeddingInput: embeddingOptions.maskInput !== void 0,
     topicMaintenance,
+    repairEmbeddings,
     list: async (listOptions = {}) => (await listRows(decrypted, listOptions, listFilters(listOptions), maxOf(listOptions))).map(
       (r) => stored(r.memory)
     ),
@@ -21404,6 +21598,12 @@ function createRemoteMemoryStore(options) {
       else if (result.action === "update" || result.action === "merge") notify("edit");
       return result;
     },
+    decay: {
+      createDecaySweeper: (sweeperOptions) => createDecaySweeperOver(decayBackend, {
+        ...ruleBasedDecayOptions(sweeperOptions),
+        maxTransitionsPerSweep: DECAY_TRANSITIONS_PER_SWEEP
+      })
+    },
     subscribe: (onChange, subscribeOptions = {}) => {
       const subscriber = { onChange, options: subscribeOptions };
       subscribers.add(subscriber);

package/dist/react/index.cjs

@@ -21016,9 +21016,51 @@ function isBorderline(input) {
   }
   return false;
 }
+function vaultDecayBackend(vaultCtx) {
+  return {
+    candidates: () => getDecayCandidatesRawOp(vaultCtx),
+    archive: async (rows, now) => {
+      const archived = /* @__PURE__ */ new Set();
+      for (const c of rows) {
+        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
+          now,
+          expectedUpdatedAt: c.updatedAt,
+          expectedLastObservedAt: c.lastObservedAt ?? null
+        });
+        if (ok) archived.add(c.uniqueId);
+      }
+      return archived;
+    },
+    hardDelete: async (rows, deleteOptions) => {
+      const deleted = /* @__PURE__ */ new Set();
+      for (const c of rows) {
+        if (await hardDeleteDecayedOp(vaultCtx, c.uniqueId, deleteOptions)) deleted.add(c.uniqueId);
+      }
+      return deleted;
+    }
+  };
+}
 function createDecaySweeper(options) {
-  const { vaultCtx, policy, classifier, onSwept, onError } = options;
+  const { vaultCtx, ...sweepOptions } = options;
   assertVaultScopeForSweep(vaultCtx);
+  return createDecaySweeperOver(vaultDecayBackend(vaultCtx), sweepOptions);
+}
+function ruleBasedDecayOptions(options = {}) {
+  if (options.classifier !== void 0)
+    throw new Error(
+      "MemoryStore.decay sweeps by rule only; a decay classifier needs decrypted content"
+    );
+  const { now, policy, onSwept, onError } = options;
+  return {
+    ...now !== void 0 && { now },
+    ...policy && { policy },
+    ...onSwept && { onSwept },
+    ...onError && { onError }
+  };
+}
+function createDecaySweeperOver(backend, options) {
+  const { policy, classifier, onSwept, onError } = options;
+  const maxTransitions = options.maxTransitionsPerSweep ?? Number.POSITIVE_INFINITY;
   const hardDeleteWindowMs = policy?.hardDeleteWindowMs ?? DEFAULT_DECAY_POLICY.hardDeleteWindowMs;
   const maxClassifierCalls = options.maxClassifierCallsPerSweep ?? DEFAULT_MAX_CLASSIFIER_CALLS_PER_SWEEP;
   const classifierCache = /* @__PURE__ */ new Map();
@@ -21060,7 +21102,7 @@ function createDecaySweeper(options) {
     const now = resolveNow(options.now);
     let candidates;
     try {
-      candidates = await getDecayCandidatesRawOp(vaultCtx);
+      candidates = await backend.candidates();
     } catch (err) {
       onError?.(err instanceof Error ? err : new Error(String(err)));
       return emptyResult();
@@ -21083,25 +21125,37 @@ function createDecaySweeper(options) {
     result.scanned = candidates.length;
     result.classifierCalls = sweep.classifierCalls;
     result.classifierCapHits = sweep.classifierCapHits;
+    let landed = 0;
+    const apply = async (queue, run, count2) => {
+      let next = 0;
+      while (next < queue.length && landed < maxTransitions) {
+        const batch = queue.slice(next, next + (maxTransitions - landed));
+        next += batch.length;
+        const done = await run(batch.map(({ candidate }) => candidate));
+        for (const { candidate, source } of batch) {
+          if (!done.has(candidate.uniqueId)) continue;
+          landed++;
+          count2(source);
+        }
+      }
+    };
     try {
-      for (const { candidate: c, source } of toArchive) {
-        const ok = await archiveVaultMemoryOp(vaultCtx, c.uniqueId, {
-          now,
-          expectedUpdatedAt: c.updatedAt,
-          expectedLastObservedAt: c.lastObservedAt ?? null
-        });
-        if (ok) {
+      await apply(
+        toArchive,
+        (rows) => backend.archive(rows, now),
+        (source) => {
           result.archived++;
           result[source].archived++;
         }
-      }
-      for (const { candidate: c, source } of toDelete) {
-        const ok = await hardDeleteDecayedOp(vaultCtx, c.uniqueId, { hardDeleteWindowMs, now });
-        if (ok) {
+      );
+      await apply(
+        toDelete,
+        (rows) => backend.hardDelete(rows, { hardDeleteWindowMs, now }),
+        (source) => {
           result.deleted++;
           result[source].deleted++;
         }
-      }
+      );
     } catch (err) {
       onError?.(err instanceof Error ? err : new Error(String(err)));
     }
@@ -23186,7 +23240,10 @@ function createLocalMemoryStore(options) {
       return () => subscriptions.forEach((s) => s.unsubscribe());
     },
     maintenance,
-    topicMaintenance: maintenance
+    topicMaintenance: maintenance,
+    decay: {
+      createDecaySweeper: (sweeperOptions) => createDecaySweeper({ ...ruleBasedDecayOptions(sweeperOptions), vaultCtx })
+    }
   };
 }
 
@@ -24582,6 +24639,9 @@ var MAX_QUERY_TOPICS = 100;
 var MAX_QUERY_FILTER = 20;
 var GRAPH_LANE_ROWS = 256;
 var TEMPORAL_LANE_ROWS = 256;
+var REPAIR_ROWS = 50;
+var REPAIR_SCAN = 2e3;
+var DECAY_TRANSITIONS_PER_SWEEP = 200;
 var RemoteMemoryPartialCreateError = class extends Error {
   constructor(created, cause) {
     super(`createMany stored ${created.length} memories before a batch failed`);
@@ -24590,6 +24650,9 @@ var RemoteMemoryPartialCreateError = class extends Error {
     this.name = "RemoteMemoryPartialCreateError";
   }
 };
+function rejectsInput(error) {
+  return error instanceof EmbeddingHttpError && error.status !== void 0 && error.status >= 400 && error.status < 500 && error.status !== 429 && !isFatalEmbeddingError(error);
+}
 function warnFailed(failed) {
   if (failed.length)
     getLogger().warn(
@@ -25095,6 +25158,42 @@ function createRemoteMemoryStore(options) {
     relinkTopics: () => Promise.resolve([]),
     backfillTopics: () => Promise.resolve([])
   };
+  const decayRow = (memory) => ({
+    uniqueId: memory.memory_id,
+    factType: memory.fact_type ?? null,
+    eventTimeEnd: memory.event_time_end ?? null,
+    eventTimeKind: memory.event_time_kind ?? null,
+    updatedAt: memory.updated_at,
+    lastObservedAt: memory.last_observed_at ?? null,
+    archivedAt: memory.archived_at ?? null,
+    source: memory.source ?? null,
+    trustTier: memory.trust_tier ?? null
+  });
+  const decayWrite = async (rows, change, edit) => {
+    if (rows.length === 0) return /* @__PURE__ */ new Set();
+    const seen2 = new Map(rows.map((row) => [row.uniqueId, row]));
+    const { saved, failed } = await mutateMany(
+      [...seen2.keys()],
+      () => change,
+      (memory) => edit(memory, seen2.get(memory.memory_id))
+    );
+    if (failed.size)
+      getLogger().warn("[memory/remote-store] Decay skipped memories:", [...failed.values()]);
+    return new Set(saved.keys());
+  };
+  const decayBackend = {
+    candidates: async () => (await pages(metadata2, { include_archived: true, include_quarantined: true })).filter(({ memory }) => memory.kind === void 0 || memory.kind === null).map(({ memory }) => decayRow(memory)),
+    archive: (rows, now) => decayWrite(
+      rows,
+      "edit",
+      (memory, seen2) => (memory.archived_at ?? null) === null && memory.updated_at === seen2.updatedAt && (memory.last_observed_at ?? null) === (seen2.lastObservedAt ?? null) ? { ...memory, archived_at: now } : null
+    ),
+    hardDelete: (rows, { hardDeleteWindowMs, now }) => decayWrite(
+      rows,
+      "membership",
+      (memory) => memory.archived_at !== void 0 && memory.archived_at !== null && now - memory.archived_at > hardDeleteWindowMs ? { ...memory, is_deleted: true } : null
+    )
+  };
   const everyState = {
     include_deleted: true,
     include_archived: true,
@@ -25170,9 +25269,104 @@ function createRemoteMemoryStore(options) {
       polling = false;
     });
   };
+  const unrepairable = /* @__PURE__ */ new Set();
+  let repairCursor;
+  const repairEmbeddings = async ({
+    maxRows = REPAIR_ROWS,
+    maxScan = REPAIR_SCAN,
+    cursor: start = repairCursor
+  } = {}) => {
+    const scannedRows = [];
+    let cursor2 = start;
+    do {
+      const page = await metadata2({
+        include_deleted: true,
+        include_archived: true,
+        include_quarantined: true,
+        include_superseded: true,
+        limit: Math.min(200, Math.max(1, maxScan - scannedRows.length)),
+        ...cursor2 && { cursor: cursor2 }
+      });
+      scannedRows.push(...page.items);
+      cursor2 = page.next_cursor;
+    } while (cursor2 && scannedRows.length < maxScan);
+    const allStale = scannedRows.filter(
+      ({ memory }) => memory.embedding_model !== model && !unrepairable.has(memory.memory_id)
+    );
+    const repaired = /* @__PURE__ */ new Set();
+    const result = {
+      scanned: scannedRows.length,
+      reembedded: 0,
+      failed: 0,
+      skippedConflict: 0
+    };
+    const finish = () => {
+      const settled = allStale.every(
+        ({ memory }) => repaired.has(memory.memory_id) || unrepairable.has(memory.memory_id)
+      );
+      repairCursor = settled ? cursor2 : start;
+      return repairCursor ? { ...result, cursor: repairCursor } : result;
+    };
+    const stale = allStale.slice(0, maxRows).map(({ memory }) => memory.memory_id);
+    if (stale.length === 0) return finish();
+    const { records, unreadable } = await readEveryState(stale);
+    result.failed += unreadable.size;
+    for (const id of stale)
+      if (unreadable.has(id) || !records.get(id)?.memory.content.trim()) unrepairable.add(id);
+    const targets = stale.filter((id) => !unrepairable.has(id)).map((id) => records.get(id));
+    if (targets.length === 0) return finish();
+    const vectors = await embedForRepair(targets);
+    if (!vectors) {
+      result.failed += targets.length;
+      return finish();
+    }
+    for (const [i, record2] of targets.entries()) {
+      const vector = vectors[i];
+      if (!vector) {
+        result.failed++;
+        continue;
+      }
+      await serialized(record2.memory.memory_id, async () => {
+        try {
+          const saved = await persistence.put(
+            { ...record2.memory, embedding: storedVector(vector), embedding_model: model },
+            record2
+          );
+          notify("embedding", [saved]);
+          repaired.add(record2.memory.memory_id);
+          result.reembedded++;
+        } catch (error) {
+          if (error instanceof RemoteMemoryError && error.code === "version_conflict")
+            result.skippedConflict++;
+          else result.failed++;
+        }
+      });
+    }
+    return finish();
+  };
+  const embedForRepair = async (targets) => {
+    const texts = targets.map(({ memory }) => memory.content);
+    try {
+      return await generateEmbeddings(texts, embeddingOptions);
+    } catch (error) {
+      getLogger().warn("[memory/remote-store] Failed to embed memories for repair:", error);
+      if (!rejectsInput(error)) return null;
+    }
+    const vectors = [];
+    for (const [i, text14] of texts.entries()) {
+      try {
+        [vectors[i]] = await generateEmbeddings([text14], embeddingOptions);
+      } catch (error) {
+        if (!rejectsInput(error)) return null;
+        unrepairable.add(targets[i].memory.memory_id);
+      }
+    }
+    return vectors;
+  };
   return {
     masksEmbeddingInput: embeddingOptions.maskInput !== void 0,
     topicMaintenance,
+    repairEmbeddings,
     list: async (listOptions = {}) => (await listRows(decrypted, listOptions, listFilters(listOptions), maxOf(listOptions))).map(
       (r) => stored(r.memory)
     ),
@@ -25372,6 +25566,12 @@ function createRemoteMemoryStore(options) {
       else if (result.action === "update" || result.action === "merge") notify("edit");
       return result;
     },
+    decay: {
+      createDecaySweeper: (sweeperOptions) => createDecaySweeperOver(decayBackend, {
+        ...ruleBasedDecayOptions(sweeperOptions),
+        maxTransitionsPerSweep: DECAY_TRANSITIONS_PER_SWEEP
+      })
+    },
     subscribe: (onChange, subscribeOptions = {}) => {
       const subscriber = { onChange, options: subscribeOptions };
       subscribers.add(subscriber);