@graphrefly/graphrefly 0.44.0 → 0.46.0

package/dist/extra/reactive.d.ts

@@ -1,353 +0,0 @@
-import { N as Node, V as VersioningLevel } from '../node-kK3CvTrR.js';
-export { L as LogBackend, M as MergedReactiveLog, N as NativeLogBackend, a as ReactiveLogBundle, R as ReactiveLogOptions, V as ViewSpec, m as mergeReactiveLogs, r as reactiveLog } from '../reactive-log-BKALbfal.js';
-export { M as MapBackend, N as NativeMapBackend, a as NativeMapBackendOptions, R as ReactiveMapBundle, b as ReactiveMapOptions, c as ReactiveMapRetention, r as reactiveMap } from '../reactive-map-DS_SIAxv.js';
-import './storage-tiers.js';
-
-type IndexRow<K, V = unknown> = {
-    readonly primary: K;
-    readonly secondary: unknown;
-    readonly value: V;
-};
-type ReactiveIndexOptions<K, V = unknown> = {
-    /** Optional registry name for `describe()` / debugging. */
-    name?: string;
-    /**
-     * Storage backend. Defaults to `NativeIndexBackend` (flat array + parallel `Map<K,IndexRow>`).
-     * Users can plug in persistent / B-tree backends via the {@link IndexBackend} interface.
-     */
-    backend?: IndexBackend<K, V>;
-    /**
-     * Optional versioning level for the underlying `ordered` state node. Set at
-     * construction time; cannot be changed later. Pass `0` for V0 identity +
-     * monotonic version counter, or `1` for V1 + content-addressed cid.
-     * (The `byPrimary` derived node inherits through the dep graph.)
-     */
-    versioning?: VersioningLevel;
-    /**
-     * Default row-equality used to short-circuit idempotent upserts. When
-     * provided, every `upsert` / `upsertMany` that finds an existing primary
-     * compares the stored and candidate rows via `equals(existing, next)` —
-     * on `true` the call is a no-op (no version bump, no emission). Per-call
-     * `UpsertOptions.equals` overrides this default. Analogous to
-     * `NodeOptions.equals` on the core `node()` primitive.
-     */
-    equals?: (existing: IndexRow<K, V>, next: IndexRow<K, V>) => boolean;
-};
-type ReactiveIndexBundle<K, V = unknown> = {
-    /** Rows sorted by `(secondary, primary)`. */
-    readonly ordered: Node<readonly IndexRow<K, V>[]>;
-    /** Map from primary key to stored value. */
-    readonly byPrimary: Node<ReadonlyMap<K, V>>;
-    /** O(1) primary-key existence check. */
-    has: (primary: K) => boolean;
-    /** O(1) value lookup by primary key. */
-    get: (primary: K) => V | undefined;
-    /** Number of rows currently in the index (O(1)). */
-    readonly size: number;
-    /**
-     * Upserts a row. When `opts.equals(existing, next)` returns `true` for an
-     * existing primary key, the upsert is a no-op (no version bump, no emission).
-     * Useful for idempotent writes.
-     *
-     * @returns `true` if a new row was inserted (primary key was absent),
-     *   `false` if the primary key was already present (updated in place OR
-     *   skipped idempotently via `opts.equals`). D5(a).
-     */
-    upsert: (primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>) => boolean;
-    /**
-     * Bulk upsert — emits one snapshot for the whole batch. `opts.equals` applied
-     * per-row. No-op if empty or all rows skipped.
-     *
-     * **Iterable consumption:** Consumes `rows` once (single-pass).
-     */
-    upsertMany: (rows: Iterable<{
-        primary: K;
-        secondary: unknown;
-        value: V;
-    }>, opts?: UpsertOptions<K, V>) => void;
-    delete: (primary: K) => void;
-    /**
-     * Bulk delete — emits one snapshot for the whole batch. No-op if nothing was removed.
-     *
-     * **Iterable consumption:** Consumes `primaries` once (single-pass).
-     */
-    deleteMany: (primaries: Iterable<K>) => void;
-    clear: () => void;
-    /**
-     * Releases internal keepalive subscriptions (on `byPrimary`) so the bundle
-     * can be GC'd. Safe to call more than once (subsequent calls are no-ops).
-     * Subsequent mutations after `dispose()` still execute on the backend but
-     * `byPrimary` may stop updating if no external subscriber is attached.
-     * D6(a).
-     */
-    dispose: () => void;
-};
-/**
- * Storage contract for {@link reactiveIndex}. Implementations own the mutable state and
- * expose a monotonic `version` counter that increments on every structural change.
- *
- * The reactive layer reads `version` to decide when to emit; it does not inspect
- * internal representation. Users can plug in B-tree / skip-list / persistent backends
- * without touching the reactive emission logic.
- *
- * @remarks Post-1.0 op-log changesets will extend this interface with a
- * `changesSince(version: number): Iterable<Change>` method. Current consumers
- * should treat all methods here as stable.
- *
- * @category extra
- */
-/**
- * Optional per-call options for {@link IndexBackend.upsert} and bulk upsert.
- *
- * @category extra
- */
-type UpsertOptions<K, V> = {
-    /**
-     * Skip the upsert if an existing row is considered equal to the proposed row.
-     * Default: no skip — every upsert advances `version`. Provide for idempotent
-     * keys (e.g., `(a, b) => a.secondary === b.secondary && a.value === b.value`).
-     */
-    equals?: (existing: IndexRow<K, V>, next: IndexRow<K, V>) => boolean;
-};
-interface IndexBackend<K, V = unknown> {
-    /** Monotonic mutation counter; increments on every upsert/delete/clear that changes state. */
-    readonly version: number;
-    /** Number of rows currently stored. */
-    readonly size: number;
-    /** O(1) primary-key existence check. */
-    has(primary: K): boolean;
-    /** Value lookup by primary key. */
-    get(primary: K): V | undefined;
-    /**
-     * Insert or replace a row. Returns `true` if a row was inserted (primary
-     * didn't exist), `false` otherwise (updated OR skipped via `opts.equals`).
-     *
-     * **Atomicity contract:** Either fully succeeds or throws before any state
-     * change; `version` advances only on state change.
-     */
-    upsert(primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>): boolean;
-    /**
-     * Atomic bulk upsert. Returns the number of rows that caused a state change
-     * (inserts + non-skipped updates). Advances `version` at most once.
-     * No-op if iterable is empty or all rows skipped by `opts.equals`.
-     *
-     * **Consumes `rows` once** — pass an array for multi-shot consumers.
-     */
-    upsertMany(rows: Iterable<{
-        primary: K;
-        secondary: unknown;
-        value: V;
-    }>, opts?: UpsertOptions<K, V>): number;
-    /** Remove a row by primary key. Returns `true` if the row existed. Advances `version` only if true. */
-    delete(primary: K): boolean;
-    /**
-     * Atomic bulk delete. Returns count removed. Advances `version` at most once.
-     * No-op if no keys were present. Consumes `primaries` once.
-     */
-    deleteMany(primaries: Iterable<K>): number;
-    /** Remove all rows. Returns the number removed. Advances `version` only if non-zero. */
-    clear(): number;
-    /** Rows in sorted `(secondary, primary)` order — fresh snapshot suitable for emission. */
-    toArray(): readonly IndexRow<K, V>[];
-    /** Primary-key → value map — fresh snapshot. */
-    toPrimaryMap(): ReadonlyMap<K, V>;
-}
-/**
- * Default flat-array backend. Maintains `buf: IndexRow[]` sorted by `(secondary, primary)`
- * and a parallel `Map<K, IndexRow>` for O(1) primary-key lookup.
- *
- * **Complexity:**
- * - `has`, `get`: O(1)
- * - `upsert`: up to 2× O(log n) bisect (locate old + locate new) + up to 2× O(n) splice (remove-old + insert-new) = O(n)
- * - `upsertMany(k rows)`: O(k log n) bisect + O(k·n) splice worst case; single version bump
- * - `delete`: O(log n) bisect + O(n) splice = O(n)
- * - `deleteMany(k keys)`: O(k log n) + O(k·n) splice worst case; single version bump
- * - `clear`: O(1)
- * - `toArray`, `toPrimaryMap`: O(n)
- *
- * @category extra
- */
-declare class NativeIndexBackend<K, V = unknown> implements IndexBackend<K, V> {
-    private _version;
-    private readonly _buf;
-    private readonly _byPrimary;
-    get version(): number;
-    get size(): number;
-    has(primary: K): boolean;
-    get(primary: K): V | undefined;
-    upsert(primary: K, secondary: unknown, value: V, opts?: UpsertOptions<K, V>): boolean;
-    upsertMany(rows: Iterable<{
-        primary: K;
-        secondary: unknown;
-        value: V;
-    }>, opts?: UpsertOptions<K, V>): number;
-    delete(primary: K): boolean;
-    deleteMany(primaries: Iterable<K>): number;
-    clear(): number;
-    toArray(): readonly IndexRow<K, V>[];
-    toPrimaryMap(): ReadonlyMap<K, V>;
-}
-/**
- * Creates a reactive index: unique primary key per row, rows sorted by `(secondary, primary)` for ordered scans.
- *
- * @param options - Optional `name` for `describe()` / debugging, and optional `backend` (see {@link IndexBackend}).
- * @returns Bundle with `ordered` (sorted rows), `byPrimary` (map), O(1) `has` / `get` / `size`,
- *   imperative `upsert` / `upsertMany` / `delete` / `deleteMany` / `clear`.
- *
- * @remarks
- * **Ordering:** `secondary` and `primary` are compared via a small total order: same primitive `typeof` uses
- * numeric/string/boolean/bigint comparison; mixed or object keys fall back to `String(a).localeCompare(String(b))`
- * (not identical to Python's rich comparison for exotic types).
- *
- * **Backend:** The default {@link NativeIndexBackend} offers O(1) primary-key lookups and O(n) upserts.
- * For scale beyond a few thousand rows, supply a user-pluggable persistent/B-tree backend via the
- * `backend` option — reactive emission semantics are unchanged.
- *
- * @example
- * ```ts
- * import { reactiveIndex } from "@graphrefly/graphrefly-ts";
- *
- * const idx = reactiveIndex<string, string>();
- * idx.upsert("id1", 10, "row-a");
- * idx.upsert("id2", 5, "row-b");
- * ```
- *
- * @category extra
- */
-declare function reactiveIndex<K, V = unknown>(options?: ReactiveIndexOptions<K, V>): ReactiveIndexBundle<K, V>;
-
-type ReactiveListOptions<T> = {
-    name?: string;
-    /**
-     * Storage backend. Defaults to `NativeListBackend` (flat mutable array).
-     * Users can plug in persistent / RRB-tree backends via the {@link ListBackend} interface.
-     */
-    backend?: ListBackend<T>;
-    /**
-     * Optional versioning level for the underlying `items` state node. Set at
-     * construction time; cannot be changed later. Pass `0` for V0 identity +
-     * monotonic version counter, or `1` for V1 + content-addressed cid.
-     */
-    versioning?: VersioningLevel;
-};
-type ReactiveListBundle<T> = {
-    /** Emits `readonly T[]` on each structural change (two-phase). */
-    readonly items: Node<readonly T[]>;
-    /** Current entry count (O(1)). */
-    readonly size: number;
-    /** Positional access (O(1)); supports negative indices (Python-style). Returns `undefined` on out-of-range. */
-    at: (index: number) => T | undefined;
-    append: (value: T) => void;
-    /** Push all values, emit one snapshot. No-op if `values` is empty. */
-    appendMany: (values: readonly T[]) => void;
-    /** Insert a value at `index`. Throws `RangeError` on out-of-range. */
-    insert: (index: number, value: T) => void;
-    /** Insert all values at `index` as one bulk op; emits one snapshot. No-op if `values` is empty. */
-    insertMany: (index: number, values: readonly T[]) => void;
-    /** Remove and return the value at `index` (default: last). Negative indices Python-style. Throws on empty / out-of-range. */
-    pop: (index?: number) => T;
-    clear: () => void;
-    /**
-     * Releases any internal keepalive subscriptions so the bundle can be
-     * GC'd. `reactiveList` currently holds none (no internal derived nodes),
-     * so `dispose()` is a no-op today — exposed for API parity with
-     * `reactiveIndex.dispose` / `reactiveMap.dispose` / `reactiveLog.dispose`.
-     * Idempotent. D6(a).
-     */
-    dispose: () => void;
-};
-/**
- * Storage contract for {@link reactiveList}. Implementations own the mutable state
- * and expose a monotonic `version` counter that increments on every structural change.
- *
- * The reactive layer reads `version` before and after each backend call; when it
- * advances, a snapshot is emitted.
- *
- * @remarks Post-1.0 op-log changesets will extend this interface with a
- * `changesSince(version: number): Iterable<Change>` method. Current consumers
- * should treat all methods here as stable.
- *
- * @category extra
- */
-interface ListBackend<T> {
-    /** Monotonic mutation counter; increments on every structural change. */
-    readonly version: number;
-    /** Number of items currently stored. */
-    readonly size: number;
-    /** Positional access; `undefined` on out-of-range. */
-    at(index: number): T | undefined;
-    /** Append a single value. Advances `version`. */
-    append(value: T): void;
-    /** Append a batch. Advances `version` once. No-op if empty. */
-    appendMany(values: readonly T[]): void;
-    /** Insert at index; throws `RangeError` on out-of-range `0 <= index <= size`. Advances `version`. */
-    insert(index: number, value: T): void;
-    /** Bulk insert at index; throws on out-of-range. Advances `version` once. No-op if `values` empty. */
-    insertMany(index: number, values: readonly T[]): void;
-    /** Remove and return value at index; throws on empty / out-of-range. Advances `version`. */
-    pop(index: number): T;
-    /** Clear all entries. Returns count removed. Advances `version` only if non-zero. */
-    clear(): number;
-    /** Full snapshot as a fresh array. */
-    toArray(): readonly T[];
-}
-/**
- * Default mutable-array backend.
- *
- * **Complexity:**
- * - `at`, `size`: O(1)
- * - `append`: O(1) amortized
- * - `appendMany(values)`, `insertMany(index, values)`: O(n + k) where k = values.length
- * - `insert`, `pop` (middle): O(n) due to splice
- * - `pop` (last): O(1)
- * - `clear`: O(1)
- * - `toArray`: O(n)
- *
- * @category extra
- */
-declare class NativeListBackend<T> implements ListBackend<T> {
-    private _version;
-    private readonly _buf;
-    constructor(initial?: readonly T[]);
-    get version(): number;
-    get size(): number;
-    at(index: number): T | undefined;
-    append(value: T): void;
-    appendMany(values: readonly T[]): void;
-    insert(index: number, value: T): void;
-    insertMany(index: number, values: readonly T[]): void;
-    pop(index: number): T;
-    clear(): number;
-    toArray(): readonly T[];
-}
-/**
- * Creates a reactive list with immutable array snapshots.
- *
- * @param initial - Optional initial items (copied).
- * @param options - Optional `name` for `describe()` / debugging, or pluggable `backend`.
- * @returns Bundle with `items` (state node), `size` / `at`, `append` / `appendMany` / `insert` /
- *   `insertMany` / `pop` / `clear`.
- *
- * @remarks
- * **No `maxSize`:** insert/pop-anywhere semantics make eviction-under-cap ambiguous.
- * For bounded append-heavy workloads use `reactiveLog` (head-trim is well-defined for
- * append-only).
- *
- * **Backend:** Default {@link NativeListBackend}. For persistent / RRB-tree semantics
- * supply a custom {@link ListBackend}. If you provide a `backend`, `initial` is ignored
- * — seed the backend directly.
- *
- * @example
- * ```ts
- * import { reactiveList } from "@graphrefly/graphrefly-ts";
- *
- * const list = reactiveList<string>(["a"], { name: "queue" });
- * list.append("b");
- * list.insertMany(1, ["x", "y"]);
- * ```
- *
- * @category extra
- */
-declare function reactiveList<T>(initial?: readonly T[], options?: ReactiveListOptions<T>): ReactiveListBundle<T>;
-
-export { type IndexBackend, type IndexRow, type ListBackend, NativeIndexBackend, NativeListBackend, type ReactiveIndexBundle, type ReactiveIndexOptions, type ReactiveListBundle, type ReactiveListOptions, type UpsertOptions, reactiveIndex, reactiveList };

package/dist/extra/reactive.js

@@ -1 +0,0 @@
-import{a as p,b as t}from"../chunk-A5WCQ5NO.js";import{a as x,b as a}from"../chunk-GLERH466.js";import{a as f,b as m}from"../chunk-BEZWM2SY.js";import{a as o,b as r,c as e}from"../chunk-YBB7ZGTY.js";import"../chunk-CRVT7D2P.js";import"../chunk-NTEURFZH.js";import"../chunk-CK2E7BTU.js";import"../chunk-QYADASLV.js";export{p as NativeIndexBackend,x as NativeListBackend,o as NativeLogBackend,f as NativeMapBackend,e as mergeReactiveLogs,t as reactiveIndex,a as reactiveList,r as reactiveLog,m as reactiveMap};

package/dist/extra/render/index.cjs

@@ -1,5 +0,0 @@
-"use strict";var $=Object.defineProperty;var xn=Object.getOwnPropertyDescriptor;var cn=Object.getOwnPropertyNames;var pn=Object.prototype.hasOwnProperty;var hn=(n,e)=>{for(var s in e)$(n,s,{get:e[s],enumerable:!0})},gn=(n,e,s,i)=>{if(e&&typeof e=="object"||typeof e=="function")for(let r of cn(e))!pn.call(n,r)&&r!==s&&$(n,r,{get:()=>e[r],enumerable:!(i=xn(e,r))||i.enumerable});return n};var yn=n=>gn($({},"__esModule",{value:!0}),n);var Vn={};hn(Vn,{mermaidLiveUrl:()=>N,toAscii:()=>nn,toD2:()=>sn,toJson:()=>an,toMermaid:()=>B,toMermaidUrl:()=>fn,toPretty:()=>ln});module.exports=yn(Vn);function j(n){return n>=768&&n<=879||n>=1155&&n<=1161||n>=1425&&n<=1469||n>=1552&&n<=1562||n>=1611&&n<=1631||n>=1648&&n===1648||n>=1750&&n<=1756||n>=1759&&n<=1764||n>=1767&&n<=1768||n>=1770&&n<=1773||n>=1840&&n<=1866||n>=1958&&n<=1968||n>=2304&&n<=2307||n>=2362&&n<=2383||n>=2385&&n<=2391||n>=2402&&n<=2403||n>=2433&&n<=2435||n>=2492&&n<=2509||n>=2561&&n<=2563||n>=2620&&n<=2641||n>=2672&&n<=2673||n>=2677&&n===2677||n>=3633&&n===3633||n>=3636&&n<=3642||n>=3655&&n<=3662||n>=3761&&n===3761||n>=3764&&n<=3772||n>=3784&&n<=3790||n>=7616&&n<=7679||n>=8400&&n<=8447||n>=65024&&n<=65039||n>=65056&&n<=65071||n===8205?0:n>=4352&&n<=4447||n>=8986&&n<=8987||n>=9001&&n<=9002||n>=9193&&n<=9203||n>=9208&&n<=9210||n>=9725&&n<=9726||n>=9748&&n<=9749||n>=9800&&n<=9811||n===9855||n===9875||n===9889||n>=9898&&n<=9899||n>=9917&&n<=9918||n>=9924&&n<=9925||n===9934||n===9940||n===9962||n>=9970&&n<=9971||n===9973||n===9978||n===9981||n===9986||n===9989||n>=9992&&n<=9997||n===9999||n>=10067&&n<=10069||n===10071||n>=10133&&n<=10135||n===10160||n===10175||n>=10548&&n<=10549||n>=11013&&n<=11015||n>=11035&&n<=11036||n===11088||n===11093||n>=11904&&n<=12350||n>=12352&&n<=12447||n>=12448&&n<=12543||n>=12549&&n<=12591||n>=12593&&n<=12686||n>=12688&&n<=12771||n>=12784&&n<=12830||n>=12832&&n<=12871||n>=12880&&n<=19903||n>=19968&&n<=40959||n>=43360&&n<=43388||n>=44032&&n<=55203||n>=63744&&n<=64255||n>=65040&&n<=65049||n>=65072&&n<=65131||n>=65281&&n<=65376||n>=65504&&n<=65510||n>=126980&&n===126980||n===127183||n>=127344&&n<=127345||n===127358||n===127359||n===127374||n>=127377&&n<=127386||n>=127456&&n<=127487||n>=127488&&n<=127490||n===127514||n===127535||n>=127538&&n<=127546||n>=127568&&n<=127569||n>=127744&&n<=129535||n>=129536&&n<=129791||n>=129792&&n<=130047||n>=131072&&n<=196605||n>=196608&&n<=262141?2:1}function S(n){let e=0;for(let s of n)e+=j(s.codePointAt(0));return e}function K(n,e){if(e<=0)return"";let s=0,i="";for(let r of n){let t=j(r.codePointAt(0));if(s+t>e){if(e<=1)return"\u2026";for(;s+1>e&&i.length>0;){let o=[...i].pop();i=i.slice(0,-o.length),s-=j(o.codePointAt(0))}return`${i}\u2026`}i+=r,s+=t}return i}var mn={horizontal:"\u2500",vertical:"\u2502",cornerTL:"\u250C",cornerTR:"\u2510",cornerBL:"\u2514",cornerBR:"\u2518",tDown:"\u252C",tUp:"\u2534",tRight:"\u251C",tLeft:"\u2524",cross:"\u253C",arrowRight:"\u25B6",arrowDown:"\u25BC",arrowLeft:"\u25C0",arrowUp:"\u25B2",boxTL:"\u250C",boxTR:"\u2510",boxBL:"\u2514",boxBR:"\u2518",boxH:"\u2500",boxV:"\u2502"},dn={horizontal:"-",vertical:"|",cornerTL:"+",cornerTR:"+",cornerBL:"+",cornerBR:"+",tDown:"+",tUp:"+",tRight:"+",tLeft:"+",cross:"+",arrowRight:">",arrowDown:"v",arrowLeft:"<",arrowUp:"^",boxTL:"+",boxTR:"+",boxBL:"+",boxBR:"+",boxH:"-",boxV:"|"};function W(n,e){let s=e.charset==="ascii"?dn:mn,i=n.width,r=n.height,t=Array.from({length:r},()=>Array.from({length:i},()=>" ")),o=Array.from({length:r},()=>Array.from({length:i},()=>"empty"));for(let a of n.edges)Ln(t,o,s,a);for(let a of n.boxes)bn(t,o,s,a,e.labelOf(a.id));return t.map(a=>Tn(a.join(""))).join(`
-`)}function bn(n,e,s,i,r){let{x:t,y:o,w:a,h:l}=i;if(a<2||l<2){l>0&&F(n,e,t,o,a,r);return}w(n,e,t,o,s.boxTL);for(let u=t+1;u<t+a-1;u+=1)w(n,e,u,o,s.boxH);w(n,e,t+a-1,o,s.boxTR);for(let u=o+1;u<o+l-1;u+=1){w(n,e,t,u,s.boxV);for(let c=t+1;c<t+a-1;c+=1)Y(n,e,c,u," ","empty");w(n,e,t+a-1,u,s.boxV)}w(n,e,t,o+l-1,s.boxBL);for(let u=t+1;u<t+a-1;u+=1)w(n,e,u,o+l-1,s.boxH);w(n,e,t+a-1,o+l-1,s.boxBR);let f=o+Math.floor(l/2);F(n,e,t+1,f,a-2,r)}function w(n,e,s,i,r){Y(n,e,s,i,r,r===" "?"empty":r==="\u2500"||r==="-"?"boxH":r==="\u2502"||r==="|"?"boxV":"boxCorner")}function Y(n,e,s,i,r,t){if(i<0||i>=n.length)return;let o=n[i];s<0||s>=o.length||(o[s]=r,e[i][s]=t)}function F(n,e,s,i,r,t){if(i<0||i>=n.length)return;let o=s,a=r;for(let l of t){let f=S(l);if(f!==0){if(a<f)break;o>=0&&o<n[i].length&&(n[i][o]=l,e[i][o]="label",f===2&&o+1<n[i].length&&(n[i][o+1]="",e[i][o+1]="label")),o+=f,a-=f}}for(;a>0;)o>=0&&o<n[i].length&&(n[i][o]=" ",e[i][o]="empty"),o+=1,a-=1}function Ln(n,e,s,i){let r=i.points;if(r.length<2)return;for(let l=0;l+1<r.length;l+=1)wn(n,e,s,r[l],r[l+1]);for(let l=1;l+1<r.length;l+=1){let f=r[l-1],u=r[l],c=r[l+1],x=Dn(f,u,c,s);x&&J(n,e,u.x,u.y,x,"edgeCorner")}let t=r[r.length-1],o=r[r.length-2],a=In(o,t,s);a&&J(n,e,t.x,t.y,a,"arrow")}function wn(n,e,s,i,r){if(!(i.x===r.x&&i.y===r.y)){if(i.y===r.y){let t=i.y,o=Math.min(i.x,r.x),a=Math.max(i.x,r.x);for(let l=o;l<=a;l+=1)k(n,e,l,t,s,"h")}else if(i.x===r.x){let t=i.x,o=Math.min(i.y,r.y),a=Math.max(i.y,r.y);for(let l=o;l<=a;l+=1)k(n,e,t,l,s,"v")}}}function k(n,e,s,i,r,t){if(i<0||i>=n.length)return;let o=n[i];if(s<0||s>=o.length)return;let a=e[i][s];if(!(a==="boxH"||a==="boxV"||a==="boxCorner"||a==="label")){if(a==="empty"){o[s]=t==="h"?r.horizontal:r.vertical,e[i][s]=t==="h"?"edgeH":"edgeV";return}if(a==="edgeH"&&t==="v"){o[s]=r.cross,e[i][s]="edgeCorner";return}if(a==="edgeV"&&t==="h"){o[s]=r.cross,e[i][s]="edgeCorner";return}}}function J(n,e,s,i,r,t){if(i<0||i>=n.length)return;let o=n[i];if(s<0||s>=o.length)return;let a=e[i][s];a==="boxH"||a==="boxV"||a==="boxCorner"||a==="label"||(o[s]=r,e[i][s]=t)}function Dn(n,e,s,i){let r=n.y===e.y,t=e.y===s.y;if(r===t)return;if(r){let l=n.x<e.x,f=s.y>e.y;return l&&f?i.cornerTR:l&&!f?i.cornerBR:!l&&f?i.cornerTL:i.cornerBL}let o=n.y<e.y,a=s.x>e.x;return o&&a?i.cornerBL:o&&!a?i.cornerBR:!o&&a?i.cornerTL:i.cornerTR}function In(n,e,s){if(e.x>n.x)return s.arrowRight;if(e.x<n.x)return s.arrowLeft;if(e.y>n.y)return s.arrowDown;if(e.y<n.y)return s.arrowUp}function Tn(n){let e=n.length;for(;e>0&&n.charCodeAt(e-1)===32;)e-=1;return n.slice(0,e)}function Q(n){let e=Mn(n);On(e),Cn(e),Rn(e),Sn(e,n);let s=En(e,n),{width:i,height:r}=Pn(e),t=[];for(let o of e.layers)for(let a of o)a.isVirtual||t.push({id:a.id,layer:a.layer,order:a.order,x:a.x,y:a.y,w:a.w,h:a.h});return{boxes:t,edges:s,width:i,height:r}}function Mn(n){let e=new Map;for(let r of n.nodes)e.set(r,{id:r,isVirtual:!1,layer:-1,order:0,x:0,y:0,w:n.widthCells(r),h:n.heightCells(r),in:[],out:[]});let s=[],i=0;for(let r of n.edges){if(r.from===r.to)continue;let t=e.get(r.from),o=e.get(r.to);if(!t||!o)continue;let a={chainId:i++,chainFrom:r.from,chainTo:r.to,fromId:r.from,toId:r.to,hopIndex:0,chainLen:1};t.out.push(a),o.in.push(a),s.push(a)}return{nodes:e,layers:[],hops:s}}function On(n){let e=new Map;for(let t of n.nodes.values())e.set(t.id,t.in.length);let s=[];for(let t of n.nodes.values())(e.get(t.id)??0)===0&&(t.layer=0,s.push(t));let i=new Set,r=0;for(;r<s.length;){let t=s[r++];if(!i.has(t.id)){i.add(t.id);for(let o of t.out){let a=n.nodes.get(o.toId);a.layer=Math.max(a.layer,t.layer+1);let l=(e.get(a.id)??0)-1;e.set(a.id,l),l<=0&&s.push(a)}}}for(let t of n.nodes.values())t.layer<0&&(t.layer=0)}function Cn(n){let e=Math.max(0,...Array.from(n.nodes.values(),t=>t.layer)),s=Array.from({length:e+1},()=>[]);for(let t of n.nodes.values())s[t.layer].push(t);let i=[],r=0;for(let t of n.hops){let o=n.nodes.get(t.fromId),a=n.nodes.get(t.toId),l=a.layer-o.layer;if(l<=0){o.out=o.out.filter(c=>c!==t),a.in=a.in.filter(c=>c!==t);continue}if(l===1){t.hopIndex=0,t.chainLen=1,i.push(t);continue}o.out=o.out.filter(c=>c!==t),a.in=a.in.filter(c=>c!==t);let f=o;for(let c=1;c<l;c+=1){let x=`__virt_${r++}__`,h={id:x,isVirtual:!0,layer:o.layer+c,order:0,x:0,y:0,w:0,h:1,in:[],out:[]};n.nodes.set(x,h),s[h.layer].push(h);let p={chainId:t.chainId,chainFrom:t.chainFrom,chainTo:t.chainTo,fromId:f.id,toId:x,hopIndex:c-1,chainLen:l};f.out.push(p),h.in.push(p),i.push(p),f=h}let u={chainId:t.chainId,chainFrom:t.chainFrom,chainTo:t.chainTo,fromId:f.id,toId:a.id,hopIndex:l-1,chainLen:l};f.out.push(u),a.in.push(u),i.push(u)}for(let t of s)for(let o=0;o<t.length;o+=1)t[o].order=o;n.layers=s,n.hops=i}function Rn(n){for(let s=0;s<4;s+=1){for(let i=1;i<n.layers.length;i+=1)X(n,n.layers[i],"in"),G(n.layers[i]);for(let i=n.layers.length-2;i>=0;i-=1)X(n,n.layers[i],"out"),G(n.layers[i])}for(let s=0;s<2;s+=1){let i=!1;for(let r=1;r<n.layers.length;r+=1){let t=n.layers[r];for(let o=0;o+1<t.length;o+=1){let a=q(n,t[o],t[o+1],"in");[t[o],t[o+1]]=[t[o+1],t[o]],G(t),q(n,t[o],t[o+1],"in")<a?i=!0:([t[o],t[o+1]]=[t[o+1],t[o]],G(t))}}if(!i)break}}function X(n,e,s){let i=new Map;for(let r of e){let t=s==="in"?r.in:r.out;if(t.length===0){i.set(r.id,r.order);continue}let o=0,a=0;for(let l of t){let f=n.nodes.get(s==="in"?l.fromId:l.toId);f&&(o+=f.order,a+=1)}i.set(r.id,a===0?r.order:o/a)}e.sort((r,t)=>{let o=i.get(r.id),a=i.get(t.id);return o!==a?o-a:r.order-t.order})}function G(n){for(let e=0;e<n.length;e+=1)n[e].order=e}function q(n,e,s,i){let r=i==="in"?e.in:e.out,t=i==="in"?s.in:s.out,o=0;for(let a of r)for(let l of t){let f=n.nodes.get(i==="in"?a.fromId:a.toId)?.order??0,u=n.nodes.get(i==="in"?l.fromId:l.toId)?.order??0;(e.order<s.order&&f>u||e.order>s.order&&f<u)&&(o+=1)}return o}function Sn(n,e){e.direction==="LR"?Gn(n,e):vn(n,e)}function Gn(n,e){let s=[],i=0;for(let r=0;r<n.layers.length;r+=1){s.push(i);let t=0;for(let o of n.layers[r])t=Math.max(t,o.w);i+=t+e.layerGap}for(let r=0;r<n.layers.length;r+=1)for(let t of n.layers[r])t.x=s[r];for(let r of n.layers){let t=0;for(let o of r)o.y=t,t+=o.h+e.nodeGap}Z(n,e,"y")}function vn(n,e){let s=[],i=0;for(let r=0;r<n.layers.length;r+=1){s.push(i);let t=0;for(let o of n.layers[r])t=Math.max(t,o.h);i+=t+e.layerGap}for(let r=0;r<n.layers.length;r+=1)for(let t of n.layers[r])t.y=s[r];for(let r of n.layers){let t=0;for(let o of r)o.x=t,t+=o.w+e.nodeGap}Z(n,e,"x")}function Z(n,e,s){let i=t=>s==="y"?t.h:t.w,r=e.nodeGap;for(let t=0;t<2;t+=1){let o=t===0?n.layers.slice(1):n.layers.slice(0,-1).reverse();for(let a of o){let l=new Map;for(let u of a){let c=t===0?u.in:u.out;if(c.length===0)continue;let x=[];for(let p of c){let y=n.nodes.get(t===0?p.fromId:p.toId);if(!y)continue;let m=s==="y"?y.y:y.x;x.push(m+Math.floor(i(y)/2))}if(x.length===0)continue;x.sort((p,y)=>p-y);let h=x[Math.floor(x.length/2)];l.set(u.id,h-Math.floor(i(u)/2))}let f=0;for(let u of a){let c=l.get(u.id),x=s==="y"?u.y:u.x,p=Math.max(c??x,f);s==="y"?u.y=p:u.x=p,f=p+i(u)+r}}}}function En(n,e){let s=new Map;for(let f of n.hops){let u=s.get(f.chainId);u?u.push(f):s.set(f.chainId,[f])}for(let f of s.values())f.sort((u,c)=>u.hopIndex-c.hopIndex);let i=e.direction==="LR",r=f=>i?f.x:f.y,t=f=>i?f.w:f.h,o=f=>i?f.y+Math.floor(f.h/2):f.x+Math.floor(f.w/2),a=new Map;for(let f=0;f+1<n.layers.length;f+=1){let u=n.layers[f],c=n.layers[f+1],x=0;for(let g of u)x=Math.max(x,r(g)+t(g));let h=Number.POSITIVE_INFINITY;for(let g of c)h=Math.min(h,r(g));let p=Number.isFinite(h)?h-1:x,y=Math.max(1,p-x+1),m=[];for(let g of u)for(let d of g.out)m.push(d);m.sort((g,d)=>{let b=o(n.nodes.get(g.fromId)),L=o(n.nodes.get(d.fromId));if(b!==L)return b-L;let O=o(n.nodes.get(g.toId)),M=o(n.nodes.get(d.toId));return O-M});let D=[],C=new Map;for(let g of m){let d=o(n.nodes.get(g.fromId)),b=o(n.nodes.get(g.toId)),L=Math.min(d,b),O=Math.max(d,b),M=-1;for(let R=0;R<D.length;R+=1){let _=D[R],U=!0;for(let z of _)if(z.lo<=O&&L<=z.hi){U=!1;break}if(U){_.push({lo:L,hi:O}),M=R;break}}M<0&&(D.push([{lo:L,hi:O}]),M=D.length-1),C.set(g,M)}let I=D.length,T=y>=Math.max(3,I+2),H=T?x+1:x,un=T?p-1:p,V=Math.max(1,un-H+1);for(let g of m){let d=C.get(g),b;if(I<=1)b=H+Math.floor(V/2);else{let L=(V-1)/(I-1);b=H+Math.floor(d*L)}a.set(g,Math.max(x,Math.min(p,b)))}}let l=[];for(let[,f]of s){let u=[];for(let x=0;x<f.length;x+=1){let h=f[x],p=n.nodes.get(h.fromId),y=n.nodes.get(h.toId),m=a.get(h),D=p.isVirtual?r(p):r(p)+t(p),C=y.isVirtual?r(y):r(y)-1,I=o(p),T=o(y);x===0&&v(u,i,D,I),I!==T&&(v(u,i,m,I),v(u,i,m,T)),v(u,i,C,T)}let c=f[0];l.push({from:c.chainFrom,to:c.chainTo,points:An(u)})}return l}function v(n,e,s,i){n.push(e?{x:s,y:i}:{x:i,y:s})}function An(n){let e=[];for(let s of n){let i=e[e.length-1];(!i||i.x!==s.x||i.y!==s.y)&&e.push(s)}return e}function Pn(n){let e=0,s=0;for(let i of n.layers)for(let r of i)e=Math.max(e,r.x+r.w),s=Math.max(s,r.y+r.h);return{width:e,height:s}}var Bn=24,Hn=4,$n=1,jn=3;function nn(n,e){let s=Nn(e?.direction),i=Math.max(3,e?.maxLabelWidth??Bn),r=e?.asciiCharset??"unicode",t=Object.keys(n.nodes).sort(),o=new Set(t),a=n.edges.filter(x=>o.has(x.from)&&o.has(x.to)),l=new Map,f=new Map;for(let x of t){let h=K(x,i);l.set(x,h),f.set(x,S(h)+4)}let u=Q({nodes:t,edges:a,widthCells:x=>f.get(x)??3,heightCells:()=>jn,layerGap:Hn,nodeGap:$n,direction:s}),c=W(u,{charset:r,labelOf:x=>l.get(x)??x});return e?.logger?.(c),c}function Nn(n){if(n===void 0||n==="LR")return"LR";if(n==="TD")return"TD";throw new Error(`ascii describe supports direction "LR" or "TD" only; got ${String(n)}`)}function E(n){if(n===null||typeof n!="object")return n;if(Array.isArray(n))return n.map(E);let e=n,s=Object.keys(e).sort(),i={};for(let r of s)i[r]=E(e[r]);return i}function tn(n){return n.replaceAll("\\","\\\\").replaceAll('"','\\"')}function rn(n){return n.replaceAll("\\","\\\\").replaceAll('"','\\"')}function en(n){return n==="TD"?"down":n==="BT"?"up":n==="RL"?"left":"right"}function A(n){let e=new Set,s=[];function i(r,t){let o=`${r}\0${t}`;e.has(o)||(e.add(o),s.push([r,t]))}for(let[r,t]of Object.entries(n.nodes)){let o=t.deps;if(o)for(let a of o)i(a,r)}for(let r of n.edges)i(r.from,r.to);return s}function P(n){if(n===void 0)return"LR";if(n==="TD"||n==="LR"||n==="BT"||n==="RL")return n;throw new Error(`invalid diagram direction ${String(n)}; expected one of: TD, LR, BT, RL`)}function on(n){if(typeof n=="string")return JSON.stringify(n);if(typeof n=="number"||typeof n=="boolean"||n==null)return String(n);try{return JSON.stringify(n)}catch{return"[unserializable]"}}function sn(n,e){let s=P(e?.direction),i=Object.keys(n.nodes).sort(),r=new Map;for(let o=0;o<i.length;o+=1)r.set(i[o],`n${o}`);let t=[`direction: ${en(s)}`];for(let o of i){let a=r.get(o);t.push(`${a}: "${rn(o)}"`)}for(let[o,a]of A(n)){let l=r.get(o),f=r.get(a);!l||!f||t.push(`${l} -> ${f}`)}return t.join(`
-`)}function an(n,e){let s=e?.includeEdges??!0,i=e?.includeSubgraphs??!0,{expand:r,...t}=n,o={...t,edges:s?n.edges:[],subgraphs:i?n.subgraphs:[]},a=JSON.stringify(E(o),null,e?.indent??2);return e?.logger?.(a),a}function B(n,e){let s=P(e?.direction),i=Object.keys(n.nodes).sort(),r=new Map;for(let o=0;o<i.length;o+=1)r.set(i[o],`n${o}`);let t=[`flowchart ${s}`];for(let o of i){let a=r.get(o);t.push(`  ${a}["${tn(o)}"]`)}for(let[o,a]of A(n)){let l=r.get(o),f=r.get(a);!l||!f||t.push(`  ${l} --> ${f}`)}return t.join(`
-`)}function N(n,e){let s=e?.theme??"default",i=e?.autoSync??!0,t=JSON.stringify({code:n,mermaid:{theme:s},autoSync:i}),o=new TextEncoder().encode(t),a="";for(let f=0;f<o.length;f++)a+=String.fromCharCode(o[f]);return`https://mermaid.live/edit#base64:${globalThis.btoa(a).replace(/\+/g,"-").replace(/\//g,"_").replace(/=+$/,"")}`}function fn(n,e){let s=B(n,e);return N(s,e)}function ln(n,e){let s=e?.includeEdges??!0,i=e?.includeSubgraphs??!0,r=[];r.push(`Graph ${n.name}`),r.push("Nodes:");for(let o of Object.keys(n.nodes).sort()){let a=n.nodes[o];r.push(`- ${o} (${a.type}/${a.status}): ${on(a.value)}`)}if(s){r.push("Edges:");for(let o of n.edges)r.push(`- ${o.from} -> ${o.to}`)}if(i){r.push("Subgraphs:");for(let o of n.subgraphs)r.push(`- ${o}`)}let t=r.join(`
-`);return e?.logger?.(t),t}0&&(module.exports={mermaidLiveUrl,toAscii,toD2,toJson,toMermaid,toMermaidUrl,toPretty});

package/dist/extra/render/index.js

@@ -1 +0,0 @@
-import{a,b,c,d,e,f,g}from"../../chunk-3G5U5QNE.js";import"../../chunk-C72GO4IZ.js";import"../../chunk-QYADASLV.js";export{e as mermaidLiveUrl,a as toAscii,b as toD2,c as toJson,d as toMermaid,f as toMermaidUrl,g as toPretty};