{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///(webpack)/buildin/global.js","webpack:///./.tmp/app_brand_core/js/components/processInclude.js","webpack:///./.tmp/app_brand_core/js/components/utils.js","webpack:///(webpack)/buildin/module.js","webpack:///(webpack)/buildin/amd-options.js","webpack:///./.tmp/app_brand_core/js/blog.js","webpack:///./.tmp/app_brand_core/js/blog/blog.js","webpack:///./node_modules/lodash/lodash.js"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","g","this","Function","e","window","include","keys","forEach","keyValueArray","str","x","k","v","kvp","split","output","length","queryStringToObject","url","search","startIndex","indexOf","endIndex","substring","location","result","pair","nameVal","decodeURIComponent","JSON","parse","stringify","objectToQueryString","obj","urlString","path","hash","index","qsIndex","hashIndex","$","param","removeQueryParam","queryparam","URL","searchParams","delete","loadScript","src","callback","script","document","createElement","type","getElementsByTagName","appendChild","onload","loadJsAfterWindowLoad","readyState","addEventListener","heapify","list","ndx","heapSize","largest","left","right","global","cscUtils","appendParamToURL","encodeURIComponent","getParamsFromURL","arr","searchHash","postHash","arrHash","output2","prop","updateURLParam","paramVal","newAdditionalURL","tempArray","baseURL","additionalURL","temp","arrayIntersection","a1","a2","map","inArray","createModalMarkup","content","options","defaults","title","showCloseBtn","enableLayeredDrawers","modalSizeClass","centeredClass","customClasses","modalId","buttons","settings","extend","dataAttributes","undefined","push","header","idAttribute","footer","footerBtns","btn","html","join","removeQueryParamFromCurrentUrl","href","history","replaceState","createBackdrop","customClass","append","removeBackdrop","selector","find","remove","setUrlKeyValue","val","qs","setUrlData","decodeQueryParam","replace","elementInViewport","el","offsetToTop","top","offsetTop","offsetLeft","width","offsetWidth","height","offsetHeight","offsetParent","pageXOffset","pageYOffset","innerHeight","innerWidth","compatMode","documentElement","scrollTop","clientHeight","scrollLeft","clientWidth","insertAtInputCursor","formInput","input","start","selectionStart","end","selectionEnd","stringToTitleCase","word","charAt","toUpperCase","slice","toLowerCase","getTimeAndHours","stageMessage","date","Date","hours","getHours","minutes","getMinutes","ampm","findNHighest","listToUse","arrayLength","Math","floor","firstListItem","heapifyMax","pop","deepEqual","obj1","obj2","reduce","isEqual","webpackPolyfill","deprecate","paths","children","__webpack_amd_options__","processInclude","require","ready","util","_","appendBlogGrid","response","last","after","replaceBlogGrid","empty","loadCarousel","carousel","loadMore","on","preventDefault","attr","spinner","ajax","success","stop","error","err","responseJSON","redirectUrl","loadFiltered","debounce","$parent","delegateTarget","articleType","sortBy","sortOrder","loadAllFeatured","loadAll","ofsTabLinkClicked","loadPagination","hasClass","infiniteScroll","$loadingPlaceHolder","gridUrl","addClass","fillEndlessScrollChunk","removeClass","sessionStorage","complete","webShare","$blogSocialShareMobile","$blogSocialShareDesktop","navigator","share","catch","console","copyClipboard","clipboard","$copyBtn","writeText","data","alert","theme","timeToLive","dismissible","FUNC_ERROR_TEXT","PLACEHOLDER","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsComboRange","rsComboMarksRange","rsBreakRange","rsMathOpRange","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsMiscLower","rsMiscUpper","reOptMod","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","parseFloat","freeParseInt","parseInt","freeGlobal","freeSelf","self","root","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","current","baseTimes","baseTrim","string","trimmedEndIndex","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","test","mapToArray","size","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","match","unicodeToArray","asciiToArray","unescapeHtmlChar","runInContext","context","uid","pick","Error","String","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","toString","idCounter","maskSrcKey","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","Set","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__","Hash","entries","clear","entry","ListCache","MapCache","SetCache","__data__","add","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","constructor","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","comparer","sort","baseSortBy","objCriteria","criteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","MAX_ARRAY_LENGTH","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","id","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","trailing","createCompounder","words","deburr","createCtor","arguments","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","newHolders","createRecurry","fn","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrLength","arrStacked","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","oldArray","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","count","lastCalled","stamp","remaining","rand","memoize","memoizeCapped","charCodeAt","quote","subString","clone","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","before","bindKey","WRAP_BIND_FLAG","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","next","done","iteratorToArray","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","toPairs","toPairsIn","camelCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","method","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","castArray","chunk","compact","concat","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","reject","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","target","position","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqualWith","isMatch","isMatchWith","isNaN","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","define"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,I,uPClFrD,IAAIC,EAGJA,EAAK,WACJ,OAAOC,KADH,GAIL,IAECD,EAAIA,GAAK,IAAIE,SAAS,cAAb,GACR,MAAOC,GAEc,gCAAXC,OAAM,cAANA,WAAqBJ,EAAII,QAOrCrC,EAAOD,QAAUkC,G,+BCnBJ,qOAEbjC,EAAOD,QAAU,SAAUuC,GACA,mBAAZA,EACPA,IAC0B,WAAnB,EAAOA,IACd3B,OAAO4B,KAAKD,GAASE,SAAQ,SAAUhB,GACP,mBAAjBc,EAAQd,IACfc,EAAQd,U,gCCRxB,YAGA,yvCAoBA,SAASiB,EAAcC,GAOnB,IANA,IACIC,EACAC,EACAC,EAHAC,EAAMJ,EAAIK,MAAM,KAIhBC,EAAS,GAEJ/C,EAAI6C,EAAIG,OAAS,EAAGhD,GAAK,EAAGA,IAC7B6C,EAAI7C,GAAGgD,SAEPL,GADAD,EAAIG,EAAI7C,GAAG8C,MAAM,MACX,GACNF,EAAI,GACAF,EAAEM,OAAS,IACXJ,EAAIF,EAAE,IAEVK,EAAOJ,GAAKC,GAIpB,OAAOG,EAyEX,SAASE,EAAoBC,GACzB,IAAIC,EACJ,GAAKD,EAGE,CAEH,IAAIE,EAAaF,EAAIG,QAAQ,KAAO,EAChCC,EAAWJ,EAAIG,QAAQ,KAC3BC,EAAWA,GAAYF,EAAaE,EAAWJ,EAAIF,OAInDG,EAASD,EAAIK,UAAUH,EAAYE,GAChB,IAAfF,IAA6C,IAAzBD,EAAOE,QAAQ,OAGnCF,EAAS,SAbbA,EAASK,SAASL,OAAOI,UAAU,GAiBvC,IAAIE,EAAS,GACTN,GACYA,EAAOL,MAAM,KACnBP,SAAQ,SAAUmB,GACpB,IAAIC,EAAUD,EAAKZ,MAAM,KACzBW,EAAOE,EAAQ,IAAMC,mBAAmBD,EAAQ,IAAM,OAI9D,OAAOE,KAAKC,MAAMD,KAAKE,UAAUN,IASrC,SAASO,EAAoBC,EAAKC,GAC9B,IAAIhB,EAAMgB,GAAa,GACnBC,EAAO,GACPC,EAAO,GACX,GAAIlB,EAAK,CACL,IAEImB,EAFAC,EAAUpB,EAAIG,QAAQ,KACtBkB,EAAYrB,EAAIG,QAAQ,KAExBkB,GAAa,IACbF,EAAQE,EACRH,EAAOlB,EAAIK,UAAUgB,IAErBD,GAAW,IACXD,EAAQC,GAEZH,EAAOjB,EAAIK,UAAU,EAAGc,GAE5B,OAAOF,EAAO,IAAMK,EAAEC,MAAMR,GAAOG,EA4CvC,SAASM,EAAiBC,EAAYT,GAClC,IAAIhB,EAAM,IAAI0B,IAAIV,GAElB,OADAhB,EAAI2B,aAAaC,OAAOH,GACjBzB,EA8KX,SAAS6B,EAAWC,EAAKC,GACrB,IAAIC,EAASC,SAASC,cAAc,UACpCF,EAAOG,KAAO,kBACdH,EAAOF,IAAMA,EACbG,SAASG,qBAAqB,QAAQ,GAAGC,YAAYL,GAEjDD,IACAC,EAAOM,OAASP,GASxB,SAASQ,EAAsBT,EAAKC,GACJ,aAAxBE,SAASO,WACTX,EAAWC,EAAKC,GAEhB7C,OAAOuD,iBAAiB,QAAQ,WAC5BZ,EAAWC,EAAKC,MAiE5B,SAASW,EAAQC,EAAMC,EAAKC,EAAUxE,GAClC,IAAIyE,EAAUF,EAERG,EAAO,EAAIH,EAAM,EAEjBI,EAAQ,EAAIJ,EAAM,EAaxB,GAVIG,EAAOF,GAAYF,EAAKI,GAAM1E,GAAOsE,EAAKG,GAASzE,KACnDyE,EAAUC,GAIVC,EAAQH,GAAYF,EAAKK,GAAO3E,GAAOsE,EAAKG,GAASzE,KACrDyE,EAAUE,GAIVF,IAAYF,EAAK,CAEjB,MAC6B,CAACD,EAAKG,GAAUH,EAAKC,IAAjDD,EAAKC,GAAI,KAAED,EAAKG,GAAQ,KAEzBJ,EAAQC,EAAMG,EAASD,EAAUxE,IA/CzC4E,EAAOC,SAAWD,EAAOC,UAAY,GACrCD,EAAOC,SAASX,sBAAwBA,EAgHxC1F,EAAOD,QAAU,CACbuG,iBA9iBJ,SAA0BnD,EAAK3C,EAAMU,GACjC,IAAIZ,EAAI,IAIR,OAHwB,IAApB6C,EAAIG,QAAQhD,KACZA,EAAI,KAED6C,EAAM7C,EAAIE,EAAO,IAAM+F,mBAAmBrF,IA0iBjDuB,cAAeA,EACf+D,iBAxgBJ,SAA0BrD,GACtB,IAAIsD,EAAMtD,EAAIJ,MAAM,KAChBK,EAAS,GACTsD,EAAa,GACbC,GAAW,EAEf,GAAIF,EAAIxD,OAAS,EAAG,CAChB,IAAI2D,EAAUH,EAAI,GAAG1D,MAAM,KAC3BK,EAASwD,EAAQ,GAEbA,EAAQ3D,OAAS,IACjB0D,GAAW,EACXD,EAAaE,EAAQ,IAI7B,IAAI5D,EAAS,GAIb,GAHII,EAAOH,SACPD,EAASP,EAAcW,IAEvBuD,GACID,EAAWzD,OAAQ,CACnB,IAAI4D,EAAUpE,EAAciE,GAC5B/F,OAAO4B,KAAKsE,GAASrE,SAAQ,SAAUsE,GACnC9D,EAAO8D,GAAQD,EAAQC,MAKnC,OAAO9D,GA4eP+D,eAjeJ,SAAwB5D,EAAKuB,EAAOsC,GAChC,IAAIC,EAAmB,GACnBC,EAAY/D,EAAIJ,MAAM,KACtBoE,EAAUD,EAAU,GACpBE,EAAgBF,EAAU,GAC1BG,EAAO,GACX,GAAID,EAAe,CACfF,EAAYE,EAAcrE,MAAM,KAChC,IAAK,IAAI9C,EAAI,EAAGA,EAAIiH,EAAUjE,OAAQhD,IAC9BiH,EAAUjH,GAAG8C,MAAM,KAAK,KAAO2B,IAC/BuC,GAAoBI,EAAOH,EAAUjH,GACrCoH,EAAO,KAMnB,OAAOF,EAAU,IAAMF,GADRI,EAAO,GAAK3C,EAAQ,IAAMsC,IAkdzCM,kBAhVJ,SAA2BC,EAAIC,GAM3B,OALgB/C,EAAEgD,IAAIF,GAClB,SAAU1E,GACN,OAAO4B,EAAEiD,QAAQ7E,EAAG2E,GAAM,EAAI,KAAO3E,MA8U7C8E,kBA1TJ,WAAuD,IAA5BC,EAAU,UAAH,6CAAG,GAAIC,EAAU,UAAH,6CAAG,GAEzCC,EAAW,CACbC,MAAO,GACPC,cAAc,EACdC,sBAAsB,EACtBC,eAAgB,WAChBC,cAAe,wBACfC,cAAe,GACfC,QAAS,GACTC,QAAS,IAKPC,EAAW9D,EAAE+D,OAAO,GAAIV,EAAUD,GAGlCY,EAAiB,GACvB,CAAC,WAAY,WAAY,QAAS,QAAQjG,SAAQ,SAAAkC,QACtBgE,IAApBH,EAAS7D,IACT+D,EAAeE,KAAK,QAAD,OAASjE,EAAK,aAAK6D,EAAS7D,GAAM,SAI7D,IAAIkE,EAAS,6BACTL,EAASR,QACTa,GAAU,4BAAJ,OAAgCL,EAASR,MAAK,WAEpDQ,EAASP,eACTY,GAAU,0IAEdA,GAAU,SAEV,IAAIC,EAAc,GACdN,EAASF,UACTQ,EAAc,OAAH,OAAUN,EAASF,QAAO,MAGzC,IAEgC,EAF5BS,EAAS,GACTC,EAAa,GAAG,IACJR,EAASD,SAAO,IAAhC,IAAK,EAAL,qBAAkC,KAAzBU,EAAG,QACRD,GAAcC,GACjB,8BACGD,IACAD,EAAS,6BAAH,OAAgCC,EAAU,WAKpD,IAAME,EAAO,0BAAH,OAA6BV,EAASH,cAAa,aAAKS,EAAW,qBACvEJ,EAAeS,KAAK,KAAI,sDACUX,EAASN,qBAAyC,GAAlB,gBAAoB,mDACzDM,EAASJ,cAAa,YAAII,EAASL,eAAc,gFAElEU,EAAM,mFAEFhB,EAAO,6DAEXkB,EAAM,gEAKxB,OAAOG,GA2PP/F,oBAAqBA,EACrBe,oBAAqBA,EACrBU,iBAAkBA,EAClBwE,+BAhWJ,SAAwCvE,GACpC,IAAIzB,EAAMwB,EAAiBC,EAAYvC,OAAOoB,SAAS2F,MACvDC,QAAQC,aAAa,KAAM,GAAInG,IA+V/BoG,eAzPJ,SAAwBC,GACpB,IACIP,EAAO,yBADDO,GAAe,IACkB,WAC3C/E,EAAE,QAAQgF,OAAOR,IAuPjBS,eAhPJ,SAAwBF,GACpB,IAAIG,EAAW,aAAeH,EAAc,IAAMA,EAAc,IAChE/E,EAAE,QAAQmF,KAAKD,GAAUE,UA+OzBC,eA/YJ,SAAwB3G,EAAK3C,EAAMuJ,GAC/B,IAAIC,EAAK9G,EAAoBC,GAE7B,OADA6G,EAAGxJ,GAAQ+F,mBAAmBwD,GACvB9F,EAAoB+F,EAAI7G,IA6Y/B8G,WApYJ,SAAoB9G,EAAKe,GACrB,IAAI8F,EAAK9G,EAAoBC,GAE7B,OAAOc,EADQQ,EAAE+D,OAAO,GAAIwB,EAAI9F,GACKf,IAkYrC+G,iBAzXJ,SAA0BH,GACtB,OAAOlG,mBAAmBkG,EAAII,QAAQ,MAAO,OAyX7CC,kBAzOJ,SAA2BC,EAAIC,GAM3B,IALA,IAAIC,EAAMF,EAAGG,UACTtE,EAAOmE,EAAGI,WACVC,EAAQL,EAAGM,YACXC,EAASP,EAAGQ,aAETR,EAAGS,cAENP,IADAF,EAAKA,EAAGS,cACEN,UACVtE,GAAQmE,EAAGI,WAOf,YAJ2B,IAAhBH,IACPC,GAAOD,GAGgB,OAAvBjI,OAAO0I,YAEHR,EAAOlI,OAAO2I,YAAc3I,OAAO4I,aACnC/E,EAAQ7D,OAAO0I,YAAc1I,OAAO6I,YACnCX,EAAMK,EAAUvI,OAAO2I,aACvB9E,EAAOwE,EAASrI,OAAO0I,YAIJ,eAAxB3F,SAAS+F,aAELZ,EAAOlI,OAAO+C,SAASgG,gBAAgBC,UAAYhJ,OAAO+C,SAASgG,gBAAgBE,cACnFpF,EAAQ7D,OAAO+C,SAASgG,gBAAgBG,WAAalJ,OAAO+C,SAASgG,gBAAgBI,aACpFjB,EAAMK,EAAUvI,OAAO+C,SAASgG,gBAAgBC,WAChDnF,EAAOwE,EAASrI,OAAO+C,SAASgG,gBAAgBG,aA4MzD7F,sBAAuBA,EACvB+F,oBAhKJ,SAA6BC,EAAWhJ,GACpC,IAAIiJ,EAAQD,EACRE,EAAQD,EAAME,eACdC,EAAMH,EAAMI,aAGhBJ,EAAMzK,MAAQyK,EAAMzK,MAAMsC,UAAU,EAAGoI,GAASlJ,EAAMiJ,EAAMzK,MAAMsC,UAAUsI,GAE5EH,EAAME,eAAiBD,EAAQlJ,EAAIO,OACnC0I,EAAMI,aAAeJ,EAAME,gBAwJ3BG,kBAxHJ,SAA2BtJ,GACvB,OAAOA,EAAIyH,QAAQ,aAAa,SAAU8B,GACtC,OAAOA,EAAKC,OAAO,GAAGC,cAAgBF,EAAKG,MAAM,GAAGC,kBAuHxDC,gBAjJJ,SAAyBC,GACrB,IAAIC,EAAO,IAAIC,KACXC,EAAQF,EAAKG,WACbC,EAAUJ,EAAKK,aACfC,EAAOJ,GAAS,GAAK,KAAO,KAKhC,OAAOH,EAAe,MAHtBG,GADAA,GAAS,KACQ,IAEK,KADtBE,EAAUA,EAAU,GAAK,IAAMA,EAAUA,GACH,IAAME,IA0I5CC,aAtDJ,SAAsBjH,EAAMpE,EAAGF,GACvBsE,EAAK7C,OAASvB,IAEdA,EAAIoE,EAAK7C,QAGb,IAAM+J,EAAYlJ,KAAKC,MAAMD,KAAKE,UAAU8B,IACtCpC,EAAS,IAhCnB,SAAoBoC,EAAMtE,GAItB,IAHA,IAAMyL,EAAcnH,EAAK7C,OAGhB8C,EAAMmH,KAAKC,MAAMF,EAAc,GAAK,EAAGlH,GAAO,EAAGA,IACtDF,EAAQC,EAAMC,EAAKkH,EAAazL,GAGpC,IAAK,IAAIuE,EAAMkH,EAAc,EAAGlH,EAAM,EAAGA,IAAO,CAC5C,IAAIqH,EAAgBtH,EAAK,GAEzBA,EAAK,GAAKA,EAAKC,GAEfD,EAAKC,GAAOqH,EAEZvH,EAAQC,EAAM,EAAGC,EAAKvE,IAoB1B6L,CAAWL,EAAWxL,GAEtB,IAAK,IAAIvB,EAAI,EAAGA,EAAIyB,EAAGzB,IAEnByD,EAAOiF,KAAKqE,EAAUM,OAG1B,OAAO5J,GAsCP6J,UA9BJ,SAASA,EAAUC,EAAMC,GACrB,OAAQD,GAAQC,GAAwB,WAAhB,EAAOD,IAAqC,WAAhB,EAAOC,GACxD9M,OAAO4B,KAAKiL,GAAMvK,SAAWtC,OAAO4B,KAAKkL,GAAMxK,QAC9CtC,OAAO4B,KAAKiL,GAAME,QAAO,SAAUC,EAASnM,GACxC,OAAOmM,GAAWJ,EAAUC,EAAKhM,GAAMiM,EAAKjM,OAC7C,GAASgM,IAASC,M,kCCpjB7BzN,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAO4N,kBACX5N,EAAO6N,UAAY,aACnB7N,EAAO8N,MAAQ,GAEV9N,EAAO+N,WAAU/N,EAAO+N,SAAW,IACxCpN,OAAOC,eAAeZ,EAAQ,SAAU,CACvCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOE,KAGhBS,OAAOC,eAAeZ,EAAQ,KAAM,CACnCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOC,KAGhBD,EAAO4N,gBAAkB,GAEnB5N,I,kBCpBR,YACAA,EAAOD,QAAUiO,I,+CCCjB,IAAIC,EAAiBC,EAAQ,GAE7BzJ,EAAEW,UAAU+I,OAAM,WACdF,EAAeC,EAAQ,S,gCCLd,+hCACb,IAAIE,EAAOF,EAAQ,GACfG,EAAIH,EAAQ,IAKhB,SAASI,EAAeC,GACpB9J,EAAE,mDAAmDoF,SACrDpF,EAAE,cAAc+J,OAAOC,MAAMF,GAOjC,SAASG,EAAgBH,GACrB9J,EAAE,kCAAkCkK,QAAQ1F,KAAKsF,GAGrDvO,EAAOD,QAAU,CACb6O,aAAc,WACVnK,EAAE,aAAaoK,YAKnBC,SAAU,WACNrK,EAAE,uBAAuBsK,GAAG,QAAS,kBAAkB,SAAU3M,GAC7DA,EAAE4M,iBACF,IAAI7L,EAAMsB,EAAE,cAAcwK,KAAK,UAgB/B,OAfAxK,EAAEyK,UAAUtD,QAEZnH,EAAE0K,KAAK,CACHhM,IAAKA,EACLmC,KAAM,MACN8J,QAAS,SAAUb,GACfD,EAAeC,GACf9J,EAAEyK,UAAUG,QAEhBC,MAAO,SAAUC,GACTA,EAAIC,aAAaC,cACjBpN,OAAOoB,SAAS2F,KAAOmG,EAAIC,aAAaC,iBAI7C,MAGfC,aAAc,WACVjL,EAAE,kBAAkBsK,GAAG,SAAU,SAAUV,EAAEsB,UAAS,SAAUvN,GAC5DA,EAAE4M,iBACF,IAAIY,EAAUnL,EAAErC,EAAEyN,gBACdC,EAAcF,EAAQhG,KAAK,2BAA2BG,MAEb,IAD9B6F,EAAQhG,KAAK,yBAAyBG,MAClBhH,MAAM,KAAI,GAAxCgN,EAAM,KAAEC,EAAS,KAClB7M,EAAM,GAAH,OAAMsB,EAAE,kBAAkBwK,KAAK,UAAS,mBAAWc,EAAM,sBAAcC,GAsB9E,MArBoB,KAAhBF,IACA3M,GAAO,UAAJ,OAAc2M,IAGrBrL,EAAEyK,UAAUtD,QAEZnH,EAAE0K,KAAK,CACHhM,IAAKA,EACLmC,KAAM,MACN8J,QAAS,SAAUb,GACfG,EAAgBH,GAChB9J,EAAEyK,UAAUG,QAEhBC,MAAO,SAAUC,GACTA,EAAIC,aAAaC,cACjBpN,OAAOoB,SAAS2F,KAAOmG,EAAIC,aAAaC,aAE5ChL,EAAEyK,UAAUG,WAIb,IACR,OAEPY,gBAAiB,WACbxL,EAAE,uBAAuBsK,GAAG,QAAS,0BAA0B,SAAU3M,GACrEA,EAAE4M,iBACF,IAAI7L,EAAMsB,EAAE,sBAAsBwK,KAAK,UAiBvC,OAhBAxK,EAAEyK,UAAUtD,QAEZnH,EAAE0K,KAAK,CACHhM,IAAKA,EACLmC,KAAM,MACN8J,QAAS,SAAUb,GACfG,EAAgBH,GAChB9J,EAAEyK,UAAUG,QAEhBC,MAAO,SAAUC,GACTA,EAAIC,aAAaC,cACjBpN,OAAOoB,SAAS2F,KAAOmG,EAAIC,aAAaC,iBAK7C,MAGfS,QAAS,WACLzL,EAAE,uBAAuBsK,GAAG,QAAS,iBAAiB,SAAU3M,GAC5DA,EAAE4M,iBACF,IAAI7L,EAAMsB,EAAE,aAAawK,KAAK,UAgB9B,OAfAxK,EAAEyK,UAAUtD,QAEZnH,EAAE0K,KAAK,CACHhM,IAAKA,EACLmC,KAAM,MACN8J,QAAS,SAAUb,GACfG,EAAgBH,GAChB9J,EAAEyK,UAAUG,QAEhBC,MAAO,SAAUC,GACTA,EAAIC,aAAaC,cACjBpN,OAAOoB,SAAS2F,KAAOmG,EAAIC,aAAaC,iBAI7C,MAGfU,kBAAmB,WACf1L,EAAE,sBAAsBsK,GAAG,SAAS,WAChC,IACI3F,EADa3E,EAAEvC,MACG+M,KAAK,QAI3B,OAHI7F,IACA/G,OAAOoB,SAAW2F,IAEf,MAGfgH,eAAgB,WACZ3L,EAAE,uBAAuBsK,GAAG,QAAS,6BAA6B,SAAU3M,GAExE,GADAA,EAAE4M,iBACEvK,EAAEvC,MAAMmO,SAAS,YACjB,OAAO,EAEX,IAAIlN,EAAMsB,EAAEvC,MAAM+M,KAAK,QAgBvB,OAfAxK,EAAEyK,UAAUtD,QAEZnH,EAAE0K,KAAK,CACHhM,IAAKA,EACLmC,KAAM,MACN8J,QAAS,SAAUb,GACfG,EAAgBH,GAChB9J,EAAEyK,UAAUG,QAEhBC,MAAO,SAAUC,GACTA,EAAIC,aAAaC,cACjBpN,OAAOoB,SAAS2F,KAAOmG,EAAIC,aAAaC,iBAI7C,MAGfa,eAAgB,WAEZ7L,EAAEW,UAAU3D,KAAK,UAAU,WACvB,IAAI8O,EAAsB9L,EAAE,+DAExB+L,EAAUD,EAAoBtB,KAAK,iBAEvC,GAAmC,IAA/BsB,EAAoBtN,QAAgBmL,EAAKhE,kBAAkBmG,EAAoBzP,IAAI,GAAI,KAAM,CAI7FyP,EAAoBtB,KAAK,qBAAsB,WAC/CsB,EAAoBE,SAAS,2BAI7B,IAAIC,EAAyB,SAAUnC,GACnCgC,EAAoBI,YAAY,2BAChCJ,EAAoBtB,KAAK,qBAAsB,UAC/CX,EAAeC,IAGf,mBAAoBlM,QAAUuO,eAAe,gBAAkBJ,GAE/DE,EAAuBE,eAAe,gBAAkBJ,KAExD/L,EAAEyK,UAAUtD,QACZnH,EAAE0K,KAAK,CACH7J,KAAM,MACNnC,IAAKqN,EACLpB,QAAS,SAAUb,GAEf,IACIqC,eAAe,gBAAkBJ,GAAWjC,EAC9C,MAAOnM,IAKTsO,EAAuBnC,IAE3BsC,SAAU,WACNpM,EAAEyK,UAAUG,QAEhBC,MAAO,WACH7K,EAAEyK,UAAUG,gBAOpCyB,SAAU,WACN,IAAMC,EAAyBtM,EAAE,gCAC3BuM,EAA0BvM,EAAE,kCAG7BwM,UAAUC,MAKXH,EAAuBhC,GAAG,SAAS,SAAU3M,GACzCA,EAAE4M,iBACFiC,UAAUC,MAAM,CACZnJ,MAAOgJ,EAAuB9B,KAAK,cACnC9L,IAAK4N,EAAuB9B,KAAK,qBAClCkC,MAAM9O,OAAO+O,QAAQ9B,WAR5ByB,EAAuBN,SAAS,UAChCO,EAAwBL,YAAY,YAW5CU,cAAe,WAENJ,UAAUK,UAIX7M,EAAE,2CAA2CsK,GAAG,SAAS,SAAU3M,GAC/DA,EAAE4M,iBACF,IAAMuC,EAAW9M,EAAEvC,MAGnB+O,UAAUK,UAAUE,UAAUD,EAASE,KAAK,eAG5ChN,EAAEiN,MAAM,CACJ9J,QAAS2J,EAASE,KAAK,gBACvBE,MAAO,UACPC,WAAY,IACZC,aAAa,OAdrBpN,EAAE,iCAAiCgM,SAAS,a;;;;;;;;ICpOtD,WAGA,IAUIqB,EAAkB,sBAUlBC,EAAc,yBAgDdC,EAAY,CACd,CAAC,MA9BiB,KA+BlB,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAtCqB,IAuCtB,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBC,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBAGZC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBAEXC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBC,OAAOH,EAAcI,QACxCC,EAAqBF,OAAOF,EAAgBG,QAG5CE,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,EAAgB,QAChBC,EAAa,mGAMbC,EAAe,sBACfC,EAAkBV,OAAOS,EAAaR,QAGtCU,EAAc,OAGdC,EAAe,KAGfC,EAAgB,4CAChBC,EAAgB,oCAChBC,EAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAOpBC,GAAeC,gDASfC,GAAeC,8OAIfC,GAAW,oBACXC,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMN,GAAe,IAC/BO,GAAW,OACXC,GAAY,oBACZC,GAAU,8BACVC,GAAS,oBAAuBR,GAAeK,GAAtC,qEACTI,GAAS,2BAETC,GAAc,qBACdC,GAAa,kCACbC,GAAa,qCACbC,GAAU,8BAIVC,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAG/CQ,GAZa,MAAQZ,GAAU,IAAMK,GAAS,IAYtB,IAKxBQ,GAJW,oBAIQD,IAHP,gBAAwB,CAACN,GAAaC,GAAYC,IAAYzN,KAAK,KAAnE,qBAA2F6N,GAAW,MAIlHE,GAAU,MAAQ,CAACZ,GAAWK,GAAYC,IAAYzN,KAAK,KAAO,IAAM8N,GACxEE,GAAW,MAAQ,CAACT,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAU/M,KAAK,KAAO,IAGxGiO,GAASnD,OA/BA,OA+Be,KAMxBoD,GAAcpD,OAAOmC,GAAS,KAG9BkB,GAAYrD,OAAOwC,GAAS,MAAQA,GAAS,KAAOU,GAAWF,GAAO,KAGtEM,GAAgBtD,OAAO,CACzB4C,GAAU,IAAMN,GAAhBM,oCAA0D,CAACV,GAASU,GAAS,KAAK1N,KAAK,KAAO,IAC9F4N,uCAA8C,CAACZ,GAASU,GAAUC,GAAa,KAAK3N,KAAK,KAAO,IAChG0N,GAAU,IAAMC,GAAhBD,iCACAA,oCAtBe,mDADA,mDA0BfR,GACAa,IACA/N,KAAK,KAAM,KAGTqO,GAAevD,OAAO,0BAA+B6B,GAA/B,mBAGtB2B,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,GAAezE,GAAcyE,GAAexE,GAC5CwE,GAAevE,GAAWuE,GAAetE,GACzCsE,GAAerE,GAAYqE,GAAepE,GAC1CoE,GA5LsB,8BA4LYA,GAAenE,GACjDmE,GAAelE,IAAa,EAC5BkE,GAAe1F,GAAW0F,GAAezF,GACzCyF,GAAe3E,GAAkB2E,GAAexF,GAChDwF,GAAe1E,GAAe0E,GAAevF,GAC7CuF,GAAetF,GAAYsF,GAAerF,GAC1CqF,GAAenF,GAAUmF,GAAelF,GACxCkF,GAAejF,GAAaiF,GAAehF,GAC3CgF,GAAe/E,GAAU+E,GAAe9E,GACxC8E,GAAe5E,IAAc,EAG7B,IAAI6E,GAAgB,GACpBA,GAAc3F,GAAW2F,GAAc1F,GACvC0F,GAAc5E,GAAkB4E,GAAc3E,GAC9C2E,GAAczF,GAAWyF,GAAcxF,GACvCwF,GAAc1E,GAAc0E,GAAczE,GAC1CyE,GAAcxE,GAAWwE,GAAcvE,GACvCuE,GAActE,GAAYsE,GAAcpF,GACxCoF,GAAcnF,GAAamF,GAAclF,GACzCkF,GAAcjF,GAAaiF,GAAchF,GACzCgF,GAAc/E,GAAa+E,GAAc9E,GACzC8E,GAAcrE,GAAYqE,GAlNJ,8BAmNtBA,GAAcpE,GAAaoE,GAAcnE,IAAa,EACtDmE,GAAcvF,GAAYuF,GAActF,GACxCsF,GAAc7E,IAAc,EAG5B,IA4EI8E,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAeC,SAGfC,GAA8B,gBAAJ,IAAN9R,EAAM,cAANA,KAAsBA,GAAUA,EAAOzF,SAAWA,QAAUyF,EAGhF+R,GAA0B,WAAJ,oBAAJC,KAAI,cAAJA,QAAoBA,MAAQA,KAAKzX,SAAWA,QAAUyX,KAGxEC,GAAOH,IAAcC,IAAYhW,SAAS,cAATA,GAGjCmW,GAAgC,UAAJ,EAAPvY,IAAuBA,IAAYA,EAAQwY,UAAYxY,EAG5EyY,GAAaF,IAAgC,UAAJ,EAANtY,IAAsBA,IAAWA,EAAOuY,UAAYvY,EAGvFyY,GAAgBD,IAAcA,GAAWzY,UAAYuY,GAGrDI,GAAcD,IAAiBP,GAAWS,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWtK,SAAWsK,GAAWtK,QAAQ,QAAQ2K,MAE3E,OAAIA,GAKGH,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,QACjE,MAAO1W,KAXK,GAeZ2W,GAAoBH,IAAYA,GAASI,cACzCC,GAAaL,IAAYA,GAASM,OAClCC,GAAYP,IAAYA,GAASQ,MACjCC,GAAeT,IAAYA,GAASU,SACpCC,GAAYX,IAAYA,GAASY,MACjCC,GAAmBb,IAAYA,GAASc,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAK7W,QACX,KAAK,EAAG,OAAO2W,EAAKxZ,KAAKyZ,GACzB,KAAK,EAAG,OAAOD,EAAKxZ,KAAKyZ,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKxZ,KAAKyZ,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKxZ,KAAKyZ,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASC,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAI7V,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,SAE9BqB,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GAClB2V,EAAOE,EAAajZ,EAAOgZ,EAAShZ,GAAQ8Y,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GAIxB,IAHA,IAAI5V,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,SAE9BqB,EAAQrB,IAC8B,IAAzCiX,EAASF,EAAM1V,GAAQA,EAAO0V,KAIpC,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAG7B,IAFA,IAAIjX,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OAEhCA,MAC0C,IAA3CiX,EAASF,EAAM/W,GAASA,EAAQ+W,KAItC,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GAIzB,IAHA,IAAIjW,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,SAE9BqB,EAAQrB,GACf,IAAKsX,EAAUP,EAAM1V,GAAQA,EAAO0V,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAM1B,IALA,IAAIjW,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACnCwX,EAAW,EACX/W,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdiW,EAAUrZ,EAAOoD,EAAO0V,KAC1BtW,EAAO+W,KAAcvZ,GAGzB,OAAOwC,EAYT,SAASgX,GAAcV,EAAO9Y,GAE5B,SADsB,MAAT8Y,EAAgB,EAAIA,EAAM/W,SACpB0X,GAAYX,EAAO9Y,EAAO,IAAM,EAYrD,SAAS0Z,GAAkBZ,EAAO9Y,EAAO2Z,GAIvC,IAHA,IAAIvW,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,SAE9BqB,EAAQrB,GACf,GAAI4X,EAAW3Z,EAAO8Y,EAAM1V,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASwW,GAASd,EAAOE,GAKvB,IAJA,IAAI5V,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACnCS,EAASqX,MAAM9X,KAEVqB,EAAQrB,GACfS,EAAOY,GAAS4V,EAASF,EAAM1V,GAAQA,EAAO0V,GAEhD,OAAOtW,EAWT,SAASsX,GAAUhB,EAAOiB,GAKxB,IAJA,IAAI3W,GAAS,EACTrB,EAASgY,EAAOhY,OAChBiY,EAASlB,EAAM/W,SAEVqB,EAAQrB,GACf+W,EAAMkB,EAAS5W,GAAS2W,EAAO3W,GAEjC,OAAO0V,EAeT,SAASmB,GAAYnB,EAAOE,EAAUC,EAAaiB,GACjD,IAAI9W,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OAKvC,IAHImY,GAAanY,IACfkX,EAAcH,IAAQ1V,MAEfA,EAAQrB,GACfkX,EAAcD,EAASC,EAAaH,EAAM1V,GAAQA,EAAO0V,GAE3D,OAAOG,EAeT,SAASkB,GAAiBrB,EAAOE,EAAUC,EAAaiB,GACtD,IAAInY,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OAIvC,IAHImY,GAAanY,IACfkX,EAAcH,IAAQ/W,IAEjBA,KACLkX,EAAcD,EAASC,EAAaH,EAAM/W,GAASA,EAAQ+W,GAE7D,OAAOG,EAaT,SAASmB,GAAUtB,EAAOO,GAIxB,IAHA,IAAIjW,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,SAE9BqB,EAAQrB,GACf,GAAIsX,EAAUP,EAAM1V,GAAQA,EAAO0V,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIuB,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYnB,EAAWoB,GAC1C,IAAIjY,EAOJ,OANAiY,EAASD,GAAY,SAASxa,EAAOM,EAAKka,GACxC,GAAInB,EAAUrZ,EAAOM,EAAKka,GAExB,OADAhY,EAASlC,GACF,KAGJkC,EAcT,SAASkY,GAAc5B,EAAOO,EAAWsB,EAAWC,GAIlD,IAHA,IAAI7Y,EAAS+W,EAAM/W,OACfqB,EAAQuX,GAAaC,EAAY,GAAK,GAElCA,EAAYxX,MAAYA,EAAQrB,GACtC,GAAIsX,EAAUP,EAAM1V,GAAQA,EAAO0V,GACjC,OAAO1V,EAGX,OAAQ,EAYV,SAASqW,GAAYX,EAAO9Y,EAAO2a,GACjC,OAAO3a,GAAUA,EAidnB,SAAuB8Y,EAAO9Y,EAAO2a,GACnC,IAAIvX,EAAQuX,EAAY,EACpB5Y,EAAS+W,EAAM/W,OAEnB,OAASqB,EAAQrB,GACf,GAAI+W,EAAM1V,KAAWpD,EACnB,OAAOoD,EAGX,OAAQ,EAzdJyX,CAAc/B,EAAO9Y,EAAO2a,GAC5BD,GAAc5B,EAAOgC,GAAWH,GAatC,SAASI,GAAgBjC,EAAO9Y,EAAO2a,EAAWhB,GAIhD,IAHA,IAAIvW,EAAQuX,EAAY,EACpB5Y,EAAS+W,EAAM/W,SAEVqB,EAAQrB,GACf,GAAI4X,EAAWb,EAAM1V,GAAQpD,GAC3B,OAAOoD,EAGX,OAAQ,EAUV,SAAS0X,GAAU9a,GACjB,OAAOA,GAAUA,EAYnB,SAASgb,GAASlC,EAAOE,GACvB,IAAIjX,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAOA,EAAUkZ,GAAQnC,EAAOE,GAAYjX,EA1yBpC,IAozBV,SAASuY,GAAaha,GACpB,OAAO,SAASG,GACd,OAAiB,MAAVA,OAl3BP+G,EAk3BoC/G,EAAOH,IAW/C,SAAS4a,GAAeza,GACtB,OAAO,SAASH,GACd,OAAiB,MAAVG,OA/3BP+G,EA+3BoC/G,EAAOH,IAiB/C,SAAS6a,GAAWX,EAAYxB,EAAUC,EAAaiB,EAAWO,GAMhE,OALAA,EAASD,GAAY,SAASxa,EAAOoD,EAAOoX,GAC1CvB,EAAciB,GACTA,GAAY,EAAOla,GACpBgZ,EAASC,EAAajZ,EAAOoD,EAAOoX,MAEnCvB,EAgCT,SAASgC,GAAQnC,EAAOE,GAKtB,IAJA,IAAIxW,EACAY,GAAS,EACTrB,EAAS+W,EAAM/W,SAEVqB,EAAQrB,GAAQ,CACvB,IAAIqZ,EAAUpC,EAASF,EAAM1V,SA57B7BoE,IA67BI4T,IACF5Y,OA97BFgF,IA87BWhF,EAAuB4Y,EAAW5Y,EAAS4Y,GAGxD,OAAO5Y,EAYT,SAAS6Y,GAAU7a,EAAGwY,GAIpB,IAHA,IAAI5V,GAAS,EACTZ,EAASqX,MAAMrZ,KAEV4C,EAAQ5C,GACfgC,EAAOY,GAAS4V,EAAS5V,GAE3B,OAAOZ,EAyBT,SAAS8Y,GAASC,GAChB,OAAOA,EACHA,EAAOrQ,MAAM,EAAGsQ,GAAgBD,GAAU,GAAGtS,QAAQwK,EAAa,IAClE8H,EAUN,SAASE,GAAU/C,GACjB,OAAO,SAAS1Y,GACd,OAAO0Y,EAAK1Y,IAchB,SAAS0b,GAAWjb,EAAQkb,GAC1B,OAAO/B,GAAS+B,GAAO,SAASrb,GAC9B,OAAOG,EAAOH,MAYlB,SAASsb,GAASC,EAAOvb,GACvB,OAAOub,EAAMC,IAAIxb,GAYnB,SAASyb,GAAgBC,EAAYC,GAInC,IAHA,IAAI7Y,GAAS,EACTrB,EAASia,EAAWja,SAEfqB,EAAQrB,GAAU0X,GAAYwC,EAAYD,EAAW5Y,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAAS8Y,GAAcF,EAAYC,GAGjC,IAFA,IAAI7Y,EAAQ4Y,EAAWja,OAEhBqB,KAAWqW,GAAYwC,EAAYD,EAAW5Y,GAAQ,IAAM,IACnE,OAAOA,EAWT,SAAS+Y,GAAarD,EAAOsD,GAI3B,IAHA,IAAIra,EAAS+W,EAAM/W,OACfS,EAAS,EAENT,KACD+W,EAAM/W,KAAYqa,KAClB5Z,EAGN,OAAOA,EAWT,IAAI6Z,GAAenB,GAjxBG,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,MAouBxBoB,GAAiBpB,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASqB,GAAiBC,GACxB,MAAO,KAAO7F,GAAc6F,GAsB9B,SAASC,GAAWlB,GAClB,OAAOlF,GAAaqG,KAAKnB,GAsC3B,SAASoB,GAAWpW,GAClB,IAAInD,GAAS,EACTZ,EAASqX,MAAMtT,EAAIqW,MAKvB,OAHArW,EAAIjF,SAAQ,SAAStB,EAAOM,GAC1BkC,IAASY,GAAS,CAAC9C,EAAKN,MAEnBwC,EAWT,SAASqa,GAAQnE,EAAMoE,GACrB,OAAO,SAASC,GACd,OAAOrE,EAAKoE,EAAUC,KAa1B,SAASC,GAAelE,EAAOsD,GAM7B,IALA,IAAIhZ,GAAS,EACTrB,EAAS+W,EAAM/W,OACfwX,EAAW,EACX/W,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdpD,IAAUoc,GAAepc,IAAU6Q,IACrCiI,EAAM1V,GAASyN,EACfrO,EAAO+W,KAAcnW,GAGzB,OAAOZ,EAUT,SAASya,GAAWC,GAClB,IAAI9Z,GAAS,EACTZ,EAASqX,MAAMqD,EAAIN,MAKvB,OAHAM,EAAI5b,SAAQ,SAAStB,GACnBwC,IAASY,GAASpD,KAEbwC,EAUT,SAAS2a,GAAWD,GAClB,IAAI9Z,GAAS,EACTZ,EAASqX,MAAMqD,EAAIN,MAKvB,OAHAM,EAAI5b,SAAQ,SAAStB,GACnBwC,IAASY,GAAS,CAACpD,EAAOA,MAErBwC,EAoDT,SAAS4a,GAAW7B,GAClB,OAAOkB,GAAWlB,GAiDpB,SAAqBA,GACnB,IAAI/Y,EAAS2T,GAAUkH,UAAY,EACnC,KAAOlH,GAAUuG,KAAKnB,MAClB/Y,EAEJ,OAAOA,EArDH8a,CAAY/B,GACZlB,GAAUkB,GAUhB,SAASgC,GAAchC,GACrB,OAAOkB,GAAWlB,GAmDpB,SAAwBA,GACtB,OAAOA,EAAOiC,MAAMrH,KAAc,GAnD9BsH,CAAelC,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAO1Z,MAAM,IA6kBhB6b,CAAanC,GAWnB,SAASC,GAAgBD,GAGvB,IAFA,IAAInY,EAAQmY,EAAOxZ,OAEZqB,KAAWsQ,EAAagJ,KAAKnB,EAAOvQ,OAAO5H,MAClD,OAAOA,EAUT,IAAIua,GAAmBzC,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MA4gCX,IAs3eI/N,GAt3egB,SAASyQ,EAAaC,GAIxC,IA6BMC,EA7BFjE,GAHJgE,EAAqB,MAAXA,EAAkB1G,GAAOhK,GAAEvG,SAASuQ,GAAK1X,SAAUoe,EAAS1Q,GAAE4Q,KAAK5G,GAAMZ,MAG/DsD,MAChBtO,EAAOsS,EAAQtS,KACfyS,EAAQH,EAAQG,MAChB/c,GAAW4c,EAAQ5c,SACnB+K,GAAO6R,EAAQ7R,KACfvM,GAASoe,EAAQpe,OACjBqT,GAAS+K,EAAQ/K,OACjBmL,GAASJ,EAAQI,OACjBC,GAAYL,EAAQK,UAGpBC,GAAatE,EAAMlZ,UACnByd,GAAYnd,GAASN,UACrB0d,GAAc5e,GAAOkB,UAGrB2d,GAAaT,EAAQ,sBAGrBU,GAAeH,GAAUI,SAGzB5d,GAAiByd,GAAYzd,eAG7B6d,GAAY,EAGZC,IACEZ,EAAM,SAASa,KAAKL,IAAcA,GAAWjd,MAAQid,GAAWjd,KAAKud,UAAY,KACvE,iBAAmBd,EAAO,GAQtCe,GAAuBR,GAAYG,SAGnCM,GAAmBP,GAAarf,KAAKO,IAGrCsf,GAAU5H,GAAKhK,EAGf6R,GAAalM,GAAO,IACtByL,GAAarf,KAAK0B,IAAgBqI,QAAQsK,EAAc,QACvDtK,QAAQ,yDAA0D,SAAW,KAI5EgW,GAAS1H,GAAgBsG,EAAQoB,YAr9CnCzX,EAs9CE1H,GAAS+d,EAAQ/d,OACjBof,GAAarB,EAAQqB,WACrBC,GAAcF,GAASA,GAAOE,iBAx9ChC3X,EAy9CE4X,GAAevC,GAAQpd,GAAO4f,eAAgB5f,IAC9C6f,GAAe7f,GAAOY,OACtBkf,GAAuBlB,GAAYkB,qBACnCC,GAASrB,GAAWqB,OACpBC,GAAmB3f,GAASA,GAAO4f,wBA79CrClY,EA89CEmY,GAAc7f,GAASA,GAAO8f,cA99ChCpY,EA+9CEqY,GAAiB/f,GAASA,GAAOC,iBA/9CnCyH,EAi+CE9H,GAAkB,WACpB,IACE,IAAIgZ,EAAOoH,GAAUrgB,GAAQ,kBAE7B,OADAiZ,EAAK,GAAI,GAAI,IACNA,EACP,MAAOxX,KALW,GASlB6e,GAAkBlC,EAAQmC,eAAiB7I,GAAK6I,cAAgBnC,EAAQmC,aACxEC,GAAS1U,GAAQA,EAAK2U,MAAQ/I,GAAK5L,KAAK2U,KAAO3U,EAAK2U,IACpDC,GAAgBtC,EAAQuC,aAAejJ,GAAKiJ,YAAcvC,EAAQuC,WAGlEC,GAAarU,GAAKsU,KAClBC,GAAcvU,GAAKC,MACnBuU,GAAmB/gB,GAAOghB,sBAC1BC,GAAiBzB,GAASA,GAAO0B,cAl/CnCnZ,EAm/CEoZ,GAAiB/C,EAAQgD,SACzBC,GAAa3C,GAAWnW,KACxB+Y,GAAalE,GAAQpd,GAAO4B,KAAM5B,IAClCuhB,GAAYhV,GAAKiV,IACjBC,GAAYlV,GAAKmV,IACjBC,GAAY7V,EAAK2U,IACjBmB,GAAiBxD,EAAQ9G,SACzBuK,GAAetV,GAAKuV,OACpBC,GAAgBrD,GAAWsD,QAG3BC,GAAW5B,GAAUjC,EAAS,YAC9B8D,GAAM7B,GAAUjC,EAAS,OACzB+D,GAAU9B,GAAUjC,EAAS,WAC7BgE,GAAM/B,GAAUjC,EAAS,OACzBiE,GAAUhC,GAAUjC,EAAS,WAC7BkE,GAAejC,GAAUrgB,GAAQ,UAGjCuiB,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc1iB,GAASA,GAAOa,eAnhDhC6G,EAohDEib,GAAgBD,GAAcA,GAAYE,aAphD5Clb,EAqhDEmb,GAAiBH,GAAcA,GAAYhE,cArhD7ChX,EA8oDF,SAASob,GAAO5iB,GACd,GAAI6iB,GAAa7iB,KAAW8iB,GAAQ9iB,MAAYA,aAAiB+iB,IAAc,CAC7E,GAAI/iB,aAAiBgjB,GACnB,OAAOhjB,EAET,GAAIY,GAAe1B,KAAKc,EAAO,eAC7B,OAAOijB,GAAajjB,GAGxB,OAAO,IAAIgjB,GAAchjB,GAW3B,IAAIkjB,GAAc,WAChB,SAASziB,KACT,OAAO,SAAS0iB,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAI7D,GACF,OAAOA,GAAa6D,GAEtB1iB,EAAOE,UAAYwiB,EACnB,IAAI3gB,EAAS,IAAI/B,EAEjB,OADAA,EAAOE,eA7qDT6G,EA8qDShF,GAZO,GAqBlB,SAAS6gB,MAWT,SAASL,GAAchjB,EAAOsjB,GAC5BtiB,KAAKuiB,YAAcvjB,EACnBgB,KAAKwiB,YAAc,GACnBxiB,KAAKyiB,YAAcH,EACnBtiB,KAAK0iB,UAAY,EACjB1iB,KAAK2iB,gBAvsDLnc,EAuxDF,SAASub,GAAY/iB,GACnBgB,KAAKuiB,YAAcvjB,EACnBgB,KAAKwiB,YAAc,GACnBxiB,KAAK4iB,QAAU,EACf5iB,KAAK6iB,cAAe,EACpB7iB,KAAK8iB,cAAgB,GACrB9iB,KAAK+iB,cA9tDc,WA+tDnB/iB,KAAKgjB,UAAY,GAgHnB,SAASC,GAAKC,GACZ,IAAI9gB,GAAS,EACTrB,EAAoB,MAAXmiB,EAAkB,EAAIA,EAAQniB,OAG3C,IADAf,KAAKmjB,UACI/gB,EAAQrB,GAAQ,CACvB,IAAIqiB,EAAQF,EAAQ9gB,GACpBpC,KAAKkc,IAAIkH,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUH,GACjB,IAAI9gB,GAAS,EACTrB,EAAoB,MAAXmiB,EAAkB,EAAIA,EAAQniB,OAG3C,IADAf,KAAKmjB,UACI/gB,EAAQrB,GAAQ,CACvB,IAAIqiB,EAAQF,EAAQ9gB,GACpBpC,KAAKkc,IAAIkH,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASJ,GAChB,IAAI9gB,GAAS,EACTrB,EAAoB,MAAXmiB,EAAkB,EAAIA,EAAQniB,OAG3C,IADAf,KAAKmjB,UACI/gB,EAAQrB,GAAQ,CACvB,IAAIqiB,EAAQF,EAAQ9gB,GACpBpC,KAAKkc,IAAIkH,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAASxK,GAChB,IAAI3W,GAAS,EACTrB,EAAmB,MAAVgY,EAAiB,EAAIA,EAAOhY,OAGzC,IADAf,KAAKwjB,SAAW,IAAIF,KACXlhB,EAAQrB,GACff,KAAKyjB,IAAI1K,EAAO3W,IA6CpB,SAASshB,GAAMR,GACb,IAAI3T,EAAOvP,KAAKwjB,SAAW,IAAIH,GAAUH,GACzCljB,KAAK4b,KAAOrM,EAAKqM,KAqGnB,SAAS+H,GAAc3kB,EAAO4kB,GAC5B,IAAIC,EAAQ/B,GAAQ9iB,GAChB8kB,GAASD,GAASE,GAAY/kB,GAC9BglB,GAAUH,IAAUC,GAASnE,GAAS3gB,GACtCilB,GAAUJ,IAAUC,IAAUE,GAAUxM,GAAaxY,GACrDklB,EAAcL,GAASC,GAASE,GAAUC,EAC1CziB,EAAS0iB,EAAc7J,GAAUrb,EAAM+B,OAAQkc,IAAU,GACzDlc,EAASS,EAAOT,OAEpB,IAAK,IAAIzB,KAAON,GACT4kB,IAAahkB,GAAe1B,KAAKc,EAAOM,IACvC4kB,IAEQ,UAAP5kB,GAEC0kB,IAAkB,UAAP1kB,GAA0B,UAAPA,IAE9B2kB,IAAkB,UAAP3kB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD6kB,GAAQ7kB,EAAKyB,KAElBS,EAAOiF,KAAKnH,GAGhB,OAAOkC,EAUT,SAAS4iB,GAAYtM,GACnB,IAAI/W,EAAS+W,EAAM/W,OACnB,OAAOA,EAAS+W,EAAMuM,GAAW,EAAGtjB,EAAS,SAj5E7CyF,EA45EF,SAAS8d,GAAgBxM,EAAOtY,GAC9B,OAAO+kB,GAAYC,GAAU1M,GAAQ2M,GAAUjlB,EAAG,EAAGsY,EAAM/W,SAU7D,SAAS2jB,GAAa5M,GACpB,OAAOyM,GAAYC,GAAU1M,IAY/B,SAAS6M,GAAiBllB,EAAQH,EAAKN,SAp7ErCwH,IAq7EKxH,IAAwB4lB,GAAGnlB,EAAOH,GAAMN,SAr7E7CwH,IAs7EKxH,KAAyBM,KAAOG,KACnColB,GAAgBplB,EAAQH,EAAKN,GAcjC,SAAS8lB,GAAYrlB,EAAQH,EAAKN,GAChC,IAAI+lB,EAAWtlB,EAAOH,GAChBM,GAAe1B,KAAKuB,EAAQH,IAAQslB,GAAGG,EAAU/lB,UAv8EvDwH,IAw8EKxH,GAAyBM,KAAOG,IACnColB,GAAgBplB,EAAQH,EAAKN,GAYjC,SAASgmB,GAAalN,EAAOxY,GAE3B,IADA,IAAIyB,EAAS+W,EAAM/W,OACZA,KACL,GAAI6jB,GAAG9M,EAAM/W,GAAQ,GAAIzB,GACvB,OAAOyB,EAGX,OAAQ,EAcV,SAASkkB,GAAezL,EAAYzB,EAAQC,EAAUC,GAIpD,OAHAiN,GAAS1L,GAAY,SAASxa,EAAOM,EAAKka,GACxCzB,EAAOE,EAAajZ,EAAOgZ,EAAShZ,GAAQwa,MAEvCvB,EAYT,SAASkN,GAAW1lB,EAAQsS,GAC1B,OAAOtS,GAAU2lB,GAAWrT,EAAQ1R,GAAK0R,GAAStS,GAyBpD,SAASolB,GAAgBplB,EAAQH,EAAKN,GACzB,aAAPM,GAAsBZ,GACxBA,GAAee,EAAQH,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASN,EACT,UAAY,IAGdS,EAAOH,GAAON,EAYlB,SAASqmB,GAAO5lB,EAAQmM,GAMtB,IALA,IAAIxJ,GAAS,EACTrB,EAAS6K,EAAM7K,OACfS,EAASqX,EAAM9X,GACfukB,EAAiB,MAAV7lB,IAEF2C,EAAQrB,GACfS,EAAOY,GAASkjB,OAhjFlB9e,EAgjFqC5H,GAAIa,EAAQmM,EAAMxJ,IAEvD,OAAOZ,EAYT,SAASijB,GAAUc,EAAQC,EAAOC,GAShC,OARIF,GAAWA,SA/jFf/e,IAgkFMif,IACFF,EAASA,GAAUE,EAAQF,EAASE,QAjkFxCjf,IAmkFMgf,IACFD,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAU1mB,EAAO2mB,EAASC,EAAYtmB,EAAKG,EAAQomB,GAC1D,IAAIrkB,EACAskB,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACFpkB,EAAS/B,EAASmmB,EAAW5mB,EAAOM,EAAKG,EAAQomB,GAASD,EAAW5mB,SAjmFvEwH,IAmmFIhF,EACF,OAAOA,EAET,IAAK4gB,GAASpjB,GACZ,OAAOA,EAET,IAAI6kB,EAAQ/B,GAAQ9iB,GACpB,GAAI6kB,GAEF,GADAriB,EA68GJ,SAAwBsW,GACtB,IAAI/W,EAAS+W,EAAM/W,OACfS,EAAS,IAAIsW,EAAMmO,YAAYllB,GAG/BA,GAA6B,iBAAZ+W,EAAM,IAAkBlY,GAAe1B,KAAK4Z,EAAO,WACtEtW,EAAOY,MAAQ0V,EAAM1V,MACrBZ,EAAOiI,MAAQqO,EAAMrO,OAEvB,OAAOjI,EAt9GI0kB,CAAelnB,IACnB8mB,EACH,OAAOtB,GAAUxlB,EAAOwC,OAErB,CACL,IAAI2kB,EAAMC,GAAOpnB,GACbqnB,EAASF,GAAO/V,GAAW+V,GAAO9V,EAEtC,GAAIsP,GAAS3gB,GACX,OAAOsnB,GAAYtnB,EAAO8mB,GAE5B,GAAIK,GAAO3V,GAAa2V,GAAOpW,GAAYsW,IAAW5mB,GAEpD,GADA+B,EAAUukB,GAAUM,EAAU,GAAKE,GAAgBvnB,IAC9C8mB,EACH,OAAOC,EA+nEf,SAAuBhU,EAAQtS,GAC7B,OAAO2lB,GAAWrT,EAAQyU,GAAazU,GAAStS,GA/nEtCgnB,CAAcznB,EAnH1B,SAAsBS,EAAQsS,GAC5B,OAAOtS,GAAU2lB,GAAWrT,EAAQ2U,GAAO3U,GAAStS,GAkHrBknB,CAAanlB,EAAQxC,IAknEtD,SAAqB+S,EAAQtS,GAC3B,OAAO2lB,GAAWrT,EAAQ6U,GAAW7U,GAAStS,GAlnEpConB,CAAY7nB,EAAOmmB,GAAW3jB,EAAQxC,QAEvC,CACL,IAAK0W,GAAcyQ,GACjB,OAAO1mB,EAAST,EAAQ,GAE1BwC,EA49GN,SAAwB/B,EAAQ0mB,EAAKL,GACnC,IAAIgB,EAAOrnB,EAAOwmB,YAClB,OAAQE,GACN,KAAKrV,EACH,OAAOiW,GAAiBtnB,GAE1B,KAAKwQ,EACL,KAAKC,EACH,OAAO,IAAI4W,GAAMrnB,GAEnB,KAAKsR,EACH,OA5nDN,SAAuBiW,EAAUlB,GAC/B,IAAImB,EAASnB,EAASiB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASf,YAAYgB,EAAQD,EAASE,WAAYF,EAASG,YA0nD3DC,CAAc3nB,EAAQqmB,GAE/B,KAAK9U,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,IA5/LC,6BA4/LqB,KAAKC,EAAW,KAAKC,EACxD,OAAO8V,GAAgB5nB,EAAQqmB,GAEjC,KAAKxV,EACH,OAAO,IAAIwW,EAEb,KAAKvW,EACL,KAAKI,EACH,OAAO,IAAImW,EAAKrnB,GAElB,KAAKgR,EACH,OA/nDN,SAAqB6W,GACnB,IAAI9lB,EAAS,IAAI8lB,EAAOrB,YAAYqB,EAAOvV,OAAQmB,GAAQyK,KAAK2J,IAEhE,OADA9lB,EAAO6a,UAAYiL,EAAOjL,UACnB7a,EA4nDI+lB,CAAY9nB,GAErB,KAAKiR,EACH,OAAO,IAAIoW,EAEb,KAAKlW,EACH,OAxnDe4W,EAwnDI/nB,EAvnDhBgiB,GAAgBhjB,GAAOgjB,GAAcvjB,KAAKspB,IAAW,GAD9D,IAAqBA,EAp4DNC,CAAezoB,EAAOmnB,EAAKL,IAIxCD,IAAUA,EAAQ,IAAInC,IACtB,IAAIgE,EAAU7B,EAAMjnB,IAAII,GACxB,GAAI0oB,EACF,OAAOA,EAET7B,EAAM3J,IAAIld,EAAOwC,GAEb8V,GAAMtY,GACRA,EAAMsB,SAAQ,SAASqnB,GACrBnmB,EAAOiiB,IAAIiC,GAAUiC,EAAUhC,EAASC,EAAY+B,EAAU3oB,EAAO6mB,OAE9D3O,GAAMlY,IACfA,EAAMsB,SAAQ,SAASqnB,EAAUroB,GAC/BkC,EAAO0a,IAAI5c,EAAKomB,GAAUiC,EAAUhC,EAASC,EAAYtmB,EAAKN,EAAO6mB,OAIzE,IAIIlL,EAAQkJ,OA1pFZrd,GAspFewf,EACVD,EAAS6B,GAAeC,GACxB9B,EAASW,GAASrmB,IAEkBrB,GASzC,OARAkZ,GAAUyC,GAAS3b,GAAO,SAAS2oB,EAAUroB,GACvCqb,IAEFgN,EAAW3oB,EADXM,EAAMqoB,IAIR7C,GAAYtjB,EAAQlC,EAAKomB,GAAUiC,EAAUhC,EAASC,EAAYtmB,EAAKN,EAAO6mB,OAEzErkB,EAyBT,SAASsmB,GAAeroB,EAAQsS,EAAQ4I,GACtC,IAAI5Z,EAAS4Z,EAAM5Z,OACnB,GAAc,MAAVtB,EACF,OAAQsB,EAGV,IADAtB,EAAShB,GAAOgB,GACTsB,KAAU,CACf,IAAIzB,EAAMqb,EAAM5Z,GACZsX,EAAYtG,EAAOzS,GACnBN,EAAQS,EAAOH,GAEnB,QAvsFFkH,IAusFOxH,KAAyBM,KAAOG,KAAa4Y,EAAUrZ,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS+oB,GAAUrQ,EAAMsQ,EAAMpQ,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAIwF,GAAUtN,GAEtB,OAAOwP,IAAW,WAAa1H,EAAKD,WA5tFpCjR,EA4tFqDoR,KAAUoQ,GAcjE,SAASC,GAAenQ,EAAOiB,EAAQf,EAAUW,GAC/C,IAAIvW,GAAS,EACT8lB,EAAW1P,GACX2P,GAAW,EACXpnB,EAAS+W,EAAM/W,OACfS,EAAS,GACT4mB,EAAerP,EAAOhY,OAE1B,IAAKA,EACH,OAAOS,EAELwW,IACFe,EAASH,GAASG,EAAQ0B,GAAUzC,KAElCW,GACFuP,EAAWxP,GACXyP,GAAW,GAEJpP,EAAOhY,QAtvFG,MAuvFjBmnB,EAAWtN,GACXuN,GAAW,EACXpP,EAAS,IAAIwK,GAASxK,IAExBsP,EACA,OAASjmB,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdkmB,EAAuB,MAAZtQ,EAAmBhZ,EAAQgZ,EAAShZ,GAGnD,GADAA,EAAS2Z,GAAwB,IAAV3Z,EAAeA,EAAQ,EAC1CmpB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIxP,EAAOwP,KAAiBD,EAC1B,SAASD,EAGb7mB,EAAOiF,KAAKzH,QAEJkpB,EAASnP,EAAQuP,EAAU3P,IACnCnX,EAAOiF,KAAKzH,GAGhB,OAAOwC,EAjkCTogB,GAAO4G,iBAAmB,CAQxB,OAAUvW,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAKyP,KAKTA,GAAOjiB,UAAY0iB,GAAW1iB,UAC9BiiB,GAAOjiB,UAAUsmB,YAAcrE,GAE/BI,GAAcriB,UAAYuiB,GAAWG,GAAW1iB,WAChDqiB,GAAcriB,UAAUsmB,YAAcjE,GAsHtCD,GAAYpiB,UAAYuiB,GAAWG,GAAW1iB,WAC9CoiB,GAAYpiB,UAAUsmB,YAAclE,GAoGpCkB,GAAKtjB,UAAUwjB,MAvEf,WACEnjB,KAAKwjB,SAAWzC,GAAeA,GAAa,MAAQ,GACpD/gB,KAAK4b,KAAO,GAsEdqH,GAAKtjB,UAAkB,OAzDvB,SAAoBL,GAClB,IAAIkC,EAASxB,KAAK8a,IAAIxb,WAAeU,KAAKwjB,SAASlkB,GAEnD,OADAU,KAAK4b,MAAQpa,EAAS,EAAI,EACnBA,GAuDTyhB,GAAKtjB,UAAUf,IA3Cf,SAAiBU,GACf,IAAIiQ,EAAOvP,KAAKwjB,SAChB,GAAIzC,GAAc,CAChB,IAAIvf,EAAS+N,EAAKjQ,GAClB,MAp7De,8BAo7DRkC,OAl8DTgF,EAk8DiDhF,EAEjD,OAAO5B,GAAe1B,KAAKqR,EAAMjQ,GAAOiQ,EAAKjQ,QAp8D7CkH,GA0+DFyc,GAAKtjB,UAAUmb,IA1Bf,SAAiBxb,GACf,IAAIiQ,EAAOvP,KAAKwjB,SAChB,OAAOzC,QAl9DPva,IAk9DuB+I,EAAKjQ,GAAsBM,GAAe1B,KAAKqR,EAAMjQ,IAyB9E2jB,GAAKtjB,UAAUuc,IAZf,SAAiB5c,EAAKN,GACpB,IAAIuQ,EAAOvP,KAAKwjB,SAGhB,OAFAxjB,KAAK4b,MAAQ5b,KAAK8a,IAAIxb,GAAO,EAAI,EACjCiQ,EAAKjQ,GAAQyhB,SAl+Dbva,IAk+D6BxH,EAp9DZ,4BAo9DoDA,EAC9DgB,MAyHTqjB,GAAU1jB,UAAUwjB,MApFpB,WACEnjB,KAAKwjB,SAAW,GAChBxjB,KAAK4b,KAAO,GAmFdyH,GAAU1jB,UAAkB,OAvE5B,SAAyBL,GACvB,IAAIiQ,EAAOvP,KAAKwjB,SACZphB,EAAQ4iB,GAAazV,EAAMjQ,GAE/B,QAAI8C,EAAQ,KAIRA,GADYmN,EAAKxO,OAAS,EAE5BwO,EAAKnE,MAELoT,GAAOtgB,KAAKqR,EAAMnN,EAAO,KAEzBpC,KAAK4b,MACA,IA0DTyH,GAAU1jB,UAAUf,IA9CpB,SAAsBU,GACpB,IAAIiQ,EAAOvP,KAAKwjB,SACZphB,EAAQ4iB,GAAazV,EAAMjQ,GAE/B,OAAO8C,EAAQ,OApjEfoE,EAojE+B+I,EAAKnN,GAAO,IA2C7CihB,GAAU1jB,UAAUmb,IA/BpB,SAAsBxb,GACpB,OAAO0lB,GAAahlB,KAAKwjB,SAAUlkB,IAAQ,GA+B7C+jB,GAAU1jB,UAAUuc,IAlBpB,SAAsB5c,EAAKN,GACzB,IAAIuQ,EAAOvP,KAAKwjB,SACZphB,EAAQ4iB,GAAazV,EAAMjQ,GAQ/B,OANI8C,EAAQ,KACRpC,KAAK4b,KACPrM,EAAK9I,KAAK,CAACnH,EAAKN,KAEhBuQ,EAAKnN,GAAO,GAAKpD,EAEZgB,MA2GTsjB,GAAS3jB,UAAUwjB,MAtEnB,WACEnjB,KAAK4b,KAAO,EACZ5b,KAAKwjB,SAAW,CACd,KAAQ,IAAIP,GACZ,IAAO,IAAKtC,IAAO0C,IACnB,OAAU,IAAIJ,KAkElBK,GAAS3jB,UAAkB,OArD3B,SAAwBL,GACtB,IAAIkC,EAASinB,GAAWzoB,KAAMV,GAAa,OAAEA,GAE7C,OADAU,KAAK4b,MAAQpa,EAAS,EAAI,EACnBA,GAmDT8hB,GAAS3jB,UAAUf,IAvCnB,SAAqBU,GACnB,OAAOmpB,GAAWzoB,KAAMV,GAAKV,IAAIU,IAuCnCgkB,GAAS3jB,UAAUmb,IA3BnB,SAAqBxb,GACnB,OAAOmpB,GAAWzoB,KAAMV,GAAKwb,IAAIxb,IA2BnCgkB,GAAS3jB,UAAUuc,IAdnB,SAAqB5c,EAAKN,GACxB,IAAIuQ,EAAOkZ,GAAWzoB,KAAMV,GACxBsc,EAAOrM,EAAKqM,KAIhB,OAFArM,EAAK2M,IAAI5c,EAAKN,GACdgB,KAAK4b,MAAQrM,EAAKqM,MAAQA,EAAO,EAAI,EAC9B5b,MA2DTujB,GAAS5jB,UAAU8jB,IAAMF,GAAS5jB,UAAU8G,KAnB5C,SAAqBzH,GAEnB,OADAgB,KAAKwjB,SAAStH,IAAIld,EA1tED,6BA2tEVgB,MAkBTujB,GAAS5jB,UAAUmb,IANnB,SAAqB9b,GACnB,OAAOgB,KAAKwjB,SAAS1I,IAAI9b,IAuG3B0kB,GAAM/jB,UAAUwjB,MA3EhB,WACEnjB,KAAKwjB,SAAW,IAAIH,GACpBrjB,KAAK4b,KAAO,GA0Ed8H,GAAM/jB,UAAkB,OA9DxB,SAAqBL,GACnB,IAAIiQ,EAAOvP,KAAKwjB,SACZhiB,EAAS+N,EAAa,OAAEjQ,GAG5B,OADAU,KAAK4b,KAAOrM,EAAKqM,KACVpa,GA0DTkiB,GAAM/jB,UAAUf,IA9ChB,SAAkBU,GAChB,OAAOU,KAAKwjB,SAAS5kB,IAAIU,IA8C3BokB,GAAM/jB,UAAUmb,IAlChB,SAAkBxb,GAChB,OAAOU,KAAKwjB,SAAS1I,IAAIxb,IAkC3BokB,GAAM/jB,UAAUuc,IArBhB,SAAkB5c,EAAKN,GACrB,IAAIuQ,EAAOvP,KAAKwjB,SAChB,GAAIjU,aAAgB8T,GAAW,CAC7B,IAAIqF,EAAQnZ,EAAKiU,SACjB,IAAK7C,IAAQ+H,EAAM3nB,OAAS4nB,IAG1B,OAFAD,EAAMjiB,KAAK,CAACnH,EAAKN,IACjBgB,KAAK4b,OAASrM,EAAKqM,KACZ5b,KAETuP,EAAOvP,KAAKwjB,SAAW,IAAIF,GAASoF,GAItC,OAFAnZ,EAAK2M,IAAI5c,EAAKN,GACdgB,KAAK4b,KAAOrM,EAAKqM,KACV5b,MAscT,IAAIklB,GAAW0D,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUxP,EAAYnB,GAC7B,IAAI7W,GAAS,EAKb,OAJA0jB,GAAS1L,GAAY,SAASxa,EAAOoD,EAAOoX,GAE1C,OADAhY,IAAW6W,EAAUrZ,EAAOoD,EAAOoX,MAG9BhY,EAaT,SAASynB,GAAanR,EAAOE,EAAUW,GAIrC,IAHA,IAAIvW,GAAS,EACTrB,EAAS+W,EAAM/W,SAEVqB,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdgY,EAAUpC,EAAShZ,GAEvB,GAAe,MAAXob,SA/0FN5T,IA+0F0B8hB,EACflO,GAAYA,IAAY8O,GAAS9O,GAClCzB,EAAWyB,EAASkO,IAE1B,IAAIA,EAAWlO,EACX5Y,EAASxC,EAGjB,OAAOwC,EAuCT,SAAS2nB,GAAW3P,EAAYnB,GAC9B,IAAI7W,EAAS,GAMb,OALA0jB,GAAS1L,GAAY,SAASxa,EAAOoD,EAAOoX,GACtCnB,EAAUrZ,EAAOoD,EAAOoX,IAC1BhY,EAAOiF,KAAKzH,MAGTwC,EAcT,SAAS4nB,GAAYtR,EAAOuR,EAAOhR,EAAWiR,EAAU9nB,GACtD,IAAIY,GAAS,EACTrB,EAAS+W,EAAM/W,OAKnB,IAHAsX,IAAcA,EAAYkR,IAC1B/nB,IAAWA,EAAS,MAEXY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdinB,EAAQ,GAAKhR,EAAUrZ,GACrBqqB,EAAQ,EAEVD,GAAYpqB,EAAOqqB,EAAQ,EAAGhR,EAAWiR,EAAU9nB,GAEnDsX,GAAUtX,EAAQxC,GAEVsqB,IACV9nB,EAAOA,EAAOT,QAAU/B,GAG5B,OAAOwC,EAcT,IAAIgoB,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAWppB,EAAQuY,GAC1B,OAAOvY,GAAU+pB,GAAQ/pB,EAAQuY,EAAU3X,IAW7C,SAAS0oB,GAAgBtpB,EAAQuY,GAC/B,OAAOvY,GAAUiqB,GAAajqB,EAAQuY,EAAU3X,IAYlD,SAASspB,GAAclqB,EAAQkb,GAC7B,OAAOrC,GAAYqC,GAAO,SAASrb,GACjC,OAAOsqB,GAAWnqB,EAAOH,OAY7B,SAASuqB,GAAQpqB,EAAQyC,GAMvB,IAHA,IAAIE,EAAQ,EACRrB,GAHJmB,EAAO4nB,GAAS5nB,EAAMzC,IAGJsB,OAED,MAAVtB,GAAkB2C,EAAQrB,GAC/BtB,EAASA,EAAOsqB,GAAM7nB,EAAKE,OAE7B,OAAQA,GAASA,GAASrB,EAAUtB,OA3/FpC+G,EAygGF,SAASwjB,GAAevqB,EAAQwqB,EAAUC,GACxC,IAAI1oB,EAASyoB,EAASxqB,GACtB,OAAOqiB,GAAQriB,GAAU+B,EAASsX,GAAUtX,EAAQ0oB,EAAYzqB,IAUlE,SAAS0qB,GAAWnrB,GAClB,OAAa,MAATA,OAthGJwH,IAuhGSxH,EAn7FM,qBARL,gBA67FF6f,IAAkBA,MAAkBpgB,GAAOO,GA23FrD,SAAmBA,GACjB,IAAIorB,EAAQxqB,GAAe1B,KAAKc,EAAO6f,IACnCsH,EAAMnnB,EAAM6f,IAEhB,IACE7f,EAAM6f,SAz5LRrY,EA05LE,IAAI6jB,GAAW,EACf,MAAOnqB,IAET,IAAIsB,EAASqc,GAAqB3f,KAAKc,GACnCqrB,IACED,EACFprB,EAAM6f,IAAkBsH,SAEjBnnB,EAAM6f,KAGjB,OAAOrd,EA34FH8oB,CAAUtrB,GA+5GhB,SAAwBA,GACtB,OAAO6e,GAAqB3f,KAAKc,GA/5G7BurB,CAAevrB,GAYrB,SAASwrB,GAAOxrB,EAAOyrB,GACrB,OAAOzrB,EAAQyrB,EAWjB,SAASC,GAAQjrB,EAAQH,GACvB,OAAiB,MAAVG,GAAkBG,GAAe1B,KAAKuB,EAAQH,GAWvD,SAASqrB,GAAUlrB,EAAQH,GACzB,OAAiB,MAAVG,GAAkBH,KAAOb,GAAOgB,GA0BzC,SAASmrB,GAAiBC,EAAQ7S,EAAUW,GAS1C,IARA,IAAIuP,EAAWvP,EAAaD,GAAoBF,GAC5CzX,EAAS8pB,EAAO,GAAG9pB,OACnB+pB,EAAYD,EAAO9pB,OACnBgqB,EAAWD,EACXE,EAASnS,EAAMiS,GACfG,EAAYC,IACZ1pB,EAAS,GAENupB,KAAY,CACjB,IAAIjT,EAAQ+S,EAAOE,GACfA,GAAY/S,IACdF,EAAQc,GAASd,EAAO2C,GAAUzC,KAEpCiT,EAAY/K,GAAUpI,EAAM/W,OAAQkqB,GACpCD,EAAOD,IAAapS,IAAeX,GAAajX,GAAU,KAAO+W,EAAM/W,QAAU,KAC7E,IAAIwiB,GAASwH,GAAYjT,QA1mG/BtR,EA6mGAsR,EAAQ+S,EAAO,GAEf,IAAIzoB,GAAS,EACT+oB,EAAOH,EAAO,GAElB3C,EACA,OAASjmB,EAAQrB,GAAUS,EAAOT,OAASkqB,GAAW,CACpD,IAAIjsB,EAAQ8Y,EAAM1V,GACdkmB,EAAWtQ,EAAWA,EAAShZ,GAASA,EAG5C,GADAA,EAAS2Z,GAAwB,IAAV3Z,EAAeA,EAAQ,IACxCmsB,EACEvQ,GAASuQ,EAAM7C,GACfJ,EAAS1mB,EAAQ8mB,EAAU3P,IAC5B,CAEL,IADAoS,EAAWD,IACFC,GAAU,CACjB,IAAIlQ,EAAQmQ,EAAOD,GACnB,KAAMlQ,EACED,GAASC,EAAOyN,GAChBJ,EAAS2C,EAAOE,GAAWzC,EAAU3P,IAE3C,SAAS0P,EAGT8C,GACFA,EAAK1kB,KAAK6hB,GAEZ9mB,EAAOiF,KAAKzH,IAGhB,OAAOwC,EA+BT,SAAS4pB,GAAW3rB,EAAQyC,EAAM0V,GAGhC,IAAIF,EAAiB,OADrBjY,EAAS4rB,GAAO5rB,EADhByC,EAAO4nB,GAAS5nB,EAAMzC,KAEMA,EAASA,EAAOsqB,GAAMzd,GAAKpK,KACvD,OAAe,MAARwV,OA/qGPlR,EA+qGkCiR,GAAMC,EAAMjY,EAAQmY,GAUxD,SAAS0T,GAAgBtsB,GACvB,OAAO6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAU+Q,EAuCrD,SAASwb,GAAYvsB,EAAOyrB,EAAO9E,EAASC,EAAYC,GACtD,OAAI7mB,IAAUyrB,IAGD,MAATzrB,GAA0B,MAATyrB,IAAmB5I,GAAa7iB,KAAW6iB,GAAa4I,GACpEzrB,GAAUA,GAASyrB,GAAUA,EAmBxC,SAAyBhrB,EAAQgrB,EAAO9E,EAASC,EAAY4F,EAAW3F,GACtE,IAAI4F,EAAW3J,GAAQriB,GACnBisB,EAAW5J,GAAQ2I,GACnBkB,EAASF,EAAWzb,EAAWoW,GAAO3mB,GACtCmsB,EAASF,EAAW1b,EAAWoW,GAAOqE,GAKtCoB,GAHJF,EAASA,GAAU5b,EAAUS,EAAYmb,IAGhBnb,EACrBsb,GAHJF,EAASA,GAAU7b,EAAUS,EAAYob,IAGhBpb,EACrBub,EAAYJ,GAAUC,EAE1B,GAAIG,GAAapM,GAASlgB,GAAS,CACjC,IAAKkgB,GAAS8K,GACZ,OAAO,EAETgB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAhG,IAAUA,EAAQ,IAAInC,IACd+H,GAAYjU,GAAa/X,GAC7BusB,GAAYvsB,EAAQgrB,EAAO9E,EAASC,EAAY4F,EAAW3F,GA81EnE,SAAoBpmB,EAAQgrB,EAAOtE,EAAKR,EAASC,EAAY4F,EAAW3F,GACtE,OAAQM,GACN,KAAKpV,EACH,GAAKtR,EAAO0nB,YAAcsD,EAAMtD,YAC3B1nB,EAAOynB,YAAcuD,EAAMvD,WAC9B,OAAO,EAETznB,EAASA,EAAOwnB,OAChBwD,EAAQA,EAAMxD,OAEhB,KAAKnW,EACH,QAAKrR,EAAO0nB,YAAcsD,EAAMtD,aAC3BqE,EAAU,IAAItN,GAAWze,GAAS,IAAIye,GAAWuM,KAKxD,KAAKxa,EACL,KAAKC,EACL,KAAKK,EAGH,OAAOqU,IAAInlB,GAASgrB,GAEtB,KAAKta,EACH,OAAO1Q,EAAOnB,MAAQmsB,EAAMnsB,MAAQmB,EAAOwsB,SAAWxB,EAAMwB,QAE9D,KAAKxb,EACL,KAAKE,EAIH,OAAOlR,GAAWgrB,EAAQ,GAE5B,KAAKna,EACH,IAAI4b,EAAUvQ,GAEhB,KAAKjL,EACH,IAAIyb,EAxnLe,EAwnLHxG,EAGhB,GAFAuG,IAAYA,EAAUjQ,IAElBxc,EAAOmc,MAAQ6O,EAAM7O,OAASuQ,EAChC,OAAO,EAGT,IAAIzE,EAAU7B,EAAMjnB,IAAIa,GACxB,GAAIioB,EACF,OAAOA,GAAW+C,EAEpB9E,GAloLqB,EAqoLrBE,EAAM3J,IAAIzc,EAAQgrB,GAClB,IAAIjpB,EAASwqB,GAAYE,EAAQzsB,GAASysB,EAAQzB,GAAQ9E,EAASC,EAAY4F,EAAW3F,GAE1F,OADAA,EAAc,OAAEpmB,GACT+B,EAET,KAAKoP,EACH,GAAI6Q,GACF,OAAOA,GAAcvjB,KAAKuB,IAAWgiB,GAAcvjB,KAAKusB,GAG9D,OAAO,EA35ED2B,CAAW3sB,EAAQgrB,EAAOkB,EAAQhG,EAASC,EAAY4F,EAAW3F,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAI0G,EAAeR,GAAYjsB,GAAe1B,KAAKuB,EAAQ,eACvD6sB,EAAeR,GAAYlsB,GAAe1B,KAAKusB,EAAO,eAE1D,GAAI4B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe5sB,EAAOT,QAAUS,EAC/C+sB,EAAeF,EAAe7B,EAAMzrB,QAAUyrB,EAGlD,OADA5E,IAAUA,EAAQ,IAAInC,IACf8H,EAAUe,EAAcC,EAAc7G,EAASC,EAAYC,IAGtE,IAAKkG,EACH,OAAO,EAGT,OADAlG,IAAUA,EAAQ,IAAInC,IA05ExB,SAAsBjkB,EAAQgrB,EAAO9E,EAASC,EAAY4F,EAAW3F,GACnE,IAAIsG,EAjqLmB,EAiqLPxG,EACZ8G,EAAW5E,GAAWpoB,GACtBitB,EAAYD,EAAS1rB,OAErB+pB,EADWjD,GAAW4C,GACD1pB,OAEzB,GAAI2rB,GAAa5B,IAAcqB,EAC7B,OAAO,EAET,IAAI/pB,EAAQsqB,EACZ,KAAOtqB,KAAS,CACd,IAAI9C,EAAMmtB,EAASrqB,GACnB,KAAM+pB,EAAY7sB,KAAOmrB,EAAQ7qB,GAAe1B,KAAKusB,EAAOnrB,IAC1D,OAAO,EAIX,IAAIqtB,EAAa9G,EAAMjnB,IAAIa,GACvBmtB,EAAa/G,EAAMjnB,IAAI6rB,GAC3B,GAAIkC,GAAcC,EAChB,OAAOD,GAAclC,GAASmC,GAAcntB,EAE9C,IAAI+B,GAAS,EACbqkB,EAAM3J,IAAIzc,EAAQgrB,GAClB5E,EAAM3J,IAAIuO,EAAOhrB,GAEjB,IAAIotB,EAAWV,EACf,OAAS/pB,EAAQsqB,GAAW,CAC1BptB,EAAMmtB,EAASrqB,GACf,IAAI2iB,EAAWtlB,EAAOH,GAClBwtB,EAAWrC,EAAMnrB,GAErB,GAAIsmB,EACF,IAAImH,EAAWZ,EACXvG,EAAWkH,EAAU/H,EAAUzlB,EAAKmrB,EAAOhrB,EAAQomB,GACnDD,EAAWb,EAAU+H,EAAUxtB,EAAKG,EAAQgrB,EAAO5E,GAGzD,UAnuLFrf,IAmuLQumB,EACGhI,IAAa+H,GAAYtB,EAAUzG,EAAU+H,EAAUnH,EAASC,EAAYC,GAC7EkH,GACD,CACLvrB,GAAS,EACT,MAEFqrB,IAAaA,EAAkB,eAAPvtB,GAE1B,GAAIkC,IAAWqrB,EAAU,CACvB,IAAIG,EAAUvtB,EAAOwmB,YACjBgH,EAAUxC,EAAMxE,YAGhB+G,GAAWC,KACV,gBAAiBxtB,MAAU,gBAAiBgrB,IACzB,mBAAXuC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDzrB,GAAS,GAKb,OAFAqkB,EAAc,OAAEpmB,GAChBomB,EAAc,OAAE4E,GACTjpB,EAv9EA0rB,CAAaztB,EAAQgrB,EAAO9E,EAASC,EAAY4F,EAAW3F,GA3D5DsH,CAAgBnuB,EAAOyrB,EAAO9E,EAASC,EAAY2F,GAAa1F,IAmFzE,SAASuH,GAAY3tB,EAAQsS,EAAQsb,EAAWzH,GAC9C,IAAIxjB,EAAQirB,EAAUtsB,OAClBA,EAASqB,EACTkrB,GAAgB1H,EAEpB,GAAc,MAAVnmB,EACF,OAAQsB,EAGV,IADAtB,EAAShB,GAAOgB,GACT2C,KAAS,CACd,IAAImN,EAAO8d,EAAUjrB,GACrB,GAAKkrB,GAAgB/d,EAAK,GAClBA,EAAK,KAAO9P,EAAO8P,EAAK,MACtBA,EAAK,KAAM9P,GAEnB,OAAO,EAGX,OAAS2C,EAAQrB,GAAQ,CAEvB,IAAIzB,GADJiQ,EAAO8d,EAAUjrB,IACF,GACX2iB,EAAWtlB,EAAOH,GAClBiuB,EAAWhe,EAAK,GAEpB,GAAI+d,GAAgB/d,EAAK,IACvB,QAp1GJ/I,IAo1GQue,KAA4BzlB,KAAOG,GACrC,OAAO,MAEJ,CACL,IAAIomB,EAAQ,IAAInC,GAChB,GAAIkC,EACF,IAAIpkB,EAASokB,EAAWb,EAAUwI,EAAUjuB,EAAKG,EAAQsS,EAAQ8T,GAEnE,UA51GJrf,IA41GUhF,EACE+pB,GAAYgC,EAAUxI,EAAUyI,EAA+C5H,EAAYC,GAC3FrkB,GAEN,OAAO,GAIb,OAAO,EAWT,SAASisB,GAAazuB,GACpB,SAAKojB,GAASpjB,KA05FE0Y,EA15FiB1Y,EA25FxB0e,IAAeA,MAAchG,MAx5FxBkS,GAAW5qB,GAASgf,GAAa3K,IAChCqI,KAAKyF,GAASniB,IAs5F/B,IAAkB0Y,EA12FlB,SAASgW,GAAa1uB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK2uB,GAEW,UAAhB,EAAO3uB,GACF8iB,GAAQ9iB,GACX4uB,GAAoB5uB,EAAM,GAAIA,EAAM,IACpC6uB,GAAY7uB,GAEXU,GAASV,GAUlB,SAAS8uB,GAASruB,GAChB,IAAKsuB,GAAYtuB,GACf,OAAOsgB,GAAWtgB,GAEpB,IAAI+B,EAAS,GACb,IAAK,IAAIlC,KAAOb,GAAOgB,GACjBG,GAAe1B,KAAKuB,EAAQH,IAAe,eAAPA,GACtCkC,EAAOiF,KAAKnH,GAGhB,OAAOkC,EAUT,SAASwsB,GAAWvuB,GAClB,IAAK2iB,GAAS3iB,GACZ,OA09FJ,SAAsBA,GACpB,IAAI+B,EAAS,GACb,GAAc,MAAV/B,EACF,IAAK,IAAIH,KAAOb,GAAOgB,GACrB+B,EAAOiF,KAAKnH,GAGhB,OAAOkC,EAj+FEysB,CAAaxuB,GAEtB,IAAIyuB,EAAUH,GAAYtuB,GACtB+B,EAAS,GAEb,IAAK,IAAIlC,KAAOG,GACD,eAAPH,IAAyB4uB,GAAYtuB,GAAe1B,KAAKuB,EAAQH,KACrEkC,EAAOiF,KAAKnH,GAGhB,OAAOkC,EAYT,SAAS2sB,GAAOnvB,EAAOyrB,GACrB,OAAOzrB,EAAQyrB,EAWjB,SAAS2D,GAAQ5U,EAAYxB,GAC3B,IAAI5V,GAAS,EACTZ,EAAS6sB,GAAY7U,GAAcX,EAAMW,EAAWzY,QAAU,GAKlE,OAHAmkB,GAAS1L,GAAY,SAASxa,EAAOM,EAAKka,GACxChY,IAASY,GAAS4V,EAAShZ,EAAOM,EAAKka,MAElChY,EAUT,SAASqsB,GAAY9b,GACnB,IAAIsb,EAAYiB,GAAavc,GAC7B,OAAwB,GAApBsb,EAAUtsB,QAAessB,EAAU,GAAG,GACjCkB,GAAwBlB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAS5tB,GACd,OAAOA,IAAWsS,GAAUqb,GAAY3tB,EAAQsS,EAAQsb,IAY5D,SAASO,GAAoB1rB,EAAMqrB,GACjC,OAAIiB,GAAMtsB,IAASusB,GAAmBlB,GAC7BgB,GAAwBxE,GAAM7nB,GAAOqrB,GAEvC,SAAS9tB,GACd,IAAIslB,EAAWnmB,GAAIa,EAAQyC,GAC3B,YAzhHFsE,IAyhHUue,GAA0BA,IAAawI,EAC3CmB,GAAMjvB,EAAQyC,GACdqpB,GAAYgC,EAAUxI,EAAUyI,IAexC,SAASmB,GAAUlvB,EAAQsS,EAAQ6c,EAAUhJ,EAAYC,GACnDpmB,IAAWsS,GAGfyX,GAAQzX,GAAQ,SAASwb,EAAUjuB,GAEjC,GADAumB,IAAUA,EAAQ,IAAInC,IAClBtB,GAASmL,IA+BjB,SAAuB9tB,EAAQsS,EAAQzS,EAAKsvB,EAAUC,EAAWjJ,EAAYC,GAC3E,IAAId,EAAW+J,GAAQrvB,EAAQH,GAC3BiuB,EAAWuB,GAAQ/c,EAAQzS,GAC3BooB,EAAU7B,EAAMjnB,IAAI2uB,GAExB,GAAI7F,EAEF,YADA/C,GAAiBllB,EAAQH,EAAKooB,GAGhC,IAAIqH,EAAWnJ,EACXA,EAAWb,EAAUwI,EAAWjuB,EAAM,GAAKG,EAAQsS,EAAQ8T,QAzlH/Drf,EA4lHI2hB,OA5lHJ3hB,IA4lHeuoB,EAEf,GAAI5G,EAAU,CACZ,IAAItE,EAAQ/B,GAAQyL,GAChBvJ,GAAUH,GAASlE,GAAS4N,GAC5ByB,GAAWnL,IAAUG,GAAUxM,GAAa+V,GAEhDwB,EAAWxB,EACP1J,GAASG,GAAUgL,EACjBlN,GAAQiD,GACVgK,EAAWhK,EAEJkK,GAAkBlK,GACzBgK,EAAWvK,GAAUO,GAEdf,GACPmE,GAAW,EACX4G,EAAWzI,GAAYiH,GAAU,IAE1ByB,GACP7G,GAAW,EACX4G,EAAW1H,GAAgBkG,GAAU,IAGrCwB,EAAW,GAGNG,GAAc3B,IAAaxJ,GAAYwJ,IAC9CwB,EAAWhK,EACPhB,GAAYgB,GACdgK,EAAWI,GAAcpK,GAEjB3C,GAAS2C,KAAa6E,GAAW7E,KACzCgK,EAAWxI,GAAgBgH,KAI7BpF,GAAW,EAGXA,IAEFtC,EAAM3J,IAAIqR,EAAUwB,GACpBF,EAAUE,EAAUxB,EAAUqB,EAAUhJ,EAAYC,GACpDA,EAAc,OAAE0H,IAElB5I,GAAiBllB,EAAQH,EAAKyvB,GAzF1BK,CAAc3vB,EAAQsS,EAAQzS,EAAKsvB,EAAUD,GAAW/I,EAAYC,OAEjE,CACH,IAAIkJ,EAAWnJ,EACXA,EAAWkJ,GAAQrvB,EAAQH,GAAMiuB,EAAWjuB,EAAM,GAAKG,EAAQsS,EAAQ8T,QArjH/Erf,WAwjHQuoB,IACFA,EAAWxB,GAEb5I,GAAiBllB,EAAQH,EAAKyvB,MAE/BrI,IAwFL,SAAS2I,GAAQvX,EAAOtY,GACtB,IAAIuB,EAAS+W,EAAM/W,OACnB,GAAKA,EAIL,OAAOojB,GADP3kB,GAAKA,EAAI,EAAIuB,EAAS,EACJA,GAAU+W,EAAMtY,QA3pHlCgH,EAuqHF,SAAS8oB,GAAY9V,EAAY+V,EAAWC,GAExCD,EADEA,EAAUxuB,OACA6X,GAAS2W,GAAW,SAASvX,GACvC,OAAI8J,GAAQ9J,GACH,SAAShZ,GACd,OAAO6qB,GAAQ7qB,EAA2B,IAApBgZ,EAASjX,OAAeiX,EAAS,GAAKA,IAGzDA,KAGG,CAAC2V,IAGf,IAAIvrB,GAAS,EAUb,OATAmtB,EAAY3W,GAAS2W,EAAW9U,GAAUgV,OAnxF9C,SAAoB3X,EAAO4X,GACzB,IAAI3uB,EAAS+W,EAAM/W,OAGnB,IADA+W,EAAM6X,KAAKD,GACJ3uB,KACL+W,EAAM/W,GAAU+W,EAAM/W,GAAQ/B,MAEhC,OAAO8Y,EAqxFE8X,CAPMxB,GAAQ5U,GAAY,SAASxa,EAAOM,EAAKka,GAIpD,MAAO,CAAE,SAHMZ,GAAS2W,GAAW,SAASvX,GAC1C,OAAOA,EAAShZ,MAEa,QAAWoD,EAAO,MAASpD,OAGlC,SAASS,EAAQgrB,GACzC,OA04BJ,SAAyBhrB,EAAQgrB,EAAO+E,GACtC,IAAIptB,GAAS,EACTytB,EAAcpwB,EAAOqwB,SACrBC,EAActF,EAAMqF,SACpB/uB,EAAS8uB,EAAY9uB,OACrBivB,EAAeR,EAAOzuB,OAE1B,OAASqB,EAAQrB,GAAQ,CACvB,IAAIS,EAASyuB,GAAiBJ,EAAYztB,GAAQ2tB,EAAY3tB,IAC9D,GAAIZ,EAAQ,CACV,GAAIY,GAAS4tB,EACX,OAAOxuB,EAET,IAAI0uB,EAAQV,EAAOptB,GACnB,OAAOZ,GAAmB,QAAT0uB,GAAmB,EAAI,IAU5C,OAAOzwB,EAAO2C,MAAQqoB,EAAMroB,MAl6BnB+tB,CAAgB1wB,EAAQgrB,EAAO+E,MA4B1C,SAASY,GAAW3wB,EAAQmM,EAAOyM,GAKjC,IAJA,IAAIjW,GAAS,EACTrB,EAAS6K,EAAM7K,OACfS,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAImB,EAAO0J,EAAMxJ,GACbpD,EAAQ6qB,GAAQpqB,EAAQyC,GAExBmW,EAAUrZ,EAAOkD,IACnBmuB,GAAQ7uB,EAAQsoB,GAAS5nB,EAAMzC,GAAST,GAG5C,OAAOwC,EA2BT,SAAS8uB,GAAYxY,EAAOiB,EAAQf,EAAUW,GAC5C,IAAIvX,EAAUuX,EAAaoB,GAAkBtB,GACzCrW,GAAS,EACTrB,EAASgY,EAAOhY,OAChBoqB,EAAOrT,EAQX,IANIA,IAAUiB,IACZA,EAASyL,GAAUzL,IAEjBf,IACFmT,EAAOvS,GAASd,EAAO2C,GAAUzC,OAE1B5V,EAAQrB,GAKf,IAJA,IAAI4Y,EAAY,EACZ3a,EAAQ+Z,EAAO3W,GACfkmB,EAAWtQ,EAAWA,EAAShZ,GAASA,GAEpC2a,EAAYvY,EAAQ+pB,EAAM7C,EAAU3O,EAAWhB,KAAgB,GACjEwS,IAASrT,GACX0G,GAAOtgB,KAAKitB,EAAMxR,EAAW,GAE/B6E,GAAOtgB,KAAK4Z,EAAO6B,EAAW,GAGlC,OAAO7B,EAYT,SAASyY,GAAWzY,EAAO0Y,GAIzB,IAHA,IAAIzvB,EAAS+W,EAAQ0Y,EAAQzvB,OAAS,EAClCsb,EAAYtb,EAAS,EAElBA,KAAU,CACf,IAAIqB,EAAQouB,EAAQzvB,GACpB,GAAIA,GAAUsb,GAAaja,IAAUquB,EAAU,CAC7C,IAAIA,EAAWruB,EACX+hB,GAAQ/hB,GACVoc,GAAOtgB,KAAK4Z,EAAO1V,EAAO,GAE1BsuB,GAAU5Y,EAAO1V,IAIvB,OAAO0V,EAYT,SAASuM,GAAWmB,EAAOC,GACzB,OAAOD,EAAQjG,GAAYe,MAAkBmF,EAAQD,EAAQ,IAkC/D,SAASmL,GAAWpW,EAAQ/a,GAC1B,IAAIgC,EAAS,GACb,IAAK+Y,GAAU/a,EAAI,GAAKA,EA9yHL,iBA+yHjB,OAAOgC,EAIT,GACMhC,EAAI,IACNgC,GAAU+Y,IAEZ/a,EAAI+f,GAAY/f,EAAI,MAElB+a,GAAUA,SAEL/a,GAET,OAAOgC,EAWT,SAASovB,GAASlZ,EAAMhO,GACtB,OAAOmnB,GAAYC,GAASpZ,EAAMhO,EAAOikB,IAAWjW,EAAO,IAU7D,SAASqZ,GAAWvX,GAClB,OAAO4K,GAAYrL,GAAOS,IAW5B,SAASwX,GAAexX,EAAYha,GAClC,IAAIsY,EAAQiB,GAAOS,GACnB,OAAO+K,GAAYzM,EAAO2M,GAAUjlB,EAAG,EAAGsY,EAAM/W,SAalD,SAASsvB,GAAQ5wB,EAAQyC,EAAMlD,EAAO4mB,GACpC,IAAKxD,GAAS3iB,GACZ,OAAOA,EAST,IALA,IAAI2C,GAAS,EACTrB,GAHJmB,EAAO4nB,GAAS5nB,EAAMzC,IAGJsB,OACdsb,EAAYtb,EAAS,EACrBkwB,EAASxxB,EAEI,MAAVwxB,KAAoB7uB,EAAQrB,GAAQ,CACzC,IAAIzB,EAAMyqB,GAAM7nB,EAAKE,IACjB2sB,EAAW/vB,EAEf,GAAY,cAARM,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOG,EAGT,GAAI2C,GAASia,EAAW,CACtB,IAAI0I,EAAWkM,EAAO3xB,QA57H1BkH,KA67HIuoB,EAAWnJ,EAAaA,EAAWb,EAAUzlB,EAAK2xB,QA77HtDzqB,KA+7HMuoB,EAAW3M,GAAS2C,GAChBA,EACCZ,GAAQjiB,EAAKE,EAAQ,IAAM,GAAK,IAGzC0iB,GAAYmM,EAAQ3xB,EAAKyvB,GACzBkC,EAASA,EAAO3xB,GAElB,OAAOG,EAWT,IAAIyxB,GAAelQ,GAAqB,SAAStJ,EAAMnI,GAErD,OADAyR,GAAQ9E,IAAIxE,EAAMnI,GACXmI,GAFoBiW,GAazBwD,GAAmBzyB,GAA4B,SAASgZ,EAAM6C,GAChE,OAAO7b,GAAegZ,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS0Z,GAAS7W,GAClB,UAAY,KALwBoT,GAgBxC,SAAS0D,GAAY7X,GACnB,OAAO+K,GAAYxL,GAAOS,IAY5B,SAAS8X,GAAUxZ,EAAOpO,EAAOE,GAC/B,IAAIxH,GAAS,EACTrB,EAAS+W,EAAM/W,OAEf2I,EAAQ,IACVA,GAASA,EAAQ3I,EAAS,EAAKA,EAAS2I,IAE1CE,EAAMA,EAAM7I,EAASA,EAAS6I,GACpB,IACRA,GAAO7I,GAETA,EAAS2I,EAAQE,EAAM,EAAMA,EAAMF,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIlI,EAASqX,EAAM9X,KACVqB,EAAQrB,GACfS,EAAOY,GAAS0V,EAAM1V,EAAQsH,GAEhC,OAAOlI,EAYT,SAAS+vB,GAAS/X,EAAYnB,GAC5B,IAAI7W,EAMJ,OAJA0jB,GAAS1L,GAAY,SAASxa,EAAOoD,EAAOoX,GAE1C,QADAhY,EAAS6W,EAAUrZ,EAAOoD,EAAOoX,SAG1BhY,EAeX,SAASgwB,GAAgB1Z,EAAO9Y,EAAOyyB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAAT7Z,EAAgB4Z,EAAM5Z,EAAM/W,OAEvC,GAAoB,iBAAT/B,GAAqBA,GAAUA,GAAS2yB,GAn/H3BC,WAm/H0D,CAChF,KAAOF,EAAMC,GAAM,CACjB,IAAIE,EAAOH,EAAMC,IAAU,EACvBrJ,EAAWxQ,EAAM+Z,GAEJ,OAAbvJ,IAAsBY,GAASZ,KAC9BmJ,EAAcnJ,GAAYtpB,EAAUspB,EAAWtpB,GAClD0yB,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAOF,EAET,OAAOG,GAAkBha,EAAO9Y,EAAO2uB,GAAU8D,GAgBnD,SAASK,GAAkBha,EAAO9Y,EAAOgZ,EAAUyZ,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAAT7Z,EAAgB,EAAIA,EAAM/W,OACrC,GAAa,IAAT4wB,EACF,OAAO,EAST,IALA,IAAII,GADJ/yB,EAAQgZ,EAAShZ,KACQA,EACrBgzB,EAAsB,OAAVhzB,EACZizB,EAAc/I,GAASlqB,GACvBkzB,OA7lIJ1rB,IA6lIqBxH,EAEd0yB,EAAMC,GAAM,CACjB,IAAIE,EAAMtS,IAAamS,EAAMC,GAAQ,GACjCrJ,EAAWtQ,EAASF,EAAM+Z,IAC1BM,OAlmIN3rB,IAkmIqB8hB,EACf8J,EAAyB,OAAb9J,EACZ+J,EAAiB/J,GAAaA,EAC9BgK,EAAcpJ,GAASZ,GAE3B,GAAIyJ,EACF,IAAIQ,EAASd,GAAcY,OAE3BE,EADSL,EACAG,IAAmBZ,GAAcU,GACjCH,EACAK,GAAkBF,IAAiBV,IAAeW,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcX,IAAea,IAChEF,IAAaE,IAGbb,EAAcnJ,GAAYtpB,EAAUspB,EAAWtpB,GAEtDuzB,EACFb,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAO3R,GAAUyR,EA1jICC,YAskIpB,SAASY,GAAe1a,EAAOE,GAM7B,IALA,IAAI5V,GAAS,EACTrB,EAAS+W,EAAM/W,OACfwX,EAAW,EACX/W,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdkmB,EAAWtQ,EAAWA,EAAShZ,GAASA,EAE5C,IAAKoD,IAAUwiB,GAAG0D,EAAU6C,GAAO,CACjC,IAAIA,EAAO7C,EACX9mB,EAAO+W,KAAwB,IAAVvZ,EAAc,EAAIA,GAG3C,OAAOwC,EAWT,SAASixB,GAAazzB,GACpB,MAAoB,iBAATA,EACFA,EAELkqB,GAASlqB,GAxmIP,KA2mIEA,EAWV,SAAS0zB,GAAa1zB,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI8iB,GAAQ9iB,GAEV,OAAO4Z,GAAS5Z,EAAO0zB,IAAgB,GAEzC,GAAIxJ,GAASlqB,GACX,OAAO2iB,GAAiBA,GAAezjB,KAAKc,GAAS,GAEvD,IAAIwC,EAAUxC,EAAQ,GACtB,MAAkB,KAAVwC,GAAkB,EAAIxC,IAtoInB,IAsoI0C,KAAOwC,EAY9D,SAASmxB,GAAS7a,EAAOE,EAAUW,GACjC,IAAIvW,GAAS,EACT8lB,EAAW1P,GACXzX,EAAS+W,EAAM/W,OACfonB,GAAW,EACX3mB,EAAS,GACT2pB,EAAO3pB,EAEX,GAAImX,EACFwP,GAAW,EACXD,EAAWxP,QAER,GAAI3X,GAjtIU,IAitIkB,CACnC,IAAImb,EAAMlE,EAAW,KAAO4a,GAAU9a,GACtC,GAAIoE,EACF,OAAOD,GAAWC,GAEpBiM,GAAW,EACXD,EAAWtN,GACXuQ,EAAO,IAAI5H,QAGX4H,EAAOnT,EAAW,GAAKxW,EAEzB6mB,EACA,OAASjmB,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdkmB,EAAWtQ,EAAWA,EAAShZ,GAASA,EAG5C,GADAA,EAAS2Z,GAAwB,IAAV3Z,EAAeA,EAAQ,EAC1CmpB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIuK,EAAY1H,EAAKpqB,OACd8xB,KACL,GAAI1H,EAAK0H,KAAevK,EACtB,SAASD,EAGTrQ,GACFmT,EAAK1kB,KAAK6hB,GAEZ9mB,EAAOiF,KAAKzH,QAEJkpB,EAASiD,EAAM7C,EAAU3P,KAC7BwS,IAAS3pB,GACX2pB,EAAK1kB,KAAK6hB,GAEZ9mB,EAAOiF,KAAKzH,IAGhB,OAAOwC,EAWT,SAASkvB,GAAUjxB,EAAQyC,GAGzB,OAAiB,OADjBzC,EAAS4rB,GAAO5rB,EADhByC,EAAO4nB,GAAS5nB,EAAMzC,aAEUA,EAAOsqB,GAAMzd,GAAKpK,KAapD,SAAS4wB,GAAWrzB,EAAQyC,EAAM6wB,EAASnN,GACzC,OAAOyK,GAAQ5wB,EAAQyC,EAAM6wB,EAAQlJ,GAAQpqB,EAAQyC,IAAQ0jB,GAc/D,SAASoN,GAAUlb,EAAOO,EAAW4a,EAAQrZ,GAI3C,IAHA,IAAI7Y,EAAS+W,EAAM/W,OACfqB,EAAQwX,EAAY7Y,GAAU,GAE1B6Y,EAAYxX,MAAYA,EAAQrB,IACtCsX,EAAUP,EAAM1V,GAAQA,EAAO0V,KAEjC,OAAOmb,EACH3B,GAAUxZ,EAAQ8B,EAAY,EAAIxX,EAASwX,EAAYxX,EAAQ,EAAIrB,GACnEuwB,GAAUxZ,EAAQ8B,EAAYxX,EAAQ,EAAI,EAAKwX,EAAY7Y,EAASqB,GAa1E,SAAS8wB,GAAiBl0B,EAAOm0B,GAC/B,IAAI3xB,EAASxC,EAIb,OAHIwC,aAAkBugB,KACpBvgB,EAASA,EAAOxC,SAEXia,GAAYka,GAAS,SAAS3xB,EAAQ4xB,GAC3C,OAAOA,EAAO1b,KAAKD,MAAM2b,EAAOzb,QAASmB,GAAU,CAACtX,GAAS4xB,EAAOxb,SACnEpW,GAaL,SAAS6xB,GAAQxI,EAAQ7S,EAAUW,GACjC,IAAI5X,EAAS8pB,EAAO9pB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS4xB,GAAS9H,EAAO,IAAM,GAKxC,IAHA,IAAIzoB,GAAS,EACTZ,EAASqX,EAAM9X,KAEVqB,EAAQrB,GAIf,IAHA,IAAI+W,EAAQ+S,EAAOzoB,GACf2oB,GAAY,IAEPA,EAAWhqB,GACdgqB,GAAY3oB,IACdZ,EAAOY,GAAS6lB,GAAezmB,EAAOY,IAAU0V,EAAO+S,EAAOE,GAAW/S,EAAUW,IAIzF,OAAOga,GAASvJ,GAAY5nB,EAAQ,GAAIwW,EAAUW,GAYpD,SAAS2a,GAAc3Y,EAAO5B,EAAQwa,GAMpC,IALA,IAAInxB,GAAS,EACTrB,EAAS4Z,EAAM5Z,OACfyyB,EAAaza,EAAOhY,OACpBS,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQoD,EAAQoxB,EAAaza,EAAO3W,QAr3I1CoE,EAs3IE+sB,EAAW/xB,EAAQmZ,EAAMvY,GAAQpD,GAEnC,OAAOwC,EAUT,SAASiyB,GAAoBz0B,GAC3B,OAAOiwB,GAAkBjwB,GAASA,EAAQ,GAU5C,SAAS00B,GAAa10B,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ2uB,GAW9C,SAAS7D,GAAS9qB,EAAOS,GACvB,OAAIqiB,GAAQ9iB,GACHA,EAEFwvB,GAAMxvB,EAAOS,GAAU,CAACT,GAAS20B,GAAanW,GAASxe,IAYhE,IAAI40B,GAAWhD,GAWf,SAASiD,GAAU/b,EAAOpO,EAAOE,GAC/B,IAAI7I,EAAS+W,EAAM/W,OAEnB,OADA6I,OAt7IApD,IAs7IMoD,EAAoB7I,EAAS6I,GAC1BF,GAASE,GAAO7I,EAAU+W,EAAQwZ,GAAUxZ,EAAOpO,EAAOE,GASrE,IAAIoV,GAAeD,IAAmB,SAAS+U,GAC7C,OAAO3d,GAAK6I,aAAa8U,IAW3B,SAASxN,GAAYW,EAAQnB,GAC3B,GAAIA,EACF,OAAOmB,EAAO/c,QAEhB,IAAInJ,EAASkmB,EAAOlmB,OAChBS,EAAS2c,GAAcA,GAAYpd,GAAU,IAAIkmB,EAAOhB,YAAYllB,GAGxE,OADAkmB,EAAO8M,KAAKvyB,GACLA,EAUT,SAASulB,GAAiBiN,GACxB,IAAIxyB,EAAS,IAAIwyB,EAAY/N,YAAY+N,EAAY7M,YAErD,OADA,IAAIjJ,GAAW1c,GAAQ0a,IAAI,IAAIgC,GAAW8V,IACnCxyB,EAgDT,SAAS6lB,GAAgB4M,EAAYnO,GACnC,IAAImB,EAASnB,EAASiB,GAAiBkN,EAAWhN,QAAUgN,EAAWhN,OACvE,OAAO,IAAIgN,EAAWhO,YAAYgB,EAAQgN,EAAW/M,WAAY+M,EAAWlzB,QAW9E,SAASkvB,GAAiBjxB,EAAOyrB,GAC/B,GAAIzrB,IAAUyrB,EAAO,CACnB,IAAIyJ,OAhiJN1tB,IAgiJqBxH,EACfgzB,EAAsB,OAAVhzB,EACZm1B,EAAiBn1B,GAAUA,EAC3BizB,EAAc/I,GAASlqB,GAEvBmzB,OAriJN3rB,IAqiJqBikB,EACf2H,EAAsB,OAAV3H,EACZ4H,EAAiB5H,GAAUA,EAC3B6H,EAAcpJ,GAASuB,GAE3B,IAAM2H,IAAcE,IAAgBL,GAAejzB,EAAQyrB,GACtDwH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B6B,GAAgB7B,IACjB8B,EACH,OAAO,EAET,IAAMnC,IAAcC,IAAgBK,GAAetzB,EAAQyrB,GACtD6H,GAAe4B,GAAgBC,IAAmBnC,IAAcC,GAChEG,GAAa8B,GAAgBC,IAC5BhC,GAAgBgC,IACjB9B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS+B,GAAYxc,EAAMyc,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAa7c,EAAK7W,OAClB2zB,EAAgBJ,EAAQvzB,OACxB4zB,GAAa,EACbC,EAAaP,EAAStzB,OACtB8zB,EAAc7U,GAAUyU,EAAaC,EAAe,GACpDlzB,EAASqX,EAAM+b,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBpzB,EAAOmzB,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BjzB,EAAO8yB,EAAQE,IAAc5c,EAAK4c,IAGtC,KAAOK,KACLrzB,EAAOmzB,KAAe/c,EAAK4c,KAE7B,OAAOhzB,EAcT,SAASuzB,GAAiBnd,EAAMyc,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAa7c,EAAK7W,OAClBi0B,GAAgB,EAChBN,EAAgBJ,EAAQvzB,OACxBk0B,GAAc,EACdC,EAAcb,EAAStzB,OACvB8zB,EAAc7U,GAAUyU,EAAaC,EAAe,GACpDlzB,EAASqX,EAAMgc,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBrzB,EAAOgzB,GAAa5c,EAAK4c,GAG3B,IADA,IAAIxb,EAASwb,IACJS,EAAaC,GACpB1zB,EAAOwX,EAASic,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BjzB,EAAOwX,EAASsb,EAAQU,IAAiBpd,EAAK4c,MAGlD,OAAOhzB,EAWT,SAASgjB,GAAUzS,EAAQ+F,GACzB,IAAI1V,GAAS,EACTrB,EAASgR,EAAOhR,OAGpB,IADA+W,IAAUA,EAAQe,EAAM9X,MACfqB,EAAQrB,GACf+W,EAAM1V,GAAS2P,EAAO3P,GAExB,OAAO0V,EAaT,SAASsN,GAAWrT,EAAQ4I,EAAOlb,EAAQmmB,GACzC,IAAIuP,GAAS11B,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAI2C,GAAS,EACTrB,EAAS4Z,EAAM5Z,SAEVqB,EAAQrB,GAAQ,CACvB,IAAIzB,EAAMqb,EAAMvY,GAEZ2sB,EAAWnJ,EACXA,EAAWnmB,EAAOH,GAAMyS,EAAOzS,GAAMA,EAAKG,EAAQsS,QArtJxDvL,WAwtJMuoB,IACFA,EAAWhd,EAAOzS,IAEhB61B,EACFtQ,GAAgBplB,EAAQH,EAAKyvB,GAE7BjK,GAAYrlB,EAAQH,EAAKyvB,GAG7B,OAAOtvB,EAmCT,SAAS21B,GAAiBrd,EAAQsd,GAChC,OAAO,SAAS7b,EAAYxB,GAC1B,IAAIN,EAAOoK,GAAQtI,GAAc3B,GAAkBoN,GAC/ChN,EAAcod,EAAcA,IAAgB,GAEhD,OAAO3d,EAAK8B,EAAYzB,EAAQ0X,GAAYzX,EAAU,GAAIC,IAW9D,SAASqd,GAAeC,GACtB,OAAO3E,IAAS,SAASnxB,EAAQ+1B,GAC/B,IAAIpzB,GAAS,EACTrB,EAASy0B,EAAQz0B,OACjB6kB,EAAa7kB,EAAS,EAAIy0B,EAAQz0B,EAAS,QAxxJjDyF,EAyxJMivB,EAAQ10B,EAAS,EAAIy0B,EAAQ,QAzxJnChvB,EAoyJE,IATAof,EAAc2P,EAASx0B,OAAS,GAA0B,mBAAd6kB,GACvC7kB,IAAU6kB,QA5xJjBpf,EA+xJMivB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD7P,EAAa7kB,EAAS,OAhyJ1ByF,EAgyJ0Cof,EACtC7kB,EAAS,GAEXtB,EAAShB,GAAOgB,KACP2C,EAAQrB,GAAQ,CACvB,IAAIgR,EAASyjB,EAAQpzB,GACjB2P,GACFwjB,EAAS91B,EAAQsS,EAAQ3P,EAAOwjB,GAGpC,OAAOnmB,KAYX,SAASmpB,GAAenP,EAAUG,GAChC,OAAO,SAASJ,EAAYxB,GAC1B,GAAkB,MAAdwB,EACF,OAAOA,EAET,IAAK6U,GAAY7U,GACf,OAAOC,EAASD,EAAYxB,GAM9B,IAJA,IAAIjX,EAASyY,EAAWzY,OACpBqB,EAAQwX,EAAY7Y,GAAU,EAC9B40B,EAAWl3B,GAAO+a,IAEdI,EAAYxX,MAAYA,EAAQrB,KACa,IAA/CiX,EAAS2d,EAASvzB,GAAQA,EAAOuzB,KAIvC,OAAOnc,GAWX,SAASiQ,GAAc7P,GACrB,OAAO,SAASna,EAAQuY,EAAUiS,GAMhC,IALA,IAAI7nB,GAAS,EACTuzB,EAAWl3B,GAAOgB,GAClBkb,EAAQsP,EAASxqB,GACjBsB,EAAS4Z,EAAM5Z,OAEZA,KAAU,CACf,IAAIzB,EAAMqb,EAAMf,EAAY7Y,IAAWqB,GACvC,IAA+C,IAA3C4V,EAAS2d,EAASr2B,GAAMA,EAAKq2B,GAC/B,MAGJ,OAAOl2B,GAgCX,SAASm2B,GAAgBC,GACvB,OAAO,SAAStb,GAGd,IAAIS,EAAaS,GAFjBlB,EAASiD,GAASjD,IAGdgC,GAAchC,QAp4JpB/T,EAu4JMgV,EAAMR,EACNA,EAAW,GACXT,EAAOvQ,OAAO,GAEd8rB,EAAW9a,EACX6Y,GAAU7Y,EAAY,GAAGhU,KAAK,IAC9BuT,EAAOrQ,MAAM,GAEjB,OAAOsR,EAAIqa,KAAgBC,GAW/B,SAASC,GAAiB/yB,GACxB,OAAO,SAASuX,GACd,OAAOtB,GAAY+c,GAAMC,GAAO1b,GAAQtS,QAAQgN,GAAQ,KAAMjS,EAAU,KAY5E,SAASkzB,GAAWpP,GAClB,OAAO,WAIL,IAAIlP,EAAOue,UACX,OAAQve,EAAK7W,QACX,KAAK,EAAG,OAAO,IAAI+lB,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKlP,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIkP,EAAKlP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIwe,EAAclU,GAAW4E,EAAKnnB,WAC9B6B,EAASslB,EAAKrP,MAAM2e,EAAaxe,GAIrC,OAAOwK,GAAS5gB,GAAUA,EAAS40B,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAAS9c,EAAYnB,EAAWsB,GACrC,IAAIgc,EAAWl3B,GAAO+a,GACtB,IAAK6U,GAAY7U,GAAa,CAC5B,IAAIxB,EAAWyX,GAAYpX,EAAW,GACtCmB,EAAanZ,GAAKmZ,GAClBnB,EAAY,SAAS/Y,GAAO,OAAO0Y,EAAS2d,EAASr2B,GAAMA,EAAKq2B,IAElE,IAAIvzB,EAAQk0B,EAAc9c,EAAYnB,EAAWsB,GACjD,OAAOvX,GAAS,EAAIuzB,EAAS3d,EAAWwB,EAAWpX,GAASA,QAt/J9DoE,GAigKF,SAAS+vB,GAAW3c,GAClB,OAAO4c,IAAS,SAASC,GACvB,IAAI11B,EAAS01B,EAAM11B,OACfqB,EAAQrB,EACR21B,EAAS1U,GAAcriB,UAAUg3B,KAKrC,IAHI/c,GACF6c,EAAMhW,UAEDre,KAAS,CACd,IAAIsV,EAAO+e,EAAMr0B,GACjB,GAAmB,mBAARsV,EACT,MAAM,IAAIwF,GAAUtN,GAEtB,GAAI8mB,IAAWE,GAAgC,WAArBC,GAAYnf,GACpC,IAAIkf,EAAU,IAAI5U,GAAc,IAAI,GAIxC,IADA5f,EAAQw0B,EAAUx0B,EAAQrB,IACjBqB,EAAQrB,GAAQ,CAGvB,IAAI+1B,EAAWD,GAFfnf,EAAO+e,EAAMr0B,IAGTmN,EAAmB,WAAZunB,EAAwBC,GAAQrf,QAxhK/ClR,EA8hKMowB,EAJErnB,GAAQynB,GAAWznB,EAAK,KACf,KAAPA,EAAK,KACJA,EAAK,GAAGxO,QAAqB,GAAXwO,EAAK,GAElBqnB,EAAQC,GAAYtnB,EAAK,KAAKkI,MAAMmf,EAASrnB,EAAK,IAElC,GAAfmI,EAAK3W,QAAei2B,GAAWtf,GACtCkf,EAAQE,KACRF,EAAQD,KAAKjf,GAGrB,OAAO,WACL,IAAIE,EAAOue,UACPn3B,EAAQ4Y,EAAK,GAEjB,GAAIgf,GAA0B,GAAfhf,EAAK7W,QAAe+gB,GAAQ9iB,GACzC,OAAO43B,EAAQK,MAAMj4B,GAAOA,QAK9B,IAHA,IAAIoD,EAAQ,EACRZ,EAAST,EAAS01B,EAAMr0B,GAAOqV,MAAMzX,KAAM4X,GAAQ5Y,IAE9CoD,EAAQrB,GACfS,EAASi1B,EAAMr0B,GAAOlE,KAAK8B,KAAMwB,GAEnC,OAAOA,MAwBb,SAAS01B,GAAaxf,EAAMiO,EAAShO,EAAS0c,EAAUC,EAAS6C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EApiKY,IAoiKJ7R,EACR8R,EA5iKa,EA4iKJ9R,EACT+R,EA5iKiB,EA4iKL/R,EACZ4O,EAAmB,GAAP5O,EACZgS,EAtiKa,IAsiKJhS,EACTmB,EAAO4Q,OAhlKXlxB,EAglKmC0vB,GAAWxe,GA6C9C,OA3CA,SAASkf,IAKP,IAJA,IAAI71B,EAASo1B,UAAUp1B,OACnB6W,EAAOiB,EAAM9X,GACbqB,EAAQrB,EAELqB,KACLwV,EAAKxV,GAAS+zB,UAAU/zB,GAE1B,GAAImyB,EACF,IAAInZ,EAAcwc,GAAUhB,GACxBiB,EAAe1c,GAAavD,EAAMwD,GASxC,GAPIiZ,IACFzc,EAAOwc,GAAYxc,EAAMyc,EAAUC,EAASC,IAE1C4C,IACFvf,EAAOmd,GAAiBnd,EAAMuf,EAAeC,EAAc7C,IAE7DxzB,GAAU82B,EACNtD,GAAaxzB,EAASw2B,EAAO,CAC/B,IAAIO,EAAa9b,GAAepE,EAAMwD,GACtC,OAAO2c,GACLrgB,EAAMiO,EAASuR,GAAcN,EAAQxb,YAAazD,EAClDC,EAAMkgB,EAAYT,EAAQC,EAAKC,EAAQx2B,GAG3C,IAAIq1B,EAAcqB,EAAS9f,EAAU3X,KACjCg4B,EAAKN,EAAYtB,EAAY1e,GAAQA,EAczC,OAZA3W,EAAS6W,EAAK7W,OACVs2B,EACFzf,EAAOqgB,GAAQrgB,EAAMyf,GACZM,GAAU52B,EAAS,GAC5B6W,EAAK6I,UAEH+W,GAASF,EAAMv2B,IACjB6W,EAAK7W,OAASu2B,GAEZt3B,MAAQA,OAASmW,IAAQnW,gBAAgB42B,IAC3CoB,EAAKlR,GAAQoP,GAAW8B,IAEnBA,EAAGvgB,MAAM2e,EAAaxe,IAajC,SAASsgB,GAAengB,EAAQogB,GAC9B,OAAO,SAAS14B,EAAQuY,GACtB,OAh/DJ,SAAsBvY,EAAQsY,EAAQC,EAAUC,GAI9C,OAHA4Q,GAAWppB,GAAQ,SAAST,EAAOM,EAAKG,GACtCsY,EAAOE,EAAaD,EAAShZ,GAAQM,EAAKG,MAErCwY,EA4+DEmgB,CAAa34B,EAAQsY,EAAQogB,EAAWngB,GAAW,KAY9D,SAASqgB,GAAoBC,EAAUC,GACrC,OAAO,SAASv5B,EAAOyrB,GACrB,IAAIjpB,EACJ,QAzpKFgF,IAypKMxH,QAzpKNwH,IAypK6BikB,EACzB,OAAO8N,EAKT,QA/pKF/xB,IA4pKMxH,IACFwC,EAASxC,QA7pKbwH,IA+pKMikB,EAAqB,CACvB,QAhqKJjkB,IAgqKQhF,EACF,OAAOipB,EAEW,iBAATzrB,GAAqC,iBAATyrB,GACrCzrB,EAAQ0zB,GAAa1zB,GACrByrB,EAAQiI,GAAajI,KAErBzrB,EAAQyzB,GAAazzB,GACrByrB,EAAQgI,GAAahI,IAEvBjpB,EAAS82B,EAASt5B,EAAOyrB,GAE3B,OAAOjpB,GAWX,SAASg3B,GAAWC,GAClB,OAAOjC,IAAS,SAASjH,GAEvB,OADAA,EAAY3W,GAAS2W,EAAW9U,GAAUgV,OACnCmB,IAAS,SAAShZ,GACvB,IAAID,EAAU3X,KACd,OAAOy4B,EAAUlJ,GAAW,SAASvX,GACnC,OAAOP,GAAMO,EAAUL,EAASC,YAexC,SAAS8gB,GAAc33B,EAAQ43B,GAG7B,IAAIC,GAFJD,OA7sKAnyB,IA6sKQmyB,EAAsB,IAAMjG,GAAaiG,IAEzB53B,OACxB,GAAI63B,EAAc,EAChB,OAAOA,EAAcjI,GAAWgI,EAAO53B,GAAU43B,EAEnD,IAAIn3B,EAASmvB,GAAWgI,EAAOtZ,GAAWte,EAASqb,GAAWuc,KAC9D,OAAOld,GAAWkd,GACd9E,GAAUtX,GAAc/a,GAAS,EAAGT,GAAQiG,KAAK,IACjDxF,EAAO0I,MAAM,EAAGnJ,GA6CtB,SAAS83B,GAAYjf,GACnB,OAAO,SAASlQ,EAAOE,EAAKkvB,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBpD,GAAehsB,EAAOE,EAAKkvB,KAChElvB,EAAMkvB,OAtwKVtyB,GAywKEkD,EAAQqvB,GAASrvB,QAzwKnBlD,IA0wKMoD,GACFA,EAAMF,EACNA,EAAQ,GAERE,EAAMmvB,GAASnvB,GA57CrB,SAAmBF,EAAOE,EAAKkvB,EAAMlf,GAKnC,IAJA,IAAIxX,GAAS,EACTrB,EAASif,GAAUX,IAAYzV,EAAMF,IAAUovB,GAAQ,IAAK,GAC5Dt3B,EAASqX,EAAM9X,GAEZA,KACLS,EAAOoY,EAAY7Y,IAAWqB,GAASsH,EACvCA,GAASovB,EAEX,OAAOt3B,EAs7CEw3B,CAAUtvB,EAAOE,EADxBkvB,OAhxKFtyB,IAgxKSsyB,EAAsBpvB,EAAQE,EAAM,GAAK,EAAKmvB,GAASD,GAC3Blf,IAWvC,SAASqf,GAA0BX,GACjC,OAAO,SAASt5B,EAAOyrB,GAKrB,MAJsB,iBAATzrB,GAAqC,iBAATyrB,IACvCzrB,EAAQk6B,GAASl6B,GACjByrB,EAAQyO,GAASzO,IAEZ6N,EAASt5B,EAAOyrB,IAqB3B,SAASsN,GAAcrgB,EAAMiO,EAASwT,EAAU/d,EAAazD,EAAS0c,EAAUC,EAAS+C,EAAQC,EAAKC,GACpG,IAAI6B,EArxKc,EAqxKJzT,EAMdA,GAAYyT,EAzxKQ,GACM,GAJF,GA6xKxBzT,KAAayT,EAzxKa,GADN,OA6xKlBzT,IAAW,GAEb,IAAI0T,EAAU,CACZ3hB,EAAMiO,EAAShO,EAVCyhB,EAAU/E,OA3zK5B7tB,EAyzKiB4yB,EAAU9E,OAzzK3B9tB,EA4zKuB4yB,OA5zKvB5yB,EA4zK6C6tB,EAFvB+E,OA1zKtB5yB,EA0zK4C8tB,EAYzB+C,EAAQC,EAAKC,GAG5B/1B,EAAS23B,EAAS1hB,WAz0KtBjR,EAy0KuC6yB,GAKvC,OAJIrC,GAAWtf,IACb4hB,GAAQ93B,EAAQ63B,GAElB73B,EAAO4Z,YAAcA,EACdme,GAAgB/3B,EAAQkW,EAAMiO,GAUvC,SAAS6T,GAAY3D,GACnB,IAAIne,EAAO1M,GAAK6qB,GAChB,OAAO,SAAStQ,EAAQkU,GAGtB,GAFAlU,EAAS2T,GAAS3T,IAClBkU,EAAyB,MAAbA,EAAoB,EAAIvZ,GAAUwZ,GAAUD,GAAY,OACnD7Z,GAAe2F,GAAS,CAGvC,IAAI9jB,GAAQ+b,GAAS+H,GAAU,KAAK1kB,MAAM,KAI1C,SADAY,GAAQ+b,GAFI9F,EAAKjW,EAAK,GAAK,MAAQA,EAAK,GAAKg4B,KAEnB,KAAK54B,MAAM,MACvB,GAAK,MAAQY,EAAK,GAAKg4B,IAEvC,OAAO/hB,EAAK6N,IAWhB,IAAIqN,GAAc/R,IAAQ,EAAI5E,GAAW,IAAI4E,GAAI,CAAC,EAAE,KAAK,IAxzK5C,IAwzKsE,SAAS9H,GAC1F,OAAO,IAAI8H,GAAI9H,IAD2D4gB,GAW5E,SAASC,GAAc3P,GACrB,OAAO,SAASxqB,GACd,IAAI0mB,EAAMC,GAAO3mB,GACjB,OAAI0mB,GAAO7V,EACFqL,GAAWlc,GAEhB0mB,GAAOzV,EACFyL,GAAW1c,GAn6I1B,SAAqBA,EAAQkb,GAC3B,OAAO/B,GAAS+B,GAAO,SAASrb,GAC9B,MAAO,CAACA,EAAKG,EAAOH,OAm6IXu6B,CAAYp6B,EAAQwqB,EAASxqB,KA6BxC,SAASq6B,GAAWpiB,EAAMiO,EAAShO,EAAS0c,EAAUC,EAAS+C,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KL/R,EAChB,IAAK+R,GAA4B,mBAARhgB,EACvB,MAAM,IAAIwF,GAAUtN,GAEtB,IAAI7O,EAASszB,EAAWA,EAAStzB,OAAS,EAS1C,GARKA,IACH4kB,IAAW,GACX0O,EAAWC,OA16Kb9tB,GA46KA8wB,OA56KA9wB,IA46KM8wB,EAAoBA,EAAMtX,GAAU0Z,GAAUpC,GAAM,GAC1DC,OA76KA/wB,IA66KQ+wB,EAAsBA,EAAQmC,GAAUnC,GAChDx2B,GAAUuzB,EAAUA,EAAQvzB,OAAS,EAx4KX,GA04KtB4kB,EAAmC,CACrC,IAAIwR,EAAgB9C,EAChB+C,EAAe9C,EAEnBD,EAAWC,OAp7Kb9tB,EAs7KA,IAAI+I,EAAOmoB,OAt7KXlxB,EAs7KmCuwB,GAAQrf,GAEvC2hB,EAAU,CACZ3hB,EAAMiO,EAAShO,EAAS0c,EAAUC,EAAS6C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfIhoB,GA26BN,SAAmBA,EAAMwC,GACvB,IAAI4T,EAAUpW,EAAK,GACfwqB,EAAahoB,EAAO,GACpBioB,EAAarU,EAAUoU,EACvB5R,EAAW6R,EAAU,IAErBC,EAv0MY,KAw0MZF,GA50Mc,GA40MmBpU,GAx0MrB,KAy0MZoU,GAx0Mc,KAw0MmBpU,GAAgCpW,EAAK,GAAGxO,QAAUgR,EAAO,IAChF,KAAVgoB,GAAqDhoB,EAAO,GAAGhR,QAAUgR,EAAO,IA90MlE,GA80M0E4T,EAG5F,IAAMwC,IAAY8R,EAChB,OAAO1qB,EAr1MQ,EAw1MbwqB,IACFxqB,EAAK,GAAKwC,EAAO,GAEjBioB,GA31Me,EA21MDrU,EAA2B,EAz1MnB,GA41MxB,IAAI3mB,EAAQ+S,EAAO,GACnB,GAAI/S,EAAO,CACT,IAAIq1B,EAAW9kB,EAAK,GACpBA,EAAK,GAAK8kB,EAAWD,GAAYC,EAAUr1B,EAAO+S,EAAO,IAAM/S,EAC/DuQ,EAAK,GAAK8kB,EAAWrY,GAAezM,EAAK,GAAIM,GAAekC,EAAO,IAGrE/S,EAAQ+S,EAAO,MAEbsiB,EAAW9kB,EAAK,GAChBA,EAAK,GAAK8kB,EAAWU,GAAiBV,EAAUr1B,EAAO+S,EAAO,IAAM/S,EACpEuQ,EAAK,GAAK8kB,EAAWrY,GAAezM,EAAK,GAAIM,GAAekC,EAAO,KAGrE/S,EAAQ+S,EAAO,MAEbxC,EAAK,GAAKvQ,GAv2MI,IA02MZ+6B,IACFxqB,EAAK,GAAgB,MAAXA,EAAK,GAAawC,EAAO,GAAKmO,GAAU3Q,EAAK,GAAIwC,EAAO,KAGrD,MAAXxC,EAAK,KACPA,EAAK,GAAKwC,EAAO,IAGnBxC,EAAK,GAAKwC,EAAO,GACjBxC,EAAK,GAAKyqB,EA59BRE,CAAUb,EAAS9pB,GAErBmI,EAAO2hB,EAAQ,GACf1T,EAAU0T,EAAQ,GAClB1hB,EAAU0hB,EAAQ,GAClBhF,EAAWgF,EAAQ,GACnB/E,EAAU+E,EAAQ,KAClB9B,EAAQ8B,EAAQ,QAr8KhB7yB,IAq8KqB6yB,EAAQ,GACxB3B,EAAY,EAAIhgB,EAAK3W,OACtBif,GAAUqZ,EAAQ,GAAKt4B,EAAQ,KAEd,GAAP4kB,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGdnkB,EA56KgB,GA26KPmkB,GA16Ka,IA06KiBA,EApgB3C,SAAqBjO,EAAMiO,EAAS4R,GAClC,IAAIzQ,EAAOoP,GAAWxe,GAwBtB,OAtBA,SAASkf,IAMP,IALA,IAAI71B,EAASo1B,UAAUp1B,OACnB6W,EAAOiB,EAAM9X,GACbqB,EAAQrB,EACRqa,EAAcwc,GAAUhB,GAErBx0B,KACLwV,EAAKxV,GAAS+zB,UAAU/zB,GAE1B,IAAIkyB,EAAWvzB,EAAS,GAAK6W,EAAK,KAAOwD,GAAexD,EAAK7W,EAAS,KAAOqa,EACzE,GACAY,GAAepE,EAAMwD,GAGzB,IADAra,GAAUuzB,EAAQvzB,QACLw2B,EACX,OAAOQ,GACLrgB,EAAMiO,EAASuR,GAAcN,EAAQxb,iBA79J3C5U,EA89JMoR,EAAM0c,OA99JZ9tB,SA89J2C+wB,EAAQx2B,GAEjD,IAAIi3B,EAAMh4B,MAAQA,OAASmW,IAAQnW,gBAAgB42B,EAAW9P,EAAOpP,EACrE,OAAOD,GAAMugB,EAAIh4B,KAAM4X,IA8eduiB,CAAYziB,EAAMiO,EAAS4R,GA16KlB,IA26KR5R,GAAuC,IAAPA,GAAqD2O,EAAQvzB,OAG9Fm2B,GAAazf,WAn9KxBjR,EAm9KyC6yB,GA9O3C,SAAuB3hB,EAAMiO,EAAShO,EAAS0c,GAC7C,IAAIoD,EAtsKa,EAssKJ9R,EACTmB,EAAOoP,GAAWxe,GAkBtB,OAhBA,SAASkf,IAQP,IAPA,IAAIpC,GAAa,EACbC,EAAa0B,UAAUp1B,OACvB4zB,GAAa,EACbC,EAAaP,EAAStzB,OACtB6W,EAAOiB,EAAM+b,EAAaH,GAC1BuD,EAAMh4B,MAAQA,OAASmW,IAAQnW,gBAAgB42B,EAAW9P,EAAOpP,IAE5Did,EAAYC,GACnBhd,EAAK+c,GAAaN,EAASM,GAE7B,KAAOF,KACL7c,EAAK+c,KAAewB,YAAY3B,GAElC,OAAO/c,GAAMugB,EAAIP,EAAS9f,EAAU3X,KAAM4X,IA0NjCwiB,CAAc1iB,EAAMiO,EAAShO,EAAS0c,QAJ/C,IAAI7yB,EAhmBR,SAAoBkW,EAAMiO,EAAShO,GACjC,IAAI8f,EA90Ja,EA80JJ9R,EACTmB,EAAOoP,GAAWxe,GAMtB,OAJA,SAASkf,IACP,IAAIoB,EAAMh4B,MAAQA,OAASmW,IAAQnW,gBAAgB42B,EAAW9P,EAAOpP,EACrE,OAAOsgB,EAAGvgB,MAAMggB,EAAS9f,EAAU3X,KAAMm2B,YA0lB5BkE,CAAW3iB,EAAMiO,EAAShO,GASzC,OAAO4hB,IADMhqB,EAAO2hB,GAAcoI,IACJ93B,EAAQ63B,GAAU3hB,EAAMiO,GAexD,SAAS2U,GAAuBvV,EAAUwI,EAAUjuB,EAAKG,GACvD,YAt+KA+G,IAs+KIue,GACCH,GAAGG,EAAU1H,GAAY/d,MAAUM,GAAe1B,KAAKuB,EAAQH,GAC3DiuB,EAEFxI,EAiBT,SAASwV,GAAoBxV,EAAUwI,EAAUjuB,EAAKG,EAAQsS,EAAQ8T,GAOpE,OANIzD,GAAS2C,IAAa3C,GAASmL,KAEjC1H,EAAM3J,IAAIqR,EAAUxI,GACpB4J,GAAU5J,EAAUwI,OA//KtB/mB,EA+/K2C+zB,GAAqB1U,GAC9DA,EAAc,OAAE0H,IAEXxI,EAYT,SAASyV,GAAgBx7B,GACvB,OAAOkwB,GAAclwB,QA/gLrBwH,EA+gL0CxH,EAgB5C,SAASgtB,GAAYlU,EAAO2S,EAAO9E,EAASC,EAAY4F,EAAW3F,GACjE,IAAIsG,EApgLmB,EAogLPxG,EACZ8U,EAAY3iB,EAAM/W,OAClB+pB,EAAYL,EAAM1pB,OAEtB,GAAI05B,GAAa3P,KAAeqB,GAAarB,EAAY2P,GACvD,OAAO,EAGT,IAAIC,EAAa7U,EAAMjnB,IAAIkZ,GACvB8U,EAAa/G,EAAMjnB,IAAI6rB,GAC3B,GAAIiQ,GAAc9N,EAChB,OAAO8N,GAAcjQ,GAASmC,GAAc9U,EAE9C,IAAI1V,GAAS,EACTZ,GAAS,EACT2pB,EAlhLqB,EAkhLbxF,EAAoC,IAAIpC,QA/iLpD/c,EAqjLA,IAJAqf,EAAM3J,IAAIpE,EAAO2S,GACjB5E,EAAM3J,IAAIuO,EAAO3S,KAGR1V,EAAQq4B,GAAW,CAC1B,IAAIE,EAAW7iB,EAAM1V,GACjB0qB,EAAWrC,EAAMroB,GAErB,GAAIwjB,EACF,IAAImH,EAAWZ,EACXvG,EAAWkH,EAAU6N,EAAUv4B,EAAOqoB,EAAO3S,EAAO+N,GACpDD,EAAW+U,EAAU7N,EAAU1qB,EAAO0V,EAAO2S,EAAO5E,GAE1D,QA9jLFrf,IA8jLMumB,EAAwB,CAC1B,GAAIA,EACF,SAEFvrB,GAAS,EACT,MAGF,GAAI2pB,GACF,IAAK/R,GAAUqR,GAAO,SAASqC,EAAU/B,GACnC,IAAKnQ,GAASuQ,EAAMJ,KACf4P,IAAa7N,GAAYtB,EAAUmP,EAAU7N,EAAUnH,EAASC,EAAYC,IAC/E,OAAOsF,EAAK1kB,KAAKskB,MAEjB,CACNvpB,GAAS,EACT,YAEG,GACDm5B,IAAa7N,IACXtB,EAAUmP,EAAU7N,EAAUnH,EAASC,EAAYC,GACpD,CACLrkB,GAAS,EACT,OAKJ,OAFAqkB,EAAc,OAAE/N,GAChB+N,EAAc,OAAE4E,GACTjpB,EA0KT,SAASg1B,GAAS9e,GAChB,OAAOmZ,GAAYC,GAASpZ,OArwL5BlR,EAqwL6Co0B,IAAUljB,EAAO,IAUhE,SAASmQ,GAAWpoB,GAClB,OAAOuqB,GAAevqB,EAAQY,GAAMumB,IAWtC,SAASgB,GAAanoB,GACpB,OAAOuqB,GAAevqB,EAAQinB,GAAQF,IAUxC,IAAIuQ,GAAW/V,GAAiB,SAAStJ,GACvC,OAAOsJ,GAAQpiB,IAAI8Y,IADIiiB,GAWzB,SAAS9C,GAAYnf,GAKnB,IAJA,IAAIlW,EAAUkW,EAAKpZ,KAAO,GACtBwZ,EAAQmJ,GAAUzf,GAClBT,EAASnB,GAAe1B,KAAK+iB,GAAWzf,GAAUsW,EAAM/W,OAAS,EAE9DA,KAAU,CACf,IAAIwO,EAAOuI,EAAM/W,GACb85B,EAAYtrB,EAAKmI,KACrB,GAAiB,MAAbmjB,GAAqBA,GAAanjB,EACpC,OAAOnI,EAAKjR,KAGhB,OAAOkD,EAUT,SAASo2B,GAAUlgB,GAEjB,OADa9X,GAAe1B,KAAK0jB,GAAQ,eAAiBA,GAASlK,GACrD0D,YAchB,SAASqU,KACP,IAAIjuB,EAASogB,GAAO5J,UAAYA,GAEhC,OADAxW,EAASA,IAAWwW,GAAW0V,GAAelsB,EACvC20B,UAAUp1B,OAASS,EAAO20B,UAAU,GAAIA,UAAU,IAAM30B,EAWjE,SAASinB,GAAWljB,EAAKjG,GACvB,IAgYiBN,EACboE,EAjYAmM,EAAOhK,EAAIie,SACf,OAiYgB,WADZpgB,EAAI,EADSpE,EA/XAM,KAiYmB,UAAR8D,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVpE,EACU,OAAVA,GAlYDuQ,EAAmB,iBAAPjQ,EAAkB,SAAW,QACzCiQ,EAAKhK,IAUX,SAAS+oB,GAAa7uB,GAIpB,IAHA,IAAI+B,EAASnB,GAAKZ,GACdsB,EAASS,EAAOT,OAEbA,KAAU,CACf,IAAIzB,EAAMkC,EAAOT,GACb/B,EAAQS,EAAOH,GAEnBkC,EAAOT,GAAU,CAACzB,EAAKN,EAAOyvB,GAAmBzvB,IAEnD,OAAOwC,EAWT,SAASsd,GAAUrf,EAAQH,GACzB,IAAIN,EAlxJR,SAAkBS,EAAQH,GACxB,OAAiB,MAAVG,OAxnCL+G,EAwnCkC/G,EAAOH,GAixJ7Bw7B,CAASr7B,EAAQH,GAC7B,OAAOmuB,GAAazuB,GAASA,OA14L7BwH,EA+6LF,IAAIogB,GAAcpH,GAA+B,SAAS/f,GACxD,OAAc,MAAVA,EACK,IAETA,EAAShB,GAAOgB,GACT6Y,GAAYkH,GAAiB/f,IAAS,SAAS+nB,GACpD,OAAOjJ,GAAqBrgB,KAAKuB,EAAQ+nB,QANRuT,GAiBjCvU,GAAgBhH,GAA+B,SAAS/f,GAE1D,IADA,IAAI+B,EAAS,GACN/B,GACLqZ,GAAUtX,EAAQolB,GAAWnnB,IAC7BA,EAAS2e,GAAa3e,GAExB,OAAO+B,GAN8Bu5B,GAgBnC3U,GAAS+D,GA2Eb,SAAS6Q,GAAQv7B,EAAQyC,EAAM+4B,GAO7B,IAJA,IAAI74B,GAAS,EACTrB,GAHJmB,EAAO4nB,GAAS5nB,EAAMzC,IAGJsB,OACdS,GAAS,IAEJY,EAAQrB,GAAQ,CACvB,IAAIzB,EAAMyqB,GAAM7nB,EAAKE,IACrB,KAAMZ,EAAmB,MAAV/B,GAAkBw7B,EAAQx7B,EAAQH,IAC/C,MAEFG,EAASA,EAAOH,GAElB,OAAIkC,KAAYY,GAASrB,EAChBS,KAETT,EAAmB,MAAVtB,EAAiB,EAAIA,EAAOsB,SAClBm6B,GAASn6B,IAAWojB,GAAQ7kB,EAAKyB,KACjD+gB,GAAQriB,IAAWskB,GAAYtkB,IA6BpC,SAAS8mB,GAAgB9mB,GACvB,MAAqC,mBAAtBA,EAAOwmB,aAA8B8H,GAAYtuB,GAE5D,GADAyiB,GAAW9D,GAAa3e,IA8E9B,SAAS8pB,GAAcvqB,GACrB,OAAO8iB,GAAQ9iB,IAAU+kB,GAAY/kB,OAChCyf,IAAoBzf,GAASA,EAAMyf,KAW1C,SAAS0F,GAAQnlB,EAAO+B,GACtB,IAAIqC,EAAI,EAAUpE,GAGlB,SAFA+B,EAAmB,MAAVA,EAhnMU,iBAgnM0BA,KAGlC,UAARqC,GACU,UAARA,GAAoBmQ,GAASmI,KAAK1c,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ+B,EAajD,SAAS20B,GAAe12B,EAAOoD,EAAO3C,GACpC,IAAK2iB,GAAS3iB,GACZ,OAAO,EAET,IAAI2D,EAAI,EAAUhB,GAClB,SAAY,UAARgB,EACKirB,GAAY5uB,IAAW0kB,GAAQ/hB,EAAO3C,EAAOsB,QACrC,UAARqC,GAAoBhB,KAAS3C,IAE7BmlB,GAAGnlB,EAAO2C,GAAQpD,GAa7B,SAASwvB,GAAMxvB,EAAOS,GACpB,GAAIqiB,GAAQ9iB,GACV,OAAO,EAET,IAAIoE,EAAI,EAAUpE,GAClB,QAAY,UAARoE,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATpE,IAAiBkqB,GAASlqB,MAGvBqT,EAAcqJ,KAAK1c,KAAWoT,EAAasJ,KAAK1c,IAC1C,MAAVS,GAAkBT,KAASP,GAAOgB,IAyBvC,SAASu3B,GAAWtf,GAClB,IAAIof,EAAWD,GAAYnf,GACvB+S,EAAQ7I,GAAOkV,GAEnB,GAAoB,mBAATrM,KAAyBqM,KAAY/U,GAAYpiB,WAC1D,OAAO,EAET,GAAI+X,IAAS+S,EACX,OAAO,EAET,IAAIlb,EAAOwnB,GAAQtM,GACnB,QAASlb,GAAQmI,IAASnI,EAAK,IA7S5BmR,IAAY0F,GAAO,IAAI1F,GAAS,IAAIya,YAAY,MAAQpqB,GACxD4P,IAAOyF,GAAO,IAAIzF,KAAQrQ,GAC1BsQ,IAv3LU,oBAu3LCwF,GAAOxF,GAAQwa,YAC1Bva,IAAOuF,GAAO,IAAIvF,KAAQnQ,GAC1BoQ,IAAWsF,GAAO,IAAItF,KAAYjQ,KACrCuV,GAAS,SAASpnB,GAChB,IAAIwC,EAAS2oB,GAAWnrB,GACpB8nB,EAAOtlB,GAAUgP,EAAYxR,EAAMinB,iBA19LzCzf,EA29LM60B,EAAavU,EAAO3F,GAAS2F,GAAQ,GAEzC,GAAIuU,EACF,OAAQA,GACN,KAAKna,GAAoB,OAAOnQ,EAChC,KAAKqQ,GAAe,OAAO9Q,EAC3B,KAAK+Q,GAAmB,MAn4LjB,mBAo4LP,KAAKC,GAAe,OAAO5Q,EAC3B,KAAK6Q,GAAmB,OAAO1Q,EAGnC,OAAOrP,IA+SX,IAAI85B,GAAahe,GAAasM,GAAa2R,GAS3C,SAASxN,GAAY/uB,GACnB,IAAI8nB,EAAO9nB,GAASA,EAAMinB,YAG1B,OAAOjnB,KAFqB,mBAAR8nB,GAAsBA,EAAKnnB,WAAc0d,IAa/D,SAASoR,GAAmBzvB,GAC1B,OAAOA,GAAUA,IAAUojB,GAASpjB,GAYtC,SAASuvB,GAAwBjvB,EAAKiuB,GACpC,OAAO,SAAS9tB,GACd,OAAc,MAAVA,IAGGA,EAAOH,KAASiuB,SA/zMzB/mB,IAg0MK+mB,GAA2BjuB,KAAOb,GAAOgB,MAsIhD,SAASqxB,GAASpZ,EAAMhO,EAAOoS,GAE7B,OADApS,EAAQsW,QAv8MRxZ,IAu8MkBkD,EAAuBgO,EAAK3W,OAAS,EAAK2I,EAAO,GAC5D,WAML,IALA,IAAIkO,EAAOue,UACP/zB,GAAS,EACTrB,EAASif,GAAUpI,EAAK7W,OAAS2I,EAAO,GACxCoO,EAAQe,EAAM9X,KAETqB,EAAQrB,GACf+W,EAAM1V,GAASwV,EAAKlO,EAAQtH,GAE9BA,GAAS,EAET,IADA,IAAIo5B,EAAY3iB,EAAMnP,EAAQ,KACrBtH,EAAQsH,GACf8xB,EAAUp5B,GAASwV,EAAKxV,GAG1B,OADAo5B,EAAU9xB,GAASoS,EAAUhE,GACtBL,GAAMC,EAAM1X,KAAMw7B,IAY7B,SAASnQ,GAAO5rB,EAAQyC,GACtB,OAAOA,EAAKnB,OAAS,EAAItB,EAASoqB,GAAQpqB,EAAQ6xB,GAAUpvB,EAAM,GAAI,IAaxE,SAAS+1B,GAAQngB,EAAO0Y,GAKtB,IAJA,IAAIiK,EAAY3iB,EAAM/W,OAClBA,EAASmf,GAAUsQ,EAAQzvB,OAAQ05B,GACnCgB,EAAWjX,GAAU1M,GAElB/W,KAAU,CACf,IAAIqB,EAAQouB,EAAQzvB,GACpB+W,EAAM/W,GAAUojB,GAAQ/hB,EAAOq4B,GAAagB,EAASr5B,QAx/MvDoE,EA0/MA,OAAOsR,EAWT,SAASgX,GAAQrvB,EAAQH,GACvB,IAAY,gBAARA,GAAgD,mBAAhBG,EAAOH,KAIhC,aAAPA,EAIJ,OAAOG,EAAOH,GAiBhB,IAAIg6B,GAAUoC,GAASxK,IAUnB9R,GAAaD,IAAiB,SAASzH,EAAMsQ,GAC/C,OAAO7R,GAAKiJ,WAAW1H,EAAMsQ,IAW3B6I,GAAc6K,GAASvK,IAY3B,SAASoI,GAAgB3C,EAAS+E,EAAWhW,GAC3C,IAAI5T,EAAU4pB,EAAY,GAC1B,OAAO9K,GAAY+F,EA1brB,SAA2B7kB,EAAQ6pB,GACjC,IAAI76B,EAAS66B,EAAQ76B,OACrB,IAAKA,EACH,OAAOgR,EAET,IAAIsK,EAAYtb,EAAS,EAGzB,OAFA66B,EAAQvf,IAActb,EAAS,EAAI,KAAO,IAAM66B,EAAQvf,GACxDuf,EAAUA,EAAQ50B,KAAKjG,EAAS,EAAI,KAAO,KACpCgR,EAAO9J,QAAQ0K,EAAe,uBAAyBipB,EAAU,UAkb5CC,CAAkB9pB,EAqHhD,SAA2B6pB,EAASjW,GAOlC,OANAzN,GAAUpI,GAAW,SAASrO,GAC5B,IAAIzC,EAAQ,KAAOyC,EAAK,GACnBkkB,EAAUlkB,EAAK,KAAQ+W,GAAcojB,EAAS58B,IACjD48B,EAAQn1B,KAAKzH,MAGV48B,EAAQjM,OA5HuCmM,CAtjBxD,SAAwB/pB,GACtB,IAAIyK,EAAQzK,EAAOyK,MAAM5J,GACzB,OAAO4J,EAAQA,EAAM,GAAG3b,MAAMgS,GAAkB,GAojBwBkpB,CAAehqB,GAAS4T,KAYlG,SAAS+V,GAAShkB,GAChB,IAAIskB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ9b,KACR+b,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAziNE,IA0iNN,OAAO7F,UAAU,QAGnB6F,EAAQ,EAEV,OAAOtkB,EAAKD,WA/lNdjR,EA+lN+B2vB,YAYjC,SAAS5R,GAAYzM,EAAO8D,GAC1B,IAAIxZ,GAAS,EACTrB,EAAS+W,EAAM/W,OACfsb,EAAYtb,EAAS,EAGzB,IADA6a,OAhnNApV,IAgnNOoV,EAAqB7a,EAAS6a,IAC5BxZ,EAAQwZ,GAAM,CACrB,IAAIwgB,EAAO/X,GAAWjiB,EAAOia,GACzBrd,EAAQ8Y,EAAMskB,GAElBtkB,EAAMskB,GAAQtkB,EAAM1V,GACpB0V,EAAM1V,GAASpD,EAGjB,OADA8Y,EAAM/W,OAAS6a,EACR9D,EAUT,IAAI6b,GAvTJ,SAAuBjc,GACrB,IAAIlW,EAAS66B,GAAQ3kB,GAAM,SAASpY,GAIlC,OAh0MiB,MA6zMbub,EAAMe,MACRf,EAAMsI,QAED7jB,KAGLub,EAAQrZ,EAAOqZ,MACnB,OAAOrZ,EA8SU86B,EAAc,SAAS/hB,GACxC,IAAI/Y,EAAS,GAOb,OAN6B,KAAzB+Y,EAAOgiB,WAAW,IACpB/6B,EAAOiF,KAAK,IAEd8T,EAAOtS,QAAQqK,GAAY,SAASkK,EAAO+I,EAAQiX,EAAOC,GACxDj7B,EAAOiF,KAAK+1B,EAAQC,EAAUx0B,QAAQ+K,GAAc,MAASuS,GAAU/I,MAElEhb,KAUT,SAASuoB,GAAM/qB,GACb,GAAoB,iBAATA,GAAqBkqB,GAASlqB,GACvC,OAAOA,EAET,IAAIwC,EAAUxC,EAAQ,GACtB,MAAkB,KAAVwC,GAAkB,EAAIxC,IAjmNnB,IAimN0C,KAAOwC,EAU9D,SAAS2f,GAASzJ,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO6F,GAAarf,KAAKwZ,GACzB,MAAOxX,IACT,IACE,OAAQwX,EAAO,GACf,MAAOxX,KAEX,MAAO,GA4BT,SAAS+hB,GAAa2U,GACpB,GAAIA,aAAmB7U,GACrB,OAAO6U,EAAQ8F,QAEjB,IAAIl7B,EAAS,IAAIwgB,GAAc4U,EAAQrU,YAAaqU,EAAQnU,WAI5D,OAHAjhB,EAAOghB,YAAcgC,GAAUoS,EAAQpU,aACvChhB,EAAOkhB,UAAakU,EAAQlU,UAC5BlhB,EAAOmhB,WAAaiU,EAAQjU,WACrBnhB,EAsIT,IAAIm7B,GAAa/L,IAAS,SAAS9Y,EAAOiB,GACxC,OAAOkW,GAAkBnX,GACrBmQ,GAAenQ,EAAOsR,GAAYrQ,EAAQ,EAAGkW,IAAmB,IAChE,MA6BF2N,GAAehM,IAAS,SAAS9Y,EAAOiB,GAC1C,IAAIf,EAAW1L,GAAKyM,GAIpB,OAHIkW,GAAkBjX,KACpBA,OA13NFxR,GA43NOyoB,GAAkBnX,GACrBmQ,GAAenQ,EAAOsR,GAAYrQ,EAAQ,EAAGkW,IAAmB,GAAOQ,GAAYzX,EAAU,IAC7F,MA0BF6kB,GAAiBjM,IAAS,SAAS9Y,EAAOiB,GAC5C,IAAIJ,EAAarM,GAAKyM,GAItB,OAHIkW,GAAkBtW,KACpBA,OA35NFnS,GA65NOyoB,GAAkBnX,GACrBmQ,GAAenQ,EAAOsR,GAAYrQ,EAAQ,EAAGkW,IAAmB,QA95NpEzoB,EA85NsFmS,GAClF,MAsON,SAASmkB,GAAUhlB,EAAOO,EAAWsB,GACnC,IAAI5Y,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIqB,EAAqB,MAAbuX,EAAoB,EAAI+f,GAAU/f,GAI9C,OAHIvX,EAAQ,IACVA,EAAQ4d,GAAUjf,EAASqB,EAAO,IAE7BsX,GAAc5B,EAAO2X,GAAYpX,EAAW,GAAIjW,GAsCzD,SAAS26B,GAAcjlB,EAAOO,EAAWsB,GACvC,IAAI5Y,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIqB,EAAQrB,EAAS,EAOrB,YAhsOAyF,IA0rOImT,IACFvX,EAAQs3B,GAAU/f,GAClBvX,EAAQuX,EAAY,EAChBqG,GAAUjf,EAASqB,EAAO,GAC1B8d,GAAU9d,EAAOrB,EAAS,IAEzB2Y,GAAc5B,EAAO2X,GAAYpX,EAAW,GAAIjW,GAAO,GAiBhE,SAASw4B,GAAQ9iB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAM/W,QACvBqoB,GAAYtR,EAAO,GAAK,GAgG1C,SAASklB,GAAKllB,GACZ,OAAQA,GAASA,EAAM/W,OAAU+W,EAAM,QApzOvCtR,EA83OF,IAAIy2B,GAAerM,IAAS,SAAS/F,GACnC,IAAIqS,EAAStkB,GAASiS,EAAQ4I,IAC9B,OAAQyJ,EAAOn8B,QAAUm8B,EAAO,KAAOrS,EAAO,GAC1CD,GAAiBsS,GACjB,MA0BFC,GAAiBvM,IAAS,SAAS/F,GACrC,IAAI7S,EAAW1L,GAAKue,GAChBqS,EAAStkB,GAASiS,EAAQ4I,IAO9B,OALIzb,IAAa1L,GAAK4wB,GACpBllB,OAj6OFxR,EAm6OE02B,EAAO9xB,MAED8xB,EAAOn8B,QAAUm8B,EAAO,KAAOrS,EAAO,GAC1CD,GAAiBsS,EAAQzN,GAAYzX,EAAU,IAC/C,MAwBFolB,GAAmBxM,IAAS,SAAS/F,GACvC,IAAIlS,EAAarM,GAAKue,GAClBqS,EAAStkB,GAASiS,EAAQ4I,IAM9B,OAJA9a,EAAkC,mBAAdA,EAA2BA,OAn8O/CnS,IAq8OE02B,EAAO9xB,MAED8xB,EAAOn8B,QAAUm8B,EAAO,KAAOrS,EAAO,GAC1CD,GAAiBsS,OAx8OrB12B,EAw8OwCmS,GACpC,MAoCN,SAASrM,GAAKwL,GACZ,IAAI/W,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAOA,EAAS+W,EAAM/W,EAAS,QA/+O/ByF,EAskPF,IAAI62B,GAAOzM,GAAS0M,IAsBpB,SAASA,GAAQxlB,EAAOiB,GACtB,OAAQjB,GAASA,EAAM/W,QAAUgY,GAAUA,EAAOhY,OAC9CuvB,GAAYxY,EAAOiB,GACnBjB,EAqFN,IAAIylB,GAAS/G,IAAS,SAAS1e,EAAO0Y,GACpC,IAAIzvB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACnCS,EAAS6jB,GAAOvN,EAAO0Y,GAM3B,OAJAD,GAAWzY,EAAOc,GAAS4X,GAAS,SAASpuB,GAC3C,OAAO+hB,GAAQ/hB,EAAOrB,IAAWqB,EAAQA,KACxCutB,KAAKM,KAEDzuB,KA2ET,SAASif,GAAQ3I,GACf,OAAgB,MAATA,EAAgBA,EAAQ0I,GAActiB,KAAK4Z,GAkapD,IAAI0lB,GAAQ5M,IAAS,SAAS/F,GAC5B,OAAO8H,GAASvJ,GAAYyB,EAAQ,EAAGoE,IAAmB,OA0BxDwO,GAAU7M,IAAS,SAAS/F,GAC9B,IAAI7S,EAAW1L,GAAKue,GAIpB,OAHIoE,GAAkBjX,KACpBA,OAxsQFxR,GA0sQOmsB,GAASvJ,GAAYyB,EAAQ,EAAGoE,IAAmB,GAAOQ,GAAYzX,EAAU,OAwBrF0lB,GAAY9M,IAAS,SAAS/F,GAChC,IAAIlS,EAAarM,GAAKue,GAEtB,OADAlS,EAAkC,mBAAdA,EAA2BA,OApuQ/CnS,EAquQOmsB,GAASvJ,GAAYyB,EAAQ,EAAGoE,IAAmB,QAruQ1DzoB,EAquQ4EmS,MAgG9E,SAASglB,GAAM7lB,GACb,IAAMA,IAASA,EAAM/W,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANA+W,EAAQQ,GAAYR,GAAO,SAAS8lB,GAClC,GAAI3O,GAAkB2O,GAEpB,OADA78B,EAASif,GAAU4d,EAAM78B,OAAQA,IAC1B,KAGJsZ,GAAUtZ,GAAQ,SAASqB,GAChC,OAAOwW,GAASd,EAAOwB,GAAalX,OAyBxC,SAASy7B,GAAU/lB,EAAOE,GACxB,IAAMF,IAASA,EAAM/W,OACnB,MAAO,GAET,IAAIS,EAASm8B,GAAM7lB,GACnB,OAAgB,MAAZE,EACKxW,EAEFoX,GAASpX,GAAQ,SAASo8B,GAC/B,OAAOnmB,GAAMO,OAn3QfxR,EAm3QoCo3B,MAwBtC,IAAIE,GAAUlN,IAAS,SAAS9Y,EAAOiB,GACrC,OAAOkW,GAAkBnX,GACrBmQ,GAAenQ,EAAOiB,GACtB,MAqBFglB,GAAMnN,IAAS,SAAS/F,GAC1B,OAAOwI,GAAQ/a,GAAYuS,EAAQoE,QA0BjC+O,GAAQpN,IAAS,SAAS/F,GAC5B,IAAI7S,EAAW1L,GAAKue,GAIpB,OAHIoE,GAAkBjX,KACpBA,OAj8QFxR,GAm8QO6sB,GAAQ/a,GAAYuS,EAAQoE,IAAoBQ,GAAYzX,EAAU,OAwB3EimB,GAAUrN,IAAS,SAAS/F,GAC9B,IAAIlS,EAAarM,GAAKue,GAEtB,OADAlS,EAAkC,mBAAdA,EAA2BA,OA79Q/CnS,EA89QO6sB,GAAQ/a,GAAYuS,EAAQoE,SA99QnCzoB,EA89QkEmS,MAmBhEulB,GAAMtN,GAAS+M,IA6DnB,IAAIQ,GAAUvN,IAAS,SAAS/F,GAC9B,IAAI9pB,EAAS8pB,EAAO9pB,OAChBiX,EAAWjX,EAAS,EAAI8pB,EAAO9pB,EAAS,QAhjR5CyF,EAmjRA,OADAwR,EAA8B,mBAAZA,GAA0B6S,EAAOzf,MAAO4M,QAljR1DxR,EAmjROq3B,GAAUhT,EAAQ7S,MAkC3B,SAASomB,GAAMp/B,GACb,IAAIwC,EAASogB,GAAO5iB,GAEpB,OADAwC,EAAOihB,WAAY,EACZjhB,EAsDT,SAASm1B,GAAK33B,EAAOq/B,GACnB,OAAOA,EAAYr/B,GAmBrB,IAAIs/B,GAAY9H,IAAS,SAAS5qB,GAChC,IAAI7K,EAAS6K,EAAM7K,OACf2I,EAAQ3I,EAAS6K,EAAM,GAAK,EAC5B5M,EAAQgB,KAAKuiB,YACb8b,EAAc,SAAS5+B,GAAU,OAAO4lB,GAAO5lB,EAAQmM,IAE3D,QAAI7K,EAAS,GAAKf,KAAKwiB,YAAYzhB,SAC7B/B,aAAiB+iB,IAAiBoC,GAAQza,KAGhD1K,EAAQA,EAAMkL,MAAMR,GAAQA,GAAS3I,EAAS,EAAI,KAC5CyhB,YAAY/b,KAAK,CACrB,KAAQkwB,GACR,KAAQ,CAAC0H,GACT,aAhrRF73B,IAkrRO,IAAIwb,GAAchjB,EAAOgB,KAAKyiB,WAAWkU,MAAK,SAAS7e,GAI5D,OAHI/W,IAAW+W,EAAM/W,QACnB+W,EAAMrR,UAprRVD,GAsrRSsR,MAZA9X,KAAK22B,KAAK0H,MA+PrB,IAAIE,GAAUnJ,IAAiB,SAAS5zB,EAAQxC,EAAOM,GACjDM,GAAe1B,KAAKsD,EAAQlC,KAC5BkC,EAAOlC,GAETulB,GAAgBrjB,EAAQlC,EAAK,MAuIjC,IAAIoI,GAAO2uB,GAAWyG,IAqBlB0B,GAAWnI,GAAW0G,IA2G1B,SAASz8B,GAAQkZ,EAAYxB,GAE3B,OADW8J,GAAQtI,GAActB,GAAYgN,IACjC1L,EAAYiW,GAAYzX,EAAU,IAuBhD,SAASymB,GAAajlB,EAAYxB,GAEhC,OADW8J,GAAQtI,GAAcrB,GAAiB2Q,IACtCtP,EAAYiW,GAAYzX,EAAU,IA0BhD,IAAI0mB,GAAUtJ,IAAiB,SAAS5zB,EAAQxC,EAAOM,GACjDM,GAAe1B,KAAKsD,EAAQlC,GAC9BkC,EAAOlC,GAAKmH,KAAKzH,GAEjB6lB,GAAgBrjB,EAAQlC,EAAK,CAACN,OAsElC,IAAI2/B,GAAY/N,IAAS,SAASpX,EAAYtX,EAAM0V,GAClD,IAAIxV,GAAS,EACTikB,EAAwB,mBAARnkB,EAChBV,EAAS6sB,GAAY7U,GAAcX,EAAMW,EAAWzY,QAAU,GAKlE,OAHAmkB,GAAS1L,GAAY,SAASxa,GAC5BwC,IAASY,GAASikB,EAAS5O,GAAMvV,EAAMlD,EAAO4Y,GAAQwT,GAAWpsB,EAAOkD,EAAM0V,MAEzEpW,KA+BLo9B,GAAQxJ,IAAiB,SAAS5zB,EAAQxC,EAAOM,GACnDulB,GAAgBrjB,EAAQlC,EAAKN,MA6C/B,SAASuG,GAAIiU,EAAYxB,GAEvB,OADW8J,GAAQtI,GAAcZ,GAAWwV,IAChC5U,EAAYiW,GAAYzX,EAAU,IAkFhD,IAAI6mB,GAAYzJ,IAAiB,SAAS5zB,EAAQxC,EAAOM,GACvDkC,EAAOlC,EAAM,EAAI,GAAGmH,KAAKzH,MACxB,WAAa,MAAO,CAAC,GAAI,OAmS5B,IAAI6O,GAAS+iB,IAAS,SAASpX,EAAY+V,GACzC,GAAkB,MAAd/V,EACF,MAAO,GAET,IAAIzY,EAASwuB,EAAUxuB,OAMvB,OALIA,EAAS,GAAK20B,GAAelc,EAAY+V,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHxuB,EAAS,GAAK20B,GAAenG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAY9V,EAAY4P,GAAYmG,EAAW,GAAI,OAqBxDrQ,GAAMD,IAAU,WAClB,OAAO9I,GAAK5L,KAAK2U,OA0DnB,SAASoY,GAAI5f,EAAMlY,EAAGi2B,GAGpB,OAFAj2B,EAAIi2B,OA51TJjvB,EA41TwBhH,EAEjBs6B,GAAWpiB,EAvzTF,SAvChBlR,uBA61TAhH,EAAKkY,GAAa,MAALlY,EAAakY,EAAK3W,OAASvB,GAqB1C,SAASs/B,GAAOt/B,EAAGkY,GACjB,IAAIlW,EACJ,GAAmB,mBAARkW,EACT,MAAM,IAAIwF,GAAUtN,GAGtB,OADApQ,EAAIk6B,GAAUl6B,GACP,WAOL,QANMA,EAAI,IACRgC,EAASkW,EAAKD,MAAMzX,KAAMm2B,YAExB32B,GAAK,IACPkY,OA73TJlR,GA+3TShF,GAuCX,IAAIjC,GAAOqxB,IAAS,SAASlZ,EAAMC,EAAS0c,GAC1C,IAAI1O,EAv4Ta,EAw4TjB,GAAI0O,EAAStzB,OAAQ,CACnB,IAAIuzB,EAAUtY,GAAeqY,EAAUuD,GAAUr4B,KACjDomB,GAr4TkB,GAu4TpB,OAAOmU,GAAWpiB,EAAMiO,EAAShO,EAAS0c,EAAUC,MAgDlDyK,GAAUnO,IAAS,SAASnxB,EAAQH,EAAK+0B,GAC3C,IAAI1O,EAAUqZ,EACd,GAAI3K,EAAStzB,OAAQ,CACnB,IAAIuzB,EAAUtY,GAAeqY,EAAUuD,GAAUmH,KACjDpZ,GA37TkB,GA67TpB,OAAOmU,GAAWx6B,EAAKqmB,EAASlmB,EAAQ40B,EAAUC,MAsJpD,SAAS7mB,GAASiK,EAAMsQ,EAAMriB,GAC5B,IAAIs5B,EACAC,EACAC,EACA39B,EACA49B,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT1J,GAAW,EAEf,GAAmB,mBAARpe,EACT,MAAM,IAAIwF,GAAUtN,GAUtB,SAAS6vB,EAAWC,GAClB,IAAI9nB,EAAOqnB,EACPtnB,EAAUunB,EAKd,OAHAD,EAAWC,OAnpUb14B,EAopUE84B,EAAiBI,EACjBl+B,EAASkW,EAAKD,MAAME,EAASC,GAI/B,SAAS+nB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUhgB,GAAWwgB,EAAc5X,GAE5BuX,EAAUE,EAAWC,GAAQl+B,EAatC,SAASq+B,EAAaH,GACpB,IAAII,EAAoBJ,EAAOL,EAM/B,YAnrUF74B,IAmrUU64B,GAA+BS,GAAqB9X,GACzD8X,EAAoB,GAAON,GANJE,EAAOJ,GAM8BH,EAGjE,SAASS,IACP,IAAIF,EAAOxgB,KACX,GAAI2gB,EAAaH,GACf,OAAOK,EAAaL,GAGtBN,EAAUhgB,GAAWwgB,EA3BvB,SAAuBF,GACrB,IAEIM,EAAchY,GAFM0X,EAAOL,GAI/B,OAAOG,EACHtf,GAAU8f,EAAab,GAJDO,EAAOJ,IAK7BU,EAoB+BC,CAAcP,IAGnD,SAASK,EAAaL,GAKpB,OAJAN,OAjsUF54B,EAqsUMsvB,GAAYmJ,EACPQ,EAAWC,IAEpBT,EAAWC,OAxsUb14B,EAysUShF,GAeT,SAAS0+B,IACP,IAAIR,EAAOxgB,KACPihB,EAAaN,EAAaH,GAM9B,GAJAT,EAAW9I,UACX+I,EAAWl/B,KACXq/B,EAAeK,EAEXS,EAAY,CACd,QAjuUJ35B,IAiuUQ44B,EACF,OAAOO,EAAYN,GAErB,GAAIG,EAIF,OAFAxgB,GAAaogB,GACbA,EAAUhgB,GAAWwgB,EAAc5X,GAC5ByX,EAAWJ,GAMtB,YA9uUF74B,IA2uUM44B,IACFA,EAAUhgB,GAAWwgB,EAAc5X,IAE9BxmB,EAIT,OA3GAwmB,EAAOkR,GAASlR,IAAS,EACrB5F,GAASzc,KACX45B,IAAY55B,EAAQ45B,QAEpBJ,GADAK,EAAS,YAAa75B,GACHqa,GAAUkZ,GAASvzB,EAAQw5B,UAAY,EAAGnX,GAAQmX,EACrErJ,EAAW,aAAcnwB,IAAYA,EAAQmwB,SAAWA,GAoG1DoK,EAAUE,OApCV,gBA5sUA55B,IA6sUM44B,GACFpgB,GAAaogB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,OAjtUvC54B,GAivUA05B,EAAUG,MA7BV,WACE,YArtUF75B,IAqtUS44B,EAAwB59B,EAASu+B,EAAa7gB,OA6BhDghB,EAqBT,IAAII,GAAQ1P,IAAS,SAASlZ,EAAME,GAClC,OAAOmQ,GAAUrQ,EAAM,EAAGE,MAsBxB2oB,GAAQ3P,IAAS,SAASlZ,EAAMsQ,EAAMpQ,GACxC,OAAOmQ,GAAUrQ,EAAMwhB,GAASlR,IAAS,EAAGpQ,MAqE9C,SAASykB,GAAQ3kB,EAAM8oB,GACrB,GAAmB,mBAAR9oB,GAAmC,MAAZ8oB,GAAuC,mBAAZA,EAC3D,MAAM,IAAItjB,GAAUtN,GAEtB,IAAI6wB,EAAW,SAAXA,IACF,IAAI7oB,EAAOue,UACP72B,EAAMkhC,EAAWA,EAAS/oB,MAAMzX,KAAM4X,GAAQA,EAAK,GACnDiD,EAAQ4lB,EAAS5lB,MAErB,GAAIA,EAAMC,IAAIxb,GACZ,OAAOub,EAAMjc,IAAIU,GAEnB,IAAIkC,EAASkW,EAAKD,MAAMzX,KAAM4X,GAE9B,OADA6oB,EAAS5lB,MAAQA,EAAMqB,IAAI5c,EAAKkC,IAAWqZ,EACpCrZ,GAGT,OADAi/B,EAAS5lB,MAAQ,IAAKwhB,GAAQqE,OAASpd,IAChCmd,EA0BT,SAASE,GAAOtoB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAI6E,GAAUtN,GAEtB,OAAO,WACL,IAAIgI,EAAOue,UACX,OAAQve,EAAK7W,QACX,KAAK,EAAG,OAAQsX,EAAUna,KAAK8B,MAC/B,KAAK,EAAG,OAAQqY,EAAUna,KAAK8B,KAAM4X,EAAK,IAC1C,KAAK,EAAG,OAAQS,EAAUna,KAAK8B,KAAM4X,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQS,EAAUna,KAAK8B,KAAM4X,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQS,EAAUZ,MAAMzX,KAAM4X,IAlClCykB,GAAQqE,MAAQpd,GA2FhB,IAAIsd,GAAWhN,IAAS,SAASlc,EAAMmpB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAW9/B,QAAe+gB,GAAQ+e,EAAW,IACvDjoB,GAASioB,EAAW,GAAIpmB,GAAUgV,OAClC7W,GAASwQ,GAAYyX,EAAY,GAAIpmB,GAAUgV,QAEtB1uB,OAC7B,OAAO6vB,IAAS,SAAShZ,GAIvB,IAHA,IAAIxV,GAAS,EACTrB,EAASmf,GAAUtI,EAAK7W,OAAQ+/B,KAE3B1+B,EAAQrB,GACf6W,EAAKxV,GAASy+B,EAAWz+B,GAAOlE,KAAK8B,KAAM4X,EAAKxV,IAElD,OAAOqV,GAAMC,EAAM1X,KAAM4X,SAqCzBmpB,GAAUnQ,IAAS,SAASlZ,EAAM2c,GAEpC,OAAOyF,GAAWpiB,EAn+UE,QArCpBlR,EAwgVsD6tB,EADxCrY,GAAeqY,EAAUuD,GAAUmJ,SAoC/CC,GAAepQ,IAAS,SAASlZ,EAAM2c,GAEzC,OAAOyF,GAAWpiB,EAvgVQ,QAtC1BlR,EA6iV4D6tB,EAD9CrY,GAAeqY,EAAUuD,GAAUoJ,SA0B/CC,GAAQzK,IAAS,SAAS9e,EAAM8Y,GAClC,OAAOsJ,GAAWpiB,EA/hVA,SAxClBlR,gBAukV0EgqB,MAia5E,SAAS5L,GAAG5lB,EAAOyrB,GACjB,OAAOzrB,IAAUyrB,GAAUzrB,GAAUA,GAASyrB,GAAUA,EA0B1D,IAAIyW,GAAKjI,GAA0BzO,IAyB/B2W,GAAMlI,IAA0B,SAASj6B,EAAOyrB,GAClD,OAAOzrB,GAASyrB,KAqBd1G,GAAcuH,GAAgB,WAAa,OAAO6K,UAApB,IAAsC7K,GAAkB,SAAStsB,GACjG,OAAO6iB,GAAa7iB,IAAUY,GAAe1B,KAAKc,EAAO,YACtDuf,GAAqBrgB,KAAKc,EAAO,WA0BlC8iB,GAAUjJ,EAAMiJ,QAmBhBhL,GAAgBD,GAAoB4D,GAAU5D,IA75PlD,SAA2B7X,GACzB,OAAO6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAU8R,GAu7PrD,SAASud,GAAYrvB,GACnB,OAAgB,MAATA,GAAiBk8B,GAASl8B,EAAM+B,UAAY6oB,GAAW5qB,GA4BhE,SAASiwB,GAAkBjwB,GACzB,OAAO6iB,GAAa7iB,IAAUqvB,GAAYrvB,GA0C5C,IAAI2gB,GAAWD,IAAkB6b,GAmB7BvkB,GAASD,GAAa0D,GAAU1D,IAxgQpC,SAAoB/X,GAClB,OAAO6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAUkR,GA+qQrD,SAASkxB,GAAQpiC,GACf,IAAK6iB,GAAa7iB,GAChB,OAAO,EAET,IAAImnB,EAAMgE,GAAWnrB,GACrB,OAAOmnB,GAAOhW,GA9yWF,yBA8yWcgW,GACC,iBAAjBnnB,EAAMitB,SAA4C,iBAAdjtB,EAAMV,OAAqB4wB,GAAclwB,GAkDzF,SAAS4qB,GAAW5qB,GAClB,IAAKojB,GAASpjB,GACZ,OAAO,EAIT,IAAImnB,EAAMgE,GAAWnrB,GACrB,OAAOmnB,GAAO/V,GAAW+V,GAAO9V,GA32WrB,0BA22W+B8V,GA/1W/B,kBA+1WkDA,EA6B/D,SAASkb,GAAUriC,GACjB,MAAuB,iBAATA,GAAqBA,GAAS06B,GAAU16B,GA6BxD,SAASk8B,GAASl8B,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAj8Wf,iBA69WrB,SAASojB,GAASpjB,GAChB,IAAIoE,EAAI,EAAUpE,GAClB,OAAgB,MAATA,IAA0B,UAARoE,GAA4B,YAARA,GA2B/C,SAASye,GAAa7iB,GACpB,OAAgB,MAATA,GAAiC,UAAhB,EAAOA,GAoBjC,IAAIkY,GAAQD,GAAYwD,GAAUxD,IA5xQlC,SAAmBjY,GACjB,OAAO6iB,GAAa7iB,IAAUonB,GAAOpnB,IAAUsR,GA6+QjD,SAASgxB,GAAStiC,GAChB,MAAuB,iBAATA,GACX6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAUuR,EA+BjD,SAAS2e,GAAclwB,GACrB,IAAK6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAUwR,EAC/C,OAAO,EAET,IAAI2R,EAAQ/D,GAAapf,GACzB,GAAc,OAAVmjB,EACF,OAAO,EAET,IAAI2E,EAAOlnB,GAAe1B,KAAKikB,EAAO,gBAAkBA,EAAM8D,YAC9D,MAAsB,mBAARa,GAAsBA,aAAgBA,GAClDvJ,GAAarf,KAAK4oB,IAAShJ,GAoB/B,IAAI1G,GAAWD,GAAesD,GAAUtD,IA59QxC,SAAsBnY,GACpB,OAAO6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAUyR,GA6gRrD,IAAI6G,GAAQD,GAAYoD,GAAUpD,IAngRlC,SAAmBrY,GACjB,OAAO6iB,GAAa7iB,IAAUonB,GAAOpnB,IAAU0R,GAqhRjD,SAAS6wB,GAASviC,GAChB,MAAuB,iBAATA,IACV8iB,GAAQ9iB,IAAU6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAU2R,EAoBpE,SAASuY,GAASlqB,GAChB,MAAuB,UAAhB,EAAOA,IACX6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAU4R,EAoBjD,IAAI4G,GAAeD,GAAmBkD,GAAUlD,IAvjRhD,SAA0BvY,GACxB,OAAO6iB,GAAa7iB,IAClBk8B,GAASl8B,EAAM+B,WAAa0U,GAAe0U,GAAWnrB,KA6oR1D,IAAIwiC,GAAKvI,GAA0B9K,IAyB/BsT,GAAMxI,IAA0B,SAASj6B,EAAOyrB,GAClD,OAAOzrB,GAASyrB,KA0BlB,SAASiX,GAAQ1iC,GACf,IAAKA,EACH,MAAO,GAET,GAAIqvB,GAAYrvB,GACd,OAAOuiC,GAASviC,GAASud,GAAcvd,GAASwlB,GAAUxlB,GAE5D,GAAI2f,IAAe3f,EAAM2f,IACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIrP,EACA/N,EAAS,KAEJ+N,EAAOqP,EAAS+iB,QAAQC,MAC/BpgC,EAAOiF,KAAK8I,EAAKvQ,OAEnB,OAAOwC,EAg8VIqgC,CAAgB7iC,EAAM2f,OAE/B,IAAIwH,EAAMC,GAAOpnB,GAGjB,OAFWmnB,GAAO7V,EAASqL,GAAcwK,GAAOzV,EAASuL,GAAalD,IAE1D/Z,GA0Bd,SAAS+5B,GAAS/5B,GAChB,OAAKA,GAGLA,EAAQk6B,GAASl6B,MAzkYN,KA0kYeA,KA1kYf,IAEG,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAAS06B,GAAU16B,GACjB,IAAIwC,EAASu3B,GAAS/5B,GAClB8iC,EAAYtgC,EAAS,EAEzB,OAAOA,GAAWA,EAAUsgC,EAAYtgC,EAASsgC,EAAYtgC,EAAU,EA8BzE,SAASugC,GAAS/iC,GAChB,OAAOA,EAAQylB,GAAUiV,GAAU16B,GAAQ,EAxoYxB,YAwoY+C,EA0BpE,SAASk6B,GAASl6B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIkqB,GAASlqB,GACX,OA1qYI,IA4qYN,GAAIojB,GAASpjB,GAAQ,CACnB,IAAIyrB,EAAgC,mBAAjBzrB,EAAM0iB,QAAwB1iB,EAAM0iB,UAAY1iB,EACnEA,EAAQojB,GAASqI,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATzrB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQsb,GAAStb,GACjB,IAAIgjC,EAAW5uB,GAAWsI,KAAK1c,GAC/B,OAAQgjC,GAAY1uB,GAAUoI,KAAK1c,GAC/B8W,GAAa9W,EAAMkL,MAAM,GAAI83B,EAAW,EAAI,GAC3C7uB,GAAWuI,KAAK1c,GAvrYf,KAurY+BA,EA2BvC,SAASmwB,GAAcnwB,GACrB,OAAOomB,GAAWpmB,EAAO0nB,GAAO1nB,IAsDlC,SAASwe,GAASxe,GAChB,OAAgB,MAATA,EAAgB,GAAK0zB,GAAa1zB,GAqC3C,IAAIijC,GAAS3M,IAAe,SAAS71B,EAAQsS,GAC3C,GAAIgc,GAAYhc,IAAWsc,GAAYtc,GACrCqT,GAAWrT,EAAQ1R,GAAK0R,GAAStS,QAGnC,IAAK,IAAIH,KAAOyS,EACVnS,GAAe1B,KAAK6T,EAAQzS,IAC9BwlB,GAAYrlB,EAAQH,EAAKyS,EAAOzS,OAoClC4iC,GAAW5M,IAAe,SAAS71B,EAAQsS,GAC7CqT,GAAWrT,EAAQ2U,GAAO3U,GAAStS,MAgCjC0iC,GAAe7M,IAAe,SAAS71B,EAAQsS,EAAQ6c,EAAUhJ,GACnER,GAAWrT,EAAQ2U,GAAO3U,GAAStS,EAAQmmB,MA+BzCwc,GAAa9M,IAAe,SAAS71B,EAAQsS,EAAQ6c,EAAUhJ,GACjER,GAAWrT,EAAQ1R,GAAK0R,GAAStS,EAAQmmB,MAoBvCyc,GAAK7L,GAASnR,IA8DlB,IAAIzf,GAAWgrB,IAAS,SAASnxB,EAAQ+1B,GACvC/1B,EAAShB,GAAOgB,GAEhB,IAAI2C,GAAS,EACTrB,EAASy0B,EAAQz0B,OACjB00B,EAAQ10B,EAAS,EAAIy0B,EAAQ,QA/iZjChvB,EAqjZA,IAJIivB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD10B,EAAS,KAGFqB,EAAQrB,GAMf,IALA,IAAIgR,EAASyjB,EAAQpzB,GACjBuY,EAAQ+L,GAAO3U,GACfuwB,GAAc,EACdC,EAAc5nB,EAAM5Z,SAEfuhC,EAAaC,GAAa,CACjC,IAAIjjC,EAAMqb,EAAM2nB,GACZtjC,EAAQS,EAAOH,SA7jZvBkH,IA+jZQxH,GACC4lB,GAAG5lB,EAAOqe,GAAY/d,MAAUM,GAAe1B,KAAKuB,EAAQH,MAC/DG,EAAOH,GAAOyS,EAAOzS,IAK3B,OAAOG,KAsBL+iC,GAAe5R,IAAS,SAAShZ,GAEnC,OADAA,EAAKnR,UA7lZLD,EA6lZqB+zB,IACd9iB,GAAMgrB,QA9lZbj8B,EA8lZmCoR,MAgSrC,SAAShZ,GAAIa,EAAQyC,EAAMq2B,GACzB,IAAI/2B,EAAmB,MAAV/B,OA/3Zb+G,EA+3Z0CqjB,GAAQpqB,EAAQyC,GAC1D,YAh4ZAsE,IAg4ZOhF,EAAuB+2B,EAAe/2B,EA4D/C,SAASktB,GAAMjvB,EAAQyC,GACrB,OAAiB,MAAVzC,GAAkBu7B,GAAQv7B,EAAQyC,EAAMyoB,IAqBjD,IAAI+X,GAASxK,IAAe,SAAS12B,EAAQxC,EAAOM,GACrC,MAATN,GACyB,mBAAlBA,EAAMwe,WACfxe,EAAQ6e,GAAqB3f,KAAKc,IAGpCwC,EAAOxC,GAASM,IACf8xB,GAASzD,KA4BRgV,GAAWzK,IAAe,SAAS12B,EAAQxC,EAAOM,GACvC,MAATN,GACyB,mBAAlBA,EAAMwe,WACfxe,EAAQ6e,GAAqB3f,KAAKc,IAGhCY,GAAe1B,KAAKsD,EAAQxC,GAC9BwC,EAAOxC,GAAOyH,KAAKnH,GAEnBkC,EAAOxC,GAAS,CAACM,KAElBmwB,IAoBCmT,GAAShS,GAASxF,IA8BtB,SAAS/qB,GAAKZ,GACZ,OAAO4uB,GAAY5uB,GAAUkkB,GAAclkB,GAAUquB,GAASruB,GA0BhE,SAASinB,GAAOjnB,GACd,OAAO4uB,GAAY5uB,GAAUkkB,GAAclkB,GAAQ,GAAQuuB,GAAWvuB,GAuGxE,IAAIojC,GAAQvN,IAAe,SAAS71B,EAAQsS,EAAQ6c,GAClDD,GAAUlvB,EAAQsS,EAAQ6c,MAkCxB6T,GAAYnN,IAAe,SAAS71B,EAAQsS,EAAQ6c,EAAUhJ,GAChE+I,GAAUlvB,EAAQsS,EAAQ6c,EAAUhJ,MAuBlCkd,GAAOtM,IAAS,SAAS/2B,EAAQmM,GACnC,IAAIpK,EAAS,GACb,GAAc,MAAV/B,EACF,OAAO+B,EAET,IAAIskB,GAAS,EACbla,EAAQgN,GAAShN,GAAO,SAAS1J,GAG/B,OAFAA,EAAO4nB,GAAS5nB,EAAMzC,GACtBqmB,IAAWA,EAAS5jB,EAAKnB,OAAS,GAC3BmB,KAETkjB,GAAW3lB,EAAQmoB,GAAanoB,GAAS+B,GACrCskB,IACFtkB,EAASkkB,GAAUlkB,EAAQuhC,EAAwDvI,KAGrF,IADA,IAAIz5B,EAAS6K,EAAM7K,OACZA,KACL2vB,GAAUlvB,EAAQoK,EAAM7K,IAE1B,OAAOS,KA4CT,IAAIub,GAAOyZ,IAAS,SAAS/2B,EAAQmM,GACnC,OAAiB,MAAVnM,EAAiB,GAnmT1B,SAAkBA,EAAQmM,GACxB,OAAOwkB,GAAW3wB,EAAQmM,GAAO,SAAS5M,EAAOkD,GAC/C,OAAOwsB,GAAMjvB,EAAQyC,MAimTM8gC,CAASvjC,EAAQmM,MAqBhD,SAASq3B,GAAOxjC,EAAQ4Y,GACtB,GAAc,MAAV5Y,EACF,MAAO,GAET,IAAIkb,EAAQ/B,GAASgP,GAAanoB,IAAS,SAASmF,GAClD,MAAO,CAACA,MAGV,OADAyT,EAAYoX,GAAYpX,GACjB+X,GAAW3wB,EAAQkb,GAAO,SAAS3b,EAAOkD,GAC/C,OAAOmW,EAAUrZ,EAAOkD,EAAK,OA4IjC,IAAIghC,GAAUtJ,GAAcv5B,IA0BxB8iC,GAAYvJ,GAAclT,IA4K9B,SAAS3N,GAAOtZ,GACd,OAAiB,MAAVA,EAAiB,GAAKib,GAAWjb,EAAQY,GAAKZ,IAkNvD,IAAI2jC,GAAYrN,IAAiB,SAASv0B,EAAQuI,EAAM3H,GAEtD,OADA2H,EAAOA,EAAKI,cACL3I,GAAUY,EAAQihC,GAAWt5B,GAAQA,MAkB9C,SAASs5B,GAAW9oB,GAClB,OAAO+oB,GAAW9lB,GAASjD,GAAQpQ,eAqBrC,SAAS8rB,GAAO1b,GAEd,OADAA,EAASiD,GAASjD,KACDA,EAAOtS,QAAQuL,GAAS6H,IAAcpT,QAAQiN,GAAa,IAsH9E,IAAIquB,GAAYxN,IAAiB,SAASv0B,EAAQuI,EAAM3H,GACtD,OAAOZ,GAAUY,EAAQ,IAAM,IAAM2H,EAAKI,iBAuBxCq5B,GAAYzN,IAAiB,SAASv0B,EAAQuI,EAAM3H,GACtD,OAAOZ,GAAUY,EAAQ,IAAM,IAAM2H,EAAKI,iBAoBxCs5B,GAAa7N,GAAgB,eA0NjC,IAAI8N,GAAY3N,IAAiB,SAASv0B,EAAQuI,EAAM3H,GACtD,OAAOZ,GAAUY,EAAQ,IAAM,IAAM2H,EAAKI,iBAgE5C,IAAIw5B,GAAY5N,IAAiB,SAASv0B,EAAQuI,EAAM3H,GACtD,OAAOZ,GAAUY,EAAQ,IAAM,IAAMkhC,GAAWv5B,MAsiBlD,IAAI65B,GAAY7N,IAAiB,SAASv0B,EAAQuI,EAAM3H,GACtD,OAAOZ,GAAUY,EAAQ,IAAM,IAAM2H,EAAKE,iBAoBxCq5B,GAAa1N,GAAgB,eAqBjC,SAASI,GAAMzb,EAAQspB,EAASpO,GAI9B,OAHAlb,EAASiD,GAASjD,QA/6dlB/T,KAg7dAq9B,EAAUpO,OAh7dVjvB,EAg7d8Bq9B,GAnyblC,SAAwBtpB,GACtB,OAAOjF,GAAiBoG,KAAKnB,GAqyblBupB,CAAevpB,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAOiC,MAAMpH,KAAkB,GAyjbF2uB,CAAaxpB,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAOiC,MAAM1J,KAAgB,GAwrcuBkxB,CAAWzpB,GAE7DA,EAAOiC,MAAMqnB,IAAY,GA2BlC,IAAII,GAAUrT,IAAS,SAASlZ,EAAME,GACpC,IACE,OAAOH,GAAMC,OAl9dflR,EAk9dgCoR,GAC9B,MAAO1X,GACP,OAAOkhC,GAAQlhC,GAAKA,EAAI,IAAI8c,EAAM9c,OA8BlCgkC,GAAU1N,IAAS,SAAS/2B,EAAQ0kC,GAKtC,OAJAjsB,GAAUisB,GAAa,SAAS7kC,GAC9BA,EAAMyqB,GAAMzqB,GACZulB,GAAgBplB,EAAQH,EAAKC,GAAKE,EAAOH,GAAMG,OAE1CA,KAqGT,SAAS2xB,GAASpyB,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIolC,GAAO7N,KAuBP8N,GAAY9N,IAAW,GAkB3B,SAAS5I,GAAS3uB,GAChB,OAAOA,EA6CT,SAASgZ,GAASN,GAChB,OAAOgW,GAA4B,mBAARhW,EAAqBA,EAAOgO,GAAUhO,EAjte/C,IAwzepB,IAAI4sB,GAAS1T,IAAS,SAAS1uB,EAAM0V,GACnC,OAAO,SAASnY,GACd,OAAO2rB,GAAW3rB,EAAQyC,EAAM0V,OA2BhC2sB,GAAW3T,IAAS,SAASnxB,EAAQmY,GACvC,OAAO,SAAS1V,GACd,OAAOkpB,GAAW3rB,EAAQyC,EAAM0V,OAwCpC,SAAS4sB,GAAM/kC,EAAQsS,EAAQpM,GAC7B,IAAIgV,EAAQta,GAAK0R,GACboyB,EAAcxa,GAAc5X,EAAQ4I,GAEzB,MAAXhV,GACEyc,GAASrQ,KAAYoyB,EAAYpjC,SAAW4Z,EAAM5Z,UACtD4E,EAAUoM,EACVA,EAAStS,EACTA,EAASO,KACTmkC,EAAcxa,GAAc5X,EAAQ1R,GAAK0R,KAE3C,IAAIqsB,IAAUhc,GAASzc,IAAY,UAAWA,IAAcA,EAAQy4B,OAChE/X,EAASuD,GAAWnqB,GAqBxB,OAnBAyY,GAAUisB,GAAa,SAAStO,GAC9B,IAAIne,EAAO3F,EAAO8jB,GAClBp2B,EAAOo2B,GAAcne,EACjB2O,IACF5mB,EAAOE,UAAUk2B,GAAc,WAC7B,IAAIvT,EAAWtiB,KAAKyiB,UACpB,GAAI2b,GAAS9b,EAAU,CACrB,IAAI9gB,EAAS/B,EAAOO,KAAKuiB,aACrB4Q,EAAU3xB,EAAOghB,YAAcgC,GAAUxkB,KAAKwiB,aAIlD,OAFA2Q,EAAQ1sB,KAAK,CAAE,KAAQiR,EAAM,KAAQye,UAAW,QAAW12B,IAC3D+B,EAAOihB,UAAYH,EACZ9gB,EAET,OAAOkW,EAAKD,MAAMhY,EAAQqZ,GAAU,CAAC9Y,KAAKhB,SAAUm3B,iBAKnD12B,EAmCT,SAASk6B,MAiDT,IAAI8K,GAAOjM,GAAW5f,IA8BlB8rB,GAAYlM,GAAWpgB,IAiCvBusB,GAAWnM,GAAWpf,IAwB1B,SAAS1Z,GAASwC,GAChB,OAAOssB,GAAMtsB,GAAQoX,GAAayQ,GAAM7nB,IAh3X1C,SAA0BA,GACxB,OAAO,SAASzC,GACd,OAAOoqB,GAAQpqB,EAAQyC,IA82XwB0iC,CAAiB1iC,GAuEpE,IAAI2iC,GAAQhM,KAsCRiM,GAAajM,IAAY,GAoB7B,SAASkC,KACP,MAAO,GAgBT,SAASQ,KACP,OAAO,EA+JT,IAAI9X,GAAM4U,IAAoB,SAAS0M,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC1lB,GAAOka,GAAY,QAiBnByL,GAAS5M,IAAoB,SAAS6M,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBCl6B,GAAQuuB,GAAY,SAwKxB,IAgaMznB,GAhaFqzB,GAAW/M,IAAoB,SAASgN,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQ/L,GAAY,SAiBpBgM,GAAWnN,IAAoB,SAASoN,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgmBH,OA1iBA9jB,GAAOrV,MAp6MP,SAAe/M,EAAGkY,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIwF,GAAUtN,GAGtB,OADApQ,EAAIk6B,GAAUl6B,GACP,WACL,KAAMA,EAAI,EACR,OAAOkY,EAAKD,MAAMzX,KAAMm2B,aA85M9BvU,GAAO0V,IAAMA,GACb1V,GAAOqgB,OAASA,GAChBrgB,GAAOsgB,SAAWA,GAClBtgB,GAAOugB,aAAeA,GACtBvgB,GAAOwgB,WAAaA,GACpBxgB,GAAOygB,GAAKA,GACZzgB,GAAOkd,OAASA,GAChBld,GAAOriB,KAAOA,GACdqiB,GAAOsiB,QAAUA,GACjBtiB,GAAOmd,QAAUA,GACjBnd,GAAO+jB,UAl8KP,WACE,IAAKxP,UAAUp1B,OACb,MAAO,GAET,IAAI/B,EAAQm3B,UAAU,GACtB,OAAOrU,GAAQ9iB,GAASA,EAAQ,CAACA,IA87KnC4iB,GAAOwc,MAAQA,GACfxc,GAAOgkB,MApgTP,SAAe9tB,EAAO8D,EAAM6Z,GAExB7Z,GADG6Z,EAAQC,GAAe5d,EAAO8D,EAAM6Z,QA5uNzCjvB,IA4uNkDoV,GACzC,EAEAoE,GAAU0Z,GAAU9d,GAAO,GAEpC,IAAI7a,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,IAAKA,GAAU6a,EAAO,EACpB,MAAO,GAMT,IAJA,IAAIxZ,EAAQ,EACRmW,EAAW,EACX/W,EAASqX,EAAMwG,GAAWte,EAAS6a,IAEhCxZ,EAAQrB,GACbS,EAAO+W,KAAc+Y,GAAUxZ,EAAO1V,EAAQA,GAASwZ,GAEzD,OAAOpa,GAo/STogB,GAAOikB,QAl+SP,SAAiB/tB,GAMf,IALA,IAAI1V,GAAS,EACTrB,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACnCwX,EAAW,EACX/W,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdpD,IACFwC,EAAO+W,KAAcvZ,GAGzB,OAAOwC,GAu9STogB,GAAOkkB,OA97SP,WACE,IAAI/kC,EAASo1B,UAAUp1B,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAI6W,EAAOiB,EAAM9X,EAAS,GACtB+W,EAAQqe,UAAU,GAClB/zB,EAAQrB,EAELqB,KACLwV,EAAKxV,EAAQ,GAAK+zB,UAAU/zB,GAE9B,OAAO0W,GAAUgJ,GAAQhK,GAAS0M,GAAU1M,GAAS,CAACA,GAAQsR,GAAYxR,EAAM,KAm7SlFgK,GAAOmkB,KA3tCP,SAAcrd,GACZ,IAAI3nB,EAAkB,MAAT2nB,EAAgB,EAAIA,EAAM3nB,OACnCo3B,EAAa1I,KASjB,OAPA/G,EAAS3nB,EAAc6X,GAAS8P,GAAO,SAASjnB,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIyb,GAAUtN,GAEtB,MAAO,CAACuoB,EAAW12B,EAAK,IAAKA,EAAK,OAJlB,GAOXmvB,IAAS,SAAShZ,GAEvB,IADA,IAAIxV,GAAS,IACJA,EAAQrB,GAAQ,CACvB,IAAIU,EAAOinB,EAAMtmB,GACjB,GAAIqV,GAAMhW,EAAK,GAAIzB,KAAM4X,GACvB,OAAOH,GAAMhW,EAAK,GAAIzB,KAAM4X,QA4sCpCgK,GAAOokB,SA9qCP,SAAkBj0B,GAChB,OAz5YF,SAAsBA,GACpB,IAAI4I,EAAQta,GAAK0R,GACjB,OAAO,SAAStS,GACd,OAAOqoB,GAAeroB,EAAQsS,EAAQ4I,IAs5YjCsrB,CAAavgB,GAAU3T,EA/ieZ,KA6tgBpB6P,GAAOwP,SAAWA,GAClBxP,GAAO2c,QAAUA,GACjB3c,GAAOviB,OAtuHP,SAAgBM,EAAWumC,GACzB,IAAI1kC,EAAS0gB,GAAWviB,GACxB,OAAqB,MAAdumC,EAAqB1kC,EAAS2jB,GAAW3jB,EAAQ0kC,IAquH1DtkB,GAAOukB,MAzuMP,SAASA,EAAMzuB,EAAM6f,EAAO9B,GAE1B,IAAIj0B,EAASs4B,GAAWpiB,EA7+TN,OAnClBlR,8BA+gUA+wB,EAAQ9B,OA/gURjvB,EA+gU4B+wB,GAG5B,OADA/1B,EAAO4Z,YAAc+qB,EAAM/qB,YACpB5Z,GAsuMTogB,GAAOwkB,WA7rMP,SAASA,EAAW1uB,EAAM6f,EAAO9B,GAE/B,IAAIj0B,EAASs4B,GAAWpiB,EAzhUA,QApCxBlR,8BA4jUA+wB,EAAQ9B,OA5jURjvB,EA4jU4B+wB,GAG5B,OADA/1B,EAAO4Z,YAAcgrB,EAAWhrB,YACzB5Z,GA0rMTogB,GAAOnU,SAAWA,GAClBmU,GAAOhc,SAAWA,GAClBgc,GAAO4gB,aAAeA,GACtB5gB,GAAO0e,MAAQA,GACf1e,GAAO2e,MAAQA,GACf3e,GAAO+a,WAAaA,GACpB/a,GAAOgb,aAAeA,GACtBhb,GAAOib,eAAiBA,GACxBjb,GAAOykB,KAt0SP,SAAcvuB,EAAOtY,EAAGi2B,GACtB,IAAI10B,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAKA,EAIEuwB,GAAUxZ,GADjBtY,EAAKi2B,QAh8NLjvB,IAg8NchH,EAAmB,EAAIk6B,GAAUl6B,IACnB,EAAI,EAAIA,EAAGuB,GAH9B,IAo0SX6gB,GAAO0kB,UArySP,SAAmBxuB,EAAOtY,EAAGi2B,GAC3B,IAAI10B,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAKA,EAKEuwB,GAAUxZ,EAAO,GADxBtY,EAAIuB,GADJvB,EAAKi2B,QAl+NLjvB,IAk+NchH,EAAmB,EAAIk6B,GAAUl6B,KAEhB,EAAI,EAAIA,GAJ9B,IAmySXoiB,GAAO2kB,eAzvSP,SAAwBzuB,EAAOO,GAC7B,OAAQP,GAASA,EAAM/W,OACnBiyB,GAAUlb,EAAO2X,GAAYpX,EAAW,IAAI,GAAM,GAClD,IAuvSNuJ,GAAO4kB,UAjtSP,SAAmB1uB,EAAOO,GACxB,OAAQP,GAASA,EAAM/W,OACnBiyB,GAAUlb,EAAO2X,GAAYpX,EAAW,IAAI,GAC5C,IA+sSNuJ,GAAO6kB,KA/qSP,SAAc3uB,EAAO9Y,EAAO0K,EAAOE,GACjC,IAAI7I,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAKA,GAGD2I,GAAyB,iBAATA,GAAqBgsB,GAAe5d,EAAO9Y,EAAO0K,KACpEA,EAAQ,EACRE,EAAM7I,GAzvIV,SAAkB+W,EAAO9Y,EAAO0K,EAAOE,GACrC,IAAI7I,EAAS+W,EAAM/W,OAWnB,KATA2I,EAAQgwB,GAAUhwB,IACN,IACVA,GAASA,EAAQ3I,EAAS,EAAKA,EAAS2I,IAE1CE,OA32FApD,IA22FOoD,GAAqBA,EAAM7I,EAAUA,EAAS24B,GAAU9vB,IACrD,IACRA,GAAO7I,GAET6I,EAAMF,EAAQE,EAAM,EAAIm4B,GAASn4B,GAC1BF,EAAQE,GACbkO,EAAMpO,KAAW1K,EAEnB,OAAO8Y,EA4uIA4uB,CAAS5uB,EAAO9Y,EAAO0K,EAAOE,IAN5B,IA6qSXgY,GAAO+kB,OA3vOP,SAAgBntB,EAAYnB,GAE1B,OADWyJ,GAAQtI,GAAclB,GAAc6Q,IACnC3P,EAAYiW,GAAYpX,EAAW,KA0vOjDuJ,GAAOglB,QAvqOP,SAAiBptB,EAAYxB,GAC3B,OAAOoR,GAAY7jB,GAAIiU,EAAYxB,GAAW,IAuqOhD4J,GAAOilB,YAhpOP,SAAqBrtB,EAAYxB,GAC/B,OAAOoR,GAAY7jB,GAAIiU,EAAYxB,GAhkSxB,MAgtgBb4J,GAAOklB,aAxnOP,SAAsBttB,EAAYxB,EAAUqR,GAE1C,OADAA,OAlpSA7iB,IAkpSQ6iB,EAAsB,EAAIqQ,GAAUrQ,GACrCD,GAAY7jB,GAAIiU,EAAYxB,GAAWqR,IAunOhDzH,GAAOgZ,QAAUA,GACjBhZ,GAAOmlB,YAviSP,SAAqBjvB,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAM/W,QACvBqoB,GAAYtR,EA7qOjB,KA6qOoC,IAsiSjD8J,GAAOolB,aA/gSP,SAAsBlvB,EAAOuR,GAE3B,OADsB,MAATvR,EAAgB,EAAIA,EAAM/W,QAKhCqoB,GAAYtR,EADnBuR,OAlwOA7iB,IAkwOQ6iB,EAAsB,EAAIqQ,GAAUrQ,IAFnC,IA6gSXzH,GAAOqlB,KAz9LP,SAAcvvB,GACZ,OAAOoiB,GAAWpiB,EA5wUD,MAqugBnBkK,GAAOwiB,KAAOA,GACdxiB,GAAOyiB,UAAYA,GACnBziB,GAAOslB,UA3/RP,SAAmBxe,GAKjB,IAJA,IAAItmB,GAAS,EACTrB,EAAkB,MAAT2nB,EAAgB,EAAIA,EAAM3nB,OACnCS,EAAS,KAEJY,EAAQrB,GAAQ,CACvB,IAAIU,EAAOinB,EAAMtmB,GACjBZ,EAAOC,EAAK,IAAMA,EAAK,GAEzB,OAAOD,GAm/RTogB,GAAOulB,UA38GP,SAAmB1nC,GACjB,OAAiB,MAAVA,EAAiB,GAAKkqB,GAAclqB,EAAQY,GAAKZ,KA28G1DmiB,GAAOwlB,YAj7GP,SAAqB3nC,GACnB,OAAiB,MAAVA,EAAiB,GAAKkqB,GAAclqB,EAAQinB,GAAOjnB,KAi7G5DmiB,GAAO8c,QAAUA,GACjB9c,GAAOylB,QA56RP,SAAiBvvB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAM/W,QACvBuwB,GAAUxZ,EAAO,GAAI,GAAK,IA26R5C8J,GAAOqb,aAAeA,GACtBrb,GAAOub,eAAiBA,GACxBvb,GAAOwb,iBAAmBA,GAC1Bxb,GAAO8gB,OAASA,GAChB9gB,GAAO+gB,SAAWA,GAClB/gB,GAAO+c,UAAYA,GACnB/c,GAAO5J,SAAWA,GAClB4J,GAAOgd,MAAQA,GACfhd,GAAOvhB,KAAOA,GACduhB,GAAO8E,OAASA,GAChB9E,GAAOrc,IAAMA,GACbqc,GAAO0lB,QA1rGP,SAAiB7nC,EAAQuY,GACvB,IAAIxW,EAAS,GAMb,OALAwW,EAAWyX,GAAYzX,EAAU,GAEjC6Q,GAAWppB,GAAQ,SAAST,EAAOM,EAAKG,GACtColB,GAAgBrjB,EAAQwW,EAAShZ,EAAOM,EAAKG,GAAST,MAEjDwC,GAorGTogB,GAAO2lB,UArpGP,SAAmB9nC,EAAQuY,GACzB,IAAIxW,EAAS,GAMb,OALAwW,EAAWyX,GAAYzX,EAAU,GAEjC6Q,GAAWppB,GAAQ,SAAST,EAAOM,EAAKG,GACtColB,GAAgBrjB,EAAQlC,EAAK0Y,EAAShZ,EAAOM,EAAKG,OAE7C+B,GA+oGTogB,GAAO4lB,QAphCP,SAAiBz1B,GACf,OAAO8b,GAAYnI,GAAU3T,EAxveX,KA4wgBpB6P,GAAO6lB,gBAh/BP,SAAyBvlC,EAAMqrB,GAC7B,OAAOK,GAAoB1rB,EAAMwjB,GAAU6H,EA7xezB,KA6wgBpB3L,GAAOya,QAAUA,GACjBza,GAAOihB,MAAQA,GACfjhB,GAAO6gB,UAAYA,GACnB7gB,GAAO0iB,OAASA,GAChB1iB,GAAO2iB,SAAWA,GAClB3iB,GAAO4iB,MAAQA,GACf5iB,GAAO+e,OAASA,GAChB/e,GAAO8lB,OAzzBP,SAAgBloC,GAEd,OADAA,EAAIk6B,GAAUl6B,GACPoxB,IAAS,SAAShZ,GACvB,OAAOyX,GAAQzX,EAAMpY,OAuzBzBoiB,GAAOkhB,KAAOA,GACdlhB,GAAO+lB,OAnhGP,SAAgBloC,EAAQ4Y,GACtB,OAAO4qB,GAAOxjC,EAAQkhC,GAAOlR,GAAYpX,MAmhG3CuJ,GAAOgmB,KA73LP,SAAclwB,GACZ,OAAOonB,GAAO,EAAGpnB,IA63LnBkK,GAAOimB,QAr4NP,SAAiBruB,EAAY+V,EAAWC,EAAQiG,GAC9C,OAAkB,MAAdjc,EACK,IAEJsI,GAAQyN,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCzN,GADL0N,EAASiG,OAj7STjvB,EAi7S6BgpB,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAY9V,EAAY+V,EAAWC,KA23N5C5N,GAAO6iB,KAAOA,GACd7iB,GAAOgf,SAAWA,GAClBhf,GAAO8iB,UAAYA,GACnB9iB,GAAO+iB,SAAWA,GAClB/iB,GAAOmf,QAAUA,GACjBnf,GAAOof,aAAeA,GACtBpf,GAAOid,UAAYA,GACnBjd,GAAO7E,KAAOA,GACd6E,GAAOqhB,OAASA,GAChBrhB,GAAOliB,SAAWA,GAClBkiB,GAAOkmB,WA/rBP,SAAoBroC,GAClB,OAAO,SAASyC,GACd,OAAiB,MAAVzC,OA7nfT+G,EA6nfsCqjB,GAAQpqB,EAAQyC,KA8rBxD0f,GAAOyb,KAAOA,GACdzb,GAAO0b,QAAUA,GACjB1b,GAAOmmB,UApsRP,SAAmBjwB,EAAOiB,EAAQf,GAChC,OAAQF,GAASA,EAAM/W,QAAUgY,GAAUA,EAAOhY,OAC9CuvB,GAAYxY,EAAOiB,EAAQ0W,GAAYzX,EAAU,IACjDF,GAksRN8J,GAAOomB,YAxqRP,SAAqBlwB,EAAOiB,EAAQJ,GAClC,OAAQb,GAASA,EAAM/W,QAAUgY,GAAUA,EAAOhY,OAC9CuvB,GAAYxY,EAAOiB,OAxpPvBvS,EAwpP0CmS,GACtCb,GAsqRN8J,GAAO2b,OAASA,GAChB3b,GAAOijB,MAAQA,GACfjjB,GAAOkjB,WAAaA,GACpBljB,GAAOqf,MAAQA,GACfrf,GAAOqmB,OAxvNP,SAAgBzuB,EAAYnB,GAE1B,OADWyJ,GAAQtI,GAAclB,GAAc6Q,IACnC3P,EAAYmnB,GAAOlR,GAAYpX,EAAW,MAuvNxDuJ,GAAOja,OAzmRP,SAAgBmQ,EAAOO,GACrB,IAAI7W,EAAS,GACb,IAAMsW,IAASA,EAAM/W,OACnB,OAAOS,EAET,IAAIY,GAAS,EACTouB,EAAU,GACVzvB,EAAS+W,EAAM/W,OAGnB,IADAsX,EAAYoX,GAAYpX,EAAW,KAC1BjW,EAAQrB,GAAQ,CACvB,IAAI/B,EAAQ8Y,EAAM1V,GACdiW,EAAUrZ,EAAOoD,EAAO0V,KAC1BtW,EAAOiF,KAAKzH,GACZwxB,EAAQ/pB,KAAKrE,IAIjB,OADAmuB,GAAWzY,EAAO0Y,GACXhvB,GAwlRTogB,GAAOsmB,KAluLP,SAAcxwB,EAAMhO,GAClB,GAAmB,mBAARgO,EACT,MAAM,IAAIwF,GAAUtN,GAGtB,OAAOghB,GAASlZ,EADhBhO,OAvmVAlD,IAumVQkD,EAAsBA,EAAQgwB,GAAUhwB,KA+tLlDkY,GAAOnB,QAAUA,GACjBmB,GAAOumB,WAhtNP,SAAoB3uB,EAAYha,EAAGi2B,GAOjC,OALEj2B,GADGi2B,EAAQC,GAAelc,EAAYha,EAAGi2B,QAxnT3CjvB,IAwnToDhH,GAC9C,EAEAk6B,GAAUl6B,IAELsiB,GAAQtI,GAAc8K,GAAkB0M,IACvCxX,EAAYha,IA0sN1BoiB,GAAO1F,IAv6FP,SAAazc,EAAQyC,EAAMlD,GACzB,OAAiB,MAAVS,EAAiBA,EAAS4wB,GAAQ5wB,EAAQyC,EAAMlD,IAu6FzD4iB,GAAOwmB,QA54FP,SAAiB3oC,EAAQyC,EAAMlD,EAAO4mB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,OA97a/Cpf,EA+7aiB,MAAV/G,EAAiBA,EAAS4wB,GAAQ5wB,EAAQyC,EAAMlD,EAAO4mB,IA24FhEhE,GAAOymB,QA1rNP,SAAiB7uB,GAEf,OADWsI,GAAQtI,GAAckL,GAAe2M,IACpC7X,IAyrNdoI,GAAO1X,MAhjRP,SAAe4N,EAAOpO,EAAOE,GAC3B,IAAI7I,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAKA,GAGD6I,GAAqB,iBAAPA,GAAmB8rB,GAAe5d,EAAOpO,EAAOE,IAChEF,EAAQ,EACRE,EAAM7I,IAGN2I,EAAiB,MAATA,EAAgB,EAAIgwB,GAAUhwB,GACtCE,OAtyPFpD,IAsyPQoD,EAAoB7I,EAAS24B,GAAU9vB,IAExC0nB,GAAUxZ,EAAOpO,EAAOE,IAVtB,IA8iRXgY,GAAO/T,OAASA,GAChB+T,GAAO0mB,WAx3QP,SAAoBxwB,GAClB,OAAQA,GAASA,EAAM/W,OACnByxB,GAAe1a,GACf,IAs3QN8J,GAAO2mB,aAn2QP,SAAsBzwB,EAAOE,GAC3B,OAAQF,GAASA,EAAM/W,OACnByxB,GAAe1a,EAAO2X,GAAYzX,EAAU,IAC5C,IAi2QN4J,GAAO/gB,MA5hEP,SAAe0Z,EAAQiuB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB/S,GAAenb,EAAQiuB,EAAWC,KACzED,EAAYC,OArzcdjiC,IAuzcAiiC,OAvzcAjiC,IAuzcQiiC,EAxvcW,WAwvc8BA,IAAU,IAI3DluB,EAASiD,GAASjD,MAEQ,iBAAbiuB,GACO,MAAbA,IAAsBpxB,GAASoxB,OAEpCA,EAAY9V,GAAa8V,KACP/sB,GAAWlB,GACpBsZ,GAAUtX,GAAchC,GAAS,EAAGkuB,GAGxCluB,EAAO1Z,MAAM2nC,EAAWC,GAZtB,IAuhEX7mB,GAAO8mB,OAnsLP,SAAgBhxB,EAAMhO,GACpB,GAAmB,mBAARgO,EACT,MAAM,IAAIwF,GAAUtN,GAGtB,OADAlG,EAAiB,MAATA,EAAgB,EAAIsW,GAAU0Z,GAAUhwB,GAAQ,GACjDknB,IAAS,SAAShZ,GACvB,IAAIE,EAAQF,EAAKlO,GACb8xB,EAAY3H,GAAUjc,EAAM,EAAGlO,GAKnC,OAHIoO,GACFgB,GAAU0iB,EAAW1jB,GAEhBL,GAAMC,EAAM1X,KAAMw7B,OAwrL7B5Z,GAAO+mB,KAl1QP,SAAc7wB,GACZ,IAAI/W,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAOA,EAASuwB,GAAUxZ,EAAO,EAAG/W,GAAU,IAi1QhD6gB,GAAOgnB,KArzQP,SAAc9wB,EAAOtY,EAAGi2B,GACtB,OAAM3d,GAASA,EAAM/W,OAIduwB,GAAUxZ,EAAO,GADxBtY,EAAKi2B,QAjiQLjvB,IAiiQchH,EAAmB,EAAIk6B,GAAUl6B,IAChB,EAAI,EAAIA,GAH9B,IAozQXoiB,GAAOinB,UArxQP,SAAmB/wB,EAAOtY,EAAGi2B,GAC3B,IAAI10B,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,OAAKA,EAKEuwB,GAAUxZ,GADjBtY,EAAIuB,GADJvB,EAAKi2B,QAnkQLjvB,IAmkQchH,EAAmB,EAAIk6B,GAAUl6B,KAEnB,EAAI,EAAIA,EAAGuB,GAJ9B,IAmxQX6gB,GAAOknB,eAzuQP,SAAwBhxB,EAAOO,GAC7B,OAAQP,GAASA,EAAM/W,OACnBiyB,GAAUlb,EAAO2X,GAAYpX,EAAW,IAAI,GAAO,GACnD,IAuuQNuJ,GAAOmnB,UAjsQP,SAAmBjxB,EAAOO,GACxB,OAAQP,GAASA,EAAM/W,OACnBiyB,GAAUlb,EAAO2X,GAAYpX,EAAW,IACxC,IA+rQNuJ,GAAOonB,IApuPP,SAAahqC,EAAOq/B,GAElB,OADAA,EAAYr/B,GACLA,GAmuPT4iB,GAAOqnB,SA9oLP,SAAkBvxB,EAAMsQ,EAAMriB,GAC5B,IAAI45B,GAAU,EACVzJ,GAAW,EAEf,GAAmB,mBAARpe,EACT,MAAM,IAAIwF,GAAUtN,GAMtB,OAJIwS,GAASzc,KACX45B,EAAU,YAAa55B,IAAYA,EAAQ45B,QAAUA,EACrDzJ,EAAW,aAAcnwB,IAAYA,EAAQmwB,SAAWA,GAEnDroB,GAASiK,EAAMsQ,EAAM,CAC1B,QAAWuX,EACX,QAAWvX,EACX,SAAY8N,KAioLhBlU,GAAO+U,KAAOA,GACd/U,GAAO8f,QAAUA,GACjB9f,GAAOshB,QAAUA,GACjBthB,GAAOuhB,UAAYA,GACnBvhB,GAAOsnB,OArfP,SAAgBlqC,GACd,OAAI8iB,GAAQ9iB,GACH4Z,GAAS5Z,EAAO+qB,IAElBb,GAASlqB,GAAS,CAACA,GAASwlB,GAAUmP,GAAanW,GAASxe,MAkfrE4iB,GAAOuN,cAAgBA,GACvBvN,GAAO9F,UA10FP,SAAmBrc,EAAQuY,EAAUC,GACnC,IAAI4L,EAAQ/B,GAAQriB,GAChB0pC,EAAYtlB,GAASlE,GAASlgB,IAAW+X,GAAa/X,GAG1D,GADAuY,EAAWyX,GAAYzX,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI6O,EAAOrnB,GAAUA,EAAOwmB,YAE1BhO,EADEkxB,EACYtlB,EAAQ,IAAIiD,EAAO,GAE1B1E,GAAS3iB,IACFmqB,GAAW9C,GAAQ5E,GAAW9D,GAAa3e,IAG3C,GAMlB,OAHC0pC,EAAYjxB,GAAY2Q,IAAYppB,GAAQ,SAAST,EAAOoD,EAAO3C,GAClE,OAAOuY,EAASC,EAAajZ,EAAOoD,EAAO3C,MAEtCwY,GAuzFT2J,GAAOwnB,MArnLP,SAAe1xB,GACb,OAAO4f,GAAI5f,EAAM,IAqnLnBkK,GAAO4b,MAAQA,GACf5b,GAAO6b,QAAUA,GACjB7b,GAAO8b,UAAYA,GACnB9b,GAAOynB,KAzmQP,SAAcvxB,GACZ,OAAQA,GAASA,EAAM/W,OAAU4xB,GAAS7a,GAAS,IAymQrD8J,GAAO0nB,OA/kQP,SAAgBxxB,EAAOE,GACrB,OAAQF,GAASA,EAAM/W,OAAU4xB,GAAS7a,EAAO2X,GAAYzX,EAAU,IAAM,IA+kQ/E4J,GAAO2nB,SAxjQP,SAAkBzxB,EAAOa,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,OA9yQ/CnS,EA+yQQsR,GAASA,EAAM/W,OAAU4xB,GAAS7a,OA/yQ1CtR,EA+yQ4DmS,GAAc,IAujQ5EiJ,GAAO4nB,MAhyFP,SAAe/pC,EAAQyC,GACrB,OAAiB,MAAVzC,GAAwBixB,GAAUjxB,EAAQyC,IAgyFnD0f,GAAO+b,MAAQA,GACf/b,GAAOic,UAAYA,GACnBjc,GAAO6nB,OApwFP,SAAgBhqC,EAAQyC,EAAM6wB,GAC5B,OAAiB,MAAVtzB,EAAiBA,EAASqzB,GAAWrzB,EAAQyC,EAAMwxB,GAAaX,KAowFzEnR,GAAO8nB,WAzuFP,SAAoBjqC,EAAQyC,EAAM6wB,EAASnN,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,OAlob/Cpf,EAmobiB,MAAV/G,EAAiBA,EAASqzB,GAAWrzB,EAAQyC,EAAMwxB,GAAaX,GAAUnN,IAwuFnFhE,GAAO7I,OAASA,GAChB6I,GAAO+nB,SAhrFP,SAAkBlqC,GAChB,OAAiB,MAAVA,EAAiB,GAAKib,GAAWjb,EAAQinB,GAAOjnB,KAgrFzDmiB,GAAOkc,QAAUA,GACjBlc,GAAOoU,MAAQA,GACfpU,GAAOgoB,KA3mLP,SAAc5qC,EAAO43B,GACnB,OAAOmK,GAAQrN,GAAakD,GAAU53B,IA2mLxC4iB,GAAOmc,IAAMA,GACbnc,GAAOoc,MAAQA,GACfpc,GAAOqc,QAAUA,GACjBrc,GAAOsc,IAAMA,GACbtc,GAAOioB,UAj3PP,SAAmBlvB,EAAO5B,GACxB,OAAOua,GAAc3Y,GAAS,GAAI5B,GAAU,GAAI+L,KAi3PlDlD,GAAOkoB,cA/1PP,SAAuBnvB,EAAO5B,GAC5B,OAAOua,GAAc3Y,GAAS,GAAI5B,GAAU,GAAIsX,KA+1PlDzO,GAAOuc,QAAUA,GAGjBvc,GAAOsB,QAAUggB,GACjBthB,GAAOmoB,UAAY5G,GACnBvhB,GAAOtb,OAAS47B,GAChBtgB,GAAOooB,WAAa7H,GAGpBqC,GAAM5iB,GAAQA,IAKdA,GAAO6B,IAAMA,GACb7B,GAAOqiB,QAAUA,GACjBriB,GAAOwhB,UAAYA,GACnBxhB,GAAOyhB,WAAaA,GACpBzhB,GAAOtC,KAAOA,GACdsC,GAAOqoB,MAprFP,SAAe1kB,EAAQC,EAAOC,GAa5B,YAlubAjf,IAstbIif,IACFA,EAAQD,EACRA,OAxtbFhf,YA0tbIif,IAEFA,GADAA,EAAQyT,GAASzT,KACCA,EAAQA,EAAQ,QA5tbpCjf,IA8tbIgf,IAEFA,GADAA,EAAQ0T,GAAS1T,KACCA,EAAQA,EAAQ,GAE7Bf,GAAUyU,GAAS3T,GAASC,EAAOC,IAwqF5C7D,GAAO8a,MA7jLP,SAAe19B,GACb,OAAO0mB,GAAU1mB,EArzVI,IAk3gBvB4iB,GAAOsoB,UApgLP,SAAmBlrC,GACjB,OAAO0mB,GAAU1mB,EAAO+jC,IAogL1BnhB,GAAOuoB,cAr+KP,SAAuBnrC,EAAO4mB,GAE5B,OAAOF,GAAU1mB,EAAO+jC,EADxBnd,EAAkC,mBAAdA,EAA2BA,OAx6V/Cpf,IA64gBFob,GAAOwoB,UA7hLP,SAAmBprC,EAAO4mB,GAExB,OAAOF,GAAU1mB,EAz1VI,EAw1VrB4mB,EAAkC,mBAAdA,EAA2BA,OAj3V/Cpf,IA84gBFob,GAAOyoB,WA18KP,SAAoB5qC,EAAQsS,GAC1B,OAAiB,MAAVA,GAAkB+V,GAAeroB,EAAQsS,EAAQ1R,GAAK0R,KA08K/D6P,GAAOqU,OAASA,GAChBrU,GAAO0oB,UA1xCP,SAAmBtrC,EAAOu5B,GACxB,OAAiB,MAATv5B,GAAiBA,GAAUA,EAASu5B,EAAev5B,GA0xC7D4iB,GAAOqjB,OAASA,GAChBrjB,GAAO2oB,SAz9EP,SAAkBhwB,EAAQiwB,EAAQC,GAChClwB,EAASiD,GAASjD,GAClBiwB,EAAS9X,GAAa8X,GAEtB,IAAIzpC,EAASwZ,EAAOxZ,OAKhB6I,EAJJ6gC,OA97bAjkC,IA87bWikC,EACP1pC,EACA0jB,GAAUiV,GAAU+Q,GAAW,EAAG1pC,GAItC,OADA0pC,GAAYD,EAAOzpC,SACA,GAAKwZ,EAAOrQ,MAAMugC,EAAU7gC,IAAQ4gC,GA+8EzD5oB,GAAOgD,GAAKA,GACZhD,GAAO8oB,OAj7EP,SAAgBnwB,GAEd,OADAA,EAASiD,GAASjD,KACAvI,EAAmB0J,KAAKnB,GACtCA,EAAOtS,QAAQ2J,EAAiB0J,IAChCf,GA86ENqH,GAAO+oB,aA55EP,SAAsBpwB,GAEpB,OADAA,EAASiD,GAASjD,KACA/H,EAAgBkJ,KAAKnB,GACnCA,EAAOtS,QAAQsK,EAAc,QAC7BgI,GAy5ENqH,GAAOgpB,MA57OP,SAAepxB,EAAYnB,EAAWod,GACpC,IAAI/d,EAAOoK,GAAQtI,GAAcpB,GAAa4Q,GAI9C,OAHIyM,GAASC,GAAelc,EAAYnB,EAAWod,KACjDpd,OA79RF7R,GA+9ROkR,EAAK8B,EAAYiW,GAAYpX,EAAW,KAw7OjDuJ,GAAOla,KAAOA,GACdka,GAAOkb,UAAYA,GACnBlb,GAAOipB,QArxHP,SAAiBprC,EAAQ4Y,GACvB,OAAOkB,GAAY9Z,EAAQgwB,GAAYpX,EAAW,GAAIwQ,KAqxHxDjH,GAAO4c,SAAWA,GAClB5c,GAAOmb,cAAgBA,GACvBnb,GAAOkpB,YAjvHP,SAAqBrrC,EAAQ4Y,GAC3B,OAAOkB,GAAY9Z,EAAQgwB,GAAYpX,EAAW,GAAI0Q,KAivHxDnH,GAAO3W,MAAQA,GACf2W,GAAOthB,QAAUA,GACjBshB,GAAO6c,aAAeA,GACtB7c,GAAOmpB,MArtHP,SAAetrC,EAAQuY,GACrB,OAAiB,MAAVvY,EACHA,EACA+pB,GAAQ/pB,EAAQgwB,GAAYzX,EAAU,GAAI0O,KAmtHhD9E,GAAOopB,WAtrHP,SAAoBvrC,EAAQuY,GAC1B,OAAiB,MAAVvY,EACHA,EACAiqB,GAAajqB,EAAQgwB,GAAYzX,EAAU,GAAI0O,KAorHrD9E,GAAOqpB,OArpHP,SAAgBxrC,EAAQuY,GACtB,OAAOvY,GAAUopB,GAAWppB,EAAQgwB,GAAYzX,EAAU,KAqpH5D4J,GAAOspB,YAxnHP,SAAqBzrC,EAAQuY,GAC3B,OAAOvY,GAAUspB,GAAgBtpB,EAAQgwB,GAAYzX,EAAU,KAwnHjE4J,GAAOhjB,IAAMA,GACbgjB,GAAOsf,GAAKA,GACZtf,GAAOuf,IAAMA,GACbvf,GAAO9G,IAzgHP,SAAarb,EAAQyC,GACnB,OAAiB,MAAVzC,GAAkBu7B,GAAQv7B,EAAQyC,EAAMwoB,KAygHjD9I,GAAO8M,MAAQA,GACf9M,GAAOob,KAAOA,GACdpb,GAAO+L,SAAWA,GAClB/L,GAAOsG,SA5pOP,SAAkB1O,EAAYxa,EAAO2a,EAAW8b,GAC9Cjc,EAAa6U,GAAY7U,GAAcA,EAAaT,GAAOS,GAC3DG,EAAaA,IAAc8b,EAASiE,GAAU/f,GAAa,EAE3D,IAAI5Y,EAASyY,EAAWzY,OAIxB,OAHI4Y,EAAY,IACdA,EAAYqG,GAAUjf,EAAS4Y,EAAW,IAErC4nB,GAAS/nB,GACXG,GAAa5Y,GAAUyY,EAAWpY,QAAQpC,EAAO2a,IAAc,IAC7D5Y,GAAU0X,GAAYe,EAAYxa,EAAO2a,IAAc,GAmpOhEiI,GAAOxgB,QA9lSP,SAAiB0W,EAAO9Y,EAAO2a,GAC7B,IAAI5Y,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIqB,EAAqB,MAAbuX,EAAoB,EAAI+f,GAAU/f,GAI9C,OAHIvX,EAAQ,IACVA,EAAQ4d,GAAUjf,EAASqB,EAAO,IAE7BqW,GAAYX,EAAO9Y,EAAOoD,IAslSnCwf,GAAOupB,QAlqFP,SAAiB5lB,EAAQ7b,EAAOE,GAS9B,OARAF,EAAQqvB,GAASrvB,QA5wbjBlD,IA6wbIoD,GACFA,EAAMF,EACNA,EAAQ,GAERE,EAAMmvB,GAASnvB,GArsVnB,SAAqB2b,EAAQ7b,EAAOE,GAClC,OAAO2b,GAAUrF,GAAUxW,EAAOE,IAAQ2b,EAASvF,GAAUtW,EAAOE,GAusV7DwhC,CADP7lB,EAAS2T,GAAS3T,GACS7b,EAAOE,IA0pFpCgY,GAAOghB,OAASA,GAChBhhB,GAAOmC,YAAcA,GACrBnC,GAAOE,QAAUA,GACjBF,GAAO9K,cAAgBA,GACvB8K,GAAOyM,YAAcA,GACrBzM,GAAOqN,kBAAoBA,GAC3BrN,GAAOypB,UAtwKP,SAAmBrsC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB6iB,GAAa7iB,IAAUmrB,GAAWnrB,IAAUiR,GAqwKjD2R,GAAOjC,SAAWA,GAClBiC,GAAO5K,OAASA,GAChB4K,GAAO0pB,UA7sKP,SAAmBtsC,GACjB,OAAO6iB,GAAa7iB,IAA6B,IAAnBA,EAAMqX,WAAmB6Y,GAAclwB,IA6sKvE4iB,GAAO2pB,QAzqKP,SAAiBvsC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIqvB,GAAYrvB,KACX8iB,GAAQ9iB,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMwf,QAC1DmB,GAAS3gB,IAAUwY,GAAaxY,IAAU+kB,GAAY/kB,IAC1D,OAAQA,EAAM+B,OAEhB,IAAIolB,EAAMC,GAAOpnB,GACjB,GAAImnB,GAAO7V,GAAU6V,GAAOzV,EAC1B,OAAQ1R,EAAM4c,KAEhB,GAAImS,GAAY/uB,GACd,OAAQ8uB,GAAS9uB,GAAO+B,OAE1B,IAAK,IAAIzB,KAAON,EACd,GAAIY,GAAe1B,KAAKc,EAAOM,GAC7B,OAAO,EAGX,OAAO,GAqpKTsiB,GAAOnW,QAtnKP,SAAiBzM,EAAOyrB,GACtB,OAAOc,GAAYvsB,EAAOyrB,IAsnK5B7I,GAAO4pB,YAnlKP,SAAqBxsC,EAAOyrB,EAAO7E,GAEjC,IAAIpkB,GADJokB,EAAkC,mBAAdA,EAA2BA,OAx2W/Cpf,GAy2W0Bof,EAAW5mB,EAAOyrB,QAz2W5CjkB,EA02WA,YA12WAA,IA02WOhF,EAAuB+pB,GAAYvsB,EAAOyrB,OA12WjDjkB,EA02WmEof,KAAgBpkB,GAilKrFogB,GAAOwf,QAAUA,GACjBxf,GAAO/B,SA1hKP,SAAkB7gB,GAChB,MAAuB,iBAATA,GAAqB4gB,GAAe5gB,IA0hKpD4iB,GAAOgI,WAAaA,GACpBhI,GAAOyf,UAAYA,GACnBzf,GAAOsZ,SAAWA,GAClBtZ,GAAO1K,MAAQA,GACf0K,GAAO6pB,QA11JP,SAAiBhsC,EAAQsS,GACvB,OAAOtS,IAAWsS,GAAUqb,GAAY3tB,EAAQsS,EAAQuc,GAAavc,KA01JvE6P,GAAO8pB,YAvzJP,SAAqBjsC,EAAQsS,EAAQ6T,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,OA5oX/Cpf,EA6oXO4mB,GAAY3tB,EAAQsS,EAAQuc,GAAavc,GAAS6T,IAszJ3DhE,GAAO+pB,MAvxJP,SAAe3sC,GAIb,OAAOsiC,GAAStiC,IAAUA,IAAUA,GAoxJtC4iB,GAAOgqB,SAvvJP,SAAkB5sC,GAChB,GAAIs8B,GAAWt8B,GACb,MAAM,IAAIge,EAtsXM,mEAwsXlB,OAAOyQ,GAAazuB,IAovJtB4iB,GAAOiqB,MAxsJP,SAAe7sC,GACb,OAAgB,MAATA,GAwsJT4iB,GAAOkqB,OAjuJP,SAAgB9sC,GACd,OAAiB,OAAVA,GAiuJT4iB,GAAO0f,SAAWA,GAClB1f,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOsN,cAAgBA,GACvBtN,GAAOxK,SAAWA,GAClBwK,GAAOmqB,cArlJP,SAAuB/sC,GACrB,OAAOqiC,GAAUriC,IAAUA,IA9zXR,kBA8zXsCA,GA9zXtC,kBAm5gBrB4iB,GAAOtK,MAAQA,GACfsK,GAAO2f,SAAWA,GAClB3f,GAAOsH,SAAWA,GAClBtH,GAAOpK,aAAeA,GACtBoK,GAAOoqB,YAn/IP,SAAqBhtC,GACnB,YA/9XAwH,IA+9XOxH,GAm/IT4iB,GAAOqqB,UA/9IP,SAAmBjtC,GACjB,OAAO6iB,GAAa7iB,IAAUonB,GAAOpnB,IAAU6R,GA+9IjD+Q,GAAOsqB,UA38IP,SAAmBltC,GACjB,OAAO6iB,GAAa7iB,IAn6XP,oBAm6XiBmrB,GAAWnrB,IA28I3C4iB,GAAO5a,KAz/RP,SAAc8Q,EAAO0wB,GACnB,OAAgB,MAAT1wB,EAAgB,GAAKgI,GAAW5hB,KAAK4Z,EAAO0wB,IAy/RrD5mB,GAAO2hB,UAAYA,GACnB3hB,GAAOtV,KAAOA,GACdsV,GAAOuqB,YAh9RP,SAAqBr0B,EAAO9Y,EAAO2a,GACjC,IAAI5Y,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIqB,EAAQrB,EAKZ,YAjhPAyF,IA6gPImT,IAEFvX,GADAA,EAAQs3B,GAAU/f,IACF,EAAIqG,GAAUjf,EAASqB,EAAO,GAAK8d,GAAU9d,EAAOrB,EAAS,IAExE/B,GAAUA,EArvMrB,SAA2B8Y,EAAO9Y,EAAO2a,GAEvC,IADA,IAAIvX,EAAQuX,EAAY,EACjBvX,KACL,GAAI0V,EAAM1V,KAAWpD,EACnB,OAAOoD,EAGX,OAAOA,EA+uMDgqC,CAAkBt0B,EAAO9Y,EAAOoD,GAChCsX,GAAc5B,EAAOgC,GAAW1X,GAAO,IAq8R7Cwf,GAAO4hB,UAAYA,GACnB5hB,GAAO6hB,WAAaA,GACpB7hB,GAAO4f,GAAKA,GACZ5f,GAAO6f,IAAMA,GACb7f,GAAO3B,IAhfP,SAAanI,GACX,OAAQA,GAASA,EAAM/W,OACnBkoB,GAAanR,EAAO6V,GAAUnD,SA9+flChkB,GA69gBFob,GAAOyqB,MApdP,SAAev0B,EAAOE,GACpB,OAAQF,GAASA,EAAM/W,OACnBkoB,GAAanR,EAAO2X,GAAYzX,EAAU,GAAIwS,SA3ggBlDhkB,GA89gBFob,GAAO0qB,KAjcP,SAAcx0B,GACZ,OAAOkC,GAASlC,EAAO6V,KAiczB/L,GAAO2qB,OAvaP,SAAgBz0B,EAAOE,GACrB,OAAOgC,GAASlC,EAAO2X,GAAYzX,EAAU,KAua/C4J,GAAOzB,IAlZP,SAAarI,GACX,OAAQA,GAASA,EAAM/W,OACnBkoB,GAAanR,EAAO6V,GAAUQ,SAhlgBlC3nB,GAi+gBFob,GAAO4qB,MAtXP,SAAe10B,EAAOE,GACpB,OAAQF,GAASA,EAAM/W,OACnBkoB,GAAanR,EAAO2X,GAAYzX,EAAU,GAAImW,SA7mgBlD3nB,GAk+gBFob,GAAOmZ,UAAYA,GACnBnZ,GAAO2Z,UAAYA,GACnB3Z,GAAO6qB,WAztBP,WACE,MAAO,IAytBT7qB,GAAO8qB,WAzsBP,WACE,MAAO,IAysBT9qB,GAAO+qB,SAzrBP,WACE,OAAO,GAyrBT/qB,GAAOwjB,SAAWA,GAClBxjB,GAAOgrB,IA77RP,SAAa90B,EAAOtY,GAClB,OAAQsY,GAASA,EAAM/W,OAAUsuB,GAAQvX,EAAO4hB,GAAUl6B,SA5iP1DgH,GAy+gBFob,GAAOirB,WAliCP,WAIE,OAHI12B,GAAKhK,IAAMnM,OACbmW,GAAKhK,EAAI4R,IAEJ/d,MA+hCT4hB,GAAO+X,KAAOA,GACd/X,GAAO1C,IAAMA,GACb0C,GAAOkrB,IAj5EP,SAAavyB,EAAQxZ,EAAQ43B,GAC3Bpe,EAASiD,GAASjD,GAGlB,IAAIwyB,GAFJhsC,EAAS24B,GAAU34B,IAEMqb,GAAW7B,GAAU,EAC9C,IAAKxZ,GAAUgsC,GAAahsC,EAC1B,OAAOwZ,EAET,IAAIsX,GAAO9wB,EAASgsC,GAAa,EACjC,OACErU,GAAcnZ,GAAYsS,GAAM8G,GAChCpe,EACAme,GAAcrZ,GAAWwS,GAAM8G,IAs4EnC/W,GAAOorB,OA32EP,SAAgBzyB,EAAQxZ,EAAQ43B,GAC9Bpe,EAASiD,GAASjD,GAGlB,IAAIwyB,GAFJhsC,EAAS24B,GAAU34B,IAEMqb,GAAW7B,GAAU,EAC9C,OAAQxZ,GAAUgsC,EAAYhsC,EACzBwZ,EAASme,GAAc33B,EAASgsC,EAAWpU,GAC5Cpe,GAq2ENqH,GAAOqrB,SA30EP,SAAkB1yB,EAAQxZ,EAAQ43B,GAChCpe,EAASiD,GAASjD,GAGlB,IAAIwyB,GAFJhsC,EAAS24B,GAAU34B,IAEMqb,GAAW7B,GAAU,EAC9C,OAAQxZ,GAAUgsC,EAAYhsC,EACzB23B,GAAc33B,EAASgsC,EAAWpU,GAASpe,EAC5CA,GAq0ENqH,GAAO7L,SA1yEP,SAAkBwE,EAAQ2yB,EAAOzX,GAM/B,OALIA,GAAkB,MAATyX,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ7sB,GAAe7C,GAASjD,GAAQtS,QAAQwK,EAAa,IAAKy6B,GAAS,IAqyE5EtrB,GAAOrB,OA1rFP,SAAgBiF,EAAOC,EAAO0nB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBzX,GAAelQ,EAAOC,EAAO0nB,KAC3E1nB,EAAQ0nB,OAxzbV3mC,YA0zbI2mC,IACkB,kBAAT1nB,GACT0nB,EAAW1nB,EACXA,OA7zbJjf,GA+zb2B,kBAATgf,IACd2nB,EAAW3nB,EACXA,OAj0bJhf,aAo0bIgf,QAp0bJhf,IAo0b2Bif,GACzBD,EAAQ,EACRC,EAAQ,IAGRD,EAAQuT,GAASvT,QAz0bnBhf,IA00bMif,GACFA,EAAQD,EACRA,EAAQ,GAERC,EAAQsT,GAAStT,IAGjBD,EAAQC,EAAO,CACjB,IAAItgB,EAAOqgB,EACXA,EAAQC,EACRA,EAAQtgB,EAEV,GAAIgoC,GAAY3nB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI2W,EAAO9b,KACX,OAAOJ,GAAUsF,EAAS4W,GAAQ3W,EAAQD,EAAQ5P,GAAe,QAAUwmB,EAAO,IAAIr7B,OAAS,KAAO0kB,GAExG,OAAOpB,GAAWmB,EAAOC,IAupF3B7D,GAAOpW,OA5+NP,SAAgBgO,EAAYxB,EAAUC,GACpC,IAAIP,EAAOoK,GAAQtI,GAAcP,GAAckB,GAC3CjB,EAAYid,UAAUp1B,OAAS,EAEnC,OAAO2W,EAAK8B,EAAYiW,GAAYzX,EAAU,GAAIC,EAAaiB,EAAWgM,KAy+N5EtD,GAAOwrB,YAh9NP,SAAqB5zB,EAAYxB,EAAUC,GACzC,IAAIP,EAAOoK,GAAQtI,GAAcL,GAAmBgB,GAChDjB,EAAYid,UAAUp1B,OAAS,EAEnC,OAAO2W,EAAK8B,EAAYiW,GAAYzX,EAAU,GAAIC,EAAaiB,EAAW4P,KA68N5ElH,GAAOyrB,OA/wEP,SAAgB9yB,EAAQ/a,EAAGi2B,GAMzB,OAJEj2B,GADGi2B,EAAQC,GAAenb,EAAQ/a,EAAGi2B,QArucvCjvB,IAqucgDhH,GAC1C,EAEAk6B,GAAUl6B,GAETmxB,GAAWnT,GAASjD,GAAS/a,IA0wEtCoiB,GAAO3Z,QApvEP,WACE,IAAI2P,EAAOue,UACP5b,EAASiD,GAAS5F,EAAK,IAE3B,OAAOA,EAAK7W,OAAS,EAAIwZ,EAASA,EAAOtS,QAAQ2P,EAAK,GAAIA,EAAK,KAivEjEgK,GAAOpgB,OAtoGP,SAAgB/B,EAAQyC,EAAMq2B,GAG5B,IAAIn2B,GAAS,EACTrB,GAHJmB,EAAO4nB,GAAS5nB,EAAMzC,IAGJsB,OAOlB,IAJKA,IACHA,EAAS,EACTtB,OAx3aF+G,KA03aSpE,EAAQrB,GAAQ,CACvB,IAAI/B,EAAkB,MAAVS,OA33ad+G,EA23a2C/G,EAAOsqB,GAAM7nB,EAAKE,UA33a7DoE,IA43aMxH,IACFoD,EAAQrB,EACR/B,EAAQu5B,GAEV94B,EAASmqB,GAAW5qB,GAASA,EAAMd,KAAKuB,GAAUT,EAEpD,OAAOS,GAonGTmiB,GAAO2jB,MAAQA,GACf3jB,GAAOhF,aAAeA,EACtBgF,GAAO0rB,OA15NP,SAAgB9zB,GAEd,OADWsI,GAAQtI,GAAc4K,GAAc2M,IACnCvX,IAy5NdoI,GAAOhG,KA/0NP,SAAcpC,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAI6U,GAAY7U,GACd,OAAO+nB,GAAS/nB,GAAc4C,GAAW5C,GAAcA,EAAWzY,OAEpE,IAAIolB,EAAMC,GAAO5M,GACjB,OAAI2M,GAAO7V,GAAU6V,GAAOzV,EACnB8I,EAAWoC,KAEbkS,GAAStU,GAAYzY,QAq0N9B6gB,GAAO8hB,UAAYA,GACnB9hB,GAAO2rB,KA/xNP,SAAc/zB,EAAYnB,EAAWod,GACnC,IAAI/d,EAAOoK,GAAQtI,GAAcJ,GAAYmY,GAI7C,OAHIkE,GAASC,GAAelc,EAAYnB,EAAWod,KACjDpd,OA/tTF7R,GAiuTOkR,EAAK8B,EAAYiW,GAAYpX,EAAW,KA2xNjDuJ,GAAO4rB,YAhsRP,SAAqB11B,EAAO9Y,GAC1B,OAAOwyB,GAAgB1Z,EAAO9Y,IAgsRhC4iB,GAAO6rB,cApqRP,SAAuB31B,EAAO9Y,EAAOgZ,GACnC,OAAO8Z,GAAkBha,EAAO9Y,EAAOywB,GAAYzX,EAAU,KAoqR/D4J,GAAO8rB,cAjpRP,SAAuB51B,EAAO9Y,GAC5B,IAAI+B,EAAkB,MAAT+W,EAAgB,EAAIA,EAAM/W,OACvC,GAAIA,EAAQ,CACV,IAAIqB,EAAQovB,GAAgB1Z,EAAO9Y,GACnC,GAAIoD,EAAQrB,GAAU6jB,GAAG9M,EAAM1V,GAAQpD,GACrC,OAAOoD,EAGX,OAAQ,GA0oRVwf,GAAO+rB,gBArnRP,SAAyB71B,EAAO9Y,GAC9B,OAAOwyB,GAAgB1Z,EAAO9Y,GAAO,IAqnRvC4iB,GAAOgsB,kBAzlRP,SAA2B91B,EAAO9Y,EAAOgZ,GACvC,OAAO8Z,GAAkBha,EAAO9Y,EAAOywB,GAAYzX,EAAU,IAAI,IAylRnE4J,GAAOisB,kBAtkRP,SAA2B/1B,EAAO9Y,GAEhC,GADsB,MAAT8Y,EAAgB,EAAIA,EAAM/W,OAC3B,CACV,IAAIqB,EAAQovB,GAAgB1Z,EAAO9Y,GAAO,GAAQ,EAClD,GAAI4lB,GAAG9M,EAAM1V,GAAQpD,GACnB,OAAOoD,EAGX,OAAQ,GA+jRVwf,GAAO+hB,UAAYA,GACnB/hB,GAAOksB,WA3oEP,SAAoBvzB,EAAQiwB,EAAQC,GAOlC,OANAlwB,EAASiD,GAASjD,GAClBkwB,EAAuB,MAAZA,EACP,EACAhmB,GAAUiV,GAAU+Q,GAAW,EAAGlwB,EAAOxZ,QAE7CypC,EAAS9X,GAAa8X,GACfjwB,EAAOrQ,MAAMugC,EAAUA,EAAWD,EAAOzpC,SAAWypC,GAqoE7D5oB,GAAO4jB,SAAWA,GAClB5jB,GAAOmsB,IAzUP,SAAaj2B,GACX,OAAQA,GAASA,EAAM/W,OACnBkZ,GAAQnC,EAAO6V,IACf,GAuUN/L,GAAOosB,MA7SP,SAAel2B,EAAOE,GACpB,OAAQF,GAASA,EAAM/W,OACnBkZ,GAAQnC,EAAO2X,GAAYzX,EAAU,IACrC,GA2SN4J,GAAOqsB,SA7hEP,SAAkB1zB,EAAQ5U,EAAS8vB,GAIjC,IAAIpvB,EAAWub,GAAO4G,iBAElBiN,GAASC,GAAenb,EAAQ5U,EAAS8vB,KAC3C9vB,OAj/cFa,GAm/cA+T,EAASiD,GAASjD,GAClB5U,EAAUw8B,GAAa,GAAIx8B,EAASU,EAAUi0B,IAE9C,IAII4T,EACAC,EALAC,EAAUjM,GAAa,GAAIx8B,EAAQyoC,QAAS/nC,EAAS+nC,QAAS9T,IAC9D+T,EAAchuC,GAAK+tC,GACnBE,EAAgB5zB,GAAW0zB,EAASC,GAIpCjsC,EAAQ,EACRmsC,EAAc5oC,EAAQ4oC,aAAe96B,GACrC1B,EAAS,WAGTy8B,EAAe18B,IAChBnM,EAAQ+kC,QAAUj3B,IAAW1B,OAAS,IACvCw8B,EAAYx8B,OAAS,KACpBw8B,IAAgBp8B,EAAgBc,GAAeQ,IAAW1B,OAAS,KACnEpM,EAAQ8oC,UAAYh7B,IAAW1B,OAAS,KACzC,KAME28B,EAAY,kBACb9uC,GAAe1B,KAAKyH,EAAS,cACzBA,EAAQ+oC,UAAY,IAAIzmC,QAAQ,MAAO,KACvC,6BAA+BuN,GAAmB,KACnD,KAEN+E,EAAOtS,QAAQumC,GAAc,SAAShyB,EAAOmyB,EAAaC,EAAkBC,EAAiBC,EAAe91B,GAsB1G,OArBA41B,IAAqBA,EAAmBC,GAGxC98B,GAAUwI,EAAOrQ,MAAM9H,EAAO4W,GAAQ/Q,QAAQyL,GAAmB6H,IAG7DozB,IACFT,GAAa,EACbn8B,GAAU,YAAc48B,EAAc,UAEpCG,IACFX,GAAe,EACfp8B,GAAU,OAAS+8B,EAAgB,eAEjCF,IACF78B,GAAU,iBAAmB68B,EAAmB,+BAElDxsC,EAAQ4W,EAASwD,EAAMzb,OAIhByb,KAGTzK,GAAU,OAIV,IAAIg9B,EAAWnvC,GAAe1B,KAAKyH,EAAS,aAAeA,EAAQopC,SACnE,GAAKA,GAKA,GAAIh8B,GAA2B2I,KAAKqzB,GACvC,MAAM,IAAI/xB,EA3idmB,2DAsid7BjL,EAAS,iBAAmBA,EAAS,QASvCA,GAAUo8B,EAAep8B,EAAO9J,QAAQuJ,EAAsB,IAAMO,GACjE9J,QAAQwJ,EAAqB,MAC7BxJ,QAAQyJ,EAAuB,OAGlCK,EAAS,aAAeg9B,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJp8B,EACA,gBAEF,IAAIvQ,EAASyiC,IAAQ,WACnB,OAAOhkC,GAASouC,EAAaK,EAAY,UAAY38B,GAClD0F,WAnldLjR,EAmldsB8nC,MAMtB,GADA9sC,EAAOuQ,OAASA,EACZqvB,GAAQ5/B,GACV,MAAMA,EAER,OAAOA,GA46DTogB,GAAOotB,MApsBP,SAAexvC,EAAGwY,GAEhB,IADAxY,EAAIk6B,GAAUl6B,IACN,GAAKA,EA5wfM,iBA6wfjB,MAAO,GAET,IAAI4C,EA1wfe,WA2wffrB,EAASmf,GAAU1gB,EA3wfJ,YA8wfnBA,GA9wfmB,WAixfnB,IADA,IAAIgC,EAAS6Y,GAAUtZ,EAHvBiX,EAAWyX,GAAYzX,MAId5V,EAAQ5C,GACfwY,EAAS5V,GAEX,OAAOZ,GAsrBTogB,GAAOmX,SAAWA,GAClBnX,GAAO8X,UAAYA,GACnB9X,GAAOmgB,SAAWA,GAClBngB,GAAOqtB,QAx5DP,SAAiBjwC,GACf,OAAOwe,GAASxe,GAAOmL,eAw5DzByX,GAAOsX,SAAWA,GAClBtX,GAAOstB,cApuIP,SAAuBlwC,GACrB,OAAOA,EACHylB,GAAUiV,GAAU16B,IAlvYL,mCAmvYJ,IAAVA,EAAcA,EAAQ,GAkuI7B4iB,GAAOpE,SAAWA,GAClBoE,GAAOutB,QAn4DP,SAAiBnwC,GACf,OAAOwe,GAASxe,GAAOiL,eAm4DzB2X,GAAOwtB,KA12DP,SAAc70B,EAAQoe,EAAOlD,GAE3B,IADAlb,EAASiD,GAASjD,MACHkb,QAzqdfjvB,IAyqdwBmyB,GACtB,OAAOre,GAASC,GAElB,IAAKA,KAAYoe,EAAQjG,GAAaiG,IACpC,OAAOpe,EAET,IAAIS,EAAauB,GAAchC,GAC3BU,EAAasB,GAAcoc,GAI/B,OAAO9E,GAAU7Y,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETjU,KAAK,KA81DhD4a,GAAOytB,QAx0DP,SAAiB90B,EAAQoe,EAAOlD,GAE9B,IADAlb,EAASiD,GAASjD,MACHkb,QA5sdfjvB,IA4sdwBmyB,GACtB,OAAOpe,EAAOrQ,MAAM,EAAGsQ,GAAgBD,GAAU,GAEnD,IAAKA,KAAYoe,EAAQjG,GAAaiG,IACpC,OAAOpe,EAET,IAAIS,EAAauB,GAAchC,GAG/B,OAAOsZ,GAAU7Y,EAAY,EAFnBE,GAAcF,EAAYuB,GAAcoc,IAAU,GAEvB3xB,KAAK,KA8zD5C4a,GAAO0tB,UAxyDP,SAAmB/0B,EAAQoe,EAAOlD,GAEhC,IADAlb,EAASiD,GAASjD,MACHkb,QA7udfjvB,IA6udwBmyB,GACtB,OAAOpe,EAAOtS,QAAQwK,EAAa,IAErC,IAAK8H,KAAYoe,EAAQjG,GAAaiG,IACpC,OAAOpe,EAET,IAAIS,EAAauB,GAAchC,GAG/B,OAAOsZ,GAAU7Y,EAFLD,GAAgBC,EAAYuB,GAAcoc,KAElB3xB,KAAK,KA8xD3C4a,GAAO2tB,SAtvDP,SAAkBh1B,EAAQ5U,GACxB,IAAI5E,EAnvdmB,GAovdnByuC,EAnvdqB,MAqvdzB,GAAIptB,GAASzc,GAAU,CACrB,IAAI6iC,EAAY,cAAe7iC,EAAUA,EAAQ6iC,UAAYA,EAC7DznC,EAAS,WAAY4E,EAAU+zB,GAAU/zB,EAAQ5E,QAAUA,EAC3DyuC,EAAW,aAAc7pC,EAAU+sB,GAAa/sB,EAAQ6pC,UAAYA,EAItE,IAAIzC,GAFJxyB,EAASiD,GAASjD,IAEKxZ,OACvB,GAAI0a,GAAWlB,GAAS,CACtB,IAAIS,EAAauB,GAAchC,GAC/BwyB,EAAY/xB,EAAWja,OAEzB,GAAIA,GAAUgsC,EACZ,OAAOxyB,EAET,IAAI3Q,EAAM7I,EAASqb,GAAWozB,GAC9B,GAAI5lC,EAAM,EACR,OAAO4lC,EAET,IAAIhuC,EAASwZ,EACT6Y,GAAU7Y,EAAY,EAAGpR,GAAK5C,KAAK,IACnCuT,EAAOrQ,MAAM,EAAGN,GAEpB,QAzzdApD,IAyzdIgiC,EACF,OAAOhnC,EAASguC,EAKlB,GAHIx0B,IACFpR,GAAQpI,EAAOT,OAAS6I,GAEtBwN,GAASoxB,IACX,GAAIjuB,EAAOrQ,MAAMN,GAAK1I,OAAOsnC,GAAY,CACvC,IAAIhsB,EACAlb,EAAYE,EAMhB,IAJKgnC,EAAUtkC,SACbskC,EAAY12B,GAAO02B,EAAUz2B,OAAQyL,GAAStK,GAAQyK,KAAK6qB,IAAc,MAE3EA,EAAUnsB,UAAY,EACdG,EAAQgsB,EAAU7qB,KAAKrc,IAC7B,IAAImuC,EAASjzB,EAAMpa,MAErBZ,EAASA,EAAO0I,MAAM,OA30d1B1D,IA20d6BipC,EAAuB7lC,EAAM6lC,SAEnD,GAAIl1B,EAAOnZ,QAAQsxB,GAAa8V,GAAY5+B,IAAQA,EAAK,CAC9D,IAAIxH,EAAQZ,EAAO2qC,YAAY3D,GAC3BpmC,GAAS,IACXZ,EAASA,EAAO0I,MAAM,EAAG9H,IAG7B,OAAOZ,EAASguC,GAksDlB5tB,GAAO8tB,SA5qDP,SAAkBn1B,GAEhB,OADAA,EAASiD,GAASjD,KACA1I,EAAiB6J,KAAKnB,GACpCA,EAAOtS,QAAQ0J,EAAegL,IAC9BpC,GAyqDNqH,GAAO+tB,SAvpBP,SAAkBC,GAChB,IAAI9b,IAAOrW,GACX,OAAOD,GAASoyB,GAAU9b,GAspB5BlS,GAAOgiB,UAAYA,GACnBhiB,GAAO0hB,WAAaA,GAGpB1hB,GAAOiuB,KAAOvvC,GACdshB,GAAOkuB,UAAYrR,GACnB7c,GAAOmuB,MAAQ/S,GAEfwH,GAAM5iB,IACA7P,GAAS,GACb8W,GAAWjH,IAAQ,SAASlK,EAAMme,GAC3Bj2B,GAAe1B,KAAK0jB,GAAOjiB,UAAWk2B,KACzC9jB,GAAO8jB,GAAcne,MAGlB3F,IACH,CAAE,OAAS,IAWjB6P,GAAOouB,QA/ihBK,UAkjhBZ93B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAAS2d,GACxFjU,GAAOiU,GAAYza,YAAcwG,MAInC1J,GAAU,CAAC,OAAQ,SAAS,SAAS2d,EAAYzzB,GAC/C2f,GAAYpiB,UAAUk2B,GAAc,SAASr2B,GAC3CA,OA5jhBFgH,IA4jhBMhH,EAAkB,EAAIwgB,GAAU0Z,GAAUl6B,GAAI,GAElD,IAAIgC,EAAUxB,KAAK6iB,eAAiBzgB,EAChC,IAAI2f,GAAY/hB,MAChBA,KAAK08B,QAUT,OARIl7B,EAAOqhB,aACTrhB,EAAOuhB,cAAgB7C,GAAU1gB,EAAGgC,EAAOuhB,eAE3CvhB,EAAOwhB,UAAUvc,KAAK,CACpB,KAAQyZ,GAAU1gB,EAvghBL,YAwghBb,KAAQq2B,GAAcr0B,EAAOohB,QAAU,EAAI,QAAU,MAGlDphB,GAGTugB,GAAYpiB,UAAUk2B,EAAa,SAAW,SAASr2B,GACrD,OAAOQ,KAAKygB,UAAUoV,GAAYr2B,GAAGihB,cAKzCvI,GAAU,CAAC,SAAU,MAAO,cAAc,SAAS2d,EAAYzzB,GAC7D,IAAIgB,EAAOhB,EAAQ,EACf6tC,EAjihBe,GAiihBJ7sC,GA/hhBG,GA+hhByBA,EAE3C2e,GAAYpiB,UAAUk2B,GAAc,SAAS7d,GAC3C,IAAIxW,EAASxB,KAAK08B,QAMlB,OALAl7B,EAAOshB,cAAcrc,KAAK,CACxB,SAAYgpB,GAAYzX,EAAU,GAClC,KAAQ5U,IAEV5B,EAAOqhB,aAAerhB,EAAOqhB,cAAgBotB,EACtCzuC,MAKX0W,GAAU,CAAC,OAAQ,SAAS,SAAS2d,EAAYzzB,GAC/C,IAAI8tC,EAAW,QAAU9tC,EAAQ,QAAU,IAE3C2f,GAAYpiB,UAAUk2B,GAAc,WAClC,OAAO71B,KAAKkwC,GAAU,GAAGlxC,QAAQ,OAKrCkZ,GAAU,CAAC,UAAW,SAAS,SAAS2d,EAAYzzB,GAClD,IAAI+tC,EAAW,QAAU/tC,EAAQ,GAAK,SAEtC2f,GAAYpiB,UAAUk2B,GAAc,WAClC,OAAO71B,KAAK6iB,aAAe,IAAId,GAAY/hB,MAAQA,KAAKmwC,GAAU,OAItEpuB,GAAYpiB,UAAUkmC,QAAU,WAC9B,OAAO7lC,KAAK2mC,OAAOhZ,KAGrB5L,GAAYpiB,UAAU+H,KAAO,SAAS2Q,GACpC,OAAOrY,KAAK2mC,OAAOtuB,GAAW2kB,QAGhCjb,GAAYpiB,UAAU6+B,SAAW,SAASnmB,GACxC,OAAOrY,KAAKygB,UAAU/Y,KAAK2Q,IAG7B0J,GAAYpiB,UAAUg/B,UAAY/N,IAAS,SAAS1uB,EAAM0V,GACxD,MAAmB,mBAAR1V,EACF,IAAI6f,GAAY/hB,MAElBA,KAAKuF,KAAI,SAASvG,GACvB,OAAOosB,GAAWpsB,EAAOkD,EAAM0V,SAInCmK,GAAYpiB,UAAUsoC,OAAS,SAAS5vB,GACtC,OAAOrY,KAAK2mC,OAAOhG,GAAOlR,GAAYpX,MAGxC0J,GAAYpiB,UAAUuK,MAAQ,SAASR,EAAOE,GAC5CF,EAAQgwB,GAAUhwB,GAElB,IAAIlI,EAASxB,KACb,OAAIwB,EAAOqhB,eAAiBnZ,EAAQ,GAAKE,EAAM,GACtC,IAAImY,GAAYvgB,IAErBkI,EAAQ,EACVlI,EAASA,EAAOqnC,WAAWn/B,GAClBA,IACTlI,EAASA,EAAO6kC,KAAK38B,SAvphBvBlD,IAyphBIoD,IAEFpI,GADAoI,EAAM8vB,GAAU9vB,IACD,EAAIpI,EAAO8kC,WAAW18B,GAAOpI,EAAOonC,KAAKh/B,EAAMF,IAEzDlI,IAGTugB,GAAYpiB,UAAUmpC,eAAiB,SAASzwB,GAC9C,OAAOrY,KAAKygB,UAAUsoB,UAAU1wB,GAAWoI,WAG7CsB,GAAYpiB,UAAU+hC,QAAU,WAC9B,OAAO1hC,KAAK4oC,KAtmhBO,aA0mhBrB/f,GAAW9G,GAAYpiB,WAAW,SAAS+X,EAAMme,GAC/C,IAAIua,EAAgB,qCAAqC10B,KAAKma,GAC1Dwa,EAAU,kBAAkB30B,KAAKma,GACjCya,EAAa1uB,GAAOyuB,EAAW,QAAwB,QAAdxa,EAAuB,QAAU,IAAOA,GACjF0a,EAAeF,GAAW,QAAQ30B,KAAKma,GAEtCya,IAGL1uB,GAAOjiB,UAAUk2B,GAAc,WAC7B,IAAI72B,EAAQgB,KAAKuiB,YACb3K,EAAOy4B,EAAU,CAAC,GAAKla,UACvBqa,EAASxxC,aAAiB+iB,GAC1B/J,EAAWJ,EAAK,GAChB64B,EAAUD,GAAU1uB,GAAQ9iB,GAE5Bq/B,EAAc,SAASr/B,GACzB,IAAIwC,EAAS8uC,EAAW74B,MAAMmK,GAAQ9I,GAAU,CAAC9Z,GAAQ4Y,IACzD,OAAQy4B,GAAW/tB,EAAY9gB,EAAO,GAAKA,GAGzCivC,GAAWL,GAAoC,mBAAZp4B,GAA6C,GAAnBA,EAASjX,SAExEyvC,EAASC,GAAU,GAErB,IAAInuB,EAAWtiB,KAAKyiB,UAChBiuB,IAAa1wC,KAAKwiB,YAAYzhB,OAC9B4vC,EAAcJ,IAAiBjuB,EAC/BsuB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BzxC,EAAQ4xC,EAAW5xC,EAAQ,IAAI+iB,GAAY/hB,MAC3C,IAAIwB,EAASkW,EAAKD,MAAMzY,EAAO4Y,GAE/B,OADApW,EAAOghB,YAAY/b,KAAK,CAAE,KAAQkwB,GAAM,KAAQ,CAAC0H,GAAc,aA1shBnE73B,IA2shBW,IAAIwb,GAAcxgB,EAAQ8gB,GAEnC,OAAIquB,GAAeC,EACVl5B,EAAKD,MAAMzX,KAAM4X,IAE1BpW,EAASxB,KAAK22B,KAAK0H,GACZsS,EAAeN,EAAU7uC,EAAOxC,QAAQ,GAAKwC,EAAOxC,QAAWwC,QAK1E0W,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAAS2d,GACxE,IAAIne,EAAOyF,GAAW0Y,GAClBgb,EAAY,0BAA0Bn1B,KAAKma,GAAc,MAAQ,OACjE0a,EAAe,kBAAkB70B,KAAKma,GAE1CjU,GAAOjiB,UAAUk2B,GAAc,WAC7B,IAAIje,EAAOue,UACX,GAAIoa,IAAiBvwC,KAAKyiB,UAAW,CACnC,IAAIzjB,EAAQgB,KAAKhB,QACjB,OAAO0Y,EAAKD,MAAMqK,GAAQ9iB,GAASA,EAAQ,GAAI4Y,GAEjD,OAAO5X,KAAK6wC,IAAW,SAAS7xC,GAC9B,OAAO0Y,EAAKD,MAAMqK,GAAQ9iB,GAASA,EAAQ,GAAI4Y,UAMrDiR,GAAW9G,GAAYpiB,WAAW,SAAS+X,EAAMme,GAC/C,IAAIya,EAAa1uB,GAAOiU,GACxB,GAAIya,EAAY,CACd,IAAIhxC,EAAMgxC,EAAWhyC,KAAO,GACvBsB,GAAe1B,KAAK+iB,GAAW3hB,KAClC2hB,GAAU3hB,GAAO,IAEnB2hB,GAAU3hB,GAAKmH,KAAK,CAAE,KAAQovB,EAAY,KAAQya,QAItDrvB,GAAUiW,QAnvhBR1wB,EAiCqB,GAkthB+BlI,MAAQ,CAAC,CAC7D,KAAQ,UACR,UArvhBAkI,IAyvhBFub,GAAYpiB,UAAU+8B,MAh9dtB,WACE,IAAIl7B,EAAS,IAAIugB,GAAY/hB,KAAKuiB,aAOlC,OANA/gB,EAAOghB,YAAcgC,GAAUxkB,KAAKwiB,aACpChhB,EAAOohB,QAAU5iB,KAAK4iB,QACtBphB,EAAOqhB,aAAe7iB,KAAK6iB,aAC3BrhB,EAAOshB,cAAgB0B,GAAUxkB,KAAK8iB,eACtCthB,EAAOuhB,cAAgB/iB,KAAK+iB,cAC5BvhB,EAAOwhB,UAAYwB,GAAUxkB,KAAKgjB,WAC3BxhB,GAy8dTugB,GAAYpiB,UAAU8gB,QA97dtB,WACE,GAAIzgB,KAAK6iB,aAAc,CACrB,IAAIrhB,EAAS,IAAIugB,GAAY/hB,MAC7BwB,EAAOohB,SAAW,EAClBphB,EAAOqhB,cAAe,OAEtBrhB,EAASxB,KAAK08B,SACP9Z,UAAY,EAErB,OAAOphB,GAs7dTugB,GAAYpiB,UAAUX,MA36dtB,WACE,IAAI8Y,EAAQ9X,KAAKuiB,YAAYvjB,QACzB8xC,EAAM9wC,KAAK4iB,QACXiB,EAAQ/B,GAAQhK,GAChBi5B,EAAUD,EAAM,EAChBrW,EAAY5W,EAAQ/L,EAAM/W,OAAS,EACnCiwC,EA8pIN,SAAiBtnC,EAAOE,EAAKi3B,GAC3B,IAAIz+B,GAAS,EACTrB,EAAS8/B,EAAW9/B,OAExB,OAASqB,EAAQrB,GAAQ,CACvB,IAAIwO,EAAOsxB,EAAWz+B,GAClBwZ,EAAOrM,EAAKqM,KAEhB,OAAQrM,EAAKnM,MACX,IAAK,OAAasG,GAASkS,EAAM,MACjC,IAAK,YAAahS,GAAOgS,EAAM,MAC/B,IAAK,OAAahS,EAAMsW,GAAUtW,EAAKF,EAAQkS,GAAO,MACtD,IAAK,YAAalS,EAAQsW,GAAUtW,EAAOE,EAAMgS,IAGrD,MAAO,CAAE,MAASlS,EAAO,IAAOE,GA7qIrBqnC,CAAQ,EAAGxW,EAAWz6B,KAAKgjB,WAClCtZ,EAAQsnC,EAAKtnC,MACbE,EAAMonC,EAAKpnC,IACX7I,EAAS6I,EAAMF,EACftH,EAAQ2uC,EAAUnnC,EAAOF,EAAQ,EACjC6lB,EAAYvvB,KAAK8iB,cACjBouB,EAAa3hB,EAAUxuB,OACvBwX,EAAW,EACX44B,EAAYjxB,GAAUnf,EAAQf,KAAK+iB,eAEvC,IAAKc,IAAWktB,GAAWtW,GAAa15B,GAAUowC,GAAapwC,EAC7D,OAAOmyB,GAAiBpb,EAAO9X,KAAKwiB,aAEtC,IAAIhhB,EAAS,GAEb6mB,EACA,KAAOtnB,KAAYwX,EAAW44B,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbpyC,EAAQ8Y,EAHZ1V,GAAS0uC,KAKAM,EAAYF,GAAY,CAC/B,IAAI3hC,EAAOggB,EAAU6hB,GACjBp5B,EAAWzI,EAAKyI,SAChB5U,EAAOmM,EAAKnM,KACZklB,EAAWtQ,EAAShZ,GAExB,GA7zDY,GA6zDRoE,EACFpE,EAAQspB,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTllB,EACF,SAASilB,EAET,MAAMA,GAIZ7mB,EAAO+W,KAAcvZ,EAEvB,OAAOwC,GAg4dTogB,GAAOjiB,UAAU0iC,GAAK/D,GACtB1c,GAAOjiB,UAAUy+B,MA1iQjB,WACE,OAAOA,GAAMp+B,OA0iQf4hB,GAAOjiB,UAAU0xC,OA7gQjB,WACE,OAAO,IAAIrvB,GAAchiB,KAAKhB,QAASgB,KAAKyiB,YA6gQ9Cb,GAAOjiB,UAAUgiC,KAp/PjB,gBA7wREn7B,IA8wRIxG,KAAK2iB,aACP3iB,KAAK2iB,WAAa+e,GAAQ1hC,KAAKhB,UAEjC,IAAI4iC,EAAO5hC,KAAK0iB,WAAa1iB,KAAK2iB,WAAW5hB,OAG7C,MAAO,CAAE,KAAQ6gC,EAAM,MAFXA,OAlxRZp7B,EAkxR+BxG,KAAK2iB,WAAW3iB,KAAK0iB,eAg/PtDd,GAAOjiB,UAAUs3B,MA77PjB,SAAsBj4B,GAIpB,IAHA,IAAIwC,EACA6pB,EAASrrB,KAENqrB,aAAkBhJ,IAAY,CACnC,IAAIqa,EAAQza,GAAaoJ,GACzBqR,EAAMha,UAAY,EAClBga,EAAM/Z,gBA50RRnc,EA60RMhF,EACFivB,EAASlO,YAAcma,EAEvBl7B,EAASk7B,EAEX,IAAIjM,EAAWiM,EACfrR,EAASA,EAAO9I,YAGlB,OADAkO,EAASlO,YAAcvjB,EAChBwC,GA66PTogB,GAAOjiB,UAAU8gB,QAt5PjB,WACE,IAAIzhB,EAAQgB,KAAKuiB,YACjB,GAAIvjB,aAAiB+iB,GAAa,CAChC,IAAIuvB,EAAUtyC,EAUd,OATIgB,KAAKwiB,YAAYzhB,SACnBuwC,EAAU,IAAIvvB,GAAY/hB,QAE5BsxC,EAAUA,EAAQ7wB,WACV+B,YAAY/b,KAAK,CACvB,KAAQkwB,GACR,KAAQ,CAAClW,IACT,aAx3RJja,IA03RS,IAAIwb,GAAcsvB,EAAStxC,KAAKyiB,WAEzC,OAAOziB,KAAK22B,KAAKlW,KAw4PnBmB,GAAOjiB,UAAU4xC,OAAS3vB,GAAOjiB,UAAU+hB,QAAUE,GAAOjiB,UAAUX,MAv3PtE,WACE,OAAOk0B,GAAiBlzB,KAAKuiB,YAAaviB,KAAKwiB,cAy3PjDZ,GAAOjiB,UAAUowC,MAAQnuB,GAAOjiB,UAAUq9B,KAEtCre,KACFiD,GAAOjiB,UAAUgf,IAj+PnB,WACE,OAAO3e,OAk+PF4hB,GAMDhF,GAGgD,UAArB,EAAO40B,QAA0BA,OAKlEr7B,GAAKhK,EAAIA,QA1xhBP3F,KA8xhBFgrC,aACE,OAAOrlC,IACR,+BAGMmK,KAENA,GAAWzY,QAAUsO,IAAGA,EAAIA,GAE7BiK,GAAYjK,EAAIA,IAIhBgK,GAAKhK,EAAIA,KAEXjO,KAAK8B,Q","file":"blog.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 97);\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","'use strict';\n\nmodule.exports = function (include) {\n if (typeof include === 'function') {\n include();\n } else if (typeof include === 'object') {\n Object.keys(include).forEach(function (key) {\n if (typeof include[key] === 'function') {\n include[key]();\n }\n });\n }\n};\n","'use strict';\n\n// TODO: https://columbia.atlassian.net/browse/GSD-16533 Update URL functions to use the JS URL API\n/**\n * Append a parameter to a url\n * @param {string} url - a url\n * @param {string} name - key\n * @param {string} value - value\n * @return {string} url with param appended\n */\nfunction appendParamToURL(url, name, value) {\n var c = '?';\n if (url.indexOf(c) !== -1) {\n c = '&';\n }\n return url + c + name + '=' + encodeURIComponent(value);\n}\n\n/**\n * Helper function for getParamsFromURL. Split a url string into key/value pairs.\n * @param {string} str - url parameter string\n * @return {Object} object with params split into key/value pairs\n */\nfunction keyValueArray(str) {\n var kvp = str.split('&');\n var x;\n var k;\n var v;\n var output = {};\n\n for (var i = kvp.length - 1; i >= 0; i--) {\n if (kvp[i].length) { // No empty strings...\n x = kvp[i].split('=');\n k = x[0];\n v = '';\n if (x.length > 1) {\n v = x[1];\n }\n output[k] = v;\n }\n }\n\n return output;\n}\n\n/**\n * Split a url string into key/value pairs.\n * @param {string} url - url parameter string\n * @return {Object} object with params split into key/value pairs\n */\nfunction getParamsFromURL(url) {\n var arr = url.split('?');\n var search = '';\n var searchHash = '';\n var postHash = false;\n\n if (arr.length > 1) {\n var arrHash = arr[1].split('#');\n search = arrHash[0];\n\n if (arrHash.length > 1) {\n postHash = true;\n searchHash = arrHash[1];\n }\n }\n\n var output = {};\n if (search.length) {\n output = keyValueArray(search);\n }\n if (postHash) {\n if (searchHash.length) {\n var output2 = keyValueArray(searchHash);\n Object.keys(output2).forEach(function (prop) {\n output[prop] = output2[prop]; // Merge them...\n });\n }\n }\n\n return output;\n}\n\n/**\n * Update an existing url param\n * https://stackoverflow.com/questions/1090948/change-url-parameters\n * @param {string} url - Url to be updated\n * @param {string} param - param to be updated\n * @param {string} paramVal - new parameter value\n * @returns {string} - updated url\n */\nfunction updateURLParam(url, param, paramVal) {\n var newAdditionalURL = '';\n var tempArray = url.split('?');\n var baseURL = tempArray[0];\n var additionalURL = tempArray[1];\n var temp = '';\n if (additionalURL) {\n tempArray = additionalURL.split('&');\n for (var i = 0; i < tempArray.length; i++) {\n if (tempArray[i].split('=')[0] !== param) {\n newAdditionalURL += temp + tempArray[i];\n temp = '&';\n }\n }\n }\n\n var rowsText = temp + '' + param + '=' + paramVal;\n return baseURL + '?' + newAdditionalURL + rowsText;\n}\n\n/**\n * Turn the URL query string into a JSON object to make it easier to add/update/delete key/value pairs.\n * @param {string} url the URL string from which to get the querystring. Null or empty string to use the location.href.\n * @returns {obejct} the query string as an object.\n */\nfunction queryStringToObject(url) {\n var search;\n if (!url) {\n // get the query string from window.location.search\n search = location.search.substring(1); // exclude the leading ?\n } else {\n // find the query string in the given url\n var startIndex = url.indexOf('?') + 1;\n var endIndex = url.indexOf('#');\n endIndex = endIndex >= startIndex ? endIndex : url.length;\n // examples:\n // 'key=val#hash', '/?key=val#hash' => 'key=val'\n // '?key#hash' => 'key'\n search = url.substring(startIndex, endIndex);\n if (startIndex === 0 && search.indexOf('=') === -1) {\n // this string doesn't look like a query string (no '?' and no '=')\n // examples: 'key#hash', '/#hash'\n search = '';\n }\n }\n\n var result = {};\n if (search) {\n var pairs = search.split('&');\n pairs.forEach(function (pair) {\n var nameVal = pair.split('=');\n result[nameVal[0]] = decodeURIComponent(nameVal[1] || '');\n });\n }\n\n return JSON.parse(JSON.stringify(result));\n}\n\n/**\n * Convert an object into a serialized string; the opposite of queryStringToObject().\n * @param {Object} obj The object to be serialized into a string\n * @param {string} urlString An optional url into which to insert the querystring. Any existing query string will be replaced.\n * @returns {string} The resulting query or URL string.\n */\nfunction objectToQueryString(obj, urlString) {\n var url = urlString || '';\n var path = '';\n var hash = '';\n if (url) {\n var qsIndex = url.indexOf('?');\n var hashIndex = url.indexOf('#');\n var index;\n if (hashIndex > -1) {\n index = hashIndex;\n hash = url.substring(hashIndex);\n }\n if (qsIndex > -1) {\n index = qsIndex;\n }\n path = url.substring(0, index); // if index is undefined, path is the entire string.\n }\n return path + '?' + $.param(obj) + hash;\n}\n\n/**\n * Update a URL with a key/value pair. This will insert or update a pair.\n * @param {string} url The url to be updated.\n * @param {string} name The key name to use in the query string.\n * @param {string} val The value of the key to be set.\n * @returns {string} The updated URL.\n */\nfunction setUrlKeyValue(url, name, val) {\n var qs = queryStringToObject(url);\n qs[name] = encodeURIComponent(val);\n return objectToQueryString(qs, url);\n}\n\n/**\n * Update a URL with multiple key/value pairs. This will insert new or update existing keys.\n * @param {string} url The url to be updated.\n * @param {Object} obj an object of name/value pairs to be inserted/updated in the url query string.\n * @returns {string} The updated URL.\n */\nfunction setUrlData(url, obj) {\n var qs = queryStringToObject(url);\n var mergedQs = $.extend({}, qs, obj);\n return objectToQueryString(mergedQs, url);\n}\n\n/**\n * DecodeURIComponent cannot be used directly to parse query parameters from a URL. It needs a bit of preparation.\n * reference: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent\n * @param {string} val The query param value to be decoded.\n * @returns {string} The decoded query param value.\n */\nfunction decodeQueryParam(val) {\n return decodeURIComponent(val.replace(/\\+/g, ' '));\n}\n\n/**\n * Remove the queryparam from the url\n * @param {string} queryparam queryparam to be removed\n * @param {string} urlString url to be manipulated\n * @returns {URL} new url without provided queryparam\n */\nfunction removeQueryParam(queryparam, urlString) {\n var url = new URL(urlString);\n url.searchParams.delete(queryparam);\n return url;\n}\n\n/**\n * Remove the queryparam from the url, and replace the state\n * @param {string} queryparam queryparam to be removed\n */\nfunction removeQueryParamFromCurrentUrl(queryparam) {\n var url = removeQueryParam(queryparam, window.location.href);\n history.replaceState(null, '', url);\n}\n\n/**\n * Returns an array with values that exist in both arrays\n * @param {array} a1 - Array\n * @param {array} a2 - Array\n * @return {array} - Values that appear in both arrays\n */\nfunction arrayIntersection(a1, a2) {\n var intersect = $.map(a1,\n function (v) {\n return $.inArray(v, a2) < 0 ? null : v;\n }\n );\n return intersect;\n}\n\n/**\n * Creates and returns the markup required to display a modal.\n * The calling script should then use the bootstrap $.modal() method to display the modal.\n * Example 1:\n * var modalMarkup = createModalMarkup('

Hello World

', {title: 'Greeting'});\n * var $modal = $(modalMarkup).modal();\n * Example 2:\n * var $modal = $(createModalMarkup('')); // create empty modal\n * $modal.find('.modal-body').html(data); // inject content into the returned markup\n * $modal.modal();\n * @param {string} content The content to put in the modal. Pass empty string to just get the modal markup.\n * @param {Object} options Additional settings.\n * @return {string} The completed markup.\n */\nfunction createModalMarkup(content = '', options = {}) {\n /* Bootstrap Modal documentation: https://getbootstrap.com/docs/4.0/components/modal/ */\n const defaults = {\n title: '',\n showCloseBtn: true,\n enableLayeredDrawers: false,\n modalSizeClass: 'modal-lg', // possible values: modal-sm, modal-md (or empty string), modal-lg, modal-fluid\n centeredClass: 'modal-dialog-centered', // pass empty string to top-align the modal\n customClasses: '', // additional classes to be added to the modal\n modalId: '', // Custom id for the modal\n buttons: [\n // example markup (this will also dismiss the modal on click):\n // ''\n ]\n };\n const settings = $.extend({}, defaults, options);\n\n // additional uncommon bootstrap options go into data attributes\n const dataAttributes = [];\n ['backdrop', 'keyboard', 'focus', 'show'].forEach(param => {\n if (settings[param] !== undefined) {\n dataAttributes.push(`data-${param}=\"${settings[param]}\"`);\n }\n });\n\n let header = '
';\n if (settings.title) {\n header += `
${settings.title}
`;\n }\n if (settings.showCloseBtn) {\n header += '';\n }\n header += '
';\n\n let idAttribute = '';\n if (settings.modalId) {\n idAttribute = `id=\"${settings.modalId}\"`;\n }\n\n let footer = '';\n let footerBtns = '';\n for (let btn of settings.buttons) {\n footerBtns += btn;\n }\n if (footerBtns) {\n footer = `
${footerBtns}
`;\n }\n\n // tabindex=\"-1\" is necessary to allow the modal to close when ESC key is pressed.\n // https://stackoverflow.com/questions/12630156/how-do-you-enable-the-escape-key-close-functionality-in-a-twitter-bootstrap-moda\n const html = `
\n
\n
\n ${header}\n
\n ${content}\n
\n ${footer}\n
\n
\n
`;\n\n return html;\n}\n/**\n * Creates a backdrop element and appends it to the body tag.\n * @param {string} customClass An optional class to apply to the backdrop.\n */\nfunction createBackdrop(customClass) {\n var cls = customClass || '';\n var html = '
';\n $('body').append(html);\n}\n\n/**\n * Removes from the page the backdrop with the passed in class, or all backdrops if nothing is passed.\n * @param {string} customClass An optional class for selecting a backdrop to be removed. All will be removed if this is null.\n */\nfunction removeBackdrop(customClass) {\n var selector = '.backdrop' + (customClass ? '.' + customClass : '');\n $('body').find(selector).remove();\n}\n\n/**\n * display element in viewport\n * @param {string} el element in viewport\n * @param {string} offsetToTop off set top position\n * @return {boolean} element view port\n */\nfunction elementInViewport(el, offsetToTop) {\n var top = el.offsetTop;\n var left = el.offsetLeft;\n var width = el.offsetWidth;\n var height = el.offsetHeight;\n\n while (el.offsetParent) {\n el = el.offsetParent; // eslint-disable-line no-param-reassign\n top += el.offsetTop;\n left += el.offsetLeft;\n }\n\n if (typeof offsetToTop !== 'undefined') {\n top -= offsetToTop;\n }\n\n if (window.pageXOffset !== null) {\n return (\n top < (window.pageYOffset + window.innerHeight) &&\n left < (window.pageXOffset + window.innerWidth) &&\n (top + height) > window.pageYOffset &&\n (left + width) > window.pageXOffset\n );\n }\n\n if (document.compatMode === 'CSS1Compat') {\n return (\n top < (window.document.documentElement.scrollTop + window.document.documentElement.clientHeight) &&\n left < (window.document.documentElement.scrollLeft + window.document.documentElement.clientWidth) &&\n (top + height) > window.document.documentElement.scrollTop &&\n (left + width) > window.document.documentElement.scrollLeft\n );\n }\n\n return false;\n}\n\n/**\n * append script to body tag\n * @param {string} src url of the script to append\n * @param {function} callback optional callback to fire after load\n */\nfunction loadScript(src, callback) {\n var script = document.createElement('script');\n script.type = 'text/javascript';\n script.src = src;\n document.getElementsByTagName('body')[0].appendChild(script);\n\n if (callback) {\n script.onload = callback;\n }\n}\n\n/**\n * load script to DOM if document ready state is complete or load after window load\n * @param {string} src url of the script to append\n * @param {function} callback optional callback to fire after load\n */\nfunction loadJsAfterWindowLoad(src, callback) {\n if (document.readyState === 'complete') {\n loadScript(src, callback);\n } else {\n window.addEventListener('load', function () {\n loadScript(src, callback);\n });\n }\n}\n\n/**\n * Inserts pasted text at cursor location in input or textarea elements.\n * If a range of text is selected in the input, that range will be replaced by the new text\n * If no text in the input is selected, the string will be inserted at the end\n * @param {selector} formInput - DOM element for the target form input\n * @param {string} str - string to insert into the form\n */\nfunction insertAtInputCursor(formInput, str) {\n var input = formInput;\n var start = input.selectionStart;\n var end = input.selectionEnd;\n\n // Inserts str between selection start and end positions\n input.value = input.value.substring(0, start) + str + input.value.substring(end);\n // Update cursor position\n input.selectionStart = start + str.length;\n input.selectionEnd = input.selectionStart;\n}\n\n/**\n * Returns validity of date\n * @param {string} stageMessage The name of the stage we're going to.\n * @returns {string} Returns true if the day is within the month. Returns false if it is an invalid date.\n */\nfunction getTimeAndHours(stageMessage) {\n var date = new Date();\n var hours = date.getHours();\n var minutes = date.getMinutes();\n var ampm = hours >= 12 ? 'PM' : 'AM';\n hours %= 12;\n hours = hours || 12; // the hour '0' should be '12'\n minutes = minutes < 10 ? '0' + minutes : minutes;\n var strTime = hours + ':' + minutes + ' ' + ampm;\n return stageMessage + ' ' + strTime;\n}\n// intentionally export loadJsAfterWindowLoad onto global scope\nglobal.cscUtils = global.cscUtils || {};\nglobal.cscUtils.loadJsAfterWindowLoad = loadJsAfterWindowLoad;\n\n/**\n * Converts a string to Title Case.\n * @example\n * 'fRiEnDsHiP is MAGIC' -> 'Friendship Is Magic'\n * 'don't uppercase contractions' -> 'Don't Uppercase Contractions'\n * 'hyphenated-strings work too' -> 'Hyphenated-Strings Work Too'\n * @param {string} str The string to be title cased.\n * @returns {string} The original string in title case.\n */\nfunction stringToTitleCase(str) {\n return str.replace(/[^\\s/-]+/g, function (word) {\n return word.charAt(0).toUpperCase() + word.slice(1).toLowerCase();\n });\n}\n\n/** Function to heapify a subtree rooted with node ndx\n * @param {Array} list - The array to heapify\n * @param {number} ndx - The index of the root of the subtree to heapify\n * @param {number} heapSize - The size of the heap\n * @param {string} key - The object key to find the highest numbers for\n */\nfunction heapify(list, ndx, heapSize, key) {\n let largest = ndx;\n // eslint-disable-next-line no-mixed-operators\n const left = 2 * ndx + 1;\n // eslint-disable-next-line no-mixed-operators\n const right = 2 * ndx + 2;\n\n // Check if left child is larger than root\n if (left < heapSize && list[left][key] > list[largest][key]) {\n largest = left;\n }\n\n // Check if right child is larger than root\n if (right < heapSize && list[right][key] > list[largest][key]) {\n largest = right;\n }\n\n // If largest is not root\n if (largest !== ndx) {\n // Swap array[i] and array[largest]\n // eslint-disable-next-line no-param-reassign\n [list[ndx], list[largest]] = [list[largest], list[ndx]];\n // Recursively heapify the affected sub-tree\n heapify(list, largest, heapSize, key);\n }\n}\n\n/** Function to heapify the array into max heap\n * @param {Array} list - The array to heapify\n * @param {string} key - The object key to find the highest numbers for\n */\nfunction heapifyMax(list, key) {\n const arrayLength = list.length;\n\n // Build max heap\n for (let ndx = Math.floor(arrayLength / 2) - 1; ndx >= 0; ndx--) {\n heapify(list, ndx, arrayLength, key);\n }\n\n for (let ndx = arrayLength - 1; ndx > 0; ndx--) {\n let firstListItem = list[0];\n // eslint-disable-next-line no-param-reassign\n list[0] = list[ndx];\n // eslint-disable-next-line no-param-reassign\n list[ndx] = firstListItem;\n\n heapify(list, 0, ndx, key);\n }\n}\n\n/** Function to find the n highest numbers in an array\n * @param {Array} list - The array to find the n highest numbers in\n * @param {number} n - The number of highest numbers to find\n * @param {string} key - The object key to find the highest numbers for\n * @returns {Array} The n highest numbers\n */\nfunction findNHighest(list, n, key) {\n if (list.length < n) {\n // eslint-disable-next-line no-param-reassign\n n = list.length;\n }\n\n const listToUse = JSON.parse(JSON.stringify(list)); // Deep copy the list\n const result = [];\n\n // Build max heap\n heapifyMax(listToUse, key);\n\n for (let i = 0; i < n; i++) {\n // Extract max element from the max heap\n result.push(listToUse.pop());\n }\n\n return result;\n}\n\n/** Function to compare two objects for deep equality\n * @param {Object} obj1 - The first object to compare\n * @param {Object} obj2 - The second object to compare\n * @returns {boolean} Whether the two objects are deep equal\n */\nfunction deepEqual(obj1, obj2) {\n return (obj1 && obj2 && typeof obj1 === 'object' && typeof obj2 === 'object') ?\n (Object.keys(obj1).length === Object.keys(obj2).length) &&\n Object.keys(obj1).reduce(function (isEqual, key) {\n return isEqual && deepEqual(obj1[key], obj2[key]);\n }, true) : (obj1 === obj2);\n}\n\nmodule.exports = {\n appendParamToURL: appendParamToURL,\n keyValueArray: keyValueArray,\n getParamsFromURL: getParamsFromURL,\n updateURLParam: updateURLParam,\n arrayIntersection: arrayIntersection,\n createModalMarkup: createModalMarkup,\n queryStringToObject: queryStringToObject,\n objectToQueryString: objectToQueryString,\n removeQueryParam: removeQueryParam,\n removeQueryParamFromCurrentUrl: removeQueryParamFromCurrentUrl,\n createBackdrop: createBackdrop,\n removeBackdrop: removeBackdrop,\n setUrlKeyValue: setUrlKeyValue,\n setUrlData: setUrlData,\n decodeQueryParam: decodeQueryParam,\n elementInViewport: elementInViewport,\n loadJsAfterWindowLoad: loadJsAfterWindowLoad,\n insertAtInputCursor: insertAtInputCursor,\n stringToTitleCase,\n getTimeAndHours: getTimeAndHours,\n findNHighest: findNHighest,\n deepEqual: deepEqual\n};\n","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/* globals __webpack_amd_options__ */\nmodule.exports = __webpack_amd_options__;\n","'use strict';\n\nvar processInclude = require('./components/processInclude');\n\n$(document).ready(function () {\n processInclude(require('./blog/blog'));\n});\n","'use strict';\nvar util = require('../components/utils');\nvar _ = require('lodash');\n/**\n * Method to append story rows\n * @param {Object} response placeholder for grid html content\n */\nfunction appendBlogGrid(response) {\n $('.load-more, .load-all, .js-blog-story-attribute').remove();\n $('.story-col').last().after(response);\n}\n\n/**\n * Method to replace story rows\n * @param {Object} response placeholder for grid html content\n */\nfunction replaceBlogGrid(response) {\n $('.blog-story-segment .blog-grid').empty().html(response);\n}\n\nmodule.exports = {\n loadCarousel: function () {\n $('.carousel').carousel();\n },\n /**\n * Event handler for load more button\n */\n loadMore: function () {\n $('.blog-story-segment').on('click', '.btn-load-more', function (e) {\n e.preventDefault();\n var url = $('.load-more').attr('action');\n $.spinner().start();\n\n $.ajax({\n url: url,\n type: 'GET',\n success: function (response) {\n appendBlogGrid(response);\n $.spinner().stop();\n },\n error: function (err) {\n if (err.responseJSON.redirectUrl) {\n window.location.href = err.responseJSON.redirectUrl;\n }\n }\n });\n return false;\n });\n },\n loadFiltered: function () {\n $('#filterStories').on('change', 'select', _.debounce(function (e) {\n e.preventDefault();\n var $parent = $(e.delegateTarget);\n var articleType = $parent.find('.js-filter-article-type').val();\n var sortType = $parent.find('.js-sort-article-type').val();\n var [sortBy, sortOrder] = sortType.split('_');\n var url = `${$('#filterStories').attr('action')}&sortBy=${sortBy}&sortOrder=${sortOrder}`;\n if (articleType !== '') {\n url += `&aType=${articleType}`;\n }\n\n $.spinner().start();\n\n $.ajax({\n url: url,\n type: 'GET',\n success: function (response) {\n replaceBlogGrid(response);\n $.spinner().stop();\n },\n error: function (err) {\n if (err.responseJSON.redirectUrl) {\n window.location.href = err.responseJSON.redirectUrl;\n }\n $.spinner().stop();\n }\n });\n\n return false;\n }, 500));\n },\n loadAllFeatured: function () {\n $('.blog-story-segment').on('click', '.btn-load-all-featured', function (e) {\n e.preventDefault();\n var url = $('.load-all-featured').attr('action');\n $.spinner().start();\n\n $.ajax({\n url: url,\n type: 'GET',\n success: function (response) {\n replaceBlogGrid(response);\n $.spinner().stop();\n },\n error: function (err) {\n if (err.responseJSON.redirectUrl) {\n window.location.href = err.responseJSON.redirectUrl;\n }\n }\n });\n\n return false;\n });\n },\n loadAll: function () {\n $('.blog-story-segment').on('click', '.btn-load-all', function (e) {\n e.preventDefault();\n var url = $('.load-all').attr('action');\n $.spinner().start();\n\n $.ajax({\n url: url,\n type: 'GET',\n success: function (response) {\n replaceBlogGrid(response);\n $.spinner().stop();\n },\n error: function (err) {\n if (err.responseJSON.redirectUrl) {\n window.location.href = err.responseJSON.redirectUrl;\n }\n }\n });\n return false;\n });\n },\n ofsTabLinkClicked: function () {\n $('.js-blog-type-link').on('click', function () {\n var currentEle = $(this);\n var href = currentEle.attr('href');\n if (href) {\n window.location = href;\n }\n return false;\n });\n },\n loadPagination: function () {\n $('.blog-story-segment').on('click', '.js-blog-story-pagination', function (e) {\n e.preventDefault();\n if ($(this).hasClass('selected')) {\n return false;\n }\n var url = $(this).attr('href');\n $.spinner().start();\n\n $.ajax({\n url: url,\n type: 'GET',\n success: function (response) {\n replaceBlogGrid(response);\n $.spinner().stop();\n },\n error: function (err) {\n if (err.responseJSON.redirectUrl) {\n window.location.href = err.responseJSON.redirectUrl;\n }\n }\n });\n return false;\n });\n },\n infiniteScroll: function () {\n // getting the hidden div, which is the placeholder for the next page\n $(document).bind('scroll', function () {\n var $loadingPlaceHolder = $('.infinite-scroll-placeholder[data-loading-state=\"unloaded\"]');\n // get url hidden in DOM\n var gridUrl = $loadingPlaceHolder.attr('data-grid-url');\n\n if ($loadingPlaceHolder.length === 1 && util.elementInViewport($loadingPlaceHolder.get(0), 250)) {\n // switch state to 'loading'\n // - switches state, so the above selector is only matching once\n // - shows loading indicator\n $loadingPlaceHolder.attr('data-loading-state', 'loading');\n $loadingPlaceHolder.addClass('infinite-scroll-loading');\n\n\n // named wrapper function, which can either be called, if cache is hit, or ajax repsonse is received\n var fillEndlessScrollChunk = function (response) {\n $loadingPlaceHolder.removeClass('infinite-scroll-loading');\n $loadingPlaceHolder.attr('data-loading-state', 'loaded');\n appendBlogGrid(response);\n };\n\n if ('sessionStorage' in window && sessionStorage['scroll-cache_' + gridUrl]) {\n // if we hit the cache\n fillEndlessScrollChunk(sessionStorage['scroll-cache_' + gridUrl]);\n } else {\n $.spinner().start();\n $.ajax({\n type: 'GET',\n url: gridUrl,\n success: function (response) {\n // put response into cache\n try {\n sessionStorage['scroll-cache_' + gridUrl] = response;\n } catch (e) {\n // nothing to catch in case of out of memory of session storage\n // it will fall back to load via ajax\n }\n // update UI\n fillEndlessScrollChunk(response);\n },\n complete: function () {\n $.spinner().stop();\n },\n error: function () {\n $.spinner().stop();\n }\n });\n }\n }\n });\n },\n webShare: function () {\n const $blogSocialShareMobile = $('.js-blog-social-share-mobile');\n const $blogSocialShareDesktop = $('.blog-social-container-desktop');\n\n // more information on WebShare API: https://developer.mozilla.org/en-US/docs/Web/API/Web_Share_API\n if (!navigator.share) {\n // fallback for browsers that do not support WebShare API, show Desktop social links\n $blogSocialShareMobile.addClass('d-none');\n $blogSocialShareDesktop.removeClass('d-none');\n } else {\n $blogSocialShareMobile.on('click', function (e) {\n e.preventDefault();\n navigator.share({\n title: $blogSocialShareMobile.attr('data-title'),\n url: $blogSocialShareMobile.attr('data-currenturl')\n }).catch(window.console.error);\n });\n }\n },\n copyClipboard: function () {\n // more information on Clipboard API: https://developer.mozilla.org/en-US/docs/Web/API/Navigator/clipboard\n if (!navigator.clipboard) {\n // fallback for browsers that do not support clipboard\n $('.blog-copy-to-clipboard-share').addClass('d-none');\n } else {\n $('.js-blog-copy-to-clipboard-share-button').on('click', function (e) {\n e.preventDefault();\n const $copyBtn = $(this);\n\n // Get the current URL\n navigator.clipboard.writeText($copyBtn.data('currenturl'));\n\n // Alert that the URL has been copied\n $.alert({\n content: $copyBtn.data('copy-success'),\n theme: 'success',\n timeToLive: 3000,\n dismissible: false\n });\n });\n }\n }\n};\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.21';\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 INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\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 whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\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 /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\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 `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\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 `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\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 if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, 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 (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\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 var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var 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 // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\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 // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\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 * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', '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': 30 },\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', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['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 = baseTrim(value);\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': '