@elaraai/east-ui 1.0.97 → 1.0.98

package/dist/src/platform/slice/record-area.d.ts

@@ -0,0 +1,181 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Queries for e3's generated area index (#1385): a loose quadtree laid along a
+ * Z-order curve (XZ-ordering), whose keys e3's `e3.recordIndex.area` files each
+ * row under once. The twin of `record-interval.ts`.
+ *
+ * The index's domain is the square `[−cell·2²⁷, cell·2²⁷)` world units in 29
+ * levels, a level-L cell `s_L = cell · 2^(28−L)` wide. A row is filed at the
+ * deepest level whose cell is at least twice its box's larger side, in the cell
+ * holding its box's centre, so its box lies within that cell grown by `s_L/4`
+ * on each side (its loose bounds); its key is `m · 32 + L`, `m` the cell's
+ * Morton code aligned to level 28 (x in the even bits, y in the odd). A row with
+ * no place is `−1`; one outside the domain, not finite or larger than half of it
+ * is the root's, `0`.
+ */
+import { type ValueTypeOf } from "@elaraai/east";
+import type { SeekQueryType } from "../../contracts/source.js";
+import type { RecordSliceChoiceType } from "./record-types.js";
+/** The area index's key field: the row's cell and level, after its leading fields. */
+export declare const AREA_FIELD = "__area";
+/** How an area index reads a row's box, as a binding's index metadata carries it. */
+export interface AreaMarker {
+    /** The row field holding the box's `x`. */
+    readonly x: string;
+    /** The row field holding its `y`. */
+    readonly y: string;
+    /** The row field holding its width; absent for a point. */
+    readonly width?: string;
+    /** The row field holding its height; absent for a point. */
+    readonly height?: string;
+    /** Whether `x`, `y` is the box's centre, rather than its minimum corner. */
+    readonly centre: boolean;
+    /** The finest cell's side in world units, a power of two. */
+    readonly cell: number;
+}
+/**
+ * The names of the struct `Data.bindPaged` marks an area index's `__area` with
+ * in a binding's index metadata, as an interval's start is marked with a struct
+ * naming its end: the box's fields in order — `x`, `y`, then `width` and
+ * `height` when given — each named with its role (`x=…`), so one field may hold
+ * two roles; `__centre` when the box is placed by its centre; and the cell's
+ * power of two (`cell=…`).
+ *
+ * @param box - How the index reads a row's box
+ * @returns The marker struct's field names, in order
+ */
+export declare function areaMarkerFields(box: AreaMarker): string[];
+/**
+ * Read an area index's box back from its `__area` marker's field names
+ * ({@link areaMarkerFields}).
+ *
+ * @param names - The marker struct's field names
+ * @returns The box, or `undefined` when the names are not an area marker's
+ */
+export declare function readAreaMarker(names: readonly string[]): AreaMarker | undefined;
+/** The finest level: a level-28 cell is `cell` wide. */
+export declare const AREA_FINEST_LEVEL = 28;
+/** The `__area` an unplaced row files under, as its `.east` literal: the unplaced clause's one value. */
+export declare const AREA_UNPLACED: string;
+/** The most searches a window takes a combination of leading values (§11.3). */
+export declare const MAX_AREA_SEARCHES = 266;
+/** A window's box in world units, the `window` clause's value. */
+export type AreaWindow = Extract<ValueTypeOf<RecordSliceChoiceType>, {
+    type: "window";
+}>["value"];
+/**
+ * One cell of an area index that a window or a density raster searches
+ * (§11.3, D25): its level, where it is, and the search its rows file under —
+ * at the window's or the raster's own level, the range from its own key up to
+ * its last descendant's, which holds every row filed at that level or finer
+ * whose centre lies in it; at a coarser level, its exact key, which holds the
+ * rows filed in it, their centres anywhere in it.
+ */
+export interface AreaCell {
+    /** Its level. */
+    readonly level: number;
+    /** Its index along x, at its level. */
+    readonly ix: number;
+    /** Its index along y. */
+    readonly iy: number;
+    /** Its left edge, in world units. */
+    readonly minX: number;
+    /** Its top edge. */
+    readonly minY: number;
+    /** Its side, in world units: `cell · 2^(28 − level)`. */
+    readonly side: number;
+    /** The search its rows file under: a range at the window's or the raster's level, an exact key at a coarser one. */
+    readonly query: ValueTypeOf<SeekQueryType>;
+}
+/**
+ * Plan a window over an area index (§11.3): at most {@link MAX_AREA_SEARCHES}
+ * disjoint key searches for one combination of the index's leading values,
+ * which together hold every row whose box meets the window, each once — each
+ * search a cell, where it is beside it, so a reader can weigh its count by
+ * how much of the cell a view holds.
+ *
+ * 1. The window is the viewport grown by an eighth of its larger side on each
+ *    side: the margin, which keeps a pan of that much in hand.
+ * 2. `C` is the deepest level whose cell is at least an eighth of the window's
+ *    larger side.
+ * 3. At each level coarser than `C`, the exact key of each cell whose loose
+ *    bounds meet the window. The root is searched whatever the window, since a
+ *    row outside the domain, or not finite, files under it.
+ * 4. At `C`, for each cell whose loose bounds meet the window, the range from
+ *    its own key up to its last descendant's, which starts above the coarser
+ *    cells sharing its corner that step 3 reads.
+ *
+ * Cells are never merged, so a cell's search is the same in every window that
+ * holds it, and a pan searches only the cells it adds. What the searches hold
+ * beyond the window — rows of a searched cell that the window misses — is the
+ * reader's to draw or not.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The viewport, in world units: its minimum and maximum corners
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @returns The cells, in their searches' key order
+ * @throws {Error} When the viewport is not finite or its maximum is below its
+ *   minimum, or when `cell` is not a positive power of two
+ */
+export declare function areaCells(prefix: readonly string[], box: AreaWindow, cell: number): AreaCell[];
+/**
+ * Plan a window over an area index (§11.3): its searches, as
+ * {@link areaCells} plans them, without where each cell is.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The viewport, in world units: its minimum and maximum corners
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @returns The searches, in key order
+ * @throws {Error} As {@link areaCells} does
+ */
+export declare function areaQueries(prefix: readonly string[], box: AreaWindow, cell: number): ValueTypeOf<SeekQueryType>[];
+/** The most counted ranges a density raster asks in one request (§10.4, D25). */
+export declare const MAX_AREA_RASTER = 4096;
+/** A density raster over a box (§10.4, D25): its level's cells, counted, and the coarser levels' cells, by exact key. */
+export interface AreaRaster {
+    /** Its level. */
+    readonly level: number;
+    /** Its cells' side, in world units. */
+    readonly side: number;
+    /**
+     * Its cells that meet the box, row by row: each the range holding its own rows and every finer level's inside it, so
+     * a row counts once, in the cell holding its centre.
+     */
+    readonly cells: readonly AreaCell[];
+    /**
+     * The coarser levels' cells whose loose bounds meet the box, in key order, each by its exact key: their rows are
+     * boxes larger than half a raster cell, their centres anywhere in it, which the raster's ranges leave out — counted
+     * by their keys and read as rows while they are few.
+     */
+    readonly coarse: readonly AreaCell[];
+}
+/**
+ * Plan a density raster over an area index (§10.4, D25): the counts of its
+ * cells at the level whose cells are about a sixty-fourth of the box's larger
+ * side, for one combination of the index's leading values, and no row read.
+ *
+ * 1. The raster's level `R` is the deepest whose cell is at least a
+ *    sixty-fourth of the box's larger side, coarser while its cells meeting
+ *    the box number more than `budget`.
+ * 2. Each level-`R` cell meeting the box is the range from its own key up to
+ *    its last descendant's, as {@link areaQueries}' finest level is: it holds
+ *    every row filed at `R` or finer whose centre lies in the cell, so a row
+ *    counts once, in the cell holding its centre.
+ * 3. At each level coarser than `R`, each cell whose loose bounds meet the
+ *    box, the root among them, by its exact key: those rows are boxes larger
+ *    than half a raster cell, which the ranges leave out — counted by their
+ *    keys, and read as rows while they are few.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The box the raster covers, in world units
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @param budget - The most cells the raster takes
+ * @returns The raster's level, its cells' side, its cells and the coarser levels' cells
+ * @throws {Error} When the box is not finite or its maximum is below its minimum, when `cell` is not a positive power of
+ *   two, or when `budget` is not a positive whole number
+ */
+export declare function areaRaster(prefix: readonly string[], box: AreaWindow, cell: number, budget?: number): AreaRaster;
+//# sourceMappingURL=record-area.d.ts.map

package/dist/src/platform/slice/record-area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"record-area.d.ts","sourceRoot":"","sources":["../../../../src/platform/slice/record-area.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;GAaG;AACH,OAAO,EAAyE,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AACxH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE/D,sFAAsF;AACtF,eAAO,MAAM,UAAU,WAAW,CAAC;AAEnC,qFAAqF;AACrF,MAAM,WAAW,UAAU;IACvB,2CAA2C;IAC3C,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,qCAAqC;IACrC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,4EAA4E;IAC5E,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACzB;AAQD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,UAAU,GAAG,MAAM,EAAE,CAI1D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,UAAU,GAAG,SAAS,CAkB/E;AAED,wDAAwD;AACxD,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAEpC,yGAAyG;AACzG,eAAO,MAAM,aAAa,QAA6B,CAAC;AAExD,gFAAgF;AAChF,eAAO,MAAM,iBAAiB,MAAM,CAAC;AAErC,kEAAkE;AAClE,MAAM,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,qBAAqB,CAAC,EAAE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,CAAC,OAAO,CAAC,CAAC;AA6DlG;;;;;;;GAOG;AACH,MAAM,WAAW,QAAQ;IACrB,iBAAiB;IACjB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uCAAuC;IACvC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yBAAyB;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,qCAAqC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,oBAAoB;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,yDAAyD;IACzD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,oHAAoH;IACpH,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,aAAa,CAAC,CAAC;CAC9C;AAOD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,CAkC9F;AAED;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC,aAAa,CAAC,EAAE,CAElH;AAED,iFAAiF;AACjF,eAAO,MAAM,eAAe,OAAO,CAAC;AAEpC,yHAAyH;AACzH,MAAM,WAAW,UAAU;IACvB,iBAAiB;IACjB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,uCAAuC;IACvC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;IACpC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,CAAC;CACxC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,MAAwB,GAAG,UAAU,CAmDjI"}

package/dist/src/platform/slice/record-area.js

@@ -0,0 +1,304 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Queries for e3's generated area index (#1385): a loose quadtree laid along a
+ * Z-order curve (XZ-ordering), whose keys e3's `e3.recordIndex.area` files each
+ * row under once. The twin of `record-interval.ts`.
+ *
+ * The index's domain is the square `[−cell·2²⁷, cell·2²⁷)` world units in 29
+ * levels, a level-L cell `s_L = cell · 2^(28−L)` wide. A row is filed at the
+ * deepest level whose cell is at least twice its box's larger side, in the cell
+ * holding its box's centre, so its box lies within that cell grown by `s_L/4`
+ * on each side (its loose bounds); its key is `m · 32 + L`, `m` the cell's
+ * Morton code aligned to level 28 (x in the even bits, y in the odd). A row with
+ * no place is `−1`; one outside the domain, not finite or larger than half of it
+ * is the root's, `0`.
+ */
+import { FloatType, IntegerType, compareFor, none, parseFor, printFor, variant } from "@elaraai/east";
+/** The area index's key field: the row's cell and level, after its leading fields. */
+export const AREA_FIELD = "__area";
+/** The marker's name for a box placed by its centre. */
+const AREA_CENTRE = "__centre";
+const AREA_ROLES = ["x", "y", "width", "height", "cell"];
+const floatText = printFor(FloatType);
+const floatOf = parseFor(FloatType);
+/**
+ * The names of the struct `Data.bindPaged` marks an area index's `__area` with
+ * in a binding's index metadata, as an interval's start is marked with a struct
+ * naming its end: the box's fields in order — `x`, `y`, then `width` and
+ * `height` when given — each named with its role (`x=…`), so one field may hold
+ * two roles; `__centre` when the box is placed by its centre; and the cell's
+ * power of two (`cell=…`).
+ *
+ * @param box - How the index reads a row's box
+ * @returns The marker struct's field names, in order
+ */
+export function areaMarkerFields(box) {
+    return [`x=${box.x}`, `y=${box.y}`,
+        ...(box.width === undefined || box.height === undefined ? [] : [`width=${box.width}`, `height=${box.height}`]),
+        ...(box.centre ? [AREA_CENTRE] : []), `cell=${floatText(box.cell)}`];
+}
+/**
+ * Read an area index's box back from its `__area` marker's field names
+ * ({@link areaMarkerFields}).
+ *
+ * @param names - The marker struct's field names
+ * @returns The box, or `undefined` when the names are not an area marker's
+ */
+export function readAreaMarker(names) {
+    const roles = new Map();
+    let centre = false;
+    for (const name of names) {
+        if (name === AREA_CENTRE) {
+            if (centre)
+                return undefined;
+            centre = true;
+            continue;
+        }
+        const at = name.indexOf("=");
+        const role = name.slice(0, Math.max(at, 0));
+        if (at <= 0 || !AREA_ROLES.includes(role) || roles.has(role))
+            return undefined;
+        roles.set(role, name.slice(at + 1));
+    }
+    const x = roles.get("x"), y = roles.get("y"), width = roles.get("width"), height = roles.get("height");
+    const cell = floatOf(roles.get("cell") ?? "");
+    if (x === undefined || y === undefined || (width === undefined) !== (height === undefined) || !cell.success || !(cell.value > 0))
+        return undefined;
+    return { x, y, ...(width !== undefined && height !== undefined && { width, height }), centre, cell: cell.value };
+}
+/** The finest level: a level-28 cell is `cell` wide. */
+export const AREA_FINEST_LEVEL = 28;
+/** The `__area` an unplaced row files under, as its `.east` literal: the unplaced clause's one value. */
+export const AREA_UNPLACED = printFor(IntegerType)(-1n);
+/** The most searches a window takes a combination of leading values (§11.3). */
+export const MAX_AREA_SEARCHES = 266;
+const integerText = printFor(IntegerType);
+const keyOrder = compareFor(IntegerType);
+const FINEST = BigInt(AREA_FINEST_LEVEL);
+/**
+ * The cells of a level whose loose bounds meet an interval, on one axis.
+ *
+ * @remarks
+ * Every bound is exact: a cell's edges are multiples of its side, a power of
+ * two, and its loose bounds a quarter of its side beyond them. A row placed by
+ * its box's corner is filed by the centre its key function computes, `x + w/2`,
+ * which rounds at most onto a cell's edge, never past one, so its box lies
+ * within the loose bounds of the cell it is filed in, as a centred box's does.
+ *
+ * @param from - The interval's lower end
+ * @param to - Its upper end
+ * @param half - Half the domain's side
+ * @param size - The level's cell side
+ * @param count - The level's cells along the axis
+ * @returns The cells' indices along the axis, ascending
+ */
+function cellsMeeting(from, to, half, size, count) {
+    const reach = size / 4;
+    // A conservative span of candidates, each then held to the exact test.
+    const lo = Math.max(0, Math.floor((from + half - size - reach) / size) - 1);
+    const hi = Math.min(count - 1, Math.floor((to + half + reach) / size) + 1);
+    const cells = [];
+    for (let i = lo; i <= hi; i++) {
+        const start = -half + i * size;
+        if (start - reach <= to && start + size + reach >= from)
+            cells.push(i);
+    }
+    return cells;
+}
+/** Each byte's bits spread to the even places of sixteen: a byte of one axis's half of a Morton code. */
+const SPREAD = Array.from({ length: 256 }, (_, byte) => {
+    let spread = 0;
+    for (let bit = 0; bit < 8; bit++)
+        spread |= ((byte >> bit) & 1) << (2 * bit);
+    return spread;
+});
+/**
+ * The Morton code of a level's cell, aligned to the finest level: a byte of
+ * each axis at a time, as a raster of thousands of cells computes thousands.
+ *
+ * @param ix - The cell's index along x at its level, below `2 ** level`
+ * @param iy - Its index along y
+ * @param level - Its level
+ * @returns x's bits in the even places, y's in the odd, shifted to level 28
+ */
+function morton(ix, iy, level) {
+    let code = 0n;
+    for (let byte = 3; byte >= 0; byte--) {
+        const shift = 8 * byte;
+        code = (code << 16n) | BigInt(SPREAD[(ix >>> shift) & 255] | (SPREAD[(iy >>> shift) & 255] << 1));
+    }
+    return code << BigInt(2 * (AREA_FINEST_LEVEL - level));
+}
+/** A level's cell, its search given: where it is, from its indices. */
+function cellAt(level, ix, iy, half, side, query) {
+    return { level, ix, iy, minX: -half + ix * side, minY: -half + iy * side, side, query };
+}
+/**
+ * Plan a window over an area index (§11.3): at most {@link MAX_AREA_SEARCHES}
+ * disjoint key searches for one combination of the index's leading values,
+ * which together hold every row whose box meets the window, each once — each
+ * search a cell, where it is beside it, so a reader can weigh its count by
+ * how much of the cell a view holds.
+ *
+ * 1. The window is the viewport grown by an eighth of its larger side on each
+ *    side: the margin, which keeps a pan of that much in hand.
+ * 2. `C` is the deepest level whose cell is at least an eighth of the window's
+ *    larger side.
+ * 3. At each level coarser than `C`, the exact key of each cell whose loose
+ *    bounds meet the window. The root is searched whatever the window, since a
+ *    row outside the domain, or not finite, files under it.
+ * 4. At `C`, for each cell whose loose bounds meet the window, the range from
+ *    its own key up to its last descendant's, which starts above the coarser
+ *    cells sharing its corner that step 3 reads.
+ *
+ * Cells are never merged, so a cell's search is the same in every window that
+ * holds it, and a pan searches only the cells it adds. What the searches hold
+ * beyond the window — rows of a searched cell that the window misses — is the
+ * reader's to draw or not.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The viewport, in world units: its minimum and maximum corners
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @returns The cells, in their searches' key order
+ * @throws {Error} When the viewport is not finite or its maximum is below its
+ *   minimum, or when `cell` is not a positive power of two
+ */
+export function areaCells(prefix, box, cell) {
+    const { minX, minY, maxX, maxY } = box;
+    if (![minX, minY, maxX, maxY].every(Number.isFinite))
+        throw new Error("Choose a window with finite bounds");
+    if (maxX < minX || maxY < minY)
+        throw new Error("A window's maximum is below its minimum");
+    if (!Number.isFinite(cell) || cell <= 0 || 2 ** Math.round(Math.log2(cell)) !== cell) {
+        throw new Error(`An area index's cell is a positive power of two, not ${cell}`);
+    }
+    const margin = Math.max(maxX - minX, maxY - minY) / 8;
+    const fromX = minX - margin, toX = maxX + margin, fromY = minY - margin, toY = maxY + margin;
+    const larger = Math.max(toX - fromX, toY - fromY);
+    const half = cell * 2 ** 27;
+    let deepest = AREA_FINEST_LEVEL;
+    while (deepest > 0 && cell * 2 ** (AREA_FINEST_LEVEL - deepest) < larger / 8)
+        deepest--;
+    const searches = [];
+    for (let level = 0; level <= deepest; level++) {
+        const size = cell * 2 ** (AREA_FINEST_LEVEL - level);
+        const count = 2 ** level;
+        const xs = level === 0 ? [0] : cellsMeeting(fromX, toX, half, size, count);
+        const ys = level === 0 ? [0] : cellsMeeting(fromY, toY, half, size, count);
+        for (const ix of xs) {
+            for (const iy of ys) {
+                const m = morton(ix, iy, level);
+                const start = m * 32n + BigInt(level);
+                if (level < deepest) {
+                    searches.push({ start, cell: cellAt(level, ix, iy, half, size, variant("fields", { values: [...prefix, integerText(start)], prefix: none })) });
+                    continue;
+                }
+                const end = (m + 4n ** (FINEST - BigInt(level))) * 32n;
+                const query = variant("range", { from: [...prefix, integerText(start)], to: [...prefix, integerText(end)] });
+                searches.push({ start, cell: cellAt(level, ix, iy, half, size, query) });
+            }
+        }
+    }
+    return searches.sort((a, b) => keyOrder(a.start, b.start)).map(search => search.cell);
+}
+/**
+ * Plan a window over an area index (§11.3): its searches, as
+ * {@link areaCells} plans them, without where each cell is.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The viewport, in world units: its minimum and maximum corners
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @returns The searches, in key order
+ * @throws {Error} As {@link areaCells} does
+ */
+export function areaQueries(prefix, box, cell) {
+    return areaCells(prefix, box, cell).map(found => found.query);
+}
+/** The most counted ranges a density raster asks in one request (§10.4, D25). */
+export const MAX_AREA_RASTER = 4096;
+/**
+ * Plan a density raster over an area index (§10.4, D25): the counts of its
+ * cells at the level whose cells are about a sixty-fourth of the box's larger
+ * side, for one combination of the index's leading values, and no row read.
+ *
+ * 1. The raster's level `R` is the deepest whose cell is at least a
+ *    sixty-fourth of the box's larger side, coarser while its cells meeting
+ *    the box number more than `budget`.
+ * 2. Each level-`R` cell meeting the box is the range from its own key up to
+ *    its last descendant's, as {@link areaQueries}' finest level is: it holds
+ *    every row filed at `R` or finer whose centre lies in the cell, so a row
+ *    counts once, in the cell holding its centre.
+ * 3. At each level coarser than `R`, each cell whose loose bounds meet the
+ *    box, the root among them, by its exact key: those rows are boxes larger
+ *    than half a raster cell, which the ranges leave out — counted by their
+ *    keys, and read as rows while they are few.
+ *
+ * @param prefix - The `.east` literals of the index's leading fields, in order
+ * @param box - The box the raster covers, in world units
+ * @param cell - The index's finest cell's side, a power of two (its `area.cell`)
+ * @param budget - The most cells the raster takes
+ * @returns The raster's level, its cells' side, its cells and the coarser levels' cells
+ * @throws {Error} When the box is not finite or its maximum is below its minimum, when `cell` is not a positive power of
+ *   two, or when `budget` is not a positive whole number
+ */
+export function areaRaster(prefix, box, cell, budget = MAX_AREA_RASTER) {
+    const { minX, minY, maxX, maxY } = box;
+    if (![minX, minY, maxX, maxY].every(Number.isFinite))
+        throw new Error("Choose a raster's box with finite bounds");
+    if (maxX < minX || maxY < minY)
+        throw new Error("A raster's box has its maximum below its minimum");
+    if (!Number.isFinite(cell) || cell <= 0 || 2 ** Math.round(Math.log2(cell)) !== cell) {
+        throw new Error(`An area index's cell is a positive power of two, not ${cell}`);
+    }
+    if (!Number.isInteger(budget) || budget < 1)
+        throw new Error(`A raster takes at least one cell, not ${budget}`);
+    const half = cell * 2 ** 27;
+    const larger = Math.max(maxX - minX, maxY - minY);
+    // The cells of a level whose own bounds meet an interval, on one axis: the first and the last, inside the domain.
+    const span = (from, to, size, count) => {
+        const lo = Math.max(0, Math.floor((from + half) / size));
+        const hi = Math.min(count - 1, Math.floor((to + half) / size));
+        return hi < lo ? undefined : [lo, hi];
+    };
+    let level = AREA_FINEST_LEVEL;
+    while (level > 0 && cell * 2 ** (AREA_FINEST_LEVEL - level) < larger / 64)
+        level--;
+    const sizeOf = (l) => cell * 2 ** (AREA_FINEST_LEVEL - l);
+    const cellsAt = (l) => {
+        const xs = span(minX, maxX, sizeOf(l), 2 ** l);
+        const ys = span(minY, maxY, sizeOf(l), 2 ** l);
+        return xs === undefined || ys === undefined ? 0 : (xs[1] - xs[0] + 1) * (ys[1] - ys[0] + 1);
+    };
+    while (level > 0 && cellsAt(level) > budget)
+        level--;
+    const side = sizeOf(level);
+    const cells = [];
+    const xs = span(minX, maxX, side, 2 ** level);
+    const ys = span(minY, maxY, side, 2 ** level);
+    if (xs !== undefined && ys !== undefined) {
+        const descendants = 4n ** (FINEST - BigInt(level));
+        for (let iy = ys[0]; iy <= ys[1]; iy++) {
+            for (let ix = xs[0]; ix <= xs[1]; ix++) {
+                const m = morton(ix, iy, level);
+                const query = variant("range", { from: [...prefix, integerText(m * 32n + BigInt(level))], to: [...prefix, integerText((m + descendants) * 32n)] });
+                cells.push(cellAt(level, ix, iy, half, side, query));
+            }
+        }
+    }
+    const coarse = [];
+    for (let l = 0; l < level; l++) {
+        const size = sizeOf(l);
+        const count = 2 ** l;
+        for (const ix of l === 0 ? [0] : cellsMeeting(minX, maxX, half, size, count)) {
+            for (const iy of l === 0 ? [0] : cellsMeeting(minY, maxY, half, size, count)) {
+                const start = morton(ix, iy, l) * 32n + BigInt(l);
+                coarse.push({ start, cell: cellAt(l, ix, iy, half, size, variant("fields", { values: [...prefix, integerText(start)], prefix: none })) });
+            }
+        }
+    }
+    return { level, side, cells, coarse: coarse.sort((a, b) => keyOrder(a.start, b.start)).map(search => search.cell) };
+}
+//# sourceMappingURL=record-area.js.map

package/dist/src/platform/slice/record-area.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"record-area.js","sourceRoot":"","sources":["../../../../src/platform/slice/record-area.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;GAaG;AACH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAoB,MAAM,eAAe,CAAC;AAIxH,sFAAsF;AACtF,MAAM,CAAC,MAAM,UAAU,GAAG,QAAQ,CAAC;AAkBnC,wDAAwD;AACxD,MAAM,WAAW,GAAG,UAAU,CAAC;AAC/B,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAU,CAAC;AAClE,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;AACtC,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;AAEpC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAe;IAC5C,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE;QAC9B,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,KAAK,EAAE,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9G,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,KAAwB;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;YACvB,IAAI,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC7B,MAAM,GAAG,IAAI,CAAC;YACd,SAAS;QACb,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,IAAI,CAAC,IAAI,CAAE,UAAgC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QACtG,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvG,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACnJ,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AACrH,CAAC;AAED,wDAAwD;AACxD,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAEpC,yGAAyG;AACzG,MAAM,CAAC,MAAM,aAAa,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAExD,gFAAgF;AAChF,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAKrC,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1C,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;AACzC,MAAM,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAEzC;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,YAAY,CAAC,IAAY,EAAE,EAAU,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACvB,uEAAuE;IACvE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5E,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;QAC/B,IAAI,KAAK,GAAG,KAAK,IAAI,EAAE,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,yGAAyG;AACzG,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;IACnD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;QAAE,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC7E,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,SAAS,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,KAAa;IACjD,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;QACvB,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,GAAG,GAAG,CAAE,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,GAAG,GAAG,CAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACxG,CAAC;IACD,OAAO,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC;AAC3D,CAAC;AA2BD,uEAAuE;AACvE,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU,EAAE,EAAU,EAAE,IAAY,EAAE,IAAY,EAAE,KAAiC;IAChH,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5F,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,SAAS,CAAC,MAAyB,EAAE,GAAe,EAAE,IAAY;IAC9E,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;IACvC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC5G,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC3F,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnF,MAAM,IAAI,KAAK,CAAC,wDAAwD,IAAI,EAAE,CAAC,CAAC;IACpF,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,MAAM,EAAE,GAAG,GAAG,IAAI,GAAG,MAAM,EAAE,KAAK,GAAG,IAAI,GAAG,MAAM,EAAE,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;IAC7F,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAG,iBAAiB,CAAC;IAChC,OAAO,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACxF,MAAM,QAAQ,GAAwC,EAAE,CAAC;IACzD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC;QACzB,MAAM,EAAE,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3E,MAAM,EAAE,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3E,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;gBAChC,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBACtC,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;oBAClB,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBAChJ,SAAS;gBACb,CAAC;gBACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACvD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC7G,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YAC7E,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC1F,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,WAAW,CAAC,MAAyB,EAAE,GAAe,EAAE,IAAY;IAChF,OAAO,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED,iFAAiF;AACjF,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,CAAC;AAqBpC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,UAAU,CAAC,MAAyB,EAAE,GAAe,EAAE,IAAY,EAAE,SAAiB,eAAe;IACjH,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;IACvC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAClH,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACpG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACnF,MAAM,IAAI,KAAK,CAAC,wDAAwD,IAAI,EAAE,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,MAAM,EAAE,CAAC,CAAC;IAChH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;IAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAClD,kHAAkH;IAClH,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,IAAY,EAAE,KAAa,EAAgC,EAAE;QACjG,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACzD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC/D,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC;IACF,IAAI,KAAK,GAAG,iBAAiB,CAAC;IAC9B,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC,GAAG,MAAM,GAAG,EAAE;QAAE,KAAK,EAAE,CAAC;IACnF,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC;IACF,OAAO,KAAK,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,MAAM;QAAE,KAAK,EAAE,CAAC;IACrD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9C,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;QACvC,MAAM,WAAW,GAAG,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YACrC,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;gBAChC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnJ,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACzD,CAAC;QACL,CAAC;IACL,CAAC;IACD,MAAM,MAAM,GAAwC,EAAE,CAAC;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAC3E,KAAK,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC3E,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9I,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AACxH,CAAC"}