cursedbelt 2.8.0 → 3.0.1

package/dist/core/folder-tree/path.d.ts

@@ -1,77 +0,0 @@
-/**
- * Folder PATH encoding — the storage contract every consumer of the folder tree
- * shares. A folder path is an ordered array of segment names (`["Home","Phones",
- * "Noah"]`); on disk it is a single delimiter-joined STRING so it can ride in one
- * field (an entry's `meta.folder`, a note's group tag) without a separate registry.
- *
- * ── Why a delimited string and not id references ─────────────────────────────
- * The first consumer (the vault) is a zero-knowledge, op-log-synced store: a folder
- * lives inside an entry's ENCRYPTED meta, and there is no server-side place to keep
- * an id→name map that every device would have to converge on. Deriving the whole
- * tree from the set of path strings on the items keeps folders a pure function of
- * the items — nothing extra to sync, nothing to version-skew. The cost is that a
- * folder exists only while it (or a descendant) holds an item; that is the same
- * "derived, not declared" model the vault already used for flat folders, extended
- * to nesting.
- *
- * ── The delimiter, and why it is ESCAPED rather than forbidden ───────────────
- * `/` joins segments. A `/` is common enough inside a real folder name ("TV/Film",
- * "and/or") that forbidding it would be a footgun, and — critically — a MIGRATION
- * hazard: a legacy flat folder literally named "TV/Movies" must stay ONE folder,
- * not silently split into two. So the delimiter is escaped, not banned: a literal
- * `/` in a name becomes `\/` and a literal `\` becomes `\\`. Serialize→parse is a
- * lossless round trip for any name that is non-empty and free of control chars.
- */
-/** The character that joins path segments in the stored string. */
-export declare const FOLDER_PATH_DELIMITER = "/";
-/** The escape character. A literal delimiter or escape inside a name is prefixed. */
-export declare const FOLDER_PATH_ESCAPE = "\\";
-/** Trim a raw name for use as a segment. Internal whitespace is preserved; only the
- *  ends are trimmed, so "  My Bank " and "My Bank" are the same folder. */
-export declare function normalizeFolderName(name: string): string;
-/** A folder name is valid iff it is non-empty after trimming and carries no control
- *  characters (which would corrupt the stored string and never render). The
- *  delimiter and escape are ALLOWED — they are escaped on serialize. */
-export declare function isValidFolderName(name: string): boolean;
-/**
- * Serialize a path (array of segment names) into the stored string. Empty and
- * whitespace-only segments are dropped, and each surviving segment is trimmed, so
- * the output is canonical: `serialize(parse(s))` normalizes any spelling of `s`.
- */
-export declare function serializeFolderPath(segments: readonly string[]): string;
-/**
- * Parse a stored string back into its segment array. Splits on UNESCAPED delimiters
- * only, then unescapes each segment. Empty segments (a leading/trailing/double
- * delimiter) are dropped rather than becoming blank folders.
- */
-export declare function parseFolderPath(serialized: string): string[];
-/**
- * A case-insensitive identity key for a path — the thing two paths compare equal by.
- * Folder names dedupe case-insensitively (like the flat rail always did), so "Work"
- * and "work" are one folder, but the key is still per-SEGMENT so "Home/Phones" and
- * "Homework/hones" never collide (which a naive lowercased-string prefix would).
- */
-export declare function folderPathKey(segments: readonly string[]): string;
-/** True when `child` is `parent` or sits anywhere beneath it (segment-aligned, so
- *  `Home` contains `Home/Phones` but NOT `Homework`). An empty `parent` (the root)
- *  contains everything. */
-export declare function isFolderPathUnder(child: readonly string[], parent: readonly string[]): boolean;
-/**
- * The stored-string prefix EVERY descendant of `segments` starts with, and nothing
- * else does — `serialize(segments) + "/"`. It exists so a store that keeps the
- * serialized path in one column (a SQL `LIKE 'Home/%'`, a `startsWith` on a key/value
- * store) can select a whole subtree without parsing every row.
- *
- * It is exact BECAUSE the delimiter is escaped: a folder literally named `TV/Film`
- * serializes as `TV\/Film`, whose fifth character is the escape, so it can never be
- * mistaken for `TV` + a child. `Homework` does not start with `Home/` either. The one
- * thing the prefix does NOT cover is the folder itself — a caller wants
- * `path = serialized OR path LIKE prefix || '%'`, which is what `isFolderPathUnder`
- * says in memory. The root (an empty path) has no prefix that means "everything", so
- * it returns `""` and the caller should skip the filter entirely.
- */
-export declare function folderDescendantPrefix(segments: readonly string[]): string;
-/** Render a path as a human breadcrumb: `Home › Phones › Noah`. The separator is a
- *  display choice; the default is the one the picker and rail use. */
-export declare function formatFolderPath(segments: readonly string[], separator?: string): string;
-//# sourceMappingURL=path.d.ts.map

package/dist/core/folder-tree/path.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"path.d.ts","sourceRoot":"","sources":["../../../src/core/folder-tree/path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,mEAAmE;AACnE,eAAO,MAAM,qBAAqB,MAAM,CAAC;AACzC,qFAAqF;AACrF,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAEvC;2EAC2E;AAC3E,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;wEAEwE;AACxE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAWvD;AAUD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAMvE;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,CAoB5D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAEjE;AAED;;2BAE2B;AAC3B,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAS9F;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAG1E;AAED;sEACsE;AACtE,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,SAAQ,GAAG,MAAM,CAEvF"}

package/dist/core/folder-tree/path.js

@@ -1,147 +0,0 @@
-/**
- * Folder PATH encoding — the storage contract every consumer of the folder tree
- * shares. A folder path is an ordered array of segment names (`["Home","Phones",
- * "Noah"]`); on disk it is a single delimiter-joined STRING so it can ride in one
- * field (an entry's `meta.folder`, a note's group tag) without a separate registry.
- *
- * ── Why a delimited string and not id references ─────────────────────────────
- * The first consumer (the vault) is a zero-knowledge, op-log-synced store: a folder
- * lives inside an entry's ENCRYPTED meta, and there is no server-side place to keep
- * an id→name map that every device would have to converge on. Deriving the whole
- * tree from the set of path strings on the items keeps folders a pure function of
- * the items — nothing extra to sync, nothing to version-skew. The cost is that a
- * folder exists only while it (or a descendant) holds an item; that is the same
- * "derived, not declared" model the vault already used for flat folders, extended
- * to nesting.
- *
- * ── The delimiter, and why it is ESCAPED rather than forbidden ───────────────
- * `/` joins segments. A `/` is common enough inside a real folder name ("TV/Film",
- * "and/or") that forbidding it would be a footgun, and — critically — a MIGRATION
- * hazard: a legacy flat folder literally named "TV/Movies" must stay ONE folder,
- * not silently split into two. So the delimiter is escaped, not banned: a literal
- * `/` in a name becomes `\/` and a literal `\` becomes `\\`. Serialize→parse is a
- * lossless round trip for any name that is non-empty and free of control chars.
- */
-/** The character that joins path segments in the stored string. */
-export const FOLDER_PATH_DELIMITER = "/";
-/** The escape character. A literal delimiter or escape inside a name is prefixed. */
-export const FOLDER_PATH_ESCAPE = "\\";
-/** Trim a raw name for use as a segment. Internal whitespace is preserved; only the
- *  ends are trimmed, so "  My Bank " and "My Bank" are the same folder. */
-export function normalizeFolderName(name) {
-    return name.trim();
-}
-/** A folder name is valid iff it is non-empty after trimming and carries no control
- *  characters (which would corrupt the stored string and never render). The
- *  delimiter and escape are ALLOWED — they are escaped on serialize. */
-export function isValidFolderName(name) {
-    const n = normalizeFolderName(name);
-    if (n.length === 0)
-        return false;
-    // Reject C0 control chars (0x00–0x1F) and DEL (0x7F): they never render and would
-    // corrupt the stored string. Checked by code point so no literal control byte
-    // (or the no-control-characters-in-regex lint) ever appears in this source.
-    for (const ch of n) {
-        const code = ch.codePointAt(0) ?? 0;
-        if (code < 0x20 || code === 0x7f)
-            return false;
-    }
-    return true;
-}
-/** Escape one segment: `\` → `\\`, then `/` → `\/`. Order matters — escape the
- *  escape first so a name containing `\/` is not double-decoded. */
-function escapeSegment(seg) {
-    return seg
-        .replaceAll(FOLDER_PATH_ESCAPE, FOLDER_PATH_ESCAPE + FOLDER_PATH_ESCAPE)
-        .replaceAll(FOLDER_PATH_DELIMITER, FOLDER_PATH_ESCAPE + FOLDER_PATH_DELIMITER);
-}
-/**
- * Serialize a path (array of segment names) into the stored string. Empty and
- * whitespace-only segments are dropped, and each surviving segment is trimmed, so
- * the output is canonical: `serialize(parse(s))` normalizes any spelling of `s`.
- */
-export function serializeFolderPath(segments) {
-    return segments
-        .map(normalizeFolderName)
-        .filter((s) => s.length > 0)
-        .map(escapeSegment)
-        .join(FOLDER_PATH_DELIMITER);
-}
-/**
- * Parse a stored string back into its segment array. Splits on UNESCAPED delimiters
- * only, then unescapes each segment. Empty segments (a leading/trailing/double
- * delimiter) are dropped rather than becoming blank folders.
- */
-export function parseFolderPath(serialized) {
-    const out = [];
-    let seg = "";
-    let escaped = false;
-    for (const ch of serialized) {
-        if (escaped) {
-            seg += ch;
-            escaped = false;
-        }
-        else if (ch === FOLDER_PATH_ESCAPE) {
-            escaped = true;
-        }
-        else if (ch === FOLDER_PATH_DELIMITER) {
-            out.push(seg);
-            seg = "";
-        }
-        else {
-            seg += ch;
-        }
-    }
-    out.push(seg);
-    // A trailing lone escape (malformed input) is dropped with the empty tail.
-    return out.map(normalizeFolderName).filter((s) => s.length > 0);
-}
-/**
- * A case-insensitive identity key for a path — the thing two paths compare equal by.
- * Folder names dedupe case-insensitively (like the flat rail always did), so "Work"
- * and "work" are one folder, but the key is still per-SEGMENT so "Home/Phones" and
- * "Homework/hones" never collide (which a naive lowercased-string prefix would).
- */
-export function folderPathKey(segments) {
-    return serializeFolderPath(segments.map((s) => normalizeFolderName(s).toLowerCase()));
-}
-/** True when `child` is `parent` or sits anywhere beneath it (segment-aligned, so
- *  `Home` contains `Home/Phones` but NOT `Homework`). An empty `parent` (the root)
- *  contains everything. */
-export function isFolderPathUnder(child, parent) {
-    if (parent.length === 0)
-        return true;
-    if (child.length < parent.length)
-        return false;
-    for (let i = 0; i < parent.length; i++) {
-        const c = normalizeFolderName(child[i] ?? "").toLowerCase();
-        const p = normalizeFolderName(parent[i] ?? "").toLowerCase();
-        if (c !== p)
-            return false;
-    }
-    return true;
-}
-/**
- * The stored-string prefix EVERY descendant of `segments` starts with, and nothing
- * else does — `serialize(segments) + "/"`. It exists so a store that keeps the
- * serialized path in one column (a SQL `LIKE 'Home/%'`, a `startsWith` on a key/value
- * store) can select a whole subtree without parsing every row.
- *
- * It is exact BECAUSE the delimiter is escaped: a folder literally named `TV/Film`
- * serializes as `TV\/Film`, whose fifth character is the escape, so it can never be
- * mistaken for `TV` + a child. `Homework` does not start with `Home/` either. The one
- * thing the prefix does NOT cover is the folder itself — a caller wants
- * `path = serialized OR path LIKE prefix || '%'`, which is what `isFolderPathUnder`
- * says in memory. The root (an empty path) has no prefix that means "everything", so
- * it returns `""` and the caller should skip the filter entirely.
- */
-export function folderDescendantPrefix(segments) {
-    const serialized = serializeFolderPath(segments);
-    return serialized === "" ? "" : serialized + FOLDER_PATH_DELIMITER;
-}
-/** Render a path as a human breadcrumb: `Home › Phones › Noah`. The separator is a
- *  display choice; the default is the one the picker and rail use. */
-export function formatFolderPath(segments, separator = " › ") {
-    return segments.map(normalizeFolderName).join(separator);
-}
-//# sourceMappingURL=path.js.map

package/dist/core/folder-tree/path.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"path.js","sourceRoot":"","sources":["../../../src/core/folder-tree/path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,mEAAmE;AACnE,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AACzC,qFAAqF;AACrF,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC;2EAC2E;AAC3E,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC/C,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;AACpB,CAAC;AAED;;wEAEwE;AACxE,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC7C,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACjC,kFAAkF;IAClF,8EAA8E;IAC9E,4EAA4E;IAC5E,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;oEACoE;AACpE,SAAS,aAAa,CAAC,GAAW;IACjC,OAAO,GAAG;SACR,UAAU,CAAC,kBAAkB,EAAE,kBAAkB,GAAG,kBAAkB,CAAC;SACvE,UAAU,CAAC,qBAAqB,EAAE,kBAAkB,GAAG,qBAAqB,CAAC,CAAC;AACjF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAA2B;IAC9D,OAAO,QAAQ;SACb,GAAG,CAAC,mBAAmB,CAAC;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,aAAa,CAAC;SAClB,IAAI,CAAC,qBAAqB,CAAC,CAAC;AAC/B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB;IACjD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,OAAO,EAAE,CAAC;YACb,GAAG,IAAI,EAAE,CAAC;YACV,OAAO,GAAG,KAAK,CAAC;QACjB,CAAC;aAAM,IAAI,EAAE,KAAK,kBAAkB,EAAE,CAAC;YACtC,OAAO,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,IAAI,EAAE,KAAK,qBAAqB,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,GAAG,EAAE,CAAC;QACV,CAAC;aAAM,CAAC;YACP,GAAG,IAAI,EAAE,CAAC;QACX,CAAC;IACF,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,2EAA2E;IAC3E,OAAO,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,QAA2B;IACxD,OAAO,mBAAmB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AACvF,CAAC;AAED;;2BAE2B;AAC3B,MAAM,UAAU,iBAAiB,CAAC,KAAwB,EAAE,MAAyB;IACpF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAA2B;IACjE,MAAM,UAAU,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;IACjD,OAAO,UAAU,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,qBAAqB,CAAC;AACpE,CAAC;AAED;sEACsE;AACtE,MAAM,UAAU,gBAAgB,CAAC,QAA2B,EAAE,SAAS,GAAG,KAAK;IAC9E,OAAO,QAAQ,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC1D,CAAC"}

package/dist/core/folder-tree/tree.d.ts

@@ -1,87 +0,0 @@
-/**
- * The folder TREE model — pure, React-free, and the single source of truth for
- * "given the folder paths the items carry, what is the tree, and what does a
- * rename / move / delete DO to those paths".
- *
- * The consumer owns the items and their storage; this module never touches an item.
- * A structural edit is expressed as a set of {@link FolderRemap}s — `from`→`to`
- * serialized-path rewrites the consumer applies to every item whose folder matches
- * `from`. That keeps the tree generic (it works the same for the vault's encrypted
- * entries and for notes' groups) and keeps the dangerous part — rewriting stored
- * items — a small, testable list of string swaps.
- */
-/** A node in the derived tree. `path` is the full segment array from the root; a
- *  `child` node's path is its parent's plus one segment. */
-export interface FolderNode {
-    /** The leaf name of this node (its last path segment). */
-    name: string;
-    /** Full path from the root, e.g. `["Home","Phones"]`. */
-    path: string[];
-    /** Serialized full path — the value an item at THIS folder stores. */
-    serialized: string;
-    /** Case-insensitive identity key for the full path. */
-    key: string;
-    /** Depth from the root (a root folder is 0). */
-    depth: number;
-    /** Child folders, sorted case-insensitively by name. */
-    children: FolderNode[];
-}
-/**
- * Build the nested tree from a flat collection of serialized folder-path strings
- * (one per item, duplicates fine). EVERY prefix becomes a node, so a tree with only
- * `Home/Phones/Noah` still surfaces `Home` and `Home/Phones` as ancestors. Names
- * dedupe case-insensitively, first spelling wins; siblings sort by name.
- */
-export declare function buildFolderTree(serializedPaths: Iterable<string>): FolderNode[];
-/** The derived tree plus a CUMULATIVE per-folder count — how many of the supplied
- *  paths sit at-or-under each folder. */
-export interface FolderIndex {
-    tree: FolderNode[];
-    /** Items at-or-under the folder with this serialized path. Unknown folder → 0. */
-    count: (serialized: string) => number;
-}
-/**
- * {@link buildFolderTree} plus counts, in ONE pass over the paths.
- *
- * Counts are cumulative: an item in `Home/Phones/Noah` counts for `Home`,
- * `Home/Phones` AND `Home/Phones/Noah`, so a collapsed parent still shows a
- * meaningful total rather than the zero its own direct membership would report.
- * That is the number a rail wants next to a folder, and every consumer wants the
- * same one — it was written once in the vault and lifted here when notes needed
- * it, rather than counted twice with two chances to disagree about whether a
- * parent includes its children.
- */
-export declare function buildFolderIndex(serializedPaths: Iterable<string>): FolderIndex;
-/** Depth-first flatten (parent before children) — the order a picker lists options
- *  and a rail renders rows. */
-export declare function flattenFolderTree(nodes: readonly FolderNode[]): FolderNode[];
-/** A single stored-path rewrite. `to === ""` means the item drops to the root
- *  (uncategorized). Consumers apply one to every item whose serialized folder path
- *  equals `from`. */
-export interface FolderRemap {
-    from: string;
-    to: string;
-}
-/**
- * Rename the folder at `target` to `newName`, keeping it under the same parent. Every
- * item at `target` OR beneath it is remapped so descendants move with it. Returns the
- * `from`→`to` rewrites the consumer applies; an empty list means nothing to change.
- * Throws on an invalid/blank `newName`.
- */
-export declare function planFolderRename(serializedPaths: Iterable<string>, target: readonly string[], newName: string): FolderRemap[];
-/**
- * Move the folder at `source` under `newParent` (an empty array = the root),
- * carrying its descendants. Refuses to move a folder into itself or a descendant
- * (which would orphan the subtree), and to move a folder to where it already is.
- * Returns the rewrites to apply.
- */
-export declare function planFolderMove(serializedPaths: Iterable<string>, source: readonly string[], newParent: readonly string[]): FolderRemap[];
-/**
- * Delete the folder at `target` by SPLICING it out: every item at or beneath it is
- * re-homed to `target`'s parent, preserving the relative sub-structure. An item
- * directly in `target` moves to the parent (or the root, if `target` was a root);
- * an item in `target/child` moves to `parent/child`. Nothing is deleted from the
- * consumer's store — items keep their secrets, they just lose one path segment.
- */
-export declare function planFolderDelete(serializedPaths: Iterable<string>, target: readonly string[]): FolderRemap[];
-//# sourceMappingURL=tree.d.ts.map

package/dist/core/folder-tree/tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../../../src/core/folder-tree/tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAUH;4DAC4D;AAC5D,MAAM,WAAW,UAAU;IAC1B,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,yDAAyD;IACzD,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,sEAAsE;IACtE,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,GAAG,EAAE,MAAM,CAAC;IACZ,gDAAgD;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,QAAQ,EAAE,UAAU,EAAE,CAAC;CACvB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,CAmC/E;AAED;yCACyC;AACzC,MAAM,WAAW,WAAW;IAC3B,IAAI,EAAE,UAAU,EAAE,CAAC;IACnB,kFAAkF;IAClF,KAAK,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC;CACtC;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,WAAW,CAgB/E;AAMD;+BAC+B;AAC/B,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,UAAU,EAAE,CAU5E;AAED;;qBAEqB;AACrB,MAAM,WAAW,WAAW;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACX;AAsBD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC/B,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,OAAO,EAAE,MAAM,GACb,WAAW,EAAE,CAMf;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAC7B,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,SAAS,EAAE,SAAS,MAAM,EAAE,GAC1B,WAAW,EAAE,CAQf;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC/B,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,GACvB,WAAW,EAAE,CAaf"}

package/dist/core/folder-tree/tree.js

@@ -1,185 +0,0 @@
-/**
- * The folder TREE model — pure, React-free, and the single source of truth for
- * "given the folder paths the items carry, what is the tree, and what does a
- * rename / move / delete DO to those paths".
- *
- * The consumer owns the items and their storage; this module never touches an item.
- * A structural edit is expressed as a set of {@link FolderRemap}s — `from`→`to`
- * serialized-path rewrites the consumer applies to every item whose folder matches
- * `from`. That keeps the tree generic (it works the same for the vault's encrypted
- * entries and for notes' groups) and keeps the dangerous part — rewriting stored
- * items — a small, testable list of string swaps.
- */
-import { folderPathKey, isFolderPathUnder, normalizeFolderName, parseFolderPath, serializeFolderPath, } from "./path";
-/**
- * Build the nested tree from a flat collection of serialized folder-path strings
- * (one per item, duplicates fine). EVERY prefix becomes a node, so a tree with only
- * `Home/Phones/Noah` still surfaces `Home` and `Home/Phones` as ancestors. Names
- * dedupe case-insensitively, first spelling wins; siblings sort by name.
- */
-export function buildFolderTree(serializedPaths) {
-    const roots = new Map();
-    for (const serialized of serializedPaths) {
-        const segments = parseFolderPath(serialized);
-        if (segments.length === 0)
-            continue;
-        let level = roots;
-        const acc = [];
-        for (const seg of segments) {
-            acc.push(seg);
-            const k = normalizeFolderName(seg).toLowerCase();
-            let node = level.get(k);
-            if (!node) {
-                node = { name: seg, path: [...acc], children: new Map() };
-                level.set(k, node);
-            }
-            level = node.children;
-        }
-    }
-    const toNode = (b, depth) => ({
-        name: b.name,
-        path: b.path,
-        serialized: serializeFolderPath(b.path),
-        key: folderPathKey(b.path),
-        depth,
-        children: sortNodes([...b.children.values()].map((c) => toNode(c, depth + 1))),
-    });
-    return sortNodes([...roots.values()].map((b) => toNode(b, 0)));
-}
-/**
- * {@link buildFolderTree} plus counts, in ONE pass over the paths.
- *
- * Counts are cumulative: an item in `Home/Phones/Noah` counts for `Home`,
- * `Home/Phones` AND `Home/Phones/Noah`, so a collapsed parent still shows a
- * meaningful total rather than the zero its own direct membership would report.
- * That is the number a rail wants next to a folder, and every consumer wants the
- * same one — it was written once in the vault and lifted here when notes needed
- * it, rather than counted twice with two chances to disagree about whether a
- * parent includes its children.
- */
-export function buildFolderIndex(serializedPaths) {
-    const paths = [];
-    const counts = new Map();
-    for (const serialized of serializedPaths) {
-        const segments = parseFolderPath(serialized);
-        if (segments.length === 0)
-            continue;
-        paths.push(serializeFolderPath(segments));
-        for (let i = 1; i <= segments.length; i++) {
-            const key = folderPathKey(segments.slice(0, i));
-            counts.set(key, (counts.get(key) ?? 0) + 1);
-        }
-    }
-    return {
-        tree: buildFolderTree(paths),
-        count: (serialized) => counts.get(folderPathKey(parseFolderPath(serialized))) ?? 0,
-    };
-}
-function sortNodes(nodes) {
-    return nodes.sort((a, b) => a.name.localeCompare(b.name, undefined, { sensitivity: "base" }));
-}
-/** Depth-first flatten (parent before children) — the order a picker lists options
- *  and a rail renders rows. */
-export function flattenFolderTree(nodes) {
-    const out = [];
-    const walk = (list) => {
-        for (const n of list) {
-            out.push(n);
-            walk(n.children);
-        }
-    };
-    walk(nodes);
-    return out;
-}
-/** The distinct set of serialized paths that actually appear on items (parents that
- *  exist only as ancestors are not stored on any item, so they never need a remap).
- *  Deduped by identity key. */
-function distinctStoredPaths(serializedPaths) {
-    const seen = new Map();
-    for (const s of serializedPaths) {
-        const segs = parseFolderPath(s);
-        if (segs.length === 0)
-            continue;
-        const k = folderPathKey(segs);
-        if (!seen.has(k))
-            seen.set(k, segs);
-    }
-    return [...seen.values()];
-}
-/** Rebuild a stored path by swapping its first `prefixLen` segments for `replacement`
- *  (which may be empty, re-homing to the root). */
-function replacePrefix(path, prefixLen, replacement) {
-    return [...replacement, ...path.slice(prefixLen)];
-}
-/**
- * Rename the folder at `target` to `newName`, keeping it under the same parent. Every
- * item at `target` OR beneath it is remapped so descendants move with it. Returns the
- * `from`→`to` rewrites the consumer applies; an empty list means nothing to change.
- * Throws on an invalid/blank `newName`.
- */
-export function planFolderRename(serializedPaths, target, newName) {
-    const name = normalizeFolderName(newName);
-    if (name.length === 0)
-        throw new Error("a folder name cannot be blank");
-    if (target.length === 0)
-        throw new Error("cannot rename the root");
-    const renamedPrefix = [...target.slice(0, -1), name];
-    return remapUnder(serializedPaths, target, renamedPrefix);
-}
-/**
- * Move the folder at `source` under `newParent` (an empty array = the root),
- * carrying its descendants. Refuses to move a folder into itself or a descendant
- * (which would orphan the subtree), and to move a folder to where it already is.
- * Returns the rewrites to apply.
- */
-export function planFolderMove(serializedPaths, source, newParent) {
-    if (source.length === 0)
-        throw new Error("cannot move the root");
-    if (isFolderPathUnder(newParent, source)) {
-        throw new Error("cannot move a folder into itself or one of its descendants");
-    }
-    const movedPrefix = [...newParent, source[source.length - 1]];
-    if (folderPathKey(movedPrefix) === folderPathKey(source))
-        return [];
-    return remapUnder(serializedPaths, source, movedPrefix);
-}
-/**
- * Delete the folder at `target` by SPLICING it out: every item at or beneath it is
- * re-homed to `target`'s parent, preserving the relative sub-structure. An item
- * directly in `target` moves to the parent (or the root, if `target` was a root);
- * an item in `target/child` moves to `parent/child`. Nothing is deleted from the
- * consumer's store — items keep their secrets, they just lose one path segment.
- */
-export function planFolderDelete(serializedPaths, target) {
-    if (target.length === 0)
-        throw new Error("cannot delete the root");
-    const parent = target.slice(0, -1);
-    const out = [];
-    for (const path of distinctStoredPaths(serializedPaths)) {
-        if (!isFolderPathUnder(path, target))
-            continue;
-        // Drop the target segment: keep the parent, then everything below target.
-        const spliced = [...parent, ...path.slice(target.length)];
-        const from = serializeFolderPath(path);
-        const to = serializeFolderPath(spliced);
-        if (from !== to)
-            out.push({ from, to });
-    }
-    return out;
-}
-/** Shared core for rename/move: replace the `target`-length prefix of every matching
- *  stored path with `replacement`. */
-function remapUnder(serializedPaths, target, replacement) {
-    const out = [];
-    for (const path of distinctStoredPaths(serializedPaths)) {
-        if (!isFolderPathUnder(path, target))
-            continue;
-        const rebuilt = replacePrefix(path, target.length, replacement);
-        const from = serializeFolderPath(path);
-        const to = serializeFolderPath(rebuilt);
-        if (from !== to)
-            out.push({ from, to });
-    }
-    return out;
-}
-//# sourceMappingURL=tree.js.map

package/dist/core/folder-tree/tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../src/core/folder-tree/tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EACN,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,eAAe,EACf,mBAAmB,GACnB,MAAM,QAAQ,CAAC;AAmBhB;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,eAAiC;IAMhE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE1C,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YACjD,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,EAAE,CAAC;gBACX,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;gBAC1D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACpB,CAAC;YACD,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QACvB,CAAC;IACF,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,CAAW,EAAE,KAAa,EAAc,EAAE,CAAC,CAAC;QAC3D,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,UAAU,EAAE,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC;QACvC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1B,KAAK;QACL,QAAQ,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;KAC9E,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAUD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,eAAiC;IACjE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;IACF,CAAC;IACD,OAAO;QACN,IAAI,EAAE,eAAe,CAAC,KAAK,CAAC;QAC5B,KAAK,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;KAClF,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAmB;IACrC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AAC/F,CAAC;AAED;+BAC+B;AAC/B,MAAM,UAAU,iBAAiB,CAAC,KAA4B;IAC7D,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,IAA2B,EAAE,EAAE;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAClB,CAAC;IACF,CAAC,CAAC;IACF,IAAI,CAAC,KAAK,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC;AACZ,CAAC;AAUD;;+BAE+B;AAC/B,SAAS,mBAAmB,CAAC,eAAiC;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChC,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3B,CAAC;AAED;mDACmD;AACnD,SAAS,aAAa,CAAC,IAAc,EAAE,SAAiB,EAAE,WAAqB;IAC9E,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC/B,eAAiC,EACjC,MAAyB,EACzB,OAAe;IAEf,MAAM,IAAI,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACxE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACnE,MAAM,aAAa,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrD,OAAO,UAAU,CAAC,eAAe,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC7B,eAAiC,EACjC,MAAyB,EACzB,SAA4B;IAE5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IACjE,IAAI,iBAAiB,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,GAAG,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC,CAAC;IACxE,IAAI,aAAa,CAAC,WAAW,CAAC,KAAK,aAAa,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IACpE,OAAO,UAAU,CAAC,eAAe,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC/B,eAAiC,EACjC,MAAyB;IAEzB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,mBAAmB,CAAC,eAAe,CAAC,EAAE,CAAC;QACzD,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC;YAAE,SAAS;QAC/C,0EAA0E;QAC1E,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,KAAK,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;sCACsC;AACtC,SAAS,UAAU,CAClB,eAAiC,EACjC,MAAyB,EACzB,WAAqB;IAErB,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,mBAAmB,CAAC,eAAe,CAAC,EAAE,CAAC;QACzD,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,CAAC;YAAE,SAAS;QAC/C,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,KAAK,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}

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

@@ -1,2 +0,0 @@
-export * from 'cwip/layout';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/layout/index.ts"],"names":[],"mappings":"AAMA,cAAc,aAAa,CAAC"}

package/dist/core/layout/index.js

@@ -1,8 +0,0 @@
-// src/core/layout — re-export of `cwip/layout`, the single source of truth for the
-// framework-agnostic layout/widget engine core (v2 node model + idempotent migration,
-// pure treeOps, aggregates, container-query grid/style class maps, binding resolution,
-// undo/redo history, wire version). cursedbelt's copy was absorbed into cwip
-// (feat/layout-absorb) — add layout-engine core logic THERE, and the React
-// renderer/editor on top of it here (src/react/layoutEngine).
-export * from 'cwip/layout';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/layout/index.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,sFAAsF;AACtF,uFAAuF;AACvF,6EAA6E;AAC7E,2EAA2E;AAC3E,8DAA8D;AAC9D,cAAc,aAAa,CAAC"}

package/dist/core/master-lock/index.d.ts

@@ -1,15 +0,0 @@
-/**
- * `cursedbelt/master-lock` — the isomorphic half of the sitewide master-password lock.
- *
- * Derivation, policy numbers and the wire contract: everything both the browser and the
- * server need to agree on, and nothing that needs either. The server engine is
- * `cursedbelt/server/master-lock`; the in-app controls are `cursedbelt/react/master-lock`.
- *
- * What the whole feature is, and what it is NOT, is written once in the engine's module
- * note — read that before changing anything here.
- */
-export { MASTER_LOCK_KDF, type MasterLockKdfParams, b64u, deriveMasterLockVerifier, isMasterLockKdfParams, newMasterLockKdfParams, unb64u, } from "./kdf";
-export { BASE_DELAY_MS, DEFAULT_IDLE_MS, FREE_ATTEMPTS, MAX_DELAY_MS, MAX_IDLE_MS, MIN_IDLE_MS, clampIdleMs, delayAfter, windowRemaining, } from "./policy";
-export { MASTER_LOCK_COOKIE, masterLockCookieName, MASTER_LOCK_HEADER, MASTER_LOCK_PATHS, MASTER_LOCK_PREFIX, MASTER_LOCK_STATE_HEADER, type MasterLockChangeRequest, type MasterLockEnrollRequest, type MasterLockRefusal, type MasterLockSettingsRequest, type MasterLockStatus, type MasterLockUnlockRequest, } from "./wire";
-export { PRESENCE_ATTRIBUTE, type PresenceMedia, isPresenceMedia, isSomebodyWatching, } from "./presence";
-//# sourceMappingURL=index.d.ts.map

package/dist/core/master-lock/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/master-lock/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EACN,eAAe,EACf,KAAK,mBAAmB,EACxB,IAAI,EACJ,wBAAwB,EACxB,qBAAqB,EACrB,sBAAsB,EACtB,MAAM,GACN,MAAM,OAAO,CAAC;AACf,OAAO,EACN,aAAa,EACb,eAAe,EACf,aAAa,EACb,YAAY,EACZ,WAAW,EACX,WAAW,EACX,WAAW,EACX,UAAU,EACV,eAAe,GACf,MAAM,UAAU,CAAC;AAClB,OAAO,EACN,kBAAkB,EAClB,oBAAoB,EACpB,kBAAkB,EAClB,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,EACxB,KAAK,uBAAuB,EAC5B,KAAK,uBAAuB,EAC5B,KAAK,iBAAiB,EACtB,KAAK,yBAAyB,EAC9B,KAAK,gBAAgB,EACrB,KAAK,uBAAuB,GAC5B,MAAM,QAAQ,CAAC;AAChB,OAAO,EACN,kBAAkB,EAClB,KAAK,aAAa,EAClB,eAAe,EACf,kBAAkB,GAClB,MAAM,YAAY,CAAC"}

package/dist/core/master-lock/index.js

@@ -1,15 +0,0 @@
-/**
- * `cursedbelt/master-lock` — the isomorphic half of the sitewide master-password lock.
- *
- * Derivation, policy numbers and the wire contract: everything both the browser and the
- * server need to agree on, and nothing that needs either. The server engine is
- * `cursedbelt/server/master-lock`; the in-app controls are `cursedbelt/react/master-lock`.
- *
- * What the whole feature is, and what it is NOT, is written once in the engine's module
- * note — read that before changing anything here.
- */
-export { MASTER_LOCK_KDF, b64u, deriveMasterLockVerifier, isMasterLockKdfParams, newMasterLockKdfParams, unb64u, } from "./kdf";
-export { BASE_DELAY_MS, DEFAULT_IDLE_MS, FREE_ATTEMPTS, MAX_DELAY_MS, MAX_IDLE_MS, MIN_IDLE_MS, clampIdleMs, delayAfter, windowRemaining, } from "./policy";
-export { MASTER_LOCK_COOKIE, masterLockCookieName, MASTER_LOCK_HEADER, MASTER_LOCK_PATHS, MASTER_LOCK_PREFIX, MASTER_LOCK_STATE_HEADER, } from "./wire";
-export { PRESENCE_ATTRIBUTE, isPresenceMedia, isSomebodyWatching, } from "./presence";
-//# sourceMappingURL=index.js.map

package/dist/core/master-lock/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/master-lock/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EACN,eAAe,EAEf,IAAI,EACJ,wBAAwB,EACxB,qBAAqB,EACrB,sBAAsB,EACtB,MAAM,GACN,MAAM,OAAO,CAAC;AACf,OAAO,EACN,aAAa,EACb,eAAe,EACf,aAAa,EACb,YAAY,EACZ,WAAW,EACX,WAAW,EACX,WAAW,EACX,UAAU,EACV,eAAe,GACf,MAAM,UAAU,CAAC;AAClB,OAAO,EACN,kBAAkB,EAClB,oBAAoB,EACpB,kBAAkB,EAClB,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,GAOxB,MAAM,QAAQ,CAAC;AAChB,OAAO,EACN,kBAAkB,EAElB,eAAe,EACf,kBAAkB,GAClB,MAAM,YAAY,CAAC"}