@motionscript/geo 0.0.0-stage → 0.1.0-alpha.3

package/dist/border/geometry.js

@@ -0,0 +1,382 @@
+import { geoArea, geoBounds, geoConicEqualArea, geoEquirectangular, geoMercator, geoOrthographic, geoPath, geoStream, } from "d3-geo";
+import { ringCoordinates } from "./format.js";
+const FIT = 1024;
+// `detail` maps onto a weight threshold that is a fraction of the selection's
+// own area, on a log scale — which is what makes a value look equally stylised
+// on Monaco and on Russia. 0 keeps points worth 1% of the area; just below 1,
+// points worth a billionth of it.
+const POINT_BASE = 2;
+const POINT_RANGE = 7;
+const POLYGON_BASE = 1.5;
+const POLYGON_RANGE = 6;
+const clamp01 = (value) => (value > 1 ? 1 : value > 0 ? value : 0);
+/** The highest weight bucket a point may carry and still be drawn. */
+export function pointBucketLimit(detail, area) {
+    if (detail >= 1 || !(area > 0))
+        return 255;
+    const minWeight = area * 10 ** -(POINT_BASE + POINT_RANGE * clamp01(detail));
+    return Math.floor(-2 * Math.log2(minWeight));
+}
+/** Rings smaller than this (steradians) are dropped, bar each region's largest. */
+export function polygonAreaLimit(detail, area) {
+    if (detail >= 1)
+        return 0;
+    return area * 10 ** -(POLYGON_BASE + POLYGON_RANGE * clamp01(detail));
+}
+function partsOf(features, frame) {
+    const parts = [];
+    for (const feature of features) {
+        const mainland = frame === "mainland" ? feature.polygons.filter((p) => p.mainland) : [];
+        const polygons = mainland.length > 0 ? mainland : feature.polygons;
+        let largest = null;
+        for (const polygon of polygons)
+            if (!largest || polygon.area > largest.area)
+                largest = polygon;
+        for (const polygon of polygons)
+            parts.push({ polygon, largest: polygon === largest });
+    }
+    return parts;
+}
+function centerLongitude(west, east) {
+    if (west <= east)
+        return (west + east) / 2;
+    const mid = (west + east + 360) / 2;
+    return mid > 180 ? mid - 360 : mid;
+}
+function makeProjection(kind, west, south, east, north) {
+    const lon = centerLongitude(west, east);
+    const lat = (south + north) / 2;
+    switch (kind) {
+        case "mercator":
+            return geoMercator().rotate([-lon, 0]);
+        case "equirectangular":
+            return geoEquirectangular().rotate([-lon, 0]);
+        case "orthographic":
+            return geoOrthographic().rotate([-lon, -lat]);
+        case "conic": {
+            const span = north - south;
+            return geoConicEqualArea()
+                .rotate([-lon, 0])
+                .center([0, lat])
+                .parallels([south + span / 6, north - span / 6]);
+        }
+    }
+}
+function fitFrame(kind, parts) {
+    if (parts.length === 0)
+        return null;
+    const shape = {
+        type: "MultiPolygon",
+        coordinates: parts.map(({ polygon }) => [ringCoordinates(polygon.rings[0])]),
+    };
+    const [[west, south], [east, north]] = geoBounds(shape);
+    for (const candidate of [kind, "equirectangular"]) {
+        const projection = makeProjection(candidate, west, south, east, north).fitSize([FIT, FIT], shape);
+        const [[x0, y0], [x1, y1]] = geoPath(projection).bounds(shape);
+        const size = Math.max(x1 - x0, y1 - y0);
+        if (!Number.isFinite(size) || size <= 0)
+            continue;
+        return {
+            projection,
+            centerX: (x0 + x1) / 2,
+            centerY: (y0 + y1) / 2,
+            size,
+            width: (x1 - x0) / size,
+            height: (y1 - y0) / size,
+        };
+    }
+    return null;
+}
+function project(frame, object, closed) {
+    const contours = [];
+    let current = null;
+    const { centerX, centerY, size } = frame;
+    const sink = {
+        point(x, y) {
+            current?.push((x - centerX) / size, -(y - centerY) / size);
+        },
+        lineStart() {
+            current = [];
+        },
+        lineEnd() {
+            const flat = current;
+            current = null;
+            if (!flat || flat.length < 4)
+                return;
+            let isClosed = closed;
+            if (!closed) {
+                const n = flat.length;
+                if (flat[0] === flat[n - 2] && flat[1] === flat[n - 1] && n >= 8) {
+                    flat.length = n - 2;
+                    isClosed = true;
+                }
+            }
+            const points = Float32Array.from(flat);
+            contours.push({ points, closed: isClosed, length: contourLength(points, isClosed) });
+        },
+        polygonStart() { },
+        polygonEnd() { },
+        sphere() { },
+    };
+    geoStream(object, frame.projection.stream(sink));
+    return contours;
+}
+function contourLength(points, closed) {
+    let length = 0;
+    const n = points.length / 2;
+    for (let i = 1; i < n; i++) {
+        length += Math.hypot(points[i * 2] - points[i * 2 - 2], points[i * 2 + 1] - points[i * 2 - 1]);
+    }
+    if (closed && n > 1)
+        length += Math.hypot(points[0] - points[n * 2 - 2], points[1] - points[n * 2 - 1]);
+    return length;
+}
+// Longest edge, in degrees, that simplification may leave. d3 takes an edge as
+// the short way round the sphere, so an edge across more than half the planet
+// (Kaliningrad to Chukotka, once the coast between is dropped) turns inside out.
+const MAX_EDGE_DEGREES = 20;
+/** Which of an arc's points survive `limit`, the same whichever way the arc is walked. */
+function keepMask(arc, limit) {
+    const n = arc.buckets.length;
+    const mask = new Uint8Array(n);
+    let lastLon = arc.points[0];
+    let lastLat = arc.points[1];
+    for (let i = 0; i < n; i++) {
+        const lon = arc.points[i * 2];
+        const lat = arc.points[i * 2 + 1];
+        let far = false;
+        if (arc.buckets[i] > limit) {
+            let dLon = Math.abs(lon - lastLon);
+            if (dLon > 180)
+                dLon = 360 - dLon;
+            far = Math.abs(lat - lastLat) > MAX_EDGE_DEGREES || dLon * Math.cos((lat * Math.PI) / 180) > MAX_EDGE_DEGREES;
+        }
+        if (arc.buckets[i] <= limit || far) {
+            mask[i] = 1;
+            lastLon = lon;
+            lastLat = lat;
+        }
+    }
+    return mask;
+}
+function filteredPoints(refs, maskFor) {
+    const out = [];
+    for (const { arc, reversed } of refs) {
+        const n = arc.buckets.length;
+        const mask = maskFor(arc);
+        for (let j = out.length === 0 ? 0 : 1; j < n; j++) {
+            const i = reversed ? n - 1 - j : j;
+            if (mask[i])
+                out.push([arc.points[i * 2], arc.points[i * 2 + 1]]);
+        }
+    }
+    return out;
+}
+/** A ring keeps at least three vertices, raising its arcs' limits if the global one would collapse it. */
+function ringLimit(ring, limit) {
+    let kept = 0;
+    for (const { arc } of ring) {
+        for (let i = 0; i < arc.buckets.length - 1; i++)
+            if (arc.buckets[i] <= limit)
+                kept++;
+    }
+    if (kept >= 3)
+        return limit;
+    const buckets = [];
+    for (const { arc } of ring)
+        for (let i = 0; i < arc.buckets.length - 1; i++)
+            buckets.push(arc.buckets[i]);
+    buckets.sort((a, b) => a - b);
+    return Math.max(limit, buckets[Math.min(2, buckets.length - 1)] ?? limit);
+}
+/**
+ * Whether a simplified ring still winds the way its original did. Dropping
+ * points can fold a small ring over itself, and d3 reads an exterior wound the
+ * wrong way as the rest of the planet — one such island fills the whole frame.
+ */
+function windsAsOriginal(ring, exterior) {
+    if (ring.length < 4)
+        return true;
+    const inverted = geoArea({ type: "Polygon", coordinates: [ring] }) > 2 * Math.PI;
+    return inverted !== exterior;
+}
+const endKey = (arc, last) => {
+    const i = last ? arc.buckets.length - 1 : 0;
+    return `${arc.points[i * 2]},${arc.points[i * 2 + 1]}`;
+};
+/** Joins arcs that meet end to end with nothing else at the joint, so a border draws as one line with real joins. */
+function chainArcs(arcs) {
+    const atNode = new Map();
+    for (const arc of arcs) {
+        for (const key of [endKey(arc, false), endKey(arc, true)]) {
+            const list = atNode.get(key);
+            if (list)
+                list.push(arc);
+            else
+                atNode.set(key, [arc]);
+        }
+    }
+    const visited = new Set();
+    const chains = [];
+    const refStart = ({ arc, reversed }) => endKey(arc, reversed);
+    const refEnd = ({ arc, reversed }) => endKey(arc, !reversed);
+    const nextAt = (node) => {
+        const list = atNode.get(node);
+        if (list.length !== 2)
+            return null;
+        return list.find((arc) => !visited.has(arc)) ?? null;
+    };
+    for (const arc of arcs) {
+        if (visited.has(arc))
+            continue;
+        visited.add(arc);
+        const refs = [{ arc, reversed: false }];
+        for (let next = nextAt(refEnd(refs[refs.length - 1])); next; next = nextAt(refEnd(refs[refs.length - 1]))) {
+            visited.add(next);
+            refs.push({ arc: next, reversed: endKey(next, false) !== refEnd(refs[refs.length - 1]) });
+        }
+        for (let prev = nextAt(refStart(refs[0])); prev; prev = nextAt(refStart(refs[0]))) {
+            visited.add(prev);
+            refs.unshift({ arc: prev, reversed: endKey(prev, true) !== refStart(refs[0]) });
+        }
+        chains.push({ refs, closed: refStart(refs[0]) === refEnd(refs[refs.length - 1]) });
+    }
+    return chains;
+}
+function buildGeometry(features, frame, fitted, borders, detail) {
+    const parts = partsOf(features, frame);
+    const area = parts.reduce((sum, { polygon }) => sum + polygon.area, 0);
+    const pointLimit = pointBucketLimit(detail, area);
+    const polygonLimit = polygonAreaLimit(detail, area);
+    const kept = [];
+    for (const { polygon, largest } of parts) {
+        if (!largest && polygon.area < polygonLimit)
+            continue;
+        kept.push(polygon.rings.filter((_, i) => i === 0 || polygon.ringAreas[i] >= polygonLimit));
+    }
+    const limits = new Map();
+    const usage = new Map();
+    for (const rings of kept) {
+        for (const ring of rings) {
+            const limit = ringLimit(ring, pointLimit);
+            for (const { arc } of ring) {
+                limits.set(arc.key, Math.max(limits.get(arc.key) ?? 0, limit));
+                const use = usage.get(arc.key);
+                if (use)
+                    use.count++;
+                else
+                    usage.set(arc.key, { arc, count: 1 });
+            }
+        }
+    }
+    const masks = new Map();
+    const maskFor = (arc) => {
+        let mask = masks.get(arc.key);
+        if (!mask) {
+            mask = keepMask(arc, limits.get(arc.key) ?? 255);
+            masks.set(arc.key, mask);
+        }
+        return mask;
+    };
+    if (pointLimit < 255) {
+        for (const rings of kept) {
+            rings.forEach((ring, index) => {
+                let limit = Math.min(...ring.map(({ arc }) => limits.get(arc.key) ?? pointLimit));
+                while (limit < 255 && !windsAsOriginal(filteredPoints(ring, maskFor), index === 0)) {
+                    limit = Math.min(255, limit + 2);
+                    for (const { arc } of ring) {
+                        limits.set(arc.key, Math.max(limits.get(arc.key) ?? 0, limit));
+                        masks.delete(arc.key);
+                    }
+                }
+            });
+        }
+    }
+    const fills = project(fitted, {
+        type: "MultiPolygon",
+        coordinates: kept.flatMap((rings) => {
+            const [exterior, ...holes] = rings.map((ring) => filteredPoints(ring, maskFor));
+            return exterior.length < 4 ? [] : [[exterior, ...holes.filter((hole) => hole.length >= 4)]];
+        }),
+    }, true);
+    const lineArcs = [...usage.values()].filter(({ count }) => borders === "all" || count === 1).map(({ arc }) => arc);
+    const lines = [];
+    for (const chain of chainArcs(lineArcs)) {
+        lines.push(...project(fitted, { type: "LineString", coordinates: filteredPoints(chain.refs, maskFor) }, false));
+    }
+    const sum = (contours) => contours.reduce((total, c) => total + c.length, 0);
+    const bytes = [...fills, ...lines].reduce((total, c) => total + c.points.byteLength + 32, 0);
+    return {
+        width: fitted.width,
+        height: fitted.height,
+        fills,
+        lines,
+        fillLength: sum(fills),
+        lineLength: sum(lines),
+        bytes,
+    };
+}
+class ByteCache {
+    _budget;
+    _entries = new Map();
+    _bytes = 0;
+    constructor(_budget) {
+        this._budget = _budget;
+    }
+    get(key) {
+        const value = this._entries.get(key);
+        if (value) {
+            this._entries.delete(key);
+            this._entries.set(key, value);
+        }
+        return value;
+    }
+    set(key, value) {
+        const previous = this._entries.get(key);
+        if (previous)
+            this._bytes -= previous.bytes;
+        this._entries.delete(key);
+        this._entries.set(key, value);
+        this._bytes += value.bytes;
+        for (const [oldest, entry] of this._entries) {
+            if (this._bytes <= this._budget || this._entries.size <= 1)
+                break;
+            this._entries.delete(oldest);
+            this._bytes -= entry.bytes;
+        }
+    }
+    clear() {
+        this._entries.clear();
+        this._bytes = 0;
+    }
+}
+const frames = new ByteCache(64);
+const geometries = new ByteCache(64 * 1024 * 1024);
+/**
+ * The drawing for a selection, cached. The projection is fitted to the
+ * selection at full detail, so a `detail` tween never moves or rescales it.
+ */
+export function geoGeometry(request) {
+    const detail = Math.round(clamp01(request.detail) * 100) / 100;
+    const frameKey = `${request.selectionKey}|${request.projection}`;
+    const key = `${frameKey}|${request.borders}|${detail}`;
+    const cached = geometries.get(key);
+    if (cached)
+        return cached;
+    let fitted = frames.get(frameKey);
+    if (!fitted) {
+        const made = fitFrame(request.projection, partsOf(request.features, request.frame));
+        if (!made)
+            return null;
+        fitted = made;
+        frames.set(frameKey, { ...made, bytes: 1 });
+    }
+    const geometry = buildGeometry(request.features, request.frame, fitted, request.borders, detail);
+    geometries.set(key, geometry);
+    return geometry;
+}
+export function clearGeoGeometry() {
+    frames.clear();
+    geometries.clear();
+}
+//# sourceMappingURL=geometry.js.map

package/dist/border/geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.js","sourceRoot":"","sources":["../../src/border/geometry.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,OAAO,EACP,SAAS,EACT,iBAAiB,EACjB,kBAAkB,EAClB,WAAW,EACX,eAAe,EACf,OAAO,EACP,SAAS,GAGZ,MAAM,QAAQ,CAAA;AAEf,OAAO,EAAE,eAAe,EAAkE,MAAM,UAAU,CAAA;AAsC1G,MAAM,GAAG,GAAG,IAAI,CAAA;AAEhB,8EAA8E;AAC9E,+EAA+E;AAC/E,8EAA8E;AAC9E,kCAAkC;AAClC,MAAM,UAAU,GAAG,CAAC,CAAA;AACpB,MAAM,WAAW,GAAG,CAAC,CAAA;AACrB,MAAM,YAAY,GAAG,GAAG,CAAA;AACxB,MAAM,aAAa,GAAG,CAAC,CAAA;AAEvB,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAE1E,sEAAsE;AACtE,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,IAAY;IACzD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAAE,OAAO,GAAG,CAAA;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC,UAAU,GAAG,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAA;IAC5E,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAA;AAChD,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,IAAY;IACzD,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAA;IACzB,OAAO,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC,YAAY,GAAG,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAA;AACzE,CAAC;AAED,SAAS,OAAO,CAAC,QAA+B,EAAE,KAAe;IAC7D,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QACvF,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAA;QAClE,IAAI,OAAO,GAAsB,IAAI,CAAA;QACrC,KAAK,MAAM,OAAO,IAAI,QAAQ;YAAE,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI;gBAAE,OAAO,GAAG,OAAO,CAAA;QAC9F,KAAK,MAAM,OAAO,IAAI,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,KAAK,OAAO,EAAE,CAAC,CAAA;IACzF,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,IAAY;IAC/C,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;IAC1C,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;IACnC,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;AACtC,CAAC;AAED,SAAS,cAAc,CAAC,IAAuB,EAAE,IAAY,EAAE,KAAa,EAAE,IAAY,EAAE,KAAa;IACrG,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACvC,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IAC/B,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,UAAU;YACX,OAAO,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;QAC1C,KAAK,iBAAiB;YAClB,OAAO,kBAAkB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;QACjD,KAAK,cAAc;YACf,OAAO,eAAe,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACjD,KAAK,OAAO,CAAC,CAAC,CAAC;YACX,MAAM,IAAI,GAAG,KAAK,GAAG,KAAK,CAAA;YAC1B,OAAO,iBAAiB,EAAE;iBACrB,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;iBACjB,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;iBAChB,SAAS,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;QACxD,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,QAAQ,CAAC,IAAuB,EAAE,KAAsB;IAC7D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACnC,MAAM,KAAK,GAAG;QACV,IAAI,EAAE,cAAc;QACpB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACtD,CAAA;IAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;IAEvD,KAAK,MAAM,SAAS,IAAI,CAAC,IAAI,EAAE,iBAAiB,CAAU,EAAE,CAAC;QACzD,MAAM,UAAU,GAAG,cAAc,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;QACjG,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;QACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;YAAE,SAAQ;QACjD,OAAO;YACH,UAAU;YACV,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;YACtB,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;YACtB,IAAI;YACJ,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;YACvB,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;SAC3B,CAAA;IACL,CAAC;IACD,OAAO,IAAI,CAAA;AACf,CAAC;AAED,SAAS,OAAO,CAAC,KAAY,EAAE,MAA6B,EAAE,MAAe;IACzE,MAAM,QAAQ,GAAiB,EAAE,CAAA;IACjC,IAAI,OAAO,GAAoB,IAAI,CAAA;IACnC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,KAAK,CAAA;IACxC,MAAM,IAAI,GAAG;QACT,KAAK,CAAC,CAAS,EAAE,CAAS;YACtB,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,CAAA;QAC9D,CAAC;QACD,SAAS;YACL,OAAO,GAAG,EAAE,CAAA;QAChB,CAAC;QACD,OAAO;YACH,MAAM,IAAI,GAAG,OAAO,CAAA;YACpB,OAAO,GAAG,IAAI,CAAA;YACd,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAM;YACpC,IAAI,QAAQ,GAAG,MAAM,CAAA;YACrB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACV,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;gBACrB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;oBACnB,QAAQ,GAAG,IAAI,CAAA;gBACnB,CAAC;YACL,CAAC;YACD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACtC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAA;QACxF,CAAC;QACD,YAAY,KAAI,CAAC;QACjB,UAAU,KAAI,CAAC;QACf,MAAM,KAAI,CAAC;KACd,CAAA;IACD,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;IAChD,OAAO,QAAQ,CAAA;AACnB,CAAC;AAED,SAAS,aAAa,CAAC,MAAoB,EAAE,MAAe;IACxD,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClG,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACvG,OAAO,MAAM,CAAA;AACjB,CAAC;AAED,+EAA+E;AAC/E,8EAA8E;AAC9E,iFAAiF;AACjF,MAAM,gBAAgB,GAAG,EAAE,CAAA;AAI3B,0FAA0F;AAC1F,SAAS,QAAQ,CAAC,GAAW,EAAE,KAAa;IACxC,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAA;IAC5B,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;IAC9B,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACjC,IAAI,GAAG,GAAG,KAAK,CAAA;QACf,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC,CAAA;YAClC,IAAI,IAAI,GAAG,GAAG;gBAAE,IAAI,GAAG,GAAG,GAAG,IAAI,CAAA;YACjC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,gBAAgB,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,gBAAgB,CAAA;QACjH,CAAC;QACD,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YACX,OAAO,GAAG,GAAG,CAAA;YACb,OAAO,GAAG,GAAG,CAAA;QACjB,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAA;AACf,CAAC;AAED,SAAS,cAAc,CAAC,IAA2B,EAAE,OAAgB;IACjE,MAAM,GAAG,GAAuB,EAAE,CAAA;IAClC,KAAK,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAA;QAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAClC,IAAI,IAAI,CAAC,CAAC,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACrE,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,0GAA0G;AAC1G,SAAS,SAAS,CAAC,IAA2B,EAAE,KAAa;IACzD,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK;gBAAE,IAAI,EAAE,CAAA;IACxF,CAAC;IACD,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,KAAK,CAAA;IAC3B,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,IAAI;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IACzG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAA;AAC7E,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAwB,EAAE,QAAiB;IAChE,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAA;IAChF,OAAO,QAAQ,KAAK,QAAQ,CAAA;AAChC,CAAC;AAOD,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,IAAa,EAAE,EAAE;IAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAA;AAC1D,CAAC,CAAA;AAED,qHAAqH;AACrH,SAAS,SAAS,CAAC,IAAuB;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC5B,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;;gBACnB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/B,CAAC;IACL,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,MAAM,GAAY,EAAE,CAAA;IAC1B,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAc,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;IACzE,MAAM,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAc,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAA;IACxE,MAAM,MAAM,GAAG,CAAC,IAAY,EAAiB,EAAE;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAA;QAC9B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAA;IACxD,CAAC,CAAA;IAED,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAQ;QAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAChB,MAAM,IAAI,GAAiB,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAA;QACrD,KAAK,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAC7F,CAAC;QACD,KAAK,IAAI,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACjB,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QACnF,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACtF,CAAC;IACD,OAAO,MAAM,CAAA;AACjB,CAAC;AAED,SAAS,aAAa,CAClB,QAA+B,EAC/B,KAAe,EACf,MAAa,EACb,OAAmB,EACnB,MAAc;IAEd,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;IACtC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACtE,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IACjD,MAAM,YAAY,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IAEnD,MAAM,IAAI,GAAqB,EAAE,CAAA;IACjC,KAAK,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,YAAY;YAAE,SAAQ;QACrD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAA;IAC9F,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAA;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiD,CAAA;IACtE,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YACzC,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;gBAC9D,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBAC9B,IAAI,GAAG;oBAAE,GAAG,CAAC,KAAK,EAAE,CAAA;;oBACf,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;YAC9C,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAA;IAClD,MAAM,OAAO,GAAY,CAAC,GAAG,EAAE,EAAE;QAC7B,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC7B,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAA;YAChD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC5B,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC,CAAA;IAED,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACvB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;gBAC1B,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAA;gBACjF,OAAO,KAAK,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjF,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;oBAChC,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC;wBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAA;wBAC9D,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBACzB,CAAC;gBACL,CAAC;YACL,CAAC,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CACjB,MAAM,EACN;QACI,IAAI,EAAE,cAAc;QACpB,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAChC,MAAM,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAA;YAC/E,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/F,CAAC,CAAC;KACoB,EAC1B,IAAI,CACP,CAAA;IAED,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;IAClH,MAAM,KAAK,GAAiB,EAAE,CAAA;IAC9B,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CACN,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,EAA2B,EAAE,KAAK,CAAC,CAC/H,CAAA;IACL,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,QAAsB,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IAC1F,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;IAC5F,OAAO;QACH,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,KAAK;QACL,KAAK;QACL,UAAU,EAAE,GAAG,CAAC,KAAK,CAAC;QACtB,UAAU,EAAE,GAAG,CAAC,KAAK,CAAC;QACtB,KAAK;KACR,CAAA;AACL,CAAC;AAED,MAAM,SAAS;IAIkB;IAHrB,QAAQ,GAAG,IAAI,GAAG,EAAa,CAAA;IAC/B,MAAM,GAAG,CAAC,CAAA;IAElB,YAA6B,OAAe;QAAf,YAAO,GAAP,OAAO,CAAQ;IAAG,CAAC;IAEhD,GAAG,CAAC,GAAW;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACpC,IAAI,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACjC,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,KAAQ;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACvC,IAAI,QAAQ;YAAE,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAA;QAC3C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAA;QAC1B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;gBAAE,MAAK;YACjE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAC5B,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAA;QAC9B,CAAC;IACL,CAAC;IAED,KAAK;QACD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;QACrB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACnB,CAAC;CACJ;AAED,MAAM,MAAM,GAAG,IAAI,SAAS,CAA4B,EAAE,CAAC,CAAA;AAC3D,MAAM,UAAU,GAAG,IAAI,SAAS,CAAc,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC,CAAA;AAY/D;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,OAA2B;IACnD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAA;IAC9D,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,UAAU,EAAE,CAAA;IAChE,MAAM,GAAG,GAAG,GAAG,QAAQ,IAAI,OAAO,CAAC,OAAO,IAAI,MAAM,EAAE,CAAA;IACtD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAClC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAA;IAEzB,IAAI,MAAM,GAAsB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACpD,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;QACnF,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAA;QACtB,MAAM,GAAG,IAAI,CAAA;QACb,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;IAC/C,CAAC;IACD,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;IAChG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;IAC7B,OAAO,QAAQ,CAAA;AACnB,CAAC;AAED,MAAM,UAAU,gBAAgB;IAC5B,MAAM,CAAC,KAAK,EAAE,CAAA;IACd,UAAU,CAAC,KAAK,EAAE,CAAA;AACtB,CAAC","sourcesContent":["import {\n    geoArea,\n    geoBounds,\n    geoConicEqualArea,\n    geoEquirectangular,\n    geoMercator,\n    geoOrthographic,\n    geoPath,\n    geoStream,\n    type GeoPermissibleObjects,\n    type GeoProjection,\n} from \"d3-geo\"\n\nimport { ringCoordinates, type GeoArc, type GeoFeature, type GeoPolygon, type GeoRingRef } from \"./format\"\nimport type { GeoFrame } from \"./selection\"\n\nexport type GeoProjectionKind = \"conic\" | \"mercator\" | \"equirectangular\" | \"orthographic\"\nexport type GeoBorders = \"all\" | \"outline\"\n\nexport interface GeoContour {\n    /** Interleaved x/y in unit space: the longer side spans 1, centred on the origin, y up. */\n    points: Float32Array\n    closed: boolean\n    length: number\n}\n\nexport interface GeoGeometry {\n    /** The drawing's extent in unit space; the longer of the two is 1. */\n    width: number\n    height: number\n    fills: GeoContour[]\n    lines: GeoContour[]\n    fillLength: number\n    lineLength: number\n    bytes: number\n}\n\ninterface Part {\n    polygon: GeoPolygon\n    largest: boolean\n}\n\ninterface Frame {\n    projection: GeoProjection\n    centerX: number\n    centerY: number\n    size: number\n    width: number\n    height: number\n}\n\nconst FIT = 1024\n\n// `detail` maps onto a weight threshold that is a fraction of the selection's\n// own area, on a log scale — which is what makes a value look equally stylised\n// on Monaco and on Russia. 0 keeps points worth 1% of the area; just below 1,\n// points worth a billionth of it.\nconst POINT_BASE = 2\nconst POINT_RANGE = 7\nconst POLYGON_BASE = 1.5\nconst POLYGON_RANGE = 6\n\nconst clamp01 = (value: number) => (value > 1 ? 1 : value > 0 ? value : 0)\n\n/** The highest weight bucket a point may carry and still be drawn. */\nexport function pointBucketLimit(detail: number, area: number): number {\n    if (detail >= 1 || !(area > 0)) return 255\n    const minWeight = area * 10 ** -(POINT_BASE + POINT_RANGE * clamp01(detail))\n    return Math.floor(-2 * Math.log2(minWeight))\n}\n\n/** Rings smaller than this (steradians) are dropped, bar each region's largest. */\nexport function polygonAreaLimit(detail: number, area: number): number {\n    if (detail >= 1) return 0\n    return area * 10 ** -(POLYGON_BASE + POLYGON_RANGE * clamp01(detail))\n}\n\nfunction partsOf(features: readonly GeoFeature[], frame: GeoFrame): Part[] {\n    const parts: Part[] = []\n    for (const feature of features) {\n        const mainland = frame === \"mainland\" ? feature.polygons.filter((p) => p.mainland) : []\n        const polygons = mainland.length > 0 ? mainland : feature.polygons\n        let largest: GeoPolygon | null = null\n        for (const polygon of polygons) if (!largest || polygon.area > largest.area) largest = polygon\n        for (const polygon of polygons) parts.push({ polygon, largest: polygon === largest })\n    }\n    return parts\n}\n\nfunction centerLongitude(west: number, east: number): number {\n    if (west <= east) return (west + east) / 2\n    const mid = (west + east + 360) / 2\n    return mid > 180 ? mid - 360 : mid\n}\n\nfunction makeProjection(kind: GeoProjectionKind, west: number, south: number, east: number, north: number): GeoProjection {\n    const lon = centerLongitude(west, east)\n    const lat = (south + north) / 2\n    switch (kind) {\n        case \"mercator\":\n            return geoMercator().rotate([-lon, 0])\n        case \"equirectangular\":\n            return geoEquirectangular().rotate([-lon, 0])\n        case \"orthographic\":\n            return geoOrthographic().rotate([-lon, -lat])\n        case \"conic\": {\n            const span = north - south\n            return geoConicEqualArea()\n                .rotate([-lon, 0])\n                .center([0, lat])\n                .parallels([south + span / 6, north - span / 6])\n        }\n    }\n}\n\nfunction fitFrame(kind: GeoProjectionKind, parts: readonly Part[]): Frame | null {\n    if (parts.length === 0) return null\n    const shape = {\n        type: \"MultiPolygon\",\n        coordinates: parts.map(({ polygon }) => [ringCoordinates(polygon.rings[0])]),\n    } as GeoPermissibleObjects\n    const [[west, south], [east, north]] = geoBounds(shape)\n\n    for (const candidate of [kind, \"equirectangular\"] as const) {\n        const projection = makeProjection(candidate, west, south, east, north).fitSize([FIT, FIT], shape)\n        const [[x0, y0], [x1, y1]] = geoPath(projection).bounds(shape)\n        const size = Math.max(x1 - x0, y1 - y0)\n        if (!Number.isFinite(size) || size <= 0) continue\n        return {\n            projection,\n            centerX: (x0 + x1) / 2,\n            centerY: (y0 + y1) / 2,\n            size,\n            width: (x1 - x0) / size,\n            height: (y1 - y0) / size,\n        }\n    }\n    return null\n}\n\nfunction project(frame: Frame, object: GeoPermissibleObjects, closed: boolean): GeoContour[] {\n    const contours: GeoContour[] = []\n    let current: number[] | null = null\n    const { centerX, centerY, size } = frame\n    const sink = {\n        point(x: number, y: number) {\n            current?.push((x - centerX) / size, -(y - centerY) / size)\n        },\n        lineStart() {\n            current = []\n        },\n        lineEnd() {\n            const flat = current\n            current = null\n            if (!flat || flat.length < 4) return\n            let isClosed = closed\n            if (!closed) {\n                const n = flat.length\n                if (flat[0] === flat[n - 2] && flat[1] === flat[n - 1] && n >= 8) {\n                    flat.length = n - 2\n                    isClosed = true\n                }\n            }\n            const points = Float32Array.from(flat)\n            contours.push({ points, closed: isClosed, length: contourLength(points, isClosed) })\n        },\n        polygonStart() {},\n        polygonEnd() {},\n        sphere() {},\n    }\n    geoStream(object, frame.projection.stream(sink))\n    return contours\n}\n\nfunction contourLength(points: Float32Array, closed: boolean): number {\n    let length = 0\n    const n = points.length / 2\n    for (let i = 1; i < n; i++) {\n        length += Math.hypot(points[i * 2] - points[i * 2 - 2], points[i * 2 + 1] - points[i * 2 - 1])\n    }\n    if (closed && n > 1) length += Math.hypot(points[0] - points[n * 2 - 2], points[1] - points[n * 2 - 1])\n    return length\n}\n\n// Longest edge, in degrees, that simplification may leave. d3 takes an edge as\n// the short way round the sphere, so an edge across more than half the planet\n// (Kaliningrad to Chukotka, once the coast between is dropped) turns inside out.\nconst MAX_EDGE_DEGREES = 20\n\ntype MaskFor = (arc: GeoArc) => Uint8Array\n\n/** Which of an arc's points survive `limit`, the same whichever way the arc is walked. */\nfunction keepMask(arc: GeoArc, limit: number): Uint8Array {\n    const n = arc.buckets.length\n    const mask = new Uint8Array(n)\n    let lastLon = arc.points[0]\n    let lastLat = arc.points[1]\n    for (let i = 0; i < n; i++) {\n        const lon = arc.points[i * 2]\n        const lat = arc.points[i * 2 + 1]\n        let far = false\n        if (arc.buckets[i] > limit) {\n            let dLon = Math.abs(lon - lastLon)\n            if (dLon > 180) dLon = 360 - dLon\n            far = Math.abs(lat - lastLat) > MAX_EDGE_DEGREES || dLon * Math.cos((lat * Math.PI) / 180) > MAX_EDGE_DEGREES\n        }\n        if (arc.buckets[i] <= limit || far) {\n            mask[i] = 1\n            lastLon = lon\n            lastLat = lat\n        }\n    }\n    return mask\n}\n\nfunction filteredPoints(refs: readonly GeoRingRef[], maskFor: MaskFor): [number, number][] {\n    const out: [number, number][] = []\n    for (const { arc, reversed } of refs) {\n        const n = arc.buckets.length\n        const mask = maskFor(arc)\n        for (let j = out.length === 0 ? 0 : 1; j < n; j++) {\n            const i = reversed ? n - 1 - j : j\n            if (mask[i]) out.push([arc.points[i * 2], arc.points[i * 2 + 1]])\n        }\n    }\n    return out\n}\n\n/** A ring keeps at least three vertices, raising its arcs' limits if the global one would collapse it. */\nfunction ringLimit(ring: readonly GeoRingRef[], limit: number): number {\n    let kept = 0\n    for (const { arc } of ring) {\n        for (let i = 0; i < arc.buckets.length - 1; i++) if (arc.buckets[i] <= limit) kept++\n    }\n    if (kept >= 3) return limit\n    const buckets: number[] = []\n    for (const { arc } of ring) for (let i = 0; i < arc.buckets.length - 1; i++) buckets.push(arc.buckets[i])\n    buckets.sort((a, b) => a - b)\n    return Math.max(limit, buckets[Math.min(2, buckets.length - 1)] ?? limit)\n}\n\n/**\n * Whether a simplified ring still winds the way its original did. Dropping\n * points can fold a small ring over itself, and d3 reads an exterior wound the\n * wrong way as the rest of the planet — one such island fills the whole frame.\n */\nfunction windsAsOriginal(ring: [number, number][], exterior: boolean): boolean {\n    if (ring.length < 4) return true\n    const inverted = geoArea({ type: \"Polygon\", coordinates: [ring] }) > 2 * Math.PI\n    return inverted !== exterior\n}\n\ninterface Chain {\n    refs: GeoRingRef[]\n    closed: boolean\n}\n\nconst endKey = (arc: GeoArc, last: boolean) => {\n    const i = last ? arc.buckets.length - 1 : 0\n    return `${arc.points[i * 2]},${arc.points[i * 2 + 1]}`\n}\n\n/** Joins arcs that meet end to end with nothing else at the joint, so a border draws as one line with real joins. */\nfunction chainArcs(arcs: readonly GeoArc[]): Chain[] {\n    const atNode = new Map<string, GeoArc[]>()\n    for (const arc of arcs) {\n        for (const key of [endKey(arc, false), endKey(arc, true)]) {\n            const list = atNode.get(key)\n            if (list) list.push(arc)\n            else atNode.set(key, [arc])\n        }\n    }\n    const visited = new Set<GeoArc>()\n    const chains: Chain[] = []\n    const refStart = ({ arc, reversed }: GeoRingRef) => endKey(arc, reversed)\n    const refEnd = ({ arc, reversed }: GeoRingRef) => endKey(arc, !reversed)\n    const nextAt = (node: string): GeoArc | null => {\n        const list = atNode.get(node)!\n        if (list.length !== 2) return null\n        return list.find((arc) => !visited.has(arc)) ?? null\n    }\n\n    for (const arc of arcs) {\n        if (visited.has(arc)) continue\n        visited.add(arc)\n        const refs: GeoRingRef[] = [{ arc, reversed: false }]\n        for (let next = nextAt(refEnd(refs[refs.length - 1])); next; next = nextAt(refEnd(refs[refs.length - 1]))) {\n            visited.add(next)\n            refs.push({ arc: next, reversed: endKey(next, false) !== refEnd(refs[refs.length - 1]) })\n        }\n        for (let prev = nextAt(refStart(refs[0])); prev; prev = nextAt(refStart(refs[0]))) {\n            visited.add(prev)\n            refs.unshift({ arc: prev, reversed: endKey(prev, true) !== refStart(refs[0]) })\n        }\n        chains.push({ refs, closed: refStart(refs[0]) === refEnd(refs[refs.length - 1]) })\n    }\n    return chains\n}\n\nfunction buildGeometry(\n    features: readonly GeoFeature[],\n    frame: GeoFrame,\n    fitted: Frame,\n    borders: GeoBorders,\n    detail: number\n): GeoGeometry {\n    const parts = partsOf(features, frame)\n    const area = parts.reduce((sum, { polygon }) => sum + polygon.area, 0)\n    const pointLimit = pointBucketLimit(detail, area)\n    const polygonLimit = polygonAreaLimit(detail, area)\n\n    const kept: GeoRingRef[][][] = []\n    for (const { polygon, largest } of parts) {\n        if (!largest && polygon.area < polygonLimit) continue\n        kept.push(polygon.rings.filter((_, i) => i === 0 || polygon.ringAreas[i] >= polygonLimit))\n    }\n\n    const limits = new Map<GeoArc[\"key\"], number>()\n    const usage = new Map<GeoArc[\"key\"], { arc: GeoArc; count: number }>()\n    for (const rings of kept) {\n        for (const ring of rings) {\n            const limit = ringLimit(ring, pointLimit)\n            for (const { arc } of ring) {\n                limits.set(arc.key, Math.max(limits.get(arc.key) ?? 0, limit))\n                const use = usage.get(arc.key)\n                if (use) use.count++\n                else usage.set(arc.key, { arc, count: 1 })\n            }\n        }\n    }\n\n    const masks = new Map<GeoArc[\"key\"], Uint8Array>()\n    const maskFor: MaskFor = (arc) => {\n        let mask = masks.get(arc.key)\n        if (!mask) {\n            mask = keepMask(arc, limits.get(arc.key) ?? 255)\n            masks.set(arc.key, mask)\n        }\n        return mask\n    }\n\n    if (pointLimit < 255) {\n        for (const rings of kept) {\n            rings.forEach((ring, index) => {\n                let limit = Math.min(...ring.map(({ arc }) => limits.get(arc.key) ?? pointLimit))\n                while (limit < 255 && !windsAsOriginal(filteredPoints(ring, maskFor), index === 0)) {\n                    limit = Math.min(255, limit + 2)\n                    for (const { arc } of ring) {\n                        limits.set(arc.key, Math.max(limits.get(arc.key) ?? 0, limit))\n                        masks.delete(arc.key)\n                    }\n                }\n            })\n        }\n    }\n\n    const fills = project(\n        fitted,\n        {\n            type: \"MultiPolygon\",\n            coordinates: kept.flatMap((rings) => {\n                const [exterior, ...holes] = rings.map((ring) => filteredPoints(ring, maskFor))\n                return exterior.length < 4 ? [] : [[exterior, ...holes.filter((hole) => hole.length >= 4)]]\n            }),\n        } as GeoPermissibleObjects,\n        true\n    )\n\n    const lineArcs = [...usage.values()].filter(({ count }) => borders === \"all\" || count === 1).map(({ arc }) => arc)\n    const lines: GeoContour[] = []\n    for (const chain of chainArcs(lineArcs)) {\n        lines.push(\n            ...project(fitted, { type: \"LineString\", coordinates: filteredPoints(chain.refs, maskFor) } as GeoPermissibleObjects, false)\n        )\n    }\n\n    const sum = (contours: GeoContour[]) => contours.reduce((total, c) => total + c.length, 0)\n    const bytes = [...fills, ...lines].reduce((total, c) => total + c.points.byteLength + 32, 0)\n    return {\n        width: fitted.width,\n        height: fitted.height,\n        fills,\n        lines,\n        fillLength: sum(fills),\n        lineLength: sum(lines),\n        bytes,\n    }\n}\n\nclass ByteCache<V extends { bytes: number }> {\n    private _entries = new Map<string, V>()\n    private _bytes = 0\n\n    constructor(private readonly _budget: number) {}\n\n    get(key: string): V | undefined {\n        const value = this._entries.get(key)\n        if (value) {\n            this._entries.delete(key)\n            this._entries.set(key, value)\n        }\n        return value\n    }\n\n    set(key: string, value: V): void {\n        const previous = this._entries.get(key)\n        if (previous) this._bytes -= previous.bytes\n        this._entries.delete(key)\n        this._entries.set(key, value)\n        this._bytes += value.bytes\n        for (const [oldest, entry] of this._entries) {\n            if (this._bytes <= this._budget || this._entries.size <= 1) break\n            this._entries.delete(oldest)\n            this._bytes -= entry.bytes\n        }\n    }\n\n    clear(): void {\n        this._entries.clear()\n        this._bytes = 0\n    }\n}\n\nconst frames = new ByteCache<Frame & { bytes: number }>(64)\nconst geometries = new ByteCache<GeoGeometry>(64 * 1024 * 1024)\n\nexport interface GeoGeometryRequest {\n    /** Identifies `features` and `frame`: equal keys must mean equal selections. */\n    selectionKey: string\n    features: readonly GeoFeature[]\n    frame: GeoFrame\n    projection: GeoProjectionKind\n    borders: GeoBorders\n    detail: number\n}\n\n/**\n * The drawing for a selection, cached. The projection is fitted to the\n * selection at full detail, so a `detail` tween never moves or rescales it.\n */\nexport function geoGeometry(request: GeoGeometryRequest): GeoGeometry | null {\n    const detail = Math.round(clamp01(request.detail) * 100) / 100\n    const frameKey = `${request.selectionKey}|${request.projection}`\n    const key = `${frameKey}|${request.borders}|${detail}`\n    const cached = geometries.get(key)\n    if (cached) return cached\n\n    let fitted: Frame | undefined = frames.get(frameKey)\n    if (!fitted) {\n        const made = fitFrame(request.projection, partsOf(request.features, request.frame))\n        if (!made) return null\n        fitted = made\n        frames.set(frameKey, { ...made, bytes: 1 })\n    }\n    const geometry = buildGeometry(request.features, request.frame, fitted, request.borders, detail)\n    geometries.set(key, geometry)\n    return geometry\n}\n\nexport function clearGeoGeometry(): void {\n    frames.clear()\n    geometries.clear()\n}\n"]}

package/dist/border/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * GeoBorder: country and subdivision outlines by ISO 3166 code.
+ *
+ * `ms add geo-border` copies only `geo-border.ts`. Everything it imports from
+ * here — the source registry, the file cache, the geometry — stays behind the
+ * package, so a forked node shares the host's registered sources instead of
+ * owning an empty registry of its own.
+ */
+export * from "./format.js";
+export * from "./geo-border.js";
+export * from "./geometry.js";
+export * from "./loader.js";
+export * from "./registry.js";
+export * from "./selection.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/border/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/border/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,cAAc,UAAU,CAAA;AACxB,cAAc,cAAc,CAAA;AAC5B,cAAc,YAAY,CAAA;AAC1B,cAAc,UAAU,CAAA;AACxB,cAAc,YAAY,CAAA;AAC1B,cAAc,aAAa,CAAA"}

package/dist/border/index.js

@@ -0,0 +1,15 @@
+/**
+ * GeoBorder: country and subdivision outlines by ISO 3166 code.
+ *
+ * `ms add geo-border` copies only `geo-border.ts`. Everything it imports from
+ * here — the source registry, the file cache, the geometry — stays behind the
+ * package, so a forked node shares the host's registered sources instead of
+ * owning an empty registry of its own.
+ */
+export * from "./format.js";
+export * from "./geo-border.js";
+export * from "./geometry.js";
+export * from "./loader.js";
+export * from "./registry.js";
+export * from "./selection.js";
+//# sourceMappingURL=index.js.map

package/dist/border/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/border/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,cAAc,UAAU,CAAA;AACxB,cAAc,cAAc,CAAA;AAC5B,cAAc,YAAY,CAAA;AAC1B,cAAc,UAAU,CAAA;AACxB,cAAc,YAAY,CAAA;AAC1B,cAAc,aAAa,CAAA","sourcesContent":["/**\n * GeoBorder: country and subdivision outlines by ISO 3166 code.\n *\n * `ms add geo-border` copies only `geo-border.ts`. Everything it imports from\n * here — the source registry, the file cache, the geometry — stays behind the\n * package, so a forked node shares the host's registered sources instead of\n * owning an empty registry of its own.\n */\nexport * from \"./format\"\nexport * from \"./geo-border\"\nexport * from \"./geometry\"\nexport * from \"./loader\"\nexport * from \"./registry\"\nexport * from \"./selection\"\n"]}

package/dist/border/loader.d.ts

@@ -0,0 +1,31 @@
+import type { LoaderFn } from "@motionscript/sdk";
+import { type DecodedGeoFile } from "./format.js";
+export type GeoFileEntry = {
+    status: "ready";
+    file: DecodedGeoFile;
+} | {
+    status: "missing";
+} | {
+    status: "failed";
+    error: unknown;
+};
+export declare function countryFileKey(code: string): string;
+export declare function statesFileKey(country: string): string;
+/** Bumps whenever a file lands, so derived geometry keyed on it rebuilds. */
+export declare function geoDataVersion(): number;
+export declare function geoFileEntry(key: string): GeoFileEntry | undefined;
+/**
+ * Loads one data file into the shared cache. Never rejects: a rejected loader
+ * is retried on every tick and fails an export outright, where a recorded
+ * failure draws nothing and is tried again by the next call.
+ */
+export declare function loadGeoFile(key: string): Promise<GeoFileEntry>;
+/**
+ * The loader an `AssetScope` declares for a file: one function per key, so
+ * every node that needs the file declares the same one. Nothing is disposed —
+ * decoded data is shared by every engine in the process.
+ */
+export declare function geoLoader(key: string): LoaderFn;
+/** Forgets every loaded file — for tests. */
+export declare function clearGeoFiles(): void;
+//# sourceMappingURL=loader.d.ts.map

package/dist/border/loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loader.d.ts","sourceRoot":"","sources":["../../src/border/loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AAEjD,OAAO,EAAiB,KAAK,cAAc,EAAoB,MAAM,UAAU,CAAA;AAG/E,MAAM,MAAM,YAAY,GAClB;IAAE,MAAM,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,cAAc,CAAA;CAAE,GACzC;IAAE,MAAM,EAAE,SAAS,CAAA;CAAE,GACrB;IAAE,MAAM,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAA;AAQ1C,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAErD;AAED,6EAA6E;AAC7E,wBAAgB,cAAc,IAAI,MAAM,CAEvC;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAElE;AAeD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAqB9D;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAS/C;AAED,6CAA6C;AAC7C,wBAAgB,aAAa,IAAI,IAAI,CAKpC"}

package/dist/border/loader.js

@@ -0,0 +1,87 @@
+import { decodeGeoFile } from "./format.js";
+import { GEO_DATA_VERSION, geoRegistry } from "./registry.js";
+const entries = new Map();
+const inflight = new Map();
+const loaders = new Map();
+const warned = new Set();
+let version = 0;
+export function countryFileKey(code) {
+    return `${GEO_DATA_VERSION}/countries/${code}`;
+}
+export function statesFileKey(country) {
+    return `${GEO_DATA_VERSION}/states/${country}`;
+}
+/** Bumps whenever a file lands, so derived geometry keyed on it rebuilds. */
+export function geoDataVersion() {
+    return version;
+}
+export function geoFileEntry(key) {
+    return entries.get(key);
+}
+async function fetchEntry(key) {
+    try {
+        let data = (await geoRegistry.resolve(key));
+        // A country with no subdivisions has no states file; its outline stands in.
+        if (data === null && key.includes("/states/")) {
+            data = (await geoRegistry.resolve(key.replace("/states/", "/countries/")));
+        }
+        return data === null ? { status: "missing" } : { status: "ready", file: decodeGeoFile(data) };
+    }
+    catch (error) {
+        return { status: "failed", error };
+    }
+}
+/**
+ * Loads one data file into the shared cache. Never rejects: a rejected loader
+ * is retried on every tick and fails an export outright, where a recorded
+ * failure draws nothing and is tried again by the next call.
+ */
+export function loadGeoFile(key) {
+    const current = entries.get(key);
+    if (current?.status === "ready")
+        return Promise.resolve(current);
+    let job = inflight.get(key);
+    if (!job) {
+        job = fetchEntry(key).then((entry) => {
+            inflight.delete(key);
+            entries.set(key, entry);
+            version++;
+            if (entry.status === "ready") {
+                warned.delete(key);
+            }
+            else if (!warned.has(key)) {
+                warned.add(key);
+                if (entry.status === "failed")
+                    console.warn(`[GeoBorder] could not load ${key}:`, entry.error);
+                else
+                    console.warn(`[GeoBorder] no geo source has ${key}`);
+            }
+            return entry;
+        });
+        inflight.set(key, job);
+    }
+    return job;
+}
+/**
+ * The loader an `AssetScope` declares for a file: one function per key, so
+ * every node that needs the file declares the same one. Nothing is disposed —
+ * decoded data is shared by every engine in the process.
+ */
+export function geoLoader(key) {
+    let load = loaders.get(key);
+    if (!load) {
+        load = async () => {
+            await loadGeoFile(key);
+        };
+        loaders.set(key, load);
+    }
+    return load;
+}
+/** Forgets every loaded file — for tests. */
+export function clearGeoFiles() {
+    entries.clear();
+    inflight.clear();
+    warned.clear();
+    version++;
+}
+//# sourceMappingURL=loader.js.map

package/dist/border/loader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loader.js","sourceRoot":"","sources":["../../src/border/loader.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,aAAa,EAAyC,MAAM,UAAU,CAAA;AAC/E,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAO1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAA;AAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAA;AACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAA;AAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;AAChC,IAAI,OAAO,GAAG,CAAC,CAAA;AAEf,MAAM,UAAU,cAAc,CAAC,IAAY;IACvC,OAAO,GAAG,gBAAgB,cAAc,IAAI,EAAE,CAAA;AAClD,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,OAAe;IACzC,OAAO,GAAG,gBAAgB,WAAW,OAAO,EAAE,CAAA;AAClD,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,cAAc;IAC1B,OAAO,OAAO,CAAA;AAClB,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,GAAW;IACpC,OAAO,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,GAAW;IACjC,IAAI,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,MAAM,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAuB,CAAA;QACjE,4EAA4E;QAC5E,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5C,IAAI,GAAG,CAAC,MAAM,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC,CAAuB,CAAA;QACpG,CAAC;QACD,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,EAAE,CAAA;IACjG,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;IACtC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACnC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAChC,IAAI,OAAO,EAAE,MAAM,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAChE,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;QACP,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE;YACjC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YACvB,OAAO,EAAE,CAAA;YACT,IAAI,KAAK,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;gBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACtB,CAAC;iBAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACf,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ;oBAAE,OAAO,CAAC,IAAI,CAAC,8BAA8B,GAAG,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;;oBACzF,OAAO,CAAC,IAAI,CAAC,iCAAiC,GAAG,EAAE,CAAC,CAAA;YAC7D,CAAC;YACD,OAAO,KAAK,CAAA;QAChB,CAAC,CAAC,CAAA;QACF,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,GAAW;IACjC,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,IAAI,GAAG,KAAK,IAAI,EAAE;YACd,MAAM,WAAW,CAAC,GAAG,CAAC,CAAA;QAC1B,CAAC,CAAA;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,IAAI,CAAA;AACf,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,aAAa;IACzB,OAAO,CAAC,KAAK,EAAE,CAAA;IACf,QAAQ,CAAC,KAAK,EAAE,CAAA;IAChB,MAAM,CAAC,KAAK,EAAE,CAAA;IACd,OAAO,EAAE,CAAA;AACb,CAAC","sourcesContent":["import type { LoaderFn } from \"@motionscript/sdk\"\n\nimport { decodeGeoFile, type DecodedGeoFile, type GeoFileData } from \"./format\"\nimport { GEO_DATA_VERSION, geoRegistry } from \"./registry\"\n\nexport type GeoFileEntry =\n    | { status: \"ready\"; file: DecodedGeoFile }\n    | { status: \"missing\" }\n    | { status: \"failed\"; error: unknown }\n\nconst entries = new Map<string, GeoFileEntry>()\nconst inflight = new Map<string, Promise<GeoFileEntry>>()\nconst loaders = new Map<string, LoaderFn>()\nconst warned = new Set<string>()\nlet version = 0\n\nexport function countryFileKey(code: string): string {\n    return `${GEO_DATA_VERSION}/countries/${code}`\n}\n\nexport function statesFileKey(country: string): string {\n    return `${GEO_DATA_VERSION}/states/${country}`\n}\n\n/** Bumps whenever a file lands, so derived geometry keyed on it rebuilds. */\nexport function geoDataVersion(): number {\n    return version\n}\n\nexport function geoFileEntry(key: string): GeoFileEntry | undefined {\n    return entries.get(key)\n}\n\nasync function fetchEntry(key: string): Promise<GeoFileEntry> {\n    try {\n        let data = (await geoRegistry.resolve(key)) as GeoFileData | null\n        // A country with no subdivisions has no states file; its outline stands in.\n        if (data === null && key.includes(\"/states/\")) {\n            data = (await geoRegistry.resolve(key.replace(\"/states/\", \"/countries/\"))) as GeoFileData | null\n        }\n        return data === null ? { status: \"missing\" } : { status: \"ready\", file: decodeGeoFile(data) }\n    } catch (error) {\n        return { status: \"failed\", error }\n    }\n}\n\n/**\n * Loads one data file into the shared cache. Never rejects: a rejected loader\n * is retried on every tick and fails an export outright, where a recorded\n * failure draws nothing and is tried again by the next call.\n */\nexport function loadGeoFile(key: string): Promise<GeoFileEntry> {\n    const current = entries.get(key)\n    if (current?.status === \"ready\") return Promise.resolve(current)\n    let job = inflight.get(key)\n    if (!job) {\n        job = fetchEntry(key).then((entry) => {\n            inflight.delete(key)\n            entries.set(key, entry)\n            version++\n            if (entry.status === \"ready\") {\n                warned.delete(key)\n            } else if (!warned.has(key)) {\n                warned.add(key)\n                if (entry.status === \"failed\") console.warn(`[GeoBorder] could not load ${key}:`, entry.error)\n                else console.warn(`[GeoBorder] no geo source has ${key}`)\n            }\n            return entry\n        })\n        inflight.set(key, job)\n    }\n    return job\n}\n\n/**\n * The loader an `AssetScope` declares for a file: one function per key, so\n * every node that needs the file declares the same one. Nothing is disposed —\n * decoded data is shared by every engine in the process.\n */\nexport function geoLoader(key: string): LoaderFn {\n    let load = loaders.get(key)\n    if (!load) {\n        load = async () => {\n            await loadGeoFile(key)\n        }\n        loaders.set(key, load)\n    }\n    return load\n}\n\n/** Forgets every loaded file — for tests. */\nexport function clearGeoFiles(): void {\n    entries.clear()\n    inflight.clear()\n    warned.clear()\n    version++\n}\n"]}