@urban-toolkit/autk-grammar 4.2.0 → 4.4.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +28 -3
- package/build/autk-grammar-schema.json +117 -20
- package/dist/autk-grammar.js +306 -259
- package/dist/autk-grammar.js.map +1 -1
- package/dist/autk-grammar.umd.cjs +2 -2
- package/dist/autk-grammar.umd.cjs.map +1 -1
- package/dist/index.d.ts +64 -13
- package/package.json +6 -6
package/dist/autk-grammar.js
CHANGED
|
@@ -1,85 +1,105 @@
|
|
|
1
|
-
import { AutkDb as K, DEFAULT_WORKSPACE_COORDINATE_FORMAT as
|
|
2
|
-
import { AutkMap as
|
|
3
|
-
import { AutkPlot as
|
|
4
|
-
import { ColorMapInterpolator as
|
|
5
|
-
import { AutkComputeEngine as
|
|
6
|
-
function
|
|
1
|
+
import { AutkDb as K, DEFAULT_WORKSPACE_COORDINATE_FORMAT as Y } from "@urban-toolkit/autk-db";
|
|
2
|
+
import { AutkMap as z, MapEvent as B } from "@urban-toolkit/autk-map";
|
|
3
|
+
import { AutkPlot as Z, PlotEvent as I } from "@urban-toolkit/autk-plot";
|
|
4
|
+
import { ColorMapInterpolator as tt, ColorMapDomainStrategy as M, ColorMap as v } from "@urban-toolkit/autk-core";
|
|
5
|
+
import { AutkComputeEngine as et } from "@urban-toolkit/autk-compute";
|
|
6
|
+
function rt(t) {
|
|
7
7
|
const { spec: e, adapters: r } = t;
|
|
8
8
|
let o;
|
|
9
|
-
async function
|
|
10
|
-
let
|
|
9
|
+
async function n() {
|
|
10
|
+
let i;
|
|
11
11
|
if (e.data)
|
|
12
|
-
for (const
|
|
13
|
-
|
|
12
|
+
for (const l of e.data)
|
|
13
|
+
i = await r.db.resolveSource(i, l);
|
|
14
14
|
if (e.compute)
|
|
15
|
-
for (const
|
|
16
|
-
|
|
15
|
+
for (const l of e.compute)
|
|
16
|
+
i = await r.compute.resolveCompute(i, l);
|
|
17
17
|
if (e.map)
|
|
18
18
|
if (Array.isArray(e.map))
|
|
19
|
-
for (let
|
|
20
|
-
let c = e.map[
|
|
21
|
-
await r.map.resolveMap(
|
|
19
|
+
for (let l = 0; l < e.map.length; l++) {
|
|
20
|
+
let c = e.map[l];
|
|
21
|
+
await r.map.resolveMap(i, c, l);
|
|
22
22
|
}
|
|
23
23
|
else
|
|
24
|
-
await r.map.resolveMap(
|
|
24
|
+
await r.map.resolveMap(i, e.map);
|
|
25
25
|
if (e.plot)
|
|
26
26
|
if (Array.isArray(e.plot))
|
|
27
|
-
for (const
|
|
28
|
-
await r.plot.resolvePlot(
|
|
27
|
+
for (const l of e.plot)
|
|
28
|
+
await r.plot.resolvePlot(i, l);
|
|
29
29
|
else
|
|
30
|
-
await r.plot.resolvePlot(
|
|
31
|
-
o =
|
|
30
|
+
await r.plot.resolvePlot(i, e.plot);
|
|
31
|
+
o = i;
|
|
32
32
|
}
|
|
33
|
-
function a(
|
|
34
|
-
return console.log("Spec to update",
|
|
35
|
-
|
|
33
|
+
function a(i) {
|
|
34
|
+
return console.log("Spec to update", i), new Promise((l) => {
|
|
35
|
+
l();
|
|
36
36
|
});
|
|
37
37
|
}
|
|
38
|
-
function
|
|
38
|
+
function s() {
|
|
39
39
|
console.log("Function not implemented yet");
|
|
40
40
|
}
|
|
41
|
-
return { run:
|
|
41
|
+
return { run: n, updatedSpec: a, destroy: s, get context() {
|
|
42
42
|
return o;
|
|
43
43
|
} };
|
|
44
44
|
}
|
|
45
|
-
var
|
|
46
|
-
function
|
|
45
|
+
var ot = /* @__PURE__ */ ((t) => (t.CAT_ACCENT = "schemeAccent", t.CAT_DARK2 = "schemeDark2", t.CAT_CATEGORY10 = "schemeCategory10", t.CAT_OBSERVABLE10 = "schemeObservable10", t.CAT_PAIRED = "schemePaired", t.CAT_PASTEL1 = "schemePastel1", t.CAT_PASTEL2 = "schemePastel2", t.CAT_SET1 = "schemeSet1", t.CAT_SET2 = "schemeSet2", t.CAT_SET3 = "schemeSet3", t.CAT_TABLEAU10 = "schemeTableau10", t.SEQ_REDS = "interpolateReds", t.SEQ_BLUES = "interpolateBlues", t.SEQ_GREENS = "interpolateGreens", t.SEQ_GREYS = "interpolateGreys", t.SEQ_ORANGES = "interpolateOranges", t.SEQ_PURPLES = "interpolatePurples", t.SEQ_TURBO = "interpolateTurbo", t.SEQ_VIRIDIS = "interpolateViridis", t.SEQ_INFERNO = "interpolateInferno", t.SEQ_MAGMA = "interpolateMagma", t.SEQ_PLASMA = "interpolatePlasma", t.SEQ_CIVIDIS = "interpolateCividis", t.SEQ_WARM = "interpolateWarm", t.SEQ_COOL = "interpolateCool", t.SEQ_CUBEHELIX_DEFAULT = "interpolateCubehelixDefault", t.SEQ_BU_GN = "interpolateBuGn", t.SEQ_BU_PU = "interpolateBuPu", t.SEQ_GN_BU = "interpolateGnBu", t.SEQ_OR_RD = "interpolateOrRd", t.SEQ_PU_BU_GN = "interpolatePuBuGn", t.SEQ_PU_BU = "interpolatePuBu", t.SEQ_PU_RD = "interpolatePuRd", t.SEQ_RD_PU = "interpolateRdPu", t.SEQ_YL_GN_BU = "interpolateYlGnBu", t.SEQ_YL_GN = "interpolateYlGn", t.SEQ_YL_OR_BR = "interpolateYlOrBr", t.SEQ_YL_OR_RD = "interpolateYlOrRd", t.DIV_BR_BG = "interpolateBrBG", t.DIV_PR_GN = "interpolatePRGn", t.DIV_PI_YG = "interpolatePiYG", t.DIV_PU_OR = "interpolatePuOr", t.DIV_RED_BLUE = "interpolateRdBu", t.DIV_RED_GREY = "interpolateRdGy", t.DIV_RED_YELLOW_BLUE = "interpolateRdYlBu", t.DIV_RED_YELLOW_GREEN = "interpolateRdYlGn", t.DIV_SPECTRAL = "interpolateSpectral", t))(ot || {}), H = /* @__PURE__ */ ((t) => (t.MIN_MAX = "minMax", t.PERCENTILE = "percentile", t))(H || {});
|
|
46
|
+
function at(t) {
|
|
47
|
+
const { queryArea: e } = t;
|
|
48
|
+
if (e.bbox === void 0) return { geocodeArea: e.geocodeArea, areas: e.areas };
|
|
49
|
+
const r = (l) => new Error(`OSM source "${t.outputTableName}": ${l}`);
|
|
50
|
+
if (e.geocodeArea !== void 0 || e.areas !== void 0)
|
|
51
|
+
throw r("queryArea takes either bbox or geocodeArea with areas, not both.");
|
|
52
|
+
const o = e.bbox;
|
|
53
|
+
if (!Array.isArray(o) || o.length !== 4 || !o.every((l) => typeof l == "number" && Number.isFinite(l)))
|
|
54
|
+
throw r("queryArea.bbox must hold four numbers, [west, south, east, north] in degrees.");
|
|
55
|
+
const [n, a, s, i] = e.bbox;
|
|
56
|
+
if (Math.abs(n) > 180 || Math.abs(s) > 180)
|
|
57
|
+
throw r("queryArea.bbox west and east must be longitudes from -180 to 180.");
|
|
58
|
+
if (Math.abs(a) > 90 || Math.abs(i) > 90)
|
|
59
|
+
throw r("queryArea.bbox south and north must be latitudes from -90 to 90.");
|
|
60
|
+
if (n >= s)
|
|
61
|
+
throw r(`queryArea.bbox west (${n}) must be less than east (${s}); a box across the antimeridian is not supported.`);
|
|
62
|
+
if (a >= i)
|
|
63
|
+
throw r(`queryArea.bbox south (${a}) must be less than north (${i}).`);
|
|
64
|
+
return { bbox: [n, a, s, i] };
|
|
65
|
+
}
|
|
66
|
+
function nt(t) {
|
|
47
67
|
const { autoLoadLayers: e, ...r } = t;
|
|
48
|
-
return { ...r, autoLoadLayers: { layers: e?.layers ?? [] } };
|
|
68
|
+
return { ...r, queryArea: at(t), autoLoadLayers: { layers: e?.layers ?? [] } };
|
|
49
69
|
}
|
|
50
|
-
function
|
|
51
|
-
function r(o,
|
|
52
|
-
if (!
|
|
70
|
+
function it(t, e) {
|
|
71
|
+
function r(o, n) {
|
|
72
|
+
if (!n || !n.db)
|
|
53
73
|
return;
|
|
54
|
-
const a = document.getElementById(
|
|
74
|
+
const a = document.getElementById(n.db);
|
|
55
75
|
if (a) {
|
|
56
|
-
const
|
|
76
|
+
const s = o.getTablesMetadata();
|
|
57
77
|
a.innerHTML += "<ul>";
|
|
58
|
-
for (const
|
|
59
|
-
a.innerHTML += `<li>${
|
|
60
|
-
a.innerHTML += "</ul>", a.innerHTML += `<p>Number of tables: ${
|
|
78
|
+
for (const i of s)
|
|
79
|
+
a.innerHTML += `<li>${i.name}: (${i.source}, ${i.type}) </li>`;
|
|
80
|
+
a.innerHTML += "</ul>", a.innerHTML += `<p>Number of tables: ${s.length}</p>`;
|
|
61
81
|
}
|
|
62
82
|
}
|
|
63
83
|
return {
|
|
64
|
-
async resolveSource(o,
|
|
84
|
+
async resolveSource(o, n) {
|
|
65
85
|
let a = o;
|
|
66
86
|
a || (a = new K(), await a.init());
|
|
67
|
-
let { type:
|
|
68
|
-
switch (
|
|
87
|
+
let { type: s, ...i } = n;
|
|
88
|
+
switch (s) {
|
|
69
89
|
case "osm":
|
|
70
|
-
return await a.loadOsm(
|
|
90
|
+
return await a.loadOsm(nt(i)), r(a, t), a;
|
|
71
91
|
case "csv":
|
|
72
|
-
return await a.loadCsv(
|
|
92
|
+
return await a.loadCsv(i), r(a, t), a;
|
|
73
93
|
case "json":
|
|
74
|
-
return await a.loadJson(
|
|
94
|
+
return await a.loadJson(i), r(a, t), a;
|
|
75
95
|
case "geojson": {
|
|
76
|
-
const
|
|
96
|
+
const l = i;
|
|
77
97
|
let c;
|
|
78
|
-
|
|
98
|
+
l.geojsonFileUrl ? c = await (await fetch(l.geojsonFileUrl)).json() : c = l.geojsonObject, e && c && e.set(l.outputTableName, c);
|
|
79
99
|
const u = c ? (() => {
|
|
80
|
-
const f = { ...
|
|
100
|
+
const f = { ...l, geojsonObject: c };
|
|
81
101
|
return delete f.geojsonFileUrl, f;
|
|
82
|
-
})() :
|
|
102
|
+
})() : l;
|
|
83
103
|
try {
|
|
84
104
|
await a.loadGeojson(u);
|
|
85
105
|
} catch (f) {
|
|
@@ -92,7 +112,7 @@ function at(t, e) {
|
|
|
92
112
|
const f = await a.getBoundingBoxFromLayer(u.outputTableName), p = 25e6;
|
|
93
113
|
if (!isFinite(f.minLon) || !isFinite(f.minLat) || !isFinite(f.maxLon) || !isFinite(f.maxLat) || Math.abs(f.minLon) > p || Math.abs(f.maxLon) > p || Math.abs(f.minLat) > p || Math.abs(f.maxLat) > p)
|
|
94
114
|
throw new Error(
|
|
95
|
-
`Geometry bounding box after transform is invalid for layer "${u.outputTableName}" (bbox: [${f.minLon}, ${f.minLat}, ${f.maxLon}, ${f.maxLat}]). Verify that coordinateFormat matches the actual CRS of the input data. The workspace uses ${
|
|
115
|
+
`Geometry bounding box after transform is invalid for layer "${u.outputTableName}" (bbox: [${f.minLon}, ${f.minLat}, ${f.maxLon}, ${f.maxLat}]). Verify that coordinateFormat matches the actual CRS of the input data. The workspace uses ${Y}; input is expected in EPSG:4326 by default.`
|
|
96
116
|
);
|
|
97
117
|
} catch (f) {
|
|
98
118
|
if (f instanceof Error && f.message.includes("bounding box after transform")) throw f;
|
|
@@ -100,25 +120,25 @@ function at(t, e) {
|
|
|
100
120
|
return r(a, t), a;
|
|
101
121
|
}
|
|
102
122
|
case "heatmap": {
|
|
103
|
-
const
|
|
123
|
+
const l = i;
|
|
104
124
|
return await a.buildHeatmap({
|
|
105
|
-
tableJoinName:
|
|
106
|
-
near: { distance:
|
|
107
|
-
outputTableName:
|
|
108
|
-
grid:
|
|
109
|
-
...
|
|
125
|
+
tableJoinName: l.tableJoinName,
|
|
126
|
+
near: { distance: l.near.distance },
|
|
127
|
+
outputTableName: l.outputTableName,
|
|
128
|
+
grid: l.grid,
|
|
129
|
+
...l.groupBy && { groupBy: l.groupBy }
|
|
110
130
|
}), r(a, t), a;
|
|
111
131
|
}
|
|
112
132
|
case "join": {
|
|
113
|
-
const
|
|
133
|
+
const l = i;
|
|
114
134
|
if (await a.spatialQuery({
|
|
115
|
-
tableRootName:
|
|
116
|
-
tableJoinName:
|
|
117
|
-
...
|
|
118
|
-
...
|
|
135
|
+
tableRootName: l.tableRootName,
|
|
136
|
+
tableJoinName: l.tableJoinName,
|
|
137
|
+
...l.near && { near: l.near },
|
|
138
|
+
...l.groupBy && { groupBy: l.groupBy }
|
|
119
139
|
}), e) {
|
|
120
|
-
const c = await a.getLayer(
|
|
121
|
-
e.set(
|
|
140
|
+
const c = await a.getLayer(l.tableRootName);
|
|
141
|
+
e.set(l.tableRootName, c);
|
|
122
142
|
}
|
|
123
143
|
return r(a, t), a;
|
|
124
144
|
}
|
|
@@ -128,132 +148,159 @@ function at(t, e) {
|
|
|
128
148
|
}
|
|
129
149
|
};
|
|
130
150
|
}
|
|
131
|
-
function
|
|
151
|
+
function N(t) {
|
|
132
152
|
return typeof t.title == "string" && t.title !== "" ? t.title : t.dataRef;
|
|
133
153
|
}
|
|
134
|
-
function
|
|
154
|
+
function st(t, e) {
|
|
135
155
|
const r = /* @__PURE__ */ new Set();
|
|
136
156
|
for (const o of t.layerRefs) {
|
|
137
|
-
const
|
|
138
|
-
if (r.has(
|
|
139
|
-
throw new Error(`Map ${e} draws two layers with the id "${
|
|
140
|
-
r.add(
|
|
157
|
+
const n = N(o);
|
|
158
|
+
if (r.has(n))
|
|
159
|
+
throw new Error(`Map ${e} draws two layers with the id "${n}". A layer's id is its title, else its dataRef: give each layer of a map its own title.`);
|
|
160
|
+
r.add(n);
|
|
141
161
|
}
|
|
142
162
|
}
|
|
143
|
-
const
|
|
144
|
-
function
|
|
145
|
-
if (!
|
|
163
|
+
const lt = /^#[0-9a-fA-F]{6}$/;
|
|
164
|
+
function $(t, e, r) {
|
|
165
|
+
if (!lt.test(t))
|
|
146
166
|
throw new Error(`Layer "${r}": ${e} must be a color written #rrggbb, not "${t}".`);
|
|
147
|
-
return
|
|
167
|
+
return v.hexToRgb(t);
|
|
148
168
|
}
|
|
149
|
-
function
|
|
169
|
+
function ut(t, e) {
|
|
150
170
|
const r = {};
|
|
151
|
-
return t.color != null && (r.color =
|
|
171
|
+
return t.color != null && (r.color = $(t.color, "color", e)), t.stroke === !1 ? r.showBorders = !1 : t.stroke != null && (r.strokeColor = $(t.stroke, "stroke", e)), t.width != null && (r.polylinesWidth = t.width), r;
|
|
152
172
|
}
|
|
153
|
-
function
|
|
154
|
-
return t.isColorMap != null ? t.isColorMap : e === "raster" ? t.colorMapInterpolator != null || t.colorMapCenter != null || t.colorMapReverse === !0 : t.color != null ? !1 : t.colorMapInterpolator != null || t.getFnv != null;
|
|
173
|
+
function ct(t, e) {
|
|
174
|
+
return t.isColorMap != null ? t.isColorMap : e === "raster" ? t.colorMapInterpolator != null || t.colorMapRange != null || t.colorMapCenter != null || t.colorMapReverse === !0 : t.color != null ? !1 : t.colorMapInterpolator != null || t.getFnv != null;
|
|
155
175
|
}
|
|
156
|
-
function
|
|
176
|
+
function ft(t, e) {
|
|
157
177
|
const r = t.features?.[0]?.properties?.[e];
|
|
158
178
|
return r instanceof Float32Array ? r : ArrayBuffer.isView(r) && !(r instanceof DataView) || Array.isArray(r) ? Float32Array.from(r, (o) => Number.isFinite(Number(o)) ? Number(o) : NaN) : null;
|
|
159
179
|
}
|
|
160
|
-
function
|
|
161
|
-
if (
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
Number.isFinite(c) && (a++, r != null && (i = Math.max(i, Math.abs(c - r))));
|
|
180
|
+
function pt(t, e, r, o, n) {
|
|
181
|
+
if (v.isCategorical(e.interpolator)) return;
|
|
182
|
+
if (n != null) {
|
|
183
|
+
const c = r != null ? [n[0], r, n[1]] : [n[0], n[1]];
|
|
184
|
+
return o === !0 ? c.reverse() : c;
|
|
166
185
|
}
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
186
|
+
if (!t) return;
|
|
187
|
+
let a = 0, s = 0;
|
|
188
|
+
for (let c = 0; c < t.length; c++) {
|
|
189
|
+
const u = t[c];
|
|
190
|
+
Number.isFinite(u) && (s++, r != null && (a = Math.max(a, Math.abs(u - r))));
|
|
191
|
+
}
|
|
192
|
+
const i = r != null && a > 0;
|
|
193
|
+
if (s === 0 || !i && o !== !0) return;
|
|
194
|
+
const l = i && r != null ? [r - a, r, r + a] : v.resolveDomainFromData(t, e);
|
|
195
|
+
return o === !0 ? [...l].reverse() : l;
|
|
196
|
+
}
|
|
197
|
+
function mt(t, e) {
|
|
198
|
+
if (!(e == null || v.isCategorical(t.interpolator)))
|
|
199
|
+
return [e[0], e[1]];
|
|
200
|
+
}
|
|
201
|
+
function dt(t) {
|
|
202
|
+
const e = t.colorMapRange;
|
|
203
|
+
if (e === void 0) return;
|
|
204
|
+
const r = (s) => new Error(`Layer "${N(t)}": ${s}`);
|
|
205
|
+
if (!Array.isArray(e) || e.length !== 2 || !e.every((s) => typeof s == "number" && Number.isFinite(s)))
|
|
206
|
+
throw r("colorMapRange must hold two numbers, [low, high].");
|
|
207
|
+
const [o, n] = e;
|
|
208
|
+
if (o >= n)
|
|
209
|
+
throw r(`colorMapRange low (${o}) must be less than high (${n}).`);
|
|
210
|
+
if (t.colorMapDomain !== void 0)
|
|
211
|
+
throw r("set colorMapRange or colorMapDomain, not both.");
|
|
212
|
+
const a = t.colorMapCenter;
|
|
213
|
+
if (a != null && (a < o || a > n))
|
|
214
|
+
throw r(`colorMapCenter (${a}) must lie within colorMapRange [${o}, ${n}].`);
|
|
215
|
+
}
|
|
216
|
+
function ht(t, e) {
|
|
217
|
+
return e && e.length > 0 ? { type: M.USER, params: e } : t?.mode === H.PERCENTILE ? t.lowerPercentile !== void 0 || t.upperPercentile !== void 0 ? {
|
|
174
218
|
type: M.PERCENTILE,
|
|
175
219
|
params: [t.lowerPercentile ?? 0, t.upperPercentile ?? 100]
|
|
176
220
|
} : { type: M.PERCENTILE } : { type: M.MIN_MAX };
|
|
177
221
|
}
|
|
178
|
-
function
|
|
222
|
+
function yt(t, e) {
|
|
179
223
|
return e.split(".").reduce((r, o) => {
|
|
180
224
|
if (!(r == null || typeof r != "object"))
|
|
181
225
|
return r[o];
|
|
182
226
|
}, t);
|
|
183
227
|
}
|
|
184
|
-
function
|
|
185
|
-
const o = e.split("."),
|
|
186
|
-
let a =
|
|
187
|
-
for (let
|
|
188
|
-
a[o[
|
|
189
|
-
return a[o[o.length - 1]] = r,
|
|
228
|
+
function gt(t, e, r) {
|
|
229
|
+
const o = e.split("."), n = { ...t };
|
|
230
|
+
let a = n;
|
|
231
|
+
for (let s = 0; s < o.length - 1; s++)
|
|
232
|
+
a[o[s]] = { ...a[o[s]] ?? {} }, a = a[o[s]];
|
|
233
|
+
return a[o[o.length - 1]] = r, n;
|
|
190
234
|
}
|
|
191
|
-
function
|
|
235
|
+
function bt(t, e) {
|
|
192
236
|
const o = t.features?.[0]?.properties?.bands ?? [];
|
|
193
237
|
return o.find((a) => a.id === e || a.label === e?.replace(/\./g, "_"))?.id ?? o[0]?.id ?? e ?? "";
|
|
194
238
|
}
|
|
195
|
-
function
|
|
196
|
-
async function a(
|
|
239
|
+
function _t(t, e, r, o, n) {
|
|
240
|
+
async function a(s, i, l) {
|
|
197
241
|
let c = {};
|
|
198
|
-
for (const u of
|
|
242
|
+
for (const u of i.getTablesMetadata())
|
|
199
243
|
u.type !== void 0 && (c[u.name] = u.type);
|
|
200
|
-
for (const u of
|
|
201
|
-
const f = u.dataRef, p =
|
|
244
|
+
for (const u of l.layerRefs) {
|
|
245
|
+
const f = u.dataRef, p = N(u), m = c[f], d = u.getFnv, h = r?.get(f) ?? await i.getLayer(f), y = m === "raster" ? h : {
|
|
202
246
|
...h,
|
|
203
247
|
features: (h.features ?? []).filter((g) => g.geometry != null)
|
|
204
|
-
},
|
|
205
|
-
m === "raster" ?
|
|
206
|
-
const
|
|
207
|
-
Object.keys(
|
|
208
|
-
const { catchAllCategory:
|
|
248
|
+
}, w = m === "raster" ? bt(y, d) : "";
|
|
249
|
+
m === "raster" ? s.loadCollection(p, { collection: y, type: "raster", property: w }) : s.loadCollection(p, { collection: y, type: m }), u.opacity != null && s.updateRenderInfo(p, { opacity: u.opacity });
|
|
250
|
+
const A = ut(u, p);
|
|
251
|
+
Object.keys(A).length > 0 && s.updateRenderInfo(p, A), ct(u, m) && s.updateRenderInfo(p, { isColorMap: !0 }), u.isPick && s.updateRenderInfo(p, { isPick: !0 }), u.isSkip && s.updateRenderInfo(p, { isSkip: !0 });
|
|
252
|
+
const { catchAllCategory: b, colorMapDomain: R } = u;
|
|
209
253
|
let F = y, T = R;
|
|
210
|
-
if (d &&
|
|
254
|
+
if (d && b && R?.length) {
|
|
211
255
|
const g = new Set(R);
|
|
212
256
|
F = {
|
|
213
257
|
...y,
|
|
214
|
-
features: y.features.map((
|
|
215
|
-
const
|
|
216
|
-
return
|
|
258
|
+
features: y.features.map((_) => {
|
|
259
|
+
const D = _.properties, P = yt(D, d);
|
|
260
|
+
return P == null || !g.has(String(P)) ? { ..._, properties: gt(D, d, b) } : _;
|
|
217
261
|
})
|
|
218
|
-
}, T = g.has(
|
|
262
|
+
}, T = g.has(b) ? R : [...R, b];
|
|
219
263
|
}
|
|
220
264
|
const O = m === "raster" && u.transferFunction != null;
|
|
221
|
-
O &&
|
|
222
|
-
const
|
|
223
|
-
if (u.colorMapInterpolator ||
|
|
265
|
+
O && s.layerManager.searchByLayerId(p)?.setTransferFunction?.(u.transferFunction);
|
|
266
|
+
const C = u.colorMapRange, x = m === "raster" && (C != null || u.colorMapCenter != null || u.colorMapReverse === !0);
|
|
267
|
+
if (u.colorMapInterpolator || x || C) {
|
|
224
268
|
const g = {
|
|
225
269
|
// urban-grammar ColorMapInterpolator values are string-compatible
|
|
226
270
|
// with autk-core ColorMapInterpolator at runtime
|
|
227
|
-
interpolator: u.colorMapInterpolator ??
|
|
228
|
-
domainSpec:
|
|
229
|
-
}
|
|
230
|
-
|
|
231
|
-
|
|
271
|
+
interpolator: u.colorMapInterpolator ?? s.layerManager.searchByLayerId(p)?.layerRenderInfo.colormap.config.interpolator ?? tt.SEQ_REDS,
|
|
272
|
+
domainSpec: ht(u.normalization, T)
|
|
273
|
+
};
|
|
274
|
+
let _;
|
|
275
|
+
x ? _ = pt(ft(y, w), g, u.colorMapCenter, u.colorMapReverse, C) : m !== "raster" && (_ = mt(g, C)), _ && (g.domainSpec = { type: M.USER, params: _ }), s.updateColorMap(p, { colorMap: g });
|
|
276
|
+
} else O && s.updateColorMap(p, { colorMap: {} });
|
|
232
277
|
if (d && m !== "raster") {
|
|
233
278
|
const g = d.startsWith("properties.") ? d : `properties.${d}`;
|
|
234
|
-
|
|
279
|
+
s.updateThematic(p, { collection: F, property: g });
|
|
235
280
|
}
|
|
236
281
|
}
|
|
237
282
|
}
|
|
238
283
|
return {
|
|
239
|
-
async resolveMap(
|
|
240
|
-
if (t && t.map &&
|
|
241
|
-
|
|
284
|
+
async resolveMap(s, i, l = 0) {
|
|
285
|
+
if (t && t.map && s) {
|
|
286
|
+
st(i, l);
|
|
287
|
+
for (const f of i.layerRefs)
|
|
288
|
+
dt(f);
|
|
242
289
|
let c;
|
|
243
|
-
if (Array.isArray(t.map) ? c = document.getElementById(t.map[
|
|
290
|
+
if (Array.isArray(t.map) ? c = document.getElementById(t.map[l]) : c = document.getElementById(t.map), !c)
|
|
244
291
|
throw new Error("Could not find rendering target for map: " + t.map);
|
|
245
292
|
if (!(c instanceof HTMLCanvasElement))
|
|
246
293
|
throw new Error("Target for map is not a canvas: " + t.map);
|
|
247
|
-
const u = new
|
|
248
|
-
|
|
249
|
-
for (const f of
|
|
250
|
-
e?.set(f.dataRef, u),
|
|
251
|
-
o && (o[
|
|
294
|
+
const u = new z(c);
|
|
295
|
+
i.style && u.style.setPredefinedStyle(i.style), await u.init(), await a(u, s, i);
|
|
296
|
+
for (const f of i.layerRefs)
|
|
297
|
+
e?.set(f.dataRef, u), n?.set(f.dataRef, N(f));
|
|
298
|
+
o && (o[l] = u), u.draw();
|
|
252
299
|
}
|
|
253
300
|
}
|
|
254
301
|
};
|
|
255
302
|
}
|
|
256
|
-
function
|
|
303
|
+
function Et(t) {
|
|
257
304
|
return {
|
|
258
305
|
scatter: "scatterplot",
|
|
259
306
|
bar: "barchart",
|
|
@@ -264,29 +311,29 @@ function yt(t) {
|
|
|
264
311
|
heatmatrix: "heatmatrix"
|
|
265
312
|
}[t];
|
|
266
313
|
}
|
|
267
|
-
function
|
|
314
|
+
function wt(t, e, r, o, n, a) {
|
|
268
315
|
return {
|
|
269
|
-
async resolvePlot(
|
|
316
|
+
async resolvePlot(s, i) {
|
|
270
317
|
if (!t || !t.plot) return;
|
|
271
|
-
const
|
|
272
|
-
if (!
|
|
273
|
-
const c =
|
|
318
|
+
const l = document.getElementById(t.plot);
|
|
319
|
+
if (!l) throw new Error(`Could not find plot target: ${t.plot}`);
|
|
320
|
+
const c = s;
|
|
274
321
|
if (!c) throw new Error("No data context available for plot.");
|
|
275
|
-
const u =
|
|
276
|
-
type:
|
|
322
|
+
const u = n?.get(i.dataRef) ?? await c.getLayer(i.dataRef), f = i.events ?? [], p = new Z(l, {
|
|
323
|
+
type: Et(i.mark),
|
|
277
324
|
collection: u,
|
|
278
|
-
attributes: { axis:
|
|
279
|
-
labels: { axis:
|
|
325
|
+
attributes: { axis: i.axis, ...i.color && { color: i.color } },
|
|
326
|
+
labels: { axis: i.axis, title: i.title },
|
|
280
327
|
events: f,
|
|
281
|
-
...
|
|
282
|
-
...
|
|
283
|
-
...
|
|
284
|
-
...
|
|
328
|
+
...i.width && { width: i.width },
|
|
329
|
+
...i.height && { height: i.height },
|
|
330
|
+
...i.margins && { margins: i.margins },
|
|
331
|
+
...i.transform && { transform: i.transform }
|
|
285
332
|
});
|
|
286
|
-
if (r?.set(
|
|
287
|
-
const m = e.get(
|
|
333
|
+
if (r?.set(i.dataRef, p), i.mapRef && o?.set(i.dataRef, i.mapRef), i.mapRef && e) {
|
|
334
|
+
const m = e.get(i.mapRef), d = a?.get(i.mapRef) ?? i.mapRef;
|
|
288
335
|
if (m) {
|
|
289
|
-
m.updateRenderInfo(d, { isPick: !0 }), m.events.on(
|
|
336
|
+
m.updateRenderInfo(d, { isPick: !0 }), m.events.on(B.PICKING, ({ selection: h }) => {
|
|
290
337
|
p.setSelection(h);
|
|
291
338
|
});
|
|
292
339
|
for (const h of f)
|
|
@@ -298,15 +345,15 @@ function gt(t, e, r, o, i, a) {
|
|
|
298
345
|
}
|
|
299
346
|
};
|
|
300
347
|
}
|
|
301
|
-
const
|
|
302
|
-
function
|
|
348
|
+
const k = 134217728, At = 4, Rt = 32;
|
|
349
|
+
function Mt(t) {
|
|
303
350
|
return Array.isArray(t) ? t.join(`
|
|
304
351
|
`) : t;
|
|
305
352
|
}
|
|
306
353
|
function E(t) {
|
|
307
354
|
return !!t && typeof t == "object" && !Array.isArray(t) && typeof t.fromFeature == "object" && t.fromFeature !== null;
|
|
308
355
|
}
|
|
309
|
-
function
|
|
356
|
+
function S(t, e) {
|
|
310
357
|
return t instanceof Map ? t.get(e) : t[e];
|
|
311
358
|
}
|
|
312
359
|
function L(t, e) {
|
|
@@ -315,145 +362,145 @@ function L(t, e) {
|
|
|
315
362
|
return r[o];
|
|
316
363
|
}, t);
|
|
317
364
|
}
|
|
318
|
-
function
|
|
365
|
+
function q(t) {
|
|
319
366
|
const e = [];
|
|
320
367
|
for (const r of [t.uniforms, t.uniformMatrices])
|
|
321
368
|
for (const o of Object.values(r ?? {}))
|
|
322
369
|
E(o) && e.push(o);
|
|
323
370
|
return e;
|
|
324
371
|
}
|
|
325
|
-
function
|
|
326
|
-
return [.../* @__PURE__ */ new Set([t.dataRef, ...
|
|
372
|
+
function St(t) {
|
|
373
|
+
return [.../* @__PURE__ */ new Set([t.dataRef, ...q(t).map((e) => e.fromFeature.layer)])];
|
|
327
374
|
}
|
|
328
375
|
function W(t) {
|
|
329
|
-
for (const e of
|
|
376
|
+
for (const e of q(t)) {
|
|
330
377
|
const { iterate: r, layer: o } = e.fromFeature;
|
|
331
378
|
if (r === "all" || r === "batched") return { mode: r, layer: o };
|
|
332
379
|
}
|
|
333
380
|
return null;
|
|
334
381
|
}
|
|
335
382
|
function X(t, e, r) {
|
|
336
|
-
const o = t.fromFeature,
|
|
383
|
+
const o = t.fromFeature, n = r !== void 0 && o.iterate === "all" ? r : o.index ?? 0, a = S(e, o.layer)?.features?.[n];
|
|
337
384
|
return a ? L(a, o.path) : void 0;
|
|
338
385
|
}
|
|
339
|
-
function
|
|
386
|
+
function G(t, e, r) {
|
|
340
387
|
if (!t) return;
|
|
341
388
|
const o = {};
|
|
342
|
-
for (const [
|
|
389
|
+
for (const [n, a] of Object.entries(t)) {
|
|
343
390
|
if (!E(a)) {
|
|
344
|
-
o[
|
|
391
|
+
o[n] = a;
|
|
345
392
|
continue;
|
|
346
393
|
}
|
|
347
|
-
const
|
|
348
|
-
Number.isFinite(
|
|
394
|
+
const s = Number(X(a, e, r) ?? NaN);
|
|
395
|
+
Number.isFinite(s) ? o[n] = s : typeof a.default == "number" && (o[n] = a.default);
|
|
349
396
|
}
|
|
350
397
|
return o;
|
|
351
398
|
}
|
|
352
|
-
function
|
|
399
|
+
function j(t, e, r) {
|
|
353
400
|
if (!t) return;
|
|
354
401
|
const o = {};
|
|
355
|
-
for (const [
|
|
402
|
+
for (const [n, a] of Object.entries(t)) {
|
|
356
403
|
if (!E(a)) {
|
|
357
|
-
o[
|
|
404
|
+
o[n] = a;
|
|
358
405
|
continue;
|
|
359
406
|
}
|
|
360
|
-
const
|
|
361
|
-
if (!
|
|
362
|
-
const
|
|
363
|
-
|
|
407
|
+
const s = X(a, e, r), i = Array.isArray(s) ? s : Array.isArray(a.default) ? a.default : void 0;
|
|
408
|
+
if (!i) continue;
|
|
409
|
+
const l = a.cols ?? (Array.isArray(i[0]) ? i[0].length : 0);
|
|
410
|
+
l > 0 ? o[n] = { data: i, cols: l } : console.warn(`[autk-grammar] uniform matrix "${n}" has no column count; entry dropped`);
|
|
364
411
|
}
|
|
365
412
|
return o;
|
|
366
413
|
}
|
|
367
|
-
function
|
|
414
|
+
function Ct(t) {
|
|
368
415
|
return t != null && !(typeof t == "number" && !Number.isFinite(t));
|
|
369
416
|
}
|
|
370
417
|
function U(t) {
|
|
371
418
|
return E(t) && t.fromFeature.iterate === "batched";
|
|
372
419
|
}
|
|
373
420
|
function J(t, e) {
|
|
374
|
-
return Object.values(e ?? {}).some(U) ?
|
|
421
|
+
return Object.values(e ?? {}).some(U) ? Rt : Object.values(t ?? {}).some(U) ? At : 0;
|
|
375
422
|
}
|
|
376
|
-
function
|
|
423
|
+
function It(t, e, r = k) {
|
|
377
424
|
const o = J(t, e);
|
|
378
425
|
return o > 0 ? Math.floor(r / o) : Number.POSITIVE_INFINITY;
|
|
379
426
|
}
|
|
380
|
-
function
|
|
381
|
-
const
|
|
382
|
-
for (const
|
|
383
|
-
for (const c of Object.values(
|
|
384
|
-
E(c) && c.fromFeature.iterate === "batched" && c.fromFeature.required &&
|
|
385
|
-
if (
|
|
386
|
-
const
|
|
387
|
-
r = r.filter((c) =>
|
|
427
|
+
function Lt(t, e, r, o = k) {
|
|
428
|
+
const n = {}, a = {}, s = [];
|
|
429
|
+
for (const l of [t, e])
|
|
430
|
+
for (const c of Object.values(l ?? {}))
|
|
431
|
+
E(c) && c.fromFeature.iterate === "batched" && c.fromFeature.required && s.push(c.fromFeature.path);
|
|
432
|
+
if (s.length > 0) {
|
|
433
|
+
const l = r.length;
|
|
434
|
+
r = r.filter((c) => s.every((u) => Ct(L(c, u)))), r.length < l && console.info(`[autk-grammar] batched compute dropped ${l - r.length} feature(s) missing ${s.join(", ")}`);
|
|
388
435
|
}
|
|
389
|
-
const
|
|
390
|
-
r.length >
|
|
391
|
-
`[autk-grammar] batched compute capped at ${
|
|
392
|
-
), r = r.slice(0,
|
|
393
|
-
for (const [
|
|
436
|
+
const i = It(t, e, o);
|
|
437
|
+
r.length > i && (console.warn(
|
|
438
|
+
`[autk-grammar] batched compute capped at ${i} features (got ${r.length}): its largest packed array takes ${J(t, e)} B per feature, and a storage buffer binding holds ${o} B`
|
|
439
|
+
), r = r.slice(0, i));
|
|
440
|
+
for (const [l, c] of Object.entries(t ?? {}))
|
|
394
441
|
if (E(c) && c.fromFeature.iterate === "batched") {
|
|
395
442
|
const u = typeof c.default == "number" ? c.default : void 0;
|
|
396
|
-
a[
|
|
443
|
+
a[l] = r.map((f) => {
|
|
397
444
|
const p = Number(L(f, c.fromFeature.path) ?? u);
|
|
398
445
|
return Number.isFinite(p) ? p : 0;
|
|
399
446
|
});
|
|
400
|
-
} else typeof c == "number" && (
|
|
401
|
-
for (const [
|
|
447
|
+
} else typeof c == "number" && (n[l] = c);
|
|
448
|
+
for (const [l, c] of Object.entries(e ?? {})) {
|
|
402
449
|
if (!E(c) || c.fromFeature.iterate !== "batched") continue;
|
|
403
450
|
const u = [];
|
|
404
451
|
for (const f of r) {
|
|
405
452
|
const p = L(f, c.fromFeature.path);
|
|
406
453
|
let m = 1 / 0, d = 1 / 0, h = -1 / 0, y = -1 / 0;
|
|
407
454
|
if (Array.isArray(p))
|
|
408
|
-
for (const
|
|
409
|
-
if (!Array.isArray(
|
|
410
|
-
const
|
|
411
|
-
!Number.isFinite(
|
|
455
|
+
for (const w of p) {
|
|
456
|
+
if (!Array.isArray(w) || w.length < 2) continue;
|
|
457
|
+
const A = Number(w[0]), b = Number(w[1]);
|
|
458
|
+
!Number.isFinite(A) || !Number.isFinite(b) || (m = Math.min(m, A), d = Math.min(d, b), h = Math.max(h, A), y = Math.max(y, b));
|
|
412
459
|
}
|
|
413
460
|
Number.isFinite(m) || (m = 0, d = 0, h = 0, y = 0), u.push(m, d, h, d, h, y, m, y);
|
|
414
461
|
}
|
|
415
|
-
a[
|
|
462
|
+
a[l] = u;
|
|
416
463
|
}
|
|
417
|
-
return
|
|
464
|
+
return n.num_features = r.length, { uniforms: n, uniformArrays: a };
|
|
418
465
|
}
|
|
419
|
-
function
|
|
420
|
-
const o =
|
|
466
|
+
function Q(t, e, r) {
|
|
467
|
+
const o = S(e, t.dataRef);
|
|
421
468
|
if (!o) throw new Error(`compute: table "${t.dataRef}" is not loaded`);
|
|
422
|
-
const
|
|
469
|
+
const n = {
|
|
423
470
|
collection: o,
|
|
424
471
|
variableMapping: t.attributes,
|
|
425
|
-
wgslBody:
|
|
472
|
+
wgslBody: Mt(t.wglsFunction)
|
|
426
473
|
};
|
|
427
|
-
t.attributeArrays && (
|
|
474
|
+
t.attributeArrays && (n.attributeArrays = t.attributeArrays), t.attributeMatrices && (n.attributeMatrices = t.attributeMatrices), t.uniformArrays && (n.uniformArrays = t.uniformArrays), t.outputColumnName && (n.resultField = t.outputColumnName), t.outputColumns && (n.outputColumns = t.outputColumns);
|
|
428
475
|
const a = W(t);
|
|
429
476
|
if (a?.mode === "batched") {
|
|
430
|
-
const c =
|
|
431
|
-
return
|
|
477
|
+
const c = S(e, a.layer)?.features ?? [], u = Lt(t.uniforms, t.uniformMatrices, c), f = G(V(t.uniforms), e) ?? {}, p = j(V(t.uniformMatrices), e);
|
|
478
|
+
return n.uniforms = { ...f, ...u.uniforms }, n.uniformArrays = { ...n.uniformArrays ?? {}, ...u.uniformArrays }, p && Object.keys(p).length > 0 && (n.uniformMatrices = p), n;
|
|
432
479
|
}
|
|
433
|
-
const
|
|
434
|
-
return
|
|
480
|
+
const s = a?.mode === "all" ? r : void 0, i = G(t.uniforms, e, s), l = j(t.uniformMatrices, e, s);
|
|
481
|
+
return i && (n.uniforms = i), l && (n.uniformMatrices = l), n;
|
|
435
482
|
}
|
|
436
|
-
function
|
|
483
|
+
function V(t) {
|
|
437
484
|
if (t)
|
|
438
485
|
return Object.fromEntries(Object.entries(t).filter(([, e]) => !(E(e) && e.fromFeature.iterate === "batched")));
|
|
439
486
|
}
|
|
440
|
-
function
|
|
487
|
+
function vt(t) {
|
|
441
488
|
return t.outputColumns ?? (t.outputColumnName ? [t.outputColumnName] : []);
|
|
442
489
|
}
|
|
443
|
-
async function
|
|
490
|
+
async function Nt(t, e, r) {
|
|
444
491
|
const o = W(t);
|
|
445
|
-
if (o?.mode !== "all") return r(
|
|
446
|
-
const
|
|
447
|
-
if (!
|
|
448
|
-
const a =
|
|
449
|
-
for (const
|
|
450
|
-
const c =
|
|
492
|
+
if (o?.mode !== "all") return r(Q(t, e));
|
|
493
|
+
const n = S(e, t.dataRef);
|
|
494
|
+
if (!n) throw new Error(`compute: table "${t.dataRef}" is not loaded`);
|
|
495
|
+
const a = vt(t), s = structuredClone(n);
|
|
496
|
+
for (const l of s.features) {
|
|
497
|
+
const c = l.properties ??= {}, u = c.compute ??= {};
|
|
451
498
|
for (const f of a) u[f] = 0;
|
|
452
499
|
}
|
|
453
|
-
const
|
|
454
|
-
for (let
|
|
455
|
-
const c = await r({
|
|
456
|
-
|
|
500
|
+
const i = S(e, o.layer)?.features?.length ?? 0;
|
|
501
|
+
for (let l = 0; l < i; l++) {
|
|
502
|
+
const c = await r({ ...Q(t, e, l), collection: s });
|
|
503
|
+
s.features.forEach((u, f) => {
|
|
457
504
|
const p = u.properties?.compute, m = c.features[f]?.properties?.compute;
|
|
458
505
|
if (!(!p || !m))
|
|
459
506
|
for (const d of a) {
|
|
@@ -462,31 +509,31 @@ async function Ct(t, e, r) {
|
|
|
462
509
|
}
|
|
463
510
|
});
|
|
464
511
|
}
|
|
465
|
-
return
|
|
512
|
+
return s;
|
|
466
513
|
}
|
|
467
|
-
function
|
|
514
|
+
function Pt(t) {
|
|
468
515
|
return {
|
|
469
516
|
async resolveCompute(e, r) {
|
|
470
517
|
if (e) {
|
|
471
518
|
const o = {};
|
|
472
|
-
for (const
|
|
473
|
-
const
|
|
474
|
-
if (
|
|
475
|
-
else if (
|
|
519
|
+
for (const s of St(r)) {
|
|
520
|
+
const i = t?.get(s);
|
|
521
|
+
if (i) o[s] = i;
|
|
522
|
+
else if (s === r.dataRef) o[s] = await e.getLayer(s);
|
|
476
523
|
else
|
|
477
524
|
try {
|
|
478
|
-
o[
|
|
525
|
+
o[s] = await e.getLayer(s);
|
|
479
526
|
} catch {
|
|
480
|
-
o[
|
|
527
|
+
o[s] = void 0;
|
|
481
528
|
}
|
|
482
529
|
}
|
|
483
|
-
const
|
|
530
|
+
const n = new et(), a = await Nt(r, o, (s) => n.gpgpuPipeline(s));
|
|
484
531
|
return t && t.set(r.dataRef, a), e;
|
|
485
532
|
}
|
|
486
533
|
}
|
|
487
534
|
};
|
|
488
535
|
}
|
|
489
|
-
class
|
|
536
|
+
class Bt {
|
|
490
537
|
_listeners = /* @__PURE__ */ new Map();
|
|
491
538
|
on(e, r) {
|
|
492
539
|
this._listeners.has(e) || this._listeners.set(e, /* @__PURE__ */ new Set());
|
|
@@ -498,7 +545,7 @@ class Lt {
|
|
|
498
545
|
this._listeners.get(e)?.forEach((o) => o(r));
|
|
499
546
|
}
|
|
500
547
|
}
|
|
501
|
-
class
|
|
548
|
+
class $t {
|
|
502
549
|
dataAdapter;
|
|
503
550
|
mapAdapter;
|
|
504
551
|
plotAdapter;
|
|
@@ -512,10 +559,10 @@ class Tt {
|
|
|
512
559
|
_plotRegistry = /* @__PURE__ */ new Map();
|
|
513
560
|
_fwdCleanups = [];
|
|
514
561
|
_plotMapLinks = /* @__PURE__ */ new Map();
|
|
515
|
-
interactions = new
|
|
562
|
+
interactions = new Bt();
|
|
516
563
|
constructor(e) {
|
|
517
564
|
const r = /* @__PURE__ */ new Map();
|
|
518
|
-
this.dataAdapter =
|
|
565
|
+
this.dataAdapter = it(e, r), this.mapAdapter = _t(e, this._mapRegistry, this._computeCache, this._maps, this._mapLayerIds), this.plotAdapter = wt(e, this._mapRegistry, this._plotRegistry, this._plotMapLinks, r, this._mapLayerIds), this.computeAdapter = Pt(this._computeCache);
|
|
519
566
|
}
|
|
520
567
|
/**
|
|
521
568
|
* The coordinate reference system used internally by the autk workspace.
|
|
@@ -526,7 +573,7 @@ class Tt {
|
|
|
526
573
|
* instead of hard-coding a CRS string.
|
|
527
574
|
*/
|
|
528
575
|
get workspaceCrs() {
|
|
529
|
-
return
|
|
576
|
+
return Y;
|
|
530
577
|
}
|
|
531
578
|
get data() {
|
|
532
579
|
return this._data;
|
|
@@ -564,7 +611,7 @@ class Tt {
|
|
|
564
611
|
throw new Error("Plot adapter not initialized. Please call the constructor first.");
|
|
565
612
|
if (!this.computeAdapter)
|
|
566
613
|
throw new Error("Compute adapter not initialized. Please call the constructor first.");
|
|
567
|
-
this._mapRegistry.clear(), this._mapLayerIds.clear(), this._maps.length = 0, this._plotRegistry.clear(), this._plotMapLinks.clear(), this._computeCache.clear(), this.grammarEngine =
|
|
614
|
+
this._mapRegistry.clear(), this._mapLayerIds.clear(), this._maps.length = 0, this._plotRegistry.clear(), this._plotMapLinks.clear(), this._computeCache.clear(), this.grammarEngine = rt({
|
|
568
615
|
spec: e,
|
|
569
616
|
adapters: {
|
|
570
617
|
db: this.dataAdapter,
|
|
@@ -579,11 +626,11 @@ class Tt {
|
|
|
579
626
|
return;
|
|
580
627
|
}
|
|
581
628
|
const o = {};
|
|
582
|
-
for (const
|
|
583
|
-
Object.defineProperty(o,
|
|
629
|
+
for (const n of r.getLayersMetadata())
|
|
630
|
+
Object.defineProperty(o, n.name, {
|
|
584
631
|
get: () => {
|
|
585
|
-
const a = this._computeCache.get(
|
|
586
|
-
return a ? Promise.resolve(a) : r.getLayer(
|
|
632
|
+
const a = this._computeCache.get(n.name);
|
|
633
|
+
return a ? Promise.resolve(a) : r.getLayer(n.name);
|
|
587
634
|
},
|
|
588
635
|
enumerable: !0,
|
|
589
636
|
configurable: !0
|
|
@@ -597,8 +644,8 @@ class Tt {
|
|
|
597
644
|
highlightOnMap(e, r) {
|
|
598
645
|
const o = this.mapLayer(e);
|
|
599
646
|
o?.map.setHighlightedIds(o.layerId, r);
|
|
600
|
-
for (const [
|
|
601
|
-
a === e && this._plotRegistry.get(
|
|
647
|
+
for (const [n, a] of this._plotMapLinks)
|
|
648
|
+
a === e && this._plotRegistry.get(n)?.setSelection(r);
|
|
602
649
|
}
|
|
603
650
|
/**
|
|
604
651
|
* Clears highlighted features on the map layer that draws the table `dataRef` (see {@link mapLayer}).
|
|
@@ -607,8 +654,8 @@ class Tt {
|
|
|
607
654
|
clearHighlightOnMap(e) {
|
|
608
655
|
const r = this.mapLayer(e);
|
|
609
656
|
r?.map.clearHighlightedIds(r.layerId);
|
|
610
|
-
for (const [o,
|
|
611
|
-
|
|
657
|
+
for (const [o, n] of this._plotMapLinks)
|
|
658
|
+
n === e && this._plotRegistry.get(o)?.setSelection([]);
|
|
612
659
|
}
|
|
613
660
|
/**
|
|
614
661
|
* Clears the selection on the plot identified by `plotId` (its dataRef).
|
|
@@ -625,8 +672,8 @@ class Tt {
|
|
|
625
672
|
*/
|
|
626
673
|
setPlotSelection(e, r) {
|
|
627
674
|
this._plotRegistry.get(e)?.setSelection(r);
|
|
628
|
-
const o = this._plotMapLinks.get(e),
|
|
629
|
-
|
|
675
|
+
const o = this._plotMapLinks.get(e), n = o ? this.mapLayer(o) : void 0;
|
|
676
|
+
n?.map.setHighlightedIds(n.layerId, r);
|
|
630
677
|
}
|
|
631
678
|
_rewireInteractions() {
|
|
632
679
|
for (const r of this._fwdCleanups) r();
|
|
@@ -635,40 +682,40 @@ class Tt {
|
|
|
635
682
|
for (const [r, o] of this._mapRegistry) {
|
|
636
683
|
if (e.has(o)) continue;
|
|
637
684
|
e.add(o);
|
|
638
|
-
const
|
|
685
|
+
const n = ({ selection: a }) => {
|
|
639
686
|
this.interactions.emit("map:picking", { layerId: r, selection: a });
|
|
640
687
|
};
|
|
641
|
-
o.events.on(
|
|
688
|
+
o.events.on(B.PICKING, n), this._fwdCleanups.push(() => o.events.off(B.PICKING, n));
|
|
642
689
|
}
|
|
643
690
|
for (const [r, o] of this._plotRegistry)
|
|
644
|
-
for (const
|
|
645
|
-
const a = ({ selection:
|
|
691
|
+
for (const n of [I.CLICK, I.BRUSH, I.BRUSH_X, I.BRUSH_Y]) {
|
|
692
|
+
const a = ({ selection: s }) => {
|
|
646
693
|
this.interactions.emit("plot:selection", {
|
|
647
694
|
plotId: r,
|
|
648
|
-
event:
|
|
649
|
-
selection:
|
|
695
|
+
event: n,
|
|
696
|
+
selection: s
|
|
650
697
|
});
|
|
651
698
|
};
|
|
652
|
-
o.events.on(
|
|
699
|
+
o.events.on(n, a), this._fwdCleanups.push(() => o.events.off(n, a));
|
|
653
700
|
}
|
|
654
701
|
}
|
|
655
702
|
}
|
|
656
703
|
export {
|
|
657
|
-
|
|
658
|
-
|
|
659
|
-
|
|
660
|
-
|
|
661
|
-
|
|
662
|
-
|
|
663
|
-
|
|
664
|
-
|
|
704
|
+
$t as AutkGrammar,
|
|
705
|
+
ot as ColorMapInterpolator,
|
|
706
|
+
Bt as GrammarEventEmitter,
|
|
707
|
+
H as NormalizationMode,
|
|
708
|
+
k as STORAGE_BUFFER_BINDING_SIZE,
|
|
709
|
+
Lt as buildBatchedUniforms,
|
|
710
|
+
St as computeLayerNames,
|
|
711
|
+
rt as createEngine,
|
|
665
712
|
W as findIterateSource,
|
|
666
713
|
E as isFromFeature,
|
|
667
|
-
|
|
668
|
-
|
|
669
|
-
|
|
670
|
-
|
|
671
|
-
|
|
672
|
-
|
|
714
|
+
Mt as joinWgsl,
|
|
715
|
+
It as maxBatchedFeatures,
|
|
716
|
+
Q as resolveComputeParams,
|
|
717
|
+
j as resolveUniformMatrices,
|
|
718
|
+
G as resolveUniforms,
|
|
719
|
+
Nt as runCompute
|
|
673
720
|
};
|
|
674
721
|
//# sourceMappingURL=autk-grammar.js.map
|