isard 2.1.2 → 2.1.3

package/CHANGELOG.md

@@ -5,6 +5,16 @@ versions [Semantic Versioning](https://semver.org) (before 1.0.0, a minor versio
 
 ## [Unreleased]
 
+## [2.1.3] - 2026-11-01
+
+With `isard-react-native` and `isard-map` (Python) 2.1.3.
+
+### Changed
+
+- The basemap workers' decoded vector tiles lighter again: each layer's features' properties kept as indices into its
+  keys and values, a feature's properties' object made as they are read and kept until the worker's task ends (a tile
+  of Paris's middle some 3.5 MB of a worker's heap against 4.2, decoded in 4.6 ms against 5.4)
+
 ## [2.1.2] - 2026-11-01
 
 With `isard-react-native` and `isard-map` (Python) 2.1.2.

package/dist/basemap/mvt.d.ts

@@ -9,6 +9,7 @@ export type Ring = ArrayLike<number>;
 export interface TileFeature {
     /** 1 point, 2 line, 3 polygon */
     readonly type: 1 | 2 | 3;
+    /** Its properties (a decoded tile's: an object made from its layer's keys and values when read, kept for the task) */
     readonly properties: Record<string, Value>;
     /** Point lists (a decoded tile's: views made as they are read, of one buffer for its whole layer) */
     readonly geometry: readonly Ring[];
@@ -19,8 +20,8 @@ export interface TileLayer {
     /** The heap it takes, about (`decodedBytes`) */
     bytes: number;
 }
-/** The heap a decoded tile takes, about (bytes): its features with their properties, their coordinates (measured on a
- * city's tile in Bun's JavaScriptCore, Safari's engine) */
+/** The heap a decoded tile takes, about (bytes): its features, their tags and coordinates, its keys and values
+ * (measured on a city's tile in Bun's JavaScriptCore, Safari's engine) */
 export declare const decodedBytes: (tile: Map<string, TileLayer>) => number;
 /** Decodes a tile; only the layers in `wanted` (all if undefined) */
 export declare const decode: (bytes: Uint8Array, wanted?: Set<string>) => Map<string, TileLayer>;

package/dist/basemap/mvt.js

@@ -4,30 +4,50 @@
  * outer ones clockwise in tile coordinates, y down, holes the other way round, as the specification says).
  */
 /**
- * A decoded feature: its point lists as two indices into its layer's `Shapes`, their views made each time they are
- * read. A city's tile holds some hundred thousand points in thirty thousand lists: as arrays (or views kept), some 6 to
- * 9 MB of a worker's heap a tile, which its full collections go through again and again; in one buffer, under 1 MB
+ * A decoded feature: its index in its layer's `Store`, its point lists' views made each time they are read, its
+ * properties' object once a task. A city's tile holds some hundred thousand points in thirty thousand lists and a hundred thousand
+ * properties: as arrays and objects, which a worker's full collections go through again and again, some 15 MB of its
+ * heap a tile; in buffers, under 3 MB
  */
 class Feature {
     type;
-    properties;
-    shapes;
-    first;
-    end;
-    constructor(type, properties, shapes, first, end) {
+    store;
+    index;
+    constructor(type, store, index) {
         this.type = type;
-        this.properties = properties;
-        this.shapes = shapes;
-        this.first = first;
-        this.end = end;
+        this.store = store;
+        this.index = index;
     }
     get geometry() {
-        const { values, ranges } = this.shapes;
+        const { values, ranges, spans } = this.store;
         const rings = [];
-        for (let r = this.first; r < this.end; r += 2)
+        const end = spans[this.index * 4 + 1] ?? 0;
+        for (let r = spans[this.index * 4] ?? 0; r < end; r += 2)
             rings.push(values.subarray(ranges[r], ranges[r + 1]));
         return rings;
     }
+    get properties() {
+        const { store } = this;
+        if (!store.made) {
+            store.made = [];
+            setTimeout(() => {
+                store.made = undefined;
+            });
+        }
+        const made = store.made[this.index] ?? this.made();
+        store.made[this.index] = made;
+        return made;
+    }
+    made() {
+        const { tags, keys, properties, spans } = this.store;
+        const out = {};
+        const end = spans[this.index * 4 + 3] ?? 0;
+        // The tags were checked against the keys and values as they were decoded
+        for (let t = spans[this.index * 4 + 2] ?? 0; t < end; t += 2) {
+            out[keys[tags[t] ?? 0] ?? ''] = properties[tags[t + 1] ?? 0] ?? '';
+        }
+        return out;
+    }
 }
 /** Protobuf reader of a buffer range */
 class Pbf {
@@ -205,11 +225,13 @@ const geometry = (p, out) => {
     }
     close();
 };
-/** The heap a decoded tile takes, about (bytes): its features with their properties, their coordinates (measured on a
- * city's tile in Bun's JavaScriptCore, Safari's engine) */
+/** The heap a decoded tile takes, about (bytes): its features, their tags and coordinates, its keys and values
+ * (measured on a city's tile in Bun's JavaScriptCore, Safari's engine) */
 export const decodedBytes = (tile) => [...tile.values()].reduce((sum, layer) => sum + layer.bytes, 0);
-/** A feature and its properties, about (bytes) */
-const FEATURE_BYTES = 270;
+/** A feature, about (bytes) */
+const FEATURE_BYTES = 70;
+/** A key or a value (a string's characters counted apart), about (bytes) */
+const VALUE_BYTES = 40;
 /** Decodes a tile; only the layers in `wanted` (all if undefined) */
 export const decode = (bytes, wanted) => {
     const layers = new Map();
@@ -250,22 +272,24 @@ export const decode = (bytes, wanted) => {
         }
         if (wanted && !wanted.has(name))
             continue;
-        const decoded = [];
+        const types = [];
+        const spans = [];
         const coordinates = new Coordinates();
+        const tags = [];
         for (const f of raw) {
             let type = 1;
-            const properties = {};
             const first = coordinates.ranges.length;
+            const tagsFirst = tags.length;
             while (f.more) {
                 const t = f.varint();
                 switch (t >> 3) {
                     case 2: {
-                        const tags = f.sub();
-                        while (tags.more) {
-                            const k = keys[tags.varint()];
-                            const v = values[tags.varint()];
-                            if (k !== undefined && v !== undefined)
-                                properties[k] = v;
+                        const pairs = f.sub();
+                        while (pairs.more) {
+                            const k = pairs.varint();
+                            const v = pairs.varint();
+                            if (k < keys.length && v < values.length)
+                                tags.push(k, v);
                         }
                         break;
                     }
@@ -279,11 +303,24 @@ export const decode = (bytes, wanted) => {
                         f.skip(t & 7);
                 }
             }
-            decoded.push([type, properties, first, coordinates.ranges.length]);
+            types.push(type);
+            spans.push(first, coordinates.ranges.length, tagsFirst, tags.length);
         }
-        const shapes = coordinates.shapes();
-        const features = decoded.map(([type, properties, first, end]) => new Feature(type, properties, shapes, first, end));
-        const bytes = features.length * FEATURE_BYTES + shapes.values.byteLength + shapes.ranges.byteLength;
+        const store = {
+            ...coordinates.shapes(),
+            tags: Math.max(keys.length, values.length) <= 0x10000 ? Uint16Array.from(tags) : Uint32Array.from(tags),
+            keys,
+            properties: values,
+            spans: Uint32Array.from(spans),
+        };
+        const features = types.map((type, i) => new Feature(type, store, i));
+        const strings = [...keys, ...values].reduce((n, v) => n + VALUE_BYTES + (typeof v === 'string' ? v.length : 0), 0);
+        const bytes = features.length * FEATURE_BYTES +
+            store.values.byteLength +
+            store.ranges.byteLength +
+            store.tags.byteLength +
+            store.spans.byteLength +
+            strings;
         layers.set(name, { extent, features, bytes });
     }
     return layers;

package/dist/basemap/mvt.js.map

@@ -1 +1 @@
-{"version":3,"file":"mvt.js","sourceRoot":"","sources":["../../src/basemap/mvt.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAqBH;;;;GAIG;AACH,MAAM,OAAO;IAEA;IACA;IACQ;IACA;IACA;IALnB,YACW,IAAe,EACf,UAAiC,EACzB,MAAc,EACd,KAAa,EACb,GAAW;QAJnB,SAAI,GAAJ,IAAI,CAAW;QACf,eAAU,GAAV,UAAU,CAAuB;QACzB,WAAM,GAAN,MAAM,CAAQ;QACd,UAAK,GAAL,KAAK,CAAQ;QACb,QAAG,GAAH,GAAG,CAAQ;IAC3B,CAAC;IAEJ,IAAI,QAAQ;QACV,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAErG,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AASD,wCAAwC;AACxC,MAAM,GAAG;IAGY;IAER;IAJX,GAAG,CAAS;IACZ,YACmB,GAAe,EAChC,KAAK,GAAG,CAAC,EACA,MAAM,GAAG,CAAC,MAAM;QAFR,QAAG,GAAH,GAAG,CAAY;QAEvB,QAAG,GAAH,GAAG,CAAa;QAEzB,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,kHAAkH;IAClH,MAAM;QACJ,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAEpC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI;gBAAE,MAAM;QACtB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD,iFAAiF;IACjF,KAAK;QACH,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QAEX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;YAEtB,yEAAyE;YACzE,IAAI,CAAC,GAAG,CAAC;gBAAE,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;iBAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjB,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC1B,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC;YAClB,CAAC;;gBAAM,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI;gBAAE,MAAM;QACtB,CAAC;QAED,yDAAyD;QACzD,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAExB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC;IACD,+CAA+C;IAC/C,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3C,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3D,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,OAAO,CAAC,CAAC;IACX,CAAC;IACD,KAAK;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAEd,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAEd,OAAO,CAAC,CAAC;IACX,CAAC;IACO,IAAI;QACV,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,CAAC,IAAY;QACf,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,EAAE,CAAC;aACzB,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;aAC9B,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;aAC1C,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IAC7B,CAAC;CACF;AAED,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;AAElC,MAAM,KAAK,GAAG,CAAC,CAAM,EAAS,EAAE;IAC9B,IAAI,CAAC,GAAU,EAAE,CAAC;IAElB,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAEvB,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACd,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACd,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;gBACb,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACrB,MAAM;YACR;gBACE,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,4GAA4G;AAC5G,MAAM,WAAW;IACf,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,GAAG,CAAC,CAAC;IACX,kDAAkD;IACzC,MAAM,GAAa,EAAE,CAAC;IAE/B,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAErD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,uEAAuE;IACvE,MAAM;QACJ,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9F,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAE,GAAgB,EAAQ,EAAE;IAClD,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,mEAAmE;IACnE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,IAAI,KAAK,IAAI,CAAC;YAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC,CAAC;IAEF,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC,CAAC;QAE3B,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACb,qCAAqC;YACrC,IAAI,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,KAAK;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACnG,SAAS;QACX,CAAC;QACD,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,KAAK,EAAE,CAAC;gBACR,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;YACrB,CAAC;YACD,IAAI,KAAK,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,KAAK,EAAE,CAAC;AACV,CAAC,CAAC;AAEF;2DAC2D;AAC3D,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,IAA4B,EAAU,EAAE,CACnE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAClE,kDAAkD;AAClD,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,qEAAqE;AACrE,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAiB,EAAE,MAAoB,EAA0B,EAAE;IACxF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE5B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAE1B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACrB,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAU,EAAE,CAAC;QAEtB,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YAErB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC;oBACJ,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;oBAClB,MAAM;gBACR,KAAK,CAAC;oBACJ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;oBAClB,MAAM;gBACR,KAAK,CAAC;oBACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;oBACtB,MAAM;gBACR,KAAK,CAAC;oBACJ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;oBAC5B,MAAM;gBACR,KAAK,CAAC;oBACJ,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;oBACpB,MAAM;gBACR;oBACE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAE1C,MAAM,OAAO,GAAuF,EAAE,CAAC;QACvG,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;QAEtC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,IAAI,GAAc,CAAC,CAAC;YACxB,MAAM,UAAU,GAA0B,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC;YAExC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;gBACd,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAErB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,CAAC,CAAC,CAAC;wBACP,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;wBAErB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;4BACjB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;4BAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;4BAEhC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;gCAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC5D,CAAC;wBACD,MAAM;oBACR,CAAC;oBACD,KAAK,CAAC;wBACJ,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAc,CAAC;wBACzD,MAAM;oBACR,KAAK,CAAC;wBACJ,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,WAAW,CAAC,CAAC;wBAC/B,MAAM;oBACR;wBACE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACpH,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;QAEpG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC","sourcesContent":["/**\n * Mapbox Vector Tiles (MVT 2.1) decoding: layers of features with their properties and geometry, in tile units\n * (`extent`, usually 4096 across). Points are lists of points, lines lists of lines, polygons lists of rings (the\n * outer ones clockwise in tile coordinates, y down, holes the other way round, as the specification says).\n */\n\nexport type Value = string | number | boolean;\n\n/** A point list: x0, y0, x1, y1… in tile units */\nexport type Ring = ArrayLike<number>;\n\nexport interface TileFeature {\n  /** 1 point, 2 line, 3 polygon */\n  readonly type: 1 | 2 | 3;\n  readonly properties: Record<string, Value>;\n  /** Point lists (a decoded tile's: views made as they are read, of one buffer for its whole layer) */\n  readonly geometry: readonly Ring[];\n}\n\n/** A layer's coordinates, one feature's after the other, and where each point list starts and ends */\ninterface Shapes {\n  values: Int32Array;\n  ranges: Uint32Array;\n}\n\n/**\n * A decoded feature: its point lists as two indices into its layer's `Shapes`, their views made each time they are\n * read. A city's tile holds some hundred thousand points in thirty thousand lists: as arrays (or views kept), some 6 to\n * 9 MB of a worker's heap a tile, which its full collections go through again and again; in one buffer, under 1 MB\n */\nclass Feature implements TileFeature {\n  constructor(\n    readonly type: 1 | 2 | 3,\n    readonly properties: Record<string, Value>,\n    private readonly shapes: Shapes,\n    private readonly first: number,\n    private readonly end: number,\n  ) {}\n\n  get geometry(): Int32Array[] {\n    const { values, ranges } = this.shapes;\n    const rings: Int32Array[] = [];\n\n    for (let r = this.first; r < this.end; r += 2) rings.push(values.subarray(ranges[r], ranges[r + 1]));\n\n    return rings;\n  }\n}\n\nexport interface TileLayer {\n  extent: number;\n  features: TileFeature[];\n  /** The heap it takes, about (`decodedBytes`) */\n  bytes: number;\n}\n\n/** Protobuf reader of a buffer range */\nclass Pbf {\n  pos: number;\n  constructor(\n    private readonly buf: Uint8Array,\n    start = 0,\n    readonly end = buf.length,\n  ) {\n    this.pos = start;\n  }\n  /** An unsigned varint, approximated beyond 2^53; all its bytes are read (up to 10), so the next field is right */\n  varint(): number {\n    let value = 0;\n\n    for (let shift = 0; shift < 70; shift += 7) {\n      const b = this.buf[this.pos++] ?? 0;\n\n      value += (b & 0x7f) * 2 ** shift;\n      if (b < 0x80) break;\n    }\n\n    return value;\n  }\n  /** A signed 64-bit varint (two's complement: a negative value takes 10 bytes) */\n  int64(): number {\n    let lo = 0;\n    let hi = 0;\n\n    for (let i = 0; i < 10; i += 1) {\n      const b = this.buf[this.pos++] ?? 0;\n      const bits = b & 0x7f;\n\n      // Bits 0-27 in the low word, bits 28-31 split, the rest in the high word\n      if (i < 4) lo |= bits << (7 * i);\n      else if (i === 4) {\n        lo |= (bits & 0x0f) << 28;\n        hi |= bits >> 4;\n      } else hi |= bits << (7 * i - 32);\n      if (b < 0x80) break;\n    }\n\n    // The high word signed: values from 2^63 up are negative\n    return (hi | 0) * 2 ** 32 + (lo >>> 0);\n  }\n  sint(): number {\n    const v = this.varint();\n\n    return v % 2 === 1 ? -(v + 1) / 2 : v / 2;\n  }\n  /** A length-delimited field as a sub-reader */\n  sub(): Pbf {\n    const n = this.varint();\n    // A length past the end (a truncated tile) stops at the end\n    const end = Math.min(this.pos + n, this.end);\n    const r = new Pbf(this.buf, this.pos, end);\n\n    this.pos = end;\n\n    return r;\n  }\n  string(): string {\n    const n = this.varint();\n    const end = Math.min(this.pos + n, this.end);\n    const s = decoder.decode(this.buf.subarray(this.pos, end));\n\n    this.pos = end;\n\n    return s;\n  }\n  float(): number {\n    const v = this.pos + 4 <= this.end ? this.view().getFloat32(this.pos, true) : 0;\n\n    this.pos += 4;\n\n    return v;\n  }\n  double(): number {\n    const v = this.pos + 8 <= this.end ? this.view().getFloat64(this.pos, true) : 0;\n\n    this.pos += 8;\n\n    return v;\n  }\n  private view(): DataView {\n    return new DataView(this.buf.buffer, this.buf.byteOffset, this.buf.byteLength);\n  }\n  skip(wire: number): void {\n    if (wire === 0) this.varint();\n    else if (wire === 1) this.pos += 8;\n    else if (wire === 2) this.pos += this.varint();\n    else if (wire === 5) this.pos += 4;\n  }\n  get more(): boolean {\n    return this.pos < this.end;\n  }\n}\n\nconst decoder = new TextDecoder();\n\nconst value = (p: Pbf): Value => {\n  let v: Value = '';\n\n  while (p.more) {\n    const tag = p.varint();\n\n    switch (tag >> 3) {\n      case 1:\n        v = p.string();\n        break;\n      case 2:\n        v = p.float();\n        break;\n      case 3:\n        v = p.double();\n        break;\n      case 4:\n        v = p.int64();\n        break;\n      case 5:\n        v = p.varint();\n        break;\n      case 6:\n        v = p.sint();\n        break;\n      case 7:\n        v = p.varint() !== 0;\n        break;\n      default:\n        p.skip(tag & 7);\n    }\n  }\n\n  return v;\n};\n\n/** The coordinates of a layer's features, one after the other, and where each point list starts and ends */\nclass Coordinates {\n  values = new Int32Array(1024);\n  length = 0;\n  /** Per point list: its first value and its end */\n  readonly ranges: number[] = [];\n\n  push(x: number, y: number): void {\n    if (this.length + 2 > this.values.length) {\n      const grown = new Int32Array(this.values.length * 2);\n\n      grown.set(this.values);\n      this.values = grown;\n    }\n    this.values[this.length++] = x;\n    this.values[this.length++] = y;\n  }\n\n  /** The values and ranges cut to their lengths (once all are pushed) */\n  shapes(): Shapes {\n    return { values: this.values.slice(0, this.length), ranges: Uint32Array.from(this.ranges) };\n  }\n}\n\n/** Pushes the point lists of a geometry's commands (MoveTo, LineTo, ClosePath) */\nconst geometry = (p: Pbf, out: Coordinates): void => {\n  let [x, y] = [0, 0];\n  // The first value of the current point list (none before a MoveTo)\n  let start = -1;\n  const close = () => {\n    if (start >= 0) out.ranges.push(start, out.length);\n  };\n\n  while (p.more) {\n    const command = p.varint();\n    const id = command & 7;\n    const count = command >> 3;\n\n    if (id === 7) {\n      // ClosePath: back to the first point\n      if (start >= 0 && out.length > start) out.push(out.values[start] ?? 0, out.values[start + 1] ?? 0);\n      continue;\n    }\n    // A count past the end (a truncated geometry) stops there\n    for (let i = 0; i < count && p.more; i += 1) {\n      x += p.sint();\n      y += p.sint();\n      if (id === 1) {\n        close();\n        start = out.length;\n      }\n      if (start >= 0) out.push(x, y);\n    }\n  }\n  close();\n};\n\n/** The heap a decoded tile takes, about (bytes): its features with their properties, their coordinates (measured on a\n * city's tile in Bun's JavaScriptCore, Safari's engine) */\nexport const decodedBytes = (tile: Map<string, TileLayer>): number =>\n  [...tile.values()].reduce((sum, layer) => sum + layer.bytes, 0);\n/** A feature and its properties, about (bytes) */\nconst FEATURE_BYTES = 270;\n\n/** Decodes a tile; only the layers in `wanted` (all if undefined) */\nexport const decode = (bytes: Uint8Array, wanted?: Set<string>): Map<string, TileLayer> => {\n  const layers = new Map<string, TileLayer>();\n  const tile = new Pbf(bytes);\n\n  while (tile.more) {\n    const tag = tile.varint();\n\n    if (tag >> 3 !== 3) {\n      tile.skip(tag & 7);\n      continue;\n    }\n\n    const l = tile.sub();\n    let name = '';\n    let extent = 4096;\n    const keys: string[] = [];\n    const values: Value[] = [];\n    const raw: Pbf[] = [];\n\n    while (l.more) {\n      const t = l.varint();\n\n      switch (t >> 3) {\n        case 1:\n          name = l.string();\n          break;\n        case 2:\n          raw.push(l.sub());\n          break;\n        case 3:\n          keys.push(l.string());\n          break;\n        case 4:\n          values.push(value(l.sub()));\n          break;\n        case 5:\n          extent = l.varint();\n          break;\n        default:\n          l.skip(t & 7);\n      }\n    }\n    if (wanted && !wanted.has(name)) continue;\n\n    const decoded: [type: 1 | 2 | 3, properties: Record<string, Value>, first: number, end: number][] = [];\n    const coordinates = new Coordinates();\n\n    for (const f of raw) {\n      let type: 1 | 2 | 3 = 1;\n      const properties: Record<string, Value> = {};\n      const first = coordinates.ranges.length;\n\n      while (f.more) {\n        const t = f.varint();\n\n        switch (t >> 3) {\n          case 2: {\n            const tags = f.sub();\n\n            while (tags.more) {\n              const k = keys[tags.varint()];\n              const v = values[tags.varint()];\n\n              if (k !== undefined && v !== undefined) properties[k] = v;\n            }\n            break;\n          }\n          case 3:\n            type = Math.min(3, Math.max(1, f.varint())) as 1 | 2 | 3;\n            break;\n          case 4:\n            geometry(f.sub(), coordinates);\n            break;\n          default:\n            f.skip(t & 7);\n        }\n      }\n      decoded.push([type, properties, first, coordinates.ranges.length]);\n    }\n\n    const shapes = coordinates.shapes();\n    const features = decoded.map(([type, properties, first, end]) => new Feature(type, properties, shapes, first, end));\n    const bytes = features.length * FEATURE_BYTES + shapes.values.byteLength + shapes.ranges.byteLength;\n\n    layers.set(name, { extent, features, bytes });\n  }\n\n  return layers;\n};\n"]}
+{"version":3,"file":"mvt.js","sourceRoot":"","sources":["../../src/basemap/mvt.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAkCH;;;;;GAKG;AACH,MAAM,OAAO;IAEA;IACQ;IACA;IAHnB,YACW,IAAe,EACP,KAAY,EACZ,KAAa;QAFrB,SAAI,GAAJ,IAAI,CAAW;QACP,UAAK,GAAL,KAAK,CAAO;QACZ,UAAK,GAAL,KAAK,CAAQ;IAC7B,CAAC;IAEJ,IAAI,QAAQ;QACV,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7C,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE3C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhH,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,UAAU;QACZ,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAEvB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAChB,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC;YAChB,UAAU,CAAC,GAAG,EAAE;gBACd,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC;YACzB,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAEnD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAE9B,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,IAAI;QACV,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACrD,MAAM,GAAG,GAA0B,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE3C,yEAAyE;QACzE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACrE,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AASD,wCAAwC;AACxC,MAAM,GAAG;IAGY;IAER;IAJX,GAAG,CAAS;IACZ,YACmB,GAAe,EAChC,KAAK,GAAG,CAAC,EACA,MAAM,GAAG,CAAC,MAAM;QAFR,QAAG,GAAH,GAAG,CAAY;QAEvB,QAAG,GAAH,GAAG,CAAa;QAEzB,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,kHAAkH;IAClH,MAAM;QACJ,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YAEpC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;YACjC,IAAI,CAAC,GAAG,IAAI;gBAAE,MAAM;QACtB,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD,iFAAiF;IACjF,KAAK;QACH,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QAEX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;YAEtB,yEAAyE;YACzE,IAAI,CAAC,GAAG,CAAC;gBAAE,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;iBAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjB,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC1B,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC;YAClB,CAAC;;gBAAM,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI;gBAAE,MAAM;QACtB,CAAC;QAED,yDAAyD;QACzD,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAExB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC;IACD,+CAA+C;IAC/C,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3C,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3D,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,OAAO,CAAC,CAAC;IACX,CAAC;IACD,KAAK;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAEd,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM;QACJ,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QAEd,OAAO,CAAC,CAAC;IACX,CAAC;IACO,IAAI;QACV,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,CAAC,IAAY;QACf,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,EAAE,CAAC;aACzB,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;aAC9B,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;aAC1C,IAAI,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IAC7B,CAAC;CACF;AAED,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;AAElC,MAAM,KAAK,GAAG,CAAC,CAAM,EAAS,EAAE;IAC9B,IAAI,CAAC,GAAU,EAAE,CAAC;IAElB,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAEvB,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACd,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACd,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACf,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;gBACb,MAAM;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACrB,MAAM;YACR;gBACE,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,4GAA4G;AAC5G,MAAM,WAAW;IACf,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,GAAG,CAAC,CAAC;IACX,kDAAkD;IACzC,MAAM,GAAa,EAAE,CAAC;IAE/B,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAErD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,uEAAuE;IACvE,MAAM;QACJ,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9F,CAAC;CACF;AAED,kFAAkF;AAClF,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAE,GAAgB,EAAQ,EAAE;IAClD,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,mEAAmE;IACnE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,GAAG,EAAE;QACjB,IAAI,KAAK,IAAI,CAAC;YAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC,CAAC;IAEF,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO,IAAI,CAAC,CAAC;QAE3B,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACb,qCAAqC;YACrC,IAAI,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,KAAK;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACnG,SAAS;QACX,CAAC;QACD,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,KAAK,EAAE,CAAC;gBACR,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;YACrB,CAAC;YACD,IAAI,KAAK,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,KAAK,EAAE,CAAC;AACV,CAAC,CAAC;AAEF;0EAC0E;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,IAA4B,EAAU,EAAE,CACnE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAClE,+BAA+B;AAC/B,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,4EAA4E;AAC5E,MAAM,WAAW,GAAG,EAAE,CAAC;AAEvB,qEAAqE;AACrE,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAiB,EAAE,MAAoB,EAA0B,EAAE;IACxF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE5B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAE1B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACrB,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAU,EAAE,CAAC;QAEtB,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YAErB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC;oBACJ,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;oBAClB,MAAM;gBACR,KAAK,CAAC;oBACJ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;oBAClB,MAAM;gBACR,KAAK,CAAC;oBACJ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;oBACtB,MAAM;gBACR,KAAK,CAAC;oBACJ,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;oBAC5B,MAAM;gBACR,KAAK,CAAC;oBACJ,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;oBACpB,MAAM;gBACR;oBACE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAE1C,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;QACtC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,IAAI,GAAc,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;YAE9B,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;gBACd,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAErB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBACf,KAAK,CAAC,CAAC,CAAC,CAAC;wBACP,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;wBAEtB,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;4BAClB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;4BACzB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;4BAEzB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM;gCAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5D,CAAC;wBACD,MAAM;oBACR,CAAC;oBACD,KAAK,CAAC;wBACJ,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAc,CAAC;wBACzD,MAAM;oBACR,KAAK,CAAC;wBACJ,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,WAAW,CAAC,CAAC;wBAC/B,MAAM;oBACR;wBACE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,KAAK,GAAU;YACnB,GAAG,WAAW,CAAC,MAAM,EAAE;YACvB,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YACvG,IAAI;YACJ,UAAU,EAAE,MAAM;YAClB,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;SAC/B,CAAC;QACF,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC,MAAM,CACzC,CAAC,CAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAC1E,CAAC,CACF,CAAC;QACF,MAAM,KAAK,GACT,QAAQ,CAAC,MAAM,GAAG,aAAa;YAC/B,KAAK,CAAC,MAAM,CAAC,UAAU;YACvB,KAAK,CAAC,MAAM,CAAC,UAAU;YACvB,KAAK,CAAC,IAAI,CAAC,UAAU;YACrB,KAAK,CAAC,KAAK,CAAC,UAAU;YACtB,OAAO,CAAC;QAEV,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC","sourcesContent":["/**\n * Mapbox Vector Tiles (MVT 2.1) decoding: layers of features with their properties and geometry, in tile units\n * (`extent`, usually 4096 across). Points are lists of points, lines lists of lines, polygons lists of rings (the\n * outer ones clockwise in tile coordinates, y down, holes the other way round, as the specification says).\n */\n\nexport type Value = string | number | boolean;\n\n/** A point list: x0, y0, x1, y1… in tile units */\nexport type Ring = ArrayLike<number>;\n\nexport interface TileFeature {\n  /** 1 point, 2 line, 3 polygon */\n  readonly type: 1 | 2 | 3;\n  /** Its properties (a decoded tile's: an object made from its layer's keys and values when read, kept for the task) */\n  readonly properties: Record<string, Value>;\n  /** Point lists (a decoded tile's: views made as they are read, of one buffer for its whole layer) */\n  readonly geometry: readonly Ring[];\n}\n\n/**\n * A layer's features in buffers: their coordinates one feature's after the other and where each point list starts and\n * ends; their tags one feature's after the other (a key's index then a value's) and the keys and values they index;\n * per feature, where its point lists and its tags start and end\n */\ninterface Store {\n  values: Int32Array;\n  ranges: Uint32Array;\n  tags: Uint16Array | Uint32Array;\n  keys: string[];\n  properties: Value[];\n  /** Per feature: its first point list and their end (in `ranges`), its first tag and their end (in `tags`) */\n  spans: Uint32Array;\n  /** The properties' objects made in the current task, per feature: the layers of a style read a feature's again and\n   * again, the tile kept only as buffers between tasks */\n  made?: Record<string, Value>[] | undefined;\n}\n\n/**\n * A decoded feature: its index in its layer's `Store`, its point lists' views made each time they are read, its\n * properties' object once a task. A city's tile holds some hundred thousand points in thirty thousand lists and a hundred thousand\n * properties: as arrays and objects, which a worker's full collections go through again and again, some 15 MB of its\n * heap a tile; in buffers, under 3 MB\n */\nclass Feature implements TileFeature {\n  constructor(\n    readonly type: 1 | 2 | 3,\n    private readonly store: Store,\n    private readonly index: number,\n  ) {}\n\n  get geometry(): Int32Array[] {\n    const { values, ranges, spans } = this.store;\n    const rings: Int32Array[] = [];\n    const end = spans[this.index * 4 + 1] ?? 0;\n\n    for (let r = spans[this.index * 4] ?? 0; r < end; r += 2) rings.push(values.subarray(ranges[r], ranges[r + 1]));\n\n    return rings;\n  }\n\n  get properties(): Record<string, Value> {\n    const { store } = this;\n\n    if (!store.made) {\n      store.made = [];\n      setTimeout(() => {\n        store.made = undefined;\n      });\n    }\n\n    const made = store.made[this.index] ?? this.made();\n\n    store.made[this.index] = made;\n\n    return made;\n  }\n\n  private made(): Record<string, Value> {\n    const { tags, keys, properties, spans } = this.store;\n    const out: Record<string, Value> = {};\n    const end = spans[this.index * 4 + 3] ?? 0;\n\n    // The tags were checked against the keys and values as they were decoded\n    for (let t = spans[this.index * 4 + 2] ?? 0; t < end; t += 2) {\n      out[keys[tags[t] ?? 0] ?? ''] = properties[tags[t + 1] ?? 0] ?? '';\n    }\n\n    return out;\n  }\n}\n\nexport interface TileLayer {\n  extent: number;\n  features: TileFeature[];\n  /** The heap it takes, about (`decodedBytes`) */\n  bytes: number;\n}\n\n/** Protobuf reader of a buffer range */\nclass Pbf {\n  pos: number;\n  constructor(\n    private readonly buf: Uint8Array,\n    start = 0,\n    readonly end = buf.length,\n  ) {\n    this.pos = start;\n  }\n  /** An unsigned varint, approximated beyond 2^53; all its bytes are read (up to 10), so the next field is right */\n  varint(): number {\n    let value = 0;\n\n    for (let shift = 0; shift < 70; shift += 7) {\n      const b = this.buf[this.pos++] ?? 0;\n\n      value += (b & 0x7f) * 2 ** shift;\n      if (b < 0x80) break;\n    }\n\n    return value;\n  }\n  /** A signed 64-bit varint (two's complement: a negative value takes 10 bytes) */\n  int64(): number {\n    let lo = 0;\n    let hi = 0;\n\n    for (let i = 0; i < 10; i += 1) {\n      const b = this.buf[this.pos++] ?? 0;\n      const bits = b & 0x7f;\n\n      // Bits 0-27 in the low word, bits 28-31 split, the rest in the high word\n      if (i < 4) lo |= bits << (7 * i);\n      else if (i === 4) {\n        lo |= (bits & 0x0f) << 28;\n        hi |= bits >> 4;\n      } else hi |= bits << (7 * i - 32);\n      if (b < 0x80) break;\n    }\n\n    // The high word signed: values from 2^63 up are negative\n    return (hi | 0) * 2 ** 32 + (lo >>> 0);\n  }\n  sint(): number {\n    const v = this.varint();\n\n    return v % 2 === 1 ? -(v + 1) / 2 : v / 2;\n  }\n  /** A length-delimited field as a sub-reader */\n  sub(): Pbf {\n    const n = this.varint();\n    // A length past the end (a truncated tile) stops at the end\n    const end = Math.min(this.pos + n, this.end);\n    const r = new Pbf(this.buf, this.pos, end);\n\n    this.pos = end;\n\n    return r;\n  }\n  string(): string {\n    const n = this.varint();\n    const end = Math.min(this.pos + n, this.end);\n    const s = decoder.decode(this.buf.subarray(this.pos, end));\n\n    this.pos = end;\n\n    return s;\n  }\n  float(): number {\n    const v = this.pos + 4 <= this.end ? this.view().getFloat32(this.pos, true) : 0;\n\n    this.pos += 4;\n\n    return v;\n  }\n  double(): number {\n    const v = this.pos + 8 <= this.end ? this.view().getFloat64(this.pos, true) : 0;\n\n    this.pos += 8;\n\n    return v;\n  }\n  private view(): DataView {\n    return new DataView(this.buf.buffer, this.buf.byteOffset, this.buf.byteLength);\n  }\n  skip(wire: number): void {\n    if (wire === 0) this.varint();\n    else if (wire === 1) this.pos += 8;\n    else if (wire === 2) this.pos += this.varint();\n    else if (wire === 5) this.pos += 4;\n  }\n  get more(): boolean {\n    return this.pos < this.end;\n  }\n}\n\nconst decoder = new TextDecoder();\n\nconst value = (p: Pbf): Value => {\n  let v: Value = '';\n\n  while (p.more) {\n    const tag = p.varint();\n\n    switch (tag >> 3) {\n      case 1:\n        v = p.string();\n        break;\n      case 2:\n        v = p.float();\n        break;\n      case 3:\n        v = p.double();\n        break;\n      case 4:\n        v = p.int64();\n        break;\n      case 5:\n        v = p.varint();\n        break;\n      case 6:\n        v = p.sint();\n        break;\n      case 7:\n        v = p.varint() !== 0;\n        break;\n      default:\n        p.skip(tag & 7);\n    }\n  }\n\n  return v;\n};\n\n/** The coordinates of a layer's features, one after the other, and where each point list starts and ends */\nclass Coordinates {\n  values = new Int32Array(1024);\n  length = 0;\n  /** Per point list: its first value and its end */\n  readonly ranges: number[] = [];\n\n  push(x: number, y: number): void {\n    if (this.length + 2 > this.values.length) {\n      const grown = new Int32Array(this.values.length * 2);\n\n      grown.set(this.values);\n      this.values = grown;\n    }\n    this.values[this.length++] = x;\n    this.values[this.length++] = y;\n  }\n\n  /** The values and ranges cut to their lengths (once all are pushed) */\n  shapes(): Pick<Store, 'values' | 'ranges'> {\n    return { values: this.values.slice(0, this.length), ranges: Uint32Array.from(this.ranges) };\n  }\n}\n\n/** Pushes the point lists of a geometry's commands (MoveTo, LineTo, ClosePath) */\nconst geometry = (p: Pbf, out: Coordinates): void => {\n  let [x, y] = [0, 0];\n  // The first value of the current point list (none before a MoveTo)\n  let start = -1;\n  const close = () => {\n    if (start >= 0) out.ranges.push(start, out.length);\n  };\n\n  while (p.more) {\n    const command = p.varint();\n    const id = command & 7;\n    const count = command >> 3;\n\n    if (id === 7) {\n      // ClosePath: back to the first point\n      if (start >= 0 && out.length > start) out.push(out.values[start] ?? 0, out.values[start + 1] ?? 0);\n      continue;\n    }\n    // A count past the end (a truncated geometry) stops there\n    for (let i = 0; i < count && p.more; i += 1) {\n      x += p.sint();\n      y += p.sint();\n      if (id === 1) {\n        close();\n        start = out.length;\n      }\n      if (start >= 0) out.push(x, y);\n    }\n  }\n  close();\n};\n\n/** The heap a decoded tile takes, about (bytes): its features, their tags and coordinates, its keys and values\n * (measured on a city's tile in Bun's JavaScriptCore, Safari's engine) */\nexport const decodedBytes = (tile: Map<string, TileLayer>): number =>\n  [...tile.values()].reduce((sum, layer) => sum + layer.bytes, 0);\n/** A feature, about (bytes) */\nconst FEATURE_BYTES = 70;\n/** A key or a value (a string's characters counted apart), about (bytes) */\nconst VALUE_BYTES = 40;\n\n/** Decodes a tile; only the layers in `wanted` (all if undefined) */\nexport const decode = (bytes: Uint8Array, wanted?: Set<string>): Map<string, TileLayer> => {\n  const layers = new Map<string, TileLayer>();\n  const tile = new Pbf(bytes);\n\n  while (tile.more) {\n    const tag = tile.varint();\n\n    if (tag >> 3 !== 3) {\n      tile.skip(tag & 7);\n      continue;\n    }\n\n    const l = tile.sub();\n    let name = '';\n    let extent = 4096;\n    const keys: string[] = [];\n    const values: Value[] = [];\n    const raw: Pbf[] = [];\n\n    while (l.more) {\n      const t = l.varint();\n\n      switch (t >> 3) {\n        case 1:\n          name = l.string();\n          break;\n        case 2:\n          raw.push(l.sub());\n          break;\n        case 3:\n          keys.push(l.string());\n          break;\n        case 4:\n          values.push(value(l.sub()));\n          break;\n        case 5:\n          extent = l.varint();\n          break;\n        default:\n          l.skip(t & 7);\n      }\n    }\n    if (wanted && !wanted.has(name)) continue;\n\n    const types: (1 | 2 | 3)[] = [];\n    const spans: number[] = [];\n    const coordinates = new Coordinates();\n    const tags: number[] = [];\n\n    for (const f of raw) {\n      let type: 1 | 2 | 3 = 1;\n      const first = coordinates.ranges.length;\n      const tagsFirst = tags.length;\n\n      while (f.more) {\n        const t = f.varint();\n\n        switch (t >> 3) {\n          case 2: {\n            const pairs = f.sub();\n\n            while (pairs.more) {\n              const k = pairs.varint();\n              const v = pairs.varint();\n\n              if (k < keys.length && v < values.length) tags.push(k, v);\n            }\n            break;\n          }\n          case 3:\n            type = Math.min(3, Math.max(1, f.varint())) as 1 | 2 | 3;\n            break;\n          case 4:\n            geometry(f.sub(), coordinates);\n            break;\n          default:\n            f.skip(t & 7);\n        }\n      }\n      types.push(type);\n      spans.push(first, coordinates.ranges.length, tagsFirst, tags.length);\n    }\n\n    const store: Store = {\n      ...coordinates.shapes(),\n      tags: Math.max(keys.length, values.length) <= 0x10000 ? Uint16Array.from(tags) : Uint32Array.from(tags),\n      keys,\n      properties: values,\n      spans: Uint32Array.from(spans),\n    };\n    const features = types.map((type, i) => new Feature(type, store, i));\n    const strings = [...keys, ...values].reduce(\n      (n: number, v) => n + VALUE_BYTES + (typeof v === 'string' ? v.length : 0),\n      0,\n    );\n    const bytes =\n      features.length * FEATURE_BYTES +\n      store.values.byteLength +\n      store.ranges.byteLength +\n      store.tags.byteLength +\n      store.spans.byteLength +\n      strings;\n\n    layers.set(name, { extent, features, bytes });\n  }\n\n  return layers;\n};\n"]}