{"version":3,"sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap 5d4776140a8b2573e895","webpack:///./src/helpers/is_array.js","webpack:///./src/bitap/index.js","webpack:///./src/helpers/deep_value.js","webpack:///./src/bitap/bitap_matched_indices.js","webpack:///./src/bitap/bitap_pattern_alphabet.js","webpack:///./src/bitap/bitap_regex_search.js","webpack:///./src/bitap/bitap_score.js","webpack:///./src/bitap/bitap_search.js","webpack:///./src/index.js"],"names":["module","exports","obj","Object","prototype","toString","call","bitapRegexSearch","require","bitapSearch","patternAlphabet","Bitap","pattern","location","distance","threshold","maxPatternLength","isCaseSensitive","tokenSeparator","findAllMatches","minMatchCharLength","options","toLowerCase","length","text","isMatch","score","matchedIndices","isArray","deepValue","path","list","push","dotIndex","indexOf","firstSegment","remaining","slice","value","undefined","i","len","matchmask","start","end","match","mask","charAt","matches","RegExp","replace","matchesLen","isMatched","errors","currentLocation","expectedLocation","accuracy","proximity","Math","abs","bitapScore","textLen","currentThreshold","bestLocation","patternLen","matchMask","min","lastIndexOf","lastBitArr","finalScore","binMax","locations","binMin","binMid","floor","max","finish","bitArr","Array","j","charMatch","Fuse","caseSensitive","id","keys","shouldSort","getFn","sortFn","a","b","tokenize","matchAllTokens","includeMatches","includeScore","verbose","set","_log","_prepareSearchers","tokenSearchers","fullSearcher","_search","weights","results","_computeScore","_sort","_format","tokens","split","resultMap","_analyze","key","record","index","item","keysLen","name","weight","Error","exists","averageScore","numTextMatches","mainSearchResult","search","words","scores","tokenSearcher","hasMatchInText","word","tokenSearchResult","scoresLen","checkTextMatches","existingResult","output","scoreLen","totalScore","bestScore","nScore","sort","finalOutput","transformers","result","data","indices","log","arguments"],"mappings":";;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;ACVA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA,mDAA2C,cAAc;;AAEzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAK;AACL;AACA;;AAEA;AACA;AACA;AACA,mCAA2B,0BAA0B,EAAE;AACvD,yCAAiC,eAAe;AAChD;AACA;AACA;;AAEA;AACA,8DAAsD,+DAA+D;;AAErH;AACA;;AAEA;AACA;;;;;;;;;;AChEAA,OAAOC,OAAP,GAAiB,UAACC,GAAD,EAAS;AACxB,SAAOC,OAAOC,SAAP,CAAiBC,QAAjB,CAA0BC,IAA1B,CAA+BJ,GAA/B,MAAwC,gBAA/C;AACD,CAFD,C;;;;;;;;;;;;;ACAA,IAAMK,mBAAmB,mBAAAC,CAAQ,CAAR,CAAzB;AACA,IAAMC,cAAc,mBAAAD,CAAQ,CAAR,CAApB;AACA,IAAME,kBAAkB,mBAAAF,CAAQ,CAAR,CAAxB;;IAEMG,K;AACJ,iBAAaC,OAAb,QAuBG;AAAA,6BArBDC,QAqBC;AAAA,QArBDA,QAqBC,iCArBU,CAqBV;AAAA,6BAfDC,QAeC;AAAA,QAfDA,QAeC,iCAfU,GAeV;AAAA,8BAZDC,SAYC;AAAA,QAZDA,SAYC,kCAZW,GAYX;AAAA,qCAVDC,gBAUC;AAAA,QAVDA,gBAUC,yCAVkB,EAUlB;AAAA,oCARDC,eAQC;AAAA,QARDA,eAQC,wCARiB,KAQjB;AAAA,mCANDC,cAMC;AAAA,QANDA,cAMC,uCANgB,KAMhB;AAAA,mCAHDC,cAGC;AAAA,QAHDA,cAGC,uCAHgB,KAGhB;AAAA,qCADDC,kBACC;AAAA,QADDA,kBACC,yCADoB,CACpB;;AAAA;;AACD,SAAKC,OAAL,GAAe;AACbR,wBADa;AAEbC,wBAFa;AAGbC,0BAHa;AAIbC,wCAJa;AAKbC,sCALa;AAMbC,oCANa;AAObC,oCAPa;AAQbC;AARa,KAAf;;AAWA,SAAKR,OAAL,GAAe,KAAKS,OAAL,CAAaJ,eAAb,GAA+BL,OAA/B,GAAyCA,QAAQU,WAAR,EAAxD;;AAEA,QAAI,KAAKV,OAAL,CAAaW,MAAb,IAAuBP,gBAA3B,EAA6C;AAC3C,WAAKN,eAAL,GAAuBA,gBAAgB,KAAKE,OAArB,CAAvB;AACD;AACF;;;;2BAEOY,I,EAAM;AACZ,UAAI,CAAC,KAAKH,OAAL,CAAaJ,eAAlB,EAAmC;AACjCO,eAAOA,KAAKF,WAAL,EAAP;AACD;;AAED;AACA,UAAI,KAAKV,OAAL,KAAiBY,IAArB,EAA2B;AACzB,eAAO;AACLC,mBAAS,IADJ;AAELC,iBAAO,CAFF;AAGLC,0BAAgB,CAAC,CAAC,CAAD,EAAIH,KAAKD,MAAL,GAAc,CAAlB,CAAD;AAHX,SAAP;AAKD;;AAED;AAdY,qBAeiC,KAAKF,OAftC;AAAA,UAeJL,gBAfI,YAeJA,gBAfI;AAAA,UAecE,cAfd,YAecA,cAfd;;AAgBZ,UAAI,KAAKN,OAAL,CAAaW,MAAb,GAAsBP,gBAA1B,EAA4C;AAC1C,eAAOT,iBAAiBiB,IAAjB,EAAuB,KAAKZ,OAA5B,EAAqCM,cAArC,CAAP;AACD;;AAED;AApBY,sBAqBkE,KAAKG,OArBvE;AAAA,UAqBJR,QArBI,aAqBJA,QArBI;AAAA,UAqBMC,QArBN,aAqBMA,QArBN;AAAA,UAqBgBC,SArBhB,aAqBgBA,SArBhB;AAAA,UAqB2BI,cArB3B,aAqB2BA,cArB3B;AAAA,UAqB2CC,kBArB3C,aAqB2CA,kBArB3C;;AAsBZ,aAAOX,YAAYe,IAAZ,EAAkB,KAAKZ,OAAvB,EAAgC,KAAKF,eAArC,EAAsD;AAC3DG,0BAD2D;AAE3DC,0BAF2D;AAG3DC,4BAH2D;AAI3DI,sCAJ2D;AAK3DC;AAL2D,OAAtD,CAAP;AAOD;;;;;;AAGHpB,OAAOC,OAAP,GAAiBU,KAAjB,C;;;;;;;;;AC/EA,IAAMiB,UAAU,mBAAApB,CAAQ,CAAR,CAAhB;;AAEA,IAAMqB,YAAY,SAAZA,SAAY,CAAC3B,GAAD,EAAM4B,IAAN,EAAYC,IAAZ,EAAqB;AACrC,MAAI,CAACD,IAAL,EAAW;AACT;AACAC,SAAKC,IAAL,CAAU9B,GAAV;AACD,GAHD,MAGO;AACL,QAAM+B,WAAWH,KAAKI,OAAL,CAAa,GAAb,CAAjB;AACA,QAAIC,eAAeL,IAAnB;AACA,QAAIM,YAAY,IAAhB;;AAEA,QAAIH,aAAa,CAAC,CAAlB,EAAqB;AACnBE,qBAAeL,KAAKO,KAAL,CAAW,CAAX,EAAcJ,QAAd,CAAf;AACAG,kBAAYN,KAAKO,KAAL,CAAWJ,WAAW,CAAtB,CAAZ;AACD;;AAED,QAAMK,QAAQpC,IAAIiC,YAAJ,CAAd;;AAEA,QAAIG,UAAU,IAAV,IAAkBA,UAAUC,SAAhC,EAA2C;AACzC,UAAI,CAACH,SAAD,KAAe,OAAOE,KAAP,KAAiB,QAAjB,IAA6B,OAAOA,KAAP,KAAiB,QAA7D,CAAJ,EAA4E;AAC1EP,aAAKC,IAAL,CAAUM,KAAV;AACD,OAFD,MAEO,IAAIV,QAAQU,KAAR,CAAJ,EAAoB;AACzB;AACA,aAAK,IAAIE,IAAI,CAAR,EAAWC,MAAMH,MAAMf,MAA5B,EAAoCiB,IAAIC,GAAxC,EAA6CD,KAAK,CAAlD,EAAqD;AACnDX,oBAAUS,MAAME,CAAN,CAAV,EAAoBJ,SAApB,EAA+BL,IAA/B;AACD;AACF,OALM,MAKA,IAAIK,SAAJ,EAAe;AACpB;AACAP,kBAAUS,KAAV,EAAiBF,SAAjB,EAA4BL,IAA5B;AACD;AACF;AACF;;AAED,SAAOA,IAAP;AACD,CAhCD;;AAkCA/B,OAAOC,OAAP,GAAiB,UAACC,GAAD,EAAM4B,IAAN,EAAe;AAC9B,SAAOD,UAAU3B,GAAV,EAAe4B,IAAf,EAAqB,EAArB,CAAP;AACD,CAFD,C;;;;;;;;;ACpCA9B,OAAOC,OAAP,GAAiB,YAA4C;AAAA,MAA3CyC,SAA2C,uEAA/B,EAA+B;AAAA,MAA3BtB,kBAA2B,uEAAN,CAAM;;AAC3D,MAAIO,iBAAiB,EAArB;AACA,MAAIgB,QAAQ,CAAC,CAAb;AACA,MAAIC,MAAM,CAAC,CAAX;AACA,MAAIJ,IAAI,CAAR;;AAEA,OAAK,IAAIC,MAAMC,UAAUnB,MAAzB,EAAiCiB,IAAIC,GAArC,EAA0CD,KAAK,CAA/C,EAAkD;AAChD,QAAIK,QAAQH,UAAUF,CAAV,CAAZ;AACA,QAAIK,SAASF,UAAU,CAAC,CAAxB,EAA2B;AACzBA,cAAQH,CAAR;AACD,KAFD,MAEO,IAAI,CAACK,KAAD,IAAUF,UAAU,CAAC,CAAzB,EAA4B;AACjCC,YAAMJ,IAAI,CAAV;AACA,UAAKI,MAAMD,KAAP,GAAgB,CAAhB,IAAqBvB,kBAAzB,EAA6C;AAC3CO,uBAAeK,IAAf,CAAoB,CAACW,KAAD,EAAQC,GAAR,CAApB;AACD;AACDD,cAAQ,CAAC,CAAT;AACD;AACF;;AAED;AACA,MAAID,UAAUF,IAAI,CAAd,KAAqBA,IAAIG,KAAL,IAAevB,kBAAvC,EAA2D;AACzDO,mBAAeK,IAAf,CAAoB,CAACW,KAAD,EAAQH,IAAI,CAAZ,CAApB;AACD;;AAED,SAAOb,cAAP;AACD,CAzBD,C;;;;;;;;;ACAA3B,OAAOC,OAAP,GAAiB,UAACW,OAAD,EAAa;AAC5B,MAAIkC,OAAO,EAAX;AACA,MAAIL,MAAM7B,QAAQW,MAAlB;;AAEA,OAAK,IAAIiB,IAAI,CAAb,EAAgBA,IAAIC,GAApB,EAAyBD,KAAK,CAA9B,EAAiC;AAC/BM,SAAKlC,QAAQmC,MAAR,CAAeP,CAAf,CAAL,IAA0B,CAA1B;AACD;;AAED,OAAK,IAAIA,KAAI,CAAb,EAAgBA,KAAIC,GAApB,EAAyBD,MAAK,CAA9B,EAAiC;AAC/BM,SAAKlC,QAAQmC,MAAR,CAAeP,EAAf,CAAL,KAA2B,KAAMC,MAAMD,EAAN,GAAU,CAA3C;AACD;;AAED,SAAOM,IAAP;AACD,CAbD,C;;;;;;;;;ACAA9C,OAAOC,OAAP,GAAiB,UAACuB,IAAD,EAAOZ,OAAP,EAA2C;AAAA,MAA3BM,cAA2B,uEAAV,KAAU;;AAC1D,MAAI8B,UAAUxB,KAAKqB,KAAL,CAAW,IAAII,MAAJ,CAAWrC,QAAQsC,OAAR,CAAgBhC,cAAhB,EAAgC,GAAhC,CAAX,CAAX,CAAd;AACA,MAAIO,UAAU,CAAC,CAACuB,OAAhB;AACA,MAAIrB,iBAAiB,EAArB;;AAEA,MAAIF,OAAJ,EAAa;AACX,SAAKe,IAAI,CAAJ,EAAOW,aAAaH,QAAQzB,MAAjC,EAAyCiB,IAAIW,UAA7C,EAAyDX,KAAK,CAA9D,EAAiE;AAC/DK,cAAQG,QAAQR,CAAR,CAAR;AACAb,qBAAeK,IAAf,CAAoB,CAACR,KAAKU,OAAL,CAAaW,KAAb,CAAD,EAAsBA,MAAMtB,MAAN,GAAe,CAArC,CAApB;AACD;AACF;;AAED,SAAO;AACL;AACAG,WAAO0B,YAAY,GAAZ,GAAkB,CAFpB;AAGL3B,oBAHK;AAILE;AAJK,GAAP;AAMD,CAlBD,C;;;;;;;;;ACAA3B,OAAOC,OAAP,GAAiB,UAACW,OAAD,QAAwF;AAAA,yBAA5EyC,MAA4E;AAAA,MAA5EA,MAA4E,+BAAnE,CAAmE;AAAA,kCAAhEC,eAAgE;AAAA,MAAhEA,eAAgE,wCAA9C,CAA8C;AAAA,mCAA3CC,gBAA2C;AAAA,MAA3CA,gBAA2C,yCAAxB,CAAwB;AAAA,2BAArBzC,QAAqB;AAAA,MAArBA,QAAqB,iCAAV,GAAU;;AACvG,MAAM0C,WAAWH,SAASzC,QAAQW,MAAlC;AACA,MAAMkC,YAAYC,KAAKC,GAAL,CAASJ,mBAAmBD,eAA5B,CAAlB;;AAEA,MAAI,CAACxC,QAAL,EAAe;AACb;AACA,WAAO2C,YAAY,GAAZ,GAAkBD,QAAzB;AACD;;AAED,SAAOA,WAAYC,YAAY3C,QAA/B;AACD,CAVD,C;;;;;;;;;ACAA,IAAM8C,aAAa,mBAAApD,CAAQ,CAAR,CAAnB;AACA,IAAMmB,iBAAiB,mBAAAnB,CAAQ,CAAR,CAAvB;;AAEAR,OAAOC,OAAP,GAAiB,UAACuB,IAAD,EAAOZ,OAAP,EAAgBF,eAAhB,QAAuI;AAAA,2BAApGG,QAAoG;AAAA,MAApGA,QAAoG,iCAAzF,CAAyF;AAAA,2BAAtFC,QAAsF;AAAA,MAAtFA,QAAsF,iCAA3E,GAA2E;AAAA,4BAAtEC,SAAsE;AAAA,MAAtEA,SAAsE,kCAA1D,GAA0D;AAAA,iCAArDI,cAAqD;AAAA,MAArDA,cAAqD,uCAApC,KAAoC;AAAA,mCAA7BC,kBAA6B;AAAA,MAA7BA,kBAA6B,yCAAR,CAAQ;;AACtJ,MAAMmC,mBAAmB1C,QAAzB;AACA;AACA,MAAMgD,UAAUrC,KAAKD,MAArB;AACA;AACA,MAAIuC,mBAAmB/C,SAAvB;AACA;AACA,MAAIgD,eAAevC,KAAKU,OAAL,CAAatB,OAAb,EAAsB2C,gBAAtB,CAAnB;;AAEA,MAAMS,aAAapD,QAAQW,MAA3B;;AAEA;AACA,MAAM0C,YAAY,EAAlB;AACA,OAAK,IAAIzB,IAAI,CAAb,EAAgBA,IAAIqB,OAApB,EAA6BrB,KAAK,CAAlC,EAAqC;AACnCyB,cAAUzB,CAAV,IAAe,CAAf;AACD;;AAED,MAAIuB,gBAAgB,CAAC,CAArB,EAAwB;AACtB,QAAIrC,QAAQkC,WAAWhD,OAAX,EAAoB;AAC9ByC,cAAQ,CADsB;AAE9BC,uBAAiBS,YAFa;AAG9BR,wCAH8B;AAI9BzC;AAJ8B,KAApB,CAAZ;AAMAgD,uBAAmBJ,KAAKQ,GAAL,CAASxC,KAAT,EAAgBoC,gBAAhB,CAAnB;;AAEA;AACAC,mBAAevC,KAAK2C,WAAL,CAAiBvD,OAAjB,EAA0B2C,mBAAmBS,UAA7C,CAAf;;AAEA,QAAID,gBAAgB,CAAC,CAArB,EAAwB;AACtB,UAAIrC,SAAQkC,WAAWhD,OAAX,EAAoB;AAC9ByC,gBAAQ,CADsB;AAE9BC,yBAAiBS,YAFa;AAG9BR,0CAH8B;AAI9BzC;AAJ8B,OAApB,CAAZ;AAMAgD,yBAAmBJ,KAAKQ,GAAL,CAASxC,MAAT,EAAgBoC,gBAAhB,CAAnB;AACD;AACF;;AAED;AACAC,iBAAe,CAAC,CAAhB;;AAEA,MAAIK,aAAa,EAAjB;AACA,MAAIC,aAAa,CAAjB;AACA,MAAIC,SAASN,aAAaH,OAA1B;;AAEA,MAAMU,YAAY,EAAlB;AACA,MAAMzB,OAAO,KAAMkB,aAAa,CAAhC;;AAEA,OAAK,IAAIxB,KAAI,CAAb,EAAgBA,KAAIwB,UAApB,EAAgCxB,MAAK,CAArC,EAAwC;AACtC;AACA;AACA;AACA,QAAIgC,SAAS,CAAb;AACA,QAAIC,SAASH,MAAb;;AAEA,WAAOE,SAASC,MAAhB,EAAwB;AACtB,UAAM/C,UAAQkC,WAAWhD,OAAX,EAAoB;AAChCyC,gBAAQb,EADwB;AAEhCc,yBAAiBC,mBAAmBkB,MAFJ;AAGhClB,0CAHgC;AAIhCzC;AAJgC,OAApB,CAAd;;AAOA,UAAIY,WAASoC,gBAAb,EAA+B;AAC7BU,iBAASC,MAAT;AACD,OAFD,MAEO;AACLH,iBAASG,MAAT;AACD;;AAEDA,eAASf,KAAKgB,KAAL,CAAW,CAACJ,SAASE,MAAV,IAAoB,CAApB,GAAwBA,MAAnC,CAAT;AACD;;AAED;AACAF,aAASG,MAAT;;AAEA,QAAI9B,QAAQe,KAAKiB,GAAL,CAAS,CAAT,EAAYpB,mBAAmBkB,MAAnB,GAA4B,CAAxC,CAAZ;AACA,QAAIG,SAASzD,iBAAiB0C,OAAjB,GAA2BH,KAAKQ,GAAL,CAASX,mBAAmBkB,MAA5B,EAAoCZ,OAApC,IAA+CG,UAAvF;;AAEA;AACA,QAAIa,SAASC,MAAMF,SAAS,CAAf,CAAb;;AAEAC,WAAOD,SAAS,CAAhB,IAAqB,CAAC,KAAKpC,EAAN,IAAW,CAAhC;;AAEA,SAAK,IAAIuC,IAAIH,MAAb,EAAqBG,KAAKpC,KAA1B,EAAiCoC,KAAK,CAAtC,EAAyC;AACvC,UAAIzB,kBAAkByB,IAAI,CAA1B;AACA,UAAIC,YAAYtE,gBAAgBc,KAAKuB,MAAL,CAAYO,eAAZ,CAAhB,CAAhB;;AAEA,UAAI0B,SAAJ,EAAe;AACbf,kBAAUX,eAAV,IAA6B,CAA7B;AACD;;AAED;AACAuB,aAAOE,CAAP,IAAY,CAAEF,OAAOE,IAAI,CAAX,KAAiB,CAAlB,GAAuB,CAAxB,IAA6BC,SAAzC;;AAEA;AACA,UAAIxC,OAAM,CAAV,EAAa;AACXqC,eAAOE,CAAP,KAAe,CAACX,WAAWW,IAAI,CAAf,IAAoBX,WAAWW,CAAX,CAArB,KAAuC,CAAxC,GAA6C,CAA9C,GAAmDX,WAAWW,IAAI,CAAf,CAAhE;AACD;;AAED,UAAIF,OAAOE,CAAP,IAAYjC,IAAhB,EAAsB;AACpBuB,qBAAaT,WAAWhD,OAAX,EAAoB;AAC/ByC,kBAAQb,EADuB;AAE/Bc,0CAF+B;AAG/BC,4CAH+B;AAI/BzC;AAJ+B,SAApB,CAAb;;AAOA;AACA;AACA,YAAIuD,cAAcP,gBAAlB,EAAoC;AAClC;AACAA,6BAAmBO,UAAnB;AACAN,yBAAeT,eAAf;AACAiB,oBAAUvC,IAAV,CAAe+B,YAAf;;AAEA;AACA,cAAIA,gBAAgBR,gBAApB,EAAsC;AACpC;AACD;;AAED;AACAZ,kBAAQe,KAAKiB,GAAL,CAAS,CAAT,EAAY,IAAIpB,gBAAJ,GAAuBQ,YAAnC,CAAR;AACD;AACF;AACF;;AAED;AACA,QAAMrC,UAAQkC,WAAWhD,OAAX,EAAoB;AAChCyC,cAAQb,KAAI,CADoB;AAEhCc,uBAAiBC,gBAFe;AAGhCA,wCAHgC;AAIhCzC;AAJgC,KAApB,CAAd;;AAOA,QAAIY,UAAQoC,gBAAZ,EAA8B;AAC5B;AACD;;AAEDM,iBAAaS,MAAb;AACD;;AAED;AACA,SAAO;AACLpD,aAASsC,gBAAgB,CADpB;AAELrC,WAAO2C,eAAe,CAAf,GAAmB,KAAnB,GAA2BA,UAF7B;AAGL1C,oBAAgBA,eAAesC,SAAf,EAA0B7C,kBAA1B;AAHX,GAAP;AAKD,CArJD,C;;;;;;;;;;;;;ACHA,IAAMT,QAAQ,mBAAAH,CAAQ,CAAR,CAAd;AACA,IAAMqB,YAAY,mBAAArB,CAAQ,CAAR,CAAlB;AACA,IAAMoB,UAAU,mBAAApB,CAAQ,CAAR,CAAhB;;IAEMyE,I;AACJ,gBAAalD,IAAb,QAgDG;AAAA,6BA9CDlB,QA8CC;AAAA,QA9CDA,QA8CC,iCA9CU,CA8CV;AAAA,6BAxCDC,QAwCC;AAAA,QAxCDA,QAwCC,iCAxCU,GAwCV;AAAA,8BArCDC,SAqCC;AAAA,QArCDA,SAqCC,kCArCW,GAqCX;AAAA,qCAnCDC,gBAmCC;AAAA,QAnCDA,gBAmCC,yCAnCkB,EAmClB;AAAA,kCAjCDkE,aAiCC;AAAA,QAjCDA,aAiCC,sCAjCe,KAiCf;AAAA,mCA/BDhE,cA+BC;AAAA,QA/BDA,cA+BC,uCA/BgB,KA+BhB;AAAA,mCA5BDC,cA4BC;AAAA,QA5BDA,cA4BC,uCA5BgB,KA4BhB;AAAA,qCA1BDC,kBA0BC;AAAA,QA1BDA,kBA0BC,yCA1BoB,CA0BpB;AAAA,uBAvBD+D,EAuBC;AAAA,QAvBDA,EAuBC,2BAvBI,IAuBJ;AAAA,yBArBDC,IAqBC;AAAA,QArBDA,IAqBC,6BArBM,EAqBN;AAAA,+BAnBDC,UAmBC;AAAA,QAnBDA,UAmBC,mCAnBY,IAmBZ;AAAA,0BAhBDC,KAgBC;AAAA,QAhBDA,KAgBC,8BAhBOzD,SAgBP;AAAA,2BAdD0D,MAcC;AAAA,QAdDA,MAcC,+BAdQ,UAACC,CAAD,EAAIC,CAAJ;AAAA,aAAWD,EAAE9D,KAAF,GAAU+D,EAAE/D,KAAvB;AAAA,KAcR;AAAA,6BAVDgE,QAUC;AAAA,QAVDA,QAUC,iCAVU,KAUV;AAAA,mCAPDC,cAOC;AAAA,QAPDA,cAOC,uCAPgB,KAOhB;AAAA,mCAJDC,cAIC;AAAA,QAJDA,cAIC,uCAJgB,KAIhB;AAAA,iCAHDC,YAGC;AAAA,QAHDA,YAGC,qCAHc,KAGd;AAAA,4BADDC,OACC;AAAA,QADDA,OACC,gCADS,KACT;;AAAA;;AACD,SAAKzE,OAAL,GAAe;AACbR,wBADa;AAEbC,wBAFa;AAGbC,0BAHa;AAIbC,wCAJa;AAKbC,uBAAiBiE,aALJ;AAMbhE,oCANa;AAObC,oCAPa;AAQbC,4CARa;AASb+D,YATa;AAUbC,gBAVa;AAWbQ,oCAXa;AAYbC,gCAZa;AAabR,4BAba;AAcbC,kBAda;AAebC,oBAfa;AAgBbO,sBAhBa;AAiBbJ,wBAjBa;AAkBbC;AAlBa,KAAf;;AAqBA,SAAKI,GAAL,CAAShE,IAAT;AACD;;;;wBAEIA,I,EAAM;AACT,WAAKA,IAAL,GAAYA,IAAZ;AACA,aAAOA,IAAP;AACD;;;2BAEOnB,O,EAAS;AACf,WAAKoF,IAAL,kCAAyCpF,OAAzC;;AADe,+BAMX,KAAKqF,iBAAL,CAAuBrF,OAAvB,CANW;AAAA,UAIbsF,cAJa,sBAIbA,cAJa;AAAA,UAKbC,YALa,sBAKbA,YALa;;AAAA,qBAQY,KAAKC,OAAL,CAAaF,cAAb,EAA6BC,YAA7B,CARZ;AAAA,UAQTE,OARS,YAQTA,OARS;AAAA,UAQAC,OARA,YAQAA,OARA;;AAUf,WAAKC,aAAL,CAAmBF,OAAnB,EAA4BC,OAA5B;;AAEA,UAAI,KAAKjF,OAAL,CAAagE,UAAjB,EAA6B;AAC3B,aAAKmB,KAAL,CAAWF,OAAX;AACD;;AAED,aAAO,KAAKG,OAAL,CAAaH,OAAb,CAAP;AACD;;;wCAEgC;AAAA,UAAd1F,OAAc,uEAAJ,EAAI;;AAC/B,UAAMsF,iBAAiB,EAAvB;;AAEA,UAAI,KAAK7E,OAAL,CAAaqE,QAAjB,EAA2B;AACzB;AACA,YAAMgB,SAAS9F,QAAQ+F,KAAR,CAAc,KAAKtF,OAAL,CAAaH,cAA3B,CAAf;AACA,aAAK,IAAIsB,IAAI,CAAR,EAAWC,MAAMiE,OAAOnF,MAA7B,EAAqCiB,IAAIC,GAAzC,EAA8CD,KAAK,CAAnD,EAAsD;AACpD0D,yBAAelE,IAAf,CAAoB,IAAIrB,KAAJ,CAAU+F,OAAOlE,CAAP,CAAV,EAAqB,KAAKnB,OAA1B,CAApB;AACD;AACF;;AAED,UAAI8E,eAAe,IAAIxF,KAAJ,CAAUC,OAAV,EAAmB,KAAKS,OAAxB,CAAnB;;AAEA,aAAO,EAAE6E,8BAAF,EAAkBC,0BAAlB,EAAP;AACD;;;8BAE2C;AAAA,UAAnCD,cAAmC,uEAAlB,EAAkB;AAAA,UAAdC,YAAc;;AAC1C,UAAMpE,OAAO,KAAKA,IAAlB;AACA,UAAM6E,YAAY,EAAlB;AACA,UAAMN,UAAU,EAAhB;;AAEA;AACA;AACA,UAAI,OAAOvE,KAAK,CAAL,CAAP,KAAmB,QAAvB,EAAiC;AAC/B;AACA,aAAK,IAAIS,IAAI,CAAR,EAAWC,MAAMV,KAAKR,MAA3B,EAAmCiB,IAAIC,GAAvC,EAA4CD,KAAK,CAAjD,EAAoD;AAClD,eAAKqE,QAAL,CAAc;AACZC,iBAAK,EADO;AAEZxE,mBAAOP,KAAKS,CAAL,CAFK;AAGZuE,oBAAQvE,CAHI;AAIZwE,mBAAOxE;AAJK,WAAd,EAKG;AACDoE,gCADC;AAEDN,4BAFC;AAGDJ,0CAHC;AAIDC;AAJC,WALH;AAWD;;AAED,eAAO,EAAEE,SAAS,IAAX,EAAiBC,gBAAjB,EAAP;AACD;;AAED;AACA;AACA,UAAMD,UAAU,EAAhB;AACA,WAAK,IAAI7D,KAAI,CAAR,EAAWC,OAAMV,KAAKR,MAA3B,EAAmCiB,KAAIC,IAAvC,EAA4CD,MAAK,CAAjD,EAAoD;AAClD,YAAIyE,OAAOlF,KAAKS,EAAL,CAAX;AACA;AACA,aAAK,IAAIuC,IAAI,CAAR,EAAWmC,UAAU,KAAK7F,OAAL,CAAa+D,IAAb,CAAkB7D,MAA5C,EAAoDwD,IAAImC,OAAxD,EAAiEnC,KAAK,CAAtE,EAAyE;AACvE,cAAI+B,MAAM,KAAKzF,OAAL,CAAa+D,IAAb,CAAkBL,CAAlB,CAAV;AACA,cAAI,OAAO+B,GAAP,KAAe,QAAnB,EAA6B;AAC3BT,oBAAQS,IAAIK,IAAZ,IAAoB;AAClBC,sBAAS,IAAIN,IAAIM,MAAT,IAAoB;AADV,aAApB;AAGA,gBAAIN,IAAIM,MAAJ,IAAc,CAAd,IAAmBN,IAAIM,MAAJ,GAAa,CAApC,EAAuC;AACrC,oBAAM,IAAIC,KAAJ,CAAU,mCAAV,CAAN;AACD;AACDP,kBAAMA,IAAIK,IAAV;AACD,WARD,MAQO;AACLd,oBAAQS,GAAR,IAAe;AACbM,sBAAQ;AADK,aAAf;AAGD;;AAED,eAAKP,QAAL,CAAc;AACZC,oBADY;AAEZxE,mBAAO,KAAKjB,OAAL,CAAaiE,KAAb,CAAmB2B,IAAnB,EAAyBH,GAAzB,CAFK;AAGZC,oBAAQE,IAHI;AAIZD,mBAAOxE;AAJK,WAAd,EAKG;AACDoE,gCADC;AAEDN,4BAFC;AAGDJ,0CAHC;AAIDC;AAJC,WALH;AAWD;AACF;;AAED,aAAO,EAAEE,gBAAF,EAAWC,gBAAX,EAAP;AACD;;;2CAEkH;AAAA,UAAvGQ,GAAuG,SAAvGA,GAAuG;AAAA,UAAlGxE,KAAkG,SAAlGA,KAAkG;AAAA,UAA3FyE,MAA2F,SAA3FA,MAA2F;AAAA,UAAnFC,KAAmF,SAAnFA,KAAmF;AAAA,uCAAxEd,cAAwE;AAAA,UAAxEA,cAAwE,wCAAvD,EAAuD;AAAA,qCAAnDC,YAAmD;AAAA,UAAnDA,YAAmD,sCAApC,EAAoC;AAAA,kCAAhCS,SAAgC;AAAA,UAAhCA,SAAgC,mCAApB,EAAoB;AAAA,gCAAhBN,OAAgB;AAAA,UAAhBA,OAAgB,iCAAN,EAAM;;AACjH;AACA,UAAIhE,UAAUC,SAAV,IAAuBD,UAAU,IAArC,EAA2C;AACzC;AACD;;AAED,UAAIgF,SAAS,KAAb;AACA,UAAIC,eAAe,CAAC,CAApB;AACA,UAAIC,iBAAiB,CAArB;;AAEA,UAAI,OAAOlF,KAAP,KAAiB,QAArB,EAA+B;AAC7B,aAAK0D,IAAL,cAAoBc,QAAQ,EAAR,GAAa,GAAb,GAAkBA,GAAtC;;AAEA,YAAIW,mBAAmBtB,aAAauB,MAAb,CAAoBpF,KAApB,CAAvB;AACA,aAAK0D,IAAL,kBAAyB1D,KAAzB,kBAA2CmF,iBAAiB/F,KAA5D;;AAEA,YAAI,KAAKL,OAAL,CAAaqE,QAAjB,EAA2B;AACzB,cAAIiC,QAAQrF,MAAMqE,KAAN,CAAY,KAAKtF,OAAL,CAAaH,cAAzB,CAAZ;AACA,cAAI0G,SAAS,EAAb;;AAEA,eAAK,IAAIpF,IAAI,CAAb,EAAgBA,IAAI0D,eAAe3E,MAAnC,EAA2CiB,KAAK,CAAhD,EAAmD;AACjD,gBAAIqF,gBAAgB3B,eAAe1D,CAAf,CAApB;;AAEA,iBAAKwD,IAAL,kBAAyB6B,cAAcjH,OAAvC;;AAEA;AACA,gBAAIkH,iBAAiB,KAArB;;AAEA,iBAAK,IAAI/C,IAAI,CAAb,EAAgBA,IAAI4C,MAAMpG,MAA1B,EAAkCwD,KAAK,CAAvC,EAA0C;AACxC,kBAAIgD,OAAOJ,MAAM5C,CAAN,CAAX;AACA,kBAAIiD,oBAAoBH,cAAcH,MAAd,CAAqBK,IAArB,CAAxB;AACA,kBAAI7H,MAAM,EAAV;AACA,kBAAI8H,kBAAkBvG,OAAtB,EAA+B;AAC7BvB,oBAAI6H,IAAJ,IAAYC,kBAAkBtG,KAA9B;AACA4F,yBAAS,IAAT;AACAQ,iCAAiB,IAAjB;AACAF,uBAAO5F,IAAP,CAAYgG,kBAAkBtG,KAA9B;AACD,eALD,MAKO;AACLxB,oBAAI6H,IAAJ,IAAY,CAAZ;AACA,oBAAI,CAAC,KAAK1G,OAAL,CAAasE,cAAlB,EAAkC;AAChCiC,yBAAO5F,IAAP,CAAY,CAAZ;AACD;AACF;AACD,mBAAKgE,IAAL,cAAqB+B,IAArB,kBAAsC7H,IAAI6H,IAAJ,CAAtC;AACA;AACD;;AAED,gBAAID,cAAJ,EAAoB;AAClBN,gCAAkB,CAAlB;AACD;AACF;;AAEDD,yBAAeK,OAAO,CAAP,CAAf;AACA,cAAIK,YAAYL,OAAOrG,MAAvB;AACA,eAAK,IAAIiB,MAAI,CAAb,EAAgBA,MAAIyF,SAApB,EAA+BzF,OAAK,CAApC,EAAuC;AACrC+E,4BAAgBK,OAAOpF,GAAP,CAAhB;AACD;AACD+E,yBAAeA,eAAeU,SAA9B;;AAEA,eAAKjC,IAAL,CAAU,sBAAV,EAAkCuB,YAAlC;AACD;;AAED,YAAIlD,aAAaoD,iBAAiB/F,KAAlC;AACA,YAAI6F,eAAe,CAAC,CAApB,EAAuB;AACrBlD,uBAAa,CAACA,aAAakD,YAAd,IAA8B,CAA3C;AACD;;AAED,aAAKvB,IAAL,CAAU,gBAAV,EAA4B3B,UAA5B;;AAEA,YAAI6D,mBAAoB,KAAK7G,OAAL,CAAaqE,QAAb,IAAyB,KAAKrE,OAAL,CAAasE,cAAvC,GAAyD6B,kBAAkBtB,eAAe3E,MAA1F,GAAmG,IAA1H;;AAEA,aAAKyE,IAAL,uBAA8BkC,gBAA9B;;AAEA;AACA,YAAI,CAACZ,UAAUG,iBAAiBhG,OAA5B,KAAwCyG,gBAA5C,EAA8D;AAC5D;AACA,cAAIC,iBAAiBvB,UAAUI,KAAV,CAArB;;AAEA,cAAImB,cAAJ,EAAoB;AAClB;AACA;AACAA,2BAAeC,MAAf,CAAsBpG,IAAtB,CAA2B;AACzB8E,mBAAKA,GADoB;AAEzBpF,qBAAO2C,UAFkB;AAGzB1C,8BAAgB8F,iBAAiB9F;AAHR,aAA3B;AAKD,WARD,MAQO;AACL;AACAiF,sBAAUI,KAAV,IAAmB;AACjBC,oBAAMF,MADW;AAEjBqB,sBAAQ,CAAC;AACPtB,qBAAKA,GADE;AAEPpF,uBAAO2C,UAFA;AAGP1C,gCAAgB8F,iBAAiB9F;AAH1B,eAAD;AAFS,aAAnB;;AASA2E,oBAAQtE,IAAR,CAAa4E,UAAUI,KAAV,CAAb;AACD;AACF;AACF,OA1FD,MA0FO,IAAIpF,QAAQU,KAAR,CAAJ,EAAoB;AACzB,aAAK,IAAIE,MAAI,CAAR,EAAWC,MAAMH,MAAMf,MAA5B,EAAoCiB,MAAIC,GAAxC,EAA6CD,OAAK,CAAlD,EAAqD;AACnD,eAAKqE,QAAL,CAAc;AACZC,oBADY;AAEZxE,mBAAOA,MAAME,GAAN,CAFK;AAGZuE,0BAHY;AAIZC;AAJY,WAAd,EAKG;AACDJ,gCADC;AAEDN,4BAFC;AAGDJ,0CAHC;AAIDC;AAJC,WALH;AAWD;AACF;AACF;;;kCAEcE,O,EAASC,O,EAAS;AAC/B,WAAKN,IAAL,CAAU,wBAAV;;AAEA,WAAK,IAAIxD,IAAI,CAAR,EAAWC,MAAM6D,QAAQ/E,MAA9B,EAAsCiB,IAAIC,GAA1C,EAA+CD,KAAK,CAApD,EAAuD;AACrD,YAAM4F,SAAS9B,QAAQ9D,CAAR,EAAW4F,MAA1B;AACA,YAAMC,WAAWD,OAAO7G,MAAxB;;AAEA,YAAI+G,aAAa,CAAjB;AACA,YAAIC,YAAY,CAAhB;;AAEA,aAAK,IAAIxD,IAAI,CAAb,EAAgBA,IAAIsD,QAApB,EAA8BtD,KAAK,CAAnC,EAAsC;AACpC,cAAIrD,QAAQ0G,OAAOrD,CAAP,EAAUrD,KAAtB;AACA,cAAI0F,SAASf,UAAUA,QAAQ+B,OAAOrD,CAAP,EAAU+B,GAAlB,EAAuBM,MAAjC,GAA0C,CAAvD;AACA,cAAIoB,SAAS9G,QAAQ0F,MAArB;;AAEA,cAAIA,WAAW,CAAf,EAAkB;AAChBmB,wBAAY7E,KAAKQ,GAAL,CAASqE,SAAT,EAAoBC,MAApB,CAAZ;AACD,WAFD,MAEO;AACLJ,mBAAOrD,CAAP,EAAUyD,MAAV,GAAmBA,MAAnB;AACAF,0BAAcE,MAAd;AACD;AACF;;AAEDlC,gBAAQ9D,CAAR,EAAWd,KAAX,GAAmB6G,cAAc,CAAd,GAAkBD,aAAaD,QAA/B,GAA0CE,SAA7D;;AAEA,aAAKvC,IAAL,CAAUM,QAAQ9D,CAAR,CAAV;AACD;AACF;;;0BAEM8D,O,EAAS;AACd,WAAKN,IAAL,CAAU,iBAAV;AACAM,cAAQmC,IAAR,CAAa,KAAKpH,OAAL,CAAakE,MAA1B;AACD;;;4BAEQe,O,EAAS;AAChB,UAAMoC,cAAc,EAApB;;AAEA,WAAK1C,IAAL,CAAU,iBAAV,EAA6BM,OAA7B;;AAEA,UAAIqC,eAAe,EAAnB;;AAEA,UAAI,KAAKtH,OAAL,CAAauE,cAAjB,EAAiC;AAC/B+C,qBAAa3G,IAAb,CAAkB,UAAC4G,MAAD,EAASC,IAAT,EAAkB;AAClC,cAAMT,SAASQ,OAAOR,MAAtB;AACAS,eAAK7F,OAAL,GAAe,EAAf;;AAEA,eAAK,IAAIR,IAAI,CAAR,EAAWC,MAAM2F,OAAO7G,MAA7B,EAAqCiB,IAAIC,GAAzC,EAA8CD,KAAK,CAAnD,EAAsD;AACpD,gBAAIyE,OAAOmB,OAAO5F,CAAP,CAAX;AACA,gBAAItC,MAAM;AACR4I,uBAAS7B,KAAKtF;AADN,aAAV;AAGA,gBAAIsF,KAAKH,GAAT,EAAc;AACZ5G,kBAAI4G,GAAJ,GAAUG,KAAKH,GAAf;AACD;AACD+B,iBAAK7F,OAAL,CAAahB,IAAb,CAAkB9B,GAAlB;AACD;AACF,SAdD;AAeD;;AAED,UAAI,KAAKmB,OAAL,CAAawE,YAAjB,EAA+B;AAC7B8C,qBAAa3G,IAAb,CAAkB,UAAC4G,MAAD,EAASC,IAAT,EAAkB;AAClCA,eAAKnH,KAAL,GAAakH,OAAOlH,KAApB;AACD,SAFD;AAGD;;AAED,WAAK,IAAIc,IAAI,CAAR,EAAWC,MAAM6D,QAAQ/E,MAA9B,EAAsCiB,IAAIC,GAA1C,EAA+CD,KAAK,CAApD,EAAuD;AACrD,YAAMoG,SAAStC,QAAQ9D,CAAR,CAAf;;AAEA,YAAI,KAAKnB,OAAL,CAAa8D,EAAjB,EAAqB;AACnByD,iBAAO3B,IAAP,GAAc,KAAK5F,OAAL,CAAaiE,KAAb,CAAmBsD,OAAO3B,IAA1B,EAAgC,KAAK5F,OAAL,CAAa8D,EAA7C,EAAiD,CAAjD,CAAd;AACD;;AAED,YAAI,CAACwD,aAAapH,MAAlB,EAA0B;AACxBmH,sBAAY1G,IAAZ,CAAiB4G,OAAO3B,IAAxB;AACA;AACD;;AAED,YAAM4B,OAAO;AACX5B,gBAAM2B,OAAO3B;AADF,SAAb;;AAIA,aAAK,IAAIlC,IAAI,CAAR,EAAWtC,QAAMkG,aAAapH,MAAnC,EAA2CwD,IAAItC,KAA/C,EAAoDsC,KAAK,CAAzD,EAA4D;AAC1D4D,uBAAa5D,CAAb,EAAgB6D,MAAhB,EAAwBC,IAAxB;AACD;;AAEDH,oBAAY1G,IAAZ,CAAiB6G,IAAjB;AACD;;AAED,aAAOH,WAAP;AACD;;;2BAEO;AACN,UAAI,KAAKrH,OAAL,CAAayE,OAAjB,EAA0B;AAAA;;AACxB,6BAAQiD,GAAR,iBAAeC,SAAf;AACD;AACF;;;;;;AAGHhJ,OAAOC,OAAP,GAAiBgF,IAAjB,C","file":"fuse.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"Fuse\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Fuse\"] = factory();\n\telse\n\t\troot[\"Fuse\"] = factory();\n})(this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// identity function for calling harmony imports with the correct context\n \t__webpack_require__.i = function(value) { return value; };\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, {\n \t\t\t\tconfigurable: false,\n \t\t\t\tenumerable: true,\n \t\t\t\tget: getter\n \t\t\t});\n \t\t}\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 8);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 5d4776140a8b2573e895","module.exports = (obj) => {\n  return Object.prototype.toString.call(obj) === '[object Array]'\n}\n\n\n// WEBPACK FOOTER //\n// ./src/helpers/is_array.js","const bitapRegexSearch = require('./bitap_regex_search')\nconst bitapSearch = require('./bitap_search')\nconst patternAlphabet = require('./bitap_pattern_alphabet')\n\nclass Bitap {\n  constructor (pattern, { \n    // Approximately where in the text is the pattern expected to be found?\n    location = 0, \n    // Determines how close the match must be to the fuzzy location (specified above).\n    // An exact letter match which is 'distance' characters away from the fuzzy location\n    // would score as a complete mismatch. A distance of '0' requires the match be at\n    // the exact location specified, a threshold of '1000' would require a perfect match\n    // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n    distance = 100, \n    // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n    // (of both letters and location), a threshold of '1.0' would match anything.\n    threshold = 0.6, \n    // Machine word size\n    maxPatternLength = 32,\n    // Indicates whether comparisons should be case sensitive.\n    isCaseSensitive = false,\n    // Regex used to separate words when searching. Only applicable when `tokenize` is `true`.\n    tokenSeparator = / +/g,\n    // When true, the algorithm continues searching to the end of the input even if a perfect\n    // match is found before the end of the same input.\n    findAllMatches = false,\n    // Minimum number of characters that must be matched before a result is considered a match\n    minMatchCharLength = 1\n  }) {\n    this.options = {\n      location,\n      distance,\n      threshold,\n      maxPatternLength,\n      isCaseSensitive,\n      tokenSeparator,\n      findAllMatches,\n      minMatchCharLength\n    }\n\n    this.pattern = this.options.isCaseSensitive ? pattern : pattern.toLowerCase()\n\n    if (this.pattern.length <= maxPatternLength) {\n      this.patternAlphabet = patternAlphabet(this.pattern)\n    }\n  }\n\n  search (text) {\n    if (!this.options.isCaseSensitive) {\n      text = text.toLowerCase()\n    }\n\n    // Exact match\n    if (this.pattern === text) {\n      return {\n        isMatch: true,\n        score: 0,\n        matchedIndices: [[0, text.length - 1]]\n      }\n    }\n\n    // When pattern length is greater than the machine word length, just do a a regex comparison\n    const { maxPatternLength, tokenSeparator } = this.options\n    if (this.pattern.length > maxPatternLength) {\n      return bitapRegexSearch(text, this.pattern, tokenSeparator)\n    }\n\n    // Otherwise, use Bitap algorithm\n    const { location, distance, threshold, findAllMatches, minMatchCharLength } = this.options\n    return bitapSearch(text, this.pattern, this.patternAlphabet, {\n      location,\n      distance,\n      threshold,\n      findAllMatches,\n      minMatchCharLength\n    })\n  }\n}\n\nmodule.exports = Bitap\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/index.js","const isArray = require('./is_array')\n\nconst deepValue = (obj, path, list) => {\n  if (!path) {\n    // If there's no path left, we've gotten to the object we care about.\n    list.push(obj)\n  } else {\n    const dotIndex = path.indexOf('.')\n    let firstSegment = path\n    let remaining = null\n\n    if (dotIndex !== -1) {\n      firstSegment = path.slice(0, dotIndex)\n      remaining = path.slice(dotIndex + 1)\n    }\n\n    const value = obj[firstSegment]\n    \n    if (value !== null && value !== undefined) {\n      if (!remaining && (typeof value === 'string' || typeof value === 'number')) {\n        list.push(value)\n      } else if (isArray(value)) {\n        // Search each item in the array.\n        for (let i = 0, len = value.length; i < len; i += 1) {\n          deepValue(value[i], remaining, list)\n        }\n      } else if (remaining) {\n        // An object. Recurse further.\n        deepValue(value, remaining, list)\n      }\n    }\n  }\n\n  return list\n}\n\nmodule.exports = (obj, path) => {\n  return deepValue(obj, path, [])\n}\n\n\n// WEBPACK FOOTER //\n// ./src/helpers/deep_value.js","module.exports = (matchmask = [], minMatchCharLength = 1) => {\n  let matchedIndices = []\n  let start = -1\n  let end = -1\n  let i = 0\n\n  for (let len = matchmask.length; i < len; i += 1) {\n    let match = matchmask[i]\n    if (match && start === -1) {\n      start = i\n    } else if (!match && start !== -1) {\n      end = i - 1\n      if ((end - start) + 1 >= minMatchCharLength) {\n        matchedIndices.push([start, end])\n      }\n      start = -1\n    }\n  }\n\n  // (i-1 - start) + 1 => i - start\n  if (matchmask[i - 1] && (i - start) >= minMatchCharLength) {\n    matchedIndices.push([start, i - 1])\n  }\n\n  return matchedIndices\n}\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/bitap_matched_indices.js","module.exports = (pattern) => {\n  let mask = {}\n  let len = pattern.length\n\n  for (let i = 0; i < len; i += 1) {\n    mask[pattern.charAt(i)] = 0\n  }\n\n  for (let i = 0; i < len; i += 1) {\n    mask[pattern.charAt(i)] |= 1 << (len - i - 1)\n  }\n\n  return mask\n}\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/bitap_pattern_alphabet.js","module.exports = (text, pattern, tokenSeparator = / +/g) => {\n  let matches = text.match(new RegExp(pattern.replace(tokenSeparator, '|')))\n  let isMatch = !!matches\n  let matchedIndices = []\n\n  if (isMatch) {\n    for (i = 0, matchesLen = matches.length; i < matchesLen; i += 1) {\n      match = matches[i]\n      matchedIndices.push([text.indexOf(match), match.length - 1])\n    }\n  }\n  \n  return {\n    // TODO: revisit this score\n    score: isMatched ? 0.5 : 1,\n    isMatch,\n    matchedIndices\n  } \n}\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/bitap_regex_search.js","module.exports = (pattern, { errors = 0, currentLocation = 0, expectedLocation = 0, distance = 100 }) => {\n  const accuracy = errors / pattern.length\n  const proximity = Math.abs(expectedLocation - currentLocation)\n\n  if (!distance) {\n    // Dodge divide by zero error.\n    return proximity ? 1.0 : accuracy\n  }\n\n  return accuracy + (proximity / distance)\n}\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/bitap_score.js","const bitapScore = require('./bitap_score')\nconst matchedIndices = require('./bitap_matched_indices')\n\nmodule.exports = (text, pattern, patternAlphabet, { location = 0, distance = 100, threshold = 0.6, findAllMatches = false, minMatchCharLength = 1 }) => {\n  const expectedLocation = location\n  // Set starting location at beginning text and initialize the alphabet.\n  const textLen = text.length\n  // Highest score beyond which we give up.\n  let currentThreshold = threshold\n  // Is there a nearby exact match? (speedup)\n  let bestLocation = text.indexOf(pattern, expectedLocation)\n\n  const patternLen = pattern.length\n\n  // a mask of the matches\n  const matchMask = []\n  for (let i = 0; i < textLen; i += 1) {\n    matchMask[i] = 0\n  }\n\n  if (bestLocation != -1) {\n    let score = bitapScore(pattern, { \n      errors: 0, \n      currentLocation: bestLocation, \n      expectedLocation, \n      distance \n    })\n    currentThreshold = Math.min(score, currentThreshold)\n\n    // What about in the other direction? (speed up)\n    bestLocation = text.lastIndexOf(pattern, expectedLocation + patternLen)\n\n    if (bestLocation != -1) {\n      let score = bitapScore(pattern, { \n        errors: 0, \n        currentLocation: bestLocation, \n        expectedLocation, \n        distance\n      })\n      currentThreshold = Math.min(score, currentThreshold)\n    }\n  }\n\n  // Reset the best location\n  bestLocation = -1\n\n  let lastBitArr = []\n  let finalScore = 1\n  let binMax = patternLen + textLen\n\n  const locations = []\n  const mask = 1 << (patternLen - 1)\n\n  for (let i = 0; i < patternLen; i += 1) {\n    // Scan for the best match; each iteration allows for one more error.\n    // Run a binary search to determine how far from the match location we can stray\n    // at this error level.\n    let binMin = 0\n    let binMid = binMax\n\n    while (binMin < binMid) {\n      const score = bitapScore(pattern, { \n        errors: i, \n        currentLocation: expectedLocation + binMid, \n        expectedLocation, \n        distance \n      })\n\n      if (score <= currentThreshold) {\n        binMin = binMid\n      } else {\n        binMax = binMid\n      }\n\n      binMid = Math.floor((binMax - binMin) / 2 + binMin)\n    }\n\n    // Use the result from this iteration as the maximum for the next.\n    binMax = binMid\n\n    let start = Math.max(1, expectedLocation - binMid + 1)\n    let finish = findAllMatches ? textLen : Math.min(expectedLocation + binMid, textLen) + patternLen\n\n    // Initialize the bit array\n    let bitArr = Array(finish + 2)\n\n    bitArr[finish + 1] = (1 << i) - 1\n\n    for (let j = finish; j >= start; j -= 1) {\n      let currentLocation = j - 1\n      let charMatch = patternAlphabet[text.charAt(currentLocation)]\n\n      if (charMatch) {\n        matchMask[currentLocation] = 1\n      }\n\n      // First pass: exact match\n      bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch\n\n      // Subsequent passes: fuzzy match\n      if (i !== 0) {\n        bitArr[j] |= (((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1) | lastBitArr[j + 1]\n      }\n      \n      if (bitArr[j] & mask) {\n        finalScore = bitapScore(pattern, { \n          errors: i, \n          currentLocation, \n          expectedLocation, \n          distance \n        })\n\n        // This match will almost certainly be better than any existing match.\n        // But check anyway.\n        if (finalScore <= currentThreshold) {\n          // Indeed it is\n          currentThreshold = finalScore\n          bestLocation = currentLocation\n          locations.push(bestLocation)\n\n          // Already passed `loc`, downhill from here on in.\n          if (bestLocation <= expectedLocation) {\n            break\n          }\n\n          // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.\n          start = Math.max(1, 2 * expectedLocation - bestLocation)\n        }\n      }\n    }\n\n    // No hope for a (better) match at greater error levels.    \n    const score = bitapScore(pattern, { \n      errors: i + 1, \n      currentLocation: expectedLocation, \n      expectedLocation, \n      distance \n    })\n  \n    if (score > currentThreshold) {\n      break\n    }\n    \n    lastBitArr = bitArr\n  }\n\n  // Count exact matches (those with a score of 0) to be \"almost\" exact\n  return {\n    isMatch: bestLocation >= 0,\n    score: finalScore === 0 ? 0.001 : finalScore,\n    matchedIndices: matchedIndices(matchMask, minMatchCharLength)\n  }\n}\n\n\n// WEBPACK FOOTER //\n// ./src/bitap/bitap_search.js","const Bitap = require('./bitap')\nconst deepValue = require('./helpers/deep_value')\nconst isArray = require('./helpers/is_array')\n\nclass Fuse {\n  constructor (list, { \n    // Approximately where in the text is the pattern expected to be found?\n    location = 0, \n    // Determines how close the match must be to the fuzzy location (specified above).\n    // An exact letter match which is 'distance' characters away from the fuzzy location\n    // would score as a complete mismatch. A distance of '0' requires the match be at\n    // the exact location specified, a threshold of '1000' would require a perfect match\n    // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.\n    distance = 100, \n    // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match\n    // (of both letters and location), a threshold of '1.0' would match anything.\n    threshold = 0.6, \n    // Machine word size\n    maxPatternLength = 32,\n    // Indicates whether comparisons should be case sensitive.\n    caseSensitive = false,\n    // Regex used to separate words when searching. Only applicable when `tokenize` is `true`.\n    tokenSeparator = / +/g,\n    // When true, the algorithm continues searching to the end of the input even if a perfect\n    // match is found before the end of the same input.\n    findAllMatches = false,\n    // Minimum number of characters that must be matched before a result is considered a match\n    minMatchCharLength = 1,\n    // The name of the identifier property. If specified, the returned result will be a list\n    // of the items' dentifiers, otherwise it will be a list of the items.\n    id = null,\n    // List of properties that will be searched. This also supports nested properties.\n    keys = [],\n    // Whether to sort the result list, by score\n    shouldSort = true,\n    // The get function to use when fetching an object's properties.\n    // The default will search nested paths *ie foo.bar.baz*\n    getFn = deepValue,\n    // Default sort function\n    sortFn = (a, b) => (a.score - b.score),\n    // When true, the search algorithm will search individual words **and** the full string,\n    // computing the final score as a function of both. Note that when `tokenize` is `true`,\n    // the `threshold`, `distance`, and `location` are inconsequential for individual tokens.\n    tokenize = false,\n    // When true, the result set will only include records that match all tokens. Will only work\n    // if `tokenize` is also true.\n    matchAllTokens = false,\n    // Will print to the console. Useful for debugging.\n\n    includeMatches = false,\n    includeScore = false,\n\n    verbose = false\n  }) {\n    this.options = {\n      location,\n      distance,\n      threshold,\n      maxPatternLength,\n      isCaseSensitive: caseSensitive,\n      tokenSeparator,\n      findAllMatches,\n      minMatchCharLength,\n      id,\n      keys,\n      includeMatches,\n      includeScore,\n      shouldSort,\n      getFn,\n      sortFn,\n      verbose,\n      tokenize,\n      matchAllTokens\n    }\n\n    this.set(list)\n  }\n\n  set (list) {\n    this.list = list\n    return list\n  }\n\n  search (pattern) {\n    this._log(`---------\\nSearch pattern: \"${pattern}\"`)\n\n    const {\n      tokenSearchers,\n      fullSearcher\n    } = this._prepareSearchers(pattern)\n\n    let { weights, results } = this._search(tokenSearchers, fullSearcher)\n\n    this._computeScore(weights, results)\n\n    if (this.options.shouldSort) {\n      this._sort(results)\n    }\n    \n    return this._format(results)\n  }\n\n  _prepareSearchers (pattern = '') {\n    const tokenSearchers = []\n\n    if (this.options.tokenize) {\n      // Tokenize on the separator\n      const tokens = pattern.split(this.options.tokenSeparator)\n      for (let i = 0, len = tokens.length; i < len; i += 1) {\n        tokenSearchers.push(new Bitap(tokens[i], this.options))\n      }\n    }\n    \n    let fullSearcher = new Bitap(pattern, this.options)\n    \n    return { tokenSearchers, fullSearcher }\n  }\n\n  _search (tokenSearchers = [], fullSearcher) {\n    const list = this.list\n    const resultMap = {}\n    const results = []\n\n    // Check the first item in the list, if it's a string, then we assume\n    // that every item in the list is also a string, and thus it's a flattened array.\n    if (typeof list[0] === 'string') {\n      // Iterate over every item\n      for (let i = 0, len = list.length; i < len; i += 1) {\n        this._analyze({\n          key: '', \n          value: list[i], \n          record: i, \n          index: i\n        }, {\n          resultMap, \n          results,\n          tokenSearchers,\n          fullSearcher\n        })\n      }\n\n      return { weights: null, results }\n    }\n\n    // Otherwise, the first item is an Object (hopefully), and thus the searching\n    // is done on the values of the keys of each item.\n    const weights = {}\n    for (let i = 0, len = list.length; i < len; i += 1) {\n      let item = list[i]\n      // Iterate over every key\n      for (let j = 0, keysLen = this.options.keys.length; j < keysLen; j += 1) {\n        let key = this.options.keys[j]\n        if (typeof key !== 'string') {\n          weights[key.name] = {\n            weight: (1 - key.weight) || 1\n          }\n          if (key.weight <= 0 || key.weight > 1) {\n            throw new Error('Key weight has to be > 0 and <= 1')\n          }\n          key = key.name\n        } else {\n          weights[key] = {\n            weight: 1\n          }\n        }\n\n        this._analyze({\n          key, \n          value: this.options.getFn(item, key), \n          record: item, \n          index: i\n        }, {\n          resultMap, \n          results,\n          tokenSearchers, \n          fullSearcher\n        })\n      }\n    }\n\n    return { weights, results }\n  }\n\n  _analyze ({ key, value, record, index }, { tokenSearchers = [], fullSearcher = [], resultMap = {}, results = [] }) {\n    // Check if the texvaluet can be searched\n    if (value === undefined || value === null) {\n      return\n    }\n\n    let exists = false\n    let averageScore = -1\n    let numTextMatches = 0\n\n    if (typeof value === 'string') {\n      this._log(`\\nKey: ${key === '' ? '-': key}`)\n\n      let mainSearchResult = fullSearcher.search(value)\n      this._log(`Full text: \"${value}\", score: ${mainSearchResult.score}`)\n      \n      if (this.options.tokenize) {\n        let words = value.split(this.options.tokenSeparator)\n        let scores = []\n\n        for (let i = 0; i < tokenSearchers.length; i += 1) {\n          let tokenSearcher = tokenSearchers[i]\n\n          this._log(`\\nPattern: \"${tokenSearcher.pattern}\"`)\n\n          // let tokenScores = []\n          let hasMatchInText = false\n\n          for (let j = 0; j < words.length; j += 1) {\n            let word = words[j]\n            let tokenSearchResult = tokenSearcher.search(word)\n            let obj = {}\n            if (tokenSearchResult.isMatch) {\n              obj[word] = tokenSearchResult.score\n              exists = true\n              hasMatchInText = true\n              scores.push(tokenSearchResult.score)\n            } else {\n              obj[word] = 1\n              if (!this.options.matchAllTokens) {\n                scores.push(1)\n              }\n            }\n            this._log(`Token: \"${word}\", score: ${obj[word]}`)\n            // tokenScores.push(obj)\n          }\n\n          if (hasMatchInText) {\n            numTextMatches += 1\n          }\n        }\n\n        averageScore = scores[0]\n        let scoresLen = scores.length\n        for (let i = 1; i < scoresLen; i += 1) {\n          averageScore += scores[i]\n        }\n        averageScore = averageScore / scoresLen\n\n        this._log('Token score average:', averageScore)\n      }\n\n      let finalScore = mainSearchResult.score\n      if (averageScore > -1) {\n        finalScore = (finalScore + averageScore) / 2\n      }\n\n      this._log('Score average:', finalScore)\n\n      let checkTextMatches = (this.options.tokenize && this.options.matchAllTokens) ? numTextMatches >= tokenSearchers.length : true\n\n      this._log(`\\nCheck Matches: ${checkTextMatches}`)\n\n      // If a match is found, add the item to <rawResults>, including its score\n      if ((exists || mainSearchResult.isMatch) && checkTextMatches) {\n        // Check if the item already exists in our results\n        let existingResult = resultMap[index]\n\n        if (existingResult) {\n          // Use the lowest score\n          // existingResult.score, bitapResult.score\n          existingResult.output.push({\n            key: key,\n            score: finalScore,\n            matchedIndices: mainSearchResult.matchedIndices\n          })\n        } else {\n          // Add it to the raw result list\n          resultMap[index] = {\n            item: record,\n            output: [{\n              key: key,\n              score: finalScore,\n              matchedIndices: mainSearchResult.matchedIndices\n            }]\n          }\n\n          results.push(resultMap[index])\n        }\n      }\n    } else if (isArray(value)) {\n      for (let i = 0, len = value.length; i < len; i += 1) {\n        this._analyze({\n          key, \n          value: value[i], \n          record, \n          index\n        }, {\n          resultMap, \n          results,\n          tokenSearchers,\n          fullSearcher\n        })\n      }\n    }\n  }\n\n  _computeScore (weights, results) {\n    this._log('\\n\\nComputing score:\\n')\n\n    for (let i = 0, len = results.length; i < len; i += 1) {\n      const output = results[i].output\n      const scoreLen = output.length\n\n      let totalScore = 0\n      let bestScore = 1\n\n      for (let j = 0; j < scoreLen; j += 1) {\n        let score = output[j].score\n        let weight = weights ? weights[output[j].key].weight : 1\n        let nScore = score * weight\n\n        if (weight !== 1) {\n          bestScore = Math.min(bestScore, nScore)\n        } else {\n          output[j].nScore = nScore\n          totalScore += nScore\n        }\n      }\n      \n      results[i].score = bestScore === 1 ? totalScore / scoreLen : bestScore\n\n      this._log(results[i])\n    }\n  }\n\n  _sort (results) {\n    this._log('\\n\\nSorting....')\n    results.sort(this.options.sortFn)\n  }\n\n  _format (results) {\n    const finalOutput = []\n\n    this._log('\\n\\nOutput:\\n\\n', results)\n\n    let transformers = []\n\n    if (this.options.includeMatches) {\n      transformers.push((result, data) => {\n        const output = result.output\n        data.matches = []\n\n        for (let i = 0, len = output.length; i < len; i += 1) {\n          let item = output[i]\n          let obj = {\n            indices: item.matchedIndices\n          }\n          if (item.key) {\n            obj.key = item.key\n          }\n          data.matches.push(obj)\n        }\n      })\n    }\n    \n    if (this.options.includeScore) {\n      transformers.push((result, data) => {\n        data.score = result.score\n      })\n    }\n\n    for (let i = 0, len = results.length; i < len; i += 1) {\n      const result = results[i]\n\n      if (this.options.id) {\n        result.item = this.options.getFn(result.item, this.options.id)[0]\n      }\n\n      if (!transformers.length) {\n        finalOutput.push(result.item)\n        continue\n      }\n\n      const data = {\n        item: result.item\n      }\n\n      for (let j = 0, len = transformers.length; j < len; j += 1) {\n        transformers[j](result, data)\n      }\n\n      finalOutput.push(data)\n    }\n\n    return finalOutput\n  }\n\n  _log () {\n    if (this.options.verbose) {\n      console.log(...arguments)\n    }\n  }\n}\n\nmodule.exports = Fuse\n\n\n// WEBPACK FOOTER //\n// ./src/index.js"],"sourceRoot":""}