@opensystemslab/map 0.8.2 → 1.0.0-alpha.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.
@@ -21,8 +21,7 @@ var mr = function(e, A) {
21
21
  return mr = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, r) {
22
22
  t.__proto__ = r;
23
23
  } || function(t, r) {
24
- for (var B in r)
25
- Object.prototype.hasOwnProperty.call(r, B) && (t[B] = r[B]);
24
+ for (var B in r) Object.prototype.hasOwnProperty.call(r, B) && (t[B] = r[B]);
26
25
  }, mr(e, A);
27
26
  };
28
27
  function tA(e, A) {
@@ -38,8 +37,7 @@ var Lr = function() {
38
37
  return Lr = Object.assign || function(A) {
39
38
  for (var t, r = 1, B = arguments.length; r < B; r++) {
40
39
  t = arguments[r];
41
- for (var n in t)
42
- Object.prototype.hasOwnProperty.call(t, n) && (A[n] = t[n]);
40
+ for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && (A[n] = t[n]);
43
41
  }
44
42
  return A;
45
43
  }, Lr.apply(this, arguments);
@@ -68,13 +66,12 @@ function P(e, A, t, r) {
68
66
  function o(Q) {
69
67
  Q.done ? n(Q.value) : B(Q.value).then(i, a);
70
68
  }
71
- o((r = r.apply(e, A || [])).next());
69
+ o((r = r.apply(e, [])).next());
72
70
  });
73
71
  }
74
72
  function _(e, A) {
75
73
  var t = { label: 0, sent: function() {
76
- if (n[0] & 1)
77
- throw n[1];
74
+ if (n[0] & 1) throw n[1];
78
75
  return n[1];
79
76
  }, trys: [], ops: [] }, r, B, n, s;
80
77
  return s = { next: i(0), throw: i(1), return: i(2) }, typeof Symbol == "function" && (s[Symbol.iterator] = function() {
@@ -86,60 +83,55 @@ function _(e, A) {
86
83
  };
87
84
  }
88
85
  function a(o) {
89
- if (r)
90
- throw new TypeError("Generator is already executing.");
91
- for (; t; )
92
- try {
93
- if (r = 1, B && (n = o[0] & 2 ? B.return : o[0] ? B.throw || ((n = B.return) && n.call(B), 0) : B.next) && !(n = n.call(B, o[1])).done)
94
- return n;
95
- switch (B = 0, n && (o = [o[0] & 2, n.value]), o[0]) {
96
- case 0:
97
- case 1:
98
- n = o;
99
- break;
100
- case 4:
101
- return t.label++, { value: o[1], done: !1 };
102
- case 5:
103
- t.label++, B = o[1], o = [0];
104
- continue;
105
- case 7:
106
- o = t.ops.pop(), t.trys.pop();
107
- continue;
108
- default:
109
- if (n = t.trys, !(n = n.length > 0 && n[n.length - 1]) && (o[0] === 6 || o[0] === 2)) {
110
- t = 0;
111
- continue;
112
- }
113
- if (o[0] === 3 && (!n || o[1] > n[0] && o[1] < n[3])) {
114
- t.label = o[1];
115
- break;
116
- }
117
- if (o[0] === 6 && t.label < n[1]) {
118
- t.label = n[1], n = o;
119
- break;
120
- }
121
- if (n && t.label < n[2]) {
122
- t.label = n[2], t.ops.push(o);
123
- break;
124
- }
125
- n[2] && t.ops.pop(), t.trys.pop();
86
+ if (r) throw new TypeError("Generator is already executing.");
87
+ for (; t; ) try {
88
+ if (r = 1, B && (n = o[0] & 2 ? B.return : o[0] ? B.throw || ((n = B.return) && n.call(B), 0) : B.next) && !(n = n.call(B, o[1])).done) return n;
89
+ switch (B = 0, n && (o = [o[0] & 2, n.value]), o[0]) {
90
+ case 0:
91
+ case 1:
92
+ n = o;
93
+ break;
94
+ case 4:
95
+ return t.label++, { value: o[1], done: !1 };
96
+ case 5:
97
+ t.label++, B = o[1], o = [0];
98
+ continue;
99
+ case 7:
100
+ o = t.ops.pop(), t.trys.pop();
101
+ continue;
102
+ default:
103
+ if (n = t.trys, !(n = n.length > 0 && n[n.length - 1]) && (o[0] === 6 || o[0] === 2)) {
104
+ t = 0;
126
105
  continue;
127
- }
128
- o = A.call(e, t);
129
- } catch (Q) {
130
- o = [6, Q], B = 0;
131
- } finally {
132
- r = n = 0;
106
+ }
107
+ if (o[0] === 3 && (!n || o[1] > n[0] && o[1] < n[3])) {
108
+ t.label = o[1];
109
+ break;
110
+ }
111
+ if (o[0] === 6 && t.label < n[1]) {
112
+ t.label = n[1], n = o;
113
+ break;
114
+ }
115
+ if (n && t.label < n[2]) {
116
+ t.label = n[2], t.ops.push(o);
117
+ break;
118
+ }
119
+ n[2] && t.ops.pop(), t.trys.pop();
120
+ continue;
133
121
  }
134
- if (o[0] & 5)
135
- throw o[1];
122
+ o = A.call(e, t);
123
+ } catch (Q) {
124
+ o = [6, Q], B = 0;
125
+ } finally {
126
+ r = n = 0;
127
+ }
128
+ if (o[0] & 5) throw o[1];
136
129
  return { value: o[0] ? o[1] : void 0, done: !0 };
137
130
  }
138
131
  }
139
132
  function ue(e, A, t) {
140
- if (t || arguments.length === 2)
141
- for (var r = 0, B = A.length, n; r < B; r++)
142
- (n || !(r in A)) && (n || (n = Array.prototype.slice.call(A, 0, r)), n[r] = A[r]);
133
+ if (arguments.length === 2) for (var r = 0, B = A.length, n; r < B; r++)
134
+ (n || !(r in A)) && (n || (n = Array.prototype.slice.call(A, 0, r)), n[r] = A[r]);
143
135
  return e.concat(n || A);
144
136
  }
145
137
  var cA = (
@@ -1363,8 +1355,7 @@ var pt = function(e, A) {
1363
1355
  case "bottom":
1364
1356
  return n.push(hA), g;
1365
1357
  }
1366
- else
1367
- (M(w) || pA(w)) && n.push(w);
1358
+ else (M(w) || pA(w)) && n.push(w);
1368
1359
  else if (D(w))
1369
1360
  switch (w.value) {
1370
1361
  case DB:
@@ -2797,8 +2788,7 @@ var qi = 1, Ur = 2, Fr = 3, Tt = 4, St = 5, ji = 7, Ot = 8, hr = 9, dr = 10, Mt
2797
2788
  var g = r.splitText(i.length);
2798
2789
  n.push(new ie(i, wo(e, r))), r = g;
2799
2790
  }
2800
- else
2801
- N.SUPPORT_RANGE_BOUNDS || (r = r.splitText(i.length));
2791
+ else N.SUPPORT_RANGE_BOUNDS || (r = r.splitText(i.length));
2802
2792
  s += i.length;
2803
2793
  }), n;
2804
2794
  }, wo = function(e, A) {
@@ -4373,8 +4363,7 @@ var x = function(e, A, t, r, B) {
4373
4363
  case 3:
4374
4364
  return s++, [3, 1];
4375
4365
  case 4:
4376
- if (!(r instanceof GB))
4377
- return [3, 8];
4366
+ if (!(r instanceof GB)) return [3, 8];
4378
4367
  l.label = 5;
4379
4368
  case 5:
4380
4369
  return l.trys.push([5, 7, , 8]), [4, this.context.cache.match(r.src)];
@@ -4383,8 +4372,7 @@ var x = function(e, A, t, r, B) {
4383
4372
  case 7:
4384
4373
  return l.sent(), this.context.logger.error("Error loading image " + r.src), [3, 8];
4385
4374
  case 8:
4386
- if (r instanceof RB && this.renderReplacedElement(r, B, r.canvas), !(r instanceof VB))
4387
- return [3, 12];
4375
+ if (r instanceof RB && this.renderReplacedElement(r, B, r.canvas), !(r instanceof VB)) return [3, 12];
4388
4376
  l.label = 9;
4389
4377
  case 9:
4390
4378
  return l.trys.push([9, 11, , 12]), [4, this.context.cache.match(r.svg)];
@@ -4432,12 +4420,9 @@ var x = function(e, A, t, r, B) {
4432
4420
  r.styles.display,
4433
4421
  2048
4434
4422
  /* LIST_ITEM */
4435
- ))
4436
- return [3, 20];
4437
- if (r.styles.listStyleImage === null)
4438
- return [3, 19];
4439
- if (h = r.styles.listStyleImage, h.type !== 0)
4440
- return [3, 18];
4423
+ )) return [3, 20];
4424
+ if (r.styles.listStyleImage === null) return [3, 19];
4425
+ if (h = r.styles.listStyleImage, h.type !== 0) return [3, 18];
4441
4426
  F = void 0, K = h.url, l.label = 15;
4442
4427
  case 15:
4443
4428
  return l.trys.push([15, 17, , 18]), [4, this.context.cache.match(K)];
@@ -4567,8 +4552,7 @@ var x = function(e, A, t, r, B) {
4567
4552
  return _(this, function(TA) {
4568
4553
  switch (TA.label) {
4569
4554
  case 0:
4570
- if (Q.type !== 0)
4571
- return [3, 5];
4555
+ if (Q.type !== 0) return [3, 5];
4572
4556
  g = void 0, w = Q.url, TA.label = 1;
4573
4557
  case 1:
4574
4558
  return TA.trys.push([1, 3, , 4]), [4, n.context.cache.match(w)];