nextcloud/core/js/dist/files_fileinfo.js.map

1 line
116 KiB
Plaintext
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/underscore/modules/_setup.js","webpack:///(webpack)/buildin/global.js","webpack:///./core/src/files/fileinfo.js","webpack:///./node_modules/underscore/modules/restArguments.js","webpack:///./node_modules/underscore/modules/isObject.js","webpack:///./node_modules/underscore/modules/isNull.js","webpack:///./node_modules/underscore/modules/isUndefined.js","webpack:///./node_modules/underscore/modules/isBoolean.js","webpack:///./node_modules/underscore/modules/isElement.js","webpack:///./node_modules/underscore/modules/_tagTester.js","webpack:///./node_modules/underscore/modules/isString.js","webpack:///./node_modules/underscore/modules/isNumber.js","webpack:///./node_modules/underscore/modules/isDate.js","webpack:///./node_modules/underscore/modules/isRegExp.js","webpack:///./node_modules/underscore/modules/isError.js","webpack:///./node_modules/underscore/modules/isSymbol.js","webpack:///./node_modules/underscore/modules/isMap.js","webpack:///./node_modules/underscore/modules/isWeakMap.js","webpack:///./node_modules/underscore/modules/isSet.js","webpack:///./node_modules/underscore/modules/isWeakSet.js","webpack:///./node_modules/underscore/modules/isArrayBuffer.js","webpack:///./node_modules/underscore/modules/isDataView.js","webpack:///./node_modules/underscore/modules/isArray.js","webpack:///./node_modules/underscore/modules/isFunction.js","webpack:///./node_modules/underscore/modules/_has.js","webpack:///./node_modules/underscore/modules/isArguments.js","webpack:///./node_modules/underscore/modules/isFinite.js","webpack:///./node_modules/underscore/modules/isNaN.js","webpack:///./node_modules/underscore/modules/constant.js","webpack:///./node_modules/underscore/modules/_createSizePropertyCheck.js","webpack:///./node_modules/underscore/modules/_shallowProperty.js","webpack:///./node_modules/underscore/modules/_getByteLength.js","webpack:///./node_modules/underscore/modules/_isBufferLike.js","webpack:///./node_modules/underscore/modules/isTypedArray.js","webpack:///./node_modules/underscore/modules/_getLength.js","webpack:///./node_modules/underscore/modules/_isArrayLike.js","webpack:///./node_modules/underscore/modules/_collectNonEnumProps.js","webpack:///./node_modules/underscore/modules/keys.js","webpack:///./node_modules/underscore/modules/isEmpty.js","webpack:///./node_modules/underscore/modules/isMatch.js","webpack:///./node_modules/underscore/modules/underscore.js","webpack:///./node_modules/underscore/modules/isEqual.js","webpack:///./node_modules/underscore/modules/allKeys.js","webpack:///./node_modules/underscore/modules/values.js","webpack:///./node_modules/underscore/modules/pairs.js","webpack:///./node_modules/underscore/modules/invert.js","webpack:///./node_modules/underscore/modules/functions.js","webpack:///./node_modules/underscore/modules/_createAssigner.js","webpack:///./node_modules/underscore/modules/extend.js","webpack:///./node_modules/underscore/modules/extendOwn.js","webpack:///./node_modules/underscore/modules/defaults.js","webpack:///./node_modules/underscore/modules/_baseCreate.js","webpack:///./node_modules/underscore/modules/create.js","webpack:///./node_modules/underscore/modules/clone.js","webpack:///./node_modules/underscore/modules/tap.js","webpack:///./node_modules/underscore/modules/has.js","webpack:///./node_modules/underscore/modules/identity.js","webpack:///./node_modules/underscore/modules/matcher.js","webpack:///./node_modules/underscore/modules/_deepGet.js","webpack:///./node_modules/underscore/modules/property.js","webpack:///./node_modules/underscore/modules/_optimizeCb.js","webpack:///./node_modules/underscore/modules/_baseIteratee.js","webpack:///./node_modules/underscore/modules/iteratee.js","webpack:///./node_modules/underscore/modules/_cb.js","webpack:///./node_modules/underscore/modules/mapObject.js","webpack:///./node_modules/underscore/modules/noop.js","webpack:///./node_modules/underscore/modules/propertyOf.js","webpack:///./node_modules/underscore/modules/times.js","webpack:///./node_modules/underscore/modules/random.js","webpack:///./node_modules/underscore/modules/now.js","webpack:///./node_modules/underscore/modules/_createEscaper.js","webpack:///./node_modules/underscore/modules/_escapeMap.js","webpack:///./node_modules/underscore/modules/escape.js","webpack:///./node_modules/underscore/modules/unescape.js","webpack:///./node_modules/underscore/modules/_unescapeMap.js","webpack:///./node_modules/underscore/modules/templateSettings.js","webpack:///./node_modules/underscore/modules/template.js","webpack:///./node_modules/underscore/modules/result.js","webpack:///./node_modules/underscore/modules/uniqueId.js","webpack:///./node_modules/underscore/modules/chain.js","webpack:///./node_modules/underscore/modules/_executeBound.js","webpack:///./node_modules/underscore/modules/partial.js","webpack:///./node_modules/underscore/modules/bind.js","webpack:///./node_modules/underscore/modules/_flatten.js","webpack:///./node_modules/underscore/modules/bindAll.js","webpack:///./node_modules/underscore/modules/memoize.js","webpack:///./node_modules/underscore/modules/delay.js","webpack:///./node_modules/underscore/modules/defer.js","webpack:///./node_modules/underscore/modules/throttle.js","webpack:///./node_modules/underscore/modules/debounce.js","webpack:///./node_modules/underscore/modules/wrap.js","webpack:///./node_modules/underscore/modules/negate.js","webpack:///./node_modules/underscore/modules/compose.js","webpack:///./node_modules/underscore/modules/after.js","webpack:///./node_modules/underscore/modules/before.js","webpack:///./node_modules/underscore/modules/once.js","webpack:///./node_modules/underscore/modules/findKey.js","webpack:///./node_modules/underscore/modules/_createPredicateIndexFinder.js","webpack:///./node_modules/underscore/modules/findIndex.js","webpack:///./node_modules/underscore/modules/findLastIndex.js","webpack:///./node_modules/underscore/modules/sortedIndex.js","webpack:///./node_modules/underscore/modules/_createIndexFinder.js","webpack:///./node_modules/underscore/modules/indexOf.js","webpack:///./node_modules/underscore/modules/lastIndexOf.js","webpack:///./node_modules/underscore/modules/find.js","webpack:///./node_modules/underscore/modules/findWhere.js","webpack:///./node_modules/underscore/modules/each.js","webpack:///./node_modules/underscore/modules/map.js","webpack:///./node_modules/underscore/modules/_createReduce.js","webpack:///./node_modules/underscore/modules/reduce.js","webpack:///./node_modules/underscore/modules/reduceRight.js","webpack:///./node_modules/underscore/modules/filter.js","webpack:///./node_modules/underscore/modules/reject.js","webpack:///./node_modules/underscore/modules/every.js","webpack:///./node_modules/underscore/modules/some.js","webpack:///./node_modules/underscore/modules/contains.js","webpack:///./node_modules/underscore/modules/invoke.js","webpack:///./node_modules/underscore/modules/pluck.js","webpack:///./node_modules/underscore/modules/where.js","webpack:///./node_modules/underscore/modules/max.js","webpack:///./node_modules/underscore/modules/min.js","webpack:///./node_modules/underscore/modules/sample.js","webpack:///./node_modules/underscore/modules/shuffle.js","webpack:///./node_modules/underscore/modules/sortBy.js","webpack:///./node_modules/underscore/modules/_group.js","webpack:///./node_modules/underscore/modules/groupBy.js","webpack:///./node_modules/underscore/modules/indexBy.js","webpack:///./node_modules/underscore/modules/countBy.js","webpack:///./node_modules/underscore/modules/partition.js","webpack:///./node_modules/underscore/modules/toArray.js","webpack:///./node_modules/underscore/modules/size.js","webpack:///./node_modules/underscore/modules/_keyInObj.js","webpack:///./node_modules/underscore/modules/pick.js","webpack:///./node_modules/underscore/modules/omit.js","webpack:///./node_modules/underscore/modules/initial.js","webpack:///./node_modules/underscore/modules/first.js","webpack:///./node_modules/underscore/modules/rest.js","webpack:///./node_modules/underscore/modules/last.js","webpack:///./node_modules/underscore/modules/compact.js","webpack:///./node_modules/underscore/modules/flatten.js","webpack:///./node_modules/underscore/modules/difference.js","webpack:///./node_modules/underscore/modules/without.js","webpack:///./node_modules/underscore/modules/uniq.js","webpack:///./node_modules/underscore/modules/union.js","webpack:///./node_modules/underscore/modules/intersection.js","webpack:///./node_modules/underscore/modules/unzip.js","webpack:///./node_modules/underscore/modules/zip.js","webpack:///./node_modules/underscore/modules/object.js","webpack:///./node_modules/underscore/modules/range.js","webpack:///./node_modules/underscore/modules/chunk.js","webpack:///./node_modules/underscore/modules/_chainResult.js","webpack:///./node_modules/underscore/modules/mixin.js","webpack:///./node_modules/underscore/modules/underscore-array-methods.js","webpack:///./node_modules/underscore/modules/index-default.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","VERSION","root","self","global","Function","ArrayProto","Array","ObjProto","SymbolProto","push","slice","toString","supportsArrayBuffer","ArrayBuffer","nativeIsArray","isArray","nativeKeys","keys","nativeCreate","nativeIsView","isView","_isNaN","isNaN","_isFinite","isFinite","hasEnumBug","propertyIsEnumerable","nonEnumerableProps","MAX_ARRAY_INDEX","Math","pow","g","this","e","window","OC","FileInfo","data","_","each","isFunction","isUndefined","id","parseInt","path","type","mimetype","icon","permissions","mtime","etag","mountType","hasPreview","sharePermissions","Files","restArguments","func","startIndex","length","max","arguments","rest","index","args","apply","isObject","obj","isNull","isBoolean","isElement","nodeType","tagTester","nodelist","document","childNodes","Int8Array","has","isArguments","isSymbol","parseFloat","isNumber","constant","createSizePropertyCheck","getSizeProperty","collection","sizeProperty","shallowProperty","typedArrayPattern","isDataView","test","collectNonEnumProps","hash","contains","emulatedSet","nonEnumIdx","constructor","proto","prop","isEmpty","isString","isMatch","attrs","_keys","_wrapped","eq","a","b","aStack","bStack","deepEq","className","valueOf","DataView","byteLength","getUint8","buffer","areArrays","aCtor","bCtor","pop","isEqual","allKeys","values","pairs","invert","result","functions","names","sort","createAssigner","keysFunc","defaults","source","toJSON","String","baseCreate","Ctor","props","extendOwn","clone","extend","tap","interceptor","identity","deepGet","optimizeCb","context","argCount","accumulator","baseIteratee","Infinity","cb","iteratee","mapObject","results","currentKey","noop","propertyOf","times","accum","random","min","floor","Date","getTime","createEscaper","map","escaper","match","join","testRegexp","RegExp","replaceRegexp","string","replace","templateSettings","evaluate","interpolate","escape","noMatch","escapes","escapeRegExp","escapeChar","text","settings","oldSettings","render","matcher","offset","variable","template","argument","fallback","idCounter","uniqueId","prefix","chain","instance","_chain","executeBound","sourceFunc","boundFunc","callingContext","partial","boundArgs","placeholder","bound","position","TypeError","callArgs","concat","flatten","input","depth","strict","output","idx","j","len","Error","hasher","memoize","cache","address","wait","setTimeout","delay","throttle","options","timeout","previous","later","leading","now","throttled","_now","remaining","clearTimeout","trailing","cancel","debounce","immediate","debounced","callNow","wrap","wrapper","negate","predicate","compose","start","after","before","memo","findKey","createPredicateIndexFinder","dir","array","low","high","mid","createIndexFinder","predicateFind","sortedIndex","item","findIndex","findLastIndex","find","findWhere","createReduce","reducer","initial","filter","list","reject","every","some","fromIndex","guard","indexOf","contextPath","method","pluck","where","computed","lastComputed","v","sample","last","rand","temp","shuffle","sortBy","criteria","left","right","group","behavior","partition","pass","reStrSymbol","toArray","size","keyInObj","pick","first","compact","Boolean","otherArrays","difference","uniq","isSorted","seen","arrays","intersection","argsLength","unzip","range","stop","step","ceil","chunk","count","chainResult","mixin"],"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,kpBACO,IAAIC,EAAU,SAKVC,EAAsB,iBAARC,MAAoBA,KAAKA,OAASA,MAAQA,MACxC,iBAAVC,GAAsBA,EAAOA,SAAWA,GAAUA,GACzDC,SAAS,cAATA,IACA,GAGCC,EAAaC,MAAMV,UAAWW,EAAW7B,OAAOkB,UAChDY,EAAgC,oBAAXzB,OAAyBA,OAAOa,UAAY,KAGjEa,EAAOJ,EAAWI,KACzBC,EAAQL,EAAWK,MACnBC,EAAWJ,EAASI,SACpBd,EAAiBU,EAASV,eAGnBe,EAA6C,oBAAhBC,YAI7BC,EAAgBR,MAAMS,QAC7BC,EAAatC,OAAOuC,KACpBC,EAAexC,OAAOY,OACtB6B,EAAeP,GAAuBC,YAAYO,OAG3CC,EAASC,MAChBC,EAAYC,SAGLC,GAAc,CAACd,SAAU,MAAMe,qBAAqB,YACpDC,EAAqB,CAAC,UAAW,gBAAiB,WAC3D,uBAAwB,iBAAkB,kBAGjCC,EAAkBC,KAAKC,IAAI,EAAG,IAAM,I,mCCzC/C,IAAIC,EAGJA,EAAI,WACH,OAAOC,KADJ,GAIJ,IAECD,EAAIA,GAAK,IAAI3B,SAAS,cAAb,GACR,MAAO6B,GAEc,iBAAXC,SAAqBH,EAAIG,QAOrCnE,EAAOD,QAAUiE,G,qBCnBjB,aAWA,SAAUI,GAUT,IAAMC,EAAW,SAASC,GACzB,IAAMnC,EAAO8B,KACbM,EAAEC,KAAKF,GAAM,SAASpD,EAAOM,GACvB+C,EAAEE,WAAWvD,KACjBiB,EAAKX,GAAON,MAITqD,EAAEG,YAAYT,KAAKU,MACvBV,KAAKU,GAAKC,SAASN,EAAKK,GAAI,KAI7BV,KAAKY,KAAOP,EAAKO,MAAQ,GAEP,QAAdZ,KAAKa,KACRb,KAAKc,SAAW,uBAEhBd,KAAKc,SAAWd,KAAKc,UAAY,2BAG7Bd,KAAKa,OACa,yBAAlBb,KAAKc,SACRd,KAAKa,KAAO,MAEZb,KAAKa,KAAO,SAQfT,EAASxC,UAAY,CAMpB8C,GAAI,KAOJnE,KAAM,KAQNqE,KAAM,KAONE,SAAU,KASVC,KAAM,KAQNF,KAAM,KAQNG,YAAa,KAObC,MAAO,KAOPC,KAAM,KASNC,UAAW,KAKXC,YAAY,EAKZC,iBAAkB,MAGdlB,EAAGmB,QACPnB,EAAGmB,MAAQ,IAEZnB,EAAGmB,MAAMlB,SAAWA,EAvIrB,CAwIGD,M,k9WC9IY,SAASoB,EAAcC,EAAMC,GAE1C,OADAA,EAA2B,MAAdA,EAAqBD,EAAKE,OAAS,GAAKD,EAC9C,WAIL,IAHA,IAAIC,EAAS7B,KAAK8B,IAAIC,UAAUF,OAASD,EAAY,GACjDI,EAAOvD,MAAMoD,GACbI,EAAQ,EACLA,EAAQJ,EAAQI,IACrBD,EAAKC,GAASF,UAAUE,EAAQL,GAElC,OAAQA,GACN,KAAK,EAAG,OAAOD,EAAKrF,KAAK6D,KAAM6B,GAC/B,KAAK,EAAG,OAAOL,EAAKrF,KAAK6D,KAAM4B,UAAU,GAAIC,GAC7C,KAAK,EAAG,OAAOL,EAAKrF,KAAK6D,KAAM4B,UAAU,GAAIA,UAAU,GAAIC,GAE7D,IAAIE,EAAOzD,MAAMmD,EAAa,GAC9B,IAAKK,EAAQ,EAAGA,EAAQL,EAAYK,IAClCC,EAAKD,GAASF,UAAUE,GAG1B,OADAC,EAAKN,GAAcI,EACZL,EAAKQ,MAAMhC,KAAM+B,ICvBb,SAASE,EAASC,GAC/B,IAAIrB,SAAcqB,EAClB,MAAgB,aAATrB,GAAgC,WAATA,KAAuBqB,ECFxC,SAASC,EAAOD,GAC7B,OAAe,OAARA,ECDM,SAASzB,EAAYyB,GAClC,YAAe,IAARA,ECCM,SAASE,EAAUF,GAChC,OAAe,IAARA,IAAwB,IAARA,GAAwC,qBAAvB,IAAS/F,KAAK+F,GCHzC,SAASG,EAAUH,GAChC,SAAUA,GAAwB,IAAjBA,EAAII,UCCR,SAASC,EAAUhG,GAChC,OAAO,SAAS2F,GACd,OAAO,IAAS/F,KAAK+F,KAAS,WAAa3F,EAAO,KCHvC,MAAAgG,EAAU,UCAV,EAAAA,EAAU,UCAV,EAAAA,EAAU,QCAV,EAAAA,EAAU,UCAV,EAAAA,EAAU,SCAV,EAAAA,EAAU,UCAV,EAAAA,EAAU,OCAV,EAAAA,EAAU,WCAV,EAAAA,EAAU,OCAV,EAAAA,EAAU,WCAV,EAAAA,EAAU,eCAV,EAAAA,EAAU,YCGV,OAAiBA,EAAU,SCFtC/B,EAAa+B,EAAU,YAIvBC,EAAW,IAAKC,UAAY,IAAKA,SAASC,WACM,iBAAbC,WAA4C,mBAAZH,IACrEhC,EAAa,SAAS0B,GACpB,MAAqB,mBAAPA,IAAqB,IAIxB,QCXA,SAASU,EAAIV,EAAK3E,GAC/B,OAAc,MAAP2E,GAAe,IAAe/F,KAAK+F,EAAK3E,GCDjD,IAAIsF,EAAcN,EAAU,cAI3B,WACMM,EAAYjB,aACfiB,EAAc,SAASX,GACrB,OAAOU,EAAIV,EAAK,YAHtB,GAQe,QCXA,SAAS,EAASA,GAC/B,OAAQY,EAASZ,IAAQ,YAAUA,KAAS5C,MAAMyD,WAAWb,ICDhD,SAAS,EAAMA,GAC5B,OAAOc,EAASd,IAAQ,YAAOA,GCJlB,SAASe,EAAShG,GAC/B,OAAO,WACL,OAAOA,GCAI,SAASiG,EAAwBC,GAC9C,OAAO,SAASC,GACd,IAAIC,EAAeF,EAAgBC,GACnC,MAA8B,iBAAhBC,GAA4BA,GAAgB,GAAKA,GAAgB,KCLpE,SAASC,EAAgB/F,GACtC,OAAO,SAAS2E,GACd,OAAc,MAAPA,OAAc,EAASA,EAAI3E,ICAvB,MAAA+F,EAAgB,cCEhB,EAAAJ,EAAwB,GCCnCK,EAAoB,8EAQT,UAPf,SAAsBrB,GAGpB,OAAO,IAAgB,YAAaA,KAASsB,EAAWtB,GAC1C,EAAaA,IAAQqB,EAAkBE,KAAK,IAAStH,KAAK+F,KAGtBe,GAAS,GCX9C,EAAAK,EAAgB,UCIhB,EAAAJ,EAAwB,GCgBxB,SAASQ,EAAoBxB,EAAKjD,GAC/CA,EAhBF,SAAqBA,GAEnB,IADA,IAAI0E,EAAO,GACF1H,EAAIgD,EAAKyC,OAAQ1F,EAAI,EAAGA,EAAIC,IAAKD,EAAG2H,EAAK1E,EAAKjD,KAAM,EAC7D,MAAO,CACL4H,SAAU,SAASrG,GAAO,OAAOoG,EAAKpG,IACtCkB,KAAM,SAASlB,GAEb,OADAoG,EAAKpG,IAAO,EACL0B,EAAKR,KAAKlB,KASdsG,CAAY5E,GACnB,IAAI6E,EAAa,IAAmBpC,OAChCqC,EAAc7B,EAAI6B,YAClBC,EAAQ,EAAWD,IAAgBA,EAAYnG,WAAa,IAG5DqG,EAAO,cAGX,IAFIrB,EAAIV,EAAK+B,KAAUhF,EAAK2E,SAASK,IAAOhF,EAAKR,KAAKwF,GAE/CH,MACLG,EAAO,IAAmBH,MACd5B,GAAOA,EAAI+B,KAAUD,EAAMC,KAAUhF,EAAK2E,SAASK,IAC7DhF,EAAKR,KAAKwF,GC7BD,SAAS,EAAK/B,GAC3B,IAAKD,EAASC,GAAM,MAAO,GAC3B,GAAI,IAAY,OAAO,YAAWA,GAClC,IAAIjD,EAAO,GACX,IAAK,IAAI1B,KAAO2E,EAASU,EAAIV,EAAK3E,IAAM0B,EAAKR,KAAKlB,GAGlD,OADI,KAAYmG,EAAoBxB,EAAKjD,GAClCA,ECNM,SAASiF,EAAQhC,GAC9B,OAAW,MAAPA,IAGA,EAAYA,KAASnD,EAAQmD,IAAQiC,EAASjC,IAAQ,EAAYA,IAA6B,IAAfA,EAAIR,OAC5D,IAArB,EAAKQ,GAAKR,QCVJ,SAAS0C,EAAQ1G,EAAQ2G,GACtC,IAAIC,EAAQ,EAAKD,GAAQ3C,EAAS4C,EAAM5C,OACxC,GAAc,MAAVhE,EAAgB,OAAQgE,EAE5B,IADA,IAAIQ,EAAMxF,OAAOgB,GACR1B,EAAI,EAAGA,EAAI0F,EAAQ1F,IAAK,CAC/B,IAAIuB,EAAM+G,EAAMtI,GAChB,GAAIqI,EAAM9G,KAAS2E,EAAI3E,MAAUA,KAAO2E,GAAM,OAAO,EAEvD,OAAO,ECNM,SAAS5B,EAAE4B,GACxB,OAAIA,aAAe5B,EAAU4B,EACvBlC,gBAAgBM,OACtBN,KAAKuE,SAAWrC,GADiB,IAAI5B,EAAE4B,GCEzC,SAASsC,EAAGC,EAAGC,EAAGC,EAAQC,GAGxB,GAAIH,IAAMC,EAAG,OAAa,IAAND,GAAW,EAAIA,GAAM,EAAIC,EAE7C,GAAS,MAALD,GAAkB,MAALC,EAAW,OAAO,EAEnC,GAAID,GAAMA,EAAG,OAAOC,GAAMA,EAE1B,IAAI7D,SAAc4D,EAClB,OAAa,aAAT5D,GAAgC,WAATA,GAAiC,iBAAL6D,IAKzD,SAASG,EAAOJ,EAAGC,EAAGC,EAAQC,GAExBH,aAAanE,IAAGmE,EAAIA,EAAEF,UACtBG,aAAapE,IAAGoE,EAAIA,EAAEH,UAE1B,IAAIO,EAAY,IAAS3I,KAAKsI,GAC9B,GAAIK,IAAc,IAAS3I,KAAKuI,GAAI,OAAO,EAC3C,OAAQI,GAEN,IAAK,kBAEL,IAAK,kBAGH,MAAO,GAAKL,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,OAAO,IAAYK,QAAQ5I,KAAKsI,KAAO,IAAYM,QAAQ5I,KAAKuI,GAClE,IAAK,uBAEH,OAAOG,EAAO,IAAIG,SAASP,GAAI,IAAIO,SAASN,GAAIC,EAAQC,GAC1D,IAAK,oBACH,IAAIK,EAAa,EAAcR,GAC/B,GAAIQ,IAAe,EAAcP,GAC/B,OAAO,EAET,KAAOO,KACL,GAAIR,EAAES,SAASD,KAAgBP,EAAEQ,SAASD,GACxC,OAAO,EAGX,OAAO,EAGX,GAAI,EAAaR,GAEf,OAAOI,EAAO,IAAIG,SAASP,EAAEU,QAAS,IAAIH,SAASN,EAAES,QAASR,EAAQC,GAGxE,IAAIQ,EAA0B,mBAAdN,EAChB,IAAKM,EAAW,CACd,GAAgB,iBAALX,GAA6B,iBAALC,EAAe,OAAO,EAIzD,IAAIW,EAAQZ,EAAEV,YAAauB,EAAQZ,EAAEX,YACrC,GAAIsB,IAAUC,KAAW,EAAWD,IAAUA,aAAiBA,GACtC,EAAWC,IAAUA,aAAiBA,IACvC,gBAAiBb,GAAK,gBAAiBC,EAC7D,OAAO,EASXE,EAASA,GAAU,GACnB,IAAIlD,GAFJiD,EAASA,GAAU,IAECjD,OACpB,KAAOA,KAGL,GAAIiD,EAAOjD,KAAY+C,EAAG,OAAOG,EAAOlD,KAAYgD,EAQtD,GAJAC,EAAOlG,KAAKgG,GACZG,EAAOnG,KAAKiG,GAGRU,EAAW,CAGb,IADA1D,EAAS+C,EAAE/C,UACIgD,EAAEhD,OAAQ,OAAO,EAEhC,KAAOA,KACL,IAAK8C,EAAGC,EAAE/C,GAASgD,EAAEhD,GAASiD,EAAQC,GAAS,OAAO,MAEnD,CAEL,IAAqBrH,EAAjB+G,EAAQ,EAAKG,GAGjB,GAFA/C,EAAS4C,EAAM5C,OAEX,EAAKgD,GAAGhD,SAAWA,EAAQ,OAAO,EACtC,KAAOA,KAGL,GADAnE,EAAM+G,EAAM5C,IACNkB,EAAI8B,EAAGnH,KAAQiH,EAAGC,EAAElH,GAAMmH,EAAEnH,GAAMoH,EAAQC,GAAU,OAAO,EAMrE,OAFAD,EAAOY,MACPX,EAAOW,OACA,EA7GAV,CAAOJ,EAAGC,EAAGC,EAAQC,GAiHf,SAASY,EAAQf,EAAGC,GACjC,OAAOF,EAAGC,EAAGC,GCjIA,SAASe,EAAQvD,GAC9B,IAAKD,EAASC,GAAM,MAAO,GAC3B,IAAIjD,EAAO,GACX,IAAK,IAAI1B,KAAO2E,EAAKjD,EAAKR,KAAKlB,GAG/B,OADI,KAAYmG,EAAoBxB,EAAKjD,GAClCA,ECRM,SAAS,EAAOiD,GAI7B,IAHA,IAAIoC,EAAQ,EAAKpC,GACbR,EAAS4C,EAAM5C,OACfgE,EAASpH,MAAMoD,GACV1F,EAAI,EAAGA,EAAI0F,EAAQ1F,IAC1B0J,EAAO1J,GAAKkG,EAAIoC,EAAMtI,IAExB,OAAO0J,ECNM,SAAS,EAAMxD,GAI5B,IAHA,IAAIoC,EAAQ,EAAKpC,GACbR,EAAS4C,EAAM5C,OACfiE,EAAQrH,MAAMoD,GACT1F,EAAI,EAAGA,EAAI0F,EAAQ1F,IAC1B2J,EAAM3J,GAAK,CAACsI,EAAMtI,GAAIkG,EAAIoC,EAAMtI,KAElC,OAAO2J,ECRM,SAASC,EAAO1D,GAG7B,IAFA,IAAI2D,EAAS,GACTvB,EAAQ,EAAKpC,GACRlG,EAAI,EAAG0F,EAAS4C,EAAM5C,OAAQ1F,EAAI0F,EAAQ1F,IACjD6J,EAAO3D,EAAIoC,EAAMtI,KAAOsI,EAAMtI,GAEhC,OAAO6J,ECNM,SAASC,EAAU5D,GAChC,IAAI6D,EAAQ,GACZ,IAAK,IAAIxI,KAAO2E,EACV,EAAWA,EAAI3E,KAAOwI,EAAMtH,KAAKlB,GAEvC,OAAOwI,EAAMC,OCPA,SAASC,GAAeC,EAAUC,GAC/C,OAAO,SAASjE,GACd,IAAIR,EAASE,UAAUF,OAEvB,GADIyE,IAAUjE,EAAMxF,OAAOwF,IACvBR,EAAS,GAAY,MAAPQ,EAAa,OAAOA,EACtC,IAAK,IAAIJ,EAAQ,EAAGA,EAAQJ,EAAQI,IAIlC,IAHA,IAAIsE,EAASxE,UAAUE,GACnB7C,EAAOiH,EAASE,GAChBnK,EAAIgD,EAAKyC,OACJ1F,EAAI,EAAGA,EAAIC,EAAGD,IAAK,CAC1B,IAAIuB,EAAM0B,EAAKjD,GACVmK,QAAyB,IAAbjE,EAAI3E,KAAiB2E,EAAI3E,GAAO6I,EAAO7I,IAG5D,OAAO2E,GPJX5B,EAAEtC,QAAU,IAGZsC,EAAE1C,UAAUX,MAAQ,WAClB,OAAO+C,KAAKuE,UAKdjE,EAAE1C,UAAUmH,QAAUzE,EAAE1C,UAAUyI,OAAS/F,EAAE1C,UAAUX,MAEvDqD,EAAE1C,UAAUe,SAAW,WACrB,OAAO2H,OAAOtG,KAAKuE,WQnBN,OAAA0B,GAAeR,GCEf,GAAAQ,GAAe,GCFf,GAAAA,GAAeR,GAAS,GCKxB,SAASc,GAAW3I,GACjC,IAAKqE,EAASrE,GAAY,MAAO,GACjC,GAAI,IAAc,OAAO,YAAaA,GACtC,IAAI4I,EAPG,aAQPA,EAAK5I,UAAYA,EACjB,IAAIiI,EAAS,IAAIW,EAEjB,OADAA,EAAK5I,UAAY,KACViI,ECVM,SAASvI,GAAOM,EAAW6I,GACxC,IAAIZ,EAASU,GAAW3I,GAExB,OADI6I,GAAOC,GAAUb,EAAQY,GACtBZ,ECJM,SAASc,GAAMzE,GAC5B,OAAKD,EAASC,GACPnD,EAAQmD,GAAOA,EAAIxD,QAAUkI,GAAO,GAAI1E,GADpBA,ECHd,SAAS2E,GAAI3E,EAAK4E,GAE/B,OADAA,EAAY5E,GACLA,ECEM,SAAS,GAAIA,EAAKtB,GAC/B,IAAK7B,EAAQ6B,GACX,OAAO,EAAKsB,EAAKtB,GAGnB,IADA,IAAIc,EAASd,EAAKc,OACT1F,EAAI,EAAGA,EAAI0F,EAAQ1F,IAAK,CAC/B,IAAIuB,EAAMqD,EAAK5E,GACf,GAAW,MAAPkG,IAAgB,IAAe/F,KAAK+F,EAAK3E,GAC3C,OAAO,EAET2E,EAAMA,EAAI3E,GAEZ,QAASmE,EClBI,SAASqF,GAAS9J,GAC/B,OAAOA,ECGM,SAAS,GAAQoH,GAE9B,OADAA,EAAQqC,GAAU,GAAIrC,GACf,SAASnC,GACd,OAAOkC,EAAQlC,EAAKmC,ICPT,SAAS2C,GAAQ9E,EAAKtB,GAEnC,IADA,IAAIc,EAASd,EAAKc,OACT1F,EAAI,EAAGA,EAAI0F,EAAQ1F,IAAK,CAC/B,GAAW,MAAPkG,EAAa,OACjBA,EAAMA,EAAItB,EAAK5E,IAEjB,OAAO0F,EAASQ,OAAM,ECDT,SAASvE,GAASiD,GAC/B,OAAK7B,EAAQ6B,GAGN,SAASsB,GACd,OAAO8E,GAAQ9E,EAAKtB,IAHb0C,EAAgB1C,GCLZ,SAASqG,GAAWzF,EAAM0F,EAASC,GAChD,QAAgB,IAAZD,EAAoB,OAAO1F,EAC/B,OAAoB,MAAZ2F,EAAmB,EAAIA,GAC7B,KAAK,EAAG,OAAO,SAASlK,GACtB,OAAOuE,EAAKrF,KAAK+K,EAASjK,IAG5B,KAAK,EAAG,OAAO,SAASA,EAAO6E,EAAOsB,GACpC,OAAO5B,EAAKrF,KAAK+K,EAASjK,EAAO6E,EAAOsB,IAE1C,KAAK,EAAG,OAAO,SAASgE,EAAanK,EAAO6E,EAAOsB,GACjD,OAAO5B,EAAKrF,KAAK+K,EAASE,EAAanK,EAAO6E,EAAOsB,IAGzD,OAAO,WACL,OAAO5B,EAAKQ,MAAMkF,EAAStF,YCPhB,SAASyF,GAAapK,EAAOiK,EAASC,GACnD,OAAa,MAATlK,EAAsB8J,GACtB,EAAW9J,GAAegK,GAAWhK,EAAOiK,EAASC,GACrDlF,EAAShF,KAAW8B,EAAQ9B,GAAe,GAAQA,GAChDU,GAASV,GCTH,SAAS,GAASA,EAAOiK,GACtC,OAAOG,GAAapK,EAAOiK,EAASI,KCDvB,SAASC,GAAGtK,EAAOiK,EAASC,GACzC,OAAI7G,EAAEkH,WAAa,GAAiBlH,EAAEkH,SAASvK,EAAOiK,GAC/CG,GAAapK,EAAOiK,EAASC,GCHvB,SAASM,GAAUvF,EAAKsF,EAAUN,GAC/CM,EAAWD,GAAGC,EAAUN,GAIxB,IAHA,IAAI5C,EAAQ,EAAKpC,GACbR,EAAS4C,EAAM5C,OACfgG,EAAU,GACL5F,EAAQ,EAAGA,EAAQJ,EAAQI,IAAS,CAC3C,IAAI6F,EAAarD,EAAMxC,GACvB4F,EAAQC,GAAcH,EAAStF,EAAIyF,GAAaA,EAAYzF,GAE9D,OAAOwF,ECbM,SAASE,MCGT,SAASC,GAAW3F,GACjC,OAAW,MAAPA,EACK,aAEF,SAAStB,GACd,OAAQ7B,EAAQ6B,GAAoBoG,GAAQ9E,EAAKtB,GAAzBsB,EAAItB,ICNjB,SAASkH,GAAMrK,EAAG+J,EAAUN,GACzC,IAAIa,EAAQzJ,MAAMuB,KAAK8B,IAAI,EAAGlE,IAC9B+J,EAAWP,GAAWO,EAAUN,EAAS,GACzC,IAAK,IAAIlL,EAAI,EAAGA,EAAIyB,EAAGzB,IAAK+L,EAAM/L,GAAKwL,EAASxL,GAChD,OAAO+L,ECNM,SAASC,GAAOC,EAAKtG,GAKlC,OAJW,MAAPA,IACFA,EAAMsG,EACNA,EAAM,GAEDA,EAAMpI,KAAKqI,MAAMrI,KAAKmI,UAAYrG,EAAMsG,EAAM,INGvD3H,EAAEkH,SAAW,GORE,OAAAW,KAAA,gBACb,OAAO,IAAIA,MAAOC,WCEL,SAASC,GAAcC,GACpC,IAAIC,EAAU,SAASC,GACrB,OAAOF,EAAIE,IAGTpC,EAAS,MAAQ,EAAKkC,GAAKG,KAAK,KAAO,IACvCC,EAAaC,OAAOvC,GACpBwC,EAAgBD,OAAOvC,EAAQ,KACnC,OAAO,SAASyC,GAEd,OADAA,EAAmB,MAAVA,EAAiB,GAAK,GAAKA,EAC7BH,EAAWjF,KAAKoF,GAAUA,EAAOC,QAAQF,EAAeL,GAAWM,GCb/D,QACb,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,UCHQ,GAAAR,GAAc,ICAd,GAAAA,GCAAzC,EAAO,KCAP,GAAAtF,EAAEyI,iBAAmB,CAClCC,SAAU,kBACVC,YAAa,mBACbC,OAAQ,oBCANC,GAAU,OAIVC,GAAU,CACZ,IAAK,IACL,KAAM,KACN,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAGRC,GAAe,4BAEnB,SAASC,GAAWd,GAClB,MAAO,KAAOY,GAAQZ,GAOT,SAAS,GAASe,EAAMC,EAAUC,IAC1CD,GAAYC,IAAaD,EAAWC,GACzCD,EAAWrD,GAAS,GAAIqD,EAAUlJ,EAAEyI,kBAGpC,IAiCIW,EAjCAC,EAAUhB,OAAO,EAClBa,EAASN,QAAUC,IAAS/C,QAC5BoD,EAASP,aAAeE,IAAS/C,QACjCoD,EAASR,UAAYG,IAAS/C,QAC/BqC,KAAK,KAAO,KAAM,KAGhB3G,EAAQ,EACRsE,EAAS,SACbmD,EAAKT,QAAQa,GAAS,SAASnB,EAAOU,EAAQD,EAAaD,EAAUY,GAanE,OAZAxD,GAAUmD,EAAK7K,MAAMoD,EAAO8H,GAAQd,QAAQO,GAAcC,IAC1DxH,EAAQ8H,EAASpB,EAAM9G,OAEnBwH,EACF9C,GAAU,cAAgB8C,EAAS,iCAC1BD,EACT7C,GAAU,cAAgB6C,EAAc,uBAC/BD,IACT5C,GAAU,OAAS4C,EAAW,YAIzBR,KAETpC,GAAU,OAGLoD,EAASK,WAAUzD,EAAS,mBAAqBA,EAAS,OAE/DA,EAAS,4FAEPA,EAAS,gBAGX,IACEsD,EAAS,IAAItL,SAASoL,EAASK,UAAY,MAAO,IAAKzD,GACvD,MAAOnG,GAEP,MADAA,EAAEmG,OAASA,EACLnG,EAGR,IAAI6J,EAAW,SAASzJ,GACtB,OAAOqJ,EAAOvN,KAAK6D,KAAMK,EAAMC,IAI7ByJ,EAAWP,EAASK,UAAY,MAGpC,OAFAC,EAAS1D,OAAS,YAAc2D,EAAW,OAAS3D,EAAS,IAEtD0D,EC9EM,SAAS,GAAO5H,EAAKtB,EAAMoJ,GACnCjL,EAAQ6B,KAAOA,EAAO,CAACA,IAC5B,IAAIc,EAASd,EAAKc,OAClB,IAAKA,EACH,OAAO,EAAWsI,GAAYA,EAAS7N,KAAK+F,GAAO8H,EAErD,IAAK,IAAIhO,EAAI,EAAGA,EAAI0F,EAAQ1F,IAAK,CAC/B,IAAIiI,EAAc,MAAP/B,OAAc,EAASA,EAAItB,EAAK5E,SAC9B,IAATiI,IACFA,EAAO+F,EACPhO,EAAI0F,GAENQ,EAAM,EAAW+B,GAAQA,EAAK9H,KAAK+F,GAAO+B,EAE5C,OAAO/B,EClBT,IAAI+H,GAAY,EACD,SAASC,GAASC,GAC/B,IAAIzJ,IAAOuJ,GAAY,GACvB,OAAOE,EAASA,EAASzJ,EAAKA,ECFjB,SAAS0J,GAAMlI,GAC5B,IAAImI,EAAW/J,EAAE4B,GAEjB,OADAmI,EAASC,QAAS,EACXD,ECAM,SAASE,GAAaC,EAAYC,EAAWvD,EAASwD,EAAgB3I,GACnF,KAAM2I,aAA0BD,GAAY,OAAOD,EAAWxI,MAAMkF,EAASnF,GAC7E,IAAI7D,EAAOqI,GAAWiE,EAAW5M,WAC7BiI,EAAS2E,EAAWxI,MAAM9D,EAAM6D,GACpC,OAAIE,EAAS4D,GAAgBA,EACtB3H,ECHT,IAAIyM,GAAUpJ,GAAc,SAASC,EAAMoJ,GACzC,IAAIC,EAAcF,GAAQE,YACtBC,EAAQ,WAGV,IAFA,IAAIC,EAAW,EAAGrJ,EAASkJ,EAAUlJ,OACjCK,EAAOzD,MAAMoD,GACR1F,EAAI,EAAGA,EAAI0F,EAAQ1F,IAC1B+F,EAAK/F,GAAK4O,EAAU5O,KAAO6O,EAAcjJ,UAAUmJ,KAAcH,EAAU5O,GAE7E,KAAO+O,EAAWnJ,UAAUF,QAAQK,EAAKtD,KAAKmD,UAAUmJ,MACxD,OAAOR,GAAa/I,EAAMsJ,EAAO9K,KAAMA,KAAM+B,IAE/C,OAAO+I,KAGTH,GAAQE,YAAcvK,EACP,UCjBA,GAAAiB,GAAc,SAASC,EAAM0F,EAASnF,GACnD,IAAK,EAAWP,GAAO,MAAM,IAAIwJ,UAAU,qCAC3C,IAAIF,EAAQvJ,GAAc,SAAS0J,GACjC,OAAOV,GAAa/I,EAAMsJ,EAAO5D,EAASlH,KAAM+B,EAAKmJ,OAAOD,OAE9D,OAAOH,KCLM,SAASK,GAAQC,EAAOC,EAAOC,EAAQC,GAEpD,GADAA,EAASA,GAAU,GACdF,GAAmB,IAAVA,GAEP,GAAIA,GAAS,EAClB,OAAOE,EAAOL,OAAOE,QAFrBC,EAAQ/D,IAKV,IADA,IAAIkE,EAAMD,EAAO7J,OACR1F,EAAI,EAAG0F,EAAS,EAAU0J,GAAQpP,EAAI0F,EAAQ1F,IAAK,CAC1D,IAAIiB,EAAQmO,EAAMpP,GAClB,GAAI,EAAYiB,KAAW8B,EAAQ9B,IAAU,EAAYA,IAEvD,GAAIoO,EAAQ,EACVF,GAAQlO,EAAOoO,EAAQ,EAAGC,EAAQC,GAClCC,EAAMD,EAAO7J,YAGb,IADA,IAAI+J,EAAI,EAAGC,EAAMzO,EAAMyE,OAChB+J,EAAIC,GAAKH,EAAOC,KAASvO,EAAMwO,UAE9BH,IACVC,EAAOC,KAASvO,GAGpB,OAAOsO,ECtBM,OAAAhK,GAAc,SAASW,EAAKjD,GAEzC,IAAI6C,GADJ7C,EAAOkM,GAAQlM,GAAM,GAAO,IACXyC,OACjB,GAAII,EAAQ,EAAG,MAAM,IAAI6J,MAAM,yCAC/B,KAAO7J,KAAS,CACd,IAAIvE,EAAM0B,EAAK6C,GACfI,EAAI3E,GAAOC,GAAK0E,EAAI3E,GAAM2E,GAE5B,OAAOA,KCZM,SAAS,GAAQV,EAAMoK,GACpC,IAAIC,EAAU,SAAStO,GACrB,IAAIuO,EAAQD,EAAQC,MAChBC,EAAU,IAAMH,EAASA,EAAO5J,MAAMhC,KAAM4B,WAAarE,GAE7D,OADKqF,EAAIkJ,EAAOC,KAAUD,EAAMC,GAAWvK,EAAKQ,MAAMhC,KAAM4B,YACrDkK,EAAMC,IAGf,OADAF,EAAQC,MAAQ,GACTD,ECPM,OAAAtK,GAAc,SAASC,EAAMwK,EAAMjK,GAChD,OAAOkK,YAAW,WAChB,OAAOzK,EAAKQ,MAAM,KAAMD,KACvBiK,MCDU,MAAQE,GAAO5L,EAAG,GCClB,SAAS6L,GAAS3K,EAAMwK,EAAMI,GAC3C,IAAIC,EAASnF,EAASnF,EAAM8D,EACxByG,EAAW,EACVF,IAASA,EAAU,IAExB,IAAIG,EAAQ,WACVD,GAA+B,IAApBF,EAAQI,QAAoB,EAAIC,KAC3CJ,EAAU,KACVxG,EAASrE,EAAKQ,MAAMkF,EAASnF,GACxBsK,IAASnF,EAAUnF,EAAO,OAG7B2K,EAAY,WACd,IAAIC,EAAOF,KACNH,IAAgC,IAApBF,EAAQI,UAAmBF,EAAWK,GACvD,IAAIC,EAAYZ,GAAQW,EAAOL,GAc/B,OAbApF,EAAUlH,KACV+B,EAAOH,UACHgL,GAAa,GAAKA,EAAYZ,GAC5BK,IACFQ,aAAaR,GACbA,EAAU,MAEZC,EAAWK,EACX9G,EAASrE,EAAKQ,MAAMkF,EAASnF,GACxBsK,IAASnF,EAAUnF,EAAO,OACrBsK,IAAgC,IAArBD,EAAQU,WAC7BT,EAAUJ,WAAWM,EAAOK,IAEvB/G,GAST,OANA6G,EAAUK,OAAS,WACjBF,aAAaR,GACbC,EAAW,EACXD,EAAUnF,EAAUnF,EAAO,MAGtB2K,ECtCM,SAASM,GAASxL,EAAMwK,EAAMiB,GAC3C,IAAIZ,EAASxG,EAET0G,EAAQ,SAASrF,EAASnF,GAC5BsK,EAAU,KACNtK,IAAM8D,EAASrE,EAAKQ,MAAMkF,EAASnF,KAGrCmL,EAAY3L,GAAc,SAASQ,GAErC,GADIsK,GAASQ,aAAaR,GACtBY,EAAW,CACb,IAAIE,GAAWd,EACfA,EAAUJ,WAAWM,EAAOP,GACxBmB,IAAStH,EAASrE,EAAKQ,MAAMhC,KAAM+B,SAEvCsK,EAAUH,GAAMK,EAAOP,EAAMhM,KAAM+B,GAGrC,OAAO8D,KAQT,OALAqH,EAAUH,OAAS,WACjBF,aAAaR,GACbA,EAAU,MAGLa,EC5BM,SAASE,GAAK5L,EAAM6L,GACjC,OAAO,GAAQA,EAAS7L,GCLX,SAAS8L,GAAOC,GAC7B,OAAO,WACL,OAAQA,EAAUvL,MAAMhC,KAAM4B,YCDnB,SAAS4L,KACtB,IAAIzL,EAAOH,UACP6L,EAAQ1L,EAAKL,OAAS,EAC1B,OAAO,WAGL,IAFA,IAAI1F,EAAIyR,EACJ5H,EAAS9D,EAAK0L,GAAOzL,MAAMhC,KAAM4B,WAC9B5F,KAAK6J,EAAS9D,EAAK/F,GAAGG,KAAK6D,KAAM6F,GACxC,OAAOA,GCRI,SAAS6H,GAAM5F,EAAOtG,GACnC,OAAO,WACL,KAAMsG,EAAQ,EACZ,OAAOtG,EAAKQ,MAAMhC,KAAM4B,YCFf,SAAS+L,GAAO7F,EAAOtG,GACpC,IAAIoM,EACJ,OAAO,WAKL,QAJM9F,EAAQ,IACZ8F,EAAOpM,EAAKQ,MAAMhC,KAAM4B,YAEtBkG,GAAS,IAAGtG,EAAO,MAChBoM,GCJI,UAAQD,GAAQ,GCDhB,SAASE,GAAQ3L,EAAKqL,EAAWrG,GAC9CqG,EAAYhG,GAAGgG,EAAWrG,GAE1B,IADA,IAAuB3J,EAAnB+G,EAAQ,EAAKpC,GACRlG,EAAI,EAAG0F,EAAS4C,EAAM5C,OAAQ1F,EAAI0F,EAAQ1F,IAEjD,GAAIuR,EAAUrL,EADd3E,EAAM+G,EAAMtI,IACYuB,EAAK2E,GAAM,OAAO3E,ECL/B,SAASuQ,GAA2BC,GACjD,OAAO,SAASC,EAAOT,EAAWrG,GAChCqG,EAAYhG,GAAGgG,EAAWrG,GAG1B,IAFA,IAAIxF,EAAS,EAAUsM,GACnBlM,EAAQiM,EAAM,EAAI,EAAIrM,EAAS,EAC5BI,GAAS,GAAKA,EAAQJ,EAAQI,GAASiM,EAC5C,GAAIR,EAAUS,EAAMlM,GAAQA,EAAOkM,GAAQ,OAAOlM,EAEpD,OAAQ,GCTG,OAAAgM,GAA2B,GCA3B,GAAAA,IAA4B,GCE5B,SAAS,GAAYE,EAAO9L,EAAKsF,EAAUN,GAIxD,IAFA,IAAIjK,GADJuK,EAAWD,GAAGC,EAAUN,EAAS,IACZhF,GACjB+L,EAAM,EAAGC,EAAO,EAAUF,GACvBC,EAAMC,GAAM,CACjB,IAAIC,EAAMtO,KAAKqI,OAAO+F,EAAMC,GAAQ,GAChC1G,EAASwG,EAAMG,IAAQlR,EAAOgR,EAAME,EAAM,EAAQD,EAAOC,EAE/D,OAAOF,ECRM,SAASG,GAAkBL,EAAKM,EAAeC,GAC5D,OAAO,SAASN,EAAOO,EAAM/C,GAC3B,IAAIxP,EAAI,EAAG0F,EAAS,EAAUsM,GAC9B,GAAkB,iBAAPxC,EACLuC,EAAM,EACR/R,EAAIwP,GAAO,EAAIA,EAAM3L,KAAK8B,IAAI6J,EAAM9J,EAAQ1F,GAE5C0F,EAAS8J,GAAO,EAAI3L,KAAKoI,IAAIuD,EAAM,EAAG9J,GAAU8J,EAAM9J,EAAS,OAE5D,GAAI4M,GAAe9C,GAAO9J,EAE/B,OAAOsM,EADPxC,EAAM8C,EAAYN,EAAOO,MACHA,EAAO/C,GAAO,EAEtC,GAAI+C,GAASA,EAEX,OADA/C,EAAM6C,EAAc,IAAMlS,KAAK6R,EAAOhS,EAAG0F,GAAS,KACpC,EAAI8J,EAAMxP,GAAK,EAE/B,IAAKwP,EAAMuC,EAAM,EAAI/R,EAAI0F,EAAS,EAAG8J,GAAO,GAAKA,EAAM9J,EAAQ8J,GAAOuC,EACpE,GAAIC,EAAMxC,KAAS+C,EAAM,OAAO/C,EAElC,OAAQ,GCjBG,OAAA4C,GAAkB,EAAGI,GAAW,ICHhC,GAAAJ,IAAmB,EAAGK,ICAtB,SAASC,GAAKxM,EAAKqL,EAAWrG,GAC3C,IACI3J,GADY,EAAY2E,GAAOsM,GAAYX,IAC3B3L,EAAKqL,EAAWrG,GACpC,QAAY,IAAR3J,IAA2B,IAATA,EAAY,OAAO2E,EAAI3E,GCHhC,SAASoR,GAAUzM,EAAKmC,GACrC,OAAOqK,GAAKxM,EAAK,GAAQmC,ICEZ,SAAS9D,GAAK2B,EAAKsF,EAAUN,GAE1C,IAAIlL,EAAG0F,EACP,GAFA8F,EAAWP,GAAWO,EAAUN,GAE5B,EAAYhF,GACd,IAAKlG,EAAI,EAAG0F,EAASQ,EAAIR,OAAQ1F,EAAI0F,EAAQ1F,IAC3CwL,EAAStF,EAAIlG,GAAIA,EAAGkG,OAEjB,CACL,IAAIoC,EAAQ,EAAKpC,GACjB,IAAKlG,EAAI,EAAG0F,EAAS4C,EAAM5C,OAAQ1F,EAAI0F,EAAQ1F,IAC7CwL,EAAStF,EAAIoC,EAAMtI,IAAKsI,EAAMtI,GAAIkG,GAGtC,OAAOA,EChBM,SAAS,GAAIA,EAAKsF,EAAUN,GACzCM,EAAWD,GAAGC,EAAUN,GAIxB,IAHA,IAAI5C,GAAS,EAAYpC,IAAQ,EAAKA,GAClCR,GAAU4C,GAASpC,GAAKR,OACxBgG,EAAUpJ,MAAMoD,GACXI,EAAQ,EAAGA,EAAQJ,EAAQI,IAAS,CAC3C,IAAI6F,EAAarD,EAAQA,EAAMxC,GAASA,EACxC4F,EAAQ5F,GAAS0F,EAAStF,EAAIyF,GAAaA,EAAYzF,GAEzD,OAAOwF,ECTM,SAASkH,GAAab,GAGnC,IAAIc,EAAU,SAAS3M,EAAKsF,EAAUoG,EAAMkB,GAC1C,IAAIxK,GAAS,EAAYpC,IAAQ,EAAKA,GAClCR,GAAU4C,GAASpC,GAAKR,OACxBI,EAAQiM,EAAM,EAAI,EAAIrM,EAAS,EAKnC,IAJKoN,IACHlB,EAAO1L,EAAIoC,EAAQA,EAAMxC,GAASA,GAClCA,GAASiM,GAEJjM,GAAS,GAAKA,EAAQJ,EAAQI,GAASiM,EAAK,CACjD,IAAIpG,EAAarD,EAAQA,EAAMxC,GAASA,EACxC8L,EAAOpG,EAASoG,EAAM1L,EAAIyF,GAAaA,EAAYzF,GAErD,OAAO0L,GAGT,OAAO,SAAS1L,EAAKsF,EAAUoG,EAAM1G,GACnC,IAAI4H,EAAUlN,UAAUF,QAAU,EAClC,OAAOmN,EAAQ3M,EAAK+E,GAAWO,EAAUN,EAAS,GAAI0G,EAAMkB,ICrBjD,OAAAF,GAAa,GCDb,GAAAA,IAAc,GCCd,SAASG,GAAO7M,EAAKqL,EAAWrG,GAC7C,IAAIQ,EAAU,GAKd,OAJA6F,EAAYhG,GAAGgG,EAAWrG,GAC1B3G,GAAK2B,GAAK,SAASjF,EAAO6E,EAAOkN,GAC3BzB,EAAUtQ,EAAO6E,EAAOkN,IAAOtH,EAAQjJ,KAAKxB,MAE3CyK,ECLM,SAASuH,GAAO/M,EAAKqL,EAAWrG,GAC7C,OAAO6H,GAAO7M,EAAKoL,GAAO/F,GAAGgG,IAAarG,GCD7B,SAASgI,GAAMhN,EAAKqL,EAAWrG,GAC5CqG,EAAYhG,GAAGgG,EAAWrG,GAG1B,IAFA,IAAI5C,GAAS,EAAYpC,IAAQ,EAAKA,GAClCR,GAAU4C,GAASpC,GAAKR,OACnBI,EAAQ,EAAGA,EAAQJ,EAAQI,IAAS,CAC3C,IAAI6F,EAAarD,EAAQA,EAAMxC,GAASA,EACxC,IAAKyL,EAAUrL,EAAIyF,GAAaA,EAAYzF,GAAM,OAAO,EAE3D,OAAO,ECRM,SAASiN,GAAKjN,EAAKqL,EAAWrG,GAC3CqG,EAAYhG,GAAGgG,EAAWrG,GAG1B,IAFA,IAAI5C,GAAS,EAAYpC,IAAQ,EAAKA,GAClCR,GAAU4C,GAASpC,GAAKR,OACnBI,EAAQ,EAAGA,EAAQJ,EAAQI,IAAS,CAC3C,IAAI6F,EAAarD,EAAQA,EAAMxC,GAASA,EACxC,GAAIyL,EAAUrL,EAAIyF,GAAaA,EAAYzF,GAAM,OAAO,EAE1D,OAAO,ECRM,SAAS0B,GAAS1B,EAAKqM,EAAMa,EAAWC,GAGrD,OAFK,EAAYnN,KAAMA,EAAM,EAAOA,KACZ,iBAAbkN,GAAyBC,KAAOD,EAAY,GAChDE,GAAQpN,EAAKqM,EAAMa,IAAc,ECD3B,OAAA7N,GAAc,SAASW,EAAKtB,EAAMmB,GAC/C,IAAIwN,EAAa/N,EAOjB,OANI,EAAWZ,GACbY,EAAOZ,EACE7B,EAAQ6B,KACjB2O,EAAc3O,EAAKlC,MAAM,GAAI,GAC7BkC,EAAOA,EAAKA,EAAKc,OAAS,IAErB,GAAIQ,GAAK,SAASgF,GACvB,IAAIsI,EAAShO,EACb,IAAKgO,EAAQ,CAIX,GAHID,GAAeA,EAAY7N,SAC7BwF,EAAUF,GAAQE,EAASqI,IAEd,MAAXrI,EAAiB,OACrBsI,EAAStI,EAAQtG,GAEnB,OAAiB,MAAV4O,EAAiBA,EAASA,EAAOxN,MAAMkF,EAASnF,SCpB5C,SAAS0N,GAAMvN,EAAK3E,GACjC,OAAO,GAAI2E,EAAKvE,GAASJ,ICAZ,SAASmS,GAAMxN,EAAKmC,GACjC,OAAO0K,GAAO7M,EAAK,GAAQmC,ICAd,SAAS1C,GAAIO,EAAKsF,EAAUN,GACzC,IACIjK,EAAO0S,EADP9J,GAAUyB,IAAUsI,GAAgBtI,IAExC,GAAgB,MAAZE,GAAuC,iBAAZA,GAAyC,iBAAVtF,EAAI,IAAyB,MAAPA,EAElF,IAAK,IAAIlG,EAAI,EAAG0F,GADhBQ,EAAM,EAAYA,GAAOA,EAAM,EAAOA,IACTR,OAAQ1F,EAAI0F,EAAQ1F,IAElC,OADbiB,EAAQiF,EAAIlG,KACSiB,EAAQ4I,IAC3BA,EAAS5I,QAIbuK,EAAWD,GAAGC,EAAUN,GACxB3G,GAAK2B,GAAK,SAAS2N,EAAG/N,EAAOkN,KAC3BW,EAAWnI,EAASqI,EAAG/N,EAAOkN,IACfY,GAAgBD,KAAcrI,KAAYzB,KAAYyB,OACnEzB,EAASgK,EACTD,EAAeD,MAIrB,OAAO9J,ECrBM,SAASoC,GAAI/F,EAAKsF,EAAUN,GACzC,IACIjK,EAAO0S,EADP9J,EAASyB,IAAUsI,EAAetI,IAEtC,GAAgB,MAAZE,GAAuC,iBAAZA,GAAyC,iBAAVtF,EAAI,IAAyB,MAAPA,EAElF,IAAK,IAAIlG,EAAI,EAAG0F,GADhBQ,EAAM,EAAYA,GAAOA,EAAM,EAAOA,IACTR,OAAQ1F,EAAI0F,EAAQ1F,IAElC,OADbiB,EAAQiF,EAAIlG,KACSiB,EAAQ4I,IAC3BA,EAAS5I,QAIbuK,EAAWD,GAAGC,EAAUN,GACxB3G,GAAK2B,GAAK,SAAS2N,EAAG/N,EAAOkN,KAC3BW,EAAWnI,EAASqI,EAAG/N,EAAOkN,IACfY,GAAgBD,IAAarI,KAAYzB,IAAWyB,OACjEzB,EAASgK,EACTD,EAAeD,MAIrB,OAAO9J,ECjBM,SAAS,GAAO3D,EAAKzE,EAAG4R,GACrC,GAAS,MAAL5R,GAAa4R,EAEf,OADK,EAAYnN,KAAMA,EAAM,EAAOA,IAC7BA,EAAI8F,GAAO9F,EAAIR,OAAS,IAEjC,IAAIoO,EAAS,EAAY5N,GAAOyE,GAAMzE,GAAO,EAAOA,GAChDR,EAAS,EAAUoO,GACvBrS,EAAIoC,KAAK8B,IAAI9B,KAAKoI,IAAIxK,EAAGiE,GAAS,GAElC,IADA,IAAIqO,EAAOrO,EAAS,EACXI,EAAQ,EAAGA,EAAQrE,EAAGqE,IAAS,CACtC,IAAIkO,EAAOhI,GAAOlG,EAAOiO,GACrBE,EAAOH,EAAOhO,GAClBgO,EAAOhO,GAASgO,EAAOE,GACvBF,EAAOE,GAAQC,EAEjB,OAAOH,EAAOpR,MAAM,EAAGjB,GCtBV,SAASyS,GAAQhO,GAC9B,OAAO,GAAOA,EAAKoF,KCCN,SAAS6I,GAAOjO,EAAKsF,EAAUN,GAC5C,IAAIpF,EAAQ,EAEZ,OADA0F,EAAWD,GAAGC,EAAUN,GACjBuI,GAAM,GAAIvN,GAAK,SAASjF,EAAOM,EAAKyR,GACzC,MAAO,CACL/R,MAAOA,EACP6E,MAAOA,IACPsO,SAAU5I,EAASvK,EAAOM,EAAKyR,OAEhChJ,MAAK,SAASqK,EAAMC,GACrB,IAAI7L,EAAI4L,EAAKD,SACT1L,EAAI4L,EAAMF,SACd,GAAI3L,IAAMC,EAAG,CACX,GAAID,EAAIC,QAAW,IAAND,EAAc,OAAO,EAClC,GAAIA,EAAIC,QAAW,IAANA,EAAc,OAAQ,EAErC,OAAO2L,EAAKvO,MAAQwO,EAAMxO,SACxB,SClBS,SAASyO,GAAMC,EAAUC,GACtC,OAAO,SAASvO,EAAKsF,EAAUN,GAC7B,IAAIrB,EAAS4K,EAAY,CAAC,GAAI,IAAM,GAMpC,OALAjJ,EAAWD,GAAGC,EAAUN,GACxB3G,GAAK2B,GAAK,SAASjF,EAAO6E,GACxB,IAAIvE,EAAMiK,EAASvK,EAAO6E,EAAOI,GACjCsO,EAAS3K,EAAQ5I,EAAOM,MAEnBsI,GCPI,OAAA0K,IAAM,SAAS1K,EAAQ5I,EAAOM,GACvCqF,EAAIiD,EAAQtI,GAAMsI,EAAOtI,GAAKkB,KAAKxB,GAAa4I,EAAOtI,GAAO,CAACN,MCFtD,GAAAsT,IAAM,SAAS1K,EAAQ5I,EAAOM,GAC3CsI,EAAOtI,GAAON,KCCD,GAAAsT,IAAM,SAAS1K,EAAQ5I,EAAOM,GACvCqF,EAAIiD,EAAQtI,GAAMsI,EAAOtI,KAAasI,EAAOtI,GAAO,KCH3C,GAAAgT,IAAM,SAAS1K,EAAQ5I,EAAOyT,GAC3C7K,EAAO6K,EAAO,EAAI,GAAGjS,KAAKxB,MACzB,GCGC0T,GAAc,mEACH,SAASC,GAAQ1O,GAC9B,OAAKA,EACDnD,EAAQmD,GAAa,IAAM/F,KAAK+F,GAChCiC,EAASjC,GAEJA,EAAIsG,MAAMmI,IAEf,EAAYzO,GAAa,GAAIA,EAAK6E,IAC/B,EAAO7E,GAPG,GCPJ,SAAS2O,GAAK3O,GAC3B,OAAW,MAAPA,EAAoB,EACjB,EAAYA,GAAOA,EAAIR,OAAS,EAAKQ,GAAKR,OCJpC,SAASoP,GAAS7T,EAAOM,EAAK2E,GAC3C,OAAO3E,KAAO2E,ECKD,OAAAX,GAAc,SAASW,EAAKjD,GACzC,IAAI4G,EAAS,GAAI2B,EAAWvI,EAAK,GACjC,GAAW,MAAPiD,EAAa,OAAO2D,EACpB,EAAW2B,IACTvI,EAAKyC,OAAS,IAAG8F,EAAWP,GAAWO,EAAUvI,EAAK,KAC1DA,EAAOwG,EAAQvD,KAEfsF,EAAWsJ,GACX7R,EAAOkM,GAAQlM,GAAM,GAAO,GAC5BiD,EAAMxF,OAAOwF,IAEf,IAAK,IAAIlG,EAAI,EAAG0F,EAASzC,EAAKyC,OAAQ1F,EAAI0F,EAAQ1F,IAAK,CACrD,IAAIuB,EAAM0B,EAAKjD,GACXiB,EAAQiF,EAAI3E,GACZiK,EAASvK,EAAOM,EAAK2E,KAAM2D,EAAOtI,GAAON,GAE/C,OAAO4I,KCfM,GAAAtE,GAAc,SAASW,EAAKjD,GACzC,IAAwBiI,EAApBM,EAAWvI,EAAK,GAUpB,OATI,EAAWuI,IACbA,EAAW8F,GAAO9F,GACdvI,EAAKyC,OAAS,IAAGwF,EAAUjI,EAAK,MAEpCA,EAAO,GAAIkM,GAAQlM,GAAM,GAAO,GAAQqH,QACxCkB,EAAW,SAASvK,EAAOM,GACzB,OAAQqG,GAAS3E,EAAM1B,KAGpBwT,GAAK7O,EAAKsF,EAAUN,MCfd,SAAS,GAAQ8G,EAAOvQ,EAAG4R,GACxC,OAAO,IAAMlT,KAAK6R,EAAO,EAAGnO,KAAK8B,IAAI,EAAGqM,EAAMtM,QAAe,MAALjE,GAAa4R,EAAQ,EAAI5R,KCFpE,SAASuT,GAAMhD,EAAOvQ,EAAG4R,GACtC,OAAa,MAATrB,GAAiBA,EAAMtM,OAAS,EAAe,MAALjE,GAAa4R,OAAQ,EAAS,GACnE,MAAL5R,GAAa4R,EAAcrB,EAAM,GAC9B,GAAQA,EAAOA,EAAMtM,OAASjE,GCFxB,SAAS,GAAKuQ,EAAOvQ,EAAG4R,GACrC,OAAO,IAAMlT,KAAK6R,EAAY,MAALvQ,GAAa4R,EAAQ,EAAI5R,GCFrC,SAAS,GAAKuQ,EAAOvQ,EAAG4R,GACrC,OAAa,MAATrB,GAAiBA,EAAMtM,OAAS,EAAe,MAALjE,GAAa4R,OAAQ,EAAS,GACnE,MAAL5R,GAAa4R,EAAcrB,EAAMA,EAAMtM,OAAS,GAC7C,GAAKsM,EAAOnO,KAAK8B,IAAI,EAAGqM,EAAMtM,OAASjE,ICJjC,SAASwT,GAAQjD,GAC9B,OAAOe,GAAOf,EAAOkD,SCAR,SAAS,GAAQlD,EAAO3C,GACrC,OAAO,GAAS2C,EAAO3C,GAAO,GCEjB,OAAA9J,GAAc,SAASyM,EAAOnM,GAE3C,OADAA,EAAOsJ,GAAQtJ,GAAM,GAAM,GACpBkN,GAAOf,GAAO,SAAS/Q,GAC5B,OAAQ2G,GAAS/B,EAAM5E,SCNZ,GAAAsE,GAAc,SAASyM,EAAOmD,GAC3C,OAAOC,GAAWpD,EAAOmD,MCKZ,SAASE,GAAKrD,EAAOsD,EAAU9J,EAAUN,GACjD9E,EAAUkP,KACbpK,EAAUM,EACVA,EAAW8J,EACXA,GAAW,GAEG,MAAZ9J,IAAkBA,EAAWD,GAAGC,EAAUN,IAG9C,IAFA,IAAIrB,EAAS,GACT0L,EAAO,GACFvV,EAAI,EAAG0F,EAAS,EAAUsM,GAAQhS,EAAI0F,EAAQ1F,IAAK,CAC1D,IAAIiB,EAAQ+Q,EAAMhS,GACd2T,EAAWnI,EAAWA,EAASvK,EAAOjB,EAAGgS,GAAS/Q,EAClDqU,IAAa9J,GACVxL,GAAKuV,IAAS5B,GAAU9J,EAAOpH,KAAKxB,GACzCsU,EAAO5B,GACEnI,EACJ5D,GAAS2N,EAAM5B,KAClB4B,EAAK9S,KAAKkR,GACV9J,EAAOpH,KAAKxB,IAEJ2G,GAASiC,EAAQ5I,IAC3B4I,EAAOpH,KAAKxB,GAGhB,OAAO4I,EC5BM,OAAAtE,GAAc,SAASiQ,GACpC,OAAOH,GAAKlG,GAAQqG,GAAQ,GAAM,OCFrB,SAASC,GAAazD,GAGnC,IAFA,IAAInI,EAAS,GACT6L,EAAa9P,UAAUF,OAClB1F,EAAI,EAAG0F,EAAS,EAAUsM,GAAQhS,EAAI0F,EAAQ1F,IAAK,CAC1D,IAAIuS,EAAOP,EAAMhS,GACjB,IAAI4H,GAASiC,EAAQ0I,GAArB,CACA,IAAI9C,EACJ,IAAKA,EAAI,EAAGA,EAAIiG,GACT9N,GAAShC,UAAU6J,GAAI8C,GADF9C,KAGxBA,IAAMiG,GAAY7L,EAAOpH,KAAK8P,IAEpC,OAAO1I,ECXM,SAAS8L,GAAM3D,GAI5B,IAHA,IAAItM,EAASsM,GAASrM,GAAIqM,EAAO,GAAWtM,QAAU,EAClDmE,EAASvH,MAAMoD,GAEVI,EAAQ,EAAGA,EAAQJ,EAAQI,IAClC+D,EAAO/D,GAAS2N,GAAMzB,EAAOlM,GAE/B,OAAO+D,ECRM,OAAAtE,EAAcoQ,ICAd,SAAS,GAAO3C,EAAMtJ,GAEnC,IADA,IAAIG,EAAS,GACJ7J,EAAI,EAAG0F,EAAS,EAAUsN,GAAOhT,EAAI0F,EAAQ1F,IAChD0J,EACFG,EAAOmJ,EAAKhT,IAAM0J,EAAO1J,GAEzB6J,EAAOmJ,EAAKhT,GAAG,IAAMgT,EAAKhT,GAAG,GAGjC,OAAO6J,ECXM,SAAS+L,GAAMnE,EAAOoE,EAAMC,GAC7B,MAARD,IACFA,EAAOpE,GAAS,EAChBA,EAAQ,GAELqE,IACHA,EAAOD,EAAOpE,GAAS,EAAI,GAM7B,IAHA,IAAI/L,EAAS7B,KAAK8B,IAAI9B,KAAKkS,MAAMF,EAAOpE,GAASqE,GAAO,GACpDF,EAAQtT,MAAMoD,GAET8J,EAAM,EAAGA,EAAM9J,EAAQ8J,IAAOiC,GAASqE,EAC9CF,EAAMpG,GAAOiC,EAGf,OAAOmE,ECfM,SAASI,GAAMhE,EAAOiE,GACnC,GAAa,MAATA,GAAiBA,EAAQ,EAAG,MAAO,GAGvC,IAFA,IAAIpM,EAAS,GACT7J,EAAI,EAAG0F,EAASsM,EAAMtM,OACnB1F,EAAI0F,GACTmE,EAAOpH,KAAK,IAAMtC,KAAK6R,EAAOhS,EAAGA,GAAKiW,IAExC,OAAOpM,ECRM,SAASqM,GAAY7H,EAAUnI,GAC5C,OAAOmI,EAASC,OAAShK,EAAE4B,GAAKkI,QAAUlI,ECG7B,SAASiQ,GAAMjQ,GAS5B,OARA3B,GAAKuF,EAAU5D,IAAM,SAAS3F,GAC5B,IAAIiF,EAAOlB,EAAE/D,GAAQ2F,EAAI3F,GACzB+D,EAAE1C,UAAUrB,GAAQ,WAClB,IAAIwF,EAAO,CAAC/B,KAAKuE,UAEjB,OADA,IAAKvC,MAAMD,EAAMH,WACVsQ,GAAYlS,KAAMwB,EAAKQ,MAAM1B,EAAGyB,QAGpCzB,ECVTC,GAAK,CAAC,MAAO,OAAQ,UAAW,QAAS,OAAQ,SAAU,YAAY,SAAShE,GAC9E,IAAIiT,EAAS,IAAWjT,GACxB+D,EAAE1C,UAAUrB,GAAQ,WAClB,IAAI2F,EAAMlC,KAAKuE,SAOf,OANW,MAAPrC,IACFsN,EAAOxN,MAAME,EAAKN,WACJ,UAATrF,GAA6B,WAATA,GAAqC,IAAf2F,EAAIR,eAC1CQ,EAAI,IAGRgQ,GAAYlS,KAAMkC,OAK7B3B,GAAK,CAAC,SAAU,OAAQ,UAAU,SAAShE,GACzC,IAAIiT,EAAS,IAAWjT,GACxB+D,EAAE1C,UAAUrB,GAAQ,WAClB,IAAI2F,EAAMlC,KAAKuE,SAEf,OADW,MAAPrC,IAAaA,EAAMsN,EAAOxN,MAAME,EAAKN,YAClCsQ,GAAYlS,KAAMkC,OAId,SCRX,GAAIiQ,GAAM,GAEd,GAAE7R,EAAI,GAES","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 = 673);\n","// Current version.\nexport var VERSION = '1.11.0';\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.\nexport var 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:\nexport var ArrayProto = Array.prototype, ObjProto = Object.prototype;\nexport var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;\n\n// Create quick reference variables for speed access to core prototypes.\nexport var push = ArrayProto.push,\n slice = ArrayProto.slice,\n toString = ObjProto.toString,\n hasOwnProperty = ObjProto.hasOwnProperty;\n\n// Modern feature detection.\nexport var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined';\n\n// All **ECMAScript 5+** native function implementations that we hope to use\n// are declared here.\nexport var nativeIsArray = Array.isArray,\n nativeKeys = Object.keys,\n nativeCreate = Object.create,\n nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;\n\n// Create references to these builtin functions because we override them.\nexport var _isNaN = isNaN,\n _isFinite = isFinite;\n\n// Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\nexport var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\nexport var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\n// The largest integer that can be represented exactly.\nexport var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\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","/* 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","// 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 functions\n// argument length (or an explicit `startIndex`), into an array that becomes\n// the last argument. Similar to ES6s \"rest parameter\".\nexport default 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","// Is a given variable an object?\nexport default function isObject(obj) {\n var type = typeof obj;\n return type === 'function' || type === 'object' && !!obj;\n}\n","// Is a given value equal to null?\nexport default function isNull(obj) {\n return obj === null;\n}\n","// Is a given variable undefined?\nexport default function isUndefined(obj) {\n return obj === void 0;\n}\n","import { toString } from './_setup.js';\n\n// Is a given value a boolean?\nexport default function isBoolean(obj) {\n return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n}\n","// Is a given value a DOM element?\nexport default function isElement(obj) {\n return !!(obj && obj.nodeType === 1);\n}\n","import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n return function(obj) {\n return toString.call(obj) === '[object ' + name + ']';\n };\n}\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('String');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Number');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Date');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('RegExp');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Error');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Symbol');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Map');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('WeakMap');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('Set');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('WeakSet');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('ArrayBuffer');\n","import tagTester from './_tagTester.js';\n\nexport default tagTester('DataView');\n","import { nativeIsArray } from './_setup.js';\nimport tagTester from './_tagTester.js';\n\n// Is a given value an array?\n// Delegates to ECMA5's native `Array.isArray`.\nexport default nativeIsArray || tagTester('Array');\n","import tagTester from './_tagTester.js';\nimport { root } from './_setup.js';\n\nvar isFunction = tagTester('Function');\n\n// Optimize `isFunction` if appropriate. Work around some `typeof` bugs in old\n// v8, 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\nexport default isFunction;\n","import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n}\n","import tagTester from './_tagTester.js';\nimport has from './_has.js';\n\nvar isArguments = tagTester('Arguments');\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\nexport default isArguments;\n","import { _isFinite } from './_setup.js';\nimport isSymbol from './isSymbol.js';\n\n// Is a given object a finite number?\nexport default function isFinite(obj) {\n return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));\n}\n","import { _isNaN } from './_setup.js';\nimport isNumber from './isNumber.js';\n\n// Is the given value `NaN`?\nexport default function isNaN(obj) {\n return isNumber(obj) && _isNaN(obj);\n}\n","// Predicate-generating function. Often useful outside of Underscore.\nexport default function constant(value) {\n return function() {\n return value;\n };\n}\n","import { MAX_ARRAY_INDEX } from './_setup.js';\n\n// Common internal logic for `isArrayLike` and `isBufferLike`.\nexport default function createSizePropertyCheck(getSizeProperty) {\n return function(collection) {\n var sizeProperty = getSizeProperty(collection);\n return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= MAX_ARRAY_INDEX;\n }\n}\n","// Internal helper to generate a function to obtain property `key` from `obj`.\nexport default function shallowProperty(key) {\n return function(obj) {\n return obj == null ? void 0 : obj[key];\n };\n}\n","import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n","import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n","import { supportsArrayBuffer, nativeIsView, toString } from './_setup.js';\nimport isDataView from './isDataView.js';\nimport constant from './constant.js';\nimport isBufferLike from './_isBufferLike.js';\n\n// Is a given value a typed array?\nvar typedArrayPattern = /\\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\\]/;\nfunction isTypedArray(obj) {\n // `ArrayBuffer.isView` is the most future-proof, so use it when available.\n // Otherwise, fall back on the above regular expression.\n return nativeIsView ? (nativeIsView(obj) && !isDataView(obj)) :\n isBufferLike(obj) && typedArrayPattern.test(toString.call(obj));\n}\n\nexport default supportsArrayBuffer ? isTypedArray : constant(false);\n","import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n","import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getLength from './_getLength.js';\n\n// Internal 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\nexport default createSizePropertyCheck(getLength);\n","import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n var hash = {};\n for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n return {\n contains: function(key) { return hash[key]; },\n push: function(key) {\n hash[key] = true;\n return keys.push(key);\n }\n };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n keys = emulatedSet(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) && !keys.contains(prop)) keys.push(prop);\n\n while (nonEnumIdx--) {\n prop = nonEnumerableProps[nonEnumIdx];\n if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n keys.push(prop);\n }\n }\n}\n","import isObject from './isObject.js';\nimport { nativeKeys, hasEnumBug } from './_setup.js';\nimport has from './_has.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve the names of an object's own properties.\n// Delegates to **ECMAScript 5**'s native `Object.keys`.\nexport default 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","import isArrayLike from './_isArrayLike.js';\nimport isArray from './isArray.js';\nimport isString from './isString.js';\nimport isArguments from './isArguments.js';\nimport keys from './keys.js';\n\n// Is a given array, string, or object empty?\n// An \"empty\" object has no enumerable own-properties.\nexport default function isEmpty(obj) {\n if (obj == null) return true;\n // Skip the more expensive `toString`-based type checks if `obj` has no\n // `.length`.\n if (isArrayLike(obj) && (isArray(obj) || isString(obj) || isArguments(obj))) return obj.length === 0;\n return keys(obj).length === 0;\n}\n","import keys from './keys.js';\n\n// Returns whether an object has a given set of `key:value` pairs.\nexport default 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","import { VERSION } from './_setup.js';\n\n// If Underscore is called as a function, it returns a wrapped object that can\n// be used OO-style. This wrapper holds altered versions of all functions added\n// through `_.mixin`. Wrapped objects may be chained.\nexport default function _(obj) {\n if (obj instanceof _) return obj;\n if (!(this instanceof _)) return new _(obj);\n this._wrapped = obj;\n}\n\n_.VERSION = VERSION;\n\n// Extracts the result from a wrapped and chained object.\n_.prototype.value = function() {\n return this._wrapped;\n};\n\n// Provide unwrapping proxies 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","import _ from './underscore.js';\nimport { toString, SymbolProto } from './_setup.js';\nimport getByteLength from './_getByteLength.js';\nimport isTypedArray from './isTypedArray.js';\nimport isFunction from './isFunction.js';\nimport keys from './keys.js';\nimport has from './_has.js';\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 // These types 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 case '[object ArrayBuffer]':\n // Coerce to `DataView` so we can fall through to the next case.\n return deepEq(new DataView(a), new DataView(b), aStack, bStack);\n case '[object DataView]':\n var byteLength = getByteLength(a);\n if (byteLength !== getByteLength(b)) {\n return false;\n }\n while (byteLength--) {\n if (a.getUint8(byteLength) !== b.getUint8(byteLength)) {\n return false;\n }\n }\n return true;\n }\n\n if (isTypedArray(a)) {\n // Coerce typed arrays to `DataView`.\n return deepEq(new DataView(a.buffer), new DataView(b.buffer), aStack, bStack);\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 default function isEqual(a, b) {\n return eq(a, b);\n}\n","import isObject from './isObject.js';\nimport { hasEnumBug } from './_setup.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve all the enumerable property names of an object.\nexport default 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","import keys from './keys.js';\n\n// Retrieve the values of an object's properties.\nexport default 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","import keys from './keys.js';\n\n// Convert an object into a list of `[key, value]` pairs.\n// The opposite of `_.object` with one argument.\nexport default 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","import keys from './keys.js';\n\n// Invert the keys and values of an object. The values must be serializable.\nexport default 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","import isFunction from './isFunction.js';\n\n// Return a sorted list of the function names available on the object.\nexport default 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}\n","// An internal function for creating assigner functions.\nexport default function 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","import createAssigner from './_createAssigner.js';\nimport allKeys from './allKeys.js';\n\n// Extend a given object with all the properties in passed-in object(s).\nexport default createAssigner(allKeys);\n","import createAssigner from './_createAssigner.js';\nimport keys from './keys.js';\n\n// Assigns a given object with all the own properties in the passed-in\n// object(s).\n// (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)\nexport default createAssigner(keys);\n","import createAssigner from './_createAssigner.js';\nimport allKeys from './allKeys.js';\n\n// Fill in a given object with default properties.\nexport default createAssigner(allKeys, true);\n","import isObject from './isObject.js';\nimport { nativeCreate } from './_setup.js';\n\n// Create a naked function reference for surrogate-prototype-swapping.\nfunction ctor() {\n return function(){};\n}\n\n// An internal function for creating a new object that inherits from another.\nexport default function baseCreate(prototype) {\n if (!isObject(prototype)) return {};\n if (nativeCreate) return nativeCreate(prototype);\n var Ctor = ctor();\n Ctor.prototype = prototype;\n var result = new Ctor;\n Ctor.prototype = null;\n return result;\n}\n","import baseCreate from './_baseCreate.js';\nimport extendOwn from './extendOwn.js';\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 default function create(prototype, props) {\n var result = baseCreate(prototype);\n if (props) extendOwn(result, props);\n return result;\n}\n","import isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport extend from './extend.js';\n\n// Create a (shallow-cloned) duplicate of an object.\nexport default function clone(obj) {\n if (!isObject(obj)) return obj;\n return isArray(obj) ? obj.slice() : extend({}, obj);\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 default function tap(obj, interceptor) {\n interceptor(obj);\n return obj;\n}\n","import isArray from './isArray.js';\nimport _has from './_has.js';\nimport { hasOwnProperty } from './_setup.js';\n\n// Shortcut function for checking if an object has a given property directly on\n// itself (in other words, not on a prototype). Unlike the internal `has`\n// function, this public version can also traverse nested properties.\nexport default 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","// Keep the identity function around for default iteratees.\nexport default function identity(value) {\n return value;\n}\n","import extendOwn from './extendOwn.js';\nimport isMatch from './isMatch.js';\n\n// Returns a predicate for checking whether an object has a given set of\n// `key:value` pairs.\nexport default function matcher(attrs) {\n attrs = extendOwn({}, attrs);\n return function(obj) {\n return isMatch(obj, attrs);\n };\n}\n","// Internal function to obtain a nested property in `obj` along `path`.\nexport default function 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","import isArray from './isArray.js';\nimport shallowProperty from './_shallowProperty.js';\nimport deepGet from './_deepGet.js';\n\n// Creates a function that, when passed an object, will traverse that objects\n// properties down the given `path`, specified as an array of keys or indices.\nexport default function property(path) {\n if (!isArray(path)) {\n return shallowProperty(path);\n }\n return function(obj) {\n return deepGet(obj, path);\n };\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.\nexport default function 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 were 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","import identity from './identity.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport matcher from './matcher.js';\nimport property from './property.js';\nimport optimizeCb from './_optimizeCb.js';\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.\nexport default function 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","import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\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.\nexport default function iteratee(value, context) {\n return baseIteratee(value, context, Infinity);\n}\n_.iteratee = iteratee;\n","import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\nimport iteratee from './iteratee.js';\n\n// The function we call internally to generate a callback. It invokes\n// `_.iteratee` if overridden, otherwise `baseIteratee`.\nexport default function cb(value, context, argCount) {\n if (_.iteratee !== iteratee) return _.iteratee(value, context);\n return baseIteratee(value, context, argCount);\n}\n","import cb from './_cb.js';\nimport keys from './keys.js';\n\n// Returns the results of applying the `iteratee` to each element of `obj`.\n// In contrast to `_.map` it returns an object.\nexport default 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","// Predicate-generating function. Often useful outside of Underscore.\nexport default function noop(){}\n","import isArray from './isArray.js';\nimport deepGet from './_deepGet.js';\n\n// Generates a function for a given object that returns a given property.\nexport default 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","import optimizeCb from './_optimizeCb.js';\n\n// Run a function **n** times.\nexport default 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","// Return a random integer between `min` and `max` (inclusive).\nexport default 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","// A (possibly faster) way to get the current timestamp as an integer.\nexport default Date.now || function() {\n return new Date().getTime();\n};\n","import keys from './keys.js';\n\n// Internal helper to generate functions for escaping and unescaping strings\n// to/from HTML interpolation.\nexport default function 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}\n","// Internal list of HTML entities for escaping.\nexport default {\n '&': '&amp;',\n '<': '&lt;',\n '>': '&gt;',\n '\"': '&quot;',\n \"'\": '&#x27;',\n '`': '&#x60;'\n};\n","import createEscaper from './_createEscaper.js';\nimport escapeMap from './_escapeMap.js';\n\n// Function for escaping strings to HTML interpolation.\nexport default createEscaper(escapeMap);\n","import createEscaper from './_createEscaper.js';\nimport unescapeMap from './_unescapeMap.js';\n\n// Function for unescaping strings from HTML interpolation.\nexport default createEscaper(unescapeMap);\n","import invert from './invert.js';\nimport escapeMap from './_escapeMap.js';\n\n// Internal list of HTML entities for unescaping.\nexport default invert(escapeMap);\n","import _ from './underscore.js';\n\n// By default, Underscore uses ERB-style template delimiters. Change the\n// following template settings to use alternative delimiters.\nexport default _.templateSettings = {\n evaluate: /<%([\\s\\S]+?)%>/g,\n interpolate: /<%=([\\s\\S]+?)%>/g,\n escape: /<%-([\\s\\S]+?)%>/g\n};\n","import defaults from './defaults.js';\nimport _ from './underscore.js';\nimport './templateSettings.js';\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\nfunction escapeChar(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 default 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","import isArray from './isArray.js';\nimport isFunction from './isFunction.js';\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 default 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","// Generate a unique integer id (unique within the entire client session).\n// Useful for temporary DOM ids.\nvar idCounter = 0;\nexport default function uniqueId(prefix) {\n var id = ++idCounter + '';\n return prefix ? prefix + id : id;\n}\n","import _ from './underscore.js';\n\n// Start chaining a wrapped Underscore object.\nexport default function chain(obj) {\n var instance = _(obj);\n instance._chain = true;\n return instance;\n}\n","import baseCreate from './_baseCreate.js';\nimport isObject from './isObject.js';\n\n// Internal function to execute `sourceFunc` bound to `context` with optional\n// `args`. Determines whether to execute a function as a constructor or as a\n// normal function.\nexport default function 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","import restArguments from './restArguments.js';\nimport executeBound from './_executeBound.js';\nimport _ from './underscore.js';\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.\nvar 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 = _;\nexport default partial;\n","import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport executeBound from './_executeBound.js';\n\n// Create a function bound to a given object (assigning `this`, and arguments,\n// optionally).\nexport default 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","import getLength from './_getLength.js';\nimport isArrayLike from './_isArrayLike.js';\nimport isArray from './isArray.js';\nimport isArguments from './isArguments.js';\n\n// Internal implementation of a recursive `flatten` function.\nexport default function flatten(input, depth, strict, output) {\n output = output || [];\n if (!depth && depth !== 0) {\n depth = Infinity;\n } else if (depth <= 0) {\n return output.concat(input);\n }\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 (depth > 1) {\n flatten(value, depth - 1, strict, output);\n idx = output.length;\n } else {\n var j = 0, len = value.length;\n while (j < len) output[idx++] = value[j++];\n }\n } else if (!strict) {\n output[idx++] = value;\n }\n }\n return output;\n}\n","import restArguments from './restArguments.js';\nimport flatten from './_flatten.js';\nimport bind from './bind.js';\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 default 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 return obj;\n});\n","import has from './_has.js';\n\n// Memoize an expensive function by storing its results.\nexport default 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","import restArguments from './restArguments.js';\n\n// Delays a function for the given number of milliseconds, and then calls\n// it with the arguments supplied.\nexport default restArguments(function(func, wait, args) {\n return setTimeout(function() {\n return func.apply(null, args);\n }, wait);\n});\n","import partial from './partial.js';\nimport delay from './delay.js';\nimport _ from './underscore.js';\n\n// Defers a function, scheduling it to run after the current call stack has\n// cleared.\nexport default partial(delay, _, 1);\n","import now from './now.js';\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 default 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","import restArguments from './restArguments.js';\nimport delay from './delay.js';\n\n// When a sequence of calls of the returned function ends, the argument\n// function is triggered. The end of a sequence is defined by the `wait`\n// parameter. If `immediate` is passed, the argument function will be\n// triggered at the beginning of the sequence instead of at the end.\nexport default 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","import partial from './partial.js';\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 default function wrap(func, wrapper) {\n return partial(wrapper, func);\n}\n","// Returns a negated version of the passed-in predicate.\nexport default function negate(predicate) {\n return function() {\n return !predicate.apply(this, arguments);\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 default 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","// Returns a function that will only be executed on and after the Nth call.\nexport default function after(times, func) {\n return function() {\n if (--times < 1) {\n return func.apply(this, arguments);\n }\n };\n}\n","// Returns a function that will only be executed up to (but not including) the\n// Nth call.\nexport default 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","import partial from './partial.js';\nimport before from './before.js';\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 default partial(before, 2);\n","import cb from './_cb.js';\nimport keys from './keys.js';\n\n// Returns the first key on an object that passes a truth test.\nexport default 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","import cb from './_cb.js';\nimport getLength from './_getLength.js';\n\n// Internal function to generate `_.findIndex` and `_.findLastIndex`.\nexport default function 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","import createPredicateIndexFinder from './_createPredicateIndexFinder.js';\n\n// Returns the first index on an array-like that passes a truth test.\nexport default createPredicateIndexFinder(1);\n","import createPredicateIndexFinder from './_createPredicateIndexFinder.js';\n\n// Returns the last index on an array-like that passes a truth test.\nexport default createPredicateIndexFinder(-1);\n","import cb from './_cb.js';\nimport getLength from './_getLength.js';\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 default 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","import getLength from './_getLength.js';\nimport { slice } from './_setup.js';\nimport isNaN from './isNaN.js';\n\n// Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.\nexport default function 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","import sortedIndex from './sortedIndex.js';\nimport findIndex from './findIndex.js';\nimport createIndexFinder from './_createIndexFinder.js';\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 default createIndexFinder(1, findIndex, sortedIndex);\n","import findLastIndex from './findLastIndex.js';\nimport createIndexFinder from './_createIndexFinder.js';\n\n// Return the position of the last occurrence of an item in an array,\n// or -1 if the item is not included in the array.\nexport default createIndexFinder(-1, findLastIndex);\n","import isArrayLike from './_isArrayLike.js';\nimport findIndex from './findIndex.js';\nimport findKey from './findKey.js';\n\n// Return the first value which passes a truth test.\nexport default 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}\n","import find from './find.js';\nimport matcher from './matcher.js';\n\n// Convenience version of a common use case of `_.find`: getting the first\n// object containing specific `key:value` pairs.\nexport default function findWhere(obj, attrs) {\n return find(obj, matcher(attrs));\n}\n","import optimizeCb from './_optimizeCb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// The cornerstone for collection functions, an `each`\n// implementation, aka `forEach`.\n// Handles raw objects in addition to array-likes. Treats all\n// sparse array-likes as if they were dense.\nexport default 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}\n","import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the results of applying the iteratee to each element.\nexport default 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}\n","import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// Internal helper to create a reducing function, iterating left or right.\nexport default function 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","import createReduce from './_createReduce.js';\n\n// **Reduce** builds up a single result from a list of values, aka `inject`,\n// or `foldl`.\nexport default createReduce(1);\n","import createReduce from './_createReduce.js';\n\n// The right-associative version of reduce, also known as `foldr`.\nexport default createReduce(-1);\n","import cb from './_cb.js';\nimport each from './each.js';\n\n// Return all the elements that pass a truth test.\nexport default 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}\n","import filter from './filter.js';\nimport negate from './negate.js';\nimport cb from './_cb.js';\n\n// Return all the elements for which a truth test fails.\nexport default function reject(obj, predicate, context) {\n return filter(obj, negate(cb(predicate)), context);\n}\n","import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Determine whether all of the elements pass a truth test.\nexport default 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}\n","import cb from './_cb.js';\nimport isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Determine if at least one element in the object passes a truth test.\nexport default 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}\n","import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport indexOf from './indexOf.js';\n\n// Determine if the array or object contains a given item (using `===`).\nexport default 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}\n","import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport isArray from './isArray.js';\nimport map from './map.js';\nimport deepGet from './_deepGet.js';\n\n// Invoke a method (with arguments) on every item in a collection.\nexport default 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","import map from './map.js';\nimport property from './property.js';\n\n// Convenience version of a common use case of `_.map`: fetching a property.\nexport default function pluck(obj, key) {\n return map(obj, property(key));\n}\n","import filter from './filter.js';\nimport matcher from './matcher.js';\n\n// Convenience version of a common use case of `_.filter`: selecting only\n// objects containing specific `key:value` pairs.\nexport default function where(obj, attrs) {\n return filter(obj, matcher(attrs));\n}\n","import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the maximum element (or element-based computation).\nexport default 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","import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the minimum element (or element-based computation).\nexport default 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","import isArrayLike from './_isArrayLike.js';\nimport clone from './clone.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/FisherYates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default 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","import sample from './sample.js';\n\n// Shuffle a collection.\nexport default function shuffle(obj) {\n return sample(obj, Infinity);\n}\n","import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default 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","import cb from './_cb.js';\nimport each from './each.js';\n\n// An internal function used for aggregate \"group by\" operations.\nexport default function 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","import group from './_group.js';\nimport has from './_has.js';\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 default group(function(result, value, key) {\n if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n","import group from './_group.js';\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 default group(function(result, value, key) {\n result[key] = value;\n});\n","import group from './_group.js';\nimport has from './_has.js';\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 default group(function(result, value, key) {\n if (has(result, key)) result[key]++; else result[key] = 1;\n});\n","import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n result[pass ? 0 : 1].push(value);\n}, true);\n","import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default 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","import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n if (obj == null) return 0;\n return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n","// Internal `_.pick` helper function to determine whether `key` is an enumerable\n// property name of `obj`.\nexport default function keyInObj(value, key, obj) {\n return key in obj;\n}\n","import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport optimizeCb from './_optimizeCb.js';\nimport allKeys from './allKeys.js';\nimport keyInObj from './_keyInObj.js';\nimport flatten from './_flatten.js';\n\n// Return a copy of the object only containing the allowed properties.\nexport default 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","import restArguments from './restArguments.js';\nimport isFunction from './isFunction.js';\nimport negate from './negate.js';\nimport map from './map.js';\nimport flatten from './_flatten.js';\nimport contains from './contains.js';\nimport pick from './pick.js';\n\n// Return a copy of the object without the disallowed properties.\nexport default 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","import { slice } from './_setup.js';\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 default function initial(array, n, guard) {\n return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n","import initial from './initial.js';\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 default function first(array, n, guard) {\n if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n if (n == null || guard) return array[0];\n return initial(array, array.length - n);\n}\n","import { slice } from './_setup.js';\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 default function rest(array, n, guard) {\n return slice.call(array, n == null || guard ? 1 : n);\n}\n","import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n if (n == null || guard) return array[array.length - 1];\n return rest(array, Math.max(0, array.length - n));\n}\n","import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n return filter(array, Boolean);\n}\n","import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n return _flatten(array, depth, false);\n}\n","import restArguments from './restArguments.js';\nimport flatten from './_flatten.js';\nimport filter from './filter.js';\nimport contains from './contains.js';\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 default restArguments(function(array, rest) {\n rest = flatten(rest, true, true);\n return filter(array, function(value){\n return !contains(rest, value);\n });\n});\n","import restArguments from './restArguments.js';\nimport difference from './difference.js';\n\n// Return a version of the array that does not contain the specified value(s).\nexport default restArguments(function(array, otherArrays) {\n return difference(array, otherArrays);\n});\n","import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\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 default 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}\n","import restArguments from './restArguments.js';\nimport uniq from './uniq.js';\nimport flatten from './_flatten.js';\n\n// Produce an array that contains the union: each distinct element from all of\n// the passed-in arrays.\nexport default restArguments(function(arrays) {\n return uniq(flatten(arrays, true, true));\n});\n","import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default 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","import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default 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","import restArguments from './restArguments.js';\nimport unzip from './unzip.js';\n\n// Zip together multiple lists into a single array -- elements that share\n// an index go together.\nexport default restArguments(unzip);\n","import getLength from './_getLength.js';\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 default 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","// 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 default 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","import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default 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","import _ from './underscore.js';\n\n// Helper function to continue chaining intermediate results.\nexport default function chainResult(instance, obj) {\n return instance._chain ? _(obj).chain() : obj;\n}\n","import _ from './underscore.js';\nimport each from './each.js';\nimport functions from './functions.js';\nimport { push } from './_setup.js';\nimport chainResult from './_chainResult.js';\n\n// Add your own custom functions to the Underscore object.\nexport default 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","import _ from './underscore.js';\nimport each from './each.js';\nimport { ArrayProto } from './_setup.js';\nimport chainResult from './_chainResult.js';\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 if (obj != null) {\n method.apply(obj, arguments);\n if ((name === 'shift' || name === 'splice') && obj.length === 0) {\n delete obj[0];\n }\n }\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 var obj = this._wrapped;\n if (obj != null) obj = method.apply(obj, arguments);\n return chainResult(this, obj);\n };\n});\n\nexport default _;\n","// Default Export\n// ==============\n// In this module, we mix our bundled exports into the `_` object and export\n// the result. This is analogous to setting `module.exports = _` in CommonJS.\n// Hence, this module is also the entry point of our UMD bundle and the package\n// entry point for CommonJS and AMD users. In other words, this is (the source\n// of) the module you are interfacing with when you do any of the following:\n//\n// ```js\n// // CommonJS\n// var _ = require('underscore');\n//\n// // AMD\n// define(['underscore'], function(_) {...});\n//\n// // UMD in the browser\n// // _ is available as a global variable\n// ```\nimport * 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"],"sourceRoot":""}