foldkit-primitives 0.1.0

package/dist/state/index.mjs

@@ -0,0 +1,504 @@
+import { Effect, Queue, Schema, Stream } from "effect";
+import * as Mount from "foldkit/mount";
+import { defineMessageUnion } from "foldkit/message";
+import { Bundle } from "foldkit-bundle";
+//#region src/state/history.ts
+/**
+* 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.
+*/
+const HistoryModel = (value) => Schema.Struct({
+	past: Schema.Array(value),
+	present: value,
+	future: Schema.Array(value)
+});
+const history = (config) => {
+	const capacity = config.capacity ?? 100;
+	if (!Number.isInteger(capacity) || capacity < 0) throw new Error(`History "${config.name}": capacity must be a non-negative integer`);
+	const Model = HistoryModel(config.value);
+	const Message = defineMessageUnion({
+		Push: { value: config.value },
+		Undo: {},
+		Redo: {},
+		Clear: {}
+	});
+	return Object.assign(Bundle.make(config.name, {
+		Model,
+		Message,
+		args: Schema.Struct({ initial: config.value }),
+		init: (args) => ({ model: {
+			past: [],
+			present: args.initial,
+			future: []
+		} }),
+		update: (model, message) => Message.match(message, {
+			Push: ({ value }) => ({ model: {
+				past: capacity === 0 ? [] : [...model.past, model.present].slice(-capacity),
+				present: value,
+				future: []
+			} }),
+			Undo: () => {
+				const previous = model.past[model.past.length - 1];
+				if (previous === void 0) return { model };
+				return { model: {
+					past: model.past.slice(0, -1),
+					present: previous,
+					future: [model.present, ...model.future]
+				} };
+			},
+			Redo: () => {
+				const next = model.future[0];
+				if (next === void 0) return { model };
+				return { model: {
+					past: [...model.past, model.present],
+					present: next,
+					future: model.future.slice(1)
+				} };
+			},
+			Clear: () => ({ model: {
+				past: [],
+				present: model.present,
+				future: []
+			} })
+		})
+	}), { Message });
+};
+/** Whether Undo would move: the past is non-empty. */
+const canUndo = (model) => model.past.length > 0;
+/** Whether Redo would move: the future is non-empty. */
+const canRedo = (model) => model.future.length > 0;
+//#endregion
+//#region src/state/locale.ts
+/**
+* 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.
+*/
+const LocaleModel = Schema.Struct({ locale: Schema.String });
+const LocaleMessage = defineMessageUnion({ SetLocale: { locale: Schema.String } });
+const Locale = Bundle.make("Locale", {
+	Model: LocaleModel,
+	Message: LocaleMessage,
+	args: Schema.Struct({ default: Schema.String }),
+	init: (args) => ({ model: { locale: typeof navigator !== "undefined" && typeof navigator.language === "string" ? navigator.language : args.default } }),
+	update: (model, message) => LocaleMessage.match(message, { SetLocale: ({ locale }) => ({ model: {
+		...model,
+		locale
+	} }) })
+});
+//#endregion
+//#region src/state/pagination.ts
+/**
+* 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.
+*/
+const PaginationModel = Schema.Struct({
+	page: Schema.Number,
+	perPage: Schema.Number,
+	total: Schema.NullOr(Schema.Number)
+});
+const PaginationMessage = defineMessageUnion({
+	GoToPage: { page: Schema.Number },
+	NextPage: {},
+	PrevPage: {},
+	SetPerPage: { perPage: Schema.Number },
+	SetTotal: { total: Schema.NullOr(Schema.Number) }
+});
+const clampPage = (page, perPage, total) => {
+	if (!Number.isInteger(page)) return 1;
+	if (page < 1) return 1;
+	if (total === null) return page;
+	return Math.min(page, Math.max(1, Math.ceil(total / perPage)));
+};
+/** The number of pages, or null while the total is unknown. */
+const pageCount = (model) => model.total === null ? null : Math.max(1, Math.ceil(model.total / model.perPage));
+/** The offset of the first item on the page, for a slice or a query. */
+const offset = (model) => (model.page - 1) * model.perPage;
+const Pagination = Bundle.make("Pagination", {
+	Model: PaginationModel,
+	Message: PaginationMessage,
+	args: Schema.Struct({
+		perPage: Schema.Number.pipe(Schema.check(Schema.isGreaterThan(0)), Schema.check(Schema.isFinite())),
+		total: Schema.optional(Schema.NullOr(Schema.Number.pipe(Schema.check(Schema.isFinite()))))
+	}),
+	init: (args) => ({ model: {
+		page: 1,
+		perPage: args.perPage,
+		total: args.total ?? null
+	} }),
+	update: (model, message) => PaginationMessage.match(message, {
+		GoToPage: ({ page }) => ({ model: {
+			...model,
+			page: clampPage(page, model.perPage, model.total)
+		} }),
+		NextPage: () => ({ model: {
+			...model,
+			page: clampPage(model.page + 1, model.perPage, model.total)
+		} }),
+		PrevPage: () => ({ model: {
+			...model,
+			page: clampPage(model.page - 1, model.perPage, model.total)
+		} }),
+		SetPerPage: ({ perPage }) => perPage > 0 ? { model: {
+			...model,
+			perPage,
+			page: clampPage(model.page, perPage, model.total)
+		} } : { model },
+		SetTotal: ({ total }) => total === null || total >= 0 ? { model: {
+			...model,
+			total,
+			page: clampPage(model.page, model.perPage, total)
+		} } : { model }
+	})
+});
+//#endregion
+//#region src/state/range.ts
+/**
+* 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.
+*/
+const range = (start, end, step = 1) => {
+	if (!Number.isFinite(step) || step === 0) throw new Error(`range: step must be a non-zero finite number, got ${step}`);
+	const values = [];
+	if (step > 0) for (let value = start; value < end; value += step) values.push(value);
+	else for (let value = start; value > end; value += step) values.push(value);
+	return values;
+};
+//#endregion
+//#region src/state/selection.ts
+/**
+* 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.
+*/
+const SelectionSetModel = Schema.Struct({ selected: Schema.Array(Schema.String) });
+const SelectionSetMessage = defineMessageUnion({
+	Select: { id: Schema.String },
+	Deselect: { id: Schema.String },
+	Toggle: { id: Schema.String },
+	ReplaceAll: { ids: Schema.Array(Schema.String) },
+	Clear: {}
+});
+const without = (selected, id) => selected.filter((other) => other !== id);
+/** Whether the id is currently selected. */
+const isSelected = (model, id) => model.selected.includes(id);
+const SelectionSet = Bundle.make("SelectionSet", {
+	Model: SelectionSetModel,
+	Message: SelectionSetMessage,
+	init: () => ({ model: { selected: [] } }),
+	update: (model, message) => SelectionSetMessage.match(message, {
+		Select: ({ id }) => isSelected(model, id) ? { model } : { model: { selected: [...model.selected, id] } },
+		Deselect: ({ id }) => ({ model: { selected: without(model.selected, id) } }),
+		Toggle: ({ id }) => isSelected(model, id) ? { model: { selected: without(model.selected, id) } } : { model: { selected: [...model.selected, id] } },
+		ReplaceAll: ({ ids }) => ({ model: { selected: [...new Set(ids)] } }),
+		Clear: () => ({ model: { selected: [] } })
+	})
+});
+//#endregion
+//#region src/state/virtual.ts
+/**
+* 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(...)`.
+*/
+const saneHeight = (height, estimatedHeight) => Number.isFinite(height) && height >= 0 ? height : estimatedHeight;
+const heightAt = (index, heights, keys, layout) => {
+	const key = keys[index];
+	if (key === void 0) return layout.estimatedHeight;
+	return saneHeight(heights[key] ?? layout.estimatedHeight, layout.estimatedHeight);
+};
+/** Total scrollable height: padding, measured rows, estimates, and gaps. */
+const totalHeight = (keys, heights, layout) => {
+	let total = layout.paddingStart + layout.paddingEnd;
+	for (let index = 0; index < keys.length; index++) {
+		total += heightAt(index, heights, keys, layout);
+		if (index < keys.length - 1) total += layout.gap;
+	}
+	return total;
+};
+/** Pixel offset of a row's top edge: padding plus the prefix before it. */
+const offsetFor = (index, keys, heights, layout) => {
+	const clamped = Math.max(0, Math.min(index, keys.length));
+	let offset = layout.paddingStart;
+	for (let i = 0; i < clamped; i++) offset += heightAt(i, heights, keys, layout) + layout.gap;
+	return offset;
+};
+/**
+* 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.
+*/
+const visibleRange = (keys, heights, layout, scrollTop, viewportHeight, overscan) => {
+	const count = keys.length;
+	if (count === 0 || viewportHeight <= 0) return {
+		start: 0,
+		end: 0
+	};
+	const top = Math.max(0, scrollTop);
+	const bottom = top + viewportHeight;
+	let start = 0;
+	let offset = layout.paddingStart;
+	for (let index = 0; index < count; index++) {
+		const height = heightAt(index, heights, keys, layout);
+		if (offset + height <= top) {
+			start = index + 1;
+			offset += height + layout.gap;
+		} else break;
+	}
+	let end = start;
+	let cursor = offset;
+	while (end < count && cursor < bottom) {
+		cursor += heightAt(end, heights, keys, layout) + layout.gap;
+		end += 1;
+	}
+	return {
+		start: Math.max(0, start - Math.max(0, overscan)),
+		end: Math.min(count, end + Math.max(0, overscan))
+	};
+};
+const VirtualModel = Schema.Struct({
+	scrollTop: Schema.Number,
+	heights: Schema.Record(Schema.String, Schema.Number),
+	scrolling: Schema.Boolean,
+	generation: Schema.Number,
+	estimatedHeight: Schema.Number,
+	overscan: Schema.Number,
+	gap: Schema.Number,
+	paddingStart: Schema.Number,
+	paddingEnd: Schema.Number
+});
+const VirtualMessage = defineMessageUnion({
+	Scrolled: { top: Schema.Number },
+	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. */
+	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. */
+	Settled: { generation: Schema.Number }
+});
+const layoutOf = (model) => ({
+	estimatedHeight: model.estimatedHeight,
+	gap: model.gap,
+	paddingStart: model.paddingStart,
+	paddingEnd: model.paddingEnd
+});
+/**
+* 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.
+*/
+const windowFor = (model, keys, viewportHeight) => {
+	const layout = layoutOf(model);
+	return {
+		...visibleRange(keys, model.heights, layout, model.scrollTop, viewportHeight, model.overscan),
+		totalHeight: totalHeight(keys, model.heights, layout)
+	};
+};
+/**
+* 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.
+*/
+const isAtEnd = (model, keys, viewportHeight, threshold = 0) => {
+	const total = totalHeight(keys, model.heights, layoutOf(model));
+	if (total <= 0) return true;
+	return model.scrollTop + viewportHeight >= total - Math.max(0, threshold);
+};
+const saneTop = (top) => Number.isFinite(top) ? Math.max(0, top) : null;
+const saneMeasured = (height) => Number.isFinite(height) && height >= 0 ? height : null;
+const Virtual = Bundle.make("Virtual", {
+	Model: VirtualModel,
+	Message: VirtualMessage,
+	args: Schema.Struct({
+		estimatedHeight: Schema.Number.pipe(Schema.check(Schema.isGreaterThan(0)), Schema.check(Schema.isFinite())),
+		overscan: Schema.Int.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0))),
+		gap: Schema.Number.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0)), Schema.check(Schema.isFinite())),
+		paddingStart: Schema.Number.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0)), Schema.check(Schema.isFinite())),
+		paddingEnd: Schema.Number.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0)), Schema.check(Schema.isFinite())),
+		settleMs: Schema.optional(Schema.Number.pipe(Schema.check(Schema.isGreaterThan(0)), Schema.check(Schema.isFinite()))),
+		initialScrollTop: Schema.optional(Schema.Number.pipe(Schema.check(Schema.isGreaterThanOrEqualTo(0)), Schema.check(Schema.isFinite()))),
+		initialHeights: Schema.optional(Schema.Record(Schema.String, Schema.Number))
+	}),
+	init: (args) => {
+		const heights = {};
+		for (const [key, height] of Object.entries(args.initialHeights ?? {})) {
+			const sane = saneMeasured(height);
+			if (sane !== null) heights[key] = sane;
+		}
+		return { model: {
+			scrollTop: args.initialScrollTop ?? 0,
+			heights,
+			scrolling: false,
+			generation: 0,
+			estimatedHeight: args.estimatedHeight,
+			overscan: args.overscan,
+			gap: args.gap,
+			paddingStart: args.paddingStart,
+			paddingEnd: args.paddingEnd
+		} };
+	},
+	update: (model, message, args) => VirtualMessage.match(message, {
+		Scrolled: ({ top }) => {
+			const sane = saneTop(top);
+			if (sane === null) return { model };
+			const generation = model.generation + 1;
+			return {
+				model: {
+					...model,
+					scrollTop: sane,
+					scrolling: true,
+					generation
+				},
+				commands: [{
+					name: "Virtual.settle",
+					args: { generation },
+					effect: Effect.as(Effect.sleep(args.settleMs ?? 150), VirtualMessage.Settled({ generation }))
+				}]
+			};
+		},
+		Measured: ({ key, height }) => {
+			const sane = saneMeasured(height);
+			return sane === null ? { model } : { model: {
+				...model,
+				heights: {
+					...model.heights,
+					[key]: sane
+				}
+			} };
+		},
+		Prune: ({ keys }) => {
+			const kept = new Set(keys);
+			const heights = {};
+			for (const [key, height] of Object.entries(model.heights)) if (kept.has(key)) heights[key] = height;
+			return { model: {
+				...model,
+				heights
+			} };
+		},
+		Settled: ({ generation }) => generation === model.generation ? { model: {
+			...model,
+			scrolling: false
+		} } : { model }
+	})
+});
+const ViewportScrolled = Schema.TaggedStruct("ViewportScrolled", { top: Schema.Number });
+/**
+* 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.
+*/
+const Viewport = Mount.defineStream("Viewport", {
+	messages: [ViewportScrolled],
+	execute: ({ element }) => {
+		const read = () => {
+			const scroller = element;
+			return ViewportScrolled.make({ top: scroller.scrollTop });
+		};
+		return Stream.concat(Stream.make(read()), Stream.fromEventListener(element, "scroll").pipe(Stream.map(read)));
+	}
+});
+const RowMeasured = Schema.TaggedStruct("RowMeasured", {
+	key: Schema.String,
+	height: Schema.Number
+});
+/**
+* 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.
+*/
+const MeasureRow = Mount.defineStream("MeasureRow", {
+	messages: [RowMeasured],
+	args: { key: Schema.String },
+	execute: ({ element, key }) => Stream.callback((queue) => Effect.gen(function* () {
+		const Observed = globalThis.ResizeObserver;
+		if (Observed === void 0) return;
+		yield* Effect.acquireRelease(Effect.sync(() => {
+			const observer = new Observed((entries) => {
+				const rect = entries[0]?.contentRect;
+				if (rect !== void 0) Queue.offerUnsafe(queue, RowMeasured.make({
+					key,
+					height: rect.height
+				}));
+			});
+			observer.observe(element);
+			return observer;
+		}), (observer) => Effect.sync(() => observer.disconnect()));
+	}))
+});
+/**
+* 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.
+*/
+const stickyHeader = (sections, startIndex) => {
+	let current = null;
+	let currentIndex = -1;
+	for (const section of sections) if (section.index <= startIndex && section.index > currentIndex) {
+		current = section.key;
+		currentIndex = section.index;
+	}
+	return current;
+};
+/**
+* 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.
+*/
+const masonry = (keys, heights, options) => {
+	if (!Number.isInteger(options.columns) || options.columns < 1) throw new Error(`masonry: columns must be a positive integer, got ${options.columns}`);
+	if (!(options.columnWidth > 0) || !Number.isFinite(options.columnWidth)) throw new Error(`masonry: columnWidth must be a positive finite number, got ${options.columnWidth}`);
+	if (options.gap < 0 || !Number.isFinite(options.gap)) throw new Error(`masonry: gap must be a non-negative finite number, got ${options.gap}`);
+	if (options.estimatedHeight < 0 || !Number.isFinite(options.estimatedHeight)) throw new Error(`masonry: estimatedHeight must be a non-negative finite number, got ${options.estimatedHeight}`);
+	const columnHeights = new Array(options.columns).fill(0);
+	const placements = [];
+	for (const key of keys) {
+		const raw = heights[key] ?? options.estimatedHeight;
+		const height = Number.isFinite(raw) && raw >= 0 ? raw : options.estimatedHeight;
+		let column = 0;
+		for (let c = 1; c < columnHeights.length; c++) if (columnHeights[c] < columnHeights[column]) column = c;
+		placements.push({
+			key,
+			column,
+			x: column * (options.columnWidth + options.gap),
+			y: columnHeights[column],
+			width: options.columnWidth,
+			height
+		});
+		columnHeights[column] = columnHeights[column] + height + options.gap;
+	}
+	return {
+		placements,
+		totalHeight: placements.length === 0 ? 0 : Math.max(...columnHeights) - options.gap
+	};
+};
+//#endregion
+export { HistoryModel, Locale, LocaleMessage, LocaleModel, MeasureRow, Pagination, PaginationMessage, PaginationModel, RowMeasured, SelectionSet, SelectionSetMessage, SelectionSetModel, Viewport, ViewportScrolled, Virtual, VirtualMessage, VirtualModel, canRedo, canUndo, history, isAtEnd, isSelected, masonry, offset, offsetFor, pageCount, range, stickyHeader, totalHeight, visibleRange, windowFor };
+
+//# sourceMappingURL=index.mjs.map

package/dist/state/index.mjs.map

@@ -0,0 +1 @@
+{"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":["/**\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 */\nimport { 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  })\nexport type HistoryModel<Value> = {\n  readonly past: ReadonlyArray<Value>\n  readonly present: Value\n  readonly future: ReadonlyArray<Value>\n}\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 = config.capacity ?? 100\n  // A negative or fractional capacity would silently keep a wrong-sized past;\n  // fail at the factory, naming the caller, instead.\n  if (!Number.isInteger(capacity) || capacity < 0) {\n    throw new Error(`History \"${config.name}\": capacity must be a non-negative integer`)\n  }\n  const Model = HistoryModel(config.value)\n  const Message = defineMessageUnion({\n    Push: { value: config.value },\n    Undo: {},\n    Redo: {},\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: { past: [], present: args.initial, future: [] } }),\n      update: (model, message) =>\n        Message.match(message, {\n          Push: ({ value }) => ({\n            model: {\n              // slice(-0) is slice(0): a zero capacity keeps nothing, explicitly.\n              past: capacity === 0 ? [] : [...model.past, model.present].slice(-capacity),\n              present: value,\n              future: [],\n            },\n          }),\n          Undo: () => {\n            const previous = model.past[model.past.length - 1]\n            if (previous === undefined) return { model }\n            return {\n              model: {\n                past: model.past.slice(0, -1),\n                present: previous,\n                future: [model.present, ...model.future],\n              },\n            }\n          },\n          Redo: () => {\n            const next = model.future[0]\n            if (next === undefined) return { model }\n            return {\n              model: {\n                past: [...model.past, model.present],\n                present: next,\n                future: model.future.slice(1),\n              },\n            }\n          },\n          Clear: () => ({ model: { past: [], present: model.present, future: [] } }),\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\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 * 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 */\nimport { 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\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 }) => ({ model: { ...model, locale } }),\n    }),\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 */\nimport { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\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\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: { ...model, page: clampPage(page, model.perPage, model.total) },\n      }),\n      NextPage: () => ({\n        model: { ...model, page: clampPage(model.page + 1, model.perPage, model.total) },\n      }),\n      PrevPage: () => ({\n        model: { ...model, page: clampPage(model.page - 1, model.perPage, model.total) },\n      }),\n      SetPerPage: ({ perPage }) =>\n        perPage > 0\n          ? { model: { ...model, perPage, page: clampPage(model.page, perPage, model.total) } }\n          : { model },\n      SetTotal: ({ total }) =>\n        total === null || total >= 0\n          ? {\n              model: { ...model, total, page: clampPage(model.page, model.perPage, total) },\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","/**\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 */\nimport { Schema } from 'effect'\nimport { defineMessageUnion } from 'foldkit/message'\nimport { Bundle } from 'foldkit-bundle'\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\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 }) => ({ model: { selected: without(model.selected, id) } }),\n      Toggle: ({ id }) =>\n        isSelected(model, id)\n          ? { model: { selected: without(model.selected, id) } }\n          : { model: { selected: [...model.selected, id] } },\n      ReplaceAll: ({ ids }) => ({ model: { selected: [...new Set(ids)] } }),\n      Clear: () => ({ model: { selected: [] } }),\n    }),\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 */\nimport { 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\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\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  let total = layout.paddingStart + layout.paddingEnd\n  for (let index = 0; index < keys.length; index++) {\n    total += heightAt(index, heights, keys, layout)\n    if (index < keys.length - 1) total += layout.gap\n  }\n  return total\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 => {\n  const clamped = Math.max(0, Math.min(index, keys.length))\n  let offset = layout.paddingStart\n  for (let i = 0; i < clamped; i++) {\n    offset += heightAt(i, heights, keys, layout) + layout.gap\n  }\n  return offset\n}\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 top = Math.max(0, scrollTop)\n  const bottom = top + viewportHeight\n  let start = 0\n  let offset = layout.paddingStart\n  for (let index = 0; index < count; index++) {\n    const height = heightAt(index, heights, keys, layout)\n    if (offset + height <= top) {\n      start = index + 1\n      offset += height + layout.gap\n    } else {\n      break\n    }\n  }\n  let end = start\n  let cursor = offset\n  while (end < count && cursor < bottom) {\n    cursor += heightAt(end, heights, keys, layout) + layout.gap\n    end += 1\n  }\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 * 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 model.scrollTop + viewportHeight >= total - 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\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          if (sane === null) 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          return sane === null\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          for (const [key, height] of Object.entries(model.heights)) {\n            if (kept.has(key)) heights[key] = height\n          }\n          return { model: { ...model, heights } }\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\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":";;;;;;;;;;AASA,MAAa,gBAAuB,UAClC,OAAO,OAAO;CACZ,MAAM,OAAO,MAAM,KAAK;CACxB,SAAS;CACT,QAAQ,OAAO,MAAM,KAAK;AAC5B,CAAC;AAOH,MAAa,WAA6C,WAIpD;CACJ,MAAM,WAAW,OAAO,YAAY;CAGpC,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAC5C,MAAM,IAAI,MAAM,YAAY,OAAO,KAAK,2CAA2C;CAErF,MAAM,QAAQ,aAAa,OAAO,KAAK;CACvC,MAAM,UAAU,mBAAmB;EACjC,MAAM,EAAE,OAAO,OAAO,MAAM;EAC5B,MAAM,CAAC;EACP,MAAM,CAAC;EACP,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;GAAE,MAAM,CAAC;GAAG,SAAS,KAAK;GAAS,QAAQ,CAAC;EAAE,EAAE;EACxE,SAAS,OAAO,YACd,QAAQ,MAAM,SAAS;GACrB,OAAO,EAAE,aAAa,EACpB,OAAO;IAEL,MAAM,aAAa,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,MAAM,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ;IAC1E,SAAS;IACT,QAAQ,CAAC;GACX,EACF;GACA,YAAY;IACV,MAAM,WAAW,MAAM,KAAK,MAAM,KAAK,SAAS;IAChD,IAAI,aAAa,KAAA,GAAW,OAAO,EAAE,MAAM;IAC3C,OAAO,EACL,OAAO;KACL,MAAM,MAAM,KAAK,MAAM,GAAG,EAAE;KAC5B,SAAS;KACT,QAAQ,CAAC,MAAM,SAAS,GAAG,MAAM,MAAM;IACzC,EACF;GACF;GACA,YAAY;IACV,MAAM,OAAO,MAAM,OAAO;IAC1B,IAAI,SAAS,KAAA,GAAW,OAAO,EAAE,MAAM;IACvC,OAAO,EACL,OAAO;KACL,MAAM,CAAC,GAAG,MAAM,MAAM,MAAM,OAAO;KACnC,SAAS;KACT,QAAQ,MAAM,OAAO,MAAM,CAAC;IAC9B,EACF;GACF;GACA,cAAc,EAAE,OAAO;IAAE,MAAM,CAAC;IAAG,SAAS,MAAM;IAAS,QAAQ,CAAC;GAAE,EAAE;EAC1E,CAAC;CACL,CAAC,GAID,EAAE,QAAQ,CACZ;AACF;;AAGA,MAAa,WAAkB,UAAwC,MAAM,KAAK,SAAS;;AAG3F,MAAa,WAAkB,UAAwC,MAAM,OAAO,SAAS;;;;;;;;;ACjF7F,MAAa,cAAc,OAAO,OAAO,EAAE,QAAQ,OAAO,OAAO,CAAC;AAGlE,MAAa,gBAAgB,mBAAmB,EAAE,WAAW,EAAE,QAAQ,OAAO,OAAO,EAAE,CAAC;AAGxF,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,cAAc,EAAE,OAAO;EAAE,GAAG;EAAO;CAAO,EAAE,GAC5D,CAAC;AACL,CAAC;;;;;;;;ACvBD,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;AAEnF,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;GAAE,GAAG;GAAO,MAAM,UAAU,MAAM,MAAM,SAAS,MAAM,KAAK;EAAE,EACvE;EACA,iBAAiB,EACf,OAAO;GAAE,GAAG;GAAO,MAAM,UAAU,MAAM,OAAO,GAAG,MAAM,SAAS,MAAM,KAAK;EAAE,EACjF;EACA,iBAAiB,EACf,OAAO;GAAE,GAAG;GAAO,MAAM,UAAU,MAAM,OAAO,GAAG,MAAM,SAAS,MAAM,KAAK;EAAE,EACjF;EACA,aAAa,EAAE,cACb,UAAU,IACN,EAAE,OAAO;GAAE,GAAG;GAAO;GAAS,MAAM,UAAU,MAAM,MAAM,SAAS,MAAM,KAAK;EAAE,EAAE,IAClF,EAAE,MAAM;EACd,WAAW,EAAE,YACX,UAAU,QAAQ,SAAS,IACvB,EACE,OAAO;GAAE,GAAG;GAAO;GAAO,MAAM,UAAU,MAAM,MAAM,MAAM,SAAS,KAAK;EAAE,EAC9E,IACA,EAAE,MAAM;CAChB,CAAC;AACL,CAAC;;;;;;;;;;ACnED,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;;;;;;;;ACbA,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;AAE5B,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,UAAU,EAAE,OAAO,EAAE,UAAU,QAAQ,MAAM,UAAU,EAAE,EAAE,EAAE;EAC1E,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,WAAW,EAAE,OAAO,EAAE,UAAU,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE;EACnE,cAAc,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,EAAE;CAC1C,CAAC;AACL,CAAC;;;;;;;;;;;;;;;;;ACTD,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;;AAGA,MAAa,eACX,MACA,SACA,WACW;CACX,IAAI,QAAQ,OAAO,eAAe,OAAO;CACzC,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAChD,SAAS,SAAS,OAAO,SAAS,MAAM,MAAM;EAC9C,IAAI,QAAQ,KAAK,SAAS,GAAG,SAAS,OAAO;CAC/C;CACA,OAAO;AACT;;AAGA,MAAa,aACX,OACA,MACA,SACA,WACW;CACX,MAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC;CACxD,IAAI,SAAS,OAAO;CACpB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAC3B,UAAU,SAAS,GAAG,SAAS,MAAM,MAAM,IAAI,OAAO;CAExD,OAAO;AACT;;;;;;;;AASA,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,MAAM,KAAK,IAAI,GAAG,SAAS;CACjC,MAAM,SAAS,MAAM;CACrB,IAAI,QAAQ;CACZ,IAAI,SAAS,OAAO;CACpB,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,SAAS;EAC1C,MAAM,SAAS,SAAS,OAAO,SAAS,MAAM,MAAM;EACpD,IAAI,SAAS,UAAU,KAAK;GAC1B,QAAQ,QAAQ;GAChB,UAAU,SAAS,OAAO;EAC5B,OACE;CAEJ;CACA,IAAI,MAAM;CACV,IAAI,SAAS;CACb,OAAO,MAAM,SAAS,SAAS,QAAQ;EACrC,UAAU,SAAS,KAAK,SAAS,MAAM,MAAM,IAAI,OAAO;EACxD,OAAO;CACT;CACA,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;;;;;;;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,MAAM,YAAY,kBAAkB,QAAQ,KAAK,IAAI,GAAG,SAAS;AAC1E;AAEA,MAAM,WAAW,QAAgC,OAAO,SAAS,GAAG,IAAI,KAAK,IAAI,GAAG,GAAG,IAAI;AAE3F,MAAM,gBAAgB,WACpB,OAAO,SAAS,MAAM,KAAK,UAAU,IAAI,SAAS;AAEpD,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;GACxB,IAAI,SAAS,MAAM,OAAO,EAAE,MAAM;GAClC,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;GAChC,OAAO,SAAS,OACZ,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,KAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,MAAM,OAAO,GACtD,IAAI,KAAK,IAAI,GAAG,GAAG,QAAQ,OAAO;GAEpC,OAAO,EAAE,OAAO;IAAE,GAAG;IAAO;GAAQ,EAAE;EACxC;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;;;;;;;;AAkBA,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"}