mkdocs-material/material/assets/javascripts/search.js.map

{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/lunr/lunr.js","webpack:///./node_modules/escape-html/index.js","webpack:///./src/assets/javascripts/workers/search/_/index.ts","webpack:///./src/assets/javascripts/workers/search/main/index.ts","webpack:///./src/assets/javascripts/modules/search/_/index.ts","webpack:///./src/assets/javascripts/modules/search/document/index.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","global","step2list","step3list","v","C","re_mgr0","re_mgr1","re_meq1","re_s_v","re_1a","re2_1a","re_1b","re2_1b","re_1b_2","re2_1b_2","re3_1b_2","re4_1b_2","re_1c","re_2","re_3","re_4","re2_4","re_5","re_5_1","re3_5","porterStemmer","lunr","config","builder","Builder","pipeline","add","trimmer","stopWordFilter","stemmer","searchPipeline","build","version","utils","warn","this","message","console","asString","obj","toString","clone","keys","length","val","Array","isArray","slice","TypeError","FieldRef","docRef","fieldName","stringValue","_stringValue","joiner","fromString","indexOf","fieldRef","undefined","Set","elements","complete","intersect","other","union","contains","empty","a","b","intersection","element","push","concat","idf","posting","documentCount","documentsWithTerm","x","Math","log","abs","Token","str","metadata","update","fn","tokenizer","map","toLowerCase","trim","len","tokens","sliceEnd","sliceStart","sliceLength","charAt","match","separator","tokenMetadata","Pipeline","_stack","registeredFunctions","registerFunction","label","warnIfFunctionNotRegistered","load","serialised","forEach","fnName","Error","fns","arguments","after","existingFn","newFn","pos","splice","before","remove","run","stackLength","memo","j","result","k","runString","token","reset","toJSON","Vector","_magnitude","positionForIndex","index","start","end","pivotPoint","floor","pivotIndex","insert","insertIdx","upsert","position","magnitude","sumOfSquares","elementsLength","sqrt","dot","otherVector","dotProduct","aLen","bLen","aVal","bVal","similarity","toArray","output","RegExp","w","stem","suffix","firstch","re","re2","re3","re4","substr","toUpperCase","test","replace","fp","exec","generateStopWordFilter","stopWords","words","reduce","stopWord","TokenSet","final","edges","id","_nextId","fromArray","arr","finish","root","fromClause","clause","fromFuzzyString","term","editDistance","stack","node","editsRemaining","frame","pop","noEditNode","char","insertionNode","substitutionNode","transposeNode","charA","charB","next","prefix","edge","_str","labels","sort","qNode","qEdges","qLen","nEdges","nLen","q","qEdge","nEdge","previousWord","uncheckedNodes","minimizedNodes","word","commonPrefix","minimize","child","nextNode","parent","downTo","childKey","Index","attrs","invertedIndex","fieldVectors","tokenSet","fields","search","queryString","query","QueryParser","parse","Query","matchingFields","queryVectors","termFieldCache","requiredMatches","prohibitedMatches","clauses","terms","clauseMatches","usePipeline","termTokenSet","expandedTerms","presence","REQUIRED","field","expandedTerm","termIndex","_index","fieldPosting","matchingDocumentRefs","termField","matchingDocumentsSet","PROHIBITED","boost","fieldMatch","matchingDocumentRef","matchingFieldRef","MatchData","allRequiredMatches","allProhibitedMatches","matchingFieldRefs","results","matches","isNegated","docMatch","fieldVector","score","matchData","combine","ref","serializedIndex","serializedVectors","serializedInvertedIndex","tokenSetBuilder","tuple","_ref","_fields","_documents","fieldTermFrequencies","fieldLengths","_b","_k1","metadataWhitelist","attributes","RangeError","number","k1","doc","extractor","fieldTerms","metadataKey","calculateAverageFieldLengths","fieldRefs","numberOfFields","accumulator","documentsWithField","averageFieldLength","createFieldVectors","fieldRefsLength","termIdfCache","fieldLength","termFrequencies","termsLength","fieldBoost","docBoost","scoreWithPrecision","tf","round","createTokenSet","use","args","unshift","apply","clonedMetadata","metadataKeys","otherMatchData","allFields","wildcard","String","NONE","LEADING","TRAILING","OPTIONAL","options","QueryParseError","QueryLexer","lexemes","escapeCharPositions","state","lexText","sliceString","subSlices","join","emit","type","escapeCharacter","EOS","width","ignore","backup","acceptDigitRun","charCode","charCodeAt","more","FIELD","TERM","EDIT_DISTANCE","BOOST","PRESENCE","lexField","lexer","lexTerm","lexEditDistance","lexBoost","lexEOS","termSeparator","currentClause","lexemeIdx","parseClause","peekLexeme","consumeLexeme","lexeme","nextClause","completedClause","parser","parsePresence","parseField","parseTerm","errorMessage","nextLexeme","possibleFields","f","parseEditDistance","parseBoost","parseInt","isNaN","matchHtmlRegExp","string","escape","html","lastIndex","substring","SearchMessageType","defaultOptions","stopwords","docs","documents","Map","path","hash","location","title","text","article","section","set","setupSearchDocumentMap","JSON","groups","document","sections","stringify","handler","SETUP","data","DUMP","QUERY","RESULT","addEventListener","ev","postMessage"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,kBClFrD;;;;;IAMC,WAiCD,IAoC6BC,EAw2BvBC,EAwBFC,EAWAC,EACAC,EAQEC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EAEAC,EAEAC,EACAC,EAEAC,EACAC,EACAC,EAEAC,EAl9BFC,EAAO,SAAUC,GACnB,IAAIC,EAAU,IAAIF,EAAKG,QAavB,OAXAD,EAAQE,SAASC,IACfL,EAAKM,QACLN,EAAKO,eACLP,EAAKQ,SAGPN,EAAQO,eAAeJ,IACrBL,EAAKQ,SAGPP,EAAOxD,KAAKyD,EAASA,GACdA,EAAQQ,SAGjBV,EAAKW,QAAU;;;;IAUfX,EAAKY,MAAQ,GASbZ,EAAKY,MAAMC,MAAkBvC,EAQ1BwC,KANM,SAAUC,GACXzC,EAAO0C,SAAWA,QAAQH,MAC5BG,QAAQH,KAAKE,KAiBnBf,EAAKY,MAAMK,SAAW,SAAUC,GAC9B,OAAIA,QACK,GAEAA,EAAIC,YAoBfnB,EAAKY,MAAMQ,MAAQ,SAAUF,GAC3B,GAAIA,QACF,OAAOA,EAMT,IAHA,IAAIE,EAAQpE,OAAOY,OAAO,MACtByD,EAAOrE,OAAOqE,KAAKH,GAEd5E,EAAI,EAAGA,EAAI+E,EAAKC,OAAQhF,IAAK,CACpC,IAAIuB,EAAMwD,EAAK/E,GACXiF,EAAML,EAAIrD,GAEd,GAAI2D,MAAMC,QAAQF,GAChBH,EAAMvD,GAAO0D,EAAIG,YADnB,CAKA,GAAmB,iBAARH,GACQ,iBAARA,GACQ,kBAARA,EAKX,MAAM,IAAII,UAAU,yDAJlBP,EAAMvD,GAAO0D,GAOjB,OAAOH,GAETpB,EAAK4B,SAAW,SAAUC,EAAQC,EAAWC,GAC3CjB,KAAKe,OAASA,EACdf,KAAKgB,UAAYA,EACjBhB,KAAKkB,aAAeD,GAGtB/B,EAAK4B,SAASK,OAAS,IAEvBjC,EAAK4B,SAASM,WAAa,SAAU7D,GACnC,IAAIN,EAAIM,EAAE8D,QAAQnC,EAAK4B,SAASK,QAEhC,IAAW,IAAPlE,EACF,KAAM,6BAGR,IAAIqE,EAAW/D,EAAEqD,MAAM,EAAG3D,GACtB8D,EAASxD,EAAEqD,MAAM3D,EAAI,GAEzB,OAAO,IAAIiC,EAAK4B,SAAUC,EAAQO,EAAU/D,IAG9C2B,EAAK4B,SAAS1D,UAAUiD,SAAW,WAKjC,OAJyBkB,MAArBvB,KAAKkB,eACPlB,KAAKkB,aAAelB,KAAKgB,UAAY9B,EAAK4B,SAASK,OAASnB,KAAKe,QAG5Df,KAAKkB;;;;IAYdhC,EAAKsC,IAAM,SAAUC,GAGnB,GAFAzB,KAAKyB,SAAWvF,OAAOY,OAAO,MAE1B2E,EAAU,CACZzB,KAAKQ,OAASiB,EAASjB,OAEvB,IAAK,IAAIhF,EAAI,EAAGA,EAAIwE,KAAKQ,OAAQhF,IAC/BwE,KAAKyB,SAASA,EAASjG,KAAM,OAG/BwE,KAAKQ,OAAS,GAWlBtB,EAAKsC,IAAIE,SAAW,CAClBC,UAAW,SAAUC,GACnB,OAAOA,GAGTC,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAWX5C,EAAKsC,IAAIO,MAAQ,CACfJ,UAAW,WACT,OAAO3B,MAGT6B,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAUX5C,EAAKsC,IAAIpE,UAAU0E,SAAW,SAAU5E,GACtC,QAAS8C,KAAKyB,SAASvE,IAWzBgC,EAAKsC,IAAIpE,UAAUuE,UAAY,SAAUC,GACvC,IAAII,EAAGC,EAAGR,EAAUS,EAAe,GAEnC,GAAIN,IAAU1C,EAAKsC,IAAIE,SACrB,OAAO1B,KAGT,GAAI4B,IAAU1C,EAAKsC,IAAIO,MACrB,OAAOH,EAGL5B,KAAKQ,OAASoB,EAAMpB,QACtBwB,EAAIhC,KACJiC,EAAIL,IAEJI,EAAIJ,EACJK,EAAIjC,MAGNyB,EAAWvF,OAAOqE,KAAKyB,EAAEP,UAEzB,IAAK,IAAIjG,EAAI,EAAGA,EAAIiG,EAASjB,OAAQhF,IAAK,CACxC,IAAI2G,EAAUV,EAASjG,GACnB2G,KAAWF,EAAER,UACfS,EAAaE,KAAKD,GAItB,OAAO,IAAIjD,EAAKsC,IAAKU,IAUvBhD,EAAKsC,IAAIpE,UAAUyE,MAAQ,SAAUD,GACnC,OAAIA,IAAU1C,EAAKsC,IAAIE,SACdxC,EAAKsC,IAAIE,SAGdE,IAAU1C,EAAKsC,IAAIO,MACd/B,KAGF,IAAId,EAAKsC,IAAItF,OAAOqE,KAAKP,KAAKyB,UAAUY,OAAOnG,OAAOqE,KAAKqB,EAAMH,aAU1EvC,EAAKoD,IAAM,SAAUC,EAASC,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAIzB,KAAauB,EACH,UAAbvB,IACJyB,GAAqBvG,OAAOqE,KAAKgC,EAAQvB,IAAYR,QAGvD,IAAIkC,GAAKF,EAAgBC,EAAoB,KAAQA,EAAoB,IAEzE,OAAOE,KAAKC,IAAI,EAAID,KAAKE,IAAIH,KAW/BxD,EAAK4D,MAAQ,SAAUC,EAAKC,GAC1BhD,KAAK+C,IAAMA,GAAO,GAClB/C,KAAKgD,SAAWA,GAAY,IAQ9B9D,EAAK4D,MAAM1F,UAAUiD,SAAW,WAC9B,OAAOL,KAAK+C,KAuBd7D,EAAK4D,MAAM1F,UAAU6F,OAAS,SAAUC,GAEtC,OADAlD,KAAK+C,IAAMG,EAAGlD,KAAK+C,IAAK/C,KAAKgD,UACtBhD,MAUTd,EAAK4D,MAAM1F,UAAUkD,MAAQ,SAAU4C,GAErC,OADAA,EAAKA,GAAM,SAAU3F,GAAK,OAAOA,GAC1B,IAAI2B,EAAK4D,MAAOI,EAAGlD,KAAK+C,IAAK/C,KAAKgD,UAAWhD,KAAKgD;;;;IAyB3D9D,EAAKiE,UAAY,SAAU/C,EAAK4C,GAC9B,GAAW,MAAP5C,GAAsBmB,MAAPnB,EACjB,MAAO,GAGT,GAAIM,MAAMC,QAAQP,GAChB,OAAOA,EAAIgD,KAAI,SAAU1G,GACvB,OAAO,IAAIwC,EAAK4D,MACd5D,EAAKY,MAAMK,SAASzD,GAAG2G,cACvBnE,EAAKY,MAAMQ,MAAM0C,OASvB,IAJA,IAAID,EAAM3C,EAAIC,WAAWiD,OAAOD,cAC5BE,EAAMR,EAAIvC,OACVgD,EAAS,GAEJC,EAAW,EAAGC,EAAa,EAAGD,GAAYF,EAAKE,IAAY,CAClE,IACIE,EAAcF,EAAWC,EAE7B,GAHWX,EAAIa,OAAOH,GAGZI,MAAM3E,EAAKiE,UAAUW,YAAcL,GAAYF,EAAM,CAE7D,GAAII,EAAc,EAAG,CACnB,IAAII,EAAgB7E,EAAKY,MAAMQ,MAAM0C,IAAa,GAClDe,EAAwB,SAAI,CAACL,EAAYC,GACzCI,EAAqB,MAAIP,EAAOhD,OAEhCgD,EAAOpB,KACL,IAAIlD,EAAK4D,MACPC,EAAInC,MAAM8C,EAAYD,GACtBM,IAKNL,EAAaD,EAAW,GAK5B,OAAOD,GAUTtE,EAAKiE,UAAUW,UAAY;;;;IAmC3B5E,EAAK8E,SAAW,WACdhE,KAAKiE,OAAS,IAGhB/E,EAAK8E,SAASE,oBAAsBhI,OAAOY,OAAO,MAmClDoC,EAAK8E,SAASG,iBAAmB,SAAUjB,EAAIkB,GACzCA,KAASpE,KAAKkE,qBAChBhF,EAAKY,MAAMC,KAAK,6CAA+CqE,GAGjElB,EAAGkB,MAAQA,EACXlF,EAAK8E,SAASE,oBAAoBhB,EAAGkB,OAASlB,GAShDhE,EAAK8E,SAASK,4BAA8B,SAAUnB,GACjCA,EAAGkB,OAAUlB,EAAGkB,SAASpE,KAAKkE,qBAG/ChF,EAAKY,MAAMC,KAAK,kGAAmGmD,IAcvHhE,EAAK8E,SAASM,KAAO,SAAUC,GAC7B,IAAIjF,EAAW,IAAIJ,EAAK8E,SAYxB,OAVAO,EAAWC,SAAQ,SAAUC,GAC3B,IAAIvB,EAAKhE,EAAK8E,SAASE,oBAAoBO,GAE3C,IAAIvB,EAGF,MAAM,IAAIwB,MAAM,sCAAwCD,GAFxDnF,EAASC,IAAI2D,MAMV5D,GAUTJ,EAAK8E,SAAS5G,UAAUmC,IAAM,WAC5B,IAAIoF,EAAMjE,MAAMtD,UAAUwD,MAAMjF,KAAKiJ,WAErCD,EAAIH,SAAQ,SAAUtB,GACpBhE,EAAK8E,SAASK,4BAA4BnB,GAC1ClD,KAAKiE,OAAO7B,KAAKc,KAChBlD,OAYLd,EAAK8E,SAAS5G,UAAUyH,MAAQ,SAAUC,EAAYC,GACpD7F,EAAK8E,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMhF,KAAKiE,OAAO5C,QAAQyD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlBM,GAAY,EACZhF,KAAKiE,OAAOgB,OAAOD,EAAK,EAAGD,IAY7B7F,EAAK8E,SAAS5G,UAAU8H,OAAS,SAAUJ,EAAYC,GACrD7F,EAAK8E,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMhF,KAAKiE,OAAO5C,QAAQyD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlB1E,KAAKiE,OAAOgB,OAAOD,EAAK,EAAGD,IAQ7B7F,EAAK8E,SAAS5G,UAAU+H,OAAS,SAAUjC,GACzC,IAAI8B,EAAMhF,KAAKiE,OAAO5C,QAAQ6B,IAClB,GAAR8B,GAIJhF,KAAKiE,OAAOgB,OAAOD,EAAK,IAU1B9F,EAAK8E,SAAS5G,UAAUgI,IAAM,SAAU5B,GAGtC,IAFA,IAAI6B,EAAcrF,KAAKiE,OAAOzD,OAErBhF,EAAI,EAAGA,EAAI6J,EAAa7J,IAAK,CAIpC,IAHA,IAAI0H,EAAKlD,KAAKiE,OAAOzI,GACjB8J,EAAO,GAEFC,EAAI,EAAGA,EAAI/B,EAAOhD,OAAQ+E,IAAK,CACtC,IAAIC,EAAStC,EAAGM,EAAO+B,GAAIA,EAAG/B,GAE9B,QAAe,IAAXgC,GAAgC,KAAXA,EAEzB,GAAI9E,MAAMC,QAAQ6E,GAChB,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAOhF,OAAQiF,IACjCH,EAAKlD,KAAKoD,EAAOC,SAGnBH,EAAKlD,KAAKoD,GAIdhC,EAAS8B,EAGX,OAAO9B,GAaTtE,EAAK8E,SAAS5G,UAAUsI,UAAY,SAAU3C,EAAKC,GACjD,IAAI2C,EAAQ,IAAIzG,EAAK4D,MAAOC,EAAKC,GAEjC,OAAOhD,KAAKoF,IAAI,CAACO,IAAQvC,KAAI,SAAU1G,GACrC,OAAOA,EAAE2D,eAQbnB,EAAK8E,SAAS5G,UAAUwI,MAAQ,WAC9B5F,KAAKiE,OAAS,IAUhB/E,EAAK8E,SAAS5G,UAAUyI,OAAS,WAC/B,OAAO7F,KAAKiE,OAAOb,KAAI,SAAUF,GAG/B,OAFAhE,EAAK8E,SAASK,4BAA4BnB,GAEnCA,EAAGkB;;;;IAwBdlF,EAAK4G,OAAS,SAAUrE,GACtBzB,KAAK+F,WAAa,EAClB/F,KAAKyB,SAAWA,GAAY,IAc9BvC,EAAK4G,OAAO1I,UAAU4I,iBAAmB,SAAUC,GAEjD,GAA4B,GAAxBjG,KAAKyB,SAASjB,OAChB,OAAO,EAST,IANA,IAAI0F,EAAQ,EACRC,EAAMnG,KAAKyB,SAASjB,OAAS,EAC7BmD,EAAcwC,EAAMD,EACpBE,EAAazD,KAAK0D,MAAM1C,EAAc,GACtC2C,EAAatG,KAAKyB,SAAsB,EAAb2E,GAExBzC,EAAc,IACf2C,EAAaL,IACfC,EAAQE,GAGNE,EAAaL,IACfE,EAAMC,GAGJE,GAAcL,IAIlBtC,EAAcwC,EAAMD,EACpBE,EAAaF,EAAQvD,KAAK0D,MAAM1C,EAAc,GAC9C2C,EAAatG,KAAKyB,SAAsB,EAAb2E,GAG7B,OAAIE,GAAcL,EACI,EAAbG,EAGLE,EAAaL,EACK,EAAbG,EAGLE,EAAaL,EACW,GAAlBG,EAAa,QADvB,GAcFlH,EAAK4G,OAAO1I,UAAUmJ,OAAS,SAAUC,EAAW/F,GAClDT,KAAKyG,OAAOD,EAAW/F,GAAK,WAC1B,KAAM,sBAYVvB,EAAK4G,OAAO1I,UAAUqJ,OAAS,SAAUD,EAAW/F,EAAKyC,GACvDlD,KAAK+F,WAAa,EAClB,IAAIW,EAAW1G,KAAKgG,iBAAiBQ,GAEjCxG,KAAKyB,SAASiF,IAAaF,EAC7BxG,KAAKyB,SAASiF,EAAW,GAAKxD,EAAGlD,KAAKyB,SAASiF,EAAW,GAAIjG,GAE9DT,KAAKyB,SAASwD,OAAOyB,EAAU,EAAGF,EAAW/F,IASjDvB,EAAK4G,OAAO1I,UAAUuJ,UAAY,WAChC,GAAI3G,KAAK+F,WAAY,OAAO/F,KAAK+F,WAKjC,IAHA,IAAIa,EAAe,EACfC,EAAiB7G,KAAKyB,SAASjB,OAE1BhF,EAAI,EAAGA,EAAIqL,EAAgBrL,GAAK,EAAG,CAC1C,IAAIiF,EAAMT,KAAKyB,SAASjG,GACxBoL,GAAgBnG,EAAMA,EAGxB,OAAOT,KAAK+F,WAAapD,KAAKmE,KAAKF,IASrC1H,EAAK4G,OAAO1I,UAAU2J,IAAM,SAAUC,GAOpC,IANA,IAAIC,EAAa,EACbjF,EAAIhC,KAAKyB,SAAUQ,EAAI+E,EAAYvF,SACnCyF,EAAOlF,EAAExB,OAAQ2G,EAAOlF,EAAEzB,OAC1B4G,EAAO,EAAGC,EAAO,EACjB7L,EAAI,EAAG+J,EAAI,EAER/J,EAAI0L,GAAQ3B,EAAI4B,IACrBC,EAAOpF,EAAExG,KAAI6L,EAAOpF,EAAEsD,IAEpB/J,GAAK,EACI4L,EAAOC,EAChB9B,GAAK,EACI6B,GAAQC,IACjBJ,GAAcjF,EAAExG,EAAI,GAAKyG,EAAEsD,EAAI,GAC/B/J,GAAK,EACL+J,GAAK,GAIT,OAAO0B,GAUT/H,EAAK4G,OAAO1I,UAAUkK,WAAa,SAAUN,GAC3C,OAAOhH,KAAK+G,IAAIC,GAAehH,KAAK2G,aAAe,GAQrDzH,EAAK4G,OAAO1I,UAAUmK,QAAU,WAG9B,IAFA,IAAIC,EAAS,IAAI9G,MAAOV,KAAKyB,SAASjB,OAAS,GAEtChF,EAAI,EAAG+J,EAAI,EAAG/J,EAAIwE,KAAKyB,SAASjB,OAAQhF,GAAK,EAAG+J,IACvDiC,EAAOjC,GAAKvF,KAAKyB,SAASjG,GAG5B,OAAOgM,GAQTtI,EAAK4G,OAAO1I,UAAUyI,OAAS,WAC7B,OAAO7F,KAAKyB;;;;;IAoBdvC,EAAKQ,SACCjC,EAAY,CACZ,QAAY,MACZ,OAAW,OACX,KAAS,OACT,KAAS,OACT,KAAS,MACT,IAAQ,MACR,KAAS,KACT,MAAU,MACV,IAAQ,IACR,MAAU,MACV,QAAY,MACZ,MAAU,MACV,KAAS,MACT,MAAU,KACV,QAAY,MACZ,QAAY,MACZ,QAAY,MACZ,MAAU,KACV,MAAU,MACV,OAAW,MACX,KAAS,OAGXC,EAAY,CACV,MAAU,KACV,MAAU,GACV,MAAU,KACV,MAAU,KACV,KAAS,KACT,IAAQ,GACR,KAAS,IAIXC,EAAI,WACJC,EAAI/B,qBAQFgC,EAAU,IAAI4J,OALT,4DAML3J,EAAU,IAAI2J,OAJT,8FAKL1J,EAAU,IAAI0J,OANT,gFAOLzJ,EAAS,IAAIyJ,OALT,kCAOJxJ,EAAQ,kBACRC,EAAS,iBACTC,EAAQ,aACRC,EAAS,kBACTC,EAAU,KACVC,EAAW,cACXC,EAAW,IAAIkJ,OAAO,sBACtBjJ,EAAW,IAAIiJ,OAAO,IAAM7J,EAAID,EAAI,gBAEpCc,EAAQ,mBACRC,EAAO,2IAEPC,EAAO,iDAEPC,EAAO,sFACPC,EAAQ,oBAERC,EAAO,WACPC,EAAS,MACTC,EAAQ,IAAIyI,OAAO,IAAM7J,EAAID,EAAI,gBAEjCsB,EAAgB,SAAuByI,GACzC,IAAIC,EACFC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEF,GAAIP,EAAElH,OAAS,EAAK,OAAOkH,EAiB3B,GAde,MADfG,EAAUH,EAAEQ,OAAO,EAAE,MAEnBR,EAAIG,EAAQM,cAAgBT,EAAEQ,OAAO,IAKvCH,EAAM7J,GADN4J,EAAK7J,GAGEmK,KAAKV,GAAMA,EAAIA,EAAEW,QAAQP,EAAG,QAC1BC,EAAIK,KAAKV,KAAMA,EAAIA,EAAEW,QAAQN,EAAI,SAI1CA,EAAM3J,GADN0J,EAAK3J,GAEEiK,KAAKV,GAAI,CACd,IAAIY,EAAKR,EAAGS,KAAKb,IACjBI,EAAKjK,GACEuK,KAAKE,EAAG,MACbR,EAAKzJ,EACLqJ,EAAIA,EAAEW,QAAQP,EAAG,UAEVC,EAAIK,KAAKV,KAElBC,GADIW,EAAKP,EAAIQ,KAAKb,IACR,IACVK,EAAM/J,GACEoK,KAAKT,KAGXK,EAAMzJ,EACN0J,EAAMzJ,GAFNuJ,EAAMzJ,GAGE8J,KAJRV,EAAIC,GAIeD,GAAQ,IAClBM,EAAII,KAAKV,IAAMI,EAAKzJ,EAASqJ,EAAIA,EAAEW,QAAQP,EAAG,KAC9CG,EAAIG,KAAKV,KAAMA,GAAQ,OAiFpC,OA5EAI,EAAKrJ,GACE2J,KAAKV,KAGVA,GADAC,GADIW,EAAKR,EAAGS,KAAKb,IACP,IACC,MAIbI,EAAKpJ,GACE0J,KAAKV,KAEVC,GADIW,EAAKR,EAAGS,KAAKb,IACP,GACVE,EAASU,EAAG,IACZR,EAAKjK,GACEuK,KAAKT,KACVD,EAAIC,EAAOlK,EAAUmK,MAKzBE,EAAKnJ,GACEyJ,KAAKV,KAEVC,GADIW,EAAKR,EAAGS,KAAKb,IACP,GACVE,EAASU,EAAG,IACZR,EAAKjK,GACEuK,KAAKT,KACVD,EAAIC,EAAOjK,EAAUkK,KAMzBG,EAAMlJ,GADNiJ,EAAKlJ,GAEEwJ,KAAKV,IAEVC,GADIW,EAAKR,EAAGS,KAAKb,IACP,IACVI,EAAKhK,GACEsK,KAAKT,KACVD,EAAIC,IAEGI,EAAIK,KAAKV,KAElBC,GADIW,EAAKP,EAAIQ,KAAKb,IACR,GAAKY,EAAG,IAClBP,EAAMjK,GACEsK,KAAKT,KACXD,EAAIC,KAKRG,EAAKhJ,GACEsJ,KAAKV,KAEVC,GADIW,EAAKR,EAAGS,KAAKb,IACP,GAEVK,EAAMhK,EACNiK,EAAMhJ,IAFN8I,EAAKhK,GAGEsK,KAAKT,IAAUI,EAAIK,KAAKT,KAAWK,EAAII,KAAKT,MACjDD,EAAIC,IAKRI,EAAMjK,GADNgK,EAAK/I,GAEEqJ,KAAKV,IAAMK,EAAIK,KAAKV,KACzBI,EAAKzJ,EACLqJ,EAAIA,EAAEW,QAAQP,EAAG,KAKJ,KAAXD,IACFH,EAAIG,EAAQxE,cAAgBqE,EAAEQ,OAAO,IAGhCR,GAGF,SAAU/B,GACf,OAAOA,EAAM1C,OAAOhE,KAIxBC,EAAK8E,SAASG,iBAAiBjF,EAAKQ,QAAS;;;;IAmB7CR,EAAKsJ,uBAAyB,SAAUC,GACtC,IAAIC,EAAQD,EAAUE,QAAO,SAAUrD,EAAMsD,GAE3C,OADAtD,EAAKsD,GAAYA,EACVtD,IACN,IAEH,OAAO,SAAUK,GACf,GAAIA,GAAS+C,EAAM/C,EAAMtF,cAAgBsF,EAAMtF,WAAY,OAAOsF,IAiBtEzG,EAAKO,eAAiBP,EAAKsJ,uBAAuB,CAChD,IACA,OACA,QACA,SACA,QACA,MACA,SACA,OACA,KACA,QACA,KACA,MACA,MACA,MACA,KACA,KACA,KACA,UACA,OACA,MACA,KACA,MACA,SACA,QACA,OACA,MACA,KACA,OACA,SACA,OACA,OACA,QACA,MACA,OACA,MACA,MACA,MACA,MACA,OACA,KACA,MACA,OACA,MACA,MACA,MACA,UACA,IACA,KACA,KACA,OACA,KACA,KACA,MACA,OACA,QACA,MACA,OACA,SACA,MACA,KACA,QACA,OACA,OACA,KACA,UACA,KACA,MACA,MACA,KACA,MACA,QACA,KACA,OACA,KACA,QACA,MACA,MACA,SACA,OACA,MACA,OACA,MACA,SACA,QACA,KACA,OACA,OACA,OACA,MACA,QACA,OACA,OACA,QACA,QACA,OACA,OACA,MACA,KACA,MACA,OACA,KACA,QACA,MACA,KACA,OACA,OACA,OACA,QACA,QACA,QACA,MACA,OACA,MACA,OACA,OACA,QACA,MACA,MACA,SAGFtJ,EAAK8E,SAASG,iBAAiBjF,EAAKO,eAAgB;;;;IAqBpDP,EAAKM,QAAU,SAAUmG,GACvB,OAAOA,EAAM1C,QAAO,SAAU1F,GAC5B,OAAOA,EAAE8K,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,QAIjDnJ,EAAK8E,SAASG,iBAAiBjF,EAAKM,QAAS;;;;IA2B7CN,EAAK2J,SAAW,WACd7I,KAAK8I,OAAQ,EACb9I,KAAK+I,MAAQ,GACb/I,KAAKgJ,GAAK9J,EAAK2J,SAASI,QACxB/J,EAAK2J,SAASI,SAAW,GAW3B/J,EAAK2J,SAASI,QAAU,EASxB/J,EAAK2J,SAASK,UAAY,SAAUC,GAGlC,IAFA,IAAI/J,EAAU,IAAIF,EAAK2J,SAASxJ,QAEvB7D,EAAI,EAAG+H,EAAM4F,EAAI3I,OAAQhF,EAAI+H,EAAK/H,IACzC4D,EAAQmH,OAAO4C,EAAI3N,IAIrB,OADA4D,EAAQgK,SACDhK,EAAQiK,MAYjBnK,EAAK2J,SAASS,WAAa,SAAUC,GACnC,MAAI,iBAAkBA,EACbrK,EAAK2J,SAASW,gBAAgBD,EAAOE,KAAMF,EAAOG,cAElDxK,EAAK2J,SAASzH,WAAWmI,EAAOE,OAmB3CvK,EAAK2J,SAASW,gBAAkB,SAAUzG,EAAK2G,GAS7C,IARA,IAAIL,EAAO,IAAInK,EAAK2J,SAEhBc,EAAQ,CAAC,CACXC,KAAMP,EACNQ,eAAgBH,EAChB3G,IAAKA,IAGA4G,EAAMnJ,QAAQ,CACnB,IAAIsJ,EAAQH,EAAMI,MAGlB,GAAID,EAAM/G,IAAIvC,OAAS,EAAG,CACxB,IACIwJ,EADAC,EAAOH,EAAM/G,IAAIa,OAAO,GAGxBqG,KAAQH,EAAMF,KAAKb,MACrBiB,EAAaF,EAAMF,KAAKb,MAAMkB,IAE9BD,EAAa,IAAI9K,EAAK2J,SACtBiB,EAAMF,KAAKb,MAAMkB,GAAQD,GAGH,GAApBF,EAAM/G,IAAIvC,SACZwJ,EAAWlB,OAAQ,GAGrBa,EAAMvH,KAAK,CACTwH,KAAMI,EACNH,eAAgBC,EAAMD,eACtB9G,IAAK+G,EAAM/G,IAAInC,MAAM,KAIzB,GAA4B,GAAxBkJ,EAAMD,eAAV,CAKA,GAAI,MAAOC,EAAMF,KAAKb,MACpB,IAAImB,EAAgBJ,EAAMF,KAAKb,MAAM,SAChC,CACDmB,EAAgB,IAAIhL,EAAK2J,SAC7BiB,EAAMF,KAAKb,MAAM,KAAOmB,EAiC1B,GA9BwB,GAApBJ,EAAM/G,IAAIvC,SACZ0J,EAAcpB,OAAQ,GAGxBa,EAAMvH,KAAK,CACTwH,KAAMM,EACNL,eAAgBC,EAAMD,eAAiB,EACvC9G,IAAK+G,EAAM/G,MAMT+G,EAAM/G,IAAIvC,OAAS,GACrBmJ,EAAMvH,KAAK,CACTwH,KAAME,EAAMF,KACZC,eAAgBC,EAAMD,eAAiB,EACvC9G,IAAK+G,EAAM/G,IAAInC,MAAM,KAMD,GAApBkJ,EAAM/G,IAAIvC,SACZsJ,EAAMF,KAAKd,OAAQ,GAMjBgB,EAAM/G,IAAIvC,QAAU,EAAG,CACzB,GAAI,MAAOsJ,EAAMF,KAAKb,MACpB,IAAIoB,EAAmBL,EAAMF,KAAKb,MAAM,SACnC,CACDoB,EAAmB,IAAIjL,EAAK2J,SAChCiB,EAAMF,KAAKb,MAAM,KAAOoB,EAGF,GAApBL,EAAM/G,IAAIvC,SACZ2J,EAAiBrB,OAAQ,GAG3Ba,EAAMvH,KAAK,CACTwH,KAAMO,EACNN,eAAgBC,EAAMD,eAAiB,EACvC9G,IAAK+G,EAAM/G,IAAInC,MAAM,KAOzB,GAAIkJ,EAAM/G,IAAIvC,OAAS,EAAG,CACxB,IAEI4J,EAFAC,EAAQP,EAAM/G,IAAIa,OAAO,GACzB0G,EAAQR,EAAM/G,IAAIa,OAAO,GAGzB0G,KAASR,EAAMF,KAAKb,MACtBqB,EAAgBN,EAAMF,KAAKb,MAAMuB,IAEjCF,EAAgB,IAAIlL,EAAK2J,SACzBiB,EAAMF,KAAKb,MAAMuB,GAASF,GAGJ,GAApBN,EAAM/G,IAAIvC,SACZ4J,EAActB,OAAQ,GAGxBa,EAAMvH,KAAK,CACTwH,KAAMQ,EACNP,eAAgBC,EAAMD,eAAiB,EACvC9G,IAAKsH,EAAQP,EAAM/G,IAAInC,MAAM,OAKnC,OAAOyI,GAaTnK,EAAK2J,SAASzH,WAAa,SAAU2B,GAYnC,IAXA,IAAI6G,EAAO,IAAI1K,EAAK2J,SAChBQ,EAAOO,EAUFpO,EAAI,EAAG+H,EAAMR,EAAIvC,OAAQhF,EAAI+H,EAAK/H,IAAK,CAC9C,IAAIyO,EAAOlH,EAAIvH,GACXsN,EAAStN,GAAK+H,EAAM,EAExB,GAAY,KAAR0G,EACFL,EAAKb,MAAMkB,GAAQL,EACnBA,EAAKd,MAAQA,MAER,CACL,IAAIyB,EAAO,IAAIrL,EAAK2J,SACpB0B,EAAKzB,MAAQA,EAEbc,EAAKb,MAAMkB,GAAQM,EACnBX,EAAOW,GAIX,OAAOlB,GASTnK,EAAK2J,SAASzL,UAAUmK,QAAU,WAQhC,IAPA,IAAImB,EAAQ,GAERiB,EAAQ,CAAC,CACXa,OAAQ,GACRZ,KAAM5J,OAGD2J,EAAMnJ,QAAQ,CACnB,IAAIsJ,EAAQH,EAAMI,MACdhB,EAAQ7M,OAAOqE,KAAKuJ,EAAMF,KAAKb,OAC/BxF,EAAMwF,EAAMvI,OAEZsJ,EAAMF,KAAKd,QAKbgB,EAAMU,OAAO5G,OAAO,GACpB8E,EAAMtG,KAAK0H,EAAMU,SAGnB,IAAK,IAAIhP,EAAI,EAAGA,EAAI+H,EAAK/H,IAAK,CAC5B,IAAIiP,EAAO1B,EAAMvN,GAEjBmO,EAAMvH,KAAK,CACToI,OAAQV,EAAMU,OAAOnI,OAAOoI,GAC5Bb,KAAME,EAAMF,KAAKb,MAAM0B,MAK7B,OAAO/B,GAaTxJ,EAAK2J,SAASzL,UAAUiD,SAAW,WASjC,GAAIL,KAAK0K,KACP,OAAO1K,KAAK0K,KAOd,IAJA,IAAI3H,EAAM/C,KAAK8I,MAAQ,IAAM,IACzB6B,EAASzO,OAAOqE,KAAKP,KAAK+I,OAAO6B,OACjCrH,EAAMoH,EAAOnK,OAERhF,EAAI,EAAGA,EAAI+H,EAAK/H,IAAK,CAC5B,IAAI4I,EAAQuG,EAAOnP,GAGnBuH,EAAMA,EAAMqB,EAFDpE,KAAK+I,MAAM3E,GAEG4E,GAG3B,OAAOjG,GAaT7D,EAAK2J,SAASzL,UAAUuE,UAAY,SAAUM,GAU5C,IATA,IAAIuF,EAAS,IAAItI,EAAK2J,SAClBiB,OAAQvI,EAERoI,EAAQ,CAAC,CACXkB,MAAO5I,EACPuF,OAAQA,EACRoC,KAAM5J,OAGD2J,EAAMnJ,QAAQ,CACnBsJ,EAAQH,EAAMI,MAWd,IALA,IAAIe,EAAS5O,OAAOqE,KAAKuJ,EAAMe,MAAM9B,OACjCgC,EAAOD,EAAOtK,OACdwK,EAAS9O,OAAOqE,KAAKuJ,EAAMF,KAAKb,OAChCkC,EAAOD,EAAOxK,OAET0K,EAAI,EAAGA,EAAIH,EAAMG,IAGxB,IAFA,IAAIC,EAAQL,EAAOI,GAEVjO,EAAI,EAAGA,EAAIgO,EAAMhO,IAAK,CAC7B,IAAImO,EAAQJ,EAAO/N,GAEnB,GAAImO,GAASD,GAAkB,KAATA,EAAc,CAClC,IAAIvB,EAAOE,EAAMF,KAAKb,MAAMqC,GACxBP,EAAQf,EAAMe,MAAM9B,MAAMoC,GAC1BrC,EAAQc,EAAKd,OAAS+B,EAAM/B,MAC5ByB,OAAOhJ,EAEP6J,KAAStB,EAAMtC,OAAOuB,OAIxBwB,EAAOT,EAAMtC,OAAOuB,MAAMqC,IACrBtC,MAAQyB,EAAKzB,OAASA,IAM3ByB,EAAO,IAAIrL,EAAK2J,UACXC,MAAQA,EACbgB,EAAMtC,OAAOuB,MAAMqC,GAASb,GAG9BZ,EAAMvH,KAAK,CACTyI,MAAOA,EACPrD,OAAQ+C,EACRX,KAAMA,MAOhB,OAAOpC,GAETtI,EAAK2J,SAASxJ,QAAU,WACtBW,KAAKqL,aAAe,GACpBrL,KAAKqJ,KAAO,IAAInK,EAAK2J,SACrB7I,KAAKsL,eAAiB,GACtBtL,KAAKuL,eAAiB,IAGxBrM,EAAK2J,SAASxJ,QAAQjC,UAAUmJ,OAAS,SAAUiF,GACjD,IAAI5B,EACA6B,EAAe,EAEnB,GAAID,EAAOxL,KAAKqL,aACd,MAAM,IAAI3G,MAAO,+BAGnB,IAAK,IAAIlJ,EAAI,EAAGA,EAAIgQ,EAAKhL,QAAUhF,EAAIwE,KAAKqL,aAAa7K,QACnDgL,EAAKhQ,IAAMwE,KAAKqL,aAAa7P,GAD8BA,IAE/DiQ,IAGFzL,KAAK0L,SAASD,GAGZ7B,EADgC,GAA9B5J,KAAKsL,eAAe9K,OACfR,KAAKqJ,KAELrJ,KAAKsL,eAAetL,KAAKsL,eAAe9K,OAAS,GAAGmL,MAG7D,IAASnQ,EAAIiQ,EAAcjQ,EAAIgQ,EAAKhL,OAAQhF,IAAK,CAC/C,IAAIoQ,EAAW,IAAI1M,EAAK2J,SACpBoB,EAAOuB,EAAKhQ,GAEhBoO,EAAKb,MAAMkB,GAAQ2B,EAEnB5L,KAAKsL,eAAelJ,KAAK,CACvByJ,OAAQjC,EACRK,KAAMA,EACN0B,MAAOC,IAGThC,EAAOgC,EAGThC,EAAKd,OAAQ,EACb9I,KAAKqL,aAAeG,GAGtBtM,EAAK2J,SAASxJ,QAAQjC,UAAUgM,OAAS,WACvCpJ,KAAK0L,SAAS,IAGhBxM,EAAK2J,SAASxJ,QAAQjC,UAAUsO,SAAW,SAAUI,GACnD,IAAK,IAAItQ,EAAIwE,KAAKsL,eAAe9K,OAAS,EAAGhF,GAAKsQ,EAAQtQ,IAAK,CAC7D,IAAIoO,EAAO5J,KAAKsL,eAAe9P,GAC3BuQ,EAAWnC,EAAK+B,MAAMtL,WAEtB0L,KAAY/L,KAAKuL,eACnB3B,EAAKiC,OAAO9C,MAAMa,EAAKK,MAAQjK,KAAKuL,eAAeQ,IAInDnC,EAAK+B,MAAMjB,KAAOqB,EAElB/L,KAAKuL,eAAeQ,GAAYnC,EAAK+B,OAGvC3L,KAAKsL,eAAevB;;;;IAwBxB7K,EAAK8M,MAAQ,SAAUC,GACrBjM,KAAKkM,cAAgBD,EAAMC,cAC3BlM,KAAKmM,aAAeF,EAAME,aAC1BnM,KAAKoM,SAAWH,EAAMG,SACtBpM,KAAKqM,OAASJ,EAAMI,OACpBrM,KAAKV,SAAW2M,EAAM3M,UA0ExBJ,EAAK8M,MAAM5O,UAAUkP,OAAS,SAAUC,GACtC,OAAOvM,KAAKwM,OAAM,SAAUA,GACb,IAAItN,EAAKuN,YAAYF,EAAaC,GACxCE,YA6BXxN,EAAK8M,MAAM5O,UAAUoP,MAAQ,SAAUtJ,GAoBrC,IAZA,IAAIsJ,EAAQ,IAAItN,EAAKyN,MAAM3M,KAAKqM,QAC5BO,EAAiB1Q,OAAOY,OAAO,MAC/B+P,EAAe3Q,OAAOY,OAAO,MAC7BgQ,EAAiB5Q,OAAOY,OAAO,MAC/BiQ,EAAkB7Q,OAAOY,OAAO,MAChCkQ,EAAoB9Q,OAAOY,OAAO,MAO7BtB,EAAI,EAAGA,EAAIwE,KAAKqM,OAAO7L,OAAQhF,IACtCqR,EAAa7M,KAAKqM,OAAO7Q,IAAM,IAAI0D,EAAK4G,OAG1C5C,EAAGvH,KAAK6Q,EAAOA,GAEf,IAAShR,EAAI,EAAGA,EAAIgR,EAAMS,QAAQzM,OAAQhF,IAAK,CAS7C,IAAI+N,EAASiD,EAAMS,QAAQzR,GACvB0R,EAAQ,KACRC,EAAgBjO,EAAKsC,IAAIE,SAG3BwL,EADE3D,EAAO6D,YACDpN,KAAKV,SAASoG,UAAU6D,EAAOE,KAAM,CAC3C4C,OAAQ9C,EAAO8C,SAGT,CAAC9C,EAAOE,MAGlB,IAAK,IAAI7N,EAAI,EAAGA,EAAIsR,EAAM1M,OAAQ5E,IAAK,CACrC,IAAI6N,EAAOyD,EAAMtR,GAQjB2N,EAAOE,KAAOA,EAOd,IAAI4D,EAAenO,EAAK2J,SAASS,WAAWC,GACxC+D,EAAgBtN,KAAKoM,SAASzK,UAAU0L,GAAc9F,UAQ1D,GAA6B,IAAzB+F,EAAc9M,QAAgB+I,EAAOgE,WAAarO,EAAKyN,MAAMY,SAASC,SAAU,CAClF,IAAK,IAAI/H,EAAI,EAAGA,EAAI8D,EAAO8C,OAAO7L,OAAQiF,IAAK,CAE7CsH,EADIU,EAAQlE,EAAO8C,OAAO5G,IACDvG,EAAKsC,IAAIO,MAGpC,MAGF,IAAK,IAAIwD,EAAI,EAAGA,EAAI+H,EAAc9M,OAAQ+E,IAKxC,KAAImI,EAAeJ,EAAc/H,GAC7BhD,EAAUvC,KAAKkM,cAAcwB,GAC7BC,EAAYpL,EAAQqL,OAExB,IAASnI,EAAI,EAAGA,EAAI8D,EAAO8C,OAAO7L,OAAQiF,IAAK,CAS7C,IACIoI,EAAetL,EADfkL,EAAQlE,EAAO8C,OAAO5G,IAEtBqI,EAAuB5R,OAAOqE,KAAKsN,GACnCE,EAAYL,EAAe,IAAMD,EACjCO,EAAuB,IAAI9O,EAAKsC,IAAIsM,GAoBxC,GAbIvE,EAAOgE,UAAYrO,EAAKyN,MAAMY,SAASC,WACzCL,EAAgBA,EAActL,MAAMmM,QAELzM,IAA3BwL,EAAgBU,KAClBV,EAAgBU,GAASvO,EAAKsC,IAAIE,WASlC6H,EAAOgE,UAAYrO,EAAKyN,MAAMY,SAASU,YA4B3C,GANApB,EAAaY,GAAOhH,OAAOkH,EAAWpE,EAAO2E,OAAO,SAAUlM,EAAGC,GAAK,OAAOD,EAAIC,MAM7E6K,EAAeiB,GAAnB,CAIA,IAAK,IAAItS,EAAI,EAAGA,EAAIqS,EAAqBtN,OAAQ/E,IAAK,CAOpD,IAGI0S,EAHAC,EAAsBN,EAAqBrS,GAC3C4S,EAAmB,IAAInP,EAAK4B,SAAUsN,EAAqBX,GAC3DzK,EAAW6K,EAAaO,QAG4B7M,KAAnD4M,EAAavB,EAAeyB,IAC/BzB,EAAeyB,GAAoB,IAAInP,EAAKoP,UAAWZ,EAAcD,EAAOzK,GAE5EmL,EAAW5O,IAAImO,EAAcD,EAAOzK,GAKxC8J,EAAeiB,IAAa,aAnDOxM,IAA7ByL,EAAkBS,KACpBT,EAAkBS,GAASvO,EAAKsC,IAAIO,OAGtCiL,EAAkBS,GAAST,EAAkBS,GAAO5L,MAAMmM,KA0DlE,GAAIzE,EAAOgE,WAAarO,EAAKyN,MAAMY,SAASC,SAC1C,IAAS/H,EAAI,EAAGA,EAAI8D,EAAO8C,OAAO7L,OAAQiF,IAAK,CAE7CsH,EADIU,EAAQlE,EAAO8C,OAAO5G,IACDsH,EAAgBU,GAAO9L,UAAUwL,IAUhE,IAAIoB,EAAqBrP,EAAKsC,IAAIE,SAC9B8M,EAAuBtP,EAAKsC,IAAIO,MAEpC,IAASvG,EAAI,EAAGA,EAAIwE,KAAKqM,OAAO7L,OAAQhF,IAAK,CAC3C,IAAIiS,EAEAV,EAFAU,EAAQzN,KAAKqM,OAAO7Q,MAGtB+S,EAAqBA,EAAmB5M,UAAUoL,EAAgBU,KAGhET,EAAkBS,KACpBe,EAAuBA,EAAqB3M,MAAMmL,EAAkBS,KAIxE,IAAIgB,EAAoBvS,OAAOqE,KAAKqM,GAChC8B,EAAU,GACVC,EAAUzS,OAAOY,OAAO,MAY5B,GAAI0P,EAAMoC,YAAa,CACrBH,EAAoBvS,OAAOqE,KAAKP,KAAKmM,cAErC,IAAS3Q,EAAI,EAAGA,EAAIiT,EAAkBjO,OAAQhF,IAAK,CAC7C6S,EAAmBI,EAAkBjT,GAAzC,IACI8F,EAAWpC,EAAK4B,SAASM,WAAWiN,GACxCzB,EAAeyB,GAAoB,IAAInP,EAAKoP,WAIhD,IAAS9S,EAAI,EAAGA,EAAIiT,EAAkBjO,OAAQhF,IAAK,CASjD,IACIuF,GADAO,EAAWpC,EAAK4B,SAASM,WAAWqN,EAAkBjT,KACpCuF,OAEtB,GAAKwN,EAAmBzM,SAASf,KAI7ByN,EAAqB1M,SAASf,GAAlC,CAIA,IAEI8N,EAFAC,EAAc9O,KAAKmM,aAAa7K,GAChCyN,EAAQlC,EAAavL,EAASN,WAAWsG,WAAWwH,GAGxD,QAAqCvN,KAAhCsN,EAAWF,EAAQ5N,IACtB8N,EAASE,OAASA,EAClBF,EAASG,UAAUC,QAAQrC,EAAetL,QACrC,CACL,IAAIuC,EAAQ,CACVqL,IAAKnO,EACLgO,MAAOA,EACPC,UAAWpC,EAAetL,IAE5BqN,EAAQ5N,GAAU8C,EAClB6K,EAAQtM,KAAKyB,KAOjB,OAAO6K,EAAQ9D,MAAK,SAAU5I,EAAGC,GAC/B,OAAOA,EAAE8M,MAAQ/M,EAAE+M,UAYvB7P,EAAK8M,MAAM5O,UAAUyI,OAAS,WAC5B,IAAIqG,EAAgBhQ,OAAOqE,KAAKP,KAAKkM,eAClCtB,OACAxH,KAAI,SAAUqG,GACb,MAAO,CAACA,EAAMzJ,KAAKkM,cAAczC,MAChCzJ,MAEDmM,EAAejQ,OAAOqE,KAAKP,KAAKmM,cACjC/I,KAAI,SAAU8L,GACb,MAAO,CAACA,EAAKlP,KAAKmM,aAAa+C,GAAKrJ,YACnC7F,MAEL,MAAO,CACLH,QAASX,EAAKW,QACdwM,OAAQrM,KAAKqM,OACbF,aAAcA,EACdD,cAAeA,EACf5M,SAAUU,KAAKV,SAASuG,WAU5B3G,EAAK8M,MAAM1H,KAAO,SAAU6K,GAC1B,IAAIlD,EAAQ,GACRE,EAAe,GACfiD,EAAoBD,EAAgBhD,aACpCD,EAAgBhQ,OAAOY,OAAO,MAC9BuS,EAA0BF,EAAgBjD,cAC1CoD,EAAkB,IAAIpQ,EAAK2J,SAASxJ,QACpCC,EAAWJ,EAAK8E,SAASM,KAAK6K,EAAgB7P,UAE9C6P,EAAgBtP,SAAWX,EAAKW,SAClCX,EAAKY,MAAMC,KAAK,4EAA8Eb,EAAKW,QAAU,sCAAwCsP,EAAgBtP,QAAU,KAGjL,IAAK,IAAIrE,EAAI,EAAGA,EAAI4T,EAAkB5O,OAAQhF,IAAK,CACjD,IACI0T,GADAK,EAAQH,EAAkB5T,IACd,GACZiG,EAAW8N,EAAM,GAErBpD,EAAa+C,GAAO,IAAIhQ,EAAK4G,OAAOrE,GAGtC,IAASjG,EAAI,EAAGA,EAAI6T,EAAwB7O,OAAQhF,IAAK,CACvD,IAAI+T,EACA9F,GADA8F,EAAQF,EAAwB7T,IACnB,GACb+G,EAAUgN,EAAM,GAEpBD,EAAgB/I,OAAOkD,GACvByC,EAAczC,GAAQlH,EAYxB,OATA+M,EAAgBlG,SAEhB6C,EAAMI,OAAS8C,EAAgB9C,OAE/BJ,EAAME,aAAeA,EACrBF,EAAMC,cAAgBA,EACtBD,EAAMG,SAAWkD,EAAgBjG,KACjC4C,EAAM3M,SAAWA,EAEV,IAAIJ,EAAK8M,MAAMC;;;;IA+BxB/M,EAAKG,QAAU,WACbW,KAAKwP,KAAO,KACZxP,KAAKyP,QAAUvT,OAAOY,OAAO,MAC7BkD,KAAK0P,WAAaxT,OAAOY,OAAO,MAChCkD,KAAKkM,cAAgBhQ,OAAOY,OAAO,MACnCkD,KAAK2P,qBAAuB,GAC5B3P,KAAK4P,aAAe,GACpB5P,KAAKmD,UAAYjE,EAAKiE,UACtBnD,KAAKV,SAAW,IAAIJ,EAAK8E,SACzBhE,KAAKL,eAAiB,IAAIT,EAAK8E,SAC/BhE,KAAKwC,cAAgB,EACrBxC,KAAK6P,GAAK,IACV7P,KAAK8P,IAAM,IACX9P,KAAK2N,UAAY,EACjB3N,KAAK+P,kBAAoB,IAe3B7Q,EAAKG,QAAQjC,UAAU8R,IAAM,SAAUA,GACrClP,KAAKwP,KAAON,GAmCdhQ,EAAKG,QAAQjC,UAAUqQ,MAAQ,SAAUzM,EAAWgP,GAClD,GAAI,KAAK5H,KAAKpH,GACZ,MAAM,IAAIiP,WAAY,UAAYjP,EAAY,oCAGhDhB,KAAKyP,QAAQzO,GAAagP,GAAc,IAW1C9Q,EAAKG,QAAQjC,UAAU6E,EAAI,SAAUiO,GAEjClQ,KAAK6P,GADHK,EAAS,EACD,EACDA,EAAS,EACR,EAEAA,GAWdhR,EAAKG,QAAQjC,UAAU+S,GAAK,SAAUD,GACpClQ,KAAK8P,IAAMI,GAoBbhR,EAAKG,QAAQjC,UAAUmC,IAAM,SAAU6Q,EAAKJ,GAC1C,IAAIjP,EAASqP,EAAIpQ,KAAKwP,MAClBnD,EAASnQ,OAAOqE,KAAKP,KAAKyP,SAE9BzP,KAAK0P,WAAW3O,GAAUiP,GAAc,GACxChQ,KAAKwC,eAAiB,EAEtB,IAAK,IAAIhH,EAAI,EAAGA,EAAI6Q,EAAO7L,OAAQhF,IAAK,CACtC,IAAIwF,EAAYqL,EAAO7Q,GACnB6U,EAAYrQ,KAAKyP,QAAQzO,GAAWqP,UACpC5C,EAAQ4C,EAAYA,EAAUD,GAAOA,EAAIpP,GACzCwC,EAASxD,KAAKmD,UAAUsK,EAAO,CAC7BpB,OAAQ,CAACrL,KAEXkM,EAAQlN,KAAKV,SAAS8F,IAAI5B,GAC1BlC,EAAW,IAAIpC,EAAK4B,SAAUC,EAAQC,GACtCsP,EAAapU,OAAOY,OAAO,MAE/BkD,KAAK2P,qBAAqBrO,GAAYgP,EACtCtQ,KAAK4P,aAAatO,GAAY,EAG9BtB,KAAK4P,aAAatO,IAAa4L,EAAM1M,OAGrC,IAAK,IAAI+E,EAAI,EAAGA,EAAI2H,EAAM1M,OAAQ+E,IAAK,CACrC,IAAIkE,EAAOyD,EAAM3H,GAUjB,GARwBhE,MAApB+O,EAAW7G,KACb6G,EAAW7G,GAAQ,GAGrB6G,EAAW7G,IAAS,EAIYlI,MAA5BvB,KAAKkM,cAAczC,GAAoB,CACzC,IAAIlH,EAAUrG,OAAOY,OAAO,MAC5ByF,EAAgB,OAAIvC,KAAK2N,UACzB3N,KAAK2N,WAAa,EAElB,IAAK,IAAIlI,EAAI,EAAGA,EAAI4G,EAAO7L,OAAQiF,IACjClD,EAAQ8J,EAAO5G,IAAMvJ,OAAOY,OAAO,MAGrCkD,KAAKkM,cAAczC,GAAQlH,EAIsBhB,MAA/CvB,KAAKkM,cAAczC,GAAMzI,GAAWD,KACtCf,KAAKkM,cAAczC,GAAMzI,GAAWD,GAAU7E,OAAOY,OAAO,OAK9D,IAAK,IAAIrB,EAAI,EAAGA,EAAIuE,KAAK+P,kBAAkBvP,OAAQ/E,IAAK,CACtD,IAAI8U,EAAcvQ,KAAK+P,kBAAkBtU,GACrCuH,EAAWyG,EAAKzG,SAASuN,GAEmChP,MAA5DvB,KAAKkM,cAAczC,GAAMzI,GAAWD,GAAQwP,KAC9CvQ,KAAKkM,cAAczC,GAAMzI,GAAWD,GAAQwP,GAAe,IAG7DvQ,KAAKkM,cAAczC,GAAMzI,GAAWD,GAAQwP,GAAanO,KAAKY,OAYtE9D,EAAKG,QAAQjC,UAAUoT,6BAA+B,WAOpD,IALA,IAAIC,EAAYvU,OAAOqE,KAAKP,KAAK4P,cAC7Bc,EAAiBD,EAAUjQ,OAC3BmQ,EAAc,GACdC,EAAqB,GAEhBpV,EAAI,EAAGA,EAAIkV,EAAgBlV,IAAK,CACvC,IAAI8F,EAAWpC,EAAK4B,SAASM,WAAWqP,EAAUjV,IAC9CiS,EAAQnM,EAASN,UAErB4P,EAAmBnD,KAAWmD,EAAmBnD,GAAS,GAC1DmD,EAAmBnD,IAAU,EAE7BkD,EAAYlD,KAAWkD,EAAYlD,GAAS,GAC5CkD,EAAYlD,IAAUzN,KAAK4P,aAAatO,GAG1C,IAAI+K,EAASnQ,OAAOqE,KAAKP,KAAKyP,SAE9B,IAASjU,EAAI,EAAGA,EAAI6Q,EAAO7L,OAAQhF,IAAK,CACtC,IAAIwF,EAAYqL,EAAO7Q,GACvBmV,EAAY3P,GAAa2P,EAAY3P,GAAa4P,EAAmB5P,GAGvEhB,KAAK6Q,mBAAqBF,GAQ5BzR,EAAKG,QAAQjC,UAAU0T,mBAAqB,WAM1C,IALA,IAAI3E,EAAe,GACfsE,EAAYvU,OAAOqE,KAAKP,KAAK2P,sBAC7BoB,EAAkBN,EAAUjQ,OAC5BwQ,EAAe9U,OAAOY,OAAO,MAExBtB,EAAI,EAAGA,EAAIuV,EAAiBvV,IAAK,CAaxC,IAZA,IAAI8F,EAAWpC,EAAK4B,SAASM,WAAWqP,EAAUjV,IAC9CwF,EAAYM,EAASN,UACrBiQ,EAAcjR,KAAK4P,aAAatO,GAChCwN,EAAc,IAAI5P,EAAK4G,OACvBoL,EAAkBlR,KAAK2P,qBAAqBrO,GAC5C4L,EAAQhR,OAAOqE,KAAK2Q,GACpBC,EAAcjE,EAAM1M,OAGpB4Q,EAAapR,KAAKyP,QAAQzO,GAAWkN,OAAS,EAC9CmD,EAAWrR,KAAK0P,WAAWpO,EAASP,QAAQmN,OAAS,EAEhD3I,EAAI,EAAGA,EAAI4L,EAAa5L,IAAK,CACpC,IAGIjD,EAAKyM,EAAOuC,EAHZ7H,EAAOyD,EAAM3H,GACbgM,EAAKL,EAAgBzH,GACrBkE,EAAY3N,KAAKkM,cAAczC,GAAMmE,YAGdrM,IAAvByP,EAAavH,IACfnH,EAAMpD,EAAKoD,IAAItC,KAAKkM,cAAczC,GAAOzJ,KAAKwC,eAC9CwO,EAAavH,GAAQnH,GAErBA,EAAM0O,EAAavH,GAGrBsF,EAAQzM,IAAQtC,KAAK8P,IAAM,GAAKyB,IAAOvR,KAAK8P,KAAO,EAAI9P,KAAK6P,GAAK7P,KAAK6P,IAAMoB,EAAcjR,KAAK6Q,mBAAmB7P,KAAeuQ,GACjIxC,GAASqC,EACTrC,GAASsC,EACTC,EAAqB3O,KAAK6O,MAAc,IAARzC,GAAgB,IAQhDD,EAAYvI,OAAOoH,EAAW2D,GAGhCnF,EAAa7K,GAAYwN,EAG3B9O,KAAKmM,aAAeA,GAQtBjN,EAAKG,QAAQjC,UAAUqU,eAAiB,WACtCzR,KAAKoM,SAAWlN,EAAK2J,SAASK,UAC5BhN,OAAOqE,KAAKP,KAAKkM,eAAetB,SAYpC1L,EAAKG,QAAQjC,UAAUwC,MAAQ,WAK7B,OAJAI,KAAKwQ,+BACLxQ,KAAK8Q,qBACL9Q,KAAKyR,iBAEE,IAAIvS,EAAK8M,MAAM,CACpBE,cAAelM,KAAKkM,cACpBC,aAAcnM,KAAKmM,aACnBC,SAAUpM,KAAKoM,SACfC,OAAQnQ,OAAOqE,KAAKP,KAAKyP,SACzBnQ,SAAUU,KAAKL,kBAkBnBT,EAAKG,QAAQjC,UAAUsU,IAAM,SAAUxO,GACrC,IAAIyO,EAAOjR,MAAMtD,UAAUwD,MAAMjF,KAAKiJ,UAAW,GACjD+M,EAAKC,QAAQ5R,MACbkD,EAAG2O,MAAM7R,KAAM2R,IAcjBzS,EAAKoP,UAAY,SAAU7E,EAAMgE,EAAOzK,GAStC,IARA,IAAI8O,EAAiB5V,OAAOY,OAAO,MAC/BiV,EAAe7V,OAAOqE,KAAKyC,GAAY,IAOlCxH,EAAI,EAAGA,EAAIuW,EAAavR,OAAQhF,IAAK,CAC5C,IAAIuB,EAAMgV,EAAavW,GACvBsW,EAAe/U,GAAOiG,EAASjG,GAAK6D,QAGtCZ,KAAKgD,SAAW9G,OAAOY,OAAO,WAEjByE,IAATkI,IACFzJ,KAAKgD,SAASyG,GAAQvN,OAAOY,OAAO,MACpCkD,KAAKgD,SAASyG,GAAMgE,GAASqE,IAajC5S,EAAKoP,UAAUlR,UAAU6R,QAAU,SAAU+C,GAG3C,IAFA,IAAI9E,EAAQhR,OAAOqE,KAAKyR,EAAehP,UAE9BxH,EAAI,EAAGA,EAAI0R,EAAM1M,OAAQhF,IAAK,CACrC,IAAIiO,EAAOyD,EAAM1R,GACb6Q,EAASnQ,OAAOqE,KAAKyR,EAAehP,SAASyG,IAEtBlI,MAAvBvB,KAAKgD,SAASyG,KAChBzJ,KAAKgD,SAASyG,GAAQvN,OAAOY,OAAO,OAGtC,IAAK,IAAIyI,EAAI,EAAGA,EAAI8G,EAAO7L,OAAQ+E,IAAK,CACtC,IAAIkI,EAAQpB,EAAO9G,GACfhF,EAAOrE,OAAOqE,KAAKyR,EAAehP,SAASyG,GAAMgE,IAEnBlM,MAA9BvB,KAAKgD,SAASyG,GAAMgE,KACtBzN,KAAKgD,SAASyG,GAAMgE,GAASvR,OAAOY,OAAO,OAG7C,IAAK,IAAI2I,EAAI,EAAGA,EAAIlF,EAAKC,OAAQiF,IAAK,CACpC,IAAI1I,EAAMwD,EAAKkF,GAEwBlE,MAAnCvB,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAC7BiD,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAOiV,EAAehP,SAASyG,GAAMgE,GAAO1Q,GAEvEiD,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAOiD,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAKsF,OAAO2P,EAAehP,SAASyG,GAAMgE,GAAO1Q,QAexHmC,EAAKoP,UAAUlR,UAAUmC,IAAM,SAAUkK,EAAMgE,EAAOzK,GACpD,KAAMyG,KAAQzJ,KAAKgD,UAGjB,OAFAhD,KAAKgD,SAASyG,GAAQvN,OAAOY,OAAO,WACpCkD,KAAKgD,SAASyG,GAAMgE,GAASzK,GAI/B,GAAMyK,KAASzN,KAAKgD,SAASyG,GAO7B,IAFA,IAAIsI,EAAe7V,OAAOqE,KAAKyC,GAEtBxH,EAAI,EAAGA,EAAIuW,EAAavR,OAAQhF,IAAK,CAC5C,IAAIuB,EAAMgV,EAAavW,GAEnBuB,KAAOiD,KAAKgD,SAASyG,GAAMgE,GAC7BzN,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAOiD,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAKsF,OAAOW,EAASjG,IAElFiD,KAAKgD,SAASyG,GAAMgE,GAAO1Q,GAAOiG,EAASjG,QAZ7CiD,KAAKgD,SAASyG,GAAMgE,GAASzK,GA2BjC9D,EAAKyN,MAAQ,SAAUsF,GACrBjS,KAAKiN,QAAU,GACfjN,KAAKiS,UAAYA,GA2BnB/S,EAAKyN,MAAMuF,SAAW,IAAIC,OAAQ,KAClCjT,EAAKyN,MAAMuF,SAASE,KAAO,EAC3BlT,EAAKyN,MAAMuF,SAASG,QAAU,EAC9BnT,EAAKyN,MAAMuF,SAASI,SAAW,EAa/BpT,EAAKyN,MAAMY,SAAW,CAIpBgF,SAAU,EAMV/E,SAAU,EAMVS,WAAY,GA0Bd/O,EAAKyN,MAAMvP,UAAUmM,OAAS,SAAUA,GA+BtC,MA9BM,WAAYA,IAChBA,EAAO8C,OAASrM,KAAKiS,WAGjB,UAAW1I,IACfA,EAAO2E,MAAQ,GAGX,gBAAiB3E,IACrBA,EAAO6D,aAAc,GAGjB,aAAc7D,IAClBA,EAAO2I,SAAWhT,EAAKyN,MAAMuF,SAASE,MAGnC7I,EAAO2I,SAAWhT,EAAKyN,MAAMuF,SAASG,SAAa9I,EAAOE,KAAK7F,OAAO,IAAM1E,EAAKyN,MAAMuF,WAC1F3I,EAAOE,KAAO,IAAMF,EAAOE,MAGxBF,EAAO2I,SAAWhT,EAAKyN,MAAMuF,SAASI,UAAc/I,EAAOE,KAAK7I,OAAO,IAAM1B,EAAKyN,MAAMuF,WAC3F3I,EAAOE,KAAYF,EAAOE,KAAO,KAG7B,aAAcF,IAClBA,EAAOgE,SAAWrO,EAAKyN,MAAMY,SAASgF,UAGxCvS,KAAKiN,QAAQ7K,KAAKmH,GAEXvJ,MAUTd,EAAKyN,MAAMvP,UAAUwR,UAAY,WAC/B,IAAK,IAAIpT,EAAI,EAAGA,EAAIwE,KAAKiN,QAAQzM,OAAQhF,IACvC,GAAIwE,KAAKiN,QAAQzR,GAAG+R,UAAYrO,EAAKyN,MAAMY,SAASU,WAClD,OAAO,EAIX,OAAO,GA6BT/O,EAAKyN,MAAMvP,UAAUqM,KAAO,SAAUA,EAAM+I,GAC1C,GAAI9R,MAAMC,QAAQ8I,GAEhB,OADAA,EAAKjF,SAAQ,SAAU9H,GAAKsD,KAAKyJ,KAAK/M,EAAGwC,EAAKY,MAAMQ,MAAMkS,MAAaxS,MAChEA,KAGT,IAAIuJ,EAASiJ,GAAW,GAKxB,OAJAjJ,EAAOE,KAAOA,EAAKpJ,WAEnBL,KAAKuJ,OAAOA,GAELvJ,MAETd,EAAKuT,gBAAkB,SAAUxS,EAASiG,EAAOC,GAC/CnG,KAAKjE,KAAO,kBACZiE,KAAKC,QAAUA,EACfD,KAAKkG,MAAQA,EACblG,KAAKmG,IAAMA,GAGbjH,EAAKuT,gBAAgBrV,UAAY,IAAIsH,MACrCxF,EAAKwT,WAAa,SAAU3P,GAC1B/C,KAAK2S,QAAU,GACf3S,KAAK+C,IAAMA,EACX/C,KAAKQ,OAASuC,EAAIvC,OAClBR,KAAKgF,IAAM,EACXhF,KAAKkG,MAAQ,EACblG,KAAK4S,oBAAsB,IAG7B1T,EAAKwT,WAAWtV,UAAUgI,IAAM,WAG9B,IAFA,IAAIyN,EAAQ3T,EAAKwT,WAAWI,QAErBD,GACLA,EAAQA,EAAM7S,OAIlBd,EAAKwT,WAAWtV,UAAU2V,YAAc,WAKtC,IAJA,IAAIC,EAAY,GACZtP,EAAa1D,KAAKkG,MAClBzC,EAAWzD,KAAKgF,IAEXxJ,EAAI,EAAGA,EAAIwE,KAAK4S,oBAAoBpS,OAAQhF,IACnDiI,EAAWzD,KAAK4S,oBAAoBpX,GACpCwX,EAAU5Q,KAAKpC,KAAK+C,IAAInC,MAAM8C,EAAYD,IAC1CC,EAAaD,EAAW,EAM1B,OAHAuP,EAAU5Q,KAAKpC,KAAK+C,IAAInC,MAAM8C,EAAY1D,KAAKgF,MAC/ChF,KAAK4S,oBAAoBpS,OAAS,EAE3BwS,EAAUC,KAAK,KAGxB/T,EAAKwT,WAAWtV,UAAU8V,KAAO,SAAUC,GACzCnT,KAAK2S,QAAQvQ,KAAK,CAChB+Q,KAAMA,EACNpQ,IAAK/C,KAAK+S,cACV7M,MAAOlG,KAAKkG,MACZC,IAAKnG,KAAKgF,MAGZhF,KAAKkG,MAAQlG,KAAKgF,KAGpB9F,EAAKwT,WAAWtV,UAAUgW,gBAAkB,WAC1CpT,KAAK4S,oBAAoBxQ,KAAKpC,KAAKgF,IAAM,GACzChF,KAAKgF,KAAO,GAGd9F,EAAKwT,WAAWtV,UAAUmN,KAAO,WAC/B,GAAIvK,KAAKgF,KAAOhF,KAAKQ,OACnB,OAAOtB,EAAKwT,WAAWW,IAGzB,IAAIpJ,EAAOjK,KAAK+C,IAAIa,OAAO5D,KAAKgF,KAEhC,OADAhF,KAAKgF,KAAO,EACLiF,GAGT/K,EAAKwT,WAAWtV,UAAUkW,MAAQ,WAChC,OAAOtT,KAAKgF,IAAMhF,KAAKkG,OAGzBhH,EAAKwT,WAAWtV,UAAUmW,OAAS,WAC7BvT,KAAKkG,OAASlG,KAAKgF,MACrBhF,KAAKgF,KAAO,GAGdhF,KAAKkG,MAAQlG,KAAKgF,KAGpB9F,EAAKwT,WAAWtV,UAAUoW,OAAS,WACjCxT,KAAKgF,KAAO,GAGd9F,EAAKwT,WAAWtV,UAAUqW,eAAiB,WACzC,IAAIxJ,EAAMyJ,EAEV,GAEEA,GADAzJ,EAAOjK,KAAKuK,QACIoJ,WAAW,SACpBD,EAAW,IAAMA,EAAW,IAEjCzJ,GAAQ/K,EAAKwT,WAAWW,KAC1BrT,KAAKwT,UAITtU,EAAKwT,WAAWtV,UAAUwW,KAAO,WAC/B,OAAO5T,KAAKgF,IAAMhF,KAAKQ,QAGzBtB,EAAKwT,WAAWW,IAAM,MACtBnU,EAAKwT,WAAWmB,MAAQ,QACxB3U,EAAKwT,WAAWoB,KAAO,OACvB5U,EAAKwT,WAAWqB,cAAgB,gBAChC7U,EAAKwT,WAAWsB,MAAQ,QACxB9U,EAAKwT,WAAWuB,SAAW,WAE3B/U,EAAKwT,WAAWwB,SAAW,SAAUC,GAInC,OAHAA,EAAMX,SACNW,EAAMjB,KAAKhU,EAAKwT,WAAWmB,OAC3BM,EAAMZ,SACCrU,EAAKwT,WAAWI,SAGzB5T,EAAKwT,WAAW0B,QAAU,SAAUD,GAQlC,GAPIA,EAAMb,QAAU,IAClBa,EAAMX,SACNW,EAAMjB,KAAKhU,EAAKwT,WAAWoB,OAG7BK,EAAMZ,SAEFY,EAAMP,OACR,OAAO1U,EAAKwT,WAAWI,SAI3B5T,EAAKwT,WAAW2B,gBAAkB,SAAUF,GAI1C,OAHAA,EAAMZ,SACNY,EAAMV,iBACNU,EAAMjB,KAAKhU,EAAKwT,WAAWqB,eACpB7U,EAAKwT,WAAWI,SAGzB5T,EAAKwT,WAAW4B,SAAW,SAAUH,GAInC,OAHAA,EAAMZ,SACNY,EAAMV,iBACNU,EAAMjB,KAAKhU,EAAKwT,WAAWsB,OACpB9U,EAAKwT,WAAWI,SAGzB5T,EAAKwT,WAAW6B,OAAS,SAAUJ,GAC7BA,EAAMb,QAAU,GAClBa,EAAMjB,KAAKhU,EAAKwT,WAAWoB,OAe/B5U,EAAKwT,WAAW8B,cAAgBtV,EAAKiE,UAAUW,UAE/C5E,EAAKwT,WAAWI,QAAU,SAAUqB,GAClC,OAAa,CACX,IAAIlK,EAAOkK,EAAM5J,OAEjB,GAAIN,GAAQ/K,EAAKwT,WAAWW,IAC1B,OAAOnU,EAAKwT,WAAW6B,OAIzB,GAA0B,IAAtBtK,EAAK0J,WAAW,GAApB,CAKA,GAAY,KAAR1J,EACF,OAAO/K,EAAKwT,WAAWwB,SAGzB,GAAY,KAARjK,EAKF,OAJAkK,EAAMX,SACFW,EAAMb,QAAU,GAClBa,EAAMjB,KAAKhU,EAAKwT,WAAWoB,MAEtB5U,EAAKwT,WAAW2B,gBAGzB,GAAY,KAARpK,EAKF,OAJAkK,EAAMX,SACFW,EAAMb,QAAU,GAClBa,EAAMjB,KAAKhU,EAAKwT,WAAWoB,MAEtB5U,EAAKwT,WAAW4B,SAMzB,GAAY,KAARrK,GAAiC,IAAlBkK,EAAMb,QAEvB,OADAa,EAAMjB,KAAKhU,EAAKwT,WAAWuB,UACpB/U,EAAKwT,WAAWI,QAMzB,GAAY,KAAR7I,GAAiC,IAAlBkK,EAAMb,QAEvB,OADAa,EAAMjB,KAAKhU,EAAKwT,WAAWuB,UACpB/U,EAAKwT,WAAWI,QAGzB,GAAI7I,EAAKpG,MAAM3E,EAAKwT,WAAW8B,eAC7B,OAAOtV,EAAKwT,WAAW0B,aAzCvBD,EAAMf,oBA8CZlU,EAAKuN,YAAc,SAAU1J,EAAKyJ,GAChCxM,KAAKmU,MAAQ,IAAIjV,EAAKwT,WAAY3P,GAClC/C,KAAKwM,MAAQA,EACbxM,KAAKyU,cAAgB,GACrBzU,KAAK0U,UAAY,GAGnBxV,EAAKuN,YAAYrP,UAAUsP,MAAQ,WACjC1M,KAAKmU,MAAM/O,MACXpF,KAAK2S,QAAU3S,KAAKmU,MAAMxB,QAI1B,IAFA,IAAIE,EAAQ3T,EAAKuN,YAAYkI,YAEtB9B,GACLA,EAAQA,EAAM7S,MAGhB,OAAOA,KAAKwM,OAGdtN,EAAKuN,YAAYrP,UAAUwX,WAAa,WACtC,OAAO5U,KAAK2S,QAAQ3S,KAAK0U,YAG3BxV,EAAKuN,YAAYrP,UAAUyX,cAAgB,WACzC,IAAIC,EAAS9U,KAAK4U,aAElB,OADA5U,KAAK0U,WAAa,EACXI,GAGT5V,EAAKuN,YAAYrP,UAAU2X,WAAa,WACtC,IAAIC,EAAkBhV,KAAKyU,cAC3BzU,KAAKwM,MAAMjD,OAAOyL,GAClBhV,KAAKyU,cAAgB,IAGvBvV,EAAKuN,YAAYkI,YAAc,SAAUM,GACvC,IAAIH,EAASG,EAAOL,aAEpB,GAAcrT,MAAVuT,EAIJ,OAAQA,EAAO3B,MACb,KAAKjU,EAAKwT,WAAWuB,SACnB,OAAO/U,EAAKuN,YAAYyI,cAC1B,KAAKhW,EAAKwT,WAAWmB,MACnB,OAAO3U,EAAKuN,YAAY0I,WAC1B,KAAKjW,EAAKwT,WAAWoB,KACnB,OAAO5U,EAAKuN,YAAY2I,UAC1B,QACE,IAAIC,EAAe,4CAA8CP,EAAO3B,KAMxE,MAJI2B,EAAO/R,IAAIvC,QAAU,IACvB6U,GAAgB,gBAAkBP,EAAO/R,IAAM,KAG3C,IAAI7D,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,OAIzEjH,EAAKuN,YAAYyI,cAAgB,SAAUD,GACzC,IAAIH,EAASG,EAAOJ,gBAEpB,GAActT,MAAVuT,EAAJ,CAIA,OAAQA,EAAO/R,KACb,IAAK,IACHkS,EAAOR,cAAclH,SAAWrO,EAAKyN,MAAMY,SAASU,WACpD,MACF,IAAK,IACHgH,EAAOR,cAAclH,SAAWrO,EAAKyN,MAAMY,SAASC,SACpD,MACF,QACE,IAAI6H,EAAe,kCAAoCP,EAAO/R,IAAM,IACpE,MAAM,IAAI7D,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGvE,IAAImP,EAAaL,EAAOL,aAExB,GAAkBrT,MAAd+T,EAAyB,CACvBD,EAAe,yCACnB,MAAM,IAAInW,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGrE,OAAQmP,EAAWnC,MACjB,KAAKjU,EAAKwT,WAAWmB,MACnB,OAAO3U,EAAKuN,YAAY0I,WAC1B,KAAKjW,EAAKwT,WAAWoB,KACnB,OAAO5U,EAAKuN,YAAY2I,UAC1B,QACMC,EAAe,mCAAqCC,EAAWnC,KAAO,IAC1E,MAAM,IAAIjU,EAAKuT,gBAAiB4C,EAAcC,EAAWpP,MAAOoP,EAAWnP,QAIjFjH,EAAKuN,YAAY0I,WAAa,SAAUF,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAActT,MAAVuT,EAAJ,CAIA,IAAmD,GAA/CG,EAAOzI,MAAMyF,UAAU5Q,QAAQyT,EAAO/R,KAAY,CACpD,IAAIwS,EAAiBN,EAAOzI,MAAMyF,UAAU7O,KAAI,SAAUoS,GAAK,MAAO,IAAMA,EAAI,OAAOvC,KAAK,MACxFoC,EAAe,uBAAyBP,EAAO/R,IAAM,uBAAyBwS,EAElF,MAAM,IAAIrW,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGrE8O,EAAOR,cAAcpI,OAAS,CAACyI,EAAO/R,KAEtC,IAAIuS,EAAaL,EAAOL,aAExB,GAAkBrT,MAAd+T,EAAyB,CACvBD,EAAe,gCACnB,MAAM,IAAInW,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGrE,OAAQmP,EAAWnC,MACjB,KAAKjU,EAAKwT,WAAWoB,KACnB,OAAO5U,EAAKuN,YAAY2I,UAC1B,QACMC,EAAe,0BAA4BC,EAAWnC,KAAO,IACjE,MAAM,IAAIjU,EAAKuT,gBAAiB4C,EAAcC,EAAWpP,MAAOoP,EAAWnP,QAIjFjH,EAAKuN,YAAY2I,UAAY,SAAUH,GACrC,IAAIH,EAASG,EAAOJ,gBAEpB,GAActT,MAAVuT,EAAJ,CAIAG,EAAOR,cAAchL,KAAOqL,EAAO/R,IAAIM,eAEP,GAA5ByR,EAAO/R,IAAI1B,QAAQ,OACrB4T,EAAOR,cAAcrH,aAAc,GAGrC,IAAIkI,EAAaL,EAAOL,aAExB,GAAkBrT,MAAd+T,EAKJ,OAAQA,EAAWnC,MACjB,KAAKjU,EAAKwT,WAAWoB,KAEnB,OADAmB,EAAOF,aACA7V,EAAKuN,YAAY2I,UAC1B,KAAKlW,EAAKwT,WAAWmB,MAEnB,OADAoB,EAAOF,aACA7V,EAAKuN,YAAY0I,WAC1B,KAAKjW,EAAKwT,WAAWqB,cACnB,OAAO7U,EAAKuN,YAAYgJ,kBAC1B,KAAKvW,EAAKwT,WAAWsB,MACnB,OAAO9U,EAAKuN,YAAYiJ,WAC1B,KAAKxW,EAAKwT,WAAWuB,SAEnB,OADAgB,EAAOF,aACA7V,EAAKuN,YAAYyI,cAC1B,QACE,IAAIG,EAAe,2BAA6BC,EAAWnC,KAAO,IAClE,MAAM,IAAIjU,EAAKuT,gBAAiB4C,EAAcC,EAAWpP,MAAOoP,EAAWnP,UApB7E8O,EAAOF,eAwBX7V,EAAKuN,YAAYgJ,kBAAoB,SAAUR,GAC7C,IAAIH,EAASG,EAAOJ,gBAEpB,GAActT,MAAVuT,EAAJ,CAIA,IAAIpL,EAAeiM,SAASb,EAAO/R,IAAK,IAExC,GAAI6S,MAAMlM,GAAe,CACvB,IAAI2L,EAAe,gCACnB,MAAM,IAAInW,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGrE8O,EAAOR,cAAc/K,aAAeA,EAEpC,IAAI4L,EAAaL,EAAOL,aAExB,GAAkBrT,MAAd+T,EAKJ,OAAQA,EAAWnC,MACjB,KAAKjU,EAAKwT,WAAWoB,KAEnB,OADAmB,EAAOF,aACA7V,EAAKuN,YAAY2I,UAC1B,KAAKlW,EAAKwT,WAAWmB,MAEnB,OADAoB,EAAOF,aACA7V,EAAKuN,YAAY0I,WAC1B,KAAKjW,EAAKwT,WAAWqB,cACnB,OAAO7U,EAAKuN,YAAYgJ,kBAC1B,KAAKvW,EAAKwT,WAAWsB,MACnB,OAAO9U,EAAKuN,YAAYiJ,WAC1B,KAAKxW,EAAKwT,WAAWuB,SAEnB,OADAgB,EAAOF,aACA7V,EAAKuN,YAAYyI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWnC,KAAO,IAClE,MAAM,IAAIjU,EAAKuT,gBAAiB4C,EAAcC,EAAWpP,MAAOoP,EAAWnP,UApB7E8O,EAAOF,eAwBX7V,EAAKuN,YAAYiJ,WAAa,SAAUT,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAActT,MAAVuT,EAAJ,CAIA,IAAI5G,EAAQyH,SAASb,EAAO/R,IAAK,IAEjC,GAAI6S,MAAM1H,GAAQ,CAChB,IAAImH,EAAe,wBACnB,MAAM,IAAInW,EAAKuT,gBAAiB4C,EAAcP,EAAO5O,MAAO4O,EAAO3O,KAGrE8O,EAAOR,cAAcvG,MAAQA,EAE7B,IAAIoH,EAAaL,EAAOL,aAExB,GAAkBrT,MAAd+T,EAKJ,OAAQA,EAAWnC,MACjB,KAAKjU,EAAKwT,WAAWoB,KAEnB,OADAmB,EAAOF,aACA7V,EAAKuN,YAAY2I,UAC1B,KAAKlW,EAAKwT,WAAWmB,MAEnB,OADAoB,EAAOF,aACA7V,EAAKuN,YAAY0I,WAC1B,KAAKjW,EAAKwT,WAAWqB,cACnB,OAAO7U,EAAKuN,YAAYgJ,kBAC1B,KAAKvW,EAAKwT,WAAWsB,MACnB,OAAO9U,EAAKuN,YAAYiJ,WAC1B,KAAKxW,EAAKwT,WAAWuB,SAEnB,OADAgB,EAAOF,aACA7V,EAAKuN,YAAYyI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWnC,KAAO,IAClE,MAAM,IAAIjU,EAAKuT,gBAAiB4C,EAAcC,EAAWpP,MAAOoP,EAAWnP,UApB7E8O,EAAOF,oBA+BS,0BAAd,EAYI,WAMN,OAAO7V,IAlBS,kCAp3GnB,I;;;;;;;GCSD,IAAI2W,EAAkB,UAOtBta,EAAOD,QAUP,SAAoBwa,GAClB,IAOIC,EAPAhT,EAAM,GAAK+S,EACXjS,EAAQgS,EAAgBtN,KAAKxF,GAEjC,IAAKc,EACH,OAAOd,EAIT,IAAIiT,EAAO,GACP/P,EAAQ,EACRgQ,EAAY,EAEhB,IAAKhQ,EAAQpC,EAAMoC,MAAOA,EAAQlD,EAAIvC,OAAQyF,IAAS,CACrD,OAAQlD,EAAI4Q,WAAW1N,IACrB,KAAK,GACH8P,EAAS,SACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,QACE,SAGAE,IAAchQ,IAChB+P,GAAQjT,EAAImT,UAAUD,EAAWhQ,IAGnCgQ,EAAYhQ,EAAQ,EACpB+P,GAAQD,EAGV,OAAOE,IAAchQ,EACjB+P,EAAOjT,EAAImT,UAAUD,EAAWhQ,GAChC+P,I,goBC7CYG,ECEd,E,iqBC2DEC,EAAqC,CACzC9W,SAAU,CACRE,SAAS,EACT6W,WAAW,IAQf,aAuBE,WAAmB,G,IAAEC,EAAA,EAAAA,KAAM9D,EAAA,EAAAA,QAASvM,EAAA,EAAAA,MAClCjG,KAAKuW,UC1DF,SACLD,G,QAEMC,EAAY,IAAIC,I,IACtB,IAAkB,QAAAF,GAAI,8BAAE,CAAnB,IAAMlG,EAAG,QACN,6BAACqG,EAAA,KAAMC,EAAA,KAGPC,EAAWvG,EAAIuG,SACfC,EAAWxG,EAAIwG,MAGfC,EAAO,EAAWzG,EAAIyG,MACzBxO,QAAQ,mBAAoB,IAC5BA,QAAQ,OAAQ,KAGnB,GAAIqO,EAAM,CACR,IAAMI,EAAUP,EAAUla,IAAIoa,GAGzBK,EAAQC,QAOXR,EAAUS,IAAIL,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEC,QAAO,KANxDA,EAAQF,MAAUxG,EAAIwG,MACtBE,EAAQD,KAAUA,EAClBC,EAAQC,SAAU,QASpBR,EAAUS,IAAIL,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEE,SAAS,K,iGAG9D,OAAOR,EDsBYU,CAAuBX,GAItCtW,KAAKiG,WADc,IAAVA,EACI/G,GAAK,W,QACRI,GAAA,MAAAA,SAGRU,KAAKV,SAASsG,QACVtG,EAASE,SACXQ,KAAKV,SAASC,IAAIL,EAAA,SAChBI,EAAS+W,WACXrW,KAAKV,SAASC,IAAIL,EAAA,gBAGpBc,KAAKyN,MAAM,QAAS,CAAES,MAAO,KAC7BlO,KAAKyN,MAAM,QACXzN,KAAKkP,IAAI,Y,IAGT,IAAkB,QAAAoH,GAAI,+BAAjB,IAAMlG,EAAG,QACZpQ,KAAKT,IAAI6Q,I,qGAKAlR,EAAA,MAAWoF,KACL,iBAAV2B,EACHiR,KAAKxK,MAAMzG,GACXA,GA0DZ,OArCS,YAAAqG,OAAP,SAAcE,GAAd,WACQ2K,EAASnX,KAAKiG,MAAMqG,OAAOE,EAC9BnE,QAAQ,mBAAoB,KAI5BM,QAAO,SAAC+F,EAASlJ,GAChB,IAAM4R,EAAW,EAAKb,UAAUla,IAAImJ,EAAO0J,KAC3C,QAAwB,IAAbkI,EACT,GAAI,YAAaA,EAAU,CACzB,IAAMlI,EAAMkI,EAASN,QAAQH,SAC7BjI,EAAQsI,IAAI9H,EAAK,EAAIR,EAAQrS,IAAI6S,IAAQ,GAAI,CAAA1J,SACxC,CACC0J,EAAMkI,EAAST,SACrBjI,EAAQsI,IAAI9H,EAAKR,EAAQrS,IAAI6S,IAAQ,IAGzC,OAAOR,IACN,IAAI8H,KAGT,OAAO,EAAIW,GAAQ/T,KAAI,SAAC,G,IAAA,SAAC8L,EAAA,KAAKmI,EAAA,KAAc,OAC1CP,QAAS,EAAKP,UAAUla,IAAI6S,GAC5BmI,SAAUA,EAASjU,KAAI,SAAA2T,GACrB,OAAO,EAAKR,UAAUla,IAAI0a,EAAQ7H,aAUjC,YAAA7O,SAAP,WACE,OAAO6W,KAAKI,UAAUtX,KAAKiG,QAE/B,EA/GA,GDzDO,SAASsR,EAAQtX,GACtB,OAAQA,EAAQkT,MAGd,KAAKgD,EAAkBqB,MAErB,OADA,EAAQ,IAAI,EAAOvX,EAAQwX,MACpB,CACLtE,KAAMgD,EAAkBuB,KACxBD,KAAM,EAAMpX,YAIhB,KAAK8V,EAAkBwB,MACrB,MAAO,CACLxE,KAAMgD,EAAkByB,OACxBH,KAAM,EAAMnL,OAAOrM,EAAQwX,OAI/B,QACE,MAAM,IAAI5W,UAAU,0BDnC1B,SAAkBsV,GAChB,qBACA,mBACA,qBACA,uBAJF,CAAkBA,MAAiB,KC/BnC,wCA0EA0B,iBAAiB,WAAW,SAAAC,GAC1BC,YAAYR,EAAQO,EAAGL","file":"search.js","sourcesContent":[" \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// 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, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\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\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 2);\n","/**\n * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.6\n * Copyright (C) 2019 Oliver Nightingale\n * @license MIT\n */\n\n;(function(){\n\n/**\n * A convenience function for configuring and constructing\n * a new lunr Index.\n *\n * A lunr.Builder instance is created and the pipeline setup\n * with a trimmer, stop word filter and stemmer.\n *\n * This builder object is yielded to the configuration function\n * that is passed as a parameter, allowing the list of fields\n * and other builder parameters to be customised.\n *\n * All documents _must_ be added within the passed config function.\n *\n * @example\n * var idx = lunr(function () {\n *   this.field('title')\n *   this.field('body')\n *   this.ref('id')\n *\n *   documents.forEach(function (doc) {\n *     this.add(doc)\n *   }, this)\n * })\n *\n * @see {@link lunr.Builder}\n * @see {@link lunr.Pipeline}\n * @see {@link lunr.trimmer}\n * @see {@link lunr.stopWordFilter}\n * @see {@link lunr.stemmer}\n * @namespace {function} lunr\n */\nvar lunr = function (config) {\n  var builder = new lunr.Builder\n\n  builder.pipeline.add(\n    lunr.trimmer,\n    lunr.stopWordFilter,\n    lunr.stemmer\n  )\n\n  builder.searchPipeline.add(\n    lunr.stemmer\n  )\n\n  config.call(builder, builder)\n  return builder.build()\n}\n\nlunr.version = \"2.3.6\"\n/*!\n * lunr.utils\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A namespace containing utils for the rest of the lunr library\n * @namespace lunr.utils\n */\nlunr.utils = {}\n\n/**\n * Print a warning message to the console.\n *\n * @param {String} message The message to be printed.\n * @memberOf lunr.utils\n * @function\n */\nlunr.utils.warn = (function (global) {\n  /* eslint-disable no-console */\n  return function (message) {\n    if (global.console && console.warn) {\n      console.warn(message)\n    }\n  }\n  /* eslint-enable no-console */\n})(this)\n\n/**\n * Convert an object to a string.\n *\n * In the case of `null` and `undefined` the function returns\n * the empty string, in all other cases the result of calling\n * `toString` on the passed object is returned.\n *\n * @param {Any} obj The object to convert to a string.\n * @return {String} string representation of the passed object.\n * @memberOf lunr.utils\n */\nlunr.utils.asString = function (obj) {\n  if (obj === void 0 || obj === null) {\n    return \"\"\n  } else {\n    return obj.toString()\n  }\n}\n\n/**\n * Clones an object.\n *\n * Will create a copy of an existing object such that any mutations\n * on the copy cannot affect the original.\n *\n * Only shallow objects are supported, passing a nested object to this\n * function will cause a TypeError.\n *\n * Objects with primitives, and arrays of primitives are supported.\n *\n * @param {Object} obj The object to clone.\n * @return {Object} a clone of the passed object.\n * @throws {TypeError} when a nested object is passed.\n * @memberOf Utils\n */\nlunr.utils.clone = function (obj) {\n  if (obj === null || obj === undefined) {\n    return obj\n  }\n\n  var clone = Object.create(null),\n      keys = Object.keys(obj)\n\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i],\n        val = obj[key]\n\n    if (Array.isArray(val)) {\n      clone[key] = val.slice()\n      continue\n    }\n\n    if (typeof val === 'string' ||\n        typeof val === 'number' ||\n        typeof val === 'boolean') {\n      clone[key] = val\n      continue\n    }\n\n    throw new TypeError(\"clone is not deep and does not support nested objects\")\n  }\n\n  return clone\n}\nlunr.FieldRef = function (docRef, fieldName, stringValue) {\n  this.docRef = docRef\n  this.fieldName = fieldName\n  this._stringValue = stringValue\n}\n\nlunr.FieldRef.joiner = \"/\"\n\nlunr.FieldRef.fromString = function (s) {\n  var n = s.indexOf(lunr.FieldRef.joiner)\n\n  if (n === -1) {\n    throw \"malformed field ref string\"\n  }\n\n  var fieldRef = s.slice(0, n),\n      docRef = s.slice(n + 1)\n\n  return new lunr.FieldRef (docRef, fieldRef, s)\n}\n\nlunr.FieldRef.prototype.toString = function () {\n  if (this._stringValue == undefined) {\n    this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef\n  }\n\n  return this._stringValue\n}\n/*!\n * lunr.Set\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A lunr set.\n *\n * @constructor\n */\nlunr.Set = function (elements) {\n  this.elements = Object.create(null)\n\n  if (elements) {\n    this.length = elements.length\n\n    for (var i = 0; i < this.length; i++) {\n      this.elements[elements[i]] = true\n    }\n  } else {\n    this.length = 0\n  }\n}\n\n/**\n * A complete set that contains all elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.complete = {\n  intersect: function (other) {\n    return other\n  },\n\n  union: function (other) {\n    return other\n  },\n\n  contains: function () {\n    return true\n  }\n}\n\n/**\n * An empty set that contains no elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.empty = {\n  intersect: function () {\n    return this\n  },\n\n  union: function (other) {\n    return other\n  },\n\n  contains: function () {\n    return false\n  }\n}\n\n/**\n * Returns true if this set contains the specified object.\n *\n * @param {object} object - Object whose presence in this set is to be tested.\n * @returns {boolean} - True if this set contains the specified object.\n */\nlunr.Set.prototype.contains = function (object) {\n  return !!this.elements[object]\n}\n\n/**\n * Returns a new set containing only the elements that are present in both\n * this set and the specified set.\n *\n * @param {lunr.Set} other - set to intersect with this set.\n * @returns {lunr.Set} a new set that is the intersection of this and the specified set.\n */\n\nlunr.Set.prototype.intersect = function (other) {\n  var a, b, elements, intersection = []\n\n  if (other === lunr.Set.complete) {\n    return this\n  }\n\n  if (other === lunr.Set.empty) {\n    return other\n  }\n\n  if (this.length < other.length) {\n    a = this\n    b = other\n  } else {\n    a = other\n    b = this\n  }\n\n  elements = Object.keys(a.elements)\n\n  for (var i = 0; i < elements.length; i++) {\n    var element = elements[i]\n    if (element in b.elements) {\n      intersection.push(element)\n    }\n  }\n\n  return new lunr.Set (intersection)\n}\n\n/**\n * Returns a new set combining the elements of this and the specified set.\n *\n * @param {lunr.Set} other - set to union with this set.\n * @return {lunr.Set} a new set that is the union of this and the specified set.\n */\n\nlunr.Set.prototype.union = function (other) {\n  if (other === lunr.Set.complete) {\n    return lunr.Set.complete\n  }\n\n  if (other === lunr.Set.empty) {\n    return this\n  }\n\n  return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))\n}\n/**\n * A function to calculate the inverse document frequency for\n * a posting. This is shared between the builder and the index\n *\n * @private\n * @param {object} posting - The posting for a given term\n * @param {number} documentCount - The total number of documents.\n */\nlunr.idf = function (posting, documentCount) {\n  var documentsWithTerm = 0\n\n  for (var fieldName in posting) {\n    if (fieldName == '_index') continue // Ignore the term index, its not a field\n    documentsWithTerm += Object.keys(posting[fieldName]).length\n  }\n\n  var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)\n\n  return Math.log(1 + Math.abs(x))\n}\n\n/**\n * A token wraps a string representation of a token\n * as it is passed through the text processing pipeline.\n *\n * @constructor\n * @param {string} [str=''] - The string token being wrapped.\n * @param {object} [metadata={}] - Metadata associated with this token.\n */\nlunr.Token = function (str, metadata) {\n  this.str = str || \"\"\n  this.metadata = metadata || {}\n}\n\n/**\n * Returns the token string that is being wrapped by this object.\n *\n * @returns {string}\n */\nlunr.Token.prototype.toString = function () {\n  return this.str\n}\n\n/**\n * A token update function is used when updating or optionally\n * when cloning a token.\n *\n * @callback lunr.Token~updateFunction\n * @param {string} str - The string representation of the token.\n * @param {Object} metadata - All metadata associated with this token.\n */\n\n/**\n * Applies the given function to the wrapped string token.\n *\n * @example\n * token.update(function (str, metadata) {\n *   return str.toUpperCase()\n * })\n *\n * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.update = function (fn) {\n  this.str = fn(this.str, this.metadata)\n  return this\n}\n\n/**\n * Creates a clone of this token. Optionally a function can be\n * applied to the cloned token.\n *\n * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.clone = function (fn) {\n  fn = fn || function (s) { return s }\n  return new lunr.Token (fn(this.str, this.metadata), this.metadata)\n}\n/*!\n * lunr.tokenizer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A function for splitting a string into tokens ready to be inserted into\n * the search index. Uses `lunr.tokenizer.separator` to split strings, change\n * the value of this property to change how strings are split into tokens.\n *\n * This tokenizer will convert its parameter to a string by calling `toString` and\n * then will split this string on the character in `lunr.tokenizer.separator`.\n * Arrays will have their elements converted to strings and wrapped in a lunr.Token.\n *\n * Optional metadata can be passed to the tokenizer, this metadata will be cloned and\n * added as metadata to every token that is created from the object to be tokenized.\n *\n * @static\n * @param {?(string|object|object[])} obj - The object to convert into tokens\n * @param {?object} metadata - Optional metadata to associate with every token\n * @returns {lunr.Token[]}\n * @see {@link lunr.Pipeline}\n */\nlunr.tokenizer = function (obj, metadata) {\n  if (obj == null || obj == undefined) {\n    return []\n  }\n\n  if (Array.isArray(obj)) {\n    return obj.map(function (t) {\n      return new lunr.Token(\n        lunr.utils.asString(t).toLowerCase(),\n        lunr.utils.clone(metadata)\n      )\n    })\n  }\n\n  var str = obj.toString().trim().toLowerCase(),\n      len = str.length,\n      tokens = []\n\n  for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {\n    var char = str.charAt(sliceEnd),\n        sliceLength = sliceEnd - sliceStart\n\n    if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {\n\n      if (sliceLength > 0) {\n        var tokenMetadata = lunr.utils.clone(metadata) || {}\n        tokenMetadata[\"position\"] = [sliceStart, sliceLength]\n        tokenMetadata[\"index\"] = tokens.length\n\n        tokens.push(\n          new lunr.Token (\n            str.slice(sliceStart, sliceEnd),\n            tokenMetadata\n          )\n        )\n      }\n\n      sliceStart = sliceEnd + 1\n    }\n\n  }\n\n  return tokens\n}\n\n/**\n * The separator used to split a string into tokens. Override this property to change the behaviour of\n * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.\n *\n * @static\n * @see lunr.tokenizer\n */\nlunr.tokenizer.separator = /[\\s\\-]+/\n/*!\n * lunr.Pipeline\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Pipelines maintain an ordered list of functions to be applied to all\n * tokens in documents entering the search index and queries being ran against\n * the index.\n *\n * An instance of lunr.Index created with the lunr shortcut will contain a\n * pipeline with a stop word filter and an English language stemmer. Extra\n * functions can be added before or after either of these functions or these\n * default functions can be removed.\n *\n * When run the pipeline will call each function in turn, passing a token, the\n * index of that token in the original list of all tokens and finally a list of\n * all the original tokens.\n *\n * The output of functions in the pipeline will be passed to the next function\n * in the pipeline. To exclude a token from entering the index the function\n * should return undefined, the rest of the pipeline will not be called with\n * this token.\n *\n * For serialisation of pipelines to work, all functions used in an instance of\n * a pipeline should be registered with lunr.Pipeline. Registered functions can\n * then be loaded. If trying to load a serialised pipeline that uses functions\n * that are not registered an error will be thrown.\n *\n * If not planning on serialising the pipeline then registering pipeline functions\n * is not necessary.\n *\n * @constructor\n */\nlunr.Pipeline = function () {\n  this._stack = []\n}\n\nlunr.Pipeline.registeredFunctions = Object.create(null)\n\n/**\n * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token\n * string as well as all known metadata. A pipeline function can mutate the token string\n * or mutate (or add) metadata for a given token.\n *\n * A pipeline function can indicate that the passed token should be discarded by returning\n * null. This token will not be passed to any downstream pipeline functions and will not be\n * added to the index.\n *\n * Multiple tokens can be returned by returning an array of tokens. Each token will be passed\n * to any downstream pipeline functions and all will returned tokens will be added to the index.\n *\n * Any number of pipeline functions may be chained together using a lunr.Pipeline.\n *\n * @interface lunr.PipelineFunction\n * @param {lunr.Token} token - A token from the document being processed.\n * @param {number} i - The index of this token in the complete list of tokens for this document/field.\n * @param {lunr.Token[]} tokens - All tokens for this document/field.\n * @returns {(?lunr.Token|lunr.Token[])}\n */\n\n/**\n * Register a function with the pipeline.\n *\n * Functions that are used in the pipeline should be registered if the pipeline\n * needs to be serialised, or a serialised pipeline needs to be loaded.\n *\n * Registering a function does not add it to a pipeline, functions must still be\n * added to instances of the pipeline for them to be used when running a pipeline.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @param {String} label - The label to register this function with\n */\nlunr.Pipeline.registerFunction = function (fn, label) {\n  if (label in this.registeredFunctions) {\n    lunr.utils.warn('Overwriting existing registered function: ' + label)\n  }\n\n  fn.label = label\n  lunr.Pipeline.registeredFunctions[fn.label] = fn\n}\n\n/**\n * Warns if the function is not registered as a Pipeline function.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @private\n */\nlunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {\n  var isRegistered = fn.label && (fn.label in this.registeredFunctions)\n\n  if (!isRegistered) {\n    lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\\n', fn)\n  }\n}\n\n/**\n * Loads a previously serialised pipeline.\n *\n * All functions to be loaded must already be registered with lunr.Pipeline.\n * If any function from the serialised data has not been registered then an\n * error will be thrown.\n *\n * @param {Object} serialised - The serialised pipeline to load.\n * @returns {lunr.Pipeline}\n */\nlunr.Pipeline.load = function (serialised) {\n  var pipeline = new lunr.Pipeline\n\n  serialised.forEach(function (fnName) {\n    var fn = lunr.Pipeline.registeredFunctions[fnName]\n\n    if (fn) {\n      pipeline.add(fn)\n    } else {\n      throw new Error('Cannot load unregistered function: ' + fnName)\n    }\n  })\n\n  return pipeline\n}\n\n/**\n * Adds new functions to the end of the pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.\n */\nlunr.Pipeline.prototype.add = function () {\n  var fns = Array.prototype.slice.call(arguments)\n\n  fns.forEach(function (fn) {\n    lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n    this._stack.push(fn)\n  }, this)\n}\n\n/**\n * Adds a single function after a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.after = function (existingFn, newFn) {\n  lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n  var pos = this._stack.indexOf(existingFn)\n  if (pos == -1) {\n    throw new Error('Cannot find existingFn')\n  }\n\n  pos = pos + 1\n  this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Adds a single function before a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.before = function (existingFn, newFn) {\n  lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n  var pos = this._stack.indexOf(existingFn)\n  if (pos == -1) {\n    throw new Error('Cannot find existingFn')\n  }\n\n  this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Removes a function from the pipeline.\n *\n * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.\n */\nlunr.Pipeline.prototype.remove = function (fn) {\n  var pos = this._stack.indexOf(fn)\n  if (pos == -1) {\n    return\n  }\n\n  this._stack.splice(pos, 1)\n}\n\n/**\n * Runs the current list of functions that make up the pipeline against the\n * passed tokens.\n *\n * @param {Array} tokens The tokens to run through the pipeline.\n * @returns {Array}\n */\nlunr.Pipeline.prototype.run = function (tokens) {\n  var stackLength = this._stack.length\n\n  for (var i = 0; i < stackLength; i++) {\n    var fn = this._stack[i]\n    var memo = []\n\n    for (var j = 0; j < tokens.length; j++) {\n      var result = fn(tokens[j], j, tokens)\n\n      if (result === void 0 || result === '') continue\n\n      if (Array.isArray(result)) {\n        for (var k = 0; k < result.length; k++) {\n          memo.push(result[k])\n        }\n      } else {\n        memo.push(result)\n      }\n    }\n\n    tokens = memo\n  }\n\n  return tokens\n}\n\n/**\n * Convenience method for passing a string through a pipeline and getting\n * strings out. This method takes care of wrapping the passed string in a\n * token and mapping the resulting tokens back to strings.\n *\n * @param {string} str - The string to pass through the pipeline.\n * @param {?object} metadata - Optional metadata to associate with the token\n * passed to the pipeline.\n * @returns {string[]}\n */\nlunr.Pipeline.prototype.runString = function (str, metadata) {\n  var token = new lunr.Token (str, metadata)\n\n  return this.run([token]).map(function (t) {\n    return t.toString()\n  })\n}\n\n/**\n * Resets the pipeline by removing any existing processors.\n *\n */\nlunr.Pipeline.prototype.reset = function () {\n  this._stack = []\n}\n\n/**\n * Returns a representation of the pipeline ready for serialisation.\n *\n * Logs a warning if the function has not been registered.\n *\n * @returns {Array}\n */\nlunr.Pipeline.prototype.toJSON = function () {\n  return this._stack.map(function (fn) {\n    lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n\n    return fn.label\n  })\n}\n/*!\n * lunr.Vector\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A vector is used to construct the vector space of documents and queries. These\n * vectors support operations to determine the similarity between two documents or\n * a document and a query.\n *\n * Normally no parameters are required for initializing a vector, but in the case of\n * loading a previously dumped vector the raw elements can be provided to the constructor.\n *\n * For performance reasons vectors are implemented with a flat array, where an elements\n * index is immediately followed by its value. E.g. [index, value, index, value]. This\n * allows the underlying array to be as sparse as possible and still offer decent\n * performance when being used for vector calculations.\n *\n * @constructor\n * @param {Number[]} [elements] - The flat list of element index and element value pairs.\n */\nlunr.Vector = function (elements) {\n  this._magnitude = 0\n  this.elements = elements || []\n}\n\n\n/**\n * Calculates the position within the vector to insert a given index.\n *\n * This is used internally by insert and upsert. If there are duplicate indexes then\n * the position is returned as if the value for that index were to be updated, but it\n * is the callers responsibility to check whether there is a duplicate at that index\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @returns {Number}\n */\nlunr.Vector.prototype.positionForIndex = function (index) {\n  // For an empty vector the tuple can be inserted at the beginning\n  if (this.elements.length == 0) {\n    return 0\n  }\n\n  var start = 0,\n      end = this.elements.length / 2,\n      sliceLength = end - start,\n      pivotPoint = Math.floor(sliceLength / 2),\n      pivotIndex = this.elements[pivotPoint * 2]\n\n  while (sliceLength > 1) {\n    if (pivotIndex < index) {\n      start = pivotPoint\n    }\n\n    if (pivotIndex > index) {\n      end = pivotPoint\n    }\n\n    if (pivotIndex == index) {\n      break\n    }\n\n    sliceLength = end - start\n    pivotPoint = start + Math.floor(sliceLength / 2)\n    pivotIndex = this.elements[pivotPoint * 2]\n  }\n\n  if (pivotIndex == index) {\n    return pivotPoint * 2\n  }\n\n  if (pivotIndex > index) {\n    return pivotPoint * 2\n  }\n\n  if (pivotIndex < index) {\n    return (pivotPoint + 1) * 2\n  }\n}\n\n/**\n * Inserts an element at an index within the vector.\n *\n * Does not allow duplicates, will throw an error if there is already an entry\n * for this index.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n */\nlunr.Vector.prototype.insert = function (insertIdx, val) {\n  this.upsert(insertIdx, val, function () {\n    throw \"duplicate index\"\n  })\n}\n\n/**\n * Inserts or updates an existing index within the vector.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n * @param {function} fn - A function that is called for updates, the existing value and the\n * requested value are passed as arguments\n */\nlunr.Vector.prototype.upsert = function (insertIdx, val, fn) {\n  this._magnitude = 0\n  var position = this.positionForIndex(insertIdx)\n\n  if (this.elements[position] == insertIdx) {\n    this.elements[position + 1] = fn(this.elements[position + 1], val)\n  } else {\n    this.elements.splice(position, 0, insertIdx, val)\n  }\n}\n\n/**\n * Calculates the magnitude of this vector.\n *\n * @returns {Number}\n */\nlunr.Vector.prototype.magnitude = function () {\n  if (this._magnitude) return this._magnitude\n\n  var sumOfSquares = 0,\n      elementsLength = this.elements.length\n\n  for (var i = 1; i < elementsLength; i += 2) {\n    var val = this.elements[i]\n    sumOfSquares += val * val\n  }\n\n  return this._magnitude = Math.sqrt(sumOfSquares)\n}\n\n/**\n * Calculates the dot product of this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The vector to compute the dot product with.\n * @returns {Number}\n */\nlunr.Vector.prototype.dot = function (otherVector) {\n  var dotProduct = 0,\n      a = this.elements, b = otherVector.elements,\n      aLen = a.length, bLen = b.length,\n      aVal = 0, bVal = 0,\n      i = 0, j = 0\n\n  while (i < aLen && j < bLen) {\n    aVal = a[i], bVal = b[j]\n    if (aVal < bVal) {\n      i += 2\n    } else if (aVal > bVal) {\n      j += 2\n    } else if (aVal == bVal) {\n      dotProduct += a[i + 1] * b[j + 1]\n      i += 2\n      j += 2\n    }\n  }\n\n  return dotProduct\n}\n\n/**\n * Calculates the similarity between this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The other vector to calculate the\n * similarity with.\n * @returns {Number}\n */\nlunr.Vector.prototype.similarity = function (otherVector) {\n  return this.dot(otherVector) / this.magnitude() || 0\n}\n\n/**\n * Converts the vector to an array of the elements within the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toArray = function () {\n  var output = new Array (this.elements.length / 2)\n\n  for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {\n    output[j] = this.elements[i]\n  }\n\n  return output\n}\n\n/**\n * A JSON serializable representation of the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toJSON = function () {\n  return this.elements\n}\n/* eslint-disable */\n/*!\n * lunr.stemmer\n * Copyright (C) 2019 Oliver Nightingale\n * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt\n */\n\n/**\n * lunr.stemmer is an english language stemmer, this is a JavaScript\n * implementation of the PorterStemmer taken from http://tartarus.org/~martin\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token - The string to stem\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n * @function\n */\nlunr.stemmer = (function(){\n  var step2list = {\n      \"ational\" : \"ate\",\n      \"tional\" : \"tion\",\n      \"enci\" : \"ence\",\n      \"anci\" : \"ance\",\n      \"izer\" : \"ize\",\n      \"bli\" : \"ble\",\n      \"alli\" : \"al\",\n      \"entli\" : \"ent\",\n      \"eli\" : \"e\",\n      \"ousli\" : \"ous\",\n      \"ization\" : \"ize\",\n      \"ation\" : \"ate\",\n      \"ator\" : \"ate\",\n      \"alism\" : \"al\",\n      \"iveness\" : \"ive\",\n      \"fulness\" : \"ful\",\n      \"ousness\" : \"ous\",\n      \"aliti\" : \"al\",\n      \"iviti\" : \"ive\",\n      \"biliti\" : \"ble\",\n      \"logi\" : \"log\"\n    },\n\n    step3list = {\n      \"icate\" : \"ic\",\n      \"ative\" : \"\",\n      \"alize\" : \"al\",\n      \"iciti\" : \"ic\",\n      \"ical\" : \"ic\",\n      \"ful\" : \"\",\n      \"ness\" : \"\"\n    },\n\n    c = \"[^aeiou]\",          // consonant\n    v = \"[aeiouy]\",          // vowel\n    C = c + \"[^aeiouy]*\",    // consonant sequence\n    V = v + \"[aeiou]*\",      // vowel sequence\n\n    mgr0 = \"^(\" + C + \")?\" + V + C,               // [C]VC... is m>0\n    meq1 = \"^(\" + C + \")?\" + V + C + \"(\" + V + \")?$\",  // [C]VC[V] is m=1\n    mgr1 = \"^(\" + C + \")?\" + V + C + V + C,       // [C]VCVC... is m>1\n    s_v = \"^(\" + C + \")?\" + v;                   // vowel in stem\n\n  var re_mgr0 = new RegExp(mgr0);\n  var re_mgr1 = new RegExp(mgr1);\n  var re_meq1 = new RegExp(meq1);\n  var re_s_v = new RegExp(s_v);\n\n  var re_1a = /^(.+?)(ss|i)es$/;\n  var re2_1a = /^(.+?)([^s])s$/;\n  var re_1b = /^(.+?)eed$/;\n  var re2_1b = /^(.+?)(ed|ing)$/;\n  var re_1b_2 = /.$/;\n  var re2_1b_2 = /(at|bl|iz)$/;\n  var re3_1b_2 = new RegExp(\"([^aeiouylsz])\\\\1$\");\n  var re4_1b_2 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n  var re_1c = /^(.+?[^aeiou])y$/;\n  var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;\n\n  var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;\n\n  var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;\n  var re2_4 = /^(.+?)(s|t)(ion)$/;\n\n  var re_5 = /^(.+?)e$/;\n  var re_5_1 = /ll$/;\n  var re3_5 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n  var porterStemmer = function porterStemmer(w) {\n    var stem,\n      suffix,\n      firstch,\n      re,\n      re2,\n      re3,\n      re4;\n\n    if (w.length < 3) { return w; }\n\n    firstch = w.substr(0,1);\n    if (firstch == \"y\") {\n      w = firstch.toUpperCase() + w.substr(1);\n    }\n\n    // Step 1a\n    re = re_1a\n    re2 = re2_1a;\n\n    if (re.test(w)) { w = w.replace(re,\"$1$2\"); }\n    else if (re2.test(w)) { w = w.replace(re2,\"$1$2\"); }\n\n    // Step 1b\n    re = re_1b;\n    re2 = re2_1b;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      re = re_mgr0;\n      if (re.test(fp[1])) {\n        re = re_1b_2;\n        w = w.replace(re,\"\");\n      }\n    } else if (re2.test(w)) {\n      var fp = re2.exec(w);\n      stem = fp[1];\n      re2 = re_s_v;\n      if (re2.test(stem)) {\n        w = stem;\n        re2 = re2_1b_2;\n        re3 = re3_1b_2;\n        re4 = re4_1b_2;\n        if (re2.test(w)) { w = w + \"e\"; }\n        else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,\"\"); }\n        else if (re4.test(w)) { w = w + \"e\"; }\n      }\n    }\n\n    // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)\n    re = re_1c;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      stem = fp[1];\n      w = stem + \"i\";\n    }\n\n    // Step 2\n    re = re_2;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      stem = fp[1];\n      suffix = fp[2];\n      re = re_mgr0;\n      if (re.test(stem)) {\n        w = stem + step2list[suffix];\n      }\n    }\n\n    // Step 3\n    re = re_3;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      stem = fp[1];\n      suffix = fp[2];\n      re = re_mgr0;\n      if (re.test(stem)) {\n        w = stem + step3list[suffix];\n      }\n    }\n\n    // Step 4\n    re = re_4;\n    re2 = re2_4;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      stem = fp[1];\n      re = re_mgr1;\n      if (re.test(stem)) {\n        w = stem;\n      }\n    } else if (re2.test(w)) {\n      var fp = re2.exec(w);\n      stem = fp[1] + fp[2];\n      re2 = re_mgr1;\n      if (re2.test(stem)) {\n        w = stem;\n      }\n    }\n\n    // Step 5\n    re = re_5;\n    if (re.test(w)) {\n      var fp = re.exec(w);\n      stem = fp[1];\n      re = re_mgr1;\n      re2 = re_meq1;\n      re3 = re3_5;\n      if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {\n        w = stem;\n      }\n    }\n\n    re = re_5_1;\n    re2 = re_mgr1;\n    if (re.test(w) && re2.test(w)) {\n      re = re_1b_2;\n      w = w.replace(re,\"\");\n    }\n\n    // and turn initial Y back to y\n\n    if (firstch == \"y\") {\n      w = firstch.toLowerCase() + w.substr(1);\n    }\n\n    return w;\n  };\n\n  return function (token) {\n    return token.update(porterStemmer);\n  }\n})();\n\nlunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')\n/*!\n * lunr.stopWordFilter\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.generateStopWordFilter builds a stopWordFilter function from the provided\n * list of stop words.\n *\n * The built in lunr.stopWordFilter is built using this generator and can be used\n * to generate custom stopWordFilters for applications or non English languages.\n *\n * @function\n * @param {Array} token The token to pass through the filter\n * @returns {lunr.PipelineFunction}\n * @see lunr.Pipeline\n * @see lunr.stopWordFilter\n */\nlunr.generateStopWordFilter = function (stopWords) {\n  var words = stopWords.reduce(function (memo, stopWord) {\n    memo[stopWord] = stopWord\n    return memo\n  }, {})\n\n  return function (token) {\n    if (token && words[token.toString()] !== token.toString()) return token\n  }\n}\n\n/**\n * lunr.stopWordFilter is an English language stop word list filter, any words\n * contained in the list will not be passed through the filter.\n *\n * This is intended to be used in the Pipeline. If the token does not pass the\n * filter then undefined will be returned.\n *\n * @function\n * @implements {lunr.PipelineFunction}\n * @params {lunr.Token} token - A token to check for being a stop word.\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n */\nlunr.stopWordFilter = lunr.generateStopWordFilter([\n  'a',\n  'able',\n  'about',\n  'across',\n  'after',\n  'all',\n  'almost',\n  'also',\n  'am',\n  'among',\n  'an',\n  'and',\n  'any',\n  'are',\n  'as',\n  'at',\n  'be',\n  'because',\n  'been',\n  'but',\n  'by',\n  'can',\n  'cannot',\n  'could',\n  'dear',\n  'did',\n  'do',\n  'does',\n  'either',\n  'else',\n  'ever',\n  'every',\n  'for',\n  'from',\n  'get',\n  'got',\n  'had',\n  'has',\n  'have',\n  'he',\n  'her',\n  'hers',\n  'him',\n  'his',\n  'how',\n  'however',\n  'i',\n  'if',\n  'in',\n  'into',\n  'is',\n  'it',\n  'its',\n  'just',\n  'least',\n  'let',\n  'like',\n  'likely',\n  'may',\n  'me',\n  'might',\n  'most',\n  'must',\n  'my',\n  'neither',\n  'no',\n  'nor',\n  'not',\n  'of',\n  'off',\n  'often',\n  'on',\n  'only',\n  'or',\n  'other',\n  'our',\n  'own',\n  'rather',\n  'said',\n  'say',\n  'says',\n  'she',\n  'should',\n  'since',\n  'so',\n  'some',\n  'than',\n  'that',\n  'the',\n  'their',\n  'them',\n  'then',\n  'there',\n  'these',\n  'they',\n  'this',\n  'tis',\n  'to',\n  'too',\n  'twas',\n  'us',\n  'wants',\n  'was',\n  'we',\n  'were',\n  'what',\n  'when',\n  'where',\n  'which',\n  'while',\n  'who',\n  'whom',\n  'why',\n  'will',\n  'with',\n  'would',\n  'yet',\n  'you',\n  'your'\n])\n\nlunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')\n/*!\n * lunr.trimmer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.trimmer is a pipeline function for trimming non word\n * characters from the beginning and end of tokens before they\n * enter the index.\n *\n * This implementation may not work correctly for non latin\n * characters and should either be removed or adapted for use\n * with languages with non-latin characters.\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token The token to pass through the filter\n * @returns {lunr.Token}\n * @see lunr.Pipeline\n */\nlunr.trimmer = function (token) {\n  return token.update(function (s) {\n    return s.replace(/^\\W+/, '').replace(/\\W+$/, '')\n  })\n}\n\nlunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')\n/*!\n * lunr.TokenSet\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A token set is used to store the unique list of all tokens\n * within an index. Token sets are also used to represent an\n * incoming query to the index, this query token set and index\n * token set are then intersected to find which tokens to look\n * up in the inverted index.\n *\n * A token set can hold multiple tokens, as in the case of the\n * index token set, or it can hold a single token as in the\n * case of a simple query token set.\n *\n * Additionally token sets are used to perform wildcard matching.\n * Leading, contained and trailing wildcards are supported, and\n * from this edit distance matching can also be provided.\n *\n * Token sets are implemented as a minimal finite state automata,\n * where both common prefixes and suffixes are shared between tokens.\n * This helps to reduce the space used for storing the token set.\n *\n * @constructor\n */\nlunr.TokenSet = function () {\n  this.final = false\n  this.edges = {}\n  this.id = lunr.TokenSet._nextId\n  lunr.TokenSet._nextId += 1\n}\n\n/**\n * Keeps track of the next, auto increment, identifier to assign\n * to a new tokenSet.\n *\n * TokenSets require a unique identifier to be correctly minimised.\n *\n * @private\n */\nlunr.TokenSet._nextId = 1\n\n/**\n * Creates a TokenSet instance from the given sorted array of words.\n *\n * @param {String[]} arr - A sorted array of strings to create the set from.\n * @returns {lunr.TokenSet}\n * @throws Will throw an error if the input array is not sorted.\n */\nlunr.TokenSet.fromArray = function (arr) {\n  var builder = new lunr.TokenSet.Builder\n\n  for (var i = 0, len = arr.length; i < len; i++) {\n    builder.insert(arr[i])\n  }\n\n  builder.finish()\n  return builder.root\n}\n\n/**\n * Creates a token set from a query clause.\n *\n * @private\n * @param {Object} clause - A single clause from lunr.Query.\n * @param {string} clause.term - The query clause term.\n * @param {number} [clause.editDistance] - The optional edit distance for the term.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromClause = function (clause) {\n  if ('editDistance' in clause) {\n    return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)\n  } else {\n    return lunr.TokenSet.fromString(clause.term)\n  }\n}\n\n/**\n * Creates a token set representing a single string with a specified\n * edit distance.\n *\n * Insertions, deletions, substitutions and transpositions are each\n * treated as an edit distance of 1.\n *\n * Increasing the allowed edit distance will have a dramatic impact\n * on the performance of both creating and intersecting these TokenSets.\n * It is advised to keep the edit distance less than 3.\n *\n * @param {string} str - The string to create the token set from.\n * @param {number} editDistance - The allowed edit distance to match.\n * @returns {lunr.Vector}\n */\nlunr.TokenSet.fromFuzzyString = function (str, editDistance) {\n  var root = new lunr.TokenSet\n\n  var stack = [{\n    node: root,\n    editsRemaining: editDistance,\n    str: str\n  }]\n\n  while (stack.length) {\n    var frame = stack.pop()\n\n    // no edit\n    if (frame.str.length > 0) {\n      var char = frame.str.charAt(0),\n          noEditNode\n\n      if (char in frame.node.edges) {\n        noEditNode = frame.node.edges[char]\n      } else {\n        noEditNode = new lunr.TokenSet\n        frame.node.edges[char] = noEditNode\n      }\n\n      if (frame.str.length == 1) {\n        noEditNode.final = true\n      }\n\n      stack.push({\n        node: noEditNode,\n        editsRemaining: frame.editsRemaining,\n        str: frame.str.slice(1)\n      })\n    }\n\n    if (frame.editsRemaining == 0) {\n      continue\n    }\n\n    // insertion\n    if (\"*\" in frame.node.edges) {\n      var insertionNode = frame.node.edges[\"*\"]\n    } else {\n      var insertionNode = new lunr.TokenSet\n      frame.node.edges[\"*\"] = insertionNode\n    }\n\n    if (frame.str.length == 0) {\n      insertionNode.final = true\n    }\n\n    stack.push({\n      node: insertionNode,\n      editsRemaining: frame.editsRemaining - 1,\n      str: frame.str\n    })\n\n    // deletion\n    // can only do a deletion if we have enough edits remaining\n    // and if there are characters left to delete in the string\n    if (frame.str.length > 1) {\n      stack.push({\n        node: frame.node,\n        editsRemaining: frame.editsRemaining - 1,\n        str: frame.str.slice(1)\n      })\n    }\n\n    // deletion\n    // just removing the last character from the str\n    if (frame.str.length == 1) {\n      frame.node.final = true\n    }\n\n    // substitution\n    // can only do a substitution if we have enough edits remaining\n    // and if there are characters left to substitute\n    if (frame.str.length >= 1) {\n      if (\"*\" in frame.node.edges) {\n        var substitutionNode = frame.node.edges[\"*\"]\n      } else {\n        var substitutionNode = new lunr.TokenSet\n        frame.node.edges[\"*\"] = substitutionNode\n      }\n\n      if (frame.str.length == 1) {\n        substitutionNode.final = true\n      }\n\n      stack.push({\n        node: substitutionNode,\n        editsRemaining: frame.editsRemaining - 1,\n        str: frame.str.slice(1)\n      })\n    }\n\n    // transposition\n    // can only do a transposition if there are edits remaining\n    // and there are enough characters to transpose\n    if (frame.str.length > 1) {\n      var charA = frame.str.charAt(0),\n          charB = frame.str.charAt(1),\n          transposeNode\n\n      if (charB in frame.node.edges) {\n        transposeNode = frame.node.edges[charB]\n      } else {\n        transposeNode = new lunr.TokenSet\n        frame.node.edges[charB] = transposeNode\n      }\n\n      if (frame.str.length == 1) {\n        transposeNode.final = true\n      }\n\n      stack.push({\n        node: transposeNode,\n        editsRemaining: frame.editsRemaining - 1,\n        str: charA + frame.str.slice(2)\n      })\n    }\n  }\n\n  return root\n}\n\n/**\n * Creates a TokenSet from a string.\n *\n * The string may contain one or more wildcard characters (*)\n * that will allow wildcard matching when intersecting with\n * another TokenSet.\n *\n * @param {string} str - The string to create a TokenSet from.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromString = function (str) {\n  var node = new lunr.TokenSet,\n      root = node\n\n  /*\n   * Iterates through all characters within the passed string\n   * appending a node for each character.\n   *\n   * When a wildcard character is found then a self\n   * referencing edge is introduced to continually match\n   * any number of any characters.\n   */\n  for (var i = 0, len = str.length; i < len; i++) {\n    var char = str[i],\n        final = (i == len - 1)\n\n    if (char == \"*\") {\n      node.edges[char] = node\n      node.final = final\n\n    } else {\n      var next = new lunr.TokenSet\n      next.final = final\n\n      node.edges[char] = next\n      node = next\n    }\n  }\n\n  return root\n}\n\n/**\n * Converts this TokenSet into an array of strings\n * contained within the TokenSet.\n *\n * @returns {string[]}\n */\nlunr.TokenSet.prototype.toArray = function () {\n  var words = []\n\n  var stack = [{\n    prefix: \"\",\n    node: this\n  }]\n\n  while (stack.length) {\n    var frame = stack.pop(),\n        edges = Object.keys(frame.node.edges),\n        len = edges.length\n\n    if (frame.node.final) {\n      /* In Safari, at this point the prefix is sometimes corrupted, see:\n       * https://github.com/olivernn/lunr.js/issues/279 Calling any\n       * String.prototype method forces Safari to \"cast\" this string to what\n       * it's supposed to be, fixing the bug. */\n      frame.prefix.charAt(0)\n      words.push(frame.prefix)\n    }\n\n    for (var i = 0; i < len; i++) {\n      var edge = edges[i]\n\n      stack.push({\n        prefix: frame.prefix.concat(edge),\n        node: frame.node.edges[edge]\n      })\n    }\n  }\n\n  return words\n}\n\n/**\n * Generates a string representation of a TokenSet.\n *\n * This is intended to allow TokenSets to be used as keys\n * in objects, largely to aid the construction and minimisation\n * of a TokenSet. As such it is not designed to be a human\n * friendly representation of the TokenSet.\n *\n * @returns {string}\n */\nlunr.TokenSet.prototype.toString = function () {\n  // NOTE: Using Object.keys here as this.edges is very likely\n  // to enter 'hash-mode' with many keys being added\n  //\n  // avoiding a for-in loop here as it leads to the function\n  // being de-optimised (at least in V8). From some simple\n  // benchmarks the performance is comparable, but allowing\n  // V8 to optimize may mean easy performance wins in the future.\n\n  if (this._str) {\n    return this._str\n  }\n\n  var str = this.final ? '1' : '0',\n      labels = Object.keys(this.edges).sort(),\n      len = labels.length\n\n  for (var i = 0; i < len; i++) {\n    var label = labels[i],\n        node = this.edges[label]\n\n    str = str + label + node.id\n  }\n\n  return str\n}\n\n/**\n * Returns a new TokenSet that is the intersection of\n * this TokenSet and the passed TokenSet.\n *\n * This intersection will take into account any wildcards\n * contained within the TokenSet.\n *\n * @param {lunr.TokenSet} b - An other TokenSet to intersect with.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.prototype.intersect = function (b) {\n  var output = new lunr.TokenSet,\n      frame = undefined\n\n  var stack = [{\n    qNode: b,\n    output: output,\n    node: this\n  }]\n\n  while (stack.length) {\n    frame = stack.pop()\n\n    // NOTE: As with the #toString method, we are using\n    // Object.keys and a for loop instead of a for-in loop\n    // as both of these objects enter 'hash' mode, causing\n    // the function to be de-optimised in V8\n    var qEdges = Object.keys(frame.qNode.edges),\n        qLen = qEdges.length,\n        nEdges = Object.keys(frame.node.edges),\n        nLen = nEdges.length\n\n    for (var q = 0; q < qLen; q++) {\n      var qEdge = qEdges[q]\n\n      for (var n = 0; n < nLen; n++) {\n        var nEdge = nEdges[n]\n\n        if (nEdge == qEdge || qEdge == '*') {\n          var node = frame.node.edges[nEdge],\n              qNode = frame.qNode.edges[qEdge],\n              final = node.final && qNode.final,\n              next = undefined\n\n          if (nEdge in frame.output.edges) {\n            // an edge already exists for this character\n            // no need to create a new node, just set the finality\n            // bit unless this node is already final\n            next = frame.output.edges[nEdge]\n            next.final = next.final || final\n\n          } else {\n            // no edge exists yet, must create one\n            // set the finality bit and insert it\n            // into the output\n            next = new lunr.TokenSet\n            next.final = final\n            frame.output.edges[nEdge] = next\n          }\n\n          stack.push({\n            qNode: qNode,\n            output: next,\n            node: node\n          })\n        }\n      }\n    }\n  }\n\n  return output\n}\nlunr.TokenSet.Builder = function () {\n  this.previousWord = \"\"\n  this.root = new lunr.TokenSet\n  this.uncheckedNodes = []\n  this.minimizedNodes = {}\n}\n\nlunr.TokenSet.Builder.prototype.insert = function (word) {\n  var node,\n      commonPrefix = 0\n\n  if (word < this.previousWord) {\n    throw new Error (\"Out of order word insertion\")\n  }\n\n  for (var i = 0; i < word.length && i < this.previousWord.length; i++) {\n    if (word[i] != this.previousWord[i]) break\n    commonPrefix++\n  }\n\n  this.minimize(commonPrefix)\n\n  if (this.uncheckedNodes.length == 0) {\n    node = this.root\n  } else {\n    node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child\n  }\n\n  for (var i = commonPrefix; i < word.length; i++) {\n    var nextNode = new lunr.TokenSet,\n        char = word[i]\n\n    node.edges[char] = nextNode\n\n    this.uncheckedNodes.push({\n      parent: node,\n      char: char,\n      child: nextNode\n    })\n\n    node = nextNode\n  }\n\n  node.final = true\n  this.previousWord = word\n}\n\nlunr.TokenSet.Builder.prototype.finish = function () {\n  this.minimize(0)\n}\n\nlunr.TokenSet.Builder.prototype.minimize = function (downTo) {\n  for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {\n    var node = this.uncheckedNodes[i],\n        childKey = node.child.toString()\n\n    if (childKey in this.minimizedNodes) {\n      node.parent.edges[node.char] = this.minimizedNodes[childKey]\n    } else {\n      // Cache the key for this node since\n      // we know it can't change anymore\n      node.child._str = childKey\n\n      this.minimizedNodes[childKey] = node.child\n    }\n\n    this.uncheckedNodes.pop()\n  }\n}\n/*!\n * lunr.Index\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * An index contains the built index of all documents and provides a query interface\n * to the index.\n *\n * Usually instances of lunr.Index will not be created using this constructor, instead\n * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be\n * used to load previously built and serialized indexes.\n *\n * @constructor\n * @param {Object} attrs - The attributes of the built search index.\n * @param {Object} attrs.invertedIndex - An index of term/field to document reference.\n * @param {Object<string, lunr.Vector>} attrs.fieldVectors - Field vectors\n * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.\n * @param {string[]} attrs.fields - The names of indexed document fields.\n * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.\n */\nlunr.Index = function (attrs) {\n  this.invertedIndex = attrs.invertedIndex\n  this.fieldVectors = attrs.fieldVectors\n  this.tokenSet = attrs.tokenSet\n  this.fields = attrs.fields\n  this.pipeline = attrs.pipeline\n}\n\n/**\n * A result contains details of a document matching a search query.\n * @typedef {Object} lunr.Index~Result\n * @property {string} ref - The reference of the document this result represents.\n * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.\n * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.\n */\n\n/**\n * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple\n * query language which itself is parsed into an instance of lunr.Query.\n *\n * For programmatically building queries it is advised to directly use lunr.Query, the query language\n * is best used for human entered text rather than program generated text.\n *\n * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported\n * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'\n * or 'world', though those that contain both will rank higher in the results.\n *\n * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can\n * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding\n * wildcards will increase the number of documents that will be found but can also have a negative\n * impact on query performance, especially with wildcards at the beginning of a term.\n *\n * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term\n * hello in the title field will match this query. Using a field not present in the index will lead\n * to an error being thrown.\n *\n * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term\n * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported\n * to provide fuzzy matching, e.g. 'hello~2' will match documents with hello with an edit distance of 2.\n * Avoid large values for edit distance to improve query performance.\n *\n * Each term also supports a presence modifier. By default a term's presence in document is optional, however\n * this can be changed to either required or prohibited. For a term's presence to be required in a document the\n * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and\n * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not\n * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.\n *\n * To escape special characters the backslash character '\\' can be used, this allows searches to include\n * characters that would normally be considered modifiers, e.g. `foo\\~2` will search for a term \"foo~2\" instead\n * of attempting to apply a boost of 2 to the search term \"foo\".\n *\n * @typedef {string} lunr.Index~QueryString\n * @example <caption>Simple single term query</caption>\n * hello\n * @example <caption>Multiple term query</caption>\n * hello world\n * @example <caption>term scoped to a field</caption>\n * title:hello\n * @example <caption>term with a boost of 10</caption>\n * hello^10\n * @example <caption>term with an edit distance of 2</caption>\n * hello~2\n * @example <caption>terms with presence modifiers</caption>\n * -foo +bar baz\n */\n\n/**\n * Performs a search against the index using lunr query syntax.\n *\n * Results will be returned sorted by their score, the most relevant results\n * will be returned first.  For details on how the score is calculated, please see\n * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.\n *\n * For more programmatic querying use lunr.Index#query.\n *\n * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.\n * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.search = function (queryString) {\n  return this.query(function (query) {\n    var parser = new lunr.QueryParser(queryString, query)\n    parser.parse()\n  })\n}\n\n/**\n * A query builder callback provides a query object to be used to express\n * the query to perform on the index.\n *\n * @callback lunr.Index~queryBuilder\n * @param {lunr.Query} query - The query object to build up.\n * @this lunr.Query\n */\n\n/**\n * Performs a query against the index using the yielded lunr.Query object.\n *\n * If performing programmatic queries against the index, this method is preferred\n * over lunr.Index#search so as to avoid the additional query parsing overhead.\n *\n * A query object is yielded to the supplied function which should be used to\n * express the query to be run against the index.\n *\n * Note that although this function takes a callback parameter it is _not_ an\n * asynchronous operation, the callback is just yielded a query object to be\n * customized.\n *\n * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.query = function (fn) {\n  // for each query clause\n  // * process terms\n  // * expand terms from token set\n  // * find matching documents and metadata\n  // * get document vectors\n  // * score documents\n\n  var query = new lunr.Query(this.fields),\n      matchingFields = Object.create(null),\n      queryVectors = Object.create(null),\n      termFieldCache = Object.create(null),\n      requiredMatches = Object.create(null),\n      prohibitedMatches = Object.create(null)\n\n  /*\n   * To support field level boosts a query vector is created per\n   * field. An empty vector is eagerly created to support negated\n   * queries.\n   */\n  for (var i = 0; i < this.fields.length; i++) {\n    queryVectors[this.fields[i]] = new lunr.Vector\n  }\n\n  fn.call(query, query)\n\n  for (var i = 0; i < query.clauses.length; i++) {\n    /*\n     * Unless the pipeline has been disabled for this term, which is\n     * the case for terms with wildcards, we need to pass the clause\n     * term through the search pipeline. A pipeline returns an array\n     * of processed terms. Pipeline functions may expand the passed\n     * term, which means we may end up performing multiple index lookups\n     * for a single query term.\n     */\n    var clause = query.clauses[i],\n        terms = null,\n        clauseMatches = lunr.Set.complete\n\n    if (clause.usePipeline) {\n      terms = this.pipeline.runString(clause.term, {\n        fields: clause.fields\n      })\n    } else {\n      terms = [clause.term]\n    }\n\n    for (var m = 0; m < terms.length; m++) {\n      var term = terms[m]\n\n      /*\n       * Each term returned from the pipeline needs to use the same query\n       * clause object, e.g. the same boost and or edit distance. The\n       * simplest way to do this is to re-use the clause object but mutate\n       * its term property.\n       */\n      clause.term = term\n\n      /*\n       * From the term in the clause we create a token set which will then\n       * be used to intersect the indexes token set to get a list of terms\n       * to lookup in the inverted index\n       */\n      var termTokenSet = lunr.TokenSet.fromClause(clause),\n          expandedTerms = this.tokenSet.intersect(termTokenSet).toArray()\n\n      /*\n       * If a term marked as required does not exist in the tokenSet it is\n       * impossible for the search to return any matches. We set all the field\n       * scoped required matches set to empty and stop examining any further\n       * clauses.\n       */\n      if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {\n        for (var k = 0; k < clause.fields.length; k++) {\n          var field = clause.fields[k]\n          requiredMatches[field] = lunr.Set.empty\n        }\n\n        break\n      }\n\n      for (var j = 0; j < expandedTerms.length; j++) {\n        /*\n         * For each term get the posting and termIndex, this is required for\n         * building the query vector.\n         */\n        var expandedTerm = expandedTerms[j],\n            posting = this.invertedIndex[expandedTerm],\n            termIndex = posting._index\n\n        for (var k = 0; k < clause.fields.length; k++) {\n          /*\n           * For each field that this query term is scoped by (by default\n           * all fields are in scope) we need to get all the document refs\n           * that have this term in that field.\n           *\n           * The posting is the entry in the invertedIndex for the matching\n           * term from above.\n           */\n          var field = clause.fields[k],\n              fieldPosting = posting[field],\n              matchingDocumentRefs = Object.keys(fieldPosting),\n              termField = expandedTerm + \"/\" + field,\n              matchingDocumentsSet = new lunr.Set(matchingDocumentRefs)\n\n          /*\n           * if the presence of this term is required ensure that the matching\n           * documents are added to the set of required matches for this clause.\n           *\n           */\n          if (clause.presence == lunr.Query.presence.REQUIRED) {\n            clauseMatches = clauseMatches.union(matchingDocumentsSet)\n\n            if (requiredMatches[field] === undefined) {\n              requiredMatches[field] = lunr.Set.complete\n            }\n          }\n\n          /*\n           * if the presence of this term is prohibited ensure that the matching\n           * documents are added to the set of prohibited matches for this field,\n           * creating that set if it does not yet exist.\n           */\n          if (clause.presence == lunr.Query.presence.PROHIBITED) {\n            if (prohibitedMatches[field] === undefined) {\n              prohibitedMatches[field] = lunr.Set.empty\n            }\n\n            prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet)\n\n            /*\n             * Prohibited matches should not be part of the query vector used for\n             * similarity scoring and no metadata should be extracted so we continue\n             * to the next field\n             */\n            continue\n          }\n\n          /*\n           * The query field vector is populated using the termIndex found for\n           * the term and a unit value with the appropriate boost applied.\n           * Using upsert because there could already be an entry in the vector\n           * for the term we are working with. In that case we just add the scores\n           * together.\n           */\n          queryVectors[field].upsert(termIndex, clause.boost, function (a, b) { return a + b })\n\n          /**\n           * If we've already seen this term, field combo then we've already collected\n           * the matching documents and metadata, no need to go through all that again\n           */\n          if (termFieldCache[termField]) {\n            continue\n          }\n\n          for (var l = 0; l < matchingDocumentRefs.length; l++) {\n            /*\n             * All metadata for this term/field/document triple\n             * are then extracted and collected into an instance\n             * of lunr.MatchData ready to be returned in the query\n             * results\n             */\n            var matchingDocumentRef = matchingDocumentRefs[l],\n                matchingFieldRef = new lunr.FieldRef (matchingDocumentRef, field),\n                metadata = fieldPosting[matchingDocumentRef],\n                fieldMatch\n\n            if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {\n              matchingFields[matchingFieldRef] = new lunr.MatchData (expandedTerm, field, metadata)\n            } else {\n              fieldMatch.add(expandedTerm, field, metadata)\n            }\n\n          }\n\n          termFieldCache[termField] = true\n        }\n      }\n    }\n\n    /**\n     * If the presence was required we need to update the requiredMatches field sets.\n     * We do this after all fields for the term have collected their matches because\n     * the clause terms presence is required in _any_ of the fields not _all_ of the\n     * fields.\n     */\n    if (clause.presence === lunr.Query.presence.REQUIRED) {\n      for (var k = 0; k < clause.fields.length; k++) {\n        var field = clause.fields[k]\n        requiredMatches[field] = requiredMatches[field].intersect(clauseMatches)\n      }\n    }\n  }\n\n  /**\n   * Need to combine the field scoped required and prohibited\n   * matching documents into a global set of required and prohibited\n   * matches\n   */\n  var allRequiredMatches = lunr.Set.complete,\n      allProhibitedMatches = lunr.Set.empty\n\n  for (var i = 0; i < this.fields.length; i++) {\n    var field = this.fields[i]\n\n    if (requiredMatches[field]) {\n      allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field])\n    }\n\n    if (prohibitedMatches[field]) {\n      allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field])\n    }\n  }\n\n  var matchingFieldRefs = Object.keys(matchingFields),\n      results = [],\n      matches = Object.create(null)\n\n  /*\n   * If the query is negated (contains only prohibited terms)\n   * we need to get _all_ fieldRefs currently existing in the\n   * index. This is only done when we know that the query is\n   * entirely prohibited terms to avoid any cost of getting all\n   * fieldRefs unnecessarily.\n   *\n   * Additionally, blank MatchData must be created to correctly\n   * populate the results.\n   */\n  if (query.isNegated()) {\n    matchingFieldRefs = Object.keys(this.fieldVectors)\n\n    for (var i = 0; i < matchingFieldRefs.length; i++) {\n      var matchingFieldRef = matchingFieldRefs[i]\n      var fieldRef = lunr.FieldRef.fromString(matchingFieldRef)\n      matchingFields[matchingFieldRef] = new lunr.MatchData\n    }\n  }\n\n  for (var i = 0; i < matchingFieldRefs.length; i++) {\n    /*\n     * Currently we have document fields that match the query, but we\n     * need to return documents. The matchData and scores are combined\n     * from multiple fields belonging to the same document.\n     *\n     * Scores are calculated by field, using the query vectors created\n     * above, and combined into a final document score using addition.\n     */\n    var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),\n        docRef = fieldRef.docRef\n\n    if (!allRequiredMatches.contains(docRef)) {\n      continue\n    }\n\n    if (allProhibitedMatches.contains(docRef)) {\n      continue\n    }\n\n    var fieldVector = this.fieldVectors[fieldRef],\n        score = queryVectors[fieldRef.fieldName].similarity(fieldVector),\n        docMatch\n\n    if ((docMatch = matches[docRef]) !== undefined) {\n      docMatch.score += score\n      docMatch.matchData.combine(matchingFields[fieldRef])\n    } else {\n      var match = {\n        ref: docRef,\n        score: score,\n        matchData: matchingFields[fieldRef]\n      }\n      matches[docRef] = match\n      results.push(match)\n    }\n  }\n\n  /*\n   * Sort the results objects by score, highest first.\n   */\n  return results.sort(function (a, b) {\n    return b.score - a.score\n  })\n}\n\n/**\n * Prepares the index for JSON serialization.\n *\n * The schema for this JSON blob will be described in a\n * separate JSON schema file.\n *\n * @returns {Object}\n */\nlunr.Index.prototype.toJSON = function () {\n  var invertedIndex = Object.keys(this.invertedIndex)\n    .sort()\n    .map(function (term) {\n      return [term, this.invertedIndex[term]]\n    }, this)\n\n  var fieldVectors = Object.keys(this.fieldVectors)\n    .map(function (ref) {\n      return [ref, this.fieldVectors[ref].toJSON()]\n    }, this)\n\n  return {\n    version: lunr.version,\n    fields: this.fields,\n    fieldVectors: fieldVectors,\n    invertedIndex: invertedIndex,\n    pipeline: this.pipeline.toJSON()\n  }\n}\n\n/**\n * Loads a previously serialized lunr.Index\n *\n * @param {Object} serializedIndex - A previously serialized lunr.Index\n * @returns {lunr.Index}\n */\nlunr.Index.load = function (serializedIndex) {\n  var attrs = {},\n      fieldVectors = {},\n      serializedVectors = serializedIndex.fieldVectors,\n      invertedIndex = Object.create(null),\n      serializedInvertedIndex = serializedIndex.invertedIndex,\n      tokenSetBuilder = new lunr.TokenSet.Builder,\n      pipeline = lunr.Pipeline.load(serializedIndex.pipeline)\n\n  if (serializedIndex.version != lunr.version) {\n    lunr.utils.warn(\"Version mismatch when loading serialised index. Current version of lunr '\" + lunr.version + \"' does not match serialized index '\" + serializedIndex.version + \"'\")\n  }\n\n  for (var i = 0; i < serializedVectors.length; i++) {\n    var tuple = serializedVectors[i],\n        ref = tuple[0],\n        elements = tuple[1]\n\n    fieldVectors[ref] = new lunr.Vector(elements)\n  }\n\n  for (var i = 0; i < serializedInvertedIndex.length; i++) {\n    var tuple = serializedInvertedIndex[i],\n        term = tuple[0],\n        posting = tuple[1]\n\n    tokenSetBuilder.insert(term)\n    invertedIndex[term] = posting\n  }\n\n  tokenSetBuilder.finish()\n\n  attrs.fields = serializedIndex.fields\n\n  attrs.fieldVectors = fieldVectors\n  attrs.invertedIndex = invertedIndex\n  attrs.tokenSet = tokenSetBuilder.root\n  attrs.pipeline = pipeline\n\n  return new lunr.Index(attrs)\n}\n/*!\n * lunr.Builder\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Builder performs indexing on a set of documents and\n * returns instances of lunr.Index ready for querying.\n *\n * All configuration of the index is done via the builder, the\n * fields to index, the document reference, the text processing\n * pipeline and document scoring parameters are all set on the\n * builder before indexing.\n *\n * @constructor\n * @property {string} _ref - Internal reference to the document reference field.\n * @property {string[]} _fields - Internal reference to the document fields to index.\n * @property {object} invertedIndex - The inverted index maps terms to document fields.\n * @property {object} documentTermFrequencies - Keeps track of document term frequencies.\n * @property {object} documentLengths - Keeps track of the length of documents added to the index.\n * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.\n * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.\n * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.\n * @property {number} documentCount - Keeps track of the total number of documents indexed.\n * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.\n * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.\n * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.\n * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.\n */\nlunr.Builder = function () {\n  this._ref = \"id\"\n  this._fields = Object.create(null)\n  this._documents = Object.create(null)\n  this.invertedIndex = Object.create(null)\n  this.fieldTermFrequencies = {}\n  this.fieldLengths = {}\n  this.tokenizer = lunr.tokenizer\n  this.pipeline = new lunr.Pipeline\n  this.searchPipeline = new lunr.Pipeline\n  this.documentCount = 0\n  this._b = 0.75\n  this._k1 = 1.2\n  this.termIndex = 0\n  this.metadataWhitelist = []\n}\n\n/**\n * Sets the document field used as the document reference. Every document must have this field.\n * The type of this field in the document should be a string, if it is not a string it will be\n * coerced into a string by calling toString.\n *\n * The default ref is 'id'.\n *\n * The ref should _not_ be changed during indexing, it should be set before any documents are\n * added to the index. Changing it during indexing can lead to inconsistent results.\n *\n * @param {string} ref - The name of the reference field in the document.\n */\nlunr.Builder.prototype.ref = function (ref) {\n  this._ref = ref\n}\n\n/**\n * A function that is used to extract a field from a document.\n *\n * Lunr expects a field to be at the top level of a document, if however the field\n * is deeply nested within a document an extractor function can be used to extract\n * the right field for indexing.\n *\n * @callback fieldExtractor\n * @param {object} doc - The document being added to the index.\n * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.\n * @example <caption>Extracting a nested field</caption>\n * function (doc) { return doc.nested.field }\n */\n\n/**\n * Adds a field to the list of document fields that will be indexed. Every document being\n * indexed should have this field. Null values for this field in indexed documents will\n * not cause errors but will limit the chance of that document being retrieved by searches.\n *\n * All fields should be added before adding documents to the index. Adding fields after\n * a document has been indexed will have no effect on already indexed documents.\n *\n * Fields can be boosted at build time. This allows terms within that field to have more\n * importance when ranking search results. Use a field boost to specify that matches within\n * one field are more important than other fields.\n *\n * @param {string} fieldName - The name of a field to index in all documents.\n * @param {object} attributes - Optional attributes associated with this field.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.\n * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.\n * @throws {RangeError} fieldName cannot contain unsupported characters '/'\n */\nlunr.Builder.prototype.field = function (fieldName, attributes) {\n  if (/\\//.test(fieldName)) {\n    throw new RangeError (\"Field '\" + fieldName + \"' contains illegal character '/'\")\n  }\n\n  this._fields[fieldName] = attributes || {}\n}\n\n/**\n * A parameter to tune the amount of field length normalisation that is applied when\n * calculating relevance scores. A value of 0 will completely disable any normalisation\n * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b\n * will be clamped to the range 0 - 1.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.b = function (number) {\n  if (number < 0) {\n    this._b = 0\n  } else if (number > 1) {\n    this._b = 1\n  } else {\n    this._b = number\n  }\n}\n\n/**\n * A parameter that controls the speed at which a rise in term frequency results in term\n * frequency saturation. The default value is 1.2. Setting this to a higher value will give\n * slower saturation levels, a lower value will result in quicker saturation.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.k1 = function (number) {\n  this._k1 = number\n}\n\n/**\n * Adds a document to the index.\n *\n * Before adding fields to the index the index should have been fully setup, with the document\n * ref and all fields to index already having been specified.\n *\n * The document must have a field name as specified by the ref (by default this is 'id') and\n * it should have all fields defined for indexing, though null or undefined values will not\n * cause errors.\n *\n * Entire documents can be boosted at build time. Applying a boost to a document indicates that\n * this document should rank higher in search results than other documents.\n *\n * @param {object} doc - The document to add to the index.\n * @param {object} attributes - Optional attributes associated with this document.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.\n */\nlunr.Builder.prototype.add = function (doc, attributes) {\n  var docRef = doc[this._ref],\n      fields = Object.keys(this._fields)\n\n  this._documents[docRef] = attributes || {}\n  this.documentCount += 1\n\n  for (var i = 0; i < fields.length; i++) {\n    var fieldName = fields[i],\n        extractor = this._fields[fieldName].extractor,\n        field = extractor ? extractor(doc) : doc[fieldName],\n        tokens = this.tokenizer(field, {\n          fields: [fieldName]\n        }),\n        terms = this.pipeline.run(tokens),\n        fieldRef = new lunr.FieldRef (docRef, fieldName),\n        fieldTerms = Object.create(null)\n\n    this.fieldTermFrequencies[fieldRef] = fieldTerms\n    this.fieldLengths[fieldRef] = 0\n\n    // store the length of this field for this document\n    this.fieldLengths[fieldRef] += terms.length\n\n    // calculate term frequencies for this field\n    for (var j = 0; j < terms.length; j++) {\n      var term = terms[j]\n\n      if (fieldTerms[term] == undefined) {\n        fieldTerms[term] = 0\n      }\n\n      fieldTerms[term] += 1\n\n      // add to inverted index\n      // create an initial posting if one doesn't exist\n      if (this.invertedIndex[term] == undefined) {\n        var posting = Object.create(null)\n        posting[\"_index\"] = this.termIndex\n        this.termIndex += 1\n\n        for (var k = 0; k < fields.length; k++) {\n          posting[fields[k]] = Object.create(null)\n        }\n\n        this.invertedIndex[term] = posting\n      }\n\n      // add an entry for this term/fieldName/docRef to the invertedIndex\n      if (this.invertedIndex[term][fieldName][docRef] == undefined) {\n        this.invertedIndex[term][fieldName][docRef] = Object.create(null)\n      }\n\n      // store all whitelisted metadata about this token in the\n      // inverted index\n      for (var l = 0; l < this.metadataWhitelist.length; l++) {\n        var metadataKey = this.metadataWhitelist[l],\n            metadata = term.metadata[metadataKey]\n\n        if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {\n          this.invertedIndex[term][fieldName][docRef][metadataKey] = []\n        }\n\n        this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata)\n      }\n    }\n\n  }\n}\n\n/**\n * Calculates the average document length for this index\n *\n * @private\n */\nlunr.Builder.prototype.calculateAverageFieldLengths = function () {\n\n  var fieldRefs = Object.keys(this.fieldLengths),\n      numberOfFields = fieldRefs.length,\n      accumulator = {},\n      documentsWithField = {}\n\n  for (var i = 0; i < numberOfFields; i++) {\n    var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n        field = fieldRef.fieldName\n\n    documentsWithField[field] || (documentsWithField[field] = 0)\n    documentsWithField[field] += 1\n\n    accumulator[field] || (accumulator[field] = 0)\n    accumulator[field] += this.fieldLengths[fieldRef]\n  }\n\n  var fields = Object.keys(this._fields)\n\n  for (var i = 0; i < fields.length; i++) {\n    var fieldName = fields[i]\n    accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName]\n  }\n\n  this.averageFieldLength = accumulator\n}\n\n/**\n * Builds a vector space model of every document using lunr.Vector\n *\n * @private\n */\nlunr.Builder.prototype.createFieldVectors = function () {\n  var fieldVectors = {},\n      fieldRefs = Object.keys(this.fieldTermFrequencies),\n      fieldRefsLength = fieldRefs.length,\n      termIdfCache = Object.create(null)\n\n  for (var i = 0; i < fieldRefsLength; i++) {\n    var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n        fieldName = fieldRef.fieldName,\n        fieldLength = this.fieldLengths[fieldRef],\n        fieldVector = new lunr.Vector,\n        termFrequencies = this.fieldTermFrequencies[fieldRef],\n        terms = Object.keys(termFrequencies),\n        termsLength = terms.length\n\n\n    var fieldBoost = this._fields[fieldName].boost || 1,\n        docBoost = this._documents[fieldRef.docRef].boost || 1\n\n    for (var j = 0; j < termsLength; j++) {\n      var term = terms[j],\n          tf = termFrequencies[term],\n          termIndex = this.invertedIndex[term]._index,\n          idf, score, scoreWithPrecision\n\n      if (termIdfCache[term] === undefined) {\n        idf = lunr.idf(this.invertedIndex[term], this.documentCount)\n        termIdfCache[term] = idf\n      } else {\n        idf = termIdfCache[term]\n      }\n\n      score = idf * ((this._k1 + 1) * tf) / (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf)\n      score *= fieldBoost\n      score *= docBoost\n      scoreWithPrecision = Math.round(score * 1000) / 1000\n      // Converts 1.23456789 to 1.234.\n      // Reducing the precision so that the vectors take up less\n      // space when serialised. Doing it now so that they behave\n      // the same before and after serialisation. Also, this is\n      // the fastest approach to reducing a number's precision in\n      // JavaScript.\n\n      fieldVector.insert(termIndex, scoreWithPrecision)\n    }\n\n    fieldVectors[fieldRef] = fieldVector\n  }\n\n  this.fieldVectors = fieldVectors\n}\n\n/**\n * Creates a token set of all tokens in the index using lunr.TokenSet\n *\n * @private\n */\nlunr.Builder.prototype.createTokenSet = function () {\n  this.tokenSet = lunr.TokenSet.fromArray(\n    Object.keys(this.invertedIndex).sort()\n  )\n}\n\n/**\n * Builds the index, creating an instance of lunr.Index.\n *\n * This completes the indexing process and should only be called\n * once all documents have been added to the index.\n *\n * @returns {lunr.Index}\n */\nlunr.Builder.prototype.build = function () {\n  this.calculateAverageFieldLengths()\n  this.createFieldVectors()\n  this.createTokenSet()\n\n  return new lunr.Index({\n    invertedIndex: this.invertedIndex,\n    fieldVectors: this.fieldVectors,\n    tokenSet: this.tokenSet,\n    fields: Object.keys(this._fields),\n    pipeline: this.searchPipeline\n  })\n}\n\n/**\n * Applies a plugin to the index builder.\n *\n * A plugin is a function that is called with the index builder as its context.\n * Plugins can be used to customise or extend the behaviour of the index\n * in some way. A plugin is just a function, that encapsulated the custom\n * behaviour that should be applied when building the index.\n *\n * The plugin function will be called with the index builder as its argument, additional\n * arguments can also be passed when calling use. The function will be called\n * with the index builder as its context.\n *\n * @param {Function} plugin The plugin to apply.\n */\nlunr.Builder.prototype.use = function (fn) {\n  var args = Array.prototype.slice.call(arguments, 1)\n  args.unshift(this)\n  fn.apply(this, args)\n}\n/**\n * Contains and collects metadata about a matching document.\n * A single instance of lunr.MatchData is returned as part of every\n * lunr.Index~Result.\n *\n * @constructor\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n * @property {object} metadata - A cloned collection of metadata associated with this document.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData = function (term, field, metadata) {\n  var clonedMetadata = Object.create(null),\n      metadataKeys = Object.keys(metadata || {})\n\n  // Cloning the metadata to prevent the original\n  // being mutated during match data combination.\n  // Metadata is kept in an array within the inverted\n  // index so cloning the data can be done with\n  // Array#slice\n  for (var i = 0; i < metadataKeys.length; i++) {\n    var key = metadataKeys[i]\n    clonedMetadata[key] = metadata[key].slice()\n  }\n\n  this.metadata = Object.create(null)\n\n  if (term !== undefined) {\n    this.metadata[term] = Object.create(null)\n    this.metadata[term][field] = clonedMetadata\n  }\n}\n\n/**\n * An instance of lunr.MatchData will be created for every term that matches a\n * document. However only one instance is required in a lunr.Index~Result. This\n * method combines metadata from another instance of lunr.MatchData with this\n * objects metadata.\n *\n * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData.prototype.combine = function (otherMatchData) {\n  var terms = Object.keys(otherMatchData.metadata)\n\n  for (var i = 0; i < terms.length; i++) {\n    var term = terms[i],\n        fields = Object.keys(otherMatchData.metadata[term])\n\n    if (this.metadata[term] == undefined) {\n      this.metadata[term] = Object.create(null)\n    }\n\n    for (var j = 0; j < fields.length; j++) {\n      var field = fields[j],\n          keys = Object.keys(otherMatchData.metadata[term][field])\n\n      if (this.metadata[term][field] == undefined) {\n        this.metadata[term][field] = Object.create(null)\n      }\n\n      for (var k = 0; k < keys.length; k++) {\n        var key = keys[k]\n\n        if (this.metadata[term][field][key] == undefined) {\n          this.metadata[term][field][key] = otherMatchData.metadata[term][field][key]\n        } else {\n          this.metadata[term][field][key] = this.metadata[term][field][key].concat(otherMatchData.metadata[term][field][key])\n        }\n\n      }\n    }\n  }\n}\n\n/**\n * Add metadata for a term/field pair to this instance of match data.\n *\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n */\nlunr.MatchData.prototype.add = function (term, field, metadata) {\n  if (!(term in this.metadata)) {\n    this.metadata[term] = Object.create(null)\n    this.metadata[term][field] = metadata\n    return\n  }\n\n  if (!(field in this.metadata[term])) {\n    this.metadata[term][field] = metadata\n    return\n  }\n\n  var metadataKeys = Object.keys(metadata)\n\n  for (var i = 0; i < metadataKeys.length; i++) {\n    var key = metadataKeys[i]\n\n    if (key in this.metadata[term][field]) {\n      this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key])\n    } else {\n      this.metadata[term][field][key] = metadata[key]\n    }\n  }\n}\n/**\n * A lunr.Query provides a programmatic way of defining queries to be performed\n * against a {@link lunr.Index}.\n *\n * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method\n * so the query object is pre-initialized with the right index fields.\n *\n * @constructor\n * @property {lunr.Query~Clause[]} clauses - An array of query clauses.\n * @property {string[]} allFields - An array of all available fields in a lunr.Index.\n */\nlunr.Query = function (allFields) {\n  this.clauses = []\n  this.allFields = allFields\n}\n\n/**\n * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.\n *\n * This allows wildcards to be added to the beginning and end of a term without having to manually do any string\n * concatenation.\n *\n * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.\n *\n * @constant\n * @default\n * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour\n * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists\n * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example <caption>query term with trailing wildcard</caption>\n * query.term('foo', { wildcard: lunr.Query.wildcard.TRAILING })\n * @example <caption>query term with leading and trailing wildcard</caption>\n * query.term('foo', {\n *   wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING\n * })\n */\n\nlunr.Query.wildcard = new String (\"*\")\nlunr.Query.wildcard.NONE = 0\nlunr.Query.wildcard.LEADING = 1\nlunr.Query.wildcard.TRAILING = 2\n\n/**\n * Constants for indicating what kind of presence a term must have in matching documents.\n *\n * @constant\n * @enum {number}\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example <caption>query term with required presence</caption>\n * query.term('foo', { presence: lunr.Query.presence.REQUIRED })\n */\nlunr.Query.presence = {\n  /**\n   * Term's presence in a document is optional, this is the default value.\n   */\n  OPTIONAL: 1,\n\n  /**\n   * Term's presence in a document is required, documents that do not contain\n   * this term will not be returned.\n   */\n  REQUIRED: 2,\n\n  /**\n   * Term's presence in a document is prohibited, documents that do contain\n   * this term will not be returned.\n   */\n  PROHIBITED: 3\n}\n\n/**\n * A single clause in a {@link lunr.Query} contains a term and details on how to\n * match that term against a {@link lunr.Index}.\n *\n * @typedef {Object} lunr.Query~Clause\n * @property {string[]} fields - The fields in an index this clause should be matched against.\n * @property {number} [boost=1] - Any boost that should be applied when matching this clause.\n * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.\n * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.\n * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.\n * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.\n */\n\n/**\n * Adds a {@link lunr.Query~Clause} to this query.\n *\n * Unless the clause contains the fields to be matched all fields will be matched. In addition\n * a default boost of 1 is applied to the clause.\n *\n * @param {lunr.Query~Clause} clause - The clause to add to this query.\n * @see lunr.Query~Clause\n * @returns {lunr.Query}\n */\nlunr.Query.prototype.clause = function (clause) {\n  if (!('fields' in clause)) {\n    clause.fields = this.allFields\n  }\n\n  if (!('boost' in clause)) {\n    clause.boost = 1\n  }\n\n  if (!('usePipeline' in clause)) {\n    clause.usePipeline = true\n  }\n\n  if (!('wildcard' in clause)) {\n    clause.wildcard = lunr.Query.wildcard.NONE\n  }\n\n  if ((clause.wildcard & lunr.Query.wildcard.LEADING) && (clause.term.charAt(0) != lunr.Query.wildcard)) {\n    clause.term = \"*\" + clause.term\n  }\n\n  if ((clause.wildcard & lunr.Query.wildcard.TRAILING) && (clause.term.slice(-1) != lunr.Query.wildcard)) {\n    clause.term = \"\" + clause.term + \"*\"\n  }\n\n  if (!('presence' in clause)) {\n    clause.presence = lunr.Query.presence.OPTIONAL\n  }\n\n  this.clauses.push(clause)\n\n  return this\n}\n\n/**\n * A negated query is one in which every clause has a presence of\n * prohibited. These queries require some special processing to return\n * the expected results.\n *\n * @returns boolean\n */\nlunr.Query.prototype.isNegated = function () {\n  for (var i = 0; i < this.clauses.length; i++) {\n    if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {\n      return false\n    }\n  }\n\n  return true\n}\n\n/**\n * Adds a term to the current query, under the covers this will create a {@link lunr.Query~Clause}\n * to the list of clauses that make up this query.\n *\n * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion\n * to a token or token-like string should be done before calling this method.\n *\n * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an\n * array, each term in the array will share the same options.\n *\n * @param {object|object[]} term - The term(s) to add to the query.\n * @param {object} [options] - Any additional properties to add to the query clause.\n * @returns {lunr.Query}\n * @see lunr.Query#clause\n * @see lunr.Query~Clause\n * @example <caption>adding a single term to a query</caption>\n * query.term(\"foo\")\n * @example <caption>adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard</caption>\n * query.term(\"foo\", {\n *   fields: [\"title\"],\n *   boost: 10,\n *   wildcard: lunr.Query.wildcard.TRAILING\n * })\n * @example <caption>using lunr.tokenizer to convert a string to tokens before using them as terms</caption>\n * query.term(lunr.tokenizer(\"foo bar\"))\n */\nlunr.Query.prototype.term = function (term, options) {\n  if (Array.isArray(term)) {\n    term.forEach(function (t) { this.term(t, lunr.utils.clone(options)) }, this)\n    return this\n  }\n\n  var clause = options || {}\n  clause.term = term.toString()\n\n  this.clause(clause)\n\n  return this\n}\nlunr.QueryParseError = function (message, start, end) {\n  this.name = \"QueryParseError\"\n  this.message = message\n  this.start = start\n  this.end = end\n}\n\nlunr.QueryParseError.prototype = new Error\nlunr.QueryLexer = function (str) {\n  this.lexemes = []\n  this.str = str\n  this.length = str.length\n  this.pos = 0\n  this.start = 0\n  this.escapeCharPositions = []\n}\n\nlunr.QueryLexer.prototype.run = function () {\n  var state = lunr.QueryLexer.lexText\n\n  while (state) {\n    state = state(this)\n  }\n}\n\nlunr.QueryLexer.prototype.sliceString = function () {\n  var subSlices = [],\n      sliceStart = this.start,\n      sliceEnd = this.pos\n\n  for (var i = 0; i < this.escapeCharPositions.length; i++) {\n    sliceEnd = this.escapeCharPositions[i]\n    subSlices.push(this.str.slice(sliceStart, sliceEnd))\n    sliceStart = sliceEnd + 1\n  }\n\n  subSlices.push(this.str.slice(sliceStart, this.pos))\n  this.escapeCharPositions.length = 0\n\n  return subSlices.join('')\n}\n\nlunr.QueryLexer.prototype.emit = function (type) {\n  this.lexemes.push({\n    type: type,\n    str: this.sliceString(),\n    start: this.start,\n    end: this.pos\n  })\n\n  this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.escapeCharacter = function () {\n  this.escapeCharPositions.push(this.pos - 1)\n  this.pos += 1\n}\n\nlunr.QueryLexer.prototype.next = function () {\n  if (this.pos >= this.length) {\n    return lunr.QueryLexer.EOS\n  }\n\n  var char = this.str.charAt(this.pos)\n  this.pos += 1\n  return char\n}\n\nlunr.QueryLexer.prototype.width = function () {\n  return this.pos - this.start\n}\n\nlunr.QueryLexer.prototype.ignore = function () {\n  if (this.start == this.pos) {\n    this.pos += 1\n  }\n\n  this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.backup = function () {\n  this.pos -= 1\n}\n\nlunr.QueryLexer.prototype.acceptDigitRun = function () {\n  var char, charCode\n\n  do {\n    char = this.next()\n    charCode = char.charCodeAt(0)\n  } while (charCode > 47 && charCode < 58)\n\n  if (char != lunr.QueryLexer.EOS) {\n    this.backup()\n  }\n}\n\nlunr.QueryLexer.prototype.more = function () {\n  return this.pos < this.length\n}\n\nlunr.QueryLexer.EOS = 'EOS'\nlunr.QueryLexer.FIELD = 'FIELD'\nlunr.QueryLexer.TERM = 'TERM'\nlunr.QueryLexer.EDIT_DISTANCE = 'EDIT_DISTANCE'\nlunr.QueryLexer.BOOST = 'BOOST'\nlunr.QueryLexer.PRESENCE = 'PRESENCE'\n\nlunr.QueryLexer.lexField = function (lexer) {\n  lexer.backup()\n  lexer.emit(lunr.QueryLexer.FIELD)\n  lexer.ignore()\n  return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexTerm = function (lexer) {\n  if (lexer.width() > 1) {\n    lexer.backup()\n    lexer.emit(lunr.QueryLexer.TERM)\n  }\n\n  lexer.ignore()\n\n  if (lexer.more()) {\n    return lunr.QueryLexer.lexText\n  }\n}\n\nlunr.QueryLexer.lexEditDistance = function (lexer) {\n  lexer.ignore()\n  lexer.acceptDigitRun()\n  lexer.emit(lunr.QueryLexer.EDIT_DISTANCE)\n  return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexBoost = function (lexer) {\n  lexer.ignore()\n  lexer.acceptDigitRun()\n  lexer.emit(lunr.QueryLexer.BOOST)\n  return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexEOS = function (lexer) {\n  if (lexer.width() > 0) {\n    lexer.emit(lunr.QueryLexer.TERM)\n  }\n}\n\n// This matches the separator used when tokenising fields\n// within a document. These should match otherwise it is\n// not possible to search for some tokens within a document.\n//\n// It is possible for the user to change the separator on the\n// tokenizer so it _might_ clash with any other of the special\n// characters already used within the search string, e.g. :.\n//\n// This means that it is possible to change the separator in\n// such a way that makes some words unsearchable using a search\n// string.\nlunr.QueryLexer.termSeparator = lunr.tokenizer.separator\n\nlunr.QueryLexer.lexText = function (lexer) {\n  while (true) {\n    var char = lexer.next()\n\n    if (char == lunr.QueryLexer.EOS) {\n      return lunr.QueryLexer.lexEOS\n    }\n\n    // Escape character is '\\'\n    if (char.charCodeAt(0) == 92) {\n      lexer.escapeCharacter()\n      continue\n    }\n\n    if (char == \":\") {\n      return lunr.QueryLexer.lexField\n    }\n\n    if (char == \"~\") {\n      lexer.backup()\n      if (lexer.width() > 0) {\n        lexer.emit(lunr.QueryLexer.TERM)\n      }\n      return lunr.QueryLexer.lexEditDistance\n    }\n\n    if (char == \"^\") {\n      lexer.backup()\n      if (lexer.width() > 0) {\n        lexer.emit(lunr.QueryLexer.TERM)\n      }\n      return lunr.QueryLexer.lexBoost\n    }\n\n    // \"+\" indicates term presence is required\n    // checking for length to ensure that only\n    // leading \"+\" are considered\n    if (char == \"+\" && lexer.width() === 1) {\n      lexer.emit(lunr.QueryLexer.PRESENCE)\n      return lunr.QueryLexer.lexText\n    }\n\n    // \"-\" indicates term presence is prohibited\n    // checking for length to ensure that only\n    // leading \"-\" are considered\n    if (char == \"-\" && lexer.width() === 1) {\n      lexer.emit(lunr.QueryLexer.PRESENCE)\n      return lunr.QueryLexer.lexText\n    }\n\n    if (char.match(lunr.QueryLexer.termSeparator)) {\n      return lunr.QueryLexer.lexTerm\n    }\n  }\n}\n\nlunr.QueryParser = function (str, query) {\n  this.lexer = new lunr.QueryLexer (str)\n  this.query = query\n  this.currentClause = {}\n  this.lexemeIdx = 0\n}\n\nlunr.QueryParser.prototype.parse = function () {\n  this.lexer.run()\n  this.lexemes = this.lexer.lexemes\n\n  var state = lunr.QueryParser.parseClause\n\n  while (state) {\n    state = state(this)\n  }\n\n  return this.query\n}\n\nlunr.QueryParser.prototype.peekLexeme = function () {\n  return this.lexemes[this.lexemeIdx]\n}\n\nlunr.QueryParser.prototype.consumeLexeme = function () {\n  var lexeme = this.peekLexeme()\n  this.lexemeIdx += 1\n  return lexeme\n}\n\nlunr.QueryParser.prototype.nextClause = function () {\n  var completedClause = this.currentClause\n  this.query.clause(completedClause)\n  this.currentClause = {}\n}\n\nlunr.QueryParser.parseClause = function (parser) {\n  var lexeme = parser.peekLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  switch (lexeme.type) {\n    case lunr.QueryLexer.PRESENCE:\n      return lunr.QueryParser.parsePresence\n    case lunr.QueryLexer.FIELD:\n      return lunr.QueryParser.parseField\n    case lunr.QueryLexer.TERM:\n      return lunr.QueryParser.parseTerm\n    default:\n      var errorMessage = \"expected either a field or a term, found \" + lexeme.type\n\n      if (lexeme.str.length >= 1) {\n        errorMessage += \" with value '\" + lexeme.str + \"'\"\n      }\n\n      throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n}\n\nlunr.QueryParser.parsePresence = function (parser) {\n  var lexeme = parser.consumeLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  switch (lexeme.str) {\n    case \"-\":\n      parser.currentClause.presence = lunr.Query.presence.PROHIBITED\n      break\n    case \"+\":\n      parser.currentClause.presence = lunr.Query.presence.REQUIRED\n      break\n    default:\n      var errorMessage = \"unrecognised presence operator'\" + lexeme.str + \"'\"\n      throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  var nextLexeme = parser.peekLexeme()\n\n  if (nextLexeme == undefined) {\n    var errorMessage = \"expecting term or field, found nothing\"\n    throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  switch (nextLexeme.type) {\n    case lunr.QueryLexer.FIELD:\n      return lunr.QueryParser.parseField\n    case lunr.QueryLexer.TERM:\n      return lunr.QueryParser.parseTerm\n    default:\n      var errorMessage = \"expecting term or field, found '\" + nextLexeme.type + \"'\"\n      throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n  }\n}\n\nlunr.QueryParser.parseField = function (parser) {\n  var lexeme = parser.consumeLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  if (parser.query.allFields.indexOf(lexeme.str) == -1) {\n    var possibleFields = parser.query.allFields.map(function (f) { return \"'\" + f + \"'\" }).join(', '),\n        errorMessage = \"unrecognised field '\" + lexeme.str + \"', possible fields: \" + possibleFields\n\n    throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  parser.currentClause.fields = [lexeme.str]\n\n  var nextLexeme = parser.peekLexeme()\n\n  if (nextLexeme == undefined) {\n    var errorMessage = \"expecting term, found nothing\"\n    throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  switch (nextLexeme.type) {\n    case lunr.QueryLexer.TERM:\n      return lunr.QueryParser.parseTerm\n    default:\n      var errorMessage = \"expecting term, found '\" + nextLexeme.type + \"'\"\n      throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n  }\n}\n\nlunr.QueryParser.parseTerm = function (parser) {\n  var lexeme = parser.consumeLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  parser.currentClause.term = lexeme.str.toLowerCase()\n\n  if (lexeme.str.indexOf(\"*\") != -1) {\n    parser.currentClause.usePipeline = false\n  }\n\n  var nextLexeme = parser.peekLexeme()\n\n  if (nextLexeme == undefined) {\n    parser.nextClause()\n    return\n  }\n\n  switch (nextLexeme.type) {\n    case lunr.QueryLexer.TERM:\n      parser.nextClause()\n      return lunr.QueryParser.parseTerm\n    case lunr.QueryLexer.FIELD:\n      parser.nextClause()\n      return lunr.QueryParser.parseField\n    case lunr.QueryLexer.EDIT_DISTANCE:\n      return lunr.QueryParser.parseEditDistance\n    case lunr.QueryLexer.BOOST:\n      return lunr.QueryParser.parseBoost\n    case lunr.QueryLexer.PRESENCE:\n      parser.nextClause()\n      return lunr.QueryParser.parsePresence\n    default:\n      var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n      throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n  }\n}\n\nlunr.QueryParser.parseEditDistance = function (parser) {\n  var lexeme = parser.consumeLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  var editDistance = parseInt(lexeme.str, 10)\n\n  if (isNaN(editDistance)) {\n    var errorMessage = \"edit distance must be numeric\"\n    throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  parser.currentClause.editDistance = editDistance\n\n  var nextLexeme = parser.peekLexeme()\n\n  if (nextLexeme == undefined) {\n    parser.nextClause()\n    return\n  }\n\n  switch (nextLexeme.type) {\n    case lunr.QueryLexer.TERM:\n      parser.nextClause()\n      return lunr.QueryParser.parseTerm\n    case lunr.QueryLexer.FIELD:\n      parser.nextClause()\n      return lunr.QueryParser.parseField\n    case lunr.QueryLexer.EDIT_DISTANCE:\n      return lunr.QueryParser.parseEditDistance\n    case lunr.QueryLexer.BOOST:\n      return lunr.QueryParser.parseBoost\n    case lunr.QueryLexer.PRESENCE:\n      parser.nextClause()\n      return lunr.QueryParser.parsePresence\n    default:\n      var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n      throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n  }\n}\n\nlunr.QueryParser.parseBoost = function (parser) {\n  var lexeme = parser.consumeLexeme()\n\n  if (lexeme == undefined) {\n    return\n  }\n\n  var boost = parseInt(lexeme.str, 10)\n\n  if (isNaN(boost)) {\n    var errorMessage = \"boost must be numeric\"\n    throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n  }\n\n  parser.currentClause.boost = boost\n\n  var nextLexeme = parser.peekLexeme()\n\n  if (nextLexeme == undefined) {\n    parser.nextClause()\n    return\n  }\n\n  switch (nextLexeme.type) {\n    case lunr.QueryLexer.TERM:\n      parser.nextClause()\n      return lunr.QueryParser.parseTerm\n    case lunr.QueryLexer.FIELD:\n      parser.nextClause()\n      return lunr.QueryParser.parseField\n    case lunr.QueryLexer.EDIT_DISTANCE:\n      return lunr.QueryParser.parseEditDistance\n    case lunr.QueryLexer.BOOST:\n      return lunr.QueryParser.parseBoost\n    case lunr.QueryLexer.PRESENCE:\n      parser.nextClause()\n      return lunr.QueryParser.parsePresence\n    default:\n      var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n      throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n  }\n}\n\n  /**\n   * export the module via AMD, CommonJS or as a browser global\n   * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n   */\n  ;(function (root, factory) {\n    if (typeof define === 'function' && define.amd) {\n      // AMD. Register as an anonymous module.\n      define(factory)\n    } else if (typeof exports === 'object') {\n      /**\n       * Node. Does not work with strict CommonJS, but\n       * only CommonJS-like enviroments that support module.exports,\n       * like Node.\n       */\n      module.exports = factory()\n    } else {\n      // Browser globals (root is window)\n      root.lunr = factory()\n    }\n  }(this, function () {\n    /**\n     * Just return a value to define the module export.\n     * This example returns an object, but the module\n     * can return a function as the exported value.\n     */\n    return lunr\n  }))\n})();\n","/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param  {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n  var str = '' + string;\n  var match = matchHtmlRegExp.exec(str);\n\n  if (!match) {\n    return str;\n  }\n\n  var escape;\n  var html = '';\n  var index = 0;\n  var lastIndex = 0;\n\n  for (index = match.index; index < str.length; index++) {\n    switch (str.charCodeAt(index)) {\n      case 34: // \"\n        escape = '&quot;';\n        break;\n      case 38: // &\n        escape = '&amp;';\n        break;\n      case 39: // '\n        escape = '&#39;';\n        break;\n      case 60: // <\n        escape = '&lt;';\n        break;\n      case 62: // >\n        escape = '&gt;';\n        break;\n      default:\n        continue;\n    }\n\n    if (lastIndex !== index) {\n      html += str.substring(lastIndex, index);\n    }\n\n    lastIndex = index + 1;\n    html += escape;\n  }\n\n  return lastIndex !== index\n    ? html + str.substring(lastIndex, index)\n    : html;\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath <martin.donath@squidfunk.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndex, SearchResult } from \"../../../modules\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n  SETUP,                               /* Search index setup */\n  DUMP,                                /* Search index dump */\n  QUERY,                               /* Search query */\n  RESULT                               /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing the data necessary to setup the search index\n */\ninterface SetupMessage {\n  type: SearchMessageType.SETUP        /* Message type */\n  data: SearchIndex                    /* Message data */\n}\n\n/**\n * A message containing the a dump of the search index\n */\ninterface DumpMessage {\n  type: SearchMessageType.DUMP        /* Message type */\n  data: string                        /* Message data */\n}\n\n/**\n * A message containing a search query\n */\ninterface QueryMessage {\n  type: SearchMessageType.QUERY        /* Message type */\n  data: string                         /* Message data */\n}\n\n/**\n * A message containing results for a search query\n */\ninterface ResultMessage {\n  type: SearchMessageType.RESULT       /* Message type */\n  data: SearchResult[]                 /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the search worker\n */\nexport type SearchMessage =\n  | SetupMessage\n  | DumpMessage\n  | QueryMessage\n  | ResultMessage\n","/*\n * Copyright (c) 2016-2019 Martin Donath <martin.donath@squidfunk.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Search } from \"modules\"\n\nimport { SearchMessage, SearchMessageType } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index\n */\nlet index: Search\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Message handler\n *\n * @param message - Source message\n *\n * @return Target message\n */\nexport function handler(message: SearchMessage): SearchMessage {\n  switch (message.type) {\n\n    /* Setup search index */\n    case SearchMessageType.SETUP:\n      index = new Search(message.data)\n      return {\n        type: SearchMessageType.DUMP,\n        data: index.toString()\n      }\n\n    /* Query search index */\n    case SearchMessageType.QUERY:\n      return {\n        type: SearchMessageType.RESULT,\n        data: index.search(message.data)\n      }\n\n    /* All other messages */\n    default:\n      throw new TypeError(\"Invalid message type\")\n  }\n}\n\n/* ----------------------------------------------------------------------------\n * Worker\n * ------------------------------------------------------------------------- */\n\naddEventListener(\"message\", ev => {\n  postMessage(handler(ev.data))\n})\n","/*\n * Copyright (c) 2016-2019 Martin Donath <martin.donath@squidfunk.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as lunr from \"lunr\"\n\nimport {\n  ArticleDocument,\n  SearchDocumentMap,\n  SectionDocument,\n  setupSearchDocumentMap\n} from \"../document\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index configuration\n */\nexport interface SearchIndexConfig {\n  lang: string[]                       /* Search languages */\n  separator: string                    /* Search separator */\n}\n\n/**\n * Search index document\n */\nexport interface SearchIndexDocument {\n  location: string                     /* Document location */\n  title: string                        /* Document title */\n  text: string                         /* Document text */\n}\n\n/**\n * Search index options\n */\nexport interface SearchIndexOptions {\n  pipeline: {\n    trimmer: boolean                   /* Add trimmer to pipeline */\n    stopwords: boolean                 /* Add stopword filter to pipeline */\n  }\n}\n\n/**\n * Search index\n *\n * This interfaces describes the format of the `search_index.json` file which\n * is automatically built by the MkDocs search plugin.\n */\nexport interface SearchIndex {\n  config: SearchIndexConfig            /* Search index configuration */\n  docs: SearchIndexDocument[]          /* Search index documents */\n  options?: SearchIndexOptions         /* Search index options */\n  index?: object | string              /* Prebuilt or serialized index */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search result\n */\nexport interface SearchResult {\n  article: ArticleDocument             /* Article document */\n  sections: SectionDocument[]          /* Section documents */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Default options\n */\nconst defaultOptions: SearchIndexOptions = {\n  pipeline: {\n    trimmer: true,\n    stopwords: true\n  }\n}\n\n/* ----------------------------------------------------------------------------\n * Class\n * ------------------------------------------------------------------------- */\n\nexport class Search {\n\n  /**\n   * Search document mapping\n   *\n   * A mapping of URLs (including hash fragments) to the actual articles and\n   * sections of the documentation. The search document mapping must be created\n   * regardless of whether the index was prebuilt or not, as lunr itself will\n   * only store the actual index.\n   */\n  protected documents: SearchDocumentMap\n\n  /**\n   * The lunr search index\n   */\n  protected index: lunr.Index\n\n  /**\n   * Create a search index\n   *\n   * @param index - Search index\n   * @param options - Options\n   */\n  public constructor({ docs, options, index }: SearchIndex) {\n    this.documents = setupSearchDocumentMap(docs)\n\n    /* If no index was given, create it */\n    if (typeof index === \"undefined\") {\n      this.index = lunr(function() {\n        const { pipeline } = options || defaultOptions\n\n        /* Remove stemmer, as it cripples search experience */\n        this.pipeline.reset()\n        if (pipeline.trimmer)\n          this.pipeline.add(lunr.trimmer)\n        if (pipeline.stopwords)\n          this.pipeline.add(lunr.stopWordFilter)\n\n        /* Setup fields and reference */\n        this.field(\"title\", { boost: 10 })\n        this.field(\"text\")\n        this.ref(\"location\")\n\n        /* Index documents */\n        for (const doc of docs)\n          this.add(doc)\n      })\n\n    /* Prebuilt or serialized index */\n    } else {\n      this.index = lunr.Index.load(\n        typeof index === \"string\"\n          ? JSON.parse(index)\n          : index\n      )\n    }\n  }\n\n  /**\n   * Search for matching documents\n   *\n   * The search index which MkDocs provides is divided up into articles, which\n   * contain the whole content of the individual pages, and sections, which only\n   * contain the contents of the subsections obtained by breaking the individual\n   * pages up at `h1` ... `h6`. As there may be many sections on different pages\n   * with indentical titles (for example within this very project, e.g. \"Usage\"\n   * or \"Installation\"), they need to be put into the context of the containing\n   * page. For this reason, section results are grouped within their respective\n   * articles which are the top-level results that are returned.\n   *\n   * @param query - Query string\n   *\n   * @return Search results\n   */\n  public search(query: string): SearchResult[] {\n    const groups = this.index.search(query\n      .replace(/\\s+[+-](?:\\s+|$)/, \"\") /* Filter rogue quantifiers */\n    )\n\n      /* Group sections by containing article */\n      .reduce((results, result) => {\n        const document = this.documents.get(result.ref)\n        if (typeof document !== \"undefined\") {\n          if (\"article\" in document) {\n            const ref = document.article.location\n            results.set(ref, [...results.get(ref) || [], result])\n          } else {\n            const ref = document.location\n            results.set(ref, results.get(ref) || [])\n          }\n        }\n        return results\n      }, new Map<string, lunr.Index.Result[]>())\n\n    /* Map groups to search documents */\n    return [...groups].map(([ref, sections]) => ({\n      article: this.documents.get(ref) as ArticleDocument,\n      sections: sections.map(section => {\n        return this.documents.get(section.ref) as SectionDocument\n      })\n    }))\n  }\n\n  /**\n   * Serialize index\n   *\n   * @return String representation\n   */\n  public toString(): string {\n    return JSON.stringify(this.index)\n  }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath <martin.donath@squidfunk.com>\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as escapeHTML from \"escape-html\"\n\nimport { SearchIndexDocument } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * A top-level article\n */\nexport interface ArticleDocument extends SearchIndexDocument {\n  section: boolean                     /* Whether the section was linked */\n}\n\n/**\n * A section of an article\n */\nexport interface SectionDocument extends SearchIndexDocument {\n  article: ArticleDocument             /* Parent article */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search document\n */\nexport type SearchDocument =\n  | ArticleDocument\n  | SectionDocument\n\n/**\n * Search document mapping\n */\nexport type SearchDocumentMap = Map<string, SearchDocument>\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Build a search document mapping\n *\n * @param docs - Search index documents\n *\n * @return Search document map\n */\nexport function setupSearchDocumentMap(\n  docs: SearchIndexDocument[]\n): SearchDocumentMap {\n  const documents = new Map<string, SearchDocument>()\n  for (const doc of docs) {\n    const [path, hash] = doc.location.split(\"#\")\n\n    /* Extract location and title */\n    const location = doc.location\n    const title    = doc.title\n\n    /* Escape and cleanup text */\n    const text = escapeHTML(doc.text)\n      .replace(/\\s+(?=[,.:;!?])/g, \"\")\n      .replace(/\\s+/g, \" \")\n\n    /* Handle section */\n    if (hash) {\n      const article = documents.get(path) as ArticleDocument\n\n      /* Ignore first section, override article */\n      if (!article.section) {\n        article.title   = doc.title\n        article.text    = text\n        article.section = true\n\n      /* Add subsequent section */\n      } else {\n        documents.set(location, { location, title, text, article })\n      }\n\n    /* Add article */\n    } else {\n      documents.set(location, { location, title, text, section: false })\n    }\n  }\n  return documents\n}\n"],"sourceRoot":""}