{"version":3,"sources":["webpack:///./src/components/Tournament/Match/NoDetailsMatchCard.vue?ef1e","webpack:///src/components/Tournament/Match/NoDetailsMatchCard.vue","webpack:///./src/components/Tournament/Match/NoDetailsMatchCard.vue?8562","webpack:///./src/components/Tournament/Match/NoDetailsMatchCard.vue","webpack:///./src/Mixins/RouteMixin.js","webpack:///./src/classes/ParentTeam.js","webpack:///./src/classes/ParentTeamClub.js","webpack:///./src/classes/TournamentSummarizer.js","webpack:///./node_modules/lodash/lodash.js","webpack:///./src/Mixins/RoundMixin.js"],"names":["render","_vm","this","_h","$createElement","_c","_self","attrs","dark","staticClass","_v","_s","round","name","bracket","playoffRound","match","pool","division","lineupLock","_e","staticRenderFns","props","data","refreshKey","timeOut","computed","poolId","tournament","pools","find","bracketId","brackets","rounds","r","divisionId","divisions","calcDivision","d","a","length","champions","type","includes","lineupLockObj","startTime","view","userTeams","methods","checkSetRefresh","hasLock","isLocked","setTimeout","mounted","destroyed","clearTimeout","watch","components","BracketMatchCard","component","VCard","VCardText","VExpandTransition","dayId","$route","params","roundId","teamId","tournamentId","standingsI","liveProps","query","liveN","n","id","liveId","ParentTeam","dto","pairs2","update","JSON","parse","exclude","DtoUpdate","teams","activeTeams","filter","f","rosteredTeamId","teamIds","map","m","matches","isBye","activeTeamIds","some","sort","firstBy","forEach","homeIds","h","getLineupPlayers","addMatch","awayIds","x","w","l","u","push","publicDivisions","t","flatten","isDuals","team","complete","winningId","squads","winningTeam","result","sortByTeamNumber","record","unplayed","sortByWinLoss","reduce","b","pairs","replace","y","api","rtIds","tourney","duals","TournamentSummarizer","loadParents","parents","p","parentIds","loading","roster","teamsById","then","isNcaa","initNcaa","initClubs","catch","e","console","log","response","finally","clubs","ownerId","owner","logoUrl","uniqBy","c","ParentTeamClub","children","isRostered","Set","undefined","VERSION","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","FUNC_ERROR_TEXT","HASH_UNDEFINED","MAX_MEMOIZE_SIZE","PLACEHOLDER","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","DEFAULT_TRUNC_LENGTH","DEFAULT_TRUNC_OMISSION","HOT_COUNT","HOT_SPAN","LAZY_FILTER_FLAG","LAZY_MAP_FLAG","LAZY_WHILE_FLAG","INFINITY","MAX_SAFE_INTEGER","MAX_INTEGER","NAN","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","HALF_MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","asyncTag","boolTag","dateTag","domExcTag","errorTag","funcTag","genTag","mapTag","numberTag","nullTag","objectTag","promiseTag","proxyTag","regexpTag","setTag","stringTag","symbolTag","undefinedTag","weakMapTag","weakSetTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrim","reTrimStart","reTrimEnd","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsDingbatRange","rsLowerRange","rsMathOpRange","rsNonCharRange","rsPunctuationRange","rsSpaceRange","rsUpperRange","rsVarRange","rsBreakRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsOptJoin","join","rsOrdLower","rsOrdUpper","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","deburredLetters","htmlEscapes","htmlUnescapes","stringEscapes","freeParseFloat","parseFloat","freeParseInt","parseInt","freeGlobal","global","Object","freeSelf","self","root","Function","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","process","nodeUtil","types","require","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","call","arrayAggregator","array","setter","iteratee","accumulator","index","value","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","asciiToArray","string","split","asciiWords","baseFindKey","collection","eachFunc","key","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseSortBy","comparer","current","baseTimes","baseToPairs","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","getValue","hasUnicode","test","hasUnicodeWord","iteratorToArray","iterator","next","done","mapToArray","size","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","unescapeHtmlChar","lastIndex","unicodeWords","runInContext","context","_","defaults","pick","Date","Error","Math","String","TypeError","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","idCounter","maskSrcKey","uid","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","ctxNow","now","ctxSetTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","lazyClone","copyArray","lazyReverse","clone","lazyValue","dir","isArr","isRight","arrLength","getView","start","end","iteratees","iterLength","takeCount","baseWrapperValue","outer","iterIndex","Hash","entries","clear","entry","hashClear","__data__","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","pop","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","get","mapCacheHas","mapCacheSet","SetCache","add","setCacheAdd","setCacheHas","Stack","stackClear","stackDelete","stackGet","stackHas","stackSet","arrayLikeKeys","inherited","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","baseAggregator","baseEach","baseAssign","copyObject","baseAssignIn","keysIn","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","copySymbolsIn","copySymbols","initCloneByTag","stacked","subValue","keysFunc","getAllKeysIn","getAllKeys","baseConforms","baseConformsTo","baseDelay","wait","baseDifference","isCommon","valuesLength","valuesIndex","templateSettings","constructor","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFill","toInteger","toLength","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","symbolsFunc","baseGetTag","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseInRange","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInverter","baseInvoke","parent","last","baseIsArguments","baseIsArrayBuffer","baseIsDate","baseIsEqual","baseIsEqualDeep","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","equalObjects","baseIsMap","baseIsMatch","matchData","noCustomizer","srcValue","baseIsNative","isMasked","pattern","baseIsRegExp","baseIsSet","baseIsTypedArray","isLength","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","baseMergeDeep","newValue","safeGet","mergeFunc","isTyped","isArrayLikeObject","cloneTypedArray","isPlainObject","toPlainObject","baseNth","baseOrderBy","orders","getIteratee","criteria","compareMultiple","basePick","basePickBy","baseSet","basePropertyDeep","basePullAll","indexOf","basePullAt","indexes","previous","baseUnset","baseRange","step","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","buffer","slice","copy","cloneArrayBuffer","arrayBuffer","byteLength","cloneDataView","dataView","byteOffset","cloneRegExp","regexp","cloneSymbol","symbol","typedArray","compareAscending","valIsDefined","valIsReflexive","objCriteria","othCriteria","ordersLength","order","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","getSymbols","getSymbolsIn","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createBind","isBind","Ctor","createCtor","wrapper","fn","arguments","createCaseFirst","methodName","charAt","trailing","createCompounder","callback","words","deburr","thisBinding","createCurry","arity","getHolder","createRecurry","createHybrid","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","getFuncName","funcName","getData","isLaziable","plant","partialsRight","holdersRight","argPos","ary","isAry","isBindKey","isFlip","holdersCount","newHolders","reorder","createInverter","toIteratee","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createPartial","createRange","toFinite","createRelationalOperation","toNumber","wrapFunc","isCurry","newHoldersRight","newPartials","newPartialsRight","newData","setData","setWrapToString","createRound","precision","pair","noop","createToPairs","createWrap","mergeData","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","isPartial","arrValue","othValue","compared","message","convert","objProps","objLength","othProps","skipCtor","objCtor","othCtor","otherFunc","isKeyable","isOwn","unmasked","stubArray","transforms","getWrapDetails","hasPath","hasFunc","input","insertWrapDetails","details","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","memoizeCapped","memoize","srcBitmask","newBitmask","isCombo","otherArgs","oldArray","shortOut","reference","updateWrapDetails","count","lastCalled","stamp","remaining","rand","charCodeAt","quote","subString","chunk","compact","concat","difference","differenceBy","differenceWith","drop","dropRight","dropRightWhile","dropWhile","fill","findIndex","findLastIndex","flattenDeep","flattenDepth","fromPairs","head","initial","intersection","mapped","intersectionBy","intersectionWith","separator","lastIndexOf","nth","pull","pullAll","pullAllBy","pullAllWith","pullAt","remove","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sortedUniq","sortedUniqBy","tail","take","takeRight","takeRightWhile","takeWhile","union","unionBy","unionWith","uniq","uniqWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipObject","zipObjectDeep","zipWith","chain","tap","interceptor","wrapperAt","wrapperChain","wrapperCommit","wrapperNext","toArray","wrapperToIterator","wrapperPlant","wrapperReverse","wrapped","wrapperValue","countBy","every","findLast","flatMap","flatMapDeep","flatMapDepth","forEachRight","groupBy","isString","invokeMap","keyBy","orderBy","partition","reduceRight","reject","negate","sample","sampleSize","shuffle","sortBy","after","before","bind","bindKey","curry","curryRight","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","defer","delay","flip","resolver","memoized","Cache","once","overArgs","funcsLength","partial","partialRight","rearg","rest","spread","throttle","unary","wrap","castArray","cloneWith","cloneDeep","cloneDeepWith","conformsTo","gt","gte","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isError","isInteger","isMatch","isMatchWith","isNaN","isNumber","isNative","isNull","isNil","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lt","lte","sign","remainder","isBinary","toSafeInteger","assign","assignIn","assignInWith","assignWith","at","properties","propsIndex","propsLength","defaultsDeep","mergeWith","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","functions","functionsIn","invert","invertBy","invoke","mapKeys","mapValues","merge","omit","omitBy","pickBy","prop","setWith","toPairs","toPairsIn","isArrLike","unset","updateWith","valuesIn","clamp","inRange","floating","temp","camelCase","word","toLowerCase","capitalize","upperFirst","endsWith","target","position","escape","escapeRegExp","kebabCase","lowerCase","lowerFirst","pad","strLength","padEnd","padStart","radix","repeat","snakeCase","limit","startCase","startsWith","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","attempt","toLower","toUpper","toUpperCase","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","upperCase","bindAll","methodNames","cond","conforms","defaultTo","flow","flowRight","matchesProperty","method","methodOf","mixin","noConflict","nthArg","over","overEvery","overSome","propertyOf","range","rangeRight","stubObject","stubString","stubTrue","times","toPath","uniqueId","prefix","augend","addend","divide","dividend","divisor","maxBy","mean","meanBy","minBy","multiply","multiplier","multiplicand","subtract","minuend","subtrahend","sum","sumBy","entriesIn","extend","extendWith","each","eachRight","first","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","commit","toJSON","roundJProps","$store","getters","getRoundIdByI","getRoundJProps","hideTimes","getRound","hideSeeds","noSeeds","getDivisionJProp","hideRefs","noRefs"],"mappings":"mIAAA,IAAIA,EAAS,WAAa,IAAIC,EAAIC,KAASC,EAAGF,EAAIG,eAAmBC,EAAGJ,EAAIK,MAAMD,IAAIF,EAAG,OAAOE,EAAG,sBAAsB,CAACA,EAAG,SAAS,CAACE,MAAM,CAAC,KAAO,GAAG,KAAON,EAAIO,OAAO,CAACH,EAAG,cAAc,CAACI,YAAY,QAAQ,CAACJ,EAAG,MAAM,CAACJ,EAAIS,GAAGT,EAAIU,GAAGV,EAAIW,MAAMC,MAAM,IAAIZ,EAAIU,GAAGT,KAAKY,QAASZ,KAAKa,aAAe,OAAQd,EAAY,SAAEI,EAAG,qBAAqB,CAACE,MAAM,CAAC,QAAUN,EAAIe,MAAM,KAAOf,EAAIgB,KAAK,QAAUhB,EAAIa,QAAQ,cAAgBb,EAAIa,QAAQ,UAAYb,EAAIiB,SAAS,OAASjB,EAAIW,MAAM,MAAO,EAAK,UAAW,EAAM,WAAaX,EAAIkB,cAAclB,EAAImB,MAAM,IAAI,IAAI,IACziBC,EAAkB,G,uHC0BtB,GACEC,MAAO,CAAC,QAAS,aAAc,QAC/BC,KAFF,WAGI,MAAO,CACLC,WAAY,EACZC,QAAS,OAGbC,SAAU,OAAZ,OAAY,CAAZ,kBACA,mDADA,IAEIT,KAFJ,WAEA,WACM,OAAOf,KAAKc,MAAMW,OAASzB,KAAK0B,WAAWC,MAAMC,MAAK,SAA5D,yCAEIhB,QALJ,WAKA,WACM,OAAOZ,KAAKc,MAAMe,UAAY7B,KAAK0B,WAAWI,SAASF,MAAK,SAAlE,4CAEIlB,MARJ,WAQA,WACM,OAAOV,KAAKe,KAAOf,KAAK0B,WAAWK,OAAOH,MAAK,SAArD,GACQ,OAAOI,EAAEL,MAAMC,MAAK,SAA5B,iCACA,sDACQ,OAAOI,EAAEF,SAASF,MAAK,SAA/B,oCACA,MAEIZ,SAfJ,WAeA,WACM,OAAOhB,KAAKiC,WAAajC,KAAK0B,WAAWQ,UAAUN,MAAK,SAA9D,oDAEIO,aAlBJ,WAkBA,WACM,OAAOnC,KAAK0B,WAAWQ,UAAUN,MAAK,SAA5C,GACQ,OAAOQ,EAAEL,OAAOH,MAAK,SAA7B,mCAGIf,aAvBJ,WAuBA,WACA,6EACM,GAAIwB,EAAG,CACL,GAAIA,EAAEC,SAAWtC,KAAKY,QAAQ2B,UAAW,MAAO,cAChD,OAAQF,EAAEC,QACR,KAAK,EACH,OAAOtC,KAAKY,QAAQ4B,MAAQxC,KAAKY,QAAQ4B,KAAKC,SAAS,KAAO,gBAAkB,SAClF,KAAK,EACH,OAAOzC,KAAKY,QAAQ4B,MAA8B,0BAAtBxC,KAAKY,QAAQ4B,KAAmC,YAAc,QAC5F,KAAK,EACH,MAAO,WACT,QACE,MAAO,YAAnB,kBAGM,MAAO,OAETvB,WAxCJ,WAyCM,OAAOjB,KAAKsB,YAActB,KAAKgB,SAAS0B,cAAc1C,KAAKc,MAAM6B,UAAW3C,KAAK4C,KAAM5C,KAAK6C,cAGhGC,QAAS,CACPC,gBADJ,WACA,WACM,IAAI/C,KAAKiB,WAAW+B,UAAWhD,KAAKiB,WAAWgC,SAA/C,CAEA,IAAN,0CACMjD,KAAKuB,QAAU2B,YAAW,WACxB,EAAR,eACA,MAGEC,QA9DF,WA+DInD,KAAK+C,mBAEPK,UAjEF,WAkEQpD,KAAKuB,SAAS8B,aAAarD,KAAKuB,UAEtC+B,MAAO,CACL,oBAAqB,mBAEvBC,WAAY,CACVC,iBAAJ,SCnG0X,I,qECOtXC,EAAY,eACd,EACA3D,EACAqB,GACA,EACA,KACA,KACA,MAIa,OAAAsC,EAAiB,QAOhC,IAAkBA,EAAW,CAACC,QAAA,KAAMC,UAAA,OAAUC,kBAAA,U,oCCzB/B,QACbpC,SAAU,CACRqC,MADQ,WAEN,OAAQ7D,KAAK8D,OAAOC,OAAOF,OAE7B5B,WAJQ,WAKN,OAAQjC,KAAK8D,OAAOC,OAAO9B,YAE7BR,OAPQ,WAQN,OAAQzB,KAAK8D,OAAOC,OAAOtC,QAE7BuC,QAVQ,WAWN,OAAQhE,KAAK8D,OAAOC,OAAOF,OAE7BI,OAbQ,WAcN,OAAQjE,KAAK8D,OAAOC,OAAOE,QAE7BC,aAhBQ,WAiBN,OAAQlE,KAAK8D,OAAOC,OAAOG,cAE7BC,WAnBQ,WAoBN,OAAQnE,KAAK8D,OAAOC,OAAOI,YAE7BC,UAtBQ,WAuBN,OAAOpE,KAAK8D,OAAOO,OAASrE,KAAK8D,OAAOO,MAAMC,OAAS,CACrDC,GAAIvE,KAAK8D,OAAOO,MAAMC,MACtBE,KAAiC,EAA3BxE,KAAK8D,OAAOO,MAAMI,a,qVCrBXC,E,WACnB,WAAaC,EAAKjD,GAAY,uBAC5B1B,KAAK0B,WAAaA,EAClB1B,KAAK4E,OAAS,GACVD,GACF3E,KAAK6E,OAAOF,G,sDAIRA,GAAK,WACX,GAAIA,EAAK,CACY,kBAARA,IAAkBA,EAAMG,KAAKC,MAAMJ,IAC9C,IAAMK,EAAU,GAChBC,eAAUN,EAAK3E,KAAMgF,GAGvB,IAAME,EAAQlF,KAAK0B,WAAWyD,YAAYC,QAAO,SAAAC,GAAC,OAAIA,EAAEC,iBAAmB,EAAKd,MAC1Ee,EAAUL,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,MAC3BkB,EAAU1F,KAAK0B,WAAWgE,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAEM,OAASN,EAAEO,cAAcC,MAAK,SAAArB,GAAE,OAAIe,EAAQ9C,SAAS+B,SAAMsB,KAAKC,qBAAQ,SAC/H/F,KAAK4E,OAAS,GACdc,EAAQM,SAAQ,SAAAP,GAEd,GAAIA,EAAEQ,QAAQJ,MAAK,SAAArB,GAAE,OAAIe,EAAQ9C,SAAS+B,MAAM,CAC9C,IAAI0B,EAAIT,EAAEU,kBAAiB,EAAMjB,GAAO,EAAM,GAC9C,EAAKkB,SAASF,GAEhB,GAAIT,EAAEY,QAAQR,MAAK,SAAArB,GAAE,OAAIe,EAAQ9C,SAAS+B,MAAM,CAC9C,IAAInC,EAAIoD,EAAEU,kBAAiB,EAAOjB,GAAO,EAAM,GAC/C,EAAKkB,SAAS/D,S,+BAKVsC,GACR,IAAI2B,EAAItG,KAAK4E,OAAOhD,MAAK,SAAAyD,GAAC,OAAIA,EAAE1E,OAASgE,EAAIhE,QACzC2F,GACFA,EAAEC,GAAK5B,EAAI4B,EACXD,EAAEE,GAAK7B,EAAI6B,EACXF,EAAEG,GAAK9B,EAAI8B,GAEXzG,KAAK4E,OAAO8B,KAAK/B,K,gCAIJ,WACf,OAAO3E,KAAK0B,WAAWiF,gBAAgBvB,QAAO,SAAAC,GAAC,QAAMA,EAAEF,YAAYvD,MAAK,SAAAgF,GAAC,OAAIA,EAAEtB,iBAAmB,EAAKd,W,+BAGzF,WACd,OAAOxE,KAAK0B,WAAWyD,YAAYC,QAAO,SAAAC,GAAC,OAAIA,EAAEC,iBAAmB,EAAKd,Q,6BAG7D,WACZ,OAAOqC,qBACL7G,KAAKkC,UACFkD,QAAO,SAAAC,GAAC,OAAIA,EAAEyB,WACdtB,KAAI,SAAApD,GAAC,OACJA,EAAE+C,YACCC,QAAO,SAAAC,GAAC,OAAIA,EAAEC,iBAAmB,EAAKd,MACtCgB,KAAI,SAAAoB,GACH,MAAO,CACLG,KAAMH,EACN5F,SAAUoB,EACVsD,QAAS,EAAKhE,WAAWgE,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAEO,cAAcnD,SAASmE,EAAEpC,OACxE,aAAc,WACZ,MAAO,CACL+B,EAAGvG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE4B,YAAc,EAAKF,KAAKvC,MACpEgC,EAAGxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE4B,YAAc,EAAKF,KAAKvC,gBAMlFsB,KAAKC,qBAAQ,gB,+BAIf,OAAO/F,KAAKkH,OAAO1B,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,Q,8BAGjB,WACPU,EAAQ2B,qBACZ7G,KAAKkC,UACFkD,QAAO,SAAAC,GAAC,OAAKA,EAAEyB,WACftB,KAAI,SAAApD,GAAC,OACJA,EAAE+C,YACCC,QAAO,SAAAC,GAAC,OAAIA,EAAEC,iBAAmB,EAAKd,MACtCgB,KAAI,SAAAoB,GACH,MAAO,CACLjG,KAAMiG,EAAEjG,KACRoG,KAAMH,EACN5F,SAAUoB,EACVsD,QAAS,EAAKhE,WAAWgE,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAEM,OAASN,EAAEO,cAAcnD,SAASmE,EAAEpC,OAAKsB,KAAKC,qBAAQ,SACtG,aAAc,WACZ,MAAO,CACLQ,EAAGvG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,SAC/GS,EAAGxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,WAGnH,eACE,OAAO/F,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,YAAUlB,KAAKC,qBAAQ,kBAOlEqB,EAAS,CACblC,MAAOA,EAAMY,KAAKuB,GAClB3B,QAASmB,qBAAQ3B,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEC,YAAUI,KAAKC,qBAAQ,SACzD,aACE,MAAO,CACLQ,EAAGM,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOf,MACxCC,EAAGK,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOd,QAG5C,eACE,OAAOxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,cAGvC,OAAOI,I,4BAGI,WACLlC,EAAQlF,KAAK4E,OAAOY,KAAI,SAAAoB,GAC5B,MAAO,CACLjG,KAAMiG,EAAEjG,KACRoG,KAAMH,EACNlB,QAAS,EAAKhE,WAAWgE,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAEM,OAASN,EAAEO,cAAcnD,SAASmE,EAAEpC,OAAKsB,KAAKC,qBAAQ,SACtGuB,OAAQ,CACNf,EAAGK,EAAEL,EACLC,EAAGI,EAAEJ,GAEPe,SAAUX,EAAEH,MAIVW,EAAS,CACblC,MAAOA,EAAMY,KAAK0B,GAClBF,OAAQ,CACNf,EAAGrB,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOf,KAAGkB,QAAO,SAACpF,EAAGqF,GAAQ,OAAOrF,EAAIqF,IAAK,GACjElB,EAAGtB,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOd,KAAGiB,QAAO,SAACpF,EAAGqF,GAAQ,OAAOrF,EAAIqF,IAAK,IAEnEH,SAAUrC,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEgB,KAAGgB,QAAO,SAACpF,EAAGqF,GAAQ,OAAOrF,EAAIqF,IAAK,IAEnE,OAAON,I,8BAIP,OAAOpH,KAAK2H,MAAMnC,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,U,KAGjC,SAAS6C,EAAkBhF,EAAGqF,GAC5B,IAAMpB,GAAMjE,EAAE1B,KAAKiH,QAAQ,MAAO,IAC5BC,GAAMH,EAAE/G,KAAKiH,QAAQ,MAAO,IAClC,OAAOtB,EAAIuB,EAGb,SAASL,EAAenF,EAAGqF,GACzB,IAAMpB,EAAmB,IAAfjE,EAAEiF,OAAOd,EAAuB,IAAbnE,EAAEiF,OAAOf,EAAUlE,EAAEiF,OAAOf,EAAI,EAAIlE,EAAEiF,OAAOf,EAAIlE,EAAEiF,OAAOd,EAAI,EACrFqB,EAAmB,IAAfH,EAAEJ,OAAOd,EAAuB,IAAbkB,EAAEJ,OAAOf,EAAUmB,EAAEJ,OAAOf,EAAI,EAAImB,EAAEJ,OAAOf,EAAImB,EAAEJ,OAAOd,EAAI,EAC3F,OAAOqB,EAAIvB,E,IClKQ5B,E,WAGnB,WAAaC,EAAKjD,EAAYoG,GAAK,mDAF3B,IAGN9H,KAAK8H,IAAMA,EACX9H,KAAK0B,WAAaA,EACdiD,GACF3E,KAAK6E,OAAOF,G,sDAIRA,GACa,kBAARA,IAAkBA,EAAMG,KAAKC,MAAMJ,IAC9C,IAAMK,EAAU,GAChBC,eAAUN,EAAK3E,KAAMgF,K,gCAGN,WACf,OAAOhF,KAAK0B,WAAWiF,gBAAgBvB,QAAO,SAAAC,GAAC,QAAMA,EAAEF,YAAYvD,MAAK,SAAAgF,GAAC,OAAI,EAAKmB,MAAMtF,SAASmE,EAAEtB,wB,+BAGrF,WACd,OAAOtF,KAAK0B,WAAWyD,YAAYC,QAAO,SAAAC,GAAC,OAAI,EAAK0C,MAAMtF,SAAS4C,EAAEC,qB,6BAGzD,WACN0C,EAAUhI,KAAK0B,WACfwD,EAAQ2B,qBACZ7G,KAAKkC,UACFkD,QAAO,SAAAC,GAAC,OAAIA,EAAEyB,WACdtB,KAAI,SAAApD,GAAC,OACJA,EAAE+C,YACCC,QAAO,SAAAC,GAAC,OAAI,EAAK0C,MAAMtF,SAAS4C,EAAEC,mBAClCE,KAAI,SAAAoB,GACH,IAAMqB,EAAQD,EAAQC,MAAM7C,QAAO,SAAAC,GAAC,OAAKA,EAAEM,OAASN,EAAEO,cAAcnD,SAASmE,EAAEpC,OAC/E,MAAO,CACL7D,KAAMiG,EAAEjG,KACRoG,KAAMH,EACN5F,SAAUoB,EACVsD,QAASuC,EAAMnC,KAAKC,qBAAQ,SAC5B,aAAc,WACZ,MAAO,CACLQ,EAAGvG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,SAC/GS,EAAGxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,WAGnH,eACE,OAAO/F,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,YAAUlB,KAAKC,qBAAQ,kBAOlEqB,EAAS,CACblC,MAAOA,EAAMY,KAAKC,qBAAQ,SAC1BL,QAASmB,qBAAQ3B,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEC,YAAUI,KAAKC,qBAAQ,SACzD,aACE,MAAO,CACLQ,EAAGM,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOf,MACxCC,EAAGK,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOd,QAG5C,eACE,OAAOxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,cAGvC,OAAOI,I,+BAIP,OAAOpH,KAAKkH,OAAO1B,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,Q,4BAGnB,WACLU,EAAQ2B,qBACZ7G,KAAKkC,UACFkD,QAAO,SAAAC,GAAC,OAAKA,EAAEyB,WACftB,KAAI,SAAApD,GAAC,OACJA,EAAE+C,YACCC,QAAO,SAAAC,GAAC,OAAI,EAAK0C,MAAMtF,SAAS4C,EAAEC,mBAClCE,KAAI,SAAAoB,GACH,MAAO,CACLjG,KAAMiG,EAAEjG,KACRoG,KAAMH,EACN5F,SAAUoB,EACVsD,QAAS,EAAKhE,WAAWgE,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAEM,OAASN,EAAEO,cAAcnD,SAASmE,EAAEpC,OAAKsB,KAAKC,qBAAQ,SACtG,aAAc,WACZ,MAAO,CACLQ,EAAGvG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,SAC/GS,EAAGxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAIA,EAAE2B,UAAY3B,EAAE8B,aAAe9B,EAAE8B,YAAYlD,SAAW,EAAK8C,KAAKvC,MAAIsB,KAAKC,qBAAQ,WAGnH,eACE,OAAO/F,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,YAAUlB,KAAKC,qBAAQ,kBAOlEqB,EAAS,CACblC,MAAOA,EAAMY,KAAKuB,GAClB3B,QAASmB,qBAAQ3B,EAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEC,YAAUI,KAAKC,qBAAQ,SACzD,aACE,MAAO,CACLQ,EAAGM,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOf,MACxCC,EAAGK,qBAAQ7G,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAE6B,OAAOd,QAG5C,eACE,OAAOxG,KAAK0F,QAAQN,QAAO,SAAAC,GAAC,OAAKA,EAAE2B,cAGvC,OAAOI,I,8BAIP,OAAOpH,KAAK2H,MAAMnC,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,U,KAGjC,SAAS6C,EAAkBhF,EAAGqF,GAC5B,IAAMpB,GAAMjE,EAAE1B,KAAKiH,QAAQ,MAAO,IAC5BC,GAAMH,EAAE/G,KAAKiH,QAAQ,MAAO,IAClC,OAAOtB,EAAIuB,E,IC3HQK,E,WAInB,WAAaxG,EAAYoG,GAAK,sDAHpB,GAGoB,8BAFpB,IAGR9H,KAAK8H,IAAMA,EACX9H,KAAK0B,WAAaA,EAClB1B,KAAKmI,c,wDAgBLnI,KAAKoI,QAAQpC,SAAQ,SAAAqC,GACnBA,EAAExD,c,oCAIS,WACiB,IAA1B7E,KAAKsI,UAAUhG,SACnBtC,KAAKuI,SAAU,EACfvI,KAAK8H,IAAIU,OAAOC,UAAUzI,KAAKsI,WAC5BI,MAAK,SAAA1G,GACA,EAAKN,WAAWiH,OAClB,EAAKC,SAAS5G,EAAEX,MAEhB,EAAKwH,UAAU7G,EAAEX,SAGpByH,OAAM,SAAAC,GAAC,OAAIC,QAAQC,IAAIF,EAAEG,aACzBC,SAAQ,WACP,EAAKZ,SAAU,Q,+BAIXrD,GAAO,WACflF,KAAKoI,QAAUlD,EAAMM,KAAI,SAAAC,GAAC,OAAI,IAAIf,EAAWe,EAAG,EAAK/D,WAAY,EAAKoG,QAAMhC,KAAKC,qBAAQ,W,gCAGhFb,GAAO,WACZkE,EAAQlE,EAAMM,KAAI,SAAAC,GACpB,MAAO,CACLjB,GAAIiB,EAAE4D,QACN1I,KAAM8E,EAAE6D,OAAS,eACjBC,QAAS9D,EAAE8D,YAIfH,EAAQI,IAAOJ,EAAO,MAAMtD,KAAKC,qBAAQ,SACzCqD,EAAMpD,SAAQ,SAAAyD,GACZ,IAEyB,EAFnB7C,EAAI,IAAI8C,EAAeD,EAAG,EAAK/H,WAAY,EAAKoG,KAChD6B,EAAWzE,EAAME,QAAO,SAAAC,GAAC,OAAIA,EAAEgE,UAAYI,EAAEjF,MAC/CmF,EAASrH,OAAS,IACpB,EAAAsE,EAAEmB,OAAMrB,KAAR,uBAAgBiD,EAASnE,KAAI,SAAAC,GAAC,OAAIA,EAAEjB,QAGtC,EAAK4D,QAAQ1B,KAAKE,Q,4BAvDpB,OAAO5G,KAAK0B,WAAWyD,YAAYC,QAAO,SAAAC,GAAC,OAAIA,EAAEuE,gB,gCAIjD,sBAAW,IAAIC,IAAI7J,KAAKkF,MAAMM,KAAI,SAAAC,GAAC,OAAIA,EAAEH,sB,4BAIzC,OAAOtF,KAAK0B,WAAWiH,OAAS,GAAK3I,KAAKoI,Y,8BCxB9C;;;;;;;;IAQE,WAGA,IAAI0B,EAGAC,EAAU,UAGVC,EAAmB,IAGnBC,EAAkB,kEAClBC,EAAkB,sBAGlBC,EAAiB,4BAGjBC,EAAmB,IAGnBC,EAAc,yBAGdC,EAAkB,EAClBC,EAAkB,EAClBC,EAAqB,EAGrBC,EAAuB,EACvBC,EAAyB,EAGzBC,EAAiB,EACjBC,EAAqB,EACrBC,EAAwB,EACxBC,EAAkB,EAClBC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAClBC,EAAiB,IAGjBC,EAAuB,GACvBC,EAAyB,MAGzBC,EAAY,IACZC,EAAW,GAGXC,EAAmB,EACnBC,EAAgB,EAChBC,EAAkB,EAGlBC,EAAW,IACXC,EAAmB,iBACnBC,EAAc,sBACdC,EAAM,IAGNC,EAAmB,WACnBC,EAAkBD,EAAmB,EACrCE,EAAwBF,IAAqB,EAG7CG,EAAY,CACd,CAAC,MAAOjB,GACR,CAAC,OAAQP,GACT,CAAC,UAAWC,GACZ,CAAC,QAASE,GACV,CAAC,aAAcC,GACf,CAAC,OAAQK,GACT,CAAC,UAAWJ,GACZ,CAAC,eAAgBC,GACjB,CAAC,QAASE,IAIRiB,EAAU,qBACVC,EAAW,iBACXC,EAAW,yBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAY,wBACZC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZC,GAAU,gBACVC,GAAY,kBACZC,GAAa,mBACbC,GAAW,iBACXC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBACZC,GAAe,qBACfC,GAAa,mBACbC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAcI,QACxCC,GAAqBF,OAAOF,GAAgBG,QAG5CE,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBV,OAAOS,GAAaR,QAGtCU,GAAS,aACTC,GAAc,OACdC,GAAY,OAGZC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAGdC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,GAAgB,kBAChBC,GAAoB,kBACpBC,GAAwB,kBACxBC,GAAsB,kBACtBC,GAAeH,GAAoBC,GAAwBC,GAC3DE,GAAiB,kBACjBC,GAAe,4BACfC,GAAgB,uBAChBC,GAAiB,+CACjBC,GAAqB,kBACrBC,GAAe,+JACfC,GAAe,4BACfC,GAAa,iBACbC,GAAeN,GAAgBC,GAAiBC,GAAqBC,GAGrEI,GAAS,OACTC,GAAW,IAAMf,GAAgB,IACjCgB,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMb,GAAe,IAC/Bc,GAAW,OACXC,GAAY,IAAMd,GAAiB,IACnCe,GAAU,IAAMd,GAAe,IAC/Be,GAAS,KAAOrB,GAAgBa,GAAeK,GAAWb,GAAiBC,GAAeK,GAAe,IACzGW,GAAS,2BACTC,GAAa,MAAQN,GAAU,IAAMK,GAAS,IAC9CE,GAAc,KAAOxB,GAAgB,IACrCyB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMhB,GAAe,IAC/BiB,GAAQ,UAGRC,GAAc,MAAQT,GAAU,IAAMC,GAAS,IAC/CS,GAAc,MAAQH,GAAU,IAAMN,GAAS,IAC/CU,GAAkB,MAAQjB,GAAS,yBACnCkB,GAAkB,MAAQlB,GAAS,yBACnCmB,GAAWV,GAAa,IACxBW,GAAW,IAAMtB,GAAa,KAC9BuB,GAAY,MAAQP,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAYU,KAAK,KAAO,IAAMF,GAAWD,GAAW,KAClHI,GAAa,mDACbC,GAAa,mDACbC,GAAQL,GAAWD,GAAWE,GAC9BK,GAAU,MAAQ,CAACrB,GAAWM,GAAYC,IAAYU,KAAK,KAAO,IAAMG,GACxEE,GAAW,MAAQ,CAACjB,GAAcP,GAAU,IAAKA,GAASQ,GAAYC,GAAYX,IAAUqB,KAAK,KAAO,IAGxGM,GAASvE,OAAO2C,GAAQ,KAMxB6B,GAAcxE,OAAO8C,GAAS,KAG9B2B,GAAYzE,OAAOmD,GAAS,MAAQA,GAAS,KAAOmB,GAAWF,GAAO,KAGtEM,GAAgB1E,OAAO,CACzBwD,GAAU,IAAMP,GAAU,IAAMW,GAAkB,MAAQ,CAACf,GAASW,GAAS,KAAKS,KAAK,KAAO,IAC9FN,GAAc,IAAME,GAAkB,MAAQ,CAAChB,GAASW,GAAUE,GAAa,KAAKO,KAAK,KAAO,IAChGT,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAChBM,GACAD,GACAnB,GACAsB,IACAJ,KAAK,KAAM,KAGTU,GAAe3E,OAAO,IAAMyD,GAAQ5B,GAAiBI,GAAeQ,GAAa,KAGjFmC,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,GACrBA,GAAe9F,IAAc8F,GAAe7F,IAC5C6F,GAAe5F,IAAW4F,GAAe3F,IACzC2F,GAAe1F,IAAY0F,GAAezF,IAC1CyF,GAAexF,IAAmBwF,GAAevF,IACjDuF,GAAetF,KAAa,EAC5BsF,GAAetH,GAAWsH,GAAerH,GACzCqH,GAAehG,IAAkBgG,GAAenH,GAChDmH,GAAe/F,IAAe+F,GAAelH,GAC7CkH,GAAehH,GAAYgH,GAAe/G,GAC1C+G,GAAe7G,GAAU6G,GAAe5G,GACxC4G,GAAe1G,IAAa0G,GAAevG,IAC3CuG,GAAetG,IAAUsG,GAAerG,IACxCqG,GAAelG,KAAc,EAG7B,IAAImG,GAAgB,GACpBA,GAAcvH,GAAWuH,GAActH,GACvCsH,GAAcjG,IAAkBiG,GAAchG,IAC9CgG,GAAcpH,GAAWoH,GAAcnH,GACvCmH,GAAc/F,IAAc+F,GAAc9F,IAC1C8F,GAAc7F,IAAW6F,GAAc5F,IACvC4F,GAAc3F,IAAY2F,GAAc9G,GACxC8G,GAAc7G,GAAa6G,GAAc3G,IACzC2G,GAAcxG,IAAawG,GAAcvG,IACzCuG,GAActG,IAAasG,GAAcrG,IACzCqG,GAAc1F,IAAY0F,GAAczF,IACxCyF,GAAcxF,IAAawF,GAAcvF,KAAa,EACtDuF,GAAcjH,GAAYiH,GAAchH,GACxCgH,GAAcnG,KAAc,EAG5B,IAAIoG,GAAkB,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAIxBC,GAAc,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SAIHC,GAAgB,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,KAIPC,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfC,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAOC,SAAWA,QAAUD,EAGhFE,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,GAAOL,IAAcG,IAAYG,SAAS,cAATA,GAGjCC,GAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,GAAaH,IAAgC,iBAAVI,GAAsBA,IAAWA,EAAOF,UAAYE,EAGvFC,GAAgBF,IAAcA,GAAWF,UAAYD,GAGrDM,GAAcD,IAAiBZ,GAAWc,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQN,IAAcA,GAAWO,SAAWP,GAAWO,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAOvM,KAXI,GAeXwM,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKhU,QACX,KAAK,EAAG,OAAO8T,EAAKG,KAAKF,GACzB,KAAK,EAAG,OAAOD,EAAKG,KAAKF,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKG,KAAKF,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKG,KAAKF,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASE,GAAgBC,EAAOC,EAAQC,EAAUC,GAChD,IAAIC,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,QAASuU,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GAClBH,EAAOE,EAAaE,EAAOH,EAASG,GAAQL,GAE9C,OAAOG,EAYT,SAASG,GAAUN,EAAOE,GACxB,IAAIE,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,QAASuU,EAAQvU,EACf,IAA6C,IAAzCqU,EAASF,EAAMI,GAAQA,EAAOJ,GAChC,MAGJ,OAAOA,EAYT,SAASO,GAAeP,EAAOE,GAC7B,IAAIrU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,MAAOA,IACL,IAA+C,IAA3CqU,EAASF,EAAMnU,GAASA,EAAQmU,GAClC,MAGJ,OAAOA,EAaT,SAASQ,GAAWR,EAAOS,GACzB,IAAIL,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,QAASuU,EAAQvU,EACf,IAAK4U,EAAUT,EAAMI,GAAQA,EAAOJ,GAClC,OAAO,EAGX,OAAO,EAYT,SAASU,GAAYV,EAAOS,GAC1B,IAAIL,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACnC8U,EAAW,EACXhQ,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BrP,EAAOgQ,KAAcN,GAGzB,OAAO1P,EAYT,SAASiQ,GAAcZ,EAAOK,GAC5B,IAAIxU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,QAASA,GAAUgV,GAAYb,EAAOK,EAAO,IAAM,EAYrD,SAASS,GAAkBd,EAAOK,EAAOU,GACvC,IAAIX,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,QAASuU,EAAQvU,EACf,GAAIkV,EAAWV,EAAOL,EAAMI,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASY,GAAShB,EAAOE,GACvB,IAAIE,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACnC8E,EAASsQ,MAAMpV,GAEnB,QAASuU,EAAQvU,EACf8E,EAAOyP,GAASF,EAASF,EAAMI,GAAQA,EAAOJ,GAEhD,OAAOrP,EAWT,SAASuQ,GAAUlB,EAAOmB,GACxB,IAAIf,GAAS,EACTvU,EAASsV,EAAOtV,OAChBuV,EAASpB,EAAMnU,OAEnB,QAASuU,EAAQvU,EACfmU,EAAMoB,EAAShB,GAASe,EAAOf,GAEjC,OAAOJ,EAeT,SAASqB,GAAYrB,EAAOE,EAAUC,EAAamB,GACjD,IAAIlB,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEnCyV,GAAazV,IACfsU,EAAcH,IAAQI,IAExB,QAASA,EAAQvU,EACfsU,EAAcD,EAASC,EAAaH,EAAMI,GAAQA,EAAOJ,GAE3D,OAAOG,EAeT,SAASoB,GAAiBvB,EAAOE,EAAUC,EAAamB,GACtD,IAAIzV,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACnCyV,GAAazV,IACfsU,EAAcH,IAAQnU,IAExB,MAAOA,IACLsU,EAAcD,EAASC,EAAaH,EAAMnU,GAASA,EAAQmU,GAE7D,OAAOG,EAaT,SAASqB,GAAUxB,EAAOS,GACxB,IAAIL,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OAEvC,QAASuU,EAAQvU,EACf,GAAI4U,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIyB,GAAYC,GAAa,UAS7B,SAASC,GAAaC,GACpB,OAAOA,EAAOC,MAAM,IAUtB,SAASC,GAAWF,GAClB,OAAOA,EAAOvX,MAAM8O,KAAgB,GActC,SAAS4I,GAAYC,EAAYvB,EAAWwB,GAC1C,IAAItR,EAOJ,OANAsR,EAASD,GAAY,SAAS3B,EAAO6B,EAAKF,GACxC,GAAIvB,EAAUJ,EAAO6B,EAAKF,GAExB,OADArR,EAASuR,GACF,KAGJvR,EAcT,SAASwR,GAAcnC,EAAOS,EAAW2B,EAAWC,GAClD,IAAIxW,EAASmU,EAAMnU,OACfuU,EAAQgC,GAAaC,EAAY,GAAK,GAE1C,MAAQA,EAAYjC,MAAYA,EAAQvU,EACtC,GAAI4U,EAAUT,EAAMI,GAAQA,EAAOJ,GACjC,OAAOI,EAGX,OAAQ,EAYV,SAASS,GAAYb,EAAOK,EAAO+B,GACjC,OAAO/B,IAAUA,EACbiC,GAActC,EAAOK,EAAO+B,GAC5BD,GAAcnC,EAAOuC,GAAWH,GAatC,SAASI,GAAgBxC,EAAOK,EAAO+B,EAAWrB,GAChD,IAAIX,EAAQgC,EAAY,EACpBvW,EAASmU,EAAMnU,OAEnB,QAASuU,EAAQvU,EACf,GAAIkV,EAAWf,EAAMI,GAAQC,GAC3B,OAAOD,EAGX,OAAQ,EAUV,SAASmC,GAAUlC,GACjB,OAAOA,IAAUA,EAYnB,SAASoC,GAASzC,EAAOE,GACvB,IAAIrU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAAU6W,GAAQ1C,EAAOE,GAAYrU,EAAUyJ,EAUxD,SAASoM,GAAaQ,GACpB,OAAO,SAASS,GACd,OAAiB,MAAVA,EAAiBtP,EAAYsP,EAAOT,IAW/C,SAASU,GAAeD,GACtB,OAAO,SAAST,GACd,OAAiB,MAAVS,EAAiBtP,EAAYsP,EAAOT,IAiB/C,SAASW,GAAWb,EAAY9B,EAAUC,EAAamB,EAAWW,GAMhE,OALAA,EAASD,GAAY,SAAS3B,EAAOD,EAAO4B,GAC1C7B,EAAcmB,GACTA,GAAY,EAAOjB,GACpBH,EAASC,EAAaE,EAAOD,EAAO4B,MAEnC7B,EAaT,SAAS2C,GAAW9C,EAAO+C,GACzB,IAAIlX,EAASmU,EAAMnU,OAEnBmU,EAAM3Q,KAAK0T,GACX,MAAOlX,IACLmU,EAAMnU,GAAUmU,EAAMnU,GAAQwU,MAEhC,OAAOL,EAYT,SAAS0C,GAAQ1C,EAAOE,GACtB,IAAIvP,EACAyP,GAAS,EACTvU,EAASmU,EAAMnU,OAEnB,QAASuU,EAAQvU,EAAQ,CACvB,IAAImX,EAAU9C,EAASF,EAAMI,IACzB4C,IAAY3P,IACd1C,EAASA,IAAW0C,EAAY2P,EAAWrS,EAASqS,GAGxD,OAAOrS,EAYT,SAASsS,GAAUnV,EAAGoS,GACpB,IAAIE,GAAS,EACTzP,EAASsQ,MAAMnT,GAEnB,QAASsS,EAAQtS,EACf6C,EAAOyP,GAASF,EAASE,GAE3B,OAAOzP,EAYT,SAASuS,GAAYP,EAAQhY,GAC3B,OAAOqW,GAASrW,GAAO,SAASuX,GAC9B,MAAO,CAACA,EAAKS,EAAOT,OAWxB,SAASiB,GAAUxD,GACjB,OAAO,SAASU,GACd,OAAOV,EAAKU,IAchB,SAAS+C,GAAWT,EAAQhY,GAC1B,OAAOqW,GAASrW,GAAO,SAASuX,GAC9B,OAAOS,EAAOT,MAYlB,SAASmB,GAASC,EAAOpB,GACvB,OAAOoB,EAAMC,IAAIrB,GAYnB,SAASsB,GAAgBC,EAAYC,GACnC,IAAItD,GAAS,EACTvU,EAAS4X,EAAW5X,OAExB,QAASuU,EAAQvU,GAAUgV,GAAY6C,EAAYD,EAAWrD,GAAQ,IAAM,GAC5E,OAAOA,EAYT,SAASuD,GAAcF,EAAYC,GACjC,IAAItD,EAAQqD,EAAW5X,OAEvB,MAAOuU,KAAWS,GAAY6C,EAAYD,EAAWrD,GAAQ,IAAM,GACnE,OAAOA,EAWT,SAASwD,GAAa5D,EAAO6D,GAC3B,IAAIhY,EAASmU,EAAMnU,OACf8E,EAAS,EAEb,MAAO9E,IACDmU,EAAMnU,KAAYgY,KAClBlT,EAGN,OAAOA,EAWT,IAAImT,GAAelB,GAAezF,IAS9B4G,GAAiBnB,GAAexF,IASpC,SAAS4G,GAAiBC,GACxB,MAAO,KAAO3G,GAAc2G,GAW9B,SAASC,GAASvB,EAAQT,GACxB,OAAiB,MAAVS,EAAiBtP,EAAYsP,EAAOT,GAU7C,SAASiC,GAAWvC,GAClB,OAAO/E,GAAauH,KAAKxC,GAU3B,SAASyC,GAAezC,GACtB,OAAO9E,GAAiBsH,KAAKxC,GAU/B,SAAS0C,GAAgBC,GACvB,IAAI3Z,EACA+F,EAAS,GAEb,QAAS/F,EAAO2Z,EAASC,QAAQC,KAC/B9T,EAAOV,KAAKrF,EAAKyV,OAEnB,OAAO1P,EAUT,SAAS+T,GAAW3V,GAClB,IAAIqR,GAAS,EACTzP,EAASsQ,MAAMlS,EAAI4V,MAKvB,OAHA5V,EAAIQ,SAAQ,SAAS8Q,EAAO6B,GAC1BvR,IAASyP,GAAS,CAAC8B,EAAK7B,MAEnB1P,EAWT,SAASiU,GAAQjF,EAAMkF,GACrB,OAAO,SAASC,GACd,OAAOnF,EAAKkF,EAAUC,KAa1B,SAASC,GAAe/E,EAAO6D,GAC7B,IAAIzD,GAAS,EACTvU,EAASmU,EAAMnU,OACf8U,EAAW,EACXhQ,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdC,IAAUwD,GAAexD,IAAUzM,IACrCoM,EAAMI,GAASxM,EACfjD,EAAOgQ,KAAcP,GAGzB,OAAOzP,EAUT,SAASqU,GAAWC,GAClB,IAAI7E,GAAS,EACTzP,EAASsQ,MAAMgE,EAAIN,MAKvB,OAHAM,EAAI1V,SAAQ,SAAS8Q,GACnB1P,IAASyP,GAASC,KAEb1P,EAUT,SAASuU,GAAWD,GAClB,IAAI7E,GAAS,EACTzP,EAASsQ,MAAMgE,EAAIN,MAKvB,OAHAM,EAAI1V,SAAQ,SAAS8Q,GACnB1P,IAASyP,GAAS,CAACC,EAAOA,MAErB1P,EAaT,SAAS2R,GAActC,EAAOK,EAAO+B,GACnC,IAAIhC,EAAQgC,EAAY,EACpBvW,EAASmU,EAAMnU,OAEnB,QAASuU,EAAQvU,EACf,GAAImU,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAQ,EAaV,SAAS+E,GAAkBnF,EAAOK,EAAO+B,GACvC,IAAIhC,EAAQgC,EAAY,EACxB,MAAOhC,IACL,GAAIJ,EAAMI,KAAWC,EACnB,OAAOD,EAGX,OAAOA,EAUT,SAASgF,GAAWxD,GAClB,OAAOuC,GAAWvC,GACdyD,GAAYzD,GACZH,GAAUG,GAUhB,SAAS0D,GAAc1D,GACrB,OAAOuC,GAAWvC,GACd2D,GAAe3D,GACfD,GAAaC,GAUnB,IAAI4D,GAAmB5C,GAAevF,IAStC,SAASgI,GAAYzD,GACnB,IAAIjR,EAASgM,GAAU8I,UAAY,EACnC,MAAO9I,GAAUyH,KAAKxC,KAClBjR,EAEJ,OAAOA,EAUT,SAAS4U,GAAe3D,GACtB,OAAOA,EAAOvX,MAAMsS,KAAc,GAUpC,SAAS+I,GAAa9D,GACpB,OAAOA,EAAOvX,MAAMuS,KAAkB,GAkCxC,IAAI+I,GAAe,SAAUA,EAAaC,GACxCA,EAAqB,MAAXA,EAAkB5H,GAAO6H,GAAEC,SAAS9H,GAAKH,SAAU+H,EAASC,GAAEE,KAAK/H,GAAMjB,KAGnF,IAAIkE,EAAQ2E,EAAQ3E,MAChB+E,EAAOJ,EAAQI,KACfC,EAAQL,EAAQK,MAChBhI,GAAW2H,EAAQ3H,SACnBiI,GAAON,EAAQM,KACfrI,GAAS+H,EAAQ/H,OACjB3F,GAAS0N,EAAQ1N,OACjBiO,GAASP,EAAQO,OACjBC,GAAYR,EAAQQ,UAGpBC,GAAapF,EAAMqF,UACnBC,GAAYtI,GAASqI,UACrBE,GAAc3I,GAAOyI,UAGrBG,GAAab,EAAQ,sBAGrBc,GAAeH,GAAUI,SAGzBC,GAAiBJ,GAAYI,eAG7BC,GAAY,EAGZC,GAAc,WAChB,IAAIC,EAAM,SAASC,KAAKP,IAAcA,GAAWQ,MAAQR,GAAWQ,KAAKC,UAAY,IACrF,OAAOH,EAAO,iBAAmBA,EAAO,GAFzB,GAUbI,GAAuBX,GAAYG,SAGnCS,GAAmBV,GAAa5G,KAAKjC,IAGrCwJ,GAAUrJ,GAAK6H,EAGfyB,GAAapP,GAAO,IACtBwO,GAAa5G,KAAK8G,IAAgBzV,QAAQwH,GAAc,QACvDxH,QAAQ,yDAA0D,SAAW,KAI5EoW,GAAShJ,GAAgBqH,EAAQ2B,OAASlU,EAC1CmU,GAAS5B,EAAQ4B,OACjBC,GAAa7B,EAAQ6B,WACrBC,GAAcH,GAASA,GAAOG,YAAcrU,EAC5CsU,GAAe/C,GAAQ/G,GAAO+J,eAAgB/J,IAC9CgK,GAAehK,GAAOiK,OACtBC,GAAuBvB,GAAYuB,qBACnCC,GAAS3B,GAAW2B,OACpBC,GAAmBT,GAASA,GAAOU,mBAAqB7U,EACxD8U,GAAcX,GAASA,GAAOjD,SAAWlR,EACzC+U,GAAiBZ,GAASA,GAAOa,YAAchV,EAE/CiV,GAAkB,WACpB,IACE,IAAI3I,EAAO4I,GAAU1K,GAAQ,kBAE7B,OADA8B,EAAK,GAAI,GAAI,IACNA,EACP,MAAOrN,KALU,GASjBkW,GAAkB5C,EAAQhZ,eAAiBoR,GAAKpR,cAAgBgZ,EAAQhZ,aACxE6b,GAASzC,GAAQA,EAAK0C,MAAQ1K,GAAKgI,KAAK0C,KAAO1C,EAAK0C,IACpDC,GAAgB/C,EAAQnZ,aAAeuR,GAAKvR,YAAcmZ,EAAQnZ,WAGlEmc,GAAa1C,GAAK2C,KAClBC,GAAc5C,GAAK6C,MACnBC,GAAmBnL,GAAOoL,sBAC1BC,GAAiB3B,GAASA,GAAO4B,SAAW9V,EAC5C+V,GAAiBxD,EAAQyD,SACzBC,GAAajD,GAAWlK,KACxBoN,GAAa3E,GAAQ/G,GAAOoJ,KAAMpJ,IAClC2L,GAAYtD,GAAKuD,IACjBC,GAAYxD,GAAKyD,IACjBC,GAAY5D,EAAK0C,IACjBmB,GAAiBjE,EAAQlI,SACzBoM,GAAe5D,GAAK6D,OACpBC,GAAgB3D,GAAW4D,QAG3BC,GAAW3B,GAAU3C,EAAS,YAC9BuE,GAAM5B,GAAU3C,EAAS,OACzBwE,GAAU7B,GAAU3C,EAAS,WAC7BxS,GAAMmV,GAAU3C,EAAS,OACzByE,GAAU9B,GAAU3C,EAAS,WAC7B0E,GAAe/B,GAAU1K,GAAQ,UAGjC0M,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAASR,IAC9BS,GAAgBD,GAASP,IACzBS,GAAoBF,GAASN,IAC7BS,GAAgBH,GAAStX,IACzB0X,GAAoBJ,GAASL,IAG7BU,GAAcvD,GAASA,GAAOlB,UAAYjT,EAC1C2X,GAAgBD,GAAcA,GAAYE,QAAU5X,EACpD6X,GAAiBH,GAAcA,GAAYpE,SAAWtT,EAyH1D,SAAS8X,GAAO9K,GACd,GAAI+K,GAAa/K,KAAWgL,GAAQhL,MAAYA,aAAiBiL,IAAc,CAC7E,GAAIjL,aAAiBkL,GACnB,OAAOlL,EAET,GAAIuG,GAAe9G,KAAKO,EAAO,eAC7B,OAAOmL,GAAanL,GAGxB,OAAO,IAAIkL,GAAclL,GAW3B,IAAIoL,GAAc,WAChB,SAAS9I,KACT,OAAO,SAAS+I,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAI7D,GACF,OAAOA,GAAa6D,GAEtB/I,EAAO2D,UAAYoF,EACnB,IAAI/a,EAAS,IAAIgS,EAEjB,OADAA,EAAO2D,UAAYjT,EACZ1C,GAZM,GAqBjB,SAASib,MAWT,SAASL,GAAclL,EAAOwL,GAC5BtiB,KAAKuiB,YAAczL,EACnB9W,KAAKwiB,YAAc,GACnBxiB,KAAKyiB,YAAcH,EACnBtiB,KAAK0iB,UAAY,EACjB1iB,KAAK2iB,WAAa7Y,EAgFpB,SAASiY,GAAYjL,GACnB9W,KAAKuiB,YAAczL,EACnB9W,KAAKwiB,YAAc,GACnBxiB,KAAK4iB,QAAU,EACf5iB,KAAK6iB,cAAe,EACpB7iB,KAAK8iB,cAAgB,GACrB9iB,KAAK+iB,cAAgB/W,EACrBhM,KAAKgjB,UAAY,GAWnB,SAASC,KACP,IAAI7b,EAAS,IAAI2a,GAAY/hB,KAAKuiB,aAOlC,OANAnb,EAAOob,YAAcU,GAAUljB,KAAKwiB,aACpCpb,EAAOwb,QAAU5iB,KAAK4iB,QACtBxb,EAAOyb,aAAe7iB,KAAK6iB,aAC3Bzb,EAAO0b,cAAgBI,GAAUljB,KAAK8iB,eACtC1b,EAAO2b,cAAgB/iB,KAAK+iB,cAC5B3b,EAAO4b,UAAYE,GAAUljB,KAAKgjB,WAC3B5b,EAWT,SAAS+b,KACP,GAAInjB,KAAK6iB,aAAc,CACrB,IAAIzb,EAAS,IAAI2a,GAAY/hB,MAC7BoH,EAAOwb,SAAW,EAClBxb,EAAOyb,cAAe,OAEtBzb,EAASpH,KAAKojB,QACdhc,EAAOwb,UAAY,EAErB,OAAOxb,EAWT,SAASic,KACP,IAAI5M,EAAQzW,KAAKuiB,YAAYzL,QACzBwM,EAAMtjB,KAAK4iB,QACXW,EAAQzB,GAAQrL,GAChB+M,EAAUF,EAAM,EAChBG,EAAYF,EAAQ9M,EAAMnU,OAAS,EACnCM,EAAO8gB,GAAQ,EAAGD,EAAWzjB,KAAKgjB,WAClCW,EAAQ/gB,EAAK+gB,MACbC,EAAMhhB,EAAKghB,IACXthB,EAASshB,EAAMD,EACf9M,EAAQ2M,EAAUI,EAAOD,EAAQ,EACjCE,EAAY7jB,KAAK8iB,cACjBgB,EAAaD,EAAUvhB,OACvB8U,EAAW,EACX2M,EAAY5D,GAAU7d,EAAQtC,KAAK+iB,eAEvC,IAAKQ,IAAWC,GAAWC,GAAanhB,GAAUyhB,GAAazhB,EAC7D,OAAO0hB,GAAiBvN,EAAOzW,KAAKwiB,aAEtC,IAAIpb,EAAS,GAEb6c,EACA,MAAO3hB,KAAY8U,EAAW2M,EAAW,CACvClN,GAASyM,EAET,IAAIY,GAAa,EACbpN,EAAQL,EAAMI,GAElB,QAASqN,EAAYJ,EAAY,CAC/B,IAAIziB,EAAOwiB,EAAUK,GACjBvN,EAAWtV,EAAKsV,SAChBnU,EAAOnB,EAAKmB,KACZhB,EAAWmV,EAASG,GAExB,GAAItU,GAAQkJ,EACVoL,EAAQtV,OACH,IAAKA,EAAU,CACpB,GAAIgB,GAAQiJ,EACV,SAASwY,EAET,MAAMA,GAIZ7c,EAAOgQ,KAAcN,EAEvB,OAAO1P,EAgBT,SAAS+c,GAAKC,GACZ,IAAIvN,GAAS,EACTvU,EAAoB,MAAX8hB,EAAkB,EAAIA,EAAQ9hB,OAE3CtC,KAAKqkB,QACL,QAASxN,EAAQvU,EAAQ,CACvB,IAAIgiB,EAAQF,EAAQvN,GACpB7W,KAAK0b,IAAI4I,EAAM,GAAIA,EAAM,KAW7B,SAASC,KACPvkB,KAAKwkB,SAAWzD,GAAeA,GAAa,MAAQ,GACpD/gB,KAAKob,KAAO,EAad,SAASqJ,GAAW9L,GAClB,IAAIvR,EAASpH,KAAKga,IAAIrB,WAAe3Y,KAAKwkB,SAAS7L,GAEnD,OADA3Y,KAAKob,MAAQhU,EAAS,EAAI,EACnBA,EAYT,SAASsd,GAAQ/L,GACf,IAAItX,EAAOrB,KAAKwkB,SAChB,GAAIzD,GAAc,CAChB,IAAI3Z,EAAS/F,EAAKsX,GAClB,OAAOvR,IAAW+C,EAAiBL,EAAY1C,EAEjD,OAAOiW,GAAe9G,KAAKlV,EAAMsX,GAAOtX,EAAKsX,GAAO7O,EAYtD,SAAS6a,GAAQhM,GACf,IAAItX,EAAOrB,KAAKwkB,SAChB,OAAOzD,GAAgB1f,EAAKsX,KAAS7O,EAAauT,GAAe9G,KAAKlV,EAAMsX,GAa9E,SAASiM,GAAQjM,EAAK7B,GACpB,IAAIzV,EAAOrB,KAAKwkB,SAGhB,OAFAxkB,KAAKob,MAAQpb,KAAKga,IAAIrB,GAAO,EAAI,EACjCtX,EAAKsX,GAAQoI,IAAgBjK,IAAUhN,EAAaK,EAAiB2M,EAC9D9W,KAmBT,SAAS6kB,GAAUT,GACjB,IAAIvN,GAAS,EACTvU,EAAoB,MAAX8hB,EAAkB,EAAIA,EAAQ9hB,OAE3CtC,KAAKqkB,QACL,QAASxN,EAAQvU,EAAQ,CACvB,IAAIgiB,EAAQF,EAAQvN,GACpB7W,KAAK0b,IAAI4I,EAAM,GAAIA,EAAM,KAW7B,SAASQ,KACP9kB,KAAKwkB,SAAW,GAChBxkB,KAAKob,KAAO,EAYd,SAAS2J,GAAgBpM,GACvB,IAAItX,EAAOrB,KAAKwkB,SACZ3N,EAAQmO,GAAa3jB,EAAMsX,GAE/B,GAAI9B,EAAQ,EACV,OAAO,EAET,IAAIqF,EAAY7a,EAAKiB,OAAS,EAO9B,OANIuU,GAASqF,EACX7a,EAAK4jB,MAELxG,GAAOlI,KAAKlV,EAAMwV,EAAO,KAEzB7W,KAAKob,MACA,EAYT,SAAS8J,GAAavM,GACpB,IAAItX,EAAOrB,KAAKwkB,SACZ3N,EAAQmO,GAAa3jB,EAAMsX,GAE/B,OAAO9B,EAAQ,EAAI/M,EAAYzI,EAAKwV,GAAO,GAY7C,SAASsO,GAAaxM,GACpB,OAAOqM,GAAahlB,KAAKwkB,SAAU7L,IAAQ,EAa7C,SAASyM,GAAazM,EAAK7B,GACzB,IAAIzV,EAAOrB,KAAKwkB,SACZ3N,EAAQmO,GAAa3jB,EAAMsX,GAQ/B,OANI9B,EAAQ,KACR7W,KAAKob,KACP/Z,EAAKqF,KAAK,CAACiS,EAAK7B,KAEhBzV,EAAKwV,GAAO,GAAKC,EAEZ9W,KAmBT,SAASqlB,GAASjB,GAChB,IAAIvN,GAAS,EACTvU,EAAoB,MAAX8hB,EAAkB,EAAIA,EAAQ9hB,OAE3CtC,KAAKqkB,QACL,QAASxN,EAAQvU,EAAQ,CACvB,IAAIgiB,EAAQF,EAAQvN,GACpB7W,KAAK0b,IAAI4I,EAAM,GAAIA,EAAM,KAW7B,SAASgB,KACPtlB,KAAKob,KAAO,EACZpb,KAAKwkB,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKvD,IAAOiE,IACnB,OAAU,IAAIV,IAalB,SAASoB,GAAe5M,GACtB,IAAIvR,EAASoe,GAAWxlB,KAAM2Y,GAAK,UAAUA,GAE7C,OADA3Y,KAAKob,MAAQhU,EAAS,EAAI,EACnBA,EAYT,SAASqe,GAAY9M,GACnB,OAAO6M,GAAWxlB,KAAM2Y,GAAK+M,IAAI/M,GAYnC,SAASgN,GAAYhN,GACnB,OAAO6M,GAAWxlB,KAAM2Y,GAAKqB,IAAIrB,GAanC,SAASiN,GAAYjN,EAAK7B,GACxB,IAAIzV,EAAOmkB,GAAWxlB,KAAM2Y,GACxByC,EAAO/Z,EAAK+Z,KAIhB,OAFA/Z,EAAKqa,IAAI/C,EAAK7B,GACd9W,KAAKob,MAAQ/Z,EAAK+Z,MAAQA,EAAO,EAAI,EAC9Bpb,KAoBT,SAAS6lB,GAASjO,GAChB,IAAIf,GAAS,EACTvU,EAAmB,MAAVsV,EAAiB,EAAIA,EAAOtV,OAEzCtC,KAAKwkB,SAAW,IAAIa,GACpB,QAASxO,EAAQvU,EACftC,KAAK8lB,IAAIlO,EAAOf,IAcpB,SAASkP,GAAYjP,GAEnB,OADA9W,KAAKwkB,SAAS9I,IAAI5E,EAAO3M,GAClBnK,KAYT,SAASgmB,GAAYlP,GACnB,OAAO9W,KAAKwkB,SAASxK,IAAIlD,GAgB3B,SAASmP,GAAM7B,GACb,IAAI/iB,EAAOrB,KAAKwkB,SAAW,IAAIK,GAAUT,GACzCpkB,KAAKob,KAAO/Z,EAAK+Z,KAUnB,SAAS8K,KACPlmB,KAAKwkB,SAAW,IAAIK,GACpB7kB,KAAKob,KAAO,EAYd,SAAS+K,GAAYxN,GACnB,IAAItX,EAAOrB,KAAKwkB,SACZpd,EAAS/F,EAAK,UAAUsX,GAG5B,OADA3Y,KAAKob,KAAO/Z,EAAK+Z,KACVhU,EAYT,SAASgf,GAASzN,GAChB,OAAO3Y,KAAKwkB,SAASkB,IAAI/M,GAY3B,SAAS0N,GAAS1N,GAChB,OAAO3Y,KAAKwkB,SAASxK,IAAIrB,GAa3B,SAAS2N,GAAS3N,EAAK7B,GACrB,IAAIzV,EAAOrB,KAAKwkB,SAChB,GAAInjB,aAAgBwjB,GAAW,CAC7B,IAAIld,EAAQtG,EAAKmjB,SACjB,IAAK5D,IAAQjZ,EAAMrF,OAAS0H,EAAmB,EAG7C,OAFArC,EAAMjB,KAAK,CAACiS,EAAK7B,IACjB9W,KAAKob,OAAS/Z,EAAK+Z,KACZpb,KAETqB,EAAOrB,KAAKwkB,SAAW,IAAIa,GAAS1d,GAItC,OAFAtG,EAAKqa,IAAI/C,EAAK7B,GACd9W,KAAKob,KAAO/Z,EAAK+Z,KACVpb,KAoBT,SAASumB,GAAczP,EAAO0P,GAC5B,IAAIjD,EAAQzB,GAAQhL,GAChB2P,GAASlD,GAASmD,GAAY5P,GAC9B6P,GAAUpD,IAAUkD,GAAS7G,GAAS9I,GACtC8P,GAAUrD,IAAUkD,IAAUE,GAAUzQ,GAAaY,GACrD+P,EAActD,GAASkD,GAASE,GAAUC,EAC1Cxf,EAASyf,EAAcnN,GAAU5C,EAAMxU,OAAQsa,IAAU,GACzDta,EAAS8E,EAAO9E,OAEpB,IAAK,IAAIqW,KAAO7B,GACT0P,IAAanJ,GAAe9G,KAAKO,EAAO6B,IACvCkO,IAEQ,UAAPlO,GAECgO,IAAkB,UAAPhO,GAA0B,UAAPA,IAE9BiO,IAAkB,UAAPjO,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDmO,GAAQnO,EAAKrW,KAElB8E,EAAOV,KAAKiS,GAGhB,OAAOvR,EAUT,SAAS2f,GAAYtQ,GACnB,IAAInU,EAASmU,EAAMnU,OACnB,OAAOA,EAASmU,EAAMuQ,GAAW,EAAG1kB,EAAS,IAAMwH,EAWrD,SAASmd,GAAgBxQ,EAAOlS,GAC9B,OAAO2iB,GAAYhE,GAAUzM,GAAQ0Q,GAAU5iB,EAAG,EAAGkS,EAAMnU,SAU7D,SAAS8kB,GAAa3Q,GACpB,OAAOyQ,GAAYhE,GAAUzM,IAY/B,SAAS4Q,GAAiBjO,EAAQT,EAAK7B,IAChCA,IAAUhN,IAAcwd,GAAGlO,EAAOT,GAAM7B,IACxCA,IAAUhN,KAAe6O,KAAOS,KACnCmO,GAAgBnO,EAAQT,EAAK7B,GAcjC,SAAS0Q,GAAYpO,EAAQT,EAAK7B,GAChC,IAAI2Q,EAAWrO,EAAOT,GAChB0E,GAAe9G,KAAK6C,EAAQT,IAAQ2O,GAAGG,EAAU3Q,KAClDA,IAAUhN,GAAe6O,KAAOS,IACnCmO,GAAgBnO,EAAQT,EAAK7B,GAYjC,SAASkO,GAAavO,EAAOkC,GAC3B,IAAIrW,EAASmU,EAAMnU,OACnB,MAAOA,IACL,GAAIglB,GAAG7Q,EAAMnU,GAAQ,GAAIqW,GACvB,OAAOrW,EAGX,OAAQ,EAcV,SAASolB,GAAejP,EAAY/B,EAAQC,EAAUC,GAIpD,OAHA+Q,GAASlP,GAAY,SAAS3B,EAAO6B,EAAKF,GACxC/B,EAAOE,EAAaE,EAAOH,EAASG,GAAQ2B,MAEvC7B,EAYT,SAASgR,GAAWxO,EAAQxK,GAC1B,OAAOwK,GAAUyO,GAAWjZ,EAAQ8O,GAAK9O,GAASwK,GAYpD,SAAS0O,GAAa1O,EAAQxK,GAC5B,OAAOwK,GAAUyO,GAAWjZ,EAAQmZ,GAAOnZ,GAASwK,GAYtD,SAASmO,GAAgBnO,EAAQT,EAAK7B,GACzB,aAAP6B,GAAsBoG,GACxBA,GAAe3F,EAAQT,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS7B,EACT,UAAY,IAGdsC,EAAOT,GAAO7B,EAYlB,SAASkR,GAAO5O,EAAQ6O,GACtB,IAAIpR,GAAS,EACTvU,EAAS2lB,EAAM3lB,OACf8E,EAASsQ,EAAMpV,GACf4lB,EAAiB,MAAV9O,EAEX,QAASvC,EAAQvU,EACf8E,EAAOyP,GAASqR,EAAOpe,EAAY4b,GAAItM,EAAQ6O,EAAMpR,IAEvD,OAAOzP,EAYT,SAAS+f,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,IAAWA,IACTE,IAAUve,IACZqe,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUte,IACZqe,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUxR,EAAOyR,EAASC,EAAY7P,EAAKS,EAAQqP,GAC1D,IAAIrhB,EACAshB,EAASH,EAAUje,EACnBqe,EAASJ,EAAUhe,EACnBqe,EAASL,EAAU/d,EAKvB,GAHIge,IACFphB,EAASgS,EAASoP,EAAW1R,EAAO6B,EAAKS,EAAQqP,GAASD,EAAW1R,IAEnE1P,IAAW0C,EACb,OAAO1C,EAET,IAAKgb,GAAStL,GACZ,OAAOA,EAET,IAAIyM,EAAQzB,GAAQhL,GACpB,GAAIyM,GAEF,GADAnc,EAASyhB,GAAe/R,IACnB4R,EACH,OAAOxF,GAAUpM,EAAO1P,OAErB,CACL,IAAI0hB,EAAMC,GAAOjS,GACbkS,EAASF,GAAOnc,GAAWmc,GAAOlc,EAEtC,GAAIgT,GAAS9I,GACX,OAAOmS,GAAYnS,EAAO4R,GAE5B,GAAII,GAAO9b,IAAa8b,GAAO1c,GAAY4c,IAAW5P,GAEpD,GADAhS,EAAUuhB,GAAUK,EAAU,GAAKE,GAAgBpS,IAC9C4R,EACH,OAAOC,EACHQ,GAAcrS,EAAOgR,GAAa1gB,EAAQ0P,IAC1CsS,GAAYtS,EAAO8Q,GAAWxgB,EAAQ0P,QAEvC,CACL,IAAKnD,GAAcmV,GACjB,OAAO1P,EAAStC,EAAQ,GAE1B1P,EAASiiB,GAAevS,EAAOgS,EAAKJ,IAIxCD,IAAUA,EAAQ,IAAIxC,IACtB,IAAIqD,EAAUb,EAAM/C,IAAI5O,GACxB,GAAIwS,EACF,OAAOA,EAETb,EAAM/M,IAAI5E,EAAO1P,GAEb4O,GAAMc,GACRA,EAAM9Q,SAAQ,SAASujB,GACrBniB,EAAO0e,IAAIwC,GAAUiB,EAAUhB,EAASC,EAAYe,EAAUzS,EAAO2R,OAE9D7S,GAAMkB,IACfA,EAAM9Q,SAAQ,SAASujB,EAAU5Q,GAC/BvR,EAAOsU,IAAI/C,EAAK2P,GAAUiB,EAAUhB,EAASC,EAAY7P,EAAK7B,EAAO2R,OAIzE,IAAIe,EAAWZ,EACVD,EAASc,GAAeC,GACxBf,EAASZ,GAASrK,GAEnBtc,EAAQmiB,EAAQzZ,EAAY0f,EAAS1S,GASzC,OARAC,GAAU3V,GAAS0V,GAAO,SAASyS,EAAU5Q,GACvCvX,IACFuX,EAAM4Q,EACNA,EAAWzS,EAAM6B,IAGnB6O,GAAYpgB,EAAQuR,EAAK2P,GAAUiB,EAAUhB,EAASC,EAAY7P,EAAK7B,EAAO2R,OAEzErhB,EAUT,SAASuiB,GAAa/a,GACpB,IAAIxN,EAAQsc,GAAK9O,GACjB,OAAO,SAASwK,GACd,OAAOwQ,GAAexQ,EAAQxK,EAAQxN,IAY1C,SAASwoB,GAAexQ,EAAQxK,EAAQxN,GACtC,IAAIkB,EAASlB,EAAMkB,OACnB,GAAc,MAAV8W,EACF,OAAQ9W,EAEV8W,EAAS9E,GAAO8E,GAChB,MAAO9W,IAAU,CACf,IAAIqW,EAAMvX,EAAMkB,GACZ4U,EAAYtI,EAAO+J,GACnB7B,EAAQsC,EAAOT,GAEnB,GAAK7B,IAAUhN,KAAe6O,KAAOS,KAAalC,EAAUJ,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS+S,GAAUzT,EAAM0T,EAAMxT,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAIyG,GAAU3S,GAEtB,OAAOhH,IAAW,WAAakT,EAAKD,MAAMrM,EAAWwM,KAAUwT,GAcjE,SAASC,GAAetT,EAAOmB,EAAQjB,EAAUa,GAC/C,IAAIX,GAAS,EACTpU,EAAW4U,GACX2S,GAAW,EACX1nB,EAASmU,EAAMnU,OACf8E,EAAS,GACT6iB,EAAerS,EAAOtV,OAE1B,IAAKA,EACH,OAAO8E,EAELuP,IACFiB,EAASH,GAASG,EAAQgC,GAAUjD,KAElCa,GACF/U,EAAW8U,GACXyS,GAAW,GAEJpS,EAAOtV,QAAU0H,IACxBvH,EAAWqX,GACXkQ,GAAW,EACXpS,EAAS,IAAIiO,GAASjO,IAExBqM,EACA,QAASpN,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdrV,EAAuB,MAAZmV,EAAmBG,EAAQH,EAASG,GAGnD,GADAA,EAASU,GAAwB,IAAVV,EAAeA,EAAQ,EAC1CkT,GAAYxoB,IAAaA,EAAU,CACrC,IAAI0oB,EAAcD,EAClB,MAAOC,IACL,GAAItS,EAAOsS,KAAiB1oB,EAC1B,SAASyiB,EAGb7c,EAAOV,KAAKoQ,QAEJrU,EAASmV,EAAQpW,EAAUgW,IACnCpQ,EAAOV,KAAKoQ,GAGhB,OAAO1P,EAjkCTwa,GAAOuI,iBAAmB,CAQxB,OAAUrb,GAQV,SAAYC,GAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAK4S,KAKTA,GAAO7E,UAAYsF,GAAWtF,UAC9B6E,GAAO7E,UAAUqN,YAAcxI,GAE/BI,GAAcjF,UAAYmF,GAAWG,GAAWtF,WAChDiF,GAAcjF,UAAUqN,YAAcpI,GAsHtCD,GAAYhF,UAAYmF,GAAWG,GAAWtF,WAC9CgF,GAAYhF,UAAUqN,YAAcrI,GAoGpCoC,GAAKpH,UAAUsH,MAAQE,GACvBJ,GAAKpH,UAAU,UAAY0H,GAC3BN,GAAKpH,UAAU2I,IAAMhB,GACrBP,GAAKpH,UAAU/C,IAAM2K,GACrBR,GAAKpH,UAAUrB,IAAMkJ,GAiHrBC,GAAU9H,UAAUsH,MAAQS,GAC5BD,GAAU9H,UAAU,UAAYgI,GAChCF,GAAU9H,UAAU2I,IAAMR,GAC1BL,GAAU9H,UAAU/C,IAAMmL,GAC1BN,GAAU9H,UAAUrB,IAAM0J,GAmG1BC,GAAStI,UAAUsH,MAAQiB,GAC3BD,GAAStI,UAAU,UAAYwI,GAC/BF,GAAStI,UAAU2I,IAAMD,GACzBJ,GAAStI,UAAU/C,IAAM2L,GACzBN,GAAStI,UAAUrB,IAAMkK,GAmDzBC,GAAS9I,UAAU+I,IAAMD,GAAS9I,UAAUrW,KAAOqf,GACnDF,GAAS9I,UAAU/C,IAAMgM,GAkGzBC,GAAMlJ,UAAUsH,MAAQ6B,GACxBD,GAAMlJ,UAAU,UAAYoJ,GAC5BF,GAAMlJ,UAAU2I,IAAMU,GACtBH,GAAMlJ,UAAU/C,IAAMqM,GACtBJ,GAAMlJ,UAAUrB,IAAM4K,GA8btB,IAAIqB,GAAW0C,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUhS,EAAYvB,GAC7B,IAAI9P,GAAS,EAKb,OAJAugB,GAASlP,GAAY,SAAS3B,EAAOD,EAAO4B,GAE1C,OADArR,IAAW8P,EAAUJ,EAAOD,EAAO4B,GAC5BrR,KAEFA,EAaT,SAASsjB,GAAajU,EAAOE,EAAUa,GACrC,IAAIX,GAAS,EACTvU,EAASmU,EAAMnU,OAEnB,QAASuU,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACd4C,EAAU9C,EAASG,GAEvB,GAAe,MAAX2C,IAAoBjY,IAAasI,EAC5B2P,IAAYA,IAAYkR,GAASlR,GAClCjC,EAAWiC,EAASjY,IAE1B,IAAIA,EAAWiY,EACXrS,EAAS0P,EAGjB,OAAO1P,EAaT,SAASwjB,GAASnU,EAAOK,EAAO6M,EAAOC,GACrC,IAAIthB,EAASmU,EAAMnU,OAEnBqhB,EAAQkH,GAAUlH,GACdA,EAAQ,IACVA,GAASA,EAAQrhB,EAAS,EAAKA,EAASqhB,GAE1CC,EAAOA,IAAQ9Z,GAAa8Z,EAAMthB,EAAUA,EAASuoB,GAAUjH,GAC3DA,EAAM,IACRA,GAAOthB,GAETshB,EAAMD,EAAQC,EAAM,EAAIkH,GAASlH,GACjC,MAAOD,EAAQC,EACbnN,EAAMkN,KAAW7M,EAEnB,OAAOL,EAWT,SAASsU,GAAWtS,EAAYvB,GAC9B,IAAI9P,EAAS,GAMb,OALAugB,GAASlP,GAAY,SAAS3B,EAAOD,EAAO4B,GACtCvB,EAAUJ,EAAOD,EAAO4B,IAC1BrR,EAAOV,KAAKoQ,MAGT1P,EAcT,SAAS4jB,GAAYvU,EAAOwU,EAAO/T,EAAWgU,EAAU9jB,GACtD,IAAIyP,GAAS,EACTvU,EAASmU,EAAMnU,OAEnB4U,IAAcA,EAAYiU,IAC1B/jB,IAAWA,EAAS,IAEpB,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdoU,EAAQ,GAAK/T,EAAUJ,GACrBmU,EAAQ,EAEVD,GAAYlU,EAAOmU,EAAQ,EAAG/T,EAAWgU,EAAU9jB,GAEnDuQ,GAAUvQ,EAAQ0P,GAEVoU,IACV9jB,EAAOA,EAAO9E,QAAUwU,GAG5B,OAAO1P,EAcT,IAAIgkB,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASf,GAAWlR,EAAQzC,GAC1B,OAAOyC,GAAUgS,GAAQhS,EAAQzC,EAAU+G,IAW7C,SAAS8M,GAAgBpR,EAAQzC,GAC/B,OAAOyC,GAAUkS,GAAalS,EAAQzC,EAAU+G,IAYlD,SAAS6N,GAAcnS,EAAQhY,GAC7B,OAAO+V,GAAY/V,GAAO,SAASuX,GACjC,OAAO6S,GAAWpS,EAAOT,OAY7B,SAAS8S,GAAQrS,EAAQsS,GACvBA,EAAOC,GAASD,EAAMtS,GAEtB,IAAIvC,EAAQ,EACRvU,EAASopB,EAAKppB,OAElB,MAAiB,MAAV8W,GAAkBvC,EAAQvU,EAC/B8W,EAASA,EAAOwS,GAAMF,EAAK7U,OAE7B,OAAQA,GAASA,GAASvU,EAAU8W,EAAStP,EAc/C,SAAS+hB,GAAezS,EAAQoQ,EAAUsC,GACxC,IAAI1kB,EAASoiB,EAASpQ,GACtB,OAAO0I,GAAQ1I,GAAUhS,EAASuQ,GAAUvQ,EAAQ0kB,EAAY1S,IAUlE,SAAS2S,GAAWjV,GAClB,OAAa,MAATA,EACKA,IAAUhN,EAAYyD,GAAeR,GAEtC8R,IAAkBA,MAAkBvK,GAAOwC,GAC/CkV,GAAUlV,GACVmV,GAAenV,GAYrB,SAASoV,GAAOpV,EAAOqV,GACrB,OAAOrV,EAAQqV,EAWjB,SAASC,GAAQhT,EAAQT,GACvB,OAAiB,MAAVS,GAAkBiE,GAAe9G,KAAK6C,EAAQT,GAWvD,SAAS0T,GAAUjT,EAAQT,GACzB,OAAiB,MAAVS,GAAkBT,KAAOrE,GAAO8E,GAYzC,SAASkT,GAAYnE,EAAQxE,EAAOC,GAClC,OAAOuE,GAAUhI,GAAUwD,EAAOC,IAAQuE,EAASlI,GAAU0D,EAAOC,GAatE,SAAS2I,GAAiBC,EAAQ7V,EAAUa,GAC1C,IAAI/U,EAAW+U,EAAaD,GAAoBF,GAC5C/U,EAASkqB,EAAO,GAAGlqB,OACnBmqB,EAAYD,EAAOlqB,OACnBoqB,EAAWD,EACXE,EAASjV,EAAM+U,GACfG,EAAYC,IACZzlB,EAAS,GAEb,MAAOslB,IAAY,CACjB,IAAIjW,EAAQ+V,EAAOE,GACfA,GAAY/V,IACdF,EAAQgB,GAAShB,EAAOmD,GAAUjD,KAEpCiW,EAAYzM,GAAU1J,EAAMnU,OAAQsqB,GACpCD,EAAOD,IAAalV,IAAeb,GAAarU,GAAU,KAAOmU,EAAMnU,QAAU,KAC7E,IAAIujB,GAAS6G,GAAYjW,GACzB3M,EAEN2M,EAAQ+V,EAAO,GAEf,IAAI3V,GAAS,EACTiW,EAAOH,EAAO,GAElB1I,EACA,QAASpN,EAAQvU,GAAU8E,EAAO9E,OAASsqB,EAAW,CACpD,IAAI9V,EAAQL,EAAMI,GACdrV,EAAWmV,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASU,GAAwB,IAAVV,EAAeA,EAAQ,IACxCgW,EACEhT,GAASgT,EAAMtrB,GACfiB,EAAS2E,EAAQ5F,EAAUgW,IAC5B,CACLkV,EAAWD,EACX,QAASC,EAAU,CACjB,IAAI3S,EAAQ4S,EAAOD,GACnB,KAAM3S,EACED,GAASC,EAAOvY,GAChBiB,EAAS+pB,EAAOE,GAAWlrB,EAAUgW,IAE3C,SAASyM,EAGT6I,GACFA,EAAKpmB,KAAKlF,GAEZ4F,EAAOV,KAAKoQ,IAGhB,OAAO1P,EAcT,SAAS2lB,GAAa3T,EAAQ1C,EAAQC,EAAUC,GAI9C,OAHA0T,GAAWlR,GAAQ,SAAStC,EAAO6B,EAAKS,GACtC1C,EAAOE,EAAaD,EAASG,GAAQ6B,EAAKS,MAErCxC,EAaT,SAASoW,GAAW5T,EAAQsS,EAAMpV,GAChCoV,EAAOC,GAASD,EAAMtS,GACtBA,EAAS6T,GAAO7T,EAAQsS,GACxB,IAAItV,EAAiB,MAAVgD,EAAiBA,EAASA,EAAOwS,GAAMsB,GAAKxB,KACvD,OAAe,MAARtV,EAAetM,EAAYqM,GAAMC,EAAMgD,EAAQ9C,GAUxD,SAAS6W,GAAgBrW,GACvB,OAAO+K,GAAa/K,IAAUiV,GAAWjV,IAAU1K,EAUrD,SAASghB,GAAkBtW,GACzB,OAAO+K,GAAa/K,IAAUiV,GAAWjV,IAAUpJ,GAUrD,SAAS2f,GAAWvW,GAClB,OAAO+K,GAAa/K,IAAUiV,GAAWjV,IAAUtK,EAiBrD,SAAS8gB,GAAYxW,EAAOqV,EAAO5D,EAASC,EAAYC,GACtD,OAAI3R,IAAUqV,IAGD,MAATrV,GAA0B,MAATqV,IAAmBtK,GAAa/K,KAAW+K,GAAasK,GACpErV,IAAUA,GAASqV,IAAUA,EAE/BoB,GAAgBzW,EAAOqV,EAAO5D,EAASC,EAAY8E,GAAa7E,IAiBzE,SAAS8E,GAAgBnU,EAAQ+S,EAAO5D,EAASC,EAAYgF,EAAW/E,GACtE,IAAIgF,EAAW3L,GAAQ1I,GACnBsU,EAAW5L,GAAQqK,GACnBwB,EAASF,EAAWphB,EAAW0c,GAAO3P,GACtCwU,EAASF,EAAWrhB,EAAW0c,GAAOoD,GAE1CwB,EAASA,GAAUvhB,EAAUY,GAAY2gB,EACzCC,EAASA,GAAUxhB,EAAUY,GAAY4gB,EAEzC,IAAIC,EAAWF,GAAU3gB,GACrB8gB,EAAWF,GAAU5gB,GACrB+gB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAanO,GAASxG,GAAS,CACjC,IAAKwG,GAASuM,GACZ,OAAO,EAETsB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADApF,IAAUA,EAAQ,IAAIxC,IACdwH,GAAYvX,GAAakD,GAC7B4U,GAAY5U,EAAQ+S,EAAO5D,EAASC,EAAYgF,EAAW/E,GAC3DwF,GAAW7U,EAAQ+S,EAAOwB,EAAQpF,EAASC,EAAYgF,EAAW/E,GAExE,KAAMF,EAAU9d,GAAuB,CACrC,IAAIyjB,EAAeL,GAAYxQ,GAAe9G,KAAK6C,EAAQ,eACvD+U,EAAeL,GAAYzQ,GAAe9G,KAAK4V,EAAO,eAE1D,GAAI+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe9U,EAAOtC,QAAUsC,EAC/CiV,EAAeF,EAAehC,EAAMrV,QAAUqV,EAGlD,OADA1D,IAAUA,EAAQ,IAAIxC,IACfuH,EAAUY,EAAcC,EAAc9F,EAASC,EAAYC,IAGtE,QAAKsF,IAGLtF,IAAUA,EAAQ,IAAIxC,IACfqI,GAAalV,EAAQ+S,EAAO5D,EAASC,EAAYgF,EAAW/E,IAUrE,SAAS8F,GAAUzX,GACjB,OAAO+K,GAAa/K,IAAUiS,GAAOjS,IAAUjK,EAajD,SAAS2hB,GAAYpV,EAAQxK,EAAQ6f,EAAWjG,GAC9C,IAAI3R,EAAQ4X,EAAUnsB,OAClBA,EAASuU,EACT6X,GAAgBlG,EAEpB,GAAc,MAAVpP,EACF,OAAQ9W,EAEV8W,EAAS9E,GAAO8E,GAChB,MAAOvC,IAAS,CACd,IAAIxV,EAAOotB,EAAU5X,GACrB,GAAK6X,GAAgBrtB,EAAK,GAClBA,EAAK,KAAO+X,EAAO/X,EAAK,MACtBA,EAAK,KAAM+X,GAEnB,OAAO,EAGX,QAASvC,EAAQvU,EAAQ,CACvBjB,EAAOotB,EAAU5X,GACjB,IAAI8B,EAAMtX,EAAK,GACXomB,EAAWrO,EAAOT,GAClBgW,EAAWttB,EAAK,GAEpB,GAAIqtB,GAAgBrtB,EAAK,IACvB,GAAIomB,IAAa3d,KAAe6O,KAAOS,GACrC,OAAO,MAEJ,CACL,IAAIqP,EAAQ,IAAIxC,GAChB,GAAIuC,EACF,IAAIphB,EAASohB,EAAWf,EAAUkH,EAAUhW,EAAKS,EAAQxK,EAAQ6Z,GAEnE,KAAMrhB,IAAW0C,EACTwjB,GAAYqB,EAAUlH,EAAUhd,EAAuBC,EAAwB8d,EAAYC,GAC3FrhB,GAEN,OAAO,GAIb,OAAO,EAWT,SAASwnB,GAAa9X,GACpB,IAAKsL,GAAStL,IAAU+X,GAAS/X,GAC/B,OAAO,EAET,IAAIgY,EAAUtD,GAAW1U,GAASiH,GAAa7N,GAC/C,OAAO4e,EAAQjU,KAAKsG,GAASrK,IAU/B,SAASiY,GAAajY,GACpB,OAAO+K,GAAa/K,IAAUiV,GAAWjV,IAAU3J,GAUrD,SAAS6hB,GAAUlY,GACjB,OAAO+K,GAAa/K,IAAUiS,GAAOjS,IAAU1J,GAUjD,SAAS6hB,GAAiBnY,GACxB,OAAO+K,GAAa/K,IAClBoY,GAASpY,EAAMxU,WAAaoR,GAAeqY,GAAWjV,IAU1D,SAASqY,GAAarY,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKsY,GAEW,iBAATtY,EACFgL,GAAQhL,GACXuY,GAAoBvY,EAAM,GAAIA,EAAM,IACpCwY,GAAYxY,GAEXyY,GAASzY,GAUlB,SAAS0Y,GAASpW,GAChB,IAAKqW,GAAYrW,GACf,OAAO4G,GAAW5G,GAEpB,IAAIhS,EAAS,GACb,IAAK,IAAIuR,KAAOrE,GAAO8E,GACjBiE,GAAe9G,KAAK6C,EAAQT,IAAe,eAAPA,GACtCvR,EAAOV,KAAKiS,GAGhB,OAAOvR,EAUT,SAASsoB,GAAWtW,GAClB,IAAKgJ,GAAShJ,GACZ,OAAOuW,GAAavW,GAEtB,IAAIwW,EAAUH,GAAYrW,GACtBhS,EAAS,GAEb,IAAK,IAAIuR,KAAOS,GACD,eAAPT,IAAyBiX,GAAYvS,GAAe9G,KAAK6C,EAAQT,KACrEvR,EAAOV,KAAKiS,GAGhB,OAAOvR,EAYT,SAASyoB,GAAO/Y,EAAOqV,GACrB,OAAOrV,EAAQqV,EAWjB,SAAS2D,GAAQrX,EAAY9B,GAC3B,IAAIE,GAAS,EACTzP,EAAS2oB,GAAYtX,GAAcf,EAAMe,EAAWnW,QAAU,GAKlE,OAHAqlB,GAASlP,GAAY,SAAS3B,EAAO6B,EAAKF,GACxCrR,IAASyP,GAASF,EAASG,EAAO6B,EAAKF,MAElCrR,EAUT,SAASkoB,GAAY1gB,GACnB,IAAI6f,EAAYuB,GAAaphB,GAC7B,OAAwB,GAApB6f,EAAUnsB,QAAemsB,EAAU,GAAG,GACjCwB,GAAwBxB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASrV,GACd,OAAOA,IAAWxK,GAAU4f,GAAYpV,EAAQxK,EAAQ6f,IAY5D,SAASY,GAAoB3D,EAAMiD,GACjC,OAAIuB,GAAMxE,IAASyE,GAAmBxB,GAC7BsB,GAAwBrE,GAAMF,GAAOiD,GAEvC,SAASvV,GACd,IAAIqO,EAAW/B,GAAItM,EAAQsS,GAC3B,OAAQjE,IAAa3d,GAAa2d,IAAakH,EAC3CyB,GAAMhX,EAAQsS,GACd4B,GAAYqB,EAAUlH,EAAUhd,EAAuBC,IAe/D,SAAS2lB,GAAUjX,EAAQxK,EAAQ0hB,EAAU9H,EAAYC,GACnDrP,IAAWxK,GAGfwc,GAAQxc,GAAQ,SAAS+f,EAAUhW,GAEjC,GADA8P,IAAUA,EAAQ,IAAIxC,IAClB7D,GAASuM,GACX4B,GAAcnX,EAAQxK,EAAQ+J,EAAK2X,EAAUD,GAAW7H,EAAYC,OAEjE,CACH,IAAI+H,EAAWhI,EACXA,EAAWiI,GAAQrX,EAAQT,GAAMgW,EAAWhW,EAAM,GAAKS,EAAQxK,EAAQ6Z,GACvE3e,EAEA0mB,IAAa1mB,IACf0mB,EAAW7B,GAEbtH,GAAiBjO,EAAQT,EAAK6X,MAE/BzI,IAkBL,SAASwI,GAAcnX,EAAQxK,EAAQ+J,EAAK2X,EAAUI,EAAWlI,EAAYC,GAC3E,IAAIhB,EAAWgJ,GAAQrX,EAAQT,GAC3BgW,EAAW8B,GAAQ7hB,EAAQ+J,GAC3B2Q,EAAUb,EAAM/C,IAAIiJ,GAExB,GAAIrF,EACFjC,GAAiBjO,EAAQT,EAAK2Q,OADhC,CAIA,IAAIkH,EAAWhI,EACXA,EAAWf,EAAUkH,EAAWhW,EAAM,GAAKS,EAAQxK,EAAQ6Z,GAC3D3e,EAEAkgB,EAAWwG,IAAa1mB,EAE5B,GAAIkgB,EAAU,CACZ,IAAIzG,EAAQzB,GAAQ6M,GAChBhI,GAAUpD,GAAS3D,GAAS+O,GAC5BgC,GAAWpN,IAAUoD,GAAUzQ,GAAayY,GAEhD6B,EAAW7B,EACPpL,GAASoD,GAAUgK,EACjB7O,GAAQ2F,GACV+I,EAAW/I,EAEJmJ,GAAkBnJ,GACzB+I,EAAWtN,GAAUuE,GAEdd,GACPqD,GAAW,EACXwG,EAAWvH,GAAY0F,GAAU,IAE1BgC,GACP3G,GAAW,EACXwG,EAAWK,GAAgBlC,GAAU,IAGrC6B,EAAW,GAGNM,GAAcnC,IAAajI,GAAYiI,IAC9C6B,EAAW/I,EACPf,GAAYe,GACd+I,EAAWO,GAActJ,GAEjBrF,GAASqF,KAAa+D,GAAW/D,KACzC+I,EAAWtH,GAAgByF,KAI7B3E,GAAW,EAGXA,IAEFvB,EAAM/M,IAAIiT,EAAU6B,GACpBE,EAAUF,EAAU7B,EAAU2B,EAAU9H,EAAYC,GACpDA,EAAM,UAAUkG,IAElBtH,GAAiBjO,EAAQT,EAAK6X,IAWhC,SAASQ,GAAQva,EAAOlS,GACtB,IAAIjC,EAASmU,EAAMnU,OACnB,GAAKA,EAIL,OADAiC,GAAKA,EAAI,EAAIjC,EAAS,EACfwkB,GAAQviB,EAAGjC,GAAUmU,EAAMlS,GAAKuF,EAYzC,SAASmnB,GAAYxY,EAAYoL,EAAWqN,GAC1C,IAAIra,GAAS,EACbgN,EAAYpM,GAASoM,EAAUvhB,OAASuhB,EAAY,CAACuL,IAAWxV,GAAUuX,OAE1E,IAAI/pB,EAAS0oB,GAAQrX,GAAY,SAAS3B,EAAO6B,EAAKF,GACpD,IAAI2Y,EAAW3Z,GAASoM,GAAW,SAASlN,GAC1C,OAAOA,EAASG,MAElB,MAAO,CAAE,SAAYsa,EAAU,QAAWva,EAAO,MAASC,MAG5D,OAAOyC,GAAWnS,GAAQ,SAASgS,EAAQ+S,GACzC,OAAOkF,GAAgBjY,EAAQ+S,EAAO+E,MAa1C,SAASI,GAASlY,EAAQ6O,GACxB,OAAOsJ,GAAWnY,EAAQ6O,GAAO,SAASnR,EAAO4U,GAC/C,OAAO0E,GAAMhX,EAAQsS,MAazB,SAAS6F,GAAWnY,EAAQ6O,EAAO/Q,GACjC,IAAIL,GAAS,EACTvU,EAAS2lB,EAAM3lB,OACf8E,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIopB,EAAOzD,EAAMpR,GACbC,EAAQ2U,GAAQrS,EAAQsS,GAExBxU,EAAUJ,EAAO4U,IACnB8F,GAAQpqB,EAAQukB,GAASD,EAAMtS,GAAStC,GAG5C,OAAO1P,EAUT,SAASqqB,GAAiB/F,GACxB,OAAO,SAAStS,GACd,OAAOqS,GAAQrS,EAAQsS,IAe3B,SAASgG,GAAYjb,EAAOmB,EAAQjB,EAAUa,GAC5C,IAAIma,EAAUna,EAAayB,GAAkB3B,GACzCT,GAAS,EACTvU,EAASsV,EAAOtV,OAChBwqB,EAAOrW,EAEPA,IAAUmB,IACZA,EAASsL,GAAUtL,IAEjBjB,IACFmW,EAAOrV,GAAShB,EAAOmD,GAAUjD,KAEnC,QAASE,EAAQvU,EAAQ,CACvB,IAAIuW,EAAY,EACZ/B,EAAQc,EAAOf,GACfrV,EAAWmV,EAAWA,EAASG,GAASA,EAE5C,OAAQ+B,EAAY8Y,EAAQ7E,EAAMtrB,EAAUqX,EAAWrB,KAAgB,EACjEsV,IAASrW,GACXgI,GAAOlI,KAAKuW,EAAMjU,EAAW,GAE/B4F,GAAOlI,KAAKE,EAAOoC,EAAW,GAGlC,OAAOpC,EAYT,SAASmb,GAAWnb,EAAOob,GACzB,IAAIvvB,EAASmU,EAAQob,EAAQvvB,OAAS,EAClC4Z,EAAY5Z,EAAS,EAEzB,MAAOA,IAAU,CACf,IAAIuU,EAAQgb,EAAQvvB,GACpB,GAAIA,GAAU4Z,GAAarF,IAAUib,EAAU,CAC7C,IAAIA,EAAWjb,EACXiQ,GAAQjQ,GACV4H,GAAOlI,KAAKE,EAAOI,EAAO,GAE1Bkb,GAAUtb,EAAOI,IAIvB,OAAOJ,EAYT,SAASuQ,GAAWoB,EAAOC,GACzB,OAAOD,EAAQ7I,GAAYgB,MAAkB8H,EAAQD,EAAQ,IAc/D,SAAS4J,GAAUrO,EAAOC,EAAKqO,EAAMnZ,GACnC,IAAIjC,GAAS,EACTvU,EAAS2d,GAAUZ,IAAYuE,EAAMD,IAAUsO,GAAQ,IAAK,GAC5D7qB,EAASsQ,EAAMpV,GAEnB,MAAOA,IACL8E,EAAO0R,EAAYxW,IAAWuU,GAAS8M,EACvCA,GAASsO,EAEX,OAAO7qB,EAWT,SAAS8qB,GAAW7Z,EAAQ9T,GAC1B,IAAI6C,EAAS,GACb,IAAKiR,GAAU9T,EAAI,GAAKA,EAAIsH,EAC1B,OAAOzE,EAIT,GACM7C,EAAI,IACN6C,GAAUiR,GAEZ9T,EAAIgb,GAAYhb,EAAI,GAChBA,IACF8T,GAAUA,SAEL9T,GAET,OAAO6C,EAWT,SAAS+qB,GAAS/b,EAAMuN,GACtB,OAAOyO,GAAYC,GAASjc,EAAMuN,EAAOyL,IAAWhZ,EAAO,IAU7D,SAASkc,GAAW7Z,GAClB,OAAOsO,GAAYnP,GAAOa,IAW5B,SAAS8Z,GAAe9Z,EAAYlU,GAClC,IAAIkS,EAAQmB,GAAOa,GACnB,OAAOyO,GAAYzQ,EAAO0Q,GAAU5iB,EAAG,EAAGkS,EAAMnU,SAalD,SAASkvB,GAAQpY,EAAQsS,EAAM5U,EAAO0R,GACpC,IAAKpG,GAAShJ,GACZ,OAAOA,EAETsS,EAAOC,GAASD,EAAMtS,GAEtB,IAAIvC,GAAS,EACTvU,EAASopB,EAAKppB,OACd4Z,EAAY5Z,EAAS,EACrBkwB,EAASpZ,EAEb,MAAiB,MAAVoZ,KAAoB3b,EAAQvU,EAAQ,CACzC,IAAIqW,EAAMiT,GAAMF,EAAK7U,IACjB2Z,EAAW1Z,EAEf,GAAID,GAASqF,EAAW,CACtB,IAAIuL,EAAW+K,EAAO7Z,GACtB6X,EAAWhI,EAAaA,EAAWf,EAAU9O,EAAK6Z,GAAU1oB,EACxD0mB,IAAa1mB,IACf0mB,EAAWpO,GAASqF,GAChBA,EACCX,GAAQ4E,EAAK7U,EAAQ,IAAM,GAAK,IAGzC2Q,GAAYgL,EAAQ7Z,EAAK6X,GACzBgC,EAASA,EAAO7Z,GAElB,OAAOS,EAWT,IAAIqZ,GAAezR,GAAqB,SAAS5K,EAAM/U,GAErD,OADA2f,GAAQtF,IAAItF,EAAM/U,GACX+U,GAFoBgZ,GAazBsD,GAAmB3T,GAA4B,SAAS3I,EAAMiC,GAChE,OAAO0G,GAAe3I,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASuc,GAASta,GAClB,UAAY,KALwB+W,GAgBxC,SAASwD,GAAYna,GACnB,OAAOyO,GAAYtP,GAAOa,IAY5B,SAASoa,GAAUpc,EAAOkN,EAAOC,GAC/B,IAAI/M,GAAS,EACTvU,EAASmU,EAAMnU,OAEfqhB,EAAQ,IACVA,GAASA,EAAQrhB,EAAS,EAAKA,EAASqhB,GAE1CC,EAAMA,EAAMthB,EAASA,EAASshB,EAC1BA,EAAM,IACRA,GAAOthB,GAETA,EAASqhB,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAEX,IAAIvc,EAASsQ,EAAMpV,GACnB,QAASuU,EAAQvU,EACf8E,EAAOyP,GAASJ,EAAMI,EAAQ8M,GAEhC,OAAOvc,EAYT,SAAS0rB,GAASra,EAAYvB,GAC5B,IAAI9P,EAMJ,OAJAugB,GAASlP,GAAY,SAAS3B,EAAOD,EAAO4B,GAE1C,OADArR,EAAS8P,EAAUJ,EAAOD,EAAO4B,IACzBrR,OAEDA,EAeX,SAAS2rB,GAAgBtc,EAAOK,EAAOkc,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATzc,EAAgBwc,EAAMxc,EAAMnU,OAEvC,GAAoB,iBAATwU,GAAqBA,IAAUA,GAASoc,GAAQhnB,EAAuB,CAChF,MAAO+mB,EAAMC,EAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB1xB,EAAWiV,EAAM0c,GAEJ,OAAb3xB,IAAsBmpB,GAASnpB,KAC9BwxB,EAAcxxB,GAAYsV,EAAUtV,EAAWsV,GAClDmc,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkB3c,EAAOK,EAAOsY,GAAU4D,GAgBnD,SAASI,GAAkB3c,EAAOK,EAAOH,EAAUqc,GACjDlc,EAAQH,EAASG,GAEjB,IAAImc,EAAM,EACNC,EAAgB,MAATzc,EAAgB,EAAIA,EAAMnU,OACjC+wB,EAAWvc,IAAUA,EACrBwc,EAAsB,OAAVxc,EACZyc,EAAc5I,GAAS7T,GACvB0c,EAAiB1c,IAAUhN,EAE/B,MAAOmpB,EAAMC,EAAM,CACjB,IAAIC,EAAM5T,IAAa0T,EAAMC,GAAQ,GACjC1xB,EAAWmV,EAASF,EAAM0c,IAC1BM,EAAejyB,IAAasI,EAC5B4pB,EAAyB,OAAblyB,EACZmyB,EAAiBnyB,IAAaA,EAC9BoyB,EAAcjJ,GAASnpB,GAE3B,GAAI6xB,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAcxxB,GAAYsV,EAAUtV,EAAWsV,GAEtD+c,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOhT,GAAU+S,EAAMjnB,GAYzB,SAAS6nB,GAAerd,EAAOE,GAC7B,IAAIE,GAAS,EACTvU,EAASmU,EAAMnU,OACf8U,EAAW,EACXhQ,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdrV,EAAWmV,EAAWA,EAASG,GAASA,EAE5C,IAAKD,IAAUyQ,GAAG9lB,EAAUsrB,GAAO,CACjC,IAAIA,EAAOtrB,EACX4F,EAAOgQ,KAAwB,IAAVN,EAAc,EAAIA,GAG3C,OAAO1P,EAWT,SAAS2sB,GAAajd,GACpB,MAAoB,iBAATA,EACFA,EAEL6T,GAAS7T,GACJ/K,GAED+K,EAWV,SAASkd,GAAald,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIgL,GAAQhL,GAEV,OAAOW,GAASX,EAAOkd,IAAgB,GAEzC,GAAIrJ,GAAS7T,GACX,OAAO6K,GAAiBA,GAAepL,KAAKO,GAAS,GAEvD,IAAI1P,EAAU0P,EAAQ,GACtB,MAAkB,KAAV1P,GAAkB,EAAI0P,IAAWlL,EAAY,KAAOxE,EAY9D,SAAS6sB,GAASxd,EAAOE,EAAUa,GACjC,IAAIX,GAAS,EACTpU,EAAW4U,GACX/U,EAASmU,EAAMnU,OACf0nB,GAAW,EACX5iB,EAAS,GACT0lB,EAAO1lB,EAEX,GAAIoQ,EACFwS,GAAW,EACXvnB,EAAW8U,QAER,GAAIjV,GAAU0H,EAAkB,CACnC,IAAI0R,EAAM/E,EAAW,KAAOud,GAAUzd,GACtC,GAAIiF,EACF,OAAOD,GAAWC,GAEpBsO,GAAW,EACXvnB,EAAWqX,GACXgT,EAAO,IAAIjH,QAGXiH,EAAOnW,EAAW,GAAKvP,EAEzB6c,EACA,QAASpN,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdrV,EAAWmV,EAAWA,EAASG,GAASA,EAG5C,GADAA,EAASU,GAAwB,IAAVV,EAAeA,EAAQ,EAC1CkT,GAAYxoB,IAAaA,EAAU,CACrC,IAAI2yB,EAAYrH,EAAKxqB,OACrB,MAAO6xB,IACL,GAAIrH,EAAKqH,KAAe3yB,EACtB,SAASyiB,EAGTtN,GACFmW,EAAKpmB,KAAKlF,GAEZ4F,EAAOV,KAAKoQ,QAEJrU,EAASqqB,EAAMtrB,EAAUgW,KAC7BsV,IAAS1lB,GACX0lB,EAAKpmB,KAAKlF,GAEZ4F,EAAOV,KAAKoQ,IAGhB,OAAO1P,EAWT,SAAS2qB,GAAU3Y,EAAQsS,GAGzB,OAFAA,EAAOC,GAASD,EAAMtS,GACtBA,EAAS6T,GAAO7T,EAAQsS,GACP,MAAVtS,UAAyBA,EAAOwS,GAAMsB,GAAKxB,KAapD,SAAS0I,GAAWhb,EAAQsS,EAAM2I,EAAS7L,GACzC,OAAOgJ,GAAQpY,EAAQsS,EAAM2I,EAAQ5I,GAAQrS,EAAQsS,IAAQlD,GAc/D,SAAS8L,GAAU7d,EAAOS,EAAWqd,EAAQzb,GAC3C,IAAIxW,EAASmU,EAAMnU,OACfuU,EAAQiC,EAAYxW,GAAU,EAElC,OAAQwW,EAAYjC,MAAYA,EAAQvU,IACtC4U,EAAUT,EAAMI,GAAQA,EAAOJ,IAEjC,OAAO8d,EACH1B,GAAUpc,EAAQqC,EAAY,EAAIjC,EAASiC,EAAYjC,EAAQ,EAAIvU,GACnEuwB,GAAUpc,EAAQqC,EAAYjC,EAAQ,EAAI,EAAKiC,EAAYxW,EAASuU,GAa1E,SAASmN,GAAiBlN,EAAO0d,GAC/B,IAAIptB,EAAS0P,EAIb,OAHI1P,aAAkB2a,KACpB3a,EAASA,EAAO0P,SAEXgB,GAAY0c,GAAS,SAASptB,EAAQqtB,GAC3C,OAAOA,EAAOre,KAAKD,MAAMse,EAAOpe,QAASsB,GAAU,CAACvQ,GAASqtB,EAAOne,SACnElP,GAaL,SAASstB,GAAQlI,EAAQ7V,EAAUa,GACjC,IAAIlV,EAASkqB,EAAOlqB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS2xB,GAASzH,EAAO,IAAM,GAExC,IAAI3V,GAAS,EACTzP,EAASsQ,EAAMpV,GAEnB,QAASuU,EAAQvU,EAAQ,CACvB,IAAImU,EAAQ+V,EAAO3V,GACf6V,GAAY,EAEhB,QAASA,EAAWpqB,EACdoqB,GAAY7V,IACdzP,EAAOyP,GAASkT,GAAe3iB,EAAOyP,IAAUJ,EAAO+V,EAAOE,GAAW/V,EAAUa,IAIzF,OAAOyc,GAASjJ,GAAY5jB,EAAQ,GAAIuP,EAAUa,GAYpD,SAASmd,GAAcvzB,EAAOwW,EAAQgd,GACpC,IAAI/d,GAAS,EACTvU,EAASlB,EAAMkB,OACfuyB,EAAajd,EAAOtV,OACpB8E,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQD,EAAQge,EAAajd,EAAOf,GAAS/M,EACjD8qB,EAAWxtB,EAAQhG,EAAMyV,GAAQC,GAEnC,OAAO1P,EAUT,SAAS0tB,GAAoBhe,GAC3B,OAAO8Z,GAAkB9Z,GAASA,EAAQ,GAU5C,SAASie,GAAaje,GACpB,MAAuB,mBAATA,EAAsBA,EAAQsY,GAW9C,SAASzD,GAAS7U,EAAOsC,GACvB,OAAI0I,GAAQhL,GACHA,EAEFoZ,GAAMpZ,EAAOsC,GAAU,CAACtC,GAASke,GAAa5X,GAAStG,IAYhE,IAAIme,GAAW9C,GAWf,SAAS+C,GAAUze,EAAOkN,EAAOC,GAC/B,IAAIthB,EAASmU,EAAMnU,OAEnB,OADAshB,EAAMA,IAAQ9Z,EAAYxH,EAASshB,GAC1BD,GAASC,GAAOthB,EAAUmU,EAAQoc,GAAUpc,EAAOkN,EAAOC,GASrE,IAAIvgB,GAAe4b,IAAmB,SAASza,GAC7C,OAAOiQ,GAAKpR,aAAamB,IAW3B,SAASykB,GAAYkM,EAAQzM,GAC3B,GAAIA,EACF,OAAOyM,EAAOC,QAEhB,IAAI9yB,EAAS6yB,EAAO7yB,OAChB8E,EAAS+W,GAAcA,GAAY7b,GAAU,IAAI6yB,EAAO/K,YAAY9nB,GAGxE,OADA6yB,EAAOE,KAAKjuB,GACLA,EAUT,SAASkuB,GAAiBC,GACxB,IAAInuB,EAAS,IAAImuB,EAAYnL,YAAYmL,EAAYC,YAErD,OADA,IAAItX,GAAW9W,GAAQsU,IAAI,IAAIwC,GAAWqX,IACnCnuB,EAWT,SAASquB,GAAcC,EAAUhN,GAC/B,IAAIyM,EAASzM,EAAS4M,GAAiBI,EAASP,QAAUO,EAASP,OACnE,OAAO,IAAIO,EAAStL,YAAY+K,EAAQO,EAASC,WAAYD,EAASF,YAUxE,SAASI,GAAYC,GACnB,IAAIzuB,EAAS,IAAIyuB,EAAOzL,YAAYyL,EAAOjnB,OAAQmB,GAAQ0N,KAAKoY,IAEhE,OADAzuB,EAAO8U,UAAY2Z,EAAO3Z,UACnB9U,EAUT,SAAS0uB,GAAYC,GACnB,OAAOtU,GAAgBnN,GAAOmN,GAAclL,KAAKwf,IAAW,GAW9D,SAASlF,GAAgBmF,EAAYtN,GACnC,IAAIyM,EAASzM,EAAS4M,GAAiBU,EAAWb,QAAUa,EAAWb,OACvE,OAAO,IAAIa,EAAW5L,YAAY+K,EAAQa,EAAWL,WAAYK,EAAW1zB,QAW9E,SAAS2zB,GAAiBnf,EAAOqV,GAC/B,GAAIrV,IAAUqV,EAAO,CACnB,IAAI+J,EAAepf,IAAUhN,EACzBwpB,EAAsB,OAAVxc,EACZqf,EAAiBrf,IAAUA,EAC3Byc,EAAc5I,GAAS7T,GAEvB2c,EAAetH,IAAUriB,EACzB4pB,EAAsB,OAAVvH,EACZwH,EAAiBxH,IAAUA,EAC3ByH,EAAcjJ,GAASwB,GAE3B,IAAMuH,IAAcE,IAAgBL,GAAezc,EAAQqV,GACtDoH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BuC,GAAgBvC,IACjBwC,EACH,OAAO,EAET,IAAM7C,IAAcC,IAAgBK,GAAe9c,EAAQqV,GACtDyH,GAAesC,GAAgBC,IAAmB7C,IAAcC,GAChEG,GAAawC,GAAgBC,IAC5B1C,GAAgB0C,IACjBxC,EACH,OAAQ,EAGZ,OAAO,EAiBT,SAAStC,GAAgBjY,EAAQ+S,EAAO+E,GACtC,IAAIra,GAAS,EACTuf,EAAchd,EAAOgY,SACrBiF,EAAclK,EAAMiF,SACpB9uB,EAAS8zB,EAAY9zB,OACrBg0B,EAAepF,EAAO5uB,OAE1B,QAASuU,EAAQvU,EAAQ,CACvB,IAAI8E,EAAS6uB,GAAiBG,EAAYvf,GAAQwf,EAAYxf,IAC9D,GAAIzP,EAAQ,CACV,GAAIyP,GAASyf,EACX,OAAOlvB,EAET,IAAImvB,EAAQrF,EAAOra,GACnB,OAAOzP,GAAmB,QAATmvB,GAAmB,EAAI,IAU5C,OAAOnd,EAAOvC,MAAQsV,EAAMtV,MAc9B,SAAS2f,GAAYlgB,EAAMmgB,EAAUC,EAASC,GAC5C,IAAIC,GAAa,EACbC,EAAavgB,EAAKhU,OAClBw0B,EAAgBJ,EAAQp0B,OACxBy0B,GAAa,EACbC,EAAaP,EAASn0B,OACtB20B,EAAchX,GAAU4W,EAAaC,EAAe,GACpD1vB,EAASsQ,EAAMsf,EAAaC,GAC5BC,GAAeP,EAEnB,QAASI,EAAYC,EACnB5vB,EAAO2vB,GAAaN,EAASM,GAE/B,QAASH,EAAYE,GACfI,GAAeN,EAAYC,KAC7BzvB,EAAOsvB,EAAQE,IAActgB,EAAKsgB,IAGtC,MAAOK,IACL7vB,EAAO2vB,KAAezgB,EAAKsgB,KAE7B,OAAOxvB,EAcT,SAAS+vB,GAAiB7gB,EAAMmgB,EAAUC,EAASC,GACjD,IAAIC,GAAa,EACbC,EAAavgB,EAAKhU,OAClB80B,GAAgB,EAChBN,EAAgBJ,EAAQp0B,OACxB+0B,GAAc,EACdC,EAAcb,EAASn0B,OACvB20B,EAAchX,GAAU4W,EAAaC,EAAe,GACpD1vB,EAASsQ,EAAMuf,EAAcK,GAC7BJ,GAAeP,EAEnB,QAASC,EAAYK,EACnB7vB,EAAOwvB,GAAatgB,EAAKsgB,GAE3B,IAAI/e,EAAS+e,EACb,QAASS,EAAaC,EACpBlwB,EAAOyQ,EAASwf,GAAcZ,EAASY,GAEzC,QAASD,EAAeN,GAClBI,GAAeN,EAAYC,KAC7BzvB,EAAOyQ,EAAS6e,EAAQU,IAAiB9gB,EAAKsgB,MAGlD,OAAOxvB,EAWT,SAAS8b,GAAUtU,EAAQ6H,GACzB,IAAII,GAAS,EACTvU,EAASsM,EAAOtM,OAEpBmU,IAAUA,EAAQiB,EAAMpV,IACxB,QAASuU,EAAQvU,EACfmU,EAAMI,GAASjI,EAAOiI,GAExB,OAAOJ,EAaT,SAASoR,GAAWjZ,EAAQxN,EAAOgY,EAAQoP,GACzC,IAAI+O,GAASne,EACbA,IAAWA,EAAS,IAEpB,IAAIvC,GAAS,EACTvU,EAASlB,EAAMkB,OAEnB,QAASuU,EAAQvU,EAAQ,CACvB,IAAIqW,EAAMvX,EAAMyV,GAEZ2Z,EAAWhI,EACXA,EAAWpP,EAAOT,GAAM/J,EAAO+J,GAAMA,EAAKS,EAAQxK,GAClD9E,EAEA0mB,IAAa1mB,IACf0mB,EAAW5hB,EAAO+J,IAEhB4e,EACFhQ,GAAgBnO,EAAQT,EAAK6X,GAE7BhJ,GAAYpO,EAAQT,EAAK6X,GAG7B,OAAOpX,EAWT,SAASgQ,GAAYxa,EAAQwK,GAC3B,OAAOyO,GAAWjZ,EAAQ4oB,GAAW5oB,GAASwK,GAWhD,SAAS+P,GAAcva,EAAQwK,GAC7B,OAAOyO,GAAWjZ,EAAQ6oB,GAAa7oB,GAASwK,GAWlD,SAASse,GAAiBhhB,EAAQihB,GAChC,OAAO,SAASlf,EAAY9B,GAC1B,IAAIP,EAAO0L,GAAQrJ,GAAcjC,GAAkBkR,GAC/C9Q,EAAc+gB,EAAcA,IAAgB,GAEhD,OAAOvhB,EAAKqC,EAAY/B,EAAQya,GAAYxa,EAAU,GAAIC,IAW9D,SAASghB,GAAeC,GACtB,OAAO1F,IAAS,SAAS/Y,EAAQ0e,GAC/B,IAAIjhB,GAAS,EACTvU,EAASw1B,EAAQx1B,OACjBkmB,EAAalmB,EAAS,EAAIw1B,EAAQx1B,EAAS,GAAKwH,EAChDiuB,EAAQz1B,EAAS,EAAIw1B,EAAQ,GAAKhuB,EAEtC0e,EAAcqP,EAASv1B,OAAS,GAA0B,mBAAdkmB,GACvClmB,IAAUkmB,GACX1e,EAEAiuB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDvP,EAAalmB,EAAS,EAAIwH,EAAY0e,EACtClmB,EAAS,GAEX8W,EAAS9E,GAAO8E,GAChB,QAASvC,EAAQvU,EAAQ,CACvB,IAAIsM,EAASkpB,EAAQjhB,GACjBjI,GACFipB,EAASze,EAAQxK,EAAQiI,EAAO2R,GAGpC,OAAOpP,KAYX,SAASiR,GAAe3R,EAAUI,GAChC,OAAO,SAASL,EAAY9B,GAC1B,GAAkB,MAAd8B,EACF,OAAOA,EAET,IAAKsX,GAAYtX,GACf,OAAOC,EAASD,EAAY9B,GAE9B,IAAIrU,EAASmW,EAAWnW,OACpBuU,EAAQiC,EAAYxW,GAAU,EAC9B21B,EAAW3jB,GAAOmE,GAEtB,MAAQK,EAAYjC,MAAYA,EAAQvU,EACtC,IAAmD,IAA/CqU,EAASshB,EAASphB,GAAQA,EAAOohB,GACnC,MAGJ,OAAOxf,GAWX,SAAS4S,GAAcvS,GACrB,OAAO,SAASM,EAAQzC,EAAU6S,GAChC,IAAI3S,GAAS,EACTohB,EAAW3jB,GAAO8E,GAClBhY,EAAQooB,EAASpQ,GACjB9W,EAASlB,EAAMkB,OAEnB,MAAOA,IAAU,CACf,IAAIqW,EAAMvX,EAAM0X,EAAYxW,IAAWuU,GACvC,IAA+C,IAA3CF,EAASshB,EAAStf,GAAMA,EAAKsf,GAC/B,MAGJ,OAAO7e,GAcX,SAAS8e,GAAW9hB,EAAMmS,EAASlS,GACjC,IAAI8hB,EAAS5P,EAAU5d,EACnBytB,EAAOC,GAAWjiB,GAEtB,SAASkiB,IACP,IAAIC,EAAMv4B,MAAQA,OAASyU,IAAQzU,gBAAgBs4B,EAAWF,EAAOhiB,EACrE,OAAOmiB,EAAGpiB,MAAMgiB,EAAS9hB,EAAUrW,KAAMw4B,WAE3C,OAAOF,EAUT,SAASG,GAAgBC,GACvB,OAAO,SAASrgB,GACdA,EAAS+E,GAAS/E,GAElB,IAAI6B,EAAaU,GAAWvC,GACxB0D,GAAc1D,GACdvO,EAEA4Q,EAAMR,EACNA,EAAW,GACX7B,EAAOsgB,OAAO,GAEdC,EAAW1e,EACXgb,GAAUhb,EAAY,GAAGtH,KAAK,IAC9ByF,EAAO+c,MAAM,GAEjB,OAAO1a,EAAIge,KAAgBE,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAASzgB,GACd,OAAOP,GAAYihB,GAAMC,GAAO3gB,GAAQzQ,QAAQsL,GAAQ,KAAM4lB,EAAU,KAY5E,SAAST,GAAWD,GAClB,OAAO,WAIL,IAAI9hB,EAAOkiB,UACX,OAAQliB,EAAKhU,QACX,KAAK,EAAG,OAAO,IAAI81B,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK9hB,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI8hB,EAAK9hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAI2iB,EAAc/W,GAAWkW,EAAKrb,WAC9B3V,EAASgxB,EAAKjiB,MAAM8iB,EAAa3iB,GAIrC,OAAO8L,GAAShb,GAAUA,EAAS6xB,GAavC,SAASC,GAAY9iB,EAAMmS,EAAS4Q,GAClC,IAAIf,EAAOC,GAAWjiB,GAEtB,SAASkiB,IACP,IAAIh2B,EAASk2B,UAAUl2B,OACnBgU,EAAOoB,EAAMpV,GACbuU,EAAQvU,EACRgY,EAAc8e,GAAUd,GAE5B,MAAOzhB,IACLP,EAAKO,GAAS2hB,UAAU3hB,GAE1B,IAAI6f,EAAWp0B,EAAS,GAAKgU,EAAK,KAAOgE,GAAehE,EAAKhU,EAAS,KAAOgY,EACzE,GACAkB,GAAelF,EAAMgE,GAGzB,GADAhY,GAAUo0B,EAAQp0B,OACdA,EAAS62B,EACX,OAAOE,GACLjjB,EAAMmS,EAAS+Q,GAAchB,EAAQhe,YAAaxQ,EAClDwM,EAAMogB,EAAS5sB,EAAWA,EAAWqvB,EAAQ72B,GAEjD,IAAIi2B,EAAMv4B,MAAQA,OAASyU,IAAQzU,gBAAgBs4B,EAAWF,EAAOhiB,EACrE,OAAOD,GAAMoiB,EAAIv4B,KAAMsW,GAEzB,OAAOgiB,EAUT,SAASiB,GAAWC,GAClB,OAAO,SAAS/gB,EAAYvB,EAAW2B,GACrC,IAAIof,EAAW3jB,GAAOmE,GACtB,IAAKsX,GAAYtX,GAAa,CAC5B,IAAI9B,EAAWwa,GAAYja,EAAW,GACtCuB,EAAaiF,GAAKjF,GAClBvB,EAAY,SAASyB,GAAO,OAAOhC,EAASshB,EAAStf,GAAMA,EAAKsf,IAElE,IAAIphB,EAAQ2iB,EAAc/gB,EAAYvB,EAAW2B,GACjD,OAAOhC,GAAS,EAAIohB,EAASthB,EAAW8B,EAAW5B,GAASA,GAAS/M,GAWzE,SAAS2vB,GAAW3gB,GAClB,OAAO4gB,IAAS,SAASC,GACvB,IAAIr3B,EAASq3B,EAAMr3B,OACfuU,EAAQvU,EACRs3B,EAAS5X,GAAcjF,UAAU8c,KAEjC/gB,GACF6gB,EAAMjZ,UAER,MAAO7J,IAAS,CACd,IAAIT,EAAOujB,EAAM9iB,GACjB,GAAmB,mBAART,EACT,MAAM,IAAIyG,GAAU3S,GAEtB,GAAI0vB,IAAWtB,GAAgC,WAArBwB,GAAY1jB,GACpC,IAAIkiB,EAAU,IAAItW,GAAc,IAAI,GAGxCnL,EAAQyhB,EAAUzhB,EAAQvU,EAC1B,QAASuU,EAAQvU,EAAQ,CACvB8T,EAAOujB,EAAM9iB,GAEb,IAAIkjB,EAAWD,GAAY1jB,GACvB/U,EAAmB,WAAZ04B,EAAwBC,GAAQ5jB,GAAQtM,EAMjDwuB,EAJEj3B,GAAQ44B,GAAW54B,EAAK,KACtBA,EAAK,KAAO6J,EAAgBJ,EAAkBE,EAAoBG,KACjE9J,EAAK,GAAGiB,QAAqB,GAAXjB,EAAK,GAElBi3B,EAAQwB,GAAYz4B,EAAK,KAAK8U,MAAMmiB,EAASj3B,EAAK,IAElC,GAAf+U,EAAK9T,QAAe23B,GAAW7jB,GACtCkiB,EAAQyB,KACRzB,EAAQuB,KAAKzjB,GAGrB,OAAO,WACL,IAAIE,EAAOkiB,UACP1hB,EAAQR,EAAK,GAEjB,GAAIgiB,GAA0B,GAAfhiB,EAAKhU,QAAewf,GAAQhL,GACzC,OAAOwhB,EAAQ4B,MAAMpjB,GAAOA,QAE9B,IAAID,EAAQ,EACRzP,EAAS9E,EAASq3B,EAAM9iB,GAAOV,MAAMnW,KAAMsW,GAAQQ,EAEvD,QAASD,EAAQvU,EACf8E,EAASuyB,EAAM9iB,GAAON,KAAKvW,KAAMoH,GAEnC,OAAOA,MAwBb,SAASkyB,GAAaljB,EAAMmS,EAASlS,EAASogB,EAAUC,EAASyD,EAAeC,EAAcC,EAAQC,EAAKnB,GACzG,IAAIoB,EAAQhS,EAAUrd,EAClBitB,EAAS5P,EAAU5d,EACnB6vB,EAAYjS,EAAU3d,EACtB+rB,EAAYpO,GAAWzd,EAAkBC,GACzC0vB,EAASlS,EAAUnd,EACnBgtB,EAAOoC,EAAY1wB,EAAYuuB,GAAWjiB,GAE9C,SAASkiB,IACP,IAAIh2B,EAASk2B,UAAUl2B,OACnBgU,EAAOoB,EAAMpV,GACbuU,EAAQvU,EAEZ,MAAOuU,IACLP,EAAKO,GAAS2hB,UAAU3hB,GAE1B,GAAI8f,EACF,IAAIrc,EAAc8e,GAAUd,GACxBoC,EAAergB,GAAa/D,EAAMgE,GASxC,GAPImc,IACFngB,EAAOkgB,GAAYlgB,EAAMmgB,EAAUC,EAASC,IAE1CwD,IACF7jB,EAAO6gB,GAAiB7gB,EAAM6jB,EAAeC,EAAczD,IAE7Dr0B,GAAUo4B,EACN/D,GAAar0B,EAAS62B,EAAO,CAC/B,IAAIwB,EAAanf,GAAelF,EAAMgE,GACtC,OAAO+e,GACLjjB,EAAMmS,EAAS+Q,GAAchB,EAAQhe,YAAajE,EAClDC,EAAMqkB,EAAYN,EAAQC,EAAKnB,EAAQ72B,GAG3C,IAAI22B,EAAcd,EAAS9hB,EAAUrW,KACjCu4B,EAAKiC,EAAYvB,EAAY7iB,GAAQA,EAczC,OAZA9T,EAASgU,EAAKhU,OACV+3B,EACF/jB,EAAOskB,GAAQtkB,EAAM+jB,GACZI,GAAUn4B,EAAS,GAC5BgU,EAAKoK,UAEH6Z,GAASD,EAAMh4B,IACjBgU,EAAKhU,OAASg4B,GAEZt6B,MAAQA,OAASyU,IAAQzU,gBAAgBs4B,IAC3CC,EAAKH,GAAQC,GAAWE,IAEnBA,EAAGpiB,MAAM8iB,EAAa3iB,GAE/B,OAAOgiB,EAWT,SAASuC,GAAenkB,EAAQokB,GAC9B,OAAO,SAAS1hB,EAAQzC,GACtB,OAAOoW,GAAa3T,EAAQ1C,EAAQokB,EAAWnkB,GAAW,KAY9D,SAASokB,GAAoBC,EAAUC,GACrC,OAAO,SAASnkB,EAAOqV,GACrB,IAAI/kB,EACJ,GAAI0P,IAAUhN,GAAaqiB,IAAUriB,EACnC,OAAOmxB,EAKT,GAHInkB,IAAUhN,IACZ1C,EAAS0P,GAEPqV,IAAUriB,EAAW,CACvB,GAAI1C,IAAW0C,EACb,OAAOqiB,EAEW,iBAATrV,GAAqC,iBAATqV,GACrCrV,EAAQkd,GAAald,GACrBqV,EAAQ6H,GAAa7H,KAErBrV,EAAQid,GAAajd,GACrBqV,EAAQ4H,GAAa5H,IAEvB/kB,EAAS4zB,EAASlkB,EAAOqV,GAE3B,OAAO/kB,GAWX,SAAS8zB,GAAWC,GAClB,OAAOzB,IAAS,SAAS7V,GAEvB,OADAA,EAAYpM,GAASoM,EAAWjK,GAAUuX,OACnCgB,IAAS,SAAS7b,GACvB,IAAID,EAAUrW,KACd,OAAOm7B,EAAUtX,GAAW,SAASlN,GACnC,OAAOR,GAAMQ,EAAUN,EAASC,YAexC,SAAS8kB,GAAc94B,EAAQ+4B,GAC7BA,EAAQA,IAAUvxB,EAAY,IAAMkqB,GAAaqH,GAEjD,IAAIC,EAAcD,EAAM/4B,OACxB,GAAIg5B,EAAc,EAChB,OAAOA,EAAcpJ,GAAWmJ,EAAO/4B,GAAU+4B,EAEnD,IAAIj0B,EAAS8qB,GAAWmJ,EAAOhc,GAAW/c,EAASuZ,GAAWwf,KAC9D,OAAOzgB,GAAWygB,GACdnG,GAAUnZ,GAAc3U,GAAS,EAAG9E,GAAQsQ,KAAK,IACjDxL,EAAOguB,MAAM,EAAG9yB,GAetB,SAASi5B,GAAcnlB,EAAMmS,EAASlS,EAASogB,GAC7C,IAAI0B,EAAS5P,EAAU5d,EACnBytB,EAAOC,GAAWjiB,GAEtB,SAASkiB,IACP,IAAI1B,GAAa,EACbC,EAAa2B,UAAUl2B,OACvBy0B,GAAa,EACbC,EAAaP,EAASn0B,OACtBgU,EAAOoB,EAAMsf,EAAaH,GAC1B0B,EAAMv4B,MAAQA,OAASyU,IAAQzU,gBAAgBs4B,EAAWF,EAAOhiB,EAErE,QAAS2gB,EAAYC,EACnB1gB,EAAKygB,GAAaN,EAASM,GAE7B,MAAOF,IACLvgB,EAAKygB,KAAeyB,YAAY5B,GAElC,OAAOzgB,GAAMoiB,EAAIJ,EAAS9hB,EAAUrW,KAAMsW,GAE5C,OAAOgiB,EAUT,SAASkD,GAAY1iB,GACnB,OAAO,SAAS6K,EAAOC,EAAKqO,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB+F,GAAerU,EAAOC,EAAKqO,KAChErO,EAAMqO,EAAOnoB,GAGf6Z,EAAQ8X,GAAS9X,GACbC,IAAQ9Z,GACV8Z,EAAMD,EACNA,EAAQ,GAERC,EAAM6X,GAAS7X,GAEjBqO,EAAOA,IAASnoB,EAAa6Z,EAAQC,EAAM,GAAK,EAAK6X,GAASxJ,GACvDD,GAAUrO,EAAOC,EAAKqO,EAAMnZ,IAWvC,SAAS4iB,GAA0BV,GACjC,OAAO,SAASlkB,EAAOqV,GAKrB,MAJsB,iBAATrV,GAAqC,iBAATqV,IACvCrV,EAAQ6kB,GAAS7kB,GACjBqV,EAAQwP,GAASxP,IAEZ6O,EAASlkB,EAAOqV,IAqB3B,SAASkN,GAAcjjB,EAAMmS,EAASqT,EAAUthB,EAAajE,EAASogB,EAAUC,EAAS2D,EAAQC,EAAKnB,GACpG,IAAI0C,EAAUtT,EAAUzd,EACpB6vB,EAAakB,EAAUnF,EAAU5sB,EACjCgyB,EAAkBD,EAAU/xB,EAAY4sB,EACxCqF,EAAcF,EAAUpF,EAAW3sB,EACnCkyB,EAAmBH,EAAU/xB,EAAY2sB,EAE7ClO,GAAYsT,EAAU7wB,EAAoBC,EAC1Csd,KAAasT,EAAU5wB,EAA0BD,GAE3Cud,EAAU1d,IACd0d,KAAa5d,EAAiBC,IAEhC,IAAIqxB,EAAU,CACZ7lB,EAAMmS,EAASlS,EAAS0lB,EAAapB,EAAYqB,EACjDF,EAAiBzB,EAAQC,EAAKnB,GAG5B/xB,EAASw0B,EAASzlB,MAAMrM,EAAWmyB,GAKvC,OAJIhC,GAAW7jB,IACb8lB,GAAQ90B,EAAQ60B,GAElB70B,EAAOkT,YAAcA,EACd6hB,GAAgB/0B,EAAQgP,EAAMmS,GAUvC,SAAS6T,GAAY1D,GACnB,IAAItiB,EAAOuG,GAAK+b,GAChB,OAAO,SAASvQ,EAAQkU,GAGtB,GAFAlU,EAASwT,GAASxT,GAClBkU,EAAyB,MAAbA,EAAoB,EAAIlc,GAAU0K,GAAUwR,GAAY,KAChEA,GAAaxc,GAAesI,GAAS,CAGvC,IAAImU,GAAQlf,GAAS+K,GAAU,KAAK7P,MAAM,KACtCxB,EAAQV,EAAKkmB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAG7C,OADAC,GAAQlf,GAAStG,GAAS,KAAKwB,MAAM,OAC5BgkB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAEvC,OAAOjmB,EAAK+R,IAWhB,IAAI+L,GAAcrqB,IAAQ,EAAI4R,GAAW,IAAI5R,GAAI,CAAC,EAAE,KAAK,IAAO+B,EAAmB,SAASgM,GAC1F,OAAO,IAAI/N,GAAI+N,IAD2D2kB,GAW5E,SAASC,GAAchT,GACrB,OAAO,SAASpQ,GACd,IAAI0P,EAAMC,GAAO3P,GACjB,OAAI0P,GAAOjc,EACFsO,GAAW/B,GAEhB0P,GAAO1b,GACFuO,GAAWvC,GAEbO,GAAYP,EAAQoQ,EAASpQ,KA6BxC,SAASqjB,GAAWrmB,EAAMmS,EAASlS,EAASogB,EAAUC,EAAS2D,EAAQC,EAAKnB,GAC1E,IAAIqB,EAAYjS,EAAU3d,EAC1B,IAAK4vB,GAA4B,mBAARpkB,EACvB,MAAM,IAAIyG,GAAU3S,GAEtB,IAAI5H,EAASm0B,EAAWA,EAASn0B,OAAS,EAS1C,GARKA,IACHimB,KAAavd,EAAoBC,GACjCwrB,EAAWC,EAAU5sB,GAEvBwwB,EAAMA,IAAQxwB,EAAYwwB,EAAMra,GAAU4K,GAAUyP,GAAM,GAC1DnB,EAAQA,IAAUrvB,EAAYqvB,EAAQtO,GAAUsO,GAChD72B,GAAUo0B,EAAUA,EAAQp0B,OAAS,EAEjCimB,EAAUtd,EAAyB,CACrC,IAAIkvB,EAAgB1D,EAChB2D,EAAe1D,EAEnBD,EAAWC,EAAU5sB,EAEvB,IAAIzI,EAAOm5B,EAAY1wB,EAAYkwB,GAAQ5jB,GAEvC6lB,EAAU,CACZ7lB,EAAMmS,EAASlS,EAASogB,EAAUC,EAASyD,EAAeC,EAC1DC,EAAQC,EAAKnB,GAkBf,GAfI93B,GACFq7B,GAAUT,EAAS56B,GAErB+U,EAAO6lB,EAAQ,GACf1T,EAAU0T,EAAQ,GAClB5lB,EAAU4lB,EAAQ,GAClBxF,EAAWwF,EAAQ,GACnBvF,EAAUuF,EAAQ,GAClB9C,EAAQ8C,EAAQ,GAAKA,EAAQ,KAAOnyB,EAC/B0wB,EAAY,EAAIpkB,EAAK9T,OACtB2d,GAAUgc,EAAQ,GAAK35B,EAAQ,IAE9B62B,GAAS5Q,GAAWzd,EAAkBC,KACzCwd,KAAazd,EAAkBC,IAE5Bwd,GAAWA,GAAW5d,EAGzBvD,EADSmhB,GAAWzd,GAAmByd,GAAWxd,EACzCmuB,GAAY9iB,EAAMmS,EAAS4Q,GAC1B5Q,GAAWvd,GAAqBud,IAAY5d,EAAiBK,IAAwB0rB,EAAQp0B,OAG9Fg3B,GAAanjB,MAAMrM,EAAWmyB,GAF9BV,GAAcnlB,EAAMmS,EAASlS,EAASogB,QAJ/C,IAAIrvB,EAAS8wB,GAAW9hB,EAAMmS,EAASlS,GAQzC,IAAIK,EAASrV,EAAOoxB,GAAcyJ,GAClC,OAAOC,GAAgBzlB,EAAOtP,EAAQ60B,GAAU7lB,EAAMmS,GAexD,SAASoU,GAAuBlV,EAAUkH,EAAUhW,EAAKS,GACvD,OAAIqO,IAAa3d,GACZwd,GAAGG,EAAUxK,GAAYtE,MAAU0E,GAAe9G,KAAK6C,EAAQT,GAC3DgW,EAEFlH,EAiBT,SAASmV,GAAoBnV,EAAUkH,EAAUhW,EAAKS,EAAQxK,EAAQ6Z,GAOpE,OANIrG,GAASqF,IAAarF,GAASuM,KAEjClG,EAAM/M,IAAIiT,EAAUlH,GACpB4I,GAAU5I,EAAUkH,EAAU7kB,EAAW8yB,GAAqBnU,GAC9DA,EAAM,UAAUkG,IAEXlH,EAYT,SAASoV,GAAgB/lB,GACvB,OAAOga,GAAcha,GAAShN,EAAYgN,EAgB5C,SAASkX,GAAYvX,EAAO0V,EAAO5D,EAASC,EAAYgF,EAAW/E,GACjE,IAAIqU,EAAYvU,EAAU9d,EACtBgZ,EAAYhN,EAAMnU,OAClBmqB,EAAYN,EAAM7pB,OAEtB,GAAImhB,GAAagJ,KAAeqQ,GAAarQ,EAAYhJ,GACvD,OAAO,EAGT,IAAI6F,EAAUb,EAAM/C,IAAIjP,GACxB,GAAI6S,GAAWb,EAAM/C,IAAIyG,GACvB,OAAO7C,GAAW6C,EAEpB,IAAItV,GAAS,EACTzP,GAAS,EACT0lB,EAAQvE,EAAU7d,EAA0B,IAAImb,GAAW/b,EAE/D2e,EAAM/M,IAAIjF,EAAO0V,GACjB1D,EAAM/M,IAAIyQ,EAAO1V,GAGjB,QAASI,EAAQ4M,EAAW,CAC1B,IAAIsZ,EAAWtmB,EAAMI,GACjBmmB,EAAW7Q,EAAMtV,GAErB,GAAI2R,EACF,IAAIyU,EAAWH,EACXtU,EAAWwU,EAAUD,EAAUlmB,EAAOsV,EAAO1V,EAAOgS,GACpDD,EAAWuU,EAAUC,EAAUnmB,EAAOJ,EAAO0V,EAAO1D,GAE1D,GAAIwU,IAAanzB,EAAW,CAC1B,GAAImzB,EACF,SAEF71B,GAAS,EACT,MAGF,GAAI0lB,GACF,IAAK7U,GAAUkU,GAAO,SAAS6Q,EAAUtQ,GACnC,IAAK5S,GAASgT,EAAMJ,KACfqQ,IAAaC,GAAYxP,EAAUuP,EAAUC,EAAUzU,EAASC,EAAYC,IAC/E,OAAOqE,EAAKpmB,KAAKgmB,MAEjB,CACNtlB,GAAS,EACT,YAEG,GACD21B,IAAaC,IACXxP,EAAUuP,EAAUC,EAAUzU,EAASC,EAAYC,GACpD,CACLrhB,GAAS,EACT,OAKJ,OAFAqhB,EAAM,UAAUhS,GAChBgS,EAAM,UAAU0D,GACT/kB,EAoBT,SAAS6mB,GAAW7U,EAAQ+S,EAAOrD,EAAKP,EAASC,EAAYgF,EAAW/E,GACtE,OAAQK,GACN,KAAKnb,GACH,GAAKyL,EAAOoc,YAAcrJ,EAAMqJ,YAC3Bpc,EAAOuc,YAAcxJ,EAAMwJ,WAC9B,OAAO,EAETvc,EAASA,EAAO+b,OAChBhJ,EAAQA,EAAMgJ,OAEhB,KAAKznB,GACH,QAAK0L,EAAOoc,YAAcrJ,EAAMqJ,aAC3BhI,EAAU,IAAItP,GAAW9E,GAAS,IAAI8E,GAAWiO,KAKxD,KAAK5f,EACL,KAAKC,EACL,KAAKM,EAGH,OAAOwa,IAAIlO,GAAS+S,GAEtB,KAAKzf,EACH,OAAO0M,EAAOzY,MAAQwrB,EAAMxrB,MAAQyY,EAAO8jB,SAAW/Q,EAAM+Q,QAE9D,KAAK/vB,GACL,KAAKE,GAIH,OAAO+L,GAAW+S,EAAQ,GAE5B,KAAKtf,EACH,IAAIswB,EAAUhiB,GAEhB,KAAK/N,GACH,IAAI0vB,EAAYvU,EAAU9d,EAG1B,GAFA0yB,IAAYA,EAAU1hB,IAElBrC,EAAOgC,MAAQ+Q,EAAM/Q,OAAS0hB,EAChC,OAAO,EAGT,IAAIxT,EAAUb,EAAM/C,IAAItM,GACxB,GAAIkQ,EACF,OAAOA,GAAW6C,EAEpB5D,GAAW7d,EAGX+d,EAAM/M,IAAItC,EAAQ+S,GAClB,IAAI/kB,EAAS4mB,GAAYmP,EAAQ/jB,GAAS+jB,EAAQhR,GAAQ5D,EAASC,EAAYgF,EAAW/E,GAE1F,OADAA,EAAM,UAAUrP,GACThS,EAET,KAAKkG,GACH,GAAImU,GACF,OAAOA,GAAclL,KAAK6C,IAAWqI,GAAclL,KAAK4V,GAG9D,OAAO,EAgBT,SAASmC,GAAalV,EAAQ+S,EAAO5D,EAASC,EAAYgF,EAAW/E,GACnE,IAAIqU,EAAYvU,EAAU9d,EACtB2yB,EAAW1T,GAAWtQ,GACtBikB,EAAYD,EAAS96B,OACrBg7B,EAAW5T,GAAWyC,GACtBM,EAAY6Q,EAASh7B,OAEzB,GAAI+6B,GAAa5Q,IAAcqQ,EAC7B,OAAO,EAET,IAAIjmB,EAAQwmB,EACZ,MAAOxmB,IAAS,CACd,IAAI8B,EAAMykB,EAASvmB,GACnB,KAAMimB,EAAYnkB,KAAOwT,EAAQ9O,GAAe9G,KAAK4V,EAAOxT,IAC1D,OAAO,EAIX,IAAI2Q,EAAUb,EAAM/C,IAAItM,GACxB,GAAIkQ,GAAWb,EAAM/C,IAAIyG,GACvB,OAAO7C,GAAW6C,EAEpB,IAAI/kB,GAAS,EACbqhB,EAAM/M,IAAItC,EAAQ+S,GAClB1D,EAAM/M,IAAIyQ,EAAO/S,GAEjB,IAAImkB,EAAWT,EACf,QAASjmB,EAAQwmB,EAAW,CAC1B1kB,EAAMykB,EAASvmB,GACf,IAAI4Q,EAAWrO,EAAOT,GAClBqkB,EAAW7Q,EAAMxT,GAErB,GAAI6P,EACF,IAAIyU,EAAWH,EACXtU,EAAWwU,EAAUvV,EAAU9O,EAAKwT,EAAO/S,EAAQqP,GACnDD,EAAWf,EAAUuV,EAAUrkB,EAAKS,EAAQ+S,EAAO1D,GAGzD,KAAMwU,IAAanzB,EACV2d,IAAauV,GAAYxP,EAAU/F,EAAUuV,EAAUzU,EAASC,EAAYC,GAC7EwU,GACD,CACL71B,GAAS,EACT,MAEFm2B,IAAaA,EAAkB,eAAP5kB,GAE1B,GAAIvR,IAAWm2B,EAAU,CACvB,IAAIC,EAAUpkB,EAAOgR,YACjBqT,EAAUtR,EAAM/B,YAGhBoT,GAAWC,KACV,gBAAiBrkB,MAAU,gBAAiB+S,IACzB,mBAAXqR,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDr2B,GAAS,GAKb,OAFAqhB,EAAM,UAAUrP,GAChBqP,EAAM,UAAU0D,GACT/kB,EAUT,SAASsyB,GAAStjB,GAChB,OAAOgc,GAAYC,GAASjc,EAAMtM,EAAWjD,IAAUuP,EAAO,IAUhE,SAASsT,GAAWtQ,GAClB,OAAOyS,GAAezS,EAAQsE,GAAM8Z,IAWtC,SAAS/N,GAAarQ,GACpB,OAAOyS,GAAezS,EAAQ2O,GAAQ0P,IAUxC,IAAIuC,GAAWhZ,GAAiB,SAAS5K,GACvC,OAAO4K,GAAQ0E,IAAItP,IADImmB,GAWzB,SAASzC,GAAY1jB,GACnB,IAAIhP,EAAUgP,EAAKzV,KAAO,GACtB8V,EAAQwK,GAAU7Z,GAClB9E,EAAS+a,GAAe9G,KAAK0K,GAAW7Z,GAAUqP,EAAMnU,OAAS,EAErE,MAAOA,IAAU,CACf,IAAIjB,EAAOoV,EAAMnU,GACbo7B,EAAYr8B,EAAK+U,KACrB,GAAiB,MAAbsnB,GAAqBA,GAAatnB,EACpC,OAAO/U,EAAKV,KAGhB,OAAOyG,EAUT,SAASgyB,GAAUhjB,GACjB,IAAIgD,EAASiE,GAAe9G,KAAKqL,GAAQ,eAAiBA,GAASxL,EACnE,OAAOgD,EAAOkB,YAchB,SAAS6W,KACP,IAAI/pB,EAASwa,GAAOjL,UAAYA,GAEhC,OADAvP,EAASA,IAAWuP,GAAWwY,GAAe/nB,EACvCoxB,UAAUl2B,OAAS8E,EAAOoxB,UAAU,GAAIA,UAAU,IAAMpxB,EAWjE,SAASoe,GAAWhgB,EAAKmT,GACvB,IAAItX,EAAOmE,EAAIgf,SACf,OAAOmZ,GAAUhlB,GACbtX,EAAmB,iBAAPsX,EAAkB,SAAW,QACzCtX,EAAKmE,IAUX,SAASwqB,GAAa5W,GACpB,IAAIhS,EAASsW,GAAKtE,GACd9W,EAAS8E,EAAO9E,OAEpB,MAAOA,IAAU,CACf,IAAIqW,EAAMvR,EAAO9E,GACbwU,EAAQsC,EAAOT,GAEnBvR,EAAO9E,GAAU,CAACqW,EAAK7B,EAAOqZ,GAAmBrZ,IAEnD,OAAO1P,EAWT,SAAS4X,GAAU5F,EAAQT,GACzB,IAAI7B,EAAQ6D,GAASvB,EAAQT,GAC7B,OAAOiW,GAAa9X,GAASA,EAAQhN,EAUvC,SAASkiB,GAAUlV,GACjB,IAAI8mB,EAAQvgB,GAAe9G,KAAKO,EAAO+H,IACnCiK,EAAMhS,EAAM+H,IAEhB,IACE/H,EAAM+H,IAAkB/U,EACxB,IAAI+zB,GAAW,EACf,MAAO90B,IAET,IAAI3B,EAASwW,GAAqBrH,KAAKO,GAQvC,OAPI+mB,IACED,EACF9mB,EAAM+H,IAAkBiK,SAEjBhS,EAAM+H,KAGVzX,EAUT,IAAIowB,GAAc/X,GAA+B,SAASrG,GACxD,OAAc,MAAVA,EACK,IAETA,EAAS9E,GAAO8E,GACTjC,GAAYsI,GAAiBrG,IAAS,SAAS2c,GACpD,OAAOvX,GAAqBjI,KAAK6C,EAAQ2c,QANR+H,GAiBjCrG,GAAgBhY,GAA+B,SAASrG,GAC1D,IAAIhS,EAAS,GACb,MAAOgS,EACLzB,GAAUvQ,EAAQowB,GAAWpe,IAC7BA,EAASgF,GAAahF,GAExB,OAAOhS,GAN8B02B,GAgBnC/U,GAASgD,GAoCb,SAASrI,GAAQC,EAAOC,EAAKma,GAC3B,IAAIlnB,GAAS,EACTvU,EAASy7B,EAAWz7B,OAExB,QAASuU,EAAQvU,EAAQ,CACvB,IAAIjB,EAAO08B,EAAWlnB,GAClBuE,EAAO/Z,EAAK+Z,KAEhB,OAAQ/Z,EAAKmB,MACX,IAAK,OAAamhB,GAASvI,EAAM,MACjC,IAAK,YAAawI,GAAOxI,EAAM,MAC/B,IAAK,OAAawI,EAAMzD,GAAUyD,EAAKD,EAAQvI,GAAO,MACtD,IAAK,YAAauI,EAAQ1D,GAAU0D,EAAOC,EAAMxI,GAAO,OAG5D,MAAO,CAAE,MAASuI,EAAO,IAAOC,GAUlC,SAASoa,GAAepvB,GACtB,IAAI9N,EAAQ8N,EAAO9N,MAAM4O,IACzB,OAAO5O,EAAQA,EAAM,GAAGwX,MAAM3I,IAAkB,GAYlD,SAASsuB,GAAQ7kB,EAAQsS,EAAMwS,GAC7BxS,EAAOC,GAASD,EAAMtS,GAEtB,IAAIvC,GAAS,EACTvU,EAASopB,EAAKppB,OACd8E,GAAS,EAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIqW,EAAMiT,GAAMF,EAAK7U,IACrB,KAAMzP,EAAmB,MAAVgS,GAAkB8kB,EAAQ9kB,EAAQT,IAC/C,MAEFS,EAASA,EAAOT,GAElB,OAAIvR,KAAYyP,GAASvU,EAChB8E,GAET9E,EAAmB,MAAV8W,EAAiB,EAAIA,EAAO9W,SAC5BA,GAAU4sB,GAAS5sB,IAAWwkB,GAAQnO,EAAKrW,KACjDwf,GAAQ1I,IAAWsN,GAAYtN,KAUpC,SAASyP,GAAepS,GACtB,IAAInU,EAASmU,EAAMnU,OACf8E,EAAS,IAAIqP,EAAM2T,YAAY9nB,GAOnC,OAJIA,GAA6B,iBAAZmU,EAAM,IAAkB4G,GAAe9G,KAAKE,EAAO,WACtErP,EAAOyP,MAAQJ,EAAMI,MACrBzP,EAAO+2B,MAAQ1nB,EAAM0nB,OAEhB/2B,EAUT,SAAS8hB,GAAgB9P,GACvB,MAAqC,mBAAtBA,EAAOgR,aAA8BqF,GAAYrW,GAE5D,GADA8I,GAAW9D,GAAahF,IAgB9B,SAASiQ,GAAejQ,EAAQ0P,EAAKJ,GACnC,IAAI0P,EAAOhf,EAAOgR,YAClB,OAAQtB,GACN,KAAKpb,GACH,OAAO4nB,GAAiBlc,GAE1B,KAAK7M,EACL,KAAKC,EACH,OAAO,IAAI4rB,GAAMhf,GAEnB,KAAKzL,GACH,OAAO8nB,GAAcrc,EAAQsP,GAE/B,KAAK9a,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOyiB,GAAgBzX,EAAQsP,GAEjC,KAAK7b,EACH,OAAO,IAAIurB,EAEb,KAAKtrB,EACL,KAAKO,GACH,OAAO,IAAI+qB,EAAKhf,GAElB,KAAKjM,GACH,OAAOyoB,GAAYxc,GAErB,KAAKhM,GACH,OAAO,IAAIgrB,EAEb,KAAK9qB,GACH,OAAOwoB,GAAY1c,IAYzB,SAASglB,GAAkBxvB,EAAQyvB,GACjC,IAAI/7B,EAAS+7B,EAAQ/7B,OACrB,IAAKA,EACH,OAAOsM,EAET,IAAIsN,EAAY5Z,EAAS,EAGzB,OAFA+7B,EAAQniB,IAAc5Z,EAAS,EAAI,KAAO,IAAM+7B,EAAQniB,GACxDmiB,EAAUA,EAAQzrB,KAAKtQ,EAAS,EAAI,KAAO,KACpCsM,EAAOhH,QAAQ6H,GAAe,uBAAyB4uB,EAAU,UAU1E,SAASlT,GAAcrU,GACrB,OAAOgL,GAAQhL,IAAU4P,GAAY5P,OAChC4H,IAAoB5H,GAASA,EAAM4H,KAW1C,SAASoI,GAAQhQ,EAAOxU,GACtB,IAAIE,SAAcsU,EAGlB,OAFAxU,EAAmB,MAAVA,EAAiBuJ,EAAmBvJ,IAEpCA,IACE,UAARE,GACU,UAARA,GAAoB4N,GAASyK,KAAK/D,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQxU,EAajD,SAAS01B,GAAelhB,EAAOD,EAAOuC,GACpC,IAAKgJ,GAAShJ,GACZ,OAAO,EAET,IAAI5W,SAAcqU,EAClB,SAAY,UAARrU,EACKutB,GAAY3W,IAAW0N,GAAQjQ,EAAOuC,EAAO9W,QACrC,UAARE,GAAoBqU,KAASuC,IAE7BkO,GAAGlO,EAAOvC,GAAQC,GAa7B,SAASoZ,GAAMpZ,EAAOsC,GACpB,GAAI0I,GAAQhL,GACV,OAAO,EAET,IAAItU,SAAcsU,EAClB,QAAY,UAARtU,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATsU,IAAiB6T,GAAS7T,MAGvB5H,GAAc2L,KAAK/D,KAAW7H,GAAa4L,KAAK/D,IAC1C,MAAVsC,GAAkBtC,KAASxC,GAAO8E,IAUvC,SAASukB,GAAU7mB,GACjB,IAAItU,SAAcsU,EAClB,MAAgB,UAARtU,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVsU,EACU,OAAVA,EAWP,SAASmjB,GAAW7jB,GAClB,IAAI2jB,EAAWD,GAAY1jB,GACvB+V,EAAQvK,GAAOmY,GAEnB,GAAoB,mBAAT5N,KAAyB4N,KAAYhY,GAAYhF,WAC1D,OAAO,EAET,GAAI3G,IAAS+V,EACX,OAAO,EAET,IAAI9qB,EAAO24B,GAAQ7N,GACnB,QAAS9qB,GAAQ+U,IAAS/U,EAAK,GAUjC,SAASwtB,GAASzY,GAChB,QAASmH,IAAeA,MAAcnH,GAxTnCuK,IAAYoI,GAAO,IAAIpI,GAAS,IAAI2d,YAAY,MAAQ3wB,IACxDiT,IAAOmI,GAAO,IAAInI,KAAQ/T,GAC1BgU,IAAWkI,GAAOlI,GAAQ0d,YAActxB,IACxCpD,IAAOkf,GAAO,IAAIlf,KAAQuD,IAC1B0T,IAAWiI,GAAO,IAAIjI,KAAYtT,MACrCub,GAAS,SAASjS,GAChB,IAAI1P,EAAS2kB,GAAWjV,GACpBshB,EAAOhxB,GAAU4F,GAAY8J,EAAMsT,YAActgB,EACjD00B,EAAapG,EAAOjX,GAASiX,GAAQ,GAEzC,GAAIoG,EACF,OAAQA,GACN,KAAKtd,GAAoB,OAAOvT,GAChC,KAAKyT,GAAe,OAAOvU,EAC3B,KAAKwU,GAAmB,OAAOpU,GAC/B,KAAKqU,GAAe,OAAOlU,GAC3B,KAAKmU,GAAmB,OAAO/T,GAGnC,OAAOpG,IA+SX,IAAIq3B,GAAavhB,GAAasO,GAAakT,GAS3C,SAASjP,GAAY3Y,GACnB,IAAIshB,EAAOthB,GAASA,EAAMsT,YACtBjI,EAAwB,mBAARiW,GAAsBA,EAAKrb,WAAcE,GAE7D,OAAOnG,IAAUqL,EAWnB,SAASgO,GAAmBrZ,GAC1B,OAAOA,IAAUA,IAAUsL,GAAStL,GAYtC,SAASmZ,GAAwBtX,EAAKgW,GACpC,OAAO,SAASvV,GACd,OAAc,MAAVA,IAGGA,EAAOT,KAASgW,IACpBA,IAAa7kB,GAAc6O,KAAOrE,GAAO8E,MAYhD,SAASulB,GAAcvoB,GACrB,IAAIhP,EAASw3B,GAAQxoB,GAAM,SAASuC,GAIlC,OAHIoB,EAAMqB,OAAShR,GACjB2P,EAAMsK,QAED1L,KAGLoB,EAAQ3S,EAAO2S,MACnB,OAAO3S,EAmBT,SAASs1B,GAAUr7B,EAAMuN,GACvB,IAAI2Z,EAAUlnB,EAAK,GACfw9B,EAAajwB,EAAO,GACpBkwB,EAAavW,EAAUsW,EACvB7U,EAAW8U,GAAcn0B,EAAiBC,EAAqBM,GAE/D6zB,EACAF,GAAc3zB,GAAmBqd,GAAWzd,GAC5C+zB,GAAc3zB,GAAmBqd,GAAWpd,GAAqB9J,EAAK,GAAGiB,QAAUsM,EAAO,IAC1FiwB,IAAe3zB,EAAgBC,IAAsByD,EAAO,GAAGtM,QAAUsM,EAAO,IAAQ2Z,GAAWzd,EAGvG,IAAMkf,IAAY+U,EAChB,OAAO19B,EAGLw9B,EAAal0B,IACftJ,EAAK,GAAKuN,EAAO,GAEjBkwB,GAAcvW,EAAU5d,EAAiB,EAAIE,GAG/C,IAAIiM,EAAQlI,EAAO,GACnB,GAAIkI,EAAO,CACT,IAAI2f,EAAWp1B,EAAK,GACpBA,EAAK,GAAKo1B,EAAWD,GAAYC,EAAU3f,EAAOlI,EAAO,IAAMkI,EAC/DzV,EAAK,GAAKo1B,EAAWjb,GAAena,EAAK,GAAIgJ,GAAeuE,EAAO,GA0BrE,OAvBAkI,EAAQlI,EAAO,GACXkI,IACF2f,EAAWp1B,EAAK,GAChBA,EAAK,GAAKo1B,EAAWU,GAAiBV,EAAU3f,EAAOlI,EAAO,IAAMkI,EACpEzV,EAAK,GAAKo1B,EAAWjb,GAAena,EAAK,GAAIgJ,GAAeuE,EAAO,IAGrEkI,EAAQlI,EAAO,GACXkI,IACFzV,EAAK,GAAKyV,GAGR+nB,EAAa3zB,IACf7J,EAAK,GAAgB,MAAXA,EAAK,GAAauN,EAAO,GAAKuR,GAAU9e,EAAK,GAAIuN,EAAO,KAGrD,MAAXvN,EAAK,KACPA,EAAK,GAAKuN,EAAO,IAGnBvN,EAAK,GAAKuN,EAAO,GACjBvN,EAAK,GAAKy9B,EAEHz9B,EAYT,SAASsuB,GAAavW,GACpB,IAAIhS,EAAS,GACb,GAAc,MAAVgS,EACF,IAAK,IAAIT,KAAOrE,GAAO8E,GACrBhS,EAAOV,KAAKiS,GAGhB,OAAOvR,EAUT,SAAS6kB,GAAenV,GACtB,OAAO8G,GAAqBrH,KAAKO,GAYnC,SAASub,GAASjc,EAAMuN,EAAOrI,GAE7B,OADAqI,EAAQ1D,GAAU0D,IAAU7Z,EAAasM,EAAK9T,OAAS,EAAKqhB,EAAO,GAC5D,WACL,IAAIrN,EAAOkiB,UACP3hB,GAAS,EACTvU,EAAS2d,GAAU3J,EAAKhU,OAASqhB,EAAO,GACxClN,EAAQiB,EAAMpV,GAElB,QAASuU,EAAQvU,EACfmU,EAAMI,GAASP,EAAKqN,EAAQ9M,GAE9BA,GAAS,EACT,IAAImoB,EAAYtnB,EAAMiM,EAAQ,GAC9B,QAAS9M,EAAQ8M,EACfqb,EAAUnoB,GAASP,EAAKO,GAG1B,OADAmoB,EAAUrb,GAASrI,EAAU7E,GACtBN,GAAMC,EAAMpW,KAAMg/B,IAY7B,SAAS/R,GAAO7T,EAAQsS,GACtB,OAAOA,EAAKppB,OAAS,EAAI8W,EAASqS,GAAQrS,EAAQyZ,GAAUnH,EAAM,GAAI,IAaxE,SAASkP,GAAQnkB,EAAOob,GACtB,IAAIpO,EAAYhN,EAAMnU,OAClBA,EAAS6d,GAAU0R,EAAQvvB,OAAQmhB,GACnCwb,EAAW/b,GAAUzM,GAEzB,MAAOnU,IAAU,CACf,IAAIuU,EAAQgb,EAAQvvB,GACpBmU,EAAMnU,GAAUwkB,GAAQjQ,EAAO4M,GAAawb,EAASpoB,GAAS/M,EAEhE,OAAO2M,EAWT,SAASga,GAAQrX,EAAQT,GACvB,IAAY,gBAARA,GAAgD,oBAAhBS,EAAOT,KAIhC,aAAPA,EAIJ,OAAOS,EAAOT,GAiBhB,IAAIujB,GAAUgD,GAASzM,IAUnBvvB,GAAakc,IAAiB,SAAShJ,EAAM0T,GAC/C,OAAOrV,GAAKvR,WAAWkT,EAAM0T,IAW3BsI,GAAc8M,GAASxM,IAY3B,SAASyJ,GAAgB7D,EAAS6G,EAAW5W,GAC3C,IAAI3Z,EAAUuwB,EAAY,GAC1B,OAAO/M,GAAYkG,EAAS8F,GAAkBxvB,EAAQwwB,GAAkBpB,GAAepvB,GAAS2Z,KAYlG,SAAS2W,GAAS9oB,GAChB,IAAIipB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQlf,KACRmf,EAAYh0B,GAAY+zB,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAAS9zB,EACb,OAAOitB,UAAU,QAGnB6G,EAAQ,EAEV,OAAOjpB,EAAKD,MAAMrM,EAAW0uB,YAYjC,SAAStR,GAAYzQ,EAAO2E,GAC1B,IAAIvE,GAAS,EACTvU,EAASmU,EAAMnU,OACf4Z,EAAY5Z,EAAS,EAEzB8Y,EAAOA,IAAStR,EAAYxH,EAAS8Y,EACrC,QAASvE,EAAQuE,EAAM,CACrB,IAAIqkB,EAAOzY,GAAWnQ,EAAOqF,GACzBpF,EAAQL,EAAMgpB,GAElBhpB,EAAMgpB,GAAQhpB,EAAMI,GACpBJ,EAAMI,GAASC,EAGjB,OADAL,EAAMnU,OAAS8Y,EACR3E,EAUT,IAAIue,GAAe2J,IAAc,SAAStmB,GACxC,IAAIjR,EAAS,GAOb,OAN6B,KAAzBiR,EAAOqnB,WAAW,IACpBt4B,EAAOV,KAAK,IAEd2R,EAAOzQ,QAAQuH,IAAY,SAASrO,EAAOqnB,EAAQwX,EAAOC,GACxDx4B,EAAOV,KAAKi5B,EAAQC,EAAUh4B,QAAQiI,GAAc,MAASsY,GAAUrnB,MAElEsG,KAUT,SAASwkB,GAAM9U,GACb,GAAoB,iBAATA,GAAqB6T,GAAS7T,GACvC,OAAOA,EAET,IAAI1P,EAAU0P,EAAQ,GACtB,MAAkB,KAAV1P,GAAkB,EAAI0P,IAAWlL,EAAY,KAAOxE,EAU9D,SAAS+Z,GAAS/K,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO+G,GAAa5G,KAAKH,GACzB,MAAOrN,IACT,IACE,OAAQqN,EAAO,GACf,MAAOrN,KAEX,MAAO,GAWT,SAASq2B,GAAkBf,EAAS9V,GAOlC,OANAxR,GAAU5K,GAAW,SAASmwB,GAC5B,IAAIxlB,EAAQ,KAAOwlB,EAAK,GACnB/T,EAAU+T,EAAK,KAAQjlB,GAAcgnB,EAASvnB,IACjDunB,EAAQ33B,KAAKoQ,MAGVunB,EAAQv4B,OAUjB,SAASmc,GAAaqW,GACpB,GAAIA,aAAmBvW,GACrB,OAAOuW,EAAQlV,QAEjB,IAAIhc,EAAS,IAAI4a,GAAcsW,EAAQ/V,YAAa+V,EAAQ7V,WAI5D,OAHArb,EAAOob,YAAcU,GAAUoV,EAAQ9V,aACvCpb,EAAOsb,UAAa4V,EAAQ5V,UAC5Btb,EAAOub,WAAa2V,EAAQ3V,WACrBvb,EA0BT,SAASy4B,GAAMppB,EAAO2E,EAAM2c,GAExB3c,GADG2c,EAAQC,GAAevhB,EAAO2E,EAAM2c,GAAS3c,IAAStR,GAClD,EAEAmW,GAAU4K,GAAUzP,GAAO,GAEpC,IAAI9Y,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,IAAKA,GAAU8Y,EAAO,EACpB,MAAO,GAET,IAAIvE,EAAQ,EACRO,EAAW,EACXhQ,EAASsQ,EAAM2H,GAAW/c,EAAS8Y,IAEvC,MAAOvE,EAAQvU,EACb8E,EAAOgQ,KAAcyb,GAAUpc,EAAOI,EAAQA,GAASuE,GAEzD,OAAOhU,EAkBT,SAAS04B,GAAQrpB,GACf,IAAII,GAAS,EACTvU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACnC8U,EAAW,EACXhQ,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdC,IACF1P,EAAOgQ,KAAcN,GAGzB,OAAO1P,EAyBT,SAAS24B,KACP,IAAIz9B,EAASk2B,UAAUl2B,OACvB,IAAKA,EACH,MAAO,GAET,IAAIgU,EAAOoB,EAAMpV,EAAS,GACtBmU,EAAQ+hB,UAAU,GAClB3hB,EAAQvU,EAEZ,MAAOuU,IACLP,EAAKO,EAAQ,GAAK2hB,UAAU3hB,GAE9B,OAAOc,GAAUmK,GAAQrL,GAASyM,GAAUzM,GAAS,CAACA,GAAQuU,GAAY1U,EAAM,IAwBlF,IAAI0pB,GAAa7N,IAAS,SAAS1b,EAAOmB,GACxC,OAAOgZ,GAAkBna,GACrBsT,GAAetT,EAAOuU,GAAYpT,EAAQ,EAAGgZ,IAAmB,IAChE,MA6BFqP,GAAe9N,IAAS,SAAS1b,EAAOmB,GAC1C,IAAIjB,EAAWuW,GAAKtV,GAIpB,OAHIgZ,GAAkBja,KACpBA,EAAW7M,GAEN8mB,GAAkBna,GACrBsT,GAAetT,EAAOuU,GAAYpT,EAAQ,EAAGgZ,IAAmB,GAAOO,GAAYxa,EAAU,IAC7F,MA0BFupB,GAAiB/N,IAAS,SAAS1b,EAAOmB,GAC5C,IAAIJ,EAAa0V,GAAKtV,GAItB,OAHIgZ,GAAkBpZ,KACpBA,EAAa1N,GAER8mB,GAAkBna,GACrBsT,GAAetT,EAAOuU,GAAYpT,EAAQ,EAAGgZ,IAAmB,GAAO9mB,EAAW0N,GAClF,MA4BN,SAAS2oB,GAAK1pB,EAAOlS,EAAGwzB,GACtB,IAAIz1B,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGLiC,EAAKwzB,GAASxzB,IAAMuF,EAAa,EAAI+gB,GAAUtmB,GACxCsuB,GAAUpc,EAAOlS,EAAI,EAAI,EAAIA,EAAGjC,IAH9B,GA+BX,SAAS89B,GAAU3pB,EAAOlS,EAAGwzB,GAC3B,IAAIz1B,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGLiC,EAAKwzB,GAASxzB,IAAMuF,EAAa,EAAI+gB,GAAUtmB,GAC/CA,EAAIjC,EAASiC,EACNsuB,GAAUpc,EAAO,EAAGlS,EAAI,EAAI,EAAIA,IAJ9B,GA0CX,SAAS87B,GAAe5pB,EAAOS,GAC7B,OAAQT,GAASA,EAAMnU,OACnBgyB,GAAU7d,EAAO0a,GAAYja,EAAW,IAAI,GAAM,GAClD,GAsCN,SAASopB,GAAU7pB,EAAOS,GACxB,OAAQT,GAASA,EAAMnU,OACnBgyB,GAAU7d,EAAO0a,GAAYja,EAAW,IAAI,GAC5C,GAgCN,SAASqpB,GAAK9pB,EAAOK,EAAO6M,EAAOC,GACjC,IAAIthB,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGDqhB,GAAyB,iBAATA,GAAqBqU,GAAevhB,EAAOK,EAAO6M,KACpEA,EAAQ,EACRC,EAAMthB,GAEDsoB,GAASnU,EAAOK,EAAO6M,EAAOC,IAN5B,GA4CX,SAAS4c,GAAU/pB,EAAOS,EAAW2B,GACnC,IAAIvW,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAqB,MAAbgC,EAAoB,EAAIgS,GAAUhS,GAI9C,OAHIhC,EAAQ,IACVA,EAAQoJ,GAAU3d,EAASuU,EAAO,IAE7B+B,GAAcnC,EAAO0a,GAAYja,EAAW,GAAIL,GAsCzD,SAAS4pB,GAAchqB,EAAOS,EAAW2B,GACvC,IAAIvW,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAQvU,EAAS,EAOrB,OANIuW,IAAc/O,IAChB+M,EAAQgU,GAAUhS,GAClBhC,EAAQgC,EAAY,EAChBoH,GAAU3d,EAASuU,EAAO,GAC1BsJ,GAAUtJ,EAAOvU,EAAS,IAEzBsW,GAAcnC,EAAO0a,GAAYja,EAAW,GAAIL,GAAO,GAiBhE,SAAShQ,GAAQ4P,GACf,IAAInU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAAS0oB,GAAYvU,EAAO,GAAK,GAiB1C,SAASiqB,GAAYjqB,GACnB,IAAInU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAAS0oB,GAAYvU,EAAO7K,GAAY,GAuBjD,SAAS+0B,GAAalqB,EAAOwU,GAC3B,IAAI3oB,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGL2oB,EAAQA,IAAUnhB,EAAY,EAAI+gB,GAAUI,GACrCD,GAAYvU,EAAOwU,IAHjB,GAqBX,SAAS2V,GAAUj5B,GACjB,IAAIkP,GAAS,EACTvU,EAAkB,MAATqF,EAAgB,EAAIA,EAAMrF,OACnC8E,EAAS,GAEb,QAASyP,EAAQvU,EAAQ,CACvB,IAAIg6B,EAAO30B,EAAMkP,GACjBzP,EAAOk1B,EAAK,IAAMA,EAAK,GAEzB,OAAOl1B,EAqBT,SAASy5B,GAAKpqB,GACZ,OAAQA,GAASA,EAAMnU,OAAUmU,EAAM,GAAK3M,EA0B9C,SAAS6nB,GAAQlb,EAAOK,EAAO+B,GAC7B,IAAIvW,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAqB,MAAbgC,EAAoB,EAAIgS,GAAUhS,GAI9C,OAHIhC,EAAQ,IACVA,EAAQoJ,GAAU3d,EAASuU,EAAO,IAE7BS,GAAYb,EAAOK,EAAOD,GAiBnC,SAASiqB,GAAQrqB,GACf,IAAInU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAASuwB,GAAUpc,EAAO,GAAI,GAAK,GAoB5C,IAAIsqB,GAAe5O,IAAS,SAAS3F,GACnC,IAAIwU,EAASvpB,GAAS+U,EAAQsI,IAC9B,OAAQkM,EAAO1+B,QAAU0+B,EAAO,KAAOxU,EAAO,GAC1CD,GAAiByU,GACjB,MA0BFC,GAAiB9O,IAAS,SAAS3F,GACrC,IAAI7V,EAAWuW,GAAKV,GAChBwU,EAASvpB,GAAS+U,EAAQsI,IAO9B,OALIne,IAAauW,GAAK8T,GACpBrqB,EAAW7M,EAEXk3B,EAAO/b,MAED+b,EAAO1+B,QAAU0+B,EAAO,KAAOxU,EAAO,GAC1CD,GAAiByU,EAAQ7P,GAAYxa,EAAU,IAC/C,MAwBFuqB,GAAmB/O,IAAS,SAAS3F,GACvC,IAAIhV,EAAa0V,GAAKV,GAClBwU,EAASvpB,GAAS+U,EAAQsI,IAM9B,OAJAtd,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACxD0N,GACFwpB,EAAO/b,MAED+b,EAAO1+B,QAAU0+B,EAAO,KAAOxU,EAAO,GAC1CD,GAAiByU,EAAQl3B,EAAW0N,GACpC,MAkBN,SAAS5E,GAAK6D,EAAO0qB,GACnB,OAAgB,MAAT1qB,EAAgB,GAAKsJ,GAAWxJ,KAAKE,EAAO0qB,GAiBrD,SAASjU,GAAKzW,GACZ,IAAInU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAASmU,EAAMnU,EAAS,GAAKwH,EAwBtC,SAASs3B,GAAY3qB,EAAOK,EAAO+B,GACjC,IAAIvW,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuU,EAAQvU,EAKZ,OAJIuW,IAAc/O,IAChB+M,EAAQgU,GAAUhS,GAClBhC,EAAQA,EAAQ,EAAIoJ,GAAU3d,EAASuU,EAAO,GAAKsJ,GAAUtJ,EAAOvU,EAAS,IAExEwU,IAAUA,EACb8E,GAAkBnF,EAAOK,EAAOD,GAChC+B,GAAcnC,EAAOuC,GAAWnC,GAAO,GAwB7C,SAASwqB,GAAI5qB,EAAOlS,GAClB,OAAQkS,GAASA,EAAMnU,OAAU0uB,GAAQva,EAAOoU,GAAUtmB,IAAMuF,EA0BlE,IAAIw3B,GAAOnP,GAASoP,IAsBpB,SAASA,GAAQ9qB,EAAOmB,GACtB,OAAQnB,GAASA,EAAMnU,QAAUsV,GAAUA,EAAOtV,OAC9CovB,GAAYjb,EAAOmB,GACnBnB,EA0BN,SAAS+qB,GAAU/qB,EAAOmB,EAAQjB,GAChC,OAAQF,GAASA,EAAMnU,QAAUsV,GAAUA,EAAOtV,OAC9CovB,GAAYjb,EAAOmB,EAAQuZ,GAAYxa,EAAU,IACjDF,EA0BN,SAASgrB,GAAYhrB,EAAOmB,EAAQJ,GAClC,OAAQf,GAASA,EAAMnU,QAAUsV,GAAUA,EAAOtV,OAC9CovB,GAAYjb,EAAOmB,EAAQ9N,EAAW0N,GACtCf,EA2BN,IAAIirB,GAAShI,IAAS,SAASjjB,EAAOob,GACpC,IAAIvvB,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACnC8E,EAAS4gB,GAAOvR,EAAOob,GAM3B,OAJAD,GAAWnb,EAAOgB,GAASoa,GAAS,SAAShb,GAC3C,OAAOiQ,GAAQjQ,EAAOvU,IAAWuU,EAAQA,KACxC/Q,KAAKmwB,KAED7uB,KA+BT,SAASu6B,GAAOlrB,EAAOS,GACrB,IAAI9P,EAAS,GACb,IAAMqP,IAASA,EAAMnU,OACnB,OAAO8E,EAET,IAAIyP,GAAS,EACTgb,EAAU,GACVvvB,EAASmU,EAAMnU,OAEnB4U,EAAYia,GAAYja,EAAW,GACnC,QAASL,EAAQvU,EAAQ,CACvB,IAAIwU,EAAQL,EAAMI,GACdK,EAAUJ,EAAOD,EAAOJ,KAC1BrP,EAAOV,KAAKoQ,GACZ+a,EAAQnrB,KAAKmQ,IAIjB,OADA+a,GAAWnb,EAAOob,GACXzqB,EA0BT,SAASsZ,GAAQjK,GACf,OAAgB,MAATA,EAAgBA,EAAQgK,GAAclK,KAAKE,GAmBpD,SAAS2e,GAAM3e,EAAOkN,EAAOC,GAC3B,IAAIthB,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGDshB,GAAqB,iBAAPA,GAAmBoU,GAAevhB,EAAOkN,EAAOC,IAChED,EAAQ,EACRC,EAAMthB,IAGNqhB,EAAiB,MAATA,EAAgB,EAAIkH,GAAUlH,GACtCC,EAAMA,IAAQ9Z,EAAYxH,EAASuoB,GAAUjH,IAExCiP,GAAUpc,EAAOkN,EAAOC,IAVtB,GA8BX,SAASge,GAAYnrB,EAAOK,GAC1B,OAAOic,GAAgBtc,EAAOK,GA4BhC,SAAS+qB,GAAcprB,EAAOK,EAAOH,GACnC,OAAOyc,GAAkB3c,EAAOK,EAAOqa,GAAYxa,EAAU,IAmB/D,SAASmrB,GAAcrrB,EAAOK,GAC5B,IAAIxU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,GAAIA,EAAQ,CACV,IAAIuU,EAAQkc,GAAgBtc,EAAOK,GACnC,GAAID,EAAQvU,GAAUglB,GAAG7Q,EAAMI,GAAQC,GACrC,OAAOD,EAGX,OAAQ,EAqBV,SAASkrB,GAAgBtrB,EAAOK,GAC9B,OAAOic,GAAgBtc,EAAOK,GAAO,GA4BvC,SAASkrB,GAAkBvrB,EAAOK,EAAOH,GACvC,OAAOyc,GAAkB3c,EAAOK,EAAOqa,GAAYxa,EAAU,IAAI,GAmBnE,SAASsrB,GAAkBxrB,EAAOK,GAChC,IAAIxU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,GAAIA,EAAQ,CACV,IAAIuU,EAAQkc,GAAgBtc,EAAOK,GAAO,GAAQ,EAClD,GAAIwQ,GAAG7Q,EAAMI,GAAQC,GACnB,OAAOD,EAGX,OAAQ,EAkBV,SAASqrB,GAAWzrB,GAClB,OAAQA,GAASA,EAAMnU,OACnBwxB,GAAerd,GACf,GAmBN,SAAS0rB,GAAa1rB,EAAOE,GAC3B,OAAQF,GAASA,EAAMnU,OACnBwxB,GAAerd,EAAO0a,GAAYxa,EAAU,IAC5C,GAiBN,SAASyrB,GAAK3rB,GACZ,IAAInU,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAOA,EAASuwB,GAAUpc,EAAO,EAAGnU,GAAU,GA4BhD,SAAS+/B,GAAK5rB,EAAOlS,EAAGwzB,GACtB,OAAMthB,GAASA,EAAMnU,QAGrBiC,EAAKwzB,GAASxzB,IAAMuF,EAAa,EAAI+gB,GAAUtmB,GACxCsuB,GAAUpc,EAAO,EAAGlS,EAAI,EAAI,EAAIA,IAH9B,GA+BX,SAAS+9B,GAAU7rB,EAAOlS,EAAGwzB,GAC3B,IAAIz1B,EAAkB,MAATmU,EAAgB,EAAIA,EAAMnU,OACvC,OAAKA,GAGLiC,EAAKwzB,GAASxzB,IAAMuF,EAAa,EAAI+gB,GAAUtmB,GAC/CA,EAAIjC,EAASiC,EACNsuB,GAAUpc,EAAOlS,EAAI,EAAI,EAAIA,EAAGjC,IAJ9B,GA0CX,SAASigC,GAAe9rB,EAAOS,GAC7B,OAAQT,GAASA,EAAMnU,OACnBgyB,GAAU7d,EAAO0a,GAAYja,EAAW,IAAI,GAAO,GACnD,GAsCN,SAASsrB,GAAU/rB,EAAOS,GACxB,OAAQT,GAASA,EAAMnU,OACnBgyB,GAAU7d,EAAO0a,GAAYja,EAAW,IACxC,GAmBN,IAAIurB,GAAQtQ,IAAS,SAAS3F,GAC5B,OAAOyH,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,OA0BxD8R,GAAUvQ,IAAS,SAAS3F,GAC9B,IAAI7V,EAAWuW,GAAKV,GAIpB,OAHIoE,GAAkBja,KACpBA,EAAW7M,GAENmqB,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAOO,GAAYxa,EAAU,OAwBrFgsB,GAAYxQ,IAAS,SAAS3F,GAChC,IAAIhV,EAAa0V,GAAKV,GAEtB,OADAhV,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACrDmqB,GAASjJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAO9mB,EAAW0N,MAqB9E,SAASorB,GAAKnsB,GACZ,OAAQA,GAASA,EAAMnU,OAAU2xB,GAASxd,GAAS,GA0BrD,SAASjN,GAAOiN,EAAOE,GACrB,OAAQF,GAASA,EAAMnU,OAAU2xB,GAASxd,EAAO0a,GAAYxa,EAAU,IAAM,GAuB/E,SAASksB,GAASpsB,EAAOe,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACpD2M,GAASA,EAAMnU,OAAU2xB,GAASxd,EAAO3M,EAAW0N,GAAc,GAsB5E,SAASsrB,GAAMrsB,GACb,IAAMA,IAASA,EAAMnU,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAmU,EAAQU,GAAYV,GAAO,SAASssB,GAClC,GAAInS,GAAkBmS,GAEpB,OADAzgC,EAAS2d,GAAU8iB,EAAMzgC,OAAQA,IAC1B,KAGJoX,GAAUpX,GAAQ,SAASuU,GAChC,OAAOY,GAAShB,EAAO0B,GAAatB,OAyBxC,SAASmsB,GAAUvsB,EAAOE,GACxB,IAAMF,IAASA,EAAMnU,OACnB,MAAO,GAET,IAAI8E,EAAS07B,GAAMrsB,GACnB,OAAgB,MAAZE,EACKvP,EAEFqQ,GAASrQ,GAAQ,SAAS27B,GAC/B,OAAO5sB,GAAMQ,EAAU7M,EAAWi5B,MAwBtC,IAAIE,GAAU9Q,IAAS,SAAS1b,EAAOmB,GACrC,OAAOgZ,GAAkBna,GACrBsT,GAAetT,EAAOmB,GACtB,MAqBFsrB,GAAM/Q,IAAS,SAAS3F,GAC1B,OAAOkI,GAAQvd,GAAYqV,EAAQoE,QA0BjCuS,GAAQhR,IAAS,SAAS3F,GAC5B,IAAI7V,EAAWuW,GAAKV,GAIpB,OAHIoE,GAAkBja,KACpBA,EAAW7M,GAEN4qB,GAAQvd,GAAYqV,EAAQoE,IAAoBO,GAAYxa,EAAU,OAwB3EysB,GAAUjR,IAAS,SAAS3F,GAC9B,IAAIhV,EAAa0V,GAAKV,GAEtB,OADAhV,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACrD4qB,GAAQvd,GAAYqV,EAAQoE,IAAoB9mB,EAAW0N,MAmBhE6rB,GAAMlR,GAAS2Q,IAkBnB,SAASQ,GAAUliC,EAAOwW,GACxB,OAAO+c,GAAcvzB,GAAS,GAAIwW,GAAU,GAAI4P,IAkBlD,SAAS+b,GAAcniC,EAAOwW,GAC5B,OAAO+c,GAAcvzB,GAAS,GAAIwW,GAAU,GAAI4Z,IAuBlD,IAAIgS,GAAUrR,IAAS,SAAS3F,GAC9B,IAAIlqB,EAASkqB,EAAOlqB,OAChBqU,EAAWrU,EAAS,EAAIkqB,EAAOlqB,EAAS,GAAKwH,EAGjD,OADA6M,EAA8B,mBAAZA,GAA0B6V,EAAOvH,MAAOtO,GAAY7M,EAC/Dk5B,GAAUxW,EAAQ7V,MAkC3B,SAAS8sB,GAAM3sB,GACb,IAAI1P,EAASwa,GAAO9K,GAEpB,OADA1P,EAAOqb,WAAY,EACZrb,EA0BT,SAASs8B,GAAI5sB,EAAO6sB,GAElB,OADAA,EAAY7sB,GACLA,EA0BT,SAAS+iB,GAAK/iB,EAAO6sB,GACnB,OAAOA,EAAY7sB,GAmBrB,IAAI8sB,GAAYlK,IAAS,SAASzR,GAChC,IAAI3lB,EAAS2lB,EAAM3lB,OACfqhB,EAAQrhB,EAAS2lB,EAAM,GAAK,EAC5BnR,EAAQ9W,KAAKuiB,YACbohB,EAAc,SAASvqB,GAAU,OAAO4O,GAAO5O,EAAQ6O,IAE3D,QAAI3lB,EAAS,GAAKtC,KAAKwiB,YAAYlgB,SAC7BwU,aAAiBiL,IAAiB+E,GAAQnD,IAGhD7M,EAAQA,EAAMse,MAAMzR,GAAQA,GAASrhB,EAAS,EAAI,IAClDwU,EAAM0L,YAAY9b,KAAK,CACrB,KAAQmzB,GACR,KAAQ,CAAC8J,GACT,QAAW75B,IAEN,IAAIkY,GAAclL,EAAO9W,KAAKyiB,WAAWoX,MAAK,SAASpjB,GAI5D,OAHInU,IAAWmU,EAAMnU,QACnBmU,EAAM/P,KAAKoD,GAEN2M,MAZAzW,KAAK65B,KAAK8J,MA2CrB,SAASE,KACP,OAAOJ,GAAMzjC,MA6Bf,SAAS8jC,KACP,OAAO,IAAI9hB,GAAchiB,KAAK8W,QAAS9W,KAAKyiB,WAyB9C,SAASshB,KACH/jC,KAAK2iB,aAAe7Y,IACtB9J,KAAK2iB,WAAaqhB,GAAQhkC,KAAK8W,UAEjC,IAAIoE,EAAOlb,KAAK0iB,WAAa1iB,KAAK2iB,WAAWrgB,OACzCwU,EAAQoE,EAAOpR,EAAY9J,KAAK2iB,WAAW3iB,KAAK0iB,aAEpD,MAAO,CAAE,KAAQxH,EAAM,MAASpE,GAqBlC,SAASmtB,KACP,OAAOjkC,KA2BT,SAASkkC,GAAaptB,GACpB,IAAI1P,EACA6lB,EAASjtB,KAEb,MAAOitB,aAAkB5K,GAAY,CACnC,IAAIe,EAAQnB,GAAagL,GACzB7J,EAAMV,UAAY,EAClBU,EAAMT,WAAa7Y,EACf1C,EACF0qB,EAASvP,YAAca,EAEvBhc,EAASgc,EAEX,IAAI0O,EAAW1O,EACf6J,EAASA,EAAO1K,YAGlB,OADAuP,EAASvP,YAAczL,EAChB1P,EAuBT,SAAS+8B,KACP,IAAIrtB,EAAQ9W,KAAKuiB,YACjB,GAAIzL,aAAiBiL,GAAa,CAChC,IAAIqiB,EAAUttB,EAUd,OATI9W,KAAKwiB,YAAYlgB,SACnB8hC,EAAU,IAAIriB,GAAY/hB,OAE5BokC,EAAUA,EAAQ1jB,UAClB0jB,EAAQ5hB,YAAY9b,KAAK,CACvB,KAAQmzB,GACR,KAAQ,CAACnZ,IACT,QAAW5W,IAEN,IAAIkY,GAAcoiB,EAASpkC,KAAKyiB,WAEzC,OAAOziB,KAAK65B,KAAKnZ,IAiBnB,SAAS2jB,KACP,OAAOrgB,GAAiBhkB,KAAKuiB,YAAaviB,KAAKwiB,aA2BjD,IAAI8hB,GAAU5M,IAAiB,SAAStwB,EAAQ0P,EAAO6B,GACjD0E,GAAe9G,KAAKnP,EAAQuR,KAC5BvR,EAAOuR,GAET4O,GAAgBngB,EAAQuR,EAAK,MA6CjC,SAAS4rB,GAAM9rB,EAAYvB,EAAW6gB,GACpC,IAAI3hB,EAAO0L,GAAQrJ,GAAcxB,GAAawT,GAI9C,OAHIsN,GAASC,GAAevf,EAAYvB,EAAW6gB,KACjD7gB,EAAYpN,GAEPsM,EAAKqC,EAAY0Y,GAAYja,EAAW,IAwCjD,SAAS9R,GAAOqT,EAAYvB,GAC1B,IAAId,EAAO0L,GAAQrJ,GAActB,GAAc4T,GAC/C,OAAO3U,EAAKqC,EAAY0Y,GAAYja,EAAW,IAuCjD,IAAItV,GAAO23B,GAAWiH,IAqBlBgE,GAAWjL,GAAWkH,IAuB1B,SAASgE,GAAQhsB,EAAY9B,GAC3B,OAAOqU,GAAYxlB,GAAIiT,EAAY9B,GAAW,GAuBhD,SAAS+tB,GAAYjsB,EAAY9B,GAC/B,OAAOqU,GAAYxlB,GAAIiT,EAAY9B,GAAW/K,GAwBhD,SAAS+4B,GAAalsB,EAAY9B,EAAUsU,GAE1C,OADAA,EAAQA,IAAUnhB,EAAY,EAAI+gB,GAAUI,GACrCD,GAAYxlB,GAAIiT,EAAY9B,GAAWsU,GAiChD,SAASjlB,GAAQyS,EAAY9B,GAC3B,IAAIP,EAAO0L,GAAQrJ,GAAc1B,GAAY4Q,GAC7C,OAAOvR,EAAKqC,EAAY0Y,GAAYxa,EAAU,IAuBhD,SAASiuB,GAAansB,EAAY9B,GAChC,IAAIP,EAAO0L,GAAQrJ,GAAczB,GAAiBuT,GAClD,OAAOnU,EAAKqC,EAAY0Y,GAAYxa,EAAU,IA0BhD,IAAIkuB,GAAUnN,IAAiB,SAAStwB,EAAQ0P,EAAO6B,GACjD0E,GAAe9G,KAAKnP,EAAQuR,GAC9BvR,EAAOuR,GAAKjS,KAAKoQ,GAEjByQ,GAAgBngB,EAAQuR,EAAK,CAAC7B,OAkClC,SAASrU,GAASgW,EAAY3B,EAAO+B,EAAWkf,GAC9Ctf,EAAasX,GAAYtX,GAAcA,EAAab,GAAOa,GAC3DI,EAAaA,IAAckf,EAASlN,GAAUhS,GAAa,EAE3D,IAAIvW,EAASmW,EAAWnW,OAIxB,OAHIuW,EAAY,IACdA,EAAYoH,GAAU3d,EAASuW,EAAW,IAErCisB,GAASrsB,GACXI,GAAavW,GAAUmW,EAAWkZ,QAAQ7a,EAAO+B,IAAc,IAC7DvW,GAAUgV,GAAYmB,EAAY3B,EAAO+B,IAAc,EA0BhE,IAAIksB,GAAY5S,IAAS,SAAS1Z,EAAYiT,EAAMpV,GAClD,IAAIO,GAAS,EACTmS,EAAwB,mBAAR0C,EAChBtkB,EAAS2oB,GAAYtX,GAAcf,EAAMe,EAAWnW,QAAU,GAKlE,OAHAqlB,GAASlP,GAAY,SAAS3B,GAC5B1P,IAASyP,GAASmS,EAAS7S,GAAMuV,EAAM5U,EAAOR,GAAQ0W,GAAWlW,EAAO4U,EAAMpV,MAEzElP,KA+BL49B,GAAQtN,IAAiB,SAAStwB,EAAQ0P,EAAO6B,GACnD4O,GAAgBngB,EAAQuR,EAAK7B,MA6C/B,SAAStR,GAAIiT,EAAY9B,GACvB,IAAIP,EAAO0L,GAAQrJ,GAAchB,GAAWqY,GAC5C,OAAO1Z,EAAKqC,EAAY0Y,GAAYxa,EAAU,IAgChD,SAASsuB,GAAQxsB,EAAYoL,EAAWqN,EAAQ6G,GAC9C,OAAkB,MAAdtf,EACK,IAEJqJ,GAAQ+B,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAExCqN,EAAS6G,EAAQjuB,EAAYonB,EACxBpP,GAAQoP,KACXA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BD,GAAYxY,EAAYoL,EAAWqN,IAuC5C,IAAIgU,GAAYxN,IAAiB,SAAStwB,EAAQ0P,EAAO6B,GACvDvR,EAAOuR,EAAM,EAAI,GAAGjS,KAAKoQ,MACxB,WAAa,MAAO,CAAC,GAAI,OAuC5B,SAASrP,GAAOgR,EAAY9B,EAAUC,GACpC,IAAIR,EAAO0L,GAAQrJ,GAAcX,GAAcwB,GAC3CvB,EAAYygB,UAAUl2B,OAAS,EAEnC,OAAO8T,EAAKqC,EAAY0Y,GAAYxa,EAAU,GAAIC,EAAamB,EAAW4P,IAyB5E,SAASwd,GAAY1sB,EAAY9B,EAAUC,GACzC,IAAIR,EAAO0L,GAAQrJ,GAAcT,GAAmBsB,GAChDvB,EAAYygB,UAAUl2B,OAAS,EAEnC,OAAO8T,EAAKqC,EAAY0Y,GAAYxa,EAAU,GAAIC,EAAamB,EAAWwS,IAqC5E,SAAS6a,GAAO3sB,EAAYvB,GAC1B,IAAId,EAAO0L,GAAQrJ,GAActB,GAAc4T,GAC/C,OAAO3U,EAAKqC,EAAY4sB,GAAOlU,GAAYja,EAAW,KAiBxD,SAASouB,GAAO7sB,GACd,IAAIrC,EAAO0L,GAAQrJ,GAAcsO,GAAcuL,GAC/C,OAAOlc,EAAKqC,GAuBd,SAAS8sB,GAAW9sB,EAAYlU,EAAGwzB,GAE/BxzB,GADGwzB,EAAQC,GAAevf,EAAYlU,EAAGwzB,GAASxzB,IAAMuF,GACpD,EAEA+gB,GAAUtmB,GAEhB,IAAI6R,EAAO0L,GAAQrJ,GAAcwO,GAAkBsL,GACnD,OAAOnc,EAAKqC,EAAYlU,GAkB1B,SAASihC,GAAQ/sB,GACf,IAAIrC,EAAO0L,GAAQrJ,GAAc2O,GAAewL,GAChD,OAAOxc,EAAKqC,GAwBd,SAAS2C,GAAK3C,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIsX,GAAYtX,GACd,OAAOqsB,GAASrsB,GAAcoD,GAAWpD,GAAcA,EAAWnW,OAEpE,IAAIwmB,EAAMC,GAAOtQ,GACjB,OAAIqQ,GAAOjc,GAAUic,GAAO1b,GACnBqL,EAAW2C,KAEboU,GAAS/W,GAAYnW,OAuC9B,SAASuD,GAAK4S,EAAYvB,EAAW6gB,GACnC,IAAI3hB,EAAO0L,GAAQrJ,GAAcR,GAAY6a,GAI7C,OAHIiF,GAASC,GAAevf,EAAYvB,EAAW6gB,KACjD7gB,EAAYpN,GAEPsM,EAAKqC,EAAY0Y,GAAYja,EAAW,IAgCjD,IAAIuuB,GAAStT,IAAS,SAAS1Z,EAAYoL,GACzC,GAAkB,MAAdpL,EACF,MAAO,GAET,IAAInW,EAASuhB,EAAUvhB,OAMvB,OALIA,EAAS,GAAK01B,GAAevf,EAAYoL,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHvhB,EAAS,GAAK01B,GAAenU,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBoN,GAAYxY,EAAYuS,GAAYnH,EAAW,GAAI,OAqBxD1E,GAAMD,IAAU,WAClB,OAAOzK,GAAKgI,KAAK0C,OA6BnB,SAASumB,GAAMnhC,EAAG6R,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIyG,GAAU3S,GAGtB,OADA3F,EAAIsmB,GAAUtmB,GACP,WACL,KAAMA,EAAI,EACR,OAAO6R,EAAKD,MAAMnW,KAAMw4B,YAsB9B,SAAS8B,GAAIlkB,EAAM7R,EAAGwzB,GAGpB,OAFAxzB,EAAIwzB,EAAQjuB,EAAYvF,EACxBA,EAAK6R,GAAa,MAAL7R,EAAa6R,EAAK9T,OAASiC,EACjCk4B,GAAWrmB,EAAMlL,EAAepB,EAAWA,EAAWA,EAAWA,EAAWvF,GAoBrF,SAASohC,GAAOphC,EAAG6R,GACjB,IAAIhP,EACJ,GAAmB,mBAARgP,EACT,MAAM,IAAIyG,GAAU3S,GAGtB,OADA3F,EAAIsmB,GAAUtmB,GACP,WAOL,QANMA,EAAI,IACR6C,EAASgP,EAAKD,MAAMnW,KAAMw4B,YAExBj0B,GAAK,IACP6R,EAAOtM,GAEF1C,GAuCX,IAAIw+B,GAAOzT,IAAS,SAAS/b,EAAMC,EAASogB,GAC1C,IAAIlO,EAAU5d,EACd,GAAI8rB,EAASn0B,OAAQ,CACnB,IAAIo0B,EAAUlb,GAAeib,EAAU2C,GAAUwM,KACjDrd,GAAWvd,EAEb,OAAOyxB,GAAWrmB,EAAMmS,EAASlS,EAASogB,EAAUC,MAgDlDmP,GAAU1T,IAAS,SAAS/Y,EAAQT,EAAK8d,GAC3C,IAAIlO,EAAU5d,EAAiBC,EAC/B,GAAI6rB,EAASn0B,OAAQ,CACnB,IAAIo0B,EAAUlb,GAAeib,EAAU2C,GAAUyM,KACjDtd,GAAWvd,EAEb,OAAOyxB,GAAW9jB,EAAK4P,EAASnP,EAAQqd,EAAUC,MA4CpD,SAASoP,GAAM1vB,EAAM+iB,EAAOpB,GAC1BoB,EAAQpB,EAAQjuB,EAAYqvB,EAC5B,IAAI/xB,EAASq1B,GAAWrmB,EAAMtL,EAAiBhB,EAAWA,EAAWA,EAAWA,EAAWA,EAAWqvB,GAEtG,OADA/xB,EAAOkT,YAAcwrB,GAAMxrB,YACpBlT,EAyCT,SAAS2+B,GAAW3vB,EAAM+iB,EAAOpB,GAC/BoB,EAAQpB,EAAQjuB,EAAYqvB,EAC5B,IAAI/xB,EAASq1B,GAAWrmB,EAAMrL,EAAuBjB,EAAWA,EAAWA,EAAWA,EAAWA,EAAWqvB,GAE5G,OADA/xB,EAAOkT,YAAcyrB,GAAWzrB,YACzBlT,EAyDT,SAAS4+B,GAAS5vB,EAAM0T,EAAMmc,GAC5B,IAAIC,EACAC,EACAC,EACAh/B,EACAi/B,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT7N,GAAW,EAEf,GAAmB,mBAARxiB,EACT,MAAM,IAAIyG,GAAU3S,GAUtB,SAASw8B,EAAWC,GAClB,IAAIrwB,EAAO4vB,EACP7vB,EAAU8vB,EAKd,OAHAD,EAAWC,EAAWr8B,EACtBy8B,EAAiBI,EACjBv/B,EAASgP,EAAKD,MAAME,EAASC,GACtBlP,EAGT,SAASw/B,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUnjC,GAAW2jC,EAAc/c,GAE5B0c,EAAUE,EAAWC,GAAQv/B,EAGtC,SAAS0/B,EAAcH,GACrB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAC7BU,EAAcnd,EAAOid,EAEzB,OAAON,EACHtmB,GAAU8mB,EAAab,EAAUY,GACjCC,EAGN,SAASC,EAAaP,GACpB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAKjC,OAAQD,IAAiBx8B,GAAci9B,GAAqBjd,GACzDid,EAAoB,GAAON,GAAUO,GAAuBZ,EAGjE,SAASS,IACP,IAAIF,EAAOxnB,KACX,GAAI+nB,EAAaP,GACf,OAAOQ,EAAaR,GAGtBN,EAAUnjC,GAAW2jC,EAAcC,EAAcH,IAGnD,SAASQ,EAAaR,GAKpB,OAJAN,EAAUv8B,EAIN8uB,GAAYsN,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWr8B,EACf1C,GAGT,SAASggC,IACHf,IAAYv8B,GACdzG,GAAagjC,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUv8B,EAGjD,SAASu9B,IACP,OAAOhB,IAAYv8B,EAAY1C,EAAS+/B,EAAahoB,MAGvD,SAASmoB,IACP,IAAIX,EAAOxnB,KACPooB,EAAaL,EAAaP,GAM9B,GAJAT,EAAW1N,UACX2N,EAAWnmC,KACXsmC,EAAeK,EAEXY,EAAY,CACd,GAAIlB,IAAYv8B,EACd,OAAO88B,EAAYN,GAErB,GAAIG,EAIF,OAFApjC,GAAagjC,GACbA,EAAUnjC,GAAW2jC,EAAc/c,GAC5B4c,EAAWJ,GAMtB,OAHID,IAAYv8B,IACdu8B,EAAUnjC,GAAW2jC,EAAc/c,IAE9B1iB,EAIT,OA3GA0iB,EAAO6R,GAAS7R,IAAS,EACrB1H,GAAS6jB,KACXO,IAAYP,EAAQO,QACpBC,EAAS,YAAaR,EACtBG,EAAUK,EAASxmB,GAAU0b,GAASsK,EAAQG,UAAY,EAAGtc,GAAQsc,EACrExN,EAAW,aAAcqN,IAAYA,EAAQrN,SAAWA,GAoG1D0O,EAAUF,OAASA,EACnBE,EAAUD,MAAQA,EACXC,EAqBT,IAAIE,GAAQrV,IAAS,SAAS/b,EAAME,GAClC,OAAOuT,GAAUzT,EAAM,EAAGE,MAsBxBmxB,GAAQtV,IAAS,SAAS/b,EAAM0T,EAAMxT,GACxC,OAAOuT,GAAUzT,EAAMulB,GAAS7R,IAAS,EAAGxT,MAqB9C,SAASoxB,GAAKtxB,GACZ,OAAOqmB,GAAWrmB,EAAMhL,GA+C1B,SAASwzB,GAAQxoB,EAAMuxB,GACrB,GAAmB,mBAARvxB,GAAmC,MAAZuxB,GAAuC,mBAAZA,EAC3D,MAAM,IAAI9qB,GAAU3S,GAEtB,IAAI09B,EAAW,WACb,IAAItxB,EAAOkiB,UACP7f,EAAMgvB,EAAWA,EAASxxB,MAAMnW,KAAMsW,GAAQA,EAAK,GACnDyD,EAAQ6tB,EAAS7tB,MAErB,GAAIA,EAAMC,IAAIrB,GACZ,OAAOoB,EAAM2L,IAAI/M,GAEnB,IAAIvR,EAASgP,EAAKD,MAAMnW,KAAMsW,GAE9B,OADAsxB,EAAS7tB,MAAQA,EAAM2B,IAAI/C,EAAKvR,IAAW2S,EACpC3S,GAGT,OADAwgC,EAAS7tB,MAAQ,IAAK6kB,GAAQiJ,OAASxiB,IAChCuiB,EA0BT,SAASvC,GAAOnuB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAI2F,GAAU3S,GAEtB,OAAO,WACL,IAAIoM,EAAOkiB,UACX,OAAQliB,EAAKhU,QACX,KAAK,EAAG,OAAQ4U,EAAUX,KAAKvW,MAC/B,KAAK,EAAG,OAAQkX,EAAUX,KAAKvW,KAAMsW,EAAK,IAC1C,KAAK,EAAG,OAAQY,EAAUX,KAAKvW,KAAMsW,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQY,EAAUX,KAAKvW,KAAMsW,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQY,EAAUf,MAAMnW,KAAMsW,IAsBlC,SAASwxB,GAAK1xB,GACZ,OAAOuvB,GAAO,EAAGvvB,GAzDnBwoB,GAAQiJ,MAAQxiB,GA2FhB,IAAI0iB,GAAW9S,IAAS,SAAS7e,EAAM2nB,GACrCA,EAAmC,GAArBA,EAAWz7B,QAAewf,GAAQic,EAAW,IACvDtmB,GAASsmB,EAAW,GAAInkB,GAAUuX,OAClC1Z,GAASuT,GAAY+S,EAAY,GAAInkB,GAAUuX,OAEnD,IAAI6W,EAAcjK,EAAWz7B,OAC7B,OAAO6vB,IAAS,SAAS7b,GACvB,IAAIO,GAAS,EACTvU,EAAS6d,GAAU7J,EAAKhU,OAAQ0lC,GAEpC,QAASnxB,EAAQvU,EACfgU,EAAKO,GAASknB,EAAWlnB,GAAON,KAAKvW,KAAMsW,EAAKO,IAElD,OAAOV,GAAMC,EAAMpW,KAAMsW,SAqCzB2xB,GAAU9V,IAAS,SAAS/b,EAAMqgB,GACpC,IAAIC,EAAUlb,GAAeib,EAAU2C,GAAU6O,KACjD,OAAOxL,GAAWrmB,EAAMpL,EAAmBlB,EAAW2sB,EAAUC,MAmC9DwR,GAAe/V,IAAS,SAAS/b,EAAMqgB,GACzC,IAAIC,EAAUlb,GAAeib,EAAU2C,GAAU8O,KACjD,OAAOzL,GAAWrmB,EAAMnL,EAAyBnB,EAAW2sB,EAAUC,MAyBpEyR,GAAQzO,IAAS,SAAStjB,EAAMyb,GAClC,OAAO4K,GAAWrmB,EAAMjL,EAAiBrB,EAAWA,EAAWA,EAAW+nB,MA4B5E,SAASuW,GAAKhyB,EAAMuN,GAClB,GAAmB,mBAARvN,EACT,MAAM,IAAIyG,GAAU3S,GAGtB,OADAyZ,EAAQA,IAAU7Z,EAAY6Z,EAAQkH,GAAUlH,GACzCwO,GAAS/b,EAAMuN,GAqCxB,SAAS0kB,GAAOjyB,EAAMuN,GACpB,GAAmB,mBAARvN,EACT,MAAM,IAAIyG,GAAU3S,GAGtB,OADAyZ,EAAiB,MAATA,EAAgB,EAAI1D,GAAU4K,GAAUlH,GAAQ,GACjDwO,IAAS,SAAS7b,GACvB,IAAIG,EAAQH,EAAKqN,GACbqb,EAAY9J,GAAU5e,EAAM,EAAGqN,GAKnC,OAHIlN,GACFkB,GAAUqnB,EAAWvoB,GAEhBN,GAAMC,EAAMpW,KAAMg/B,MAgD7B,SAASsJ,GAASlyB,EAAM0T,EAAMmc,GAC5B,IAAIO,GAAU,EACV5N,GAAW,EAEf,GAAmB,mBAARxiB,EACT,MAAM,IAAIyG,GAAU3S,GAMtB,OAJIkY,GAAS6jB,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrD5N,EAAW,aAAcqN,IAAYA,EAAQrN,SAAWA,GAEnDoN,GAAS5vB,EAAM0T,EAAM,CAC1B,QAAW0c,EACX,QAAW1c,EACX,SAAY8O,IAmBhB,SAAS2P,GAAMnyB,GACb,OAAOkkB,GAAIlkB,EAAM,GAyBnB,SAASoyB,GAAK1xB,EAAOwhB,GACnB,OAAO2P,GAAQlT,GAAauD,GAAUxhB,GAsCxC,SAAS2xB,KACP,IAAKjQ,UAAUl2B,OACb,MAAO,GAET,IAAIwU,EAAQ0hB,UAAU,GACtB,OAAO1W,GAAQhL,GAASA,EAAQ,CAACA,GA6BnC,SAASsM,GAAMtM,GACb,OAAOwR,GAAUxR,EAAOtM,GAkC1B,SAASk+B,GAAU5xB,EAAO0R,GAExB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EACrDwe,GAAUxR,EAAOtM,EAAoBge,GAqB9C,SAASmgB,GAAU7xB,GACjB,OAAOwR,GAAUxR,EAAOxM,EAAkBE,GA+B5C,SAASo+B,GAAc9xB,EAAO0R,GAE5B,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EACrDwe,GAAUxR,EAAOxM,EAAkBE,EAAoBge,GA2BhE,SAASqgB,GAAWzvB,EAAQxK,GAC1B,OAAiB,MAAVA,GAAkBgb,GAAexQ,EAAQxK,EAAQ8O,GAAK9O,IAmC/D,SAAS0Y,GAAGxQ,EAAOqV,GACjB,OAAOrV,IAAUqV,GAAUrV,IAAUA,GAASqV,IAAUA,EA0B1D,IAAI2c,GAAKpN,GAA0BxP,IAyB/B6c,GAAMrN,IAA0B,SAAS5kB,EAAOqV,GAClD,OAAOrV,GAASqV,KAqBdzF,GAAcyG,GAAgB,WAAa,OAAOqL,UAApB,IAAsCrL,GAAkB,SAASrW,GACjG,OAAO+K,GAAa/K,IAAUuG,GAAe9G,KAAKO,EAAO,YACtD0H,GAAqBjI,KAAKO,EAAO,WA0BlCgL,GAAUpK,EAAMoK,QAmBhBtM,GAAgBD,GAAoBqE,GAAUrE,IAAqB6X,GA2BvE,SAAS2C,GAAYjZ,GACnB,OAAgB,MAATA,GAAiBoY,GAASpY,EAAMxU,UAAYkpB,GAAW1U,GA4BhE,SAAS8Z,GAAkB9Z,GACzB,OAAO+K,GAAa/K,IAAUiZ,GAAYjZ,GAoB5C,SAASkyB,GAAUlyB,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB+K,GAAa/K,IAAUiV,GAAWjV,IAAUvK,EAoBjD,IAAIqT,GAAWD,IAAkB+e,GAmB7BhpB,GAASD,GAAamE,GAAUnE,IAAc4X,GAmBlD,SAAS4b,GAAUnyB,GACjB,OAAO+K,GAAa/K,IAA6B,IAAnBA,EAAMjC,WAAmBic,GAAcha,GAoCvE,SAASoyB,GAAQpyB,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIiZ,GAAYjZ,KACXgL,GAAQhL,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM2H,QAC1DmB,GAAS9I,IAAUZ,GAAaY,IAAU4P,GAAY5P,IAC1D,OAAQA,EAAMxU,OAEhB,IAAIwmB,EAAMC,GAAOjS,GACjB,GAAIgS,GAAOjc,GAAUic,GAAO1b,GAC1B,OAAQ0J,EAAMsE,KAEhB,GAAIqU,GAAY3Y,GACd,OAAQ0Y,GAAS1Y,GAAOxU,OAE1B,IAAK,IAAIqW,KAAO7B,EACd,GAAIuG,GAAe9G,KAAKO,EAAO6B,GAC7B,OAAO,EAGX,OAAO,EA+BT,SAASwwB,GAAQryB,EAAOqV,GACtB,OAAOmB,GAAYxW,EAAOqV,GAmC5B,SAASid,GAAYtyB,EAAOqV,EAAO3D,GACjCA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EAC5D,IAAI1C,EAASohB,EAAaA,EAAW1R,EAAOqV,GAASriB,EACrD,OAAO1C,IAAW0C,EAAYwjB,GAAYxW,EAAOqV,EAAOriB,EAAW0e,KAAgBphB,EAqBrF,SAASiiC,GAAQvyB,GACf,IAAK+K,GAAa/K,GAChB,OAAO,EAET,IAAIgS,EAAMiD,GAAWjV,GACrB,OAAOgS,GAAOpc,GAAYoc,GAAOrc,GACN,iBAAjBqK,EAAMomB,SAA4C,iBAAdpmB,EAAMnW,OAAqBmwB,GAAcha,GA6BzF,SAASgJ,GAAShJ,GAChB,MAAuB,iBAATA,GAAqB+I,GAAe/I,GAoBpD,SAAS0U,GAAW1U,GAClB,IAAKsL,GAAStL,GACZ,OAAO,EAIT,IAAIgS,EAAMiD,GAAWjV,GACrB,OAAOgS,GAAOnc,GAAWmc,GAAOlc,GAAUkc,GAAOxc,GAAYwc,GAAO5b,GA6BtE,SAASo8B,GAAUxyB,GACjB,MAAuB,iBAATA,GAAqBA,GAAS+T,GAAU/T,GA6BxD,SAASoY,GAASpY,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASjL,EA4B7C,SAASuW,GAAStL,GAChB,IAAItU,SAAcsU,EAClB,OAAgB,MAATA,IAA0B,UAARtU,GAA4B,YAARA,GA2B/C,SAASqf,GAAa/K,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAIlB,GAAQD,GAAYiE,GAAUjE,IAAa4Y,GA8B/C,SAASgb,GAAQnwB,EAAQxK,GACvB,OAAOwK,IAAWxK,GAAU4f,GAAYpV,EAAQxK,EAAQohB,GAAaphB,IAmCvE,SAAS46B,GAAYpwB,EAAQxK,EAAQ4Z,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EACrD0kB,GAAYpV,EAAQxK,EAAQohB,GAAaphB,GAAS4Z,GA+B3D,SAASihB,GAAM3yB,GAIb,OAAO4yB,GAAS5yB,IAAUA,IAAUA,EA6BtC,SAAS6yB,GAAS7yB,GAChB,GAAI2nB,GAAW3nB,GACb,MAAM,IAAI4F,EAAMzS,GAElB,OAAO2kB,GAAa9X,GAoBtB,SAAS8yB,GAAO9yB,GACd,OAAiB,OAAVA,EAuBT,SAAS+yB,GAAM/yB,GACb,OAAgB,MAATA,EA6BT,SAAS4yB,GAAS5yB,GAChB,MAAuB,iBAATA,GACX+K,GAAa/K,IAAUiV,GAAWjV,IAAUhK,EA+BjD,SAASgkB,GAAcha,GACrB,IAAK+K,GAAa/K,IAAUiV,GAAWjV,IAAU9J,GAC/C,OAAO,EAET,IAAImV,EAAQ/D,GAAatH,GACzB,GAAc,OAAVqL,EACF,OAAO,EAET,IAAIiW,EAAO/a,GAAe9G,KAAK4L,EAAO,gBAAkBA,EAAMiI,YAC9D,MAAsB,mBAARgO,GAAsBA,aAAgBA,GAClDjb,GAAa5G,KAAK6hB,IAASva,GAoB/B,IAAI/H,GAAWD,GAAe+D,GAAU/D,IAAgBkZ,GA6BxD,SAAS+a,GAAchzB,GACrB,OAAOwyB,GAAUxyB,IAAUA,IAAUjL,GAAoBiL,GAASjL,EAoBpE,IAAImK,GAAQD,GAAY6D,GAAU7D,IAAaiZ,GAmB/C,SAAS8V,GAAShuB,GAChB,MAAuB,iBAATA,IACVgL,GAAQhL,IAAU+K,GAAa/K,IAAUiV,GAAWjV,IAAUzJ,GAoBpE,SAASsd,GAAS7T,GAChB,MAAuB,iBAATA,GACX+K,GAAa/K,IAAUiV,GAAWjV,IAAUxJ,GAoBjD,IAAI4I,GAAeD,GAAmB2D,GAAU3D,IAAoBgZ,GAmBpE,SAAS8a,GAAYjzB,GACnB,OAAOA,IAAUhN,EAoBnB,SAASkgC,GAAUlzB,GACjB,OAAO+K,GAAa/K,IAAUiS,GAAOjS,IAAUtJ,GAoBjD,SAASy8B,GAAUnzB,GACjB,OAAO+K,GAAa/K,IAAUiV,GAAWjV,IAAUrJ,GA0BrD,IAAIy8B,GAAKxO,GAA0B7L,IAyB/Bsa,GAAMzO,IAA0B,SAAS5kB,EAAOqV,GAClD,OAAOrV,GAASqV,KA0BlB,SAAS6X,GAAQltB,GACf,IAAKA,EACH,MAAO,GAET,GAAIiZ,GAAYjZ,GACd,OAAOguB,GAAShuB,GAASiF,GAAcjF,GAASoM,GAAUpM,GAE5D,GAAI8H,IAAe9H,EAAM8H,IACvB,OAAO7D,GAAgBjE,EAAM8H,OAE/B,IAAIkK,EAAMC,GAAOjS,GACbV,EAAO0S,GAAOjc,EAASsO,GAAc2N,GAAO1b,GAASqO,GAAa7D,GAEtE,OAAOxB,EAAKU,GA0Bd,SAAS2kB,GAAS3kB,GAChB,IAAKA,EACH,OAAiB,IAAVA,EAAcA,EAAQ,EAG/B,GADAA,EAAQ6kB,GAAS7kB,GACbA,IAAUlL,GAAYkL,KAAWlL,EAAU,CAC7C,IAAIw+B,EAAQtzB,EAAQ,GAAK,EAAI,EAC7B,OAAOszB,EAAOt+B,EAEhB,OAAOgL,IAAUA,EAAQA,EAAQ,EA6BnC,SAAS+T,GAAU/T,GACjB,IAAI1P,EAASq0B,GAAS3kB,GAClBuzB,EAAYjjC,EAAS,EAEzB,OAAOA,IAAWA,EAAUijC,EAAYjjC,EAASijC,EAAYjjC,EAAU,EA8BzE,SAAS0jB,GAAShU,GAChB,OAAOA,EAAQqQ,GAAU0D,GAAU/T,GAAQ,EAAG9K,GAAoB,EA0BpE,SAAS2vB,GAAS7kB,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI6T,GAAS7T,GACX,OAAO/K,EAET,GAAIqW,GAAStL,GAAQ,CACnB,IAAIqV,EAAgC,mBAAjBrV,EAAM4K,QAAwB5K,EAAM4K,UAAY5K,EACnEA,EAAQsL,GAAS+J,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATrV,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAMlP,QAAQ0H,GAAQ,IAC9B,IAAIg7B,EAAWr6B,GAAW4K,KAAK/D,GAC/B,OAAQwzB,GAAYn6B,GAAU0K,KAAK/D,GAC/B5C,GAAa4C,EAAMse,MAAM,GAAIkV,EAAW,EAAI,GAC3Ct6B,GAAW6K,KAAK/D,GAAS/K,GAAO+K,EA2BvC,SAASia,GAAcja,GACrB,OAAO+Q,GAAW/Q,EAAOiR,GAAOjR,IA2BlC,SAASyzB,GAAczzB,GACrB,OAAOA,EACHqQ,GAAU0D,GAAU/T,IAASjL,EAAkBA,GACpC,IAAViL,EAAcA,EAAQ,EAwB7B,SAASsG,GAAStG,GAChB,OAAgB,MAATA,EAAgB,GAAKkd,GAAald,GAqC3C,IAAI0zB,GAAS5S,IAAe,SAASxe,EAAQxK,GAC3C,GAAI6gB,GAAY7gB,IAAWmhB,GAAYnhB,GACrCiZ,GAAWjZ,EAAQ8O,GAAK9O,GAASwK,QAGnC,IAAK,IAAIT,KAAO/J,EACVyO,GAAe9G,KAAK3H,EAAQ+J,IAC9B6O,GAAYpO,EAAQT,EAAK/J,EAAO+J,OAoClC8xB,GAAW7S,IAAe,SAASxe,EAAQxK,GAC7CiZ,GAAWjZ,EAAQmZ,GAAOnZ,GAASwK,MAgCjCsxB,GAAe9S,IAAe,SAASxe,EAAQxK,EAAQ0hB,EAAU9H,GACnEX,GAAWjZ,EAAQmZ,GAAOnZ,GAASwK,EAAQoP,MA+BzCmiB,GAAa/S,IAAe,SAASxe,EAAQxK,EAAQ0hB,EAAU9H,GACjEX,GAAWjZ,EAAQ8O,GAAK9O,GAASwK,EAAQoP,MAoBvCoiB,GAAKlR,GAAS1R,IAoClB,SAASzJ,GAAOxB,EAAW8tB,GACzB,IAAIzjC,EAAS8a,GAAWnF,GACxB,OAAqB,MAAd8tB,EAAqBzjC,EAASwgB,GAAWxgB,EAAQyjC,GAwB1D,IAAItuB,GAAW4V,IAAS,SAAS/Y,EAAQ0e,GACvC1e,EAAS9E,GAAO8E,GAEhB,IAAIvC,GAAS,EACTvU,EAASw1B,EAAQx1B,OACjBy1B,EAAQz1B,EAAS,EAAIw1B,EAAQ,GAAKhuB,EAElCiuB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDz1B,EAAS,GAGX,QAASuU,EAAQvU,EAAQ,CACvB,IAAIsM,EAASkpB,EAAQjhB,GACjBzV,EAAQ2mB,GAAOnZ,GACfk8B,GAAc,EACdC,EAAc3pC,EAAMkB,OAExB,QAASwoC,EAAaC,EAAa,CACjC,IAAIpyB,EAAMvX,EAAM0pC,GACZh0B,EAAQsC,EAAOT,IAEf7B,IAAUhN,GACTwd,GAAGxQ,EAAOmG,GAAYtE,MAAU0E,GAAe9G,KAAK6C,EAAQT,MAC/DS,EAAOT,GAAO/J,EAAO+J,KAK3B,OAAOS,KAsBL4xB,GAAe7Y,IAAS,SAAS7b,GAEnC,OADAA,EAAK5P,KAAKoD,EAAW8yB,IACdzmB,GAAM80B,GAAWnhC,EAAWwM,MAsCrC,SAAS40B,GAAQ9xB,EAAQlC,GACvB,OAAOsB,GAAYY,EAAQ+X,GAAYja,EAAW,GAAIoT,IAsCxD,SAAS6gB,GAAY/xB,EAAQlC,GAC3B,OAAOsB,GAAYY,EAAQ+X,GAAYja,EAAW,GAAIsT,IA+BxD,SAAS4gB,GAAMhyB,EAAQzC,GACrB,OAAiB,MAAVyC,EACHA,EACAgS,GAAQhS,EAAQ+X,GAAYxa,EAAU,GAAIoR,IA6BhD,SAASsjB,GAAWjyB,EAAQzC,GAC1B,OAAiB,MAAVyC,EACHA,EACAkS,GAAalS,EAAQ+X,GAAYxa,EAAU,GAAIoR,IA+BrD,SAASujB,GAAOlyB,EAAQzC,GACtB,OAAOyC,GAAUkR,GAAWlR,EAAQ+X,GAAYxa,EAAU,IA6B5D,SAAS40B,GAAYnyB,EAAQzC,GAC3B,OAAOyC,GAAUoR,GAAgBpR,EAAQ+X,GAAYxa,EAAU,IA0BjE,SAAS60B,GAAUpyB,GACjB,OAAiB,MAAVA,EAAiB,GAAKmS,GAAcnS,EAAQsE,GAAKtE,IA0B1D,SAASqyB,GAAYryB,GACnB,OAAiB,MAAVA,EAAiB,GAAKmS,GAAcnS,EAAQ2O,GAAO3O,IA4B5D,SAASsM,GAAItM,EAAQsS,EAAMuP,GACzB,IAAI7zB,EAAmB,MAAVgS,EAAiBtP,EAAY2hB,GAAQrS,EAAQsS,GAC1D,OAAOtkB,IAAW0C,EAAYmxB,EAAe7zB,EA8B/C,SAAS4S,GAAIZ,EAAQsS,GACnB,OAAiB,MAAVtS,GAAkB6kB,GAAQ7kB,EAAQsS,EAAMU,IA6BjD,SAASgE,GAAMhX,EAAQsS,GACrB,OAAiB,MAAVtS,GAAkB6kB,GAAQ7kB,EAAQsS,EAAMW,IAqBjD,IAAIqf,GAAS7Q,IAAe,SAASzzB,EAAQ0P,EAAO6B,GACrC,MAAT7B,GACyB,mBAAlBA,EAAMsG,WACftG,EAAQ8G,GAAqBrH,KAAKO,IAGpC1P,EAAO0P,GAAS6B,IACfga,GAASvD,KA4BRuc,GAAW9Q,IAAe,SAASzzB,EAAQ0P,EAAO6B,GACvC,MAAT7B,GACyB,mBAAlBA,EAAMsG,WACftG,EAAQ8G,GAAqBrH,KAAKO,IAGhCuG,GAAe9G,KAAKnP,EAAQ0P,GAC9B1P,EAAO0P,GAAOpQ,KAAKiS,GAEnBvR,EAAO0P,GAAS,CAAC6B,KAElBwY,IAoBCya,GAASzZ,GAASnF,IA8BtB,SAAStP,GAAKtE,GACZ,OAAO2W,GAAY3W,GAAUmN,GAAcnN,GAAUoW,GAASpW,GA0BhE,SAAS2O,GAAO3O,GACd,OAAO2W,GAAY3W,GAAUmN,GAAcnN,GAAQ,GAAQsW,GAAWtW,GAwBxE,SAASyyB,GAAQzyB,EAAQzC,GACvB,IAAIvP,EAAS,GAMb,OALAuP,EAAWwa,GAAYxa,EAAU,GAEjC2T,GAAWlR,GAAQ,SAAStC,EAAO6B,EAAKS,GACtCmO,GAAgBngB,EAAQuP,EAASG,EAAO6B,EAAKS,GAAStC,MAEjD1P,EA+BT,SAAS0kC,GAAU1yB,EAAQzC,GACzB,IAAIvP,EAAS,GAMb,OALAuP,EAAWwa,GAAYxa,EAAU,GAEjC2T,GAAWlR,GAAQ,SAAStC,EAAO6B,EAAKS,GACtCmO,GAAgBngB,EAAQuR,EAAKhC,EAASG,EAAO6B,EAAKS,OAE7ChS,EAkCT,IAAI2kC,GAAQnU,IAAe,SAASxe,EAAQxK,EAAQ0hB,GAClDD,GAAUjX,EAAQxK,EAAQ0hB,MAkCxB2a,GAAYrT,IAAe,SAASxe,EAAQxK,EAAQ0hB,EAAU9H,GAChE6H,GAAUjX,EAAQxK,EAAQ0hB,EAAU9H,MAuBlCwjB,GAAOtS,IAAS,SAAStgB,EAAQ6O,GACnC,IAAI7gB,EAAS,GACb,GAAc,MAAVgS,EACF,OAAOhS,EAET,IAAIshB,GAAS,EACbT,EAAQxQ,GAASwQ,GAAO,SAASyD,GAG/B,OAFAA,EAAOC,GAASD,EAAMtS,GACtBsP,IAAWA,EAASgD,EAAKppB,OAAS,GAC3BopB,KAET7D,GAAWzO,EAAQqQ,GAAarQ,GAAShS,GACrCshB,IACFthB,EAASkhB,GAAUlhB,EAAQkD,EAAkBC,EAAkBC,EAAoBqyB,KAErF,IAAIv6B,EAAS2lB,EAAM3lB,OACnB,MAAOA,IACLyvB,GAAU3qB,EAAQ6gB,EAAM3lB,IAE1B,OAAO8E,KAuBT,SAAS6kC,GAAO7yB,EAAQlC,GACtB,OAAOg1B,GAAO9yB,EAAQisB,GAAOlU,GAAYja,KAoB3C,IAAIsF,GAAOkd,IAAS,SAAStgB,EAAQ6O,GACnC,OAAiB,MAAV7O,EAAiB,GAAKkY,GAASlY,EAAQ6O,MAqBhD,SAASikB,GAAO9yB,EAAQlC,GACtB,GAAc,MAAVkC,EACF,MAAO,GAET,IAAIhY,EAAQqW,GAASgS,GAAarQ,IAAS,SAAS+yB,GAClD,MAAO,CAACA,MAGV,OADAj1B,EAAYia,GAAYja,GACjBqa,GAAWnY,EAAQhY,GAAO,SAAS0V,EAAO4U,GAC/C,OAAOxU,EAAUJ,EAAO4U,EAAK,OAiCjC,SAAStkB,GAAOgS,EAAQsS,EAAMuP,GAC5BvP,EAAOC,GAASD,EAAMtS,GAEtB,IAAIvC,GAAS,EACTvU,EAASopB,EAAKppB,OAGbA,IACHA,EAAS,EACT8W,EAAStP,GAEX,QAAS+M,EAAQvU,EAAQ,CACvB,IAAIwU,EAAkB,MAAVsC,EAAiBtP,EAAYsP,EAAOwS,GAAMF,EAAK7U,KACvDC,IAAUhN,IACZ+M,EAAQvU,EACRwU,EAAQmkB,GAEV7hB,EAASoS,GAAW1U,GAASA,EAAMP,KAAK6C,GAAUtC,EAEpD,OAAOsC,EA+BT,SAASsC,GAAItC,EAAQsS,EAAM5U,GACzB,OAAiB,MAAVsC,EAAiBA,EAASoY,GAAQpY,EAAQsS,EAAM5U,GA2BzD,SAASs1B,GAAQhzB,EAAQsS,EAAM5U,EAAO0R,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EAC3C,MAAVsP,EAAiBA,EAASoY,GAAQpY,EAAQsS,EAAM5U,EAAO0R,GA2BhE,IAAI6jB,GAAU7P,GAAc9e,IA0BxB4uB,GAAY9P,GAAczU,IAgC9B,SAASzM,GAAUlC,EAAQzC,EAAUC,GACnC,IAAI2M,EAAQzB,GAAQ1I,GAChBmzB,EAAYhpB,GAAS3D,GAASxG,IAAWlD,GAAakD,GAG1D,GADAzC,EAAWwa,GAAYxa,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIwhB,EAAOhf,GAAUA,EAAOgR,YAE1BxT,EADE21B,EACYhpB,EAAQ,IAAI6U,EAAO,GAE1BhW,GAAShJ,IACFoS,GAAW4M,GAAQlW,GAAW9D,GAAahF,IAG3C,GAMlB,OAHCmzB,EAAYx1B,GAAYuT,IAAYlR,GAAQ,SAAStC,EAAOD,EAAOuC,GAClE,OAAOzC,EAASC,EAAaE,EAAOD,EAAOuC,MAEtCxC,EA8BT,SAAS41B,GAAMpzB,EAAQsS,GACrB,OAAiB,MAAVtS,GAAwB2Y,GAAU3Y,EAAQsS,GA8BnD,SAAS7mB,GAAOuU,EAAQsS,EAAM2I,GAC5B,OAAiB,MAAVjb,EAAiBA,EAASgb,GAAWhb,EAAQsS,EAAMqJ,GAAaV,IA2BzE,SAASoY,GAAWrzB,EAAQsS,EAAM2I,EAAS7L,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1e,EAC3C,MAAVsP,EAAiBA,EAASgb,GAAWhb,EAAQsS,EAAMqJ,GAAaV,GAAU7L,GA6BnF,SAAS5Q,GAAOwB,GACd,OAAiB,MAAVA,EAAiB,GAAKS,GAAWT,EAAQsE,GAAKtE,IA2BvD,SAASszB,GAAStzB,GAChB,OAAiB,MAAVA,EAAiB,GAAKS,GAAWT,EAAQ2O,GAAO3O,IAwBzD,SAASuzB,GAAMxkB,EAAQC,EAAOC,GAa5B,OAZIA,IAAUve,IACZue,EAAQD,EACRA,EAAQte,GAENue,IAAUve,IACZue,EAAQsT,GAAStT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAEhCD,IAAUte,IACZse,EAAQuT,GAASvT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAE7BjB,GAAUwU,GAASxT,GAASC,EAAOC,GAyC5C,SAASukB,GAAQzkB,EAAQxE,EAAOC,GAS9B,OARAD,EAAQ8X,GAAS9X,GACbC,IAAQ9Z,GACV8Z,EAAMD,EACNA,EAAQ,GAERC,EAAM6X,GAAS7X,GAEjBuE,EAASwT,GAASxT,GACXmE,GAAYnE,EAAQxE,EAAOC,GAkCpC,SAASpD,GAAO4H,EAAOC,EAAOwkB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyB7U,GAAe5P,EAAOC,EAAOwkB,KAC3ExkB,EAAQwkB,EAAW/iC,GAEjB+iC,IAAa/iC,IACK,kBAATue,GACTwkB,EAAWxkB,EACXA,EAAQve,GAEe,kBAATse,IACdykB,EAAWzkB,EACXA,EAAQte,IAGRse,IAAUte,GAAaue,IAAUve,GACnCse,EAAQ,EACRC,EAAQ,IAGRD,EAAQqT,GAASrT,GACbC,IAAUve,GACZue,EAAQD,EACRA,EAAQ,GAERC,EAAQoT,GAASpT,IAGjBD,EAAQC,EAAO,CACjB,IAAIykB,EAAO1kB,EACXA,EAAQC,EACRA,EAAQykB,EAEV,GAAID,GAAYzkB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIoX,EAAOlf,KACX,OAAOJ,GAAUiI,EAASqX,GAAQpX,EAAQD,EAAQpU,GAAe,QAAUyrB,EAAO,IAAIn9B,OAAS,KAAO+lB,GAExG,OAAOrB,GAAWoB,EAAOC,GAyB3B,IAAI0kB,GAAYlU,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GAEtD,OADAm2B,EAAOA,EAAKC,cACL7lC,GAAUyP,EAAQq2B,GAAWF,GAAQA,MAkB9C,SAASE,GAAW70B,GAClB,OAAO80B,GAAW/vB,GAAS/E,GAAQ40B,eAqBrC,SAASjU,GAAO3gB,GAEd,OADAA,EAAS+E,GAAS/E,GACXA,GAAUA,EAAOzQ,QAAQyI,GAASkK,IAAc3S,QAAQuL,GAAa,IA0B9E,SAASi6B,GAAS/0B,EAAQg1B,EAAQC,GAChCj1B,EAAS+E,GAAS/E,GAClBg1B,EAASrZ,GAAaqZ,GAEtB,IAAI/qC,EAAS+V,EAAO/V,OACpBgrC,EAAWA,IAAaxjC,EACpBxH,EACA6kB,GAAU0D,GAAUyiB,GAAW,EAAGhrC,GAEtC,IAAIshB,EAAM0pB,EAEV,OADAA,GAAYD,EAAO/qC,OACZgrC,GAAY,GAAKj1B,EAAO+c,MAAMkY,EAAU1pB,IAAQypB,EA+BzD,SAASE,GAAOl1B,GAEd,OADAA,EAAS+E,GAAS/E,GACVA,GAAUxJ,GAAmBgM,KAAKxC,GACtCA,EAAOzQ,QAAQ6G,GAAiB+L,IAChCnC,EAkBN,SAASm1B,GAAan1B,GAEpB,OADAA,EAAS+E,GAAS/E,GACVA,GAAUhJ,GAAgBwL,KAAKxC,GACnCA,EAAOzQ,QAAQwH,GAAc,QAC7BiJ,EAwBN,IAAIo1B,GAAY5U,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GACtD,OAAOzP,GAAUyP,EAAQ,IAAM,IAAMm2B,EAAKC,iBAuBxCS,GAAY7U,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GACtD,OAAOzP,GAAUyP,EAAQ,IAAM,IAAMm2B,EAAKC,iBAoBxCU,GAAalV,GAAgB,eAyBjC,SAASmV,GAAIv1B,EAAQ/V,EAAQ+4B,GAC3BhjB,EAAS+E,GAAS/E,GAClB/V,EAASuoB,GAAUvoB,GAEnB,IAAIurC,EAAYvrC,EAASuZ,GAAWxD,GAAU,EAC9C,IAAK/V,GAAUurC,GAAavrC,EAC1B,OAAO+V,EAET,IAAI8a,GAAO7wB,EAASurC,GAAa,EACjC,OACEzS,GAAc7b,GAAY4T,GAAMkI,GAChChjB,EACA+iB,GAAc/b,GAAW8T,GAAMkI,GA2BnC,SAASyS,GAAOz1B,EAAQ/V,EAAQ+4B,GAC9BhjB,EAAS+E,GAAS/E,GAClB/V,EAASuoB,GAAUvoB,GAEnB,IAAIurC,EAAYvrC,EAASuZ,GAAWxD,GAAU,EAC9C,OAAQ/V,GAAUurC,EAAYvrC,EACzB+V,EAAS+iB,GAAc94B,EAASurC,EAAWxS,GAC5ChjB,EA0BN,SAAS01B,GAAS11B,EAAQ/V,EAAQ+4B,GAChChjB,EAAS+E,GAAS/E,GAClB/V,EAASuoB,GAAUvoB,GAEnB,IAAIurC,EAAYvrC,EAASuZ,GAAWxD,GAAU,EAC9C,OAAQ/V,GAAUurC,EAAYvrC,EACzB84B,GAAc94B,EAASurC,EAAWxS,GAAShjB,EAC5CA,EA2BN,SAASlE,GAASkE,EAAQ21B,EAAOjW,GAM/B,OALIA,GAAkB,MAATiW,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ1tB,GAAelD,GAAS/E,GAAQzQ,QAAQ2H,GAAa,IAAKy+B,GAAS,GAyB5E,SAASC,GAAO51B,EAAQ9T,EAAGwzB,GAMzB,OAJExzB,GADGwzB,EAAQC,GAAe3f,EAAQ9T,EAAGwzB,GAASxzB,IAAMuF,GAChD,EAEA+gB,GAAUtmB,GAET2tB,GAAW9U,GAAS/E,GAAS9T,GAsBtC,SAASqD,KACP,IAAI0O,EAAOkiB,UACPngB,EAAS+E,GAAS9G,EAAK,IAE3B,OAAOA,EAAKhU,OAAS,EAAI+V,EAASA,EAAOzQ,QAAQ0O,EAAK,GAAIA,EAAK,IAwBjE,IAAI43B,GAAYrV,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GACtD,OAAOzP,GAAUyP,EAAQ,IAAM,IAAMm2B,EAAKC,iBAsB5C,SAAS30B,GAAMD,EAAQ8oB,EAAWgN,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBnW,GAAe3f,EAAQ8oB,EAAWgN,KACzEhN,EAAYgN,EAAQrkC,GAEtBqkC,EAAQA,IAAUrkC,EAAYkC,EAAmBmiC,IAAU,EACtDA,GAGL91B,EAAS+E,GAAS/E,GACdA,IACsB,iBAAb8oB,GACO,MAAbA,IAAsBrrB,GAASqrB,MAEpCA,EAAYnN,GAAamN,IACpBA,GAAavmB,GAAWvC,IACpB6c,GAAUnZ,GAAc1D,GAAS,EAAG81B,GAGxC91B,EAAOC,MAAM6oB,EAAWgN,IAZtB,GAoCX,IAAIC,GAAYvV,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GACtD,OAAOzP,GAAUyP,EAAQ,IAAM,IAAMs2B,GAAWH,MA0BlD,SAASqB,GAAWh2B,EAAQg1B,EAAQC,GAOlC,OANAj1B,EAAS+E,GAAS/E,GAClBi1B,EAAuB,MAAZA,EACP,EACAnmB,GAAU0D,GAAUyiB,GAAW,EAAGj1B,EAAO/V,QAE7C+qC,EAASrZ,GAAaqZ,GACfh1B,EAAO+c,MAAMkY,EAAUA,EAAWD,EAAO/qC,SAAW+qC,EA2G7D,SAASiB,GAASj2B,EAAQ4tB,EAASlO,GAIjC,IAAIwW,EAAW3sB,GAAOuI,iBAElB4N,GAASC,GAAe3f,EAAQ4tB,EAASlO,KAC3CkO,EAAUn8B,GAEZuO,EAAS+E,GAAS/E,GAClB4tB,EAAUyE,GAAa,GAAIzE,EAASsI,EAAU5R,IAE9C,IAII6R,EACAC,EALAC,EAAUhE,GAAa,GAAIzE,EAAQyI,QAASH,EAASG,QAAS/R,IAC9DgS,EAAcjxB,GAAKgxB,GACnBE,EAAgB/0B,GAAW60B,EAASC,GAIpC93B,EAAQ,EACRg4B,EAAc5I,EAAQ4I,aAAev+B,GACrC1B,EAAS,WAGTkgC,EAAengC,IAChBs3B,EAAQsH,QAAUj9B,IAAW1B,OAAS,IACvCigC,EAAYjgC,OAAS,KACpBigC,IAAgB7/B,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEq3B,EAAQ8I,UAAYz+B,IAAW1B,OAAS,KACzC,KAMEogC,EAAY,kBACb3xB,GAAe9G,KAAK0vB,EAAS,cACzBA,EAAQ+I,UAAY,IAAIpnC,QAAQ,UAAW,KAC3C,6BAA+B6L,GAAmB,KACnD,KAEN4E,EAAOzQ,QAAQknC,GAAc,SAAShuC,EAAOmuC,EAAaC,EAAkBC,EAAiBC,EAAev3B,GAsB1G,OArBAq3B,IAAqBA,EAAmBC,GAGxCvgC,GAAUyJ,EAAO+c,MAAMve,EAAOgB,GAAQjQ,QAAQ2I,GAAmBkK,IAG7Dw0B,IACFT,GAAa,EACb5/B,GAAU,YAAcqgC,EAAc,UAEpCG,IACFX,GAAe,EACf7/B,GAAU,OAASwgC,EAAgB,eAEjCF,IACFtgC,GAAU,iBAAmBsgC,EAAmB,+BAElDr4B,EAAQgB,EAAS/W,EAAMwB,OAIhBxB,KAGT8N,GAAU,OAMV,IAAIygC,EAAWhyB,GAAe9G,KAAK0vB,EAAS,aAAeA,EAAQoJ,SAC9DA,IACHzgC,EAAS,iBAAmBA,EAAS,SAGvCA,GAAU6/B,EAAe7/B,EAAOhH,QAAQyG,GAAsB,IAAMO,GACjEhH,QAAQ0G,GAAqB,MAC7B1G,QAAQ2G,GAAuB,OAGlCK,EAAS,aAAeygC,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ7/B,EACA,gBAEF,IAAIxH,EAASkoC,IAAQ,WACnB,OAAO56B,GAASi6B,EAAaK,EAAY,UAAYpgC,GAClDuH,MAAMrM,EAAW8kC,MAMtB,GADAxnC,EAAOwH,OAASA,EACZy6B,GAAQjiC,GACV,MAAMA,EAER,OAAOA,EAwBT,SAASmoC,GAAQz4B,GACf,OAAOsG,GAAStG,GAAOm2B,cAwBzB,SAASuC,GAAQ14B,GACf,OAAOsG,GAAStG,GAAO24B,cAyBzB,SAASC,GAAKr3B,EAAQgjB,EAAOtD,GAE3B,GADA1f,EAAS+E,GAAS/E,GACdA,IAAW0f,GAASsD,IAAUvxB,GAChC,OAAOuO,EAAOzQ,QAAQ0H,GAAQ,IAEhC,IAAK+I,KAAYgjB,EAAQrH,GAAaqH,IACpC,OAAOhjB,EAET,IAAI6B,EAAa6B,GAAc1D,GAC3B8B,EAAa4B,GAAcsf,GAC3B1X,EAAQ1J,GAAgBC,EAAYC,GACpCyJ,EAAMxJ,GAAcF,EAAYC,GAAc,EAElD,OAAO+a,GAAUhb,EAAYyJ,EAAOC,GAAKhR,KAAK,IAsBhD,SAAS+8B,GAAQt3B,EAAQgjB,EAAOtD,GAE9B,GADA1f,EAAS+E,GAAS/E,GACdA,IAAW0f,GAASsD,IAAUvxB,GAChC,OAAOuO,EAAOzQ,QAAQ4H,GAAW,IAEnC,IAAK6I,KAAYgjB,EAAQrH,GAAaqH,IACpC,OAAOhjB,EAET,IAAI6B,EAAa6B,GAAc1D,GAC3BuL,EAAMxJ,GAAcF,EAAY6B,GAAcsf,IAAU,EAE5D,OAAOnG,GAAUhb,EAAY,EAAG0J,GAAKhR,KAAK,IAsB5C,SAASg9B,GAAUv3B,EAAQgjB,EAAOtD,GAEhC,GADA1f,EAAS+E,GAAS/E,GACdA,IAAW0f,GAASsD,IAAUvxB,GAChC,OAAOuO,EAAOzQ,QAAQ2H,GAAa,IAErC,IAAK8I,KAAYgjB,EAAQrH,GAAaqH,IACpC,OAAOhjB,EAET,IAAI6B,EAAa6B,GAAc1D,GAC3BsL,EAAQ1J,GAAgBC,EAAY6B,GAAcsf,IAEtD,OAAOnG,GAAUhb,EAAYyJ,GAAO/Q,KAAK,IAwC3C,SAASi9B,GAASx3B,EAAQ4tB,GACxB,IAAI3jC,EAAS+I,EACTykC,EAAWxkC,EAEf,GAAI8W,GAAS6jB,GAAU,CACrB,IAAI9E,EAAY,cAAe8E,EAAUA,EAAQ9E,UAAYA,EAC7D7+B,EAAS,WAAY2jC,EAAUpb,GAAUob,EAAQ3jC,QAAUA,EAC3DwtC,EAAW,aAAc7J,EAAUjS,GAAaiS,EAAQ6J,UAAYA,EAEtEz3B,EAAS+E,GAAS/E,GAElB,IAAIw1B,EAAYx1B,EAAO/V,OACvB,GAAIsY,GAAWvC,GAAS,CACtB,IAAI6B,EAAa6B,GAAc1D,GAC/Bw1B,EAAY3zB,EAAW5X,OAEzB,GAAIA,GAAUurC,EACZ,OAAOx1B,EAET,IAAIuL,EAAMthB,EAASuZ,GAAWi0B,GAC9B,GAAIlsB,EAAM,EACR,OAAOksB,EAET,IAAI1oC,EAAS8S,EACTgb,GAAUhb,EAAY,EAAG0J,GAAKhR,KAAK,IACnCyF,EAAO+c,MAAM,EAAGxR,GAEpB,GAAIud,IAAcr3B,EAChB,OAAO1C,EAAS0oC,EAKlB,GAHI51B,IACF0J,GAAQxc,EAAO9E,OAASshB,GAEtB9N,GAASqrB,IACX,GAAI9oB,EAAO+c,MAAMxR,GAAKmsB,OAAO5O,GAAY,CACvC,IAAIrgC,EACAkvC,EAAY5oC,EAEX+5B,EAAU9sB,SACb8sB,EAAYxyB,GAAOwyB,EAAUvyB,OAAQwO,GAASrN,GAAQ0N,KAAK0jB,IAAc,MAE3EA,EAAUjlB,UAAY,EACtB,MAAQpb,EAAQqgC,EAAU1jB,KAAKuyB,GAC7B,IAAIC,EAASnvC,EAAM+V,MAErBzP,EAASA,EAAOguB,MAAM,EAAG6a,IAAWnmC,EAAY8Z,EAAMqsB,SAEnD,GAAI53B,EAAOsZ,QAAQqC,GAAamN,GAAYvd,IAAQA,EAAK,CAC9D,IAAI/M,EAAQzP,EAAOg6B,YAAYD,GAC3BtqB,GAAS,IACXzP,EAASA,EAAOguB,MAAM,EAAGve,IAG7B,OAAOzP,EAAS0oC,EAsBlB,SAASI,GAAS73B,GAEhB,OADAA,EAAS+E,GAAS/E,GACVA,GAAU3J,GAAiBmM,KAAKxC,GACpCA,EAAOzQ,QAAQ4G,GAAeyN,IAC9B5D,EAuBN,IAAI83B,GAAYtX,IAAiB,SAASzxB,EAAQ4lC,EAAMn2B,GACtD,OAAOzP,GAAUyP,EAAQ,IAAM,IAAMm2B,EAAKyC,iBAoBxCtC,GAAa1U,GAAgB,eAqBjC,SAASM,GAAM1gB,EAAQyW,EAASiJ,GAI9B,OAHA1f,EAAS+E,GAAS/E,GAClByW,EAAUiJ,EAAQjuB,EAAYglB,EAE1BA,IAAYhlB,EACPgR,GAAezC,GAAU8D,GAAa9D,GAAUE,GAAWF,GAE7DA,EAAOvX,MAAMguB,IAAY,GA2BlC,IAAIwgB,GAAUnd,IAAS,SAAS/b,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMtM,EAAWwM,GAC9B,MAAOvN,GACP,OAAOsgC,GAAQtgC,GAAKA,EAAI,IAAI2T,EAAM3T,OA8BlCqnC,GAAU1W,IAAS,SAAStgB,EAAQi3B,GAKtC,OAJAt5B,GAAUs5B,GAAa,SAAS13B,GAC9BA,EAAMiT,GAAMjT,GACZ4O,GAAgBnO,EAAQT,EAAKitB,GAAKxsB,EAAOT,GAAMS,OAE1CA,KAgCT,SAASk3B,GAAK3oC,GACZ,IAAIrF,EAAkB,MAATqF,EAAgB,EAAIA,EAAMrF,OACnCw4B,EAAa3J,KASjB,OAPAxpB,EAASrF,EAAcmV,GAAS9P,GAAO,SAAS20B,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIzf,GAAU3S,GAEtB,MAAO,CAAC4wB,EAAWwB,EAAK,IAAKA,EAAK,OAJlB,GAOXnK,IAAS,SAAS7b,GACvB,IAAIO,GAAS,EACb,QAASA,EAAQvU,EAAQ,CACvB,IAAIg6B,EAAO30B,EAAMkP,GACjB,GAAIV,GAAMmmB,EAAK,GAAIt8B,KAAMsW,GACvB,OAAOH,GAAMmmB,EAAK,GAAIt8B,KAAMsW,OA8BpC,SAASi6B,GAAS3hC,GAChB,OAAO+a,GAAarB,GAAU1Z,EAAQtE,IAsBxC,SAASqoB,GAAS7b,GAChB,OAAO,WACL,OAAOA,GAwBX,SAAS05B,GAAU15B,EAAOmkB,GACxB,OAAiB,MAATnkB,GAAiBA,IAAUA,EAASmkB,EAAenkB,EAyB7D,IAAI25B,GAAOhX,KAuBPiX,GAAYjX,IAAW,GAkB3B,SAASrK,GAAStY,GAChB,OAAOA,EA6CT,SAASH,GAASP,GAChB,OAAO+Y,GAA4B,mBAAR/Y,EAAqBA,EAAOkS,GAAUlS,EAAM9L,IA+BzE,SAAS5E,GAAQkJ,GACf,OAAO0gB,GAAYhH,GAAU1Z,EAAQtE,IA6BvC,SAASqmC,GAAgBjlB,EAAMiD,GAC7B,OAAOU,GAAoB3D,EAAMpD,GAAUqG,EAAUrkB,IA2BvD,IAAIsmC,GAASze,IAAS,SAASzG,EAAMpV,GACnC,OAAO,SAAS8C,GACd,OAAO4T,GAAW5T,EAAQsS,EAAMpV,OA2BhCu6B,GAAW1e,IAAS,SAAS/Y,EAAQ9C,GACvC,OAAO,SAASoV,GACd,OAAOsB,GAAW5T,EAAQsS,EAAMpV,OAwCpC,SAASw6B,GAAM13B,EAAQxK,EAAQq3B,GAC7B,IAAI7kC,EAAQsc,GAAK9O,GACbyhC,EAAc9kB,GAAc3c,EAAQxN,GAEzB,MAAX6kC,GACE7jB,GAASxT,KAAYyhC,EAAY/tC,SAAWlB,EAAMkB,UACtD2jC,EAAUr3B,EACVA,EAASwK,EACTA,EAASpZ,KACTqwC,EAAc9kB,GAAc3c,EAAQ8O,GAAK9O,KAE3C,IAAI60B,IAAUrhB,GAAS6jB,IAAY,UAAWA,MAAcA,EAAQxC,MAChEza,EAASwC,GAAWpS,GAqBxB,OAnBArC,GAAUs5B,GAAa,SAAS3X,GAC9B,IAAItiB,EAAOxH,EAAO8pB,GAClBtf,EAAOsf,GAActiB,EACjB4S,IACF5P,EAAO2D,UAAU2b,GAAc,WAC7B,IAAIpW,EAAWtiB,KAAKyiB,UACpB,GAAIghB,GAASnhB,EAAU,CACrB,IAAIlb,EAASgS,EAAOpZ,KAAKuiB,aACrBiS,EAAUptB,EAAOob,YAAcU,GAAUljB,KAAKwiB,aAIlD,OAFAgS,EAAQ9tB,KAAK,CAAE,KAAQ0P,EAAM,KAAQoiB,UAAW,QAAWpf,IAC3DhS,EAAOqb,UAAYH,EACZlb,EAET,OAAOgP,EAAKD,MAAMiD,EAAQzB,GAAU,CAAC3X,KAAK8W,SAAU0hB,iBAKnDpf,EAgBT,SAAS23B,KAIP,OAHIt8B,GAAK6H,IAAMtc,OACbyU,GAAK6H,EAAIwB,IAEJ9d,KAeT,SAASu8B,MAwBT,SAASyU,GAAOzsC,GAEd,OADAA,EAAIsmB,GAAUtmB,GACP4tB,IAAS,SAAS7b,GACvB,OAAO0a,GAAQ1a,EAAM/R,MAsBzB,IAAI0sC,GAAO/V,GAAWzjB,IA0BlBy5B,GAAYhW,GAAWjkB,IA0BvBk6B,GAAWjW,GAAWjjB,IAwB1B,SAASsX,GAAS7D,GAChB,OAAOwE,GAAMxE,GAAQvT,GAAayT,GAAMF,IAAS+F,GAAiB/F,GAwBpE,SAAS0lB,GAAWh4B,GAClB,OAAO,SAASsS,GACd,OAAiB,MAAVtS,EAAiBtP,EAAY2hB,GAAQrS,EAAQsS,IA6CxD,IAAI2lB,GAAQ7V,KAsCR8V,GAAa9V,IAAY,GAoB7B,SAASsC,KACP,MAAO,GAgBT,SAASY,KACP,OAAO,EAqBT,SAAS6S,KACP,MAAO,GAgBT,SAASC,KACP,MAAO,GAgBT,SAASC,KACP,OAAO,EAsBT,SAASC,GAAMntC,EAAGoS,GAEhB,GADApS,EAAIsmB,GAAUtmB,GACVA,EAAI,GAAKA,EAAIsH,EACf,MAAO,GAET,IAAIgL,EAAQ7K,EACR1J,EAAS6d,GAAU5b,EAAGyH,GAE1B2K,EAAWwa,GAAYxa,GACvBpS,GAAKyH,EAEL,IAAI5E,EAASsS,GAAUpX,EAAQqU,GAC/B,QAASE,EAAQtS,EACfoS,EAASE,GAEX,OAAOzP,EAoBT,SAASuqC,GAAO76B,GACd,OAAIgL,GAAQhL,GACHW,GAASX,EAAO8U,IAElBjB,GAAS7T,GAAS,CAACA,GAASoM,GAAU8R,GAAa5X,GAAStG,KAoBrE,SAAS86B,GAASC,GAChB,IAAIrtC,IAAO8Y,GACX,OAAOF,GAASy0B,GAAUrtC,EAoB5B,IAAIshB,GAAMiV,IAAoB,SAAS+W,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBCzyB,GAAO8c,GAAY,QAiBnB4V,GAASjX,IAAoB,SAASkX,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC1yB,GAAQ4c,GAAY,SAoBxB,SAASlc,GAAIzJ,GACX,OAAQA,GAASA,EAAMnU,OACnBooB,GAAajU,EAAO2Y,GAAUlD,IAC9BpiB,EA0BN,SAASqoC,GAAM17B,EAAOE,GACpB,OAAQF,GAASA,EAAMnU,OACnBooB,GAAajU,EAAO0a,GAAYxa,EAAU,GAAIuV,IAC9CpiB,EAiBN,SAASsoC,GAAK37B,GACZ,OAAOyC,GAASzC,EAAO2Y,IA0BzB,SAASijB,GAAO57B,EAAOE,GACrB,OAAOuC,GAASzC,EAAO0a,GAAYxa,EAAU,IAqB/C,SAASyJ,GAAI3J,GACX,OAAQA,GAASA,EAAMnU,OACnBooB,GAAajU,EAAO2Y,GAAUS,IAC9B/lB,EA0BN,SAASwoC,GAAM77B,EAAOE,GACpB,OAAQF,GAASA,EAAMnU,OACnBooB,GAAajU,EAAO0a,GAAYxa,EAAU,GAAIkZ,IAC9C/lB,EAkBN,IAAIyoC,GAAWxX,IAAoB,SAASyX,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBC/xC,GAAQ07B,GAAY,SAiBpBsW,GAAW3X,IAAoB,SAAS4X,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgBH,SAASC,GAAIp8B,GACX,OAAQA,GAASA,EAAMnU,OACnB6W,GAAQ1C,EAAO2Y,IACf,EA0BN,SAAS0jB,GAAMr8B,EAAOE,GACpB,OAAQF,GAASA,EAAMnU,OACnB6W,GAAQ1C,EAAO0a,GAAYxa,EAAU,IACrC,EAgjBN,OA1iBAiL,GAAO8jB,MAAQA,GACf9jB,GAAO0Y,IAAMA,GACb1Y,GAAO4oB,OAASA,GAChB5oB,GAAO6oB,SAAWA,GAClB7oB,GAAO8oB,aAAeA,GACtB9oB,GAAO+oB,WAAaA,GACpB/oB,GAAOgpB,GAAKA,GACZhpB,GAAO+jB,OAASA,GAChB/jB,GAAOgkB,KAAOA,GACdhkB,GAAOwuB,QAAUA,GACjBxuB,GAAOikB,QAAUA,GACjBjkB,GAAO6mB,UAAYA,GACnB7mB,GAAO6hB,MAAQA,GACf7hB,GAAOie,MAAQA,GACfje,GAAOke,QAAUA,GACjBle,GAAOme,OAASA,GAChBne,GAAO0uB,KAAOA,GACd1uB,GAAO2uB,SAAWA,GAClB3uB,GAAO+Q,SAAWA,GAClB/Q,GAAO0iB,QAAUA,GACjB1iB,GAAOrD,OAASA,GAChBqD,GAAOkkB,MAAQA,GACflkB,GAAOmkB,WAAaA,GACpBnkB,GAAOokB,SAAWA,GAClBpkB,GAAOrF,SAAWA,GAClBqF,GAAOopB,aAAeA,GACtBppB,GAAO4lB,MAAQA,GACf5lB,GAAO6lB,MAAQA,GACf7lB,GAAOoe,WAAaA,GACpBpe,GAAOqe,aAAeA,GACtBre,GAAOse,eAAiBA,GACxBte,GAAOue,KAAOA,GACdve,GAAOwe,UAAYA,GACnBxe,GAAOye,eAAiBA,GACxBze,GAAO0e,UAAYA,GACnB1e,GAAO2e,KAAOA,GACd3e,GAAOxc,OAASA,GAChBwc,GAAO6iB,QAAUA,GACjB7iB,GAAO8iB,YAAcA,GACrB9iB,GAAO+iB,aAAeA,GACtB/iB,GAAO/a,QAAUA,GACjB+a,GAAO8e,YAAcA,GACrB9e,GAAO+e,aAAeA,GACtB/e,GAAO8lB,KAAOA,GACd9lB,GAAO6uB,KAAOA,GACd7uB,GAAO8uB,UAAYA,GACnB9uB,GAAOgf,UAAYA,GACnBhf,GAAO4pB,UAAYA,GACnB5pB,GAAO6pB,YAAcA,GACrB7pB,GAAOijB,QAAUA,GACjBjjB,GAAOkf,QAAUA,GACjBlf,GAAOmf,aAAeA,GACtBnf,GAAOqf,eAAiBA,GACxBrf,GAAOsf,iBAAmBA,GAC1Btf,GAAO8pB,OAASA,GAChB9pB,GAAO+pB,SAAWA,GAClB/pB,GAAOmjB,UAAYA,GACnBnjB,GAAOjL,SAAWA,GAClBiL,GAAOojB,MAAQA,GACfpjB,GAAOlE,KAAOA,GACdkE,GAAOmG,OAASA,GAChBnG,GAAOpc,IAAMA,GACboc,GAAOiqB,QAAUA,GACjBjqB,GAAOkqB,UAAYA,GACnBlqB,GAAOlc,QAAUA,GACjBkc,GAAO+uB,gBAAkBA,GACzB/uB,GAAOgd,QAAUA,GACjBhd,GAAOmqB,MAAQA,GACfnqB,GAAOqpB,UAAYA,GACnBrpB,GAAOgvB,OAASA,GAChBhvB,GAAOivB,SAAWA,GAClBjvB,GAAOkvB,MAAQA,GACflvB,GAAOyjB,OAASA,GAChBzjB,GAAOovB,OAASA,GAChBpvB,GAAOoqB,KAAOA,GACdpqB,GAAOqqB,OAASA,GAChBrqB,GAAOkmB,KAAOA,GACdlmB,GAAOqjB,QAAUA,GACjBrjB,GAAOqvB,KAAOA,GACdrvB,GAAOmmB,SAAWA,GAClBnmB,GAAOsvB,UAAYA,GACnBtvB,GAAOuvB,SAAWA,GAClBvvB,GAAOqmB,QAAUA,GACjBrmB,GAAOsmB,aAAeA,GACtBtmB,GAAOsjB,UAAYA,GACnBtjB,GAAOpF,KAAOA,GACdoF,GAAOsqB,OAASA,GAChBtqB,GAAO2N,SAAWA,GAClB3N,GAAOwvB,WAAaA,GACpBxvB,GAAO0f,KAAOA,GACd1f,GAAO2f,QAAUA,GACjB3f,GAAO4f,UAAYA,GACnB5f,GAAO6f,YAAcA,GACrB7f,GAAO8f,OAASA,GAChB9f,GAAOyvB,MAAQA,GACfzvB,GAAO0vB,WAAaA,GACpB1vB,GAAOumB,MAAQA,GACfvmB,GAAOwjB,OAASA,GAChBxjB,GAAO+f,OAASA,GAChB/f,GAAOwmB,KAAOA,GACdxmB,GAAOlB,QAAUA,GACjBkB,GAAO2jB,WAAaA,GACpB3jB,GAAOlG,IAAMA,GACbkG,GAAOwqB,QAAUA,GACjBxqB,GAAO4jB,QAAUA,GACjB5jB,GAAOwT,MAAQA,GACfxT,GAAO6jB,OAASA,GAChB7jB,GAAOsgB,WAAaA,GACpBtgB,GAAOugB,aAAeA,GACtBvgB,GAAOtJ,MAAQA,GACfsJ,GAAOymB,OAASA,GAChBzmB,GAAOwgB,KAAOA,GACdxgB,GAAOygB,KAAOA,GACdzgB,GAAO0gB,UAAYA,GACnB1gB,GAAO2gB,eAAiBA,GACxB3gB,GAAO4gB,UAAYA,GACnB5gB,GAAO8hB,IAAMA,GACb9hB,GAAO0mB,SAAWA,GAClB1mB,GAAOiY,KAAOA,GACdjY,GAAOoiB,QAAUA,GACjBpiB,GAAOyqB,QAAUA,GACjBzqB,GAAO0qB,UAAYA,GACnB1qB,GAAO+vB,OAASA,GAChB/vB,GAAOmP,cAAgBA,GACvBnP,GAAOtG,UAAYA,GACnBsG,GAAO2mB,MAAQA,GACf3mB,GAAO6gB,MAAQA,GACf7gB,GAAO8gB,QAAUA,GACjB9gB,GAAO+gB,UAAYA,GACnB/gB,GAAOghB,KAAOA,GACdhhB,GAAOpY,OAASA,GAChBoY,GAAOihB,SAAWA,GAClBjhB,GAAO4qB,MAAQA,GACf5qB,GAAOkhB,MAAQA,GACflhB,GAAOohB,UAAYA,GACnBphB,GAAO/c,OAASA,GAChB+c,GAAO6qB,WAAaA,GACpB7qB,GAAOhK,OAASA,GAChBgK,GAAO8qB,SAAWA,GAClB9qB,GAAOqhB,QAAUA,GACjBrhB,GAAOmX,MAAQA,GACfnX,GAAO4mB,KAAOA,GACd5mB,GAAOshB,IAAMA,GACbthB,GAAOuhB,MAAQA,GACfvhB,GAAOwhB,QAAUA,GACjBxhB,GAAOyhB,IAAMA,GACbzhB,GAAO0hB,UAAYA,GACnB1hB,GAAO2hB,cAAgBA,GACvB3hB,GAAO4hB,QAAUA,GAGjB5hB,GAAOwC,QAAUioB,GACjBzqB,GAAOmxB,UAAYzG,GACnB1qB,GAAOoxB,OAASvI,GAChB7oB,GAAOqxB,WAAavI,GAGpBoG,GAAMlvB,GAAQA,IAKdA,GAAOkE,IAAMA,GACblE,GAAO0tB,QAAUA,GACjB1tB,GAAOmrB,UAAYA,GACnBnrB,GAAOsrB,WAAaA,GACpBtrB,GAAOtC,KAAOA,GACdsC,GAAO+qB,MAAQA,GACf/qB,GAAOwB,MAAQA,GACfxB,GAAO+mB,UAAYA,GACnB/mB,GAAOgnB,cAAgBA,GACvBhnB,GAAO8mB,UAAYA,GACnB9mB,GAAOinB,WAAaA,GACpBjnB,GAAOoX,OAASA,GAChBpX,GAAO4uB,UAAYA,GACnB5uB,GAAOowB,OAASA,GAChBpwB,GAAOwrB,SAAWA,GAClBxrB,GAAO0F,GAAKA,GACZ1F,GAAO2rB,OAASA,GAChB3rB,GAAO4rB,aAAeA,GACtB5rB,GAAO2iB,MAAQA,GACf3iB,GAAOhgB,KAAOA,GACdggB,GAAO4e,UAAYA,GACnB5e,GAAOspB,QAAUA,GACjBtpB,GAAO4iB,SAAWA,GAClB5iB,GAAO6e,cAAgBA,GACvB7e,GAAOupB,YAAcA,GACrBvpB,GAAOpC,MAAQA,GACfoC,GAAO5b,QAAUA,GACjB4b,GAAOgjB,aAAeA,GACtBhjB,GAAOwpB,MAAQA,GACfxpB,GAAOypB,WAAaA,GACpBzpB,GAAO0pB,OAASA,GAChB1pB,GAAO2pB,YAAcA,GACrB3pB,GAAO8D,IAAMA,GACb9D,GAAOknB,GAAKA,GACZlnB,GAAOmnB,IAAMA,GACbnnB,GAAO5H,IAAMA,GACb4H,GAAOwO,MAAQA,GACfxO,GAAOif,KAAOA,GACdjf,GAAOwN,SAAWA,GAClBxN,GAAOnf,SAAWA,GAClBmf,GAAO+P,QAAUA,GACjB/P,GAAOgrB,QAAUA,GACjBhrB,GAAOgqB,OAASA,GAChBhqB,GAAO8E,YAAcA,GACrB9E,GAAOE,QAAUA,GACjBF,GAAOpM,cAAgBA,GACvBoM,GAAOmO,YAAcA,GACrBnO,GAAOgP,kBAAoBA,GAC3BhP,GAAOonB,UAAYA,GACnBpnB,GAAOhC,SAAWA,GAClBgC,GAAOlM,OAASA,GAChBkM,GAAOqnB,UAAYA,GACnBrnB,GAAOsnB,QAAUA,GACjBtnB,GAAOunB,QAAUA,GACjBvnB,GAAOwnB,YAAcA,GACrBxnB,GAAOynB,QAAUA,GACjBznB,GAAO9B,SAAWA,GAClB8B,GAAO4J,WAAaA,GACpB5J,GAAO0nB,UAAYA,GACnB1nB,GAAOsN,SAAWA,GAClBtN,GAAOhM,MAAQA,GACfgM,GAAO2nB,QAAUA,GACjB3nB,GAAO4nB,YAAcA,GACrB5nB,GAAO6nB,MAAQA,GACf7nB,GAAO+nB,SAAWA,GAClB/nB,GAAOioB,MAAQA,GACfjoB,GAAOgoB,OAASA,GAChBhoB,GAAO8nB,SAAWA,GAClB9nB,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOkP,cAAgBA,GACvBlP,GAAO9L,SAAWA,GAClB8L,GAAOkoB,cAAgBA,GACvBloB,GAAO5L,MAAQA,GACf4L,GAAOkjB,SAAWA,GAClBljB,GAAO+I,SAAWA,GAClB/I,GAAO1L,aAAeA,GACtB0L,GAAOmoB,YAAcA,GACrBnoB,GAAOooB,UAAYA,GACnBpoB,GAAOqoB,UAAYA,GACnBroB,GAAOhP,KAAOA,GACdgP,GAAO6rB,UAAYA,GACnB7rB,GAAOsL,KAAOA,GACdtL,GAAOwf,YAAcA,GACrBxf,GAAO8rB,UAAYA,GACnB9rB,GAAO+rB,WAAaA,GACpB/rB,GAAOsoB,GAAKA,GACZtoB,GAAOuoB,IAAMA,GACbvoB,GAAO1B,IAAMA,GACb0B,GAAOuwB,MAAQA,GACfvwB,GAAOwwB,KAAOA,GACdxwB,GAAOywB,OAASA,GAChBzwB,GAAOxB,IAAMA,GACbwB,GAAO0wB,MAAQA,GACf1wB,GAAOkc,UAAYA,GACnBlc,GAAO8c,UAAYA,GACnB9c,GAAO2vB,WAAaA,GACpB3vB,GAAO4vB,WAAaA,GACpB5vB,GAAO6vB,SAAWA,GAClB7vB,GAAO2wB,SAAWA,GAClB3wB,GAAOyf,IAAMA,GACbzf,GAAOmvB,WAAaA,GACpBnvB,GAAO2a,KAAOA,GACd3a,GAAOzC,IAAMA,GACbyC,GAAOgsB,IAAMA,GACbhsB,GAAOksB,OAASA,GAChBlsB,GAAOmsB,SAAWA,GAClBnsB,GAAOzN,SAAWA,GAClByN,GAAOpB,OAASA,GAChBoB,GAAOna,OAASA,GAChBma,GAAOujB,YAAcA,GACrBvjB,GAAOqsB,OAASA,GAChBrsB,GAAOha,QAAUA,GACjBga,GAAOxa,OAASA,GAChBwa,GAAOlhB,MAAQA,GACfkhB,GAAOxF,aAAeA,EACtBwF,GAAO0jB,OAASA,GAChB1jB,GAAOxG,KAAOA,GACdwG,GAAOssB,UAAYA,GACnBtsB,GAAO/b,KAAOA,GACd+b,GAAOggB,YAAcA,GACrBhgB,GAAOigB,cAAgBA,GACvBjgB,GAAOkgB,cAAgBA,GACvBlgB,GAAOmgB,gBAAkBA,GACzBngB,GAAOogB,kBAAoBA,GAC3BpgB,GAAOqgB,kBAAoBA,GAC3BrgB,GAAOwsB,UAAYA,GACnBxsB,GAAOysB,WAAaA,GACpBzsB,GAAO8wB,SAAWA,GAClB9wB,GAAOixB,IAAMA,GACbjxB,GAAOkxB,MAAQA,GACflxB,GAAO0sB,SAAWA,GAClB1sB,GAAO8vB,MAAQA,GACf9vB,GAAO6Z,SAAWA,GAClB7Z,GAAOiJ,UAAYA,GACnBjJ,GAAOkJ,SAAWA,GAClBlJ,GAAO2tB,QAAUA,GACjB3tB,GAAO+Z,SAAWA,GAClB/Z,GAAO2oB,cAAgBA,GACvB3oB,GAAOxE,SAAWA,GAClBwE,GAAO4tB,QAAUA,GACjB5tB,GAAO8tB,KAAOA,GACd9tB,GAAO+tB,QAAUA,GACjB/tB,GAAOguB,UAAYA,GACnBhuB,GAAOiuB,SAAWA,GAClBjuB,GAAOsuB,SAAWA,GAClBtuB,GAAOgwB,SAAWA,GAClBhwB,GAAOuuB,UAAYA,GACnBvuB,GAAOurB,WAAaA,GAGpBvrB,GAAOsxB,KAAOltC,GACd4b,GAAOuxB,UAAYvO,GACnBhjB,GAAOwxB,MAAQvS,GAEfiQ,GAAMlvB,GAAS,WACb,IAAIhT,EAAS,GAMb,OALA0b,GAAW1I,IAAQ,SAASxL,EAAMsiB,GAC3Brb,GAAe9G,KAAKqL,GAAO7E,UAAW2b,KACzC9pB,EAAO8pB,GAActiB,MAGlBxH,EAPK,GAQR,CAAE,OAAS,IAWjBgT,GAAO7X,QAAUA,EAGjBgN,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS2hB,GACxF9W,GAAO8W,GAAYpe,YAAcsH,MAInC7K,GAAU,CAAC,OAAQ,SAAS,SAAS2hB,EAAY7hB,GAC/CkL,GAAYhF,UAAU2b,GAAc,SAASn0B,GAC3CA,EAAIA,IAAMuF,EAAY,EAAImW,GAAU4K,GAAUtmB,GAAI,GAElD,IAAI6C,EAAUpH,KAAK6iB,eAAiBhM,EAChC,IAAIkL,GAAY/hB,MAChBA,KAAKojB,QAUT,OARIhc,EAAOyb,aACTzb,EAAO2b,cAAgB5C,GAAU5b,EAAG6C,EAAO2b,eAE3C3b,EAAO4b,UAAUtc,KAAK,CACpB,KAAQyZ,GAAU5b,EAAGyH,GACrB,KAAQ0sB,GAActxB,EAAOwb,QAAU,EAAI,QAAU,MAGlDxb,GAGT2a,GAAYhF,UAAU2b,EAAa,SAAW,SAASn0B,GACrD,OAAOvE,KAAK0gB,UAAUgY,GAAYn0B,GAAGmc,cAKzC3J,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS2hB,EAAY7hB,GAC7D,IAAIrU,EAAOqU,EAAQ,EACfw8B,EAAW7wC,GAAQiJ,GAAoBjJ,GAAQmJ,EAEnDoW,GAAYhF,UAAU2b,GAAc,SAAS/hB,GAC3C,IAAIvP,EAASpH,KAAKojB,QAMlB,OALAhc,EAAO0b,cAAcpc,KAAK,CACxB,SAAYyqB,GAAYxa,EAAU,GAClC,KAAQnU,IAEV4E,EAAOyb,aAAezb,EAAOyb,cAAgBwwB,EACtCjsC,MAKX2P,GAAU,CAAC,OAAQ,SAAS,SAAS2hB,EAAY7hB,GAC/C,IAAIy8B,EAAW,QAAUz8B,EAAQ,QAAU,IAE3CkL,GAAYhF,UAAU2b,GAAc,WAClC,OAAO14B,KAAKszC,GAAU,GAAGx8B,QAAQ,OAKrCC,GAAU,CAAC,UAAW,SAAS,SAAS2hB,EAAY7hB,GAClD,IAAI08B,EAAW,QAAU18B,EAAQ,GAAK,SAEtCkL,GAAYhF,UAAU2b,GAAc,WAClC,OAAO14B,KAAK6iB,aAAe,IAAId,GAAY/hB,MAAQA,KAAKuzC,GAAU,OAItExxB,GAAYhF,UAAU+iB,QAAU,WAC9B,OAAO9/B,KAAKoF,OAAOgqB,KAGrBrN,GAAYhF,UAAUnb,KAAO,SAASsV,GACpC,OAAOlX,KAAKoF,OAAO8R,GAAW2pB,QAGhC9e,GAAYhF,UAAUynB,SAAW,SAASttB,GACxC,OAAOlX,KAAK0gB,UAAU9e,KAAKsV,IAG7B6K,GAAYhF,UAAUgoB,UAAY5S,IAAS,SAASzG,EAAMpV,GACxD,MAAmB,mBAARoV,EACF,IAAI3J,GAAY/hB,MAElBA,KAAKwF,KAAI,SAASsR,GACvB,OAAOkW,GAAWlW,EAAO4U,EAAMpV,SAInCyL,GAAYhF,UAAUqoB,OAAS,SAASluB,GACtC,OAAOlX,KAAKoF,OAAOigC,GAAOlU,GAAYja,MAGxC6K,GAAYhF,UAAUqY,MAAQ,SAASzR,EAAOC,GAC5CD,EAAQkH,GAAUlH,GAElB,IAAIvc,EAASpH,KACb,OAAIoH,EAAOyb,eAAiBc,EAAQ,GAAKC,EAAM,GACtC,IAAI7B,GAAY3a,IAErBuc,EAAQ,EACVvc,EAASA,EAAOk7B,WAAW3e,GAClBA,IACTvc,EAASA,EAAO+4B,KAAKxc,IAEnBC,IAAQ9Z,IACV8Z,EAAMiH,GAAUjH,GAChBxc,EAASwc,EAAM,EAAIxc,EAAOg5B,WAAWxc,GAAOxc,EAAOi7B,KAAKze,EAAMD,IAEzDvc,IAGT2a,GAAYhF,UAAUwlB,eAAiB,SAASrrB,GAC9C,OAAOlX,KAAK0gB,UAAU8hB,UAAUtrB,GAAWwJ,WAG7CqB,GAAYhF,UAAUinB,QAAU,WAC9B,OAAOhkC,KAAKqiC,KAAKr2B,IAInBse,GAAWvI,GAAYhF,WAAW,SAAS3G,EAAMsiB,GAC/C,IAAI8a,EAAgB,qCAAqC34B,KAAK6d,GAC1D+a,EAAU,kBAAkB54B,KAAK6d,GACjCgb,EAAa9xB,GAAO6xB,EAAW,QAAwB,QAAd/a,EAAuB,QAAU,IAAOA,GACjFib,EAAeF,GAAW,QAAQ54B,KAAK6d,GAEtCgb,IAGL9xB,GAAO7E,UAAU2b,GAAc,WAC7B,IAAI5hB,EAAQ9W,KAAKuiB,YACbjM,EAAOm9B,EAAU,CAAC,GAAKjb,UACvBob,EAAS98B,aAAiBiL,GAC1BpL,EAAWL,EAAK,GAChBu9B,EAAUD,GAAU9xB,GAAQhL,GAE5B6sB,EAAc,SAAS7sB,GACzB,IAAI1P,EAASssC,EAAWv9B,MAAMyL,GAAQjK,GAAU,CAACb,GAAQR,IACzD,OAAQm9B,GAAWnxB,EAAYlb,EAAO,GAAKA,GAGzCysC,GAAWL,GAAoC,mBAAZ78B,GAA6C,GAAnBA,EAASrU,SAExEsxC,EAASC,GAAU,GAErB,IAAIvxB,EAAWtiB,KAAKyiB,UAChBqxB,IAAa9zC,KAAKwiB,YAAYlgB,OAC9ByxC,EAAcJ,IAAiBrxB,EAC/B0xB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B/8B,EAAQk9B,EAAWl9B,EAAQ,IAAIiL,GAAY/hB,MAC3C,IAAIoH,EAASgP,EAAKD,MAAMW,EAAOR,GAE/B,OADAlP,EAAOob,YAAY9b,KAAK,CAAE,KAAQmzB,GAAM,KAAQ,CAAC8J,GAAc,QAAW75B,IACnE,IAAIkY,GAAc5a,EAAQkb,GAEnC,OAAIyxB,GAAeC,EACV59B,EAAKD,MAAMnW,KAAMsW,IAE1BlP,EAASpH,KAAK65B,KAAK8J,GACZoQ,EAAeN,EAAUrsC,EAAO0P,QAAQ,GAAK1P,EAAO0P,QAAW1P,QAK1E2P,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS2hB,GACxE,IAAItiB,EAAO0G,GAAW4b,GAClBub,EAAY,0BAA0Bp5B,KAAK6d,GAAc,MAAQ,OACjEib,EAAe,kBAAkB94B,KAAK6d,GAE1C9W,GAAO7E,UAAU2b,GAAc,WAC7B,IAAIpiB,EAAOkiB,UACX,GAAImb,IAAiB3zC,KAAKyiB,UAAW,CACnC,IAAI3L,EAAQ9W,KAAK8W,QACjB,OAAOV,EAAKD,MAAM2L,GAAQhL,GAASA,EAAQ,GAAIR,GAEjD,OAAOtW,KAAKi0C,IAAW,SAASn9B,GAC9B,OAAOV,EAAKD,MAAM2L,GAAQhL,GAASA,EAAQ,GAAIR,UAMrDgU,GAAWvI,GAAYhF,WAAW,SAAS3G,EAAMsiB,GAC/C,IAAIgb,EAAa9xB,GAAO8W,GACxB,GAAIgb,EAAY,CACd,IAAI/6B,EAAM+6B,EAAW/yC,KAAO,GACvB0c,GAAe9G,KAAK0K,GAAWtI,KAClCsI,GAAUtI,GAAO,IAEnBsI,GAAUtI,GAAKjS,KAAK,CAAE,KAAQgyB,EAAY,KAAQgb,QAItDzyB,GAAUqY,GAAaxvB,EAAWc,GAAoBjK,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQmJ,IAIViY,GAAYhF,UAAUqG,MAAQH,GAC9BlB,GAAYhF,UAAU2D,QAAUyC,GAChCpB,GAAYhF,UAAUjG,MAAQuM,GAG9BzB,GAAO7E,UAAU6tB,GAAKhH,GACtBhiB,GAAO7E,UAAU0mB,MAAQI,GACzBjiB,GAAO7E,UAAUm3B,OAASpQ,GAC1BliB,GAAO7E,UAAU9B,KAAO8oB,GACxBniB,GAAO7E,UAAUmd,MAAQgK,GACzBtiB,GAAO7E,UAAU2D,QAAUyjB,GAC3BviB,GAAO7E,UAAUo3B,OAASvyB,GAAO7E,UAAU2E,QAAUE,GAAO7E,UAAUjG,MAAQutB,GAG9EziB,GAAO7E,UAAUq2B,MAAQxxB,GAAO7E,UAAU8jB,KAEtCjiB,KACFgD,GAAO7E,UAAU6B,IAAeqlB,IAE3BriB,IAMLtF,GAAIF,KAQN3H,GAAK6H,EAAIA,GAIT,aACE,OAAOA,IACR,qCAaH/F,KAAKvW,Q,iFCvthBQ,QACbwB,SAAU,CACR4yC,YADQ,WAEN,IAAMpwC,EAA+B,gBAArBhE,KAAK8D,OAAOnD,KAAyBX,KAAKq0C,OAAOC,QAAQC,eAAev0C,KAAK8D,OAAOO,MAAM3D,QAAUV,KAAK8D,OAAOC,OAAOF,MACvI,OAAO7D,KAAKq0C,OAAOC,QAAQE,eAAexwC,IAE5CywC,UALQ,WAMN,IAAMzyC,EAAIhC,KAAKq0C,OAAOC,QAAQI,UAAU10C,KAAK8D,OAAOC,OAAOF,OAC3D,SAAU7B,IAAKA,EAAEyyC,YAEnBE,UATQ,WAUN,SAAW30C,KAAKo0C,aAAep0C,KAAKo0C,YAAYQ,SAAY50C,KAAKq0C,OAAOC,QAAQO,kBAAkB70C,KAAK8D,OAAOC,OAAO9B,WAAY,cAEnI6yC,SAZQ,WAaN,OAAO90C,KAAKo0C,aAAep0C,KAAKo0C,YAAYW","file":"js/chunk-736e4adb.c48d242d.js","sourcesContent":["var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('v-expand-transition',[_c('v-card',{attrs:{\"flat\":\"\",\"dark\":_vm.dark}},[_c('v-card-text',{staticClass:\"pa-0\"},[_c('div',[_vm._v(_vm._s(_vm.round.name)+\" \"+_vm._s(this.bracket? this.playoffRound : ''))]),(_vm.division)?_c('bracket-match-card',{attrs:{\"matchIn\":_vm.match,\"pool\":_vm.pool,\"bracket\":_vm.bracket,\"bracketCard\":!!_vm.bracket,\"_division\":_vm.division,\"_round\":_vm.round,\"nums\":true,\"lowlight\":false,\"lineupLock\":_vm.lineupLock}}):_vm._e()],1)],1)],1)}\nvar staticRenderFns = []\n\nexport { render, staticRenderFns }","\r\n\r\n\r\n","import mod from \"-!../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../node_modules/thread-loader/dist/cjs.js!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./NoDetailsMatchCard.vue?vue&type=script&lang=js&\"; export default mod; export * from \"-!../../../../node_modules/cache-loader/dist/cjs.js??ref--12-0!../../../../node_modules/thread-loader/dist/cjs.js!../../../../node_modules/babel-loader/lib/index.js!../../../../node_modules/cache-loader/dist/cjs.js??ref--0-0!../../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./NoDetailsMatchCard.vue?vue&type=script&lang=js&\"","import { render, staticRenderFns } from \"./NoDetailsMatchCard.vue?vue&type=template&id=1c2377c5&\"\nimport script from \"./NoDetailsMatchCard.vue?vue&type=script&lang=js&\"\nexport * from \"./NoDetailsMatchCard.vue?vue&type=script&lang=js&\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n null,\n null\n \n)\n\nexport default component.exports\n\n/* vuetify-loader */\nimport installComponents from \"!../../../../node_modules/vuetify-loader/lib/runtime/installComponents.js\"\nimport { VCard } from 'vuetify/lib/components/VCard';\nimport { VCardText } from 'vuetify/lib/components/VCard';\nimport { VExpandTransition } from 'vuetify/lib/components/transitions';\ninstallComponents(component, {VCard,VCardText,VExpandTransition})\n","export default {\r\n computed: {\r\n dayId () {\r\n return +this.$route.params.dayId\r\n },\r\n divisionId () {\r\n return +this.$route.params.divisionId\r\n },\r\n poolId () {\r\n return +this.$route.params.poolId\r\n },\r\n roundId () {\r\n return +this.$route.params.dayId\r\n },\r\n teamId () {\r\n return +this.$route.params.teamId\r\n },\r\n tournamentId () {\r\n return +this.$route.params.tournamentId\r\n },\r\n standingsI () {\r\n return +this.$route.params.standingsI\r\n },\r\n liveProps () {\r\n return this.$route.query && this.$route.query.liveN && {\r\n n: +this.$route.query.liveN,\r\n id: +(this.$route.query.liveId | 0)\r\n }\r\n }\r\n }\r\n}\r\n","import { flatten } from 'lodash'\r\nimport { firstBy } from 'thenby'\r\n// import { sum } from 'lodash.sum'\r\nimport DtoUpdate from './DtoUpdate'\r\n\r\nexport default class ParentTeam {\r\n constructor (dto, tournament) {\r\n this.tournament = tournament\r\n this.pairs2 = []\r\n if (dto) {\r\n this.update(dto)\r\n }\r\n }\r\n\r\n update (dto) {\r\n if (dto) {\r\n if (typeof dto === 'string') dto = JSON.parse(dto)\r\n const exclude = []\r\n DtoUpdate(dto, this, exclude)\r\n }\r\n\r\n const teams = this.tournament.activeTeams.filter(f => f.rosteredTeamId === this.id)\r\n const teamIds = teams.map(m => m.id)\r\n const matches = this.tournament.matches.filter(f => !f.isBye && f.activeTeamIds.some(id => teamIds.includes(id))).sort(firstBy('unix'))\r\n this.pairs2 = []\r\n matches.forEach(m => {\r\n // var lups = []\r\n if (m.homeIds.some(id => teamIds.includes(id))) {\r\n var h = m.getLineupPlayers(true, teams, true, 2)\r\n this.addMatch(h)\r\n }\r\n if (m.awayIds.some(id => teamIds.includes(id))) {\r\n var a = m.getLineupPlayers(false, teams, true, 2)\r\n this.addMatch(a)\r\n }\r\n })\r\n }\r\n\r\n addMatch (dto) {\r\n var x = this.pairs2.find(f => f.name === dto.name)\r\n if (x) {\r\n x.w += dto.w\r\n x.l += dto.l\r\n x.u += dto.u\r\n } else {\r\n this.pairs2.push(dto)\r\n }\r\n }\r\n\r\n get divisions () {\r\n return this.tournament.publicDivisions.filter(f => !!f.activeTeams.find(t => t.rosteredTeamId === this.id))\r\n }\r\n\r\n get children () {\r\n return this.tournament.activeTeams.filter(f => f.rosteredTeamId === this.id)\r\n }\r\n\r\n get squads () {\r\n return flatten(\r\n this.divisions\r\n .filter(f => f.isDuals)\r\n .map(d =>\r\n d.activeTeams\r\n .filter(f => f.rosteredTeamId === this.id)\r\n .map(t => {\r\n return {\r\n team: t,\r\n division: d,\r\n matches: this.tournament.matches.filter(f => f.activeTeamIds.includes(t.id)),\r\n get record () {\r\n return {\r\n w: this.matches.filter(f => f.complete && f.winningId === this.team.id),\r\n l: this.matches.filter(f => f.complete && f.winningId !== this.team.id)\r\n }\r\n }\r\n }\r\n })\r\n )\r\n ).sort(firstBy('team.name'))\r\n }\r\n\r\n get squadIds () {\r\n return this.squads.map(m => m.id)\r\n }\r\n\r\n get pairsOG () {\r\n const teams = flatten(\r\n this.divisions\r\n .filter(f => !f.isDuals)\r\n .map(d =>\r\n d.activeTeams\r\n .filter(f => f.rosteredTeamId === this.id)\r\n .map(t => {\r\n return {\r\n name: t.name,\r\n team: t,\r\n division: d,\r\n matches: this.tournament.matches.filter(f => !f.isBye && f.activeTeamIds.includes(t.id)).sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId === this.team.id).sort(firstBy('unix')),\r\n l: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId !== this.team.id).sort(firstBy('unix'))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete).sort(firstBy('unix'))\r\n }\r\n }\r\n })\r\n )\r\n )\r\n\r\n const result = {\r\n teams: teams.sort(sortByTeamNumber),\r\n matches: flatten(teams.map(m => m.matches)).sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: flatten(this.teams.map(m => m.record.w)),\r\n l: flatten(this.teams.map(m => m.record.l))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete)\r\n }\r\n }\r\n return result\r\n }\r\n\r\n get pairs () {\r\n const teams = this.pairs2.map(t => {\r\n return {\r\n name: t.name,\r\n team: t,\r\n matches: this.tournament.matches.filter(f => !f.isBye && f.activeTeamIds.includes(t.id)).sort(firstBy('unix')),\r\n record: {\r\n w: t.w,\r\n l: t.l\r\n },\r\n unplayed: t.u\r\n }\r\n })\r\n\r\n const result = {\r\n teams: teams.sort(sortByWinLoss),\r\n record: {\r\n w: teams.map(m => m.record.w).reduce((a, b) => { return a + b }, 0),\r\n l: teams.map(m => m.record.l).reduce((a, b) => { return a + b }, 0)\r\n },\r\n unplayed: teams.map(m => m.u).reduce((a, b) => { return a + b }, 0)\r\n }\r\n return result\r\n }\r\n\r\n get pairIds () {\r\n return this.pairs.map(m => m.id)\r\n }\r\n}\r\nfunction sortByTeamNumber (a, b) {\r\n const x = +(a.name.replace(/\\D/g, ''))\r\n const y = +(b.name.replace(/\\D/g, ''))\r\n return x - y\r\n}\r\n\r\nfunction sortByWinLoss (a, b) {\r\n const x = a.record.l === 0 ? a.record.w * 100 : a.record.w > 0 ? a.record.w / a.record.l : 0\r\n const y = b.record.l === 0 ? b.record.w * 100 : b.record.w > 0 ? b.record.w / b.record.l : 0\r\n return y - x\r\n}\r\n","import { flatten } from 'lodash'\r\nimport { firstBy } from 'thenby'\r\nimport DtoUpdate from './DtoUpdate'\r\n\r\nexport default class ParentTeam {\r\n rtIds = []\r\n\r\n constructor (dto, tournament, api) {\r\n this.api = api\r\n this.tournament = tournament\r\n if (dto) {\r\n this.update(dto)\r\n }\r\n }\r\n\r\n update (dto) {\r\n if (typeof dto === 'string') dto = JSON.parse(dto)\r\n const exclude = []\r\n DtoUpdate(dto, this, exclude)\r\n }\r\n\r\n get divisions () {\r\n return this.tournament.publicDivisions.filter(f => !!f.activeTeams.find(t => this.rtIds.includes(t.rosteredTeamId)))\r\n }\r\n\r\n get children () {\r\n return this.tournament.activeTeams.filter(f => this.rtIds.includes(f.rosteredTeamId))\r\n }\r\n\r\n get squads () {\r\n const tourney = this.tournament\r\n const teams = flatten(\r\n this.divisions\r\n .filter(f => f.isDuals)\r\n .map(d =>\r\n d.activeTeams\r\n .filter(f => this.rtIds.includes(f.rosteredTeamId))\r\n .map(t => {\r\n const duals = tourney.duals.filter(f => !f.isBye && f.activeTeamIds.includes(t.id))\r\n return {\r\n name: t.name,\r\n team: t,\r\n division: d,\r\n matches: duals.sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId === this.team.id).sort(firstBy('unix')),\r\n l: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId !== this.team.id).sort(firstBy('unix'))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete).sort(firstBy('unix'))\r\n }\r\n }\r\n })\r\n )\r\n )\r\n\r\n const result = {\r\n teams: teams.sort(firstBy('name')),\r\n matches: flatten(teams.map(m => m.matches)).sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: flatten(this.teams.map(m => m.record.w)),\r\n l: flatten(this.teams.map(m => m.record.l))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete)\r\n }\r\n }\r\n return result\r\n }\r\n\r\n get squadIds () {\r\n return this.squads.map(m => m.id)\r\n }\r\n\r\n get pairs () {\r\n const teams = flatten(\r\n this.divisions\r\n .filter(f => !f.isDuals)\r\n .map(d =>\r\n d.activeTeams\r\n .filter(f => this.rtIds.includes(f.rosteredTeamId))\r\n .map(t => {\r\n return {\r\n name: t.name,\r\n team: t,\r\n division: d,\r\n matches: this.tournament.matches.filter(f => !f.isBye && f.activeTeamIds.includes(t.id)).sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId === this.team.id).sort(firstBy('unix')),\r\n l: this.matches.filter(f => f.complete && f.winningTeam && f.winningTeam.teamId !== this.team.id).sort(firstBy('unix'))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete).sort(firstBy('unix'))\r\n }\r\n }\r\n })\r\n )\r\n )\r\n\r\n const result = {\r\n teams: teams.sort(sortByTeamNumber),\r\n matches: flatten(teams.map(m => m.matches)).sort(firstBy('unix')),\r\n get record () {\r\n return {\r\n w: flatten(this.teams.map(m => m.record.w)),\r\n l: flatten(this.teams.map(m => m.record.l))\r\n }\r\n },\r\n get unplayed () {\r\n return this.matches.filter(f => !f.complete)\r\n }\r\n }\r\n return result\r\n }\r\n\r\n get pairIds () {\r\n return this.pairs.map(m => m.id)\r\n }\r\n}\r\nfunction sortByTeamNumber (a, b) {\r\n const x = +(a.name.replace(/\\D/g, ''))\r\n const y = +(b.name.replace(/\\D/g, ''))\r\n return x - y\r\n}\r\n","import { firstBy } from 'thenby'\r\nimport uniqBy from 'lodash.uniqby'\r\nimport ParentTeam from './ParentTeam'\r\nimport ParentTeamClub from './ParentTeamClub'\r\n\r\nexport default class TournamentSummarizer {\r\n loading = false\r\n parents = []\r\n\r\n constructor (tournament, api) {\r\n this.api = api\r\n this.tournament = tournament\r\n this.loadParents()\r\n }\r\n\r\n get teams () {\r\n return this.tournament.activeTeams.filter(f => f.isRostered)\r\n }\r\n\r\n get parentIds () {\r\n return [...new Set(this.teams.map(m => m.rosteredTeamId))]\r\n }\r\n\r\n get clubs () {\r\n return this.tournament.isNcaa ? [] : this.parents\r\n }\r\n\r\n recalc () {\r\n this.parents.forEach(p => {\r\n p.update()\r\n })\r\n }\r\n\r\n loadParents () {\r\n if (this.parentIds.length === 0) return\r\n this.loading = true\r\n this.api.roster.teamsById(this.parentIds)\r\n .then(r => {\r\n if (this.tournament.isNcaa) {\r\n this.initNcaa(r.data)\r\n } else {\r\n this.initClubs(r.data)\r\n }\r\n })\r\n .catch(e => console.log(e.response))\r\n .finally(() => {\r\n this.loading = false\r\n })\r\n }\r\n\r\n initNcaa (teams) {\r\n this.parents = teams.map(m => new ParentTeam(m, this.tournament, this.api)).sort(firstBy('name'))\r\n }\r\n\r\n initClubs (teams) {\r\n let clubs = teams.map(m => {\r\n return {\r\n id: m.ownerId,\r\n name: m.owner || 'Unaffiliated',\r\n logoUrl: m.logoUrl\r\n }\r\n })\r\n\r\n clubs = uniqBy(clubs, 'id').sort(firstBy('name'))\r\n clubs.forEach(c => {\r\n const t = new ParentTeamClub(c, this.tournament, this.api)\r\n const children = teams.filter(f => f.ownerId === c.id)\r\n if (children.length > 0) {\r\n t.rtIds.push(...children.map(m => m.id))\r\n }\r\n\r\n this.parents.push(t)\r\n })\r\n }\r\n}\r\n","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.15';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading and trailing whitespace. */\n var reTrim = /^\\s+|\\s+$/g,\n reTrimStart = /^\\s+/,\n reTrimEnd = /\\s+$/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n var index = -1;\n iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n value = iteratee(value);\n\n var low = 0,\n high = array == null ? 0 : array.length,\n valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(array);\n if (stacked && stack.get(other)) {\n return stacked == other;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked && stack.get(other)) {\n return stacked == other;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '

fred, barney, & pebbles

'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('déjà vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<%- value %>');\n * compiled({ 'value': '