foldkit-primitives 0.15.4 → 0.16.0

package/dist/state/index.d.mts

@@ -1,432 +0,0 @@
-import { Schema } from "effect";
-import * as Mount from "foldkit/mount";
-import { Bundle } from "foldkit-bundle";
-export declare const HistoryModel: <Value>(value: Schema.Codec<Value, unknown>) => Schema.Struct<{
-  readonly past: Schema.$Array<Schema.Codec<Value, unknown, never, never>>;
-  readonly present: Schema.Codec<Value, unknown, never, never>;
-  readonly future: Schema.$Array<Schema.Codec<Value, unknown, never, never>>;
-  /** The group of the last push, so the next push of the same group joins it; `null` for none. */
-  readonly group: Schema.NullOr<Schema.String>;
-}>;
-export type HistoryModel<Value> = {
-  readonly past: ReadonlyArray<Value>;
-  readonly present: Value;
-  readonly future: ReadonlyArray<Value>;
-  readonly group: string | null;
-};
-declare const start: <Value>(present: Value) => HistoryModel<Value>;
-declare const push: <Value>(model: HistoryModel<Value>, value: Value, options: {
-  readonly capacity: number;
-  readonly group?: string | null | undefined;
-}) => HistoryModel<Value>;
-declare const undo: <Value>(model: HistoryModel<Value>) => HistoryModel<Value>;
-declare const redo: <Value>(model: HistoryModel<Value>) => HistoryModel<Value>;
-declare const goTo: <Value>(model: HistoryModel<Value>, step: number) => HistoryModel<Value>;
-declare const clear: <Value>(model: HistoryModel<Value>) => HistoryModel<Value>;
-declare const close: <Value>(model: HistoryModel<Value>) => HistoryModel<Value>;
-declare const revert: <Value>(model: HistoryModel<Value>, group: string) => HistoryModel<Value>;
-/** Whether Undo would move: the past is non-empty. */
-export declare const canUndo: <Value>(model: HistoryModel<Value>) => boolean;
-/** Whether Redo would move: the future is non-empty. */
-export declare const canRedo: <Value>(model: HistoryModel<Value>) => boolean;
-/** The steps of a history as pure functions of its Model. */
-export declare const History: {
-  /** A history whose present is `value`, with nothing to undo. */
-  start: typeof start;
-  /** Records `value` as the present; the same `group` as the last push joins its step. */
-  push: typeof push;
-  /** One step back, or the Model as it was when there is none. */
-  undo: typeof undo;
-  /** One step forward, or the Model as it was when there is none. */
-  redo: typeof redo;
-  /**
-   * The value at `step` made the present, counting every kept value from the
-   * oldest (0), so the present is at `past.length`: what a click on a step's
-   * thumbnail does. The Model as it was for the present or a step not kept.
-   */
-  goTo: typeof goTo;
-  /** Nothing to undo or redo, the present kept. */
-  clear: typeof clear;
-  /** The next push starts a step of its own, whatever its group: a group ends here. */
-  close: typeof close;
-  /**
-   * The step `group` is making taken back, and not redoable: what a cancelled
-   * edit, or one that ended where it began, leaves. The Model as it was when
-   * the last push was not of `group`. What the group's first push dropped
-   * stays dropped: the redo future it cleared, and an entry capacity evicted;
-   * with a capacity of 0 nothing was kept, so the present stays and only the
-   * group ends.
-   */
-  revert: typeof revert;
-  canUndo: typeof canUndo;
-  canRedo: typeof canRedo;
-};
-/**
- * Undo/redo as a bundle factory: the past, present, and future of one value
- * live in the Model, so every step replays. Pushing records, even an unchanged
- * value; skipping duplicates is the application's policy, not the stack's.
- *
- * A push may name a `group`. Consecutive pushes of the same group are one step:
- * the present moves and nothing new is recorded, so typing a word undoes as a
- * whole. Grouping needs no clock; the application names what belongs together.
- *
- * The steps are also pure functions (`History.push`, `undo`, `redo`, `goTo`, `clear`),
- * for a parent that records an edit in the same transition that makes it
- * rather than dispatching a Message to a placed bundle.
- */
-export declare const history: <const Name extends string, Value>(config: {
-  readonly name: Name;
-  readonly value: Schema.Codec<Value, unknown>;
-  readonly capacity?: number | undefined;
-}) => Bundle.Bundle<Name, {
-  readonly initial: Value;
-}, HistoryModel<Value>, {
-  readonly _tag: "Clear";
-} | {
-  readonly _tag: "GoTo";
-  readonly step: number;
-} | {
-  readonly _tag: "Push";
-  readonly value: Value;
-  readonly group?: string | undefined;
-} | {
-  readonly _tag: "Redo";
-} | {
-  readonly _tag: "Undo";
-}, never, never, never, void, {}, {}> & {
-  Message: import("foldkit/message").MessageUnion<{
-    readonly Push: {
-      value: Schema.Codec<Value, unknown, never, never>;
-      group: Schema.optional<Schema.String>;
-    };
-    readonly Undo: {};
-    readonly Redo: {};
-    readonly GoTo: {
-      step: Schema.Number;
-    };
-    readonly Clear: {};
-  }>;
-};
-export declare const LocaleModel: Schema.Struct<{
-  readonly locale: Schema.String;
-}>;
-export type LocaleModel = typeof LocaleModel.Type;
-export declare const LocaleMessage: import("foldkit/message").MessageUnion<{
-  readonly SetLocale: {
-    locale: Schema.String;
-  };
-}>;
-export type LocaleMessage = typeof LocaleMessage.Type;
-/**
- * Locale as a bundle: the current locale string in the Model. Starts from
- * `navigator.language` where available, falling back to the configured
- * default; changes arrive as Messages. No subscriptions: language changes
- * take effect on reload.
- */
-export declare const Locale: Bundle.Bundle<"Locale", {
-  readonly default: string;
-}, {
-  readonly locale: string;
-}, {
-  readonly _tag: "SetLocale";
-  readonly locale: string;
-}, never, never, never, void, {}, {}>;
-export declare const PaginationModel: Schema.Struct<{
-  readonly page: Schema.Number;
-  readonly perPage: Schema.Number;
-  readonly total: Schema.NullOr<Schema.Number>;
-}>;
-export type PaginationModel = typeof PaginationModel.Type;
-export declare const PaginationMessage: import("foldkit/message").MessageUnion<{
-  readonly GoToPage: {
-    page: Schema.Number;
-  };
-  readonly NextPage: {};
-  readonly PrevPage: {};
-  readonly SetPerPage: {
-    perPage: Schema.Number;
-  };
-  readonly SetTotal: {
-    total: Schema.NullOr<Schema.Number>;
-  };
-}>;
-export type PaginationMessage = typeof PaginationMessage.Type;
-/** The number of pages, or null while the total is unknown. */
-export declare const pageCount: (model: PaginationModel) => number | null;
-/** The offset of the first item on the page, for a slice or a query. */
-export declare const offset: (model: PaginationModel) => number;
-/**
- * Pagination as a bundle: the page, page size, and total live in the Model,
- * so page changes replay and every transition clamps into range. Pure logic,
- * no streams: data loading stays the application's job.
- */
-export declare const Pagination: Bundle.Bundle<"Pagination", {
-  readonly perPage: number;
-  readonly total?: number | null | undefined;
-}, {
-  readonly page: number;
-  readonly perPage: number;
-  readonly total: number | null;
-}, {
-  readonly _tag: "GoToPage";
-  readonly page: number;
-} | {
-  readonly _tag: "NextPage";
-} | {
-  readonly _tag: "PrevPage";
-} | {
-  readonly _tag: "SetPerPage";
-  readonly perPage: number;
-} | {
-  readonly _tag: "SetTotal";
-  readonly total: number | null;
-}, never, never, never, void, {}, {}>;
-/**
- * A numeric range as an array: `range(1, 4)` is `[1, 2, 3]`, inclusive of
- * the start and exclusive of the end, like `Array.from` length math. The
- * pagination companion: `range(1, (pageCount(model) ?? 0) + 1)` is the page
- * list. A zero or non-finite step would loop forever, so it throws, naming
- * the caller — like History's capacity check.
- */
-export declare const range: (start: number, end: number, step?: number) => ReadonlyArray<number>;
-export declare const SelectionSetModel: Schema.Struct<{
-  readonly selected: Schema.$Array<Schema.String>;
-}>;
-export type SelectionSetModel = typeof SelectionSetModel.Type;
-export declare const SelectionSetMessage: import("foldkit/message").MessageUnion<{
-  readonly Select: {
-    id: Schema.String;
-  };
-  readonly Deselect: {
-    id: Schema.String;
-  };
-  readonly Toggle: {
-    id: Schema.String;
-  };
-  readonly ReplaceAll: {
-    ids: Schema.$Array<Schema.String>;
-  };
-  readonly Clear: {};
-}>;
-export type SelectionSetMessage = typeof SelectionSetMessage.Type;
-/** Whether the id is currently selected. */
-export declare const isSelected: (model: SelectionSetModel, id: string) => boolean;
-/**
- * A selection set as a bundle: the selected ids in the Model, changed one at
- * a time or replaced whole. Order follows first selection; toggling moves a
- * reselected id to the end. Pure logic, no streams.
- */
-export declare const SelectionSet: Bundle.Bundle<"SelectionSet", void, {
-  readonly selected: readonly string[];
-}, {
-  readonly _tag: "Clear";
-} | {
-  readonly _tag: "Deselect";
-  readonly id: string;
-} | {
-  readonly _tag: "ReplaceAll";
-  readonly ids: readonly string[];
-} | {
-  readonly _tag: "Select";
-  readonly id: string;
-} | {
-  readonly _tag: "Toggle";
-  readonly id: string;
-}, never, never, never, void, {}, {}>;
-/** The rows to draw: a half-open range of indexes. */
-export interface VirtualWindow {
-  /** First visible row index, inclusive. */
-  readonly start: number;
-  /** End row index, exclusive. */
-  readonly end: number;
-}
-/** Layout constants: per-row estimate, inter-row gap, and end padding. */
-export interface VirtualLayout {
-  readonly estimatedHeight: number;
-  readonly gap: number;
-  readonly paddingStart: number;
-  readonly paddingEnd: number;
-}
-/** Total scrollable height: padding, measured rows, estimates, and gaps. */
-export declare const totalHeight: (keys: ReadonlyArray<string>, heights: Readonly<Record<string, number>>, layout: VirtualLayout) => number;
-/** Pixel offset of a row's top edge: padding plus the prefix before it. */
-export declare const offsetFor: (index: number, keys: ReadonlyArray<string>, heights: Readonly<Record<string, number>>, layout: VirtualLayout) => number;
-/**
- * Which rows to render for a scroll position: the rows intersecting
- * `[scrollTop, scrollTop + viewportHeight)`, widened by `overscan` on both
- * sides and clamped to `[0, count]`. Gaps and padding are dead space — no
- * row — so boxes are tested, not cumulative coverage. An overscan of zero
- * renders exactly the visible rows.
- */
-export declare const visibleRange: (keys: ReadonlyArray<string>, heights: Readonly<Record<string, number>>, layout: VirtualLayout, scrollTop: number, viewportHeight: number, overscan: number) => VirtualWindow;
-export declare const VirtualModel: Schema.Struct<{
-  readonly scrollTop: Schema.Number;
-  readonly heights: Schema.$Record<Schema.String, Schema.Number>;
-  readonly scrolling: Schema.Boolean;
-  readonly generation: Schema.Number;
-  readonly estimatedHeight: Schema.Number;
-  readonly overscan: Schema.Number;
-  readonly gap: Schema.Number;
-  readonly paddingStart: Schema.Number;
-  readonly paddingEnd: Schema.Number;
-}>;
-export type VirtualModel = typeof VirtualModel.Type;
-export declare const VirtualMessage: import("foldkit/message").MessageUnion<{
-  readonly Scrolled: {
-    top: Schema.Number;
-  };
-  readonly Measured: {
-    key: Schema.String;
-    height: Schema.Number;
-  };
-  /** Drops heights for keys no longer listed: the bundle never sees the key
-      order, so the application tells it what left. */
-  readonly Prune: {
-    keys: Schema.$Array<Schema.String>;
-  };
-  /** Fires when scrolling has been silent for `settleMs`: only the latest
-      generation counts, so a fling's intermediate timers emit nothing. */
-  readonly Settled: {
-    generation: Schema.Number;
-  };
-}>;
-export type VirtualMessage = typeof VirtualMessage.Type;
-/**
- * The rows to render plus the spacer height, from the Model, the key order,
- * and the viewport height. Layout and overscan come from the Model, so the
- * call cannot disagree with the placement. Keys stay the application's:
- * render each row keyed, and per-row placements keep identity.
- */
-export declare const windowFor: (model: VirtualModel, keys: ReadonlyArray<string>, viewportHeight: number) => VirtualWindow & {
-  readonly totalHeight: number;
-};
-/**
- * Pixels from the viewport's bottom edge to the content's end: negative
- * past it, zero exactly there. Prefetch thresholds want this number ("load
- * when within 500px"), not just the boolean below.
- */
-export declare const distanceToEnd: (model: VirtualModel, keys: ReadonlyArray<string>, viewportHeight: number) => number;
-/**
- * Whether the viewport rests at (or past) the end, within `threshold`
- * pixels: the infinite-scroll check. An empty list counts as ended — there
- * is nothing to scroll, so more should load. Thresholds below zero clamp
- * to zero.
- */
-export declare const isAtEnd: (model: VirtualModel, keys: ReadonlyArray<string>, viewportHeight: number, threshold?: number) => boolean;
-/**
- * Windowing math for virtualized lists as pure functions: which rows to
- * render, how tall the scrollable area is, and where each row starts. Row
- * heights come from measured values with a per-row estimate fallback, so
- * unmeasured rows still occupy space and measuring later only corrects.
- * Keys are strings; heights are non-negative, and non-finite measurements
- * fall back to the estimate instead of poisoning the sums.
- *
- * The `Virtual` bundle below owns the scroll position and the measured
- * heights; `Viewport` reports container scrolls and `MeasureRow` reports
- * row heights, both as Mounts on the elements they observe. The application
- * renders `windowFor(...)` rows with its own views (keyed, so `each`
- * placements keep identity) inside a spacer of `totalHeight(...)`.
- */
-export declare const Virtual: Bundle.Bundle<"Virtual", {
-  readonly estimatedHeight: number;
-  readonly overscan: number;
-  readonly gap: number;
-  readonly paddingStart: number;
-  readonly paddingEnd: number;
-  readonly settleMs?: number | undefined;
-  readonly initialScrollTop?: number | undefined;
-  readonly initialHeights?: Readonly<Record<string, number>> | undefined;
-}, {
-  readonly scrollTop: number;
-  readonly heights: {
-    readonly [x: string]: number;
-  };
-  readonly scrolling: boolean;
-  readonly generation: number;
-  readonly estimatedHeight: number;
-  readonly overscan: number;
-  readonly gap: number;
-  readonly paddingStart: number;
-  readonly paddingEnd: number;
-}, {
-  readonly _tag: "Measured";
-  readonly key: string;
-  readonly height: number;
-} | {
-  readonly _tag: "Prune";
-  readonly keys: readonly string[];
-} | {
-  readonly _tag: "Scrolled";
-  readonly top: number;
-} | {
-  readonly _tag: "Settled";
-  readonly generation: number;
-}, never, never, never, void, {}, {}>;
-export declare const ViewportScrolled: Schema.TaggedStruct<"ViewportScrolled", {
-  readonly top: Schema.Number;
-}>;
-export type ViewportScrolled = typeof ViewportScrolled.Type;
-/**
- * The scroll container's position, reported on its own scrolls starting
- * with the current one. Attach to the scrolling element — viewport scrolls
- * arrive through the window-level scroll entry instead.
- */
-export declare const Viewport: Mount.MountDefinitionNoArgs<"Viewport", {
-  readonly _tag: "ViewportScrolled";
-  readonly top: number;
-}>;
-export declare const RowMeasured: Schema.TaggedStruct<"RowMeasured", {
-  readonly key: Schema.String;
-  readonly height: Schema.Number;
-}>;
-export type RowMeasured = typeof RowMeasured.Type;
-/**
- * One row's height, reported on every resize starting with the current
- * one. The key is the application's row identity, echoed back so the
- * parent files the height without tracking which Mount sent what.
- */
-export declare const MeasureRow: Mount.MountDefinitionWithArgs<"MeasureRow", {
-  key: Schema.String;
-}, {
-  readonly _tag: "RowMeasured";
-  readonly key: string;
-  readonly height: number;
-}>;
-/**
- * Which section header sticks for a window: the last section starting at
- * or before the first rendered row, or null above the first section. Order
- * independent — the scan takes the maximum, so unsorted input still
- * answers. CSS `position: sticky` does the sticking; this answers *what*
- * sticks, for styling and callbacks.
- */
-export declare const stickyHeader: (sections: ReadonlyArray<{
-  readonly key: string;
-  readonly index: number;
-}>, startIndex: number) => string | null;
-/** Where `masonry` puts one item: its column and its box, in pixels. */
-export interface MasonryPlacement {
-  readonly key: string;
-  readonly column: number;
-  readonly x: number;
-  readonly y: number;
-  readonly width: number;
-  readonly height: number;
-}
-/**
- * Masonry layout as a pure function: fixed column count and width, each
- * item packed into the currently shortest column. Unmeasured items use the
- * estimate; poisoned heights fall back the same way. This is layout only,
- * not windowing — every placed item renders, so it fits hundreds of images,
- * not hundred-thousands. Needing a windowed grid is a different algorithm.
- */
-export declare const masonry: (keys: ReadonlyArray<string>, heights: Readonly<Record<string, number>>, options: {
-  readonly columns: number;
-  readonly columnWidth: number;
-  readonly gap: number;
-  readonly estimatedHeight: number;
-}) => {
-  readonly placements: ReadonlyArray<MasonryPlacement>;
-  readonly totalHeight: number;
-};
-export {};
-//# sourceMappingURL=index.d.mts.map

package/dist/state/index.d.mts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.mts","names":[],"sources":["../../src/state/history.ts","../../src/state/locale.ts","../../src/state/pagination.ts","../../src/state/range.ts","../../src/state/selection.ts","../../src/state/virtual.ts"],"mappings":";;;qBAIa,eAAgB,OAAK,OAAS,OAAO,MAAM,oBAAe,OAAA;;;;;;;YAQ3D,aAAa;WACd,MAAM,cAAc;WACpB,SAAS;WACT,QAAQ,cAAc;WACtB;;cAGL,QAAS,OAAK,SAAW,UAAQ,aAAa;cAe9C,OAAQ,OAAK,OACV,aAAa,QAAM,OACnB,OAAK;WACQ;WAA2B;MAC9C,aAAa;cAcV,OAAQ,OAAK,OAAS,aAAa,WAAS,aAAa;cAWzD,OAAQ,OAAK,OAAS,aAAa,WAAS,aAAa;cAWzD,OAAQ,OAAK,OAAS,aAAa,QAAM,iBAAiB,aAAa;cAYvE,QAAS,OAAK,OAAS,aAAa,WAAS,aAAa;cAK1D,QAAS,OAAK,OAAS,aAAa,WAAS,aAAa;cAG1D,SAAU,OAAK,OAAS,aAAa,QAAM,kBAAkB,aAAa;;qBAanE,UAAW,OAAK,OAAS,aAAa;;qBAGtC,UAAW,OAAK,OAAS,aAAa;;qBAGtC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;qBA6CA,gBAAiB,qBAAqB,OAAK;WAC7C,MAAM;WACN,OAAO,OAAO,MAAM;WACpB;MACV,OAAA,OAAA;;;;;;;;;;;;;;;;;;MAIW,OAAK,OAAA,MAAA;MAAgB,OAAK,OAAA,SAAA,OAAA;;;;;MAG1B,MAAI,OAAA;;;;;qBCrKH,aAAW,OAAA;;;YACZ,qBAAqB,YAAY;qBAEhC,yCAAa;;IAAqC,QAAM,OAAA;;;YACzD,uBAAuB,cAAc;;;;;;;qBAQpC,QAAM,OAAA;;;;;;;;qBCXN,iBAAe,OAAA;;;;;YAKhB,yBAAyB,gBAAgB;qBAExC,6CAAiB;;IAChB,MAAI,OAAA;;;;;IAGF,SAAO,OAAA;;;IACT,OAAK,OAAA,OAAA,OAAA;;;YAEP,2BAA2B,kBAAkB;;qBAU5C,YAAS,OAAW;;qBAIpB,SAAM,OAAW;;;;;;qBAOjB,YAAU,OAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;qBCjCV,QAAK,eAAiB,aAAa,kBAAa;qBCFhD,mBAAiB,OAAA;;;YAClB,2BAA2B,kBAAkB;qBAE5C,+CAAmB;;IACpB,IAAE,OAAA;;;IACA,IAAE,OAAA;;;IACJ,IAAE,OAAA;;;IACE,KAAG,OAAA,OAAA,OAAA;;;;YAGP,6BAA6B,oBAAoB;;qBAMhD,aAAU,OAAW,mBAAiB;;;;;;qBAQtC,cAAY,OAAA;;;;;;;;;;;;;;;;;;iBCtBR;;WAEN;;WAEA;;;iBAIM;WACN;WACA;WACA;WACA;;;qBAmEE,cAAW,MAChB,uBAAqB,SAClB,SAAS,yBAAuB,QACjC;;qBAcG,YAAS,eACP,MACP,uBAAqB,SAClB,SAAS,yBAAuB,QACjC;;;;;;;;qBAUG,eAAY,MACjB,uBAAqB,SAClB,SAAS,yBAAuB,QACjC,eAAa,mBACJ,wBACK,qBAErB;qBAmBU,cAAY,OAAA;;;;;;;;;;;YAWb,sBAAsB,aAAa;qBAElC,0CAAc;;IACb,KAAG,OAAA;;;IACH,KAAG,OAAA;IAAiB,QAAM,OAAA;;;;;IAG7B,MAAI,OAAA,OAAA,OAAA;;;;;IAGF,YAAU,OAAA;;;YAEX,wBAAwB,eAAe;;;;;;;qBAetC,YAAS,OACb,cAAY,MACb,uBAAqB,2BAE1B;WAA2B;;;;;;;qBAkBjB,gBAAa,OACjB,cAAY,MACb,uBAAqB;;;;;;;qBAahB,UAAO,OACX,cAAY,MACb,uBAAqB,wBACL;;;;;;;;;;;;;;;qBA2BX,SAAO,OAAA;WAKU;WACP;WACL;WACS;WACF;WACD;WACQ;WACF,iBAAA,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;;;qBAyG1B,kBAAgB,OAAA;;;YACjB,0BAA0B,iBAAiB;;;;;;qBAO1C,UAAQ,MAAA;;;;qBAeR,aAAW,OAAA;;;;YAIZ,qBAAqB,YAAY;;;;;;qBAShC,YAAU,MAAA;;;;;;;;;;;;;;qBAgCV,eAAY,UACb;WAAyB;WAAsB;IAAgB;;iBAe1D;WACN;WACA;WACA;WACA;WACA;WACA;;;;;;;;;qBAUE,UAAO,MACZ,uBAAqB,SAClB,SAAS,yBAAuB;WAE9B;WACA;WACA;WACA;;WAEC,YAAY,cAAc;WAA4B"}

package/dist/state/index.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs","names":[],"sources":["../../src/state/history.ts","../../src/state/locale.ts","../../src/state/pagination.ts","../../src/state/range.ts","../../src/state/selection.ts","../../src/state/virtual.ts"],"sourcesContent":["import { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\n\nexport const HistoryModel = <Value>(value: Schema.Codec<Value, unknown>) =>\n  Schema.Struct({\n    past: Schema.Array(value),\n    present: value,\n    future: Schema.Array(value),\n    /** The group of the last push, so the next push of the same group joins it; `null` for none. */\n    group: Schema.NullOr(Schema.String),\n  })\nexport type HistoryModel<Value> = {\n  readonly past: ReadonlyArray<Value>\n  readonly present: Value\n  readonly future: ReadonlyArray<Value>\n  readonly group: string | null\n}\n\nconst start = <Value>(present: Value): HistoryModel<Value> => ({\n  past: [],\n  present,\n  future: [],\n  group: null,\n})\n\n/**\n * No redo steps, keeping an already empty future: a view that reads the\n * future compares it by identity, so a push per keystroke or stroke cell\n * must not hand it a new empty array each time.\n */\nconst noFuture = <Value>(model: HistoryModel<Value>): ReadonlyArray<Value> =>\n  model.future.length === 0 ? model.future : []\n\nconst push = <Value>(\n  model: HistoryModel<Value>,\n  value: Value,\n  options: { readonly capacity: number; readonly group?: string | null | undefined },\n): HistoryModel<Value> => {\n  const group = options.group ?? null\n  // The same group again joins the last step: the present moves, the past stays.\n  if (group !== null && group === model.group && model.past.length > 0)\n    return { ...model, present: value, future: noFuture(model) }\n  return {\n    // slice(-0) is slice(0): a zero capacity keeps nothing, explicitly.\n    past: options.capacity === 0 ? [] : [...model.past, model.present].slice(-options.capacity),\n    present: value,\n    future: noFuture(model),\n    group,\n  }\n}\n\nconst undo = <Value>(model: HistoryModel<Value>): HistoryModel<Value> => {\n  const previous = model.past[model.past.length - 1]\n  if (previous === undefined) return model\n  return {\n    past: model.past.slice(0, -1),\n    present: previous,\n    future: [model.present, ...model.future],\n    group: null,\n  }\n}\n\nconst redo = <Value>(model: HistoryModel<Value>): HistoryModel<Value> => {\n  const next = model.future[0]\n  if (next === undefined) return model\n  return {\n    past: [...model.past, model.present],\n    present: next,\n    future: model.future.slice(1),\n    group: null,\n  }\n}\n\nconst goTo = <Value>(model: HistoryModel<Value>, step: number): HistoryModel<Value> => {\n  const steps = [...model.past, model.present, ...model.future]\n  if (!Number.isInteger(step) || step < 0 || step >= steps.length || step === model.past.length)\n    return model\n  return {\n    past: steps.slice(0, step),\n    present: steps[step]!,\n    future: steps.slice(step + 1),\n    group: null,\n  }\n}\n\nconst clear = <Value>(model: HistoryModel<Value>): HistoryModel<Value> =>\n  model.past.length === 0 && model.future.length === 0 && model.group === null\n    ? model\n    : start(model.present)\n\nconst close = <Value>(model: HistoryModel<Value>): HistoryModel<Value> =>\n  model.group === null ? model : { ...model, group: null }\n\nconst revert = <Value>(model: HistoryModel<Value>, group: string): HistoryModel<Value> =>\n  // The group is ended even where there is nothing to take back (capacity 0).\n  model.group === group ? { ...undo(model), future: [], group: null } : model\n\nconst checkCapacity = (name: string, capacity: number): number => {\n  // A negative or fractional capacity would silently keep a wrong-sized past;\n  // fail where it is given, naming the caller, instead.\n  if (!Number.isInteger(capacity) || capacity < 0)\n    throw new Error(`History \"${name}\": capacity must be a non-negative integer`)\n  return capacity\n}\n\n/** Whether Undo would move: the past is non-empty. */\nexport const canUndo = <Value>(model: HistoryModel<Value>): boolean => model.past.length > 0\n\n/** Whether Redo would move: the future is non-empty. */\nexport const canRedo = <Value>(model: HistoryModel<Value>): boolean => model.future.length > 0\n\n/** The steps of a history as pure functions of its Model. */\nexport const History = {\n  /** A history whose present is `value`, with nothing to undo. */\n  start,\n  /** Records `value` as the present; the same `group` as the last push joins its step. */\n  push,\n  /** One step back, or the Model as it was when there is none. */\n  undo,\n  /** One step forward, or the Model as it was when there is none. */\n  redo,\n  /**\n   * The value at `step` made the present, counting every kept value from the\n   * oldest (0), so the present is at `past.length`: what a click on a step's\n   * thumbnail does. The Model as it was for the present or a step not kept.\n   */\n  goTo,\n  /** Nothing to undo or redo, the present kept. */\n  clear,\n  /** The next push starts a step of its own, whatever its group: a group ends here. */\n  close,\n  /**\n   * The step `group` is making taken back, and not redoable: what a cancelled\n   * edit, or one that ended where it began, leaves. The Model as it was when\n   * the last push was not of `group`. What the group's first push dropped\n   * stays dropped: the redo future it cleared, and an entry capacity evicted;\n   * with a capacity of 0 nothing was kept, so the present stays and only the\n   * group ends.\n   */\n  revert,\n  canUndo,\n  canRedo,\n}\n\n/**\n * Undo/redo as a bundle factory: the past, present, and future of one value\n * live in the Model, so every step replays. Pushing records, even an unchanged\n * value; skipping duplicates is the application's policy, not the stack's.\n *\n * A push may name a `group`. Consecutive pushes of the same group are one step:\n * the present moves and nothing new is recorded, so typing a word undoes as a\n * whole. Grouping needs no clock; the application names what belongs together.\n *\n * The steps are also pure functions (`History.push`, `undo`, `redo`, `goTo`, `clear`),\n * for a parent that records an edit in the same transition that makes it\n * rather than dispatching a Message to a placed bundle.\n */\nexport const history = <const Name extends string, Value>(config: {\n  readonly name: Name\n  readonly value: Schema.Codec<Value, unknown>\n  readonly capacity?: number | undefined\n}) => {\n  const capacity = checkCapacity(config.name, config.capacity ?? 100)\n  const Model = HistoryModel(config.value)\n  const Message = defineMessageUnion({\n    Push: { value: config.value, group: Schema.optional(Schema.String) },\n    Undo: {},\n    Redo: {},\n    GoTo: { step: Schema.Number },\n    Clear: {},\n  })\n  return Object.assign(\n    Bundle.make(config.name, {\n      Model,\n      Message,\n      args: Schema.Struct({ initial: config.value }),\n      init: args => ({ model: start(args.initial) }),\n      update: (model, message) =>\n        Message.match(message, {\n          Push: ({ value, group }) => ({ model: push(model, value, { capacity, group }) }),\n          Undo: () => ({ model: undo(model) }),\n          Redo: () => ({ model: redo(model) }),\n          GoTo: ({ step }) => ({ model: goTo(model, step) }),\n          Clear: () => ({ model: clear(model) }),\n        }),\n    }),\n    // The union object is both the Message codec and its constructors, so a\n    // placement dispatches `EditHistory.Message.Push(...)` like any bundle's\n    // exported Message.\n    { Message },\n  )\n}\n","import { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\n\nexport const LocaleModel = Schema.Struct({ locale: Schema.String })\nexport type LocaleModel = typeof LocaleModel.Type\n\nexport const LocaleMessage = defineMessageUnion({ SetLocale: { locale: Schema.String } })\nexport type LocaleMessage = typeof LocaleMessage.Type\n\n/**\n * Locale as a bundle: the current locale string in the Model. Starts from\n * `navigator.language` where available, falling back to the configured\n * default; changes arrive as Messages. No subscriptions: language changes\n * take effect on reload.\n */\nexport const Locale = Bundle.make('Locale', {\n  Model: LocaleModel,\n  Message: LocaleMessage,\n  args: Schema.Struct({ default: Schema.String }),\n  init: args => ({\n    model: {\n      locale:\n        typeof navigator !== 'undefined' && typeof navigator.language === 'string'\n          ? navigator.language\n          : args.default,\n    },\n  }),\n  update: (model, message) =>\n    LocaleMessage.match(message, {\n      SetLocale: ({ locale }) =>\n        locale === model.locale ? { model } : { model: { ...model, locale } },\n    }),\n})\n","import { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\nimport { unlessSame } from '../internal.js'\n\nexport const PaginationModel = Schema.Struct({\n  page: Schema.Number,\n  perPage: Schema.Number,\n  total: Schema.NullOr(Schema.Number),\n})\nexport type PaginationModel = typeof PaginationModel.Type\n\nexport const PaginationMessage = defineMessageUnion({\n  GoToPage: { page: Schema.Number },\n  NextPage: {},\n  PrevPage: {},\n  SetPerPage: { perPage: Schema.Number },\n  SetTotal: { total: Schema.NullOr(Schema.Number) },\n})\nexport type PaginationMessage = typeof PaginationMessage.Type\n\nconst clampPage = (page: number, perPage: number, total: number | null): number => {\n  if (!Number.isInteger(page)) return 1\n  if (page < 1) return 1\n  if (total === null) return page\n  return Math.min(page, Math.max(1, Math.ceil(total / perPage)))\n}\n\n/** The number of pages, or null while the total is unknown. */\nexport const pageCount = (model: PaginationModel): number | null =>\n  model.total === null ? null : Math.max(1, Math.ceil(model.total / model.perPage))\n\n/** The offset of the first item on the page, for a slice or a query. */\nexport const offset = (model: PaginationModel): number => (model.page - 1) * model.perPage\n\n/**\n * Pagination as a bundle: the page, page size, and total live in the Model,\n * so page changes replay and every transition clamps into range. Pure logic,\n * no streams: data loading stays the application's job.\n */\nexport const Pagination = Bundle.make('Pagination', {\n  Model: PaginationModel,\n  Message: PaginationMessage,\n  args: Schema.Struct({\n    perPage: Schema.Number.pipe(\n      Schema.check(Schema.isGreaterThan(0)),\n      Schema.check(Schema.isFinite()),\n    ),\n    total: Schema.optional(Schema.NullOr(Schema.Number.pipe(Schema.check(Schema.isFinite())))),\n  }),\n  init: args => ({\n    model: { page: 1, perPage: args.perPage, total: args.total ?? null },\n  }),\n  update: (model, message) =>\n    PaginationMessage.match(message, {\n      GoToPage: ({ page }) => ({\n        model: unlessSame(model, { ...model, page: clampPage(page, model.perPage, model.total) }),\n      }),\n      NextPage: () => ({\n        model: unlessSame(model, {\n          ...model,\n          page: clampPage(model.page + 1, model.perPage, model.total),\n        }),\n      }),\n      PrevPage: () => ({\n        model: unlessSame(model, {\n          ...model,\n          page: clampPage(model.page - 1, model.perPage, model.total),\n        }),\n      }),\n      SetPerPage: ({ perPage }) =>\n        perPage > 0\n          ? {\n              model: unlessSame(model, {\n                ...model,\n                perPage,\n                page: clampPage(model.page, perPage, model.total),\n              }),\n            }\n          : { model },\n      // Sent again on every refetch, usually with the total already held.\n      SetTotal: ({ total }) =>\n        total === null || total >= 0\n          ? {\n              model: unlessSame(model, {\n                ...model,\n                total,\n                page: clampPage(model.page, model.perPage, total),\n              }),\n            }\n          : { model },\n    }),\n})\n","/**\n * A numeric range as an array: `range(1, 4)` is `[1, 2, 3]`, inclusive of\n * the start and exclusive of the end, like `Array.from` length math. The\n * pagination companion: `range(1, (pageCount(model) ?? 0) + 1)` is the page\n * list. A zero or non-finite step would loop forever, so it throws, naming\n * the caller — like History's capacity check.\n */\nexport const range = (start: number, end: number, step = 1): ReadonlyArray<number> => {\n  if (!Number.isFinite(step) || step === 0) {\n    throw new Error(`range: step must be a non-zero finite number, got ${step}`)\n  }\n  const values: Array<number> = []\n  if (step > 0) {\n    for (let value = start; value < end; value += step) {\n      values.push(value)\n    }\n  } else {\n    for (let value = start; value > end; value += step) {\n      values.push(value)\n    }\n  }\n  return values\n}\n","import { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\nimport { sameIds } from '../internal.js'\n\nexport const SelectionSetModel = Schema.Struct({ selected: Schema.Array(Schema.String) })\nexport type SelectionSetModel = typeof SelectionSetModel.Type\n\nexport const SelectionSetMessage = defineMessageUnion({\n  Select: { id: Schema.String },\n  Deselect: { id: Schema.String },\n  Toggle: { id: Schema.String },\n  ReplaceAll: { ids: Schema.Array(Schema.String) },\n  Clear: {},\n})\nexport type SelectionSetMessage = typeof SelectionSetMessage.Type\n\nconst without = (selected: ReadonlyArray<string>, id: string): ReadonlyArray<string> =>\n  selected.filter(other => other !== id)\n\n/** Whether the id is currently selected. */\nexport const isSelected = (model: SelectionSetModel, id: string): boolean =>\n  model.selected.includes(id)\n\n/**\n * A selection set as a bundle: the selected ids in the Model, changed one at\n * a time or replaced whole. Order follows first selection; toggling moves a\n * reselected id to the end. Pure logic, no streams.\n */\nexport const SelectionSet = Bundle.make('SelectionSet', {\n  Model: SelectionSetModel,\n  Message: SelectionSetMessage,\n  init: () => ({ model: { selected: [] } }),\n  update: (model, message) =>\n    SelectionSetMessage.match(message, {\n      Select: ({ id }) =>\n        isSelected(model, id) ? { model } : { model: { selected: [...model.selected, id] } },\n      Deselect: ({ id }) =>\n        isSelected(model, id) ? { model: { selected: without(model.selected, id) } } : { model },\n      Toggle: ({ id }) =>\n        isSelected(model, id)\n          ? { model: { selected: without(model.selected, id) } }\n          : { model: { selected: [...model.selected, id] } },\n      ReplaceAll: ({ ids }) => {\n        const selected = [...new Set(ids)]\n        return sameIds(selected, model.selected) ? { model } : { model: { selected } }\n      },\n      Clear: () => (model.selected.length === 0 ? { model } : { model: { selected: [] } }),\n    }),\n})\n","import { Effect, Queue, Schema, Stream } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport * as Mount from 'foldkit/mount'\nimport type * as Update from 'foldkit/update'\nimport { Bundle } from 'foldkit-bundle'\n\n/** The rows to draw: a half-open range of indexes. */\nexport interface VirtualWindow {\n  /** First visible row index, inclusive. */\n  readonly start: number\n  /** End row index, exclusive. */\n  readonly end: number\n}\n\n/** Layout constants: per-row estimate, inter-row gap, and end padding. */\nexport interface VirtualLayout {\n  readonly estimatedHeight: number\n  readonly gap: number\n  readonly paddingStart: number\n  readonly paddingEnd: number\n}\n\nconst saneHeight = (height: number, estimatedHeight: number): number =>\n  Number.isFinite(height) && height >= 0 ? height : estimatedHeight\n\nconst heightAt = (\n  index: number,\n  heights: Readonly<Record<string, number>>,\n  keys: ReadonlyArray<string>,\n  layout: VirtualLayout,\n): number => {\n  const key = keys[index]\n  if (key === undefined) return layout.estimatedHeight\n  return saneHeight(heights[key] ?? layout.estimatedHeight, layout.estimatedHeight)\n}\n\ninterface Offsets {\n  readonly heights: Readonly<Record<string, number>>\n  readonly layout: VirtualLayout\n  /** `tops[i]` is row i's top edge; `tops[count]` is past the last row's gap. */\n  readonly tops: Float64Array\n}\n\n// One entry per keys array, replaced when the heights or the layout change: a\n// view that keeps its keys array between renders pays O(n) once per change of\n// heights, not once per call. Keys and heights are compared by identity, so an\n// array or record changed in place reads stale offsets; the Model never is.\nconst offsetsCache = new WeakMap<ReadonlyArray<string>, Offsets>()\n\nconst sameLayout = (a: VirtualLayout, b: VirtualLayout): boolean =>\n  a.estimatedHeight === b.estimatedHeight &&\n  a.gap === b.gap &&\n  a.paddingStart === b.paddingStart &&\n  a.paddingEnd === b.paddingEnd\n\nconst topsFor = (\n  keys: ReadonlyArray<string>,\n  heights: Readonly<Record<string, number>>,\n  layout: VirtualLayout,\n): Float64Array => {\n  const cached = offsetsCache.get(keys)\n  if (cached !== undefined && cached.heights === heights && sameLayout(cached.layout, layout)) {\n    return cached.tops\n  }\n  const tops = new Float64Array(keys.length + 1)\n  tops[0] = layout.paddingStart\n  for (let index = 0; index < keys.length; index++) {\n    tops[index + 1] = tops[index]! + heightAt(index, heights, keys, layout) + layout.gap\n  }\n  offsetsCache.set(keys, { heights, layout: { ...layout }, tops })\n  return tops\n}\n\n/** The first index in `[from, to)` whose value passes `test`, or `to`; `test` must be monotonic. */\nconst firstIndex = (from: number, to: number, test: (index: number) => boolean): number => {\n  let low = from\n  let high = to\n  while (low < high) {\n    const middle = (low + high) >>> 1\n    if (test(middle)) high = middle\n    else low = middle + 1\n  }\n  return low\n}\n\n/** Total scrollable height: padding, measured rows, estimates, and gaps. */\nexport const totalHeight = (\n  keys: ReadonlyArray<string>,\n  heights: Readonly<Record<string, number>>,\n  layout: VirtualLayout,\n): number => {\n  const last = keys.length - 1\n  if (last === -1) return layout.paddingStart + layout.paddingEnd\n  // The last row's bottom edge, not `tops[count]` less a gap: subtracting a\n  // fractional gap back out need not land where the row ends.\n  return (\n    topsFor(keys, heights, layout)[last]! +\n    heightAt(last, heights, keys, layout) +\n    layout.paddingEnd\n  )\n}\n\n/** Pixel offset of a row's top edge: padding plus the prefix before it. */\nexport const offsetFor = (\n  index: number,\n  keys: ReadonlyArray<string>,\n  heights: Readonly<Record<string, number>>,\n  layout: VirtualLayout,\n): number => topsFor(keys, heights, layout)[Math.max(0, Math.min(index, keys.length))]!\n\n/**\n * Which rows to render for a scroll position: the rows intersecting\n * `[scrollTop, scrollTop + viewportHeight)`, widened by `overscan` on both\n * sides and clamped to `[0, count]`. Gaps and padding are dead space — no\n * row — so boxes are tested, not cumulative coverage. An overscan of zero\n * renders exactly the visible rows.\n */\nexport const visibleRange = (\n  keys: ReadonlyArray<string>,\n  heights: Readonly<Record<string, number>>,\n  layout: VirtualLayout,\n  scrollTop: number,\n  viewportHeight: number,\n  overscan: number,\n): VirtualWindow => {\n  const count = keys.length\n  if (count === 0 || viewportHeight <= 0) return { start: 0, end: 0 }\n  const tops = topsFor(keys, heights, layout)\n  const top = Math.max(0, scrollTop)\n  const bottom = top + viewportHeight\n  // Row bottoms and tops only grow with the index, so both edges are searches.\n  const start = firstIndex(\n    0,\n    count,\n    index => tops[index]! + heightAt(index, heights, keys, layout) > top,\n  )\n  const end = firstIndex(start, count, index => tops[index]! >= bottom)\n  return {\n    start: Math.max(0, start - Math.max(0, overscan)),\n    end: Math.min(count, end + Math.max(0, overscan)),\n  }\n}\n\nexport const VirtualModel = Schema.Struct({\n  scrollTop: Schema.Number,\n  heights: Schema.Record(Schema.String, Schema.Number),\n  scrolling: Schema.Boolean,\n  generation: Schema.Number,\n  estimatedHeight: Schema.Number,\n  overscan: Schema.Number,\n  gap: Schema.Number,\n  paddingStart: Schema.Number,\n  paddingEnd: Schema.Number,\n})\nexport type VirtualModel = typeof VirtualModel.Type\n\nexport const VirtualMessage = defineMessageUnion({\n  Scrolled: { top: Schema.Number },\n  Measured: { key: Schema.String, height: Schema.Number },\n  /** Drops heights for keys no longer listed: the bundle never sees the key\n    order, so the application tells it what left. */\n  Prune: { keys: Schema.Array(Schema.String) },\n  /** Fires when scrolling has been silent for `settleMs`: only the latest\n    generation counts, so a fling's intermediate timers emit nothing. */\n  Settled: { generation: Schema.Number },\n})\nexport type VirtualMessage = typeof VirtualMessage.Type\n\nconst layoutOf = (model: VirtualModel): VirtualLayout => ({\n  estimatedHeight: model.estimatedHeight,\n  gap: model.gap,\n  paddingStart: model.paddingStart,\n  paddingEnd: model.paddingEnd,\n})\n\n/**\n * The rows to render plus the spacer height, from the Model, the key order,\n * and the viewport height. Layout and overscan come from the Model, so the\n * call cannot disagree with the placement. Keys stay the application's:\n * render each row keyed, and per-row placements keep identity.\n */\nexport const windowFor = (\n  model: VirtualModel,\n  keys: ReadonlyArray<string>,\n  viewportHeight: number,\n): VirtualWindow & { readonly totalHeight: number } => {\n  const layout = layoutOf(model)\n  const window = visibleRange(\n    keys,\n    model.heights,\n    layout,\n    model.scrollTop,\n    viewportHeight,\n    model.overscan,\n  )\n  return { ...window, totalHeight: totalHeight(keys, model.heights, layout) }\n}\n\n/**\n * Pixels from the viewport's bottom edge to the content's end: negative\n * past it, zero exactly there. Prefetch thresholds want this number (\"load\n * when within 500px\"), not just the boolean below.\n */\nexport const distanceToEnd = (\n  model: VirtualModel,\n  keys: ReadonlyArray<string>,\n  viewportHeight: number,\n): number => {\n  const total = totalHeight(keys, model.heights, layoutOf(model))\n  return total - (model.scrollTop + viewportHeight)\n}\n\n/**\n * Whether the viewport rests at (or past) the end, within `threshold`\n * pixels: the infinite-scroll check. An empty list counts as ended — there\n * is nothing to scroll, so more should load. Thresholds below zero clamp\n * to zero.\n */\nexport const isAtEnd = (\n  model: VirtualModel,\n  keys: ReadonlyArray<string>,\n  viewportHeight: number,\n  threshold = 0,\n): boolean => {\n  const total = totalHeight(keys, model.heights, layoutOf(model))\n  if (total <= 0) return true\n  return total - (model.scrollTop + viewportHeight) <= Math.max(0, threshold)\n}\n\nconst saneTop = (top: number): number | null => (Number.isFinite(top) ? Math.max(0, top) : null)\n\nconst saneMeasured = (height: number): number | null =>\n  Number.isFinite(height) && height >= 0 ? height : null\n\n/**\n * Windowing math for virtualized lists as pure functions: which rows to\n * render, how tall the scrollable area is, and where each row starts. Row\n * heights come from measured values with a per-row estimate fallback, so\n * unmeasured rows still occupy space and measuring later only corrects.\n * Keys are strings; heights are non-negative, and non-finite measurements\n * fall back to the estimate instead of poisoning the sums.\n *\n * The `Virtual` bundle below owns the scroll position and the measured\n * heights; `Viewport` reports container scrolls and `MeasureRow` reports\n * row heights, both as Mounts on the elements they observe. The application\n * renders `windowFor(...)` rows with its own views (keyed, so `each`\n * placements keep identity) inside a spacer of `totalHeight(...)`.\n */\nexport const Virtual = Bundle.make<\n  'Virtual',\n  VirtualModel,\n  VirtualMessage,\n  {\n    readonly estimatedHeight: number\n    readonly overscan: number\n    readonly gap: number\n    readonly paddingStart: number\n    readonly paddingEnd: number\n    readonly settleMs?: number | undefined\n    readonly initialScrollTop?: number | undefined\n    readonly initialHeights?: Readonly<Record<string, number>> | undefined\n  }\n>('Virtual', {\n  Model: VirtualModel,\n  Message: VirtualMessage,\n  args: Schema.Struct({\n    estimatedHeight: Schema.Number.pipe(\n      Schema.check(Schema.isGreaterThan(0)),\n      Schema.check(Schema.isFinite()),\n    ),\n    overscan: Schema.Int.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0))),\n    gap: Schema.Number.pipe(\n      Schema.check(Schema.isGreaterThanOrEqualTo(0)),\n      Schema.check(Schema.isFinite()),\n    ),\n    paddingStart: Schema.Number.pipe(\n      Schema.check(Schema.isGreaterThanOrEqualTo(0)),\n      Schema.check(Schema.isFinite()),\n    ),\n    paddingEnd: Schema.Number.pipe(\n      Schema.check(Schema.isGreaterThanOrEqualTo(0)),\n      Schema.check(Schema.isFinite()),\n    ),\n    settleMs: Schema.optional(\n      Schema.Number.pipe(Schema.check(Schema.isGreaterThan(0)), Schema.check(Schema.isFinite())),\n    ),\n    initialScrollTop: Schema.optional(\n      Schema.Number.pipe(\n        Schema.check(Schema.isGreaterThanOrEqualTo(0)),\n        Schema.check(Schema.isFinite()),\n      ),\n    ),\n    initialHeights: Schema.optional(Schema.Record(Schema.String, Schema.Number)),\n  }),\n  init: args => {\n    // Restored measurements pass through the same sanitation as live ones,\n    // so a poisoned cache cannot wedge the sums.\n    const heights: Record<string, number> = {}\n    for (const [key, height] of Object.entries(args.initialHeights ?? {})) {\n      const sane = saneMeasured(height)\n      if (sane !== null) heights[key] = sane\n    }\n    return {\n      model: {\n        scrollTop: args.initialScrollTop ?? 0,\n        heights,\n        scrolling: false,\n        generation: 0,\n        estimatedHeight: args.estimatedHeight,\n        overscan: args.overscan,\n        gap: args.gap,\n        paddingStart: args.paddingStart,\n        paddingEnd: args.paddingEnd,\n      },\n    }\n  },\n  update: (model, message, args) =>\n    VirtualMessage.match<Update.ReturnWithOutMessage<VirtualModel, VirtualMessage, never>>(\n      message,\n      {\n        Scrolled: ({ top }) => {\n          const sane = saneTop(top)\n          // The Viewport reports the position it mounts at, and a horizontal\n          // scroll reports an unchanged top. The raw top is compared, so an\n          // overscroll past zero still counts as scrolling.\n          if (sane === null || top === model.scrollTop) return { model }\n          const generation = model.generation + 1\n          return {\n            model: { ...model, scrollTop: sane, scrolling: true, generation },\n            commands: [\n              {\n                name: 'Virtual.settle',\n                args: { generation },\n                effect: Effect.as(\n                  Effect.sleep(args.settleMs ?? 150),\n                  VirtualMessage.Settled({ generation }),\n                ),\n              },\n            ],\n          }\n        },\n        Measured: ({ key, height }) => {\n          const sane = saneMeasured(height)\n          // A remounted row, or a width-only resize, reports the height held.\n          return sane === null || (Object.hasOwn(model.heights, key) && model.heights[key] === sane)\n            ? { model }\n            : { model: { ...model, heights: { ...model.heights, [key]: sane } } }\n        },\n        Prune: ({ keys }) => {\n          const kept = new Set(keys)\n          const heights: Record<string, number> = {}\n          let dropped = false\n          for (const [key, height] of Object.entries(model.heights)) {\n            if (kept.has(key)) heights[key] = height\n            else dropped = true\n          }\n          return dropped ? { model: { ...model, heights } } : { model }\n        },\n        // A superseded silence timer carries an old generation: ignore it.\n        Settled: ({ generation }) =>\n          generation === model.generation ? { model: { ...model, scrolling: false } } : { model },\n      },\n    ),\n})\n\nexport const ViewportScrolled = Schema.TaggedStruct('ViewportScrolled', { top: Schema.Number })\nexport type ViewportScrolled = typeof ViewportScrolled.Type\n\n/**\n * The scroll container's position, reported on its own scrolls starting\n * with the current one. Attach to the scrolling element — viewport scrolls\n * arrive through the window-level scroll entry instead.\n */\nexport const Viewport = Mount.defineStream('Viewport', {\n  messages: [ViewportScrolled],\n  execute: ({ element }) => {\n    // The mount needs only a scroll position, not a full Element.\n    const read = (): ViewportScrolled => {\n      const scroller = element as unknown as { readonly scrollTop: number }\n      return ViewportScrolled.make({ top: scroller.scrollTop })\n    }\n    return Stream.concat(\n      Stream.make(read()),\n      Stream.fromEventListener(element, 'scroll').pipe(Stream.map(read)),\n    )\n  },\n})\n\nexport const RowMeasured = Schema.TaggedStruct('RowMeasured', {\n  key: Schema.String,\n  height: Schema.Number,\n})\nexport type RowMeasured = typeof RowMeasured.Type\n\ntype RowObserverCtor = new (callback: ResizeObserverCallback) => ResizeObserver\n\n/**\n * One row's height, reported on every resize starting with the current\n * one. The key is the application's row identity, echoed back so the\n * parent files the height without tracking which Mount sent what.\n */\nexport const MeasureRow = Mount.defineStream('MeasureRow', {\n  messages: [RowMeasured],\n  args: { key: Schema.String },\n  execute: ({ element, key }) =>\n    Stream.callback<typeof RowMeasured.Type>(queue =>\n      Effect.gen(function* () {\n        const Observed = (globalThis as { ResizeObserver?: RowObserverCtor }).ResizeObserver\n        if (Observed === undefined) return\n        yield* Effect.acquireRelease(\n          Effect.sync(() => {\n            const observer = new Observed(entries => {\n              const rect = entries[0]?.contentRect\n              if (rect !== undefined) {\n                Queue.offerUnsafe(queue, RowMeasured.make({ key, height: rect.height }))\n              }\n            })\n            observer.observe(element)\n            return observer\n          }),\n          observer => Effect.sync(() => observer.disconnect()),\n        )\n      }),\n    ),\n})\n\n/**\n * Which section header sticks for a window: the last section starting at\n * or before the first rendered row, or null above the first section. Order\n * independent — the scan takes the maximum, so unsorted input still\n * answers. CSS `position: sticky` does the sticking; this answers *what*\n * sticks, for styling and callbacks.\n */\nexport const stickyHeader = (\n  sections: ReadonlyArray<{ readonly key: string; readonly index: number }>,\n  startIndex: number,\n): string | null => {\n  let current: string | null = null\n  let currentIndex = -1\n  for (const section of sections) {\n    if (section.index <= startIndex && section.index > currentIndex) {\n      current = section.key\n      currentIndex = section.index\n    }\n  }\n  return current\n}\n\n/** Where `masonry` puts one item: its column and its box, in pixels. */\nexport interface MasonryPlacement {\n  readonly key: string\n  readonly column: number\n  readonly x: number\n  readonly y: number\n  readonly width: number\n  readonly height: number\n}\n\n/**\n * Masonry layout as a pure function: fixed column count and width, each\n * item packed into the currently shortest column. Unmeasured items use the\n * estimate; poisoned heights fall back the same way. This is layout only,\n * not windowing — every placed item renders, so it fits hundreds of images,\n * not hundred-thousands. Needing a windowed grid is a different algorithm.\n */\nexport const masonry = (\n  keys: ReadonlyArray<string>,\n  heights: Readonly<Record<string, number>>,\n  options: {\n    readonly columns: number\n    readonly columnWidth: number\n    readonly gap: number\n    readonly estimatedHeight: number\n  },\n): { readonly placements: ReadonlyArray<MasonryPlacement>; readonly totalHeight: number } => {\n  if (!Number.isInteger(options.columns) || options.columns < 1) {\n    throw new Error(`masonry: columns must be a positive integer, got ${options.columns}`)\n  }\n  if (!(options.columnWidth > 0) || !Number.isFinite(options.columnWidth)) {\n    throw new Error(\n      `masonry: columnWidth must be a positive finite number, got ${options.columnWidth}`,\n    )\n  }\n  if (options.gap < 0 || !Number.isFinite(options.gap)) {\n    throw new Error(`masonry: gap must be a non-negative finite number, got ${options.gap}`)\n  }\n  if (options.estimatedHeight < 0 || !Number.isFinite(options.estimatedHeight)) {\n    throw new Error(\n      `masonry: estimatedHeight must be a non-negative finite number, got ${options.estimatedHeight}`,\n    )\n  }\n  const columnHeights: Array<number> = new Array(options.columns).fill(0)\n  const placements: Array<MasonryPlacement> = []\n  for (const key of keys) {\n    const raw = heights[key] ?? options.estimatedHeight\n    const height = Number.isFinite(raw) && raw >= 0 ? raw : options.estimatedHeight\n    let column = 0\n    for (let c = 1; c < columnHeights.length; c++) {\n      if (columnHeights[c]! < columnHeights[column]!) column = c\n    }\n    placements.push({\n      key,\n      column,\n      x: column * (options.columnWidth + options.gap),\n      y: columnHeights[column]!,\n      width: options.columnWidth,\n      height,\n    })\n    columnHeights[column] = columnHeights[column]! + height + options.gap\n  }\n  return {\n    placements,\n    totalHeight: placements.length === 0 ? 0 : Math.max(...columnHeights) - options.gap,\n  }\n}\n"],"mappings":";;;;;;AAIA,MAAa,gBAAuB,UAClC,OAAO,OAAO;CACZ,MAAM,OAAO,MAAM,KAAK;CACxB,SAAS;CACT,QAAQ,OAAO,MAAM,KAAK;;CAE1B,OAAO,OAAO,OAAO,OAAO,MAAM;AACpC,CAAC;AAQH,MAAM,SAAgB,aAAyC;CAC7D,MAAM,CAAC;CACP;CACA,QAAQ,CAAC;CACT,OAAO;AACT;;;;;;AAOA,MAAM,YAAmB,UACvB,MAAM,OAAO,WAAW,IAAI,MAAM,SAAS,CAAC;AAE9C,MAAM,QACJ,OACA,OACA,YACwB;CACxB,MAAM,QAAQ,QAAQ,SAAS;CAE/B,IAAI,UAAU,QAAQ,UAAU,MAAM,SAAS,MAAM,KAAK,SAAS,GACjE,OAAO;EAAE,GAAG;EAAO,SAAS;EAAO,QAAQ,SAAS,KAAK;CAAE;CAC7D,OAAO;EAEL,MAAM,QAAQ,aAAa,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,MAAM,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,QAAQ;EAC1F,SAAS;EACT,QAAQ,SAAS,KAAK;EACtB;CACF;AACF;AAEA,MAAM,QAAe,UAAoD;CACvE,MAAM,WAAW,MAAM,KAAK,MAAM,KAAK,SAAS;CAChD,IAAI,aAAa,KAAA,GAAW,OAAO;CACnC,OAAO;EACL,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE;EAC5B,SAAS;EACT,QAAQ,CAAC,MAAM,SAAS,GAAG,MAAM,MAAM;EACvC,OAAO;CACT;AACF;AAEA,MAAM,QAAe,UAAoD;CACvE,MAAM,OAAO,MAAM,OAAO;CAC1B,IAAI,SAAS,KAAA,GAAW,OAAO;CAC/B,OAAO;EACL,MAAM,CAAC,GAAG,MAAM,MAAM,MAAM,OAAO;EACnC,SAAS;EACT,QAAQ,MAAM,OAAO,MAAM,CAAC;EAC5B,OAAO;CACT;AACF;AAEA,MAAM,QAAe,OAA4B,SAAsC;CACrF,MAAM,QAAQ;EAAC,GAAG,MAAM;EAAM,MAAM;EAAS,GAAG,MAAM;CAAM;CAC5D,IAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,KAAK,QAAQ,MAAM,UAAU,SAAS,MAAM,KAAK,QACrF,OAAO;CACT,OAAO;EACL,MAAM,MAAM,MAAM,GAAG,IAAI;EACzB,SAAS,MAAM;EACf,QAAQ,MAAM,MAAM,OAAO,CAAC;EAC5B,OAAO;CACT;AACF;AAEA,MAAM,SAAgB,UACpB,MAAM,KAAK,WAAW,KAAK,MAAM,OAAO,WAAW,KAAK,MAAM,UAAU,OACpE,QACA,MAAM,MAAM,OAAO;AAEzB,MAAM,SAAgB,UACpB,MAAM,UAAU,OAAO,QAAQ;CAAE,GAAG;CAAO,OAAO;AAAK;AAEzD,MAAM,UAAiB,OAA4B,UAEjD,MAAM,UAAU,QAAQ;CAAE,GAAG,KAAK,KAAK;CAAG,QAAQ,CAAC;CAAG,OAAO;AAAK,IAAI;AAExE,MAAM,iBAAiB,MAAc,aAA6B;CAGhE,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,YAAY,KAAK,2CAA2C;CAC9E,OAAO;AACT;;AAGA,MAAa,WAAkB,UAAwC,MAAM,KAAK,SAAS;;AAG3F,MAAa,WAAkB,UAAwC,MAAM,OAAO,SAAS;;AAG7F,MAAa,UAAU;;CAErB;;CAEA;;CAEA;;CAEA;;;;;;CAMA;;CAEA;;CAEA;;;;;;;;;CASA;CACA;CACA;AACF;;;;;;;;;;;;;;AAeA,MAAa,WAA6C,WAIpD;CACJ,MAAM,WAAW,cAAc,OAAO,MAAM,OAAO,YAAY,GAAG;CAClE,MAAM,QAAQ,aAAa,OAAO,KAAK;CACvC,MAAM,UAAU,mBAAmB;EACjC,MAAM;GAAE,OAAO,OAAO;GAAO,OAAO,OAAO,SAAS,OAAO,MAAM;EAAE;EACnE,MAAM,CAAC;EACP,MAAM,CAAC;EACP,MAAM,EAAE,MAAM,OAAO,OAAO;EAC5B,OAAO,CAAC;CACV,CAAC;CACD,OAAO,OAAO,OACZ,OAAO,KAAK,OAAO,MAAM;EACvB;EACA;EACA,MAAM,OAAO,OAAO,EAAE,SAAS,OAAO,MAAM,CAAC;EAC7C,OAAM,UAAS,EAAE,OAAO,MAAM,KAAK,OAAO,EAAE;EAC5C,SAAS,OAAO,YACd,QAAQ,MAAM,SAAS;GACrB,OAAO,EAAE,OAAO,aAAa,EAAE,OAAO,KAAK,OAAO,OAAO;IAAE;IAAU;GAAM,CAAC,EAAE;GAC9E,aAAa,EAAE,OAAO,KAAK,KAAK,EAAE;GAClC,aAAa,EAAE,OAAO,KAAK,KAAK,EAAE;GAClC,OAAO,EAAE,YAAY,EAAE,OAAO,KAAK,OAAO,IAAI,EAAE;GAChD,cAAc,EAAE,OAAO,MAAM,KAAK,EAAE;EACtC,CAAC;CACL,CAAC,GAID,EAAE,QAAQ,CACZ;AACF;;AC5LA,MAAa,cAAc,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;AAGlE,MAAa,gBAAgB,mBAAmB,EAAE,WAAW,EAAE,QAAQ,OAAO,OAAO,EAAE,CAAC;;;;;;;AASxF,MAAa,SAAS,OAAO,KAAK,UAAU;CAC1C,OAAO;CACP,SAAS;CACT,MAAM,OAAO,OAAO,EAAE,SAAS,OAAO,OAAO,CAAC;CAC9C,OAAM,UAAS,EACb,OAAO,EACL,QACE,OAAO,cAAc,eAAe,OAAO,UAAU,aAAa,WAC9D,UAAU,WACV,KAAK,QACb,EACF;CACA,SAAS,OAAO,YACd,cAAc,MAAM,SAAS,EAC3B,YAAY,EAAE,aACZ,WAAW,MAAM,SAAS,EAAE,MAAM,IAAI,EAAE,OAAO;EAAE,GAAG;EAAO;CAAO,EAAE,EACxE,CAAC;AACL,CAAC;;AC5BD,MAAa,kBAAkB,OAAO,OAAO;CAC3C,MAAM,OAAO;CACb,SAAS,OAAO;CAChB,OAAO,OAAO,OAAO,OAAO,MAAM;AACpC,CAAC;AAGD,MAAa,oBAAoB,mBAAmB;CAClD,UAAU,EAAE,MAAM,OAAO,OAAO;CAChC,UAAU,CAAC;CACX,UAAU,CAAC;CACX,YAAY,EAAE,SAAS,OAAO,OAAO;CACrC,UAAU,EAAE,OAAO,OAAO,OAAO,OAAO,MAAM,EAAE;AAClD,CAAC;AAGD,MAAM,aAAa,MAAc,SAAiB,UAAiC;CACjF,IAAI,CAAC,OAAO,UAAU,IAAI,GAAG,OAAO;CACpC,IAAI,OAAO,GAAG,OAAO;CACrB,IAAI,UAAU,MAAM,OAAO;CAC3B,OAAO,KAAK,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,OAAO,CAAC,CAAC;AAC/D;;AAGA,MAAa,aAAa,UACxB,MAAM,UAAU,OAAO,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM,QAAQ,MAAM,OAAO,CAAC;;AAGlF,MAAa,UAAU,WAAoC,MAAM,OAAO,KAAK,MAAM;;;;;;AAOnF,MAAa,aAAa,OAAO,KAAK,cAAc;CAClD,OAAO;CACP,SAAS;CACT,MAAM,OAAO,OAAO;EAClB,SAAS,OAAO,OAAO,KACrB,OAAO,MAAM,OAAO,cAAc,CAAC,CAAC,GACpC,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC;EACA,OAAO,OAAO,SAAS,OAAO,OAAO,OAAO,OAAO,KAAK,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;CAC3F,CAAC;CACD,OAAM,UAAS,EACb,OAAO;EAAE,MAAM;EAAG,SAAS,KAAK;EAAS,OAAO,KAAK,SAAS;CAAK,EACrE;CACA,SAAS,OAAO,YACd,kBAAkB,MAAM,SAAS;EAC/B,WAAW,EAAE,YAAY,EACvB,OAAO,WAAW,OAAO;GAAE,GAAG;GAAO,MAAM,UAAU,MAAM,MAAM,SAAS,MAAM,KAAK;EAAE,CAAC,EAC1F;EACA,iBAAiB,EACf,OAAO,WAAW,OAAO;GACvB,GAAG;GACH,MAAM,UAAU,MAAM,OAAO,GAAG,MAAM,SAAS,MAAM,KAAK;EAC5D,CAAC,EACH;EACA,iBAAiB,EACf,OAAO,WAAW,OAAO;GACvB,GAAG;GACH,MAAM,UAAU,MAAM,OAAO,GAAG,MAAM,SAAS,MAAM,KAAK;EAC5D,CAAC,EACH;EACA,aAAa,EAAE,cACb,UAAU,IACN,EACE,OAAO,WAAW,OAAO;GACvB,GAAG;GACH;GACA,MAAM,UAAU,MAAM,MAAM,SAAS,MAAM,KAAK;EAClD,CAAC,EACH,IACA,EAAE,MAAM;EAEd,WAAW,EAAE,YACX,UAAU,QAAQ,SAAS,IACvB,EACE,OAAO,WAAW,OAAO;GACvB,GAAG;GACH;GACA,MAAM,UAAU,MAAM,MAAM,MAAM,SAAS,KAAK;EAClD,CAAC,EACH,IACA,EAAE,MAAM;CAChB,CAAC;AACL,CAAC;;;;;;;;;ACrFD,MAAa,SAAS,OAAe,KAAa,OAAO,MAA6B;CACpF,IAAI,CAAC,OAAO,SAAS,IAAI,KAAK,SAAS,GACrC,MAAM,IAAI,MAAM,qDAAqD,MAAM;CAE7E,MAAM,SAAwB,CAAC;CAC/B,IAAI,OAAO,GACT,KAAK,IAAI,QAAQ,OAAO,QAAQ,KAAK,SAAS,MAC5C,OAAO,KAAK,KAAK;MAGnB,KAAK,IAAI,QAAQ,OAAO,QAAQ,KAAK,SAAS,MAC5C,OAAO,KAAK,KAAK;CAGrB,OAAO;AACT;;ACjBA,MAAa,oBAAoB,OAAO,OAAO,EAAE,UAAU,OAAO,MAAM,OAAO,MAAM,EAAE,CAAC;AAGxF,MAAa,sBAAsB,mBAAmB;CACpD,QAAQ,EAAE,IAAI,OAAO,OAAO;CAC5B,UAAU,EAAE,IAAI,OAAO,OAAO;CAC9B,QAAQ,EAAE,IAAI,OAAO,OAAO;CAC5B,YAAY,EAAE,KAAK,OAAO,MAAM,OAAO,MAAM,EAAE;CAC/C,OAAO,CAAC;AACV,CAAC;AAGD,MAAM,WAAW,UAAiC,OAChD,SAAS,QAAO,UAAS,UAAU,EAAE;;AAGvC,MAAa,cAAc,OAA0B,OACnD,MAAM,SAAS,SAAS,EAAE;;;;;;AAO5B,MAAa,eAAe,OAAO,KAAK,gBAAgB;CACtD,OAAO;CACP,SAAS;CACT,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE;CACvC,SAAS,OAAO,YACd,oBAAoB,MAAM,SAAS;EACjC,SAAS,EAAE,SACT,WAAW,OAAO,EAAE,IAAI,EAAE,MAAM,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,GAAG,MAAM,UAAU,EAAE,EAAE,EAAE;EACrF,WAAW,EAAE,SACX,WAAW,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,QAAQ,MAAM,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM;EACzF,SAAS,EAAE,SACT,WAAW,OAAO,EAAE,IAChB,EAAE,OAAO,EAAE,UAAU,QAAQ,MAAM,UAAU,EAAE,EAAE,EAAE,IACnD,EAAE,OAAO,EAAE,UAAU,CAAC,GAAG,MAAM,UAAU,EAAE,EAAE,EAAE;EACrD,aAAa,EAAE,UAAU;GACvB,MAAM,WAAW,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC;GACjC,OAAO,QAAQ,UAAU,MAAM,QAAQ,IAAI,EAAE,MAAM,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE;EAC/E;EACA,aAAc,MAAM,SAAS,WAAW,IAAI,EAAE,MAAM,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE;CACpF,CAAC;AACL,CAAC;;AC3BD,MAAM,cAAc,QAAgB,oBAClC,OAAO,SAAS,MAAM,KAAK,UAAU,IAAI,SAAS;AAEpD,MAAM,YACJ,OACA,SACA,MACA,WACW;CACX,MAAM,MAAM,KAAK;CACjB,IAAI,QAAQ,KAAA,GAAW,OAAO,OAAO;CACrC,OAAO,WAAW,QAAQ,QAAQ,OAAO,iBAAiB,OAAO,eAAe;AAClF;AAaA,MAAM,+BAAe,IAAI,QAAwC;AAEjE,MAAM,cAAc,GAAkB,MACpC,EAAE,oBAAoB,EAAE,mBACxB,EAAE,QAAQ,EAAE,OACZ,EAAE,iBAAiB,EAAE,gBACrB,EAAE,eAAe,EAAE;AAErB,MAAM,WACJ,MACA,SACA,WACiB;CACjB,MAAM,SAAS,aAAa,IAAI,IAAI;CACpC,IAAI,WAAW,KAAA,KAAa,OAAO,YAAY,WAAW,WAAW,OAAO,QAAQ,MAAM,GACxF,OAAO,OAAO;CAEhB,MAAM,OAAO,IAAI,aAAa,KAAK,SAAS,CAAC;CAC7C,KAAK,KAAK,OAAO;CACjB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SACvC,KAAK,QAAQ,KAAK,KAAK,SAAU,SAAS,OAAO,SAAS,MAAM,MAAM,IAAI,OAAO;CAEnF,aAAa,IAAI,MAAM;EAAE;EAAS,QAAQ,EAAE,GAAG,OAAO;EAAG;CAAK,CAAC;CAC/D,OAAO;AACT;;AAGA,MAAM,cAAc,MAAc,IAAY,SAA6C;CACzF,IAAI,MAAM;CACV,IAAI,OAAO;CACX,OAAO,MAAM,MAAM;EACjB,MAAM,SAAU,MAAM,SAAU;EAChC,IAAI,KAAK,MAAM,GAAG,OAAO;OACpB,MAAM,SAAS;CACtB;CACA,OAAO;AACT;;AAGA,MAAa,eACX,MACA,SACA,WACW;CACX,MAAM,OAAO,KAAK,SAAS;CAC3B,IAAI,SAAS,IAAI,OAAO,OAAO,eAAe,OAAO;CAGrD,OACE,QAAQ,MAAM,SAAS,MAAM,CAAC,CAAC,QAC/B,SAAS,MAAM,SAAS,MAAM,MAAM,IACpC,OAAO;AAEX;;AAGA,MAAa,aACX,OACA,MACA,SACA,WACW,QAAQ,MAAM,SAAS,MAAM,CAAC,CAAC,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC;;;;;;;;AASpF,MAAa,gBACX,MACA,SACA,QACA,WACA,gBACA,aACkB;CAClB,MAAM,QAAQ,KAAK;CACnB,IAAI,UAAU,KAAK,kBAAkB,GAAG,OAAO;EAAE,OAAO;EAAG,KAAK;CAAE;CAClE,MAAM,OAAO,QAAQ,MAAM,SAAS,MAAM;CAC1C,MAAM,MAAM,KAAK,IAAI,GAAG,SAAS;CACjC,MAAM,SAAS,MAAM;CAErB,MAAM,QAAQ,WACZ,GACA,QACA,UAAS,KAAK,SAAU,SAAS,OAAO,SAAS,MAAM,MAAM,IAAI,GACnE;CACA,MAAM,MAAM,WAAW,OAAO,QAAO,UAAS,KAAK,UAAW,MAAM;CACpE,OAAO;EACL,OAAO,KAAK,IAAI,GAAG,QAAQ,KAAK,IAAI,GAAG,QAAQ,CAAC;EAChD,KAAK,KAAK,IAAI,OAAO,MAAM,KAAK,IAAI,GAAG,QAAQ,CAAC;CAClD;AACF;AAEA,MAAa,eAAe,OAAO,OAAO;CACxC,WAAW,OAAO;CAClB,SAAS,OAAO,OAAO,OAAO,QAAQ,OAAO,MAAM;CACnD,WAAW,OAAO;CAClB,YAAY,OAAO;CACnB,iBAAiB,OAAO;CACxB,UAAU,OAAO;CACjB,KAAK,OAAO;CACZ,cAAc,OAAO;CACrB,YAAY,OAAO;AACrB,CAAC;AAGD,MAAa,iBAAiB,mBAAmB;CAC/C,UAAU,EAAE,KAAK,OAAO,OAAO;CAC/B,UAAU;EAAE,KAAK,OAAO;EAAQ,QAAQ,OAAO;CAAO;;;CAGtD,OAAO,EAAE,MAAM,OAAO,MAAM,OAAO,MAAM,EAAE;;;CAG3C,SAAS,EAAE,YAAY,OAAO,OAAO;AACvC,CAAC;AAGD,MAAM,YAAY,WAAwC;CACxD,iBAAiB,MAAM;CACvB,KAAK,MAAM;CACX,cAAc,MAAM;CACpB,YAAY,MAAM;AACpB;;;;;;;AAQA,MAAa,aACX,OACA,MACA,mBACqD;CACrD,MAAM,SAAS,SAAS,KAAK;CAS7B,OAAO;EAAE,GARM,aACb,MACA,MAAM,SACN,QACA,MAAM,WACN,gBACA,MAAM,QAES;EAAG,aAAa,YAAY,MAAM,MAAM,SAAS,MAAM;CAAE;AAC5E;;;;;;AAOA,MAAa,iBACX,OACA,MACA,mBACW;CAEX,OADc,YAAY,MAAM,MAAM,SAAS,SAAS,KAAK,CAClD,KAAK,MAAM,YAAY;AACpC;;;;;;;AAQA,MAAa,WACX,OACA,MACA,gBACA,YAAY,MACA;CACZ,MAAM,QAAQ,YAAY,MAAM,MAAM,SAAS,SAAS,KAAK,CAAC;CAC9D,IAAI,SAAS,GAAG,OAAO;CACvB,OAAO,SAAS,MAAM,YAAY,mBAAmB,KAAK,IAAI,GAAG,SAAS;AAC5E;AAEA,MAAM,WAAW,QAAgC,OAAO,SAAS,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAE3F,MAAM,gBAAgB,WACpB,OAAO,SAAS,MAAM,KAAK,UAAU,IAAI,SAAS;;;;;;;;;;;;;;;AAgBpD,MAAa,UAAU,OAAO,KAc5B,WAAW;CACX,OAAO;CACP,SAAS;CACT,MAAM,OAAO,OAAO;EAClB,iBAAiB,OAAO,OAAO,KAC7B,OAAO,MAAM,OAAO,cAAc,CAAC,CAAC,GACpC,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC;EACA,UAAU,OAAO,IAAI,KAAK,OAAO,MAAM,OAAO,uBAAuB,CAAC,CAAC,CAAC;EACxE,KAAK,OAAO,OAAO,KACjB,OAAO,MAAM,OAAO,uBAAuB,CAAC,CAAC,GAC7C,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC;EACA,cAAc,OAAO,OAAO,KAC1B,OAAO,MAAM,OAAO,uBAAuB,CAAC,CAAC,GAC7C,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC;EACA,YAAY,OAAO,OAAO,KACxB,OAAO,MAAM,OAAO,uBAAuB,CAAC,CAAC,GAC7C,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC;EACA,UAAU,OAAO,SACf,OAAO,OAAO,KAAK,OAAO,MAAM,OAAO,cAAc,CAAC,CAAC,GAAG,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAC3F;EACA,kBAAkB,OAAO,SACvB,OAAO,OAAO,KACZ,OAAO,MAAM,OAAO,uBAAuB,CAAC,CAAC,GAC7C,OAAO,MAAM,OAAO,SAAS,CAAC,CAChC,CACF;EACA,gBAAgB,OAAO,SAAS,OAAO,OAAO,OAAO,QAAQ,OAAO,MAAM,CAAC;CAC7E,CAAC;CACD,OAAM,SAAQ;EAGZ,MAAM,UAAkC,CAAC;EACzC,KAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,KAAK,kBAAkB,CAAC,CAAC,GAAG;GACrE,MAAM,OAAO,aAAa,MAAM;GAChC,IAAI,SAAS,MAAM,QAAQ,OAAO;EACpC;EACA,OAAO,EACL,OAAO;GACL,WAAW,KAAK,oBAAoB;GACpC;GACA,WAAW;GACX,YAAY;GACZ,iBAAiB,KAAK;GACtB,UAAU,KAAK;GACf,KAAK,KAAK;GACV,cAAc,KAAK;GACnB,YAAY,KAAK;EACnB,EACF;CACF;CACA,SAAS,OAAO,SAAS,SACvB,eAAe,MACb,SACA;EACE,WAAW,EAAE,UAAU;GACrB,MAAM,OAAO,QAAQ,GAAG;GAIxB,IAAI,SAAS,QAAQ,QAAQ,MAAM,WAAW,OAAO,EAAE,MAAM;GAC7D,MAAM,aAAa,MAAM,aAAa;GACtC,OAAO;IACL,OAAO;KAAE,GAAG;KAAO,WAAW;KAAM,WAAW;KAAM;IAAW;IAChE,UAAU,CACR;KACE,MAAM;KACN,MAAM,EAAE,WAAW;KACnB,QAAQ,OAAO,GACb,OAAO,MAAM,KAAK,YAAY,GAAG,GACjC,eAAe,QAAQ,EAAE,WAAW,CAAC,CACvC;IACF,CACF;GACF;EACF;EACA,WAAW,EAAE,KAAK,aAAa;GAC7B,MAAM,OAAO,aAAa,MAAM;GAEhC,OAAO,SAAS,QAAS,OAAO,OAAO,MAAM,SAAS,GAAG,KAAK,MAAM,QAAQ,SAAS,OACjF,EAAE,MAAM,IACR,EAAE,OAAO;IAAE,GAAG;IAAO,SAAS;KAAE,GAAG,MAAM;MAAU,MAAM;IAAK;GAAE,EAAE;EACxE;EACA,QAAQ,EAAE,WAAW;GACnB,MAAM,OAAO,IAAI,IAAI,IAAI;GACzB,MAAM,UAAkC,CAAC;GACzC,IAAI,UAAU;GACd,KAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,MAAM,OAAO,GACtD,IAAI,KAAK,IAAI,GAAG,GAAG,QAAQ,OAAO;QAC7B,UAAU;GAEjB,OAAO,UAAU,EAAE,OAAO;IAAE,GAAG;IAAO;GAAQ,EAAE,IAAI,EAAE,MAAM;EAC9D;EAEA,UAAU,EAAE,iBACV,eAAe,MAAM,aAAa,EAAE,OAAO;GAAE,GAAG;GAAO,WAAW;EAAM,EAAE,IAAI,EAAE,MAAM;CAC1F,CACF;AACJ,CAAC;AAED,MAAa,mBAAmB,OAAO,aAAa,oBAAoB,EAAE,KAAK,OAAO,OAAO,CAAC;;;;;;AAQ9F,MAAa,WAAW,MAAM,aAAa,YAAY;CACrD,UAAU,CAAC,gBAAgB;CAC3B,UAAU,EAAE,cAAc;EAExB,MAAM,aAA+B;GACnC,MAAM,WAAW;GACjB,OAAO,iBAAiB,KAAK,EAAE,KAAK,SAAS,UAAU,CAAC;EAC1D;EACA,OAAO,OAAO,OACZ,OAAO,KAAK,KAAK,CAAC,GAClB,OAAO,kBAAkB,SAAS,QAAQ,CAAC,CAAC,KAAK,OAAO,IAAI,IAAI,CAAC,CACnE;CACF;AACF,CAAC;AAED,MAAa,cAAc,OAAO,aAAa,eAAe;CAC5D,KAAK,OAAO;CACZ,QAAQ,OAAO;AACjB,CAAC;;;;;;AAUD,MAAa,aAAa,MAAM,aAAa,cAAc;CACzD,UAAU,CAAC,WAAW;CACtB,MAAM,EAAE,KAAK,OAAO,OAAO;CAC3B,UAAU,EAAE,SAAS,UACnB,OAAO,UAAkC,UACvC,OAAO,IAAI,aAAa;EACtB,MAAM,WAAY,WAAoD;EACtE,IAAI,aAAa,KAAA,GAAW;EAC5B,OAAO,OAAO,eACZ,OAAO,WAAW;GAChB,MAAM,WAAW,IAAI,UAAS,YAAW;IACvC,MAAM,OAAO,QAAQ,EAAE,EAAE;IACzB,IAAI,SAAS,KAAA,GACX,MAAM,YAAY,OAAO,YAAY,KAAK;KAAE;KAAK,QAAQ,KAAK;IAAO,CAAC,CAAC;GAE3E,CAAC;GACD,SAAS,QAAQ,OAAO;GACxB,OAAO;EACT,CAAC,IACD,aAAY,OAAO,WAAW,SAAS,WAAW,CAAC,CACrD;CACF,CAAC,CACH;AACJ,CAAC;;;;;;;;AASD,MAAa,gBACX,UACA,eACkB;CAClB,IAAI,UAAyB;CAC7B,IAAI,eAAe;CACnB,KAAK,MAAM,WAAW,UACpB,IAAI,QAAQ,SAAS,cAAc,QAAQ,QAAQ,cAAc;EAC/D,UAAU,QAAQ;EAClB,eAAe,QAAQ;CACzB;CAEF,OAAO;AACT;;;;;;;;AAmBA,MAAa,WACX,MACA,SACA,YAM2F;CAC3F,IAAI,CAAC,OAAO,UAAU,QAAQ,OAAO,KAAK,QAAQ,UAAU,GAC1D,MAAM,IAAI,MAAM,oDAAoD,QAAQ,SAAS;CAEvF,IAAI,EAAE,QAAQ,cAAc,MAAM,CAAC,OAAO,SAAS,QAAQ,WAAW,GACpE,MAAM,IAAI,MACR,8DAA8D,QAAQ,aACxE;CAEF,IAAI,QAAQ,MAAM,KAAK,CAAC,OAAO,SAAS,QAAQ,GAAG,GACjD,MAAM,IAAI,MAAM,0DAA0D,QAAQ,KAAK;CAEzF,IAAI,QAAQ,kBAAkB,KAAK,CAAC,OAAO,SAAS,QAAQ,eAAe,GACzE,MAAM,IAAI,MACR,sEAAsE,QAAQ,iBAChF;CAEF,MAAM,gBAA+B,IAAI,MAAM,QAAQ,OAAO,CAAC,CAAC,KAAK,CAAC;CACtE,MAAM,aAAsC,CAAC;CAC7C,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,MAAM,QAAQ,QAAQ,QAAQ;EACpC,MAAM,SAAS,OAAO,SAAS,GAAG,KAAK,OAAO,IAAI,MAAM,QAAQ;EAChE,IAAI,SAAS;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KACxC,IAAI,cAAc,KAAM,cAAc,SAAU,SAAS;EAE3D,WAAW,KAAK;GACd;GACA;GACA,GAAG,UAAU,QAAQ,cAAc,QAAQ;GAC3C,GAAG,cAAc;GACjB,OAAO,QAAQ;GACf;EACF,CAAC;EACD,cAAc,UAAU,cAAc,UAAW,SAAS,QAAQ;CACpE;CACA,OAAO;EACL;EACA,aAAa,WAAW,WAAW,IAAI,IAAI,KAAK,IAAI,GAAG,aAAa,IAAI,QAAQ;CAClF;AACF"}