@jini-ai/ui 0.1.0

package/dist/features/memory/react/hooks/useMemoryExtractions.store.js

@@ -0,0 +1,269 @@
+/** Row cap mirrored from the daemon's ring buffer for live-inserted rows. */
+const MAX_ROWS = 30;
+export function phaseProgress(phase) {
+    // A record only moves from running to one terminal result. The terminal
+    // results have no ordering among themselves, but all are more
+    // authoritative than running regardless of which transport reached the
+    // browser last.
+    return phase === 'running' ? 0 : 1;
+}
+/**
+ * Ordering rule B: resolve two versions of the same persisted attempt without
+ * using browser reception order. Terminal phase progression is authoritative;
+ * when both sides are terminal, the completion timestamp breaks a real tie.
+ * Equivalent records are merged so a confirmed read can fill fields an
+ * earlier stream frame did not yet contain without erasing fields it omitted.
+ */
+export function mergeSameAttempt(local, incoming) {
+    const localProgress = phaseProgress(local.phase);
+    const incomingProgress = phaseProgress(incoming.phase);
+    if (incomingProgress > localProgress)
+        return incoming;
+    if (incomingProgress < localProgress)
+        return local;
+    const localFinishedAt = local.finishedAt ?? Number.NEGATIVE_INFINITY;
+    const incomingFinishedAt = incoming.finishedAt ?? Number.NEGATIVE_INFINITY;
+    if (incomingFinishedAt > localFinishedAt)
+        return incoming;
+    if (incomingFinishedAt < localFinishedAt)
+        return local;
+    // `id` identifies one attempt, so `startedAt` should normally be equal.
+    // Still, prefer the later source if malformed/legacy data disagrees.
+    if (incoming.startedAt > local.startedAt)
+        return incoming;
+    if (incoming.startedAt < local.startedAt)
+        return local;
+    // A real attempt never changes from one terminal result to another. If
+    // legacy/malformed payloads disagree without a timestamp that orders them,
+    // retain the existing value rather than making reception order decide.
+    if (incoming.phase !== local.phase)
+        return local;
+    return { ...local, ...incoming };
+}
+export function createExtractionHistoryStore(onRowsChanged) {
+    let rows = [];
+    /** Rule A: the one logical clock ordering everything this client did. */
+    let clock = 0;
+    /** Logical time each visible row was last accepted (rule A per row). */
+    const rowStamp = new Map();
+    /** Rule C: ids whose removal the server has confirmed. Never removed. */
+    const tombstones = new Set();
+    /** Logical time the last authoritative clear landed (0 = never). */
+    let clearStamp = 0;
+    /** Refcounted in-flight deletes per id (two same-id deletes may overlap). */
+    const pendingDeletes = new Map();
+    /** Refcounted in-flight clears (overlapping clears may overlap too). */
+    let pendingClears = 0;
+    /** Frames buffered while their id is hidden by a pending delete/clear. */
+    const deferred = new Map();
+    function commit(next) {
+        clock += 1;
+        rows = next;
+        onRowsChanged(rows);
+        return clock;
+    }
+    function markPendingDelete(id) {
+        pendingDeletes.set(id, (pendingDeletes.get(id) ?? 0) + 1);
+    }
+    /** Returns true when this was the LAST in-flight delete for the id. Every
+     *  call site pairs this with a prior `markPendingDelete(id)` (beginDelete
+     *  always precedes the settle path that calls this), so `pendingDeletes`
+     *  is guaranteed to already hold `id` here. */
+    function unmarkPendingDelete(id) {
+        const count = pendingDeletes.get(id) - 1;
+        if (count <= 0) {
+            pendingDeletes.delete(id);
+            return true;
+        }
+        pendingDeletes.set(id, count);
+        return false;
+    }
+    function tombstone(id) {
+        tombstones.add(id);
+    }
+    function applyFrame(ev) {
+        if (!ev || !ev.id)
+            return;
+        // Pseudo-phases: the daemon emits these synthetically when a row is
+        // dropped from the buffer, by the per-row delete button or the "Clear"
+        // affordance at the top (possibly in another client).
+        if (ev.phase === 'cleared') {
+            // A remote clear removed every attempt the daemon knew about, which
+            // covers everything this client has observed: visible rows, ids hidden
+            // by a pending local delete, and buffered frames. Tombstone them all
+            // (rule C) so delayed frames cannot recreate discarded attempts.
+            const owned = new Set([...rows.map((row) => row.id), ...pendingDeletes.keys(), ...deferred.keys()]);
+            for (const id of owned)
+                tombstone(id);
+            deferred.clear();
+            clearStamp = commit([]);
+            return;
+        }
+        if (ev.phase === 'deleted') {
+            deferred.delete(ev.id);
+            tombstone(ev.id);
+            commit(rows.filter((row) => row.id !== ev.id));
+            return;
+        }
+        // Rule C: a confirmed-removed id never comes back. A delayed frame on
+        // the SSE connection may have been emitted before the DELETE response
+        // won the fetch race.
+        if (tombstones.has(ev.id))
+            return;
+        // A running extraction is user-deletable and the list-level clear is
+        // available while it runs, so frames can race an in-flight destructive
+        // operation for their id. Buffer them (content-merged, rule B) so they
+        // cannot visibly undo the optimistic removal; the settle path replays
+        // the best buffered frame on failure and tombstones it on success.
+        if (pendingDeletes.has(ev.id) || pendingClears > 0) {
+            const prior = deferred.get(ev.id);
+            deferred.set(ev.id, prior ? mergeSameAttempt(prior, ev) : ev);
+            return;
+        }
+        // Merge by id (rule B): phase transitions for an in-flight attempt
+        // collapse onto a single row instead of stacking N entries. New ids are
+        // unshifted so the latest appears at the top.
+        const at = rows.findIndex((row) => row.id === ev.id);
+        let next;
+        if (at >= 0) {
+            next = rows.slice();
+            next[at] = mergeSameAttempt(next[at], ev);
+        }
+        else {
+            next = [ev, ...rows].slice(0, MAX_ROWS);
+        }
+        rowStamp.set(ev.id, commit(next));
+    }
+    function commitSnapshot(confirmed, sinceClock) {
+        // An authoritative clear younger than this read supersedes the whole
+        // snapshot — every row in it is pre-clear as far as the client can
+        // order, so nothing from it may come back. A clear still IN FLIGHT
+        // rejects the snapshot the same way: if that clear fails, its own
+        // recovery GET (which starts after the failure) restores server truth.
+        const clearSupersedes = clearStamp > sinceClock || pendingClears > 0;
+        const accepted = clearSupersedes
+            ? []
+            : confirmed.filter((row) => !tombstones.has(row.id) && !pendingDeletes.has(row.id));
+        const acceptedById = new Map(accepted.map((row) => [row.id, row]));
+        // Live rows keep their newest-first positions, content-merged with the
+        // snapshot's version of the same id (rule B). A row the snapshot no
+        // longer has (evicted server-side, or removed by another client) is
+        // dropped, UNLESS a local change accepted it after this read began
+        // (rule A) — then the read simply hasn't caught up and the local copy
+        // survives. The store invariant does the rest: no tombstoned id can be
+        // sitting in `rows`, and every row here postdates any authoritative
+        // clear — so a clear-superseded snapshot rejects only the SNAPSHOT's
+        // rows, while current rows (all stamped after the clear, hence after
+        // sinceClock) survive on the rowStamp rule without a special case. A
+        // pending delete cannot be present in `rows`: beginDelete removes it and
+        // applyFrame/commitSnapshot keep it hidden until its settle path runs.
+        const survivors = rows
+            .filter((row) => {
+            if (acceptedById.has(row.id))
+                return true;
+            // Every row that ever enters `rows` is stamped at insertion, by
+            // either applyFrame or this function's own accepted-rows loop below
+            // — it is therefore always present in rowStamp here.
+            return rowStamp.get(row.id) > sinceClock;
+        })
+            .map((row) => {
+            const confirmedRow = acceptedById.get(row.id);
+            return confirmedRow ? mergeSameAttempt(row, confirmedRow) : row;
+        });
+        const survivorIds = new Set(survivors.map((row) => row.id));
+        const merged = [...survivors];
+        for (const row of accepted) {
+            if (survivorIds.has(row.id))
+                continue;
+            // Slot restored/new rows in by start time so a newer live-only row is
+            // never pushed behind an older confirmed one.
+            const at = merged.findIndex((existing) => existing.startedAt < row.startedAt);
+            if (at === -1)
+                merged.push(row);
+            else
+                merged.splice(at, 0, row);
+        }
+        const revision = commit(merged);
+        for (const row of accepted)
+            rowStamp.set(row.id, revision);
+        return rows;
+    }
+    return {
+        rows: () => rows,
+        snapshotClock: () => clock,
+        commitSnapshot,
+        applyFrame,
+        beginDelete(id) {
+            const previousRows = rows;
+            markPendingDelete(id);
+            const startClock = commit(rows.filter((row) => row.id !== id));
+            return { previousRows, startClock };
+        },
+        settleDeleteSuccess(id) {
+            if (unmarkPendingDelete(id))
+                deferred.delete(id);
+            tombstone(id);
+            // Re-filter against `rows` here too (belt-and-suspenders): the
+            // pending-delete checks in commitSnapshot/applyFrame already keep `id`
+            // out of `rows` for the whole time this delete is in flight, so this is
+            // never actually removing anything new. It still matters as a real
+            // commit, though — a confirmed removal is genuine new information, and
+            // advancing the clock here is what makes a SIBLING operation's
+            // restoreIfUnchanged (checked against ITS OWN startClock) correctly
+            // treat this confirmation as something that happened since it started,
+            // rather than silently letting a stale previousRows restore win.
+            commit(rows.filter((row) => row.id !== id));
+        },
+        settleDeleteFailure(id) {
+            if (!unmarkPendingDelete(id))
+                return;
+            const buffered = deferred.get(id);
+            deferred.delete(id);
+            // Replay routes back through applyFrame so a still-pending CLEAR
+            // re-defers it rather than letting it slip past the hide.
+            if (buffered)
+                applyFrame(buffered);
+        },
+        beginClear() {
+            const previousRows = rows;
+            const ownedIds = new Set([...rows.map((row) => row.id), ...pendingDeletes.keys()]);
+            pendingClears += 1;
+            const startClock = commit([]);
+            return { previousRows, startClock, ownedIds };
+        },
+        settleClearSuccess(token) {
+            pendingClears = Math.max(0, pendingClears - 1);
+            // The clear owns every id observed before its success: the rows and
+            // pending deletes it saw when it started, plus every frame first
+            // observed while it was in flight (those may have been emitted before
+            // the daemon performed the clear but arrived late over SSE).
+            for (const id of token.ownedIds)
+                tombstone(id);
+            for (const id of deferred.keys())
+                tombstone(id);
+            deferred.clear();
+            // Re-assert the wipe (see settleDeleteSuccess for why) and stamp it as
+            // the authoritative clear point for in-flight reads.
+            clearStamp = commit([]);
+        },
+        settleClearFailure() {
+            pendingClears = Math.max(0, pendingClears - 1);
+            if (pendingClears > 0)
+                return;
+            for (const [id, buffered] of [...deferred]) {
+                // Frames owned by a still-pending DELETE stay buffered — that
+                // delete's own settle path decides their fate.
+                if (pendingDeletes.has(id))
+                    continue;
+                deferred.delete(id);
+                applyFrame(buffered);
+            }
+        },
+        restoreIfUnchanged(token) {
+            if (clock !== token.startClock)
+                return;
+            commit(token.previousRows);
+        },
+    };
+}
+//# sourceMappingURL=useMemoryExtractions.store.js.map

package/dist/features/memory/react/hooks/useMemoryExtractions.store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMemoryExtractions.store.js","sourceRoot":"","sources":["../../../../../src/features/memory/react/hooks/useMemoryExtractions.store.ts"],"names":[],"mappings":"AAsEA,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,EAAE,CAAC;AAEpB,MAAM,UAAU,aAAa,CAAC,KAAsC;IAClE,wEAAwE;IACxE,8DAA8D;IAC9D,uEAAuE;IACvE,gBAAgB;IAChB,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA6B,EAAE,QAAgC;IAC9F,MAAM,aAAa,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,gBAAgB,GAAG,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACvD,IAAI,gBAAgB,GAAG,aAAa;QAAE,OAAO,QAAQ,CAAC;IACtD,IAAI,gBAAgB,GAAG,aAAa;QAAE,OAAO,KAAK,CAAC;IAEnD,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,IAAI,MAAM,CAAC,iBAAiB,CAAC;IACrE,MAAM,kBAAkB,GAAG,QAAQ,CAAC,UAAU,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAC3E,IAAI,kBAAkB,GAAG,eAAe;QAAE,OAAO,QAAQ,CAAC;IAC1D,IAAI,kBAAkB,GAAG,eAAe;QAAE,OAAO,KAAK,CAAC;IAEvD,wEAAwE;IACxE,qEAAqE;IACrE,IAAI,QAAQ,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC1D,IAAI,QAAQ,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS;QAAE,OAAO,KAAK,CAAC;IACvD,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACjD,OAAO,EAAE,GAAG,KAAK,EAAE,GAAG,QAAQ,EAAE,CAAC;AACnC,CAAC;AA8DD,MAAM,UAAU,4BAA4B,CAC1C,aAAuD;IAEvD,IAAI,IAAI,GAA6B,EAAE,CAAC;IACxC,yEAAyE;IACzE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,wEAAwE;IACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,yEAAyE;IACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,oEAAoE;IACpE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,6EAA6E;IAC7E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,wEAAwE;IACxE,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAC;IAE1D,SAAS,MAAM,CAAC,IAA8B;QAC5C,KAAK,IAAI,CAAC,CAAC;QACX,IAAI,GAAG,IAAI,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,iBAAiB,CAAC,EAAU;QACnC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;mDAG+C;IAC/C,SAAS,mBAAmB,CAAC,EAAU;QACrC,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC;QAC1C,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,SAAS,CAAC,EAAU;QAC3B,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAED,SAAS,UAAU,CAAC,EAAyB;QAC3C,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,OAAO;QAC1B,oEAAoE;QACpE,uEAAuE;QACvE,sDAAsD;QACtD,IAAI,EAAE,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3B,oEAAoE;YACpE,uEAAuE;YACvE,qEAAqE;YACrE,iEAAiE;YACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,cAAc,CAAC,IAAI,EAAE,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpG,KAAK,MAAM,EAAE,IAAI,KAAK;gBAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YACtC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACxB,OAAO;QACT,CAAC;QACD,IAAI,EAAE,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvB,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,OAAO;QACT,CAAC;QACD,sEAAsE;QACtE,sEAAsE;QACtE,sBAAsB;QACtB,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAAE,OAAO;QAClC,qEAAqE;QACrE,uEAAuE;QACvE,uEAAuE;QACvE,sEAAsE;QACtE,mEAAmE;QACnE,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9D,OAAO;QACT,CAAC;QACD,mEAAmE;QACnE,wEAAwE;QACxE,8CAA8C;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,IAA8B,CAAC;QACnC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACZ,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAE,EAAE,EAAE,CAAC,CAAC;QAC7C,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,SAAS,cAAc,CAAC,SAAmC,EAAE,UAAkB;QAC7E,qEAAqE;QACrE,mEAAmE;QACnE,mEAAmE;QACnE,kEAAkE;QAClE,uEAAuE;QACvE,MAAM,eAAe,GAAG,UAAU,GAAG,UAAU,IAAI,aAAa,GAAG,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,eAAe;YAC9B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACtF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAU,CAAC,CAAC,CAAC;QAC5E,uEAAuE;QACvE,oEAAoE;QACpE,oEAAoE;QACpE,mEAAmE;QACnE,sEAAsE;QACtE,uEAAuE;QACvE,oEAAoE;QACpE,qEAAqE;QACrE,qEAAqE;QACrE,qEAAqE;QACrE,yEAAyE;QACzE,uEAAuE;QACvE,MAAM,SAAS,GAAG,IAAI;aACnB,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;YACd,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC1C,gEAAgE;YAChE,oEAAoE;YACpE,qDAAqD;YACrD,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,UAAU,CAAC;QAC5C,CAAC,CAAC;aACD,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YACX,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9C,OAAO,YAAY,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAClE,CAAC,CAAC,CAAC;QACL,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACtC,sEAAsE;YACtE,8CAA8C;YAC9C,MAAM,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;YAC9E,IAAI,EAAE,KAAK,CAAC,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;gBAC3B,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,QAAQ;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI;QAChB,aAAa,EAAE,GAAG,EAAE,CAAC,KAAK;QAC1B,cAAc;QACd,UAAU;QACV,WAAW,CAAC,EAAE;YACZ,MAAM,YAAY,GAAG,IAAI,CAAC;YAC1B,iBAAiB,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YAC/D,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;QACtC,CAAC;QACD,mBAAmB,CAAC,EAAE;YACpB,IAAI,mBAAmB,CAAC,EAAE,CAAC;gBAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjD,SAAS,CAAC,EAAE,CAAC,CAAC;YACd,+DAA+D;YAC/D,uEAAuE;YACvE,wEAAwE;YACxE,mEAAmE;YACnE,uEAAuE;YACvE,+DAA+D;YAC/D,oEAAoE;YACpE,uEAAuE;YACvE,iEAAiE;YACjE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,mBAAmB,CAAC,EAAE;YACpB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC;gBAAE,OAAO;YACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACpB,iEAAiE;YACjE,0DAA0D;YAC1D,IAAI,QAAQ;gBAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;QACD,UAAU;YACR,MAAM,YAAY,GAAG,IAAI,CAAC;YAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACnF,aAAa,IAAI,CAAC,CAAC;YACnB,MAAM,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9B,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;QAChD,CAAC;QACD,kBAAkB,CAAC,KAAK;YACtB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;YAC/C,oEAAoE;YACpE,iEAAiE;YACjE,sEAAsE;YACtE,6DAA6D;YAC7D,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ;gBAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YAC/C,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,IAAI,EAAE;gBAAE,SAAS,CAAC,EAAE,CAAC,CAAC;YAChD,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,uEAAuE;YACvE,qDAAqD;YACrD,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QACD,kBAAkB;YAChB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,aAAa,GAAG,CAAC;gBAAE,OAAO;YAC9B,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC;gBAC3C,8DAA8D;gBAC9D,+CAA+C;gBAC/C,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACrC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACpB,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,kBAAkB,CAAC,KAAK;YACtB,IAAI,KAAK,KAAK,KAAK,CAAC,UAAU;gBAAE,OAAO;YACvC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/features/memory/react/hooks/useMemoryFlash.hooks.d.ts

@@ -0,0 +1,12 @@
+import type { FlashKind } from '../../types.js';
+export interface MemoryFlashController {
+    /** The active pill, or null when nothing is showing. */
+    flash: {
+        kind: FlashKind;
+        key: number;
+    } | null;
+    /** Show a confirmation pill for ~1.8s. */
+    fireFlash: (kind: FlashKind) => void;
+}
+export declare function useMemoryFlash(): MemoryFlashController;
+//# sourceMappingURL=useMemoryFlash.hooks.d.ts.map

package/dist/features/memory/react/hooks/useMemoryFlash.hooks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMemoryFlash.hooks.d.ts","sourceRoot":"","sources":["../../../../../src/features/memory/react/hooks/useMemoryFlash.hooks.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEhD,MAAM,WAAW,qBAAqB;IACpC,wDAAwD;IACxD,KAAK,EAAE;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;IAC/C,0CAA0C;IAC1C,SAAS,EAAE,CAAC,IAAI,EAAE,SAAS,KAAK,IAAI,CAAC;CACtC;AAED,wBAAgB,cAAc,IAAI,qBAAqB,CAkBtD"}

package/dist/features/memory/react/hooks/useMemoryFlash.hooks.js

@@ -0,0 +1,24 @@
+// Feature-local hook for the transient confirmation pill shown after a manual
+// action (create/save/delete/index-saved/path-copied). Pure UI state with no
+// transport, so it needs no injected port and is its own wired form; a host
+// injects `fireFlash` into the hooks that fire it (entries, connectors) as an
+// arg, keeping those hooks decoupled from this one.
+import { useCallback, useEffect, useState } from 'react';
+export function useMemoryFlash() {
+    // Brief inline confirmation after a manual save/create/delete. The form
+    // vanishes on success and the existing list re-renders, but those signals are
+    // subtle — a 1.8s pill makes "your click did something" obvious without the
+    // heavyweight global toast.
+    const [flash, setFlash] = useState(null);
+    const fireFlash = useCallback((kind) => {
+        setFlash({ kind, key: Date.now() });
+    }, []);
+    useEffect(() => {
+        if (!flash)
+            return;
+        const id = setTimeout(() => setFlash(null), 1800);
+        return () => clearTimeout(id);
+    }, [flash]);
+    return { flash, fireFlash };
+}
+//# sourceMappingURL=useMemoryFlash.hooks.js.map

package/dist/features/memory/react/hooks/useMemoryFlash.hooks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMemoryFlash.hooks.js","sourceRoot":"","sources":["../../../../../src/features/memory/react/hooks/useMemoryFlash.hooks.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,6EAA6E;AAC7E,4EAA4E;AAC5E,8EAA8E;AAC9E,oDAAoD;AACpD,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AAUzD,MAAM,UAAU,cAAc;IAC5B,wEAAwE;IACxE,8EAA8E;IAC9E,4EAA4E;IAC5E,4BAA4B;IAC5B,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAA0C,IAAI,CAAC,CAAC;IAElF,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,IAAe,EAAE,EAAE;QAChD,QAAQ,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC,EAAE,EAAE,CAAC,CAAC;IAEP,SAAS,CAAC,GAAG,EAAE;QACb,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAClD,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAEZ,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC9B,CAAC"}

package/dist/features/memory/react/hooks/useMemoryNavigation.hooks.d.ts

@@ -0,0 +1,24 @@
+import type { Dispatch, MutableRefObject, SetStateAction } from 'react';
+import type { MemoryTab } from '../../types.js';
+/** The two top-level views: the saved-memory list vs the "how it works" panel. */
+export type MemoryTopTab = 'memories' | 'how';
+export interface MemoryNavigationController {
+    topTab: MemoryTopTab;
+    setTopTab: Dispatch<SetStateAction<MemoryTopTab>>;
+    activeTab: MemoryTab;
+    setActiveTab: Dispatch<SetStateAction<MemoryTab>>;
+    addModalOpen: boolean;
+    setAddModalOpen: Dispatch<SetStateAction<boolean>>;
+    advancedModalOpen: boolean;
+    setAdvancedModalOpen: Dispatch<SetStateAction<boolean>>;
+    /** The saved-memory <section>; scroll targets and layout probes read it. */
+    recordsRef: MutableRefObject<HTMLElement | null>;
+    /** Open the manual editor: jump to the memories view, open the add modal, and
+     *  select the manual sub-tab. Injected into the entries hook as coordination
+     *  so that hook never reaches into nav state directly. */
+    openEditor: () => void;
+    /** Close the add modal (used after a successful create/save). */
+    closeEditor: () => void;
+}
+export declare function useMemoryNavigation(): MemoryNavigationController;
+//# sourceMappingURL=useMemoryNavigation.hooks.d.ts.map

package/dist/features/memory/react/hooks/useMemoryNavigation.hooks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMemoryNavigation.hooks.d.ts","sourceRoot":"","sources":["../../../../../src/features/memory/react/hooks/useMemoryNavigation.hooks.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,QAAQ,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,OAAO,CAAC;AACxE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEhD,kFAAkF;AAClF,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,KAAK,CAAC;AAE9C,MAAM,WAAW,0BAA0B;IACzC,MAAM,EAAE,YAAY,CAAC;IACrB,SAAS,EAAE,QAAQ,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC;IAClD,SAAS,EAAE,SAAS,CAAC;IACrB,YAAY,EAAE,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC;IAClD,YAAY,EAAE,OAAO,CAAC;IACtB,eAAe,EAAE,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;IACnD,iBAAiB,EAAE,OAAO,CAAC;IAC3B,oBAAoB,EAAE,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;IACxD,4EAA4E;IAC5E,UAAU,EAAE,gBAAgB,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;IACjD;;8DAE0D;IAC1D,UAAU,EAAE,MAAM,IAAI,CAAC;IACvB,iEAAiE;IACjE,WAAW,EAAE,MAAM,IAAI,CAAC;CACzB;AAED,wBAAgB,mBAAmB,IAAI,0BAA0B,CA2BhE"}

package/dist/features/memory/react/hooks/useMemoryNavigation.hooks.js

@@ -0,0 +1,37 @@
+// Feature-local hook for a host's navigation/layout state: which top tab is
+// showing (memories vs how), which source sub-tab is active, whether the
+// add / advanced modals are open, and the records-section ref used for scroll.
+// Pure UI state with no transport and — deliberately — NO effects: the
+// effects that READ this state (reload-on-`activeTab`, the SSE stream, the
+// OAuth subscriptions) stay in the single-instance host orchestrator per the
+// ADR-0002 effect-placement rule, so they can't double-fire. That keeps this
+// hook a plain state container a host re-exposes, and it's driveable with
+// `renderHook` to assert the tab/modal transitions in isolation.
+import { useCallback, useRef, useState } from 'react';
+export function useMemoryNavigation() {
+    const [topTab, setTopTab] = useState('memories');
+    const [activeTab, setActiveTab] = useState('profile');
+    const [addModalOpen, setAddModalOpen] = useState(false);
+    const [advancedModalOpen, setAdvancedModalOpen] = useState(false);
+    const recordsRef = useRef(null);
+    const openEditor = useCallback(() => {
+        setTopTab('memories');
+        setAddModalOpen(true);
+        setActiveTab('manual');
+    }, []);
+    const closeEditor = useCallback(() => setAddModalOpen(false), []);
+    return {
+        topTab,
+        setTopTab,
+        activeTab,
+        setActiveTab,
+        addModalOpen,
+        setAddModalOpen,
+        advancedModalOpen,
+        setAdvancedModalOpen,
+        recordsRef,
+        openEditor,
+        closeEditor,
+    };
+}
+//# sourceMappingURL=useMemoryNavigation.hooks.js.map

package/dist/features/memory/react/hooks/useMemoryNavigation.hooks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMemoryNavigation.hooks.js","sourceRoot":"","sources":["../../../../../src/features/memory/react/hooks/useMemoryNavigation.hooks.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,yEAAyE;AACzE,+EAA+E;AAC/E,uEAAuE;AACvE,2EAA2E;AAC3E,6EAA6E;AAC7E,6EAA6E;AAC7E,0EAA0E;AAC1E,iEAAiE;AACjE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AA0BtD,MAAM,UAAU,mBAAmB;IACjC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAe,UAAU,CAAC,CAAC;IAC/D,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAY,SAAS,CAAC,CAAC;IACjE,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IACxD,MAAM,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,MAAM,CAAqB,IAAI,CAAC,CAAC;IAEpD,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE;QAClC,SAAS,CAAC,UAAU,CAAC,CAAC;QACtB,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzB,CAAC,EAAE,EAAE,CAAC,CAAC;IACP,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IAElE,OAAO;QACL,MAAM;QACN,SAAS;QACT,SAAS;QACT,YAAY;QACZ,YAAY;QACZ,eAAe;QACf,iBAAiB;QACjB,oBAAoB;QACpB,UAAU;QACV,UAAU;QACV,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/dist/features/memory/react/render-markdown.d.ts

@@ -0,0 +1,2 @@
+export declare function renderMarkdown(body: string): import("react").JSX.Element;
+//# sourceMappingURL=render-markdown.d.ts.map

package/dist/features/memory/react/render-markdown.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-markdown.d.ts","sourceRoot":"","sources":["../../../../src/features/memory/react/render-markdown.tsx"],"names":[],"mappings":"AAaA,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,+BAS1C"}

package/dist/features/memory/react/render-markdown.js

@@ -0,0 +1,24 @@
+import { jsx as _jsx } from "react/jsx-runtime";
+// Minimal Markdown → safe HTML renderer for a saved memory entry's preview
+// body. OD's real `runtime/markdown.tsx` (2,881 lines) is chat/artifact
+// rendering territory, explicitly deferred to `@jini-ai/chat-react`/
+// `@jini-ai/renderers-react` (see `packages/ui/source-map.md`) — this is a
+// scoped-down local reimplementation covering just this slice's one need:
+// render a memory body's GFM Markdown as read-only preview text. Built on
+// `micromark`, already a real dependency of this package (see
+// `src/utils/markdown-scroll-sync.ts`). `micromark` escapes raw HTML in the
+// input by default (no `allowDangerousHtml`), so this is XSS-safe without
+// an extra sanitizer pass.
+import { micromark } from 'micromark';
+import { gfm, gfmHtml } from 'micromark-extension-gfm';
+export function renderMarkdown(body) {
+    const html = micromark(body, {
+        extensions: [gfm()],
+        htmlExtensions: [gfmHtml()],
+    });
+    // eslint-disable-next-line react/no-danger -- `html` is micromark's own
+    // escaped output (raw HTML in the source is neutralized, not passed
+    // through), so this is not an unsanitized-input XSS risk.
+    return _jsx("div", { className: "memory-markdown-body", dangerouslySetInnerHTML: { __html: html } });
+}
+//# sourceMappingURL=render-markdown.js.map

package/dist/features/memory/react/render-markdown.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-markdown.js","sourceRoot":"","sources":["../../../../src/features/memory/react/render-markdown.tsx"],"names":[],"mappings":";AAAA,2EAA2E;AAC3E,wEAAwE;AACxE,qEAAqE;AACrE,2EAA2E;AAC3E,0EAA0E;AAC1E,0EAA0E;AAC1E,8DAA8D;AAC9D,4EAA4E;AAC5E,0EAA0E;AAC1E,2BAA2B;AAC3B,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAC;AAEvD,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE;QAC3B,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC;QACnB,cAAc,EAAE,CAAC,OAAO,EAAE,CAAC;KAC5B,CAAC,CAAC;IACH,wEAAwE;IACxE,oEAAoE;IACpE,0DAA0D;IAC1D,OAAO,cAAK,SAAS,EAAC,sBAAsB,EAAC,uBAAuB,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,GAAI,CAAC;AAC7F,CAAC"}

package/dist/features/memory/rules.d.ts

@@ -0,0 +1,44 @@
+import type { Connector, ConnectorStatusMap } from '../connectors/index.js';
+import type { MemoryExtractionRecord, MemorySuggestion, MemoryType, UpdateMemoryConfigRequest } from './types.js';
+/**
+ * The per-hook config flags the hooks panel toggles individually. This union
+ * mirrors the hook keys owned by the UI; it is a convenience type (duplication
+ * is intentional per the slice conventions — only wire DTOs and transport
+ * adapters are shared for correctness).
+ */
+export type MemoryConfigFlagKey = 'chatExtractionEnabled' | 'profileEnabled' | 'rewriteEnabled' | 'verifyEnabled';
+/** Patch body for flipping the master memory switch. */
+export declare function enabledPatch(enabled: boolean): UpdateMemoryConfigRequest;
+/**
+ * Patch body for flipping a single per-hook flag. The daemon merges any subset,
+ * so sending just the one key leaves the others untouched.
+ */
+export declare function singleFlagPatch(flag: MemoryConfigFlagKey, value: boolean): UpdateMemoryConfigRequest;
+/**
+ * The extraction rows that belong in the unified saved-memory list. Two
+ * invariants: connector-kind records are shown only in the Connected tab's scan
+ * history (never the main list), and extractions surface only under the `all`
+ * filter — the per-type filter pills are entry-only. The orchestrator owns the
+ * `useMemo` around this (it spans the entries + extractions clusters); this is
+ * just the pure predicate so the rule is testable without React.
+ */
+export declare function visibleExtractionsFor(extractions: MemoryExtractionRecord[], filter: 'all' | MemoryType): MemoryExtractionRecord[];
+/** Only alphanumeric-underscore suggestion ids are safe to reuse as entry ids. */
+export declare function memoryEntryIdForConnectorSuggestion(suggestion: MemorySuggestion): string | undefined;
+/** Merge a single incoming connector detail into a list by id — a one-item
+ *  convenience wrapper over the shared `mergeConnectors`, since this slice
+ *  only ever has one freshly-connected/updated connector to fold in at a
+ *  time. A `null` update (e.g. a failed connect with no connector payload) is
+ *  a no-op. */
+export declare function upsertMemoryConnector(current: Connector[], next: Connector | null): Connector[];
+/** Apply a live status onto a single connector, dropping stale account/error
+ *  fields — the one-item convenience form of the shared `applyConnectorStatuses`,
+ *  used where only one connector's status is known (the synthetic catalogue
+ *  row derivation in `useMemoryConnectors`). */
+export declare function applyMemoryConnectorStatus(connector: Connector, status: ConnectorStatusMap[string]): Connector;
+/** Mark a connector as awaiting OAuth completion (available unless disabled).
+ *  No equivalent in `features/connectors` — that feature's own auth flow
+ *  tracks pending state separately rather than mutating the connector's
+ *  displayed status, so this transform is genuinely local to this slice. */
+export declare function connectorWithPendingAuthorization(connector: Connector): Connector;
+//# sourceMappingURL=rules.d.ts.map

package/dist/features/memory/rules.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rules.d.ts","sourceRoot":"","sources":["../../../src/features/memory/rules.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,SAAS,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,KAAK,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,UAAU,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAC;AAElH;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,GAAG,uBAAuB,GAAG,gBAAgB,GAAG,gBAAgB,GAAG,eAAe,CAAC;AAElH,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,yBAAyB,CAExE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,mBAAmB,EAAE,KAAK,EAAE,OAAO,GAAG,yBAAyB,CAEpG;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,sBAAsB,EAAE,EACrC,MAAM,EAAE,KAAK,GAAG,UAAU,GACzB,sBAAsB,EAAE,CAE1B;AAED,kFAAkF;AAClF,wBAAgB,mCAAmC,CAAC,UAAU,EAAE,gBAAgB,GAAG,MAAM,GAAG,SAAS,CAEpG;AAED;;;;eAIe;AACf,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,SAAS,GAAG,IAAI,GAAG,SAAS,EAAE,CAG/F;AAED;;;gDAGgD;AAChD,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,SAAS,EACpB,MAAM,EAAE,kBAAkB,CAAC,MAAM,CAAC,GACjC,SAAS,CAEX;AAED;;;4EAG4E;AAC5E,wBAAgB,iCAAiC,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAMjF"}

package/dist/features/memory/rules.js

@@ -0,0 +1,73 @@
+// Pure rules for the memory slice: UI toggle intent -> wire patch, plus the
+// connector list state-transforms this slice still owns locally. No React, no
+// transport, no side effects, so they test with zero doubles.
+//
+// Connector-list reconciliation (merge/apply-statuses/status-changed) is NOT
+// re-derived here. `@jini-ai/ui`'s `features/connectors/rules.ts` already ships
+// `mergeConnectors`/`applyConnectorStatuses`/`hasConnectorStatusChanges`/
+// `connectorAuthSnapshotChanged` — generified ports of the exact same
+// reconciliation reducers OD's `connectors-state.ts` module has on
+// its current `main` (confirmed by direct comparison; see
+// `packages/ui/source-map.md`'s provenance note for this feature). This slice
+// imports and reuses those instead of shipping a third near-duplicate copy,
+// per `foundry/docs/jini-port/god-components-extraction-plan.md`'s Consolidation map,
+// which flags this exact overlap and asks each future extraction to check
+// for it. Only the two transforms with no equivalent in `features/connectors`
+// stay here: the tool-cursor-aware single-connector merge this slice's
+// discovery hydration needs, and the "mark pending authorization" transform.
+import { applyConnectorStatuses, mergeConnectors } from '../connectors/index.js';
+/** Patch body for flipping the master memory switch. */
+export function enabledPatch(enabled) {
+    return { enabled };
+}
+/**
+ * Patch body for flipping a single per-hook flag. The daemon merges any subset,
+ * so sending just the one key leaves the others untouched.
+ */
+export function singleFlagPatch(flag, value) {
+    return { [flag]: value };
+}
+/**
+ * The extraction rows that belong in the unified saved-memory list. Two
+ * invariants: connector-kind records are shown only in the Connected tab's scan
+ * history (never the main list), and extractions surface only under the `all`
+ * filter — the per-type filter pills are entry-only. The orchestrator owns the
+ * `useMemo` around this (it spans the entries + extractions clusters); this is
+ * just the pure predicate so the rule is testable without React.
+ */
+export function visibleExtractionsFor(extractions, filter) {
+    return filter === 'all' ? extractions.filter((record) => record.kind !== 'connector') : [];
+}
+/** Only alphanumeric-underscore suggestion ids are safe to reuse as entry ids. */
+export function memoryEntryIdForConnectorSuggestion(suggestion) {
+    return /^[a-z0-9_]+$/.test(suggestion.id) ? suggestion.id : undefined;
+}
+/** Merge a single incoming connector detail into a list by id — a one-item
+ *  convenience wrapper over the shared `mergeConnectors`, since this slice
+ *  only ever has one freshly-connected/updated connector to fold in at a
+ *  time. A `null` update (e.g. a failed connect with no connector payload) is
+ *  a no-op. */
+export function upsertMemoryConnector(current, next) {
+    if (!next)
+        return current;
+    return mergeConnectors(current, [next]);
+}
+/** Apply a live status onto a single connector, dropping stale account/error
+ *  fields — the one-item convenience form of the shared `applyConnectorStatuses`,
+ *  used where only one connector's status is known (the synthetic catalogue
+ *  row derivation in `useMemoryConnectors`). */
+export function applyMemoryConnectorStatus(connector, status) {
+    return applyConnectorStatuses([connector], { [connector.id]: status })[0];
+}
+/** Mark a connector as awaiting OAuth completion (available unless disabled).
+ *  No equivalent in `features/connectors` — that feature's own auth flow
+ *  tracks pending state separately rather than mutating the connector's
+ *  displayed status, so this transform is genuinely local to this slice. */
+export function connectorWithPendingAuthorization(connector) {
+    const { accountLabel: _accountLabel, lastError: _lastError, ...base } = connector;
+    return {
+        ...base,
+        status: base.status === 'disabled' ? 'disabled' : 'available',
+    };
+}
+//# sourceMappingURL=rules.js.map

package/dist/features/memory/rules.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rules.js","sourceRoot":"","sources":["../../../src/features/memory/rules.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,8EAA8E;AAC9E,8DAA8D;AAC9D,EAAE;AACF,6EAA6E;AAC7E,gFAAgF;AAChF,0EAA0E;AAC1E,sEAAsE;AACtE,mEAAmE;AACnE,0DAA0D;AAC1D,8EAA8E;AAC9E,4EAA4E;AAC5E,sFAAsF;AACtF,0EAA0E;AAC1E,8EAA8E;AAC9E,uEAAuE;AACvE,6EAA6E;AAC7E,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAYjF,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAC,OAAgB;IAC3C,OAAO,EAAE,OAAO,EAAE,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAyB,EAAE,KAAc;IACvE,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,WAAqC,EACrC,MAA0B;IAE1B,OAAO,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,mCAAmC,CAAC,UAA4B;IAC9E,OAAO,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACxE,CAAC;AAED;;;;eAIe;AACf,MAAM,UAAU,qBAAqB,CAAC,OAAoB,EAAE,IAAsB;IAChF,IAAI,CAAC,IAAI;QAAE,OAAO,OAAO,CAAC;IAC1B,OAAO,eAAe,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;gDAGgD;AAChD,MAAM,UAAU,0BAA0B,CACxC,SAAoB,EACpB,MAAkC;IAElC,OAAO,sBAAsB,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;AAC7E,CAAC;AAED;;;4EAG4E;AAC5E,MAAM,UAAU,iCAAiC,CAAC,SAAoB;IACpE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,IAAI,EAAE,GAAG,SAAS,CAAC;IAClF,OAAO;QACL,GAAG,IAAI;QACP,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW;KAC9D,CAAC;AACJ,CAAC"}