@sunrise-upc/sales-static-components 3.7.8 → 3.7.10

package/dist/esm/node_modules/algoliasearch-helper/src/SearchResults/generate-hierarchical-tree.js

@@ -0,0 +1,2 @@
+import{__require as e}from"../functions/escapeFacetValue.js";import{__require as r}from"../functions/find.js";import{__require as a}from"../functions/formatSort.js";import{__require as t}from"../functions/orderBy.js";var n,i;function u(){if(i)return n;i=1,n=function(e){return function(r,a){var t=e.hierarchicalFacets[a],n=e.hierarchicalFacetsRefinements[t.name]&&e.hierarchicalFacetsRefinements[t.name][0]||"",i=e._getHierarchicalFacetSeparator(t),u=e._getHierarchicalRootPath(t),h=e._getHierarchicalShowParentLevel(t),d=f(e._getHierarchicalFacetSortBy(t)),p=r.every(function(e){return e.exhaustive}),m=function(e,r,a,t,n){return function(i,u,f){var h=i;if(f>0){var d=0;for(h=i;d<f;){var p=h&&Array.isArray(h.data)?h.data:[];h=c(p,function(e){return e.isRefined}),d++}}if(h){var m=Object.keys(u.data).map(function(e){return[e,u.data[e]]}).filter(function(e){return function(e,r,a,t,n,i){if(n&&(0!==e.indexOf(n)||n===e))return!1;return!n&&-1===e.indexOf(t)||n&&e.split(t).length-n.split(t).length===1||-1===e.indexOf(t)&&-1===a.indexOf(t)||0===a.indexOf(e)||0===e.indexOf(r+t)&&(i||0===e.indexOf(a))}(e[0],h.path||a,n,r,a,t)});h.data=s(m.map(function(e){var a=e[0];return function(e,r,a,t,n){var i=r.split(a);return{name:i[i.length-1].trim(),path:r,escapedValue:o(r),count:e,isRefined:t===r||0===t.indexOf(r+a),exhaustive:n,data:null}}(e[1],a,r,l(n),u.exhaustive)}),e[0],e[1])}return i}}(d,i,u,h,n),v=r;return u&&(v=r.slice(u.split(i).length)),v.reduce(m,{name:e.hierarchicalFacets[a].name,count:null,isRefined:!0,path:null,escapedValue:null,exhaustive:p,data:null})}};var u=e(),c=r(),f=a(),s=t(),o=u.escapeFacetValue,l=u.unescapeFacetValue;return n}export{u as __require};
+//# sourceMappingURL=generate-hierarchical-tree.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/SearchResults/generate-hierarchical-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate-hierarchical-tree.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/SearchResults/generate-hierarchical-tree.js"],"sourcesContent":["'use strict';\n\nmodule.exports = generateTrees;\n\nvar fv = require('../functions/escapeFacetValue');\nvar find = require('../functions/find');\nvar prepareHierarchicalFacetSortBy = require('../functions/formatSort');\nvar orderBy = require('../functions/orderBy');\nvar escapeFacetValue = fv.escapeFacetValue;\nvar unescapeFacetValue = fv.unescapeFacetValue;\n\nfunction generateTrees(state) {\n  return function generate(hierarchicalFacetResult, hierarchicalFacetIndex) {\n    var hierarchicalFacet = state.hierarchicalFacets[hierarchicalFacetIndex];\n    var hierarchicalFacetRefinement =\n      (state.hierarchicalFacetsRefinements[hierarchicalFacet.name] &&\n        state.hierarchicalFacetsRefinements[hierarchicalFacet.name][0]) ||\n      '';\n    var hierarchicalSeparator =\n      state._getHierarchicalFacetSeparator(hierarchicalFacet);\n    var hierarchicalRootPath =\n      state._getHierarchicalRootPath(hierarchicalFacet);\n    var hierarchicalShowParentLevel =\n      state._getHierarchicalShowParentLevel(hierarchicalFacet);\n    var sortBy = prepareHierarchicalFacetSortBy(\n      state._getHierarchicalFacetSortBy(hierarchicalFacet)\n    );\n\n    var rootExhaustive = hierarchicalFacetResult.every(function (facetResult) {\n      return facetResult.exhaustive;\n    });\n\n    var generateTreeFn = generateHierarchicalTree(\n      sortBy,\n      hierarchicalSeparator,\n      hierarchicalRootPath,\n      hierarchicalShowParentLevel,\n      hierarchicalFacetRefinement\n    );\n\n    var results = hierarchicalFacetResult;\n\n    if (hierarchicalRootPath) {\n      results = hierarchicalFacetResult.slice(\n        hierarchicalRootPath.split(hierarchicalSeparator).length\n      );\n    }\n\n    return results.reduce(generateTreeFn, {\n      name: state.hierarchicalFacets[hierarchicalFacetIndex].name,\n      count: null, // root level, no count\n      isRefined: true, // root level, always refined\n      path: null, // root level, no path\n      escapedValue: null,\n      exhaustive: rootExhaustive,\n      data: null,\n    });\n  };\n}\n\nfunction generateHierarchicalTree(\n  sortBy,\n  hierarchicalSeparator,\n  hierarchicalRootPath,\n  hierarchicalShowParentLevel,\n  currentRefinement\n) {\n  return function generateTree(\n    hierarchicalTree,\n    hierarchicalFacetResult,\n    currentHierarchicalLevel\n  ) {\n    var parent = hierarchicalTree;\n\n    if (currentHierarchicalLevel > 0) {\n      var level = 0;\n\n      parent = hierarchicalTree;\n\n      while (level < currentHierarchicalLevel) {\n        /**\n         * @type {object[]]} hierarchical data\n         */\n        var data = parent && Array.isArray(parent.data) ? parent.data : [];\n        parent = find(data, function (subtree) {\n          return subtree.isRefined;\n        });\n        level++;\n      }\n    }\n\n    // we found a refined parent, let's add current level data under it\n    if (parent) {\n      // filter values in case an object has multiple categories:\n      //   {\n      //     categories: {\n      //       level0: ['beers', 'bières'],\n      //       level1: ['beers > IPA', 'bières > Belges']\n      //     }\n      //   }\n      //\n      // If parent refinement is `beers`, then we do not want to have `bières > Belges`\n      // showing up\n\n      var picked = Object.keys(hierarchicalFacetResult.data)\n        .map(function (facetValue) {\n          return [facetValue, hierarchicalFacetResult.data[facetValue]];\n        })\n        .filter(function (tuple) {\n          var facetValue = tuple[0];\n          return onlyMatchingTree(\n            facetValue,\n            parent.path || hierarchicalRootPath,\n            currentRefinement,\n            hierarchicalSeparator,\n            hierarchicalRootPath,\n            hierarchicalShowParentLevel\n          );\n        });\n\n      parent.data = orderBy(\n        picked.map(function (tuple) {\n          var facetValue = tuple[0];\n          var facetCount = tuple[1];\n\n          return format(\n            facetCount,\n            facetValue,\n            hierarchicalSeparator,\n            unescapeFacetValue(currentRefinement),\n            hierarchicalFacetResult.exhaustive\n          );\n        }),\n        sortBy[0],\n        sortBy[1]\n      );\n    }\n\n    return hierarchicalTree;\n  };\n}\n\n// eslint-disable-next-line max-params\nfunction onlyMatchingTree(\n  facetValue,\n  parentPath,\n  currentRefinement,\n  hierarchicalSeparator,\n  hierarchicalRootPath,\n  hierarchicalShowParentLevel\n) {\n  // we want the facetValue is a child of hierarchicalRootPath\n  if (\n    hierarchicalRootPath &&\n    (facetValue.indexOf(hierarchicalRootPath) !== 0 ||\n      hierarchicalRootPath === facetValue)\n  ) {\n    return false;\n  }\n\n  // we always want root levels (only when there is no prefix path)\n  return (\n    (!hierarchicalRootPath &&\n      facetValue.indexOf(hierarchicalSeparator) === -1) ||\n    // if there is a rootPath, being root level mean 1 level under rootPath\n    (hierarchicalRootPath &&\n      facetValue.split(hierarchicalSeparator).length -\n        hierarchicalRootPath.split(hierarchicalSeparator).length ===\n        1) ||\n    // if current refinement is a root level and current facetValue is a root level,\n    // keep the facetValue\n    (facetValue.indexOf(hierarchicalSeparator) === -1 &&\n      currentRefinement.indexOf(hierarchicalSeparator) === -1) ||\n    // currentRefinement is a child of the facet value\n    currentRefinement.indexOf(facetValue) === 0 ||\n    // facetValue is a child of the current parent, add it\n    (facetValue.indexOf(parentPath + hierarchicalSeparator) === 0 &&\n      (hierarchicalShowParentLevel ||\n        facetValue.indexOf(currentRefinement) === 0))\n  );\n}\n\nfunction format(\n  facetCount,\n  facetValue,\n  hierarchicalSeparator,\n  currentRefinement,\n  exhaustive\n) {\n  var parts = facetValue.split(hierarchicalSeparator);\n  return {\n    name: parts[parts.length - 1].trim(),\n    path: facetValue,\n    escapedValue: escapeFacetValue(facetValue),\n    count: facetCount,\n    isRefined:\n      currentRefinement === facetValue ||\n      currentRefinement.indexOf(facetValue + hierarchicalSeparator) === 0,\n    exhaustive: exhaustive,\n    data: null,\n  };\n}\n"],"names":["generateHierarchicalTree_1","state","hierarchicalFacetResult","hierarchicalFacetIndex","hierarchicalFacet","hierarchicalFacets","hierarchicalFacetRefinement","hierarchicalFacetsRefinements","name","hierarchicalSeparator","_getHierarchicalFacetSeparator","hierarchicalRootPath","_getHierarchicalRootPath","hierarchicalShowParentLevel","_getHierarchicalShowParentLevel","sortBy","prepareHierarchicalFacetSortBy","_getHierarchicalFacetSortBy","rootExhaustive","every","facetResult","exhaustive","generateTreeFn","currentRefinement","hierarchicalTree","currentHierarchicalLevel","parent","level","data","Array","isArray","find","subtree","isRefined","picked","Object","keys","map","facetValue","filter","tuple","parentPath","indexOf","split","length","onlyMatchingTree","path","orderBy","facetCount","parts","trim","escapedValue","escapeFacetValue","count","format","unescapeFacetValue","generateHierarchicalTree","results","slice","reduce","fv","require$$0","require$$1","require$$2","require$$3"],"mappings":"gQAEAA,EASA,SAAuBC,GACrB,OAAO,SAAkBC,EAAyBC,GAChD,IAAIC,EAAoBH,EAAMI,mBAAmBF,GAC7CG,EACDL,EAAMM,8BAA8BH,EAAkBI,OACrDP,EAAMM,8BAA8BH,EAAkBI,MAAM,IAC9D,GACEC,EACFR,EAAMS,+BAA+BN,GACnCO,EACFV,EAAMW,yBAAyBR,GAC7BS,EACFZ,EAAMa,gCAAgCV,GACpCW,EAASC,EACXf,EAAMgB,4BAA4Bb,IAGhCc,EAAiBhB,EAAwBiB,MAAM,SAAUC,GAC3D,OAAOA,EAAYC,UACzB,GAEQC,EA4BR,SACEP,EACAN,EACAE,EACAE,EACAU,GAEA,OAAO,SACLC,EACAtB,EACAuB,GAEA,IAAIC,EAASF,EAEb,GAAIC,EAA2B,EAAG,CAChC,IAAIE,EAAQ,EAIZ,IAFAD,EAASF,EAEFG,EAAQF,GAA0B,CAIvC,IAAIG,EAAOF,GAAUG,MAAMC,QAAQJ,EAAOE,MAAQF,EAAOE,KAAO,GAChEF,EAASK,EAAKH,EAAM,SAAUI,GAC5B,OAAOA,EAAQC,SACzB,GACQN,GACR,CACA,CAGI,GAAID,EAAQ,CAYV,IAAIQ,EAASC,OAAOC,KAAKlC,EAAwB0B,MAC9CS,IAAI,SAAUC,GACb,MAAO,CAACA,EAAYpC,EAAwB0B,KAAKU,GAC3D,GACSC,OAAO,SAAUC,GAEhB,OAiCV,SACEF,EACAG,EACAlB,EACAd,EACAE,EACAE,GAGA,GACEF,IAC8C,IAA7C2B,EAAWI,QAAQ/B,IAClBA,IAAyB2B,GAE3B,OAAO,EAIT,OACI3B,IAC8C,IAA9C2B,EAAWI,QAAQjC,IAEpBE,GACC2B,EAAWK,MAAMlC,GAAuBmC,OACtCjC,EAAqBgC,MAAMlC,GAAuBmC,SAClD,IAG2C,IAA9CN,EAAWI,QAAQjC,SAClBc,EAAkBmB,QAAQjC,IAEc,IAA1Cc,EAAkBmB,QAAQJ,IAEkC,IAA3DA,EAAWI,QAAQD,EAAahC,KAC9BI,GAC2C,IAA1CyB,EAAWI,QAAQnB,GAE3B,CAtEiBsB,CADUL,EAAM,GAGrBd,EAAOoB,MAAQnC,EACfY,EACAd,EACAE,EACAE,EAEZ,GAEMa,EAAOE,KAAOmB,EACZb,EAAOG,IAAI,SAAUG,GACnB,IAAIF,EAAaE,EAAM,GAGvB,OAyDV,SACEQ,EACAV,EACA7B,EACAc,EACAF,GAEA,IAAI4B,EAAQX,EAAWK,MAAMlC,GAC7B,MAAO,CACLD,KAAMyC,EAAMA,EAAML,OAAS,GAAGM,OAC9BJ,KAAMR,EACNa,aAAcC,EAAiBd,GAC/Be,MAAOL,EACPf,UACEV,IAAsBe,GAC4C,IAAlEf,EAAkBmB,QAAQJ,EAAa7B,GACzCY,WAAYA,EACZO,KAAM,KAEV,CA5EiB0B,CAFUd,EAAM,GAIrBF,EACA7B,EACA8C,EAAmBhC,GACnBrB,EAAwBmB,WAEpC,GACQN,EAAO,GACPA,EAAO,GAEf,CAEI,OAAOS,CACX,CACA,CA5GyBgC,CACnBzC,EACAN,EACAE,EACAE,EACAP,GAGEmD,EAAUvD,EAQd,OANIS,IACF8C,EAAUvD,EAAwBwD,MAChC/C,EAAqBgC,MAAMlC,GAAuBmC,SAI/Ca,EAAQE,OAAOrC,EAAgB,CACpCd,KAAMP,EAAMI,mBAAmBF,GAAwBK,KACvD6C,MAAO,KACPpB,WAAW,EACXa,KAAM,KACNK,aAAc,KACd9B,WAAYH,EACZU,KAAM,MAEZ,CACA,EAtDA,IAAIgC,EAAKC,IACL9B,EAAO+B,IACP9C,EAAiC+C,IACjChB,EAAUiB,IACVZ,EAAmBQ,EAAGR,iBACtBG,EAAqBK,EAAGL","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/SearchResults/index.js

@@ -0,0 +1,2 @@
+import{__require as e}from"../functions/compact.js";import{__require as t}from"../functions/defaultsPure.js";import{__require as a}from"../functions/escapeFacetValue.js";import{__require as i}from"../functions/find.js";import{__require as r}from"../functions/findIndex.js";import{__require as c}from"../functions/formatSort.js";import{__require as n}from"../functions/mergeNumericMax.js";import{__require as s}from"../functions/orderBy.js";import{__require as u}from"./generate-hierarchical-tree.js";var f,o;function h(){if(o)return f;o=1;var h=e(),d=t(),m=a(),v=i(),l=r(),F=c(),p=n(),j=s(),y=m.escapeFacetValue,_=m.unescapeFacetValue,g=u();function E(e){var t={};return e.forEach(function(e,a){t[e]=a}),t}function x(e,t,a){t&&t[a]&&(e.stats=t[a])}function R(e,t,a){var i=t[0]||{};this._rawResults=t;var r=this;Object.keys(i).forEach(function(e){r[e]=i[e]});var c=d(a,{persistHierarchicalRootCount:!1});Object.keys(c).forEach(function(e){r[e]=c[e]}),this.processingTimeMS=t.reduce(function(e,t){return void 0===t.processingTimeMS?e:e+t.processingTimeMS},0),this.disjunctiveFacets=[],this.hierarchicalFacets=e.hierarchicalFacets.map(function(){return[]}),this.facets=[];var n=e.getRefinedDisjunctiveFacets(),s=E(e.facets),u=E(e.disjunctiveFacets),f=1,o=i.facets||{};Object.keys(o).forEach(function(t){var a,c,n=o[t],f=(a=e.hierarchicalFacets,c=t,v(a,function(e){return(e.attributes||[]).indexOf(c)>-1}));if(f){var h=f.attributes.indexOf(t),d=l(e.hierarchicalFacets,function(e){return e.name===f.name});r.hierarchicalFacets[d][h]={attribute:t,data:n,exhaustive:i.exhaustiveFacetsCount}}else{var m,F=-1!==e.disjunctiveFacets.indexOf(t),p=-1!==e.facets.indexOf(t);F&&(m=u[t],r.disjunctiveFacets[m]={name:t,data:n,exhaustive:i.exhaustiveFacetsCount},x(r.disjunctiveFacets[m],i.facets_stats,t)),p&&(m=s[t],r.facets[m]={name:t,data:n,exhaustive:i.exhaustiveFacetsCount},x(r.facets[m],i.facets_stats,t))}}),this.hierarchicalFacets=h(this.hierarchicalFacets),n.forEach(function(a){var c=t[f],n=c&&c.facets?c.facets:{},s=e.getHierarchicalFacetByName(a);Object.keys(n).forEach(function(t){var a,f=n[t];if(s){a=l(e.hierarchicalFacets,function(e){return e.name===s.name});var o=l(r.hierarchicalFacets[a],function(e){return e.attribute===t});if(-1===o)return;r.hierarchicalFacets[a][o].data=r.persistHierarchicalRootCount?p(r.hierarchicalFacets[a][o].data,f):d(f,r.hierarchicalFacets[a][o].data)}else{a=u[t];var h=i.facets&&i.facets[t]||{};r.disjunctiveFacets[a]={name:t,data:p(h,f),exhaustive:c.exhaustiveFacetsCount},x(r.disjunctiveFacets[a],c.facets_stats,t),e.disjunctiveFacetsRefinements[t]&&e.disjunctiveFacetsRefinements[t].forEach(function(i){!r.disjunctiveFacets[a].data[i]&&e.disjunctiveFacetsRefinements[t].indexOf(_(i))>-1&&(r.disjunctiveFacets[a].data[i]=0)})}}),f++}),e.getRefinedHierarchicalFacets().forEach(function(a){var i=e.getHierarchicalFacetByName(a),c=e._getHierarchicalFacetSeparator(i),n=e.getHierarchicalRefinement(a);0===n.length||n[0].split(c).length<2||t.slice(f).forEach(function(t){var a=t&&t.facets?t.facets:{};Object.keys(a).forEach(function(t){var s=a[t],u=l(e.hierarchicalFacets,function(e){return e.name===i.name}),f=l(r.hierarchicalFacets[u],function(e){return e.attribute===t});if(-1!==f){var o={};if(n.length>0&&!r.persistHierarchicalRootCount){var h=n[0].split(c)[0];o[h]=r.hierarchicalFacets[u][f].data[h]}r.hierarchicalFacets[u][f].data=d(o,s,r.hierarchicalFacets[u][f].data)}}),f++})}),Object.keys(e.facetsExcludes).forEach(function(t){var a=e.facetsExcludes[t],c=s[t];r.facets[c]={name:t,data:o[t],exhaustive:i.exhaustiveFacetsCount},a.forEach(function(e){r.facets[c]=r.facets[c]||{name:t},r.facets[c].data=r.facets[c].data||{},r.facets[c].data[e]=0})}),this.hierarchicalFacets=this.hierarchicalFacets.map(g(e)),this.facets=h(this.facets),this.disjunctiveFacets=h(this.disjunctiveFacets),this._state=e}function O(e,t){function a(e){return e.name===t}if(e._state.isConjunctiveFacet(t)){var i=v(e.facets,a);return i?Object.keys(i.data).map(function(a){var r=y(a);return{name:a,escapedValue:r,count:i.data[a],isRefined:e._state.isFacetRefined(t,r),isExcluded:e._state.isExcludeRefined(t,a)}}):[]}if(e._state.isDisjunctiveFacet(t)){var r=v(e.disjunctiveFacets,a);return r?Object.keys(r.data).map(function(a){var i=y(a);return{name:a,escapedValue:i,count:r.data[a],isRefined:e._state.isDisjunctiveFacetRefined(t,i)}}):[]}if(e._state.isHierarchicalFacet(t)){var c=v(e.hierarchicalFacets,a);if(!c)return c;var n=e._state.getHierarchicalFacetByName(t),s=e._state._getHierarchicalFacetSeparator(n),u=_(e._state.getHierarchicalRefinement(t)[0]||"");0===u.indexOf(n.rootPath)&&(u=u.replace(n.rootPath+s,""));var f=u.split(s);return f.unshift(t),b(c,f,0),c}}function b(e,t,a){e.isRefined=e.name===(t[a]&&t[a].trim()),e.data&&e.data.forEach(function(e){b(e,t,a+1)})}function B(e,t,a,i){if(i=i||0,Array.isArray(t))return e(t,a[i]);if(!t.data||0===t.data.length)return t;var r=t.data.map(function(t){return B(e,t,a,i+1)}),c=e(r,a[i]);return d({data:c},t)}function H(e,t){var a=v(e,function(e){return e.name===t});return a&&a.stats}function k(e,t,a,i,r){var c=v(r,function(e){return e.name===a}),n=c&&c.data&&c.data[i]?c.data[i]:0,s=c&&c.exhaustive||!1;return{type:t,attributeName:a,name:i,count:n,exhaustive:s}}return R.prototype.getFacetByName=function(e){function t(t){return t.name===e}return v(this.facets,t)||v(this.disjunctiveFacets,t)||v(this.hierarchicalFacets,t)},R.DEFAULT_SORT=["isRefined:desc","count:desc","name:asc"],R.prototype.getFacetValues=function(e,t){var a=O(this,e);if(a){var i,r=d(t,{sortBy:R.DEFAULT_SORT,facetOrdering:!(t&&t.sortBy)}),c=this;if(Array.isArray(a))i=[e];else i=c._state.getHierarchicalFacetByName(a.name).attributes;return B(function(e,t){var a=function(e,t){return e.renderingContent&&e.renderingContent.facetOrdering&&e.renderingContent.facetOrdering.values&&e.renderingContent.facetOrdering.values[t]}(c,t);if(r.facetOrdering&&a)return function(e,t){var a=[],i=[],r=t.hide||[],c=(t.order||[]).reduce(function(e,t,a){return e[t]=a,e},{});e.forEach(function(e){var t=e.path||e.name,n=r.indexOf(t)>-1;n||void 0===c[t]?n||i.push(e):a[c[t]]=e}),a=a.filter(function(e){return e});var n,s=t.sortRemainingBy;return"hidden"===s?a:(n="alpha"===s?[["path","name"],["asc","asc"]]:[["count"],["desc"]],a.concat(j(i,n[0],n[1])))}(e,a);if(Array.isArray(r.sortBy)){var i=F(r.sortBy,R.DEFAULT_SORT),n=j(e,i[0],i[1]),s=a&&a.hide?a.hide:[];if(s.length>0){var u=[];return n.forEach(function(e){var t=e.path||e.name;-1===s.indexOf(t)&&u.push(e)}),u}return n}if("function"==typeof r.sortBy)return function(e,t){return t.sort(e)}(r.sortBy,e);throw new Error("options.sortBy is optional but if defined it must be either an array of string (predicates) or a sorting function")},a,i)}},R.prototype.getFacetStats=function(e){return this._state.isConjunctiveFacet(e)?H(this.facets,e):this._state.isDisjunctiveFacet(e)?H(this.disjunctiveFacets,e):void 0},R.prototype.getRefinements=function(){var e=this._state,t=this,a=[];return Object.keys(e.facetsRefinements).forEach(function(i){e.facetsRefinements[i].forEach(function(r){a.push(k(e,"facet",i,r,t.facets))})}),Object.keys(e.facetsExcludes).forEach(function(i){e.facetsExcludes[i].forEach(function(r){a.push(k(e,"exclude",i,r,t.facets))})}),Object.keys(e.disjunctiveFacetsRefinements).forEach(function(i){e.disjunctiveFacetsRefinements[i].forEach(function(r){a.push(k(e,"disjunctive",i,r,t.disjunctiveFacets))})}),Object.keys(e.hierarchicalFacetsRefinements).forEach(function(i){e.hierarchicalFacetsRefinements[i].forEach(function(r){a.push(function(e,t,a,i){var r=e.getHierarchicalFacetByName(t),c=e._getHierarchicalFacetSeparator(r),n=a.split(c),s=v(i,function(e){return e.name===t}),u=n.reduce(function(e,t){var a=e&&v(e.data,function(e){return e.name===t});return void 0!==a?a:e},s),f=u&&u.count||0,o=u&&u.exhaustive||!1,h=u&&u.path||"";return{type:"hierarchical",attributeName:t,name:h,count:f,exhaustive:o}}(e,i,r,t.hierarchicalFacets))})}),Object.keys(e.numericRefinements).forEach(function(t){var i=e.numericRefinements[t];Object.keys(i).forEach(function(e){i[e].forEach(function(i){a.push({type:"numeric",attributeName:t,name:i,numericValue:i,operator:e})})})}),e.tagRefinements.forEach(function(e){a.push({type:"tag",attributeName:"_tags",name:e})}),a},f=R}export{h as __require};
+//# sourceMappingURL=index.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/SearchResults/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/SearchResults/index.js"],"sourcesContent":["'use strict';\n\nvar compact = require('../functions/compact');\nvar defaultsPure = require('../functions/defaultsPure');\nvar fv = require('../functions/escapeFacetValue');\nvar find = require('../functions/find');\nvar findIndex = require('../functions/findIndex');\nvar formatSort = require('../functions/formatSort');\nvar mergeNumericMax = require('../functions/mergeNumericMax');\nvar orderBy = require('../functions/orderBy');\nvar escapeFacetValue = fv.escapeFacetValue;\nvar unescapeFacetValue = fv.unescapeFacetValue;\n\nvar generateHierarchicalTree = require('./generate-hierarchical-tree');\n\n/**\n * @typedef SearchResults.Facet\n * @type {object}\n * @property {string} name name of the attribute in the record\n * @property {object} data the faceting data: value, number of entries\n * @property {object} stats undefined unless facet_stats is retrieved from algolia\n */\n\n/**\n * @typedef SearchResults.HierarchicalFacet\n * @type {object}\n * @property {string} name name of the current value given the hierarchical level, trimmed.\n * If root node, you get the facet name\n * @property {number} count number of objects matching this hierarchical value\n * @property {string} path the current hierarchical value full path\n * @property {boolean} isRefined `true` if the current value was refined, `false` otherwise\n * @property {HierarchicalFacet[]} data sub values for the current level\n */\n\n/**\n * @typedef SearchResults.FacetValue\n * @type {object}\n * @property {string} name the facet value itself\n * @property {number} count times this facet appears in the results\n * @property {boolean} isRefined is the facet currently selected\n * @property {boolean} isExcluded is the facet currently excluded (only for conjunctive facets)\n */\n\n/**\n * @typedef Refinement\n * @type {object}\n * @property {string} type the type of filter used:\n * `numeric`, `facet`, `exclude`, `disjunctive`, `hierarchical`\n * @property {string} attributeName name of the attribute used for filtering\n * @property {string} name the value of the filter\n * @property {number} numericValue the value as a number. Only for numeric filters.\n * @property {string} operator the operator used. Only for numeric filters.\n * @property {number} count the number of computed hits for this filter. Only on facets.\n * @property {boolean} exhaustive if the count is exhaustive\n */\n\n/**\n * Turn an array of attributes in an object of attributes with their position in the array as value\n * @param {string[]} attributes the list of attributes in the record\n * @return {object} the list of attributes indexed by attribute name\n */\nfunction getIndices(attributes) {\n  var indices = {};\n\n  attributes.forEach(function (val, idx) {\n    indices[val] = idx;\n  });\n\n  return indices;\n}\n\nfunction assignFacetStats(dest, facetStats, key) {\n  if (facetStats && facetStats[key]) {\n    dest.stats = facetStats[key];\n  }\n}\n\n/**\n * @typedef {Object} HierarchicalFacet\n * @property {string} name\n * @property {string[]} attributes\n */\n\n/**\n * @param {HierarchicalFacet[]} hierarchicalFacets All hierarchical facets\n * @param {string} hierarchicalAttributeName The name of the hierarchical attribute\n * @return {HierarchicalFacet} The hierarchical facet matching the attribute name\n */\nfunction findMatchingHierarchicalFacetFromAttributeName(\n  hierarchicalFacets,\n  hierarchicalAttributeName\n) {\n  return find(\n    hierarchicalFacets,\n    function facetKeyMatchesAttribute(hierarchicalFacet) {\n      var facetNames = hierarchicalFacet.attributes || [];\n      return facetNames.indexOf(hierarchicalAttributeName) > -1;\n    }\n  );\n}\n\n/**\n * Constructor for SearchResults\n * @class\n * @classdesc SearchResults contains the results of a query to Algolia using the\n * {@link AlgoliaSearchHelper}.\n * @param {SearchParameters} state state that led to the response\n * @param {array.<object>} results the results from algolia client\n * @param {object} options options to control results content\n * @example <caption>SearchResults of the first query in\n * <a href=\"http://demos.algolia.com/instant-search-demo\">the instant search demo</a></caption>\n{\n   \"hitsPerPage\": 10,\n   \"processingTimeMS\": 2,\n   \"facets\": [\n      {\n         \"name\": \"type\",\n         \"data\": {\n            \"HardGood\": 6627,\n            \"BlackTie\": 550,\n            \"Music\": 665,\n            \"Software\": 131,\n            \"Game\": 456,\n            \"Movie\": 1571\n         },\n         \"exhaustive\": false\n      },\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"Free shipping\": 5507\n         },\n         \"name\": \"shipping\"\n      }\n  ],\n   \"hits\": [\n      {\n         \"thumbnailImage\": \"http://img.bbystatic.com/BestBuy_US/images/products/1688/1688832_54x108_s.gif\",\n         \"_highlightResult\": {\n            \"shortDescription\": {\n               \"matchLevel\": \"none\",\n               \"value\": \"Safeguard your PC, Mac, Android and iOS devices with comprehensive Internet protection\",\n               \"matchedWords\": []\n            },\n            \"category\": {\n               \"matchLevel\": \"none\",\n               \"value\": \"Computer Security Software\",\n               \"matchedWords\": []\n            },\n            \"manufacturer\": {\n               \"matchedWords\": [],\n               \"value\": \"Webroot\",\n               \"matchLevel\": \"none\"\n            },\n            \"name\": {\n               \"value\": \"Webroot SecureAnywhere Internet Security (3-Device) (1-Year Subscription) - Mac/Windows\",\n               \"matchedWords\": [],\n               \"matchLevel\": \"none\"\n            }\n         },\n         \"image\": \"http://img.bbystatic.com/BestBuy_US/images/products/1688/1688832_105x210_sc.jpg\",\n         \"shipping\": \"Free shipping\",\n         \"bestSellingRank\": 4,\n         \"shortDescription\": \"Safeguard your PC, Mac, Android and iOS devices with comprehensive Internet protection\",\n         \"url\": \"http://www.bestbuy.com/site/webroot-secureanywhere-internet-security-3-devi…d=1219060687969&skuId=1688832&cmp=RMX&ky=2d3GfEmNIzjA0vkzveHdZEBgpPCyMnLTJ\",\n         \"name\": \"Webroot SecureAnywhere Internet Security (3-Device) (1-Year Subscription) - Mac/Windows\",\n         \"category\": \"Computer Security Software\",\n         \"salePrice_range\": \"1 - 50\",\n         \"objectID\": \"1688832\",\n         \"type\": \"Software\",\n         \"customerReviewCount\": 5980,\n         \"salePrice\": 49.99,\n         \"manufacturer\": \"Webroot\"\n      },\n      ....\n  ],\n   \"nbHits\": 10000,\n   \"disjunctiveFacets\": [\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"5\": 183,\n            \"12\": 112,\n            \"7\": 149,\n            ...\n         },\n         \"name\": \"customerReviewCount\",\n         \"stats\": {\n            \"max\": 7461,\n            \"avg\": 157.939,\n            \"min\": 1\n         }\n      },\n      {\n         \"data\": {\n            \"Printer Ink\": 142,\n            \"Wireless Speakers\": 60,\n            \"Point & Shoot Cameras\": 48,\n            ...\n         },\n         \"name\": \"category\",\n         \"exhaustive\": false\n      },\n      {\n         \"exhaustive\": false,\n         \"data\": {\n            \"> 5000\": 2,\n            \"1 - 50\": 6524,\n            \"501 - 2000\": 566,\n            \"201 - 500\": 1501,\n            \"101 - 200\": 1360,\n            \"2001 - 5000\": 47\n         },\n         \"name\": \"salePrice_range\"\n      },\n      {\n         \"data\": {\n            \"Dynex™\": 202,\n            \"Insignia™\": 230,\n            \"PNY\": 72,\n            ...\n         },\n         \"name\": \"manufacturer\",\n         \"exhaustive\": false\n      }\n  ],\n   \"query\": \"\",\n   \"nbPages\": 100,\n   \"page\": 0,\n   \"index\": \"bestbuy\"\n}\n **/\nfunction SearchResults(state, results, options) {\n  var mainSubResponse = results[0] || {};\n\n  this._rawResults = results;\n\n  // eslint-disable-next-line consistent-this\n  var self = this;\n\n  // https://www.algolia.com/doc/api-reference/api-methods/search/#response\n  Object.keys(mainSubResponse).forEach(function (key) {\n    self[key] = mainSubResponse[key];\n  });\n\n  // Make every key of the result options reachable from the instance\n  var opts = defaultsPure(options, {\n    persistHierarchicalRootCount: false,\n  });\n  Object.keys(opts).forEach(function (key) {\n    self[key] = opts[key];\n  });\n\n  /**\n   * query used to generate the results\n   * @name query\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * The query as parsed by the engine given all the rules.\n   * @name parsedQuery\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * all the records that match the search parameters. Each record is\n   * augmented with a new attribute `_highlightResult`\n   * which is an object keyed by attribute and with the following properties:\n   * - `value` : the value of the facet highlighted (html)\n   * - `matchLevel`: `full`, `partial` or `none`, depending on how the query terms match\n   * @name hits\n   * @member {object[]}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * index where the results come from\n   * @name index\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * number of hits per page requested\n   * @name hitsPerPage\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * total number of hits of this query on the index\n   * @name nbHits\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * total number of pages with respect to the number of hits per page and the total number of hits\n   * @name nbPages\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * current page\n   * @name page\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * The position if the position was guessed by IP.\n   * @name aroundLatLng\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"48.8637,2.3615\",\n   */\n  /**\n   * The radius computed by Algolia.\n   * @name automaticRadius\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"126792922\",\n   */\n  /**\n   * String identifying the server used to serve this request.\n   *\n   * getRankingInfo needs to be set to `true` for this to be returned\n   *\n   * @name serverUsed\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   * @example \"c7-use-2.algolia.net\",\n   */\n  /**\n   * Boolean that indicates if the computation of the counts did time out.\n   * @deprecated\n   * @name timeoutCounts\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * Boolean that indicates if the computation of the hits did time out.\n   * @deprecated\n   * @name timeoutHits\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * True if the counts of the facets is exhaustive\n   * @name exhaustiveFacetsCount\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * True if the number of hits is exhaustive\n   * @name exhaustiveNbHits\n   * @member {boolean}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * Contains the userData if they are set by a [query rule](https://www.algolia.com/doc/guides/query-rules/query-rules-overview/).\n   * @name userData\n   * @member {object[]}\n   * @memberof SearchResults\n   * @instance\n   */\n  /**\n   * queryID is the unique identifier of the query used to generate the current search results.\n   * This value is only available if the `clickAnalytics` search parameter is set to `true`.\n   * @name queryID\n   * @member {string}\n   * @memberof SearchResults\n   * @instance\n   */\n\n  /**\n   * sum of the processing time of all the queries\n   * @name processingTimeMS\n   * @member {number}\n   * @memberof SearchResults\n   * @instance\n   */\n  this.processingTimeMS = results.reduce(function (sum, result) {\n    return result.processingTimeMS === undefined\n      ? sum\n      : sum + result.processingTimeMS;\n  }, 0);\n\n  /**\n   * disjunctive facets results\n   * @member {SearchResults.Facet[]}\n   */\n  this.disjunctiveFacets = [];\n  /**\n   * disjunctive facets results\n   * @member {SearchResults.HierarchicalFacet[]}\n   */\n  this.hierarchicalFacets = state.hierarchicalFacets.map(\n    function initFutureTree() {\n      return [];\n    }\n  );\n  /**\n   * other facets results\n   * @member {SearchResults.Facet[]}\n   */\n  this.facets = [];\n\n  var disjunctiveFacets = state.getRefinedDisjunctiveFacets();\n\n  var facetsIndices = getIndices(state.facets);\n  var disjunctiveFacetsIndices = getIndices(state.disjunctiveFacets);\n  var nextDisjunctiveResult = 1;\n\n  // Since we send request only for disjunctive facets that have been refined,\n  // we get the facets information from the first, general, response.\n\n  var mainFacets = mainSubResponse.facets || {};\n\n  Object.keys(mainFacets).forEach(function (facetKey) {\n    var facetValueObject = mainFacets[facetKey];\n\n    var hierarchicalFacet = findMatchingHierarchicalFacetFromAttributeName(\n      state.hierarchicalFacets,\n      facetKey\n    );\n\n    if (hierarchicalFacet) {\n      // Place the hierarchicalFacet data at the correct index depending on\n      // the attributes order that was defined at the helper initialization\n      var facetIndex = hierarchicalFacet.attributes.indexOf(facetKey);\n      var idxAttributeName = findIndex(state.hierarchicalFacets, function (f) {\n        return f.name === hierarchicalFacet.name;\n      });\n      self.hierarchicalFacets[idxAttributeName][facetIndex] = {\n        attribute: facetKey,\n        data: facetValueObject,\n        exhaustive: mainSubResponse.exhaustiveFacetsCount,\n      };\n    } else {\n      var isFacetDisjunctive = state.disjunctiveFacets.indexOf(facetKey) !== -1;\n      var isFacetConjunctive = state.facets.indexOf(facetKey) !== -1;\n      var position;\n\n      if (isFacetDisjunctive) {\n        position = disjunctiveFacetsIndices[facetKey];\n        self.disjunctiveFacets[position] = {\n          name: facetKey,\n          data: facetValueObject,\n          exhaustive: mainSubResponse.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.disjunctiveFacets[position],\n          mainSubResponse.facets_stats,\n          facetKey\n        );\n      }\n      if (isFacetConjunctive) {\n        position = facetsIndices[facetKey];\n        self.facets[position] = {\n          name: facetKey,\n          data: facetValueObject,\n          exhaustive: mainSubResponse.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.facets[position],\n          mainSubResponse.facets_stats,\n          facetKey\n        );\n      }\n    }\n  });\n\n  // Make sure we do not keep holes within the hierarchical facets\n  this.hierarchicalFacets = compact(this.hierarchicalFacets);\n\n  // aggregate the refined disjunctive facets\n  disjunctiveFacets.forEach(function (disjunctiveFacet) {\n    var result = results[nextDisjunctiveResult];\n    var facets = result && result.facets ? result.facets : {};\n    var hierarchicalFacet = state.getHierarchicalFacetByName(disjunctiveFacet);\n\n    // There should be only item in facets.\n    Object.keys(facets).forEach(function (dfacet) {\n      var facetResults = facets[dfacet];\n\n      var position;\n\n      if (hierarchicalFacet) {\n        position = findIndex(state.hierarchicalFacets, function (f) {\n          return f.name === hierarchicalFacet.name;\n        });\n        var attributeIndex = findIndex(\n          self.hierarchicalFacets[position],\n          function (f) {\n            return f.attribute === dfacet;\n          }\n        );\n\n        // previous refinements and no results so not able to find it\n        if (attributeIndex === -1) {\n          return;\n        }\n\n        self.hierarchicalFacets[position][attributeIndex].data =\n          self.persistHierarchicalRootCount\n            ? mergeNumericMax(\n                self.hierarchicalFacets[position][attributeIndex].data,\n                facetResults\n              )\n            : defaultsPure(\n                facetResults,\n                self.hierarchicalFacets[position][attributeIndex].data\n              );\n      } else {\n        position = disjunctiveFacetsIndices[dfacet];\n\n        var dataFromMainRequest =\n          (mainSubResponse.facets && mainSubResponse.facets[dfacet]) || {};\n\n        self.disjunctiveFacets[position] = {\n          name: dfacet,\n          data: mergeNumericMax(dataFromMainRequest, facetResults),\n          exhaustive: result.exhaustiveFacetsCount,\n        };\n        assignFacetStats(\n          self.disjunctiveFacets[position],\n          result.facets_stats,\n          dfacet\n        );\n\n        if (state.disjunctiveFacetsRefinements[dfacet]) {\n          state.disjunctiveFacetsRefinements[dfacet].forEach(function (\n            refinementValue\n          ) {\n            // add the disjunctive refinements if it is no more retrieved\n            if (\n              !self.disjunctiveFacets[position].data[refinementValue] &&\n              state.disjunctiveFacetsRefinements[dfacet].indexOf(\n                unescapeFacetValue(refinementValue)\n              ) > -1\n            ) {\n              self.disjunctiveFacets[position].data[refinementValue] = 0;\n            }\n          });\n        }\n      }\n    });\n    nextDisjunctiveResult++;\n  });\n\n  // if we have some parent level values for hierarchical facets, merge them\n  state.getRefinedHierarchicalFacets().forEach(function (refinedFacet) {\n    var hierarchicalFacet = state.getHierarchicalFacetByName(refinedFacet);\n    var separator = state._getHierarchicalFacetSeparator(hierarchicalFacet);\n\n    var currentRefinement = state.getHierarchicalRefinement(refinedFacet);\n    // if we are already at a root refinement (or no refinement at all), there is no\n    // root level values request\n    if (\n      currentRefinement.length === 0 ||\n      currentRefinement[0].split(separator).length < 2\n    ) {\n      return;\n    }\n\n    results.slice(nextDisjunctiveResult).forEach(function (result) {\n      var facets = result && result.facets ? result.facets : {};\n\n      Object.keys(facets).forEach(function (dfacet) {\n        var facetResults = facets[dfacet];\n        var position = findIndex(state.hierarchicalFacets, function (f) {\n          return f.name === hierarchicalFacet.name;\n        });\n        var attributeIndex = findIndex(\n          self.hierarchicalFacets[position],\n          function (f) {\n            return f.attribute === dfacet;\n          }\n        );\n\n        // previous refinements and no results so not able to find it\n        if (attributeIndex === -1) {\n          return;\n        }\n\n        // when we always get root levels, if the hits refinement is `beers > IPA` (count: 5),\n        // then the disjunctive values will be `beers` (count: 100),\n        // but we do not want to display\n        //   | beers (100)\n        //     > IPA (5)\n        // We want\n        //   | beers (5)\n        //     > IPA (5)\n        // @MAJOR: remove this legacy behaviour in next major version\n        var defaultData = {};\n\n        if (\n          currentRefinement.length > 0 &&\n          !self.persistHierarchicalRootCount\n        ) {\n          var root = currentRefinement[0].split(separator)[0];\n          defaultData[root] =\n            self.hierarchicalFacets[position][attributeIndex].data[root];\n        }\n\n        self.hierarchicalFacets[position][attributeIndex].data = defaultsPure(\n          defaultData,\n          facetResults,\n          self.hierarchicalFacets[position][attributeIndex].data\n        );\n      });\n\n      nextDisjunctiveResult++;\n    });\n  });\n\n  // add the excludes\n  Object.keys(state.facetsExcludes).forEach(function (facetName) {\n    var excludes = state.facetsExcludes[facetName];\n    var position = facetsIndices[facetName];\n\n    self.facets[position] = {\n      name: facetName,\n      data: mainFacets[facetName],\n      exhaustive: mainSubResponse.exhaustiveFacetsCount,\n    };\n    excludes.forEach(function (facetValue) {\n      self.facets[position] = self.facets[position] || { name: facetName };\n      self.facets[position].data = self.facets[position].data || {};\n      self.facets[position].data[facetValue] = 0;\n    });\n  });\n\n  /**\n   * @type {Array}\n   */\n  this.hierarchicalFacets = this.hierarchicalFacets.map(\n    generateHierarchicalTree(state)\n  );\n\n  /**\n   * @type {Array}\n   */\n  this.facets = compact(this.facets);\n  /**\n   * @type {Array}\n   */\n  this.disjunctiveFacets = compact(this.disjunctiveFacets);\n\n  this._state = state;\n}\n\n/**\n * Get a facet object with its name\n * @deprecated\n * @param {string} name name of the faceted attribute\n * @return {SearchResults.Facet} the facet object\n */\nSearchResults.prototype.getFacetByName = function (name) {\n  function predicate(facet) {\n    return facet.name === name;\n  }\n\n  return (\n    find(this.facets, predicate) ||\n    find(this.disjunctiveFacets, predicate) ||\n    find(this.hierarchicalFacets, predicate)\n  );\n};\n\n/**\n * Get the facet values of a specified attribute from a SearchResults object.\n * @private\n * @param {SearchResults} results the search results to search in\n * @param {string} attribute name of the faceted attribute to search for\n * @return {array|object} facet values. For the hierarchical facets it is an object.\n */\nfunction extractNormalizedFacetValues(results, attribute) {\n  function predicate(facet) {\n    return facet.name === attribute;\n  }\n\n  if (results._state.isConjunctiveFacet(attribute)) {\n    var facet = find(results.facets, predicate);\n    if (!facet) return [];\n\n    return Object.keys(facet.data).map(function (name) {\n      var value = escapeFacetValue(name);\n      return {\n        name: name,\n        escapedValue: value,\n        count: facet.data[name],\n        isRefined: results._state.isFacetRefined(attribute, value),\n        isExcluded: results._state.isExcludeRefined(attribute, name),\n      };\n    });\n  } else if (results._state.isDisjunctiveFacet(attribute)) {\n    var disjunctiveFacet = find(results.disjunctiveFacets, predicate);\n    if (!disjunctiveFacet) return [];\n\n    return Object.keys(disjunctiveFacet.data).map(function (name) {\n      var value = escapeFacetValue(name);\n      return {\n        name: name,\n        escapedValue: value,\n        count: disjunctiveFacet.data[name],\n        isRefined: results._state.isDisjunctiveFacetRefined(attribute, value),\n      };\n    });\n  } else if (results._state.isHierarchicalFacet(attribute)) {\n    var hierarchicalFacetValues = find(results.hierarchicalFacets, predicate);\n    if (!hierarchicalFacetValues) return hierarchicalFacetValues;\n\n    var hierarchicalFacet =\n      results._state.getHierarchicalFacetByName(attribute);\n    var separator =\n      results._state._getHierarchicalFacetSeparator(hierarchicalFacet);\n    var currentRefinement = unescapeFacetValue(\n      results._state.getHierarchicalRefinement(attribute)[0] || ''\n    );\n\n    if (currentRefinement.indexOf(hierarchicalFacet.rootPath) === 0) {\n      currentRefinement = currentRefinement.replace(\n        hierarchicalFacet.rootPath + separator,\n        ''\n      );\n    }\n\n    var currentRefinementSplit = currentRefinement.split(separator);\n    currentRefinementSplit.unshift(attribute);\n\n    setIsRefined(hierarchicalFacetValues, currentRefinementSplit, 0);\n\n    return hierarchicalFacetValues;\n  }\n\n  return undefined;\n}\n\n/**\n * Set the isRefined of a hierarchical facet result based on the current state.\n * @param {SearchResults.HierarchicalFacet} item Hierarchical facet to fix\n * @param {string[]} currentRefinement array of parts of the current hierarchical refinement\n * @param {number} depth recursion depth in the currentRefinement\n * @return {undefined} function mutates the item\n */\nfunction setIsRefined(item, currentRefinement, depth) {\n  item.isRefined =\n    item.name === (currentRefinement[depth] && currentRefinement[depth].trim());\n  if (item.data) {\n    item.data.forEach(function (child) {\n      setIsRefined(child, currentRefinement, depth + 1);\n    });\n  }\n}\n\n/**\n * Sort nodes of a hierarchical or disjunctive facet results\n * @private\n * @param {function} sortFn sort function to apply\n * @param {HierarchicalFacet|Array} node node upon which we want to apply the sort\n * @param {string[]} names attribute names\n * @param {number} [level=0] current index in the names array\n * @return {HierarchicalFacet|Array} sorted node\n */\nfunction recSort(sortFn, node, names, level) {\n  level = level || 0;\n\n  if (Array.isArray(node)) {\n    return sortFn(node, names[level]);\n  }\n\n  if (!node.data || node.data.length === 0) {\n    return node;\n  }\n\n  var children = node.data.map(function (childNode) {\n    return recSort(sortFn, childNode, names, level + 1);\n  });\n  var sortedChildren = sortFn(children, names[level]);\n  var newNode = defaultsPure({ data: sortedChildren }, node);\n  return newNode;\n}\n\nSearchResults.DEFAULT_SORT = ['isRefined:desc', 'count:desc', 'name:asc'];\n\nfunction vanillaSortFn(order, data) {\n  return data.sort(order);\n}\n\n/**\n * @typedef FacetOrdering\n * @type {Object}\n * @property {string[]} [order]\n * @property {'count' | 'alpha' | 'hidden'} [sortRemainingBy]\n */\n\n/**\n * Sorts facet arrays via their facet ordering\n * @param {Array} facetValues the values\n * @param {FacetOrdering} facetOrdering the ordering\n * @returns {Array} the sorted facet values\n */\nfunction sortViaFacetOrdering(facetValues, facetOrdering) {\n  var orderedFacets = [];\n  var remainingFacets = [];\n  var hide = facetOrdering.hide || [];\n  var order = facetOrdering.order || [];\n\n  /**\n   * an object with the keys being the values in order, the values their index:\n   * ['one', 'two'] -> { one: 0, two: 1 }\n   */\n  var reverseOrder = order.reduce(function (acc, name, i) {\n    acc[name] = i;\n    return acc;\n  }, {});\n\n  facetValues.forEach(function (item) {\n    // hierarchical facets get sorted using their raw name\n    var name = item.path || item.name;\n    var hidden = hide.indexOf(name) > -1;\n    if (!hidden && reverseOrder[name] !== undefined) {\n      orderedFacets[reverseOrder[name]] = item;\n    } else if (!hidden) {\n      remainingFacets.push(item);\n    }\n  });\n\n  orderedFacets = orderedFacets.filter(function (facet) {\n    return facet;\n  });\n\n  var sortRemainingBy = facetOrdering.sortRemainingBy;\n  var ordering;\n  if (sortRemainingBy === 'hidden') {\n    return orderedFacets;\n  } else if (sortRemainingBy === 'alpha') {\n    ordering = [\n      ['path', 'name'],\n      ['asc', 'asc'],\n    ];\n  } else {\n    ordering = [['count'], ['desc']];\n  }\n\n  return orderedFacets.concat(\n    orderBy(remainingFacets, ordering[0], ordering[1])\n  );\n}\n\n/**\n * @param {SearchResults} results the search results class\n * @param {string} attribute the attribute to retrieve ordering of\n * @returns {FacetOrdering | undefined} the facet ordering\n */\nfunction getFacetOrdering(results, attribute) {\n  return (\n    results.renderingContent &&\n    results.renderingContent.facetOrdering &&\n    results.renderingContent.facetOrdering.values &&\n    results.renderingContent.facetOrdering.values[attribute]\n  );\n}\n\n/**\n * Get a the list of values for a given facet attribute. Those values are sorted\n * refinement first, descending count (bigger value on top), and name ascending\n * (alphabetical order). The sort formula can overridden using either string based\n * predicates or a function.\n *\n * This method will return all the values returned by the Algolia engine plus all\n * the values already refined. This means that it can happen that the\n * `maxValuesPerFacet` [configuration](https://www.algolia.com/doc/rest-api/search#param-maxValuesPerFacet)\n * might not be respected if you have facet values that are already refined.\n * @param {string} attribute attribute name\n * @param {object} opts configuration options.\n * @param {boolean} [opts.facetOrdering]\n * Force the use of facetOrdering from the result if a sortBy is present. If\n * sortBy isn't present, facetOrdering will be used automatically.\n * @param {Array.<string> | function} opts.sortBy\n * When using strings, it consists of\n * the name of the [FacetValue](#SearchResults.FacetValue) or the\n * [HierarchicalFacet](#SearchResults.HierarchicalFacet) attributes with the\n * order (`asc` or `desc`). For example to order the value by count, the\n * argument would be `['count:asc']`.\n *\n * If only the attribute name is specified, the ordering defaults to the one\n * specified in the default value for this attribute.\n *\n * When not specified, the order is\n * ascending.  This parameter can also be a function which takes two facet\n * values and should return a number, 0 if equal, 1 if the first argument is\n * bigger or -1 otherwise.\n *\n * The default value for this attribute `['isRefined:desc', 'count:desc', 'name:asc']`\n * @return {FacetValue[]|HierarchicalFacet|undefined} depending on the type of facet of\n * the attribute requested (hierarchical, disjunctive or conjunctive)\n * @example\n * helper.on('result', function(event){\n *   //get values ordered only by name ascending using the string predicate\n *   event.results.getFacetValues('city', {sortBy: ['name:asc']});\n *   //get values  ordered only by count ascending using a function\n *   event.results.getFacetValues('city', {\n *     // this is equivalent to ['count:asc']\n *     sortBy: function(a, b) {\n *       if (a.count === b.count) return 0;\n *       if (a.count > b.count)   return 1;\n *       if (b.count > a.count)   return -1;\n *     }\n *   });\n * });\n */\nSearchResults.prototype.getFacetValues = function (attribute, opts) {\n  var facetValues = extractNormalizedFacetValues(this, attribute);\n  if (!facetValues) {\n    return undefined;\n  }\n\n  var options = defaultsPure(opts, {\n    sortBy: SearchResults.DEFAULT_SORT,\n    // if no sortBy is given, attempt to sort based on facetOrdering\n    // if it is given, we still allow to sort via facet ordering first\n    facetOrdering: !(opts && opts.sortBy),\n  });\n\n  // eslint-disable-next-line consistent-this\n  var results = this;\n  var attributes;\n  if (Array.isArray(facetValues)) {\n    attributes = [attribute];\n  } else {\n    var config = results._state.getHierarchicalFacetByName(facetValues.name);\n    attributes = config.attributes;\n  }\n\n  return recSort(\n    function (data, facetName) {\n      var facetOrdering = getFacetOrdering(results, facetName);\n      if (options.facetOrdering) {\n        if (facetOrdering) {\n          return sortViaFacetOrdering(data, facetOrdering);\n        }\n      }\n\n      if (Array.isArray(options.sortBy)) {\n        var order = formatSort(options.sortBy, SearchResults.DEFAULT_SORT);\n        var items = orderBy(data, order[0], order[1]);\n\n        var hide =\n          facetOrdering && facetOrdering.hide ? facetOrdering.hide : [];\n        if (hide.length > 0) {\n          var visible = [];\n          items.forEach(function (item) {\n            // hierarchical facets get sorted using their raw name\n            var name = item.path || item.name;\n            if (hide.indexOf(name) === -1) {\n              visible.push(item);\n            }\n          });\n\n          return visible;\n        }\n\n        return items;\n      } else if (typeof options.sortBy === 'function') {\n        return vanillaSortFn(options.sortBy, data);\n      }\n      throw new Error(\n        'options.sortBy is optional but if defined it must be ' +\n          'either an array of string (predicates) or a sorting function'\n      );\n    },\n    facetValues,\n    attributes\n  );\n};\n\n/**\n * Returns the facet stats if attribute is defined and the facet contains some.\n * Otherwise returns undefined.\n * @param {string} attribute name of the faceted attribute\n * @return {object} The stats of the facet\n */\nSearchResults.prototype.getFacetStats = function (attribute) {\n  if (this._state.isConjunctiveFacet(attribute)) {\n    return getFacetStatsIfAvailable(this.facets, attribute);\n  } else if (this._state.isDisjunctiveFacet(attribute)) {\n    return getFacetStatsIfAvailable(this.disjunctiveFacets, attribute);\n  }\n\n  return undefined;\n};\n\n/**\n * @typedef {Object} FacetListItem\n * @property {string} name\n */\n\n/**\n * @param {FacetListItem[]} facetList (has more items, but enough for here)\n * @param {string} facetName The attribute to look for\n * @return {object|undefined} The stats of the facet\n */\nfunction getFacetStatsIfAvailable(facetList, facetName) {\n  var data = find(facetList, function (facet) {\n    return facet.name === facetName;\n  });\n  return data && data.stats;\n}\n\n/**\n * Returns all refinements for all filters + tags. It also provides\n * additional information: count and exhaustiveness for each filter.\n *\n * See the [refinement type](#Refinement) for an exhaustive view of the available\n * data.\n *\n * Note that for a numeric refinement, results are grouped per operator, this\n * means that it will return responses for operators which are empty.\n *\n * @return {Array.<Refinement>} all the refinements\n */\nSearchResults.prototype.getRefinements = function () {\n  var state = this._state;\n  // eslint-disable-next-line consistent-this\n  var results = this;\n  var res = [];\n\n  Object.keys(state.facetsRefinements).forEach(function (attributeName) {\n    state.facetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(state, 'facet', attributeName, name, results.facets)\n      );\n    });\n  });\n\n  Object.keys(state.facetsExcludes).forEach(function (attributeName) {\n    state.facetsExcludes[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(state, 'exclude', attributeName, name, results.facets)\n      );\n    });\n  });\n\n  Object.keys(state.disjunctiveFacetsRefinements).forEach(function (\n    attributeName\n  ) {\n    state.disjunctiveFacetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getRefinement(\n          state,\n          'disjunctive',\n          attributeName,\n          name,\n          results.disjunctiveFacets\n        )\n      );\n    });\n  });\n\n  Object.keys(state.hierarchicalFacetsRefinements).forEach(function (\n    attributeName\n  ) {\n    state.hierarchicalFacetsRefinements[attributeName].forEach(function (name) {\n      res.push(\n        getHierarchicalRefinement(\n          state,\n          attributeName,\n          name,\n          results.hierarchicalFacets\n        )\n      );\n    });\n  });\n\n  Object.keys(state.numericRefinements).forEach(function (attributeName) {\n    var operators = state.numericRefinements[attributeName];\n    Object.keys(operators).forEach(function (operator) {\n      operators[operator].forEach(function (value) {\n        res.push({\n          type: 'numeric',\n          attributeName: attributeName,\n          name: value,\n          numericValue: value,\n          operator: operator,\n        });\n      });\n    });\n  });\n\n  state.tagRefinements.forEach(function (name) {\n    res.push({ type: 'tag', attributeName: '_tags', name: name });\n  });\n\n  return res;\n};\n\n/**\n * @typedef {Object} Facet\n * @property {string} name\n * @property {Object} data\n * @property {boolean} exhaustive\n */\n\n/**\n * @param {SearchParameters} state the current state\n * @param {string} type the type of the refinement\n * @param {string} attributeName The attribute of the facet\n * @param {*} name The name of the facet\n * @param {Facet[]} resultsFacets facets from the results\n * @return {Refinement} the refinement\n */\nfunction getRefinement(state, type, attributeName, name, resultsFacets) {\n  var facet = find(resultsFacets, function (f) {\n    return f.name === attributeName;\n  });\n  var count = facet && facet.data && facet.data[name] ? facet.data[name] : 0;\n  var exhaustive = (facet && facet.exhaustive) || false;\n\n  return {\n    type: type,\n    attributeName: attributeName,\n    name: name,\n    count: count,\n    exhaustive: exhaustive,\n  };\n}\n\n/**\n * @param {SearchParameters} state the current state\n * @param {string} attributeName the attribute of the hierarchical facet\n * @param {string} name the name of the facet\n * @param {Facet[]} resultsFacets facets from the results\n * @return {HierarchicalFacet} the hierarchical facet\n */\nfunction getHierarchicalRefinement(state, attributeName, name, resultsFacets) {\n  var facetDeclaration = state.getHierarchicalFacetByName(attributeName);\n  var separator = state._getHierarchicalFacetSeparator(facetDeclaration);\n  var split = name.split(separator);\n  var rootFacet = find(resultsFacets, function (facet) {\n    return facet.name === attributeName;\n  });\n\n  var facet = split.reduce(function (intermediateFacet, part) {\n    var newFacet =\n      intermediateFacet &&\n      find(intermediateFacet.data, function (f) {\n        return f.name === part;\n      });\n    return newFacet !== undefined ? newFacet : intermediateFacet;\n  }, rootFacet);\n\n  var count = (facet && facet.count) || 0;\n  var exhaustive = (facet && facet.exhaustive) || false;\n  var path = (facet && facet.path) || '';\n\n  return {\n    type: 'hierarchical',\n    attributeName: attributeName,\n    name: path,\n    count: count,\n    exhaustive: exhaustive,\n  };\n}\n\nmodule.exports = SearchResults;\n"],"names":["compact","require$$0","defaultsPure","require$$1","fv","require$$2","find","require$$3","findIndex","require$$4","formatSort","require$$5","mergeNumericMax","require$$6","orderBy","require$$7","escapeFacetValue","unescapeFacetValue","generateHierarchicalTree","require$$8","getIndices","attributes","indices","forEach","val","idx","assignFacetStats","dest","facetStats","key","stats","SearchResults","state","results","options","mainSubResponse","this","_rawResults","self","Object","keys","opts","persistHierarchicalRootCount","processingTimeMS","reduce","sum","result","undefined","disjunctiveFacets","hierarchicalFacets","map","facets","getRefinedDisjunctiveFacets","facetsIndices","disjunctiveFacetsIndices","nextDisjunctiveResult","mainFacets","facetKey","hierarchicalAttributeName","facetValueObject","hierarchicalFacet","indexOf","facetIndex","idxAttributeName","f","name","attribute","data","exhaustive","exhaustiveFacetsCount","position","isFacetDisjunctive","isFacetConjunctive","facets_stats","disjunctiveFacet","getHierarchicalFacetByName","dfacet","facetResults","attributeIndex","dataFromMainRequest","disjunctiveFacetsRefinements","refinementValue","getRefinedHierarchicalFacets","refinedFacet","separator","_getHierarchicalFacetSeparator","currentRefinement","getHierarchicalRefinement","length","split","slice","defaultData","root","facetsExcludes","facetName","excludes","facetValue","_state","extractNormalizedFacetValues","predicate","facet","isConjunctiveFacet","value","escapedValue","count","isRefined","isFacetRefined","isExcluded","isExcludeRefined","isDisjunctiveFacet","isDisjunctiveFacetRefined","isHierarchicalFacet","hierarchicalFacetValues","rootPath","replace","currentRefinementSplit","unshift","setIsRefined","item","depth","trim","child","recSort","sortFn","node","names","level","Array","isArray","children","childNode","sortedChildren","getFacetStatsIfAvailable","facetList","getRefinement","type","attributeName","resultsFacets","prototype","getFacetByName","DEFAULT_SORT","getFacetValues","facetValues","sortBy","facetOrdering","renderingContent","values","getFacetOrdering","orderedFacets","remainingFacets","hide","reverseOrder","order","acc","i","path","hidden","push","filter","ordering","sortRemainingBy","concat","sortViaFacetOrdering","items","visible","sort","vanillaSortFn","Error","getFacetStats","getRefinements","res","facetsRefinements","hierarchicalFacetsRefinements","facetDeclaration","rootFacet","intermediateFacet","part","newFacet","numericRefinements","operators","operator","numericValue","tagRefinements","SearchResults_1"],"mappings":"2hBAEA,IAAIA,EAAUC,IACVC,EAAeC,IACfC,EAAKC,IACLC,EAAOC,IACPC,EAAYC,IACZC,EAAaC,IACbC,EAAkBC,IAClBC,EAAUC,IACVC,EAAmBZ,EAAGY,iBACtBC,EAAqBb,EAAGa,mBAExBC,EAA2BC,IAgD/B,SAASC,EAAWC,GAClB,IAAIC,EAAU,CAAA,EAMd,OAJAD,EAAWE,QAAQ,SAAUC,EAAKC,GAChCH,EAAQE,GAAOC,CACnB,GAESH,CACT,CAEA,SAASI,EAAiBC,EAAMC,EAAYC,GACtCD,GAAcA,EAAWC,KAC3BF,EAAKG,MAAQF,EAAWC,GAE5B,CA6JA,SAASE,EAAcC,EAAOC,EAASC,GACrC,IAAIC,EAAkBF,EAAQ,IAAM,CAAA,EAEpCG,KAAKC,YAAcJ,EAGnB,IAAIK,EAAOF,KAGXG,OAAOC,KAAKL,GAAiBZ,QAAQ,SAAUM,GAC7CS,EAAKT,GAAOM,EAAgBN,EAChC,GAGE,IAAIY,EAAOvC,EAAagC,EAAS,CAC/BQ,8BAA8B,IAEhCH,OAAOC,KAAKC,GAAMlB,QAAQ,SAAUM,GAClCS,EAAKT,GAAOY,EAAKZ,EACrB,GA8IEO,KAAKO,iBAAmBV,EAAQW,OAAO,SAAUC,EAAKC,GACpD,YAAmCC,IAA5BD,EAAOH,iBACVE,EACAA,EAAMC,EAAOH,gBACrB,EAAK,GAMHP,KAAKY,kBAAoB,GAKzBZ,KAAKa,mBAAqBjB,EAAMiB,mBAAmBC,IACjD,WACE,MAAO,EACb,GAMEd,KAAKe,OAAS,GAEd,IAAIH,EAAoBhB,EAAMoB,8BAE1BC,EAAgBjC,EAAWY,EAAMmB,QACjCG,EAA2BlC,EAAWY,EAAMgB,mBAC5CO,EAAwB,EAKxBC,EAAarB,EAAgBgB,QAAU,CAAA,EAE3CZ,OAAOC,KAAKgB,GAAYjC,QAAQ,SAAUkC,GACxC,IAtVFR,EACAS,EAqVMC,EAAmBH,EAAWC,GAE9BG,GAxVNX,EAyVIjB,EAAMiB,mBAxVVS,EAyVID,EAvVGnD,EACL2C,EACA,SAAkCW,GAEhC,OADiBA,EAAkBvC,YAAc,IAC/BwC,QAAQH,IAA6B,CAC7D,IAqVI,GAAIE,EAAmB,CAGrB,IAAIE,EAAaF,EAAkBvC,WAAWwC,QAAQJ,GAClDM,EAAmBvD,EAAUwB,EAAMiB,mBAAoB,SAAUe,GACnE,OAAOA,EAAEC,OAASL,EAAkBK,IAC5C,GACM3B,EAAKW,mBAAmBc,GAAkBD,GAAc,CACtDI,UAAWT,EACXU,KAAMR,EACNS,WAAYjC,EAAgBkC,sBAEpC,KAAW,CACL,IAEIC,EAFAC,GAAmE,IAA9CvC,EAAMgB,kBAAkBa,QAAQJ,GACrDe,GAAwD,IAAnCxC,EAAMmB,OAAOU,QAAQJ,GAG1Cc,IACFD,EAAWhB,EAAyBG,GACpCnB,EAAKU,kBAAkBsB,GAAY,CACjCL,KAAMR,EACNU,KAAMR,EACNS,WAAYjC,EAAgBkC,uBAE9B3C,EACEY,EAAKU,kBAAkBsB,GACvBnC,EAAgBsC,aAChBhB,IAGAe,IACFF,EAAWjB,EAAcI,GACzBnB,EAAKa,OAAOmB,GAAY,CACtBL,KAAMR,EACNU,KAAMR,EACNS,WAAYjC,EAAgBkC,uBAE9B3C,EACEY,EAAKa,OAAOmB,GACZnC,EAAgBsC,aAChBhB,GAGV,CACA,GAGErB,KAAKa,mBAAqBjD,EAAQoC,KAAKa,oBAGvCD,EAAkBzB,QAAQ,SAAUmD,GAClC,IAAI5B,EAASb,EAAQsB,GACjBJ,EAASL,GAAUA,EAAOK,OAASL,EAAOK,OAAS,CAAA,EACnDS,EAAoB5B,EAAM2C,2BAA2BD,GAGzDnC,OAAOC,KAAKW,GAAQ5B,QAAQ,SAAUqD,GACpC,IAEIN,EAFAO,EAAe1B,EAAOyB,GAI1B,GAAIhB,EAAmB,CACrBU,EAAW9D,EAAUwB,EAAMiB,mBAAoB,SAAUe,GACvD,OAAOA,EAAEC,OAASL,EAAkBK,IAC9C,GACQ,IAAIa,EAAiBtE,EACnB8B,EAAKW,mBAAmBqB,GACxB,SAAUN,GACR,OAAOA,EAAEE,YAAcU,CACnC,GAIQ,IAAuB,IAAnBE,EACF,OAGFxC,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAChD7B,EAAKI,6BACD9B,EACE0B,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAClDU,GAEF3E,EACE2E,EACAvC,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAElE,KAAa,CACLG,EAAWhB,EAAyBsB,GAEpC,IAAIG,EACD5C,EAAgBgB,QAAUhB,EAAgBgB,OAAOyB,IAAY,CAAA,EAEhEtC,EAAKU,kBAAkBsB,GAAY,CACjCL,KAAMW,EACNT,KAAMvD,EAAgBmE,EAAqBF,GAC3CT,WAAYtB,EAAOuB,uBAErB3C,EACEY,EAAKU,kBAAkBsB,GACvBxB,EAAO2B,aACPG,GAGE5C,EAAMgD,6BAA6BJ,IACrC5C,EAAMgD,6BAA6BJ,GAAQrD,QAAQ,SACjD0D,IAIG3C,EAAKU,kBAAkBsB,GAAUH,KAAKc,IACvCjD,EAAMgD,6BAA6BJ,GAAQf,QACzC5C,EAAmBgE,KACjB,IAEJ3C,EAAKU,kBAAkBsB,GAAUH,KAAKc,GAAmB,EAEvE,EAEA,CACA,GACI1B,GACJ,GAGEvB,EAAMkD,+BAA+B3D,QAAQ,SAAU4D,GACrD,IAAIvB,EAAoB5B,EAAM2C,2BAA2BQ,GACrDC,EAAYpD,EAAMqD,+BAA+BzB,GAEjD0B,EAAoBtD,EAAMuD,0BAA0BJ,GAIzB,IAA7BG,EAAkBE,QAClBF,EAAkB,GAAGG,MAAML,GAAWI,OAAS,GAKjDvD,EAAQyD,MAAMnC,GAAuBhC,QAAQ,SAAUuB,GACrD,IAAIK,EAASL,GAAUA,EAAOK,OAASL,EAAOK,OAAS,CAAA,EAEvDZ,OAAOC,KAAKW,GAAQ5B,QAAQ,SAAUqD,GACpC,IAAIC,EAAe1B,EAAOyB,GACtBN,EAAW9D,EAAUwB,EAAMiB,mBAAoB,SAAUe,GAC3D,OAAOA,EAAEC,OAASL,EAAkBK,IAC9C,GACYa,EAAiBtE,EACnB8B,EAAKW,mBAAmBqB,GACxB,SAAUN,GACR,OAAOA,EAAEE,YAAcU,CACnC,GAIQ,IAAuB,IAAnBE,EAAJ,CAaA,IAAIa,EAAc,CAAA,EAElB,GACEL,EAAkBE,OAAS,IAC1BlD,EAAKI,6BACN,CACA,IAAIkD,EAAON,EAAkB,GAAGG,MAAML,GAAW,GACjDO,EAAYC,GACVtD,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAAKyB,EACnE,CAEQtD,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAAOjE,EACvDyF,EACAd,EACAvC,EAAKW,mBAAmBqB,GAAUQ,GAAgBX,KAzB5D,CA2BA,GAEMZ,GACN,EACA,GAGEhB,OAAOC,KAAKR,EAAM6D,gBAAgBtE,QAAQ,SAAUuE,GAClD,IAAIC,EAAW/D,EAAM6D,eAAeC,GAChCxB,EAAWjB,EAAcyC,GAE7BxD,EAAKa,OAAOmB,GAAY,CACtBL,KAAM6B,EACN3B,KAAMX,EAAWsC,GACjB1B,WAAYjC,EAAgBkC,uBAE9B0B,EAASxE,QAAQ,SAAUyE,GACzB1D,EAAKa,OAAOmB,GAAYhC,EAAKa,OAAOmB,IAAa,CAAEL,KAAM6B,GACzDxD,EAAKa,OAAOmB,GAAUH,KAAO7B,EAAKa,OAAOmB,GAAUH,MAAQ,CAAA,EAC3D7B,EAAKa,OAAOmB,GAAUH,KAAK6B,GAAc,CAC/C,EACA,GAKE5D,KAAKa,mBAAqBb,KAAKa,mBAAmBC,IAChDhC,EAAyBc,IAM3BI,KAAKe,OAASnD,EAAQoC,KAAKe,QAI3Bf,KAAKY,kBAAoBhD,EAAQoC,KAAKY,mBAEtCZ,KAAK6D,OAASjE,CAChB,CA2BA,SAASkE,EAA6BjE,EAASiC,GAC7C,SAASiC,EAAUC,GACjB,OAAOA,EAAMnC,OAASC,CAC1B,CAEE,GAAIjC,EAAQgE,OAAOI,mBAAmBnC,GAAY,CAChD,IAAIkC,EAAQ9F,EAAK2B,EAAQkB,OAAQgD,GACjC,OAAKC,EAEE7D,OAAOC,KAAK4D,EAAMjC,MAAMjB,IAAI,SAAUe,GAC3C,IAAIqC,EAAQtF,EAAiBiD,GAC7B,MAAO,CACLA,KAAMA,EACNsC,aAAcD,EACdE,MAAOJ,EAAMjC,KAAKF,GAClBwC,UAAWxE,EAAQgE,OAAOS,eAAexC,EAAWoC,GACpDK,WAAY1E,EAAQgE,OAAOW,iBAAiB1C,EAAWD,GAE/D,GAXuB,EAYvB,CAAS,GAAIhC,EAAQgE,OAAOY,mBAAmB3C,GAAY,CACvD,IAAIQ,EAAmBpE,EAAK2B,EAAQe,kBAAmBmD,GACvD,OAAKzB,EAEEnC,OAAOC,KAAKkC,EAAiBP,MAAMjB,IAAI,SAAUe,GACtD,IAAIqC,EAAQtF,EAAiBiD,GAC7B,MAAO,CACLA,KAAMA,EACNsC,aAAcD,EACdE,MAAO9B,EAAiBP,KAAKF,GAC7BwC,UAAWxE,EAAQgE,OAAOa,0BAA0B5C,EAAWoC,GAEvE,GAVkC,EAWlC,CAAS,GAAIrE,EAAQgE,OAAOc,oBAAoB7C,GAAY,CACxD,IAAI8C,EAA0B1G,EAAK2B,EAAQgB,mBAAoBkD,GAC/D,IAAKa,EAAyB,OAAOA,EAErC,IAAIpD,EACF3B,EAAQgE,OAAOtB,2BAA2BT,GACxCkB,EACFnD,EAAQgE,OAAOZ,+BAA+BzB,GAC5C0B,EAAoBrE,EACtBgB,EAAQgE,OAAOV,0BAA0BrB,GAAW,IAAM,IAGE,IAA1DoB,EAAkBzB,QAAQD,EAAkBqD,YAC9C3B,EAAoBA,EAAkB4B,QACpCtD,EAAkBqD,SAAW7B,EAC7B,KAIJ,IAAI+B,EAAyB7B,EAAkBG,MAAML,GAKrD,OAJA+B,EAAuBC,QAAQlD,GAE/BmD,EAAaL,EAAyBG,EAAwB,GAEvDH,CACX,CAGA,CASA,SAASK,EAAaC,EAAMhC,EAAmBiC,GAC7CD,EAAKb,UACHa,EAAKrD,QAAUqB,EAAkBiC,IAAUjC,EAAkBiC,GAAOC,QAClEF,EAAKnD,MACPmD,EAAKnD,KAAK5C,QAAQ,SAAUkG,GAC1BJ,EAAaI,EAAOnC,EAAmBiC,EAAQ,EACrD,EAEA,CAWA,SAASG,EAAQC,EAAQC,EAAMC,EAAOC,GAGpC,GAFAA,EAAQA,GAAS,EAEbC,MAAMC,QAAQJ,GAChB,OAAOD,EAAOC,EAAMC,EAAMC,IAG5B,IAAKF,EAAKzD,MAA6B,IAArByD,EAAKzD,KAAKqB,OAC1B,OAAOoC,EAGT,IAAIK,EAAWL,EAAKzD,KAAKjB,IAAI,SAAUgF,GACrC,OAAOR,EAAQC,EAAQO,EAAWL,EAAOC,EAAQ,EACrD,GACMK,EAAiBR,EAAOM,EAAUJ,EAAMC,IAE5C,OADc5H,EAAa,CAAEiE,KAAMgE,GAAkBP,EAEvD,CA8NA,SAASQ,EAAyBC,EAAWvC,GAC3C,IAAI3B,EAAO7D,EAAK+H,EAAW,SAAUjC,GACnC,OAAOA,EAAMnC,OAAS6B,CAC1B,GACE,OAAO3B,GAAQA,EAAKrC,KACtB,CAwGA,SAASwG,EAActG,EAAOuG,EAAMC,EAAevE,EAAMwE,GACvD,IAAIrC,EAAQ9F,EAAKmI,EAAe,SAAUzE,GACxC,OAAOA,EAAEC,OAASuE,CACtB,GACMhC,EAAQJ,GAASA,EAAMjC,MAAQiC,EAAMjC,KAAKF,GAAQmC,EAAMjC,KAAKF,GAAQ,EACrEG,EAAcgC,GAASA,EAAMhC,aAAe,EAEhD,MAAO,CACLmE,KAAMA,EACNC,cAAeA,EACfvE,KAAMA,EACNuC,MAAOA,EACPpC,WAAYA,EAEhB,QArdArC,EAAc2G,UAAUC,eAAiB,SAAU1E,GACjD,SAASkC,EAAUC,GACjB,OAAOA,EAAMnC,OAASA,CAC1B,CAEE,OACE3D,EAAK8B,KAAKe,OAAQgD,IAClB7F,EAAK8B,KAAKY,kBAAmBmD,IAC7B7F,EAAK8B,KAAKa,mBAAoBkD,EAElC,EAoHApE,EAAc6G,aAAe,CAAC,iBAAkB,aAAc,YAiI9D7G,EAAc2G,UAAUG,eAAiB,SAAU3E,EAAWzB,GAC5D,IAAIqG,EAAc5C,EAA6B9D,KAAM8B,GACrD,GAAK4E,EAAL,CAIA,IASIzH,EATAa,EAAUhC,EAAauC,EAAM,CAC/BsG,OAAQhH,EAAc6G,aAGtBI,gBAAiBvG,GAAQA,EAAKsG,UAI5B9G,EAAUG,KAEd,GAAI2F,MAAMC,QAAQc,GAChBzH,EAAa,CAAC6C,QAGd7C,EADaY,EAAQgE,OAAOtB,2BAA2BmE,EAAY7E,MAC/C5C,WAGtB,OAAOqG,EACL,SAAUvD,EAAM2B,GACd,IAAIkD,EAlFV,SAA0B/G,EAASiC,GACjC,OACEjC,EAAQgH,kBACRhH,EAAQgH,iBAAiBD,eACzB/G,EAAQgH,iBAAiBD,cAAcE,QACvCjH,EAAQgH,iBAAiBD,cAAcE,OAAOhF,EAElD,CA2E0BiF,CAAiBlH,EAAS6D,GAC9C,GAAI5D,EAAQ8G,eACNA,EACF,OA1IV,SAA8BF,EAAaE,GACzC,IAAII,EAAgB,GAChBC,EAAkB,GAClBC,EAAON,EAAcM,MAAQ,GAO7BC,GANQP,EAAcQ,OAAS,IAMV5G,OAAO,SAAU6G,EAAKxF,EAAMyF,GAEnD,OADAD,EAAIxF,GAAQyF,EACLD,CACX,EAAK,CAAA,GAEHX,EAAYvH,QAAQ,SAAU+F,GAE5B,IAAIrD,EAAOqD,EAAKqC,MAAQrC,EAAKrD,KACzB2F,EAASN,EAAKzF,QAAQI,IAAQ,EAC7B2F,QAAiC7G,IAAvBwG,EAAatF,GAEhB2F,GACVP,EAAgBQ,KAAKvC,GAFrB8B,EAAcG,EAAatF,IAASqD,CAI1C,GAEE8B,EAAgBA,EAAcU,OAAO,SAAU1D,GAC7C,OAAOA,CACX,GAEE,IACI2D,EADAC,EAAkBhB,EAAcgB,gBAEpC,MAAwB,WAApBA,EACKZ,GAEPW,EAD6B,UAApBC,EACE,CACT,CAAC,OAAQ,QACT,CAAC,MAAO,QAGC,CAAC,CAAC,SAAU,CAAC,SAGnBZ,EAAca,OACnBnJ,EAAQuI,EAAiBU,EAAS,GAAIA,EAAS,KAEnD,CA4FiBG,CAAqB/F,EAAM6E,GAItC,GAAIjB,MAAMC,QAAQ9F,EAAQ6G,QAAS,CACjC,IAAIS,EAAQ9I,EAAWwB,EAAQ6G,OAAQhH,EAAc6G,cACjDuB,EAAQrJ,EAAQqD,EAAMqF,EAAM,GAAIA,EAAM,IAEtCF,EACFN,GAAiBA,EAAcM,KAAON,EAAcM,KAAO,GAC7D,GAAIA,EAAK9D,OAAS,EAAG,CACnB,IAAI4E,EAAU,GASd,OARAD,EAAM5I,QAAQ,SAAU+F,GAEtB,IAAIrD,EAAOqD,EAAKqC,MAAQrC,EAAKrD,MACF,IAAvBqF,EAAKzF,QAAQI,IACfmG,EAAQP,KAAKvC,EAE3B,GAEiB8C,CACjB,CAEQ,OAAOD,CACf,CAAa,GAA8B,mBAAnBjI,EAAQ6G,OACxB,OApLR,SAAuBS,EAAOrF,GAC5B,OAAOA,EAAKkG,KAAKb,EACnB,CAkLec,CAAcpI,EAAQ6G,OAAQ5E,GAEvC,MAAM,IAAIoG,MACR,oHAGR,EACIzB,EACAzH,EAzDJ,CA2DA,EAQAU,EAAc2G,UAAU8B,cAAgB,SAAUtG,GAChD,OAAI9B,KAAK6D,OAAOI,mBAAmBnC,GAC1BkE,EAAyBhG,KAAKe,OAAQe,GACpC9B,KAAK6D,OAAOY,mBAAmB3C,GACjCkE,EAAyBhG,KAAKY,kBAAmBkB,QADnD,CAKT,EA+BAnC,EAAc2G,UAAU+B,eAAiB,WACvC,IAAIzI,EAAQI,KAAK6D,OAEbhE,EAAUG,KACVsI,EAAM,GAoEV,OAlEAnI,OAAOC,KAAKR,EAAM2I,mBAAmBpJ,QAAQ,SAAUiH,GACrDxG,EAAM2I,kBAAkBnC,GAAejH,QAAQ,SAAU0C,GACvDyG,EAAIb,KACFvB,EAActG,EAAO,QAASwG,EAAevE,EAAMhC,EAAQkB,QAEnE,EACA,GAEEZ,OAAOC,KAAKR,EAAM6D,gBAAgBtE,QAAQ,SAAUiH,GAClDxG,EAAM6D,eAAe2C,GAAejH,QAAQ,SAAU0C,GACpDyG,EAAIb,KACFvB,EAActG,EAAO,UAAWwG,EAAevE,EAAMhC,EAAQkB,QAErE,EACA,GAEEZ,OAAOC,KAAKR,EAAMgD,8BAA8BzD,QAAQ,SACtDiH,GAEAxG,EAAMgD,6BAA6BwD,GAAejH,QAAQ,SAAU0C,GAClEyG,EAAIb,KACFvB,EACEtG,EACA,cACAwG,EACAvE,EACAhC,EAAQe,mBAGlB,EACA,GAEET,OAAOC,KAAKR,EAAM4I,+BAA+BrJ,QAAQ,SACvDiH,GAEAxG,EAAM4I,8BAA8BpC,GAAejH,QAAQ,SAAU0C,GACnEyG,EAAIb,KAuEV,SAAmC7H,EAAOwG,EAAevE,EAAMwE,GAC7D,IAAIoC,EAAmB7I,EAAM2C,2BAA2B6D,GACpDpD,EAAYpD,EAAMqD,+BAA+BwF,GACjDpF,EAAQxB,EAAKwB,MAAML,GACnB0F,EAAYxK,EAAKmI,EAAe,SAAUrC,GAC5C,OAAOA,EAAMnC,OAASuE,CAC1B,GAEMpC,EAAQX,EAAM7C,OAAO,SAAUmI,EAAmBC,GACpD,IAAIC,EACFF,GACAzK,EAAKyK,EAAkB5G,KAAM,SAAUH,GACrC,OAAOA,EAAEC,OAAS+G,CAC1B,GACI,YAAoBjI,IAAbkI,EAAyBA,EAAWF,CAC/C,EAAKD,GAECtE,EAASJ,GAASA,EAAMI,OAAU,EAClCpC,EAAcgC,GAASA,EAAMhC,aAAe,EAC5CuF,EAAQvD,GAASA,EAAMuD,MAAS,GAEpC,MAAO,CACLpB,KAAM,eACNC,cAAeA,EACfvE,KAAM0F,EACNnD,MAAOA,EACPpC,WAAYA,EAEhB,CAlGQmB,CACEvD,EACAwG,EACAvE,EACAhC,EAAQgB,oBAGlB,EACA,GAEEV,OAAOC,KAAKR,EAAMkJ,oBAAoB3J,QAAQ,SAAUiH,GACtD,IAAI2C,EAAYnJ,EAAMkJ,mBAAmB1C,GACzCjG,OAAOC,KAAK2I,GAAW5J,QAAQ,SAAU6J,GACvCD,EAAUC,GAAU7J,QAAQ,SAAU+E,GACpCoE,EAAIb,KAAK,CACPtB,KAAM,UACNC,cAAeA,EACfvE,KAAMqC,EACN+E,aAAc/E,EACd8E,SAAUA,GAEpB,EACA,EACA,GAEEpJ,EAAMsJ,eAAe/J,QAAQ,SAAU0C,GACrCyG,EAAIb,KAAK,CAAEtB,KAAM,MAAOC,cAAe,QAASvE,KAAMA,GAC1D,GAESyG,CACT,EAsEAa,EAAiBxJ","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/algoliasearch.helper.js

@@ -0,0 +1,2 @@
+import{__require as e}from"../../@algolia/events/events.js";import{__require as t}from"./DerivedHelper/index.js";import{__require as s}from"./functions/escapeFacetValue.js";import{__require as i}from"./functions/inherits.js";import{__require as r}from"./functions/merge.js";import{__require as n}from"./functions/objectHasKeys.js";import{__require as a}from"./functions/omit.js";import{__require as o}from"./RecommendParameters/index.js";import{__require as c}from"./RecommendResults/index.js";import{__require as u}from"./requestBuilder.js";import{__require as h}from"./SearchParameters/index.js";import{__require as d}from"./SearchResults/index.js";import{__require as m}from"./utils/sortAndMergeRecommendations.js";import{__require as l}from"./version.js";var p,f;function g(){if(f)return p;f=1;var g=e(),y=t(),R=s().escapeFacetValue,v=i(),_=r(),F=n(),P=a(),Q=o(),b=c(),x=u(),E=h(),j=d(),w=m(),N=l();function C(e,t,s,i){"function"==typeof e.addAlgoliaAgent&&e.addAlgoliaAgent("JS Helper ("+N+")"),this.setClient(e);var r=s||{};r.index=t,this.state=E.make(r),this.recommendState=new Q({params:r.recommendState}),this.lastResults=null,this.lastRecommendResults=null,this._queryId=0,this._recommendQueryId=0,this._lastQueryIdReceived=-1,this._lastRecommendQueryIdReceived=-1,this.derivedHelpers=[],this._currentNbQueries=0,this._currentNbRecommendQueries=0,this._searchResultsOptions=i,this._recommendCache={}}function S(e){if(e<0)throw new Error("Page requested below 0.");return this._change({state:this.state.setPage(e),isPageReset:!1}),this}function H(){return this.state.page}return v(C,g),C.prototype.search=function(){return this._search({onlyWithDerivedHelpers:!1}),this},C.prototype.searchOnlyWithDerivedHelpers=function(){return this._search({onlyWithDerivedHelpers:!0}),this},C.prototype.searchWithComposition=function(){return this._runComposition({onlyWithDerivedHelpers:!0}),this},C.prototype.recommend=function(){return this._recommend(),this},C.prototype.getQuery=function(){var e=this.state;return x._getHitsSearchParams(e)},C.prototype.searchOnce=function(e,t){var s=e?this.state.setQueryParameters(e):this.state,i=x._getQueries(s.index,s),r=this;if(this._currentNbQueries++,this.emit("searchOnce",{state:s}),!t)return this.client.search(i).then(function(e){return r._currentNbQueries--,0===r._currentNbQueries&&r.emit("searchQueueEmpty"),{content:new j(s,e.results),state:s,_originalResponse:e}},function(e){throw r._currentNbQueries--,0===r._currentNbQueries&&r.emit("searchQueueEmpty"),e});this.client.search(i).then(function(e){r._currentNbQueries--,0===r._currentNbQueries&&r.emit("searchQueueEmpty"),t(null,new j(s,e.results),s)}).catch(function(e){r._currentNbQueries--,0===r._currentNbQueries&&r.emit("searchQueueEmpty"),t(e,null,s)})},C.prototype.findAnswers=function(e){console.warn("[algoliasearch-helper] answers is no longer supported");var t=this.state,s=this.derivedHelpers[0];if(!s)return Promise.resolve([]);var i=s.getModifiedState(t),r=_({attributesForPrediction:e.attributesForPrediction,nbHits:e.nbHits},{params:P(x._getHitsSearchParams(i),["attributesToSnippet","hitsPerPage","restrictSearchableAttributes","snippetEllipsisText"])}),n="search for answers was called, but this client does not have a function client.initIndex(index).findAnswers";if("function"!=typeof this.client.initIndex)throw new Error(n);var a=this.client.initIndex(i.index);if("function"!=typeof a.findAnswers)throw new Error(n);return a.findAnswers(i.query,e.queryLanguages,r)},C.prototype.searchForFacetValues=function(e,t,s,i){var r="function"==typeof this.client.searchForFacetValues&&"function"!=typeof this.client.searchForFacets,n="function"==typeof this.client.initIndex;if(!r&&!n&&"function"!=typeof this.client.search)throw new Error("search for facet values (searchable) was called, but this client does not have a function client.searchForFacetValues or client.initIndex(index).searchForFacetValues");var a=this.state.setQueryParameters(i||{}),o=a.isDisjunctiveFacet(e),c=x.getSearchForFacetQuery(e,t,s,a);this._currentNbQueries++;var u,h=this;r?u=this.client.searchForFacetValues([{indexName:a.index,params:c}]):n?u=this.client.initIndex(a.index).searchForFacetValues(c):(delete c.facetName,u=this.client.search([{type:"facet",facet:e,indexName:a.index,params:c}]).then(function(e){return e.results[0]})),this.emit("searchForFacetValues",{state:a,facet:e,query:t});var d=this.lastResults&&this.lastResults.index===a.index&&this.lastResults.renderingContent&&this.lastResults.renderingContent.facetOrdering&&this.lastResults.renderingContent.facetOrdering.values&&this.lastResults.renderingContent.facetOrdering.values[e]&&this.lastResults.renderingContent.facetOrdering.values[e].hide||[];return u.then(function(t){return h._currentNbQueries--,0===h._currentNbQueries&&h.emit("searchQueueEmpty"),(t=Array.isArray(t)?t[0]:t).facetHits=t.facetHits.reduce(function(t,s){return d.indexOf(s.value)>-1||(s.escapedValue=R(s.value),s.isRefined=o?a.isDisjunctiveFacetRefined(e,s.escapedValue):a.isFacetRefined(e,s.escapedValue),t.push(s)),t},[]),t},function(e){throw h._currentNbQueries--,0===h._currentNbQueries&&h.emit("searchQueueEmpty"),e})},C.prototype.searchForCompositionFacetValues=function(e,t,s,i){if("function"!=typeof this.client.searchForFacetValues)throw new Error("search for facet values (searchable) was called, but this client does not have a function client.searchForFacetValues");var r=this.state.setQueryParameters(i||{}),n=r.isDisjunctiveFacet(e);this._currentNbQueries++;var a,o=this;return a=this.client.searchForFacetValues({compositionID:r.index,facetName:e,searchForFacetValuesRequest:{params:{query:t,maxFacetHits:s,searchQuery:x._getCompositionHitsSearchParams(r)}}}),this.emit("searchForFacetValues",{state:r,facet:e,query:t}),a.then(function(t){return o._currentNbQueries--,0===o._currentNbQueries&&o.emit("searchQueueEmpty"),(t=t.results[0]).facetHits.forEach(function(t){t.escapedValue=R(t.value),t.isRefined=n?r.isDisjunctiveFacetRefined(e,t.escapedValue):r.isFacetRefined(e,t.escapedValue)}),t},function(e){throw o._currentNbQueries--,0===o._currentNbQueries&&o.emit("searchQueueEmpty"),e})},C.prototype.setQuery=function(e){return this._change({state:this.state.resetPage().setQuery(e),isPageReset:!0}),this},C.prototype.clearRefinements=function(e){return this._change({state:this.state.resetPage().clearRefinements(e),isPageReset:!0}),this},C.prototype.clearTags=function(){return this._change({state:this.state.resetPage().clearTags(),isPageReset:!0}),this},C.prototype.addDisjunctiveFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().addDisjunctiveFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.addDisjunctiveRefine=function(){return this.addDisjunctiveFacetRefinement.apply(this,arguments)},C.prototype.addHierarchicalFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().addHierarchicalFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.addNumericRefinement=function(e,t,s){return this._change({state:this.state.resetPage().addNumericRefinement(e,t,s),isPageReset:!0}),this},C.prototype.addFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().addFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.addRefine=function(){return this.addFacetRefinement.apply(this,arguments)},C.prototype.addFacetExclusion=function(e,t){return this._change({state:this.state.resetPage().addExcludeRefinement(e,t),isPageReset:!0}),this},C.prototype.addExclude=function(){return this.addFacetExclusion.apply(this,arguments)},C.prototype.addTag=function(e){return this._change({state:this.state.resetPage().addTagRefinement(e),isPageReset:!0}),this},C.prototype.addFrequentlyBoughtTogether=function(e){return this._recommendChange({state:this.recommendState.addFrequentlyBoughtTogether(e)}),this},C.prototype.addRelatedProducts=function(e){return this._recommendChange({state:this.recommendState.addRelatedProducts(e)}),this},C.prototype.addTrendingItems=function(e){return this._recommendChange({state:this.recommendState.addTrendingItems(e)}),this},C.prototype.addTrendingFacets=function(e){return this._recommendChange({state:this.recommendState.addTrendingFacets(e)}),this},C.prototype.addLookingSimilar=function(e){return this._recommendChange({state:this.recommendState.addLookingSimilar(e)}),this},C.prototype.removeNumericRefinement=function(e,t,s){return this._change({state:this.state.resetPage().removeNumericRefinement(e,t,s),isPageReset:!0}),this},C.prototype.removeDisjunctiveFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().removeDisjunctiveFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.removeDisjunctiveRefine=function(){return this.removeDisjunctiveFacetRefinement.apply(this,arguments)},C.prototype.removeHierarchicalFacetRefinement=function(e){return this._change({state:this.state.resetPage().removeHierarchicalFacetRefinement(e),isPageReset:!0}),this},C.prototype.removeFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().removeFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.removeRefine=function(){return this.removeFacetRefinement.apply(this,arguments)},C.prototype.removeFacetExclusion=function(e,t){return this._change({state:this.state.resetPage().removeExcludeRefinement(e,t),isPageReset:!0}),this},C.prototype.removeExclude=function(){return this.removeFacetExclusion.apply(this,arguments)},C.prototype.removeTag=function(e){return this._change({state:this.state.resetPage().removeTagRefinement(e),isPageReset:!0}),this},C.prototype.removeFrequentlyBoughtTogether=function(e){return this._recommendChange({state:this.recommendState.removeParams(e)}),this},C.prototype.removeRelatedProducts=function(e){return this._recommendChange({state:this.recommendState.removeParams(e)}),this},C.prototype.removeTrendingItems=function(e){return this._recommendChange({state:this.recommendState.removeParams(e)}),this},C.prototype.removeTrendingFacets=function(e){return this._recommendChange({state:this.recommendState.removeParams(e)}),this},C.prototype.removeLookingSimilar=function(e){return this._recommendChange({state:this.recommendState.removeParams(e)}),this},C.prototype.toggleFacetExclusion=function(e,t){return this._change({state:this.state.resetPage().toggleExcludeFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.toggleExclude=function(){return this.toggleFacetExclusion.apply(this,arguments)},C.prototype.toggleRefinement=function(e,t){return this.toggleFacetRefinement(e,t)},C.prototype.toggleFacetRefinement=function(e,t){return this._change({state:this.state.resetPage().toggleFacetRefinement(e,t),isPageReset:!0}),this},C.prototype.toggleRefine=function(){return this.toggleFacetRefinement.apply(this,arguments)},C.prototype.toggleTag=function(e){return this._change({state:this.state.resetPage().toggleTagRefinement(e),isPageReset:!0}),this},C.prototype.nextPage=function(){var e=this.state.page||0;return this.setPage(e+1)},C.prototype.previousPage=function(){var e=this.state.page||0;return this.setPage(e-1)},C.prototype.setCurrentPage=S,C.prototype.setPage=S,C.prototype.setIndex=function(e){return this._change({state:this.state.resetPage().setIndex(e),isPageReset:!0}),this},C.prototype.setQueryParameter=function(e,t){return this._change({state:this.state.resetPage().setQueryParameter(e,t),isPageReset:!0}),this},C.prototype.setState=function(e){return this._change({state:E.make(e),isPageReset:!1}),this},C.prototype.overrideStateWithoutTriggeringChangeEvent=function(e){return this.state=new E(e),this},C.prototype.hasRefinements=function(e){return!!F(this.state.getNumericRefinements(e))||(this.state.isConjunctiveFacet(e)?this.state.isFacetRefined(e):this.state.isDisjunctiveFacet(e)?this.state.isDisjunctiveFacetRefined(e):!!this.state.isHierarchicalFacet(e)&&this.state.isHierarchicalFacetRefined(e))},C.prototype.isExcluded=function(e,t){return this.state.isExcludeRefined(e,t)},C.prototype.isDisjunctiveRefined=function(e,t){return this.state.isDisjunctiveFacetRefined(e,t)},C.prototype.hasTag=function(e){return this.state.isTagRefined(e)},C.prototype.isTagRefined=function(){return this.hasTagRefinements.apply(this,arguments)},C.prototype.getIndex=function(){return this.state.index},C.prototype.getCurrentPage=H,C.prototype.getPage=H,C.prototype.getTags=function(){return this.state.tagRefinements},C.prototype.getRefinements=function(e){var t=[];if(this.state.isConjunctiveFacet(e))this.state.getConjunctiveRefinements(e).forEach(function(e){t.push({value:e,type:"conjunctive"})}),this.state.getExcludeRefinements(e).forEach(function(e){t.push({value:e,type:"exclude"})});else if(this.state.isDisjunctiveFacet(e)){this.state.getDisjunctiveRefinements(e).forEach(function(e){t.push({value:e,type:"disjunctive"})})}var s=this.state.getNumericRefinements(e);return Object.keys(s).forEach(function(e){var i=s[e];t.push({value:i,operator:e,type:"numeric"})}),t},C.prototype.getNumericRefinement=function(e,t){return this.state.getNumericRefinement(e,t)},C.prototype.getHierarchicalFacetBreadcrumb=function(e){return this.state.getHierarchicalFacetBreadcrumb(e)},C.prototype._search=function(e){var t=this.state,s=[],i=[];e.onlyWithDerivedHelpers||(i=x._getQueries(t.index,t),s.push({state:t,queriesCount:i.length,helper:this}),this.emit("search",{state:t,results:this.lastResults}));var r=this.derivedHelpers.map(function(e){var i=e.getModifiedState(t),r=i.index?x._getQueries(i.index,i):[];return s.push({state:i,queriesCount:r.length,helper:e}),e.emit("search",{state:i,results:e.lastResults}),r}),n=Array.prototype.concat.apply(i,r),a=this._queryId++;if(this._currentNbQueries++,!n.length)return Promise.resolve({results:[]}).then(this._dispatchAlgoliaResponse.bind(this,s,a));try{this.client.search(n).then(this._dispatchAlgoliaResponse.bind(this,s,a)).catch(this._dispatchAlgoliaError.bind(this,a))}catch(e){this.emit("error",{error:e})}},C.prototype._runComposition=function(){var e=this.state,t=[],s=this.derivedHelpers.map(function(s){var i=s.getModifiedState(e),r=x._getCompositionQueries(i);return t.push({state:i,helper:s}),s.emit("search",{state:i,results:s.lastResults}),r}),i=Array.prototype.concat.apply([],s),r=this._queryId++;if(this._currentNbQueries++,!i.length)return Promise.resolve({results:[]}).then(this._dispatchAlgoliaResponse.bind(this,t,r));if(i.length>1)throw new Error("Only one query is allowed when using a composition.");var n=i[0];try{this.client.search(n).then(this._dispatchAlgoliaResponse.bind(this,t,r)).catch(this._dispatchAlgoliaError.bind(this,r))}catch(e){this.emit("error",{error:e})}},C.prototype._recommend=function(){var e=this.state,t=this.recommendState,s=this.getIndex(),i=[{state:t,index:s,helper:this}],r=t.params.map(function(e){return e.$$id});this.emit("fetch",{recommend:{state:t,results:this.lastRecommendResults}});var n=this._recommendCache,a=this.derivedHelpers.map(function(t){var s=t.getModifiedState(e).index;if(!s)return[];var a=t.getModifiedRecommendState(new Q);return i.push({state:a,index:s,helper:t}),r=Array.prototype.concat.apply(r,a.params.map(function(e){return e.$$id})),t.emit("fetch",{recommend:{state:a,results:t.lastRecommendResults}}),a._buildQueries(s,n)}),o=Array.prototype.concat.apply(this.recommendState._buildQueries(s,n),a);if(0!==o.length)if(o.length>0&&void 0===this.client.getRecommendations)console.warn("Please update algoliasearch/lite to the latest version in order to use recommend widgets.");else{var c=this._recommendQueryId++;this._currentNbRecommendQueries++;try{this.client.getRecommendations(o).then(this._dispatchRecommendResponse.bind(this,c,i,r)).catch(this._dispatchRecommendError.bind(this,c))}catch(e){this.emit("error",{error:e})}}},C.prototype._dispatchAlgoliaResponse=function(e,t,s){var i=this;if(!(t<this._lastQueryIdReceived)){this._currentNbQueries-=t-this._lastQueryIdReceived,this._lastQueryIdReceived=t,0===this._currentNbQueries&&this.emit("searchQueueEmpty");var r=s.results.slice(),n=Object.keys(s).reduce(function(e,t){return"results"!==t&&(e[t]=s[t]),e},{});Object.keys(n).length<=0&&(n=void 0),e.forEach(function(e){var t=e.state,s=e.queriesCount,a=e.helper,o=void 0!==s?r.splice(0,s):r;if(t.index){if(o.length>0&&o[0].feedID){var c=o.map(function(e){var s=new j(t,[e],i._searchResultsOptions);return void 0!==n&&(s._rawContent=n),s});a.lastResults=new j(t,[o[0]],i._searchResultsOptions),a.lastResults.feeds=c,void 0!==n&&(a.lastResults._rawContent=n)}else a.lastResults=new j(t,o,i._searchResultsOptions),void 0!==n&&(a.lastResults._rawContent=n);a.emit("result",{results:a.lastResults,state:t})}else a.emit("result",{results:null,state:t})})}},C.prototype._dispatchRecommendResponse=function(e,t,s,i){if(!(e<this._lastRecommendQueryIdReceived)){this._currentNbRecommendQueries-=e-this._lastRecommendQueryIdReceived,this._lastRecommendQueryIdReceived=e,0===this._currentNbRecommendQueries&&this.emit("recommendQueueEmpty");var r=this._recommendCache,n={};s.filter(function(e){return void 0===r[e]}).forEach(function(e,t){n[e]||(n[e]=[]),n[e].push(t)}),Object.keys(n).forEach(function(e){var t=n[e],a=i.results[t[0]];1!==t.length?r[e]=Object.assign({},a,{hits:w(s,t.map(function(e){return i.results[e].hits}))}):r[e]=a});var a={};s.forEach(function(e){a[e]=r[e]}),t.forEach(function(e){var t=e.state,s=e.helper;e.index?(s.lastRecommendResults=new b(t,a),s.emit("recommend:result",{recommend:{results:s.lastRecommendResults,state:t}})):s.emit("recommend:result",{results:null,state:t})})}},C.prototype._dispatchAlgoliaError=function(e,t){e<this._lastQueryIdReceived||(this._currentNbQueries-=e-this._lastQueryIdReceived,this._lastQueryIdReceived=e,this.emit("error",{error:t}),0===this._currentNbQueries&&this.emit("searchQueueEmpty"))},C.prototype._dispatchRecommendError=function(e,t){e<this._lastRecommendQueryIdReceived||(this._currentNbRecommendQueries-=e-this._lastRecommendQueryIdReceived,this._lastRecommendQueryIdReceived=e,this.emit("error",{error:t}),0===this._currentNbRecommendQueries&&this.emit("recommendQueueEmpty"))},C.prototype.containsRefinement=function(e,t,s,i){return e||0!==t.length||0!==s.length||0!==i.length},C.prototype._hasDisjunctiveRefinements=function(e){return this.state.disjunctiveRefinements[e]&&this.state.disjunctiveRefinements[e].length>0},C.prototype._change=function(e){var t=e.state,s=e.isPageReset;t!==this.state&&(this.state=t,this.emit("change",{state:this.state,results:this.lastResults,isPageReset:s}))},C.prototype._recommendChange=function(e){var t=e.state;t!==this.recommendState&&(this.recommendState=t,this.emit("recommend:change",{search:{results:this.lastResults,state:this.state},recommend:{results:this.lastRecommendResults,state:this.recommendState}}))},C.prototype.clearCache=function(){return this.client.clearCache&&this.client.clearCache(),this},C.prototype.setClient=function(e){return this.client===e||("function"==typeof e.addAlgoliaAgent&&e.addAlgoliaAgent("JS Helper ("+N+")"),this.client=e),this},C.prototype.getClient=function(){return this.client},C.prototype.derive=function(e,t){var s=new y(this,e,t);return this.derivedHelpers.push(s),s},C.prototype.detachDerivedHelper=function(e){var t=this.derivedHelpers.indexOf(e);if(-1===t)throw new Error("Derived helper already detached");this.derivedHelpers.splice(t,1)},C.prototype.hasPendingRequests=function(){return this._currentNbQueries>0},p=C}export{g as __require};
+//# sourceMappingURL=algoliasearch.helper.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/algoliasearch.helper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"algoliasearch.helper.js","sources":["../../../../../node_modules/algoliasearch-helper/src/algoliasearch.helper.js"],"sourcesContent":["'use strict';\n\nvar EventEmitter = require('@algolia/events');\n\nvar DerivedHelper = require('./DerivedHelper');\nvar escapeFacetValue = require('./functions/escapeFacetValue').escapeFacetValue;\nvar inherits = require('./functions/inherits');\nvar merge = require('./functions/merge');\nvar objectHasKeys = require('./functions/objectHasKeys');\nvar omit = require('./functions/omit');\nvar RecommendParameters = require('./RecommendParameters');\nvar RecommendResults = require('./RecommendResults');\nvar requestBuilder = require('./requestBuilder');\nvar SearchParameters = require('./SearchParameters');\nvar SearchResults = require('./SearchResults');\nvar sortAndMergeRecommendations = require('./utils/sortAndMergeRecommendations');\nvar version = require('./version');\n\n/**\n * Event triggered when a parameter is set or updated\n * @event AlgoliaSearchHelper#event:change\n * @property {object} event\n * @property {SearchParameters} event.state the current parameters with the latest changes applied\n * @property {SearchResults} event.results the previous results received from Algolia. `null` before the first request\n * @example\n * helper.on('change', function(event) {\n *   console.log('The parameters have changed');\n * });\n */\n\n/**\n * Event triggered when a main search is sent to Algolia\n * @event AlgoliaSearchHelper#event:search\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search\n * @property {SearchResults} event.results the results from the previous search. `null` if it is the first search.\n * @example\n * helper.on('search', function(event) {\n *   console.log('Search sent');\n * });\n */\n\n/**\n * Event triggered when a search using `searchForFacetValues` is sent to Algolia\n * @event AlgoliaSearchHelper#event:searchForFacetValues\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search it is the first search.\n * @property {string} event.facet the facet searched into\n * @property {string} event.query the query used to search in the facets\n * @example\n * helper.on('searchForFacetValues', function(event) {\n *   console.log('searchForFacetValues sent');\n * });\n */\n\n/**\n * Event triggered when a search using `searchOnce` is sent to Algolia\n * @event AlgoliaSearchHelper#event:searchOnce\n * @property {object} event\n * @property {SearchParameters} event.state the parameters used for this search it is the first search.\n * @example\n * helper.on('searchOnce', function(event) {\n *   console.log('searchOnce sent');\n * });\n */\n\n/**\n * Event triggered when the results are retrieved from Algolia\n * @event AlgoliaSearchHelper#event:result\n * @property {object} event\n * @property {SearchResults} event.results the results received from Algolia\n * @property {SearchParameters} event.state the parameters used to query Algolia. Those might be different from the one in the helper instance (for example if the network is unreliable).\n * @example\n * helper.on('result', function(event) {\n *   console.log('Search results received');\n * });\n */\n\n/**\n * Event triggered when Algolia sends back an error. For example, if an unknown parameter is\n * used, the error can be caught using this event.\n * @event AlgoliaSearchHelper#event:error\n * @property {object} event\n * @property {Error} event.error the error returned by the Algolia.\n * @example\n * helper.on('error', function(event) {\n *   console.log('Houston we got a problem.');\n * });\n */\n\n/**\n * Event triggered when the queue of queries have been depleted (with any result or outdated queries)\n * @event AlgoliaSearchHelper#event:searchQueueEmpty\n * @example\n * helper.on('searchQueueEmpty', function() {\n *   console.log('No more search pending');\n *   // This is received before the result event if we're not expecting new results\n * });\n *\n * helper.search();\n */\n\n/**\n * Initialize a new AlgoliaSearchHelper\n * @class\n * @classdesc The AlgoliaSearchHelper is a class that ease the management of the\n * search. It provides an event based interface for search callbacks:\n *  - change: when the internal search state is changed.\n *    This event contains a {@link SearchParameters} object and the\n *    {@link SearchResults} of the last result if any.\n *  - search: when a search is triggered using the `search()` method.\n *  - result: when the response is retrieved from Algolia and is processed.\n *    This event contains a {@link SearchResults} object and the\n *    {@link SearchParameters} corresponding to this answer.\n *  - error: when the response is an error. This event contains the error returned by the server.\n * @param  {AlgoliaSearch} client an AlgoliaSearch client\n * @param  {string} index the index name to query\n * @param  {SearchParameters | object} options an object defining the initial\n * config of the search. It doesn't have to be a {SearchParameters},\n * just an object containing the properties you need from it.\n * @param {SearchResultsOptions|object} searchResultsOptions an object defining the options to use when creating the search results.\n */\nfunction AlgoliaSearchHelper(client, index, options, searchResultsOptions) {\n  if (typeof client.addAlgoliaAgent === 'function') {\n    client.addAlgoliaAgent('JS Helper (' + version + ')');\n  }\n\n  this.setClient(client);\n  var opts = options || {};\n  opts.index = index;\n  this.state = SearchParameters.make(opts);\n  this.recommendState = new RecommendParameters({\n    params: opts.recommendState,\n  });\n  this.lastResults = null;\n  this.lastRecommendResults = null;\n  this._queryId = 0;\n  this._recommendQueryId = 0;\n  this._lastQueryIdReceived = -1;\n  this._lastRecommendQueryIdReceived = -1;\n  this.derivedHelpers = [];\n  this._currentNbQueries = 0;\n  this._currentNbRecommendQueries = 0;\n  this._searchResultsOptions = searchResultsOptions;\n  this._recommendCache = {};\n}\n\ninherits(AlgoliaSearchHelper, EventEmitter);\n\n/**\n * Start the search with the parameters set in the state. When the\n * method is called, it triggers a `search` event. The results will\n * be available through the `result` event. If an error occurs, an\n * `error` will be fired instead.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires search\n * @fires result\n * @fires error\n * @chainable\n */\nAlgoliaSearchHelper.prototype.search = function () {\n  this._search({ onlyWithDerivedHelpers: false });\n  return this;\n};\n\nAlgoliaSearchHelper.prototype.searchOnlyWithDerivedHelpers = function () {\n  this._search({ onlyWithDerivedHelpers: true });\n  return this;\n};\n\nAlgoliaSearchHelper.prototype.searchWithComposition = function () {\n  this._runComposition({ onlyWithDerivedHelpers: true });\n  return this;\n};\n/**\n * Sends the recommendation queries set in the state. When the method is\n * called, it triggers a `fetch` event. The results will be available through\n * the `result` event. If an error occurs, an `error` will be fired instead.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires fetch\n * @fires result\n * @fires error\n * @chainable\n */\nAlgoliaSearchHelper.prototype.recommend = function () {\n  this._recommend();\n  return this;\n};\n\n/**\n * Gets the search query parameters that would be sent to the Algolia Client\n * for the hits\n * @return {object} Query Parameters\n */\nAlgoliaSearchHelper.prototype.getQuery = function () {\n  var state = this.state;\n  return requestBuilder._getHitsSearchParams(state);\n};\n\n/**\n * Start a search using a modified version of the current state. This method does\n * not trigger the helper lifecycle and does not modify the state kept internally\n * by the helper. This second aspect means that the next search call will be the\n * same as a search call before calling searchOnce.\n * @param {object} options can contain all the parameters that can be set to SearchParameters\n * plus the index\n * @param {function} [cb] optional callback executed when the response from the\n * server is back.\n * @return {promise|undefined} if a callback is passed the method returns undefined\n * otherwise it returns a promise containing an object with two keys :\n *  - content with a SearchResults\n *  - state with the state used for the query as a SearchParameters\n * @example\n * // Changing the number of records returned per page to 1\n * // This example uses the callback API\n * var state = helper.searchOnce({hitsPerPage: 1},\n *   function(error, content, state) {\n *     // if an error occurred it will be passed in error, otherwise its value is null\n *     // content contains the results formatted as a SearchResults\n *     // state is the instance of SearchParameters used for this search\n *   });\n * @example\n * // Changing the number of records returned per page to 1\n * // This example uses the promise API\n * var state1 = helper.searchOnce({hitsPerPage: 1})\n *                 .then(promiseHandler);\n *\n * function promiseHandler(res) {\n *   // res contains\n *   // {\n *   //   content : SearchResults\n *   //   state   : SearchParameters (the one used for this specific search)\n *   // }\n * }\n */\nAlgoliaSearchHelper.prototype.searchOnce = function (options, cb) {\n  var tempState = !options\n    ? this.state\n    : this.state.setQueryParameters(options);\n  var queries = requestBuilder._getQueries(tempState.index, tempState);\n  // eslint-disable-next-line consistent-this\n  var self = this;\n\n  this._currentNbQueries++;\n\n  this.emit('searchOnce', {\n    state: tempState,\n  });\n\n  if (cb) {\n    this.client\n      .search(queries)\n      .then(function (content) {\n        self._currentNbQueries--;\n        if (self._currentNbQueries === 0) {\n          self.emit('searchQueueEmpty');\n        }\n\n        cb(null, new SearchResults(tempState, content.results), tempState);\n      })\n      .catch(function (err) {\n        self._currentNbQueries--;\n        if (self._currentNbQueries === 0) {\n          self.emit('searchQueueEmpty');\n        }\n\n        cb(err, null, tempState);\n      });\n\n    return undefined;\n  }\n\n  return this.client.search(queries).then(\n    function (content) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      return {\n        content: new SearchResults(tempState, content.results),\n        state: tempState,\n        _originalResponse: content,\n      };\n    },\n    function (e) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      throw e;\n    }\n  );\n};\n\n/**\n * Start the search for answers with the parameters set in the state.\n * This method returns a promise.\n * @param {Object} options - the options for answers API call\n * @param {string[]} options.attributesForPrediction - Attributes to use for predictions. If empty, `searchableAttributes` is used instead.\n * @param {string[]} options.queryLanguages - The languages in the query. Currently only supports ['en'].\n * @param {number} options.nbHits - Maximum number of answers to retrieve from the Answers Engine. Cannot be greater than 1000.\n *\n * @return {promise} the answer results\n * @deprecated answers is deprecated and will be replaced with new initiatives\n */\nAlgoliaSearchHelper.prototype.findAnswers = function (options) {\n  // eslint-disable-next-line no-console\n  console.warn('[algoliasearch-helper] answers is no longer supported');\n  var state = this.state;\n  var derivedHelper = this.derivedHelpers[0];\n  if (!derivedHelper) {\n    return Promise.resolve([]);\n  }\n  var derivedState = derivedHelper.getModifiedState(state);\n  var data = merge(\n    {\n      attributesForPrediction: options.attributesForPrediction,\n      nbHits: options.nbHits,\n    },\n    {\n      params: omit(requestBuilder._getHitsSearchParams(derivedState), [\n        'attributesToSnippet',\n        'hitsPerPage',\n        'restrictSearchableAttributes',\n        'snippetEllipsisText',\n      ]),\n    }\n  );\n\n  var errorMessage =\n    'search for answers was called, but this client does not have a function client.initIndex(index).findAnswers';\n  if (typeof this.client.initIndex !== 'function') {\n    throw new Error(errorMessage);\n  }\n  var index = this.client.initIndex(derivedState.index);\n  if (typeof index.findAnswers !== 'function') {\n    throw new Error(errorMessage);\n  }\n  return index.findAnswers(derivedState.query, options.queryLanguages, data);\n};\n\n/**\n * Structure of each result when using\n * [`searchForFacetValues()`](reference.html#AlgoliaSearchHelper#searchForFacetValues)\n * @typedef FacetSearchHit\n * @type {object}\n * @property {string} value the facet value\n * @property {string} highlighted the facet value highlighted with the query string\n * @property {number} count number of occurrence of this facet value\n * @property {boolean} isRefined true if the value is already refined\n */\n\n/**\n * Structure of the data resolved by the\n * [`searchForFacetValues()`](reference.html#AlgoliaSearchHelper#searchForFacetValues)\n * promise.\n * @typedef FacetSearchResult\n * @type {object}\n * @property {FacetSearchHit} facetHits the results for this search for facet values\n * @property {number} processingTimeMS time taken by the query inside the engine\n */\n\n/**\n * Search for facet values based on an query and the name of a faceted attribute. This\n * triggers a search and will return a promise. On top of using the query, it also sends\n * the parameters from the state so that the search is narrowed down to only the possible values.\n *\n * See the description of [FacetSearchResult](reference.html#FacetSearchResult)\n * @param {string} facet the name of the faceted attribute\n * @param {string} query the string query for the search\n * @param {number} [maxFacetHits] the maximum number values returned. Should be > 0 and <= 100\n * @param {object} [userState] the set of custom parameters to use on top of the current state. Setting a property to `undefined` removes\n * it in the generated query.\n * @return {promise.<FacetSearchResult>} the results of the search\n */\nAlgoliaSearchHelper.prototype.searchForFacetValues = function (\n  facet,\n  query,\n  maxFacetHits,\n  userState\n) {\n  var clientHasSFFV =\n    typeof this.client.searchForFacetValues === 'function' &&\n    // v5 has a wrong sffv signature\n    typeof this.client.searchForFacets !== 'function';\n  var clientHasInitIndex = typeof this.client.initIndex === 'function';\n  if (\n    !clientHasSFFV &&\n    !clientHasInitIndex &&\n    typeof this.client.search !== 'function'\n  ) {\n    throw new Error(\n      'search for facet values (searchable) was called, but this client does not have a function client.searchForFacetValues or client.initIndex(index).searchForFacetValues'\n    );\n  }\n\n  var state = this.state.setQueryParameters(userState || {});\n  var isDisjunctive = state.isDisjunctiveFacet(facet);\n  var algoliaQuery = requestBuilder.getSearchForFacetQuery(\n    facet,\n    query,\n    maxFacetHits,\n    state\n  );\n\n  this._currentNbQueries++;\n  // eslint-disable-next-line consistent-this\n  var self = this;\n  var searchForFacetValuesPromise;\n  // newer algoliasearch ^3.27.1 - ~4.0.0\n  if (clientHasSFFV) {\n    searchForFacetValuesPromise = this.client.searchForFacetValues([\n      { indexName: state.index, params: algoliaQuery },\n    ]);\n    // algoliasearch < 3.27.1\n  } else if (clientHasInitIndex) {\n    searchForFacetValuesPromise = this.client\n      .initIndex(state.index)\n      .searchForFacetValues(algoliaQuery);\n    // algoliasearch ~5.0.0\n  } else {\n    // @MAJOR only use client.search\n    delete algoliaQuery.facetName;\n    searchForFacetValuesPromise = this.client\n      .search([\n        {\n          type: 'facet',\n          facet: facet,\n          indexName: state.index,\n          params: algoliaQuery,\n        },\n      ])\n      .then(function processResponse(response) {\n        return response.results[0];\n      });\n  }\n\n  this.emit('searchForFacetValues', {\n    state: state,\n    facet: facet,\n    query: query,\n  });\n\n  var hide =\n    (this.lastResults &&\n      this.lastResults.index === state.index &&\n      this.lastResults.renderingContent &&\n      this.lastResults.renderingContent.facetOrdering &&\n      this.lastResults.renderingContent.facetOrdering.values &&\n      this.lastResults.renderingContent.facetOrdering.values[facet] &&\n      this.lastResults.renderingContent.facetOrdering.values[facet].hide) ||\n    [];\n\n  return searchForFacetValuesPromise.then(\n    function addIsRefined(content) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n\n      content = Array.isArray(content) ? content[0] : content;\n\n      content.facetHits = content.facetHits.reduce(function (acc, f) {\n        if (hide.indexOf(f.value) > -1) {\n          return acc;\n        }\n\n        f.escapedValue = escapeFacetValue(f.value);\n        f.isRefined = isDisjunctive\n          ? state.isDisjunctiveFacetRefined(facet, f.escapedValue)\n          : state.isFacetRefined(facet, f.escapedValue);\n\n        acc.push(f);\n        return acc;\n      }, []);\n\n      return content;\n    },\n    function (e) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      throw e;\n    }\n  );\n};\n\n/**\n * Search for facet values using the Composition API & based on a query and the name of a faceted attribute.\n * This triggers a search and will return a promise. On top of using the query, it also sends\n * the parameters from the state so that the search is narrowed down to only the possible values.\n *\n * See the description of [FacetSearchResult](reference.html#FacetSearchResult)\n * @param {string} facet the name of the faceted attribute\n * @param {string} query the string query for the search\n * @param {number} [maxFacetHits] the maximum number values returned. Should be > 0 and <= 100\n * @param {object} [userState] the set of custom parameters to use on top of the current state. Setting a property to `undefined` removes\n * it in the generated query.\n * @return {promise.<FacetSearchResult>} the results of the search\n */\nAlgoliaSearchHelper.prototype.searchForCompositionFacetValues = function (\n  facet,\n  query,\n  maxFacetHits,\n  userState\n) {\n  if (typeof this.client.searchForFacetValues !== 'function') {\n    throw new Error(\n      'search for facet values (searchable) was called, but this client does not have a function client.searchForFacetValues'\n    );\n  }\n\n  var state = this.state.setQueryParameters(userState || {});\n  var isDisjunctive = state.isDisjunctiveFacet(facet);\n\n  this._currentNbQueries++;\n  // eslint-disable-next-line consistent-this\n  var self = this;\n  var searchForFacetValuesPromise;\n\n  searchForFacetValuesPromise = this.client.searchForFacetValues({\n    compositionID: state.index,\n    facetName: facet,\n    searchForFacetValuesRequest: {\n      params: {\n        query: query,\n        maxFacetHits: maxFacetHits,\n        searchQuery: requestBuilder._getCompositionHitsSearchParams(state),\n      },\n    },\n  });\n\n  this.emit('searchForFacetValues', {\n    state: state,\n    facet: facet,\n    query: query,\n  });\n\n  return searchForFacetValuesPromise.then(\n    function addIsRefined(content) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n\n      content = content.results[0];\n\n      content.facetHits.forEach(function (f) {\n        f.escapedValue = escapeFacetValue(f.value);\n        f.isRefined = isDisjunctive\n          ? state.isDisjunctiveFacetRefined(facet, f.escapedValue)\n          : state.isFacetRefined(facet, f.escapedValue);\n      });\n\n      return content;\n    },\n    function (e) {\n      self._currentNbQueries--;\n      if (self._currentNbQueries === 0) self.emit('searchQueueEmpty');\n      throw e;\n    }\n  );\n};\n\n/**\n * Sets the text query used for the search.\n *\n * This method resets the current page to 0.\n * @param  {string} q the user query\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setQuery = function (q) {\n  this._change({\n    state: this.state.resetPage().setQuery(q),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Remove all the types of refinements except tags. A string can be provided to remove\n * only the refinements of a specific attribute. For more advanced use case, you can\n * provide a function instead. This function should follow the\n * [clearCallback definition](#SearchParameters.clearCallback).\n *\n * This method resets the current page to 0.\n * @param {string} [name] optional name of the facet / attribute on which we want to remove all refinements\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * // Removing all the refinements\n * helper.clearRefinements().search();\n * @example\n * // Removing all the filters on a the category attribute.\n * helper.clearRefinements('category').search();\n * @example\n * // Removing only the exclude filters on the category facet.\n * helper.clearRefinements(function(value, attribute, type) {\n *   return type === 'exclude' && attribute === 'category';\n * }).search();\n */\nAlgoliaSearchHelper.prototype.clearRefinements = function (name) {\n  this._change({\n    state: this.state.resetPage().clearRefinements(name),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Remove all the tag filters.\n *\n * This method resets the current page to 0.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.clearTags = function () {\n  this._change({\n    state: this.state.resetPage().clearTags(),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a disjunctive filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addDisjunctiveFacetRefinement = function (\n  facet,\n  value\n) {\n  this._change({\n    state: this.state.resetPage().addDisjunctiveFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addDisjunctiveFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.addDisjunctiveRefine = function () {\n  return this.addDisjunctiveFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds a refinement on a hierarchical facet. It will throw\n * an exception if the facet is not defined or if the facet\n * is already refined.\n *\n * This method resets the current page to 0.\n * @param {string} facet the facet name\n * @param {string} path the hierarchical facet path\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error if the facet is not defined or if the facet is refined\n * @chainable\n * @fires change\n */\nAlgoliaSearchHelper.prototype.addHierarchicalFacetRefinement = function (\n  facet,\n  path\n) {\n  this._change({\n    state: this.state.resetPage().addHierarchicalFacetRefinement(facet, path),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a an numeric filter to an attribute with the `operator` and `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} attribute the attribute on which the numeric filter applies\n * @param  {string} operator the operator of the filter\n * @param  {number} value the value of the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addNumericRefinement = function (\n  attribute,\n  operator,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .addNumericRefinement(attribute, operator, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().addFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.addRefine = function () {\n  return this.addFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds a an exclusion filter to a faceted attribute with the `value` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value (will be converted to string)\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().addExcludeRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#addFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.addExclude = function () {\n  return this.addFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Adds a tag filter with the `tag` provided. If the\n * filter is already set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param {string} tag the tag to add to the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().addTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Adds a \"frequently bought together\" recommendation query.\n *\n * @param {FrequentlyBoughtTogetherQuery} params the parameters for the recommendation\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addFrequentlyBoughtTogether = function (params) {\n  this._recommendChange({\n    state: this.recommendState.addFrequentlyBoughtTogether(params),\n  });\n\n  return this;\n};\n\n/**\n * Adds a \"related products\" recommendation query.\n *\n * @param {RelatedProductsQuery} params the parameters for the recommendation\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addRelatedProducts = function (params) {\n  this._recommendChange({\n    state: this.recommendState.addRelatedProducts(params),\n  });\n\n  return this;\n};\n\n/**\n * Adds a \"trending items\" recommendation query.\n *\n * @param {TrendingItemsQuery} params the parameters for the recommendation\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addTrendingItems = function (params) {\n  this._recommendChange({\n    state: this.recommendState.addTrendingItems(params),\n  });\n\n  return this;\n};\n\n/**\n * Adds a \"trending facets\" recommendation query.\n *\n * @param {TrendingFacetsQuery} params the parameters for the recommendation\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addTrendingFacets = function (params) {\n  this._recommendChange({\n    state: this.recommendState.addTrendingFacets(params),\n  });\n\n  return this;\n};\n\n/**\n * Adds a \"looking similar\" recommendation query.\n *\n * @param {LookingSimilarQuery} params the parameters for the recommendation\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.addLookingSimilar = function (params) {\n  this._recommendChange({\n    state: this.recommendState.addLookingSimilar(params),\n  });\n\n  return this;\n};\n\n/**\n * Removes an numeric filter to an attribute with the `operator` and `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * Some parameters are optional, triggering different behavior:\n *  - if the value is not provided, then all the numeric value will be removed for the\n *  specified attribute/operator couple.\n *  - if the operator is not provided either, then all the numeric filter on this attribute\n *  will be removed.\n *\n * This method resets the current page to 0.\n * @param  {string} attribute the attribute on which the numeric filter applies\n * @param  {string} [operator] the operator of the filter\n * @param  {number} [value] the value of the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeNumericRefinement = function (\n  attribute,\n  operator,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .removeNumericRefinement(attribute, operator, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes a disjunctive filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeDisjunctiveFacetRefinement = function (\n  facet,\n  value\n) {\n  this._change({\n    state: this.state\n      .resetPage()\n      .removeDisjunctiveFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeDisjunctiveFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.removeDisjunctiveRefine = function () {\n  return this.removeDisjunctiveFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Removes the refinement set on a hierarchical facet.\n * @param {string} facet the facet name\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error if the facet is not defined or if the facet is not refined\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeHierarchicalFacetRefinement = function (\n  facet\n) {\n  this._change({\n    state: this.state.resetPage().removeHierarchicalFacetRefinement(facet),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes a filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().removeFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.removeRefine = function () {\n  return this.removeFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Removes an exclusion filter to a faceted attribute with the `value` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * If the value is omitted, then this method will remove all the filters for the\n * attribute.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} [value] the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().removeExcludeRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#removeFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.removeExclude = function () {\n  return this.removeFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Removes a tag filter with the `tag` provided. If the\n * filter is not set, it doesn't change the filters.\n *\n * This method resets the current page to 0.\n * @param {string} tag tag to remove from the filter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().removeTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Removes a \"frequently bought together\" recommendation query.\n *\n * @param {number} id identifier of the recommendation widget\n * @returns {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeFrequentlyBoughtTogether = function (id) {\n  this._recommendChange({\n    state: this.recommendState.removeParams(id),\n  });\n\n  return this;\n};\n\n/**\n * Removes a \"related products\" recommendation query.\n *\n * @param {number} id identifier of the recommendation widget\n * @returns {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeRelatedProducts = function (id) {\n  this._recommendChange({\n    state: this.recommendState.removeParams(id),\n  });\n\n  return this;\n};\n\n/**\n * Removes a \"trending items\" recommendation query.\n *\n * @param {number} id identifier of the recommendation widget\n * @returns {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeTrendingItems = function (id) {\n  this._recommendChange({\n    state: this.recommendState.removeParams(id),\n  });\n\n  return this;\n};\n\n/**\n * Removes a \"trending facets\" recommendation query.\n *\n * @param {number} id identifier of the recommendation widget\n * @returns {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeTrendingFacets = function (id) {\n  this._recommendChange({\n    state: this.recommendState.removeParams(id),\n  });\n\n  return this;\n};\n\n/**\n * Removes a \"looking similar\" recommendation query.\n *\n * @param {number} id identifier of the recommendation widget\n * @returns {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.removeLookingSimilar = function (id) {\n  this._recommendChange({\n    state: this.recommendState.removeParams(id),\n  });\n\n  return this;\n};\n\n/**\n * Adds or removes an exclusion filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleFacetExclusion = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().toggleExcludeFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#toggleFacetExclusion}\n */\nAlgoliaSearchHelper.prototype.toggleExclude = function () {\n  return this.toggleFacetExclusion.apply(this, arguments);\n};\n\n/**\n * Adds or removes a filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method can be used for conjunctive, disjunctive and hierarchical filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error will throw an error if the facet is not declared in the settings of the helper\n * @fires change\n * @chainable\n * @deprecated since version 2.19.0, see {@link AlgoliaSearchHelper#toggleFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.toggleRefinement = function (facet, value) {\n  return this.toggleFacetRefinement(facet, value);\n};\n\n/**\n * Adds or removes a filter to a faceted attribute with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method can be used for conjunctive, disjunctive and hierarchical filters.\n *\n * This method resets the current page to 0.\n * @param  {string} facet the facet to refine\n * @param  {string} value the associated value\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @throws Error will throw an error if the facet is not declared in the settings of the helper\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleFacetRefinement = function (facet, value) {\n  this._change({\n    state: this.state.resetPage().toggleFacetRefinement(facet, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since version 2.4.0, see {@link AlgoliaSearchHelper#toggleFacetRefinement}\n */\nAlgoliaSearchHelper.prototype.toggleRefine = function () {\n  return this.toggleFacetRefinement.apply(this, arguments);\n};\n\n/**\n * Adds or removes a tag filter with the `value` provided. If\n * the value is set then it removes it, otherwise it adds the filter.\n *\n * This method resets the current page to 0.\n * @param {string} tag tag to remove or add\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.toggleTag = function (tag) {\n  this._change({\n    state: this.state.resetPage().toggleTagRefinement(tag),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Increments the page number by one.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * helper.setPage(0).nextPage().getPage();\n * // returns 1\n */\nAlgoliaSearchHelper.prototype.nextPage = function () {\n  var page = this.state.page || 0;\n  return this.setPage(page + 1);\n};\n\n/**\n * Decrements the page number by one.\n * @fires change\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @chainable\n * @example\n * helper.setPage(1).previousPage().getPage();\n * // returns 0\n */\nAlgoliaSearchHelper.prototype.previousPage = function () {\n  var page = this.state.page || 0;\n  return this.setPage(page - 1);\n};\n\n/**\n * @private\n * @param {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @chainable\n * @fires change\n */\nfunction setCurrentPage(page) {\n  if (page < 0) throw new Error('Page requested below 0.');\n\n  this._change({\n    state: this.state.setPage(page),\n    isPageReset: false,\n  });\n\n  return this;\n}\n\n/**\n * Change the current page\n * @deprecated\n * @param  {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setCurrentPage = setCurrentPage;\n\n/**\n * Updates the current page.\n * @function\n * @param  {number} page The page number\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setPage = setCurrentPage;\n\n/**\n * Updates the name of the index that will be targeted by the query.\n *\n * This method resets the current page to 0.\n * @param {string} name the index name\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setIndex = function (name) {\n  this._change({\n    state: this.state.resetPage().setIndex(name),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Update a parameter of the search. This method reset the page\n *\n * The complete list of parameters is available on the\n * [Algolia website](https://www.algolia.com/doc/rest#query-an-index).\n * The most commonly used parameters have their own [shortcuts](#query-parameters-shortcuts)\n * or benefit from higher-level APIs (all the kind of filters and facets have their own API)\n *\n * This method resets the current page to 0.\n * @param {string} parameter name of the parameter to update\n * @param {any} value new value of the parameter\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n * @example\n * helper.setQueryParameter('hitsPerPage', 20).search();\n */\nAlgoliaSearchHelper.prototype.setQueryParameter = function (parameter, value) {\n  this._change({\n    state: this.state.resetPage().setQueryParameter(parameter, value),\n    isPageReset: true,\n  });\n\n  return this;\n};\n\n/**\n * Set the whole state (warning: will erase previous state)\n * @param {SearchParameters} newState the whole new state\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @fires change\n * @chainable\n */\nAlgoliaSearchHelper.prototype.setState = function (newState) {\n  this._change({\n    state: SearchParameters.make(newState),\n    isPageReset: false,\n  });\n\n  return this;\n};\n\n/**\n * Override the current state without triggering a change event.\n * Do not use this method unless you know what you are doing. (see the example\n * for a legit use case)\n * @param {SearchParameters} newState the whole new state\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n * @example\n *  helper.on('change', function(state){\n *    // In this function you might want to find a way to store the state in the url/history\n *    updateYourURL(state)\n *  })\n *  window.onpopstate = function(event){\n *    // This is naive though as you should check if the state is really defined etc.\n *    helper.overrideStateWithoutTriggeringChangeEvent(event.state).search()\n *  }\n * @chainable\n */\nAlgoliaSearchHelper.prototype.overrideStateWithoutTriggeringChangeEvent =\n  function (newState) {\n    this.state = new SearchParameters(newState);\n    return this;\n  };\n\n/**\n * Check if an attribute has any numeric, conjunctive, disjunctive or hierarchical filters.\n * @param {string} attribute the name of the attribute\n * @return {boolean} true if the attribute is filtered by at least one value\n * @example\n * // hasRefinements works with numeric, conjunctive, disjunctive and hierarchical filters\n * helper.hasRefinements('price'); // false\n * helper.addNumericRefinement('price', '>', 100);\n * helper.hasRefinements('price'); // true\n *\n * helper.hasRefinements('color'); // false\n * helper.addFacetRefinement('color', 'blue');\n * helper.hasRefinements('color'); // true\n *\n * helper.hasRefinements('material'); // false\n * helper.addDisjunctiveFacetRefinement('material', 'plastic');\n * helper.hasRefinements('material'); // true\n *\n * helper.hasRefinements('categories'); // false\n * helper.toggleFacetRefinement('categories', 'kitchen > knife');\n * helper.hasRefinements('categories'); // true\n *\n */\nAlgoliaSearchHelper.prototype.hasRefinements = function (attribute) {\n  if (objectHasKeys(this.state.getNumericRefinements(attribute))) {\n    return true;\n  } else if (this.state.isConjunctiveFacet(attribute)) {\n    return this.state.isFacetRefined(attribute);\n  } else if (this.state.isDisjunctiveFacet(attribute)) {\n    return this.state.isDisjunctiveFacetRefined(attribute);\n  } else if (this.state.isHierarchicalFacet(attribute)) {\n    return this.state.isHierarchicalFacetRefined(attribute);\n  }\n\n  // there's currently no way to know that the user did call `addNumericRefinement` at some point\n  // thus we cannot distinguish if there once was a numeric refinement that was cleared\n  // so we will return false in every other situations to be consistent\n  // while what we should do here is throw because we did not find the attribute in any type\n  // of refinement\n  return false;\n};\n\n/**\n * Check if a value is excluded for a specific faceted attribute. If the value\n * is omitted then the function checks if there is any excluding refinements.\n *\n * @param  {string}  facet name of the attribute for used for faceting\n * @param  {string}  [value] optional value. If passed will test that this value\n * is filtering the given facet.\n * @return {boolean} true if refined\n * @example\n * helper.isExcludeRefined('color'); // false\n * helper.isExcludeRefined('color', 'blue') // false\n * helper.isExcludeRefined('color', 'red') // false\n *\n * helper.addFacetExclusion('color', 'red');\n *\n * helper.isExcludeRefined('color'); // true\n * helper.isExcludeRefined('color', 'blue') // false\n * helper.isExcludeRefined('color', 'red') // true\n */\nAlgoliaSearchHelper.prototype.isExcluded = function (facet, value) {\n  return this.state.isExcludeRefined(facet, value);\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since 2.4.0, see {@link AlgoliaSearchHelper#hasRefinements}\n */\nAlgoliaSearchHelper.prototype.isDisjunctiveRefined = function (facet, value) {\n  return this.state.isDisjunctiveFacetRefined(facet, value);\n};\n\n/**\n * Check if the string is a currently filtering tag.\n * @param {string} tag tag to check\n * @return {boolean} true if the tag is currently refined\n */\nAlgoliaSearchHelper.prototype.hasTag = function (tag) {\n  return this.state.isTagRefined(tag);\n};\n\n// eslint-disable-next-line valid-jsdoc\n/**\n * @deprecated since 2.4.0, see {@link AlgoliaSearchHelper#hasTag}\n */\nAlgoliaSearchHelper.prototype.isTagRefined = function () {\n  return this.hasTagRefinements.apply(this, arguments);\n};\n\n/**\n * Get the name of the currently used index.\n * @return {string} name of the index\n * @example\n * helper.setIndex('highestPrice_products').getIndex();\n * // returns 'highestPrice_products'\n */\nAlgoliaSearchHelper.prototype.getIndex = function () {\n  return this.state.index;\n};\n\nfunction getCurrentPage() {\n  return this.state.page;\n}\n\n/**\n * Get the currently selected page\n * @deprecated\n * @return {number} the current page\n */\nAlgoliaSearchHelper.prototype.getCurrentPage = getCurrentPage;\n/**\n * Get the currently selected page\n * @function\n * @return {number} the current page\n */\nAlgoliaSearchHelper.prototype.getPage = getCurrentPage;\n\n/**\n * Get all the tags currently set to filters the results.\n *\n * @return {string[]} The list of tags currently set.\n */\nAlgoliaSearchHelper.prototype.getTags = function () {\n  return this.state.tagRefinements;\n};\n\n/**\n * Get the list of refinements for a given attribute. This method works with\n * conjunctive, disjunctive, excluding and numerical filters.\n *\n * See also SearchResults#getRefinements\n *\n * @param {string} facetName attribute name used for faceting\n * @return {Array.<FacetRefinement|NumericRefinement>} All Refinement are objects that contain a value, and\n * a type. Numeric also contains an operator.\n * @example\n * helper.addNumericRefinement('price', '>', 100);\n * helper.getRefinements('price');\n * // [\n * //   {\n * //     \"value\": [\n * //       100\n * //     ],\n * //     \"operator\": \">\",\n * //     \"type\": \"numeric\"\n * //   }\n * // ]\n * @example\n * helper.addFacetRefinement('color', 'blue');\n * helper.addFacetExclusion('color', 'red');\n * helper.getRefinements('color');\n * // [\n * //   {\n * //     \"value\": \"blue\",\n * //     \"type\": \"conjunctive\"\n * //   },\n * //   {\n * //     \"value\": \"red\",\n * //     \"type\": \"exclude\"\n * //   }\n * // ]\n * @example\n * helper.addDisjunctiveFacetRefinement('material', 'plastic');\n * // [\n * //   {\n * //     \"value\": \"plastic\",\n * //     \"type\": \"disjunctive\"\n * //   }\n * // ]\n */\nAlgoliaSearchHelper.prototype.getRefinements = function (facetName) {\n  var refinements = [];\n\n  if (this.state.isConjunctiveFacet(facetName)) {\n    var conjRefinements = this.state.getConjunctiveRefinements(facetName);\n\n    conjRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'conjunctive',\n      });\n    });\n\n    var excludeRefinements = this.state.getExcludeRefinements(facetName);\n\n    excludeRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'exclude',\n      });\n    });\n  } else if (this.state.isDisjunctiveFacet(facetName)) {\n    var disjunctiveRefinements =\n      this.state.getDisjunctiveRefinements(facetName);\n\n    disjunctiveRefinements.forEach(function (r) {\n      refinements.push({\n        value: r,\n        type: 'disjunctive',\n      });\n    });\n  }\n\n  var numericRefinements = this.state.getNumericRefinements(facetName);\n\n  Object.keys(numericRefinements).forEach(function (operator) {\n    var value = numericRefinements[operator];\n\n    refinements.push({\n      value: value,\n      operator: operator,\n      type: 'numeric',\n    });\n  });\n\n  return refinements;\n};\n\n/**\n * Return the current refinement for the (attribute, operator)\n * @param {string} attribute attribute in the record\n * @param {string} operator operator applied on the refined values\n * @return {Array.<number|number[]>} refined values\n */\nAlgoliaSearchHelper.prototype.getNumericRefinement = function (\n  attribute,\n  operator\n) {\n  return this.state.getNumericRefinement(attribute, operator);\n};\n\n/**\n * Get the current breadcrumb for a hierarchical facet, as an array\n * @param  {string} facetName Hierarchical facet name\n * @return {array.<string>} the path as an array of string\n */\nAlgoliaSearchHelper.prototype.getHierarchicalFacetBreadcrumb = function (\n  facetName\n) {\n  return this.state.getHierarchicalFacetBreadcrumb(facetName);\n};\n\n// /////////// PRIVATE\n\n/**\n * Perform the underlying queries\n * @private\n * @param {object} options options for the query\n * @param {boolean} [options.onlyWithDerivedHelpers=false] if true, only the derived helpers will be queried\n * @return {undefined} does not return anything\n * @fires search\n * @fires result\n * @fires error\n */\nAlgoliaSearchHelper.prototype._search = function (options) {\n  var state = this.state;\n  var states = [];\n  var mainQueries = [];\n\n  if (!options.onlyWithDerivedHelpers) {\n    mainQueries = requestBuilder._getQueries(state.index, state);\n\n    states.push({\n      state: state,\n      queriesCount: mainQueries.length,\n      helper: this,\n    });\n\n    this.emit('search', {\n      state: state,\n      results: this.lastResults,\n    });\n  }\n\n  var derivedQueries = this.derivedHelpers.map(function (derivedHelper) {\n    var derivedState = derivedHelper.getModifiedState(state);\n    var derivedStateQueries = derivedState.index\n      ? requestBuilder._getQueries(derivedState.index, derivedState)\n      : [];\n\n    states.push({\n      state: derivedState,\n      queriesCount: derivedStateQueries.length,\n      helper: derivedHelper,\n    });\n\n    derivedHelper.emit('search', {\n      state: derivedState,\n      results: derivedHelper.lastResults,\n    });\n\n    return derivedStateQueries;\n  });\n\n  var queries = Array.prototype.concat.apply(mainQueries, derivedQueries);\n\n  var queryId = this._queryId++;\n  this._currentNbQueries++;\n\n  if (!queries.length) {\n    return Promise.resolve({ results: [] }).then(\n      this._dispatchAlgoliaResponse.bind(this, states, queryId)\n    );\n  }\n\n  try {\n    this.client\n      .search(queries)\n      .then(this._dispatchAlgoliaResponse.bind(this, states, queryId))\n      .catch(this._dispatchAlgoliaError.bind(this, queryId));\n  } catch (error) {\n    // If we reach this part, we're in an internal error state\n    this.emit('error', {\n      error: error,\n    });\n  }\n\n  return undefined;\n};\n\n/**\n * Perform the underlying queries\n * @private\n * @param {boolean} [options.onlyWithDerivedHelpers=false] if true, only the derived helpers will be queried\n * @return {undefined} does not return anything\n * @fires search\n * @fires result\n * @fires error\n */\nAlgoliaSearchHelper.prototype._runComposition = function () {\n  var state = this.state;\n  var states = [];\n  var mainQueries = [];\n\n  var derivedQueries = this.derivedHelpers.map(function (derivedHelper) {\n    var derivedState = derivedHelper.getModifiedState(state);\n    var derivedStateQueries =\n      requestBuilder._getCompositionQueries(derivedState);\n\n    states.push({\n      state: derivedState,\n      helper: derivedHelper,\n    });\n\n    derivedHelper.emit('search', {\n      state: derivedState,\n      results: derivedHelper.lastResults,\n    });\n\n    return derivedStateQueries;\n  });\n\n  var queries = Array.prototype.concat.apply(mainQueries, derivedQueries);\n\n  var queryId = this._queryId++;\n  this._currentNbQueries++;\n\n  if (!queries.length) {\n    return Promise.resolve({ results: [] }).then(\n      this._dispatchAlgoliaResponse.bind(this, states, queryId)\n    );\n  }\n\n  if (queries.length > 1) {\n    throw new Error('Only one query is allowed when using a composition.');\n  }\n\n  var query = queries[0];\n\n  try {\n    this.client\n      .search(query)\n      .then(this._dispatchAlgoliaResponse.bind(this, states, queryId))\n      .catch(this._dispatchAlgoliaError.bind(this, queryId));\n  } catch (error) {\n    // If we reach this part, we're in an internal error state\n    this.emit('error', {\n      error: error,\n    });\n  }\n\n  return undefined;\n};\n\nAlgoliaSearchHelper.prototype._recommend = function () {\n  var searchState = this.state;\n  var recommendState = this.recommendState;\n  var index = this.getIndex();\n  var states = [{ state: recommendState, index: index, helper: this }];\n  var ids = recommendState.params.map(function (param) {\n    return param.$$id;\n  });\n\n  this.emit('fetch', {\n    recommend: {\n      state: recommendState,\n      results: this.lastRecommendResults,\n    },\n  });\n\n  var cache = this._recommendCache;\n\n  var derivedQueries = this.derivedHelpers.map(function (derivedHelper) {\n    var derivedIndex = derivedHelper.getModifiedState(searchState).index;\n    if (!derivedIndex) {\n      return [];\n    }\n\n    // Contrary to what is done when deriving the search state, we don't want to\n    // provide the current recommend state to the derived helper, as it would\n    // inherit unwanted queries. We instead provide an empty recommend state.\n    var derivedState = derivedHelper.getModifiedRecommendState(\n      new RecommendParameters()\n    );\n    states.push({\n      state: derivedState,\n      index: derivedIndex,\n      helper: derivedHelper,\n    });\n\n    ids = Array.prototype.concat.apply(\n      ids,\n      derivedState.params.map(function (param) {\n        return param.$$id;\n      })\n    );\n\n    derivedHelper.emit('fetch', {\n      recommend: {\n        state: derivedState,\n        results: derivedHelper.lastRecommendResults,\n      },\n    });\n\n    return derivedState._buildQueries(derivedIndex, cache);\n  });\n\n  var queries = Array.prototype.concat.apply(\n    this.recommendState._buildQueries(index, cache),\n    derivedQueries\n  );\n\n  if (queries.length === 0) {\n    return;\n  }\n\n  if (\n    queries.length > 0 &&\n    typeof this.client.getRecommendations === 'undefined'\n  ) {\n    // eslint-disable-next-line no-console\n    console.warn(\n      'Please update algoliasearch/lite to the latest version in order to use recommend widgets.'\n    );\n    return;\n  }\n\n  var queryId = this._recommendQueryId++;\n  this._currentNbRecommendQueries++;\n\n  try {\n    this.client\n      .getRecommendations(queries)\n      .then(this._dispatchRecommendResponse.bind(this, queryId, states, ids))\n      .catch(this._dispatchRecommendError.bind(this, queryId));\n  } catch (error) {\n    // If we reach this part, we're in an internal error state\n    this.emit('error', {\n      error: error,\n    });\n  }\n\n  return;\n};\n\n/**\n * Transform the responses as sent by the server and transform them into a user\n * usable object that merge the results of all the batch requests. It will dispatch\n * over the different helper + derived helpers (when there are some).\n * @private\n * @param {array.<{SearchParameters, AlgoliaQueries, AlgoliaSearchHelper}>} states state used to generate the request\n * @param {number} queryId id of the current request\n * @param {object} content content of the response\n * @return {undefined}\n */\nAlgoliaSearchHelper.prototype._dispatchAlgoliaResponse = function (\n  states,\n  queryId,\n  content\n) {\n  // eslint-disable-next-line consistent-this\n  var self = this;\n\n  // @TODO remove the number of outdated queries discarded instead of just one\n\n  if (queryId < this._lastQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbQueries -= queryId - this._lastQueryIdReceived;\n  this._lastQueryIdReceived = queryId;\n\n  if (this._currentNbQueries === 0) this.emit('searchQueueEmpty');\n\n  var results = content.results.slice();\n  var rawContent = Object.keys(content).reduce(function (value, key) {\n    if (key !== 'results') value[key] = content[key];\n    return value;\n  }, {});\n\n  if (Object.keys(rawContent).length <= 0) {\n    rawContent = undefined;\n  }\n\n  states.forEach(function (s) {\n    var state = s.state;\n    var queriesCount = s.queriesCount;\n    var helper = s.helper;\n    var specificResults = queriesCount !== undefined\n      ? results.splice(0, queriesCount)\n      : results;\n\n    if (!state.index) {\n      helper.emit('result', {\n        results: null,\n        state: state,\n      });\n      return;\n    }\n\n    // Multifeed composition: build ordered SearchResults array on lastResults\n    if (specificResults.length > 0 && specificResults[0].feedID) {\n      var feeds = specificResults.map(function (r) {\n        var sr = new SearchResults(state, [r], self._searchResultsOptions);\n        if (rawContent !== undefined) sr._rawContent = rawContent;\n        return sr;\n      });\n      helper.lastResults = new SearchResults(\n        state,\n        [specificResults[0]],\n        self._searchResultsOptions\n      );\n      helper.lastResults.feeds = feeds;\n      if (rawContent !== undefined) helper.lastResults._rawContent = rawContent;\n    } else {\n      helper.lastResults = new SearchResults(\n        state,\n        specificResults,\n        self._searchResultsOptions\n      );\n      if (rawContent !== undefined) helper.lastResults._rawContent = rawContent;\n    }\n\n    helper.emit('result', {\n      results: helper.lastResults,\n      state: state,\n    });\n  });\n};\n\nAlgoliaSearchHelper.prototype._dispatchRecommendResponse = function (\n  queryId,\n  states,\n  ids,\n  content\n) {\n  // @TODO remove the number of outdated queries discarded instead of just one\n\n  if (queryId < this._lastRecommendQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbRecommendQueries -=\n    queryId - this._lastRecommendQueryIdReceived;\n  this._lastRecommendQueryIdReceived = queryId;\n\n  if (this._currentNbRecommendQueries === 0) this.emit('recommendQueueEmpty');\n\n  var cache = this._recommendCache;\n\n  var idsMap = {};\n  ids\n    .filter(function (id) {\n      return cache[id] === undefined;\n    })\n    .forEach(function (id, index) {\n      if (!idsMap[id]) idsMap[id] = [];\n\n      idsMap[id].push(index);\n    });\n\n  Object.keys(idsMap).forEach(function (id) {\n    var indices = idsMap[id];\n    var firstResult = content.results[indices[0]];\n    if (indices.length === 1) {\n      cache[id] = firstResult;\n      return;\n    }\n    cache[id] = Object.assign({}, firstResult, {\n      hits: sortAndMergeRecommendations(\n        ids,\n        indices.map(function (idx) {\n          return content.results[idx].hits;\n        })\n      ),\n    });\n  });\n\n  var results = {};\n  ids.forEach(function (id) {\n    results[id] = cache[id];\n  });\n\n  states.forEach(function (s) {\n    var state = s.state;\n    var helper = s.helper;\n\n    if (!s.index) {\n      // eslint-disable-next-line no-warning-comments\n      // TODO: emit \"result\" event when events for Recommend are implemented\n      helper.emit('recommend:result', {\n        results: null,\n        state: state,\n      });\n      return;\n    }\n\n    helper.lastRecommendResults = new RecommendResults(state, results);\n\n    // eslint-disable-next-line no-warning-comments\n    // TODO: emit \"result\" event when events for Recommend are implemented\n    helper.emit('recommend:result', {\n      recommend: {\n        results: helper.lastRecommendResults,\n        state: state,\n      },\n    });\n  });\n};\n\nAlgoliaSearchHelper.prototype._dispatchAlgoliaError = function (\n  queryId,\n  error\n) {\n  if (queryId < this._lastQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbQueries -= queryId - this._lastQueryIdReceived;\n  this._lastQueryIdReceived = queryId;\n\n  this.emit('error', {\n    error: error,\n  });\n\n  if (this._currentNbQueries === 0) this.emit('searchQueueEmpty');\n};\n\nAlgoliaSearchHelper.prototype._dispatchRecommendError = function (\n  queryId,\n  error\n) {\n  if (queryId < this._lastRecommendQueryIdReceived) {\n    // Outdated answer\n    return;\n  }\n\n  this._currentNbRecommendQueries -=\n    queryId - this._lastRecommendQueryIdReceived;\n  this._lastRecommendQueryIdReceived = queryId;\n\n  this.emit('error', {\n    error: error,\n  });\n\n  if (this._currentNbRecommendQueries === 0) this.emit('recommendQueueEmpty');\n};\n\nAlgoliaSearchHelper.prototype.containsRefinement = function (\n  query,\n  facetFilters,\n  numericFilters,\n  tagFilters\n) {\n  return (\n    query ||\n    facetFilters.length !== 0 ||\n    numericFilters.length !== 0 ||\n    tagFilters.length !== 0\n  );\n};\n\n/**\n * Test if there are some disjunctive refinements on the facet\n * @private\n * @param {string} facet the attribute to test\n * @return {boolean} true if there are refinements on this attribute\n */\nAlgoliaSearchHelper.prototype._hasDisjunctiveRefinements = function (facet) {\n  return (\n    this.state.disjunctiveRefinements[facet] &&\n    this.state.disjunctiveRefinements[facet].length > 0\n  );\n};\n\nAlgoliaSearchHelper.prototype._change = function (event) {\n  var state = event.state;\n  var isPageReset = event.isPageReset;\n\n  if (state !== this.state) {\n    this.state = state;\n\n    this.emit('change', {\n      state: this.state,\n      results: this.lastResults,\n      isPageReset: isPageReset,\n    });\n  }\n};\n\nAlgoliaSearchHelper.prototype._recommendChange = function (event) {\n  var state = event.state;\n\n  if (state !== this.recommendState) {\n    this.recommendState = state;\n\n    // eslint-disable-next-line no-warning-comments\n    // TODO: emit \"change\" event when events for Recommend are implemented\n    this.emit('recommend:change', {\n      search: {\n        results: this.lastResults,\n        state: this.state,\n      },\n      recommend: {\n        results: this.lastRecommendResults,\n        state: this.recommendState,\n      },\n    });\n  }\n};\n\n/**\n * Clears the cache of the underlying Algolia client.\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n */\nAlgoliaSearchHelper.prototype.clearCache = function () {\n  if (this.client.clearCache) this.client.clearCache();\n  return this;\n};\n\n/**\n * Updates the internal client instance. If the reference of the clients\n * are equal then no update is actually done.\n * @param  {AlgoliaSearch} newClient an AlgoliaSearch client\n * @return {AlgoliaSearchHelper} Method is chainable, it returns itself\n */\nAlgoliaSearchHelper.prototype.setClient = function (newClient) {\n  if (this.client === newClient) return this;\n\n  if (typeof newClient.addAlgoliaAgent === 'function') {\n    newClient.addAlgoliaAgent('JS Helper (' + version + ')');\n  }\n  this.client = newClient;\n\n  return this;\n};\n\n/**\n * Gets the instance of the currently used client.\n * @return {AlgoliaSearch} the currently used client\n */\nAlgoliaSearchHelper.prototype.getClient = function () {\n  return this.client;\n};\n\n/**\n * Creates an derived instance of the Helper. A derived helper\n * is a way to request other indices synchronised with the lifecycle\n * of the main Helper. This mechanism uses the multiqueries feature\n * of Algolia to aggregate all the requests in a single network call.\n *\n * This method takes a function that is used to create a new SearchParameter\n * that will be used to create requests to Algolia. Those new requests\n * are created just before the `search` event. The signature of the function\n * is `SearchParameters -> SearchParameters`.\n *\n * This method returns a new DerivedHelper which is an EventEmitter\n * that fires the same `search`, `result` and `error` events. Those\n * events, however, will receive data specific to this DerivedHelper\n * and the SearchParameters that is returned by the call of the\n * parameter function.\n * @param {function} fn SearchParameters -> SearchParameters\n * @param {function} recommendFn RecommendParameters -> RecommendParameters\n * @return {DerivedHelper} a new DerivedHelper\n */\nAlgoliaSearchHelper.prototype.derive = function (fn, recommendFn) {\n  var derivedHelper = new DerivedHelper(this, fn, recommendFn);\n  this.derivedHelpers.push(derivedHelper);\n  return derivedHelper;\n};\n\n/**\n * This method detaches a derived Helper from the main one. Prefer using the one from the\n * derived helper itself, to remove the event listeners too.\n * @private\n * @param  {DerivedHelper} derivedHelper the derived helper to detach\n * @return {undefined} nothing is returned\n * @throws Error\n */\nAlgoliaSearchHelper.prototype.detachDerivedHelper = function (derivedHelper) {\n  var pos = this.derivedHelpers.indexOf(derivedHelper);\n  if (pos === -1) throw new Error('Derived helper already detached');\n  this.derivedHelpers.splice(pos, 1);\n};\n\n/**\n * This method returns true if there is currently at least one on-going search.\n * @return {boolean} true if there is a search pending\n */\nAlgoliaSearchHelper.prototype.hasPendingRequests = function () {\n  return this._currentNbQueries > 0;\n};\n\n/**\n * @typedef AlgoliaSearchHelper.NumericRefinement\n * @type {object}\n * @property {number[]} value the numbers that are used for filtering this attribute with\n * the operator specified.\n * @property {string} operator the faceting data: value, number of entries\n * @property {string} type will be 'numeric'\n */\n\n/**\n * @typedef AlgoliaSearchHelper.FacetRefinement\n * @type {object}\n * @property {string} value the string use to filter the attribute\n * @property {string} type the type of filter: 'conjunctive', 'disjunctive', 'exclude'\n */\n\nmodule.exports = AlgoliaSearchHelper;\n"],"names":["EventEmitter","require$$0","DerivedHelper","require$$1","escapeFacetValue","require$$2","inherits","require$$3","merge","require$$4","objectHasKeys","require$$5","omit","require$$6","RecommendParameters","require$$7","RecommendResults","require$$8","requestBuilder","require$$9","SearchParameters","require$$10","SearchResults","require$$11","sortAndMergeRecommendations","require$$12","version","require$$13","AlgoliaSearchHelper","client","index","options","searchResultsOptions","addAlgoliaAgent","this","setClient","opts","state","make","recommendState","params","lastResults","lastRecommendResults","_queryId","_recommendQueryId","_lastQueryIdReceived","_lastRecommendQueryIdReceived","derivedHelpers","_currentNbQueries","_currentNbRecommendQueries","_searchResultsOptions","_recommendCache","setCurrentPage","page","Error","_change","setPage","isPageReset","getCurrentPage","prototype","search","_search","onlyWithDerivedHelpers","searchOnlyWithDerivedHelpers","searchWithComposition","_runComposition","recommend","_recommend","getQuery","_getHitsSearchParams","searchOnce","cb","tempState","setQueryParameters","queries","_getQueries","self","emit","then","content","results","_originalResponse","e","catch","err","findAnswers","console","warn","derivedHelper","Promise","resolve","derivedState","getModifiedState","data","attributesForPrediction","nbHits","errorMessage","initIndex","query","queryLanguages","searchForFacetValues","facet","maxFacetHits","userState","clientHasSFFV","searchForFacets","clientHasInitIndex","isDisjunctive","isDisjunctiveFacet","algoliaQuery","getSearchForFacetQuery","searchForFacetValuesPromise","indexName","facetName","type","response","hide","renderingContent","facetOrdering","values","Array","isArray","facetHits","reduce","acc","f","indexOf","value","escapedValue","isRefined","isDisjunctiveFacetRefined","isFacetRefined","push","searchForCompositionFacetValues","compositionID","searchForFacetValuesRequest","searchQuery","_getCompositionHitsSearchParams","forEach","setQuery","q","resetPage","clearRefinements","name","clearTags","addDisjunctiveFacetRefinement","addDisjunctiveRefine","apply","arguments","addHierarchicalFacetRefinement","path","addNumericRefinement","attribute","operator","addFacetRefinement","addRefine","addFacetExclusion","addExcludeRefinement","addExclude","addTag","tag","addTagRefinement","addFrequentlyBoughtTogether","_recommendChange","addRelatedProducts","addTrendingItems","addTrendingFacets","addLookingSimilar","removeNumericRefinement","removeDisjunctiveFacetRefinement","removeDisjunctiveRefine","removeHierarchicalFacetRefinement","removeFacetRefinement","removeRefine","removeFacetExclusion","removeExcludeRefinement","removeExclude","removeTag","removeTagRefinement","removeFrequentlyBoughtTogether","id","removeParams","removeRelatedProducts","removeTrendingItems","removeTrendingFacets","removeLookingSimilar","toggleFacetExclusion","toggleExcludeFacetRefinement","toggleExclude","toggleRefinement","toggleFacetRefinement","toggleRefine","toggleTag","toggleTagRefinement","nextPage","previousPage","setIndex","setQueryParameter","parameter","setState","newState","overrideStateWithoutTriggeringChangeEvent","hasRefinements","getNumericRefinements","isConjunctiveFacet","isHierarchicalFacet","isHierarchicalFacetRefined","isExcluded","isExcludeRefined","isDisjunctiveRefined","hasTag","isTagRefined","hasTagRefinements","getIndex","getPage","getTags","tagRefinements","getRefinements","refinements","getConjunctiveRefinements","r","getExcludeRefinements","getDisjunctiveRefinements","numericRefinements","Object","keys","getNumericRefinement","getHierarchicalFacetBreadcrumb","states","mainQueries","queriesCount","length","helper","derivedQueries","map","derivedStateQueries","concat","queryId","_dispatchAlgoliaResponse","bind","_dispatchAlgoliaError","error","_getCompositionQueries","searchState","ids","param","$$id","cache","derivedIndex","getModifiedRecommendState","_buildQueries","getRecommendations","_dispatchRecommendResponse","_dispatchRecommendError","slice","rawContent","key","undefined","s","specificResults","splice","feedID","feeds","sr","_rawContent","idsMap","filter","indices","firstResult","assign","hits","idx","containsRefinement","facetFilters","numericFilters","tagFilters","_hasDisjunctiveRefinements","disjunctiveRefinements","event","clearCache","newClient","getClient","derive","fn","recommendFn","detachDerivedHelper","pos","hasPendingRequests","algoliasearch_helper"],"mappings":"8xBAEA,IAAIA,EAAeC,IAEfC,EAAgBC,IAChBC,EAAmBC,IAAwCD,iBAC3DE,EAAWC,IACXC,EAAQC,IACRC,EAAgBC,IAChBC,EAAOC,IACPC,EAAsBC,IACtBC,EAAmBC,IACnBC,EAAiBC,IACjBC,EAAmBC,IACnBC,EAAgBC,IAChBC,EAA8BC,IAC9BC,EAAUC,IA0Gd,SAASC,EAAoBC,EAAQC,EAAOC,EAASC,GACb,mBAA3BH,EAAOI,iBAChBJ,EAAOI,gBAAgB,cAAgBP,EAAU,KAGnDQ,KAAKC,UAAUN,GACf,IAAIO,EAAOL,GAAW,CAAA,EACtBK,EAAKN,MAAQA,EACbI,KAAKG,MAAQjB,EAAiBkB,KAAKF,GACnCF,KAAKK,eAAiB,IAAIzB,EAAoB,CAC5C0B,OAAQJ,EAAKG,iBAEfL,KAAKO,YAAc,KACnBP,KAAKQ,qBAAuB,KAC5BR,KAAKS,SAAW,EAChBT,KAAKU,kBAAoB,EACzBV,KAAKW,sBAAuB,EAC5BX,KAAKY,+BAAgC,EACrCZ,KAAKa,eAAiB,GACtBb,KAAKc,kBAAoB,EACzBd,KAAKe,2BAA6B,EAClCf,KAAKgB,sBAAwBlB,EAC7BE,KAAKiB,gBAAkB,CAAA,CACzB,CAwkCA,SAASC,EAAeC,GACtB,GAAIA,EAAO,EAAG,MAAM,IAAIC,MAAM,2BAO9B,OALApB,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMmB,QAAQH,GAC1BI,aAAa,IAGRvB,IACT,CA8MA,SAASwB,IACP,OAAOxB,KAAKG,MAAMgB,IACpB,QA/xCA/C,EAASsB,EAAqB5B,GAa9B4B,EAAoB+B,UAAUC,OAAS,WAErC,OADA1B,KAAK2B,QAAQ,CAAEC,wBAAwB,IAChC5B,IACT,EAEAN,EAAoB+B,UAAUI,6BAA+B,WAE3D,OADA7B,KAAK2B,QAAQ,CAAEC,wBAAwB,IAChC5B,IACT,EAEAN,EAAoB+B,UAAUK,sBAAwB,WAEpD,OADA9B,KAAK+B,gBAAgB,CAAEH,wBAAwB,IACxC5B,IACT,EAWAN,EAAoB+B,UAAUO,UAAY,WAExC,OADAhC,KAAKiC,aACEjC,IACT,EAOAN,EAAoB+B,UAAUS,SAAW,WACvC,IAAI/B,EAAQH,KAAKG,MACjB,OAAOnB,EAAemD,qBAAqBhC,EAC7C,EAsCAT,EAAoB+B,UAAUW,WAAa,SAAUvC,EAASwC,GAC5D,IAAIC,EAAazC,EAEbG,KAAKG,MAAMoC,mBAAmB1C,GAD9BG,KAAKG,MAELqC,EAAUxD,EAAeyD,YAAYH,EAAU1C,MAAO0C,GAEtDI,EAAO1C,KAQX,GANAA,KAAKc,oBAELd,KAAK2C,KAAK,aAAc,CACtBxC,MAAOmC,KAGLD,EAuBJ,OAAOrC,KAAKL,OAAO+B,OAAOc,GAASI,KACjC,SAAUC,GAGR,OAFAH,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,oBACrC,CACLE,QAAS,IAAIzD,EAAckD,EAAWO,EAAQC,SAC9C3C,MAAOmC,EACPS,kBAAmBF,EAE3B,EACI,SAAUG,GAGR,MAFAN,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,oBACtCK,CACZ,GApCIhD,KAAKL,OACF+B,OAAOc,GACPI,KAAK,SAAUC,GACdH,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBACP4B,EAAKC,KAAK,oBAGZN,EAAG,KAAM,IAAIjD,EAAckD,EAAWO,EAAQC,SAAUR,EAChE,GACOW,MAAM,SAAUC,GACfR,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBACP4B,EAAKC,KAAK,oBAGZN,EAAGa,EAAK,KAAMZ,EACtB,EAqBA,EAaA5C,EAAoB+B,UAAU0B,YAAc,SAAUtD,GAEpDuD,QAAQC,KAAK,yDACb,IAAIlD,EAAQH,KAAKG,MACbmD,EAAgBtD,KAAKa,eAAe,GACxC,IAAKyC,EACH,OAAOC,QAAQC,QAAQ,IAEzB,IAAIC,EAAeH,EAAcI,iBAAiBvD,GAC9CwD,EAAOrF,EACT,CACEsF,wBAAyB/D,EAAQ+D,wBACjCC,OAAQhE,EAAQgE,QAElB,CACEvD,OAAQ5B,EAAKM,EAAemD,qBAAqBsB,GAAe,CAC9D,sBACA,cACA,+BACA,0BAKFK,EACF,8GACF,GAAqC,mBAA1B9D,KAAKL,OAAOoE,UACrB,MAAM,IAAI3C,MAAM0C,GAElB,IAAIlE,EAAQI,KAAKL,OAAOoE,UAAUN,EAAa7D,OAC/C,GAAiC,mBAAtBA,EAAMuD,YACf,MAAM,IAAI/B,MAAM0C,GAElB,OAAOlE,EAAMuD,YAAYM,EAAaO,MAAOnE,EAAQoE,eAAgBN,EACvE,EAoCAjE,EAAoB+B,UAAUyC,qBAAuB,SACnDC,EACAH,EACAI,EACAC,GAEA,IAAIC,EAC0C,mBAArCtE,KAAKL,OAAOuE,sBAEoB,mBAAhClE,KAAKL,OAAO4E,gBACjBC,EAAsD,mBAA1BxE,KAAKL,OAAOoE,UAC5C,IACGO,IACAE,GAC6B,mBAAvBxE,KAAKL,OAAO+B,OAEnB,MAAM,IAAIN,MACR,yKAIJ,IAAIjB,EAAQH,KAAKG,MAAMoC,mBAAmB8B,GAAa,CAAA,GACnDI,EAAgBtE,EAAMuE,mBAAmBP,GACzCQ,EAAe3F,EAAe4F,uBAChCT,EACAH,EACAI,EACAjE,GAGFH,KAAKc,oBAEL,IACI+D,EADAnC,EAAO1C,KAGPsE,EACFO,EAA8B7E,KAAKL,OAAOuE,qBAAqB,CAC7D,CAAEY,UAAW3E,EAAMP,MAAOU,OAAQqE,KAG3BH,EACTK,EAA8B7E,KAAKL,OAChCoE,UAAU5D,EAAMP,OAChBsE,qBAAqBS,WAIjBA,EAAaI,UACpBF,EAA8B7E,KAAKL,OAChC+B,OAAO,CACN,CACEsD,KAAM,QACNb,MAAOA,EACPW,UAAW3E,EAAMP,MACjBU,OAAQqE,KAGX/B,KAAK,SAAyBqC,GAC7B,OAAOA,EAASnC,QAAQ,EAChC,IAGE9C,KAAK2C,KAAK,uBAAwB,CAChCxC,MAAOA,EACPgE,MAAOA,EACPH,MAAOA,IAGT,IAAIkB,EACDlF,KAAKO,aACJP,KAAKO,YAAYX,QAAUO,EAAMP,OACjCI,KAAKO,YAAY4E,kBACjBnF,KAAKO,YAAY4E,iBAAiBC,eAClCpF,KAAKO,YAAY4E,iBAAiBC,cAAcC,QAChDrF,KAAKO,YAAY4E,iBAAiBC,cAAcC,OAAOlB,IACvDnE,KAAKO,YAAY4E,iBAAiBC,cAAcC,OAAOlB,GAAOe,MAChE,GAEF,OAAOL,EAA4BjC,KACjC,SAAsBC,GAoBpB,OAnBAH,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,qBAE5CE,EAAUyC,MAAMC,QAAQ1C,GAAWA,EAAQ,GAAKA,GAExC2C,UAAY3C,EAAQ2C,UAAUC,OAAO,SAAUC,EAAKC,GAC1D,OAAIT,EAAKU,QAAQD,EAAEE,QAAS,IAI5BF,EAAEG,aAAe5H,EAAiByH,EAAEE,OACpCF,EAAEI,UAAYtB,EACVtE,EAAM6F,0BAA0B7B,EAAOwB,EAAEG,cACzC3F,EAAM8F,eAAe9B,EAAOwB,EAAEG,cAElCJ,EAAIQ,KAAKP,IARAD,CAUjB,EAAS,IAEI7C,CACb,EACI,SAAUG,GAGR,MAFAN,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,oBACtCK,CACZ,EAEA,EAeAtD,EAAoB+B,UAAU0E,gCAAkC,SAC9DhC,EACAH,EACAI,EACAC,GAEA,GAAgD,mBAArCrE,KAAKL,OAAOuE,qBACrB,MAAM,IAAI9C,MACR,yHAIJ,IAAIjB,EAAQH,KAAKG,MAAMoC,mBAAmB8B,GAAa,CAAA,GACnDI,EAAgBtE,EAAMuE,mBAAmBP,GAE7CnE,KAAKc,oBAEL,IACI+D,EADAnC,EAAO1C,KAqBX,OAlBA6E,EAA8B7E,KAAKL,OAAOuE,qBAAqB,CAC7DkC,cAAejG,EAAMP,MACrBmF,UAAWZ,EACXkC,4BAA6B,CAC3B/F,OAAQ,CACN0D,MAAOA,EACPI,aAAcA,EACdkC,YAAatH,EAAeuH,gCAAgCpG,OAKlEH,KAAK2C,KAAK,uBAAwB,CAChCxC,MAAOA,EACPgE,MAAOA,EACPH,MAAOA,IAGFa,EAA4BjC,KACjC,SAAsBC,GAapB,OAZAH,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,qBAE5CE,EAAUA,EAAQC,QAAQ,IAElB0C,UAAUgB,QAAQ,SAAUb,GAClCA,EAAEG,aAAe5H,EAAiByH,EAAEE,OACpCF,EAAEI,UAAYtB,EACVtE,EAAM6F,0BAA0B7B,EAAOwB,EAAEG,cACzC3F,EAAM8F,eAAe9B,EAAOwB,EAAEG,aAC1C,GAEajD,CACb,EACI,SAAUG,GAGR,MAFAN,EAAK5B,oBAC0B,IAA3B4B,EAAK5B,mBAAyB4B,EAAKC,KAAK,oBACtCK,CACZ,EAEA,EAWAtD,EAAoB+B,UAAUgF,SAAW,SAAUC,GAMjD,OALA1G,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYF,SAASC,GACvCnF,aAAa,IAGRvB,IACT,EAyBAN,EAAoB+B,UAAUmF,iBAAmB,SAAUC,GAMzD,OALA7G,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYC,iBAAiBC,GAC/CtF,aAAa,IAGRvB,IACT,EAUAN,EAAoB+B,UAAUqF,UAAY,WAMxC,OALA9G,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYG,YAC9BvF,aAAa,IAGRvB,IACT,EAaAN,EAAoB+B,UAAUsF,8BAAgC,SAC5D5C,EACA0B,GAOA,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYI,8BAA8B5C,EAAO0B,GACnEtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUuF,qBAAuB,WACnD,OAAOhH,KAAK+G,8BAA8BE,MAAMjH,KAAMkH,UACxD,EAeAxH,EAAoB+B,UAAU0F,+BAAiC,SAC7DhD,EACAiD,GAOA,OALApH,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYQ,+BAA+BhD,EAAOiD,GACpE7F,aAAa,IAGRvB,IACT,EAcAN,EAAoB+B,UAAU4F,qBAAuB,SACnDC,EACAC,EACA1B,GASA,OAPA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MACTwG,YACAU,qBAAqBC,EAAWC,EAAU1B,GAC7CtE,aAAa,IAGRvB,IACT,EAaAN,EAAoB+B,UAAU+F,mBAAqB,SAAUrD,EAAO0B,GAMlE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYa,mBAAmBrD,EAAO0B,GACxDtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUgG,UAAY,WACxC,OAAOzH,KAAKwH,mBAAmBP,MAAMjH,KAAMkH,UAC7C,EAaAxH,EAAoB+B,UAAUiG,kBAAoB,SAAUvD,EAAO0B,GAMjE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYgB,qBAAqBxD,EAAO0B,GAC1DtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUmG,WAAa,WACzC,OAAO5H,KAAK0H,kBAAkBT,MAAMjH,KAAMkH,UAC5C,EAYAxH,EAAoB+B,UAAUoG,OAAS,SAAUC,GAM/C,OALA9H,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYoB,iBAAiBD,GAC/CvG,aAAa,IAGRvB,IACT,EAUAN,EAAoB+B,UAAUuG,4BAA8B,SAAU1H,GAKpE,OAJAN,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe2H,4BAA4B1H,KAGlDN,IACT,EAUAN,EAAoB+B,UAAUyG,mBAAqB,SAAU5H,GAK3D,OAJAN,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe6H,mBAAmB5H,KAGzCN,IACT,EAUAN,EAAoB+B,UAAU0G,iBAAmB,SAAU7H,GAKzD,OAJAN,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8H,iBAAiB7H,KAGvCN,IACT,EAUAN,EAAoB+B,UAAU2G,kBAAoB,SAAU9H,GAK1D,OAJAN,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe+H,kBAAkB9H,KAGxCN,IACT,EAUAN,EAAoB+B,UAAU4G,kBAAoB,SAAU/H,GAK1D,OAJAN,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAegI,kBAAkB/H,KAGxCN,IACT,EAoBAN,EAAoB+B,UAAU6G,wBAA0B,SACtDhB,EACAC,EACA1B,GASA,OAPA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MACTwG,YACA2B,wBAAwBhB,EAAWC,EAAU1B,GAChDtE,aAAa,IAGRvB,IACT,EAgBAN,EAAoB+B,UAAU8G,iCAAmC,SAC/DpE,EACA0B,GASA,OAPA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MACTwG,YACA4B,iCAAiCpE,EAAO0B,GAC3CtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAU+G,wBAA0B,WACtD,OAAOxI,KAAKuI,iCAAiCtB,MAAMjH,KAAMkH,UAC3D,EAUAxH,EAAoB+B,UAAUgH,kCAAoC,SAChEtE,GAOA,OALAnE,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAY8B,kCAAkCtE,GAChE5C,aAAa,IAGRvB,IACT,EAgBAN,EAAoB+B,UAAUiH,sBAAwB,SAAUvE,EAAO0B,GAMrE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAY+B,sBAAsBvE,EAAO0B,GAC3DtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUkH,aAAe,WAC3C,OAAO3I,KAAK0I,sBAAsBzB,MAAMjH,KAAMkH,UAChD,EAgBAxH,EAAoB+B,UAAUmH,qBAAuB,SAAUzE,EAAO0B,GAMpE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYkC,wBAAwB1E,EAAO0B,GAC7DtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUqH,cAAgB,WAC5C,OAAO9I,KAAK4I,qBAAqB3B,MAAMjH,KAAMkH,UAC/C,EAYAxH,EAAoB+B,UAAUsH,UAAY,SAAUjB,GAMlD,OALA9H,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYqC,oBAAoBlB,GAClDvG,aAAa,IAGRvB,IACT,EAUAN,EAAoB+B,UAAUwH,+BAAiC,SAAUC,GAKvE,OAJAlJ,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8I,aAAaD,KAGnClJ,IACT,EAUAN,EAAoB+B,UAAU2H,sBAAwB,SAAUF,GAK9D,OAJAlJ,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8I,aAAaD,KAGnClJ,IACT,EAUAN,EAAoB+B,UAAU4H,oBAAsB,SAAUH,GAK5D,OAJAlJ,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8I,aAAaD,KAGnClJ,IACT,EAUAN,EAAoB+B,UAAU6H,qBAAuB,SAAUJ,GAK7D,OAJAlJ,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8I,aAAaD,KAGnClJ,IACT,EAUAN,EAAoB+B,UAAU8H,qBAAuB,SAAUL,GAK7D,OAJAlJ,KAAKiI,iBAAiB,CACpB9H,MAAOH,KAAKK,eAAe8I,aAAaD,KAGnClJ,IACT,EAaAN,EAAoB+B,UAAU+H,qBAAuB,SAAUrF,EAAO0B,GAMpE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAY8C,6BAA6BtF,EAAO0B,GAClEtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUiI,cAAgB,WAC5C,OAAO1J,KAAKwJ,qBAAqBvC,MAAMjH,KAAMkH,UAC/C,EAiBAxH,EAAoB+B,UAAUkI,iBAAmB,SAAUxF,EAAO0B,GAChE,OAAO7F,KAAK4J,sBAAsBzF,EAAO0B,EAC3C,EAgBAnG,EAAoB+B,UAAUmI,sBAAwB,SAAUzF,EAAO0B,GAMrE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYiD,sBAAsBzF,EAAO0B,GAC3DtE,aAAa,IAGRvB,IACT,EAMAN,EAAoB+B,UAAUoI,aAAe,WAC3C,OAAO7J,KAAK4J,sBAAsB3C,MAAMjH,KAAMkH,UAChD,EAYAxH,EAAoB+B,UAAUqI,UAAY,SAAUhC,GAMlD,OALA9H,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYoD,oBAAoBjC,GAClDvG,aAAa,IAGRvB,IACT,EAWAN,EAAoB+B,UAAUuI,SAAW,WACvC,IAAI7I,EAAOnB,KAAKG,MAAMgB,MAAQ,EAC9B,OAAOnB,KAAKsB,QAAQH,EAAO,EAC7B,EAWAzB,EAAoB+B,UAAUwI,aAAe,WAC3C,IAAI9I,EAAOnB,KAAKG,MAAMgB,MAAQ,EAC9B,OAAOnB,KAAKsB,QAAQH,EAAO,EAC7B,EA4BAzB,EAAoB+B,UAAUP,eAAiBA,EAU/CxB,EAAoB+B,UAAUH,QAAUJ,EAWxCxB,EAAoB+B,UAAUyI,SAAW,SAAUrD,GAMjD,OALA7G,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYuD,SAASrD,GACvCtF,aAAa,IAGRvB,IACT,EAmBAN,EAAoB+B,UAAU0I,kBAAoB,SAAUC,EAAWvE,GAMrE,OALA7F,KAAKqB,QAAQ,CACXlB,MAAOH,KAAKG,MAAMwG,YAAYwD,kBAAkBC,EAAWvE,GAC3DtE,aAAa,IAGRvB,IACT,EASAN,EAAoB+B,UAAU4I,SAAW,SAAUC,GAMjD,OALAtK,KAAKqB,QAAQ,CACXlB,MAAOjB,EAAiBkB,KAAKkK,GAC7B/I,aAAa,IAGRvB,IACT,EAmBAN,EAAoB+B,UAAU8I,0CAC5B,SAAUD,GAER,OADAtK,KAAKG,MAAQ,IAAIjB,EAAiBoL,GAC3BtK,IACX,EAyBAN,EAAoB+B,UAAU+I,eAAiB,SAAUlD,GACvD,QAAI9I,EAAcwB,KAAKG,MAAMsK,sBAAsBnD,MAExCtH,KAAKG,MAAMuK,mBAAmBpD,GAChCtH,KAAKG,MAAM8F,eAAeqB,GACxBtH,KAAKG,MAAMuE,mBAAmB4C,GAChCtH,KAAKG,MAAM6F,0BAA0BsB,KACnCtH,KAAKG,MAAMwK,oBAAoBrD,IACjCtH,KAAKG,MAAMyK,2BAA2BtD,GASjD,EAqBA5H,EAAoB+B,UAAUoJ,WAAa,SAAU1G,EAAO0B,GAC1D,OAAO7F,KAAKG,MAAM2K,iBAAiB3G,EAAO0B,EAC5C,EAMAnG,EAAoB+B,UAAUsJ,qBAAuB,SAAU5G,EAAO0B,GACpE,OAAO7F,KAAKG,MAAM6F,0BAA0B7B,EAAO0B,EACrD,EAOAnG,EAAoB+B,UAAUuJ,OAAS,SAAUlD,GAC/C,OAAO9H,KAAKG,MAAM8K,aAAanD,EACjC,EAMApI,EAAoB+B,UAAUwJ,aAAe,WAC3C,OAAOjL,KAAKkL,kBAAkBjE,MAAMjH,KAAMkH,UAC5C,EASAxH,EAAoB+B,UAAU0J,SAAW,WACvC,OAAOnL,KAAKG,MAAMP,KACpB,EAWAF,EAAoB+B,UAAUD,eAAiBA,EAM/C9B,EAAoB+B,UAAU2J,QAAU5J,EAOxC9B,EAAoB+B,UAAU4J,QAAU,WACtC,OAAOrL,KAAKG,MAAMmL,cACpB,EA8CA5L,EAAoB+B,UAAU8J,eAAiB,SAAUxG,GACvD,IAAIyG,EAAc,GAElB,GAAIxL,KAAKG,MAAMuK,mBAAmB3F,GACV/E,KAAKG,MAAMsL,0BAA0B1G,GAE3CyB,QAAQ,SAAUkF,GAChCF,EAAYtF,KAAK,CACfL,MAAO6F,EACP1G,KAAM,eAEd,GAE6BhF,KAAKG,MAAMwL,sBAAsB5G,GAEvCyB,QAAQ,SAAUkF,GACnCF,EAAYtF,KAAK,CACfL,MAAO6F,EACP1G,KAAM,WAEd,QACS,GAAIhF,KAAKG,MAAMuE,mBAAmBK,GAAY,CAEjD/E,KAAKG,MAAMyL,0BAA0B7G,GAEhByB,QAAQ,SAAUkF,GACvCF,EAAYtF,KAAK,CACfL,MAAO6F,EACP1G,KAAM,eAEd,EACA,CAEE,IAAI6G,EAAqB7L,KAAKG,MAAMsK,sBAAsB1F,GAY1D,OAVA+G,OAAOC,KAAKF,GAAoBrF,QAAQ,SAAUe,GAChD,IAAI1B,EAAQgG,EAAmBtE,GAE/BiE,EAAYtF,KAAK,CACfL,MAAOA,EACP0B,SAAUA,EACVvC,KAAM,WAEZ,GAESwG,CACT,EAQA9L,EAAoB+B,UAAUuK,qBAAuB,SACnD1E,EACAC,GAEA,OAAOvH,KAAKG,MAAM6L,qBAAqB1E,EAAWC,EACpD,EAOA7H,EAAoB+B,UAAUwK,+BAAiC,SAC7DlH,GAEA,OAAO/E,KAAKG,MAAM8L,+BAA+BlH,EACnD,EAcArF,EAAoB+B,UAAUE,QAAU,SAAU9B,GAChD,IAAIM,EAAQH,KAAKG,MACb+L,EAAS,GACTC,EAAc,GAEbtM,EAAQ+B,yBACXuK,EAAcnN,EAAeyD,YAAYtC,EAAMP,MAAOO,GAEtD+L,EAAOhG,KAAK,CACV/F,MAAOA,EACPiM,aAAcD,EAAYE,OAC1BC,OAAQtM,OAGVA,KAAK2C,KAAK,SAAU,CAClBxC,MAAOA,EACP2C,QAAS9C,KAAKO,eAIlB,IAAIgM,EAAiBvM,KAAKa,eAAe2L,IAAI,SAAUlJ,GACrD,IAAIG,EAAeH,EAAcI,iBAAiBvD,GAC9CsM,EAAsBhJ,EAAa7D,MACnCZ,EAAeyD,YAAYgB,EAAa7D,MAAO6D,GAC/C,GAaJ,OAXAyI,EAAOhG,KAAK,CACV/F,MAAOsD,EACP2I,aAAcK,EAAoBJ,OAClCC,OAAQhJ,IAGVA,EAAcX,KAAK,SAAU,CAC3BxC,MAAOsD,EACPX,QAASQ,EAAc/C,cAGlBkM,CACX,GAEMjK,EAAU8C,MAAM7D,UAAUiL,OAAOzF,MAAMkF,EAAaI,GAEpDI,EAAU3M,KAAKS,WAGnB,GAFAT,KAAKc,qBAEA0B,EAAQ6J,OACX,OAAO9I,QAAQC,QAAQ,CAAEV,QAAS,KAAMF,KACtC5C,KAAK4M,yBAAyBC,KAAK7M,KAAMkM,EAAQS,IAIrD,IACE3M,KAAKL,OACF+B,OAAOc,GACPI,KAAK5C,KAAK4M,yBAAyBC,KAAK7M,KAAMkM,EAAQS,IACtD1J,MAAMjD,KAAK8M,sBAAsBD,KAAK7M,KAAM2M,GACnD,CAAI,MAAOI,GAEP/M,KAAK2C,KAAK,QAAS,CACjBoK,MAAOA,GAEb,CAGA,EAWArN,EAAoB+B,UAAUM,gBAAkB,WAC9C,IAAI5B,EAAQH,KAAKG,MACb+L,EAAS,GAGTK,EAAiBvM,KAAKa,eAAe2L,IAAI,SAAUlJ,GACrD,IAAIG,EAAeH,EAAcI,iBAAiBvD,GAC9CsM,EACFzN,EAAegO,uBAAuBvJ,GAYxC,OAVAyI,EAAOhG,KAAK,CACV/F,MAAOsD,EACP6I,OAAQhJ,IAGVA,EAAcX,KAAK,SAAU,CAC3BxC,MAAOsD,EACPX,QAASQ,EAAc/C,cAGlBkM,CACX,GAEMjK,EAAU8C,MAAM7D,UAAUiL,OAAOzF,MApBnB,GAoBsCsF,GAEpDI,EAAU3M,KAAKS,WAGnB,GAFAT,KAAKc,qBAEA0B,EAAQ6J,OACX,OAAO9I,QAAQC,QAAQ,CAAEV,QAAS,KAAMF,KACtC5C,KAAK4M,yBAAyBC,KAAK7M,KAAMkM,EAAQS,IAIrD,GAAInK,EAAQ6J,OAAS,EACnB,MAAM,IAAIjL,MAAM,uDAGlB,IAAI4C,EAAQxB,EAAQ,GAEpB,IACExC,KAAKL,OACF+B,OAAOsC,GACPpB,KAAK5C,KAAK4M,yBAAyBC,KAAK7M,KAAMkM,EAAQS,IACtD1J,MAAMjD,KAAK8M,sBAAsBD,KAAK7M,KAAM2M,GACnD,CAAI,MAAOI,GAEP/M,KAAK2C,KAAK,QAAS,CACjBoK,MAAOA,GAEb,CAGA,EAEArN,EAAoB+B,UAAUQ,WAAa,WACzC,IAAIgL,EAAcjN,KAAKG,MACnBE,EAAiBL,KAAKK,eACtBT,EAAQI,KAAKmL,WACbe,EAAS,CAAC,CAAE/L,MAAOE,EAAgBT,MAAOA,EAAO0M,OAAQtM,OACzDkN,EAAM7M,EAAeC,OAAOkM,IAAI,SAAUW,GAC5C,OAAOA,EAAMC,IACjB,GAEEpN,KAAK2C,KAAK,QAAS,CACjBX,UAAW,CACT7B,MAAOE,EACPyC,QAAS9C,KAAKQ,wBAIlB,IAAI6M,EAAQrN,KAAKiB,gBAEbsL,EAAiBvM,KAAKa,eAAe2L,IAAI,SAAUlJ,GACrD,IAAIgK,EAAehK,EAAcI,iBAAiBuJ,GAAarN,MAC/D,IAAK0N,EACH,MAAO,GAMT,IAAI7J,EAAeH,EAAciK,0BAC/B,IAAI3O,GAsBN,OApBAsN,EAAOhG,KAAK,CACV/F,MAAOsD,EACP7D,MAAO0N,EACPhB,OAAQhJ,IAGV4J,EAAM5H,MAAM7D,UAAUiL,OAAOzF,MAC3BiG,EACAzJ,EAAanD,OAAOkM,IAAI,SAAUW,GAChC,OAAOA,EAAMC,IACrB,IAGI9J,EAAcX,KAAK,QAAS,CAC1BX,UAAW,CACT7B,MAAOsD,EACPX,QAASQ,EAAc9C,wBAIpBiD,EAAa+J,cAAcF,EAAcD,EACpD,GAEM7K,EAAU8C,MAAM7D,UAAUiL,OAAOzF,MACnCjH,KAAKK,eAAemN,cAAc5N,EAAOyN,GACzCd,GAGF,GAAuB,IAAnB/J,EAAQ6J,OAIZ,GACE7J,EAAQ6J,OAAS,QACyB,IAAnCrM,KAAKL,OAAO8N,mBAGnBrK,QAAQC,KACN,iGANJ,CAWA,IAAIsJ,EAAU3M,KAAKU,oBACnBV,KAAKe,6BAEL,IACEf,KAAKL,OACF8N,mBAAmBjL,GACnBI,KAAK5C,KAAK0N,2BAA2Bb,KAAK7M,KAAM2M,EAAST,EAAQgB,IACjEjK,MAAMjD,KAAK2N,wBAAwBd,KAAK7M,KAAM2M,GACrD,CAAI,MAAOI,GAEP/M,KAAK2C,KAAK,QAAS,CACjBoK,MAAOA,GAEb,CAfA,CAkBA,EAYArN,EAAoB+B,UAAUmL,yBAA2B,SACvDV,EACAS,EACA9J,GAGA,IAAIH,EAAO1C,KAIX,KAAI2M,EAAU3M,KAAKW,sBAAnB,CAKAX,KAAKc,mBAAqB6L,EAAU3M,KAAKW,qBACzCX,KAAKW,qBAAuBgM,EAEG,IAA3B3M,KAAKc,mBAAyBd,KAAK2C,KAAK,oBAE5C,IAAIG,EAAUD,EAAQC,QAAQ8K,QAC1BC,EAAa/B,OAAOC,KAAKlJ,GAAS4C,OAAO,SAAUI,EAAOiI,GAE5D,MADY,YAARA,IAAmBjI,EAAMiI,GAAOjL,EAAQiL,IACrCjI,CACX,EAAK,CAAA,GAECiG,OAAOC,KAAK8B,GAAYxB,QAAU,IACpCwB,OAAaE,GAGf7B,EAAO1F,QAAQ,SAAUwH,GACvB,IAAI7N,EAAQ6N,EAAE7N,MACViM,EAAe4B,EAAE5B,aACjBE,EAAS0B,EAAE1B,OACX2B,OAAmCF,IAAjB3B,EAClBtJ,EAAQoL,OAAO,EAAG9B,GAClBtJ,EAEJ,GAAK3C,EAAMP,MAAX,CASA,GAAIqO,EAAgB5B,OAAS,GAAK4B,EAAgB,GAAGE,OAAQ,CAC3D,IAAIC,EAAQH,EAAgBzB,IAAI,SAAUd,GACxC,IAAI2C,EAAK,IAAIjP,EAAce,EAAO,CAACuL,GAAIhJ,EAAK1B,uBAE5C,YADmB+M,IAAfF,IAA0BQ,EAAGC,YAAcT,GACxCQ,CACf,GACM/B,EAAO/L,YAAc,IAAInB,EACvBe,EACA,CAAC8N,EAAgB,IACjBvL,EAAK1B,uBAEPsL,EAAO/L,YAAY6N,MAAQA,OACRL,IAAfF,IAA0BvB,EAAO/L,YAAY+N,YAAcT,EACrE,MACMvB,EAAO/L,YAAc,IAAInB,EACvBe,EACA8N,EACAvL,EAAK1B,4BAEY+M,IAAfF,IAA0BvB,EAAO/L,YAAY+N,YAAcT,GAGjEvB,EAAO3J,KAAK,SAAU,CACpBG,QAASwJ,EAAO/L,YAChBJ,MAAOA,GA3Bb,MALMmM,EAAO3J,KAAK,SAAU,CACpBG,QAAS,KACT3C,MAAOA,GAgCf,EA5DA,CA6DA,EAEAT,EAAoB+B,UAAUiM,2BAA6B,SACzDf,EACAT,EACAgB,EACArK,GAIA,KAAI8J,EAAU3M,KAAKY,+BAAnB,CAKAZ,KAAKe,4BACH4L,EAAU3M,KAAKY,8BACjBZ,KAAKY,8BAAgC+L,EAEG,IAApC3M,KAAKe,4BAAkCf,KAAK2C,KAAK,uBAErD,IAAI0K,EAAQrN,KAAKiB,gBAEbsN,EAAS,CAAA,EACbrB,EACGsB,OAAO,SAAUtF,GAChB,YAAqB6E,IAAdV,EAAMnE,EACnB,GACK1C,QAAQ,SAAU0C,EAAItJ,GAChB2O,EAAOrF,KAAKqF,EAAOrF,GAAM,IAE9BqF,EAAOrF,GAAIhD,KAAKtG,EACtB,GAEEkM,OAAOC,KAAKwC,GAAQ/H,QAAQ,SAAU0C,GACpC,IAAIuF,EAAUF,EAAOrF,GACjBwF,EAAc7L,EAAQC,QAAQ2L,EAAQ,IACnB,IAAnBA,EAAQpC,OAIZgB,EAAMnE,GAAM4C,OAAO6C,OAAO,CAAA,EAAID,EAAa,CACzCE,KAAMtP,EACJ4N,EACAuB,EAAQjC,IAAI,SAAUqC,GACpB,OAAOhM,EAAQC,QAAQ+L,GAAKD,IACtC,MARMvB,EAAMnE,GAAMwF,CAWlB,GAEE,IAAI5L,EAAU,CAAA,EACdoK,EAAI1G,QAAQ,SAAU0C,GACpBpG,EAAQoG,GAAMmE,EAAMnE,EACxB,GAEEgD,EAAO1F,QAAQ,SAAUwH,GACvB,IAAI7N,EAAQ6N,EAAE7N,MACVmM,EAAS0B,EAAE1B,OAEV0B,EAAEpO,OAUP0M,EAAO9L,qBAAuB,IAAI1B,EAAiBqB,EAAO2C,GAI1DwJ,EAAO3J,KAAK,mBAAoB,CAC9BX,UAAW,CACTc,QAASwJ,EAAO9L,qBAChBL,MAAOA,MAdTmM,EAAO3J,KAAK,mBAAoB,CAC9BG,QAAS,KACT3C,MAAOA,GAef,EAnEA,CAoEA,EAEAT,EAAoB+B,UAAUqL,sBAAwB,SACpDH,EACAI,GAEIJ,EAAU3M,KAAKW,uBAKnBX,KAAKc,mBAAqB6L,EAAU3M,KAAKW,qBACzCX,KAAKW,qBAAuBgM,EAE5B3M,KAAK2C,KAAK,QAAS,CACjBoK,MAAOA,IAGsB,IAA3B/M,KAAKc,mBAAyBd,KAAK2C,KAAK,oBAC9C,EAEAjD,EAAoB+B,UAAUkM,wBAA0B,SACtDhB,EACAI,GAEIJ,EAAU3M,KAAKY,gCAKnBZ,KAAKe,4BACH4L,EAAU3M,KAAKY,8BACjBZ,KAAKY,8BAAgC+L,EAErC3M,KAAK2C,KAAK,QAAS,CACjBoK,MAAOA,IAG+B,IAApC/M,KAAKe,4BAAkCf,KAAK2C,KAAK,uBACvD,EAEAjD,EAAoB+B,UAAUqN,mBAAqB,SACjD9K,EACA+K,EACAC,EACAC,GAEA,OACEjL,GACwB,IAAxB+K,EAAa1C,QACa,IAA1B2C,EAAe3C,QACO,IAAtB4C,EAAW5C,MAEf,EAQA3M,EAAoB+B,UAAUyN,2BAA6B,SAAU/K,GACnE,OACEnE,KAAKG,MAAMgP,uBAAuBhL,IAClCnE,KAAKG,MAAMgP,uBAAuBhL,GAAOkI,OAAS,CAEtD,EAEA3M,EAAoB+B,UAAUJ,QAAU,SAAU+N,GAChD,IAAIjP,EAAQiP,EAAMjP,MACdoB,EAAc6N,EAAM7N,YAEpBpB,IAAUH,KAAKG,QACjBH,KAAKG,MAAQA,EAEbH,KAAK2C,KAAK,SAAU,CAClBxC,MAAOH,KAAKG,MACZ2C,QAAS9C,KAAKO,YACdgB,YAAaA,IAGnB,EAEA7B,EAAoB+B,UAAUwG,iBAAmB,SAAUmH,GACzD,IAAIjP,EAAQiP,EAAMjP,MAEdA,IAAUH,KAAKK,iBACjBL,KAAKK,eAAiBF,EAItBH,KAAK2C,KAAK,mBAAoB,CAC5BjB,OAAQ,CACNoB,QAAS9C,KAAKO,YACdJ,MAAOH,KAAKG,OAEd6B,UAAW,CACTc,QAAS9C,KAAKQ,qBACdL,MAAOH,KAAKK,kBAIpB,EAMAX,EAAoB+B,UAAU4N,WAAa,WAEzC,OADIrP,KAAKL,OAAO0P,YAAYrP,KAAKL,OAAO0P,aACjCrP,IACT,EAQAN,EAAoB+B,UAAUxB,UAAY,SAAUqP,GAClD,OAAItP,KAAKL,SAAW2P,IAEqB,mBAA9BA,EAAUvP,iBACnBuP,EAAUvP,gBAAgB,cAAgBP,EAAU,KAEtDQ,KAAKL,OAAS2P,GALwBtP,IAQxC,EAMAN,EAAoB+B,UAAU8N,UAAY,WACxC,OAAOvP,KAAKL,MACd,EAsBAD,EAAoB+B,UAAU+N,OAAS,SAAUC,EAAIC,GACnD,IAAIpM,EAAgB,IAAItF,EAAcgC,KAAMyP,EAAIC,GAEhD,OADA1P,KAAKa,eAAeqF,KAAK5C,GAClBA,CACT,EAUA5D,EAAoB+B,UAAUkO,oBAAsB,SAAUrM,GAC5D,IAAIsM,EAAM5P,KAAKa,eAAe+E,QAAQtC,GACtC,IAAY,IAARsM,EAAY,MAAM,IAAIxO,MAAM,mCAChCpB,KAAKa,eAAeqN,OAAO0B,EAAK,EAClC,EAMAlQ,EAAoB+B,UAAUoO,mBAAqB,WACjD,OAAO7P,KAAKc,kBAAoB,CAClC,EAkBAgP,EAAiBpQ","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/compact.js

@@ -0,0 +1,2 @@
+var r,e;function n(){return e?r:(e=1,r=function(r){return Array.isArray(r)?r.filter(Boolean):[]})}export{n as __require};
+//# sourceMappingURL=compact.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/compact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compact.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/compact.js"],"sourcesContent":["'use strict';\n\nmodule.exports = function compact(array) {\n  if (!Array.isArray(array)) {\n    return [];\n  }\n\n  return array.filter(Boolean);\n};\n"],"names":["compact","array","Array","isArray","filter","Boolean"],"mappings":"qCAEAA,EAAiB,SAAiBC,GAChC,OAAKC,MAAMC,QAAQF,GAIZA,EAAMG,OAAOC,SAHX,EAIX","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/defaultsPure.js

@@ -0,0 +1,2 @@
+var e,r;function t(){return r||(r=1,e=function(){return Array.prototype.slice.call(arguments).reduceRight(function(e,r){return Object.keys(Object(r)).forEach(function(t){void 0!==r[t]&&(void 0!==e[t]&&delete e[t],e[t]=r[t])}),e},{})}),e}export{t as __require};
+//# sourceMappingURL=defaultsPure.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/defaultsPure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaultsPure.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/defaultsPure.js"],"sourcesContent":["'use strict';\n\n// NOTE: this behaves like lodash/defaults, but doesn't mutate the target\n// it also preserve keys order\nmodule.exports = function defaultsPure() {\n  var sources = Array.prototype.slice.call(arguments);\n\n  return sources.reduceRight(function (acc, source) {\n    Object.keys(Object(source)).forEach(function (key) {\n      if (source[key] === undefined) {\n        return;\n      }\n      if (acc[key] !== undefined) {\n        // remove if already added, so that we can add it in correct order\n        delete acc[key];\n      }\n      acc[key] = source[key];\n    });\n    return acc;\n  }, {});\n};\n"],"names":["defaultsPure","Array","prototype","slice","call","arguments","reduceRight","acc","source","Object","keys","forEach","key","undefined"],"mappings":"oCAIAA,EAAiB,WAGf,OAFcC,MAAMC,UAAUC,MAAMC,KAAKC,WAE1BC,YAAY,SAAUC,EAAKC,GAWxC,OAVAC,OAAOC,KAAKD,OAAOD,IAASG,QAAQ,SAAUC,QACxBC,IAAhBL,EAAOI,UAGMC,IAAbN,EAAIK,WAECL,EAAIK,GAEbL,EAAIK,GAAOJ,EAAOI,GACxB,GACWL,CACX,EAAK,CAAA,EACL","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/escapeFacetValue.js

@@ -0,0 +1,2 @@
+var e,r;function t(){if(r)return e;return r=1,e={escapeFacetValue:function(e){return"string"!=typeof e?e:String(e).replace(/^-/,"\\-")},unescapeFacetValue:function(e){return"string"!=typeof e?e:e.replace(/^\\-/,"-")}}}export{t as __require};
+//# sourceMappingURL=escapeFacetValue.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/escapeFacetValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"escapeFacetValue.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/escapeFacetValue.js"],"sourcesContent":["'use strict';\n\n/**\n * Replaces a leading - with \\-\n * @private\n * @param {any} value the facet value to replace\n * @returns {any} the escaped facet value or the value if it was not a string\n */\nfunction escapeFacetValue(value) {\n  if (typeof value !== 'string') return value;\n\n  return String(value).replace(/^-/, '\\\\-');\n}\n\n/**\n * Replaces a leading \\- with -\n * @private\n * @param {any} value the escaped facet value\n * @returns {any} the unescaped facet value or the value if it was not a string\n */\nfunction unescapeFacetValue(value) {\n  if (typeof value !== 'string') return value;\n\n  return value.replace(/^\\\\-/, '-');\n}\n\nmodule.exports = {\n  escapeFacetValue: escapeFacetValue,\n  unescapeFacetValue: unescapeFacetValue,\n};\n"],"names":["escapeFacetValue_1","escapeFacetValue","value","String","replace","unescapeFacetValue"],"mappings":"8CA0BAA,EAAiB,CACfC,iBAnBF,SAA0BC,GACxB,MAAqB,iBAAVA,EAA2BA,EAE/BC,OAAOD,GAAOE,QAAQ,KAAM,MACrC,EAgBEC,mBARF,SAA4BH,GAC1B,MAAqB,iBAAVA,EAA2BA,EAE/BA,EAAME,QAAQ,OAAQ,IAC/B","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/find.js

@@ -0,0 +1,2 @@
+var r,n;function e(){return n?r:(n=1,r=function(r,n){if(Array.isArray(r))for(var e=0;e<r.length;e++)if(n(r[e]))return r[e]})}export{e as __require};
+//# sourceMappingURL=find.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/find.js"],"sourcesContent":["'use strict';\n\n// @MAJOR can be replaced by native Array#find when we change support\nmodule.exports = function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return undefined;\n  }\n\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return array[i];\n    }\n  }\n\n  return undefined;\n};\n"],"names":["find","array","comparator","Array","isArray","i","length"],"mappings":"qCAGAA,EAAiB,SAAcC,EAAOC,GACpC,GAAKC,MAAMC,QAAQH,GAInB,IAAK,IAAII,EAAI,EAAGA,EAAIJ,EAAMK,OAAQD,IAChC,GAAIH,EAAWD,EAAMI,IACnB,OAAOJ,EAAMI,EAKnB","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/findIndex.js

@@ -0,0 +1,2 @@
+var r,n;function e(){return n?r:(n=1,r=function(r,n){if(!Array.isArray(r))return-1;for(var e=0;e<r.length;e++)if(n(r[e]))return e;return-1})}export{e as __require};
+//# sourceMappingURL=findIndex.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/findIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findIndex.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/findIndex.js"],"sourcesContent":["'use strict';\n\n// @MAJOR can be replaced by native Array#findIndex when we change support\nmodule.exports = function find(array, comparator) {\n  if (!Array.isArray(array)) {\n    return -1;\n  }\n\n  for (var i = 0; i < array.length; i++) {\n    if (comparator(array[i])) {\n      return i;\n    }\n  }\n  return -1;\n};\n"],"names":["findIndex","array","comparator","Array","isArray","i","length"],"mappings":"qCAGAA,EAAiB,SAAcC,EAAOC,GACpC,IAAKC,MAAMC,QAAQH,GACjB,OAAO,EAGT,IAAK,IAAII,EAAI,EAAGA,EAAIJ,EAAMK,OAAQD,IAChC,GAAIH,EAAWD,EAAMI,IACnB,OAAOA,EAGX,OAAO,CACT","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/flat.js

@@ -0,0 +1,2 @@
+var r,n;function e(){return n?r:(n=1,r=function(r){return r.reduce(function(r,n){return r.concat(n)},[])})}export{e as __require};
+//# sourceMappingURL=flat.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/flat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/flat.js"],"sourcesContent":["// @MAJOR: remove this function and use Array.prototype.flat\nmodule.exports = function flat(arr) {\n  return arr.reduce(function (acc, val) {\n    return acc.concat(val);\n  }, []);\n};\n"],"names":["flat","arr","reduce","acc","val","concat"],"mappings":"qCACAA,EAAiB,SAAcC,GAC7B,OAAOA,EAAIC,OAAO,SAAUC,EAAKC,GAC/B,OAAOD,EAAIE,OAAOD,EACtB,EAAK,GACL","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/formatSort.js

@@ -0,0 +1,2 @@
+import{__require as r}from"./find.js";var n,u;function t(){if(u)return n;u=1;var t=r();return n=function(r,n){var u=(n||[]).map(function(r){return r.split(":")});return r.reduce(function(r,n){var e=n.split(":"),i=t(u,function(r){return r[0]===e[0]});return e.length>1||!i?(r[0].push(e[0]),r[1].push(e[1]),r):(r[0].push(i[0]),r[1].push(i[1]),r)},[[],[]])}}export{t as __require};
+//# sourceMappingURL=formatSort.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/formatSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formatSort.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/formatSort.js"],"sourcesContent":["'use strict';\n\nvar find = require('./find');\n\n/**\n * Transform sort format from user friendly notation to lodash format\n * @param {string[]} sortBy array of predicate of the form \"attribute:order\"\n * @param {string[]} [defaults] array of predicate of the form \"attribute:order\"\n * @return {array.<string[]>} array containing 2 elements : attributes, orders\n */\nmodule.exports = function formatSort(sortBy, defaults) {\n  var defaultInstructions = (defaults || []).map(function (sort) {\n    return sort.split(':');\n  });\n\n  return sortBy.reduce(\n    function preparePredicate(out, sort) {\n      var sortInstruction = sort.split(':');\n\n      var matchingDefault = find(\n        defaultInstructions,\n        function (defaultInstruction) {\n          return defaultInstruction[0] === sortInstruction[0];\n        }\n      );\n\n      if (sortInstruction.length > 1 || !matchingDefault) {\n        out[0].push(sortInstruction[0]);\n        out[1].push(sortInstruction[1]);\n        return out;\n      }\n\n      out[0].push(matchingDefault[0]);\n      out[1].push(matchingDefault[1]);\n      return out;\n    },\n    [[], []]\n  );\n};\n"],"names":["find","require$$0","formatSort","sortBy","defaults","defaultInstructions","map","sort","split","reduce","out","sortInstruction","matchingDefault","defaultInstruction","length","push"],"mappings":"6EAEA,IAAIA,EAAOC,WAQXC,EAAiB,SAAoBC,EAAQC,GAC3C,IAAIC,GAAuBD,GAAY,IAAIE,IAAI,SAAUC,GACvD,OAAOA,EAAKC,MAAM,IACtB,GAEE,OAAOL,EAAOM,OACZ,SAA0BC,EAAKH,GAC7B,IAAII,EAAkBJ,EAAKC,MAAM,KAE7BI,EAAkBZ,EACpBK,EACA,SAAUQ,GACR,OAAOA,EAAmB,KAAOF,EAAgB,EAC3D,GAGM,OAAIA,EAAgBG,OAAS,IAAMF,GACjCF,EAAI,GAAGK,KAAKJ,EAAgB,IAC5BD,EAAI,GAAGK,KAAKJ,EAAgB,IACrBD,IAGTA,EAAI,GAAGK,KAAKH,EAAgB,IAC5BF,EAAI,GAAGK,KAAKH,EAAgB,IACrBF,EACb,EACI,CAAC,GAAI,IAET","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/inherits.js

@@ -0,0 +1,2 @@
+var e,r;function t(){if(r)return e;return r=1,e=function(e,r){e.prototype=Object.create(r.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}})}}export{t as __require};
+//# sourceMappingURL=inherits.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/inherits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inherits.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/inherits.js"],"sourcesContent":["'use strict';\n\nfunction inherits(ctor, superCtor) {\n  ctor.prototype = Object.create(superCtor.prototype, {\n    constructor: {\n      value: ctor,\n      enumerable: false,\n      writable: true,\n      configurable: true,\n    },\n  });\n}\n\nmodule.exports = inherits;\n"],"names":["inherits_1","ctor","superCtor","prototype","Object","create","constructor","value","enumerable","writable","configurable"],"mappings":"8CAaAA,EAXA,SAAkBC,EAAMC,GACtBD,EAAKE,UAAYC,OAAOC,OAAOH,EAAUC,UAAW,CAClDG,YAAa,CACXC,MAAON,EACPO,YAAY,EACZC,UAAU,EACVC,cAAc,IAGpB","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/intersection.js

@@ -0,0 +1,2 @@
+var r,n;function e(){if(n)return r;return n=1,r=function(r,n){return r.filter(function(e,t){return n.indexOf(e)>-1&&r.indexOf(e)===t})}}export{e as __require};
+//# sourceMappingURL=intersection.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/intersection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/intersection.js"],"sourcesContent":["'use strict';\n\nfunction intersection(arr1, arr2) {\n  return arr1.filter(function (value, index) {\n    return (\n      arr2.indexOf(value) > -1 &&\n      arr1.indexOf(value) === index /* skips duplicates */\n    );\n  });\n}\n\nmodule.exports = intersection;\n"],"names":["intersection_1","arr1","arr2","filter","value","index","indexOf"],"mappings":"8CAWAA,EATA,SAAsBC,EAAMC,GAC1B,OAAOD,EAAKE,OAAO,SAAUC,EAAOC,GAClC,OACEH,EAAKI,QAAQF,IAAS,GACtBH,EAAKK,QAAQF,KAAWC,CAE9B,EACA","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/merge.js

@@ -0,0 +1,2 @@
+var r,t;function n(){if(t)return r;function n(r){return"object"==typeof r&&null!==r?e(Array.isArray(r)?[]:{},r):r}function o(r){return"function"==typeof r||Array.isArray(r)||"[object Object]"===Object.prototype.toString.call(r)}function e(r,t){if(r===t)return r;for(var i in t)if(Object.prototype.hasOwnProperty.call(t,i)&&"__proto__"!==i&&"constructor"!==i){var u=t[i],c=r[i];void 0!==c&&void 0===u||(o(c)&&o(u)?r[i]=e(c,u):r[i]=n(u))}return r}return t=1,r=function(r){o(r)||(r={});for(var t=1,n=arguments.length;t<n;t++){var i=arguments[t];o(i)&&e(r,i)}return r},r}export{n as __require};
+//# sourceMappingURL=merge.js.map

package/dist/esm/node_modules/algoliasearch-helper/src/functions/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sources":["../../../../../../node_modules/algoliasearch-helper/src/functions/merge.js"],"sourcesContent":["'use strict';\n\nfunction clone(value) {\n  if (typeof value === 'object' && value !== null) {\n    return _merge(Array.isArray(value) ? [] : {}, value);\n  }\n  return value;\n}\n\nfunction isObjectOrArrayOrFunction(value) {\n  return (\n    typeof value === 'function' ||\n    Array.isArray(value) ||\n    Object.prototype.toString.call(value) === '[object Object]'\n  );\n}\n\nfunction _merge(target, source) {\n  if (target === source) {\n    return target;\n  }\n\n  // eslint-disable-next-line instantsearch/no-for-in\n  for (var key in source) {\n    if (\n      !Object.prototype.hasOwnProperty.call(source, key) ||\n      key === '__proto__' ||\n      key === 'constructor'\n    ) {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n\n    var sourceVal = source[key];\n    var targetVal = target[key];\n\n    if (typeof targetVal !== 'undefined' && typeof sourceVal === 'undefined') {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n\n    if (\n      isObjectOrArrayOrFunction(targetVal) &&\n      isObjectOrArrayOrFunction(sourceVal)\n    ) {\n      target[key] = _merge(targetVal, sourceVal);\n    } else {\n      target[key] = clone(sourceVal);\n    }\n  }\n  return target;\n}\n\n/**\n * This method is like Object.assign, but recursively merges own and inherited\n * enumerable keyed properties of source objects into the destination object.\n *\n * NOTE: this behaves like lodash/merge, but:\n * - does mutate functions if they are a source\n * - treats non-plain objects as plain\n * - does not work for circular objects\n * - treats sparse arrays as sparse\n * - does not convert Array-like objects (Arguments, NodeLists, etc.) to arrays\n *\n * @param {Object} target The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n */\nfunction merge(target) {\n  if (!isObjectOrArrayOrFunction(target)) {\n    target = {};\n  }\n\n  for (var i = 1, l = arguments.length; i < l; i++) {\n    var source = arguments[i];\n\n    if (isObjectOrArrayOrFunction(source)) {\n      _merge(target, source);\n    }\n  }\n  return target;\n}\n\nmodule.exports = merge;\n"],"names":["clone","value","_merge","Array","isArray","isObjectOrArrayOrFunction","Object","prototype","toString","call","target","source","key","hasOwnProperty","sourceVal","targetVal","merge_1","i","l","arguments","length"],"mappings":"mCAEA,SAASA,EAAMC,GACb,MAAqB,iBAAVA,GAAgC,OAAVA,EACxBC,EAAOC,MAAMC,QAAQH,GAAS,GAAK,CAAA,EAAIA,GAEzCA,CACT,CAEA,SAASI,EAA0BJ,GACjC,MACmB,mBAAVA,GACPE,MAAMC,QAAQH,IAC4B,oBAA1CK,OAAOC,UAAUC,SAASC,KAAKR,EAEnC,CAEA,SAASC,EAAOQ,EAAQC,GACtB,GAAID,IAAWC,EACb,OAAOD,EAIT,IAAK,IAAIE,KAAOD,EACd,GACGL,OAAOC,UAAUM,eAAeJ,KAAKE,EAAQC,IACtC,cAARA,GACQ,gBAARA,EAHF,CASA,IAAIE,EAAYH,EAAOC,GACnBG,EAAYL,EAAOE,QAEE,IAAdG,QAAkD,IAAdD,IAM7CT,EAA0BU,IAC1BV,EAA0BS,GAE1BJ,EAAOE,GAAOV,EAAOa,EAAWD,GAEhCJ,EAAOE,GAAOZ,EAAMc,GAhB1B,CAmBE,OAAOJ,CACT,YAgCAM,EAfA,SAAeN,GACRL,EAA0BK,KAC7BA,EAAS,CAAA,GAGX,IAAK,IAAIO,EAAI,EAAGC,EAAIC,UAAUC,OAAQH,EAAIC,EAAGD,IAAK,CAChD,IAAIN,EAASQ,UAAUF,GAEnBZ,EAA0BM,IAC5BT,EAAOQ,EAAQC,EAErB,CACE,OAAOD,CACT","x_google_ignoreList":[0]}

package/dist/esm/node_modules/algoliasearch-helper/src/functions/mergeNumericMax.js

@@ -0,0 +1,2 @@
+var e,r;function t(){if(r)return e;return r=1,e=function(){return Array.prototype.slice.call(arguments).reduceRight(function(e,r){return Object.keys(Object(r)).forEach(function(t){var n="number"==typeof e[t]?e[t]:0,o=r[t];void 0!==o&&o>=n&&(void 0!==e[t]&&delete e[t],e[t]=o)}),e},{})},e}export{t as __require};
+//# sourceMappingURL=mergeNumericMax.js.map