@performant-software/core-data 2.1.3-beta.8 → 2.1.4-beta.0

package/dist/index.es385.js

@@ -1,54 +1,14 @@
-import { __exports as r } from "./index.es392.js";
-import "./index.es291.js";
-import { __exports as b } from "./index.es298.js";
-Object.defineProperty(r, "__esModule", { value: !0 });
-r.prevElementSibling = r.nextElementSibling = r.getName = r.hasAttrib = r.getAttributeValue = r.getSiblings = r.getParent = r.getChildren = void 0;
-var u = b;
-function o(t) {
-  return (0, u.hasChildren)(t) ? t.children : [];
-}
-r.getChildren = o;
-function s(t) {
-  return t.parent || null;
-}
-r.getParent = s;
-function v(t) {
-  var n, e, g = s(t);
-  if (g != null)
-    return o(g);
-  for (var a = [t], i = t.prev, l = t.next; i != null; )
-    a.unshift(i), n = i, i = n.prev;
-  for (; l != null; )
-    a.push(l), e = l, l = e.next;
-  return a;
-}
-r.getSiblings = v;
-function p(t, n) {
-  var e;
-  return (e = t.attribs) === null || e === void 0 ? void 0 : e[n];
-}
-r.getAttributeValue = p;
-function h(t, n) {
-  return t.attribs != null && Object.prototype.hasOwnProperty.call(t.attribs, n) && t.attribs[n] != null;
-}
-r.hasAttrib = h;
-function f(t) {
-  return t.name;
-}
-r.getName = f;
-function d(t) {
-  for (var n, e = t.next; e !== null && !(0, u.isTag)(e); )
-    n = e, e = n.next;
-  return e;
-}
-r.nextElementSibling = d;
-function c(t) {
-  for (var n, e = t.prev; e !== null && !(0, u.isTag)(e); )
-    n = e, e = n.prev;
-  return e;
-}
-r.prevElementSibling = c;
+import { getDefaultExportFromCjs as r } from "./index.es141.js";
+import { s as a } from "./index.es463.js";
+import { p as o } from "./index.es464.js";
+import { f as s } from "./index.es465.js";
+var t = a, f = o, m = s, i = {
+  formats: m,
+  parse: f,
+  stringify: t
+};
+const l = /* @__PURE__ */ r(i);
 export {
-  r as default
+  l as default
 };
 //# sourceMappingURL=index.es385.js.map

package/dist/index.es385.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es385.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/traversal.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.prevElementSibling = exports.nextElementSibling = exports.getName = exports.hasAttrib = exports.getAttributeValue = exports.getSiblings = exports.getParent = exports.getChildren = void 0;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Get a node's children.\n *\n * @category Traversal\n * @param elem Node to get the children of.\n * @returns `elem`'s children, or an empty array.\n */\nfunction getChildren(elem) {\n    return (0, domhandler_1.hasChildren)(elem) ? elem.children : [];\n}\nexports.getChildren = getChildren;\n/**\n * Get a node's parent.\n *\n * @category Traversal\n * @param elem Node to get the parent of.\n * @returns `elem`'s parent node, or `null` if `elem` is a root node.\n */\nfunction getParent(elem) {\n    return elem.parent || null;\n}\nexports.getParent = getParent;\n/**\n * Gets an elements siblings, including the element itself.\n *\n * Attempts to get the children through the element's parent first. If we don't\n * have a parent (the element is a root node), we walk the element's `prev` &\n * `next` to get all remaining nodes.\n *\n * @category Traversal\n * @param elem Element to get the siblings of.\n * @returns `elem`'s siblings, including `elem`.\n */\nfunction getSiblings(elem) {\n    var _a, _b;\n    var parent = getParent(elem);\n    if (parent != null)\n        return getChildren(parent);\n    var siblings = [elem];\n    var prev = elem.prev, next = elem.next;\n    while (prev != null) {\n        siblings.unshift(prev);\n        (_a = prev, prev = _a.prev);\n    }\n    while (next != null) {\n        siblings.push(next);\n        (_b = next, next = _b.next);\n    }\n    return siblings;\n}\nexports.getSiblings = getSiblings;\n/**\n * Gets an attribute from an element.\n *\n * @category Traversal\n * @param elem Element to check.\n * @param name Attribute name to retrieve.\n * @returns The element's attribute value, or `undefined`.\n */\nfunction getAttributeValue(elem, name) {\n    var _a;\n    return (_a = elem.attribs) === null || _a === void 0 ? void 0 : _a[name];\n}\nexports.getAttributeValue = getAttributeValue;\n/**\n * Checks whether an element has an attribute.\n *\n * @category Traversal\n * @param elem Element to check.\n * @param name Attribute name to look for.\n * @returns Returns whether `elem` has the attribute `name`.\n */\nfunction hasAttrib(elem, name) {\n    return (elem.attribs != null &&\n        Object.prototype.hasOwnProperty.call(elem.attribs, name) &&\n        elem.attribs[name] != null);\n}\nexports.hasAttrib = hasAttrib;\n/**\n * Get the tag name of an element.\n *\n * @category Traversal\n * @param elem The element to get the name for.\n * @returns The tag name of `elem`.\n */\nfunction getName(elem) {\n    return elem.name;\n}\nexports.getName = getName;\n/**\n * Returns the next element sibling of a node.\n *\n * @category Traversal\n * @param elem The element to get the next sibling of.\n * @returns `elem`'s next sibling that is a tag, or `null` if there is no next\n * sibling.\n */\nfunction nextElementSibling(elem) {\n    var _a;\n    var next = elem.next;\n    while (next !== null && !(0, domhandler_1.isTag)(next))\n        (_a = next, next = _a.next);\n    return next;\n}\nexports.nextElementSibling = nextElementSibling;\n/**\n * Returns the previous element sibling of a node.\n *\n * @category Traversal\n * @param elem The element to get the previous sibling of.\n * @returns `elem`'s previous sibling that is a tag, or `null` if there is no\n * previous sibling.\n */\nfunction prevElementSibling(elem) {\n    var _a;\n    var prev = elem.prev;\n    while (prev !== null && !(0, domhandler_1.isTag)(prev))\n        (_a = prev, prev = _a.prev);\n    return prev;\n}\nexports.prevElementSibling = prevElementSibling;\n//# sourceMappingURL=traversal.js.map"],"names":["traversal","domhandler_1","require$$0","getChildren","elem","getParent","getSiblings","_a","_b","parent","siblings","prev","next","getAttributeValue","name","hasAttrib","getName","nextElementSibling","prevElementSibling"],"mappings":";;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,qBAA0DA,EAAA,+CAAsCA,EAAA,oBAA4BA,EAAA,cAA8BA,EAAA,4BAAkC;AAC5L,IAAIC,IAAeC;AAQnB,SAASC,EAAYC,GAAM;AACvB,aAAWH,EAAa,aAAaG,CAAI,IAAIA,EAAK,WAAW;AACjE;AACsBJ,EAAA,cAAAG;AAQtB,SAASE,EAAUD,GAAM;AACrB,SAAOA,EAAK,UAAU;AAC1B;AACoBJ,EAAA,YAAAK;AAYpB,SAASC,EAAYF,GAAM;AACvB,MAAIG,GAAIC,GACJC,IAASJ,EAAUD,CAAI;AAC3B,MAAIK,KAAU;AACV,WAAON,EAAYM,CAAM;AAG7B,WAFIC,IAAW,CAACN,CAAI,GAChBO,IAAOP,EAAK,MAAMQ,IAAOR,EAAK,MAC3BO,KAAQ;AACX,IAAAD,EAAS,QAAQC,CAAI,GACpBJ,IAAKI,GAAMA,IAAOJ,EAAG;AAE1B,SAAOK,KAAQ;AACX,IAAAF,EAAS,KAAKE,CAAI,GACjBJ,IAAKI,GAAMA,IAAOJ,EAAG;AAEnB,SAAAE;AACX;AACsBV,EAAA,cAAAM;AAStB,SAASO,EAAkBT,GAAMU,GAAM;AAC/B,MAAAP;AACI,UAAAA,IAAKH,EAAK,aAAa,QAAQG,MAAO,SAAS,SAASA,EAAGO,CAAI;AAC3E;AAC4Bd,EAAA,oBAAAa;AAS5B,SAASE,EAAUX,GAAMU,GAAM;AAC3B,SAAQV,EAAK,WAAW,QACpB,OAAO,UAAU,eAAe,KAAKA,EAAK,SAASU,CAAI,KACvDV,EAAK,QAAQU,CAAI,KAAK;AAC9B;AACoBd,EAAA,YAAAe;AAQpB,SAASC,EAAQZ,GAAM;AACnB,SAAOA,EAAK;AAChB;AACkBJ,EAAA,UAAAgB;AASlB,SAASC,EAAmBb,GAAM;AAG9B,WAFIG,GACAK,IAAOR,EAAK,MACTQ,MAAS,QAAQ,KAAKX,EAAa,OAAOW,CAAI;AAChD,IAAAL,IAAKK,GAAMA,IAAOL,EAAG;AACnB,SAAAK;AACX;AAC6BZ,EAAA,qBAAAiB;AAS7B,SAASC,EAAmBd,GAAM;AAG9B,WAFIG,GACAI,IAAOP,EAAK,MACTO,MAAS,QAAQ,KAAKV,EAAa,OAAOU,CAAI;AAChD,IAAAJ,IAAKI,GAAMA,IAAOJ,EAAG;AACnB,SAAAI;AACX;AACAX,EAAA,qBAA6BkB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es385.js","sources":["../node_modules/qs/lib/index.js"],"sourcesContent":["'use strict';\n\nvar stringify = require('./stringify');\nvar parse = require('./parse');\nvar formats = require('./formats');\n\nmodule.exports = {\n    formats: formats,\n    parse: parse,\n    stringify: stringify\n};\n"],"names":["stringify","require$$0","parse","require$$1","formats","require$$2","lib"],"mappings":";;;;AAEA,IAAIA,IAAYC,GACZC,IAAQC,GACRC,IAAUC,GAEdC,IAAiB;AAAA,EACb,SAAAF;AAAA,EACA,OAAAF;AAAA,EACA,WAAAF;AACJ;;","x_google_ignoreList":[0]}

package/dist/index.es386.js

@@ -1,65 +1,13 @@
-import { __exports as e } from "./index.es393.js";
-Object.defineProperty(e, "__esModule", { value: !0 });
-e.prepend = e.prependChild = e.append = e.appendChild = e.replaceElement = e.removeElement = void 0;
-function v(r) {
-  if (r.prev && (r.prev.next = r.next), r.next && (r.next.prev = r.prev), r.parent) {
-    var n = r.parent.children, p = n.lastIndexOf(r);
-    p >= 0 && n.splice(p, 1);
-  }
-  r.next = null, r.prev = null, r.parent = null;
-}
-e.removeElement = v;
-function i(r, n) {
-  var p = n.prev = r.prev;
-  p && (p.next = n);
-  var t = n.next = r.next;
-  t && (t.prev = n);
-  var a = n.parent = r.parent;
-  if (a) {
-    var f = a.children;
-    f[f.lastIndexOf(r)] = n, r.parent = null;
-  }
-}
-e.replaceElement = i;
-function u(r, n) {
-  if (v(n), n.next = null, n.parent = r, r.children.push(n) > 1) {
-    var p = r.children[r.children.length - 2];
-    p.next = n, n.prev = p;
-  } else
-    n.prev = null;
-}
-e.appendChild = u;
-function d(r, n) {
-  v(n);
-  var p = r.parent, t = r.next;
-  if (n.next = t, n.prev = r, r.next = n, n.parent = p, t) {
-    if (t.prev = n, p) {
-      var a = p.children;
-      a.splice(a.lastIndexOf(t), 0, n);
+function f(n) {
+  var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {
+    fallback: function() {
     }
-  } else
-    p && p.children.push(n);
-}
-e.append = d;
-function o(r, n) {
-  if (v(n), n.parent = r, n.prev = null, r.children.unshift(n) !== 1) {
-    var p = r.children[1];
-    p.prev = n, n.next = p;
-  } else
-    n.next = null;
-}
-e.prependChild = o;
-function x(r, n) {
-  v(n);
-  var p = r.parent;
-  if (p) {
-    var t = p.children;
-    t.splice(t.indexOf(r), 0, n);
-  }
-  r.prev && (r.prev.next = n), n.parent = p, n.prev = r.prev, n.next = r, r.prev = n;
+  }, r = e.fallback;
+  return typeof window > "u" ? r() : n({
+    window
+  });
 }
-e.prepend = x;
 export {
-  e as default
+  f as safelyRunOnBrowser
 };
 //# sourceMappingURL=index.es386.js.map

package/dist/index.es386.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es386.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/manipulation.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.prepend = exports.prependChild = exports.append = exports.appendChild = exports.replaceElement = exports.removeElement = void 0;\n/**\n * Remove an element from the dom\n *\n * @category Manipulation\n * @param elem The element to be removed\n */\nfunction removeElement(elem) {\n    if (elem.prev)\n        elem.prev.next = elem.next;\n    if (elem.next)\n        elem.next.prev = elem.prev;\n    if (elem.parent) {\n        var childs = elem.parent.children;\n        var childsIndex = childs.lastIndexOf(elem);\n        if (childsIndex >= 0) {\n            childs.splice(childsIndex, 1);\n        }\n    }\n    elem.next = null;\n    elem.prev = null;\n    elem.parent = null;\n}\nexports.removeElement = removeElement;\n/**\n * Replace an element in the dom\n *\n * @category Manipulation\n * @param elem The element to be replaced\n * @param replacement The element to be added\n */\nfunction replaceElement(elem, replacement) {\n    var prev = (replacement.prev = elem.prev);\n    if (prev) {\n        prev.next = replacement;\n    }\n    var next = (replacement.next = elem.next);\n    if (next) {\n        next.prev = replacement;\n    }\n    var parent = (replacement.parent = elem.parent);\n    if (parent) {\n        var childs = parent.children;\n        childs[childs.lastIndexOf(elem)] = replacement;\n        elem.parent = null;\n    }\n}\nexports.replaceElement = replaceElement;\n/**\n * Append a child to an element.\n *\n * @category Manipulation\n * @param parent The element to append to.\n * @param child The element to be added as a child.\n */\nfunction appendChild(parent, child) {\n    removeElement(child);\n    child.next = null;\n    child.parent = parent;\n    if (parent.children.push(child) > 1) {\n        var sibling = parent.children[parent.children.length - 2];\n        sibling.next = child;\n        child.prev = sibling;\n    }\n    else {\n        child.prev = null;\n    }\n}\nexports.appendChild = appendChild;\n/**\n * Append an element after another.\n *\n * @category Manipulation\n * @param elem The element to append after.\n * @param next The element be added.\n */\nfunction append(elem, next) {\n    removeElement(next);\n    var parent = elem.parent;\n    var currNext = elem.next;\n    next.next = currNext;\n    next.prev = elem;\n    elem.next = next;\n    next.parent = parent;\n    if (currNext) {\n        currNext.prev = next;\n        if (parent) {\n            var childs = parent.children;\n            childs.splice(childs.lastIndexOf(currNext), 0, next);\n        }\n    }\n    else if (parent) {\n        parent.children.push(next);\n    }\n}\nexports.append = append;\n/**\n * Prepend a child to an element.\n *\n * @category Manipulation\n * @param parent The element to prepend before.\n * @param child The element to be added as a child.\n */\nfunction prependChild(parent, child) {\n    removeElement(child);\n    child.parent = parent;\n    child.prev = null;\n    if (parent.children.unshift(child) !== 1) {\n        var sibling = parent.children[1];\n        sibling.prev = child;\n        child.next = sibling;\n    }\n    else {\n        child.next = null;\n    }\n}\nexports.prependChild = prependChild;\n/**\n * Prepend an element before another.\n *\n * @category Manipulation\n * @param elem The element to prepend before.\n * @param prev The element be added.\n */\nfunction prepend(elem, prev) {\n    removeElement(prev);\n    var parent = elem.parent;\n    if (parent) {\n        var childs = parent.children;\n        childs.splice(childs.indexOf(elem), 0, prev);\n    }\n    if (elem.prev) {\n        elem.prev.next = prev;\n    }\n    prev.parent = parent;\n    prev.prev = elem.prev;\n    prev.next = elem;\n    elem.prev = prev;\n}\nexports.prepend = prepend;\n//# sourceMappingURL=manipulation.js.map"],"names":["manipulation","removeElement","elem","childs","childsIndex","replaceElement","replacement","prev","next","parent","appendChild","child","sibling","append","currNext","prependChild","prepend"],"mappings":";AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,UAAkBA,EAAA,eAAuBA,EAAA,SAAiBA,EAAA,cAAsBA,EAAA,iBAAyBA,EAAA,gBAAwB;AAOjI,SAASC,EAAcC,GAAM;AAKzB,MAJIA,EAAK,SACAA,EAAA,KAAK,OAAOA,EAAK,OACtBA,EAAK,SACAA,EAAA,KAAK,OAAOA,EAAK,OACtBA,EAAK,QAAQ;AACT,QAAAC,IAASD,EAAK,OAAO,UACrBE,IAAcD,EAAO,YAAYD,CAAI;AACzC,IAAIE,KAAe,KACRD,EAAA,OAAOC,GAAa,CAAC;AAAA,EAEpC;AACA,EAAAF,EAAK,OAAO,MACZA,EAAK,OAAO,MACZA,EAAK,SAAS;AAClB;AACwBF,EAAA,gBAAAC;AAQxB,SAASI,EAAeH,GAAMI,GAAa;AACnC,MAAAC,IAAQD,EAAY,OAAOJ,EAAK;AACpC,EAAIK,MACAA,EAAK,OAAOD;AAEZ,MAAAE,IAAQF,EAAY,OAAOJ,EAAK;AACpC,EAAIM,MACAA,EAAK,OAAOF;AAEZ,MAAAG,IAAUH,EAAY,SAASJ,EAAK;AACxC,MAAIO,GAAQ;AACR,QAAIN,IAASM,EAAO;AACpB,IAAAN,EAAOA,EAAO,YAAYD,CAAI,CAAC,IAAII,GACnCJ,EAAK,SAAS;AAAA,EAClB;AACJ;AACyBF,EAAA,iBAAAK;AAQzB,SAASK,EAAYD,GAAQE,GAAO;AAIhC,MAHAV,EAAcU,CAAK,GACnBA,EAAM,OAAO,MACbA,EAAM,SAASF,GACXA,EAAO,SAAS,KAAKE,CAAK,IAAI,GAAG;AACjC,QAAIC,IAAUH,EAAO,SAASA,EAAO,SAAS,SAAS,CAAC;AACxD,IAAAG,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,EAAA;AAGb,IAAAD,EAAM,OAAO;AAErB;AACsBX,EAAA,cAAAU;AAQtB,SAASG,EAAOX,GAAMM,GAAM;AACxB,EAAAP,EAAcO,CAAI;AAClB,MAAIC,IAASP,EAAK,QACdY,IAAWZ,EAAK;AAKpB,MAJAM,EAAK,OAAOM,GACZN,EAAK,OAAON,GACZA,EAAK,OAAOM,GACZA,EAAK,SAASC,GACVK;AAEA,QADAA,EAAS,OAAON,GACZC,GAAQ;AACR,UAAIN,IAASM,EAAO;AACpB,MAAAN,EAAO,OAAOA,EAAO,YAAYW,CAAQ,GAAG,GAAGN,CAAI;AAAA,IACvD;AAAA;IAEKC,KACEA,EAAA,SAAS,KAAKD,CAAI;AAEjC;AACiBR,EAAA,SAAAa;AAQjB,SAASE,EAAaN,GAAQE,GAAO;AAIjC,MAHAV,EAAcU,CAAK,GACnBA,EAAM,SAASF,GACfE,EAAM,OAAO,MACTF,EAAO,SAAS,QAAQE,CAAK,MAAM,GAAG;AAClC,QAAAC,IAAUH,EAAO,SAAS,CAAC;AAC/B,IAAAG,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,EAAA;AAGb,IAAAD,EAAM,OAAO;AAErB;AACuBX,EAAA,eAAAe;AAQvB,SAASC,EAAQd,GAAMK,GAAM;AACzB,EAAAN,EAAcM,CAAI;AAClB,MAAIE,IAASP,EAAK;AAClB,MAAIO,GAAQ;AACR,QAAIN,IAASM,EAAO;AACpB,IAAAN,EAAO,OAAOA,EAAO,QAAQD,CAAI,GAAG,GAAGK,CAAI;AAAA,EAC/C;AACA,EAAIL,EAAK,SACLA,EAAK,KAAK,OAAOK,IAErBA,EAAK,SAASE,GACdF,EAAK,OAAOL,EAAK,MACjBK,EAAK,OAAOL,GACZA,EAAK,OAAOK;AAChB;AACAP,EAAA,UAAkBgB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es386.js","sources":["../node_modules/instantsearch.js/es/lib/utils/safelyRunOnBrowser.js"],"sourcesContent":["// eslint-disable-next-line no-restricted-globals\n\n/**\n * Runs code on browser environments safely.\n */\nexport function safelyRunOnBrowser(callback) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n      fallback: function fallback() {\n        return undefined;\n      }\n    },\n    fallback = _ref.fallback;\n  // eslint-disable-next-line no-restricted-globals\n  if (typeof window === 'undefined') {\n    return fallback();\n  }\n\n  // eslint-disable-next-line no-restricted-globals\n  return callback({\n    window: window\n  });\n}"],"names":["safelyRunOnBrowser","callback","_ref","fallback"],"mappings":"AAKO,SAASA,EAAmBC,GAAU;AACvC,MAAAC,IAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAAA,IAC3E,UAAU,WAAoB;AAAA,IAE9B;AAAA,EAAA,GAEFC,IAAWD,EAAK;AAEd,SAAA,OAAO,SAAW,MACbC,EAAS,IAIXF,EAAS;AAAA,IACd;AAAA,EAAA,CACD;AACH;","x_google_ignoreList":[0]}

package/dist/index.es387.js

@@ -1,64 +1,8 @@
-import { __exports as e } from "./index.es394.js";
-import "./index.es291.js";
-import { __exports as v } from "./index.es298.js";
-Object.defineProperty(e, "__esModule", { value: !0 });
-e.findAll = e.existsOne = e.findOne = e.findOneChild = e.find = e.filter = void 0;
-var a = v;
-function c(t, f, i, n) {
-  return i === void 0 && (i = !0), n === void 0 && (n = 1 / 0), d(t, Array.isArray(f) ? f : [f], i, n);
+function t(n) {
+  var o = n.name, e = n.connector, c = e === void 0 ? !1 : e;
+  return ["https://www.algolia.com/doc/api-reference/widgets/", o, "/js/", c ? "#connector" : ""].join("");
 }
-e.filter = c;
-function d(t, f, i, n) {
-  for (var u = [], r = [f], l = [0]; ; ) {
-    if (l[0] >= r[0].length) {
-      if (l.length === 1)
-        return u;
-      r.shift(), l.shift();
-      continue;
-    }
-    var h = r[0][l[0]++];
-    if (t(h) && (u.push(h), --n <= 0))
-      return u;
-    i && (0, a.hasChildren)(h) && h.children.length > 0 && (l.unshift(0), r.unshift(h.children));
-  }
-}
-e.find = d;
-function g(t, f) {
-  return f.find(t);
-}
-e.findOneChild = g;
-function o(t, f, i) {
-  i === void 0 && (i = !0);
-  for (var n = null, u = 0; u < f.length && !n; u++) {
-    var r = f[u];
-    if ((0, a.isTag)(r))
-      t(r) ? n = r : i && r.children.length > 0 && (n = o(t, r.children, !0));
-    else
-      continue;
-  }
-  return n;
-}
-e.findOne = o;
-function s(t, f) {
-  return f.some(function(i) {
-    return (0, a.isTag)(i) && (t(i) || s(t, i.children));
-  });
-}
-e.existsOne = s;
-function O(t, f) {
-  for (var i = [], n = [f], u = [0]; ; ) {
-    if (u[0] >= n[0].length) {
-      if (n.length === 1)
-        return i;
-      n.shift(), u.shift();
-      continue;
-    }
-    var r = n[0][u[0]++];
-    (0, a.isTag)(r) && (t(r) && i.push(r), r.children.length > 0 && (u.unshift(0), n.unshift(r.children)));
-  }
-}
-e.findAll = O;
 export {
-  e as default
+  t as createDocumentationLink
 };
 //# sourceMappingURL=index.es387.js.map

package/dist/index.es387.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es387.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.findAll = exports.existsOne = exports.findOne = exports.findOneChild = exports.find = exports.filter = void 0;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param node Node to search. Will be included in the result set if it matches.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction filter(test, node, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return find(test, Array.isArray(node) ? node : [node], recurse, limit);\n}\nexports.filter = filter;\n/**\n * Search an array of nodes and their children for nodes passing a test function.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction find(test, nodes, recurse, limit) {\n    var result = [];\n    /** Stack of the arrays we are looking at. */\n    var nodeStack = [nodes];\n    /** Stack of the indices within the arrays. */\n    var indexStack = [0];\n    for (;;) {\n        // First, check if the current array has any more elements to look at.\n        if (indexStack[0] >= nodeStack[0].length) {\n            // If we have no more arrays to look at, we are done.\n            if (indexStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (test(elem)) {\n            result.push(elem);\n            if (--limit <= 0)\n                return result;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            /*\n             * Add the children to the stack. We are depth-first, so this is\n             * the next array we look at.\n             */\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\nexports.find = find;\n/**\n * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns The first node in the array that passes `test`.\n * @deprecated Use `Array.prototype.find` directly.\n */\nfunction findOneChild(test, nodes) {\n    return nodes.find(test);\n}\nexports.findOneChild = findOneChild;\n/**\n * Finds one element in a tree that passes a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Node or array of nodes to search.\n * @param recurse Also consider child nodes.\n * @returns The first node that passes `test`.\n */\nfunction findOne(test, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    var elem = null;\n    for (var i = 0; i < nodes.length && !elem; i++) {\n        var node = nodes[i];\n        if (!(0, domhandler_1.isTag)(node)) {\n            continue;\n        }\n        else if (test(node)) {\n            elem = node;\n        }\n        else if (recurse && node.children.length > 0) {\n            elem = findOne(test, node.children, true);\n        }\n    }\n    return elem;\n}\nexports.findOne = findOne;\n/**\n * Checks if a tree of nodes contains at least one node passing a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns Whether a tree of nodes contains at least one node passing the test.\n */\nfunction existsOne(test, nodes) {\n    return nodes.some(function (checked) {\n        return (0, domhandler_1.isTag)(checked) &&\n            (test(checked) || existsOne(test, checked.children));\n    });\n}\nexports.existsOne = existsOne;\n/**\n * Search an array of nodes and their children for elements passing a test function.\n *\n * Same as `find`, but limited to elements and with less options, leading to reduced complexity.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns All nodes passing `test`.\n */\nfunction findAll(test, nodes) {\n    var result = [];\n    var nodeStack = [nodes];\n    var indexStack = [0];\n    for (;;) {\n        if (indexStack[0] >= nodeStack[0].length) {\n            if (nodeStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (!(0, domhandler_1.isTag)(elem))\n            continue;\n        if (test(elem))\n            result.push(elem);\n        if (elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\nexports.findAll = findAll;\n//# sourceMappingURL=querying.js.map"],"names":["querying","domhandler_1","require$$0","filter","test","node","recurse","limit","find","nodes","result","nodeStack","indexStack","elem","findOneChild","findOne","i","existsOne","checked","findAll"],"mappings":";;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,UAAkBA,EAAA,YAAoBA,EAAA,UAAkBA,EAAA,eAAuBA,EAAA,OAAeA,EAAA,SAAiB;AAC/G,IAAIC,IAAeC;AAWnB,SAASC,EAAOC,GAAMC,GAAMC,GAASC,GAAO;AACxC,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,QACzBC,EAAKJ,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AACzE;AACiBP,EAAA,SAAAG;AAWjB,SAASK,EAAKJ,GAAMK,GAAOH,GAASC,GAAO;AAM9B,WALLG,IAAS,CAAA,GAETC,IAAY,CAACF,CAAK,GAElBG,IAAa,CAAC,CAAC,OACV;AAEL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAElC,UAAAC,EAAW,WAAW;AACf,eAAAF;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACnC,QAAAR,EAAKS,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEN,KAAS;AACJ,aAAAG;AAEX,IAAAJ,SAAeL,EAAa,aAAaY,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACeb,EAAA,OAAAQ;AAUf,SAASM,EAAaV,GAAMK,GAAO;AACxB,SAAAA,EAAM,KAAKL,CAAI;AAC1B;AACuBJ,EAAA,eAAAc;AAUvB,SAASC,EAAQX,GAAMK,GAAOH,GAAS;AACnC,EAAIA,MAAY,WAAoBA,IAAA;AAEpC,WADIO,IAAO,MACFG,IAAI,GAAGA,IAAIP,EAAM,UAAU,CAACI,GAAMG,KAAK;AACxC,QAAAX,IAAOI,EAAMO,CAAC;AAClB,YAASf,EAAa,OAAOI,CAAI;AAEjC,MACSD,EAAKC,CAAI,IACPQ,IAAAR,IAEFC,KAAWD,EAAK,SAAS,SAAS,MACvCQ,IAAOE,EAAQX,GAAMC,EAAK,UAAU,EAAI;AAAA;AANxC;AAAA,EAQR;AACO,SAAAQ;AACX;AACkBb,EAAA,UAAAe;AASlB,SAASE,EAAUb,GAAMK,GAAO;AACrB,SAAAA,EAAM,KAAK,SAAUS,GAAS;AACzB,eAAGjB,EAAa,OAAOiB,CAAO,MACjCd,EAAKc,CAAO,KAAKD,EAAUb,GAAMc,EAAQ,QAAQ;AAAA,EAAA,CACzD;AACL;AACoBlB,EAAA,YAAAiB;AAWpB,SAASE,EAAQf,GAAMK,GAAO;AAIjB,WAHLC,IAAS,CAAA,GACTC,IAAY,CAACF,CAAK,GAClBG,IAAa,CAAC,CAAC,OACV;AACL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAClC,UAAAA,EAAU,WAAW;AACd,eAAAD;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,QAASX,EAAa,OAAOY,CAAI,MAE7BT,EAAKS,CAAI,KACTH,EAAO,KAAKG,CAAI,GAChBA,EAAK,SAAS,SAAS,MACvBD,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACAb,EAAA,UAAkBmB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es387.js","sources":["../node_modules/instantsearch.js/es/lib/utils/documentation.js"],"sourcesContent":["export function createDocumentationLink(_ref) {\n  var name = _ref.name,\n    _ref$connector = _ref.connector,\n    connector = _ref$connector === void 0 ? false : _ref$connector;\n  return ['https://www.algolia.com/doc/api-reference/widgets/', name, '/js/', connector ? '#connector' : ''].join('');\n}\nexport function createDocumentationMessageGenerator() {\n  for (var _len = arguments.length, widgets = new Array(_len), _key = 0; _key < _len; _key++) {\n    widgets[_key] = arguments[_key];\n  }\n  var links = widgets.map(function (widget) {\n    return createDocumentationLink(widget);\n  }).join(', ');\n  return function (message) {\n    return [message, \"See documentation: \".concat(links)].filter(Boolean).join('\\n\\n');\n  };\n}"],"names":["createDocumentationLink","_ref","name","_ref$connector","connector"],"mappings":"AAAO,SAASA,EAAwBC,GAAM;AACxC,MAAAC,IAAOD,EAAK,MACdE,IAAiBF,EAAK,WACtBG,IAAYD,MAAmB,SAAS,KAAQA;AAC3C,SAAA,CAAC,sDAAsDD,GAAM,QAAQE,IAAY,eAAe,EAAE,EAAE,KAAK,EAAE;AACpH;","x_google_ignoreList":[0]}

package/dist/index.es388.js

@@ -1,76 +1,15 @@
-import { __exports as i } from "./index.es395.js";
-import "./index.es291.js";
-import "./index.es387.js";
-import { __exports as s } from "./index.es394.js";
-import { __exports as y } from "./index.es298.js";
-Object.defineProperty(i, "__esModule", { value: !0 });
-i.getElementsByTagType = i.getElementsByTagName = i.getElementById = i.getElements = i.testElement = void 0;
-var u = y, o = s, f = {
-  tag_name: function(n) {
-    return typeof n == "function" ? function(t) {
-      return (0, u.isTag)(t) && n(t.name);
-    } : n === "*" ? u.isTag : function(t) {
-      return (0, u.isTag)(t) && t.name === n;
-    };
-  },
-  tag_type: function(n) {
-    return typeof n == "function" ? function(t) {
-      return n(t.type);
-    } : function(t) {
-      return t.type === n;
-    };
-  },
-  tag_contains: function(n) {
-    return typeof n == "function" ? function(t) {
-      return (0, u.isText)(t) && n(t.data);
-    } : function(t) {
-      return (0, u.isText)(t) && t.data === n;
-    };
+import { noop as o } from "./index.es517.js";
+var e = o, n = o;
+process.env.NODE_ENV === "development" && (e = function(r) {
+  console.warn("[InstantSearch.js]: ".concat(r.trim()));
+}, n = function(r, a) {
+  if (!r) {
+    var t = n.cache[a];
+    t || (n.cache[a] = !0, process.env.NODE_ENV === "development" && e(a));
   }
-};
-function g(n, t) {
-  return typeof t == "function" ? function(e) {
-    return (0, u.isTag)(e) && t(e.attribs[n]);
-  } : function(e) {
-    return (0, u.isTag)(e) && e.attribs[n] === t;
-  };
-}
-function p(n, t) {
-  return function(e) {
-    return n(e) || t(e);
-  };
-}
-function c(n) {
-  var t = Object.keys(n).map(function(e) {
-    var r = n[e];
-    return Object.prototype.hasOwnProperty.call(f, e) ? f[e](r) : g(e, r);
-  });
-  return t.length === 0 ? null : t.reduce(p);
-}
-function m(n, t) {
-  var e = c(n);
-  return e ? e(t) : !0;
-}
-i.testElement = m;
-function l(n, t, e, r) {
-  r === void 0 && (r = 1 / 0);
-  var a = c(n);
-  return a ? (0, o.filter)(a, t, e, r) : [];
-}
-i.getElements = l;
-function T(n, t, e) {
-  return e === void 0 && (e = !0), Array.isArray(t) || (t = [t]), (0, o.findOne)(g("id", n), t, e);
-}
-i.getElementById = T;
-function _(n, t, e, r) {
-  return e === void 0 && (e = !0), r === void 0 && (r = 1 / 0), (0, o.filter)(f.tag_name(n), t, e, r);
-}
-i.getElementsByTagName = _;
-function d(n, t, e, r) {
-  return e === void 0 && (e = !0), r === void 0 && (r = 1 / 0), (0, o.filter)(f.tag_type(n), t, e, r);
-}
-i.getElementsByTagType = d;
+}, n.cache = {});
 export {
-  i as default
+  e as warn,
+  n as warning
 };
 //# sourceMappingURL=index.es388.js.map

package/dist/index.es388.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es388.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/legacy.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getElementsByTagType = exports.getElementsByTagName = exports.getElementById = exports.getElements = exports.testElement = void 0;\nvar domhandler_1 = require(\"domhandler\");\nvar querying_js_1 = require(\"./querying.js\");\n/**\n * A map of functions to check nodes against.\n */\nvar Checks = {\n    tag_name: function (name) {\n        if (typeof name === \"function\") {\n            return function (elem) { return (0, domhandler_1.isTag)(elem) && name(elem.name); };\n        }\n        else if (name === \"*\") {\n            return domhandler_1.isTag;\n        }\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.name === name; };\n    },\n    tag_type: function (type) {\n        if (typeof type === \"function\") {\n            return function (elem) { return type(elem.type); };\n        }\n        return function (elem) { return elem.type === type; };\n    },\n    tag_contains: function (data) {\n        if (typeof data === \"function\") {\n            return function (elem) { return (0, domhandler_1.isText)(elem) && data(elem.data); };\n        }\n        return function (elem) { return (0, domhandler_1.isText)(elem) && elem.data === data; };\n    },\n};\n/**\n * Returns a function to check whether a node has an attribute with a particular\n * value.\n *\n * @param attrib Attribute to check.\n * @param value Attribute value to look for.\n * @returns A function to check whether the a node has an attribute with a\n *   particular value.\n */\nfunction getAttribCheck(attrib, value) {\n    if (typeof value === \"function\") {\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && value(elem.attribs[attrib]); };\n    }\n    return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.attribs[attrib] === value; };\n}\n/**\n * Returns a function that returns `true` if either of the input functions\n * returns `true` for a node.\n *\n * @param a First function to combine.\n * @param b Second function to combine.\n * @returns A function taking a node and returning `true` if either of the input\n *   functions returns `true` for the node.\n */\nfunction combineFuncs(a, b) {\n    return function (elem) { return a(elem) || b(elem); };\n}\n/**\n * Returns a function that executes all checks in `options` and returns `true`\n * if any of them match a node.\n *\n * @param options An object describing nodes to look for.\n * @returns A function that executes all checks in `options` and returns `true`\n *   if any of them match a node.\n */\nfunction compileTest(options) {\n    var funcs = Object.keys(options).map(function (key) {\n        var value = options[key];\n        return Object.prototype.hasOwnProperty.call(Checks, key)\n            ? Checks[key](value)\n            : getAttribCheck(key, value);\n    });\n    return funcs.length === 0 ? null : funcs.reduce(combineFuncs);\n}\n/**\n * Checks whether a node matches the description in `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param node The element to test.\n * @returns Whether the element matches the description in `options`.\n */\nfunction testElement(options, node) {\n    var test = compileTest(options);\n    return test ? test(node) : true;\n}\nexports.testElement = testElement;\n/**\n * Returns all nodes that match `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes that match `options`.\n */\nfunction getElements(options, nodes, recurse, limit) {\n    if (limit === void 0) { limit = Infinity; }\n    var test = compileTest(options);\n    return test ? (0, querying_js_1.filter)(test, nodes, recurse, limit) : [];\n}\nexports.getElements = getElements;\n/**\n * Returns the node with the supplied ID.\n *\n * @category Legacy Query Functions\n * @param id The unique ID attribute value to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @returns The node with the supplied ID.\n */\nfunction getElementById(id, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    if (!Array.isArray(nodes))\n        nodes = [nodes];\n    return (0, querying_js_1.findOne)(getAttribCheck(\"id\", id), nodes, recurse);\n}\nexports.getElementById = getElementById;\n/**\n * Returns all nodes with the supplied `tagName`.\n *\n * @category Legacy Query Functions\n * @param tagName Tag name to search for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `tagName`.\n */\nfunction getElementsByTagName(tagName, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_name\"](tagName), nodes, recurse, limit);\n}\nexports.getElementsByTagName = getElementsByTagName;\n/**\n * Returns all nodes with the supplied `type`.\n *\n * @category Legacy Query Functions\n * @param type Element type to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `type`.\n */\nfunction getElementsByTagType(type, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_type\"](type), nodes, recurse, limit);\n}\nexports.getElementsByTagType = getElementsByTagType;\n//# sourceMappingURL=legacy.js.map"],"names":["legacy","domhandler_1","require$$0","querying_js_1","require$$1","Checks","name","elem","type","data","getAttribCheck","attrib","value","combineFuncs","a","b","compileTest","options","funcs","key","testElement","node","test","getElements","nodes","recurse","limit","getElementById","id","getElementsByTagName","tagName","getElementsByTagType"],"mappings":";;;;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AACpDA,EAAA,uBAAsDA,EAAA,0CAAiCA,EAAA,cAAoCA,EAAA,cAAA;AACnI,IAAIC,IAAeC,GACfC,IAAgBC,GAIhBC,IAAS;AAAA,EACT,UAAU,SAAUC,GAAM;AAClB,WAAA,OAAOA,KAAS,aACT,SAAUC,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKD,EAAKC,EAAK,IAAI;AAAA,IAAA,IAE1ED,MAAS,MACPL,EAAa,QAEjB,SAAUM,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,SAASD;AAAA,IAAA;AAAA,EACnF;AAAA,EACA,UAAU,SAAUE,GAAM;AAClB,WAAA,OAAOA,KAAS,aACT,SAAUD,GAAM;AAAS,aAAAC,EAAKD,EAAK,IAAI;AAAA,IAAA,IAE3C,SAAUA,GAAM;AAAE,aAAOA,EAAK,SAASC;AAAA,IAAA;AAAA,EAClD;AAAA,EACA,cAAc,SAAUC,GAAM;AACtB,WAAA,OAAOA,KAAS,aACT,SAAUF,GAAM;AAAE,iBAAWN,EAAa,QAAQM,CAAI,KAAKE,EAAKF,EAAK,IAAI;AAAA,IAAA,IAE7E,SAAUA,GAAM;AAAE,iBAAWN,EAAa,QAAQM,CAAI,KAAKA,EAAK,SAASE;AAAA,IAAA;AAAA,EACpF;AACJ;AAUA,SAASC,EAAeC,GAAQC,GAAO;AAC/B,SAAA,OAAOA,KAAU,aACV,SAAUL,GAAM;AAAU,eAAGN,EAAa,OAAOM,CAAI,KAAKK,EAAML,EAAK,QAAQI,CAAM,CAAC;AAAA,EAAA,IAExF,SAAUJ,GAAM;AAAU,eAAGN,EAAa,OAAOM,CAAI,KAAKA,EAAK,QAAQI,CAAM,MAAMC;AAAA,EAAA;AAC9F;AAUA,SAASC,EAAaC,GAAGC,GAAG;AACxB,SAAO,SAAUR,GAAM;AAAE,WAAOO,EAAEP,CAAI,KAAKQ,EAAER,CAAI;AAAA,EAAA;AACrD;AASA,SAASS,EAAYC,GAAS;AAC1B,MAAIC,IAAQ,OAAO,KAAKD,CAAO,EAAE,IAAI,SAAUE,GAAK;AAC5C,QAAAP,IAAQK,EAAQE,CAAG;AACvB,WAAO,OAAO,UAAU,eAAe,KAAKd,GAAQc,CAAG,IACjDd,EAAOc,CAAG,EAAEP,CAAK,IACjBF,EAAeS,GAAKP,CAAK;AAAA,EAAA,CAClC;AACD,SAAOM,EAAM,WAAW,IAAI,OAAOA,EAAM,OAAOL,CAAY;AAChE;AASA,SAASO,EAAYH,GAASI,GAAM;AAC5B,MAAAC,IAAON,EAAYC,CAAO;AACvB,SAAAK,IAAOA,EAAKD,CAAI,IAAI;AAC/B;AACsBrB,EAAA,cAAAoB;AAWtB,SAASG,EAAYN,GAASO,GAAOC,GAASC,GAAO;AACjD,EAAIA,MAAU,WAAkBA,IAAA;AAC5B,MAAAJ,IAAON,EAAYC,CAAO;AACvB,SAAAK,QAAWnB,EAAc,QAAQmB,GAAME,GAAOC,GAASC,CAAK,IAAI;AAC3E;AACsB1B,EAAA,cAAAuB;AAUtB,SAASI,EAAeC,GAAIJ,GAAOC,GAAS;AACxC,SAAIA,MAAY,WAAoBA,IAAA,KAC/B,MAAM,QAAQD,CAAK,MACpBA,IAAQ,CAACA,CAAK,QACPrB,EAAc,SAASO,EAAe,MAAMkB,CAAE,GAAGJ,GAAOC,CAAO;AAC9E;AACyBzB,EAAA,iBAAA2B;AAWzB,SAASE,EAAqBC,GAASN,GAAOC,GAASC,GAAO;AAC1D,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,YACrBvB,EAAc,QAAQE,EAAO,SAAYyB,CAAO,GAAGN,GAAOC,GAASC,CAAK;AACvF;AAC+B1B,EAAA,uBAAA6B;AAW/B,SAASE,EAAqBvB,GAAMgB,GAAOC,GAASC,GAAO;AACvD,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,YACrBvB,EAAc,QAAQE,EAAO,SAAYG,CAAI,GAAGgB,GAAOC,GAASC,CAAK;AACpF;AACA1B,EAAA,uBAA+B+B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es388.js","sources":["../node_modules/instantsearch.js/es/lib/utils/logger.js"],"sourcesContent":["import { noop } from \"./noop.js\";\n/**\n * Logs a warning when this function is called, in development environment only.\n */\nvar deprecate = function deprecate(fn, message) {\n  return fn;\n};\n\n/**\n * Logs a warning\n * This is used to log issues in development environment only.\n */\nvar warn = noop;\n\n/**\n * Logs a warning if the condition is not met.\n * This is used to log issues in development environment only.\n */\nvar _warning = noop;\nif (process.env.NODE_ENV === 'development') {\n  warn = function warn(message) {\n    // eslint-disable-next-line no-console\n    console.warn(\"[InstantSearch.js]: \".concat(message.trim()));\n  };\n  deprecate = function deprecate(fn, message) {\n    var hasAlreadyPrinted = false;\n    return function () {\n      if (!hasAlreadyPrinted) {\n        hasAlreadyPrinted = true;\n        process.env.NODE_ENV === 'development' ? warn(message) : void 0;\n      }\n      return fn.apply(void 0, arguments);\n    };\n  };\n  _warning = function warning(condition, message) {\n    if (condition) {\n      return;\n    }\n    var hasAlreadyPrinted = _warning.cache[message];\n    if (!hasAlreadyPrinted) {\n      _warning.cache[message] = true;\n      process.env.NODE_ENV === 'development' ? warn(message) : void 0;\n    }\n  };\n  _warning.cache = {};\n}\nexport { warn, deprecate, _warning as warning };"],"names":["warn","noop","_warning","message","condition","hasAlreadyPrinted"],"mappings":";AAYA,IAAIA,IAAOC,GAMPC,IAAWD;AACX,QAAQ,IAAI,aAAa,kBACpBD,IAAA,SAAcG,GAAS;AAE5B,UAAQ,KAAK,uBAAuB,OAAOA,EAAQ,KAAM,CAAA,CAAC;AAAA,GAYjDD,IAAA,SAAiBE,GAAWD,GAAS;AAC9C,MAAI,CAAAC,GAGA;AAAA,QAAAC,IAAoBH,EAAS,MAAMC,CAAO;AAC9C,IAAKE,MACMH,EAAA,MAAMC,CAAO,IAAI,IAC1B,QAAQ,IAAI,aAAa,iBAAgBH,EAAKG,CAAO;AAAA;AACvD,GAEFD,EAAS,QAAQ;","x_google_ignoreList":[0]}

package/dist/index.es389.js

@@ -1,53 +1,5 @@
-import { __exports as c } from "./index.es396.js";
-import "./index.es291.js";
-import { __exports as m } from "./index.es298.js";
-(function(t) {
-  Object.defineProperty(t, "__esModule", { value: !0 }), t.uniqueSort = t.compareDocumentPosition = t.DocumentPosition = t.removeSubsets = void 0;
-  var l = m;
-  function I(r) {
-    for (var i = r.length; --i >= 0; ) {
-      var a = r[i];
-      if (i > 0 && r.lastIndexOf(a, i - 1) >= 0) {
-        r.splice(i, 1);
-        continue;
-      }
-      for (var e = a.parent; e; e = e.parent)
-        if (r.includes(e)) {
-          r.splice(i, 1);
-          break;
-        }
-    }
-    return r;
-  }
-  t.removeSubsets = I;
-  var n;
-  (function(r) {
-    r[r.DISCONNECTED = 1] = "DISCONNECTED", r[r.PRECEDING = 2] = "PRECEDING", r[r.FOLLOWING = 4] = "FOLLOWING", r[r.CONTAINS = 8] = "CONTAINS", r[r.CONTAINED_BY = 16] = "CONTAINED_BY";
-  })(n = t.DocumentPosition || (t.DocumentPosition = {}));
-  function O(r, i) {
-    var a = [], e = [];
-    if (r === i)
-      return 0;
-    for (var u = (0, l.hasChildren)(r) ? r : r.parent; u; )
-      a.unshift(u), u = u.parent;
-    for (u = (0, l.hasChildren)(i) ? i : i.parent; u; )
-      e.unshift(u), u = u.parent;
-    for (var E = Math.min(a.length, e.length), N = 0; N < E && a[N] === e[N]; )
-      N++;
-    if (N === 0)
-      return n.DISCONNECTED;
-    var f = a[N - 1], v = f.children, h = a[N], S = e[N];
-    return v.indexOf(h) > v.indexOf(S) ? f === i ? n.FOLLOWING | n.CONTAINED_BY : n.FOLLOWING : f === r ? n.PRECEDING | n.CONTAINS : n.PRECEDING;
-  }
-  t.compareDocumentPosition = O;
-  function C(r) {
-    return r = r.filter(function(i, a, e) {
-      return !e.includes(i, a + 1);
-    }), r.sort(function(i, a) {
-      var e = O(i, a);
-      return e & n.PRECEDING ? -1 : e & n.FOLLOWING ? 1 : 0;
-    }), r;
-  }
-  t.uniqueSort = C;
-})(c);
+var e = { exports: {} };
+export {
+  e as __module
+};
 //# sourceMappingURL=index.es389.js.map

package/dist/index.es389.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es389.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/helpers.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.uniqueSort = exports.compareDocumentPosition = exports.DocumentPosition = exports.removeSubsets = void 0;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Given an array of nodes, remove any member that is contained by another\n * member.\n *\n * @category Helpers\n * @param nodes Nodes to filter.\n * @returns Remaining nodes that aren't contained by other nodes.\n */\nfunction removeSubsets(nodes) {\n    var idx = nodes.length;\n    /*\n     * Check if each node (or one of its ancestors) is already contained in the\n     * array.\n     */\n    while (--idx >= 0) {\n        var node = nodes[idx];\n        /*\n         * Remove the node if it is not unique.\n         * We are going through the array from the end, so we only\n         * have to check nodes that preceed the node under consideration in the array.\n         */\n        if (idx > 0 && nodes.lastIndexOf(node, idx - 1) >= 0) {\n            nodes.splice(idx, 1);\n            continue;\n        }\n        for (var ancestor = node.parent; ancestor; ancestor = ancestor.parent) {\n            if (nodes.includes(ancestor)) {\n                nodes.splice(idx, 1);\n                break;\n            }\n        }\n    }\n    return nodes;\n}\nexports.removeSubsets = removeSubsets;\n/**\n * @category Helpers\n * @see {@link http://dom.spec.whatwg.org/#dom-node-comparedocumentposition}\n */\nvar DocumentPosition;\n(function (DocumentPosition) {\n    DocumentPosition[DocumentPosition[\"DISCONNECTED\"] = 1] = \"DISCONNECTED\";\n    DocumentPosition[DocumentPosition[\"PRECEDING\"] = 2] = \"PRECEDING\";\n    DocumentPosition[DocumentPosition[\"FOLLOWING\"] = 4] = \"FOLLOWING\";\n    DocumentPosition[DocumentPosition[\"CONTAINS\"] = 8] = \"CONTAINS\";\n    DocumentPosition[DocumentPosition[\"CONTAINED_BY\"] = 16] = \"CONTAINED_BY\";\n})(DocumentPosition = exports.DocumentPosition || (exports.DocumentPosition = {}));\n/**\n * Compare the position of one node against another node in any other document,\n * returning a bitmask with the values from {@link DocumentPosition}.\n *\n * Document order:\n * > There is an ordering, document order, defined on all the nodes in the\n * > document corresponding to the order in which the first character of the\n * > XML representation of each node occurs in the XML representation of the\n * > document after expansion of general entities. Thus, the document element\n * > node will be the first node. Element nodes occur before their children.\n * > Thus, document order orders element nodes in order of the occurrence of\n * > their start-tag in the XML (after expansion of entities). The attribute\n * > nodes of an element occur after the element and before its children. The\n * > relative order of attribute nodes is implementation-dependent.\n *\n * Source:\n * http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order\n *\n * @category Helpers\n * @param nodeA The first node to use in the comparison\n * @param nodeB The second node to use in the comparison\n * @returns A bitmask describing the input nodes' relative position.\n *\n * See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for\n * a description of these values.\n */\nfunction compareDocumentPosition(nodeA, nodeB) {\n    var aParents = [];\n    var bParents = [];\n    if (nodeA === nodeB) {\n        return 0;\n    }\n    var current = (0, domhandler_1.hasChildren)(nodeA) ? nodeA : nodeA.parent;\n    while (current) {\n        aParents.unshift(current);\n        current = current.parent;\n    }\n    current = (0, domhandler_1.hasChildren)(nodeB) ? nodeB : nodeB.parent;\n    while (current) {\n        bParents.unshift(current);\n        current = current.parent;\n    }\n    var maxIdx = Math.min(aParents.length, bParents.length);\n    var idx = 0;\n    while (idx < maxIdx && aParents[idx] === bParents[idx]) {\n        idx++;\n    }\n    if (idx === 0) {\n        return DocumentPosition.DISCONNECTED;\n    }\n    var sharedParent = aParents[idx - 1];\n    var siblings = sharedParent.children;\n    var aSibling = aParents[idx];\n    var bSibling = bParents[idx];\n    if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {\n        if (sharedParent === nodeB) {\n            return DocumentPosition.FOLLOWING | DocumentPosition.CONTAINED_BY;\n        }\n        return DocumentPosition.FOLLOWING;\n    }\n    if (sharedParent === nodeA) {\n        return DocumentPosition.PRECEDING | DocumentPosition.CONTAINS;\n    }\n    return DocumentPosition.PRECEDING;\n}\nexports.compareDocumentPosition = compareDocumentPosition;\n/**\n * Sort an array of nodes based on their relative position in the document,\n * removing any duplicate nodes. If the array contains nodes that do not belong\n * to the same document, sort order is unspecified.\n *\n * @category Helpers\n * @param nodes Array of DOM nodes.\n * @returns Collection of unique nodes, sorted in document order.\n */\nfunction uniqueSort(nodes) {\n    nodes = nodes.filter(function (node, i, arr) { return !arr.includes(node, i + 1); });\n    nodes.sort(function (a, b) {\n        var relative = compareDocumentPosition(a, b);\n        if (relative & DocumentPosition.PRECEDING) {\n            return -1;\n        }\n        else if (relative & DocumentPosition.FOLLOWING) {\n            return 1;\n        }\n        return 0;\n    });\n    return nodes;\n}\nexports.uniqueSort = uniqueSort;\n//# sourceMappingURL=helpers.js.map"],"names":["exports","domhandler_1","require$$0","removeSubsets","nodes","idx","node","ancestor","DocumentPosition","compareDocumentPosition","nodeA","nodeB","aParents","bParents","current","maxIdx","sharedParent","siblings","aSibling","bSibling","uniqueSort","i","arr","a","b","relative"],"mappings":";;;;AACA,SAAO,kBAAwB,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,aAAqBA,EAAkC,0BAAAA,EAAA,mBAA2BA,EAAwB,gBAAA;AAC1G,MAAIC,IAAeC;AASnB,WAASC,EAAcC,GAAO;AAMnB,aALHC,IAAMD,EAAM,QAKT,EAAEC,KAAO,KAAG;AACX,UAAAC,IAAOF,EAAMC,CAAG;AAMhB,UAAAA,IAAM,KAAKD,EAAM,YAAYE,GAAMD,IAAM,CAAC,KAAK,GAAG;AAC5C,QAAAD,EAAA,OAAOC,GAAK,CAAC;AACnB;AAAA,MACJ;AACA,eAASE,IAAWD,EAAK,QAAQC,GAAUA,IAAWA,EAAS;AACvD,YAAAH,EAAM,SAASG,CAAQ,GAAG;AACpB,UAAAH,EAAA,OAAOC,GAAK,CAAC;AACnB;AAAA,QACJ;AAAA,IAER;AACO,WAAAD;AAAA,EACX;AACA,EAAAJ,EAAA,gBAAwBG;AAKxB,MAAIK;AAAA,GACH,SAAUA,GAAkB;AACzBA,IAAAA,EAAiBA,EAAiB,eAAkB,CAAC,IAAI,gBACzDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,WAAc,CAAC,IAAI,YACrDA,EAAiBA,EAAiB,eAAkB,EAAE,IAAI;AAAA,KAC3DA,IAAmBR,EAAQ,qBAAqBA,EAA2B,mBAAA,CAAG,EAAA;AA2BjF,WAASS,EAAwBC,GAAOC,GAAO;AAC3C,QAAIC,IAAW,CAAA,GACXC,IAAW,CAAA;AACf,QAAIH,MAAUC;AACH,aAAA;AAGX,aADIG,QAAcb,EAAa,aAAaS,CAAK,IAAIA,IAAQA,EAAM,QAC5DI;AACH,MAAAF,EAAS,QAAQE,CAAO,GACxBA,IAAUA,EAAQ;AAGtB,SADAA,QAAcb,EAAa,aAAaU,CAAK,IAAIA,IAAQA,EAAM,QACxDG;AACH,MAAAD,EAAS,QAAQC,CAAO,GACxBA,IAAUA,EAAQ;AAItB,aAFIC,IAAS,KAAK,IAAIH,EAAS,QAAQC,EAAS,MAAM,GAClDR,IAAM,GACHA,IAAMU,KAAUH,EAASP,CAAG,MAAMQ,EAASR,CAAG;AACjD,MAAAA;AAEJ,QAAIA,MAAQ;AACR,aAAOG,EAAiB;AAExB,QAAAQ,IAAeJ,EAASP,IAAM,CAAC,GAC/BY,IAAWD,EAAa,UACxBE,IAAWN,EAASP,CAAG,GACvBc,IAAWN,EAASR,CAAG;AAC3B,WAAIY,EAAS,QAAQC,CAAQ,IAAID,EAAS,QAAQE,CAAQ,IAClDH,MAAiBL,IACVH,EAAiB,YAAYA,EAAiB,eAElDA,EAAiB,YAExBQ,MAAiBN,IACVF,EAAiB,YAAYA,EAAiB,WAElDA,EAAiB;AAAA,EAC5B;AACA,EAAAR,EAAA,0BAAkCS;AAUlC,WAASW,EAAWhB,GAAO;AACvB,WAAAA,IAAQA,EAAM,OAAO,SAAUE,GAAMe,GAAGC,GAAK;AAAE,aAAO,CAACA,EAAI,SAAShB,GAAMe,IAAI,CAAC;AAAA,IAAA,CAAI,GAC7EjB,EAAA,KAAK,SAAUmB,GAAGC,GAAG;AACnB,UAAAC,IAAWhB,EAAwBc,GAAGC,CAAC;AACvC,aAAAC,IAAWjB,EAAiB,YACrB,KAEFiB,IAAWjB,EAAiB,YAC1B,IAEJ;AAAA,IAAA,CACV,GACMJ;AAAA,EACX;AACA,EAAAJ,EAAA,aAAqBoB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es389.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}