@nika-js/onlymap 0.2.3 → 0.3.1

package/dist/assets/zstd-QGAv3PMm.js

@@ -0,0 +1,383 @@
+var ur = ArrayBuffer, F = Uint8Array, _ = Uint16Array, or = Int16Array, p = Int32Array, s = function(r, e, n) {
+  if (F.prototype.slice)
+    return F.prototype.slice.call(r, e, n);
+  (e == null || e < 0) && (e = 0), (n == null || n > r.length) && (n = r.length);
+  var v = new F(n - e);
+  return v.set(r.subarray(e, n)), v;
+}, Q = function(r, e, n, v) {
+  if (F.prototype.fill)
+    return F.prototype.fill.call(r, e, n, v);
+  for ((n == null || n < 0) && (n = 0), (v == null || v > r.length) && (v = r.length); n < v; ++n)
+    r[n] = e;
+  return r;
+}, wr = function(r, e, n, v) {
+  if (F.prototype.copyWithin)
+    return F.prototype.copyWithin.call(r, e, n, v);
+  for ((n == null || n < 0) && (n = 0), (v == null || v > r.length) && (v = r.length); n < v; )
+    r[e++] = r[n++];
+}, lr = [
+  "invalid zstd data",
+  "window size too large (>2046MB)",
+  "invalid block type",
+  "FSE accuracy too high",
+  "match distance too far back",
+  "unexpected EOF"
+], B = function(r, e, n) {
+  var v = new Error(e || lr[r]);
+  if (v.code = r, Error.captureStackTrace && Error.captureStackTrace(v, B), !n)
+    throw v;
+  return v;
+}, fr = function(r, e, n) {
+  for (var v = 0, a = 0; v < n; ++v)
+    a |= r[e++] << (v << 3);
+  return a;
+}, gr = function(r, e) {
+  return (r[e] | r[e + 1] << 8 | r[e + 2] << 16 | r[e + 3] << 24) >>> 0;
+}, zr = function(r, e) {
+  var n = r[0] | r[1] << 8 | r[2] << 16;
+  if (n == 3126568 && r[3] == 253) {
+    var v = r[4], a = v >> 5 & 1, y = v >> 2 & 1, i = v & 3, o = v >> 6;
+    v & 8 && B(0);
+    var w = 6 - a, z = i == 3 ? 4 : i, L = fr(r, w, z);
+    w += z;
+    var g = o ? 1 << o : a, A = fr(r, w, g) + (o == 1 && 256), c = A;
+    if (!a) {
+      var x = 1 << 10 + (r[5] >> 3);
+      c = x + (x >> 3) * (r[5] & 7);
+    }
+    c > 2145386496 && B(1);
+    var u = new F((e == 1 ? A || c : e ? 0 : c) + 12);
+    return u[0] = 1, u[4] = 4, u[8] = 8, {
+      b: w + g,
+      y: 0,
+      l: 0,
+      d: L,
+      w: e && e != 1 ? e : u.subarray(12),
+      e: c,
+      o: new p(u.buffer, 0, 3),
+      u: A,
+      c: y,
+      m: Math.min(131072, c)
+    };
+  } else if ((n >> 4 | r[3] << 20) == 25481893)
+    return gr(r, 4) + 8;
+  B(0);
+}, G = function(r) {
+  for (var e = 0; 1 << e <= r; ++e)
+    ;
+  return e - 1;
+}, R = function(r, e, n) {
+  var v = (e << 3) + 4, a = (r[e] & 15) + 5;
+  a > n && B(3);
+  for (var y = 1 << a, i = y, o = -1, w = -1, z = -1, L = y, g = new ur(512 + (y << 2)), A = new or(g, 0, 256), c = new _(g, 0, 256), x = new _(g, 512, y), u = 512 + (y << 1), E = new F(g, u, y), q = new F(g, u + y); o < 255 && i > 0; ) {
+    var S = G(i + 1), U = v >> 3, k = (1 << S + 1) - 1, I = (r[U] | r[U + 1] << 8 | r[U + 2] << 16) >> (v & 7) & k, f = (1 << S) - 1, M = k - i - 1, W = I & f;
+    if (W < M ? (v += S, I = W) : (v += S + 1, I > f && (I -= M)), A[++o] = --I, I == -1 ? (i += I, E[--L] = o) : i -= I, !I)
+      do {
+        var D = v >> 3;
+        w = (r[D] | r[D + 1] << 8) >> (v & 7) & 3, v += 2, o += w;
+      } while (w == 3);
+  }
+  (o > 255 || i) && B(0);
+  for (var O = 0, N = (y >> 1) + (y >> 3) + 3, V = y - 1, j = 0; j <= o; ++j) {
+    var l = A[j];
+    if (l < 1) {
+      c[j] = -l;
+      continue;
+    }
+    for (z = 0; z < l; ++z) {
+      E[O] = j;
+      do
+        O = O + N & V;
+      while (O >= L);
+    }
+  }
+  for (O && B(0), z = 0; z < y; ++z) {
+    var h = c[E[z]]++, T = q[z] = a - G(h);
+    x[z] = (h << T) - y;
+  }
+  return [v + 7 >> 3, {
+    b: a,
+    s: E,
+    n: q,
+    t: x
+  }];
+}, Ar = function(r, e) {
+  var n = 0, v = -1, a = new F(292), y = r[e], i = a.subarray(0, 256), o = a.subarray(256, 268), w = new _(a.buffer, 268);
+  if (y < 128) {
+    var z = R(r, e + 1, 6), L = z[0], g = z[1];
+    e += y;
+    var A = L << 3, c = r[e];
+    c || B(0);
+    for (var x = 0, u = 0, E = g.b, q = E, S = (++e << 3) - 8 + G(c); S -= E, !(S < A); ) {
+      var U = S >> 3;
+      if (x += (r[U] | r[U + 1] << 8) >> (S & 7) & (1 << E) - 1, i[++v] = g.s[x], S -= q, S < A)
+        break;
+      U = S >> 3, u += (r[U] | r[U + 1] << 8) >> (S & 7) & (1 << q) - 1, i[++v] = g.s[u], E = g.n[x], x = g.t[x], q = g.n[u], u = g.t[u];
+    }
+    ++v > 255 && B(0);
+  } else {
+    for (v = y - 127; n < v; n += 2) {
+      var k = r[++e];
+      i[n] = k >> 4, i[n + 1] = k & 15;
+    }
+    ++e;
+  }
+  var I = 0;
+  for (n = 0; n < v; ++n) {
+    var f = i[n];
+    f > 11 && B(0), I += f && 1 << f - 1;
+  }
+  var M = G(I) + 1, W = 1 << M, D = W - I;
+  for (D & D - 1 && B(0), i[v++] = G(D) + 1, n = 0; n < v; ++n) {
+    var f = i[n];
+    ++o[i[n] = f && M + 1 - f];
+  }
+  var O = new F(W << 1), N = O.subarray(0, W), V = O.subarray(W);
+  for (w[M] = 0, n = M; n > 0; --n) {
+    var j = w[n];
+    Q(V, n, j, w[n - 1] = j + o[n] * (1 << M - n));
+  }
+  for (w[0] != W && B(0), n = 0; n < v; ++n) {
+    var l = i[n];
+    if (l) {
+      var h = w[l];
+      Q(N, n, h, w[l] = h + (1 << M - l));
+    }
+  }
+  return [e, {
+    n: V,
+    b: M,
+    s: N
+  }];
+}, Er = R(/* @__PURE__ */ new F([
+  81,
+  16,
+  99,
+  140,
+  49,
+  198,
+  24,
+  99,
+  12,
+  33,
+  196,
+  24,
+  99,
+  102,
+  102,
+  134,
+  70,
+  146,
+  4
+]), 0, 6)[1], Fr = R(/* @__PURE__ */ new F([
+  33,
+  20,
+  196,
+  24,
+  99,
+  140,
+  33,
+  132,
+  16,
+  66,
+  8,
+  33,
+  132,
+  16,
+  66,
+  8,
+  33,
+  68,
+  68,
+  68,
+  68,
+  68,
+  68,
+  68,
+  68,
+  36,
+  9
+]), 0, 6)[1], cr = R(/* @__PURE__ */ new F([
+  32,
+  132,
+  16,
+  66,
+  102,
+  70,
+  68,
+  68,
+  68,
+  68,
+  36,
+  73,
+  2
+]), 0, 5)[1], yr = function(r, e) {
+  for (var n = r.length, v = new p(n), a = 0; a < n; ++a)
+    v[a] = e, e += 1 << r[a];
+  return v;
+}, t = /* @__PURE__ */ new F((/* @__PURE__ */ new p([
+  0,
+  0,
+  0,
+  0,
+  16843009,
+  50528770,
+  134678020,
+  202050057,
+  269422093
+])).buffer, 0, 36), Br = /* @__PURE__ */ yr(t, 0), rr = /* @__PURE__ */ new F((/* @__PURE__ */ new p([
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  0,
+  16843009,
+  50528770,
+  117769220,
+  185207048,
+  252579084,
+  16
+])).buffer, 0, 53), Ur = /* @__PURE__ */ yr(rr, 3), P = function(r, e, n) {
+  var v = r.length, a = e.length, y = r[v - 1], i = (1 << n.b) - 1, o = -n.b;
+  y || B(0);
+  for (var w = 0, z = n.b, L = (v << 3) - 8 + G(y) - z, g = -1; L > o && g < a; ) {
+    var A = L >> 3, c = (r[A] | r[A + 1] << 8 | r[A + 2] << 16) >> (L & 7);
+    w = (w << z | c) & i, e[++g] = n.s[w], L -= z = n.n[w];
+  }
+  (L != o || g + 1 != a) && B(0);
+}, Ir = function(r, e, n) {
+  var v = 6, a = e.length, y = a + 3 >> 2, i = y << 1, o = y + i;
+  P(r.subarray(v, v += r[0] | r[1] << 8), e.subarray(0, y), n), P(r.subarray(v, v += r[2] | r[3] << 8), e.subarray(y, i), n), P(r.subarray(v, v += r[4] | r[5] << 8), e.subarray(i, o), n), P(r.subarray(v), e.subarray(o), n);
+}, Lr = function(r, e, n) {
+  var v, a = e.b, y = r[a], i = y >> 1 & 3;
+  e.l = y & 1;
+  var o = y >> 3 | r[a + 1] << 5 | r[a + 2] << 13, w = (a += 3) + o;
+  if (i == 1)
+    return a >= r.length ? void 0 : (e.b = a + 1, n ? (Q(n, r[a], e.y, e.y += o), n) : Q(new F(o), r[a]));
+  if (!(w > r.length)) {
+    if (i == 0)
+      return e.b = w, n ? (n.set(r.subarray(a, w), e.y), e.y += o, n) : s(r, a, w);
+    if (i == 2) {
+      var z = r[a], L = z & 3, g = z >> 2 & 3, A = z >> 4, c = 0, x = 0;
+      L < 2 ? g & 1 ? A |= r[++a] << 4 | (g & 2 && r[++a] << 12) : A = z >> 3 : (x = g, g < 2 ? (A |= (r[++a] & 63) << 4, c = r[a] >> 6 | r[++a] << 2) : g == 2 ? (A |= r[++a] << 4 | (r[++a] & 3) << 12, c = r[a] >> 2 | r[++a] << 6) : (A |= r[++a] << 4 | (r[++a] & 63) << 12, c = r[a] >> 6 | r[++a] << 2 | r[++a] << 10)), ++a;
+      var u = n ? n.subarray(e.y, e.y + e.m) : new F(e.m), E = u.length - A;
+      if (L == 0)
+        u.set(r.subarray(a, a += A), E);
+      else if (L == 1)
+        Q(u, r[a++], E);
+      else {
+        var q = e.h;
+        if (L == 2) {
+          var S = Ar(r, a);
+          c += a - (a = S[0]), e.h = q = S[1];
+        } else q || B(0);
+        (x ? Ir : P)(r.subarray(a, a += c), u.subarray(E), q);
+      }
+      var U = r[a++];
+      if (U) {
+        U == 255 ? U = (r[a++] | r[a++] << 8) + 32512 : U > 127 && (U = U - 128 << 8 | r[a++]);
+        var k = r[a++];
+        k & 3 && B(0);
+        for (var I = [Fr, cr, Er], f = 2; f > -1; --f) {
+          var M = k >> (f << 1) + 2 & 3;
+          if (M == 1) {
+            var W = new F([0, 0, r[a++]]);
+            I[f] = {
+              s: W.subarray(2, 3),
+              n: W.subarray(0, 1),
+              t: new _(W.buffer, 0, 1),
+              b: 0
+            };
+          } else M == 2 ? (v = R(r, a, 9 - (f & 1)), a = v[0], I[f] = v[1]) : M == 3 && (e.t || B(0), I[f] = e.t[f]);
+        }
+        var D = e.t = I, O = D[0], N = D[1], V = D[2], j = r[w - 1];
+        j || B(0);
+        var l = (w << 3) - 8 + G(j) - V.b, h = l >> 3, T = 0, X = (r[h] | r[h + 1] << 8) >> (l & 7) & (1 << V.b) - 1;
+        h = (l -= N.b) >> 3;
+        var Y = (r[h] | r[h + 1] << 8) >> (l & 7) & (1 << N.b) - 1;
+        h = (l -= O.b) >> 3;
+        var Z = (r[h] | r[h + 1] << 8) >> (l & 7) & (1 << O.b) - 1;
+        for (++U; --U; ) {
+          var b = V.s[X], er = V.n[X], d = O.s[Z], nr = O.n[Z], ar = N.s[Y], vr = N.n[Y];
+          h = (l -= ar) >> 3;
+          var ir = 1 << ar, C = ir + ((r[h] | r[h + 1] << 8 | r[h + 2] << 16 | r[h + 3] << 24) >>> (l & 7) & ir - 1);
+          h = (l -= rr[d]) >> 3;
+          var H = Ur[d] + ((r[h] | r[h + 1] << 8 | r[h + 2] << 16) >> (l & 7) & (1 << rr[d]) - 1);
+          h = (l -= t[b]) >> 3;
+          var $ = Br[b] + ((r[h] | r[h + 1] << 8 | r[h + 2] << 16) >> (l & 7) & (1 << t[b]) - 1);
+          if (h = (l -= er) >> 3, X = V.t[X] + ((r[h] | r[h + 1] << 8) >> (l & 7) & (1 << er) - 1), h = (l -= nr) >> 3, Z = O.t[Z] + ((r[h] | r[h + 1] << 8) >> (l & 7) & (1 << nr) - 1), h = (l -= vr) >> 3, Y = N.t[Y] + ((r[h] | r[h + 1] << 8) >> (l & 7) & (1 << vr) - 1), C > 3)
+            e.o[2] = e.o[1], e.o[1] = e.o[0], e.o[0] = C -= 3;
+          else {
+            var m = C - ($ != 0);
+            m ? (C = m == 3 ? e.o[0] - 1 : e.o[m], m > 1 && (e.o[2] = e.o[1]), e.o[1] = e.o[0], e.o[0] = C) : C = e.o[0];
+          }
+          for (var f = 0; f < $; ++f)
+            u[T + f] = u[E + f];
+          T += $, E += $;
+          var J = T - C;
+          if (J < 0) {
+            var K = -J, hr = e.e + J;
+            K > H && (K = H);
+            for (var f = 0; f < K; ++f)
+              u[T + f] = e.w[hr + f];
+            T += K, H -= K, J = 0;
+          }
+          for (var f = 0; f < H; ++f)
+            u[T + f] = u[J + f];
+          T += H;
+        }
+        if (T != E)
+          for (; E < u.length; )
+            u[T++] = u[E++];
+        else
+          T = u.length;
+        n ? e.y += T : u = s(u, 0, T);
+      } else if (n) {
+        if (e.y += A, E)
+          for (var f = 0; f < A; ++f)
+            u[f] = u[E + f];
+      } else E && (u = s(u, E));
+      return e.b = w, u;
+    }
+    B(2);
+  }
+}, Sr = function(r, e) {
+  if (r.length == 1)
+    return r[0];
+  for (var n = new F(e), v = 0, a = 0; v < r.length; ++v) {
+    var y = r[v];
+    n.set(y, a), a += y.length;
+  }
+  return n;
+};
+function xr(r, e) {
+  for (var n = [], v = +!e, a = 0, y = 0; r.length; ) {
+    var i = zr(r, v || e);
+    if (typeof i == "object") {
+      for (v ? (e = null, i.w.length == i.u && (n.push(e = i.w), y += i.u)) : (n.push(e), i.e = 0); !i.l; ) {
+        var o = Lr(r, i, e);
+        o || B(5), e ? i.e = i.y : (n.push(o), y += o.length, wr(i.w, 0, o.length), i.w.set(o, i.w.length - o.length));
+      }
+      a = i.b + i.c * 4;
+    } else
+      a = i;
+    r = r.subarray(a);
+  }
+  return Sr(n, y);
+}
+async function Or(r) {
+  const e = xr(new Uint8Array(r));
+  return Mr(e);
+}
+function Mr(r) {
+  if (r.byteOffset === 0 && r.byteLength === r.buffer.byteLength)
+    return r.buffer;
+  const e = new Uint8Array(r.byteLength);
+  return e.set(r), e.buffer;
+}
+export {
+  Or as decode
+};