{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/underscore/modules/index.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/underscore/modules/index-default.js","webpack:///./core/src/files/fileinfo.js"],"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","root","self","global","Function","ArrayProto","Array","ObjProto","SymbolProto","push","slice","toString","nativeIsArray","isArray","nativeKeys","keys","nativeCreate","_isNaN","isNaN","_isFinite","isFinite","Ctor","_","obj","this","_wrapped","VERSION","optimizeCb","func","context","argCount","index","collection","accumulator","apply","arguments","baseIteratee","identity","isFunction","isObject","matcher","iteratee","Infinity","cb","restArguments","startIndex","length","Math","max","rest","args","baseCreate","result","shallowProperty","_has","path","deepGet","MAX_ARRAY_INDEX","pow","getLength","isArrayLike","each","_keys","map","results","currentKey","createReduce","dir","reducer","memo","initial","reduce","reduceRight","find","predicate","findIndex","findKey","filter","list","reject","negate","every","some","contains","item","fromIndex","guard","values","indexOf","invoke","contextPath","method","pluck","where","attrs","findWhere","computed","lastComputed","v","min","shuffle","sample","random","clone","last","rand","temp","sortBy","criteria","sort","left","right","a","b","group","behavior","partition","groupBy","indexBy","countBy","reStrSymbol","toArray","isString","match","size","pass","first","array","compact","Boolean","_flatten","input","shallow","strict","output","idx","isArguments","j","len","flatten","without","otherArrays","difference","uniq","isSorted","isBoolean","seen","union","arrays","intersection","argsLength","unzip","zip","createPredicateIndexFinder","findLastIndex","sortedIndex","low","high","mid","floor","createIndexFinder","predicateFind","lastIndexOf","range","start","stop","step","ceil","chunk","count","executeBound","sourceFunc","boundFunc","callingContext","TypeError","bound","callArgs","concat","partial","boundArgs","placeholder","position","bindAll","Error","memoize","hasher","cache","address","delay","wait","setTimeout","defer","throttle","options","timeout","previous","later","leading","now","throttled","_now","remaining","clearTimeout","trailing","cancel","debounce","immediate","debounced","callNow","wrap","wrapper","compose","after","times","before","once","hasEnumBug","propertyIsEnumerable","nonEnumerableProps","collectNonEnumProps","nonEnumIdx","constructor","proto","prop","allKeys","mapObject","pairs","invert","functions","names","createAssigner","keysFunc","defaults","source","extend","extendOwn","keyInObj","pick","omit","String","props","tap","interceptor","isMatch","eq","aStack","bStack","type","className","valueOf","areArrays","aCtor","bCtor","pop","deepEq","isEqual","isEmpty","isElement","nodeType","tagTester","isNumber","isDate","isRegExp","isError","isSymbol","isMap","isWeakMap","isSet","isWeakSet","nodelist","document","childNodes","parseFloat","isNull","isUndefined","has","constant","noop","propertyOf","accum","Int8Array","Date","getTime","escapeMap","unescapeMap","createEscaper","escaper","join","testRegexp","RegExp","replaceRegexp","string","test","replace","escape","unescape","fallback","idCounter","uniqueId","prefix","id","templateSettings","evaluate","interpolate","noMatch","escapes","escapeRegExp","escapeChar","template","text","settings","oldSettings","render","offset","variable","e","data","argument","chain","instance","_chain","chainResult","mixin","toJSON","g","window","OC","FileInfo","parseInt","mimetype","icon","permissions","mtime","etag","mountType","hasPreview","sharePermissions","Files"],"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,K,kCClFrD,6hLAWA,IAAIC,EAAsB,iBAARC,MAAoBA,KAAKA,OAASA,MAAQA,MACjC,iBAAVC,GAAsBA,EAAOA,SAAWA,GAAUA,GACzDC,SAAS,cAATA,IACA,GAGNC,EAAaC,MAAMT,UAAWU,EAAW5B,OAAOkB,UAChDW,EAAgC,oBAAXxB,OAAyBA,OAAOa,UAAY,KAGjEY,EAAOJ,EAAWI,KAClBC,EAAQL,EAAWK,MACnBC,EAAWJ,EAASI,SACpBb,EAAiBS,EAAST,eAI1Bc,EAAgBN,MAAMO,QACtBC,EAAanC,OAAOoC,KACpBC,EAAerC,OAAOY,OAGtB0B,EAAShB,EAAKiB,MACdC,EAAYlB,EAAKmB,SAGjBC,EAAO,aAII,SAASC,EAAEC,GACxB,OAAIA,aAAeD,EAAUC,EACvBC,gBAAgBF,OACtBE,KAAKC,SAAWF,GADiB,IAAID,EAAEC,GAKlC,IAAIG,EAAUJ,EAAEI,QAAU,SAKjC,SAASC,EAAWC,EAAMC,EAASC,GACjC,QAAgB,IAAZD,EAAoB,OAAOD,EAC/B,OAAoB,MAAZE,EAAmB,EAAIA,GAC7B,KAAK,EAAG,OAAO,SAAS5C,GACtB,OAAO0C,EAAKxD,KAAKyD,EAAS3C,IAG5B,KAAK,EAAG,OAAO,SAASA,EAAO6C,EAAOC,GACpC,OAAOJ,EAAKxD,KAAKyD,EAAS3C,EAAO6C,EAAOC,IAE1C,KAAK,EAAG,OAAO,SAASC,EAAa/C,EAAO6C,EAAOC,GACjD,OAAOJ,EAAKxD,KAAKyD,EAASI,EAAa/C,EAAO6C,EAAOC,IAGzD,OAAO,WACL,OAAOJ,EAAKM,MAAML,EAASM,YAO/B,SAASC,EAAalD,EAAO2C,EAASC,GACpC,OAAa,MAAT5C,EAAsBmD,GACtBC,GAAWpD,GAAeyC,EAAWzC,EAAO2C,EAASC,GACrDS,GAASrD,KAAW2B,GAAQ3B,GAAesD,GAAQtD,GAChDU,GAASV,GAOX,SAASuD,EAASvD,EAAO2C,GAC9B,OAAOO,EAAalD,EAAO2C,EAASa,KAKtC,SAASC,EAAGzD,EAAO2C,EAASC,GAC1B,OAAIR,EAAEmB,WAAaA,EAAiBnB,EAAEmB,SAASvD,EAAO2C,GAC/CO,EAAalD,EAAO2C,EAASC,GAQ/B,SAASc,EAAchB,EAAMiB,GAElC,OADAA,EAA2B,MAAdA,EAAqBjB,EAAKkB,OAAS,GAAKD,EAC9C,WAIL,IAHA,IAAIC,EAASC,KAAKC,IAAIb,UAAUW,OAASD,EAAY,GACjDI,EAAO3C,MAAMwC,GACbf,EAAQ,EACLA,EAAQe,EAAQf,IACrBkB,EAAKlB,GAASI,UAAUJ,EAAQc,GAElC,OAAQA,GACN,KAAK,EAAG,OAAOjB,EAAKxD,KAAKoD,KAAMyB,GAC/B,KAAK,EAAG,OAAOrB,EAAKxD,KAAKoD,KAAMW,UAAU,GAAIc,GAC7C,KAAK,EAAG,OAAOrB,EAAKxD,KAAKoD,KAAMW,UAAU,GAAIA,UAAU,GAAIc,GAE7D,IAAIC,EAAO5C,MAAMuC,EAAa,GAC9B,IAAKd,EAAQ,EAAGA,EAAQc,EAAYd,IAClCmB,EAAKnB,GAASI,UAAUJ,GAG1B,OADAmB,EAAKL,GAAcI,EACZrB,EAAKM,MAAMV,KAAM0B,IAK5B,SAASC,EAAWtD,GAClB,IAAK0C,GAAS1C,GAAY,MAAO,GACjC,GAAImB,EAAc,OAAOA,EAAanB,GACtCwB,EAAKxB,UAAYA,EACjB,IAAIuD,EAAS,IAAI/B,EAEjB,OADAA,EAAKxB,UAAY,KACVuD,EAGT,SAASC,EAAgB7D,GACvB,OAAO,SAAS+B,GACd,OAAc,MAAPA,OAAc,EAASA,EAAI/B,IAItC,SAAS8D,EAAK/B,EAAKgC,GACjB,OAAc,MAAPhC,GAAezB,EAAe1B,KAAKmD,EAAKgC,GAGjD,SAASC,EAAQjC,EAAKgC,GAEpB,IADA,IAAIT,EAASS,EAAKT,OACT7E,EAAI,EAAGA,EAAI6E,EAAQ7E,IAAK,CAC/B,GAAW,MAAPsD,EAAa,OACjBA,EAAMA,EAAIgC,EAAKtF,IAEjB,OAAO6E,EAASvB,OAAM,EAlExBD,EAAEmB,SAAWA,EAyEb,IAAIgB,EAAkBV,KAAKW,IAAI,EAAG,IAAM,EACpCC,EAAYN,EAAgB,UAChC,SAASO,EAAY5B,GACnB,IAAIc,EAASa,EAAU3B,GACvB,MAAwB,iBAAVc,GAAsBA,GAAU,GAAKA,GAAUW,EASxD,SAASI,EAAKtC,EAAKkB,EAAUZ,GAElC,IAAI5D,EAAG6E,EACP,GAFAL,EAAWd,EAAWc,EAAUZ,GAE5B+B,EAAYrC,GACd,IAAKtD,EAAI,EAAG6E,EAASvB,EAAIuB,OAAQ7E,EAAI6E,EAAQ7E,IAC3CwE,EAASlB,EAAItD,GAAIA,EAAGsD,OAEjB,CACL,IAAIuC,EAAQ/C,GAAKQ,GACjB,IAAKtD,EAAI,EAAG6E,EAASgB,EAAMhB,OAAQ7E,EAAI6E,EAAQ7E,IAC7CwE,EAASlB,EAAIuC,EAAM7F,IAAK6F,EAAM7F,GAAIsD,GAGtC,OAAOA,EAKF,SAASwC,EAAIxC,EAAKkB,EAAUZ,GACjCY,EAAWE,EAAGF,EAAUZ,GAIxB,IAHA,IAAIiC,GAASF,EAAYrC,IAAQR,GAAKQ,GAClCuB,GAAUgB,GAASvC,GAAKuB,OACxBkB,EAAU1D,MAAMwC,GACXf,EAAQ,EAAGA,EAAQe,EAAQf,IAAS,CAC3C,IAAIkC,EAAaH,EAAQA,EAAM/B,GAASA,EACxCiC,EAAQjC,GAASU,EAASlB,EAAI0C,GAAaA,EAAY1C,GAEzD,OAAOyC,EAKT,SAASE,EAAaC,GAGpB,IAAIC,EAAU,SAAS7C,EAAKkB,EAAU4B,EAAMC,GAC1C,IAAIR,GAASF,EAAYrC,IAAQR,GAAKQ,GAClCuB,GAAUgB,GAASvC,GAAKuB,OACxBf,EAAQoC,EAAM,EAAI,EAAIrB,EAAS,EAKnC,IAJKwB,IACHD,EAAO9C,EAAIuC,EAAQA,EAAM/B,GAASA,GAClCA,GAASoC,GAEJpC,GAAS,GAAKA,EAAQe,EAAQf,GAASoC,EAAK,CACjD,IAAIF,EAAaH,EAAQA,EAAM/B,GAASA,EACxCsC,EAAO5B,EAAS4B,EAAM9C,EAAI0C,GAAaA,EAAY1C,GAErD,OAAO8C,GAGT,OAAO,SAAS9C,EAAKkB,EAAU4B,EAAMxC,GACnC,IAAIyC,EAAUnC,UAAUW,QAAU,EAClC,OAAOsB,EAAQ7C,EAAKI,EAAWc,EAAUZ,EAAS,GAAIwC,EAAMC,IAMzD,IAAIC,EAASL,EAAa,GAItBM,EAAcN,GAAc,GAIhC,SAASO,EAAKlD,EAAKmD,EAAW7C,GACnC,IACIrC,GADYoE,EAAYrC,GAAOoD,GAAYC,IAC3BrD,EAAKmD,EAAW7C,GACpC,QAAY,IAARrC,IAA2B,IAATA,EAAY,OAAO+B,EAAI/B,GAKxC,SAASqF,EAAOtD,EAAKmD,EAAW7C,GACrC,IAAImC,EAAU,GAKd,OAJAU,EAAY/B,EAAG+B,EAAW7C,GAC1BgC,EAAKtC,GAAK,SAASrC,EAAO6C,EAAO+C,GAC3BJ,EAAUxF,EAAO6C,EAAO+C,IAAOd,EAAQvD,KAAKvB,MAE3C8E,EAKF,SAASe,EAAOxD,EAAKmD,EAAW7C,GACrC,OAAOgD,EAAOtD,EAAKyD,GAAOrC,EAAG+B,IAAa7C,GAIrC,SAASoD,EAAM1D,EAAKmD,EAAW7C,GACpC6C,EAAY/B,EAAG+B,EAAW7C,GAG1B,IAFA,IAAIiC,GAASF,EAAYrC,IAAQR,GAAKQ,GAClCuB,GAAUgB,GAASvC,GAAKuB,OACnBf,EAAQ,EAAGA,EAAQe,EAAQf,IAAS,CAC3C,IAAIkC,EAAaH,EAAQA,EAAM/B,GAASA,EACxC,IAAK2C,EAAUnD,EAAI0C,GAAaA,EAAY1C,GAAM,OAAO,EAE3D,OAAO,EAKF,SAAS2D,EAAK3D,EAAKmD,EAAW7C,GACnC6C,EAAY/B,EAAG+B,EAAW7C,GAG1B,IAFA,IAAIiC,GAASF,EAAYrC,IAAQR,GAAKQ,GAClCuB,GAAUgB,GAASvC,GAAKuB,OACnBf,EAAQ,EAAGA,EAAQe,EAAQf,IAAS,CAC3C,IAAIkC,EAAaH,EAAQA,EAAM/B,GAASA,EACxC,GAAI2C,EAAUnD,EAAI0C,GAAaA,EAAY1C,GAAM,OAAO,EAE1D,OAAO,EAKF,SAAS4D,EAAS5D,EAAK6D,EAAMC,EAAWC,GAG7C,OAFK1B,EAAYrC,KAAMA,EAAMgE,GAAOhE,KACZ,iBAAb8D,GAAyBC,KAAOD,EAAY,GAChDG,GAAQjE,EAAK6D,EAAMC,IAAc,EAKnC,IAAII,EAAS7C,GAAc,SAASrB,EAAKgC,EAAML,GACpD,IAAIwC,EAAa9D,EAOjB,OANIU,GAAWiB,GACb3B,EAAO2B,EACE1C,GAAQ0C,KACjBmC,EAAcnC,EAAK7C,MAAM,GAAI,GAC7B6C,EAAOA,EAAKA,EAAKT,OAAS,IAErBiB,EAAIxC,GAAK,SAASM,GACvB,IAAI8D,EAAS/D,EACb,IAAK+D,EAAQ,CAIX,GAHID,GAAeA,EAAY5C,SAC7BjB,EAAU2B,EAAQ3B,EAAS6D,IAEd,MAAX7D,EAAiB,OACrB8D,EAAS9D,EAAQ0B,GAEnB,OAAiB,MAAVoC,EAAiBA,EAASA,EAAOzD,MAAML,EAASqB,SAKpD,SAAS0C,EAAMrE,EAAK/B,GACzB,OAAOuE,EAAIxC,EAAK3B,GAASJ,IAKpB,SAASqG,EAAMtE,EAAKuE,GACzB,OAAOjB,EAAOtD,EAAKiB,GAAQsD,IAKtB,SAASC,EAAUxE,EAAKuE,GAC7B,OAAOrB,EAAKlD,EAAKiB,GAAQsD,IAIpB,SAAS9C,EAAIzB,EAAKkB,EAAUZ,GACjC,IACI3C,EAAO8G,EADP5C,GAAUV,IAAUuD,GAAgBvD,IAExC,GAAgB,MAAZD,GAAuC,iBAAZA,GAAyC,iBAAVlB,EAAI,IAAyB,MAAPA,EAElF,IAAK,IAAItD,EAAI,EAAG6E,GADhBvB,EAAMqC,EAAYrC,GAAOA,EAAMgE,GAAOhE,IACTuB,OAAQ7E,EAAI6E,EAAQ7E,IAElC,OADbiB,EAAQqC,EAAItD,KACSiB,EAAQkE,IAC3BA,EAASlE,QAIbuD,EAAWE,EAAGF,EAAUZ,GACxBgC,EAAKtC,GAAK,SAAS2E,EAAGnE,EAAO+C,KAC3BkB,EAAWvD,EAASyD,EAAGnE,EAAO+C,IACfmB,GAAgBD,KAActD,KAAYU,KAAYV,OACnEU,EAAS8C,EACTD,EAAeD,MAIrB,OAAO5C,EAIF,SAAS+C,EAAI5E,EAAKkB,EAAUZ,GACjC,IACI3C,EAAO8G,EADP5C,EAASV,IAAUuD,EAAevD,IAEtC,GAAgB,MAAZD,GAAuC,iBAAZA,GAAyC,iBAAVlB,EAAI,IAAyB,MAAPA,EAElF,IAAK,IAAItD,EAAI,EAAG6E,GADhBvB,EAAMqC,EAAYrC,GAAOA,EAAMgE,GAAOhE,IACTuB,OAAQ7E,EAAI6E,EAAQ7E,IAElC,OADbiB,EAAQqC,EAAItD,KACSiB,EAAQkE,IAC3BA,EAASlE,QAIbuD,EAAWE,EAAGF,EAAUZ,GACxBgC,EAAKtC,GAAK,SAAS2E,EAAGnE,EAAO+C,KAC3BkB,EAAWvD,EAASyD,EAAGnE,EAAO+C,IACfmB,GAAgBD,IAAatD,KAAYU,IAAWV,OACjEU,EAAS8C,EACTD,EAAeD,MAIrB,OAAO5C,EAIF,SAASgD,EAAQ7E,GACtB,OAAO8E,EAAO9E,EAAKmB,KAOd,SAAS2D,EAAO9E,EAAK7B,EAAG4F,GAC7B,GAAS,MAAL5F,GAAa4F,EAEf,OADK1B,EAAYrC,KAAMA,EAAMgE,GAAOhE,IAC7BA,EAAI+E,GAAO/E,EAAIuB,OAAS,IAEjC,IAAIuD,EAASzC,EAAYrC,GAAOgF,GAAMhF,GAAOgE,GAAOhE,GAChDuB,EAASa,EAAU0C,GACvB3G,EAAIqD,KAAKC,IAAID,KAAKoD,IAAIzG,EAAGoD,GAAS,GAElC,IADA,IAAI0D,EAAO1D,EAAS,EACXf,EAAQ,EAAGA,EAAQrC,EAAGqC,IAAS,CACtC,IAAI0E,EAAOH,GAAOvE,EAAOyE,GACrBE,EAAOL,EAAOtE,GAClBsE,EAAOtE,GAASsE,EAAOI,GACvBJ,EAAOI,GAAQC,EAEjB,OAAOL,EAAO3F,MAAM,EAAGhB,GAIlB,SAASiH,EAAOpF,EAAKkB,EAAUZ,GACpC,IAAIE,EAAQ,EAEZ,OADAU,EAAWE,EAAGF,EAAUZ,GACjB+D,EAAM7B,EAAIxC,GAAK,SAASrC,EAAOM,EAAKsF,GACzC,MAAO,CACL5F,MAAOA,EACP6C,MAAOA,IACP6E,SAAUnE,EAASvD,EAAOM,EAAKsF,OAEhC+B,MAAK,SAASC,EAAMC,GACrB,IAAIC,EAAIF,EAAKF,SACTK,EAAIF,EAAMH,SACd,GAAII,IAAMC,EAAG,CACX,GAAID,EAAIC,QAAW,IAAND,EAAc,OAAO,EAClC,GAAIA,EAAIC,QAAW,IAANA,EAAc,OAAQ,EAErC,OAAOH,EAAK/E,MAAQgF,EAAMhF,SACxB,SAIN,SAASmF,EAAMC,EAAUC,GACvB,OAAO,SAAS7F,EAAKkB,EAAUZ,GAC7B,IAAIuB,EAASgE,EAAY,CAAC,GAAI,IAAM,GAMpC,OALA3E,EAAWE,EAAGF,EAAUZ,GACxBgC,EAAKtC,GAAK,SAASrC,EAAO6C,GACxB,IAAIvC,EAAMiD,EAASvD,EAAO6C,EAAOR,GACjC4F,EAAS/D,EAAQlE,EAAOM,MAEnB4D,GAMJ,IAAIiE,EAAUH,GAAM,SAAS9D,EAAQlE,EAAOM,GAC7C8D,EAAKF,EAAQ5D,GAAM4D,EAAO5D,GAAKiB,KAAKvB,GAAakE,EAAO5D,GAAO,CAACN,MAK3DoI,EAAUJ,GAAM,SAAS9D,EAAQlE,EAAOM,GACjD4D,EAAO5D,GAAON,KAMLqI,GAAUL,GAAM,SAAS9D,EAAQlE,EAAOM,GAC7C8D,EAAKF,EAAQ5D,GAAM4D,EAAO5D,KAAa4D,EAAO5D,GAAO,KAGvDgI,GAAc,mEAEX,SAASC,GAAQlG,GACtB,OAAKA,EACDV,GAAQU,GAAab,EAAMtC,KAAKmD,GAChCmG,GAASnG,GAEJA,EAAIoG,MAAMH,IAEf5D,EAAYrC,GAAawC,EAAIxC,EAAKc,IAC/BkD,GAAOhE,GAPG,GAWZ,SAASqG,GAAKrG,GACnB,OAAW,MAAPA,EAAoB,EACjBqC,EAAYrC,GAAOA,EAAIuB,OAAS/B,GAAKQ,GAAKuB,OAK5C,IAAIsE,GAAYF,GAAM,SAAS9D,EAAQlE,EAAO2I,GACnDzE,EAAOyE,EAAO,EAAI,GAAGpH,KAAKvB,MACzB,GAOI,SAAS4I,GAAMC,EAAOrI,EAAG4F,GAC9B,OAAa,MAATyC,GAAiBA,EAAMjF,OAAS,EAAe,MAALpD,OAAY,EAAS,GAC1D,MAALA,GAAa4F,EAAcyC,EAAM,GAC9BzD,GAAQyD,EAAOA,EAAMjF,OAASpD,GAOhC,SAAS4E,GAAQyD,EAAOrI,EAAG4F,GAChC,OAAO5E,EAAMtC,KAAK2J,EAAO,EAAGhF,KAAKC,IAAI,EAAG+E,EAAMjF,QAAe,MAALpD,GAAa4F,EAAQ,EAAI5F,KAK5E,SAAS8G,GAAKuB,EAAOrI,EAAG4F,GAC7B,OAAa,MAATyC,GAAiBA,EAAMjF,OAAS,EAAe,MAALpD,OAAY,EAAS,GAC1D,MAALA,GAAa4F,EAAcyC,EAAMA,EAAMjF,OAAS,GAC7CG,GAAK8E,EAAOhF,KAAKC,IAAI,EAAG+E,EAAMjF,OAASpD,IAMzC,SAASuD,GAAK8E,EAAOrI,EAAG4F,GAC7B,OAAO5E,EAAMtC,KAAK2J,EAAY,MAALrI,GAAa4F,EAAQ,EAAI5F,GAK7C,SAASsI,GAAQD,GACtB,OAAOlD,EAAOkD,EAAOE,SAIvB,SAASC,GAASC,EAAOC,EAASC,EAAQC,GAGxC,IADA,IAAIC,GADJD,EAASA,GAAU,IACFxF,OACR7E,EAAI,EAAG6E,EAASa,EAAUwE,GAAQlK,EAAI6E,EAAQ7E,IAAK,CAC1D,IAAIiB,EAAQiJ,EAAMlK,GAClB,GAAI2F,EAAY1E,KAAW2B,GAAQ3B,IAAUsJ,GAAYtJ,IAEvD,GAAIkJ,EAEF,IADA,IAAIK,EAAI,EAAGC,EAAMxJ,EAAM4D,OAChB2F,EAAIC,GAAKJ,EAAOC,KAASrJ,EAAMuJ,UAEtCP,GAAShJ,EAAOkJ,EAASC,EAAQC,GACjCC,EAAMD,EAAOxF,YAELuF,IACVC,EAAOC,KAASrJ,GAGpB,OAAOoJ,EAIF,SAASK,GAAQZ,EAAOK,GAC7B,OAAOF,GAASH,EAAOK,GAAS,GAI3B,IAAIQ,GAAUhG,GAAc,SAASmF,EAAOc,GACjD,OAAOC,GAAWf,EAAOc,MAQpB,SAASE,GAAKhB,EAAOiB,EAAUvG,EAAUZ,GACzCoH,GAAUD,KACbnH,EAAUY,EACVA,EAAWuG,EACXA,GAAW,GAEG,MAAZvG,IAAkBA,EAAWE,EAAGF,EAAUZ,IAG9C,IAFA,IAAIuB,EAAS,GACT8F,EAAO,GACFjL,EAAI,EAAG6E,EAASa,EAAUoE,GAAQ9J,EAAI6E,EAAQ7E,IAAK,CAC1D,IAAIiB,EAAQ6I,EAAM9J,GACd+H,EAAWvD,EAAWA,EAASvD,EAAOjB,EAAG8J,GAAS7I,EAClD8J,IAAavG,GACVxE,GAAKiL,IAASlD,GAAU5C,EAAO3C,KAAKvB,GACzCgK,EAAOlD,GACEvD,EACJ0C,EAAS+D,EAAMlD,KAClBkD,EAAKzI,KAAKuF,GACV5C,EAAO3C,KAAKvB,IAEJiG,EAAS/B,EAAQlE,IAC3BkE,EAAO3C,KAAKvB,GAGhB,OAAOkE,EAMF,IAAI+F,GAAQvG,GAAc,SAASwG,GACxC,OAAOL,GAAKb,GAASkB,GAAQ,GAAM,OAK9B,SAASC,GAAatB,GAG3B,IAFA,IAAI3E,EAAS,GACTkG,EAAanH,UAAUW,OAClB7E,EAAI,EAAG6E,EAASa,EAAUoE,GAAQ9J,EAAI6E,EAAQ7E,IAAK,CAC1D,IAAImH,EAAO2C,EAAM9J,GACjB,IAAIkH,EAAS/B,EAAQgC,GAArB,CACA,IAAIqD,EACJ,IAAKA,EAAI,EAAGA,EAAIa,GACTnE,EAAShD,UAAUsG,GAAIrD,GADFqD,KAGxBA,IAAMa,GAAYlG,EAAO3C,KAAK2E,IAEpC,OAAOhC,EAKF,IAAI0F,GAAalG,GAAc,SAASmF,EAAO9E,GAEpD,OADAA,EAAOiF,GAASjF,GAAM,GAAM,GACrB4B,EAAOkD,GAAO,SAAS7I,GAC5B,OAAQiG,EAASlC,EAAM/D,SAMpB,SAASqK,GAAMxB,GAIpB,IAHA,IAAIjF,EAASiF,GAAS/E,EAAI+E,EAAOpE,GAAWb,QAAU,EAClDM,EAAS9C,MAAMwC,GAEVf,EAAQ,EAAGA,EAAQe,EAAQf,IAClCqB,EAAOrB,GAAS6D,EAAMmC,EAAOhG,GAE/B,OAAOqB,EAKF,IAAIoG,GAAM5G,EAAc2G,IAKxB,SAAS5J,GAAOmF,EAAMS,GAE3B,IADA,IAAInC,EAAS,GACJnF,EAAI,EAAG6E,EAASa,EAAUmB,GAAO7G,EAAI6E,EAAQ7E,IAChDsH,EACFnC,EAAO0B,EAAK7G,IAAMsH,EAAOtH,GAEzBmF,EAAO0B,EAAK7G,GAAG,IAAM6G,EAAK7G,GAAG,GAGjC,OAAOmF,EAIT,SAASqG,GAA2BtF,GAClC,OAAO,SAAS4D,EAAOrD,EAAW7C,GAChC6C,EAAY/B,EAAG+B,EAAW7C,GAG1B,IAFA,IAAIiB,EAASa,EAAUoE,GACnBhG,EAAQoC,EAAM,EAAI,EAAIrB,EAAS,EAC5Bf,GAAS,GAAKA,EAAQe,EAAQf,GAASoC,EAC5C,GAAIO,EAAUqD,EAAMhG,GAAQA,EAAOgG,GAAQ,OAAOhG,EAEpD,OAAQ,GAKL,IAAI4C,GAAY8E,GAA2B,GACvCC,GAAgBD,IAA4B,GAIhD,SAASE,GAAY5B,EAAOxG,EAAKkB,EAAUZ,GAIhD,IAFA,IAAI3C,GADJuD,EAAWE,EAAGF,EAAUZ,EAAS,IACZN,GACjBqI,EAAM,EAAGC,EAAOlG,EAAUoE,GACvB6B,EAAMC,GAAM,CACjB,IAAIC,EAAM/G,KAAKgH,OAAOH,EAAMC,GAAQ,GAChCpH,EAASsF,EAAM+B,IAAQ5K,EAAO0K,EAAME,EAAM,EAAQD,EAAOC,EAE/D,OAAOF,EAIT,SAASI,GAAkB7F,EAAK8F,EAAeN,GAC7C,OAAO,SAAS5B,EAAO3C,EAAMmD,GAC3B,IAAItK,EAAI,EAAG6E,EAASa,EAAUoE,GAC9B,GAAkB,iBAAPQ,EACLpE,EAAM,EACRlG,EAAIsK,GAAO,EAAIA,EAAMxF,KAAKC,IAAIuF,EAAMzF,EAAQ7E,GAE5C6E,EAASyF,GAAO,EAAIxF,KAAKoD,IAAIoC,EAAM,EAAGzF,GAAUyF,EAAMzF,EAAS,OAE5D,GAAI6G,GAAepB,GAAOzF,EAE/B,OAAOiF,EADPQ,EAAMoB,EAAY5B,EAAO3C,MACHA,EAAOmD,GAAO,EAEtC,GAAInD,GAASA,EAEX,OADAmD,EAAM0B,EAAcvJ,EAAMtC,KAAK2J,EAAO9J,EAAG6E,GAAS5B,MACpC,EAAIqH,EAAMtK,GAAK,EAE/B,IAAKsK,EAAMpE,EAAM,EAAIlG,EAAI6E,EAAS,EAAGyF,GAAO,GAAKA,EAAMzF,EAAQyF,GAAOpE,EACpE,GAAI4D,EAAMQ,KAASnD,EAAM,OAAOmD,EAElC,OAAQ,GAQL,IAAI/C,GAAUwE,GAAkB,EAAGrF,GAAWgF,IAC1CO,GAAcF,IAAmB,EAAGN,IAKxC,SAASS,GAAMC,EAAOC,EAAMC,GACrB,MAARD,IACFA,EAAOD,GAAS,EAChBA,EAAQ,GAELE,IACHA,EAAOD,EAAOD,GAAS,EAAI,GAM7B,IAHA,IAAItH,EAASC,KAAKC,IAAID,KAAKwH,MAAMF,EAAOD,GAASE,GAAO,GACpDH,EAAQ7J,MAAMwC,GAETyF,EAAM,EAAGA,EAAMzF,EAAQyF,IAAO6B,GAASE,EAC9CH,EAAM5B,GAAO6B,EAGf,OAAOD,EAKF,SAASK,GAAMzC,EAAO0C,GAC3B,GAAa,MAATA,GAAiBA,EAAQ,EAAG,MAAO,GAGvC,IAFA,IAAIrH,EAAS,GACTnF,EAAI,EAAG6E,EAASiF,EAAMjF,OACnB7E,EAAI6E,GACTM,EAAO3C,KAAKC,EAAMtC,KAAK2J,EAAO9J,EAAGA,GAAKwM,IAExC,OAAOrH,EAQT,SAASsH,GAAaC,EAAYC,EAAW/I,EAASgJ,EAAgB3H,GACpE,KAAM2H,aAA0BD,GAAY,OAAOD,EAAWzI,MAAML,EAASqB,GAC7E,IAAIhD,EAAOiD,EAAWwH,EAAW9K,WAC7BuD,EAASuH,EAAWzI,MAAMhC,EAAMgD,GACpC,OAAIX,GAASa,GAAgBA,EACtBlD,EAMF,IAAIT,GAAOmD,GAAc,SAAShB,EAAMC,EAASqB,GACtD,IAAKZ,GAAWV,GAAO,MAAM,IAAIkJ,UAAU,qCAC3C,IAAIC,EAAQnI,GAAc,SAASoI,GACjC,OAAON,GAAa9I,EAAMmJ,EAAOlJ,EAASL,KAAM0B,EAAK+H,OAAOD,OAE9D,OAAOD,KAOEG,GAAUtI,GAAc,SAAShB,EAAMuJ,GAChD,IAAIC,EAAcF,GAAQE,YACtBL,EAAQ,WAGV,IAFA,IAAIM,EAAW,EAAGvI,EAASqI,EAAUrI,OACjCI,EAAO5C,MAAMwC,GACR7E,EAAI,EAAGA,EAAI6E,EAAQ7E,IAC1BiF,EAAKjF,GAAKkN,EAAUlN,KAAOmN,EAAcjJ,UAAUkJ,KAAcF,EAAUlN,GAE7E,KAAOoN,EAAWlJ,UAAUW,QAAQI,EAAKzC,KAAK0B,UAAUkJ,MACxD,OAAOX,GAAa9I,EAAMmJ,EAAOvJ,KAAMA,KAAM0B,IAE/C,OAAO6H,KAGTG,GAAQE,YAAc9J,EAKf,IAAIgK,GAAU1I,GAAc,SAASrB,EAAKuC,GAE/C,IAAI/B,GADJ+B,EAAQoE,GAASpE,GAAO,GAAO,IACbhB,OAClB,GAAIf,EAAQ,EAAG,MAAM,IAAIwJ,MAAM,yCAC/B,KAAOxJ,KAAS,CACd,IAAIvC,EAAMsE,EAAM/B,GAChBR,EAAI/B,GAAOC,GAAK8B,EAAI/B,GAAM+B,OAKvB,SAASiK,GAAQ5J,EAAM6J,GAC5B,IAAID,EAAU,SAAShM,GACrB,IAAIkM,EAAQF,EAAQE,MAChBC,EAAU,IAAMF,EAASA,EAAOvJ,MAAMV,KAAMW,WAAa3C,GAE7D,OADK8D,EAAKoI,EAAOC,KAAUD,EAAMC,GAAW/J,EAAKM,MAAMV,KAAMW,YACtDuJ,EAAMC,IAGf,OADAH,EAAQE,MAAQ,GACTF,EAKF,IAAII,GAAQhJ,GAAc,SAAShB,EAAMiK,EAAM3I,GACpD,OAAO4I,YAAW,WAChB,OAAOlK,EAAKM,MAAM,KAAMgB,KACvB2I,MAKME,GAAQb,GAAQU,GAAOtK,EAAG,GAO9B,SAAS0K,GAASpK,EAAMiK,EAAMI,GACnC,IAAIC,EAASrK,EAASqB,EAAME,EACxB+I,EAAW,EACVF,IAASA,EAAU,IAExB,IAAIG,EAAQ,WACVD,GAA+B,IAApBF,EAAQI,QAAoB,EAAIC,KAC3CJ,EAAU,KACV9I,EAASxB,EAAKM,MAAML,EAASqB,GACxBgJ,IAASrK,EAAUqB,EAAO,OAG7BqJ,EAAY,WACd,IAAIC,EAAOF,KACNH,IAAgC,IAApBF,EAAQI,UAAmBF,EAAWK,GACvD,IAAIC,EAAYZ,GAAQW,EAAOL,GAc/B,OAbAtK,EAAUL,KACV0B,EAAOf,UACHsK,GAAa,GAAKA,EAAYZ,GAC5BK,IACFQ,aAAaR,GACbA,EAAU,MAEZC,EAAWK,EACXpJ,EAASxB,EAAKM,MAAML,EAASqB,GACxBgJ,IAASrK,EAAUqB,EAAO,OACrBgJ,IAAgC,IAArBD,EAAQU,WAC7BT,EAAUJ,WAAWM,EAAOK,IAEvBrJ,GAST,OANAmJ,EAAUK,OAAS,WACjBF,aAAaR,GACbC,EAAW,EACXD,EAAUrK,EAAUqB,EAAO,MAGtBqJ,EAOF,SAASM,GAASjL,EAAMiK,EAAMiB,GACnC,IAAIZ,EAAS9I,EAETgJ,EAAQ,SAASvK,EAASqB,GAC5BgJ,EAAU,KACNhJ,IAAME,EAASxB,EAAKM,MAAML,EAASqB,KAGrC6J,EAAYnK,GAAc,SAASM,GAErC,GADIgJ,GAASQ,aAAaR,GACtBY,EAAW,CACb,IAAIE,GAAWd,EACfA,EAAUJ,WAAWM,EAAOP,GACxBmB,IAAS5J,EAASxB,EAAKM,MAAMV,KAAM0B,SAEvCgJ,EAAUN,GAAMQ,EAAOP,EAAMrK,KAAM0B,GAGrC,OAAOE,KAQT,OALA2J,EAAUH,OAAS,WACjBF,aAAaR,GACbA,EAAU,MAGLa,EAMF,SAASE,GAAKrL,EAAMsL,GACzB,OAAOhC,GAAQgC,EAAStL,GAInB,SAASoD,GAAON,GACrB,OAAO,WACL,OAAQA,EAAUxC,MAAMV,KAAMW,YAM3B,SAASgL,KACd,IAAIjK,EAAOf,UACPiI,EAAQlH,EAAKJ,OAAS,EAC1B,OAAO,WAGL,IAFA,IAAI7E,EAAImM,EACJhH,EAASF,EAAKkH,GAAOlI,MAAMV,KAAMW,WAC9BlE,KAAKmF,EAASF,EAAKjF,GAAGG,KAAKoD,KAAM4B,GACxC,OAAOA,GAKJ,SAASgK,GAAMC,EAAOzL,GAC3B,OAAO,WACL,KAAMyL,EAAQ,EACZ,OAAOzL,EAAKM,MAAMV,KAAMW,YAMvB,SAASmL,GAAOD,EAAOzL,GAC5B,IAAIyC,EACJ,OAAO,WAKL,QAJMgJ,EAAQ,IACZhJ,EAAOzC,EAAKM,MAAMV,KAAMW,YAEtBkL,GAAS,IAAGzL,EAAO,MAChByC,GAMJ,IAAIkJ,GAAOrC,GAAQoC,GAAQ,GAM9BE,IAAc,CAAC7M,SAAU,MAAM8M,qBAAqB,YACpDC,GAAqB,CAAC,UAAW,gBAAiB,WACpD,uBAAwB,iBAAkB,kBAE5C,SAASC,GAAoBpM,EAAKuC,GAChC,IAAI8J,EAAaF,GAAmB5K,OAChC+K,EAActM,EAAIsM,YAClBC,EAAQxL,GAAWuL,IAAgBA,EAAYhO,WAAaU,EAG5DwN,EAAO,cAGX,IAFIzK,EAAK/B,EAAKwM,KAAU5I,EAASrB,EAAOiK,IAAOjK,EAAMrD,KAAKsN,GAEnDH,MACLG,EAAOL,GAAmBE,MACdrM,GAAOA,EAAIwM,KAAUD,EAAMC,KAAU5I,EAASrB,EAAOiK,IAC/DjK,EAAMrD,KAAKsN,GAOV,SAAShN,GAAKQ,GACnB,IAAKgB,GAAShB,GAAM,MAAO,GAC3B,GAAIT,EAAY,OAAOA,EAAWS,GAClC,IAAIuC,EAAQ,GACZ,IAAK,IAAItE,KAAO+B,EAAS+B,EAAK/B,EAAK/B,IAAMsE,EAAMrD,KAAKjB,GAGpD,OADIgO,IAAYG,GAAoBpM,EAAKuC,GAClCA,EAIF,SAASkK,GAAQzM,GACtB,IAAKgB,GAAShB,GAAM,MAAO,GAC3B,IAAIuC,EAAQ,GACZ,IAAK,IAAItE,KAAO+B,EAAKuC,EAAMrD,KAAKjB,GAGhC,OADIgO,IAAYG,GAAoBpM,EAAKuC,GAClCA,EAIF,SAASyB,GAAOhE,GAIrB,IAHA,IAAIuC,EAAQ/C,GAAKQ,GACbuB,EAASgB,EAAMhB,OACfyC,EAASjF,MAAMwC,GACV7E,EAAI,EAAGA,EAAI6E,EAAQ7E,IAC1BsH,EAAOtH,GAAKsD,EAAIuC,EAAM7F,IAExB,OAAOsH,EAKF,SAAS0I,GAAU1M,EAAKkB,EAAUZ,GACvCY,EAAWE,EAAGF,EAAUZ,GAIxB,IAHA,IAAIiC,EAAQ/C,GAAKQ,GACbuB,EAASgB,EAAMhB,OACfkB,EAAU,GACLjC,EAAQ,EAAGA,EAAQe,EAAQf,IAAS,CAC3C,IAAIkC,EAAaH,EAAM/B,GACvBiC,EAAQC,GAAcxB,EAASlB,EAAI0C,GAAaA,EAAY1C,GAE9D,OAAOyC,EAKF,SAASkK,GAAM3M,GAIpB,IAHA,IAAIuC,EAAQ/C,GAAKQ,GACbuB,EAASgB,EAAMhB,OACfoL,EAAQ5N,MAAMwC,GACT7E,EAAI,EAAGA,EAAI6E,EAAQ7E,IAC1BiQ,EAAMjQ,GAAK,CAAC6F,EAAM7F,GAAIsD,EAAIuC,EAAM7F,KAElC,OAAOiQ,EAIF,SAASC,GAAO5M,GAGrB,IAFA,IAAI6B,EAAS,GACTU,EAAQ/C,GAAKQ,GACRtD,EAAI,EAAG6E,EAASgB,EAAMhB,OAAQ7E,EAAI6E,EAAQ7E,IACjDmF,EAAO7B,EAAIuC,EAAM7F,KAAO6F,EAAM7F,GAEhC,OAAOmF,EAIF,SAASgL,GAAU7M,GACxB,IAAI8M,EAAQ,GACZ,IAAK,IAAI7O,KAAO+B,EACVe,GAAWf,EAAI/B,KAAO6O,EAAM5N,KAAKjB,GAEvC,OAAO6O,EAAMxH,OAKf,SAASyH,GAAeC,EAAUC,GAChC,OAAO,SAASjN,GACd,IAAIuB,EAASX,UAAUW,OAEvB,GADI0L,IAAUjN,EAAM5C,OAAO4C,IACvBuB,EAAS,GAAY,MAAPvB,EAAa,OAAOA,EACtC,IAAK,IAAIQ,EAAQ,EAAGA,EAAQe,EAAQf,IAIlC,IAHA,IAAI0M,EAAStM,UAAUJ,GACnB+B,EAAQyK,EAASE,GACjBvQ,EAAI4F,EAAMhB,OACL7E,EAAI,EAAGA,EAAIC,EAAGD,IAAK,CAC1B,IAAIuB,EAAMsE,EAAM7F,GACXuQ,QAAyB,IAAbjN,EAAI/B,KAAiB+B,EAAI/B,GAAOiP,EAAOjP,IAG5D,OAAO+B,GAKJ,IAAImN,GAASJ,GAAeN,IAIxBW,GAAYL,GAAevN,IAI/B,SAAS6D,GAAQrD,EAAKmD,EAAW7C,GACtC6C,EAAY/B,EAAG+B,EAAW7C,GAE1B,IADA,IAAuBrC,EAAnBsE,EAAQ/C,GAAKQ,GACRtD,EAAI,EAAG6E,EAASgB,EAAMhB,OAAQ7E,EAAI6E,EAAQ7E,IAEjD,GAAIyG,EAAUnD,EADd/B,EAAMsE,EAAM7F,IACYuB,EAAK+B,GAAM,OAAO/B,EAK9C,SAASoP,GAAS1P,EAAOM,EAAK+B,GAC5B,OAAO/B,KAAO+B,EAIT,IAAIsN,GAAOjM,GAAc,SAASrB,EAAKuC,GAC5C,IAAIV,EAAS,GAAIX,EAAWqB,EAAM,GAClC,GAAW,MAAPvC,EAAa,OAAO6B,EACpBd,GAAWG,IACTqB,EAAMhB,OAAS,IAAGL,EAAWd,EAAWc,EAAUqB,EAAM,KAC5DA,EAAQkK,GAAQzM,KAEhBkB,EAAWmM,GACX9K,EAAQoE,GAASpE,GAAO,GAAO,GAC/BvC,EAAM5C,OAAO4C,IAEf,IAAK,IAAItD,EAAI,EAAG6E,EAASgB,EAAMhB,OAAQ7E,EAAI6E,EAAQ7E,IAAK,CACtD,IAAIuB,EAAMsE,EAAM7F,GACZiB,EAAQqC,EAAI/B,GACZiD,EAASvD,EAAOM,EAAK+B,KAAM6B,EAAO5D,GAAON,GAE/C,OAAOkE,KAIE0L,GAAOlM,GAAc,SAASrB,EAAKuC,GAC5C,IAAyBjC,EAArBY,EAAWqB,EAAM,GAUrB,OATIxB,GAAWG,IACbA,EAAWuC,GAAOvC,GACdqB,EAAMhB,OAAS,IAAGjB,EAAUiC,EAAM,MAEtCA,EAAQC,EAAImE,GAASpE,GAAO,GAAO,GAAQiL,QAC3CtM,EAAW,SAASvD,EAAOM,GACzB,OAAQ2F,EAASrB,EAAOtE,KAGrBqP,GAAKtN,EAAKkB,EAAUZ,MAIlB2M,GAAWF,GAAeN,IAAS,GAKvC,SAASzO,GAAOM,EAAWmP,GAChC,IAAI5L,EAASD,EAAWtD,GAExB,OADImP,GAAOL,GAAUvL,EAAQ4L,GACtB5L,EAIF,SAASmD,GAAMhF,GACpB,OAAKgB,GAAShB,GACPV,GAAQU,GAAOA,EAAIb,QAAUgO,GAAO,GAAInN,GADpBA,EAOtB,SAAS0N,GAAI1N,EAAK2N,GAEvB,OADAA,EAAY3N,GACLA,EAIF,SAAS4N,GAAQxP,EAAQmG,GAC9B,IAAIhC,EAAQ/C,GAAK+E,GAAQhD,EAASgB,EAAMhB,OACxC,GAAc,MAAVnD,EAAgB,OAAQmD,EAE5B,IADA,IAAIvB,EAAM5C,OAAOgB,GACR1B,EAAI,EAAGA,EAAI6E,EAAQ7E,IAAK,CAC/B,IAAIuB,EAAMsE,EAAM7F,GAChB,GAAI6H,EAAMtG,KAAS+B,EAAI/B,MAAUA,KAAO+B,GAAM,OAAO,EAEvD,OAAO,EAKT,SAAS6N,GAAGpI,EAAGC,EAAGoI,EAAQC,GAGxB,GAAItI,IAAMC,EAAG,OAAa,IAAND,GAAW,EAAIA,GAAM,EAAIC,EAE7C,GAAS,MAALD,GAAkB,MAALC,EAAW,OAAO,EAEnC,GAAID,GAAMA,EAAG,OAAOC,GAAMA,EAE1B,IAAIsI,SAAcvI,EAClB,OAAa,aAATuI,GAAgC,WAATA,GAAiC,iBAALtI,IAKzD,SAAgBD,EAAGC,EAAGoI,EAAQC,GAExBtI,aAAa1F,IAAG0F,EAAIA,EAAEvF,UACtBwF,aAAa3F,IAAG2F,EAAIA,EAAExF,UAE1B,IAAI+N,EAAY7O,EAASvC,KAAK4I,GAC9B,GAAIwI,IAAc7O,EAASvC,KAAK6I,GAAI,OAAO,EAC3C,OAAQuI,GAEN,IAAK,kBAEL,IAAK,kBAGH,MAAO,GAAKxI,GAAM,GAAKC,EACzB,IAAK,kBAGH,OAAKD,IAAOA,GAAWC,IAAOA,EAEhB,IAAND,EAAU,GAAKA,GAAM,EAAIC,GAAKD,IAAOC,EAC/C,IAAK,gBACL,IAAK,mBAIH,OAAQD,IAAOC,EACjB,IAAK,kBACH,OAAOzG,EAAYiP,QAAQrR,KAAK4I,KAAOxG,EAAYiP,QAAQrR,KAAK6I,GAGpE,IAAIyI,EAA0B,mBAAdF,EAChB,IAAKE,EAAW,CACd,GAAgB,iBAAL1I,GAA6B,iBAALC,EAAe,OAAO,EAIzD,IAAI0I,EAAQ3I,EAAE6G,YAAa+B,EAAQ3I,EAAE4G,YACrC,GAAI8B,IAAUC,KAAWtN,GAAWqN,IAAUA,aAAiBA,GACtCrN,GAAWsN,IAAUA,aAAiBA,IACvC,gBAAiB5I,GAAK,gBAAiBC,EAC7D,OAAO,EASXqI,EAASA,GAAU,GACnB,IAAIxM,GAFJuM,EAASA,GAAU,IAECvM,OACpB,KAAOA,KAGL,GAAIuM,EAAOvM,KAAYkE,EAAG,OAAOsI,EAAOxM,KAAYmE,EAQtD,GAJAoI,EAAO5O,KAAKuG,GACZsI,EAAO7O,KAAKwG,GAGRyI,EAAW,CAGb,IADA5M,EAASkE,EAAElE,UACImE,EAAEnE,OAAQ,OAAO,EAEhC,KAAOA,KACL,IAAKsM,GAAGpI,EAAElE,GAASmE,EAAEnE,GAASuM,EAAQC,GAAS,OAAO,MAEnD,CAEL,IAAqB9P,EAAjBsE,EAAQ/C,GAAKiG,GAGjB,GAFAlE,EAASgB,EAAMhB,OAEX/B,GAAKkG,GAAGnE,SAAWA,EAAQ,OAAO,EACtC,KAAOA,KAGL,GADAtD,EAAMsE,EAAMhB,IACNQ,EAAK2D,EAAGzH,KAAQ4P,GAAGpI,EAAExH,GAAMyH,EAAEzH,GAAM6P,EAAQC,GAAU,OAAO,EAMtE,OAFAD,EAAOQ,MACPP,EAAOO,OACA,EA1FAC,CAAO9I,EAAGC,EAAGoI,EAAQC,GA8FvB,SAASS,GAAQ/I,EAAGC,GACzB,OAAOmI,GAAGpI,EAAGC,GAKR,SAAS+I,GAAQzO,GACtB,OAAW,MAAPA,IACAqC,EAAYrC,KAASV,GAAQU,IAAQmG,GAASnG,IAAQiH,GAAYjH,IAA6B,IAAfA,EAAIuB,OAC5D,IAArB/B,GAAKQ,GAAKuB,QAIZ,SAASmN,GAAU1O,GACxB,SAAUA,GAAwB,IAAjBA,EAAI2O,UAIvB,SAASC,GAAU3R,GACjB,OAAO,SAAS+C,GACd,OAAOZ,EAASvC,KAAKmD,KAAS,WAAa/C,EAAO,KAM/C,IAAIqC,GAAUD,GAAiBuP,GAAU,SAGzC,SAAS5N,GAAShB,GACvB,IAAIgO,SAAchO,EAClB,MAAgB,aAATgO,GAAgC,WAATA,KAAuBhO,EAIhD,IAAIiH,GAAc2H,GAAU,aACxB7N,GAAa6N,GAAU,YACvBzI,GAAWyI,GAAU,UACrBC,GAAWD,GAAU,UACrBE,GAASF,GAAU,QACnBG,GAAWH,GAAU,UACrBI,GAAUJ,GAAU,SACpBK,GAAWL,GAAU,UACrBM,GAAQN,GAAU,OAClBO,GAAYP,GAAU,WACtBQ,GAAQR,GAAU,OAClBS,GAAYT,GAAU,YAIhC,WACM3H,GAAYrG,aACfqG,GAAc,SAASjH,GACrB,OAAO+B,EAAK/B,EAAK,YAHvB,GAUA,IAAIsP,GAAW5Q,EAAK6Q,UAAY7Q,EAAK6Q,SAASC,WAQvC,SAAS3P,GAASG,GACvB,OAAQiP,GAASjP,IAAQJ,EAAUI,KAASN,EAAO+P,WAAWzP,IAIzD,SAASL,GAAMK,GACpB,OAAO6O,GAAS7O,IAAQN,EAAOM,GAI1B,SAAS0H,GAAU1H,GACxB,OAAe,IAARA,IAAwB,IAARA,GAAwC,qBAAvBZ,EAASvC,KAAKmD,GAIjD,SAAS0P,GAAO1P,GACrB,OAAe,OAARA,EAIF,SAAS2P,GAAY3P,GAC1B,YAAe,IAARA,EAKF,SAAS4P,GAAI5P,EAAKgC,GACvB,IAAK1C,GAAQ0C,GACX,OAAOD,EAAK/B,EAAKgC,GAGnB,IADA,IAAIT,EAASS,EAAKT,OACT7E,EAAI,EAAGA,EAAI6E,EAAQ7E,IAAK,CAC/B,IAAIuB,EAAM+D,EAAKtF,GACf,GAAW,MAAPsD,IAAgBzB,EAAe1B,KAAKmD,EAAK/B,GAC3C,OAAO,EAET+B,EAAMA,EAAI/B,GAEZ,QAASsD,EAOJ,SAAST,GAASnD,GACvB,OAAOA,EAIF,SAASkS,GAASlS,GACvB,OAAO,WACL,OAAOA,GAIJ,SAASmS,MAIT,SAASzR,GAAS2D,GACvB,OAAK1C,GAAQ0C,GAGN,SAAShC,GACd,OAAOiC,EAAQjC,EAAKgC,IAHbF,EAAgBE,GAQpB,SAAS+N,GAAW/P,GACzB,OAAW,MAAPA,EACK,aAEF,SAASgC,GACd,OAAQ1C,GAAQ0C,GAAoBC,EAAQjC,EAAKgC,GAAzBhC,EAAIgC,IAMzB,SAASf,GAAQsD,GAEtB,OADAA,EAAQ6I,GAAU,GAAI7I,GACf,SAASvE,GACd,OAAO4N,GAAQ5N,EAAKuE,IAMjB,SAASuH,GAAM3N,EAAG+C,EAAUZ,GACjC,IAAI0P,EAAQjR,MAAMyC,KAAKC,IAAI,EAAGtD,IAC9B+C,EAAWd,EAAWc,EAAUZ,EAAS,GACzC,IAAK,IAAI5D,EAAI,EAAGA,EAAIyB,EAAGzB,IAAKsT,EAAMtT,GAAKwE,EAASxE,GAChD,OAAOsT,EAIF,SAASjL,GAAOH,EAAKnD,GAK1B,OAJW,MAAPA,IACFA,EAAMmD,EACNA,EAAM,GAEDA,EAAMpD,KAAKgH,MAAMhH,KAAKuD,UAAYtD,EAAMmD,EAAM,IA9GH,iBAAbqL,WAA4C,mBAAZX,KACrEvO,GAAa,SAASf,GACpB,MAAqB,mBAAPA,IAAqB,IAgHhC,IAAI+K,GAAMmF,KAAKnF,KAAO,WAC3B,OAAO,IAAImF,MAAOC,WAIhBC,GAAY,CACd,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,UAEHC,GAAczD,GAAOwD,IAGzB,SAASE,GAAc9N,GACrB,IAAI+N,EAAU,SAASnK,GACrB,OAAO5D,EAAI4D,IAGT8G,EAAS,MAAQ1N,GAAKgD,GAAKgO,KAAK,KAAO,IACvCC,EAAaC,OAAOxD,GACpByD,EAAgBD,OAAOxD,EAAQ,KACnC,OAAO,SAAS0D,GAEd,OADAA,EAAmB,MAAVA,EAAiB,GAAK,GAAKA,EAC7BH,EAAWI,KAAKD,GAAUA,EAAOE,QAAQH,EAAeJ,GAAWK,GAGvE,IAAIG,GAAST,GAAcF,IACvBY,GAAWV,GAAcD,IAK7B,SAASxO,GAAO7B,EAAKgC,EAAMiP,GAC3B3R,GAAQ0C,KAAOA,EAAO,CAACA,IAC5B,IAAIT,EAASS,EAAKT,OAClB,IAAKA,EACH,OAAOR,GAAWkQ,GAAYA,EAASpU,KAAKmD,GAAOiR,EAErD,IAAK,IAAIvU,EAAI,EAAGA,EAAI6E,EAAQ7E,IAAK,CAC/B,IAAI8P,EAAc,MAAPxM,OAAc,EAASA,EAAIgC,EAAKtF,SAC9B,IAAT8P,IACFA,EAAOyE,EACPvU,EAAI6E,GAENvB,EAAMe,GAAWyL,GAAQA,EAAK3P,KAAKmD,GAAOwM,EAE5C,OAAOxM,EAKT,IAAIkR,GAAY,EACT,SAASC,GAASC,GACvB,IAAIC,IAAOH,GAAY,GACvB,OAAOE,EAASA,EAASC,EAAKA,EAKzB,IAAIC,GAAmBvR,EAAEuR,iBAAmB,CACjDC,SAAU,kBACVC,YAAa,mBACbT,OAAQ,oBAMNU,GAAU,OAIVC,GAAU,CACZ,IAAK,IACL,KAAM,KACN,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAGRC,GAAe,4BAEfC,GAAa,SAASxL,GACxB,MAAO,KAAOsL,GAAQtL,IAOjB,SAASyL,GAASC,EAAMC,EAAUC,IAClCD,GAAYC,IAAaD,EAAWC,GACzCD,EAAW9E,GAAS,GAAI8E,EAAUhS,EAAEuR,kBAGpC,IAiCIW,EAjCAhR,EAAUyP,OAAO,EAClBqB,EAAShB,QAAUU,IAASvE,QAC5B6E,EAASP,aAAeC,IAASvE,QACjC6E,EAASR,UAAYE,IAASvE,QAC/BsD,KAAK,KAAO,KAAM,KAGhBhQ,EAAQ,EACR0M,EAAS,SACb4E,EAAKhB,QAAQ7P,GAAS,SAASmF,EAAO2K,EAAQS,EAAaD,EAAUW,GAanE,OAZAhF,GAAU4E,EAAK3S,MAAMqB,EAAO0R,GAAQpB,QAAQa,GAAcC,IAC1DpR,EAAQ0R,EAAS9L,EAAM7E,OAEnBwP,EACF7D,GAAU,cAAgB6D,EAAS,iCAC1BS,EACTtE,GAAU,cAAgBsE,EAAc,uBAC/BD,IACTrE,GAAU,OAASqE,EAAW,YAIzBnL,KAET8G,GAAU,OAGL6E,EAASI,WAAUjF,EAAS,mBAAqBA,EAAS,OAE/DA,EAAS,4FAEPA,EAAS,gBAGX,IACE+E,EAAS,IAAIpT,SAASkT,EAASI,UAAY,MAAO,IAAKjF,GACvD,MAAOkF,GAEP,MADAA,EAAElF,OAASA,EACLkF,EAGR,IAAIP,EAAW,SAASQ,GACtB,OAAOJ,EAAOpV,KAAKoD,KAAMoS,EAAMtS,IAI7BuS,EAAWP,EAASI,UAAY,MAGpC,OAFAN,EAAS3E,OAAS,YAAcoF,EAAW,OAASpF,EAAS,IAEtD2E,EAIF,SAASU,GAAMvS,GACpB,IAAIwS,EAAWzS,EAAEC,GAEjB,OADAwS,EAASC,QAAS,EACXD,EAUT,SAASE,GAAYF,EAAUxS,GAC7B,OAAOwS,EAASC,OAAS1S,EAAEC,GAAKuS,QAAUvS,EAIrC,SAAS2S,GAAM3S,GASpB,OARAsC,EAAKuK,GAAU7M,IAAM,SAAS/C,GAC5B,IAAIoD,EAAON,EAAE9C,GAAQ+C,EAAI/C,GACzB8C,EAAEzB,UAAUrB,GAAQ,WAClB,IAAI0E,EAAO,CAAC1B,KAAKC,UAEjB,OADAhB,EAAKyB,MAAMgB,EAAMf,WACV8R,GAAYzS,KAAMI,EAAKM,MAAMZ,EAAG4B,QAGpC5B,EAITuC,EAAK,CAAC,MAAO,OAAQ,UAAW,QAAS,OAAQ,SAAU,YAAY,SAASrF,GAC9E,IAAImH,EAAStF,EAAW7B,GACxB8C,EAAEzB,UAAUrB,GAAQ,WAClB,IAAI+C,EAAMC,KAAKC,SAGf,OAFAkE,EAAOzD,MAAMX,EAAKY,WACJ,UAAT3D,GAA6B,WAATA,GAAqC,IAAf+C,EAAIuB,eAAqBvB,EAAI,GACrE0S,GAAYzS,KAAMD,OAK7BsC,EAAK,CAAC,SAAU,OAAQ,UAAU,SAASrF,GACzC,IAAImH,EAAStF,EAAW7B,GACxB8C,EAAEzB,UAAUrB,GAAQ,WAClB,OAAOyV,GAAYzS,KAAMmE,EAAOzD,MAAMV,KAAKC,SAAUU,gBAKzDb,EAAEzB,UAAUX,MAAQ,WAClB,OAAOsC,KAAKC,UAKdH,EAAEzB,UAAU4P,QAAUnO,EAAEzB,UAAUsU,OAAS7S,EAAEzB,UAAUX,MAEvDoC,EAAEzB,UAAUc,SAAW,WACrB,OAAOoO,OAAOvN,KAAKC,Y,mCC5oDrB,IAAI2S,EAGJA,EAAI,WACH,OAAO5S,KADJ,GAIJ,IAEC4S,EAAIA,GAAK,IAAIhU,SAAS,cAAb,GACR,MAAOuT,GAEc,iBAAXU,SAAqBD,EAAIC,QAOrCrW,EAAOD,QAAUqW,G,8+MCfb9S,EAAI,gBAAM,GAEdA,EAAEA,EAAIA,EAES,S,qBCRf,aAWA,SAAUgT,GAUT,IAAMC,EAAW,SAASX,GACzB,IAAM1T,EAAOsB,KACbF,EAAEuC,KAAK+P,GAAM,SAAS1U,EAAOM,GACvB8B,EAAEgB,WAAWpD,KACjBgB,EAAKV,GAAON,MAIToC,EAAE4P,YAAY1P,KAAKoR,MACvBpR,KAAKoR,GAAK4B,SAASZ,EAAKhB,GAAI,KAI7BpR,KAAK+B,KAAOqQ,EAAKrQ,MAAQ,GAEP,QAAd/B,KAAK+N,KACR/N,KAAKiT,SAAW,uBAEhBjT,KAAKiT,SAAWjT,KAAKiT,UAAY,2BAG7BjT,KAAK+N,OACa,yBAAlB/N,KAAKiT,SACRjT,KAAK+N,KAAO,MAEZ/N,KAAK+N,KAAO,SAQfgF,EAAS1U,UAAY,CAMpB+S,GAAI,KAOJpU,KAAM,KAQN+E,KAAM,KAONkR,SAAU,KASVC,KAAM,KAQNnF,KAAM,KAQNoF,YAAa,KAObC,MAAO,KAOPC,KAAM,KASNC,UAAW,KAKXC,YAAY,EAKZC,iBAAkB,MAGdV,EAAGW,QACPX,EAAGW,MAAQ,IAEZX,EAAGW,MAAMV,SAAWA,EAvIrB,CAwIGD,M","file":"files_fileinfo.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 = 960);\n","//     Underscore.js 1.10.2\n//     https://underscorejs.org\n//     (c) 2009-2020 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n//     Underscore may be freely distributed under the MIT license.\n\n// Baseline setup\n// --------------\n\n// Establish the root object, `window` (`self`) in the browser, `global`\n// on the server, or `this` in some virtual machines. We use `self`\n// instead of `window` for `WebWorker` support.\nvar root = typeof self == 'object' && self.self === self && self ||\n          typeof global == 'object' && global.global === global && global ||\n          Function('return this')() ||\n          {};\n\n// Save bytes in the minified (but not gzipped) version:\nvar ArrayProto = Array.prototype, ObjProto = Object.prototype;\nvar SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;\n\n// Create quick reference variables for speed access to core prototypes.\nvar push = ArrayProto.push,\n    slice = ArrayProto.slice,\n    toString = ObjProto.toString,\n    hasOwnProperty = ObjProto.hasOwnProperty;\n\n// All **ECMAScript 5** native function implementations that we hope to use\n// are declared here.\nvar nativeIsArray = Array.isArray,\n    nativeKeys = Object.keys,\n    nativeCreate = Object.create;\n\n// Create references to these builtin functions because we override them.\nvar _isNaN = root.isNaN,\n    _isFinite = root.isFinite;\n\n// Naked function reference for surrogate-prototype-swapping.\nvar Ctor = function(){};\n\n// The Underscore object. All exported functions below are added to it in the\n// modules/index-all.js using the mixin function.\nexport default function _(obj) {\n  if (obj instanceof _) return obj;\n  if (!(this instanceof _)) return new _(obj);\n  this._wrapped = obj;\n}\n\n// Current version.\nexport var VERSION = _.VERSION = '1.10.2';\n\n// Internal function that returns an efficient (for current engines) version\n// of the passed-in callback, to be repeatedly applied in other Underscore\n// functions.\nfunction optimizeCb(func, context, argCount) {\n  if (context === void 0) return func;\n  switch (argCount == null ? 3 : argCount) {\n    case 1: return function(value) {\n      return func.call(context, value);\n    };\n    // The 2-argument case is omitted because we’re not using it.\n    case 3: return function(value, index, collection) {\n      return func.call(context, value, index, collection);\n    };\n    case 4: return function(accumulator, value, index, collection) {\n      return func.call(context, accumulator, value, index, collection);\n    };\n  }\n  return function() {\n    return func.apply(context, arguments);\n  };\n}\n\n// An internal function to generate callbacks that can be applied to each\n// element in a collection, returning the desired result — either `identity`,\n// an arbitrary callback, a property matcher, or a property accessor.\nfunction baseIteratee(value, context, argCount) {\n  if (value == null) return identity;\n  if (isFunction(value)) return optimizeCb(value, context, argCount);\n  if (isObject(value) && !isArray(value)) return matcher(value);\n  return property(value);\n}\n\n// External wrapper for our callback generator. Users may customize\n// `_.iteratee` if they want additional predicate/iteratee shorthand styles.\n// This abstraction hides the internal-only argCount argument.\n_.iteratee = iteratee;\nexport function iteratee(value, context) {\n  return baseIteratee(value, context, Infinity);\n}\n\n// The function we actually call internally. It invokes _.iteratee if\n// overridden, otherwise baseIteratee.\nfunction cb(value, context, argCount) {\n  if (_.iteratee !== iteratee) return _.iteratee(value, context);\n  return baseIteratee(value, context, argCount);\n}\n\n// Some functions take a variable number of arguments, or a few expected\n// arguments at the beginning and then a variable number of values to operate\n// on. This helper accumulates all remaining arguments past the function’s\n// argument length (or an explicit `startIndex`), into an array that becomes\n// the last argument. Similar to ES6’s \"rest parameter\".\nexport function restArguments(func, startIndex) {\n  startIndex = startIndex == null ? func.length - 1 : +startIndex;\n  return function() {\n    var length = Math.max(arguments.length - startIndex, 0),\n        rest = Array(length),\n        index = 0;\n    for (; index < length; index++) {\n      rest[index] = arguments[index + startIndex];\n    }\n    switch (startIndex) {\n      case 0: return func.call(this, rest);\n      case 1: return func.call(this, arguments[0], rest);\n      case 2: return func.call(this, arguments[0], arguments[1], rest);\n    }\n    var args = Array(startIndex + 1);\n    for (index = 0; index < startIndex; index++) {\n      args[index] = arguments[index];\n    }\n    args[startIndex] = rest;\n    return func.apply(this, args);\n  };\n}\n\n// An internal function for creating a new object that inherits from another.\nfunction baseCreate(prototype) {\n  if (!isObject(prototype)) return {};\n  if (nativeCreate) return nativeCreate(prototype);\n  Ctor.prototype = prototype;\n  var result = new Ctor;\n  Ctor.prototype = null;\n  return result;\n}\n\nfunction shallowProperty(key) {\n  return function(obj) {\n    return obj == null ? void 0 : obj[key];\n  };\n}\n\nfunction _has(obj, path) {\n  return obj != null && hasOwnProperty.call(obj, path);\n}\n\nfunction deepGet(obj, path) {\n  var length = path.length;\n  for (var i = 0; i < length; i++) {\n    if (obj == null) return void 0;\n    obj = obj[path[i]];\n  }\n  return length ? obj : void 0;\n}\n\n// Helper for collection methods to determine whether a collection\n// should be iterated as an array or as an object.\n// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\nvar MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\nvar getLength = shallowProperty('length');\nfunction isArrayLike(collection) {\n  var length = getLength(collection);\n  return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;\n}\n\n// Collection Functions\n// --------------------\n\n// The cornerstone, an `each` implementation, aka `forEach`.\n// Handles raw objects in addition to array-likes. Treats all\n// sparse array-likes as if they were dense.\nexport function each(obj, iteratee, context) {\n  iteratee = optimizeCb(iteratee, context);\n  var i, length;\n  if (isArrayLike(obj)) {\n    for (i = 0, length = obj.length; i < length; i++) {\n      iteratee(obj[i], i, obj);\n    }\n  } else {\n    var _keys = keys(obj);\n    for (i = 0, length = _keys.length; i < length; i++) {\n      iteratee(obj[_keys[i]], _keys[i], obj);\n    }\n  }\n  return obj;\n}\nexport { each as forEach };\n\n// Return the results of applying the iteratee to each element.\nexport function map(obj, iteratee, context) {\n  iteratee = cb(iteratee, context);\n  var _keys = !isArrayLike(obj) && keys(obj),\n      length = (_keys || obj).length,\n      results = Array(length);\n  for (var index = 0; index < length; index++) {\n    var currentKey = _keys ? _keys[index] : index;\n    results[index] = iteratee(obj[currentKey], currentKey, obj);\n  }\n  return results;\n}\nexport { map as collect };\n\n// Create a reducing function iterating left or right.\nfunction createReduce(dir) {\n  // Wrap code that reassigns argument variables in a separate function than\n  // the one that accesses `arguments.length` to avoid a perf hit. (#1991)\n  var reducer = function(obj, iteratee, memo, initial) {\n    var _keys = !isArrayLike(obj) && keys(obj),\n        length = (_keys || obj).length,\n        index = dir > 0 ? 0 : length - 1;\n    if (!initial) {\n      memo = obj[_keys ? _keys[index] : index];\n      index += dir;\n    }\n    for (; index >= 0 && index < length; index += dir) {\n      var currentKey = _keys ? _keys[index] : index;\n      memo = iteratee(memo, obj[currentKey], currentKey, obj);\n    }\n    return memo;\n  };\n\n  return function(obj, iteratee, memo, context) {\n    var initial = arguments.length >= 3;\n    return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);\n  };\n}\n\n// **Reduce** builds up a single result from a list of values, aka `inject`,\n// or `foldl`.\nexport var reduce = createReduce(1);\nexport { reduce as foldl, reduce as inject };\n\n// The right-associative version of reduce, also known as `foldr`.\nexport var reduceRight = createReduce(-1);\nexport { reduceRight as foldr };\n\n// Return the first value which passes a truth test.\nexport function find(obj, predicate, context) {\n  var keyFinder = isArrayLike(obj) ? findIndex : findKey;\n  var key = keyFinder(obj, predicate, context);\n  if (key !== void 0 && key !== -1) return obj[key];\n}\nexport { find as detect };\n\n// Return all the elements that pass a truth test.\nexport function filter(obj, predicate, context) {\n  var results = [];\n  predicate = cb(predicate, context);\n  each(obj, function(value, index, list) {\n    if (predicate(value, index, list)) results.push(value);\n  });\n  return results;\n}\nexport { filter as select };\n\n// Return all the elements for which a truth test fails.\nexport function reject(obj, predicate, context) {\n  return filter(obj, negate(cb(predicate)), context);\n}\n\n// Determine whether all of the elements match a truth test.\nexport function every(obj, predicate, context) {\n  predicate = cb(predicate, context);\n  var _keys = !isArrayLike(obj) && keys(obj),\n      length = (_keys || obj).length;\n  for (var index = 0; index < length; index++) {\n    var currentKey = _keys ? _keys[index] : index;\n    if (!predicate(obj[currentKey], currentKey, obj)) return false;\n  }\n  return true;\n}\nexport { every as all };\n\n// Determine if at least one element in the object matches a truth test.\nexport function some(obj, predicate, context) {\n  predicate = cb(predicate, context);\n  var _keys = !isArrayLike(obj) && keys(obj),\n      length = (_keys || obj).length;\n  for (var index = 0; index < length; index++) {\n    var currentKey = _keys ? _keys[index] : index;\n    if (predicate(obj[currentKey], currentKey, obj)) return true;\n  }\n  return false;\n}\nexport { some as any };\n\n// Determine if the array or object contains a given item (using `===`).\nexport function contains(obj, item, fromIndex, guard) {\n  if (!isArrayLike(obj)) obj = values(obj);\n  if (typeof fromIndex != 'number' || guard) fromIndex = 0;\n  return indexOf(obj, item, fromIndex) >= 0;\n}\nexport { contains as includes, contains as include };\n\n// Invoke a method (with arguments) on every item in a collection.\nexport var invoke = restArguments(function(obj, path, args) {\n  var contextPath, func;\n  if (isFunction(path)) {\n    func = path;\n  } else if (isArray(path)) {\n    contextPath = path.slice(0, -1);\n    path = path[path.length - 1];\n  }\n  return map(obj, function(context) {\n    var method = func;\n    if (!method) {\n      if (contextPath && contextPath.length) {\n        context = deepGet(context, contextPath);\n      }\n      if (context == null) return void 0;\n      method = context[path];\n    }\n    return method == null ? method : method.apply(context, args);\n  });\n});\n\n// Convenience version of a common use case of `map`: fetching a property.\nexport function pluck(obj, key) {\n  return map(obj, property(key));\n}\n\n// Convenience version of a common use case of `filter`: selecting only objects\n// containing specific `key:value` pairs.\nexport function where(obj, attrs) {\n  return filter(obj, matcher(attrs));\n}\n\n// Convenience version of a common use case of `find`: getting the first object\n// containing specific `key:value` pairs.\nexport function findWhere(obj, attrs) {\n  return find(obj, matcher(attrs));\n}\n\n// Return the maximum element (or element-based computation).\nexport function max(obj, iteratee, context) {\n  var result = -Infinity, lastComputed = -Infinity,\n      value, computed;\n  if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {\n    obj = isArrayLike(obj) ? obj : values(obj);\n    for (var i = 0, length = obj.length; i < length; i++) {\n      value = obj[i];\n      if (value != null && value > result) {\n        result = value;\n      }\n    }\n  } else {\n    iteratee = cb(iteratee, context);\n    each(obj, function(v, index, list) {\n      computed = iteratee(v, index, list);\n      if (computed > lastComputed || computed === -Infinity && result === -Infinity) {\n        result = v;\n        lastComputed = computed;\n      }\n    });\n  }\n  return result;\n}\n\n// Return the minimum element (or element-based computation).\nexport function min(obj, iteratee, context) {\n  var result = Infinity, lastComputed = Infinity,\n      value, computed;\n  if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {\n    obj = isArrayLike(obj) ? obj : values(obj);\n    for (var i = 0, length = obj.length; i < length; i++) {\n      value = obj[i];\n      if (value != null && value < result) {\n        result = value;\n      }\n    }\n  } else {\n    iteratee = cb(iteratee, context);\n    each(obj, function(v, index, list) {\n      computed = iteratee(v, index, list);\n      if (computed < lastComputed || computed === Infinity && result === Infinity) {\n        result = v;\n        lastComputed = computed;\n      }\n    });\n  }\n  return result;\n}\n\n// Shuffle a collection.\nexport function shuffle(obj) {\n  return sample(obj, Infinity);\n}\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `map`.\nexport function sample(obj, n, guard) {\n  if (n == null || guard) {\n    if (!isArrayLike(obj)) obj = values(obj);\n    return obj[random(obj.length - 1)];\n  }\n  var sample = isArrayLike(obj) ? clone(obj) : values(obj);\n  var length = getLength(sample);\n  n = Math.max(Math.min(n, length), 0);\n  var last = length - 1;\n  for (var index = 0; index < n; index++) {\n    var rand = random(index, last);\n    var temp = sample[index];\n    sample[index] = sample[rand];\n    sample[rand] = temp;\n  }\n  return sample.slice(0, n);\n}\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport function sortBy(obj, iteratee, context) {\n  var index = 0;\n  iteratee = cb(iteratee, context);\n  return pluck(map(obj, function(value, key, list) {\n    return {\n      value: value,\n      index: index++,\n      criteria: iteratee(value, key, list)\n    };\n  }).sort(function(left, right) {\n    var a = left.criteria;\n    var b = right.criteria;\n    if (a !== b) {\n      if (a > b || a === void 0) return 1;\n      if (a < b || b === void 0) return -1;\n    }\n    return left.index - right.index;\n  }), 'value');\n}\n\n// An internal function used for aggregate \"group by\" operations.\nfunction group(behavior, partition) {\n  return function(obj, iteratee, context) {\n    var result = partition ? [[], []] : {};\n    iteratee = cb(iteratee, context);\n    each(obj, function(value, index) {\n      var key = iteratee(value, index, obj);\n      behavior(result, value, key);\n    });\n    return result;\n  };\n}\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport var groupBy = group(function(result, value, key) {\n  if (_has(result, key)) result[key].push(value); else result[key] = [value];\n});\n\n// Indexes the object's values by a criterion, similar to `groupBy`, but for\n// when you know that your index values will be unique.\nexport var indexBy = group(function(result, value, key) {\n  result[key] = value;\n});\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport var countBy = group(function(result, value, key) {\n  if (_has(result, key)) result[key]++; else result[key] = 1;\n});\n\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\n// Safely create a real, live array from anything iterable.\nexport function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n\n// Return the number of elements in an object.\nexport function size(obj) {\n  if (obj == null) return 0;\n  return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n\n// Split a collection into two arrays: one whose elements all satisfy the given\n// predicate, and one whose elements all do not satisfy the predicate.\nexport var partition = group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n\n// Array Functions\n// ---------------\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `map`.\nexport function first(array, n, guard) {\n  if (array == null || array.length < 1) return n == null ? void 0 : [];\n  if (n == null || guard) return array[0];\n  return initial(array, array.length - n);\n}\nexport { first as head, first as take };\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport function initial(array, n, guard) {\n  return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport function last(array, n, guard) {\n  if (array == null || array.length < 1) return n == null ? void 0 : [];\n  if (n == null || guard) return array[array.length - 1];\n  return rest(array, Math.max(0, array.length - n));\n}\n\n// Returns everything but the first entry of the array. Especially useful on\n// the arguments object. Passing an **n** will return the rest N values in the\n// array.\nexport function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\nexport { rest as tail, rest as drop };\n\n// Trim out all falsy values from an array.\nexport function compact(array) {\n  return filter(array, Boolean);\n}\n\n// Internal implementation of a recursive `flatten` function.\nfunction _flatten(input, shallow, strict, output) {\n  output = output || [];\n  var idx = output.length;\n  for (var i = 0, length = getLength(input); i < length; i++) {\n    var value = input[i];\n    if (isArrayLike(value) && (isArray(value) || isArguments(value))) {\n      // Flatten current level of array or arguments object.\n      if (shallow) {\n        var j = 0, len = value.length;\n        while (j < len) output[idx++] = value[j++];\n      } else {\n        _flatten(value, shallow, strict, output);\n        idx = output.length;\n      }\n    } else if (!strict) {\n      output[idx++] = value;\n    }\n  }\n  return output;\n}\n\n// Flatten out an array, either recursively (by default), or just one level.\nexport function flatten(array, shallow) {\n  return _flatten(array, shallow, false);\n}\n\n// Return a version of the array that does not contain the specified value(s).\nexport var without = restArguments(function(array, otherArrays) {\n  return difference(array, otherArrays);\n});\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport function uniq(array, isSorted, iteratee, context) {\n  if (!isBoolean(isSorted)) {\n    context = iteratee;\n    iteratee = isSorted;\n    isSorted = false;\n  }\n  if (iteratee != null) iteratee = cb(iteratee, context);\n  var result = [];\n  var seen = [];\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var value = array[i],\n        computed = iteratee ? iteratee(value, i, array) : value;\n    if (isSorted && !iteratee) {\n      if (!i || seen !== computed) result.push(value);\n      seen = computed;\n    } else if (iteratee) {\n      if (!contains(seen, computed)) {\n        seen.push(computed);\n        result.push(value);\n      }\n    } else if (!contains(result, value)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\nexport { uniq as unique };\n\n// Produce an array that contains the union: each distinct element from all of\n// the passed-in arrays.\nexport var union = restArguments(function(arrays) {\n  return uniq(_flatten(arrays, true, true));\n});\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n\n// Take the difference between one array and a number of other arrays.\n// Only the elements present in just the first array will remain.\nexport var difference = restArguments(function(array, rest) {\n  rest = _flatten(rest, true, true);\n  return filter(array, function(value){\n    return !contains(rest, value);\n  });\n});\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport function unzip(array) {\n  var length = array && max(array, getLength).length || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n\n// Zip together multiple lists into a single array -- elements that share\n// an index go together.\nexport var zip = restArguments(unzip);\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of pairs.\nexport function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n\n// Generator function to create the findIndex and findLastIndex functions.\nfunction createPredicateIndexFinder(dir) {\n  return function(array, predicate, context) {\n    predicate = cb(predicate, context);\n    var length = getLength(array);\n    var index = dir > 0 ? 0 : length - 1;\n    for (; index >= 0 && index < length; index += dir) {\n      if (predicate(array[index], index, array)) return index;\n    }\n    return -1;\n  };\n}\n\n// Returns the first index on an array-like that passes a predicate test.\nexport var findIndex = createPredicateIndexFinder(1);\nexport var findLastIndex = createPredicateIndexFinder(-1);\n\n// Use a comparator function to figure out the smallest index at which\n// an object should be inserted so as to maintain order. Uses binary search.\nexport function sortedIndex(array, obj, iteratee, context) {\n  iteratee = cb(iteratee, context, 1);\n  var value = iteratee(obj);\n  var low = 0, high = getLength(array);\n  while (low < high) {\n    var mid = Math.floor((low + high) / 2);\n    if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;\n  }\n  return low;\n}\n\n// Generator function to create the indexOf and lastIndexOf functions.\nfunction createIndexFinder(dir, predicateFind, sortedIndex) {\n  return function(array, item, idx) {\n    var i = 0, length = getLength(array);\n    if (typeof idx == 'number') {\n      if (dir > 0) {\n        i = idx >= 0 ? idx : Math.max(idx + length, i);\n      } else {\n        length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n      }\n    } else if (sortedIndex && idx && length) {\n      idx = sortedIndex(array, item);\n      return array[idx] === item ? idx : -1;\n    }\n    if (item !== item) {\n      idx = predicateFind(slice.call(array, i, length), isNaN);\n      return idx >= 0 ? idx + i : -1;\n    }\n    for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n      if (array[idx] === item) return idx;\n    }\n    return -1;\n  };\n}\n\n// Return the position of the first occurrence of an item in an array,\n// or -1 if the item is not included in the array.\n// If the array is large and already in sort order, pass `true`\n// for **isSorted** to use binary search.\nexport var indexOf = createIndexFinder(1, findIndex, sortedIndex);\nexport var lastIndexOf = createIndexFinder(-1, findLastIndex);\n\n// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n\n// Function (ahem) Functions\n// ------------------\n\n// Determines whether to execute a function as a constructor\n// or a normal function with the provided arguments.\nfunction executeBound(sourceFunc, boundFunc, context, callingContext, args) {\n  if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n  var self = baseCreate(sourceFunc.prototype);\n  var result = sourceFunc.apply(self, args);\n  if (isObject(result)) return result;\n  return self;\n}\n\n// Create a function bound to a given object (assigning `this`, and arguments,\n// optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if\n// available.\nexport var bind = restArguments(function(func, context, args) {\n  if (!isFunction(func)) throw new TypeError('Bind must be called on a function');\n  var bound = restArguments(function(callArgs) {\n    return executeBound(func, bound, context, this, args.concat(callArgs));\n  });\n  return bound;\n});\n\n// Partially apply a function by creating a version that has had some of its\n// arguments pre-filled, without changing its dynamic `this` context. _ acts\n// as a placeholder by default, allowing any combination of arguments to be\n// pre-filled. Set `partial.placeholder` for a custom placeholder argument.\nexport var partial = restArguments(function(func, boundArgs) {\n  var placeholder = partial.placeholder;\n  var bound = function() {\n    var position = 0, length = boundArgs.length;\n    var args = Array(length);\n    for (var i = 0; i < length; i++) {\n      args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];\n    }\n    while (position < arguments.length) args.push(arguments[position++]);\n    return executeBound(func, bound, this, this, args);\n  };\n  return bound;\n});\n\npartial.placeholder = _;\n\n// Bind a number of an object's methods to that object. Remaining arguments\n// are the method names to be bound. Useful for ensuring that all callbacks\n// defined on an object belong to it.\nexport var bindAll = restArguments(function(obj, _keys) {\n  _keys = _flatten(_keys, false, false);\n  var index = _keys.length;\n  if (index < 1) throw new Error('bindAll must be passed function names');\n  while (index--) {\n    var key = _keys[index];\n    obj[key] = bind(obj[key], obj);\n  }\n});\n\n// Memoize an expensive function by storing its results.\nexport function memoize(func, hasher) {\n  var memoize = function(key) {\n    var cache = memoize.cache;\n    var address = '' + (hasher ? hasher.apply(this, arguments) : key);\n    if (!_has(cache, address)) cache[address] = func.apply(this, arguments);\n    return cache[address];\n  };\n  memoize.cache = {};\n  return memoize;\n}\n\n// Delays a function for the given number of milliseconds, and then calls\n// it with the arguments supplied.\nexport var delay = restArguments(function(func, wait, args) {\n  return setTimeout(function() {\n    return func.apply(null, args);\n  }, wait);\n});\n\n// Defers a function, scheduling it to run after the current call stack has\n// cleared.\nexport var defer = partial(delay, _, 1);\n\n// Returns a function, that, when invoked, will only be triggered at most once\n// during a given window of time. Normally, the throttled function will run\n// as much as it can, without ever going more than once per `wait` duration;\n// but if you'd like to disable the execution on the leading edge, pass\n// `{leading: false}`. To disable execution on the trailing edge, ditto.\nexport function throttle(func, wait, options) {\n  var timeout, context, args, result;\n  var previous = 0;\n  if (!options) options = {};\n\n  var later = function() {\n    previous = options.leading === false ? 0 : now();\n    timeout = null;\n    result = func.apply(context, args);\n    if (!timeout) context = args = null;\n  };\n\n  var throttled = function() {\n    var _now = now();\n    if (!previous && options.leading === false) previous = _now;\n    var remaining = wait - (_now - previous);\n    context = this;\n    args = arguments;\n    if (remaining <= 0 || remaining > wait) {\n      if (timeout) {\n        clearTimeout(timeout);\n        timeout = null;\n      }\n      previous = _now;\n      result = func.apply(context, args);\n      if (!timeout) context = args = null;\n    } else if (!timeout && options.trailing !== false) {\n      timeout = setTimeout(later, remaining);\n    }\n    return result;\n  };\n\n  throttled.cancel = function() {\n    clearTimeout(timeout);\n    previous = 0;\n    timeout = context = args = null;\n  };\n\n  return throttled;\n}\n\n// Returns a function, that, as long as it continues to be invoked, will not\n// be triggered. The function will be called after it stops being called for\n// N milliseconds. If `immediate` is passed, trigger the function on the\n// leading edge, instead of the trailing.\nexport function debounce(func, wait, immediate) {\n  var timeout, result;\n\n  var later = function(context, args) {\n    timeout = null;\n    if (args) result = func.apply(context, args);\n  };\n\n  var debounced = restArguments(function(args) {\n    if (timeout) clearTimeout(timeout);\n    if (immediate) {\n      var callNow = !timeout;\n      timeout = setTimeout(later, wait);\n      if (callNow) result = func.apply(this, args);\n    } else {\n      timeout = delay(later, wait, this, args);\n    }\n\n    return result;\n  });\n\n  debounced.cancel = function() {\n    clearTimeout(timeout);\n    timeout = null;\n  };\n\n  return debounced;\n}\n\n// Returns the first function passed as an argument to the second,\n// allowing you to adjust arguments, run code before and after, and\n// conditionally execute the original function.\nexport function wrap(func, wrapper) {\n  return partial(wrapper, func);\n}\n\n// Returns a negated version of the passed-in predicate.\nexport function negate(predicate) {\n  return function() {\n    return !predicate.apply(this, arguments);\n  };\n}\n\n// Returns a function that is the composition of a list of functions, each\n// consuming the return value of the function that follows.\nexport function compose() {\n  var args = arguments;\n  var start = args.length - 1;\n  return function() {\n    var i = start;\n    var result = args[start].apply(this, arguments);\n    while (i--) result = args[i].call(this, result);\n    return result;\n  };\n}\n\n// Returns a function that will only be executed on and after the Nth call.\nexport function after(times, func) {\n  return function() {\n    if (--times < 1) {\n      return func.apply(this, arguments);\n    }\n  };\n}\n\n// Returns a function that will only be executed up to (but not including) the Nth call.\nexport function before(times, func) {\n  var memo;\n  return function() {\n    if (--times > 0) {\n      memo = func.apply(this, arguments);\n    }\n    if (times <= 1) func = null;\n    return memo;\n  };\n}\n\n// Returns a function that will be executed at most one time, no matter how\n// often you call it. Useful for lazy initialization.\nexport var once = partial(before, 2);\n\n// Object Functions\n// ----------------\n\n// Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\nvar hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n  'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\nfunction collectNonEnumProps(obj, _keys) {\n  var nonEnumIdx = nonEnumerableProps.length;\n  var constructor = obj.constructor;\n  var proto = isFunction(constructor) && constructor.prototype || ObjProto;\n\n  // Constructor is a special case.\n  var prop = 'constructor';\n  if (_has(obj, prop) && !contains(_keys, prop)) _keys.push(prop);\n\n  while (nonEnumIdx--) {\n    prop = nonEnumerableProps[nonEnumIdx];\n    if (prop in obj && obj[prop] !== proto[prop] && !contains(_keys, prop)) {\n      _keys.push(prop);\n    }\n  }\n}\n\n// Retrieve the names of an object's own properties.\n// Delegates to **ECMAScript 5**'s native `Object.keys`.\nexport function keys(obj) {\n  if (!isObject(obj)) return [];\n  if (nativeKeys) return nativeKeys(obj);\n  var _keys = [];\n  for (var key in obj) if (_has(obj, key)) _keys.push(key);\n  // Ahem, IE < 9.\n  if (hasEnumBug) collectNonEnumProps(obj, _keys);\n  return _keys;\n}\n\n// Retrieve all the property names of an object.\nexport function allKeys(obj) {\n  if (!isObject(obj)) return [];\n  var _keys = [];\n  for (var key in obj) _keys.push(key);\n  // Ahem, IE < 9.\n  if (hasEnumBug) collectNonEnumProps(obj, _keys);\n  return _keys;\n}\n\n// Retrieve the values of an object's properties.\nexport function values(obj) {\n  var _keys = keys(obj);\n  var length = _keys.length;\n  var values = Array(length);\n  for (var i = 0; i < length; i++) {\n    values[i] = obj[_keys[i]];\n  }\n  return values;\n}\n\n// Returns the results of applying the iteratee to each element of the object.\n// In contrast to map it returns an object.\nexport function mapObject(obj, iteratee, context) {\n  iteratee = cb(iteratee, context);\n  var _keys = keys(obj),\n      length = _keys.length,\n      results = {};\n  for (var index = 0; index < length; index++) {\n    var currentKey = _keys[index];\n    results[currentKey] = iteratee(obj[currentKey], currentKey, obj);\n  }\n  return results;\n}\n\n// Convert an object into a list of `[key, value]` pairs.\n// The opposite of object.\nexport function pairs(obj) {\n  var _keys = keys(obj);\n  var length = _keys.length;\n  var pairs = Array(length);\n  for (var i = 0; i < length; i++) {\n    pairs[i] = [_keys[i], obj[_keys[i]]];\n  }\n  return pairs;\n}\n\n// Invert the keys and values of an object. The values must be serializable.\nexport function invert(obj) {\n  var result = {};\n  var _keys = keys(obj);\n  for (var i = 0, length = _keys.length; i < length; i++) {\n    result[obj[_keys[i]]] = _keys[i];\n  }\n  return result;\n}\n\n// Return a sorted list of the function names available on the object.\nexport function functions(obj) {\n  var names = [];\n  for (var key in obj) {\n    if (isFunction(obj[key])) names.push(key);\n  }\n  return names.sort();\n}\nexport { functions as methods };\n\n// An internal function for creating assigner functions.\nfunction createAssigner(keysFunc, defaults) {\n  return function(obj) {\n    var length = arguments.length;\n    if (defaults) obj = Object(obj);\n    if (length < 2 || obj == null) return obj;\n    for (var index = 1; index < length; index++) {\n      var source = arguments[index],\n          _keys = keysFunc(source),\n          l = _keys.length;\n      for (var i = 0; i < l; i++) {\n        var key = _keys[i];\n        if (!defaults || obj[key] === void 0) obj[key] = source[key];\n      }\n    }\n    return obj;\n  };\n}\n\n// Extend a given object with all the properties in passed-in object(s).\nexport var extend = createAssigner(allKeys);\n\n// Assigns a given object with all the own properties in the passed-in object(s).\n// (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)\nexport var extendOwn = createAssigner(keys);\nexport { extendOwn as assign };\n\n// Returns the first key on an object that passes a predicate test.\nexport function findKey(obj, predicate, context) {\n  predicate = cb(predicate, context);\n  var _keys = keys(obj), key;\n  for (var i = 0, length = _keys.length; i < length; i++) {\n    key = _keys[i];\n    if (predicate(obj[key], key, obj)) return key;\n  }\n}\n\n// Internal pick helper function to determine if `obj` has key `key`.\nfunction keyInObj(value, key, obj) {\n  return key in obj;\n}\n\n// Return a copy of the object only containing the whitelisted properties.\nexport var pick = restArguments(function(obj, _keys) {\n  var result = {}, iteratee = _keys[0];\n  if (obj == null) return result;\n  if (isFunction(iteratee)) {\n    if (_keys.length > 1) iteratee = optimizeCb(iteratee, _keys[1]);\n    _keys = allKeys(obj);\n  } else {\n    iteratee = keyInObj;\n    _keys = _flatten(_keys, false, false);\n    obj = Object(obj);\n  }\n  for (var i = 0, length = _keys.length; i < length; i++) {\n    var key = _keys[i];\n    var value = obj[key];\n    if (iteratee(value, key, obj)) result[key] = value;\n  }\n  return result;\n});\n\n// Return a copy of the object without the blacklisted properties.\nexport var omit = restArguments(function(obj, _keys) {\n  var iteratee = _keys[0], context;\n  if (isFunction(iteratee)) {\n    iteratee = negate(iteratee);\n    if (_keys.length > 1) context = _keys[1];\n  } else {\n    _keys = map(_flatten(_keys, false, false), String);\n    iteratee = function(value, key) {\n      return !contains(_keys, key);\n    };\n  }\n  return pick(obj, iteratee, context);\n});\n\n// Fill in a given object with default properties.\nexport var defaults = createAssigner(allKeys, true);\n\n// Creates an object that inherits from the given prototype object.\n// If additional properties are provided then they will be added to the\n// created object.\nexport function create(prototype, props) {\n  var result = baseCreate(prototype);\n  if (props) extendOwn(result, props);\n  return result;\n}\n\n// Create a (shallow-cloned) duplicate of an object.\nexport function clone(obj) {\n  if (!isObject(obj)) return obj;\n  return isArray(obj) ? obj.slice() : extend({}, obj);\n}\n\n// Invokes interceptor with the obj, and then returns obj.\n// The primary purpose of this method is to \"tap into\" a method chain, in\n// order to perform operations on intermediate results within the chain.\nexport function tap(obj, interceptor) {\n  interceptor(obj);\n  return obj;\n}\n\n// Returns whether an object has a given set of `key:value` pairs.\nexport function isMatch(object, attrs) {\n  var _keys = keys(attrs), length = _keys.length;\n  if (object == null) return !length;\n  var obj = Object(object);\n  for (var i = 0; i < length; i++) {\n    var key = _keys[i];\n    if (attrs[key] !== obj[key] || !(key in obj)) return false;\n  }\n  return true;\n}\n\n\n// Internal recursive comparison function for `isEqual`.\nfunction eq(a, b, aStack, bStack) {\n  // Identical objects are equal. `0 === -0`, but they aren't identical.\n  // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).\n  if (a === b) return a !== 0 || 1 / a === 1 / b;\n  // `null` or `undefined` only equal to itself (strict comparison).\n  if (a == null || b == null) return false;\n  // `NaN`s are equivalent, but non-reflexive.\n  if (a !== a) return b !== b;\n  // Exhaust primitive checks\n  var type = typeof a;\n  if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;\n  return deepEq(a, b, aStack, bStack);\n}\n\n// Internal recursive comparison function for `isEqual`.\nfunction deepEq(a, b, aStack, bStack) {\n  // Unwrap any wrapped objects.\n  if (a instanceof _) a = a._wrapped;\n  if (b instanceof _) b = b._wrapped;\n  // Compare `[[Class]]` names.\n  var className = toString.call(a);\n  if (className !== toString.call(b)) return false;\n  switch (className) {\n    // Strings, numbers, regular expressions, dates, and booleans are compared by value.\n    case '[object RegExp]':\n    // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n    case '[object String]':\n      // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n      // equivalent to `new String(\"5\")`.\n      return '' + a === '' + b;\n    case '[object Number]':\n      // `NaN`s are equivalent, but non-reflexive.\n      // Object(NaN) is equivalent to NaN.\n      if (+a !== +a) return +b !== +b;\n      // An `egal` comparison is performed for other numeric values.\n      return +a === 0 ? 1 / +a === 1 / b : +a === +b;\n    case '[object Date]':\n    case '[object Boolean]':\n      // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n      // millisecond representations. Note that invalid dates with millisecond representations\n      // of `NaN` are not equivalent.\n      return +a === +b;\n    case '[object Symbol]':\n      return SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b);\n  }\n\n  var areArrays = className === '[object Array]';\n  if (!areArrays) {\n    if (typeof a != 'object' || typeof b != 'object') return false;\n\n    // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n    // from different frames are.\n    var aCtor = a.constructor, bCtor = b.constructor;\n    if (aCtor !== bCtor && !(isFunction(aCtor) && aCtor instanceof aCtor &&\n                             isFunction(bCtor) && bCtor instanceof bCtor)\n                        && ('constructor' in a && 'constructor' in b)) {\n      return false;\n    }\n  }\n  // Assume equality for cyclic structures. The algorithm for detecting cyclic\n  // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n  // Initializing stack of traversed objects.\n  // It's done here since we only need them for objects and arrays comparison.\n  aStack = aStack || [];\n  bStack = bStack || [];\n  var length = aStack.length;\n  while (length--) {\n    // Linear search. Performance is inversely proportional to the number of\n    // unique nested structures.\n    if (aStack[length] === a) return bStack[length] === b;\n  }\n\n  // Add the first object to the stack of traversed objects.\n  aStack.push(a);\n  bStack.push(b);\n\n  // Recursively compare objects and arrays.\n  if (areArrays) {\n    // Compare array lengths to determine if a deep comparison is necessary.\n    length = a.length;\n    if (length !== b.length) return false;\n    // Deep compare the contents, ignoring non-numeric properties.\n    while (length--) {\n      if (!eq(a[length], b[length], aStack, bStack)) return false;\n    }\n  } else {\n    // Deep compare objects.\n    var _keys = keys(a), key;\n    length = _keys.length;\n    // Ensure that both objects contain the same number of properties before comparing deep equality.\n    if (keys(b).length !== length) return false;\n    while (length--) {\n      // Deep compare each member\n      key = _keys[length];\n      if (!(_has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;\n    }\n  }\n  // Remove the first object from the stack of traversed objects.\n  aStack.pop();\n  bStack.pop();\n  return true;\n}\n\n// Perform a deep comparison to check if two objects are equal.\nexport function isEqual(a, b) {\n  return eq(a, b);\n}\n\n// Is a given array, string, or object empty?\n// An \"empty\" object has no enumerable own-properties.\nexport function isEmpty(obj) {\n  if (obj == null) return true;\n  if (isArrayLike(obj) && (isArray(obj) || isString(obj) || isArguments(obj))) return obj.length === 0;\n  return keys(obj).length === 0;\n}\n\n// Is a given value a DOM element?\nexport function isElement(obj) {\n  return !!(obj && obj.nodeType === 1);\n}\n\n// Internal function for creating a toString-based type tester.\nfunction tagTester(name) {\n  return function(obj) {\n    return toString.call(obj) === '[object ' + name + ']';\n  };\n}\n\n// Is a given value an array?\n// Delegates to ECMA5's native Array.isArray\nexport var isArray = nativeIsArray || tagTester('Array');\n\n// Is a given variable an object?\nexport function isObject(obj) {\n  var type = typeof obj;\n  return type === 'function' || type === 'object' && !!obj;\n}\n\n// Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError, isMap, isWeakMap, isSet, isWeakSet.\nexport var isArguments = tagTester('Arguments');\nexport var isFunction = tagTester('Function');\nexport var isString = tagTester('String');\nexport var isNumber = tagTester('Number');\nexport var isDate = tagTester('Date');\nexport var isRegExp = tagTester('RegExp');\nexport var isError = tagTester('Error');\nexport var isSymbol = tagTester('Symbol');\nexport var isMap = tagTester('Map');\nexport var isWeakMap = tagTester('WeakMap');\nexport var isSet = tagTester('Set');\nexport var isWeakSet = tagTester('WeakSet');\n\n// Define a fallback version of the method in browsers (ahem, IE < 9), where\n// there isn't any inspectable \"Arguments\" type.\n(function() {\n  if (!isArguments(arguments)) {\n    isArguments = function(obj) {\n      return _has(obj, 'callee');\n    };\n  }\n}());\n\n// Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,\n// IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).\nvar nodelist = root.document && root.document.childNodes;\nif (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {\n  isFunction = function(obj) {\n    return typeof obj == 'function' || false;\n  };\n}\n\n// Is a given object a finite number?\nexport function isFinite(obj) {\n  return !isSymbol(obj) && _isFinite(obj) && !_isNaN(parseFloat(obj));\n}\n\n// Is the given value `NaN`?\nexport function isNaN(obj) {\n  return isNumber(obj) && _isNaN(obj);\n}\n\n// Is a given value a boolean?\nexport function isBoolean(obj) {\n  return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n}\n\n// Is a given value equal to null?\nexport function isNull(obj) {\n  return obj === null;\n}\n\n// Is a given variable undefined?\nexport function isUndefined(obj) {\n  return obj === void 0;\n}\n\n// Shortcut function for checking if an object has a given property directly\n// on itself (in other words, not on a prototype).\nexport function has(obj, path) {\n  if (!isArray(path)) {\n    return _has(obj, path);\n  }\n  var length = path.length;\n  for (var i = 0; i < length; i++) {\n    var key = path[i];\n    if (obj == null || !hasOwnProperty.call(obj, key)) {\n      return false;\n    }\n    obj = obj[key];\n  }\n  return !!length;\n}\n\n// Utility Functions\n// -----------------\n\n// Keep the identity function around for default iteratees.\nexport function identity(value) {\n  return value;\n}\n\n// Predicate-generating functions. Often useful outside of Underscore.\nexport function constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nexport function noop(){}\n\n// Creates a function that, when passed an object, will traverse that object’s\n// properties down the given `path`, specified as an array of keys or indexes.\nexport function property(path) {\n  if (!isArray(path)) {\n    return shallowProperty(path);\n  }\n  return function(obj) {\n    return deepGet(obj, path);\n  };\n}\n\n// Generates a function for a given object that returns a given property.\nexport function propertyOf(obj) {\n  if (obj == null) {\n    return function(){};\n  }\n  return function(path) {\n    return !isArray(path) ? obj[path] : deepGet(obj, path);\n  };\n}\n\n// Returns a predicate for checking whether an object has a given set of\n// `key:value` pairs.\nexport function matcher(attrs) {\n  attrs = extendOwn({}, attrs);\n  return function(obj) {\n    return isMatch(obj, attrs);\n  };\n}\nexport { matcher as matches };\n\n// Run a function **n** times.\nexport function times(n, iteratee, context) {\n  var accum = Array(Math.max(0, n));\n  iteratee = optimizeCb(iteratee, context, 1);\n  for (var i = 0; i < n; i++) accum[i] = iteratee(i);\n  return accum;\n}\n\n// Return a random integer between min and max (inclusive).\nexport function random(min, max) {\n  if (max == null) {\n    max = min;\n    min = 0;\n  }\n  return min + Math.floor(Math.random() * (max - min + 1));\n}\n\n// A (possibly faster) way to get the current timestamp as an integer.\nexport var now = Date.now || function() {\n  return new Date().getTime();\n};\n\n// List of HTML entities for escaping.\nvar escapeMap = {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#x27;',\n  '`': '&#x60;'\n};\nvar unescapeMap = invert(escapeMap);\n\n// Functions for escaping and unescaping strings to/from HTML interpolation.\nfunction createEscaper(map) {\n  var escaper = function(match) {\n    return map[match];\n  };\n  // Regexes for identifying a key that needs to be escaped.\n  var source = '(?:' + keys(map).join('|') + ')';\n  var testRegexp = RegExp(source);\n  var replaceRegexp = RegExp(source, 'g');\n  return function(string) {\n    string = string == null ? '' : '' + string;\n    return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n  };\n}\nexport var escape = createEscaper(escapeMap);\nexport var unescape = createEscaper(unescapeMap);\n\n// Traverses the children of `obj` along `path`. If a child is a function, it\n// is invoked with its parent as context. Returns the value of the final\n// child, or `fallback` if any child is undefined.\nexport function result(obj, path, fallback) {\n  if (!isArray(path)) path = [path];\n  var length = path.length;\n  if (!length) {\n    return isFunction(fallback) ? fallback.call(obj) : fallback;\n  }\n  for (var i = 0; i < length; i++) {\n    var prop = obj == null ? void 0 : obj[path[i]];\n    if (prop === void 0) {\n      prop = fallback;\n      i = length; // Ensure we don't continue iterating.\n    }\n    obj = isFunction(prop) ? prop.call(obj) : prop;\n  }\n  return obj;\n}\n\n// Generate a unique integer id (unique within the entire client session).\n// Useful for temporary DOM ids.\nvar idCounter = 0;\nexport function uniqueId(prefix) {\n  var id = ++idCounter + '';\n  return prefix ? prefix + id : id;\n}\n\n// By default, Underscore uses ERB-style template delimiters, change the\n// following template settings to use alternative delimiters.\nexport var templateSettings = _.templateSettings = {\n  evaluate: /<%([\\s\\S]+?)%>/g,\n  interpolate: /<%=([\\s\\S]+?)%>/g,\n  escape: /<%-([\\s\\S]+?)%>/g\n};\n\n// When customizing `templateSettings`, if you don't want to define an\n// interpolation, evaluation or escaping regex, we need one that is\n// guaranteed not to match.\nvar noMatch = /(.)^/;\n\n// Certain characters need to be escaped so that they can be put into a\n// string literal.\nvar escapes = {\n  \"'\": \"'\",\n  '\\\\': '\\\\',\n  '\\r': 'r',\n  '\\n': 'n',\n  '\\u2028': 'u2028',\n  '\\u2029': 'u2029'\n};\n\nvar escapeRegExp = /\\\\|'|\\r|\\n|\\u2028|\\u2029/g;\n\nvar escapeChar = function(match) {\n  return '\\\\' + escapes[match];\n};\n\n// JavaScript micro-templating, similar to John Resig's implementation.\n// Underscore templating handles arbitrary delimiters, preserves whitespace,\n// and correctly escapes quotes within interpolated code.\n// NB: `oldSettings` only exists for backwards compatibility.\nexport function template(text, settings, oldSettings) {\n  if (!settings && oldSettings) settings = oldSettings;\n  settings = defaults({}, settings, _.templateSettings);\n\n  // Combine delimiters into one regular expression via alternation.\n  var matcher = RegExp([\n    (settings.escape || noMatch).source,\n    (settings.interpolate || noMatch).source,\n    (settings.evaluate || noMatch).source\n  ].join('|') + '|$', 'g');\n\n  // Compile the template source, escaping string literals appropriately.\n  var index = 0;\n  var source = \"__p+='\";\n  text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {\n    source += text.slice(index, offset).replace(escapeRegExp, escapeChar);\n    index = offset + match.length;\n\n    if (escape) {\n      source += \"'+\\n((__t=(\" + escape + \"))==null?'':_.escape(__t))+\\n'\";\n    } else if (interpolate) {\n      source += \"'+\\n((__t=(\" + interpolate + \"))==null?'':__t)+\\n'\";\n    } else if (evaluate) {\n      source += \"';\\n\" + evaluate + \"\\n__p+='\";\n    }\n\n    // Adobe VMs need the match returned to produce the correct offset.\n    return match;\n  });\n  source += \"';\\n\";\n\n  // If a variable is not specified, place data values in local scope.\n  if (!settings.variable) source = 'with(obj||{}){\\n' + source + '}\\n';\n\n  source = \"var __t,__p='',__j=Array.prototype.join,\" +\n    \"print=function(){__p+=__j.call(arguments,'');};\\n\" +\n    source + 'return __p;\\n';\n\n  var render;\n  try {\n    render = new Function(settings.variable || 'obj', '_', source);\n  } catch (e) {\n    e.source = source;\n    throw e;\n  }\n\n  var template = function(data) {\n    return render.call(this, data, _);\n  };\n\n  // Provide the compiled source as a convenience for precompilation.\n  var argument = settings.variable || 'obj';\n  template.source = 'function(' + argument + '){\\n' + source + '}';\n\n  return template;\n}\n\n// Add a \"chain\" function. Start chaining a wrapped Underscore object.\nexport function chain(obj) {\n  var instance = _(obj);\n  instance._chain = true;\n  return instance;\n}\n\n// OOP\n// ---------------\n// If Underscore is called as a function, it returns a wrapped object that\n// can be used OO-style. This wrapper holds altered versions of all the\n// underscore functions. Wrapped objects may be chained.\n\n// Helper function to continue chaining intermediate results.\nfunction chainResult(instance, obj) {\n  return instance._chain ? _(obj).chain() : obj;\n}\n\n// Add your own custom functions to the Underscore object.\nexport function mixin(obj) {\n  each(functions(obj), function(name) {\n    var func = _[name] = obj[name];\n    _.prototype[name] = function() {\n      var args = [this._wrapped];\n      push.apply(args, arguments);\n      return chainResult(this, func.apply(_, args));\n    };\n  });\n  return _;\n}\n\n// Add all mutator Array functions to the wrapper.\neach(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {\n  var method = ArrayProto[name];\n  _.prototype[name] = function() {\n    var obj = this._wrapped;\n    method.apply(obj, arguments);\n    if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];\n    return chainResult(this, obj);\n  };\n});\n\n// Add all accessor Array functions to the wrapper.\neach(['concat', 'join', 'slice'], function(name) {\n  var method = ArrayProto[name];\n  _.prototype[name] = function() {\n    return chainResult(this, method.apply(this._wrapped, arguments));\n  };\n});\n\n// Extracts the result from a wrapped and chained object.\n_.prototype.value = function() {\n  return this._wrapped;\n};\n\n// Provide unwrapping proxy for some methods used in engine operations\n// such as arithmetic and JSON stringification.\n_.prototype.valueOf = _.prototype.toJSON = _.prototype.value;\n\n_.prototype.toString = function() {\n  return String(this._wrapped);\n};\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","import * as allExports from './index.js';\nimport { mixin } from './index.js';\n\n// Add all of the Underscore functions to the wrapper object.\nvar _ = mixin(allExports);\n// Legacy Node.js API\n_._ = _;\n// Export the Underscore API.\nexport default _;\n","/* eslint-disable */\n/*\n * Copyright (c) 2015\n *\n * This file is licensed under the Affero General Public License version 3\n * or later.\n *\n * See the COPYING-README file.\n *\n */\n\n(function(OC) {\n\n\t/**\n\t * @class OC.Files.FileInfo\n\t * @classdesc File information\n\t *\n\t * @param {Object} data file data, see attributes for details\n\t *\n\t * @since 8.2\n\t */\n\tconst FileInfo = function(data) {\n\t\tconst self = this\n\t\t_.each(data, function(value, key) {\n\t\t\tif (!_.isFunction(value)) {\n\t\t\t\tself[key] = value\n\t\t\t}\n\t\t})\n\n\t\tif (!_.isUndefined(this.id)) {\n\t\t\tthis.id = parseInt(data.id, 10)\n\t\t}\n\n\t\t// TODO: normalize path\n\t\tthis.path = data.path || ''\n\n\t\tif (this.type === 'dir') {\n\t\t\tthis.mimetype = 'httpd/unix-directory'\n\t\t} else {\n\t\t\tthis.mimetype = this.mimetype || 'application/octet-stream'\n\t\t}\n\n\t\tif (!this.type) {\n\t\t\tif (this.mimetype === 'httpd/unix-directory') {\n\t\t\t\tthis.type = 'dir'\n\t\t\t} else {\n\t\t\t\tthis.type = 'file'\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * @memberof OC.Files\n\t */\n\tFileInfo.prototype = {\n\t\t/**\n\t\t * File id\n\t\t *\n\t\t * @type int\n\t\t */\n\t\tid: null,\n\n\t\t/**\n\t\t * File name\n\t\t *\n\t\t * @type String\n\t\t */\n\t\tname: null,\n\n\t\t/**\n\t\t * Path leading to the file, without the file name,\n\t\t * and with a leading slash.\n\t\t *\n\t\t * @type String\n\t\t */\n\t\tpath: null,\n\n\t\t/**\n\t\t * Mime type\n\t\t *\n\t\t * @type String\n\t\t */\n\t\tmimetype: null,\n\n\t\t/**\n\t\t * Icon URL.\n\t\t *\n\t\t * Can be used to override the mime type icon.\n\t\t *\n\t\t * @type String\n\t\t */\n\t\ticon: null,\n\n\t\t/**\n\t\t * File type. 'file'  for files, 'dir' for directories.\n\t\t *\n\t\t * @type String\n\t\t * @deprecated rely on mimetype instead\n\t\t */\n\t\ttype: null,\n\n\t\t/**\n\t\t * Permissions.\n\t\t *\n\t\t * @see OC#PERMISSION_ALL for permissions\n\t\t * @type int\n\t\t */\n\t\tpermissions: null,\n\n\t\t/**\n\t\t * Modification time\n\t\t *\n\t\t * @type int\n\t\t */\n\t\tmtime: null,\n\n\t\t/**\n\t\t * Etag\n\t\t *\n\t\t * @type String\n\t\t */\n\t\tetag: null,\n\n\t\t/**\n\t\t * Mount type.\n\t\t *\n\t\t * One of null, \"external-root\", \"shared\" or \"shared-root\"\n\t\t *\n\t\t * @type string\n\t\t */\n\t\tmountType: null,\n\n\t\t/**\n\t\t * @type boolean\n\t\t */\n\t\thasPreview: true,\n\n\t\t/**\n\t\t * @type int\n\t\t */\n\t\tsharePermissions: null,\n\t}\n\n\tif (!OC.Files) {\n\t\tOC.Files = {}\n\t}\n\tOC.Files.FileInfo = FileInfo\n})(OC)\n"],"sourceRoot":""}