cursedbelt 2.7.0 → 3.0.0

package/dist/core/media/videoCuts.js

@@ -1,285 +0,0 @@
-/**
- * Marking parts of a video to REMOVE — the model, with no browser and no ffmpeg in it.
- *
- * ── The owner's ask, 2026-08-25 ────────────────────────────────────────────────────────
- * *"We will use a unique strategy and not have live video changes in the UI. What I want is
- * to be able to mark points in the video to indicate where to cut out sections. The browser
- * is not great at actually removing segments in the UI even with the cc editor for video. So
- * I will just mark them and send them to binary-server to handle it with the video software
- * it uses."*
- *
- * 🔴 That is a decision about WHERE the work happens, and it is the right one for a reason
- * worth writing down: `ffmpeg.wasm` decodes a multi-gigabyte clip inside a tab, at a few
- * frames a second, holding the whole thing in memory — and this library's files are phone
- * and camera masters. binary-server already runs native ffmpeg on this Mac with measured
- * encoder settings (`ffmpegJobs.ts`), so the browser's only job is to say WHERE, which is
- * exactly what a browser is good at.
- *
- * So a cut list is DATA. It is produced here, travels as JSON, and is executed somewhere
- * else — which is why every rule about what makes a list valid lives in this file rather
- * than being re-derived by the editor, by the app's route and by the ffmpeg arg builder. A
- * cut list the UI thinks is fine and the encoder thinks is empty is the failure mode this
- * shape exists to make impossible.
- *
- * ── 🔴 Why it lives in `core/`, not beside the editor in `react/media/` ────────────────
- * Because the SERVER needs it. `apps/collections`' route refuses a cut list with the same
- * function the dialog's Send button was disabled by, and a second definition of "a cut list
- * that cannot be executed" is exactly the drift this module exists to prevent. Importing it
- * from `cursedbelt/react/media` would pull the mask painter, the picture editor and React
- * itself into a Hono server — so the model is `cursedbelt/media-core`, which is framework-free
- * by construction, and `react/media` re-exports it for the dialog's convenience.
- *
- * ── Half-open, in seconds ──────────────────────────────────────────────────────────────
- * A cut is `[start, end)`. Adjacent cuts therefore MERGE without leaving a frame between
- * them, and a cut ending exactly where the next begins is one cut rather than two with an
- * invisible sliver of footage in the middle.
- */
-/**
- * The shortest span worth cutting, in seconds.
- *
- * 🔴 Not zero, and not "whatever the person dragged". Below roughly a frame the request is
- * indistinguishable from a mis-click, and it is a request ffmpeg cannot honour anyway — a
- * cut has to land on a frame boundary, so a 4 ms span asks the encoder to remove nothing and
- * charges a full re-encode of the file for it. 40 ms is one frame at 25fps, the slowest rate
- * anything in this library was shot at.
- */
-export const MIN_CUT_SECONDS = 0.04;
-const clamp = (value, low, high) => Math.min(high, Math.max(low, value));
-/**
- * Put a raw list into the one canonical form everything downstream may assume: inside the
- * clip, ordered, non-overlapping, and free of spans too short to mean anything.
- *
- * 🔴 Overlaps are MERGED rather than refused. They are not a mistake to report — they are
- * what marking naturally produces: you cut a passage, watch it back, and cut a span that
- * happens to include part of what you already removed. Refusing that would make the editor
- * argue with the person using it about an intention that is perfectly clear.
- *
- * A non-finite bound (a `NaN` duration from a video element that has not loaded yet is the
- * usual source) drops its cut instead of poisoning the sort — every comparison against `NaN`
- * is false, which silently produces an unsorted "sorted" array and a merge pass that leaves
- * overlaps in.
- */
-export function normalizeCuts(cuts, duration) {
-    if (!Number.isFinite(duration) || duration <= 0)
-        return [];
-    const clean = cuts
-        .filter((cut) => Number.isFinite(cut.start) && Number.isFinite(cut.end))
-        .map((cut) => ({
-        start: clamp(Math.min(cut.start, cut.end), 0, duration),
-        end: clamp(Math.max(cut.start, cut.end), 0, duration),
-    }))
-        .filter((cut) => cut.end - cut.start >= MIN_CUT_SECONDS)
-        .sort((a, b) => a.start - b.start);
-    const merged = [];
-    for (const cut of clean) {
-        const last = merged[merged.length - 1];
-        // `>=` not `>`: half-open spans that touch are one span, not two with a gap of zero
-        // seconds between them that no frame can live in.
-        if (last && cut.start <= last.end)
-            last.end = Math.max(last.end, cut.end);
-        else
-            merged.push({ ...cut });
-    }
-    return merged;
-}
-/**
- * What SURVIVES — the complement of the cut list, which is what the encoder actually
- * concatenates.
- *
- * The editor shows this and the encoder builds from it, from one function, because the
- * alternative is two independent readings of "the parts you keep" and a preview that
- * disagrees with the file that comes back.
- */
-export function keptSegments(cuts, duration) {
-    const removed = normalizeCuts(cuts, duration);
-    if (!Number.isFinite(duration) || duration <= 0)
-        return [];
-    const kept = [];
-    let at = 0;
-    for (const cut of removed) {
-        if (cut.start - at >= MIN_CUT_SECONDS)
-            kept.push({ start: at, end: cut.start });
-        at = Math.max(at, cut.end);
-    }
-    if (duration - at >= MIN_CUT_SECONDS)
-        kept.push({ start: at, end: duration });
-    return kept;
-}
-/** How much of the clip the marks remove. */
-export function cutSeconds(cuts, duration) {
-    return normalizeCuts(cuts, duration).reduce((total, cut) => total + (cut.end - cut.start), 0);
-}
-/** How long the result will be. */
-export function keptSeconds(cuts, duration) {
-    return keptSegments(cuts, duration).reduce((total, seg) => total + (seg.end - seg.start), 0);
-}
-/**
- * Why this list cannot be sent, or `null` when it can.
- *
- * 🔴 A SENTENCE, not a boolean, and the same sentence in the editor and on the server. The
- * two refusals below are the only ones, and both are things a person can reach by accident
- * in a few seconds of marking:
- *
- *  · nothing marked — pressing Send with no cuts would queue a full re-encode that produces
- *    a byte-for-byte-pointless second copy of a multi-gigabyte file, and then ask the owner
- *    to choose between two identical videos.
- *  · everything marked — the result is an empty file. ffmpeg's `concat` with zero segments
- *    does not fail loudly; it writes a valid container with no frames in it, which arrives
- *    as a "finished" edit that plays nothing.
- */
-export function cutListProblem(cuts, duration) {
-    if (!Number.isFinite(duration) || duration <= 0)
-        return "This video's length is not known yet, so a cut cannot be placed in it.";
-    if (normalizeCuts(cuts, duration).length === 0)
-        return "Nothing is marked for removal yet — mark at least one section first.";
-    if (keptSegments(cuts, duration).length === 0)
-        return "That removes the whole video. Leave at least one section to keep.";
-    return null;
-}
-/**
- * Seconds as `m:ss.s` / `h:mm:ss.s` — a TENTH of a second, unlike the timecode the player's
- * scrub bar shows.
- *
- * 🔴 The extra digit is the difference between a readable clock and a usable cut point. At
- * whole seconds two marks a few frames apart render identically, so a list of cuts around
- * one moment reads as the same row repeated — and there is no way to tell, from the list,
- * which of them is the one you meant to delete.
- */
-export function cutTimecode(seconds) {
-    if (!Number.isFinite(seconds) || seconds < 0)
-        return '0:00.0';
-    /*
-     * 🔴 Integer tenths, with an epsilon, rather than `Math.floor((seconds % 1) * 10)`.
-     *
-     * A playhead is a float from a decoder, and the fractional part of one is not the number
-     * you wrote down: `3725.2 % 1` is 0.19999999999981810, which floors to ONE tenth — the
-     * timecode reads 1:02:05.1 for a mark placed at 1:02:05.2, so a person nudging a cut watches
-     * the clock disagree with the frame. Truncating in tenths (and nudging past the
-     * representation error first) keeps the readout monotonic with the playhead.
-     */
-    const totalTenths = Math.floor(seconds * 10 + 1e-6);
-    const tenths = totalTenths % 10;
-    const whole = Math.floor(totalTenths / 10);
-    const s = whole % 60;
-    const m = Math.floor(whole / 60) % 60;
-    const h = Math.floor(whole / 3600);
-    const mm = h > 0 ? String(m).padStart(2, '0') : String(m);
-    return `${h > 0 ? `${h}:` : ''}${mm}:${String(s).padStart(2, '0')}.${tenths}`;
-}
-export const EMPTY_PLAN = { splits: [], removed: [] };
-const segmentKey = (start, end) => `${start.toFixed(3)}-${end.toFixed(3)}`;
-/** Sorted, unique, inside the clip, and never closer together than a frame. */
-function tidySplits(splits, duration) {
-    if (!Number.isFinite(duration) || duration <= 0)
-        return [];
-    const out = [];
-    for (const at of [...splits].filter(Number.isFinite).sort((a, b) => a - b)) {
-        if (at <= MIN_CUT_SECONDS || at >= duration - MIN_CUT_SECONDS)
-            continue;
-        // A split a frame away from the previous one makes a segment no frame can live in — and
-        // an unclickable sliver on the strip, which is worse than refusing the cut.
-        if (out.length > 0 && at - out[out.length - 1] < MIN_CUT_SECONDS)
-            continue;
-        out.push(at);
-    }
-    return out;
-}
-/** The clip, divided. Always covers `[0, duration)` exactly, with no gaps. */
-export function planSegments(plan, duration) {
-    if (!Number.isFinite(duration) || duration <= 0)
-        return [];
-    const splits = tidySplits(plan.splits, duration);
-    const bounds = [0, ...splits, duration];
-    const out = [];
-    for (let i = 0; i < bounds.length - 1; i++) {
-        const start = bounds[i];
-        const end = bounds[i + 1];
-        out.push({
-            start,
-            end,
-            key: segmentKey(start, end),
-            // A segment is removed when the plan holds a removal that COVERS it. Covers, not
-            // equals: a segment that was marked out and has since been split in two is two removed
-            // segments, and the alternative — dropping the mark on a re-split — silently restores
-            // footage somebody had already decided against.
-            removed: plan.removed.some((cut) => cut.start <= start + 1e-6 && cut.end >= end - 1e-6),
-        });
-    }
-    return out;
-}
-/** Cut here. A split inside a removed piece divides it into two removed pieces. */
-export function addSplit(plan, at, duration) {
-    const splits = tidySplits([...plan.splits, at], duration);
-    if (splits.length === tidySplits(plan.splits, duration).length)
-        return plan;
-    return { splits, removed: plan.removed };
-}
-/**
- * Undo a cut, merging the two pieces either side.
- *
- * 🔴 The merged piece is removed only if BOTH halves were. Anything else invents an
- * intention: promoting a half-removed merge to "removed" deletes footage nobody marked, and
- * demoting it to "kept" restores footage somebody did mark. Requiring agreement means the
- * only way to lose a decision is to have made two conflicting ones, and then the safe
- * reading — keep it — is the one that costs nothing but another click.
- */
-export function removeSplit(plan, at, duration) {
-    const splits = tidySplits(plan.splits, duration);
-    const index = splits.findIndex((split) => Math.abs(split - at) < 1e-6);
-    if (index === -1)
-        return plan;
-    const before = planSegments(plan, duration);
-    const left = before.find((segment) => Math.abs(segment.end - at) < 1e-6);
-    const right = before.find((segment) => Math.abs(segment.start - at) < 1e-6);
-    const nextSplits = [...splits.slice(0, index), ...splits.slice(index + 1)];
-    const nextPlan = { splits: nextSplits, removed: plan.removed };
-    if (!left || !right)
-        return nextPlan;
-    const merged = { start: left.start, end: right.end };
-    const kept = plan.removed.filter((cut) => !(cut.start >= merged.start - 1e-6 && cut.end <= merged.end + 1e-6));
-    return {
-        splits: nextSplits,
-        removed: left.removed && right.removed ? [...kept, merged] : kept,
-    };
-}
-/** Mark a piece out, or put it back — the ✗ on a segment. */
-export function toggleSegment(plan, segment, duration) {
-    const current = planSegments(plan, duration).find((candidate) => candidate.key === segmentKey(segment.start, segment.end));
-    if (!current)
-        return plan;
-    if (current.removed) {
-        return {
-            splits: plan.splits,
-            // Drop every removal this segment sits inside, then put back the parts of a WIDER
-            // removal that are still meant to go — un-marking one piece of a span that was marked
-            // before it was split must not resurrect its neighbours.
-            removed: plan.removed.flatMap((cut) => {
-                if (!(cut.start <= current.start + 1e-6 && cut.end >= current.end - 1e-6))
-                    return [cut];
-                const rest = [];
-                if (current.start - cut.start >= MIN_CUT_SECONDS)
-                    rest.push({ start: cut.start, end: current.start });
-                if (cut.end - current.end >= MIN_CUT_SECONDS)
-                    rest.push({ start: current.end, end: cut.end });
-                return rest;
-            }),
-        };
-    }
-    return { splits: plan.splits, removed: [...plan.removed, { start: current.start, end: current.end }] };
-}
-/**
- * The plan as the wire format — the spans to remove, normalized.
- *
- * Adjacent removed segments merge here, which is why the editor can let somebody mark three
- * pieces in a row without producing three cuts the encoder has to join back up.
- */
-export function planCuts(plan, duration) {
-    return normalizeCuts(planSegments(plan, duration)
-        .filter((segment) => segment.removed)
-        .map(({ start, end }) => ({ start, end })), duration);
-}
-/** Why this plan cannot be sent, or `null`. The same two refusals, asked of a plan. */
-export function planProblem(plan, duration) {
-    return cutListProblem(planCuts(plan, duration), duration);
-}
-//# sourceMappingURL=videoCuts.js.map

package/dist/core/media/videoCuts.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"videoCuts.js","sourceRoot":"","sources":["../../../src/core/media/videoCuts.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAqCH;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAC;AAEpC,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAW,EAAE,IAAY,EAAU,EAAE,CACjE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAEvC;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,aAAa,CAAC,IAAyB,EAAE,QAAgB;IACvE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI;SACf,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;SACvE,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;QACvD,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;KACtD,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,IAAI,eAAe,CAAC;SACvD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,oFAAoF;QACpF,kDAAkD;QAClD,IAAI,IAAI,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;;YACrE,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,IAAyB,EAAE,QAAgB;IACtE,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC9C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE,IAAI,eAAe;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QAChF,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,QAAQ,GAAG,EAAE,IAAI,eAAe;QAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC9E,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,UAAU,CAAC,IAAyB,EAAE,QAAgB;IACpE,OAAO,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAChG,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,WAAW,CAAC,IAAyB,EAAE,QAAgB;IACrE,OAAO,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/F,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAAC,IAAyB,EAAE,QAAgB;IACxE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;QAC7C,OAAO,wEAAwE,CAAC;IAClF,IAAI,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,MAAM,KAAK,CAAC;QAC5C,OAAO,sEAAsE,CAAC;IAChF,IAAI,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,MAAM,KAAK,CAAC;QAC3C,OAAO,mEAAmE,CAAC;IAC7E,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,OAAe;IACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC9D;;;;;;;;OAQG;IACH,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,WAAW,GAAG,EAAE,CAAC;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,EAAE,CAAC,CAAC;IAC3C,MAAM,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACtC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1D,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;AAChF,CAAC;AAsBD,MAAM,CAAC,MAAM,UAAU,GAAY,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AAS/D,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,GAAW,EAAU,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AAEnG,+EAA+E;AAC/E,SAAS,UAAU,CAAC,MAAyB,EAAE,QAAgB;IAC7D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3E,IAAI,EAAE,IAAI,eAAe,IAAI,EAAE,IAAI,QAAQ,GAAG,eAAe;YAAE,SAAS;QACxE,wFAAwF;QACxF,4EAA4E;QAC5E,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,GAAI,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAY,GAAG,eAAe;YAAE,SAAS;QACvF,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,YAAY,CAAC,IAAa,EAAE,QAAgB;IAC1D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,CAAC,CAAC;IACxC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;QAClC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC;YACP,KAAK;YACL,GAAG;YACH,GAAG,EAAE,UAAU,CAAC,KAAK,EAAE,GAAG,CAAC;YAC3B,iFAAiF;YACjF,uFAAuF;YACvF,sFAAsF;YACtF,gDAAgD;YAChD,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC;SACxF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,QAAQ,CAAC,IAAa,EAAE,EAAU,EAAE,QAAgB;IAClE,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAC5E,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,IAAa,EAAE,EAAU,EAAE,QAAgB;IACrE,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IACvE,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,QAAQ,GAAY,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;IACxE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,QAAQ,CAAC;IACrC,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAC9B,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,CAC7E,CAAC;IACF,OAAO;QACL,MAAM,EAAE,UAAU;QAClB,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI;KAClE,CAAC;AACJ,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,aAAa,CAAC,IAAa,EAAE,OAAiB,EAAE,QAAgB;IAC9E,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,IAAI,CAC/C,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,KAAK,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CACxE,CAAC;IACF,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAC1B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,kFAAkF;YAClF,sFAAsF;YACtF,yDAAyD;YACzD,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;gBACpC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC;gBACxF,MAAM,IAAI,GAAe,EAAE,CAAC;gBAC5B,IAAI,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,eAAe;oBAC9C,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;gBACtD,IAAI,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,eAAe;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC9F,OAAO,IAAI,CAAC;YACd,CAAC,CAAC;SACH,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;AACzG,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAa,EAAE,QAAgB;IACtD,OAAO,aAAa,CAClB,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC;SACzB,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC;SACpC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,EAC5C,QAAQ,CACT,CAAC;AACJ,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,WAAW,CAAC,IAAa,EAAE,QAAgB;IACzD,OAAO,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC5D,CAAC"}

package/dist/core/navigation/breadcrumbCompat.d.ts

@@ -1,25 +0,0 @@
-/** A node in a flat breadcrumb hierarchy map. */
-export interface BreadcrumbNode {
-    /** The stable key for this node (usually its path). */
-    key: string;
-    /** Human-readable label. */
-    label: string;
-    /** Key of the parent node, if any. Absent for root nodes. */
-    parent?: string;
-}
-/** A resolved breadcrumb crumb ready to render. */
-export interface BreadcrumbItem {
-    /** Stable key (used as the React list key). */
-    key: string;
-    /** Human-readable label. */
-    label: string;
-    /** Navigation target — omit for a non-interactive (current page) leaf. */
-    href?: string;
-}
-/**
- * Walk `nodes` upward from `path` to the root and return the ancestor chain
- * ordered root-first (Home → … → `path`). Returns `[]` when `path` is absent
- * from the map.
- */
-export declare function buildBreadcrumbTrail(nodes: Record<string, BreadcrumbNode>, path: string): BreadcrumbItem[];
-//# sourceMappingURL=breadcrumbCompat.d.ts.map

package/dist/core/navigation/breadcrumbCompat.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"breadcrumbCompat.d.ts","sourceRoot":"","sources":["../../../src/core/navigation/breadcrumbCompat.ts"],"names":[],"mappings":"AAKA,iDAAiD;AACjD,MAAM,WAAW,cAAc;IAC7B,uDAAuD;IACvD,GAAG,EAAE,MAAM,CAAC;IACZ,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,6DAA6D;IAC7D,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,mDAAmD;AACnD,MAAM,WAAW,cAAc;IAC7B,+CAA+C;IAC/C,GAAG,EAAE,MAAM,CAAC;IACZ,4BAA4B;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,0EAA0E;IAC1E,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,EACrC,IAAI,EAAE,MAAM,GACX,cAAc,EAAE,CAUlB"}

package/dist/core/navigation/breadcrumbCompat.js

@@ -1,22 +0,0 @@
-// Backward-compatible breadcrumb helpers for apps that maintain a flat node map
-// (key → label + optional parent key) rather than deriving the trail from a full
-// NavigationModel. Apps that have migrated to NavigationModel should use
-// deriveBreadcrumbTrail (navigationSelectors) instead.
-/**
- * Walk `nodes` upward from `path` to the root and return the ancestor chain
- * ordered root-first (Home → … → `path`). Returns `[]` when `path` is absent
- * from the map.
- */
-export function buildBreadcrumbTrail(nodes, path) {
-    const chain = [];
-    let cur = path;
-    while (cur) {
-        const node = nodes[cur];
-        if (!node)
-            break;
-        chain.unshift({ key: node.key, label: node.label, href: node.key });
-        cur = node.parent;
-    }
-    return chain;
-}
-//# sourceMappingURL=breadcrumbCompat.js.map

package/dist/core/navigation/breadcrumbCompat.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"breadcrumbCompat.js","sourceRoot":"","sources":["../../../src/core/navigation/breadcrumbCompat.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,iFAAiF;AACjF,yEAAyE;AACzE,uDAAuD;AAsBvD;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAqC,EACrC,IAAY;IAEZ,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,IAAI,GAAG,GAAuB,IAAI,CAAC;IACnC,OAAO,GAAG,EAAE,CAAC;QACX,MAAM,IAAI,GAA+B,KAAK,CAAC,GAAG,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,KAAK,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QACpE,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/core/navigation/coverageTest.d.ts

@@ -1,25 +0,0 @@
-import type { NavigationModel } from './navigationModel';
-/**
- * Build the coverage assertion for `model` against `allRoutePaths` (the app's full
- * route list, e.g. derived from `routes.tsx`). The returned `() => void` throws —
- * listing every gap — when a route path is neither registered in the model nor
- * registered as `deepLinkOnly` (both forms appear in {@link deriveAllPaths}).
- *
- * ```ts
- * // ca/ru navigationModel.spec.ts
- * import { test } from 'bun:test';
- * test('every route is registered in the navigation model',
- *   createCoverageTest(caNavigationModel, caAllRoutePaths));
- * ```
- *
- * Route matching is by {@link normalizeNavPath} on both sides, so a `#tab=…` model
- * entry covers its base route and a trailing slash is ignored.
- */
-export declare function createCoverageTest(model: NavigationModel, allRoutePaths: string[]): () => void;
-/**
- * Non-throwing companion — the raw set of route paths missing from the model. Useful
- * during a migration (N1 of the IA overhaul) to *enumerate* the discovery gaps
- * before fixing them, rather than failing on the first one.
- */
-export declare function findCoverageGaps(model: NavigationModel, allRoutePaths: string[]): string[];
-//# sourceMappingURL=coverageTest.d.ts.map

package/dist/core/navigation/coverageTest.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"coverageTest.d.ts","sourceRoot":"","sources":["../../../src/core/navigation/coverageTest.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGzD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,MAAM,IAAI,CAc9F;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAK1F"}

package/dist/core/navigation/coverageTest.js

@@ -1,49 +0,0 @@
-// The anti-drift guarantee. `createCoverageTest` returns an assertion the consuming
-// app runs in its own `navigationModel.spec.ts`: it fails the build the instant a
-// route exists in `routes.tsx` that no one registered in the navigation model. Since
-// the side nav / hub tiles / breadcrumbs / search / palette ALL derive from that one
-// model, a registered route is automatically discoverable — and an unregistered one
-// can never silently bury. Framework-agnostic (throws a plain Error; works under
-// bun:test, vitest, jest) so the same factory drops into any app's spec file.
-import { deriveAllPaths, normalizeNavPath } from './navigationSelectors';
-/**
- * Build the coverage assertion for `model` against `allRoutePaths` (the app's full
- * route list, e.g. derived from `routes.tsx`). The returned `() => void` throws —
- * listing every gap — when a route path is neither registered in the model nor
- * registered as `deepLinkOnly` (both forms appear in {@link deriveAllPaths}).
- *
- * ```ts
- * // ca/ru navigationModel.spec.ts
- * import { test } from 'bun:test';
- * test('every route is registered in the navigation model',
- *   createCoverageTest(caNavigationModel, caAllRoutePaths));
- * ```
- *
- * Route matching is by {@link normalizeNavPath} on both sides, so a `#tab=…` model
- * entry covers its base route and a trailing slash is ignored.
- */
-export function createCoverageTest(model, allRoutePaths) {
-    return () => {
-        const covered = new Set(deriveAllPaths(model).map(normalizeNavPath));
-        const missing = [...new Set(allRoutePaths.map((p) => p.trim()).filter(Boolean))]
-            .filter((p) => !covered.has(normalizeNavPath(p)))
-            .sort();
-        if (missing.length > 0) {
-            throw new Error(`navigationModel coverage gap — ${missing.length} route path(s) are not registered.\n` +
-                'Add each to a domain group (or mark it deepLinkOnly) so it can never silently bury:\n' +
-                missing.map((p) => `  • ${p}`).join('\n'));
-        }
-    };
-}
-/**
- * Non-throwing companion — the raw set of route paths missing from the model. Useful
- * during a migration (N1 of the IA overhaul) to *enumerate* the discovery gaps
- * before fixing them, rather than failing on the first one.
- */
-export function findCoverageGaps(model, allRoutePaths) {
-    const covered = new Set(deriveAllPaths(model).map(normalizeNavPath));
-    return [...new Set(allRoutePaths.map((p) => p.trim()).filter(Boolean))]
-        .filter((p) => !covered.has(normalizeNavPath(p)))
-        .sort();
-}
-//# sourceMappingURL=coverageTest.js.map

package/dist/core/navigation/coverageTest.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coverageTest.js","sourceRoot":"","sources":["../../../src/core/navigation/coverageTest.ts"],"names":[],"mappings":"AAAA,oFAAoF;AACpF,kFAAkF;AAClF,qFAAqF;AACrF,qFAAqF;AACrF,oFAAoF;AACpF,iFAAiF;AACjF,8EAA8E;AAG9E,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAsB,EAAE,aAAuB;IAChF,OAAO,GAAG,EAAE;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;aAC7E,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;aAChD,IAAI,EAAE,CAAC;QACV,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CACb,kCAAkC,OAAO,CAAC,MAAM,sCAAsC;gBACpF,uFAAuF;gBACvF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAC5C,CAAC;QACJ,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAsB,EAAE,aAAuB;IAC9E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACrE,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;SACpE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;SAChD,IAAI,EAAE,CAAC;AACZ,CAAC"}

package/dist/core/navigation/index.d.ts

@@ -1,7 +0,0 @@
-export { type BreadcrumbItem, type BreadcrumbNode, buildBreadcrumbTrail, } from './breadcrumbCompat';
-export { createCoverageTest, findCoverageGaps, } from './coverageTest';
-export { CURRENT_NAV_PREFS_VERSION, type LegacyNavPrefs, type MigrateNavPrefsOptions, migrateNavPreferences, type NavPreferences, type NavTilePrefs, } from './migrateNavPreferences';
-export { allowAllGate, type GateFn, type NavDomain, type NavGate, type NavGroup, type NavHostLimit, type NavItem, type NavigationModel, } from './navigationModel';
-export { deriveAllPaths, deriveBreadcrumbTrail, deriveDomain, deriveDomainGroups, deriveDomainItems, deriveSearchCatalogue, deriveSideNavDomains, type NavCrumb, normalizeNavPath, type SearchCatalogueEntry, } from './navigationSelectors';
-export { type CatalogueHit, type CatalogueResultGroup, groupCatalogueHits, rankCatalogue, } from './searchCatalogue';
-//# sourceMappingURL=index.d.ts.map

package/dist/core/navigation/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/navigation/index.ts"],"names":[],"mappings":"AAKA,OAAO,EACL,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,yBAAyB,EACzB,KAAK,cAAc,EACnB,KAAK,sBAAsB,EAC3B,qBAAqB,EACrB,KAAK,cAAc,EACnB,KAAK,YAAY,GAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,YAAY,EACZ,KAAK,MAAM,EACX,KAAK,SAAS,EACd,KAAK,OAAO,EACZ,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,KAAK,OAAO,EACZ,KAAK,eAAe,GACrB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,cAAc,EACd,qBAAqB,EACrB,YAAY,EACZ,kBAAkB,EAClB,iBAAiB,EACjB,qBAAqB,EACrB,oBAAoB,EACpB,KAAK,QAAQ,EACb,gBAAgB,EAChB,KAAK,oBAAoB,GAC1B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,KAAK,YAAY,EACjB,KAAK,oBAAoB,EACzB,kBAAkB,EAClB,aAAa,GACd,MAAM,mBAAmB,CAAC"}

package/dist/core/navigation/index.js

@@ -1,11 +0,0 @@
-// `cursedbelt/nav` — the navigation contract + pure selectors. React-free and
-// routing-free: the single source of truth (the IA tree) plus every derivation off
-// it (side nav, hub tiles, breadcrumbs, search catalogue, coverage test, prefs
-// migration). The React components in `cursedbelt/react` consume exactly this.
-export { buildBreadcrumbTrail, } from './breadcrumbCompat';
-export { createCoverageTest, findCoverageGaps, } from './coverageTest';
-export { CURRENT_NAV_PREFS_VERSION, migrateNavPreferences, } from './migrateNavPreferences';
-export { allowAllGate, } from './navigationModel';
-export { deriveAllPaths, deriveBreadcrumbTrail, deriveDomain, deriveDomainGroups, deriveDomainItems, deriveSearchCatalogue, deriveSideNavDomains, normalizeNavPath, } from './navigationSelectors';
-export { groupCatalogueHits, rankCatalogue, } from './searchCatalogue';
-//# sourceMappingURL=index.js.map

package/dist/core/navigation/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/navigation/index.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,mFAAmF;AACnF,+EAA+E;AAC/E,+EAA+E;AAE/E,OAAO,EAGL,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,yBAAyB,EAGzB,qBAAqB,GAGtB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACL,YAAY,GAQb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,cAAc,EACd,qBAAqB,EACrB,YAAY,EACZ,kBAAkB,EAClB,iBAAiB,EACjB,qBAAqB,EACrB,oBAAoB,EAEpB,gBAAgB,GAEjB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAGL,kBAAkB,EAClB,aAAa,GACd,MAAM,mBAAmB,CAAC"}

package/dist/core/navigation/migrateNavPreferences.d.ts

@@ -1,56 +0,0 @@
-import type { NavigationModel } from './navigationModel';
-/** Bump when the migration logic or the prefs shape changes. */
-export declare const CURRENT_NAV_PREFS_VERSION = 1;
-/** Per-hub tile customization (keyed by item path/id within a domain). */
-export interface NavTilePrefs {
-    /** Saved tile order (item ids). */
-    order?: string[];
-    /** Hidden tile ids. */
-    hidden?: string[];
-    /** Per-tile accent override (item id → hex). */
-    colors?: Record<string, string>;
-}
-/** The post-migration navigation preferences. */
-export interface NavPreferences {
-    /** Stamp — equals {@link CURRENT_NAV_PREFS_VERSION} after a successful migration. */
-    version: number;
-    /** Side-nav domain order (domain ids). */
-    order?: string[];
-    /** Hidden domain ids (removed from the side-nav rail; restorable). */
-    hidden?: string[];
-    /** Per-domain accent override (domain id → hex). */
-    colors?: Record<string, string>;
-    /** Collapsed rail section labels (see `NavDomain.section`). */
-    collapsedSections?: string[];
-    /** Per-domain hub-tile customization (domain id → {@link NavTilePrefs}). */
-    hubs?: Record<string, NavTilePrefs>;
-}
-/** The legacy (pre-overhaul) shape: a top-level nav block + per-hub tile prefs. */
-export interface LegacyNavPrefs {
-    version?: number;
-    /** Old side-nav customization, keyed by route id. */
-    nav?: {
-        order?: string[];
-        colors?: Record<string, string>;
-    };
-    /** Old hidden side-nav routes (route ids). */
-    hiddenNavRoutes?: string[];
-    /** Old per-hub tile prefs, keyed by the OLD hub id. */
-    hubs?: Record<string, NavTilePrefs>;
-}
-export interface MigrateNavPrefsOptions {
-    /**
-     * Old key → new domain id. Applied to side-nav route ids AND hub keys; unmapped
-     * keys pass through unchanged. When two old hubs map to one domain (an 8→6
-     * consolidation), their tile prefs are merged.
-     */
-    keyMap?: Record<string, string>;
-}
-/**
- * Migrate legacy nav prefs onto the new model. Idempotent: returns `old` untouched
- * when it's already at {@link CURRENT_NAV_PREFS_VERSION}. Otherwise remaps via
- * `options.keyMap`, drops domain-level keys whose target isn't a real domain in
- * `model`, merges consolidated hubs, and stamps the version.
- */
-export declare function migrateNavPreferences(old: LegacyNavPrefs | NavPreferences | null | undefined, model: NavigationModel, options?: MigrateNavPrefsOptions): NavPreferences;
-//# sourceMappingURL=migrateNavPreferences.d.ts.map

package/dist/core/navigation/migrateNavPreferences.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"migrateNavPreferences.d.ts","sourceRoot":"","sources":["../../../src/core/navigation/migrateNavPreferences.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEzD,gEAAgE;AAChE,eAAO,MAAM,yBAAyB,IAAI,CAAC;AAE3C,0EAA0E;AAC1E,MAAM,WAAW,YAAY;IAC3B,mCAAmC;IACnC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,uBAAuB;IACvB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,gDAAgD;IAChD,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAED,iDAAiD;AACjD,MAAM,WAAW,cAAc;IAC7B,qFAAqF;IACrF,OAAO,EAAE,MAAM,CAAC;IAChB,0CAA0C;IAC1C,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,sEAAsE;IACtE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,oDAAoD;IACpD,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,+DAA+D;IAC/D,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC7B,4EAA4E;IAC5E,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CACrC;AAED,mFAAmF;AACnF,MAAM,WAAW,cAAc;IAC7B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qDAAqD;IACrD,GAAG,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,CAAC;IAC5D,8CAA8C;IAC9C,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,uDAAuD;IACvD,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,sBAAsB;IACrC;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAaD;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,cAAc,GAAG,cAAc,GAAG,IAAI,GAAG,SAAS,EACvD,KAAK,EAAE,eAAe,EACtB,OAAO,GAAE,sBAA2B,GACnC,cAAc,CAsChB"}

package/dist/core/navigation/migrateNavPreferences.js

@@ -1,64 +0,0 @@
-// One-time, idempotent preference migration. The IA overhaul re-groups the old
-// 8-hub layout into 6 domains; this remaps the user's saved nav/hub customizations
-// (order, hidden, per-row colors) onto the new ids so nothing resets. The *mapping*
-// (old key → new domain id) is app-supplied data (only the app knows its old hubs);
-// the runner is the framework's. Idempotent via a version stamp — it runs on every
-// cold load but no-ops once `version` is current, so colors/hidden the user set
-// AFTER migrating are never clobbered.
-/** Bump when the migration logic or the prefs shape changes. */
-export const CURRENT_NAV_PREFS_VERSION = 1;
-const uniq = (xs) => [...new Set(xs)];
-/** Merge two tile-pref blocks (union hidden, concat+dedupe order, later colors win). */
-function mergeTilePrefs(a, b) {
-    return {
-        order: uniq([...(a?.order ?? []), ...(b.order ?? [])]),
-        hidden: uniq([...(a?.hidden ?? []), ...(b.hidden ?? [])]),
-        colors: { ...(a?.colors ?? {}), ...(b.colors ?? {}) },
-    };
-}
-/**
- * Migrate legacy nav prefs onto the new model. Idempotent: returns `old` untouched
- * when it's already at {@link CURRENT_NAV_PREFS_VERSION}. Otherwise remaps via
- * `options.keyMap`, drops domain-level keys whose target isn't a real domain in
- * `model`, merges consolidated hubs, and stamps the version.
- */
-export function migrateNavPreferences(old, model, options = {}) {
-    // Already migrated → no-op (don't reset user choices made post-migration).
-    if (old && typeof old.version === 'number' && old.version >= CURRENT_NAV_PREFS_VERSION) {
-        return old;
-    }
-    const keyMap = options.keyMap ?? {};
-    const remap = (k) => keyMap[k] ?? k;
-    const domainIds = new Set((model?.domains ?? []).map((d) => d.id));
-    const legacy = (old ?? {});
-    // Domain order: remap each old route id → domain id, dedupe, keep only real domains.
-    const order = uniq((legacy.nav?.order ?? []).map(remap)).filter((id) => domainIds.has(id));
-    // Hidden domains: remap, dedupe, keep only real domains.
-    const hidden = uniq((legacy.hiddenNavRoutes ?? []).map(remap)).filter((id) => domainIds.has(id));
-    // Domain colors: remap keys, keep only real domains (last write wins on collision).
-    const colors = {};
-    for (const [k, v] of Object.entries(legacy.nav?.colors ?? {})) {
-        const id = remap(k);
-        if (domainIds.has(id))
-            colors[id] = v;
-    }
-    // Hub tile prefs: remap hub key → domain id, merging when two hubs consolidate.
-    const hubs = {};
-    for (const [oldHub, prefs] of Object.entries(legacy.hubs ?? {})) {
-        const id = remap(oldHub);
-        if (!domainIds.has(id))
-            continue; // a hub with no surviving domain home is dropped
-        hubs[id] = mergeTilePrefs(hubs[id], prefs);
-    }
-    const result = { version: CURRENT_NAV_PREFS_VERSION };
-    if (order.length)
-        result.order = order;
-    if (hidden.length)
-        result.hidden = hidden;
-    if (Object.keys(colors).length)
-        result.colors = colors;
-    if (Object.keys(hubs).length)
-        result.hubs = hubs;
-    return result;
-}
-//# sourceMappingURL=migrateNavPreferences.js.map

package/dist/core/navigation/migrateNavPreferences.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"migrateNavPreferences.js","sourceRoot":"","sources":["../../../src/core/navigation/migrateNavPreferences.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,mFAAmF;AACnF,oFAAoF;AACpF,oFAAoF;AACpF,mFAAmF;AACnF,gFAAgF;AAChF,uCAAuC;AAIvC,gEAAgE;AAChE,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC;AAgD3C,MAAM,IAAI,GAAG,CAAC,EAAY,EAAY,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAE1D,wFAAwF;AACxF,SAAS,cAAc,CAAC,CAA2B,EAAE,CAAe;IAClE,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE;KACtD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAuD,EACvD,KAAsB,EACtB,UAAkC,EAAE;IAEpC,2EAA2E;IAC3E,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,IAAI,GAAG,CAAC,OAAO,IAAI,yBAAyB,EAAE,CAAC;QACvF,OAAO,GAAqB,CAAC;IAC/B,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,EAAE,CAAmB,CAAC;IAE7C,qFAAqF;IACrF,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3F,yDAAyD;IACzD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjG,oFAAoF;IACpF,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC;IAED,gFAAgF;IAChF,MAAM,IAAI,GAAiC,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAC;QAChE,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,iDAAiD;QACnF,IAAI,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,MAAM,GAAmB,EAAE,OAAO,EAAE,yBAAyB,EAAE,CAAC;IACtE,IAAI,KAAK,CAAC,MAAM;QAAE,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;IACvC,IAAI,MAAM,CAAC,MAAM;QAAE,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;IAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM;QAAE,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;IACvD,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACjD,OAAO,MAAM,CAAC;AAChB,CAAC"}