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

package/dist/border/registry.d.ts

@@ -0,0 +1,64 @@
+import { type GeoFeature, type GeoFileData, type GeoIndex } from "./format.js";
+/** Prefix every data key carries; bumped with the file format. */
+export declare const GEO_DATA_VERSION = "v1";
+/**
+ * Answers a data key — `v1/countries/FR`, `v1/states/US`, `v1/index` — with the
+ * parsed file, or `null` when this source does not have it. A throw means "could
+ * not tell" (offline, a 500) and is retried on the next load.
+ */
+export type GeoSource = (key: string) => Promise<unknown>;
+type Position = readonly [number, number] | readonly number[];
+type GeoPolygonShape = {
+    type: "Polygon";
+    coordinates: readonly (readonly Position[])[];
+} | {
+    type: "MultiPolygon";
+    coordinates: readonly (readonly (readonly Position[])[])[];
+};
+/** GeoJSON in lon/lat: a Polygon, a MultiPolygon, or a Feature holding one. */
+export type GeoShape = GeoPolygonShape | {
+    type: "Feature";
+    geometry: GeoPolygonShape;
+    properties?: {
+        name?: string;
+    } | null;
+};
+export interface GeoDefinition {
+    shape: GeoShape;
+    name?: string;
+    /** The country a subdivision code expands under, when it has one. */
+    parent?: string;
+}
+/** Fetches `<base>/<key>.json`; `base` may instead map a key to its URL. */
+export declare function geoUrlSource(base: string | ((key: string) => string), init?: RequestInit): GeoSource;
+/** Wraps a function returning the file as text, bytes or parsed JSON (e.g. `fs.readFile`). */
+export declare function geoLoaderSource(load: (key: string) => Promise<string | ArrayBuffer | Uint8Array | object | null | undefined>): GeoSource;
+declare class GeoRegistry {
+    private _sources;
+    private _defined;
+    private _generation;
+    private _serial;
+    /** Bumps whenever a source or a definition is added or removed. */
+    get generation(): number;
+    get hasSources(): boolean;
+    /** Adds a source after every source already registered. Returns its removal. */
+    use(source: GeoSource): () => void;
+    /**
+     * Shapes (GeoJSON, lon/lat) under codes of your choosing, checked before any
+     * source. A definition replaces generated data for the same code.
+     */
+    define(shapes: Record<string, GeoShape | GeoDefinition>): () => void;
+    defined(code: string): GeoFeature | undefined;
+    /** Removes every source and definition — for tests. */
+    reset(): void;
+    /**
+     * Asks each source in registration order; the first non-null answer wins.
+     * Resolves `null` only when every source answered that it has no such file.
+     */
+    resolve(key: string): Promise<GeoFileData | GeoIndex | null>;
+    /** Every listed region's code, names and parent, for a picker. */
+    index(): Promise<GeoIndex | null>;
+}
+export declare const geoRegistry: GeoRegistry;
+export {};
+//# sourceMappingURL=registry.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../../src/border/registry.ts"],"names":[],"mappings":"AAEA,OAAO,EAEH,KAAK,UAAU,EACf,KAAK,WAAW,EAChB,KAAK,QAAQ,EAGhB,MAAM,UAAU,CAAA;AAGjB,kEAAkE;AAClE,eAAO,MAAM,gBAAgB,OAAwB,CAAA;AAErD;;;;GAIG;AACH,MAAM,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,OAAO,CAAC,CAAA;AAEzD,KAAK,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,MAAM,EAAE,CAAA;AAC7D,KAAK,eAAe,GACd;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,WAAW,EAAE,SAAS,CAAC,SAAS,QAAQ,EAAE,CAAC,EAAE,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,WAAW,EAAE,SAAS,CAAC,SAAS,CAAC,SAAS,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;CAAE,CAAA;AAC1F,+EAA+E;AAC/E,MAAM,MAAM,QAAQ,GAAG,eAAe,GAAG;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,eAAe,CAAC;IAAC,UAAU,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAA;CAAE,CAAA;AAE9H,MAAM,WAAW,aAAa;IAC1B,KAAK,EAAE,QAAQ,CAAA;IACf,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,qEAAqE;IACrE,MAAM,CAAC,EAAE,MAAM,CAAA;CAClB;AAED,4EAA4E;AAC5E,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CASpG;AAED,8FAA8F;AAC9F,wBAAgB,eAAe,CAC3B,IAAI,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,GAAG,WAAW,GAAG,UAAU,GAAG,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,GAC9F,SAAS,CAUX;AA2CD,cAAM,WAAW;IACb,OAAO,CAAC,QAAQ,CAAkB;IAClC,OAAO,CAAC,QAAQ,CAA6D;IAC7E,OAAO,CAAC,WAAW,CAAI;IACvB,OAAO,CAAC,OAAO,CAAI;IAEnB,mEAAmE;IACnE,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED,IAAI,UAAU,IAAI,OAAO,CAExB;IAED,gFAAgF;IAChF,GAAG,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,IAAI;IAWlC;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,GAAG,aAAa,CAAC,GAAG,MAAM,IAAI;IAiBpE,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAI7C,uDAAuD;IACvD,KAAK,IAAI,IAAI;IAMb;;;OAGG;IACG,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,QAAQ,GAAG,IAAI,CAAC;IAiBlE,kEAAkE;IAC5D,KAAK,IAAI,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;CAG1C;AAED,eAAO,MAAM,WAAW,aAAoB,CAAA"}

package/dist/border/registry.js

@@ -0,0 +1,152 @@
+import { geoArea } from "d3-geo";
+import { GEO_DATA_FORMAT, } from "./format.js";
+import { ringBuckets } from "./simplify.js";
+/** Prefix every data key carries; bumped with the file format. */
+export const GEO_DATA_VERSION = `v${GEO_DATA_FORMAT}`;
+/** Fetches `<base>/<key>.json`; `base` may instead map a key to its URL. */
+export function geoUrlSource(base, init) {
+    return async (key) => {
+        const url = typeof base === "function" ? base(key) : `${base.replace(/\/+$/, "")}/${key}.json`;
+        const response = await fetch(url, init);
+        // Supabase Storage answers a missing object with 400, not 404.
+        if (response.status === 404 || response.status === 400)
+            return null;
+        if (!response.ok)
+            throw new Error(`${url} → HTTP ${response.status}`);
+        return response.json();
+    };
+}
+/** Wraps a function returning the file as text, bytes or parsed JSON (e.g. `fs.readFile`). */
+export function geoLoaderSource(load) {
+    return async (key) => {
+        const value = await load(key);
+        if (value == null)
+            return null;
+        if (typeof value === "string")
+            return JSON.parse(value);
+        if (value instanceof ArrayBuffer || value instanceof Uint8Array) {
+            return JSON.parse(new TextDecoder().decode(value));
+        }
+        return value;
+    };
+}
+function definedFeature(code, definition, serial) {
+    const shape = definition.shape.type === "Feature" ? definition.shape.geometry : definition.shape;
+    const feature = definition.shape.type === "Feature" ? definition.shape : null;
+    const polygons = shape.type === "Polygon" ? [shape.coordinates] : shape.coordinates;
+    let arcIndex = 0;
+    const toRing = (ring) => {
+        const closed = ring.length > 0 && ring[0][0] === ring[ring.length - 1][0] && ring[0][1] === ring[ring.length - 1][1];
+        const coordinates = closed ? ring : [...ring, ring[0]];
+        const points = new Float64Array(coordinates.length * 2);
+        coordinates.forEach(([lon, lat], i) => {
+            points[i * 2] = lon;
+            points[i * 2 + 1] = lat;
+        });
+        return { arc: { key: `define:${serial}:${code}:${arcIndex++}`, points, buckets: ringBuckets(points) }, reversed: false };
+    };
+    const measured = polygons.map((rings) => {
+        const resolved = rings.map((ring) => [toRing(ring)]);
+        const ringAreas = rings.map((ring) => {
+            const area = geoArea({ type: "Polygon", coordinates: [ring] });
+            return area > 2 * Math.PI ? 4 * Math.PI - area : area;
+        });
+        const area = Math.max(0, ringAreas[0] - ringAreas.slice(1).reduce((a, b) => a + b, 0));
+        return { rings: resolved, ringAreas, area, mainland: true };
+    });
+    const name = definition.name ?? feature?.properties?.name ?? code;
+    return {
+        code,
+        name,
+        nameNl: name,
+        parent: definition.parent ?? (code.includes("-") ? code.slice(0, 2) : null),
+        first: true,
+        listed: false,
+        remote: false,
+        polygons: measured,
+    };
+}
+class GeoRegistry {
+    _sources = [];
+    _defined = new Map();
+    _generation = 0;
+    _serial = 0;
+    /** Bumps whenever a source or a definition is added or removed. */
+    get generation() {
+        return this._generation;
+    }
+    get hasSources() {
+        return this._sources.length > 0;
+    }
+    /** Adds a source after every source already registered. Returns its removal. */
+    use(source) {
+        this._sources.push(source);
+        this._generation++;
+        return () => {
+            const i = this._sources.indexOf(source);
+            if (i < 0)
+                return;
+            this._sources.splice(i, 1);
+            this._generation++;
+        };
+    }
+    /**
+     * Shapes (GeoJSON, lon/lat) under codes of your choosing, checked before any
+     * source. A definition replaces generated data for the same code.
+     */
+    define(shapes) {
+        const serial = ++this._serial;
+        const codes = Object.entries(shapes).map(([rawCode, value]) => {
+            const code = rawCode.trim().toUpperCase();
+            const definition = "shape" in value ? value : { shape: value };
+            this._defined.set(code, { serial, feature: definedFeature(code, definition, serial) });
+            return code;
+        });
+        this._generation++;
+        return () => {
+            for (const code of codes) {
+                if (this._defined.get(code)?.serial === serial)
+                    this._defined.delete(code);
+            }
+            this._generation++;
+        };
+    }
+    defined(code) {
+        return this._defined.get(code)?.feature;
+    }
+    /** Removes every source and definition — for tests. */
+    reset() {
+        this._sources = [];
+        this._defined.clear();
+        this._generation++;
+    }
+    /**
+     * Asks each source in registration order; the first non-null answer wins.
+     * Resolves `null` only when every source answered that it has no such file.
+     */
+    async resolve(key) {
+        if (this._sources.length === 0) {
+            throw new Error("No geo source registered — call geoRegistry.use(geoUrlSource(…)) before rendering GeoBorder");
+        }
+        let failure = null;
+        for (const source of [...this._sources]) {
+            try {
+                const value = await source(key);
+                if (value != null)
+                    return value;
+            }
+            catch (error) {
+                failure ??= error;
+            }
+        }
+        if (failure)
+            throw failure;
+        return null;
+    }
+    /** Every listed region's code, names and parent, for a picker. */
+    async index() {
+        return (await this.resolve(`${GEO_DATA_VERSION}/index`));
+    }
+}
+export const geoRegistry = new GeoRegistry();
+//# sourceMappingURL=registry.js.map

package/dist/border/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../src/border/registry.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAA;AAEhC,OAAO,EACH,eAAe,GAMlB,MAAM,UAAU,CAAA;AACjB,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAExC,kEAAkE;AAClE,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,eAAe,EAAE,CAAA;AAuBrD,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,IAAwC,EAAE,IAAkB;IACrF,OAAO,KAAK,EAAE,GAAG,EAAE,EAAE;QACjB,MAAM,GAAG,GAAG,OAAO,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,CAAA;QAC9F,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACvC,+DAA+D;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,GAAG,IAAI,QAAQ,CAAC,MAAM,KAAK,GAAG;YAAE,OAAO,IAAI,CAAA;QACnE,IAAI,CAAC,QAAQ,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,WAAW,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;QACrE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC1B,CAAC,CAAA;AACL,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,eAAe,CAC3B,IAA6F;IAE7F,OAAO,KAAK,EAAE,GAAG,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,CAAA;QAC7B,IAAI,KAAK,IAAI,IAAI;YAAE,OAAO,IAAI,CAAA;QAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACvD,IAAI,KAAK,YAAY,WAAW,IAAI,KAAK,YAAY,UAAU,EAAE,CAAC;YAC9D,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;QACtD,CAAC;QACD,OAAO,KAAK,CAAA;IAChB,CAAC,CAAA;AACL,CAAC;AAED,SAAS,cAAc,CAAC,IAAY,EAAE,UAAyB,EAAE,MAAc;IAC3E,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAA;IAChG,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;IAC7E,MAAM,QAAQ,GACV,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAA;IACtE,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,MAAM,MAAM,GAAG,CAAC,IAAyB,EAAc,EAAE;QACrD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACpH,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACtD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACvD,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACnB,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;QAC3B,CAAC,CAAC,CAAA;QACF,OAAO,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,UAAU,MAAM,IAAI,IAAI,IAAI,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;IAC5H,CAAC,CAAA;IAED,MAAM,QAAQ,GAAiB,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACjC,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,IAA0B,CAAC,EAAE,CAAC,CAAA;YACpF,OAAO,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;QACzD,CAAC,CAAC,CAAA;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACtF,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAA;IAC/D,CAAC,CAAC,CAAA;IAEF,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,IAAI,OAAO,EAAE,UAAU,EAAE,IAAI,IAAI,IAAI,CAAA;IACjE,OAAO;QACH,IAAI;QACJ,IAAI;QACJ,MAAM,EAAE,IAAI;QACZ,MAAM,EAAE,UAAU,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3E,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,KAAK;QACb,MAAM,EAAE,KAAK;QACb,QAAQ,EAAE,QAAQ;KACrB,CAAA;AACL,CAAC;AAED,MAAM,WAAW;IACL,QAAQ,GAAgB,EAAE,CAAA;IAC1B,QAAQ,GAAG,IAAI,GAAG,EAAmD,CAAA;IACrE,WAAW,GAAG,CAAC,CAAA;IACf,OAAO,GAAG,CAAC,CAAA;IAEnB,mEAAmE;IACnE,IAAI,UAAU;QACV,OAAO,IAAI,CAAC,WAAW,CAAA;IAC3B,CAAC;IAED,IAAI,UAAU;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAA;IACnC,CAAC;IAED,gFAAgF;IAChF,GAAG,CAAC,MAAiB;QACjB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC1B,IAAI,CAAC,WAAW,EAAE,CAAA;QAClB,OAAO,GAAG,EAAE;YACR,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YACvC,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAM;YACjB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC1B,IAAI,CAAC,WAAW,EAAE,CAAA;QACtB,CAAC,CAAA;IACL,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAgD;QACnD,MAAM,MAAM,GAAG,EAAE,IAAI,CAAC,OAAO,CAAA;QAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE;YAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;YACzC,MAAM,UAAU,GAAG,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;YAC9D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,CAAA;YACtF,OAAO,IAAI,CAAA;QACf,CAAC,CAAC,CAAA;QACF,IAAI,CAAC,WAAW,EAAE,CAAA;QAClB,OAAO,GAAG,EAAE;YACR,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,KAAK,MAAM;oBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC9E,CAAC;YACD,IAAI,CAAC,WAAW,EAAE,CAAA;QACtB,CAAC,CAAA;IACL,CAAC;IAED,OAAO,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,CAAA;IAC3C,CAAC;IAED,uDAAuD;IACvD,KAAK;QACD,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;QACrB,IAAI,CAAC,WAAW,EAAE,CAAA;IACtB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,GAAW;QACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,6FAA6F,CAAC,CAAA;QAClH,CAAC;QACD,IAAI,OAAO,GAAY,IAAI,CAAA;QAC3B,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC;gBACD,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,CAAA;gBAC/B,IAAI,KAAK,IAAI,IAAI;oBAAE,OAAO,KAA+B,CAAA;YAC7D,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACb,OAAO,KAAK,KAAK,CAAA;YACrB,CAAC;QACL,CAAC;QACD,IAAI,OAAO;YAAE,MAAM,OAAO,CAAA;QAC1B,OAAO,IAAI,CAAA;IACf,CAAC;IAED,kEAAkE;IAClE,KAAK,CAAC,KAAK;QACP,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,gBAAgB,QAAQ,CAAC,CAAoB,CAAA;IAC/E,CAAC;CACJ;AAED,MAAM,CAAC,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAA","sourcesContent":["import { geoArea } from \"d3-geo\"\n\nimport {\n    GEO_DATA_FORMAT,\n    type GeoFeature,\n    type GeoFileData,\n    type GeoIndex,\n    type GeoPolygon,\n    type GeoRingRef,\n} from \"./format\"\nimport { ringBuckets } from \"./simplify\"\n\n/** Prefix every data key carries; bumped with the file format. */\nexport const GEO_DATA_VERSION = `v${GEO_DATA_FORMAT}`\n\n/**\n * Answers a data key — `v1/countries/FR`, `v1/states/US`, `v1/index` — with the\n * parsed file, or `null` when this source does not have it. A throw means \"could\n * not tell\" (offline, a 500) and is retried on the next load.\n */\nexport type GeoSource = (key: string) => Promise<unknown>\n\ntype Position = readonly [number, number] | readonly number[]\ntype GeoPolygonShape =\n    | { type: \"Polygon\"; coordinates: readonly (readonly Position[])[] }\n    | { type: \"MultiPolygon\"; coordinates: readonly (readonly (readonly Position[])[])[] }\n/** GeoJSON in lon/lat: a Polygon, a MultiPolygon, or a Feature holding one. */\nexport type GeoShape = GeoPolygonShape | { type: \"Feature\"; geometry: GeoPolygonShape; properties?: { name?: string } | null }\n\nexport interface GeoDefinition {\n    shape: GeoShape\n    name?: string\n    /** The country a subdivision code expands under, when it has one. */\n    parent?: string\n}\n\n/** Fetches `<base>/<key>.json`; `base` may instead map a key to its URL. */\nexport function geoUrlSource(base: string | ((key: string) => string), init?: RequestInit): GeoSource {\n    return async (key) => {\n        const url = typeof base === \"function\" ? base(key) : `${base.replace(/\\/+$/, \"\")}/${key}.json`\n        const response = await fetch(url, init)\n        // Supabase Storage answers a missing object with 400, not 404.\n        if (response.status === 404 || response.status === 400) return null\n        if (!response.ok) throw new Error(`${url} → HTTP ${response.status}`)\n        return response.json()\n    }\n}\n\n/** Wraps a function returning the file as text, bytes or parsed JSON (e.g. `fs.readFile`). */\nexport function geoLoaderSource(\n    load: (key: string) => Promise<string | ArrayBuffer | Uint8Array | object | null | undefined>\n): GeoSource {\n    return async (key) => {\n        const value = await load(key)\n        if (value == null) return null\n        if (typeof value === \"string\") return JSON.parse(value)\n        if (value instanceof ArrayBuffer || value instanceof Uint8Array) {\n            return JSON.parse(new TextDecoder().decode(value))\n        }\n        return value\n    }\n}\n\nfunction definedFeature(code: string, definition: GeoDefinition, serial: number): GeoFeature {\n    const shape = definition.shape.type === \"Feature\" ? definition.shape.geometry : definition.shape\n    const feature = definition.shape.type === \"Feature\" ? definition.shape : null\n    const polygons: readonly (readonly (readonly Position[])[])[] =\n        shape.type === \"Polygon\" ? [shape.coordinates] : shape.coordinates\n    let arcIndex = 0\n\n    const toRing = (ring: readonly Position[]): GeoRingRef => {\n        const closed = ring.length > 0 && ring[0][0] === ring[ring.length - 1][0] && ring[0][1] === ring[ring.length - 1][1]\n        const coordinates = closed ? ring : [...ring, ring[0]]\n        const points = new Float64Array(coordinates.length * 2)\n        coordinates.forEach(([lon, lat], i) => {\n            points[i * 2] = lon\n            points[i * 2 + 1] = lat\n        })\n        return { arc: { key: `define:${serial}:${code}:${arcIndex++}`, points, buckets: ringBuckets(points) }, reversed: false }\n    }\n\n    const measured: GeoPolygon[] = polygons.map((rings) => {\n        const resolved = rings.map((ring) => [toRing(ring)])\n        const ringAreas = rings.map((ring) => {\n            const area = geoArea({ type: \"Polygon\", coordinates: [ring as [number, number][]] })\n            return area > 2 * Math.PI ? 4 * Math.PI - area : area\n        })\n        const area = Math.max(0, ringAreas[0] - ringAreas.slice(1).reduce((a, b) => a + b, 0))\n        return { rings: resolved, ringAreas, area, mainland: true }\n    })\n\n    const name = definition.name ?? feature?.properties?.name ?? code\n    return {\n        code,\n        name,\n        nameNl: name,\n        parent: definition.parent ?? (code.includes(\"-\") ? code.slice(0, 2) : null),\n        first: true,\n        listed: false,\n        remote: false,\n        polygons: measured,\n    }\n}\n\nclass GeoRegistry {\n    private _sources: GeoSource[] = []\n    private _defined = new Map<string, { serial: number; feature: GeoFeature }>()\n    private _generation = 0\n    private _serial = 0\n\n    /** Bumps whenever a source or a definition is added or removed. */\n    get generation(): number {\n        return this._generation\n    }\n\n    get hasSources(): boolean {\n        return this._sources.length > 0\n    }\n\n    /** Adds a source after every source already registered. Returns its removal. */\n    use(source: GeoSource): () => void {\n        this._sources.push(source)\n        this._generation++\n        return () => {\n            const i = this._sources.indexOf(source)\n            if (i < 0) return\n            this._sources.splice(i, 1)\n            this._generation++\n        }\n    }\n\n    /**\n     * Shapes (GeoJSON, lon/lat) under codes of your choosing, checked before any\n     * source. A definition replaces generated data for the same code.\n     */\n    define(shapes: Record<string, GeoShape | GeoDefinition>): () => void {\n        const serial = ++this._serial\n        const codes = Object.entries(shapes).map(([rawCode, value]) => {\n            const code = rawCode.trim().toUpperCase()\n            const definition = \"shape\" in value ? value : { shape: value }\n            this._defined.set(code, { serial, feature: definedFeature(code, definition, serial) })\n            return code\n        })\n        this._generation++\n        return () => {\n            for (const code of codes) {\n                if (this._defined.get(code)?.serial === serial) this._defined.delete(code)\n            }\n            this._generation++\n        }\n    }\n\n    defined(code: string): GeoFeature | undefined {\n        return this._defined.get(code)?.feature\n    }\n\n    /** Removes every source and definition — for tests. */\n    reset(): void {\n        this._sources = []\n        this._defined.clear()\n        this._generation++\n    }\n\n    /**\n     * Asks each source in registration order; the first non-null answer wins.\n     * Resolves `null` only when every source answered that it has no such file.\n     */\n    async resolve(key: string): Promise<GeoFileData | GeoIndex | null> {\n        if (this._sources.length === 0) {\n            throw new Error(\"No geo source registered — call geoRegistry.use(geoUrlSource(…)) before rendering GeoBorder\")\n        }\n        let failure: unknown = null\n        for (const source of [...this._sources]) {\n            try {\n                const value = await source(key)\n                if (value != null) return value as GeoFileData | GeoIndex\n            } catch (error) {\n                failure ??= error\n            }\n        }\n        if (failure) throw failure\n        return null\n    }\n\n    /** Every listed region's code, names and parent, for a picker. */\n    async index(): Promise<GeoIndex | null> {\n        return (await this.resolve(`${GEO_DATA_VERSION}/index`)) as GeoIndex | null\n    }\n}\n\nexport const geoRegistry = new GeoRegistry()\n"]}

package/dist/border/selection.d.ts

@@ -0,0 +1,21 @@
+import type { GeoFeature } from "./format.js";
+export type GeoLevel = "country" | "state";
+export type GeoFrame = "mainland" | "all";
+/** `"fr, de"`, `["FR", "de"]` → `["FR", "DE"]`; unique, in order, empties dropped. */
+export declare function normalizeIso(value: unknown): string[];
+/** Every data file a selection reads, for `declareAssets`. Depends on nothing but its arguments. */
+export declare function geoFilesFor(codes: readonly string[], level: GeoLevel): string[];
+export interface GeoSelection {
+    features: GeoFeature[];
+    /** A file this selection needs has not landed yet. */
+    pending: boolean;
+    /** Codes whose file loaded without them. */
+    unknown: string[];
+}
+/**
+ * The features a selection draws. A bare country code at state level is its
+ * first-level subdivisions — minus the remote ones when framing the mainland —
+ * or the country itself when it has none.
+ */
+export declare function selectGeoFeatures(codes: readonly string[], level: GeoLevel, frame: GeoFrame): GeoSelection;
+//# sourceMappingURL=selection.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"selection.d.ts","sourceRoot":"","sources":["../../src/border/selection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAI1C,MAAM,MAAM,QAAQ,GAAG,SAAS,GAAG,OAAO,CAAA;AAC1C,MAAM,MAAM,QAAQ,GAAG,UAAU,GAAG,KAAK,CAAA;AAIzC,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,EAAE,CASrD;AAMD,oGAAoG;AACpG,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM,EAAE,CAQ/E;AAED,MAAM,WAAW,YAAY;IACzB,QAAQ,EAAE,UAAU,EAAE,CAAA;IACtB,sDAAsD;IACtD,OAAO,EAAE,OAAO,CAAA;IAChB,4CAA4C;IAC5C,OAAO,EAAE,MAAM,EAAE,CAAA;CACpB;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,GAAG,YAAY,CA6C1G"}

package/dist/border/selection.js

@@ -0,0 +1,86 @@
+import { countryFileKey, geoFileEntry, statesFileKey } from "./loader.js";
+import { geoRegistry } from "./registry.js";
+const CODE = /^[A-Z]{2}(-[A-Z0-9]{1,3})?$/;
+/** `"fr, de"`, `["FR", "de"]` → `["FR", "DE"]`; unique, in order, empties dropped. */
+export function normalizeIso(value) {
+    const raw = Array.isArray(value) ? value : typeof value === "string" ? value.split(/[\s,;]+/) : [];
+    const out = [];
+    for (const item of raw) {
+        if (typeof item !== "string")
+            continue;
+        const code = item.trim().toUpperCase();
+        if (code && !out.includes(code))
+            out.push(code);
+    }
+    return out;
+}
+function isSubdivision(code) {
+    return code.includes("-");
+}
+/** Every data file a selection reads, for `declareAssets`. Depends on nothing but its arguments. */
+export function geoFilesFor(codes, level) {
+    const files = new Set();
+    for (const code of codes) {
+        if (!CODE.test(code) || geoRegistry.defined(code))
+            continue;
+        if (isSubdivision(code))
+            files.add(statesFileKey(code.slice(0, 2)));
+        else
+            files.add(level === "state" ? statesFileKey(code) : countryFileKey(code));
+    }
+    return [...files];
+}
+/**
+ * The features a selection draws. A bare country code at state level is its
+ * first-level subdivisions — minus the remote ones when framing the mainland —
+ * or the country itself when it has none.
+ */
+export function selectGeoFeatures(codes, level, frame) {
+    const features = [];
+    const seen = new Set();
+    const unknown = [];
+    let pending = false;
+    const add = (feature) => {
+        if (seen.has(feature.code))
+            return;
+        seen.add(feature.code);
+        features.push(feature);
+    };
+    for (const code of codes) {
+        const defined = geoRegistry.defined(code);
+        if (defined) {
+            add(defined);
+            continue;
+        }
+        if (!CODE.test(code)) {
+            unknown.push(code);
+            continue;
+        }
+        const subdivision = isSubdivision(code);
+        const key = subdivision || level === "state" ? statesFileKey(code.slice(0, 2)) : countryFileKey(code);
+        const entry = geoFileEntry(key);
+        if (!entry || entry.status !== "ready") {
+            if (!entry)
+                pending = true;
+            continue;
+        }
+        const file = entry.file.features;
+        if (subdivision || level === "country") {
+            const feature = file.get(code);
+            if (feature)
+                add(feature);
+            else
+                unknown.push(code);
+            continue;
+        }
+        const children = [...file.values()].filter((f) => f.parent === code && f.first && !(frame === "mainland" && f.remote));
+        if (children.length > 0)
+            children.forEach(add);
+        else if (file.get(code))
+            add(file.get(code));
+        else
+            unknown.push(code);
+    }
+    return { features, pending, unknown };
+}
+//# sourceMappingURL=selection.js.map

package/dist/border/selection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selection.js","sourceRoot":"","sources":["../../src/border/selection.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,UAAU,CAAA;AACtE,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAKxC,MAAM,IAAI,GAAG,6BAA6B,CAAA;AAE1C,sFAAsF;AACtF,MAAM,UAAU,YAAY,CAAC,KAAc;IACvC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAClG,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,SAAQ;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;QACtC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnD,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,SAAS,aAAa,CAAC,IAAY;IAC/B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;AAC7B,CAAC;AAED,oGAAoG;AACpG,MAAM,UAAU,WAAW,CAAC,KAAwB,EAAE,KAAe;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC3D,IAAI,aAAa,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;;YAC9D,KAAK,CAAC,GAAG,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAA;IAClF,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAA;AACrB,CAAC;AAUD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAwB,EAAE,KAAe,EAAE,KAAe;IACxF,MAAM,QAAQ,GAAiB,EAAE,CAAA;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,IAAI,OAAO,GAAG,KAAK,CAAA;IAEnB,MAAM,GAAG,GAAG,CAAC,OAAmB,EAAE,EAAE;QAChC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,OAAM;QAClC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACtB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAC1B,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACzC,IAAI,OAAO,EAAE,CAAC;YACV,GAAG,CAAC,OAAO,CAAC,CAAA;YACZ,SAAQ;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClB,SAAQ;QACZ,CAAC;QACD,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;QACvC,MAAM,GAAG,GAAG,WAAW,IAAI,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACrG,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAA;QAC/B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK;gBAAE,OAAO,GAAG,IAAI,CAAA;YAC1B,SAAQ;QACZ,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAA;QAChC,IAAI,WAAW,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,OAAO;gBAAE,GAAG,CAAC,OAAO,CAAC,CAAA;;gBACpB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvB,SAAQ;QACZ,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,UAAU,IAAI,CAAC,CAAC,MAAM,CAAC,CAC7E,CAAA;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;aACzC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAA;;YACxC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAA;AACzC,CAAC","sourcesContent":["import type { GeoFeature } from \"./format\"\nimport { countryFileKey, geoFileEntry, statesFileKey } from \"./loader\"\nimport { geoRegistry } from \"./registry\"\n\nexport type GeoLevel = \"country\" | \"state\"\nexport type GeoFrame = \"mainland\" | \"all\"\n\nconst CODE = /^[A-Z]{2}(-[A-Z0-9]{1,3})?$/\n\n/** `\"fr, de\"`, `[\"FR\", \"de\"]` → `[\"FR\", \"DE\"]`; unique, in order, empties dropped. */\nexport function normalizeIso(value: unknown): string[] {\n    const raw = Array.isArray(value) ? value : typeof value === \"string\" ? value.split(/[\\s,;]+/) : []\n    const out: string[] = []\n    for (const item of raw) {\n        if (typeof item !== \"string\") continue\n        const code = item.trim().toUpperCase()\n        if (code && !out.includes(code)) out.push(code)\n    }\n    return out\n}\n\nfunction isSubdivision(code: string): boolean {\n    return code.includes(\"-\")\n}\n\n/** Every data file a selection reads, for `declareAssets`. Depends on nothing but its arguments. */\nexport function geoFilesFor(codes: readonly string[], level: GeoLevel): string[] {\n    const files = new Set<string>()\n    for (const code of codes) {\n        if (!CODE.test(code) || geoRegistry.defined(code)) continue\n        if (isSubdivision(code)) files.add(statesFileKey(code.slice(0, 2)))\n        else files.add(level === \"state\" ? statesFileKey(code) : countryFileKey(code))\n    }\n    return [...files]\n}\n\nexport interface GeoSelection {\n    features: GeoFeature[]\n    /** A file this selection needs has not landed yet. */\n    pending: boolean\n    /** Codes whose file loaded without them. */\n    unknown: string[]\n}\n\n/**\n * The features a selection draws. A bare country code at state level is its\n * first-level subdivisions — minus the remote ones when framing the mainland —\n * or the country itself when it has none.\n */\nexport function selectGeoFeatures(codes: readonly string[], level: GeoLevel, frame: GeoFrame): GeoSelection {\n    const features: GeoFeature[] = []\n    const seen = new Set<string>()\n    const unknown: string[] = []\n    let pending = false\n\n    const add = (feature: GeoFeature) => {\n        if (seen.has(feature.code)) return\n        seen.add(feature.code)\n        features.push(feature)\n    }\n\n    for (const code of codes) {\n        const defined = geoRegistry.defined(code)\n        if (defined) {\n            add(defined)\n            continue\n        }\n        if (!CODE.test(code)) {\n            unknown.push(code)\n            continue\n        }\n        const subdivision = isSubdivision(code)\n        const key = subdivision || level === \"state\" ? statesFileKey(code.slice(0, 2)) : countryFileKey(code)\n        const entry = geoFileEntry(key)\n        if (!entry || entry.status !== \"ready\") {\n            if (!entry) pending = true\n            continue\n        }\n        const file = entry.file.features\n        if (subdivision || level === \"country\") {\n            const feature = file.get(code)\n            if (feature) add(feature)\n            else unknown.push(code)\n            continue\n        }\n        const children = [...file.values()].filter(\n            (f) => f.parent === code && f.first && !(frame === \"mainland\" && f.remote)\n        )\n        if (children.length > 0) children.forEach(add)\n        else if (file.get(code)) add(file.get(code)!)\n        else unknown.push(code)\n    }\n\n    return { features, pending, unknown }\n}\n"]}

package/dist/border/simplify.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Visvalingam–Whyatt weights for a hand-defined ring, in the same buckets the
+ * generated data carries (`-2·log2` of the effective area in steradians), so a
+ * shape passed to `geoRegistry.define` answers to `detail` like any other.
+ *
+ * Planar in degrees with longitude scaled by latitude: accurate enough for the
+ * handful of shapes an author defines, where the generated data uses the exact
+ * spherical area.
+ */
+export declare function ringBuckets(points: Float64Array): Uint8Array;
+export declare function weightBucket(weight: number): number;
+//# sourceMappingURL=simplify.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../src/border/simplify.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,CA8F5D;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAInD"}

package/dist/border/simplify.js

@@ -0,0 +1,116 @@
+/**
+ * Visvalingam–Whyatt weights for a hand-defined ring, in the same buckets the
+ * generated data carries (`-2·log2` of the effective area in steradians), so a
+ * shape passed to `geoRegistry.define` answers to `detail` like any other.
+ *
+ * Planar in degrees with longitude scaled by latitude: accurate enough for the
+ * handful of shapes an author defines, where the generated data uses the exact
+ * spherical area.
+ */
+export function ringBuckets(points) {
+    const n = points.length / 2;
+    const buckets = new Uint8Array(n);
+    if (n < 3)
+        return buckets;
+    const radians = Math.PI / 180;
+    const weight = new Float64Array(n);
+    const prev = new Int32Array(n);
+    const next = new Int32Array(n);
+    for (let i = 0; i < n; i++) {
+        prev[i] = i - 1;
+        next[i] = i + 1;
+    }
+    const area = (a, b, c) => {
+        const cos = Math.cos(points[b * 2 + 1] * radians);
+        const ax = points[a * 2] * cos, ay = points[a * 2 + 1];
+        const bx = points[b * 2] * cos, by = points[b * 2 + 1];
+        const cx = points[c * 2] * cos, cy = points[c * 2 + 1];
+        return (Math.abs((bx - ax) * (cy - ay) - (cx - ax) * (by - ay)) / 2) * radians * radians;
+    };
+    const heap = [];
+    const position = new Int32Array(n).fill(-1);
+    const less = (i, j) => weight[heap[i]] < weight[heap[j]];
+    const swap = (i, j) => {
+        ;
+        [heap[i], heap[j]] = [heap[j], heap[i]];
+        position[heap[i]] = i;
+        position[heap[j]] = j;
+    };
+    const up = (i) => {
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (!less(i, parent))
+                break;
+            swap(i, parent);
+            i = parent;
+        }
+    };
+    const down = (i) => {
+        for (;;) {
+            const l = 2 * i + 1;
+            const r = l + 1;
+            let smallest = i;
+            if (l < heap.length && less(l, smallest))
+                smallest = l;
+            if (r < heap.length && less(r, smallest))
+                smallest = r;
+            if (smallest === i)
+                return;
+            swap(i, smallest);
+            i = smallest;
+        }
+    };
+    const push = (i) => {
+        position[i] = heap.length;
+        heap.push(i);
+        up(heap.length - 1);
+    };
+    const remove = (i) => {
+        const at = position[i];
+        const last = heap.pop();
+        position[i] = -1;
+        if (at < heap.length) {
+            heap[at] = last;
+            position[last] = at;
+            up(at);
+            down(position[last]);
+        }
+    };
+    for (let i = 1; i < n - 1; i++) {
+        weight[i] = area(i - 1, i, i + 1);
+        push(i);
+    }
+    let floor = 0;
+    const final = new Float64Array(n);
+    final[0] = final[n - 1] = Infinity;
+    while (heap.length > 0) {
+        const i = heap[0];
+        remove(i);
+        floor = Math.max(floor, weight[i]);
+        final[i] = floor;
+        const p = prev[i];
+        const q = next[i];
+        if (p >= 0)
+            next[p] = q;
+        if (q < n)
+            prev[q] = p;
+        for (const j of [p, q]) {
+            if (j <= 0 || j >= n - 1 || position[j] < 0)
+                continue;
+            remove(j);
+            weight[j] = area(prev[j], j, next[j]);
+            push(j);
+        }
+    }
+    for (let i = 0; i < n; i++)
+        buckets[i] = weightBucket(final[i]);
+    return buckets;
+}
+export function weightBucket(weight) {
+    if (weight === Infinity)
+        return 0;
+    if (!(weight > 0))
+        return 255;
+    return Math.min(254, Math.max(1, Math.round(-2 * Math.log2(weight))));
+}
+//# sourceMappingURL=simplify.js.map

package/dist/border/simplify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.js","sourceRoot":"","sources":["../../src/border/simplify.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,MAAoB;IAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;IAC3B,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;IACjC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,OAAO,CAAA;IAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAA;IAC7B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAA;IAClC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;IAC9B,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACf,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACnB,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;QACrD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAA;QACjD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACtD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACtD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACtD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,OAAO,CAAA;IAC5F,CAAC,CAAA;IAED,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACxE,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QAClC,CAAC;QAAA,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACxC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACrB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC,CAAA;IACD,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE;QACrB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC;gBAAE,MAAK;YAC3B,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;YACf,CAAC,GAAG,MAAM,CAAA;QACd,CAAC;IACL,CAAC,CAAA;IACD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;QACvB,SAAS,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACf,IAAI,QAAQ,GAAG,CAAC,CAAA;YAChB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC;gBAAE,QAAQ,GAAG,CAAC,CAAA;YACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC;gBAAE,QAAQ,GAAG,CAAC,CAAA;YACtD,IAAI,QAAQ,KAAK,CAAC;gBAAE,OAAM;YAC1B,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YACjB,CAAC,GAAG,QAAQ,CAAA;QAChB,CAAC;IACL,CAAC,CAAA;IACD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;QACvB,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACZ,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvB,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE;QACzB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAG,CAAA;QACxB,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAChB,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;YACf,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;YACnB,EAAE,CAAC,EAAE,CAAC,CAAA;YACN,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;QACxB,CAAC;IACL,CAAC,CAAA;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACjC,IAAI,CAAC,CAAC,CAAC,CAAA;IACX,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAA;IACjC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAA;IAClC,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,MAAM,CAAC,CAAC,CAAC,CAAA;QACT,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QAClC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,SAAQ;YACrD,MAAM,CAAC,CAAC,CAAC,CAAA;YACT,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YACrC,IAAI,CAAC,CAAC,CAAC,CAAA;QACX,CAAC;IACL,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/D,OAAO,OAAO,CAAA;AAClB,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,MAAc;IACvC,IAAI,MAAM,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAA;IACjC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QAAE,OAAO,GAAG,CAAA;IAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AACzE,CAAC","sourcesContent":["/**\n * Visvalingam–Whyatt weights for a hand-defined ring, in the same buckets the\n * generated data carries (`-2·log2` of the effective area in steradians), so a\n * shape passed to `geoRegistry.define` answers to `detail` like any other.\n *\n * Planar in degrees with longitude scaled by latitude: accurate enough for the\n * handful of shapes an author defines, where the generated data uses the exact\n * spherical area.\n */\nexport function ringBuckets(points: Float64Array): Uint8Array {\n    const n = points.length / 2\n    const buckets = new Uint8Array(n)\n    if (n < 3) return buckets\n\n    const radians = Math.PI / 180\n    const weight = new Float64Array(n)\n    const prev = new Int32Array(n)\n    const next = new Int32Array(n)\n    for (let i = 0; i < n; i++) {\n        prev[i] = i - 1\n        next[i] = i + 1\n    }\n\n    const area = (a: number, b: number, c: number): number => {\n        const cos = Math.cos(points[b * 2 + 1] * radians)\n        const ax = points[a * 2] * cos, ay = points[a * 2 + 1]\n        const bx = points[b * 2] * cos, by = points[b * 2 + 1]\n        const cx = points[c * 2] * cos, cy = points[c * 2 + 1]\n        return (Math.abs((bx - ax) * (cy - ay) - (cx - ax) * (by - ay)) / 2) * radians * radians\n    }\n\n    const heap: number[] = []\n    const position = new Int32Array(n).fill(-1)\n    const less = (i: number, j: number) => weight[heap[i]] < weight[heap[j]]\n    const swap = (i: number, j: number) => {\n        ;[heap[i], heap[j]] = [heap[j], heap[i]]\n        position[heap[i]] = i\n        position[heap[j]] = j\n    }\n    const up = (i: number) => {\n        while (i > 0) {\n            const parent = (i - 1) >> 1\n            if (!less(i, parent)) break\n            swap(i, parent)\n            i = parent\n        }\n    }\n    const down = (i: number) => {\n        for (;;) {\n            const l = 2 * i + 1\n            const r = l + 1\n            let smallest = i\n            if (l < heap.length && less(l, smallest)) smallest = l\n            if (r < heap.length && less(r, smallest)) smallest = r\n            if (smallest === i) return\n            swap(i, smallest)\n            i = smallest\n        }\n    }\n    const push = (i: number) => {\n        position[i] = heap.length\n        heap.push(i)\n        up(heap.length - 1)\n    }\n    const remove = (i: number) => {\n        const at = position[i]\n        const last = heap.pop()!\n        position[i] = -1\n        if (at < heap.length) {\n            heap[at] = last\n            position[last] = at\n            up(at)\n            down(position[last])\n        }\n    }\n\n    for (let i = 1; i < n - 1; i++) {\n        weight[i] = area(i - 1, i, i + 1)\n        push(i)\n    }\n\n    let floor = 0\n    const final = new Float64Array(n)\n    final[0] = final[n - 1] = Infinity\n    while (heap.length > 0) {\n        const i = heap[0]\n        remove(i)\n        floor = Math.max(floor, weight[i])\n        final[i] = floor\n        const p = prev[i]\n        const q = next[i]\n        if (p >= 0) next[p] = q\n        if (q < n) prev[q] = p\n        for (const j of [p, q]) {\n            if (j <= 0 || j >= n - 1 || position[j] < 0) continue\n            remove(j)\n            weight[j] = area(prev[j], j, next[j])\n            push(j)\n        }\n    }\n\n    for (let i = 0; i < n; i++) buckets[i] = weightBucket(final[i])\n    return buckets\n}\n\nexport function weightBucket(weight: number): number {\n    if (weight === Infinity) return 0\n    if (!(weight > 0)) return 255\n    return Math.min(254, Math.max(1, Math.round(-2 * Math.log2(weight))))\n}\n"]}