@performant-software/geospatial 3.1.28 → 3.1.30-beta.0

package/dist/index.es593.js

@@ -0,0 +1,46 @@
+import n from "./index.es536.js";
+import u from "./index.es621.js";
+import o from "./index.es442.js";
+import A from "./index.es592.js";
+import b from "./index.es564.js";
+import v from "./index.es565.js";
+var L = 1, O = 2, E = "[object Boolean]", R = "[object Date]", d = "[object Error]", w = "[object Map]", B = "[object Number]", D = "[object RegExp]", P = "[object Set]", S = "[object String]", _ = "[object Symbol]", c = "[object ArrayBuffer]", x = "[object DataView]", i = n ? n.prototype : void 0, g = i ? i.valueOf : void 0;
+function N(a, e, l, s, y, m, r) {
+  switch (l) {
+    case x:
+      if (a.byteLength != e.byteLength || a.byteOffset != e.byteOffset)
+        return !1;
+      a = a.buffer, e = e.buffer;
+    case c:
+      return !(a.byteLength != e.byteLength || !m(new u(a), new u(e)));
+    case E:
+    case R:
+    case B:
+      return o(+a, +e);
+    case d:
+      return a.name == e.name && a.message == e.message;
+    case D:
+    case S:
+      return a == e + "";
+    case w:
+      var f = b;
+    case P:
+      var T = s & L;
+      if (f || (f = v), a.size != e.size && !T)
+        return !1;
+      var t = r.get(a);
+      if (t)
+        return t == e;
+      s |= O, r.set(a, e);
+      var p = A(f(a), f(e), s, y, m, r);
+      return r.delete(a), p;
+    case _:
+      if (g)
+        return g.call(a) == g.call(e);
+  }
+  return !1;
+}
+export {
+  N as default
+};
+//# sourceMappingURL=index.es593.js.map

package/dist/index.es593.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es593.js","sources":["../../../node_modules/lodash-es/_equalByTag.js"],"sourcesContent":["import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n"],"names":["COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","Symbol","symbolValueOf","equalByTag","object","other","tag","bitmask","customizer","equalFunc","stack","Uint8Array","eq","convert","mapToArray","isPartial","setToArray","stacked","result","equalArrays"],"mappings":";;;;;;AAQA,IAAIA,IAAuB,GACvBC,IAAyB,GAGzBC,IAAU,oBACVC,IAAU,iBACVC,IAAW,kBACXC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBACZC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBAEZC,IAAiB,wBACjBC,IAAc,qBAGdC,IAAcC,IAASA,EAAO,YAAY,QAC1CC,IAAgBF,IAAcA,EAAY,UAAU;AAmBxD,SAASG,EAAWC,GAAQC,GAAOC,GAAKC,GAASC,GAAYC,GAAWC,GAAO;AAC7E,UAAQJ,GAAA;AAAA,IACN,KAAKP;AACH,UAAKK,EAAO,cAAcC,EAAM,cAC3BD,EAAO,cAAcC,EAAM;AAC9B,eAAO;AAET,MAAAD,IAASA,EAAO,QAChBC,IAAQA,EAAM;AAAA,IAEhB,KAAKP;AACH,aAAK,EAAAM,EAAO,cAAcC,EAAM,cAC5B,CAACI,EAAU,IAAIE,EAAWP,CAAM,GAAG,IAAIO,EAAWN,CAAK,CAAC;AAAA,IAK9D,KAAKhB;AAAA,IACL,KAAKC;AAAA,IACL,KAAKG;AAGH,aAAOmB,EAAG,CAACR,GAAQ,CAACC,CAAK;AAAA,IAE3B,KAAKd;AACH,aAAOa,EAAO,QAAQC,EAAM,QAAQD,EAAO,WAAWC,EAAM;AAAA,IAE9D,KAAKX;AAAA,IACL,KAAKE;AAIH,aAAOQ,KAAWC,IAAQ;AAAA,IAE5B,KAAKb;AACH,UAAIqB,IAAUC;AAAA,IAEhB,KAAKnB;AACH,UAAIoB,IAAYR,IAAUpB;AAG1B,UAFA0B,MAAYA,IAAUG,IAElBZ,EAAO,QAAQC,EAAM,QAAQ,CAACU;AAChC,eAAO;AAGT,UAAIE,IAAUP,EAAM,IAAIN,CAAM;AAC9B,UAAIa;AACF,eAAOA,KAAWZ;AAEpB,MAAAE,KAAWnB,GAGXsB,EAAM,IAAIN,GAAQC,CAAK;AACvB,UAAIa,IAASC,EAAYN,EAAQT,CAAM,GAAGS,EAAQR,CAAK,GAAGE,GAASC,GAAYC,GAAWC,CAAK;AAC/F,aAAAA,EAAM,OAAUN,CAAM,GACfc;AAAA,IAET,KAAKrB;AACH,UAAIK;AACF,eAAOA,EAAc,KAAKE,CAAM,KAAKF,EAAc,KAAKG,CAAK;AAAA,EAC/D;AAEJ,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/index.es594.js

@@ -0,0 +1,37 @@
+import x from "./index.es527.js";
+var q = 1, E = Object.prototype, F = E.hasOwnProperty;
+function I(r, n, A, a, R, f) {
+  var v = A & q, d = x(r), e = d.length, S = x(n), _ = S.length;
+  if (e != _ && !v)
+    return !1;
+  for (var l = e; l--; ) {
+    var i = d[l];
+    if (!(v ? i in n : F.call(n, i)))
+      return !1;
+  }
+  var O = f.get(r), w = f.get(n);
+  if (O && w)
+    return O == n && w == r;
+  var s = !0;
+  f.set(r, n), f.set(n, r);
+  for (var t = v; ++l < e; ) {
+    i = d[l];
+    var p = r[i], P = n[i];
+    if (a)
+      var L = v ? a(P, p, i, n, r, f) : a(p, P, i, r, n, f);
+    if (!(L === void 0 ? p === P || R(p, P, A, a, f) : L)) {
+      s = !1;
+      break;
+    }
+    t || (t = i == "constructor");
+  }
+  if (s && !t) {
+    var g = r.constructor, u = n.constructor;
+    g != u && "constructor" in r && "constructor" in n && !(typeof g == "function" && g instanceof g && typeof u == "function" && u instanceof u) && (s = !1);
+  }
+  return f.delete(r), f.delete(n), s;
+}
+export {
+  I as default
+};
+//# sourceMappingURL=index.es594.js.map

package/dist/index.es594.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es594.js","sources":["../../../node_modules/lodash-es/_equalObjects.js"],"sourcesContent":["import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n"],"names":["COMPARE_PARTIAL_FLAG","objectProto","hasOwnProperty","equalObjects","object","other","bitmask","customizer","equalFunc","stack","isPartial","objProps","getAllKeys","objLength","othProps","othLength","index","key","objStacked","othStacked","result","skipCtor","objValue","othValue","compared","objCtor","othCtor"],"mappings":";AAGA,IAAIA,IAAuB,GAGvBC,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAejC,SAASE,EAAaC,GAAQC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC1E,MAAIC,IAAYJ,IAAUN,GACtBW,IAAWC,EAAWR,CAAM,GAC5BS,IAAYF,EAAS,QACrBG,IAAWF,EAAWP,CAAK,GAC3BU,IAAYD,EAAS;AAEzB,MAAID,KAAaE,KAAa,CAACL;AAC7B,WAAO;AAGT,WADIM,IAAQH,GACLG,OAAS;AACd,QAAIC,IAAMN,EAASK,CAAK;AACxB,QAAI,EAAEN,IAAYO,KAAOZ,IAAQH,EAAe,KAAKG,GAAOY,CAAG;AAC7D,aAAO;AAAA,EAEX;AAEA,MAAIC,IAAaT,EAAM,IAAIL,CAAM,GAC7Be,IAAaV,EAAM,IAAIJ,CAAK;AAChC,MAAIa,KAAcC;AAChB,WAAOD,KAAcb,KAASc,KAAcf;AAE9C,MAAIgB,IAAS;AACb,EAAAX,EAAM,IAAIL,GAAQC,CAAK,GACvBI,EAAM,IAAIJ,GAAOD,CAAM;AAGvB,WADIiB,IAAWX,GACR,EAAEM,IAAQH,KAAW;AAC1B,IAAAI,IAAMN,EAASK,CAAK;AACpB,QAAIM,IAAWlB,EAAOa,CAAG,GACrBM,IAAWlB,EAAMY,CAAG;AAExB,QAAIV;AACF,UAAIiB,IAAWd,IACXH,EAAWgB,GAAUD,GAAUL,GAAKZ,GAAOD,GAAQK,CAAK,IACxDF,EAAWe,GAAUC,GAAUN,GAAKb,GAAQC,GAAOI,CAAK;AAG9D,QAAI,EAAEe,MAAa,SACVF,MAAaC,KAAYf,EAAUc,GAAUC,GAAUjB,GAASC,GAAYE,CAAK,IAClFe,IACD;AACL,MAAAJ,IAAS;AACT;AAAA,IACF;AACA,IAAAC,MAAaA,IAAWJ,KAAO;AAAA,EACjC;AACA,MAAIG,KAAU,CAACC,GAAU;AACvB,QAAII,IAAUrB,EAAO,aACjBsB,IAAUrB,EAAM;AAGpB,IAAIoB,KAAWC,KACV,iBAAiBtB,KAAU,iBAAiBC,KAC7C,EAAE,OAAOoB,KAAW,cAAcA,aAAmBA,KACnD,OAAOC,KAAW,cAAcA,aAAmBA,OACvDN,IAAS;AAAA,EAEb;AACA,SAAAX,EAAM,OAAUL,CAAM,GACtBK,EAAM,OAAUJ,CAAK,GACde;AACT;","x_google_ignoreList":[0]}

package/dist/index.es595.js

@@ -0,0 +1,21 @@
+import p from "./index.es622.js";
+import a from "./index.es623.js";
+import l from "./index.es624.js";
+import s from "./index.es625.js";
+import m from "./index.es626.js";
+function t(o) {
+  var e = -1, h = o == null ? 0 : o.length;
+  for (this.clear(); ++e < h; ) {
+    var r = o[e];
+    this.set(r[0], r[1]);
+  }
+}
+t.prototype.clear = p;
+t.prototype.delete = a;
+t.prototype.get = l;
+t.prototype.has = s;
+t.prototype.set = m;
+export {
+  t as default
+};
+//# sourceMappingURL=index.es595.js.map

package/dist/index.es595.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es595.js","sources":["../../../node_modules/lodash-es/_Hash.js"],"sourcesContent":["import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n"],"names":["Hash","entries","index","length","entry","hashClear","hashDelete","hashGet","hashHas","hashSet"],"mappings":";;;;;AAaA,SAASA,EAAKC,GAAS;AACrB,MAAIC,IAAQ,IACRC,IAASF,KAAW,OAAO,IAAIA,EAAQ;AAG3C,OADA,KAAK,MAAA,GACE,EAAEC,IAAQC,KAAQ;AACvB,QAAIC,IAAQH,EAAQC,CAAK;AACzB,SAAK,IAAIE,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAJ,EAAK,UAAU,QAAQK;AACvBL,EAAK,UAAU,SAAYM;AAC3BN,EAAK,UAAU,MAAMO;AACrBP,EAAK,UAAU,MAAMQ;AACrBR,EAAK,UAAU,MAAMS;","x_google_ignoreList":[0]}

package/dist/index.es596.js

@@ -0,0 +1,9 @@
+import e from "./index.es598.js";
+function n(r, a) {
+  var t = r.__data__;
+  return e(a) ? t[typeof a == "string" ? "string" : "hash"] : t.map;
+}
+export {
+  n as default
+};
+//# sourceMappingURL=index.es596.js.map

package/dist/index.es596.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es596.js","sources":["../../../node_modules/lodash-es/_getMapData.js"],"sourcesContent":["import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n"],"names":["getMapData","map","key","data","isKeyable"],"mappings":";AAUA,SAASA,EAAWC,GAAKC,GAAK;AAC5B,MAAIC,IAAOF,EAAI;AACf,SAAOG,EAAUF,CAAG,IAChBC,EAAK,OAAOD,KAAO,WAAW,WAAW,MAAM,IAC/CC,EAAK;AACX;","x_google_ignoreList":[0]}

package/dist/index.es597.js

@@ -0,0 +1,47 @@
+const v = 11102230246251565e-32, m = 134217729, y = (3 + 8 * v) * v;
+function b(a, d, s, o, l) {
+  let e, t, n, u, r = d[0], i = o[0], f = 0, c = 0;
+  i > r == i > -r ? (e = r, r = d[++f]) : (e = i, i = o[++c]);
+  let w = 0;
+  if (f < a && c < s)
+    for (i > r == i > -r ? (t = r + e, n = e - (t - r), r = d[++f]) : (t = i + e, n = e - (t - i), i = o[++c]), e = t, n !== 0 && (l[w++] = n); f < a && c < s; )
+      i > r == i > -r ? (t = e + r, u = t - e, n = e - (t - u) + (r - u), r = d[++f]) : (t = e + i, u = t - e, n = e - (t - u) + (i - u), i = o[++c]), e = t, n !== 0 && (l[w++] = n);
+  for (; f < a; )
+    t = e + r, u = t - e, n = e - (t - u) + (r - u), r = d[++f], e = t, n !== 0 && (l[w++] = n);
+  for (; c < s; )
+    t = e + i, u = t - e, n = e - (t - u) + (i - u), i = o[++c], e = t, n !== 0 && (l[w++] = n);
+  return (e !== 0 || w === 0) && (l[w++] = e), w;
+}
+function A(a, d, s, o, l, e, t, n) {
+  return b(b(a, d, s, o, t), t, l, e, n);
+}
+function F(a, d, s, o) {
+  let l, e, t, n, u, r, i, f, c, w, p;
+  i = m * s, w = i - (i - s), p = s - w;
+  let h = d[0];
+  l = h * s, i = m * h, f = i - (i - h), c = h - f, t = c * p - (l - f * w - c * w - f * p);
+  let x = 0;
+  t !== 0 && (o[x++] = t);
+  for (let Q = 1; Q < a; Q++)
+    h = d[Q], n = h * s, i = m * h, f = i - (i - h), c = h - f, u = c * p - (n - f * w - c * w - f * p), e = l + u, r = e - l, t = l - (e - r) + (u - r), t !== 0 && (o[x++] = t), l = n + e, t = e - (l - n), t !== 0 && (o[x++] = t);
+  return (l !== 0 || x === 0) && (o[x++] = l), x;
+}
+function _(a, d) {
+  let s = d[0];
+  for (let o = 1; o < a; o++) s += d[o];
+  return s;
+}
+function g(a) {
+  return new Float64Array(a);
+}
+export {
+  v as epsilon,
+  _ as estimate,
+  y as resulterrbound,
+  F as scale,
+  m as splitter,
+  b as sum,
+  A as sum_three,
+  g as vec
+};
+//# sourceMappingURL=index.es597.js.map

package/dist/index.es597.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es597.js","sources":["../../../node_modules/@kninnug/constrainautor/node_modules/robust-predicates/esm/util.js"],"sourcesContent":["export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from original code\nexport function sum(elen, e, flen, f, h) {\n    let Q, Qnew, hh, bvirt;\n    let enow = e[0];\n    let fnow = f[0];\n    let eindex = 0;\n    let findex = 0;\n    if ((fnow > enow) === (fnow > -enow)) {\n        Q = enow;\n        enow = e[++eindex];\n    } else {\n        Q = fnow;\n        fnow = f[++findex];\n    }\n    let hindex = 0;\n    if (eindex < elen && findex < flen) {\n        if ((fnow > enow) === (fnow > -enow)) {\n            Qnew = enow + Q;\n            hh = Q - (Qnew - enow);\n            enow = e[++eindex];\n        } else {\n            Qnew = fnow + Q;\n            hh = Q - (Qnew - fnow);\n            fnow = f[++findex];\n        }\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        while (eindex < elen && findex < flen) {\n            if ((fnow > enow) === (fnow > -enow)) {\n                Qnew = Q + enow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (enow - bvirt);\n                enow = e[++eindex];\n            } else {\n                Qnew = Q + fnow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n                fnow = f[++findex];\n            }\n            Q = Qnew;\n            if (hh !== 0) {\n                h[hindex++] = hh;\n            }\n        }\n    }\n    while (eindex < elen) {\n        Qnew = Q + enow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (enow - bvirt);\n        enow = e[++eindex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    while (findex < flen) {\n        Qnew = Q + fnow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n        fnow = f[++findex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n    return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n    let Q, sum, hh, product1, product0;\n    let bvirt, c, ahi, alo, bhi, blo;\n\n    c = splitter * b;\n    bhi = c - (c - b);\n    blo = b - bhi;\n    let enow = e[0];\n    Q = enow * b;\n    c = splitter * enow;\n    ahi = c - (c - enow);\n    alo = enow - ahi;\n    hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n    let hindex = 0;\n    if (hh !== 0) {\n        h[hindex++] = hh;\n    }\n    for (let i = 1; i < elen; i++) {\n        enow = e[i];\n        product1 = enow * b;\n        c = splitter * enow;\n        ahi = c - (c - enow);\n        alo = enow - ahi;\n        product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n        sum = Q + product0;\n        bvirt = sum - Q;\n        hh = Q - (sum - bvirt) + (product0 - bvirt);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        Q = product1 + sum;\n        hh = sum - (Q - product1);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function negate(elen, e) {\n    for (let i = 0; i < elen; i++) e[i] = -e[i];\n    return elen;\n}\n\nexport function estimate(elen, e) {\n    let Q = e[0];\n    for (let i = 1; i < elen; i++) Q += e[i];\n    return Q;\n}\n\nexport function vec(n) {\n    return new Float64Array(n);\n}\n"],"names":["epsilon","splitter","resulterrbound","sum","elen","e","flen","f","h","Q","Qnew","hh","bvirt","enow","fnow","eindex","findex","hindex","sum_three","alen","a","blen","b","clen","c","tmp","out","scale","product1","product0","ahi","alo","bhi","blo","i","estimate","vec","n"],"mappings":"AAAO,MAAMA,IAAU,uBACVC,IAAW,WACXC,KAAkB,IAAI,IAAIF,KAAWA;AAG3C,SAASG,EAAIC,GAAMC,GAAGC,GAAMC,GAAGC,GAAG;AACrC,MAAIC,GAAGC,GAAMC,GAAIC,GACbC,IAAOR,EAAE,CAAC,GACVS,IAAOP,EAAE,CAAC,GACVQ,IAAS,GACTC,IAAS;AACb,EAAKF,IAAOD,KAAWC,IAAO,CAACD,KAC3BJ,IAAII,GACJA,IAAOR,EAAE,EAAEU,CAAM,MAEjBN,IAAIK,GACJA,IAAOP,EAAE,EAAES,CAAM;AAErB,MAAIC,IAAS;AACb,MAAIF,IAASX,KAAQY,IAASV;AAc1B,SAbKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOG,IAAOJ,GACdE,IAAKF,KAAKC,IAAOG,IACjBA,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOI,IAAOL,GACdE,IAAKF,KAAKC,IAAOI,IACjBA,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN,IAEXI,IAASX,KAAQY,IAASV;AAC7B,MAAKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAI1B,SAAOI,IAASX;AACZ,IAAAM,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,GACjBN,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,SAAOK,IAASV;AACZ,IAAAI,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,GACjBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,UAAIF,MAAM,KAAKQ,MAAW,OACtBT,EAAES,GAAQ,IAAIR,IAEXQ;AACX;AAEO,SAASC,EAAUC,GAAMC,GAAGC,GAAMC,GAAGC,GAAMC,GAAGC,GAAKC,GAAK;AAC3D,SAAOvB,EAAIA,EAAIgB,GAAMC,GAAGC,GAAMC,GAAGG,CAAG,GAAGA,GAAKF,GAAMC,GAAGE,CAAG;AAC5D;AAGO,SAASC,EAAMvB,GAAMC,GAAGiB,GAAGd,GAAG;AACjC,MAAIC,GAAGN,GAAKQ,GAAIiB,GAAUC,GACtBjB,GAAOY,GAAGM,GAAKC,GAAKC,GAAKC;AAE7B,EAAAT,IAAIvB,IAAWqB,GACfU,IAAMR,KAAKA,IAAIF,IACfW,IAAMX,IAAIU;AACV,MAAInB,IAAOR,EAAE,CAAC;AACd,EAAAI,IAAII,IAAOS,GACXE,IAAIvB,IAAWY,GACfiB,IAAMN,KAAKA,IAAIX,IACfkB,IAAMlB,IAAOiB,GACbnB,IAAKoB,IAAME,KAAOxB,IAAIqB,IAAME,IAAMD,IAAMC,IAAMF,IAAMG;AACpD,MAAIhB,IAAS;AACb,EAAIN,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAElB,WAASuB,IAAI,GAAGA,IAAI9B,GAAM8B;AACtB,IAAArB,IAAOR,EAAE6B,CAAC,GACVN,IAAWf,IAAOS,GAClBE,IAAIvB,IAAWY,GACfiB,IAAMN,KAAKA,IAAIX,IACfkB,IAAMlB,IAAOiB,GACbD,IAAWE,IAAME,KAAOL,IAAWE,IAAME,IAAMD,IAAMC,IAAMF,IAAMG,IACjE9B,IAAMM,IAAIoB,GACVjB,IAAQT,IAAMM,GACdE,IAAKF,KAAKN,IAAMS,MAAUiB,IAAWjB,IACjCD,MAAO,MACPH,EAAES,GAAQ,IAAIN,IAElBF,IAAImB,IAAWzB,GACfQ,IAAKR,KAAOM,IAAImB,IACZjB,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,UAAIF,MAAM,KAAKQ,MAAW,OACtBT,EAAES,GAAQ,IAAIR,IAEXQ;AACX;AAOO,SAASkB,EAAS/B,GAAMC,GAAG;AAC9B,MAAII,IAAIJ,EAAE,CAAC;AACX,WAAS6B,IAAI,GAAGA,IAAI9B,GAAM8B,IAAK,CAAAzB,KAAKJ,EAAE6B,CAAC;AACvC,SAAOzB;AACX;AAEO,SAAS2B,EAAIC,GAAG;AACnB,SAAO,IAAI,aAAaA,CAAC;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es598.js

@@ -0,0 +1,8 @@
+function e(t) {
+  var o = typeof t;
+  return o == "string" || o == "number" || o == "symbol" || o == "boolean" ? t !== "__proto__" : t === null;
+}
+export {
+  e as default
+};
+//# sourceMappingURL=index.es598.js.map

package/dist/index.es598.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es598.js","sources":["../../../node_modules/lodash-es/_isKeyable.js"],"sourcesContent":["/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n"],"names":["isKeyable","value","type"],"mappings":"AAOA,SAASA,EAAUC,GAAO;AACxB,MAAIC,IAAO,OAAOD;AAClB,SAAQC,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YAAYA,KAAQ,YACvED,MAAU,cACVA,MAAU;AACjB;","x_google_ignoreList":[0]}

package/dist/index.es599.js

@@ -0,0 +1,7 @@
+function l(u, e) {
+  return u?.[e];
+}
+export {
+  l as default
+};
+//# sourceMappingURL=index.es599.js.map

package/dist/index.es599.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es599.js","sources":["../../../node_modules/lodash-es/_getValue.js"],"sourcesContent":["/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n"],"names":["getValue","object","key"],"mappings":"AAQA,SAASA,EAASC,GAAQC,GAAK;AAC7B,SAAoCD,IAAOC,CAAG;AAChD;","x_google_ignoreList":[0]}

package/dist/index.es60.js

@@ -1,6 +1,6 @@
 import r from "./index.es94.js";
 import o from "./index.es188.js";
-import n from "./index.es237.js";
+import n from "./index.es254.js";
 const f = r(function(t) {
   return o(n(t, !0, !0));
 });

package/dist/index.es600.js

@@ -0,0 +1,31 @@
+const a = 11102230246251565e-32, p = 134217729, Q = (3 + 8 * a) * a;
+function b(f, s, d, o, x) {
+  let e, t, r, l, i = s[0], n = o[0], u = 0, c = 0;
+  n > i == n > -i ? (e = i, i = s[++u]) : (e = n, n = o[++c]);
+  let w = 0;
+  if (u < f && c < d)
+    for (n > i == n > -i ? (t = i + e, r = e - (t - i), i = s[++u]) : (t = n + e, r = e - (t - n), n = o[++c]), e = t, r !== 0 && (x[w++] = r); u < f && c < d; )
+      n > i == n > -i ? (t = e + i, l = t - e, r = e - (t - l) + (i - l), i = s[++u]) : (t = e + n, l = t - e, r = e - (t - l) + (n - l), n = o[++c]), e = t, r !== 0 && (x[w++] = r);
+  for (; u < f; )
+    t = e + i, l = t - e, r = e - (t - l) + (i - l), i = s[++u], e = t, r !== 0 && (x[w++] = r);
+  for (; c < d; )
+    t = e + n, l = t - e, r = e - (t - l) + (n - l), n = o[++c], e = t, r !== 0 && (x[w++] = r);
+  return (e !== 0 || w === 0) && (x[w++] = e), w;
+}
+function h(f, s) {
+  let d = s[0];
+  for (let o = 1; o < f; o++) d += s[o];
+  return d;
+}
+function m(f) {
+  return new Float64Array(f);
+}
+export {
+  a as epsilon,
+  h as estimate,
+  Q as resulterrbound,
+  p as splitter,
+  b as sum,
+  m as vec
+};
+//# sourceMappingURL=index.es600.js.map

package/dist/index.es600.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es600.js","sources":["../../../node_modules/@allmaps/triangulate/node_modules/robust-predicates/esm/util.js"],"sourcesContent":["export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from original code\nexport function sum(elen, e, flen, f, h) {\n    let Q, Qnew, hh, bvirt;\n    let enow = e[0];\n    let fnow = f[0];\n    let eindex = 0;\n    let findex = 0;\n    if ((fnow > enow) === (fnow > -enow)) {\n        Q = enow;\n        enow = e[++eindex];\n    } else {\n        Q = fnow;\n        fnow = f[++findex];\n    }\n    let hindex = 0;\n    if (eindex < elen && findex < flen) {\n        if ((fnow > enow) === (fnow > -enow)) {\n            Qnew = enow + Q;\n            hh = Q - (Qnew - enow);\n            enow = e[++eindex];\n        } else {\n            Qnew = fnow + Q;\n            hh = Q - (Qnew - fnow);\n            fnow = f[++findex];\n        }\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        while (eindex < elen && findex < flen) {\n            if ((fnow > enow) === (fnow > -enow)) {\n                Qnew = Q + enow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (enow - bvirt);\n                enow = e[++eindex];\n            } else {\n                Qnew = Q + fnow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n                fnow = f[++findex];\n            }\n            Q = Qnew;\n            if (hh !== 0) {\n                h[hindex++] = hh;\n            }\n        }\n    }\n    while (eindex < elen) {\n        Qnew = Q + enow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (enow - bvirt);\n        enow = e[++eindex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    while (findex < flen) {\n        Qnew = Q + fnow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n        fnow = f[++findex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n    return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n    let Q, sum, hh, product1, product0;\n    let bvirt, c, ahi, alo, bhi, blo;\n\n    c = splitter * b;\n    bhi = c - (c - b);\n    blo = b - bhi;\n    let enow = e[0];\n    Q = enow * b;\n    c = splitter * enow;\n    ahi = c - (c - enow);\n    alo = enow - ahi;\n    hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n    let hindex = 0;\n    if (hh !== 0) {\n        h[hindex++] = hh;\n    }\n    for (let i = 1; i < elen; i++) {\n        enow = e[i];\n        product1 = enow * b;\n        c = splitter * enow;\n        ahi = c - (c - enow);\n        alo = enow - ahi;\n        product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n        sum = Q + product0;\n        bvirt = sum - Q;\n        hh = Q - (sum - bvirt) + (product0 - bvirt);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        Q = product1 + sum;\n        hh = sum - (Q - product1);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function negate(elen, e) {\n    for (let i = 0; i < elen; i++) e[i] = -e[i];\n    return elen;\n}\n\nexport function estimate(elen, e) {\n    let Q = e[0];\n    for (let i = 1; i < elen; i++) Q += e[i];\n    return Q;\n}\n\nexport function vec(n) {\n    return new Float64Array(n);\n}\n"],"names":["epsilon","splitter","resulterrbound","sum","elen","e","flen","f","h","Q","Qnew","hh","bvirt","enow","fnow","eindex","findex","hindex","estimate","i","vec","n"],"mappings":"AAAO,MAAMA,IAAU,uBACVC,IAAW,WACXC,KAAkB,IAAI,IAAIF,KAAWA;AAG3C,SAASG,EAAIC,GAAMC,GAAGC,GAAMC,GAAGC,GAAG;AACrC,MAAIC,GAAGC,GAAMC,GAAIC,GACbC,IAAOR,EAAE,CAAC,GACVS,IAAOP,EAAE,CAAC,GACVQ,IAAS,GACTC,IAAS;AACb,EAAKF,IAAOD,KAAWC,IAAO,CAACD,KAC3BJ,IAAII,GACJA,IAAOR,EAAE,EAAEU,CAAM,MAEjBN,IAAIK,GACJA,IAAOP,EAAE,EAAES,CAAM;AAErB,MAAIC,IAAS;AACb,MAAIF,IAASX,KAAQY,IAASV;AAc1B,SAbKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOG,IAAOJ,GACdE,IAAKF,KAAKC,IAAOG,IACjBA,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOI,IAAOL,GACdE,IAAKF,KAAKC,IAAOI,IACjBA,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN,IAEXI,IAASX,KAAQY,IAASV;AAC7B,MAAKQ,IAAOD,KAAWC,IAAO,CAACD,KAC3BH,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,MAEjBL,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,IAErBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAI1B,SAAOI,IAASX;AACZ,IAAAM,IAAOD,IAAII,GACXD,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUC,IAAOD,IAClCC,IAAOR,EAAE,EAAEU,CAAM,GACjBN,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,SAAOK,IAASV;AACZ,IAAAI,IAAOD,IAAIK,GACXF,IAAQF,IAAOD,GACfE,IAAKF,KAAKC,IAAOE,MAAUE,IAAOF,IAClCE,IAAOP,EAAE,EAAES,CAAM,GACjBP,IAAIC,GACAC,MAAO,MACPH,EAAES,GAAQ,IAAIN;AAGtB,UAAIF,MAAM,KAAKQ,MAAW,OACtBT,EAAES,GAAQ,IAAIR,IAEXQ;AACX;AAsDO,SAASC,EAASd,GAAMC,GAAG;AAC9B,MAAII,IAAIJ,EAAE,CAAC;AACX,WAASc,IAAI,GAAGA,IAAIf,GAAMe,IAAK,CAAAV,KAAKJ,EAAEc,CAAC;AACvC,SAAOV;AACX;AAEO,SAASW,EAAIC,GAAG;AACnB,SAAO,IAAI,aAAaA,CAAC;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es601.js

@@ -0,0 +1,25 @@
+import { Image1Context as i, Image1ProfileSchema as t } from "./index.es230.js";
+import { Image2Context as m, Image2ProfileSchema as r } from "./index.es231.js";
+import { Image3ProfileSchema as a } from "./index.es436.js";
+import { ImageServiceTypesSchema as n } from "./index.es535.js";
+import { object as p, union as e, number as o, string as c, literal as l } from "./index.es432.js";
+const x = p({
+  "@id": c().url(),
+  "@type": n.optional(),
+  profile: e([
+    t,
+    r,
+    a
+  ]),
+  width: o().int().optional(),
+  height: o().int().optional(),
+  "@context": e([
+    i,
+    l("http://iiif.io/api/image/1/context.json"),
+    m
+  ]).optional()
+});
+export {
+  x as ImageService2Schema
+};
+//# sourceMappingURL=index.es601.js.map

package/dist/index.es601.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es601.js","sources":["../../../node_modules/@allmaps/iiif-parser/dist/schemas/image-service.2.js"],"sourcesContent":["import { z } from 'zod';\nimport { Image1ProfileSchema, Image1Context } from './image.1.js';\nimport { Image2ProfileSchema, Image2Context } from './image.2.js';\nimport { Image3ProfileSchema } from './image.3.js';\nimport { ImageServiceTypesSchema } from './shared.js';\n// TODO: also support Presentation API 2 with Image API 3\n// TODO: also support Image3Context (a string or an array of strings)\nexport const ImageService2Schema = z.object({\n    '@id': z.string().url(),\n    '@type': ImageServiceTypesSchema.optional(),\n    profile: z.union([\n        Image1ProfileSchema,\n        Image2ProfileSchema,\n        Image3ProfileSchema\n    ]),\n    width: z.number().int().optional(),\n    height: z.number().int().optional(),\n    '@context': z\n        .union([\n        Image1Context,\n        z.literal('http://iiif.io/api/image/1/context.json'),\n        Image2Context\n    ])\n        .optional()\n});\n"],"names":["ImageService2Schema","z.object","z.string","ImageServiceTypesSchema","z.union","Image1ProfileSchema","Image2ProfileSchema","Image3ProfileSchema","z.number","Image1Context","z.literal","Image2Context"],"mappings":";;;;;AAOO,MAAMA,IAAsBC,EAAS;AAAA,EACxC,OAAOC,EAAE,EAAS,IAAA;AAAA,EAClB,SAASC,EAAwB,SAAA;AAAA,EACjC,SAASC,EAAQ;AAAA,IACbC;AAAA,IACAC;AAAA,IACAC;AAAA,EAAA,CACH;AAAA,EACD,OAAOC,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,EACxB,QAAQA,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,EACzB,YAAYJ,EACD;AAAA,IACPK;AAAA,IACAC,EAAU,yCAAyC;AAAA,IACnDC;AAAA,EAAA,CACH,EACI,SAAA;AACT,CAAC;","x_google_ignoreList":[0]}

package/dist/index.es602.js

@@ -0,0 +1,37 @@
+import { Image2ProfileSchema as o } from "./index.es231.js";
+import { ImageServiceTypesSchema as n } from "./index.es535.js";
+import { union as a, object as t, number as e, literal as r, string as i, enum as l } from "./index.es432.js";
+const m = ["level0", "level1", "level2"], p = a([
+  t({
+    id: i().url(),
+    type: r("ImageService2"),
+    width: e().int().optional(),
+    height: e().int().optional(),
+    profile: o
+  }),
+  t({
+    "@id": i().url(),
+    "@type": r("ImageService2"),
+    width: e().int().optional(),
+    height: e().int().optional(),
+    profile: o
+  })
+]), c = t({
+  id: i().url(),
+  type: n,
+  width: e().int().optional(),
+  height: e().int().optional(),
+  profile: l(m).catch("level0"),
+  extraFormats: i().array().optional(),
+  preferredFormats: i().array().optional()
+}), v = a([
+  p,
+  c
+]);
+export {
+  v as ImageService3Schema,
+  p as Presentation3ImageService2Schema,
+  c as Presentation3ImageService3Schema,
+  m as complianceLevels
+};
+//# sourceMappingURL=index.es602.js.map

package/dist/index.es602.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es602.js","sources":["../../../node_modules/@allmaps/iiif-parser/dist/schemas/image-service.3.js"],"sourcesContent":["import { z } from 'zod';\nimport { Image2ProfileSchema } from './image.2.js';\nimport { ImageServiceTypesSchema } from './shared.js';\nexport const complianceLevels = ['level0', 'level1', 'level2'];\nexport const Presentation3ImageService2Schema = z.union([\n    z.object({\n        id: z.string().url(),\n        type: z.literal('ImageService2'),\n        width: z.number().int().optional(),\n        height: z.number().int().optional(),\n        profile: Image2ProfileSchema\n    }),\n    z.object({\n        '@id': z.string().url(),\n        '@type': z.literal('ImageService2'),\n        width: z.number().int().optional(),\n        height: z.number().int().optional(),\n        profile: Image2ProfileSchema\n    })\n]);\nexport const Presentation3ImageService3Schema = z.object({\n    id: z.string().url(),\n    type: ImageServiceTypesSchema,\n    width: z.number().int().optional(),\n    height: z.number().int().optional(),\n    profile: z.enum(complianceLevels).catch('level0'),\n    extraFormats: z.string().array().optional(),\n    preferredFormats: z.string().array().optional()\n});\nexport const ImageService3Schema = z.union([\n    Presentation3ImageService2Schema,\n    Presentation3ImageService3Schema\n]);\n"],"names":["complianceLevels","Presentation3ImageService2Schema","z.union","z.object","z.string","z.literal","z.number","Image2ProfileSchema","Presentation3ImageService3Schema","ImageServiceTypesSchema","z.enum","ImageService3Schema"],"mappings":";;;AAGO,MAAMA,IAAmB,CAAC,UAAU,UAAU,QAAQ,GAChDC,IAAmCC,EAAQ;AAAA,EACpDC,EAAS;AAAA,IACL,IAAIC,EAAE,EAAS,IAAA;AAAA,IACf,MAAMC,EAAU,eAAe;AAAA,IAC/B,OAAOC,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,IACxB,QAAQA,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,IACzB,SAASC;AAAA,EAAA,CACZ;AAAA,EACDJ,EAAS;AAAA,IACL,OAAOC,EAAE,EAAS,IAAA;AAAA,IAClB,SAASC,EAAU,eAAe;AAAA,IAClC,OAAOC,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,IACxB,QAAQA,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,IACzB,SAASC;AAAA,EAAA,CACZ;AACL,CAAC,GACYC,IAAmCL,EAAS;AAAA,EACrD,IAAIC,EAAE,EAAS,IAAA;AAAA,EACf,MAAMK;AAAA,EACN,OAAOH,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,EACxB,QAAQA,EAAE,EAAS,IAAA,EAAM,SAAA;AAAA,EACzB,SAASI,EAAOV,CAAgB,EAAE,MAAM,QAAQ;AAAA,EAChD,cAAcI,EAAE,EAAS,MAAA,EAAQ,SAAA;AAAA,EACjC,kBAAkBA,EAAE,EAAS,MAAA,EAAQ,SAAA;AACzC,CAAC,GACYO,IAAsBT,EAAQ;AAAA,EACvCD;AAAA,EACAO;AACJ,CAAC;","x_google_ignoreList":[0]}

package/dist/index.es603.js

@@ -0,0 +1,215 @@
+import { process as c } from "./index.es604.js";
+import { getEnumValues as y } from "./index.es609.js";
+const g = {
+  guid: "uuid",
+  url: "uri",
+  datetime: "date-time",
+  json_string: "json-string",
+  regex: ""
+  // do not set
+}, b = (s, t, i, r) => {
+  const e = i;
+  e.type = "string";
+  const { minimum: n, maximum: o, format: p, patterns: f, contentEncoding: a } = s._zod.bag;
+  if (typeof n == "number" && (e.minLength = n), typeof o == "number" && (e.maxLength = o), p && (e.format = g[p] ?? p, e.format === "" && delete e.format, p === "time" && delete e.format), a && (e.contentEncoding = a), f && f.size > 0) {
+    const l = [...f];
+    l.length === 1 ? e.pattern = l[0].source : l.length > 1 && (e.allOf = [
+      ...l.map((m) => ({
+        ...t.target === "draft-07" || t.target === "draft-04" || t.target === "openapi-3.0" ? { type: "string" } : {},
+        pattern: m.source
+      }))
+    ]);
+  }
+}, P = (s, t, i, r) => {
+  const e = i, { minimum: n, maximum: o, format: p, multipleOf: f, exclusiveMaximum: a, exclusiveMinimum: l } = s._zod.bag;
+  typeof p == "string" && p.includes("int") ? e.type = "integer" : e.type = "number";
+  const m = typeof l == "number" && l >= (n ?? Number.NEGATIVE_INFINITY), d = typeof a == "number" && a <= (o ?? Number.POSITIVE_INFINITY), u = t.target === "draft-04" || t.target === "openapi-3.0";
+  m ? u ? (e.minimum = l, e.exclusiveMinimum = !0) : e.exclusiveMinimum = l : typeof n == "number" && (e.minimum = n), d ? u ? (e.maximum = a, e.exclusiveMaximum = !0) : e.exclusiveMaximum = a : typeof o == "number" && (e.maximum = o), typeof f == "number" && (e.multipleOf = f);
+}, O = (s, t, i, r) => {
+  i.type = "boolean";
+}, v = (s, t, i, r) => {
+  i.not = {};
+}, z = (s, t, i, r) => {
+}, T = (s, t, i, r) => {
+  if (t.unrepresentable === "throw")
+    throw new Error("Date cannot be represented in JSON Schema");
+}, I = (s, t, i, r) => {
+  const e = s._zod.def, n = y(e.entries);
+  n.every((o) => typeof o == "number") && (i.type = "number"), n.every((o) => typeof o == "string") && (i.type = "string"), i.enum = n;
+}, S = (s, t, i, r) => {
+  const e = s._zod.def, n = [];
+  for (const o of e.values)
+    if (o === void 0) {
+      if (t.unrepresentable === "throw")
+        throw new Error("Literal `undefined` cannot be represented in JSON Schema");
+    } else if (typeof o == "bigint") {
+      if (t.unrepresentable === "throw")
+        throw new Error("BigInt literals cannot be represented in JSON Schema");
+      n.push(Number(o));
+    } else
+      n.push(o);
+  if (n.length !== 0) if (n.length === 1) {
+    const o = n[0];
+    i.type = o === null ? "null" : typeof o, t.target === "draft-04" || t.target === "openapi-3.0" ? i.enum = [o] : i.const = o;
+  } else
+    n.every((o) => typeof o == "number") && (i.type = "number"), n.every((o) => typeof o == "string") && (i.type = "string"), n.every((o) => typeof o == "boolean") && (i.type = "boolean"), n.every((o) => o === null) && (i.type = "null"), i.enum = n;
+}, w = (s, t, i, r) => {
+  if (t.unrepresentable === "throw")
+    throw new Error("Custom types cannot be represented in JSON Schema");
+}, N = (s, t, i, r) => {
+  if (t.unrepresentable === "throw")
+    throw new Error("Transforms cannot be represented in JSON Schema");
+}, E = (s, t, i, r) => {
+  const e = i, n = s._zod.def, { minimum: o, maximum: p } = s._zod.bag;
+  typeof o == "number" && (e.minItems = o), typeof p == "number" && (e.maxItems = p), e.type = "array", e.items = c(n.element, t, {
+    ...r,
+    path: [...r.path, "items"]
+  });
+}, k = (s, t, i, r) => {
+  const e = i, n = s._zod.def;
+  e.type = "object", e.properties = {};
+  const o = n.shape;
+  for (const a in o)
+    e.properties[a] = c(o[a], t, {
+      ...r,
+      path: [...r.path, "properties", a]
+    });
+  const p = new Set(Object.keys(o)), f = new Set([...p].filter((a) => {
+    const l = n.shape[a]._zod;
+    return t.io === "input" ? l.optin === void 0 : l.optout === void 0;
+  }));
+  f.size > 0 && (e.required = Array.from(f)), n.catchall?._zod.def.type === "never" ? e.additionalProperties = !1 : n.catchall ? n.catchall && (e.additionalProperties = c(n.catchall, t, {
+    ...r,
+    path: [...r.path, "additionalProperties"]
+  })) : t.io === "output" && (e.additionalProperties = !1);
+}, J = (s, t, i, r) => {
+  const e = s._zod.def, n = e.inclusive === !1, o = e.options.map((p, f) => c(p, t, {
+    ...r,
+    path: [...r.path, n ? "oneOf" : "anyOf", f]
+  }));
+  n ? i.oneOf = o : i.anyOf = o;
+}, j = (s, t, i, r) => {
+  const e = s._zod.def, n = c(e.left, t, {
+    ...r,
+    path: [...r.path, "allOf", 0]
+  }), o = c(e.right, t, {
+    ...r,
+    path: [...r.path, "allOf", 1]
+  }), p = (a) => "allOf" in a && Object.keys(a).length === 1, f = [
+    ...p(n) ? n.allOf : [n],
+    ...p(o) ? o.allOf : [o]
+  ];
+  i.allOf = f;
+}, M = (s, t, i, r) => {
+  const e = i, n = s._zod.def;
+  e.type = "array";
+  const o = t.target === "draft-2020-12" ? "prefixItems" : "items", p = t.target === "draft-2020-12" || t.target === "openapi-3.0" ? "items" : "additionalItems", f = n.items.map((d, u) => c(d, t, {
+    ...r,
+    path: [...r.path, o, u]
+  })), a = n.rest ? c(n.rest, t, {
+    ...r,
+    path: [...r.path, p, ...t.target === "openapi-3.0" ? [n.items.length] : []]
+  }) : null;
+  t.target === "draft-2020-12" ? (e.prefixItems = f, a && (e.items = a)) : t.target === "openapi-3.0" ? (e.items = {
+    anyOf: f
+  }, a && e.items.anyOf.push(a), e.minItems = f.length, a || (e.maxItems = f.length)) : (e.items = f, a && (e.additionalItems = a));
+  const { minimum: l, maximum: m } = s._zod.bag;
+  typeof l == "number" && (e.minItems = l), typeof m == "number" && (e.maxItems = m);
+}, V = (s, t, i, r) => {
+  const e = i, n = s._zod.def;
+  e.type = "object";
+  const o = n.keyType, f = o._zod.bag?.patterns;
+  if (n.mode === "loose" && f && f.size > 0) {
+    const l = c(n.valueType, t, {
+      ...r,
+      path: [...r.path, "patternProperties", "*"]
+    });
+    e.patternProperties = {};
+    for (const m of f)
+      e.patternProperties[m.source] = l;
+  } else
+    (t.target === "draft-07" || t.target === "draft-2020-12") && (e.propertyNames = c(n.keyType, t, {
+      ...r,
+      path: [...r.path, "propertyNames"]
+    })), e.additionalProperties = c(n.valueType, t, {
+      ...r,
+      path: [...r.path, "additionalProperties"]
+    });
+  const a = o._zod.values;
+  if (a) {
+    const l = [...a].filter((m) => typeof m == "string" || typeof m == "number");
+    l.length > 0 && (e.required = l);
+  }
+}, q = (s, t, i, r) => {
+  const e = s._zod.def, n = c(e.innerType, t, r), o = t.seen.get(s);
+  t.target === "openapi-3.0" ? (o.ref = e.innerType, i.nullable = !0) : i.anyOf = [n, { type: "null" }];
+}, B = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType;
+}, K = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType, i.default = JSON.parse(JSON.stringify(e.defaultValue));
+}, L = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType, t.io === "input" && (i._prefault = JSON.parse(JSON.stringify(e.defaultValue)));
+}, x = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType;
+  let o;
+  try {
+    o = e.catchValue(void 0);
+  } catch {
+    throw new Error("Dynamic catch values are not supported in JSON Schema");
+  }
+  i.default = o;
+}, A = (s, t, i, r) => {
+  const e = s._zod.def, n = e.in._zod.traits.has("$ZodTransform"), o = t.io === "input" ? n ? e.out : e.in : e.out;
+  c(o, t, r);
+  const p = t.seen.get(s);
+  p.ref = o;
+}, D = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType, i.readOnly = !0;
+}, F = (s, t, i, r) => {
+  const e = s._zod.def;
+  c(e.innerType, t, r);
+  const n = t.seen.get(s);
+  n.ref = e.innerType;
+};
+export {
+  E as arrayProcessor,
+  O as booleanProcessor,
+  x as catchProcessor,
+  w as customProcessor,
+  T as dateProcessor,
+  K as defaultProcessor,
+  I as enumProcessor,
+  j as intersectionProcessor,
+  S as literalProcessor,
+  v as neverProcessor,
+  B as nonoptionalProcessor,
+  q as nullableProcessor,
+  P as numberProcessor,
+  k as objectProcessor,
+  F as optionalProcessor,
+  A as pipeProcessor,
+  L as prefaultProcessor,
+  D as readonlyProcessor,
+  V as recordProcessor,
+  b as stringProcessor,
+  N as transformProcessor,
+  M as tupleProcessor,
+  J as unionProcessor,
+  z as unknownProcessor
+};
+//# sourceMappingURL=index.es603.js.map