@datagouv/components-next 1.0.1 → 1.0.2-dev.1
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/dist/{Control-BNCDn-8E.js → Control-DuZJdKV_.js} +1 -1
- package/dist/{Datafair.client-B5lBpOl8.js → Datafair.client-E5D6ePRC.js} +1 -1
- package/dist/{Event-BOgJUhNR.js → Event--kp8kMdJ.js} +21 -21
- package/dist/{Image-BN-4XkIn.js → Image-34hvypZI.js} +114 -58
- package/dist/{JsonPreview.client-Doz1Z0BS.js → JsonPreview.client-C-6eBbPw.js} +1 -1
- package/dist/{Map-BdT3i2C4.js → Map-BjUnLyj8.js} +1534 -1466
- package/dist/{MapContainer.client-oiieO8H-.js → MapContainer.client-DRkAmdOc.js} +7 -7
- package/dist/{OSM-CamriM9b.js → OSM-s40W6sQ2.js} +22 -12
- package/dist/{PdfPreview.client-CdAhkDFJ.js → PdfPreview.client-C-w6-w44.js} +1 -1
- package/dist/Pmtiles.client-BR7_ldHY.js +25190 -0
- package/dist/{ScaleLine-BiesrgOv.js → ScaleLine-KW-nXqp3.js} +2 -2
- package/dist/Swagger.client-D4-F6yEf.js +4 -0
- package/dist/{Tile-DCuqwNOI.js → Tile-DbNFNPfU.js} +189 -172
- package/dist/{TileImage-CmZf8EdU.js → TileImage-BsXBxMtq.js} +132 -102
- package/dist/{View-DcDc7N2K.js → View-BR92hTWP.js} +8 -8
- package/dist/{XmlPreview.client-CrjHf74q.js → XmlPreview.client-Dl2VCgXF.js} +2 -2
- package/dist/{common-C4rDcQpp.js → common-PJfpC179.js} +34 -33
- package/dist/components-next.css +4 -4
- package/dist/components-next.js +1 -1
- package/dist/components.css +1 -1
- package/dist/{index-Bbu9rOHt.js → index-SrYZwgCT.js} +11105 -6743
- package/dist/{main-CiH8ZmBI.js → main-B2kXxWRG.js} +28459 -28404
- package/dist/{proj-CKwYjU38.js → proj-DsetBcW7.js} +513 -498
- package/dist/{tilecoord-YW3qEH_j.js → tilecoord-Db24Px13.js} +242 -224
- package/dist/{vue3-xml-viewer.common-Bi_bsV6C.js → vue3-xml-viewer.common-BRxsqI9j.js} +1 -1
- package/package.json +2 -1
- package/dist/Pmtiles.client-B0v8tGJQ.js +0 -22812
- package/dist/Swagger.client-CsK65JnG.js +0 -4
|
@@ -44,82 +44,82 @@ class Vn {
|
|
|
44
44
|
disposeInternal() {
|
|
45
45
|
}
|
|
46
46
|
}
|
|
47
|
-
function Vt(n, t,
|
|
48
|
-
let
|
|
49
|
-
|
|
47
|
+
function Vt(n, t, r) {
|
|
48
|
+
let s, e;
|
|
49
|
+
r = r || pn;
|
|
50
50
|
let i = 0, o = n.length, a = !1;
|
|
51
51
|
for (; i < o; )
|
|
52
|
-
|
|
52
|
+
s = i + (o - i >> 1), e = +r(n[s], t), e < 0 ? i = s + 1 : (o = s, a = !e);
|
|
53
53
|
return a ? i : ~i;
|
|
54
54
|
}
|
|
55
|
-
function
|
|
55
|
+
function pn(n, t) {
|
|
56
56
|
return n > t ? 1 : n < t ? -1 : 0;
|
|
57
57
|
}
|
|
58
58
|
function jt(n, t) {
|
|
59
59
|
return n < t ? 1 : n > t ? -1 : 0;
|
|
60
60
|
}
|
|
61
|
-
function zt(n, t,
|
|
61
|
+
function zt(n, t, r) {
|
|
62
62
|
if (n[0] <= t)
|
|
63
63
|
return 0;
|
|
64
|
-
const
|
|
65
|
-
if (t <= n[
|
|
66
|
-
return
|
|
67
|
-
if (typeof
|
|
68
|
-
for (let
|
|
69
|
-
const i = n[
|
|
64
|
+
const s = n.length;
|
|
65
|
+
if (t <= n[s - 1])
|
|
66
|
+
return s - 1;
|
|
67
|
+
if (typeof r == "function") {
|
|
68
|
+
for (let e = 1; e < s; ++e) {
|
|
69
|
+
const i = n[e];
|
|
70
70
|
if (i === t)
|
|
71
|
-
return
|
|
71
|
+
return e;
|
|
72
72
|
if (i < t)
|
|
73
|
-
return
|
|
73
|
+
return r(t, n[e - 1], i) > 0 ? e - 1 : e;
|
|
74
74
|
}
|
|
75
|
-
return
|
|
76
|
-
}
|
|
77
|
-
if (
|
|
78
|
-
for (let
|
|
79
|
-
if (n[
|
|
80
|
-
return
|
|
81
|
-
return
|
|
82
|
-
}
|
|
83
|
-
if (
|
|
84
|
-
for (let
|
|
85
|
-
if (n[
|
|
86
|
-
return
|
|
87
|
-
return
|
|
88
|
-
}
|
|
89
|
-
for (let
|
|
90
|
-
if (n[
|
|
91
|
-
return
|
|
92
|
-
if (n[
|
|
93
|
-
return n[
|
|
75
|
+
return s - 1;
|
|
76
|
+
}
|
|
77
|
+
if (r > 0) {
|
|
78
|
+
for (let e = 1; e < s; ++e)
|
|
79
|
+
if (n[e] < t)
|
|
80
|
+
return e - 1;
|
|
81
|
+
return s - 1;
|
|
82
|
+
}
|
|
83
|
+
if (r < 0) {
|
|
84
|
+
for (let e = 1; e < s; ++e)
|
|
85
|
+
if (n[e] <= t)
|
|
86
|
+
return e;
|
|
87
|
+
return s - 1;
|
|
88
|
+
}
|
|
89
|
+
for (let e = 1; e < s; ++e) {
|
|
90
|
+
if (n[e] == t)
|
|
91
|
+
return e;
|
|
92
|
+
if (n[e] < t)
|
|
93
|
+
return n[e - 1] - t < t - n[e] ? e - 1 : e;
|
|
94
94
|
}
|
|
95
|
-
return
|
|
95
|
+
return s - 1;
|
|
96
96
|
}
|
|
97
|
-
function kt(n, t,
|
|
98
|
-
for (; t <
|
|
99
|
-
const
|
|
100
|
-
n[t] = n[
|
|
97
|
+
function kt(n, t, r) {
|
|
98
|
+
for (; t < r; ) {
|
|
99
|
+
const s = n[t];
|
|
100
|
+
n[t] = n[r], n[r] = s, ++t, --r;
|
|
101
101
|
}
|
|
102
102
|
}
|
|
103
103
|
function Jt(n, t) {
|
|
104
|
-
const
|
|
105
|
-
for (let
|
|
106
|
-
n[n.length] =
|
|
104
|
+
const r = Array.isArray(t) ? t : [t], s = r.length;
|
|
105
|
+
for (let e = 0; e < s; e++)
|
|
106
|
+
n[n.length] = r[e];
|
|
107
107
|
}
|
|
108
108
|
function jn(n, t) {
|
|
109
|
-
const
|
|
110
|
-
if (
|
|
109
|
+
const r = n.length;
|
|
110
|
+
if (r !== t.length)
|
|
111
111
|
return !1;
|
|
112
|
-
for (let
|
|
113
|
-
if (n[
|
|
112
|
+
for (let s = 0; s < r; s++)
|
|
113
|
+
if (n[s] !== t[s])
|
|
114
114
|
return !1;
|
|
115
115
|
return !0;
|
|
116
116
|
}
|
|
117
|
-
function Qt(n, t,
|
|
118
|
-
const
|
|
119
|
-
return n.every(function(
|
|
117
|
+
function Qt(n, t, r) {
|
|
118
|
+
const s = t || pn;
|
|
119
|
+
return n.every(function(e, i) {
|
|
120
120
|
if (i === 0)
|
|
121
121
|
return !0;
|
|
122
|
-
const o =
|
|
122
|
+
const o = s(n[i - 1], e);
|
|
123
123
|
return !(o > 0 || o === 0);
|
|
124
124
|
});
|
|
125
125
|
}
|
|
@@ -132,21 +132,21 @@ function xt() {
|
|
|
132
132
|
function ln() {
|
|
133
133
|
}
|
|
134
134
|
function ns(n) {
|
|
135
|
-
let t,
|
|
135
|
+
let t, r, s;
|
|
136
136
|
return function() {
|
|
137
|
-
const
|
|
138
|
-
return (!
|
|
137
|
+
const e = Array.prototype.slice.call(arguments);
|
|
138
|
+
return (!r || this !== s || !jn(e, r)) && (s = this, r = e, t = n.apply(this, arguments)), t;
|
|
139
139
|
};
|
|
140
140
|
}
|
|
141
141
|
function ts(n) {
|
|
142
142
|
function t() {
|
|
143
|
-
let
|
|
143
|
+
let r;
|
|
144
144
|
try {
|
|
145
|
-
|
|
146
|
-
} catch (
|
|
147
|
-
return Promise.reject(
|
|
145
|
+
r = n();
|
|
146
|
+
} catch (s) {
|
|
147
|
+
return Promise.reject(s);
|
|
148
148
|
}
|
|
149
|
-
return
|
|
149
|
+
return r instanceof Promise ? r : Promise.resolve(r);
|
|
150
150
|
}
|
|
151
151
|
return t();
|
|
152
152
|
}
|
|
@@ -194,11 +194,11 @@ class kn extends Vn {
|
|
|
194
194
|
* @param {string} type Type.
|
|
195
195
|
* @param {import("../events.js").Listener} listener Listener.
|
|
196
196
|
*/
|
|
197
|
-
addEventListener(t,
|
|
198
|
-
if (!t || !
|
|
197
|
+
addEventListener(t, r) {
|
|
198
|
+
if (!t || !r)
|
|
199
199
|
return;
|
|
200
|
-
const
|
|
201
|
-
|
|
200
|
+
const s = this.listeners_ || (this.listeners_ = {}), e = s[t] || (s[t] = []);
|
|
201
|
+
e.includes(r) || e.push(r);
|
|
202
202
|
}
|
|
203
203
|
/**
|
|
204
204
|
* Dispatches an event and calls all listeners listening for events
|
|
@@ -211,29 +211,29 @@ class kn extends Vn {
|
|
|
211
211
|
* @api
|
|
212
212
|
*/
|
|
213
213
|
dispatchEvent(t) {
|
|
214
|
-
const
|
|
215
|
-
if (!
|
|
214
|
+
const r = typeof t == "string", s = r ? t : t.type, e = this.listeners_ && this.listeners_[s];
|
|
215
|
+
if (!e)
|
|
216
216
|
return;
|
|
217
|
-
const i =
|
|
217
|
+
const i = r ? new Cn(t) : (
|
|
218
218
|
/** @type {Event} */
|
|
219
219
|
t
|
|
220
220
|
);
|
|
221
221
|
i.target || (i.target = this.eventTarget_ || this);
|
|
222
222
|
const o = this.dispatching_ || (this.dispatching_ = {}), a = this.pendingRemovals_ || (this.pendingRemovals_ = {});
|
|
223
|
-
|
|
223
|
+
s in o || (o[s] = 0, a[s] = 0), ++o[s];
|
|
224
224
|
let c;
|
|
225
|
-
for (let l = 0, f =
|
|
226
|
-
if ("handleEvent" in
|
|
227
|
-
|
|
228
|
-
|
|
225
|
+
for (let l = 0, f = e.length; l < f; ++l)
|
|
226
|
+
if ("handleEvent" in e[l] ? c = /** @type {import("../events.js").ListenerObject} */
|
|
227
|
+
e[l].handleEvent(i) : c = /** @type {import("../events.js").ListenerFunction} */
|
|
228
|
+
e[l].call(this, i), c === !1 || i.propagationStopped) {
|
|
229
229
|
c = !1;
|
|
230
230
|
break;
|
|
231
231
|
}
|
|
232
|
-
if (--o[
|
|
233
|
-
let l = a[
|
|
234
|
-
for (delete a[
|
|
235
|
-
this.removeEventListener(
|
|
236
|
-
delete o[
|
|
232
|
+
if (--o[s] === 0) {
|
|
233
|
+
let l = a[s];
|
|
234
|
+
for (delete a[s]; l--; )
|
|
235
|
+
this.removeEventListener(s, ln);
|
|
236
|
+
delete o[s];
|
|
237
237
|
}
|
|
238
238
|
return c;
|
|
239
239
|
}
|
|
@@ -266,32 +266,32 @@ class kn extends Vn {
|
|
|
266
266
|
* @param {string} type Type.
|
|
267
267
|
* @param {import("../events.js").Listener} listener Listener.
|
|
268
268
|
*/
|
|
269
|
-
removeEventListener(t,
|
|
269
|
+
removeEventListener(t, r) {
|
|
270
270
|
if (!this.listeners_)
|
|
271
271
|
return;
|
|
272
|
-
const
|
|
273
|
-
if (!
|
|
272
|
+
const s = this.listeners_[t];
|
|
273
|
+
if (!s)
|
|
274
274
|
return;
|
|
275
|
-
const
|
|
276
|
-
|
|
275
|
+
const e = s.indexOf(r);
|
|
276
|
+
e !== -1 && (this.pendingRemovals_ && t in this.pendingRemovals_ ? (s[e] = ln, ++this.pendingRemovals_[t]) : (s.splice(e, 1), s.length === 0 && delete this.listeners_[t]));
|
|
277
277
|
}
|
|
278
278
|
}
|
|
279
|
-
function j(n, t, s, e
|
|
280
|
-
if (
|
|
281
|
-
const o =
|
|
282
|
-
|
|
283
|
-
return n.removeEventListener(t,
|
|
279
|
+
function j(n, t, r, s, e) {
|
|
280
|
+
if (e) {
|
|
281
|
+
const o = r;
|
|
282
|
+
r = function(a) {
|
|
283
|
+
return n.removeEventListener(t, r), o.call(s ?? this, a);
|
|
284
284
|
};
|
|
285
|
-
} else
|
|
285
|
+
} else s && s !== n && (r = r.bind(s));
|
|
286
286
|
const i = {
|
|
287
287
|
target: n,
|
|
288
288
|
type: t,
|
|
289
|
-
listener:
|
|
289
|
+
listener: r
|
|
290
290
|
};
|
|
291
|
-
return n.addEventListener(t,
|
|
291
|
+
return n.addEventListener(t, r), i;
|
|
292
292
|
}
|
|
293
|
-
function fn(n, t,
|
|
294
|
-
return j(n, t,
|
|
293
|
+
function fn(n, t, r, s) {
|
|
294
|
+
return j(n, t, r, s, !0);
|
|
295
295
|
}
|
|
296
296
|
function un(n) {
|
|
297
297
|
n && n.target && (n.target.removeEventListener(n.type, n.listener), Rn(n));
|
|
@@ -325,18 +325,18 @@ class $ extends kn {
|
|
|
325
325
|
* @return {import("./events.js").EventsKey|Array<import("./events.js").EventsKey>} Event key.
|
|
326
326
|
* @protected
|
|
327
327
|
*/
|
|
328
|
-
onInternal(t,
|
|
328
|
+
onInternal(t, r) {
|
|
329
329
|
if (Array.isArray(t)) {
|
|
330
|
-
const
|
|
331
|
-
for (let i = 0; i <
|
|
332
|
-
|
|
333
|
-
return
|
|
330
|
+
const s = t.length, e = new Array(s);
|
|
331
|
+
for (let i = 0; i < s; ++i)
|
|
332
|
+
e[i] = j(this, t[i], r);
|
|
333
|
+
return e;
|
|
334
334
|
}
|
|
335
335
|
return j(
|
|
336
336
|
this,
|
|
337
337
|
/** @type {string} */
|
|
338
338
|
t,
|
|
339
|
-
|
|
339
|
+
r
|
|
340
340
|
);
|
|
341
341
|
}
|
|
342
342
|
/**
|
|
@@ -345,21 +345,21 @@ class $ extends kn {
|
|
|
345
345
|
* @return {import("./events.js").EventsKey|Array<import("./events.js").EventsKey>} Event key.
|
|
346
346
|
* @protected
|
|
347
347
|
*/
|
|
348
|
-
onceInternal(t,
|
|
349
|
-
let
|
|
348
|
+
onceInternal(t, r) {
|
|
349
|
+
let s;
|
|
350
350
|
if (Array.isArray(t)) {
|
|
351
|
-
const
|
|
352
|
-
|
|
353
|
-
for (let i = 0; i <
|
|
354
|
-
|
|
351
|
+
const e = t.length;
|
|
352
|
+
s = new Array(e);
|
|
353
|
+
for (let i = 0; i < e; ++i)
|
|
354
|
+
s[i] = fn(this, t[i], r);
|
|
355
355
|
} else
|
|
356
|
-
|
|
356
|
+
s = fn(
|
|
357
357
|
this,
|
|
358
358
|
/** @type {string} */
|
|
359
359
|
t,
|
|
360
|
-
|
|
360
|
+
r
|
|
361
361
|
);
|
|
362
|
-
return
|
|
362
|
+
return r.ol_key = s, s;
|
|
363
363
|
}
|
|
364
364
|
/**
|
|
365
365
|
* Unlisten for a certain type of event.
|
|
@@ -367,18 +367,18 @@ class $ extends kn {
|
|
|
367
367
|
* @param {function((Event|import("./events/Event").default)): ?} listener Listener.
|
|
368
368
|
* @protected
|
|
369
369
|
*/
|
|
370
|
-
unInternal(t,
|
|
371
|
-
const
|
|
370
|
+
unInternal(t, r) {
|
|
371
|
+
const s = (
|
|
372
372
|
/** @type {Object} */
|
|
373
|
-
|
|
373
|
+
r.ol_key
|
|
374
374
|
);
|
|
375
|
-
if (
|
|
376
|
-
Jn(
|
|
375
|
+
if (s)
|
|
376
|
+
Jn(s);
|
|
377
377
|
else if (Array.isArray(t))
|
|
378
|
-
for (let
|
|
379
|
-
this.removeEventListener(t[
|
|
378
|
+
for (let e = 0, i = t.length; e < i; ++e)
|
|
379
|
+
this.removeEventListener(t[e], r);
|
|
380
380
|
else
|
|
381
|
-
this.removeEventListener(t,
|
|
381
|
+
this.removeEventListener(t, r);
|
|
382
382
|
}
|
|
383
383
|
}
|
|
384
384
|
$.prototype.on;
|
|
@@ -386,7 +386,7 @@ $.prototype.once;
|
|
|
386
386
|
$.prototype.un;
|
|
387
387
|
function Jn(n) {
|
|
388
388
|
if (Array.isArray(n))
|
|
389
|
-
for (let t = 0,
|
|
389
|
+
for (let t = 0, r = n.length; t < r; ++t)
|
|
390
390
|
un(n[t]);
|
|
391
391
|
else
|
|
392
392
|
un(
|
|
@@ -407,11 +407,11 @@ class hn extends Cn {
|
|
|
407
407
|
* @param {string} key The property name.
|
|
408
408
|
* @param {*} oldValue The old value for `key`.
|
|
409
409
|
*/
|
|
410
|
-
constructor(t,
|
|
411
|
-
super(t), this.key =
|
|
410
|
+
constructor(t, r, s) {
|
|
411
|
+
super(t), this.key = r, this.oldValue = s;
|
|
412
412
|
}
|
|
413
413
|
}
|
|
414
|
-
class
|
|
414
|
+
class rs extends $ {
|
|
415
415
|
/**
|
|
416
416
|
* @param {Object<string, *>} [values] An object with key-value pairs.
|
|
417
417
|
*/
|
|
@@ -425,8 +425,8 @@ class es extends $ {
|
|
|
425
425
|
* @api
|
|
426
426
|
*/
|
|
427
427
|
get(t) {
|
|
428
|
-
let
|
|
429
|
-
return this.values_ && this.values_.hasOwnProperty(t) && (
|
|
428
|
+
let r;
|
|
429
|
+
return this.values_ && this.values_.hasOwnProperty(t) && (r = this.values_[t]), r;
|
|
430
430
|
}
|
|
431
431
|
/**
|
|
432
432
|
* Get a list of object property names.
|
|
@@ -461,23 +461,23 @@ class es extends $ {
|
|
|
461
461
|
* @param {string} key Key name.
|
|
462
462
|
* @param {*} oldValue Old value.
|
|
463
463
|
*/
|
|
464
|
-
notify(t,
|
|
465
|
-
let
|
|
466
|
-
|
|
464
|
+
notify(t, r) {
|
|
465
|
+
let s;
|
|
466
|
+
s = `change:${t}`, this.hasListener(s) && this.dispatchEvent(new hn(s, t, r)), s = Hn.PROPERTYCHANGE, this.hasListener(s) && this.dispatchEvent(new hn(s, t, r));
|
|
467
467
|
}
|
|
468
468
|
/**
|
|
469
469
|
* @param {string} key Key name.
|
|
470
470
|
* @param {import("./events.js").Listener} listener Listener.
|
|
471
471
|
*/
|
|
472
|
-
addChangeListener(t,
|
|
473
|
-
this.addEventListener(`change:${t}`,
|
|
472
|
+
addChangeListener(t, r) {
|
|
473
|
+
this.addEventListener(`change:${t}`, r);
|
|
474
474
|
}
|
|
475
475
|
/**
|
|
476
476
|
* @param {string} key Key name.
|
|
477
477
|
* @param {import("./events.js").Listener} listener Listener.
|
|
478
478
|
*/
|
|
479
|
-
removeChangeListener(t,
|
|
480
|
-
this.removeEventListener(`change:${t}`,
|
|
479
|
+
removeChangeListener(t, r) {
|
|
480
|
+
this.removeEventListener(`change:${t}`, r);
|
|
481
481
|
}
|
|
482
482
|
/**
|
|
483
483
|
* Sets a value.
|
|
@@ -486,13 +486,13 @@ class es extends $ {
|
|
|
486
486
|
* @param {boolean} [silent] Update without triggering an event.
|
|
487
487
|
* @api
|
|
488
488
|
*/
|
|
489
|
-
set(t,
|
|
490
|
-
const
|
|
491
|
-
if (
|
|
492
|
-
|
|
489
|
+
set(t, r, s) {
|
|
490
|
+
const e = this.values_ || (this.values_ = {});
|
|
491
|
+
if (s)
|
|
492
|
+
e[t] = r;
|
|
493
493
|
else {
|
|
494
|
-
const i =
|
|
495
|
-
|
|
494
|
+
const i = e[t];
|
|
495
|
+
e[t] = r, i !== r && this.notify(t, i);
|
|
496
496
|
}
|
|
497
497
|
}
|
|
498
498
|
/**
|
|
@@ -502,9 +502,9 @@ class es extends $ {
|
|
|
502
502
|
* @param {boolean} [silent] Update without triggering an event.
|
|
503
503
|
* @api
|
|
504
504
|
*/
|
|
505
|
-
setProperties(t,
|
|
506
|
-
for (const
|
|
507
|
-
this.set(
|
|
505
|
+
setProperties(t, r) {
|
|
506
|
+
for (const s in t)
|
|
507
|
+
this.set(s, t[s], r);
|
|
508
508
|
}
|
|
509
509
|
/**
|
|
510
510
|
* Apply any properties from another object without triggering events.
|
|
@@ -520,70 +520,70 @@ class es extends $ {
|
|
|
520
520
|
* @param {boolean} [silent] Unset without triggering an event.
|
|
521
521
|
* @api
|
|
522
522
|
*/
|
|
523
|
-
unset(t,
|
|
523
|
+
unset(t, r) {
|
|
524
524
|
if (this.values_ && t in this.values_) {
|
|
525
|
-
const
|
|
526
|
-
delete this.values_[t], zn(this.values_) && (this.values_ = null),
|
|
525
|
+
const s = this.values_[t];
|
|
526
|
+
delete this.values_[t], zn(this.values_) && (this.values_ = null), r || this.notify(t, s);
|
|
527
527
|
}
|
|
528
528
|
}
|
|
529
529
|
}
|
|
530
|
-
function
|
|
531
|
-
return Math.min(Math.max(n, t),
|
|
530
|
+
function es(n, t, r) {
|
|
531
|
+
return Math.min(Math.max(n, t), r);
|
|
532
532
|
}
|
|
533
|
-
function is(n, t, s, e,
|
|
534
|
-
const o =
|
|
533
|
+
function is(n, t, r, s, e, i) {
|
|
534
|
+
const o = e - r, a = i - s;
|
|
535
535
|
if (o !== 0 || a !== 0) {
|
|
536
|
-
const c = ((n -
|
|
537
|
-
c > 1 ? (
|
|
536
|
+
const c = ((n - r) * o + (t - s) * a) / (o * o + a * a);
|
|
537
|
+
c > 1 ? (r = e, s = i) : c > 0 && (r += o * c, s += a * c);
|
|
538
538
|
}
|
|
539
|
-
return xn(n, t,
|
|
539
|
+
return xn(n, t, r, s);
|
|
540
540
|
}
|
|
541
|
-
function xn(n, t,
|
|
542
|
-
const
|
|
543
|
-
return
|
|
541
|
+
function xn(n, t, r, s) {
|
|
542
|
+
const e = r - n, i = s - t;
|
|
543
|
+
return e * e + i * i;
|
|
544
544
|
}
|
|
545
545
|
function os(n) {
|
|
546
546
|
const t = n.length;
|
|
547
|
-
for (let
|
|
548
|
-
let
|
|
549
|
-
for (let a =
|
|
550
|
-
const c = Math.abs(n[a][
|
|
551
|
-
c > i && (i = c,
|
|
547
|
+
for (let s = 0; s < t; s++) {
|
|
548
|
+
let e = s, i = Math.abs(n[s][s]);
|
|
549
|
+
for (let a = s + 1; a < t; a++) {
|
|
550
|
+
const c = Math.abs(n[a][s]);
|
|
551
|
+
c > i && (i = c, e = a);
|
|
552
552
|
}
|
|
553
553
|
if (i === 0)
|
|
554
554
|
return null;
|
|
555
|
-
const o = n[
|
|
556
|
-
n[
|
|
557
|
-
for (let a =
|
|
558
|
-
const c = -n[a][
|
|
559
|
-
for (let l =
|
|
560
|
-
|
|
555
|
+
const o = n[e];
|
|
556
|
+
n[e] = n[s], n[s] = o;
|
|
557
|
+
for (let a = s + 1; a < t; a++) {
|
|
558
|
+
const c = -n[a][s] / n[s][s];
|
|
559
|
+
for (let l = s; l < t + 1; l++)
|
|
560
|
+
s == l ? n[a][l] = 0 : n[a][l] += c * n[s][l];
|
|
561
561
|
}
|
|
562
562
|
}
|
|
563
|
-
const
|
|
564
|
-
for (let
|
|
565
|
-
s
|
|
566
|
-
for (let
|
|
567
|
-
n[
|
|
563
|
+
const r = new Array(t);
|
|
564
|
+
for (let s = t - 1; s >= 0; s--) {
|
|
565
|
+
r[s] = n[s][t] / n[s][s];
|
|
566
|
+
for (let e = s - 1; e >= 0; e--)
|
|
567
|
+
n[e][t] -= n[e][s] * r[s];
|
|
568
568
|
}
|
|
569
|
-
return
|
|
569
|
+
return r;
|
|
570
570
|
}
|
|
571
571
|
function gn(n) {
|
|
572
572
|
return n * 180 / Math.PI;
|
|
573
573
|
}
|
|
574
|
-
function
|
|
574
|
+
function w(n) {
|
|
575
575
|
return n * Math.PI / 180;
|
|
576
576
|
}
|
|
577
577
|
function as(n, t) {
|
|
578
|
-
const
|
|
579
|
-
return
|
|
578
|
+
const r = n % t;
|
|
579
|
+
return r * t < 0 ? r + t : r;
|
|
580
580
|
}
|
|
581
|
-
function cs(n, t,
|
|
582
|
-
return n +
|
|
581
|
+
function cs(n, t, r) {
|
|
582
|
+
return n + r * (t - n);
|
|
583
583
|
}
|
|
584
584
|
function x(n, t) {
|
|
585
|
-
const
|
|
586
|
-
return Math.round(n *
|
|
585
|
+
const r = Math.pow(10, t);
|
|
586
|
+
return Math.round(n * r) / r;
|
|
587
587
|
}
|
|
588
588
|
function ls(n, t) {
|
|
589
589
|
return Math.round(x(n, t));
|
|
@@ -594,11 +594,11 @@ function fs(n, t) {
|
|
|
594
594
|
function us(n, t) {
|
|
595
595
|
return Math.ceil(x(n, t));
|
|
596
596
|
}
|
|
597
|
-
function z(n, t,
|
|
598
|
-
if (n >= t && n <
|
|
597
|
+
function z(n, t, r) {
|
|
598
|
+
if (n >= t && n < r)
|
|
599
599
|
return n;
|
|
600
|
-
const
|
|
601
|
-
return ((n - t) %
|
|
600
|
+
const s = r - t;
|
|
601
|
+
return ((n - t) % s + s) % s + t;
|
|
602
602
|
}
|
|
603
603
|
const E = {
|
|
604
604
|
UNKNOWN: 0,
|
|
@@ -610,16 +610,16 @@ const E = {
|
|
|
610
610
|
};
|
|
611
611
|
function hs(n) {
|
|
612
612
|
const t = In();
|
|
613
|
-
for (let
|
|
614
|
-
st(t, n[
|
|
613
|
+
for (let r = 0, s = n.length; r < s; ++r)
|
|
614
|
+
st(t, n[r]);
|
|
615
615
|
return t;
|
|
616
616
|
}
|
|
617
|
-
function nt(n, t,
|
|
618
|
-
const
|
|
619
|
-
return q(
|
|
617
|
+
function nt(n, t, r) {
|
|
618
|
+
const s = Math.min.apply(null, n), e = Math.min.apply(null, t), i = Math.max.apply(null, n), o = Math.max.apply(null, t);
|
|
619
|
+
return q(s, e, i, o, r);
|
|
620
620
|
}
|
|
621
|
-
function gs(n, t,
|
|
622
|
-
return
|
|
621
|
+
function gs(n, t, r) {
|
|
622
|
+
return r ? (r[0] = n[0] - t, r[1] = n[1] - t, r[2] = n[2] + t, r[3] = n[3] + t, r) : [
|
|
623
623
|
n[0] - t,
|
|
624
624
|
n[1] - t,
|
|
625
625
|
n[2] + t,
|
|
@@ -629,9 +629,9 @@ function gs(n, t, s) {
|
|
|
629
629
|
function ds(n, t) {
|
|
630
630
|
return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n.slice();
|
|
631
631
|
}
|
|
632
|
-
function Es(n, t,
|
|
633
|
-
let
|
|
634
|
-
return t < n[0] ?
|
|
632
|
+
function Es(n, t, r) {
|
|
633
|
+
let s, e;
|
|
634
|
+
return t < n[0] ? s = n[0] - t : n[2] < t ? s = t - n[2] : s = 0, r < n[1] ? e = n[1] - r : n[3] < r ? e = r - n[3] : e = 0, s * s + e * e;
|
|
635
635
|
}
|
|
636
636
|
function Ps(n, t) {
|
|
637
637
|
return tt(n, t[0], t[1]);
|
|
@@ -639,32 +639,32 @@ function Ps(n, t) {
|
|
|
639
639
|
function _s(n, t) {
|
|
640
640
|
return n[0] <= t[0] && t[2] <= n[2] && n[1] <= t[1] && t[3] <= n[3];
|
|
641
641
|
}
|
|
642
|
-
function tt(n, t,
|
|
643
|
-
return n[0] <= t && t <= n[2] && n[1] <=
|
|
642
|
+
function tt(n, t, r) {
|
|
643
|
+
return n[0] <= t && t <= n[2] && n[1] <= r && r <= n[3];
|
|
644
644
|
}
|
|
645
645
|
function dn(n, t) {
|
|
646
|
-
const
|
|
646
|
+
const r = n[0], s = n[1], e = n[2], i = n[3], o = t[0], a = t[1];
|
|
647
647
|
let c = E.UNKNOWN;
|
|
648
|
-
return o <
|
|
648
|
+
return o < r ? c = c | E.LEFT : o > e && (c = c | E.RIGHT), a < s ? c = c | E.BELOW : a > i && (c = c | E.ABOVE), c === E.UNKNOWN && (c = E.INTERSECTING), c;
|
|
649
649
|
}
|
|
650
650
|
function In() {
|
|
651
651
|
return [1 / 0, 1 / 0, -1 / 0, -1 / 0];
|
|
652
652
|
}
|
|
653
|
-
function q(n, t, s, e
|
|
654
|
-
return
|
|
653
|
+
function q(n, t, r, s, e) {
|
|
654
|
+
return e ? (e[0] = n, e[1] = t, e[2] = r, e[3] = s, e) : [n, t, r, s];
|
|
655
655
|
}
|
|
656
656
|
function nn(n) {
|
|
657
657
|
return q(1 / 0, 1 / 0, -1 / 0, -1 / 0, n);
|
|
658
658
|
}
|
|
659
659
|
function ms(n, t) {
|
|
660
|
-
const
|
|
661
|
-
return q(s,
|
|
660
|
+
const r = n[0], s = n[1];
|
|
661
|
+
return q(r, s, r, s, t);
|
|
662
662
|
}
|
|
663
|
-
function
|
|
664
|
-
const i = nn(
|
|
665
|
-
return
|
|
663
|
+
function ws(n, t, r, s, e) {
|
|
664
|
+
const i = nn(e);
|
|
665
|
+
return rt(i, n, t, r, s);
|
|
666
666
|
}
|
|
667
|
-
function
|
|
667
|
+
function Ms(n, t) {
|
|
668
668
|
return n[0] == t[0] && n[2] == t[2] && n[1] == t[1] && n[3] == t[3];
|
|
669
669
|
}
|
|
670
670
|
function Ts(n, t) {
|
|
@@ -673,19 +673,19 @@ function Ts(n, t) {
|
|
|
673
673
|
function st(n, t) {
|
|
674
674
|
t[0] < n[0] && (n[0] = t[0]), t[0] > n[2] && (n[2] = t[0]), t[1] < n[1] && (n[1] = t[1]), t[1] > n[3] && (n[3] = t[1]);
|
|
675
675
|
}
|
|
676
|
-
function
|
|
677
|
-
for (;
|
|
678
|
-
|
|
676
|
+
function rt(n, t, r, s, e) {
|
|
677
|
+
for (; r < s; r += e)
|
|
678
|
+
et(n, t[r], t[r + 1]);
|
|
679
679
|
return n;
|
|
680
680
|
}
|
|
681
|
-
function
|
|
682
|
-
n[0] = Math.min(n[0], t), n[1] = Math.min(n[1],
|
|
681
|
+
function et(n, t, r) {
|
|
682
|
+
n[0] = Math.min(n[0], t), n[1] = Math.min(n[1], r), n[2] = Math.max(n[2], t), n[3] = Math.max(n[3], r);
|
|
683
683
|
}
|
|
684
|
-
function
|
|
685
|
-
let
|
|
686
|
-
return
|
|
684
|
+
function ys(n, t) {
|
|
685
|
+
let r;
|
|
686
|
+
return r = t(On(n)), r || (r = t(Gn(n)), r) || (r = t(An(n)), r) || (r = t(Ln(n)), r) ? r : !1;
|
|
687
687
|
}
|
|
688
|
-
function
|
|
688
|
+
function vs(n) {
|
|
689
689
|
let t = 0;
|
|
690
690
|
return Un(n) || (t = O(n) * at(n)), t;
|
|
691
691
|
}
|
|
@@ -698,37 +698,37 @@ function Gn(n) {
|
|
|
698
698
|
function it(n) {
|
|
699
699
|
return [(n[0] + n[2]) / 2, (n[1] + n[3]) / 2];
|
|
700
700
|
}
|
|
701
|
-
function
|
|
702
|
-
let
|
|
701
|
+
function Ss(n, t) {
|
|
702
|
+
let r;
|
|
703
703
|
if (t === "bottom-left")
|
|
704
|
-
|
|
704
|
+
r = On(n);
|
|
705
705
|
else if (t === "bottom-right")
|
|
706
|
-
|
|
706
|
+
r = Gn(n);
|
|
707
707
|
else if (t === "top-left")
|
|
708
|
-
|
|
708
|
+
r = Ln(n);
|
|
709
709
|
else if (t === "top-right")
|
|
710
|
-
|
|
710
|
+
r = An(n);
|
|
711
711
|
else
|
|
712
712
|
throw new Error("Invalid corner");
|
|
713
|
-
return
|
|
713
|
+
return r;
|
|
714
714
|
}
|
|
715
|
-
function
|
|
715
|
+
function ps(n, t, r, s, e) {
|
|
716
716
|
const [i, o, a, c, l, f, h, u] = ot(
|
|
717
717
|
n,
|
|
718
718
|
t,
|
|
719
|
-
|
|
720
|
-
|
|
719
|
+
r,
|
|
720
|
+
s
|
|
721
721
|
);
|
|
722
722
|
return q(
|
|
723
723
|
Math.min(i, a, l, h),
|
|
724
724
|
Math.min(o, c, f, u),
|
|
725
725
|
Math.max(i, a, l, h),
|
|
726
726
|
Math.max(o, c, f, u),
|
|
727
|
-
|
|
727
|
+
e
|
|
728
728
|
);
|
|
729
729
|
}
|
|
730
|
-
function ot(n, t,
|
|
731
|
-
const
|
|
730
|
+
function ot(n, t, r, s) {
|
|
731
|
+
const e = t * s[0] / 2, i = t * s[1] / 2, o = Math.cos(r), a = Math.sin(r), c = e * o, l = e * a, f = i * o, h = i * a, u = n[0], g = n[1];
|
|
732
732
|
return [
|
|
733
733
|
u - c + h,
|
|
734
734
|
g - l - f,
|
|
@@ -745,9 +745,9 @@ function ot(n, t, s, e) {
|
|
|
745
745
|
function at(n) {
|
|
746
746
|
return n[3] - n[1];
|
|
747
747
|
}
|
|
748
|
-
function Rs(n, t,
|
|
749
|
-
const
|
|
750
|
-
return ct(n, t) ? (n[0] > t[0] ?
|
|
748
|
+
function Rs(n, t, r) {
|
|
749
|
+
const s = r || In();
|
|
750
|
+
return ct(n, t) ? (n[0] > t[0] ? s[0] = n[0] : s[0] = t[0], n[1] > t[1] ? s[1] = n[1] : s[1] = t[1], n[2] < t[2] ? s[2] = n[2] : s[2] = t[2], n[3] < t[3] ? s[3] = n[3] : s[3] = t[3]) : nn(s), s;
|
|
751
751
|
}
|
|
752
752
|
function Ln(n) {
|
|
753
753
|
return [n[0], n[3]];
|
|
@@ -768,68 +768,83 @@ function Cs(n, t) {
|
|
|
768
768
|
return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n;
|
|
769
769
|
}
|
|
770
770
|
function Is(n, t) {
|
|
771
|
-
const
|
|
772
|
-
n[0] -=
|
|
773
|
-
}
|
|
774
|
-
function Os(n, t,
|
|
775
|
-
let
|
|
776
|
-
const
|
|
777
|
-
if (
|
|
778
|
-
|
|
771
|
+
const r = (n[2] - n[0]) / 2 * (t - 1), s = (n[3] - n[1]) / 2 * (t - 1);
|
|
772
|
+
n[0] -= r, n[2] += r, n[1] -= s, n[3] += s;
|
|
773
|
+
}
|
|
774
|
+
function Os(n, t, r) {
|
|
775
|
+
let s = !1;
|
|
776
|
+
const e = dn(n, t), i = dn(n, r);
|
|
777
|
+
if (e === E.INTERSECTING || i === E.INTERSECTING)
|
|
778
|
+
s = !0;
|
|
779
779
|
else {
|
|
780
|
-
const o = n[0], a = n[1], c = n[2], l = n[3], f = t[0], h = t[1], u =
|
|
780
|
+
const o = n[0], a = n[1], c = n[2], l = n[3], f = t[0], h = t[1], u = r[0], g = r[1], d = (g - h) / (u - f);
|
|
781
781
|
let _, m;
|
|
782
|
-
i & E.ABOVE && !(
|
|
782
|
+
i & E.ABOVE && !(e & E.ABOVE) && (_ = u - (g - l) / d, s = _ >= o && _ <= c), !s && i & E.RIGHT && !(e & E.RIGHT) && (m = g - (u - c) * d, s = m >= a && m <= l), !s && i & E.BELOW && !(e & E.BELOW) && (_ = u - (g - a) / d, s = _ >= o && _ <= c), !s && i & E.LEFT && !(e & E.LEFT) && (m = g - (u - o) * d, s = m >= a && m <= l);
|
|
783
783
|
}
|
|
784
|
-
return
|
|
784
|
+
return s;
|
|
785
785
|
}
|
|
786
|
-
function lt(n, t,
|
|
786
|
+
function lt(n, t, r, s) {
|
|
787
787
|
if (Un(n))
|
|
788
|
-
return nn(
|
|
789
|
-
let
|
|
790
|
-
|
|
791
|
-
n[0],
|
|
792
|
-
|
|
793
|
-
|
|
794
|
-
|
|
795
|
-
|
|
796
|
-
|
|
797
|
-
|
|
798
|
-
|
|
799
|
-
|
|
788
|
+
return nn(r);
|
|
789
|
+
let e = [];
|
|
790
|
+
if (s > 1) {
|
|
791
|
+
const a = n[2] - n[0], c = n[3] - n[1];
|
|
792
|
+
for (let l = 0; l < s; ++l)
|
|
793
|
+
e.push(
|
|
794
|
+
n[0] + a * l / s,
|
|
795
|
+
n[1],
|
|
796
|
+
n[2],
|
|
797
|
+
n[1] + c * l / s,
|
|
798
|
+
n[2] - a * l / s,
|
|
799
|
+
n[3],
|
|
800
|
+
n[0],
|
|
801
|
+
n[3] - c * l / s
|
|
802
|
+
);
|
|
803
|
+
} else
|
|
804
|
+
e = [
|
|
805
|
+
n[0],
|
|
806
|
+
n[1],
|
|
807
|
+
n[2],
|
|
808
|
+
n[1],
|
|
809
|
+
n[2],
|
|
810
|
+
n[3],
|
|
811
|
+
n[0],
|
|
812
|
+
n[3]
|
|
813
|
+
];
|
|
814
|
+
t(e, e, 2);
|
|
800
815
|
const i = [], o = [];
|
|
801
|
-
for (let a = 0, c =
|
|
802
|
-
i.push(
|
|
803
|
-
return nt(i, o,
|
|
816
|
+
for (let a = 0, c = e.length; a < c; a += 2)
|
|
817
|
+
i.push(e[a]), o.push(e[a + 1]);
|
|
818
|
+
return nt(i, o, r);
|
|
804
819
|
}
|
|
805
820
|
function ft(n, t) {
|
|
806
|
-
const
|
|
807
|
-
if (t.canWrapX() && (
|
|
808
|
-
const
|
|
809
|
-
(
|
|
810
|
-
) *
|
|
821
|
+
const r = t.getExtent(), s = it(n);
|
|
822
|
+
if (t.canWrapX() && (s[0] < r[0] || s[0] >= r[2])) {
|
|
823
|
+
const e = O(r), o = Math.floor(
|
|
824
|
+
(s[0] - r[0]) / e
|
|
825
|
+
) * e;
|
|
811
826
|
n[0] -= o, n[2] -= o;
|
|
812
827
|
}
|
|
813
828
|
return n;
|
|
814
829
|
}
|
|
815
|
-
function Gs(n, t,
|
|
830
|
+
function Gs(n, t, r) {
|
|
816
831
|
if (t.canWrapX()) {
|
|
817
|
-
const
|
|
832
|
+
const s = t.getExtent();
|
|
818
833
|
if (!isFinite(n[0]) || !isFinite(n[2]))
|
|
819
|
-
return [[
|
|
834
|
+
return [[s[0], n[1], s[2], n[3]]];
|
|
820
835
|
ft(n, t);
|
|
821
|
-
const
|
|
822
|
-
if (O(n) >
|
|
823
|
-
return [[
|
|
824
|
-
if (n[0] <
|
|
836
|
+
const e = O(s);
|
|
837
|
+
if (O(n) > e && !r)
|
|
838
|
+
return [[s[0], n[1], s[2], n[3]]];
|
|
839
|
+
if (n[0] < s[0])
|
|
825
840
|
return [
|
|
826
|
-
[n[0] +
|
|
827
|
-
[
|
|
841
|
+
[n[0] + e, n[1], s[2], n[3]],
|
|
842
|
+
[s[0], n[1], n[2], n[3]]
|
|
828
843
|
];
|
|
829
|
-
if (n[2] >
|
|
844
|
+
if (n[2] > s[2])
|
|
830
845
|
return [
|
|
831
|
-
[n[0], n[1],
|
|
832
|
-
[
|
|
846
|
+
[n[0], n[1], s[2], n[3]],
|
|
847
|
+
[s[0], n[1], n[2] - e, n[3]]
|
|
833
848
|
];
|
|
834
849
|
}
|
|
835
850
|
return [n];
|
|
@@ -838,29 +853,29 @@ function Ls(n, t) {
|
|
|
838
853
|
return n[0] += +t[0], n[1] += +t[1], n;
|
|
839
854
|
}
|
|
840
855
|
function ut(n, t) {
|
|
841
|
-
const
|
|
856
|
+
const r = n[0], s = n[1], e = t[0], i = t[1], o = e[0], a = e[1], c = i[0], l = i[1], f = c - o, h = l - a, u = f === 0 && h === 0 ? 0 : (f * (r - o) + h * (s - a)) / (f * f + h * h || 0);
|
|
842
857
|
let g, d;
|
|
843
858
|
return u <= 0 ? (g = o, d = a) : u >= 1 ? (g = c, d = l) : (g = o + u * f, d = a + u * h), [g, d];
|
|
844
859
|
}
|
|
845
860
|
function ht(n, t) {
|
|
846
|
-
let
|
|
847
|
-
for (let
|
|
848
|
-
if (n[
|
|
849
|
-
|
|
861
|
+
let r = !0;
|
|
862
|
+
for (let s = n.length - 1; s >= 0; --s)
|
|
863
|
+
if (n[s] != t[s]) {
|
|
864
|
+
r = !1;
|
|
850
865
|
break;
|
|
851
866
|
}
|
|
852
|
-
return
|
|
867
|
+
return r;
|
|
853
868
|
}
|
|
854
869
|
function As(n, t) {
|
|
855
|
-
const
|
|
856
|
-
return n[0] =
|
|
870
|
+
const r = Math.cos(t), s = Math.sin(t), e = n[0] * r - n[1] * s, i = n[1] * r + n[0] * s;
|
|
871
|
+
return n[0] = e, n[1] = i, n;
|
|
857
872
|
}
|
|
858
873
|
function Us(n, t) {
|
|
859
874
|
return n[0] *= t, n[1] *= t, n;
|
|
860
875
|
}
|
|
861
876
|
function bn(n, t) {
|
|
862
|
-
const
|
|
863
|
-
return
|
|
877
|
+
const r = n[0] - t[0], s = n[1] - t[1];
|
|
878
|
+
return r * r + s * s;
|
|
864
879
|
}
|
|
865
880
|
function bs(n, t) {
|
|
866
881
|
return Math.sqrt(bn(n, t));
|
|
@@ -870,40 +885,40 @@ function Ns(n, t) {
|
|
|
870
885
|
}
|
|
871
886
|
function Fs(n, t) {
|
|
872
887
|
if (t.canWrapX()) {
|
|
873
|
-
const
|
|
874
|
-
|
|
888
|
+
const r = O(t.getExtent()), s = gt(n, t, r);
|
|
889
|
+
s && (n[0] -= s * r);
|
|
875
890
|
}
|
|
876
891
|
return n;
|
|
877
892
|
}
|
|
878
|
-
function gt(n, t,
|
|
879
|
-
const
|
|
880
|
-
let
|
|
881
|
-
return t.canWrapX() && (n[0] <
|
|
882
|
-
(n[0] -
|
|
883
|
-
)),
|
|
893
|
+
function gt(n, t, r) {
|
|
894
|
+
const s = t.getExtent();
|
|
895
|
+
let e = 0;
|
|
896
|
+
return t.canWrapX() && (n[0] < s[0] || n[0] > s[2]) && (r = r || O(s), e = Math.floor(
|
|
897
|
+
(n[0] - s[0]) / r
|
|
898
|
+
)), e;
|
|
884
899
|
}
|
|
885
900
|
const Nn = 63710088e-1;
|
|
886
|
-
function En(n, t,
|
|
887
|
-
|
|
888
|
-
const
|
|
889
|
-
return 2 *
|
|
901
|
+
function En(n, t, r) {
|
|
902
|
+
r = r || Nn;
|
|
903
|
+
const s = w(n[1]), e = w(t[1]), i = (e - s) / 2, o = w(t[0] - n[0]) / 2, a = Math.sin(i) * Math.sin(i) + Math.sin(o) * Math.sin(o) * Math.cos(s) * Math.cos(e);
|
|
904
|
+
return 2 * r * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));
|
|
890
905
|
}
|
|
891
906
|
function F(n, t) {
|
|
892
|
-
let
|
|
893
|
-
const
|
|
894
|
-
let
|
|
895
|
-
for (let o = 0; o <
|
|
907
|
+
let r = 0;
|
|
908
|
+
const s = n.length;
|
|
909
|
+
let e = n[s - 1][0], i = n[s - 1][1];
|
|
910
|
+
for (let o = 0; o < s; o++) {
|
|
896
911
|
const a = n[o][0], c = n[o][1];
|
|
897
|
-
|
|
912
|
+
r += w(a - e) * (2 + Math.sin(w(i)) + Math.sin(w(c))), e = a, i = c;
|
|
898
913
|
}
|
|
899
|
-
return
|
|
914
|
+
return r * t * t / 2;
|
|
900
915
|
}
|
|
901
916
|
function dt(n, t) {
|
|
902
917
|
t = t || {};
|
|
903
|
-
const
|
|
904
|
-
|
|
918
|
+
const r = t.radius || Nn, s = t.projection || "EPSG:3857", e = n.getType();
|
|
919
|
+
e !== "GeometryCollection" && (n = n.clone().transform(s, "EPSG:4326"));
|
|
905
920
|
let i = 0, o, a, c, l, f, h;
|
|
906
|
-
switch (
|
|
921
|
+
switch (e) {
|
|
907
922
|
case "Point":
|
|
908
923
|
case "MultiPoint":
|
|
909
924
|
case "LineString":
|
|
@@ -912,15 +927,15 @@ function dt(n, t) {
|
|
|
912
927
|
break;
|
|
913
928
|
case "Polygon": {
|
|
914
929
|
for (o = /** @type {import("./geom/Polygon.js").default} */
|
|
915
|
-
n.getCoordinates(), i = Math.abs(F(o[0],
|
|
916
|
-
i -= Math.abs(F(o[c],
|
|
930
|
+
n.getCoordinates(), i = Math.abs(F(o[0], r)), c = 1, l = o.length; c < l; ++c)
|
|
931
|
+
i -= Math.abs(F(o[c], r));
|
|
917
932
|
break;
|
|
918
933
|
}
|
|
919
934
|
case "MultiPolygon": {
|
|
920
935
|
for (o = /** @type {import("./geom/SimpleGeometry.js").default} */
|
|
921
936
|
n.getCoordinates(), c = 0, l = o.length; c < l; ++c)
|
|
922
|
-
for (a = o[c], i += Math.abs(F(a[0],
|
|
923
|
-
i -= Math.abs(F(a[f],
|
|
937
|
+
for (a = o[c], i += Math.abs(F(a[0], r)), f = 1, h = a.length; f < h; ++f)
|
|
938
|
+
i -= Math.abs(F(a[f], r));
|
|
924
939
|
break;
|
|
925
940
|
}
|
|
926
941
|
case "GeometryCollection": {
|
|
@@ -933,7 +948,7 @@ function dt(n, t) {
|
|
|
933
948
|
break;
|
|
934
949
|
}
|
|
935
950
|
default:
|
|
936
|
-
throw new Error("Unsupported geometry type: " +
|
|
951
|
+
throw new Error("Unsupported geometry type: " + e);
|
|
937
952
|
}
|
|
938
953
|
return i;
|
|
939
954
|
}
|
|
@@ -1093,8 +1108,8 @@ class R extends tn {
|
|
|
1093
1108
|
extent: Pt,
|
|
1094
1109
|
global: !0,
|
|
1095
1110
|
worldExtent: _t,
|
|
1096
|
-
getPointResolution: function(
|
|
1097
|
-
return
|
|
1111
|
+
getPointResolution: function(r, s) {
|
|
1112
|
+
return r / Math.cosh(s[1] / U);
|
|
1098
1113
|
}
|
|
1099
1114
|
});
|
|
1100
1115
|
}
|
|
@@ -1107,35 +1122,35 @@ const Pn = [
|
|
|
1107
1122
|
new R("http://www.opengis.net/def/crs/EPSG/0/3857"),
|
|
1108
1123
|
new R("http://www.opengis.net/gml/srs/epsg.xml#3857")
|
|
1109
1124
|
];
|
|
1110
|
-
function mt(n, t,
|
|
1111
|
-
const
|
|
1112
|
-
|
|
1113
|
-
for (let i = 0; i <
|
|
1125
|
+
function mt(n, t, r, s) {
|
|
1126
|
+
const e = n.length;
|
|
1127
|
+
r = r > 1 ? r : 2, s = s ?? r, t === void 0 && (r > 2 ? t = n.slice() : t = new Array(e));
|
|
1128
|
+
for (let i = 0; i < e; i += s) {
|
|
1114
1129
|
t[i] = C * n[i] / 180;
|
|
1115
1130
|
let o = U * Math.log(Math.tan(Math.PI * (+n[i + 1] + 90) / 360));
|
|
1116
1131
|
o > X ? o = X : o < -X && (o = -X), t[i + 1] = o;
|
|
1117
1132
|
}
|
|
1118
1133
|
return t;
|
|
1119
1134
|
}
|
|
1120
|
-
function
|
|
1121
|
-
const
|
|
1122
|
-
|
|
1123
|
-
for (let i = 0; i <
|
|
1135
|
+
function wt(n, t, r, s) {
|
|
1136
|
+
const e = n.length;
|
|
1137
|
+
r = r > 1 ? r : 2, s = s ?? r, t === void 0 && (r > 2 ? t = n.slice() : t = new Array(e));
|
|
1138
|
+
for (let i = 0; i < e; i += s)
|
|
1124
1139
|
t[i] = 180 * n[i] / C, t[i + 1] = 360 * Math.atan(Math.exp(n[i + 1] / U)) / Math.PI - 90;
|
|
1125
1140
|
return t;
|
|
1126
1141
|
}
|
|
1127
|
-
const
|
|
1128
|
-
class
|
|
1142
|
+
const Mt = 6378137, _n = [-180, -90, 180, 90], Tt = Math.PI * Mt / 180;
|
|
1143
|
+
class v extends tn {
|
|
1129
1144
|
/**
|
|
1130
1145
|
* @param {string} code Code.
|
|
1131
1146
|
* @param {string} [axisOrientation] Axis orientation.
|
|
1132
1147
|
*/
|
|
1133
|
-
constructor(t,
|
|
1148
|
+
constructor(t, r) {
|
|
1134
1149
|
super({
|
|
1135
1150
|
code: t,
|
|
1136
1151
|
units: "degrees",
|
|
1137
1152
|
extent: _n,
|
|
1138
|
-
axisOrientation:
|
|
1153
|
+
axisOrientation: r,
|
|
1139
1154
|
global: !0,
|
|
1140
1155
|
metersPerUnit: Tt,
|
|
1141
1156
|
worldExtent: _n
|
|
@@ -1143,45 +1158,45 @@ class y extends tn {
|
|
|
1143
1158
|
}
|
|
1144
1159
|
}
|
|
1145
1160
|
const mn = [
|
|
1146
|
-
new
|
|
1147
|
-
new
|
|
1148
|
-
new
|
|
1149
|
-
new
|
|
1150
|
-
new
|
|
1151
|
-
new
|
|
1152
|
-
new
|
|
1161
|
+
new v("CRS:84"),
|
|
1162
|
+
new v("EPSG:4326", "neu"),
|
|
1163
|
+
new v("urn:ogc:def:crs:OGC:1.3:CRS84"),
|
|
1164
|
+
new v("urn:ogc:def:crs:OGC:2:84"),
|
|
1165
|
+
new v("http://www.opengis.net/def/crs/OGC/1.3/CRS84"),
|
|
1166
|
+
new v("http://www.opengis.net/gml/srs/epsg.xml#4326", "neu"),
|
|
1167
|
+
new v("http://www.opengis.net/def/crs/EPSG/0/4326", "neu")
|
|
1153
1168
|
];
|
|
1154
1169
|
let J = {};
|
|
1155
|
-
function
|
|
1170
|
+
function yt(n) {
|
|
1156
1171
|
return J[n] || J[n.replace(/urn:(x-)?ogc:def:crs:EPSG:(.*:)?(\w+)$/, "EPSG:$3")] || null;
|
|
1157
1172
|
}
|
|
1158
|
-
function
|
|
1173
|
+
function vt(n, t) {
|
|
1159
1174
|
J[n] = t;
|
|
1160
1175
|
}
|
|
1161
1176
|
let I = {};
|
|
1162
|
-
function
|
|
1163
|
-
const
|
|
1164
|
-
|
|
1177
|
+
function p(n, t, r) {
|
|
1178
|
+
const s = n.getCode(), e = t.getCode();
|
|
1179
|
+
s in I || (I[s] = {}), I[s][e] = r;
|
|
1165
1180
|
}
|
|
1166
1181
|
function K(n, t) {
|
|
1167
1182
|
return n in I && t in I[n] ? I[n][t] : null;
|
|
1168
1183
|
}
|
|
1169
|
-
const W = 0.9996, P = 669438e-8, B = P * P, Y = B * P,
|
|
1170
|
-
function Lt(n, t,
|
|
1171
|
-
const
|
|
1172
|
-
let H = (
|
|
1184
|
+
const W = 0.9996, P = 669438e-8, B = P * P, Y = B * P, S = P / (1 - P), wn = Math.sqrt(1 - P), G = (1 - wn) / (1 + wn), Fn = G * G, sn = Fn * G, rn = sn * G, Xn = rn * G, Wn = 1 - P / 4 - 3 * B / 64 - 5 * Y / 256, St = 3 * P / 8 + 3 * B / 32 + 45 * Y / 1024, pt = 15 * B / 256 + 45 * Y / 1024, Rt = 35 * Y / 3072, Ct = 3 / 2 * G - 27 / 32 * sn + 269 / 512 * Xn, It = 21 / 16 * Fn - 55 / 32 * rn, Ot = 151 / 96 * sn - 417 / 128 * Xn, Gt = 1097 / 512 * rn, D = 6378137;
|
|
1185
|
+
function Lt(n, t, r) {
|
|
1186
|
+
const s = n - 5e5, o = (r.north ? t : t - 1e7) / W / (D * Wn), a = o + Ct * Math.sin(2 * o) + It * Math.sin(4 * o) + Ot * Math.sin(6 * o) + Gt * Math.sin(8 * o), c = Math.sin(a), l = c * c, f = Math.cos(a), h = c / f, u = h * h, g = u * u, d = 1 - P * l, _ = Math.sqrt(1 - P * l), m = D / _, b = (1 - P) / d, T = S * f ** 2, L = T * T, y = s / (m * W), N = y * y, A = N * y, an = A * y, cn = an * y, Bn = cn * y, Yn = a - h / b * (N / 2 - an / 24 * (5 + 3 * u + 10 * T - 4 * L - 9 * S)) + Bn / 720 * (61 + 90 * u + 298 * T + 45 * g - 252 * S - 3 * L);
|
|
1187
|
+
let H = (y - A / 6 * (1 + 2 * u + T) + cn / 120 * (5 - 2 * T + 28 * u - 3 * L + 8 * S + 24 * g)) / f;
|
|
1173
1188
|
return H = z(
|
|
1174
|
-
H +
|
|
1189
|
+
H + w(Dn(r.number)),
|
|
1175
1190
|
-Math.PI,
|
|
1176
1191
|
Math.PI
|
|
1177
1192
|
), [gn(H), gn(Yn)];
|
|
1178
1193
|
}
|
|
1179
|
-
const
|
|
1180
|
-
function bt(n, t,
|
|
1181
|
-
n = z(n, At, Ut), t <
|
|
1182
|
-
const
|
|
1183
|
-
let A = W * (
|
|
1184
|
-
return
|
|
1194
|
+
const Mn = -80, Tn = 84, At = -180, Ut = 180;
|
|
1195
|
+
function bt(n, t, r) {
|
|
1196
|
+
n = z(n, At, Ut), t < Mn ? t = Mn : t > Tn && (t = Tn);
|
|
1197
|
+
const s = w(t), e = Math.sin(s), i = Math.cos(s), o = e / i, a = o * o, c = a * a, l = w(n), f = Dn(r.number), h = w(f), u = D / Math.sqrt(1 - P * e ** 2), g = S * i ** 2, d = i * z(l - h, -Math.PI, Math.PI), _ = d * d, m = _ * d, b = m * d, T = b * d, L = T * d, y = D * (Wn * s - St * Math.sin(2 * s) + pt * Math.sin(4 * s) - Rt * Math.sin(6 * s)), N = W * u * (d + m / 6 * (1 - a + g) + T / 120 * (5 - 18 * a + c + 72 * g - 58 * S)) + 5e5;
|
|
1198
|
+
let A = W * (y + u * o * (_ / 2 + b / 24 * (5 - a + 9 * g + 4 * g ** 2) + L / 720 * (61 - 58 * a + c + 600 * g - 330 * S)));
|
|
1199
|
+
return r.north || (A += 1e7), [N, A];
|
|
1185
1200
|
}
|
|
1186
1201
|
function Dn(n) {
|
|
1187
1202
|
return (n - 1) * 6 - 180 + 3;
|
|
@@ -1193,8 +1208,8 @@ const Nt = [
|
|
|
1193
1208
|
];
|
|
1194
1209
|
function $n(n) {
|
|
1195
1210
|
let t = 0;
|
|
1196
|
-
for (const
|
|
1197
|
-
const i = n.match(
|
|
1211
|
+
for (const e of Nt) {
|
|
1212
|
+
const i = n.match(e);
|
|
1198
1213
|
if (i) {
|
|
1199
1214
|
t = parseInt(i[1]);
|
|
1200
1215
|
break;
|
|
@@ -1202,18 +1217,18 @@ function $n(n) {
|
|
|
1202
1217
|
}
|
|
1203
1218
|
if (!t)
|
|
1204
1219
|
return null;
|
|
1205
|
-
let
|
|
1206
|
-
return t > 32700 && t < 32761 ?
|
|
1220
|
+
let r = 0, s = !1;
|
|
1221
|
+
return t > 32700 && t < 32761 ? r = t - 32700 : t > 32600 && t < 32661 && (s = !0, r = t - 32600), r ? { number: r, north: s } : null;
|
|
1207
1222
|
}
|
|
1208
|
-
function
|
|
1209
|
-
return function(s, e,
|
|
1210
|
-
const o =
|
|
1211
|
-
|
|
1223
|
+
function yn(n, t) {
|
|
1224
|
+
return function(r, s, e, i) {
|
|
1225
|
+
const o = r.length;
|
|
1226
|
+
e = e > 1 ? e : 2, i = i ?? e, s || (e > 2 ? s = r.slice() : s = new Array(o));
|
|
1212
1227
|
for (let a = 0; a < o; a += i) {
|
|
1213
|
-
const c =
|
|
1214
|
-
|
|
1228
|
+
const c = r[a], l = r[a + 1], f = n(c, l, t);
|
|
1229
|
+
s[a] = f[0], s[a + 1] = f[1];
|
|
1215
1230
|
}
|
|
1216
|
-
return
|
|
1231
|
+
return s;
|
|
1217
1232
|
};
|
|
1218
1233
|
}
|
|
1219
1234
|
function Ft(n) {
|
|
@@ -1222,8 +1237,8 @@ function Ft(n) {
|
|
|
1222
1237
|
function Xt(n) {
|
|
1223
1238
|
const t = $n(n.getCode());
|
|
1224
1239
|
return t ? {
|
|
1225
|
-
forward:
|
|
1226
|
-
inverse:
|
|
1240
|
+
forward: yn(bt, t),
|
|
1241
|
+
inverse: yn(Lt, t)
|
|
1227
1242
|
} : null;
|
|
1228
1243
|
}
|
|
1229
1244
|
const Wt = [Xt], Dt = [Ft];
|
|
@@ -1231,96 +1246,96 @@ let Q = !0;
|
|
|
1231
1246
|
function $t(n) {
|
|
1232
1247
|
Q = !1;
|
|
1233
1248
|
}
|
|
1234
|
-
function
|
|
1249
|
+
function en(n, t) {
|
|
1235
1250
|
if (t !== void 0) {
|
|
1236
|
-
for (let
|
|
1237
|
-
t[
|
|
1251
|
+
for (let r = 0, s = n.length; r < s; ++r)
|
|
1252
|
+
t[r] = n[r];
|
|
1238
1253
|
t = t;
|
|
1239
1254
|
} else
|
|
1240
1255
|
t = n.slice();
|
|
1241
1256
|
return t;
|
|
1242
1257
|
}
|
|
1243
1258
|
function Z(n) {
|
|
1244
|
-
|
|
1259
|
+
vt(n.getCode(), n), p(n, n, en);
|
|
1245
1260
|
}
|
|
1246
1261
|
function qt(n) {
|
|
1247
1262
|
n.forEach(Z);
|
|
1248
1263
|
}
|
|
1249
|
-
function
|
|
1264
|
+
function M(n) {
|
|
1250
1265
|
if (typeof n != "string")
|
|
1251
1266
|
return n;
|
|
1252
|
-
const t =
|
|
1267
|
+
const t = yt(n);
|
|
1253
1268
|
if (t)
|
|
1254
1269
|
return t;
|
|
1255
|
-
for (const
|
|
1256
|
-
const
|
|
1257
|
-
if (
|
|
1258
|
-
return
|
|
1270
|
+
for (const r of Dt) {
|
|
1271
|
+
const s = r(n);
|
|
1272
|
+
if (s)
|
|
1273
|
+
return s;
|
|
1259
1274
|
}
|
|
1260
1275
|
return null;
|
|
1261
1276
|
}
|
|
1262
|
-
function Xs(n, t,
|
|
1263
|
-
n =
|
|
1264
|
-
let
|
|
1277
|
+
function Xs(n, t, r, s) {
|
|
1278
|
+
n = M(n);
|
|
1279
|
+
let e;
|
|
1265
1280
|
const i = n.getPointResolutionFunc();
|
|
1266
1281
|
if (i) {
|
|
1267
|
-
if (
|
|
1282
|
+
if (e = i(t, r), s && s !== n.getUnits()) {
|
|
1268
1283
|
const o = n.getMetersPerUnit();
|
|
1269
|
-
o && (
|
|
1284
|
+
o && (e = e * o / k[s]);
|
|
1270
1285
|
}
|
|
1271
1286
|
} else {
|
|
1272
1287
|
const o = n.getUnits();
|
|
1273
|
-
if (o == "degrees" && !
|
|
1274
|
-
|
|
1288
|
+
if (o == "degrees" && !s || s == "degrees")
|
|
1289
|
+
e = t;
|
|
1275
1290
|
else {
|
|
1276
1291
|
const a = on(
|
|
1277
1292
|
n,
|
|
1278
|
-
|
|
1293
|
+
M("EPSG:4326")
|
|
1279
1294
|
);
|
|
1280
1295
|
if (!a && o !== "degrees")
|
|
1281
|
-
|
|
1296
|
+
e = t * n.getMetersPerUnit();
|
|
1282
1297
|
else {
|
|
1283
1298
|
let l = [
|
|
1284
|
-
|
|
1285
|
-
|
|
1286
|
-
|
|
1287
|
-
|
|
1288
|
-
|
|
1289
|
-
|
|
1290
|
-
|
|
1291
|
-
|
|
1299
|
+
r[0] - t / 2,
|
|
1300
|
+
r[1],
|
|
1301
|
+
r[0] + t / 2,
|
|
1302
|
+
r[1],
|
|
1303
|
+
r[0],
|
|
1304
|
+
r[1] - t / 2,
|
|
1305
|
+
r[0],
|
|
1306
|
+
r[1] + t / 2
|
|
1292
1307
|
];
|
|
1293
1308
|
l = a(l, l, 2);
|
|
1294
1309
|
const f = En(l.slice(0, 2), l.slice(2, 4)), h = En(l.slice(4, 6), l.slice(6, 8));
|
|
1295
|
-
|
|
1310
|
+
e = (f + h) / 2;
|
|
1296
1311
|
}
|
|
1297
|
-
const c =
|
|
1298
|
-
c !== void 0 && (
|
|
1312
|
+
const c = s ? k[s] : n.getMetersPerUnit();
|
|
1313
|
+
c !== void 0 && (e /= c);
|
|
1299
1314
|
}
|
|
1300
1315
|
}
|
|
1301
|
-
return
|
|
1316
|
+
return e;
|
|
1302
1317
|
}
|
|
1303
|
-
function
|
|
1318
|
+
function vn(n) {
|
|
1304
1319
|
qt(n), n.forEach(function(t) {
|
|
1305
|
-
n.forEach(function(
|
|
1306
|
-
t !==
|
|
1320
|
+
n.forEach(function(r) {
|
|
1321
|
+
t !== r && p(t, r, en);
|
|
1307
1322
|
});
|
|
1308
1323
|
});
|
|
1309
1324
|
}
|
|
1310
|
-
function Bt(n, t,
|
|
1311
|
-
n.forEach(function(
|
|
1325
|
+
function Bt(n, t, r, s) {
|
|
1326
|
+
n.forEach(function(e) {
|
|
1312
1327
|
t.forEach(function(i) {
|
|
1313
|
-
|
|
1328
|
+
p(e, i, r), p(i, e, s);
|
|
1314
1329
|
});
|
|
1315
1330
|
});
|
|
1316
1331
|
}
|
|
1317
1332
|
function Ws(n, t) {
|
|
1318
|
-
return n ? typeof n == "string" ?
|
|
1333
|
+
return n ? typeof n == "string" ? M(n) : (
|
|
1319
1334
|
/** @type {Projection} */
|
|
1320
1335
|
n
|
|
1321
|
-
) :
|
|
1336
|
+
) : M(t);
|
|
1322
1337
|
}
|
|
1323
|
-
function
|
|
1338
|
+
function Sn(n) {
|
|
1324
1339
|
return (
|
|
1325
1340
|
/**
|
|
1326
1341
|
* @param {Array<number>} input Input.
|
|
@@ -1329,28 +1344,28 @@ function vn(n) {
|
|
|
1329
1344
|
* @param {number} [stride] Stride.
|
|
1330
1345
|
* @return {Array<number>} Output.
|
|
1331
1346
|
*/
|
|
1332
|
-
(function(t, s, e
|
|
1347
|
+
(function(t, r, s, e) {
|
|
1333
1348
|
const i = t.length;
|
|
1334
|
-
|
|
1335
|
-
for (let o = 0; o < i; o +=
|
|
1336
|
-
const a = n(t.slice(o, o +
|
|
1337
|
-
for (let l = 0, f =
|
|
1338
|
-
|
|
1349
|
+
s = s !== void 0 ? s : 2, e = e ?? s, r = r !== void 0 ? r : new Array(i);
|
|
1350
|
+
for (let o = 0; o < i; o += e) {
|
|
1351
|
+
const a = n(t.slice(o, o + s)), c = a.length;
|
|
1352
|
+
for (let l = 0, f = e; l < f; ++l)
|
|
1353
|
+
r[o + l] = l >= c ? t[o + l] : a[l];
|
|
1339
1354
|
}
|
|
1340
|
-
return
|
|
1355
|
+
return r;
|
|
1341
1356
|
})
|
|
1342
1357
|
);
|
|
1343
1358
|
}
|
|
1344
|
-
function Ds(n, t,
|
|
1345
|
-
const
|
|
1346
|
-
|
|
1347
|
-
|
|
1359
|
+
function Ds(n, t, r, s) {
|
|
1360
|
+
const e = M(n), i = M(t);
|
|
1361
|
+
p(
|
|
1362
|
+
e,
|
|
1348
1363
|
i,
|
|
1349
|
-
|
|
1350
|
-
),
|
|
1364
|
+
Sn(r)
|
|
1365
|
+
), p(
|
|
1351
1366
|
i,
|
|
1352
|
-
|
|
1353
|
-
|
|
1367
|
+
e,
|
|
1368
|
+
Sn(s)
|
|
1354
1369
|
);
|
|
1355
1370
|
}
|
|
1356
1371
|
function $s(n, t) {
|
|
@@ -1363,14 +1378,14 @@ function $s(n, t) {
|
|
|
1363
1378
|
function qs(n, t) {
|
|
1364
1379
|
if (n === t)
|
|
1365
1380
|
return !0;
|
|
1366
|
-
const
|
|
1367
|
-
return (n.getCode() === t.getCode() || on(n, t) ===
|
|
1381
|
+
const r = n.getUnits() === t.getUnits();
|
|
1382
|
+
return (n.getCode() === t.getCode() || on(n, t) === en) && r;
|
|
1368
1383
|
}
|
|
1369
1384
|
function on(n, t) {
|
|
1370
|
-
const
|
|
1371
|
-
let
|
|
1372
|
-
if (
|
|
1373
|
-
return
|
|
1385
|
+
const r = n.getCode(), s = t.getCode();
|
|
1386
|
+
let e = K(r, s);
|
|
1387
|
+
if (e)
|
|
1388
|
+
return e;
|
|
1374
1389
|
let i = null, o = null;
|
|
1375
1390
|
for (const c of Wt)
|
|
1376
1391
|
i || (i = c(n)), o || (o = c(t));
|
|
@@ -1379,48 +1394,48 @@ function on(n, t) {
|
|
|
1379
1394
|
const a = "EPSG:4326";
|
|
1380
1395
|
if (o)
|
|
1381
1396
|
if (i)
|
|
1382
|
-
|
|
1397
|
+
e = V(
|
|
1383
1398
|
i.inverse,
|
|
1384
1399
|
o.forward
|
|
1385
1400
|
);
|
|
1386
1401
|
else {
|
|
1387
|
-
const c = K(
|
|
1388
|
-
c && (
|
|
1402
|
+
const c = K(r, a);
|
|
1403
|
+
c && (e = V(
|
|
1389
1404
|
c,
|
|
1390
1405
|
o.forward
|
|
1391
1406
|
));
|
|
1392
1407
|
}
|
|
1393
1408
|
else {
|
|
1394
|
-
const c = K(a,
|
|
1395
|
-
c && (
|
|
1409
|
+
const c = K(a, s);
|
|
1410
|
+
c && (e = V(
|
|
1396
1411
|
i.inverse,
|
|
1397
1412
|
c
|
|
1398
1413
|
));
|
|
1399
1414
|
}
|
|
1400
|
-
return
|
|
1415
|
+
return e && (Z(n), Z(t), p(n, t, e)), e;
|
|
1401
1416
|
}
|
|
1402
1417
|
function V(n, t) {
|
|
1403
|
-
return function(s, e,
|
|
1404
|
-
return
|
|
1418
|
+
return function(r, s, e, i) {
|
|
1419
|
+
return s = n(r, s, e, i), t(s, s, e, i);
|
|
1405
1420
|
};
|
|
1406
1421
|
}
|
|
1407
1422
|
function qn(n, t) {
|
|
1408
|
-
const
|
|
1409
|
-
return on(
|
|
1423
|
+
const r = M(n), s = M(t);
|
|
1424
|
+
return on(r, s);
|
|
1410
1425
|
}
|
|
1411
|
-
function Yt(n, t,
|
|
1412
|
-
const
|
|
1413
|
-
if (!
|
|
1414
|
-
const
|
|
1426
|
+
function Yt(n, t, r) {
|
|
1427
|
+
const s = qn(t, r);
|
|
1428
|
+
if (!s) {
|
|
1429
|
+
const e = M(t).getCode(), i = M(r).getCode();
|
|
1415
1430
|
throw new Error(
|
|
1416
|
-
`No transform available between ${
|
|
1431
|
+
`No transform available between ${e} and ${i}`
|
|
1417
1432
|
);
|
|
1418
1433
|
}
|
|
1419
|
-
return
|
|
1434
|
+
return s(n, void 0, n.length);
|
|
1420
1435
|
}
|
|
1421
|
-
function Bs(n, t,
|
|
1422
|
-
const
|
|
1423
|
-
return lt(n,
|
|
1436
|
+
function Bs(n, t, r, s) {
|
|
1437
|
+
const e = qn(t, r);
|
|
1438
|
+
return lt(n, e, void 0, s);
|
|
1424
1439
|
}
|
|
1425
1440
|
let Ht = null;
|
|
1426
1441
|
function Ys() {
|
|
@@ -1444,54 +1459,54 @@ function zs(n, t) {
|
|
|
1444
1459
|
return n;
|
|
1445
1460
|
}
|
|
1446
1461
|
function Kt() {
|
|
1447
|
-
|
|
1462
|
+
vn(Pn), vn(mn), Bt(
|
|
1448
1463
|
mn,
|
|
1449
1464
|
Pn,
|
|
1450
1465
|
mt,
|
|
1451
|
-
|
|
1466
|
+
wt
|
|
1452
1467
|
);
|
|
1453
1468
|
}
|
|
1454
1469
|
Kt();
|
|
1455
1470
|
export {
|
|
1456
|
-
|
|
1457
|
-
|
|
1458
|
-
|
|
1459
|
-
|
|
1460
|
-
|
|
1471
|
+
jn as $,
|
|
1472
|
+
tt as A,
|
|
1473
|
+
rs as B,
|
|
1474
|
+
ms as C,
|
|
1475
|
+
M as D,
|
|
1461
1476
|
Kn as E,
|
|
1462
|
-
|
|
1463
|
-
|
|
1464
|
-
|
|
1465
|
-
|
|
1466
|
-
|
|
1467
|
-
|
|
1468
|
-
|
|
1477
|
+
at as F,
|
|
1478
|
+
ns as G,
|
|
1479
|
+
Ms as H,
|
|
1480
|
+
Gs as I,
|
|
1481
|
+
Cn as J,
|
|
1482
|
+
Un as K,
|
|
1483
|
+
O as L,
|
|
1469
1484
|
k as M,
|
|
1470
|
-
|
|
1485
|
+
zt as N,
|
|
1471
1486
|
Hn as O,
|
|
1472
|
-
|
|
1473
|
-
|
|
1474
|
-
|
|
1475
|
-
|
|
1487
|
+
us as P,
|
|
1488
|
+
ps as Q,
|
|
1489
|
+
ls as R,
|
|
1490
|
+
fs as S,
|
|
1476
1491
|
Zt as T,
|
|
1477
|
-
|
|
1492
|
+
Yt as U,
|
|
1478
1493
|
ln as V,
|
|
1479
|
-
|
|
1480
|
-
|
|
1481
|
-
|
|
1482
|
-
|
|
1483
|
-
|
|
1494
|
+
as as W,
|
|
1495
|
+
Ps as X,
|
|
1496
|
+
dn as Y,
|
|
1497
|
+
E as Z,
|
|
1498
|
+
kt as _,
|
|
1484
1499
|
Zn as a,
|
|
1485
|
-
|
|
1486
|
-
|
|
1487
|
-
|
|
1488
|
-
|
|
1489
|
-
|
|
1490
|
-
|
|
1491
|
-
|
|
1492
|
-
|
|
1493
|
-
|
|
1494
|
-
|
|
1500
|
+
ds as a0,
|
|
1501
|
+
st as a1,
|
|
1502
|
+
pn as a2,
|
|
1503
|
+
jt as a3,
|
|
1504
|
+
x as a4,
|
|
1505
|
+
on as a5,
|
|
1506
|
+
Ys as a6,
|
|
1507
|
+
es as a7,
|
|
1508
|
+
Fs as a8,
|
|
1509
|
+
ft as a9,
|
|
1495
1510
|
Is as aA,
|
|
1496
1511
|
fn as aB,
|
|
1497
1512
|
kn as aC,
|
|
@@ -1509,25 +1524,25 @@ export {
|
|
|
1509
1524
|
Ls as aO,
|
|
1510
1525
|
$t as aP,
|
|
1511
1526
|
Qt as aQ,
|
|
1512
|
-
|
|
1527
|
+
Ss as aR,
|
|
1513
1528
|
os as aS,
|
|
1514
|
-
|
|
1515
|
-
|
|
1516
|
-
|
|
1529
|
+
Sn as aT,
|
|
1530
|
+
vs as aU,
|
|
1531
|
+
rt as aV,
|
|
1517
1532
|
Os as aW,
|
|
1518
|
-
|
|
1519
|
-
|
|
1520
|
-
|
|
1521
|
-
|
|
1522
|
-
|
|
1523
|
-
|
|
1533
|
+
bs as aa,
|
|
1534
|
+
xt as ab,
|
|
1535
|
+
Ks as ac,
|
|
1536
|
+
bn as ad,
|
|
1537
|
+
hs as ae,
|
|
1538
|
+
ht as af,
|
|
1524
1539
|
ut as ag,
|
|
1525
|
-
|
|
1526
|
-
|
|
1527
|
-
|
|
1528
|
-
|
|
1529
|
-
|
|
1530
|
-
|
|
1540
|
+
Hs as ah,
|
|
1541
|
+
Ns as ai,
|
|
1542
|
+
Rn as aj,
|
|
1543
|
+
qn as ak,
|
|
1544
|
+
ss as al,
|
|
1545
|
+
w as am,
|
|
1531
1546
|
Ln as an,
|
|
1532
1547
|
lt as ao,
|
|
1533
1548
|
tn as ap,
|
|
@@ -1536,7 +1551,7 @@ export {
|
|
|
1536
1551
|
Jn as as,
|
|
1537
1552
|
Z as at,
|
|
1538
1553
|
K as au,
|
|
1539
|
-
|
|
1554
|
+
vn as av,
|
|
1540
1555
|
Ds as aw,
|
|
1541
1556
|
dt as ax,
|
|
1542
1557
|
En as ay,
|
|
@@ -1550,20 +1565,20 @@ export {
|
|
|
1550
1565
|
zs as h,
|
|
1551
1566
|
ct as i,
|
|
1552
1567
|
js as j,
|
|
1553
|
-
|
|
1568
|
+
Vs as k,
|
|
1554
1569
|
j as l,
|
|
1555
|
-
|
|
1556
|
-
|
|
1557
|
-
|
|
1558
|
-
|
|
1559
|
-
|
|
1560
|
-
|
|
1561
|
-
|
|
1562
|
-
|
|
1570
|
+
ws as m,
|
|
1571
|
+
In as n,
|
|
1572
|
+
cs as o,
|
|
1573
|
+
Vt as p,
|
|
1574
|
+
q,
|
|
1575
|
+
ys as r,
|
|
1576
|
+
Es as s,
|
|
1577
|
+
Bs as t,
|
|
1563
1578
|
un as u,
|
|
1564
|
-
|
|
1565
|
-
|
|
1566
|
-
|
|
1567
|
-
|
|
1568
|
-
|
|
1579
|
+
nn as v,
|
|
1580
|
+
Ts as w,
|
|
1581
|
+
it as x,
|
|
1582
|
+
Jt as y,
|
|
1583
|
+
xn as z
|
|
1569
1584
|
};
|