{"version":3,"sources":["webpack:///./src/mixins/index.js","webpack:///./node_modules/lodash/lodash.js","webpack:///./src/components/common/Dialog.vue","webpack:///src/components/common/Dialog.vue","webpack:///./src/components/common/Dialog.vue?466b","webpack:///./src/components/common/Dialog.vue?c95f"],"names":["mixins","data","codeStatusSupportFirst","codeStatusSupportA","codeStatusSupportB","codeStatusSupportContinuing","codeStatusSupportFinal","INITIAL_SUPPORT","CONTINUOUS_SUPPORT","FINAL_EVALUATION","BEFORE_START_SUPPORT","SUPPORT_IN_PROGRESS","SUPPORT_COMPLETE","END_HALFWAY","FIRST_INTERVIEW_DECLINE","SUPPORT_FLOW_STATUS_PLAN","SUPPORT_FLOW_STATUS_SCHEDULE","SUPPORT_FLOW_STATUS_PROGRESS","SUPPORT_FLOW_STATUS_CONFIRM","SUPPORT_FLOW_STATUS_CANCEL","HEALTH_GUIDANCE_DIV_ACTIVE","SUPPORT_FLOW_STATUS_BEFORE_SUPPORT","SUPPORT_FLOW_STATUS_IN_PROGRESS_SUPPORT","SUPPORT_FLOW_STATUS_FINISH","SUPPORT_FLOW_STATUS_PART_FINNISH_SUPPORT","SUPPORT_FLOW_STATUS_DENIED_SUPPORT","HEALTH_GUIDANCE_PERIOD_1","HEALTH_GUIDANCE_PERIOD_2","HEALTH_GUIDANCE_PERIOD_3","HEALTH_GUIDANCE_PERIOD_4","SYSTEM_USER","SUPPORTER","BACKOFFICE","SYSTEM_MAINTAIN","PLAN","SCHEDULE","IN_PROGRESS","CONFIRM","OUTCOME_EVAL_POINT_EATING","OUTCOME_EVAL_POINT_EXERCISE","OUTCOME_EVAL_POINT_SMOKING","OUTCOME_EVAL_POINT_REST","OUTCOME_EVAL_POINT_ELSE","OUTCOME_EVAL_POINT_1CM_1KG","OUTCOME_EVAL_POINT_2CM_2KG","methods","currentUserID","userRaw","localStorage","getInfo","user","length","JSON","parse","id","canAutoSend","reception","flow","_user","_user2","roleSystem","user_sys_auth_div","split","indexOf","this","healthGuidance","health_guidance_div","supportFlow","support_flow_status","canStopSplitSupport","checkCanStopSplitSupport","canStop","_user3","_user4","canReject","_user5","_user6","canIncomplete","_user7","_user8","checkSplitFirstSupportSecond","isSystemAdminOrBackOffice","_user9","_user10","isSystemAdmin","_user11","isSupporter","checkOnly","_user12","authDivs","hasSupporter","isBackOffice","_user13","isSystemMaintain","_user14","notifyInfo","message","$toast","open","type","notifyError","notifySuccess","notifyWarn","notifyNoSearchResults","notifyInputInvalidToast","notifyInputWarnToast","item","m","mapMutations","showLoading","hideLoading","classSegment","segment","ignoreOverDue","checkSupportFirst","checkContinueSupport","checkMidEval","checkSupportFinal","scheduled_support_date","plan_support_date","formatTime","Date","parseInt","support_progress_status","statusSegmentColor","dateCurrent","moment","format","showError","_this","health_support_flow_segments","forEach","support_stop_flag","includes","support_exec_div","_segment$health_suppo","health_support_form","support_form_div","checkSplitFirstSupport","split_first_support_flag","checkSplitFirstSupportFirst","support_flow_seq","checkSupportA","_segment$health_suppo2","checkSupportB","_segment$health_suppo3","checkSupport","_segment$health_suppo4","mid_eval_flg","splitSupportSegments","filter","isFirstOrSecond","isConfirmed","checkHealthSupportFormIndividual","supportFormCode","code","slice","checkHealthSupportFormGroup","checkHealthSupportFormPhone","checkHealthSupportFormEmail","value","offset","isValid","locale","utcOffset","processTagColor","supportFlowStatus","previewSegment","segmentConfirm","segmentDraft","group","window","getItem","txt","Repository","get","then","res","setItem","stringify","e","getFiscalYear","subtract","year","getFiscalYearFromDateStr","dateStr","ex","getFiscalYearFromDateArr","addDefault","arr","add","map","text","unshift","getPeriodSwitchingYears","getHealthGuidancePeriods","fiscalYear","copyToClipboard","navigator","clipboard","writeText","isHealthGuidanceDiv_ActiveSupport","hgDiv","undefined","VERSION","LARGE_ARRAY_SIZE","CORE_ERROR_TEXT","FUNC_ERROR_TEXT","INVALID_TEMPL_VAR_ERROR_TEXT","HASH_UNDEFINED","MAX_MEMOIZE_SIZE","PLACEHOLDER","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","DEFAULT_TRUNC_LENGTH","DEFAULT_TRUNC_OMISSION","HOT_COUNT","HOT_SPAN","LAZY_FILTER_FLAG","LAZY_MAP_FLAG","LAZY_WHILE_FLAG","INFINITY","MAX_SAFE_INTEGER","MAX_INTEGER","NAN","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","HALF_MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","asyncTag","boolTag","dateTag","domExcTag","errorTag","funcTag","genTag","mapTag","numberTag","nullTag","objectTag","promiseTag","proxyTag","regexpTag","setTag","stringTag","symbolTag","undefinedTag","weakMapTag","weakSetTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboMarksRange","reComboHalfMarksRange","rsComboSymbolsRange","rsComboRange","rsDingbatRange","rsLowerRange","rsMathOpRange","rsNonCharRange","rsPunctuationRange","rsSpaceRange","rsUpperRange","rsVarRange","rsBreakRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsModifier","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsOptJoin","join","rsOrdLower","rsOrdUpper","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","deburredLetters","htmlEscapes","htmlUnescapes","stringEscapes","freeParseFloat","parseFloat","freeParseInt","freeGlobal","global","Object","freeSelf","self","root","Function","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","process","nodeUtil","types","require","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","call","arrayAggregator","array","setter","iteratee","accumulator","index","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","asciiToArray","string","asciiWords","match","baseFindKey","collection","eachFunc","key","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseSortBy","comparer","sort","current","baseTimes","n","baseToPairs","props","baseTrim","trimmedEndIndex","replace","baseUnary","baseValues","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","getValue","hasUnicode","test","hasUnicodeWord","iteratorToArray","iterator","next","done","push","mapToArray","size","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","charAt","unescapeHtmlChar","lastIndex","unicodeWords","runInContext","context","_","defaults","pick","Error","Math","String","TypeError","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","idCounter","maskSrcKey","uid","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","max","nativeMin","min","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","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__","lazyClone","copyArray","lazyReverse","clone","lazyValue","dir","isArr","isRight","arrLength","view","getView","start","end","iteratees","iterLength","takeCount","baseWrapperValue","outer","iterIndex","computed","Hash","entries","clear","entry","hashClear","__data__","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","pop","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","mapCacheHas","mapCacheSet","SetCache","setCacheAdd","setCacheHas","Stack","stackClear","stackDelete","stackGet","stackHas","stackSet","pairs","arrayLikeKeys","inherited","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","baseAggregator","baseEach","baseAssign","copyObject","baseAssignIn","keysIn","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","copySymbolsIn","copySymbols","initCloneByTag","stacked","subValue","keysFunc","getAllKeysIn","getAllKeys","baseConforms","baseConformsTo","baseDelay","wait","baseDifference","isCommon","valuesLength","valuesIndex","templateSettings","constructor","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFill","toInteger","toLength","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","symbolsFunc","baseGetTag","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseInRange","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInverter","baseInvoke","parent","last","baseIsArguments","baseIsArrayBuffer","baseIsDate","baseIsEqual","baseIsEqualDeep","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","equalObjects","baseIsMap","baseIsMatch","matchData","noCustomizer","srcValue","baseIsNative","isMasked","pattern","baseIsRegExp","baseIsSet","baseIsTypedArray","isLength","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","baseMergeDeep","newValue","safeGet","mergeFunc","isTyped","isArrayLikeObject","cloneTypedArray","isPlainObject","toPlainObject","baseNth","baseOrderBy","orders","getIteratee","criteria","compareMultiple","basePick","basePickBy","baseSet","basePropertyDeep","basePullAll","basePullAt","indexes","previous","baseUnset","baseRange","step","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","buffer","copy","cloneArrayBuffer","arrayBuffer","byteLength","cloneDataView","dataView","byteOffset","cloneRegExp","regexp","cloneSymbol","symbol","typedArray","compareAscending","valIsDefined","valIsReflexive","objCriteria","othCriteria","ordersLength","order","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","getSymbols","getSymbolsIn","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createBind","isBind","Ctor","createCtor","wrapper","fn","arguments","createCaseFirst","methodName","trailing","createCompounder","callback","words","deburr","thisBinding","createCurry","arity","getHolder","createRecurry","createHybrid","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","getFuncName","funcName","getData","isLaziable","plant","partialsRight","holdersRight","argPos","ary","isAry","isBindKey","isFlip","holdersCount","newHolders","reorder","createInverter","toIteratee","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createPartial","createRange","toFinite","createRelationalOperation","toNumber","wrapFunc","isCurry","newHoldersRight","newPartials","newPartialsRight","newData","setData","setWrapToString","createRound","precision","pair","noop","createToPairs","createWrap","mergeData","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","isPartial","arrStacked","othStacked","arrValue","othValue","compared","name","convert","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","flatten","otherFunc","isKeyable","isOwn","unmasked","stubArray","transforms","getWrapDetails","hasPath","hasFunc","input","insertWrapDetails","details","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","memoizeCapped","memoize","srcBitmask","newBitmask","isCombo","otherArgs","oldArray","shortOut","reference","updateWrapDetails","count","lastCalled","stamp","remaining","rand","charCodeAt","quote","subString","chunk","compact","concat","difference","differenceBy","differenceWith","drop","dropRight","dropRightWhile","dropWhile","fill","findIndex","findLastIndex","flattenDeep","flattenDepth","fromPairs","head","initial","intersection","mapped","intersectionBy","intersectionWith","separator","lastIndexOf","nth","pull","pullAll","pullAllBy","pullAllWith","pullAt","remove","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sortedUniq","sortedUniqBy","tail","take","takeRight","takeRightWhile","takeWhile","union","unionBy","unionWith","uniq","uniqBy","uniqWith","unzip","unzipWith","without","xor","xorBy","xorWith","zip","zipObject","zipObjectDeep","zipWith","chain","tap","interceptor","wrapperAt","wrapperChain","wrapperCommit","wrapperNext","toArray","wrapperToIterator","wrapperPlant","wrapperReverse","wrapped","wrapperValue","countBy","every","find","findLast","flatMap","flatMapDeep","flatMapDepth","forEachRight","groupBy","isString","invokeMap","keyBy","orderBy","partition","reduce","reduceRight","reject","negate","sample","sampleSize","shuffle","some","sortBy","after","before","bind","bindKey","curry","curryRight","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","defer","delay","flip","resolver","memoized","Cache","once","overArgs","funcsLength","partial","partialRight","rearg","rest","spread","throttle","unary","wrap","castArray","cloneWith","cloneDeep","cloneDeepWith","conformsTo","gt","gte","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isError","isInteger","isMatch","isMatchWith","isNaN","isNumber","isNative","isNull","isNil","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lt","lte","sign","remainder","isBinary","toSafeInteger","assign","assignIn","assignInWith","assignWith","at","properties","propsIndex","propsLength","defaultsDeep","mergeWith","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","functions","functionsIn","invert","invertBy","invoke","mapKeys","mapValues","merge","omit","omitBy","pickBy","prop","setWith","toPairs","toPairsIn","isArrLike","unset","update","updateWith","valuesIn","clamp","inRange","floating","temp","camelCase","word","toLowerCase","capitalize","upperFirst","endsWith","target","position","escape","escapeRegExp","kebabCase","lowerCase","lowerFirst","pad","strLength","padEnd","padStart","radix","repeat","snakeCase","limit","startCase","startsWith","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","attempt","toLower","toUpper","toUpperCase","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","upperCase","bindAll","methodNames","cond","conforms","defaultTo","flowRight","matches","matchesProperty","method","methodOf","mixin","noConflict","nthArg","over","overEvery","overSome","propertyOf","range","rangeRight","stubObject","stubString","stubTrue","times","toPath","uniqueId","prefix","augend","addend","divide","dividend","divisor","maxBy","mean","meanBy","minBy","multiply","multiplier","multiplicand","round","minuend","subtrahend","sum","sumBy","entriesIn","extend","extendWith","each","eachRight","first","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","commit","toJSON","render","_vm","_c","_self","attrs","isShow","persistent","maxWidth","fullscreen","width","transition","_t","staticRenderFns","Boolean","default","scrollable","Number","component"],"mappings":"kHAAA,6DAKA,MAAMA,EAAS,CACXC,KAAM,WACF,MAAO,CACHC,uBAAwB,GACxBC,mBAAoB,GACpBC,mBAAoB,GACpBC,4BAA6B,GAC7BC,uBAAwB,GAExBC,gBAAiB,GACjBC,mBAAoB,GACpBC,iBAAkB,GAElBC,qBAAsB,GACtBC,oBAAqB,GACrBC,iBAAkB,GAClBC,YAAa,GACbC,wBAAyB,GAGzBC,yBAA0B,GAC1BC,6BAA8B,GAC9BC,6BAA8B,GAC9BC,4BAA6B,GAC7BC,2BAA4B,GAE5BC,2BAA4B,EAG5BC,mCAAoC,GACpCC,wCAAyC,GACzCC,2BAA4B,GAC5BC,yCAA0C,GAC1CC,mCAAoC,GAGpCC,yBAA0B,EAC1BC,yBAA0B,EAC1BC,yBAA0B,EAC1BC,yBAA0B,EAE1BC,YAAa,IACbC,UAAW,IACXC,WAAY,IACZC,gBAAiB,IACjBC,KAAM,GACNC,SAAU,GACVC,YAAa,GACbC,QAAS,GAGTC,0BAA2B,GAC3BC,4BAA6B,GAC7BC,2BAA4B,GAC5BC,wBAAyB,GACzBC,wBAAyB,GACzBC,2BAA4B,GAC5BC,2BAA4B,MAIpCC,QAAS,CACLC,gBACI,IAAIC,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EACA,OAAOA,EAAKI,IAGpBC,YAAYC,EAAWC,GACnB,IAAIV,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EAAM,KAAAQ,EAAAC,EACN,MAAMC,GAAiB,QAAJF,EAAAR,SAAI,IAAAQ,OAAA,EAAJA,EAAMG,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,IAAS,QAAJ6B,EAAAT,SAAI,IAAAS,OAAA,EAAJA,EAAME,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,EACjJiC,EAAiBT,EAAUU,oBAC3BC,EAAcV,EAAKW,qBAAuBJ,KAAK1C,yCAA2CmC,EAAKW,qBAAuBJ,KAAKxC,0CAA4CiC,EAAKW,qBAAuBJ,KAAKzC,2BAGxM8C,EAAsBL,KAAKM,yBAAyBb,GAC1D,OAAOG,GAAcK,GAAkBE,GAAeE,EAE1D,OAAO,GAEXE,QAAQf,EAAWC,GACf,IAAIV,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EAAM,KAAAsB,EAAAC,EACN,MAAMb,GAAiB,QAAJY,EAAAtB,SAAI,IAAAsB,OAAA,EAAJA,EAAMX,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,IAAS,QAAJ2C,EAAAvB,SAAI,IAAAuB,OAAA,EAAJA,EAAMZ,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,EAEjJmC,EAAcV,EAAKW,qBAAuBJ,KAAK1C,yCAA2CmC,EAAKW,qBAAuBJ,KAAKxC,yCAG3H6C,EAAsBL,KAAKM,yBAAyBb,GAG1D,OAAOG,GAAcO,GAAeE,EAExC,OAAO,GAEXK,UAAUlB,EAAWC,GACjB,IAAIV,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EAAM,KAAAyB,EAAAC,EACN,MAAMhB,GAAiB,QAAJe,EAAAzB,SAAI,IAAAyB,OAAA,EAAJA,EAAMd,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,IAAS,QAAJ8C,EAAA1B,SAAI,IAAA0B,OAAA,EAAJA,EAAMf,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,EACjJiC,EAAiBT,EAAUU,oBAC3BC,EAAcV,EAAKW,qBAAuBJ,KAAK3C,oCAAsCoC,EAAKW,qBAAuBJ,KAAKvC,mCAC5H,OAAOmC,GAAcK,GAAkBE,EAE3C,OAAO,GAGXU,cAAcrB,EAAWC,GACrB,IAAIV,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EAAM,KAAA4B,EAAAC,EACN,MAAMnB,GAAiB,QAAJkB,EAAA5B,SAAI,IAAA4B,OAAA,EAAJA,EAAMjB,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,IAAS,QAAJiD,EAAA7B,SAAI,IAAA6B,OAAA,EAAJA,EAAMlB,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,EAIjJqC,EAAsBL,KAAKgB,6BAA6BxB,GAG9D,OAAOI,GAAcS,EAEzB,OAAO,GAKXY,4BACI,IAAIlC,EAAUC,OAAaC,UACvBC,EAAO,KAMD,IAAAgC,EAAAC,EAAV,OAJIpC,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,MAGlBG,KACY,QAAJgC,EAAAhC,SAAI,IAAAgC,OAAA,EAAJA,EAAMrB,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,IAC9D,QAAJmD,EAAAjC,SAAI,IAAAiC,OAAA,EAAJA,EAAMtB,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,IAI7EsD,gBACI,IAAIrC,EAAUC,OAAaC,UACvBC,EAAO,KAMD,IAAAmC,EAAV,OAJItC,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,MAGlBG,IACW,QAAJmC,EAAAnC,SAAI,IAAAmC,OAAA,EAAJA,EAAMxB,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKlC,eAAgB,GAI/EwD,YAAYC,GAAY,GACpB,IAAIxC,EAAUC,OAAaC,UACvBC,EAAO,KAMX,GAJIH,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,IAGlBG,EAAM,KAAAsC,EACN,MAAMC,EAAe,QAAPD,EAAGtC,SAAI,IAAAsC,OAAA,EAAJA,EAAM3B,kBAAkBC,MAAM,KACzC4B,EAAeD,EAAS1B,QAAQC,KAAKjC,YAAc,EAGzD,OAAK2D,GAEAH,IAGKE,EAAS1B,QAAQC,KAAKhC,aAAe,GAAOyD,EAAS1B,QAAQC,KAAKlC,cAAgB,GALlE4D,EAO9B,OAAO,GAEXC,eACI,IAAI5C,EAAUC,OAAaC,UACvBC,EAAO,KAMD,IAAA0C,EAAV,OAJI7C,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,MAGlBG,IACW,QAAJ0C,EAAA1C,SAAI,IAAA0C,OAAA,EAAJA,EAAM/B,kBAAkBC,MAAM,KAAKC,QAAQC,KAAKhC,cAAe,GAI9E6D,mBACI,IAAI9C,EAAUC,OAAaC,UACvBC,EAAO,KAMD,IAAA4C,EAAV,OAJI/C,EAAQI,SACRD,EAAOE,KAAKC,MAAMN,MAGlBG,IACW,QAAJ4C,EAAA5C,SAAI,IAAA4C,OAAA,EAAJA,EAAMjC,kBAAkBC,MAAM,KAAKC,QAAQC,KAAK/B,mBAAoB,GASnF8D,WAAWC,EAAU,IACjBhC,KAAKiC,OAAOC,KAAK,CACbF,UACAG,KAAM,UAGdC,YAAYJ,EAAU,IAClBhC,KAAKiC,OAAOC,KAAK,CACbF,UACAG,KAAM,WAGdE,cAAcL,EAAU,IACpBhC,KAAKiC,OAAOC,KAAK,CACbF,UACAG,KAAM,aAGdG,WAAWN,EAAU,IACjBhC,KAAKiC,OAAOC,KAAK,CACbF,UACAG,KAAM,aAGdI,sBAAsBP,EAAU,IAC5BhC,KAAK+B,WAAW,eAAiBC,EAAU,IAAMA,EAAU,IAAM,MAErEQ,0BACIxC,KAAKiC,OAAOC,KAAK,CACbF,QAAS,gBACTG,KAAM,aAGdM,qBAAqBC,EAAO,IAExB,MAAMC,EAAKD,EAAQA,EAAO,IAAM,GAEhC1C,KAAKiC,OAAOC,KAAK,CACbF,QAASW,EAAI,wBACbR,KAAM,gBAKXS,eAAa,CACZC,YAAa,qBACbC,YAAa,uBAEjBC,aAAaC,EAASC,GAAgB,GAClC,MAAO,CACH,mBAAoBjD,KAAKkD,kBAAkBF,IAAYhD,KAAKgB,6BAA6BgC,GACzF,sBAAuBhD,KAAKmD,qBAAqBH,GACjD,cAAehD,KAAKoD,aAAaJ,GACjC,mBAAoBhD,KAAKqD,kBAAkBL,GAC3C,cAAeC,IAA0B,OAAPD,QAAO,IAAPA,KAASM,uBAAgC,OAAPN,QAAO,IAAPA,OAAO,EAAPA,EAASM,uBAAgC,OAAPN,QAAO,IAAPA,OAAO,EAAPA,EAASO,mBAAqBvD,KAAKwD,WAAW,IAAIC,KAAQ,cAChK,UAAaC,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,8BAQzE0G,mBAAmBnE,GACf,MAAMoE,EAAcC,IAAO,IAAIL,MAAQM,OAAO,cAC9C,IAAIC,GAAY,EACZC,EAAQjE,KAuBZ,OApBIP,EAAKW,qBAAuBJ,KAAKtD,sBACjC+C,EAAKW,qBAAuBJ,KAAKrD,qBACjC8C,EAAKyE,6BAA6BC,SAAQ,SAASnB,IAE3CU,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6BM,EAAM/F,MAAsC,IAAvB,OAAP8E,QAAO,IAAPA,OAAO,EAAPA,EAASoB,sBAC3D,OAAPpB,QAAO,IAAPA,OAAO,EAAPA,EAASO,qBAA4B,OAAPP,QAAO,IAAPA,OAAO,EAAPA,EAASO,oBAAqBM,GAMhE,CAACI,EAAM9F,SAAU8F,EAAM7F,aAAaiG,SAASX,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA2D,IAAvB,OAAPX,QAAO,IAAPA,OAAO,EAAPA,EAASoB,oBAC3F,OAAPpB,QAAO,IAAPA,KAASM,yBACF,OAAPN,QAAO,IAAPA,OAAO,EAAPA,EAASM,wBAAyBO,KAPjCG,GAAY,MAcrB,CACH,aAAeA,KAAkB,OAAJvE,QAAI,IAAJA,OAAI,EAAJA,EAAMW,sBAAuBJ,KAAKtD,uBAA4B,OAAJ+C,QAAI,IAAJA,OAAI,EAAJA,EAAMW,sBAAuBJ,KAAKrD,qBACzH,aAAcqH,EACd,qBAAyB,OAAJvE,QAAI,IAAJA,OAAI,EAAJA,EAAMW,sBAAuBJ,KAAKpD,iBACvD,0BAA8B,OAAJ6C,QAAI,IAAJA,OAAI,EAAJA,EAAMW,sBAAuBJ,KAAKnD,YAC5D,8BAAkC,OAAJ4C,QAAI,IAAJA,OAAI,EAAJA,EAAMW,sBAAuBJ,KAAKlD,0BAKxEqG,qBAAqBH,GACjB,OAAOU,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASsB,oBAAsBtE,KAAKxD,oBAIxD0G,kBAAkBF,GAAS,IAAAuB,EACvB,OAAOb,SAAgB,OAAPV,QAAO,IAAPA,GAA4B,QAArBuB,EAAPvB,EAASwB,2BAAmB,IAAAD,OAAA,EAA5BA,EAA8BE,oBAAsBzE,KAAK9D,wBAG7EwI,uBAAuB1B,GAMnB,QAAKA,EAAQ2B,0BAMjBC,4BAA4B5B,GACxB,QAAKhD,KAAK0E,uBAAuB1B,MAI7BA,EAAQ6B,iBAAmB,IAMnC7D,6BAA6BgC,GACzB,QAAKhD,KAAK0E,uBAAuB1B,IAID,GAA5BA,EAAQ6B,kBAKhBC,cAAc9B,GAAS,IAAA+B,EACnB,OAAOrB,SAAgB,OAAPV,QAAO,IAAPA,GAA4B,QAArB+B,EAAP/B,EAASwB,2BAAmB,IAAAO,OAAA,EAA5BA,EAA8BN,oBAAsBzE,KAAK7D,oBAE7E6I,cAAchC,GAAS,IAAAiC,EACnB,OAAOvB,SAAgB,OAAPV,QAAO,IAAPA,GAA4B,QAArBiC,EAAPjC,EAASwB,2BAAmB,IAAAS,OAAA,EAA5BA,EAA8BR,oBAAsBzE,KAAK5D,oBAE7E8I,aAAalC,GAAS,IAAAmC,EAClB,OAAOzB,SAAgB,OAAPV,QAAO,IAAPA,GAA4B,QAArBmC,EAAPnC,EAASwB,2BAAmB,IAAAW,OAAA,EAA5BA,EAA8BV,oBAAsBzE,KAAK3D,6BAE7EgH,kBAAkBL,GACd,OAAOU,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASsB,oBAAsBtE,KAAKvD,kBAExD2G,aAAaJ,GACT,OAAc,OAAPA,QAAO,IAAPA,OAAO,EAAPA,EAASoC,cAIpB9E,yBAAyBb,GAErB,IAAKA,EAAKyE,8BAA6E,IAA7CzE,EAAKyE,6BAA6B/E,OACxE,OAAO,EAIX,MAAMkG,EAAuB5F,EAAKyE,6BAA6BoB,OAAOtC,GAClEhD,KAAK0E,uBAAuB1B,IAIhC,GAAoC,IAAhCqC,EAAqBlG,OACrB,OAAO,EAIX,IAAK,MAAM6D,KAAWqC,EAAsB,CACxC,MAAME,EAAkBvF,KAAK4E,4BAA4B5B,IAAYhD,KAAKgB,6BAA6BgC,GACjGwC,EAAc9B,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,4BAGxE,GAAIqI,IAAoBC,EACpB,OAAO,EAKf,OAAO,GAIXC,iCAAiCC,GAC7B,MAAMC,EAAOD,EAAgBE,OAAO,GACpC,MAAe,MAARD,GAAwB,MAARA,GAI3BE,4BAA4BH,GACxB,MAAMC,EAAOD,EAAgBE,OAAO,GACpC,MAAe,MAARD,GAAwB,MAARA,GAI3BG,4BAA4BJ,GACxB,MAAoC,MAA7BA,EAAgBE,OAAO,IAIlCG,4BAA4BL,GACxB,MAAoC,MAA7BA,EAAgBE,OAAO,IAGlCpC,WAAWwC,EAAOjC,EAAQkC,EAAS,SAC/B,OAAInC,IAAOkC,GAAOE,UACPpC,IAAOkC,GAAOG,OAAO,MAAMC,UAAUH,GAAQlC,OAAOA,GAExD,IAIXsC,gBAAgBrD,EAASsD,EAAmBC,GACxC,GAAI7C,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,4BAEpD,MAAO,qBAIP,GAAkC,IAAvB,OAAP8F,QAAO,IAAPA,OAAO,EAAPA,EAASoB,qBAAgD,IAArBkC,GAAgD,IAArBA,GAE/D,MAAO,qBACJ,CAEH,MAAMzC,EAAcC,IAAO,IAAIL,MAAQM,OAAO,cAE9C,GAAyB,IAArBuC,GAAgD,IAArBA,EAAyB,CAEpD,GAAI5C,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAKjD,yBAA0B,CAE9E,GAAW,OAAPiG,QAAO,IAAPA,KAASO,oBAA4B,OAAPP,QAAO,IAAPA,OAAO,EAAPA,EAASO,mBAAoBM,EAE3D,MAAO,qBAGP,IAAgD,OAA7B,OAAd0C,QAAc,IAAdA,OAAc,EAAdA,EAAgB5C,0BACVD,SAAuB,OAAd6C,QAAc,IAAdA,OAAc,EAAdA,EAAgB5C,2BAA6B3D,KAAK9C,8BAC/DwG,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,4BACvD,MAAO,sBAMnB,GAAIwG,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAKhD,8BACjD0G,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK/C,6BAA8B,CAErF,GAAW,OAAP+F,QAAO,IAAPA,KAASM,yBAAiC,OAAPN,QAAO,IAAPA,OAAO,EAAPA,EAASM,wBAAyBO,EAErE,MAAO,qBAGP,IAAgD,OAA7B,OAAd0C,QAAc,IAAdA,OAAc,EAAdA,EAAgB5C,0BACbD,SAAuB,OAAd6C,QAAc,IAAdA,OAAc,EAAdA,EAAgB5C,2BAA6B3D,KAAK9C,8BAC5DwG,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,4BACvD,MAAO,sBAInB,MAAO,uBAInB,OAAOwG,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,6BAE/DsJ,eAAexD,GACX,OAAOU,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAK9C,6BAE/DuJ,aAAazD,GACT,OAAOU,SAAgB,OAAPV,QAAO,IAAPA,OAAO,EAAPA,EAASW,2BAA6B3D,KAAKpD,kBAG/D,oBAAoB8J,EAAOV,EAAQ,IAC/B,IAAKW,OAAO3H,aAAa4H,QAAQF,EAAMV,GACnC,IACI,IAAIa,EAAM,GACI,KAAVb,IACAa,EAAM,gBAAgBb,SAEpBc,OAAWC,IAAI,qBAAqBL,IAAQG,KAAOG,KAAKC,IAC1DN,OAAO3H,aAAakI,QAAQR,EAAMV,EAAO5G,KAAK+H,UAAUF,EAAIhL,SAElE,MAAOmL,GACLT,OAAO3H,aAAakI,QAAQR,EAAMV,EAAO5G,KAAK+H,UAAU,KAGhE,OAAO/H,KAAKC,MAAMsH,OAAO3H,aAAa4H,QAAQF,EAAMV,KAExDqB,gBACI,OAAOvD,MAASwD,SAAS,EAAG,UAAUC,QAE1CC,yBAAyBC,GACrB,IACI,OAAO3D,IAAO2D,EAAS,CAAC,WAAY,aAAc,eAAeH,SAAS,EAAG,UAAUC,OAE1F,MAAMG,GACH,OAAO1H,KAAKqH,kBAGpBM,yBAAyBC,GAAa,GAClC,IAAIC,EAAM,CACN/D,IAAO,IAAIL,MAAQ6D,SAAS,EAAG,UAAUQ,IAAI,EAAG,KAAK/D,OAAO,KAC5DD,IAAO,IAAIL,MAAQ6D,SAAS,EAAG,UAAUvD,OAAO,KAChDD,IAAO,IAAIL,MAAQ6D,SAAS,EAAG,UAAUA,SAAS,EAAG,KAAKvD,OAAO,MACnEgE,IAAKR,IAAI,CACPS,KAAMT,EAAK3B,OAAO,GAAK,KACvBI,MAAOtC,SAAS6D,MAWpB,OARGK,GACCC,EAAII,QACA,CACID,KAAM,GACNhC,MAAO,OAIZ6B,GAMXK,0BACI,MAAO,CAAC,KAAM,KAAM,OAOxBC,yBAAyBC,GAKrB,OAAKA,EAIa,MAAdA,EACO,CAAC,EAAG,GAEG,MAAdA,EACO,CAAC,EAAG,GAEG,MAAdA,EACO,CAAC,EAAG,GAGXA,GAAc,KACP,CAAC,GACDA,GAAc,KACd,CAAC,GACDA,GAAc,KACd,CAAC,GAED,CAAC,GApBD,IAuBfC,gBAAgBL,GACZM,UAAUC,UAAUC,UAAUR,GACzBhB,KAAK,KACFhH,KAAKiC,OAAOC,KAAK,CACbF,QAAS,gBACTG,KAAM,eAOtBsG,kCAAkCC,GAC9B,OAAgB,GAATA,KAQJ1M,U,wBCnnBf;;;;;;;;IAQE,WAGA,IAAI2M,EAGAC,EAAU,UAGVC,EAAmB,IAGnBC,EAAkB,kEAClBC,EAAkB,sBAClBC,EAA+B,qDAG/BC,EAAiB,4BAGjBC,EAAmB,IAGnBC,EAAc,yBAGdC,EAAkB,EAClBC,EAAkB,EAClBC,EAAqB,EAGrBC,EAAuB,EACvBC,EAAyB,EAGzBC,EAAiB,EACjBC,EAAqB,EACrBC,EAAwB,EACxBC,EAAkB,EAClBC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAClBC,EAAiB,IAGjBC,EAAuB,GACvBC,EAAyB,MAGzBC,EAAY,IACZC,EAAW,GAGXC,EAAmB,EACnBC,EAAgB,EAChBC,EAAkB,EAGlBC,EAAW,IACXC,EAAmB,iBACnBC,EAAc,sBACdC,EAAM,IAGNC,EAAmB,WACnBC,EAAkBD,EAAmB,EACrCE,EAAwBF,IAAqB,EAG7CG,EAAY,CACd,CAAC,MAAOjB,GACR,CAAC,OAAQP,GACT,CAAC,UAAWC,GACZ,CAAC,QAASE,GACV,CAAC,aAAcC,GACf,CAAC,OAAQK,GACT,CAAC,UAAWJ,GACZ,CAAC,eAAgBC,GACjB,CAAC,QAASE,IAIRiB,EAAU,qBACVC,EAAW,iBACXC,EAAW,yBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAY,wBACZC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,GAAY,kBACZC,GAAU,gBACVC,GAAY,kBACZC,GAAa,mBACbC,GAAW,iBACXC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBACZC,GAAe,qBACfC,GAAa,mBACbC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAcI,QACxCC,GAAqBF,OAAOF,GAAgBG,QAG5CE,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBV,OAAOS,GAAaR,QAGtCU,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,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,yBAGpBC,GAAgB,kBAChBC,GAAoB,kBACpBC,GAAwB,kBACxBC,GAAsB,kBACtBC,GAAeH,GAAoBC,GAAwBC,GAC3DE,GAAiB,kBACjBC,GAAe,4BACfC,GAAgB,uBAChBC,GAAiB,+CACjBC,GAAqB,kBACrBC,GAAe,+JACfC,GAAe,4BACfC,GAAa,iBACbC,GAAeN,GAAgBC,GAAiBC,GAAqBC,GAGrEI,GAAS,OACTC,GAAW,IAAMf,GAAgB,IACjCgB,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMb,GAAe,IAC/Bc,GAAW,OACXC,GAAY,IAAMd,GAAiB,IACnCe,GAAU,IAAMd,GAAe,IAC/Be,GAAS,KAAOrB,GAAgBa,GAAeK,GAAWb,GAAiBC,GAAeK,GAAe,IACzGW,GAAS,2BACTC,GAAa,MAAQN,GAAU,IAAMK,GAAS,IAC9CE,GAAc,KAAOxB,GAAgB,IACrCyB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMhB,GAAe,IAC/BiB,GAAQ,UAGRC,GAAc,MAAQT,GAAU,IAAMC,GAAS,IAC/CS,GAAc,MAAQH,GAAU,IAAMN,GAAS,IAC/CU,GAAkB,MAAQjB,GAAS,yBACnCkB,GAAkB,MAAQlB,GAAS,yBACnCmB,GAAWV,GAAa,IACxBW,GAAW,IAAMtB,GAAa,KAC9BuB,GAAY,MAAQP,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAYU,KAAK,KAAO,IAAMF,GAAWD,GAAW,KAClHI,GAAa,mDACbC,GAAa,mDACbC,GAAQL,GAAWD,GAAWE,GAC9BK,GAAU,MAAQ,CAACrB,GAAWM,GAAYC,IAAYU,KAAK,KAAO,IAAMG,GACxEE,GAAW,MAAQ,CAACjB,GAAcP,GAAU,IAAKA,GAASQ,GAAYC,GAAYX,IAAUqB,KAAK,KAAO,IAGxGM,GAASvE,OAAO2C,GAAQ,KAMxB6B,GAAcxE,OAAO8C,GAAS,KAG9B2B,GAAYzE,OAAOmD,GAAS,MAAQA,GAAS,KAAOmB,GAAWF,GAAO,KAGtEM,GAAgB1E,OAAO,CACzBwD,GAAU,IAAMP,GAAU,IAAMW,GAAkB,MAAQ,CAACf,GAASW,GAAS,KAAKS,KAAK,KAAO,IAC9FN,GAAc,IAAME,GAAkB,MAAQ,CAAChB,GAASW,GAAUE,GAAa,KAAKO,KAAK,KAAO,IAChGT,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAChBM,GACAD,GACAnB,GACAsB,IACAJ,KAAK,KAAM,KAGTU,GAAe3E,OAAO,IAAMyD,GAAQ5B,GAAiBI,GAAeQ,GAAa,KAGjFmC,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,GACrBA,GAAe9F,IAAc8F,GAAe7F,IAC5C6F,GAAe5F,IAAW4F,GAAe3F,IACzC2F,GAAe1F,IAAY0F,GAAezF,IAC1CyF,GAAexF,IAAmBwF,GAAevF,IACjDuF,GAAetF,KAAa,EAC5BsF,GAAetH,GAAWsH,GAAerH,GACzCqH,GAAehG,IAAkBgG,GAAenH,GAChDmH,GAAe/F,IAAe+F,GAAelH,GAC7CkH,GAAehH,GAAYgH,GAAe/G,GAC1C+G,GAAe7G,GAAU6G,GAAe5G,IACxC4G,GAAe1G,IAAa0G,GAAevG,IAC3CuG,GAAetG,IAAUsG,GAAerG,IACxCqG,GAAelG,KAAc,EAG7B,IAAImG,GAAgB,GACpBA,GAAcvH,GAAWuH,GAActH,GACvCsH,GAAcjG,IAAkBiG,GAAchG,IAC9CgG,GAAcpH,GAAWoH,GAAcnH,GACvCmH,GAAc/F,IAAc+F,GAAc9F,IAC1C8F,GAAc7F,IAAW6F,GAAc5F,IACvC4F,GAAc3F,IAAY2F,GAAc9G,GACxC8G,GAAc7G,IAAa6G,GAAc3G,IACzC2G,GAAcxG,IAAawG,GAAcvG,IACzCuG,GAActG,IAAasG,GAAcrG,IACzCqG,GAAc1F,IAAY0F,GAAczF,IACxCyF,GAAcxF,IAAawF,GAAcvF,KAAa,EACtDuF,GAAcjH,GAAYiH,GAAchH,GACxCgH,GAAcnG,KAAc,EAG5B,IAAIoG,GAAkB,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAIxBC,GAAc,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SAIHC,GAAgB,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,KAIPC,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBC,WACjBC,GAAetP,SAGfuP,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAOC,SAAWA,QAAUD,EAGhFE,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKF,SAAWA,QAAUE,KAGxEC,GAAOL,IAAcG,IAAYG,SAAS,cAATA,GAGjCC,GAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,GAAaH,IAAgC,iBAAVI,GAAsBA,IAAWA,EAAOF,UAAYE,EAGvFC,GAAgBF,IAAcA,GAAWF,UAAYD,GAGrDM,GAAcD,IAAiBZ,GAAWc,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQN,IAAcA,GAAWO,SAAWP,GAAWO,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAO/M,KAXI,GAeXgN,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKhW,QACX,KAAK,EAAG,OAAO8V,EAAKG,KAAKF,GACzB,KAAK,EAAG,OAAOD,EAAKG,KAAKF,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKG,KAAKF,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKG,KAAKF,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASE,GAAgBC,EAAOC,EAAQC,EAAUC,GAChD,IAAIC,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,QAASuW,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GAClBH,EAAOE,EAAazP,EAAOwP,EAASxP,GAAQsP,GAE9C,OAAOG,EAYT,SAASE,GAAUL,EAAOE,GACxB,IAAIE,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,QAASuW,EAAQvW,EACf,IAA6C,IAAzCqW,EAASF,EAAMI,GAAQA,EAAOJ,GAChC,MAGJ,OAAOA,EAYT,SAASM,GAAeN,EAAOE,GAC7B,IAAIrW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,MAAOA,IACL,IAA+C,IAA3CqW,EAASF,EAAMnW,GAASA,EAAQmW,GAClC,MAGJ,OAAOA,EAaT,SAASO,GAAWP,EAAOQ,GACzB,IAAIJ,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,QAASuW,EAAQvW,EACf,IAAK2W,EAAUR,EAAMI,GAAQA,EAAOJ,GAClC,OAAO,EAGX,OAAO,EAYT,SAASS,GAAYT,EAAOQ,GAC1B,IAAIJ,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACnC6W,EAAW,EACXC,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACdI,EAAU9P,EAAO0P,EAAOJ,KAC1BW,EAAOD,KAAchQ,GAGzB,OAAOiQ,EAYT,SAASC,GAAcZ,EAAOtP,GAC5B,IAAI7G,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,QAASA,GAAUgX,GAAYb,EAAOtP,EAAO,IAAM,EAYrD,SAASoQ,GAAkBd,EAAOtP,EAAOqQ,GACvC,IAAIX,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,QAASuW,EAAQvW,EACf,GAAIkX,EAAWrQ,EAAOsP,EAAMI,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASY,GAAShB,EAAOE,GACvB,IAAIE,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACnC8W,EAASM,MAAMpX,GAEnB,QAASuW,EAAQvW,EACf8W,EAAOP,GAASF,EAASF,EAAMI,GAAQA,EAAOJ,GAEhD,OAAOW,EAWT,SAASO,GAAUlB,EAAOmB,GACxB,IAAIf,GAAS,EACTvW,EAASsX,EAAOtX,OAChB8G,EAASqP,EAAMnW,OAEnB,QAASuW,EAAQvW,EACfmW,EAAMrP,EAASyP,GAASe,EAAOf,GAEjC,OAAOJ,EAeT,SAASoB,GAAYpB,EAAOE,EAAUC,EAAakB,GACjD,IAAIjB,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEnCwX,GAAaxX,IACfsW,EAAcH,IAAQI,IAExB,QAASA,EAAQvW,EACfsW,EAAcD,EAASC,EAAaH,EAAMI,GAAQA,EAAOJ,GAE3D,OAAOG,EAeT,SAASmB,GAAiBtB,EAAOE,EAAUC,EAAakB,GACtD,IAAIxX,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACnCwX,GAAaxX,IACfsW,EAAcH,IAAQnW,IAExB,MAAOA,IACLsW,EAAcD,EAASC,EAAaH,EAAMnW,GAASA,EAAQmW,GAE7D,OAAOG,EAaT,SAASoB,GAAUvB,EAAOQ,GACxB,IAAIJ,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OAEvC,QAASuW,EAAQvW,EACf,GAAI2W,EAAUR,EAAMI,GAAQA,EAAOJ,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIwB,GAAYC,GAAa,UAS7B,SAASC,GAAaC,GACpB,OAAOA,EAAOnX,MAAM,IAUtB,SAASoX,GAAWD,GAClB,OAAOA,EAAOE,MAAM1I,KAAgB,GActC,SAAS2I,GAAYC,EAAYvB,EAAWwB,GAC1C,IAAIrB,EAOJ,OANAqB,EAASD,GAAY,SAASrR,EAAOuR,EAAKF,GACxC,GAAIvB,EAAU9P,EAAOuR,EAAKF,GAExB,OADApB,EAASsB,GACF,KAGJtB,EAcT,SAASuB,GAAclC,EAAOQ,EAAW2B,EAAWC,GAClD,IAAIvY,EAASmW,EAAMnW,OACfuW,EAAQ+B,GAAaC,EAAY,GAAK,GAE1C,MAAQA,EAAYhC,MAAYA,EAAQvW,EACtC,GAAI2W,EAAUR,EAAMI,GAAQA,EAAOJ,GACjC,OAAOI,EAGX,OAAQ,EAYV,SAASS,GAAYb,EAAOtP,EAAOyR,GACjC,OAAOzR,IAAUA,EACb2R,GAAcrC,EAAOtP,EAAOyR,GAC5BD,GAAclC,EAAOsC,GAAWH,GAatC,SAASI,GAAgBvC,EAAOtP,EAAOyR,EAAWpB,GAChD,IAAIX,EAAQ+B,EAAY,EACpBtY,EAASmW,EAAMnW,OAEnB,QAASuW,EAAQvW,EACf,GAAIkX,EAAWf,EAAMI,GAAQ1P,GAC3B,OAAO0P,EAGX,OAAQ,EAUV,SAASkC,GAAU5R,GACjB,OAAOA,IAAUA,EAYnB,SAAS8R,GAASxC,EAAOE,GACvB,IAAIrW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAAU4Y,GAAQzC,EAAOE,GAAYrW,EAAU0L,EAUxD,SAASkM,GAAaQ,GACpB,OAAO,SAASS,GACd,OAAiB,MAAVA,EAAiBrP,EAAYqP,EAAOT,IAW/C,SAASU,GAAeD,GACtB,OAAO,SAAST,GACd,OAAiB,MAAVS,EAAiBrP,EAAYqP,EAAOT,IAiB/C,SAASW,GAAWb,EAAY7B,EAAUC,EAAakB,EAAWW,GAMhE,OALAA,EAASD,GAAY,SAASrR,EAAO0P,EAAO2B,GAC1C5B,EAAckB,GACTA,GAAY,EAAO3Q,GACpBwP,EAASC,EAAazP,EAAO0P,EAAO2B,MAEnC5B,EAaT,SAAS0C,GAAW7C,EAAO8C,GACzB,IAAIjZ,EAASmW,EAAMnW,OAEnBmW,EAAM+C,KAAKD,GACX,MAAOjZ,IACLmW,EAAMnW,GAAUmW,EAAMnW,GAAQ6G,MAEhC,OAAOsP,EAYT,SAASyC,GAAQzC,EAAOE,GACtB,IAAIS,EACAP,GAAS,EACTvW,EAASmW,EAAMnW,OAEnB,QAASuW,EAAQvW,EAAQ,CACvB,IAAImZ,EAAU9C,EAASF,EAAMI,IACzB4C,IAAY3P,IACdsN,EAASA,IAAWtN,EAAY2P,EAAWrC,EAASqC,GAGxD,OAAOrC,EAYT,SAASsC,GAAUC,EAAGhD,GACpB,IAAIE,GAAS,EACTO,EAASM,MAAMiC,GAEnB,QAAS9C,EAAQ8C,EACfvC,EAAOP,GAASF,EAASE,GAE3B,OAAOO,EAYT,SAASwC,GAAYT,EAAQU,GAC3B,OAAOpC,GAASoC,GAAO,SAASnB,GAC9B,MAAO,CAACA,EAAKS,EAAOT,OAWxB,SAASoB,GAAS1B,GAChB,OAAOA,EACHA,EAAOrR,MAAM,EAAGgT,GAAgB3B,GAAU,GAAG4B,QAAQzK,GAAa,IAClE6I,EAUN,SAAS6B,GAAU7D,GACjB,OAAO,SAASjP,GACd,OAAOiP,EAAKjP,IAchB,SAAS+S,GAAWf,EAAQU,GAC1B,OAAOpC,GAASoC,GAAO,SAASnB,GAC9B,OAAOS,EAAOT,MAYlB,SAASyB,GAASC,EAAO1B,GACvB,OAAO0B,EAAMC,IAAI3B,GAYnB,SAAS4B,GAAgBC,EAAYC,GACnC,IAAI3D,GAAS,EACTvW,EAASia,EAAWja,OAExB,QAASuW,EAAQvW,GAAUgX,GAAYkD,EAAYD,EAAW1D,GAAQ,IAAM,GAC5E,OAAOA,EAYT,SAAS4D,GAAcF,EAAYC,GACjC,IAAI3D,EAAQ0D,EAAWja,OAEvB,MAAOuW,KAAWS,GAAYkD,EAAYD,EAAW1D,GAAQ,IAAM,GACnE,OAAOA,EAWT,SAAS6D,GAAajE,EAAOkE,GAC3B,IAAIra,EAASmW,EAAMnW,OACf8W,EAAS,EAEb,MAAO9W,IACDmW,EAAMnW,KAAYqa,KAClBvD,EAGN,OAAOA,EAWT,IAAIwD,GAAexB,GAAevF,IAS9BgH,GAAiBzB,GAAetF,IASpC,SAASgH,GAAiBC,GACxB,MAAO,KAAO/G,GAAc+G,GAW9B,SAASC,GAAS7B,EAAQT,GACxB,OAAiB,MAAVS,EAAiBrP,EAAYqP,EAAOT,GAU7C,SAASuC,GAAW7C,GAClB,OAAO7E,GAAa2H,KAAK9C,GAU3B,SAAS+C,GAAe/C,GACtB,OAAO5E,GAAiB0H,KAAK9C,GAU/B,SAASgD,GAAgBC,GACvB,IAAIje,EACAga,EAAS,GAEb,QAASha,EAAOie,EAASC,QAAQC,KAC/BnE,EAAOoE,KAAKpe,EAAK+J,OAEnB,OAAOiQ,EAUT,SAASqE,GAAWvS,GAClB,IAAI2N,GAAS,EACTO,EAASM,MAAMxO,EAAIwS,MAKvB,OAHAxS,EAAI5D,SAAQ,SAAS6B,EAAOuR,GAC1BtB,IAASP,GAAS,CAAC6B,EAAKvR,MAEnBiQ,EAWT,SAASuE,GAAQvF,EAAMwF,GACrB,OAAO,SAASC,GACd,OAAOzF,EAAKwF,EAAUC,KAa1B,SAASC,GAAerF,EAAOkE,GAC7B,IAAI9D,GAAS,EACTvW,EAASmW,EAAMnW,OACf6W,EAAW,EACXC,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACd1P,IAAUwT,GAAexT,IAAUmD,IACrCmM,EAAMI,GAASvM,EACf8M,EAAOD,KAAcN,GAGzB,OAAOO,EAUT,SAAS2E,GAAWC,GAClB,IAAInF,GAAS,EACTO,EAASM,MAAMsE,EAAIN,MAKvB,OAHAM,EAAI1W,SAAQ,SAAS6B,GACnBiQ,IAASP,GAAS1P,KAEbiQ,EAUT,SAAS6E,GAAWD,GAClB,IAAInF,GAAS,EACTO,EAASM,MAAMsE,EAAIN,MAKvB,OAHAM,EAAI1W,SAAQ,SAAS6B,GACnBiQ,IAASP,GAAS,CAAC1P,EAAOA,MAErBiQ,EAaT,SAAS0B,GAAcrC,EAAOtP,EAAOyR,GACnC,IAAI/B,EAAQ+B,EAAY,EACpBtY,EAASmW,EAAMnW,OAEnB,QAASuW,EAAQvW,EACf,GAAImW,EAAMI,KAAW1P,EACnB,OAAO0P,EAGX,OAAQ,EAaV,SAASqF,GAAkBzF,EAAOtP,EAAOyR,GACvC,IAAI/B,EAAQ+B,EAAY,EACxB,MAAO/B,IACL,GAAIJ,EAAMI,KAAW1P,EACnB,OAAO0P,EAGX,OAAOA,EAUT,SAASsF,GAAW/D,GAClB,OAAO6C,GAAW7C,GACdgE,GAAYhE,GACZH,GAAUG,GAUhB,SAASiE,GAAcjE,GACrB,OAAO6C,GAAW7C,GACdkE,GAAelE,GACfD,GAAaC,GAWnB,SAAS2B,GAAgB3B,GACvB,IAAIvB,EAAQuB,EAAO9X,OAEnB,MAAOuW,KAAWrH,GAAa0L,KAAK9C,EAAOmE,OAAO1F,KAClD,OAAOA,EAUT,IAAI2F,GAAmBpD,GAAerF,IAStC,SAASqI,GAAYhE,GACnB,IAAIhB,EAAS/D,GAAUoJ,UAAY,EACnC,MAAOpJ,GAAU6H,KAAK9C,KAClBhB,EAEJ,OAAOA,EAUT,SAASkF,GAAelE,GACtB,OAAOA,EAAOE,MAAMjF,KAAc,GAUpC,SAASqJ,GAAatE,GACpB,OAAOA,EAAOE,MAAMhF,KAAkB,GAkCxC,IAAIqJ,GAAe,SAAUA,EAAaC,GACxCA,EAAqB,MAAXA,EAAkBnI,GAAOoI,GAAEC,SAASrI,GAAKH,SAAUsI,EAASC,GAAEE,KAAKtI,GAAMhB,KAGnF,IAAIiE,EAAQkF,EAAQlF,MAChB9S,EAAOgY,EAAQhY,KACfoY,EAAQJ,EAAQI,MAChBtI,GAAWkI,EAAQlI,SACnBuI,GAAOL,EAAQK,KACf3I,GAASsI,EAAQtI,OACjB1F,GAASgO,EAAQhO,OACjBsO,GAASN,EAAQM,OACjBC,GAAYP,EAAQO,UAGpBC,GAAa1F,EAAM2F,UACnBC,GAAY5I,GAAS2I,UACrBE,GAAcjJ,GAAO+I,UAGrBG,GAAaZ,EAAQ,sBAGrBa,GAAeH,GAAUI,SAGzBC,GAAiBJ,GAAYI,eAG7BC,GAAY,EAGZC,GAAc,WAChB,IAAIC,EAAM,SAASC,KAAKP,IAAcA,GAAWQ,MAAQR,GAAWQ,KAAKC,UAAY,IACrF,OAAOH,EAAO,iBAAmBA,EAAO,GAFzB,GAUbI,GAAuBX,GAAYG,SAGnCS,GAAmBV,GAAalH,KAAKjC,IAGrC8J,GAAU3J,GAAKoI,EAGfwB,GAAazP,GAAO,IACtB6O,GAAalH,KAAKoH,IAAgB3D,QAAQ3K,GAAc,QACvD2K,QAAQ,yDAA0D,SAAW,KAI5EsE,GAAStJ,GAAgB4H,EAAQ0B,OAASxU,EAC1CyU,GAAS3B,EAAQ2B,OACjBC,GAAa5B,EAAQ4B,WACrBC,GAAcH,GAASA,GAAOG,YAAc3U,EAC5C4U,GAAe/C,GAAQrH,GAAOqK,eAAgBrK,IAC9CsK,GAAetK,GAAOuK,OACtBC,GAAuBvB,GAAYuB,qBACnCC,GAAS3B,GAAW2B,OACpBC,GAAmBT,GAASA,GAAOU,mBAAqBnV,EACxDoV,GAAcX,GAASA,GAAOlD,SAAWvR,EACzCqV,GAAiBZ,GAASA,GAAOa,YAActV,EAE/CuV,GAAkB,WACpB,IACE,IAAIjJ,EAAOkJ,GAAUhL,GAAQ,kBAE7B,OADA8B,EAAK,GAAI,GAAI,IACNA,EACP,MAAO7N,KALU,GASjBgX,GAAkB3C,EAAQ4C,eAAiB/K,GAAK+K,cAAgB5C,EAAQ4C,aACxEC,GAAS7a,GAAQA,EAAK8a,MAAQjL,GAAK7P,KAAK8a,KAAO9a,EAAK8a,IACpDC,GAAgB/C,EAAQgD,aAAenL,GAAKmL,YAAchD,EAAQgD,WAGlEC,GAAa5C,GAAK6C,KAClBC,GAAc9C,GAAK+C,MACnBC,GAAmB3L,GAAO4L,sBAC1BC,GAAiB7B,GAASA,GAAO8B,SAAWtW,EAC5CuW,GAAiBzD,EAAQ0D,SACzBC,GAAanD,GAAWvK,KACxB2N,GAAa7E,GAAQrH,GAAO0J,KAAM1J,IAClCmM,GAAYxD,GAAKyD,IACjBC,GAAY1D,GAAK2D,IACjBC,GAAYjc,EAAK8a,IACjBoB,GAAiBlE,EAAQ/X,SACzBkc,GAAe9D,GAAK+D,OACpBC,GAAgB7D,GAAW8D,QAG3BC,GAAW7B,GAAU1C,EAAS,YAC9BwE,GAAM9B,GAAU1C,EAAS,OACzByE,GAAU/B,GAAU1C,EAAS,WAC7B0E,GAAMhC,GAAU1C,EAAS,OACzB2E,GAAUjC,GAAU1C,EAAS,WAC7B4E,GAAelC,GAAUhL,GAAQ,UAGjCmN,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAc1D,GAASA,GAAOlB,UAAYvT,EAC1CoY,GAAgBD,GAAcA,GAAYE,QAAUrY,EACpDsY,GAAiBH,GAAcA,GAAYvE,SAAW5T,EAyH1D,SAASuY,GAAOlb,GACd,GAAImb,GAAanb,KAAWob,GAAQpb,MAAYA,aAAiBqb,IAAc,CAC7E,GAAIrb,aAAiBsb,GACnB,OAAOtb,EAET,GAAIwW,GAAepH,KAAKpP,EAAO,eAC7B,OAAOub,GAAavb,GAGxB,OAAO,IAAIsb,GAActb,GAW3B,IAAIwb,GAAc,WAChB,SAASxJ,KACT,OAAO,SAASyJ,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAIhE,GACF,OAAOA,GAAagE,GAEtBzJ,EAAOkE,UAAYuF,EACnB,IAAIxL,EAAS,IAAI+B,EAEjB,OADAA,EAAOkE,UAAYvT,EACZsN,GAZM,GAqBjB,SAAS0L,MAWT,SAASL,GAActb,EAAO4b,GAC5B5hB,KAAK6hB,YAAc7b,EACnBhG,KAAK8hB,YAAc,GACnB9hB,KAAK+hB,YAAcH,EACnB5hB,KAAKgiB,UAAY,EACjBhiB,KAAKiiB,WAAatZ,EAgFpB,SAAS0Y,GAAYrb,GACnBhG,KAAK6hB,YAAc7b,EACnBhG,KAAK8hB,YAAc,GACnB9hB,KAAKkiB,QAAU,EACfliB,KAAKmiB,cAAe,EACpBniB,KAAKoiB,cAAgB,GACrBpiB,KAAKqiB,cAAgBvX,EACrB9K,KAAKsiB,UAAY,GAWnB,SAASC,KACP,IAAItM,EAAS,IAAIoL,GAAYrhB,KAAK6hB,aAOlC,OANA5L,EAAO6L,YAAcU,GAAUxiB,KAAK8hB,aACpC7L,EAAOiM,QAAUliB,KAAKkiB,QACtBjM,EAAOkM,aAAeniB,KAAKmiB,aAC3BlM,EAAOmM,cAAgBI,GAAUxiB,KAAKoiB,eACtCnM,EAAOoM,cAAgBriB,KAAKqiB,cAC5BpM,EAAOqM,UAAYE,GAAUxiB,KAAKsiB,WAC3BrM,EAWT,SAASwM,KACP,GAAIziB,KAAKmiB,aAAc,CACrB,IAAIlM,EAAS,IAAIoL,GAAYrhB,MAC7BiW,EAAOiM,SAAW,EAClBjM,EAAOkM,cAAe,OAEtBlM,EAASjW,KAAK0iB,QACdzM,EAAOiM,UAAY,EAErB,OAAOjM,EAWT,SAAS0M,KACP,IAAIrN,EAAQtV,KAAK6hB,YAAY7b,QACzB4c,EAAM5iB,KAAKkiB,QACXW,EAAQzB,GAAQ9L,GAChBwN,EAAUF,EAAM,EAChBG,EAAYF,EAAQvN,EAAMnW,OAAS,EACnC6jB,EAAOC,GAAQ,EAAGF,EAAW/iB,KAAKsiB,WAClCY,EAAQF,EAAKE,MACbC,EAAMH,EAAKG,IACXhkB,EAASgkB,EAAMD,EACfxN,EAAQoN,EAAUK,EAAOD,EAAQ,EACjCE,EAAYpjB,KAAKoiB,cACjBiB,EAAaD,EAAUjkB,OACvB6W,EAAW,EACXsN,EAAY9D,GAAUrgB,EAAQa,KAAKqiB,eAEvC,IAAKQ,IAAWC,GAAWC,GAAa5jB,GAAUmkB,GAAankB,EAC7D,OAAOokB,GAAiBjO,EAAOtV,KAAK8hB,aAEtC,IAAI7L,EAAS,GAEbuN,EACA,MAAOrkB,KAAY6W,EAAWsN,EAAW,CACvC5N,GAASkN,EAET,IAAIa,GAAa,EACbzd,EAAQsP,EAAMI,GAElB,QAAS+N,EAAYJ,EAAY,CAC/B,IAAIpnB,EAAOmnB,EAAUK,GACjBjO,EAAWvZ,EAAKuZ,SAChBrT,EAAOlG,EAAKkG,KACZuhB,EAAWlO,EAASxP,GAExB,GAAI7D,GAAQqI,EACVxE,EAAQ0d,OACH,IAAKA,EAAU,CACpB,GAAIvhB,GAAQoI,EACV,SAASiZ,EAET,MAAMA,GAIZvN,EAAOD,KAAchQ,EAEvB,OAAOiQ,EAgBT,SAAS0N,GAAKC,GACZ,IAAIlO,GAAS,EACTvW,EAAoB,MAAXykB,EAAkB,EAAIA,EAAQzkB,OAE3Ca,KAAK6jB,QACL,QAASnO,EAAQvW,EAAQ,CACvB,IAAI2kB,EAAQF,EAAQlO,GACpB1V,KAAK6a,IAAIiJ,EAAM,GAAIA,EAAM,KAW7B,SAASC,KACP/jB,KAAKgkB,SAAW3D,GAAeA,GAAa,MAAQ,GACpDrgB,KAAKua,KAAO,EAad,SAAS0J,GAAW1M,GAClB,IAAItB,EAASjW,KAAKkZ,IAAI3B,WAAevX,KAAKgkB,SAASzM,GAEnD,OADAvX,KAAKua,MAAQtE,EAAS,EAAI,EACnBA,EAYT,SAASiO,GAAQ3M,GACf,IAAItb,EAAO+D,KAAKgkB,SAChB,GAAI3D,GAAc,CAChB,IAAIpK,EAASha,EAAKsb,GAClB,OAAOtB,IAAWhN,EAAiBN,EAAYsN,EAEjD,OAAOuG,GAAepH,KAAKnZ,EAAMsb,GAAOtb,EAAKsb,GAAO5O,EAYtD,SAASwb,GAAQ5M,GACf,IAAItb,EAAO+D,KAAKgkB,SAChB,OAAO3D,GAAgBpkB,EAAKsb,KAAS5O,EAAa6T,GAAepH,KAAKnZ,EAAMsb,GAa9E,SAAS6M,GAAQ7M,EAAKvR,GACpB,IAAI/J,EAAO+D,KAAKgkB,SAGhB,OAFAhkB,KAAKua,MAAQva,KAAKkZ,IAAI3B,GAAO,EAAI,EACjCtb,EAAKsb,GAAQ8I,IAAgBra,IAAU2C,EAAaM,EAAiBjD,EAC9DhG,KAmBT,SAASqkB,GAAUT,GACjB,IAAIlO,GAAS,EACTvW,EAAoB,MAAXykB,EAAkB,EAAIA,EAAQzkB,OAE3Ca,KAAK6jB,QACL,QAASnO,EAAQvW,EAAQ,CACvB,IAAI2kB,EAAQF,EAAQlO,GACpB1V,KAAK6a,IAAIiJ,EAAM,GAAIA,EAAM,KAW7B,SAASQ,KACPtkB,KAAKgkB,SAAW,GAChBhkB,KAAKua,KAAO,EAYd,SAASgK,GAAgBhN,GACvB,IAAItb,EAAO+D,KAAKgkB,SACZtO,EAAQ8O,GAAavoB,EAAMsb,GAE/B,GAAI7B,EAAQ,EACV,OAAO,EAET,IAAI4F,EAAYrf,EAAKkD,OAAS,EAO9B,OANIuW,GAAS4F,EACXrf,EAAKwoB,MAEL7G,GAAOxI,KAAKnZ,EAAMyZ,EAAO,KAEzB1V,KAAKua,MACA,EAYT,SAASmK,GAAanN,GACpB,IAAItb,EAAO+D,KAAKgkB,SACZtO,EAAQ8O,GAAavoB,EAAMsb,GAE/B,OAAO7B,EAAQ,EAAI/M,EAAY1M,EAAKyZ,GAAO,GAY7C,SAASiP,GAAapN,GACpB,OAAOiN,GAAaxkB,KAAKgkB,SAAUzM,IAAQ,EAa7C,SAASqN,GAAarN,EAAKvR,GACzB,IAAI/J,EAAO+D,KAAKgkB,SACZtO,EAAQ8O,GAAavoB,EAAMsb,GAQ/B,OANI7B,EAAQ,KACR1V,KAAKua,KACPte,EAAKoe,KAAK,CAAC9C,EAAKvR,KAEhB/J,EAAKyZ,GAAO,GAAK1P,EAEZhG,KAmBT,SAAS6kB,GAASjB,GAChB,IAAIlO,GAAS,EACTvW,EAAoB,MAAXykB,EAAkB,EAAIA,EAAQzkB,OAE3Ca,KAAK6jB,QACL,QAASnO,EAAQvW,EAAQ,CACvB,IAAI2kB,EAAQF,EAAQlO,GACpB1V,KAAK6a,IAAIiJ,EAAM,GAAIA,EAAM,KAW7B,SAASgB,KACP9kB,KAAKua,KAAO,EACZva,KAAKgkB,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAK1D,IAAOoE,IACnB,OAAU,IAAIV,IAalB,SAASoB,GAAexN,GACtB,IAAItB,EAAS+O,GAAWhlB,KAAMuX,GAAK,UAAUA,GAE7C,OADAvX,KAAKua,MAAQtE,EAAS,EAAI,EACnBA,EAYT,SAASgP,GAAY1N,GACnB,OAAOyN,GAAWhlB,KAAMuX,GAAKxQ,IAAIwQ,GAYnC,SAAS2N,GAAY3N,GACnB,OAAOyN,GAAWhlB,KAAMuX,GAAK2B,IAAI3B,GAanC,SAAS4N,GAAY5N,EAAKvR,GACxB,IAAI/J,EAAO+oB,GAAWhlB,KAAMuX,GACxBgD,EAAOte,EAAKse,KAIhB,OAFAte,EAAK4e,IAAItD,EAAKvR,GACdhG,KAAKua,MAAQte,EAAKse,MAAQA,EAAO,EAAI,EAC9Bva,KAoBT,SAASolB,GAAS3O,GAChB,IAAIf,GAAS,EACTvW,EAAmB,MAAVsX,EAAiB,EAAIA,EAAOtX,OAEzCa,KAAKgkB,SAAW,IAAIa,GACpB,QAASnP,EAAQvW,EACfa,KAAK8H,IAAI2O,EAAOf,IAcpB,SAAS2P,GAAYrf,GAEnB,OADAhG,KAAKgkB,SAASnJ,IAAI7U,EAAOiD,GAClBjJ,KAYT,SAASslB,GAAYtf,GACnB,OAAOhG,KAAKgkB,SAAS9K,IAAIlT,GAgB3B,SAASuf,GAAM3B,GACb,IAAI3nB,EAAO+D,KAAKgkB,SAAW,IAAIK,GAAUT,GACzC5jB,KAAKua,KAAOte,EAAKse,KAUnB,SAASiL,KACPxlB,KAAKgkB,SAAW,IAAIK,GACpBrkB,KAAKua,KAAO,EAYd,SAASkL,GAAYlO,GACnB,IAAItb,EAAO+D,KAAKgkB,SACZ/N,EAASha,EAAK,UAAUsb,GAG5B,OADAvX,KAAKua,KAAOte,EAAKse,KACVtE,EAYT,SAASyP,GAASnO,GAChB,OAAOvX,KAAKgkB,SAASjd,IAAIwQ,GAY3B,SAASoO,GAASpO,GAChB,OAAOvX,KAAKgkB,SAAS9K,IAAI3B,GAa3B,SAASqO,GAASrO,EAAKvR,GACrB,IAAI/J,EAAO+D,KAAKgkB,SAChB,GAAI/nB,aAAgBooB,GAAW,CAC7B,IAAIwB,EAAQ5pB,EAAK+nB,SACjB,IAAK/D,IAAQ4F,EAAM1mB,OAAS0J,EAAmB,EAG7C,OAFAgd,EAAMxL,KAAK,CAAC9C,EAAKvR,IACjBhG,KAAKua,OAASte,EAAKse,KACZva,KAET/D,EAAO+D,KAAKgkB,SAAW,IAAIa,GAASgB,GAItC,OAFA5pB,EAAK4e,IAAItD,EAAKvR,GACdhG,KAAKua,KAAOte,EAAKse,KACVva,KAoBT,SAAS8lB,GAAc9f,EAAO+f,GAC5B,IAAIlD,EAAQzB,GAAQpb,GAChBggB,GAASnD,GAASoD,GAAYjgB,GAC9BkgB,GAAUrD,IAAUmD,GAAS/G,GAASjZ,GACtCmgB,GAAUtD,IAAUmD,IAAUE,GAAUnR,GAAa/O,GACrDogB,EAAcvD,GAASmD,GAASE,GAAUC,EAC1ClQ,EAASmQ,EAAc7N,GAAUvS,EAAM7G,OAAQ4c,IAAU,GACzD5c,EAAS8W,EAAO9W,OAEpB,IAAK,IAAIoY,KAAOvR,GACT+f,IAAavJ,GAAepH,KAAKpP,EAAOuR,IACvC6O,IAEQ,UAAP7O,GAEC2O,IAAkB,UAAP3O,GAA0B,UAAPA,IAE9B4O,IAAkB,UAAP5O,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD8O,GAAQ9O,EAAKpY,KAElB8W,EAAOoE,KAAK9C,GAGhB,OAAOtB,EAUT,SAASqQ,GAAYhR,GACnB,IAAInW,EAASmW,EAAMnW,OACnB,OAAOA,EAASmW,EAAMiR,GAAW,EAAGpnB,EAAS,IAAMwJ,EAWrD,SAAS6d,GAAgBlR,EAAOkD,GAC9B,OAAOiO,GAAYjE,GAAUlN,GAAQoR,GAAUlO,EAAG,EAAGlD,EAAMnW,SAU7D,SAASwnB,GAAarR,GACpB,OAAOmR,GAAYjE,GAAUlN,IAY/B,SAASsR,GAAiB5O,EAAQT,EAAKvR,IAChCA,IAAU2C,IAAcke,GAAG7O,EAAOT,GAAMvR,IACxCA,IAAU2C,KAAe4O,KAAOS,KACnC8O,GAAgB9O,EAAQT,EAAKvR,GAcjC,SAAS+gB,GAAY/O,EAAQT,EAAKvR,GAChC,IAAIghB,EAAWhP,EAAOT,GAChBiF,GAAepH,KAAK4C,EAAQT,IAAQsP,GAAGG,EAAUhhB,KAClDA,IAAU2C,GAAe4O,KAAOS,IACnC8O,GAAgB9O,EAAQT,EAAKvR,GAYjC,SAASwe,GAAalP,EAAOiC,GAC3B,IAAIpY,EAASmW,EAAMnW,OACnB,MAAOA,IACL,GAAI0nB,GAAGvR,EAAMnW,GAAQ,GAAIoY,GACvB,OAAOpY,EAGX,OAAQ,EAcV,SAAS8nB,GAAe5P,EAAY9B,EAAQC,EAAUC,GAIpD,OAHAyR,GAAS7P,GAAY,SAASrR,EAAOuR,EAAKF,GACxC9B,EAAOE,EAAazP,EAAOwP,EAASxP,GAAQqR,MAEvC5B,EAYT,SAAS0R,GAAWnP,EAAQtK,GAC1B,OAAOsK,GAAUoP,GAAW1Z,EAAQmP,GAAKnP,GAASsK,GAYpD,SAASqP,GAAarP,EAAQtK,GAC5B,OAAOsK,GAAUoP,GAAW1Z,EAAQ4Z,GAAO5Z,GAASsK,GAYtD,SAAS8O,GAAgB9O,EAAQT,EAAKvR,GACzB,aAAPuR,GAAsB2G,GACxBA,GAAelG,EAAQT,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASvR,EACT,UAAY,IAGdgS,EAAOT,GAAOvR,EAYlB,SAASuhB,GAAOvP,EAAQwP,GACtB,IAAI9R,GAAS,EACTvW,EAASqoB,EAAMroB,OACf8W,EAASM,EAAMpX,GACfsoB,EAAiB,MAAVzP,EAEX,QAAStC,EAAQvW,EACf8W,EAAOP,GAAS+R,EAAO9e,EAAY5B,GAAIiR,EAAQwP,EAAM9R,IAEvD,OAAOO,EAYT,SAASyQ,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,IAAWA,IACTE,IAAUjf,IACZ+e,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUhf,IACZ+e,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAU7hB,EAAO8hB,EAASC,EAAYxQ,EAAKS,EAAQgQ,GAC1D,IAAI/R,EACAgS,EAASH,EAAU1e,EACnB8e,EAASJ,EAAUze,EACnB8e,EAASL,EAAUxe,EAKvB,GAHIye,IACF9R,EAAS+B,EAAS+P,EAAW/hB,EAAOuR,EAAKS,EAAQgQ,GAASD,EAAW/hB,IAEnEiQ,IAAWtN,EACb,OAAOsN,EAET,IAAKyL,GAAS1b,GACZ,OAAOA,EAET,IAAI6c,EAAQzB,GAAQpb,GACpB,GAAI6c,GAEF,GADA5M,EAASmS,GAAepiB,IACnBiiB,EACH,OAAOzF,GAAUxc,EAAOiQ,OAErB,CACL,IAAIoS,EAAMC,GAAOtiB,GACbuiB,EAASF,GAAO5c,GAAW4c,GAAO3c,EAEtC,GAAIuT,GAASjZ,GACX,OAAOwiB,GAAYxiB,EAAOiiB,GAE5B,GAAII,GAAOvc,IAAauc,GAAOnd,GAAYqd,IAAWvQ,GAEpD,GADA/B,EAAUiS,GAAUK,EAAU,GAAKE,GAAgBziB,IAC9CiiB,EACH,OAAOC,EACHQ,GAAc1iB,EAAOqhB,GAAapR,EAAQjQ,IAC1C2iB,GAAY3iB,EAAOmhB,GAAWlR,EAAQjQ,QAEvC,CACL,IAAKyM,GAAc4V,GACjB,OAAOrQ,EAAShS,EAAQ,GAE1BiQ,EAAS2S,GAAe5iB,EAAOqiB,EAAKJ,IAIxCD,IAAUA,EAAQ,IAAIzC,IACtB,IAAIsD,EAAUb,EAAMjhB,IAAIf,GACxB,GAAI6iB,EACF,OAAOA,EAETb,EAAMnN,IAAI7U,EAAOiQ,GAEbpB,GAAM7O,GACRA,EAAM7B,SAAQ,SAAS2kB,GACrB7S,EAAOnO,IAAI+f,GAAUiB,EAAUhB,EAASC,EAAYe,EAAU9iB,EAAOgiB,OAE9DvT,GAAMzO,IACfA,EAAM7B,SAAQ,SAAS2kB,EAAUvR,GAC/BtB,EAAO4E,IAAItD,EAAKsQ,GAAUiB,EAAUhB,EAASC,EAAYxQ,EAAKvR,EAAOgiB,OAIzE,IAAIe,EAAWZ,EACVD,EAASc,GAAeC,GACxBf,EAASZ,GAASzK,GAEnBnE,EAAQmK,EAAQla,EAAYogB,EAAS/iB,GASzC,OARA2P,GAAU+C,GAAS1S,GAAO,SAAS8iB,EAAUvR,GACvCmB,IACFnB,EAAMuR,EACNA,EAAW9iB,EAAMuR,IAGnBwP,GAAY9Q,EAAQsB,EAAKsQ,GAAUiB,EAAUhB,EAASC,EAAYxQ,EAAKvR,EAAOgiB,OAEzE/R,EAUT,SAASiT,GAAaxb,GACpB,IAAIgL,EAAQmE,GAAKnP,GACjB,OAAO,SAASsK,GACd,OAAOmR,GAAenR,EAAQtK,EAAQgL,IAY1C,SAASyQ,GAAenR,EAAQtK,EAAQgL,GACtC,IAAIvZ,EAASuZ,EAAMvZ,OACnB,GAAc,MAAV6Y,EACF,OAAQ7Y,EAEV6Y,EAAS7E,GAAO6E,GAChB,MAAO7Y,IAAU,CACf,IAAIoY,EAAMmB,EAAMvZ,GACZ2W,EAAYpI,EAAO6J,GACnBvR,EAAQgS,EAAOT,GAEnB,GAAKvR,IAAU2C,KAAe4O,KAAOS,KAAalC,EAAU9P,GAC1D,OAAO,EAGX,OAAO,EAaT,SAASojB,GAAUnU,EAAMoU,EAAMlU,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAI+G,GAAUjT,GAEtB,OAAO0V,IAAW,WAAaxJ,EAAKD,MAAMrM,EAAWwM,KAAUkU,GAcjE,SAASC,GAAehU,EAAOmB,EAAQjB,EAAUa,GAC/C,IAAIX,GAAS,EACTrR,EAAW6R,GACXqT,GAAW,EACXpqB,EAASmW,EAAMnW,OACf8W,EAAS,GACTuT,EAAe/S,EAAOtX,OAE1B,IAAKA,EACH,OAAO8W,EAELT,IACFiB,EAASH,GAASG,EAAQqC,GAAUtD,KAElCa,GACFhS,EAAW+R,GACXmT,GAAW,GAEJ9S,EAAOtX,QAAU0J,IACxBxE,EAAW2U,GACXuQ,GAAW,EACX9S,EAAS,IAAI2O,GAAS3O,IAExB+M,EACA,QAAS9N,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACdgO,EAAuB,MAAZlO,EAAmBxP,EAAQwP,EAASxP,GAGnD,GADAA,EAASqQ,GAAwB,IAAVrQ,EAAeA,EAAQ,EAC1CujB,GAAY7F,IAAaA,EAAU,CACrC,IAAI+F,EAAcD,EAClB,MAAOC,IACL,GAAIhT,EAAOgT,KAAiB/F,EAC1B,SAASF,EAGbvN,EAAOoE,KAAKrU,QAEJ3B,EAASoS,EAAQiN,EAAUrN,IACnCJ,EAAOoE,KAAKrU,GAGhB,OAAOiQ,EAjkCTiL,GAAOwI,iBAAmB,CAQxB,OAAU9b,GAQV,SAAYC,GAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAKoT,KAKTA,GAAOhF,UAAYyF,GAAWzF,UAC9BgF,GAAOhF,UAAUyN,YAAczI,GAE/BI,GAAcpF,UAAYsF,GAAWG,GAAWzF,WAChDoF,GAAcpF,UAAUyN,YAAcrI,GAsHtCD,GAAYnF,UAAYsF,GAAWG,GAAWzF,WAC9CmF,GAAYnF,UAAUyN,YAActI,GAoGpCsC,GAAKzH,UAAU2H,MAAQE,GACvBJ,GAAKzH,UAAU,UAAY+H,GAC3BN,GAAKzH,UAAUnV,IAAMmd,GACrBP,GAAKzH,UAAUhD,IAAMiL,GACrBR,GAAKzH,UAAUrB,IAAMuJ,GAiHrBC,GAAUnI,UAAU2H,MAAQS,GAC5BD,GAAUnI,UAAU,UAAYqI,GAChCF,GAAUnI,UAAUnV,IAAM2d,GAC1BL,GAAUnI,UAAUhD,IAAMyL,GAC1BN,GAAUnI,UAAUrB,IAAM+J,GAmG1BC,GAAS3I,UAAU2H,MAAQiB,GAC3BD,GAAS3I,UAAU,UAAY6I,GAC/BF,GAAS3I,UAAUnV,IAAMke,GACzBJ,GAAS3I,UAAUhD,IAAMgM,GACzBL,GAAS3I,UAAUrB,IAAMsK,GAmDzBC,GAASlJ,UAAUpU,IAAMsd,GAASlJ,UAAU7B,KAAOgL,GACnDD,GAASlJ,UAAUhD,IAAMoM,GAkGzBC,GAAMrJ,UAAU2H,MAAQ2B,GACxBD,GAAMrJ,UAAU,UAAYuJ,GAC5BF,GAAMrJ,UAAUnV,IAAM2e,GACtBH,GAAMrJ,UAAUhD,IAAMyM,GACtBJ,GAAMrJ,UAAUrB,IAAM+K,GA8btB,IAAIsB,GAAW0C,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU3S,EAAYvB,GAC7B,IAAIG,GAAS,EAKb,OAJAiR,GAAS7P,GAAY,SAASrR,EAAO0P,EAAO2B,GAE1C,OADApB,IAAWH,EAAU9P,EAAO0P,EAAO2B,GAC5BpB,KAEFA,EAaT,SAASgU,GAAa3U,EAAOE,EAAUa,GACrC,IAAIX,GAAS,EACTvW,EAASmW,EAAMnW,OAEnB,QAASuW,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACd4C,EAAU9C,EAASxP,GAEvB,GAAe,MAAXsS,IAAoBoL,IAAa/a,EAC5B2P,IAAYA,IAAY4R,GAAS5R,GAClCjC,EAAWiC,EAASoL,IAE1B,IAAIA,EAAWpL,EACXrC,EAASjQ,EAGjB,OAAOiQ,EAaT,SAASkU,GAAS7U,EAAOtP,EAAOkd,EAAOC,GACrC,IAAIhkB,EAASmW,EAAMnW,OAEnB+jB,EAAQkH,GAAUlH,GACdA,EAAQ,IACVA,GAASA,EAAQ/jB,EAAS,EAAKA,EAAS+jB,GAE1CC,EAAOA,IAAQxa,GAAawa,EAAMhkB,EAAUA,EAASirB,GAAUjH,GAC3DA,EAAM,IACRA,GAAOhkB,GAETgkB,EAAMD,EAAQC,EAAM,EAAIkH,GAASlH,GACjC,MAAOD,EAAQC,EACb7N,EAAM4N,KAAWld,EAEnB,OAAOsP,EAWT,SAASgV,GAAWjT,EAAYvB,GAC9B,IAAIG,EAAS,GAMb,OALAiR,GAAS7P,GAAY,SAASrR,EAAO0P,EAAO2B,GACtCvB,EAAU9P,EAAO0P,EAAO2B,IAC1BpB,EAAOoE,KAAKrU,MAGTiQ,EAcT,SAASsU,GAAYjV,EAAOkV,EAAO1U,EAAW2U,EAAUxU,GACtD,IAAIP,GAAS,EACTvW,EAASmW,EAAMnW,OAEnB2W,IAAcA,EAAY4U,IAC1BzU,IAAWA,EAAS,IAEpB,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACd8U,EAAQ,GAAK1U,EAAU9P,GACrBwkB,EAAQ,EAEVD,GAAYvkB,EAAOwkB,EAAQ,EAAG1U,EAAW2U,EAAUxU,GAEnDO,GAAUP,EAAQjQ,GAEVykB,IACVxU,EAAOA,EAAO9W,QAAU6G,GAG5B,OAAOiQ,EAcT,IAAI0U,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASf,GAAW7R,EAAQxC,GAC1B,OAAOwC,GAAU2S,GAAQ3S,EAAQxC,EAAUqH,IAW7C,SAASkN,GAAgB/R,EAAQxC,GAC/B,OAAOwC,GAAU6S,GAAa7S,EAAQxC,EAAUqH,IAYlD,SAASiO,GAAc9S,EAAQU,GAC7B,OAAO3C,GAAY2C,GAAO,SAASnB,GACjC,OAAOwT,GAAW/S,EAAOT,OAY7B,SAASyT,GAAQhT,EAAQiT,GACvBA,EAAOC,GAASD,EAAMjT,GAEtB,IAAItC,EAAQ,EACRvW,EAAS8rB,EAAK9rB,OAElB,MAAiB,MAAV6Y,GAAkBtC,EAAQvW,EAC/B6Y,EAASA,EAAOmT,GAAMF,EAAKvV,OAE7B,OAAQA,GAASA,GAASvW,EAAU6Y,EAASrP,EAc/C,SAASyiB,GAAepT,EAAQ+Q,EAAUsC,GACxC,IAAIpV,EAAS8S,EAAS/Q,GACtB,OAAOoJ,GAAQpJ,GAAU/B,EAASO,GAAUP,EAAQoV,EAAYrT,IAUlE,SAASsT,GAAWtlB,GAClB,OAAa,MAATA,EACKA,IAAU2C,EAAY0D,GAAeR,GAEtCmS,IAAkBA,MAAkB7K,GAAOnN,GAC/CulB,GAAUvlB,GACVwlB,GAAexlB,GAYrB,SAASylB,GAAOzlB,EAAO0lB,GACrB,OAAO1lB,EAAQ0lB,EAWjB,SAASC,GAAQ3T,EAAQT,GACvB,OAAiB,MAAVS,GAAkBwE,GAAepH,KAAK4C,EAAQT,GAWvD,SAASqU,GAAU5T,EAAQT,GACzB,OAAiB,MAAVS,GAAkBT,KAAOpE,GAAO6E,GAYzC,SAAS6T,GAAYnE,EAAQxE,EAAOC,GAClC,OAAOuE,GAAUlI,GAAU0D,EAAOC,IAAQuE,EAASpI,GAAU4D,EAAOC,GAatE,SAAS2I,GAAiBC,EAAQvW,EAAUa,GAC1C,IAAIhS,EAAWgS,EAAaD,GAAoBF,GAC5C/W,EAAS4sB,EAAO,GAAG5sB,OACnB6sB,EAAYD,EAAO5sB,OACnB8sB,EAAWD,EACXE,EAAS3V,EAAMyV,GACfG,EAAYC,IACZnW,EAAS,GAEb,MAAOgW,IAAY,CACjB,IAAI3W,EAAQyW,EAAOE,GACfA,GAAYzW,IACdF,EAAQgB,GAAShB,EAAOwD,GAAUtD,KAEpC2W,EAAY3M,GAAUlK,EAAMnW,OAAQgtB,GACpCD,EAAOD,IAAa5V,IAAeb,GAAarW,GAAU,KAAOmW,EAAMnW,QAAU,KAC7E,IAAIimB,GAAS6G,GAAY3W,GACzB3M,EAEN2M,EAAQyW,EAAO,GAEf,IAAIrW,GAAS,EACT2W,EAAOH,EAAO,GAElB1I,EACA,QAAS9N,EAAQvW,GAAU8W,EAAO9W,OAASgtB,EAAW,CACpD,IAAInmB,EAAQsP,EAAMI,GACdgO,EAAWlO,EAAWA,EAASxP,GAASA,EAG5C,GADAA,EAASqQ,GAAwB,IAAVrQ,EAAeA,EAAQ,IACxCqmB,EACErT,GAASqT,EAAM3I,GACfrf,EAAS4R,EAAQyN,EAAUrN,IAC5B,CACL4V,EAAWD,EACX,QAASC,EAAU,CACjB,IAAIhT,EAAQiT,EAAOD,GACnB,KAAMhT,EACED,GAASC,EAAOyK,GAChBrf,EAAS0nB,EAAOE,GAAWvI,EAAUrN,IAE3C,SAASmN,EAGT6I,GACFA,EAAKhS,KAAKqJ,GAEZzN,EAAOoE,KAAKrU,IAGhB,OAAOiQ,EAcT,SAASqW,GAAatU,EAAQzC,EAAQC,EAAUC,GAI9C,OAHAoU,GAAW7R,GAAQ,SAAShS,EAAOuR,EAAKS,GACtCzC,EAAOE,EAAaD,EAASxP,GAAQuR,EAAKS,MAErCvC,EAaT,SAAS8W,GAAWvU,EAAQiT,EAAM9V,GAChC8V,EAAOC,GAASD,EAAMjT,GACtBA,EAASwU,GAAOxU,EAAQiT,GACxB,IAAIhW,EAAiB,MAAV+C,EAAiBA,EAASA,EAAOmT,GAAMsB,GAAKxB,KACvD,OAAe,MAARhW,EAAetM,EAAYqM,GAAMC,EAAM+C,EAAQ7C,GAUxD,SAASuX,GAAgB1mB,GACvB,OAAOmb,GAAanb,IAAUslB,GAAWtlB,IAAUkF,EAUrD,SAASyhB,GAAkB3mB,GACzB,OAAOmb,GAAanb,IAAUslB,GAAWtlB,IAAUwG,GAUrD,SAASogB,GAAW5mB,GAClB,OAAOmb,GAAanb,IAAUslB,GAAWtlB,IAAUsF,EAiBrD,SAASuhB,GAAY7mB,EAAO0lB,EAAO5D,EAASC,EAAYC,GACtD,OAAIhiB,IAAU0lB,IAGD,MAAT1lB,GAA0B,MAAT0lB,IAAmBvK,GAAanb,KAAWmb,GAAauK,GACpE1lB,IAAUA,GAAS0lB,IAAUA,EAE/BoB,GAAgB9mB,EAAO0lB,EAAO5D,EAASC,EAAY8E,GAAa7E,IAiBzE,SAAS8E,GAAgB9U,EAAQ0T,EAAO5D,EAASC,EAAYgF,EAAW/E,GACtE,IAAIgF,EAAW5L,GAAQpJ,GACnBiV,EAAW7L,GAAQsK,GACnBwB,EAASF,EAAW7hB,EAAWmd,GAAOtQ,GACtCmV,EAASF,EAAW9hB,EAAWmd,GAAOoD,GAE1CwB,EAASA,GAAUhiB,EAAUY,GAAYohB,EACzCC,EAASA,GAAUjiB,EAAUY,GAAYqhB,EAEzC,IAAIC,EAAWF,GAAUphB,GACrBuhB,EAAWF,GAAUrhB,GACrBwhB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarO,GAASjH,GAAS,CACjC,IAAKiH,GAASyM,GACZ,OAAO,EAETsB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADApF,IAAUA,EAAQ,IAAIzC,IACdyH,GAAYjY,GAAaiD,GAC7BuV,GAAYvV,EAAQ0T,EAAO5D,EAASC,EAAYgF,EAAW/E,GAC3DwF,GAAWxV,EAAQ0T,EAAOwB,EAAQpF,EAASC,EAAYgF,EAAW/E,GAExE,KAAMF,EAAUve,GAAuB,CACrC,IAAIkkB,EAAeL,GAAY5Q,GAAepH,KAAK4C,EAAQ,eACvD0V,EAAeL,GAAY7Q,GAAepH,KAAKsW,EAAO,eAE1D,GAAI+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAezV,EAAOhS,QAAUgS,EAC/C4V,EAAeF,EAAehC,EAAM1lB,QAAU0lB,EAGlD,OADA1D,IAAUA,EAAQ,IAAIzC,IACfwH,EAAUY,EAAcC,EAAc9F,EAASC,EAAYC,IAGtE,QAAKsF,IAGLtF,IAAUA,EAAQ,IAAIzC,IACfsI,GAAa7V,EAAQ0T,EAAO5D,EAASC,EAAYgF,EAAW/E,IAUrE,SAAS8F,GAAU9nB,GACjB,OAAOmb,GAAanb,IAAUsiB,GAAOtiB,IAAU2F,EAajD,SAASoiB,GAAY/V,EAAQtK,EAAQsgB,EAAWjG,GAC9C,IAAIrS,EAAQsY,EAAU7uB,OAClBA,EAASuW,EACTuY,GAAgBlG,EAEpB,GAAc,MAAV/P,EACF,OAAQ7Y,EAEV6Y,EAAS7E,GAAO6E,GAChB,MAAOtC,IAAS,CACd,IAAIzZ,EAAO+xB,EAAUtY,GACrB,GAAKuY,GAAgBhyB,EAAK,GAClBA,EAAK,KAAO+b,EAAO/b,EAAK,MACtBA,EAAK,KAAM+b,GAEnB,OAAO,EAGX,QAAStC,EAAQvW,EAAQ,CACvBlD,EAAO+xB,EAAUtY,GACjB,IAAI6B,EAAMtb,EAAK,GACX+qB,EAAWhP,EAAOT,GAClB2W,EAAWjyB,EAAK,GAEpB,GAAIgyB,GAAgBhyB,EAAK,IACvB,GAAI+qB,IAAare,KAAe4O,KAAOS,GACrC,OAAO,MAEJ,CACL,IAAIgQ,EAAQ,IAAIzC,GAChB,GAAIwC,EACF,IAAI9R,EAAS8R,EAAWf,EAAUkH,EAAU3W,EAAKS,EAAQtK,EAAQsa,GAEnE,KAAM/R,IAAWtN,EACTkkB,GAAYqB,EAAUlH,EAAUzd,EAAuBC,EAAwBue,EAAYC,GAC3F/R,GAEN,OAAO,GAIb,OAAO,EAWT,SAASkY,GAAanoB,GACpB,IAAK0b,GAAS1b,IAAUooB,GAASpoB,GAC/B,OAAO,EAET,IAAIqoB,EAAUtD,GAAW/kB,GAASkX,GAAalO,GAC/C,OAAOqf,EAAQtU,KAAK0G,GAASza,IAU/B,SAASsoB,GAAatoB,GACpB,OAAOmb,GAAanb,IAAUslB,GAAWtlB,IAAUiG,GAUrD,SAASsiB,GAAUvoB,GACjB,OAAOmb,GAAanb,IAAUsiB,GAAOtiB,IAAUkG,GAUjD,SAASsiB,GAAiBxoB,GACxB,OAAOmb,GAAanb,IAClByoB,GAASzoB,EAAM7G,WAAaqT,GAAe8Y,GAAWtlB,IAU1D,SAAS0oB,GAAa1oB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK2oB,GAEW,iBAAT3oB,EACFob,GAAQpb,GACX4oB,GAAoB5oB,EAAM,GAAIA,EAAM,IACpC6oB,GAAY7oB,GAEX8oB,GAAS9oB,GAUlB,SAAS+oB,GAAS/W,GAChB,IAAKgX,GAAYhX,GACf,OAAOqH,GAAWrH,GAEpB,IAAI/B,EAAS,GACb,IAAK,IAAIsB,KAAOpE,GAAO6E,GACjBwE,GAAepH,KAAK4C,EAAQT,IAAe,eAAPA,GACtCtB,EAAOoE,KAAK9C,GAGhB,OAAOtB,EAUT,SAASgZ,GAAWjX,GAClB,IAAK0J,GAAS1J,GACZ,OAAOkX,GAAalX,GAEtB,IAAImX,EAAUH,GAAYhX,GACtB/B,EAAS,GAEb,IAAK,IAAIsB,KAAOS,GACD,eAAPT,IAAyB4X,GAAY3S,GAAepH,KAAK4C,EAAQT,KACrEtB,EAAOoE,KAAK9C,GAGhB,OAAOtB,EAYT,SAASmZ,GAAOppB,EAAO0lB,GACrB,OAAO1lB,EAAQ0lB,EAWjB,SAAS2D,GAAQhY,EAAY7B,GAC3B,IAAIE,GAAS,EACTO,EAASqZ,GAAYjY,GAAcd,EAAMc,EAAWlY,QAAU,GAKlE,OAHA+nB,GAAS7P,GAAY,SAASrR,EAAOuR,EAAKF,GACxCpB,IAASP,GAASF,EAASxP,EAAOuR,EAAKF,MAElCpB,EAUT,SAAS4Y,GAAYnhB,GACnB,IAAIsgB,EAAYuB,GAAa7hB,GAC7B,OAAwB,GAApBsgB,EAAU7uB,QAAe6uB,EAAU,GAAG,GACjCwB,GAAwBxB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAShW,GACd,OAAOA,IAAWtK,GAAUqgB,GAAY/V,EAAQtK,EAAQsgB,IAY5D,SAASY,GAAoB3D,EAAMiD,GACjC,OAAIuB,GAAMxE,IAASyE,GAAmBxB,GAC7BsB,GAAwBrE,GAAMF,GAAOiD,GAEvC,SAASlW,GACd,IAAIgP,EAAWjgB,GAAIiR,EAAQiT,GAC3B,OAAQjE,IAAare,GAAaqe,IAAakH,EAC3CyB,GAAM3X,EAAQiT,GACd4B,GAAYqB,EAAUlH,EAAUzd,EAAuBC,IAe/D,SAASomB,GAAU5X,EAAQtK,EAAQmiB,EAAU9H,EAAYC,GACnDhQ,IAAWtK,GAGfid,GAAQjd,GAAQ,SAASwgB,EAAU3W,GAEjC,GADAyQ,IAAUA,EAAQ,IAAIzC,IAClB7D,GAASwM,GACX4B,GAAc9X,EAAQtK,EAAQ6J,EAAKsY,EAAUD,GAAW7H,EAAYC,OAEjE,CACH,IAAI+H,EAAWhI,EACXA,EAAWiI,GAAQhY,EAAQT,GAAM2W,EAAW3W,EAAM,GAAKS,EAAQtK,EAAQsa,GACvErf,EAEAonB,IAAapnB,IACfonB,EAAW7B,GAEbtH,GAAiB5O,EAAQT,EAAKwY,MAE/BzI,IAkBL,SAASwI,GAAc9X,EAAQtK,EAAQ6J,EAAKsY,EAAUI,EAAWlI,EAAYC,GAC3E,IAAIhB,EAAWgJ,GAAQhY,EAAQT,GAC3B2W,EAAW8B,GAAQtiB,EAAQ6J,GAC3BsR,EAAUb,EAAMjhB,IAAImnB,GAExB,GAAIrF,EACFjC,GAAiB5O,EAAQT,EAAKsR,OADhC,CAIA,IAAIkH,EAAWhI,EACXA,EAAWf,EAAUkH,EAAW3W,EAAM,GAAKS,EAAQtK,EAAQsa,GAC3Drf,EAEA4gB,EAAWwG,IAAapnB,EAE5B,GAAI4gB,EAAU,CACZ,IAAI1G,EAAQzB,GAAQ8M,GAChBhI,GAAUrD,GAAS5D,GAASiP,GAC5BgC,GAAWrN,IAAUqD,GAAUnR,GAAamZ,GAEhD6B,EAAW7B,EACPrL,GAASqD,GAAUgK,EACjB9O,GAAQ4F,GACV+I,EAAW/I,EAEJmJ,GAAkBnJ,GACzB+I,EAAWvN,GAAUwE,GAEdd,GACPqD,GAAW,EACXwG,EAAWvH,GAAY0F,GAAU,IAE1BgC,GACP3G,GAAW,EACXwG,EAAWK,GAAgBlC,GAAU,IAGrC6B,EAAW,GAGNM,GAAcnC,IAAajI,GAAYiI,IAC9C6B,EAAW/I,EACPf,GAAYe,GACd+I,EAAWO,GAActJ,GAEjBtF,GAASsF,KAAa+D,GAAW/D,KACzC+I,EAAWtH,GAAgByF,KAI7B3E,GAAW,EAGXA,IAEFvB,EAAMnN,IAAIqT,EAAU6B,GACpBE,EAAUF,EAAU7B,EAAU2B,EAAU9H,EAAYC,GACpDA,EAAM,UAAUkG,IAElBtH,GAAiB5O,EAAQT,EAAKwY,IAWhC,SAASQ,GAAQjb,EAAOkD,GACtB,IAAIrZ,EAASmW,EAAMnW,OACnB,GAAKA,EAIL,OADAqZ,GAAKA,EAAI,EAAIrZ,EAAS,EACfknB,GAAQ7N,EAAGrZ,GAAUmW,EAAMkD,GAAK7P,EAYzC,SAAS6nB,GAAYnZ,EAAY+L,EAAWqN,GAExCrN,EADEA,EAAUjkB,OACAmX,GAAS8M,GAAW,SAAS5N,GACvC,OAAI4L,GAAQ5L,GACH,SAASxP,GACd,OAAOglB,GAAQhlB,EAA2B,IAApBwP,EAASrW,OAAeqW,EAAS,GAAKA,IAGzDA,KAGG,CAACmZ,IAGf,IAAIjZ,GAAS,EACb0N,EAAY9M,GAAS8M,EAAWtK,GAAU4X,OAE1C,IAAIza,EAASoZ,GAAQhY,GAAY,SAASrR,EAAOuR,EAAKF,GACpD,IAAIsZ,EAAWra,GAAS8M,GAAW,SAAS5N,GAC1C,OAAOA,EAASxP,MAElB,MAAO,CAAE,SAAY2qB,EAAU,QAAWjb,EAAO,MAAS1P,MAG5D,OAAOmS,GAAWlC,GAAQ,SAAS+B,EAAQ0T,GACzC,OAAOkF,GAAgB5Y,EAAQ0T,EAAO+E,MAa1C,SAASI,GAAS7Y,EAAQwP,GACxB,OAAOsJ,GAAW9Y,EAAQwP,GAAO,SAASxhB,EAAOilB,GAC/C,OAAO0E,GAAM3X,EAAQiT,MAazB,SAAS6F,GAAW9Y,EAAQwP,EAAO1R,GACjC,IAAIJ,GAAS,EACTvW,EAASqoB,EAAMroB,OACf8W,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI8rB,EAAOzD,EAAM9R,GACb1P,EAAQglB,GAAQhT,EAAQiT,GAExBnV,EAAU9P,EAAOilB,IACnB8F,GAAQ9a,EAAQiV,GAASD,EAAMjT,GAAShS,GAG5C,OAAOiQ,EAUT,SAAS+a,GAAiB/F,GACxB,OAAO,SAASjT,GACd,OAAOgT,GAAQhT,EAAQiT,IAe3B,SAASgG,GAAY3b,EAAOmB,EAAQjB,EAAUa,GAC5C,IAAItW,EAAUsW,EAAawB,GAAkB1B,GACzCT,GAAS,EACTvW,EAASsX,EAAOtX,OAChBktB,EAAO/W,EAEPA,IAAUmB,IACZA,EAAS+L,GAAU/L,IAEjBjB,IACF6W,EAAO/V,GAAShB,EAAOwD,GAAUtD,KAEnC,QAASE,EAAQvW,EAAQ,CACvB,IAAIsY,EAAY,EACZzR,EAAQyQ,EAAOf,GACfgO,EAAWlO,EAAWA,EAASxP,GAASA,EAE5C,OAAQyR,EAAY1X,EAAQssB,EAAM3I,EAAUjM,EAAWpB,KAAgB,EACjEgW,IAAS/W,GACXsI,GAAOxI,KAAKiX,EAAM5U,EAAW,GAE/BmG,GAAOxI,KAAKE,EAAOmC,EAAW,GAGlC,OAAOnC,EAYT,SAAS4b,GAAW5b,EAAO6b,GACzB,IAAIhyB,EAASmW,EAAQ6b,EAAQhyB,OAAS,EAClCmc,EAAYnc,EAAS,EAEzB,MAAOA,IAAU,CACf,IAAIuW,EAAQyb,EAAQhyB,GACpB,GAAIA,GAAUmc,GAAa5F,IAAU0b,EAAU,CAC7C,IAAIA,EAAW1b,EACX2Q,GAAQ3Q,GACVkI,GAAOxI,KAAKE,EAAOI,EAAO,GAE1B2b,GAAU/b,EAAOI,IAIvB,OAAOJ,EAYT,SAASiR,GAAWoB,EAAOC,GACzB,OAAOD,EAAQ/I,GAAYgB,MAAkBgI,EAAQD,EAAQ,IAc/D,SAAS2J,GAAUpO,EAAOC,EAAKoO,EAAM7Z,GACnC,IAAIhC,GAAS,EACTvW,EAASmgB,GAAUZ,IAAYyE,EAAMD,IAAUqO,GAAQ,IAAK,GAC5Dtb,EAASM,EAAMpX,GAEnB,MAAOA,IACL8W,EAAOyB,EAAYvY,IAAWuW,GAASwN,EACvCA,GAASqO,EAEX,OAAOtb,EAWT,SAASub,GAAWva,EAAQuB,GAC1B,IAAIvC,EAAS,GACb,IAAKgB,GAAUuB,EAAI,GAAKA,EAAI7N,EAC1B,OAAOsL,EAIT,GACMuC,EAAI,IACNvC,GAAUgB,GAEZuB,EAAIoG,GAAYpG,EAAI,GAChBA,IACFvB,GAAUA,SAELuB,GAET,OAAOvC,EAWT,SAASwb,GAASxc,EAAMiO,GACtB,OAAOwO,GAAYC,GAAS1c,EAAMiO,EAAOyL,IAAW1Z,EAAO,IAU7D,SAAS2c,GAAWva,GAClB,OAAOiP,GAAY7P,GAAOY,IAW5B,SAASwa,GAAexa,EAAYmB,GAClC,IAAIlD,EAAQmB,GAAOY,GACnB,OAAOoP,GAAYnR,EAAOoR,GAAUlO,EAAG,EAAGlD,EAAMnW,SAalD,SAAS4xB,GAAQ/Y,EAAQiT,EAAMjlB,EAAO+hB,GACpC,IAAKrG,GAAS1J,GACZ,OAAOA,EAETiT,EAAOC,GAASD,EAAMjT,GAEtB,IAAItC,GAAS,EACTvW,EAAS8rB,EAAK9rB,OACdmc,EAAYnc,EAAS,EACrB2yB,EAAS9Z,EAEb,MAAiB,MAAV8Z,KAAoBpc,EAAQvW,EAAQ,CACzC,IAAIoY,EAAM4T,GAAMF,EAAKvV,IACjBqa,EAAW/pB,EAEf,GAAY,cAARuR,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOS,EAGT,GAAItC,GAAS4F,EAAW,CACtB,IAAI0L,EAAW8K,EAAOva,GACtBwY,EAAWhI,EAAaA,EAAWf,EAAUzP,EAAKua,GAAUnpB,EACxDonB,IAAapnB,IACfonB,EAAWrO,GAASsF,GAChBA,EACCX,GAAQ4E,EAAKvV,EAAQ,IAAM,GAAK,IAGzCqR,GAAY+K,EAAQva,EAAKwY,GACzB+B,EAASA,EAAOva,GAElB,OAAOS,EAWT,IAAI+Z,GAAezR,GAAqB,SAASrL,EAAMhZ,GAErD,OADAqkB,GAAQzF,IAAI5F,EAAMhZ,GACXgZ,GAFoB0Z,GAazBqD,GAAmB9T,GAA4B,SAASjJ,EAAMgC,GAChE,OAAOiH,GAAejJ,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASgd,GAAShb,GAClB,UAAY,KALwB0X,GAgBxC,SAASuD,GAAY7a,GACnB,OAAOoP,GAAYhQ,GAAOY,IAY5B,SAAS8a,GAAU7c,EAAO4N,EAAOC,GAC/B,IAAIzN,GAAS,EACTvW,EAASmW,EAAMnW,OAEf+jB,EAAQ,IACVA,GAASA,EAAQ/jB,EAAS,EAAKA,EAAS+jB,GAE1CC,EAAMA,EAAMhkB,EAASA,EAASgkB,EAC1BA,EAAM,IACRA,GAAOhkB,GAETA,EAAS+jB,EAAQC,EAAM,EAAMA,EAAMD,IAAW,EAC9CA,KAAW,EAEX,IAAIjN,EAASM,EAAMpX,GACnB,QAASuW,EAAQvW,EACf8W,EAAOP,GAASJ,EAAMI,EAAQwN,GAEhC,OAAOjN,EAYT,SAASmc,GAAS/a,EAAYvB,GAC5B,IAAIG,EAMJ,OAJAiR,GAAS7P,GAAY,SAASrR,EAAO0P,EAAO2B,GAE1C,OADApB,EAASH,EAAU9P,EAAO0P,EAAO2B,IACzBpB,OAEDA,EAeX,SAASoc,GAAgB/c,EAAOtP,EAAOssB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATld,EAAgBid,EAAMjd,EAAMnW,OAEvC,GAAoB,iBAAT6G,GAAqBA,IAAUA,GAASwsB,GAAQxnB,EAAuB,CAChF,MAAOunB,EAAMC,EAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB9O,EAAWpO,EAAMmd,GAEJ,OAAb/O,IAAsBwG,GAASxG,KAC9B4O,EAAc5O,GAAY1d,EAAU0d,EAAW1d,GAClDusB,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBpd,EAAOtP,EAAO2oB,GAAU2D,GAgBnD,SAASI,GAAkBpd,EAAOtP,EAAOwP,EAAU8c,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATld,EAAgB,EAAIA,EAAMnW,OACrC,GAAa,IAATqzB,EACF,OAAO,EAGTxsB,EAAQwP,EAASxP,GACjB,IAAI2sB,EAAW3sB,IAAUA,EACrB4sB,EAAsB,OAAV5sB,EACZ6sB,EAAc3I,GAASlkB,GACvB8sB,EAAiB9sB,IAAU2C,EAE/B,MAAO4pB,EAAMC,EAAM,CACjB,IAAIC,EAAM7T,IAAa2T,EAAMC,GAAQ,GACjC9O,EAAWlO,EAASF,EAAMmd,IAC1BM,EAAerP,IAAa/a,EAC5BqqB,EAAyB,OAAbtP,EACZuP,EAAiBvP,IAAaA,EAC9BwP,EAAchJ,GAASxG,GAE3B,GAAIiP,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAc5O,GAAY1d,EAAU0d,EAAW1d,GAEtDmtB,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOjT,GAAUgT,EAAMznB,GAYzB,SAASqoB,GAAe9d,EAAOE,GAC7B,IAAIE,GAAS,EACTvW,EAASmW,EAAMnW,OACf6W,EAAW,EACXC,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACdgO,EAAWlO,EAAWA,EAASxP,GAASA,EAE5C,IAAK0P,IAAUmR,GAAGnD,EAAU2I,GAAO,CACjC,IAAIA,EAAO3I,EACXzN,EAAOD,KAAwB,IAAVhQ,EAAc,EAAIA,GAG3C,OAAOiQ,EAWT,SAASod,GAAartB,GACpB,MAAoB,iBAATA,EACFA,EAELkkB,GAASlkB,GACJ6E,GAED7E,EAWV,SAASstB,GAAattB,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIob,GAAQpb,GAEV,OAAOsQ,GAAStQ,EAAOstB,IAAgB,GAEzC,GAAIpJ,GAASlkB,GACX,OAAOib,GAAiBA,GAAe7L,KAAKpP,GAAS,GAEvD,IAAIiQ,EAAUjQ,EAAQ,GACtB,MAAkB,KAAViQ,GAAkB,EAAIjQ,IAAW0E,EAAY,KAAOuL,EAY9D,SAASsd,GAASje,EAAOE,EAAUa,GACjC,IAAIX,GAAS,EACTrR,EAAW6R,GACX/W,EAASmW,EAAMnW,OACfoqB,GAAW,EACXtT,EAAS,GACToW,EAAOpW,EAEX,GAAII,EACFkT,GAAW,EACXllB,EAAW+R,QAER,GAAIjX,GAAU0J,EAAkB,CACnC,IAAIgS,EAAMrF,EAAW,KAAOge,GAAUle,GACtC,GAAIuF,EACF,OAAOD,GAAWC,GAEpB0O,GAAW,EACXllB,EAAW2U,GACXqT,EAAO,IAAIjH,QAGXiH,EAAO7W,EAAW,GAAKS,EAEzBuN,EACA,QAAS9N,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACdgO,EAAWlO,EAAWA,EAASxP,GAASA,EAG5C,GADAA,EAASqQ,GAAwB,IAAVrQ,EAAeA,EAAQ,EAC1CujB,GAAY7F,IAAaA,EAAU,CACrC,IAAI+P,EAAYpH,EAAKltB,OACrB,MAAOs0B,IACL,GAAIpH,EAAKoH,KAAe/P,EACtB,SAASF,EAGThO,GACF6W,EAAKhS,KAAKqJ,GAEZzN,EAAOoE,KAAKrU,QAEJ3B,EAASgoB,EAAM3I,EAAUrN,KAC7BgW,IAASpW,GACXoW,EAAKhS,KAAKqJ,GAEZzN,EAAOoE,KAAKrU,IAGhB,OAAOiQ,EAWT,SAASob,GAAUrZ,EAAQiT,GAGzB,OAFAA,EAAOC,GAASD,EAAMjT,GACtBA,EAASwU,GAAOxU,EAAQiT,GACP,MAAVjT,UAAyBA,EAAOmT,GAAMsB,GAAKxB,KAapD,SAASyI,GAAW1b,EAAQiT,EAAM0I,EAAS5L,GACzC,OAAOgJ,GAAQ/Y,EAAQiT,EAAM0I,EAAQ3I,GAAQhT,EAAQiT,IAAQlD,GAc/D,SAAS6L,GAAUte,EAAOQ,EAAW+d,EAAQnc,GAC3C,IAAIvY,EAASmW,EAAMnW,OACfuW,EAAQgC,EAAYvY,GAAU,EAElC,OAAQuY,EAAYhC,MAAYA,EAAQvW,IACtC2W,EAAUR,EAAMI,GAAQA,EAAOJ,IAEjC,OAAOue,EACH1B,GAAU7c,EAAQoC,EAAY,EAAIhC,EAASgC,EAAYhC,EAAQ,EAAIvW,GACnEgzB,GAAU7c,EAAQoC,EAAYhC,EAAQ,EAAI,EAAKgC,EAAYvY,EAASuW,GAa1E,SAAS6N,GAAiBvd,EAAO8tB,GAC/B,IAAI7d,EAASjQ,EAIb,OAHIiQ,aAAkBoL,KACpBpL,EAASA,EAAOjQ,SAEX0Q,GAAYod,GAAS,SAAS7d,EAAQ8d,GAC3C,OAAOA,EAAO9e,KAAKD,MAAM+e,EAAO7e,QAASsB,GAAU,CAACP,GAAS8d,EAAO5e,SACnEc,GAaL,SAAS+d,GAAQjI,EAAQvW,EAAUa,GACjC,IAAIlX,EAAS4sB,EAAO5sB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASo0B,GAASxH,EAAO,IAAM,GAExC,IAAIrW,GAAS,EACTO,EAASM,EAAMpX,GAEnB,QAASuW,EAAQvW,EAAQ,CACvB,IAAImW,EAAQyW,EAAOrW,GACfuW,GAAY,EAEhB,QAASA,EAAW9sB,EACd8sB,GAAYvW,IACdO,EAAOP,GAAS4T,GAAerT,EAAOP,IAAUJ,EAAOyW,EAAOE,GAAWzW,EAAUa,IAIzF,OAAOkd,GAAShJ,GAAYtU,EAAQ,GAAIT,EAAUa,GAYpD,SAAS4d,GAAcvb,EAAOjC,EAAQyd,GACpC,IAAIxe,GAAS,EACTvW,EAASuZ,EAAMvZ,OACfg1B,EAAa1d,EAAOtX,OACpB8W,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQ0P,EAAQye,EAAa1d,EAAOf,GAAS/M,EACjDurB,EAAWje,EAAQyC,EAAMhD,GAAQ1P,GAEnC,OAAOiQ,EAUT,SAASme,GAAoBpuB,GAC3B,OAAOmqB,GAAkBnqB,GAASA,EAAQ,GAU5C,SAASquB,GAAaruB,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ2oB,GAW9C,SAASzD,GAASllB,EAAOgS,GACvB,OAAIoJ,GAAQpb,GACHA,EAEFypB,GAAMzpB,EAAOgS,GAAU,CAAChS,GAASsuB,GAAa/X,GAASvW,IAYhE,IAAIuuB,GAAW9C,GAWf,SAAS+C,GAAUlf,EAAO4N,EAAOC,GAC/B,IAAIhkB,EAASmW,EAAMnW,OAEnB,OADAgkB,EAAMA,IAAQxa,EAAYxJ,EAASgkB,GAC1BD,GAASC,GAAOhkB,EAAUmW,EAAQ6c,GAAU7c,EAAO4N,EAAOC,GASrE,IAAI9E,GAAeD,IAAmB,SAAS9e,GAC7C,OAAOgU,GAAK+K,aAAa/e,IAW3B,SAASkpB,GAAYiM,EAAQxM,GAC3B,GAAIA,EACF,OAAOwM,EAAO7uB,QAEhB,IAAIzG,EAASs1B,EAAOt1B,OAChB8W,EAASqH,GAAcA,GAAYne,GAAU,IAAIs1B,EAAO9K,YAAYxqB,GAGxE,OADAs1B,EAAOC,KAAKze,GACLA,EAUT,SAAS0e,GAAiBC,GACxB,IAAI3e,EAAS,IAAI2e,EAAYjL,YAAYiL,EAAYC,YAErD,OADA,IAAIxX,GAAWpH,GAAQ4E,IAAI,IAAIwC,GAAWuX,IACnC3e,EAWT,SAAS6e,GAAcC,EAAU9M,GAC/B,IAAIwM,EAASxM,EAAS0M,GAAiBI,EAASN,QAAUM,EAASN,OACnE,OAAO,IAAIM,EAASpL,YAAY8K,EAAQM,EAASC,WAAYD,EAASF,YAUxE,SAASI,GAAYC,GACnB,IAAIjf,EAAS,IAAIif,EAAOvL,YAAYuL,EAAOxnB,OAAQmB,GAAQ+N,KAAKsY,IAEhE,OADAjf,EAAOqF,UAAY4Z,EAAO5Z,UACnBrF,EAUT,SAASkf,GAAYC,GACnB,OAAOrU,GAAgB5N,GAAO4N,GAAc3L,KAAKggB,IAAW,GAW9D,SAAShF,GAAgBiF,EAAYpN,GACnC,IAAIwM,EAASxM,EAAS0M,GAAiBU,EAAWZ,QAAUY,EAAWZ,OACvE,OAAO,IAAIY,EAAW1L,YAAY8K,EAAQY,EAAWL,WAAYK,EAAWl2B,QAW9E,SAASm2B,GAAiBtvB,EAAO0lB,GAC/B,GAAI1lB,IAAU0lB,EAAO,CACnB,IAAI6J,EAAevvB,IAAU2C,EACzBiqB,EAAsB,OAAV5sB,EACZwvB,EAAiBxvB,IAAUA,EAC3B6sB,EAAc3I,GAASlkB,GAEvB+sB,EAAerH,IAAU/iB,EACzBqqB,EAAsB,OAAVtH,EACZuH,EAAiBvH,IAAUA,EAC3BwH,EAAchJ,GAASwB,GAE3B,IAAMsH,IAAcE,IAAgBL,GAAe7sB,EAAQ0lB,GACtDmH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BsC,GAAgBtC,IACjBuC,EACH,OAAO,EAET,IAAM5C,IAAcC,IAAgBK,GAAeltB,EAAQ0lB,GACtDwH,GAAeqC,GAAgBC,IAAmB5C,IAAcC,GAChEG,GAAauC,GAAgBC,IAC5BzC,GAAgByC,IACjBvC,EACH,OAAQ,EAGZ,OAAO,EAiBT,SAASrC,GAAgB5Y,EAAQ0T,EAAO+E,GACtC,IAAI/a,GAAS,EACT+f,EAAczd,EAAO2Y,SACrB+E,EAAchK,EAAMiF,SACpBxxB,EAASs2B,EAAYt2B,OACrBw2B,EAAelF,EAAOtxB,OAE1B,QAASuW,EAAQvW,EAAQ,CACvB,IAAI8W,EAASqf,GAAiBG,EAAY/f,GAAQggB,EAAYhgB,IAC9D,GAAIO,EAAQ,CACV,GAAIP,GAASigB,EACX,OAAO1f,EAET,IAAI2f,EAAQnF,EAAO/a,GACnB,OAAOO,GAAmB,QAAT2f,GAAmB,EAAI,IAU5C,OAAO5d,EAAOtC,MAAQgW,EAAMhW,MAc9B,SAASmgB,GAAY1gB,EAAM2gB,EAAUC,EAASC,GAC5C,IAAIC,GAAa,EACbC,EAAa/gB,EAAKhW,OAClBg3B,EAAgBJ,EAAQ52B,OACxBi3B,GAAa,EACbC,EAAaP,EAAS32B,OACtBm3B,EAAchX,GAAU4W,EAAaC,EAAe,GACpDlgB,EAASM,EAAM8f,EAAaC,GAC5BC,GAAeP,EAEnB,QAASI,EAAYC,EACnBpgB,EAAOmgB,GAAaN,EAASM,GAE/B,QAASH,EAAYE,GACfI,GAAeN,EAAYC,KAC7BjgB,EAAO8f,EAAQE,IAAc9gB,EAAK8gB,IAGtC,MAAOK,IACLrgB,EAAOmgB,KAAejhB,EAAK8gB,KAE7B,OAAOhgB,EAcT,SAASugB,GAAiBrhB,EAAM2gB,EAAUC,EAASC,GACjD,IAAIC,GAAa,EACbC,EAAa/gB,EAAKhW,OAClBs3B,GAAgB,EAChBN,EAAgBJ,EAAQ52B,OACxBu3B,GAAc,EACdC,EAAcb,EAAS32B,OACvBm3B,EAAchX,GAAU4W,EAAaC,EAAe,GACpDlgB,EAASM,EAAM+f,EAAcK,GAC7BJ,GAAeP,EAEnB,QAASC,EAAYK,EACnBrgB,EAAOggB,GAAa9gB,EAAK8gB,GAE3B,IAAIhwB,EAASgwB,EACb,QAASS,EAAaC,EACpB1gB,EAAOhQ,EAASywB,GAAcZ,EAASY,GAEzC,QAASD,EAAeN,GAClBI,GAAeN,EAAYC,KAC7BjgB,EAAOhQ,EAAS8vB,EAAQU,IAAiBthB,EAAK8gB,MAGlD,OAAOhgB,EAWT,SAASuM,GAAU9U,EAAQ4H,GACzB,IAAII,GAAS,EACTvW,EAASuO,EAAOvO,OAEpBmW,IAAUA,EAAQiB,EAAMpX,IACxB,QAASuW,EAAQvW,EACfmW,EAAMI,GAAShI,EAAOgI,GAExB,OAAOJ,EAaT,SAAS8R,GAAW1Z,EAAQgL,EAAOV,EAAQ+P,GACzC,IAAI6O,GAAS5e,EACbA,IAAWA,EAAS,IAEpB,IAAItC,GAAS,EACTvW,EAASuZ,EAAMvZ,OAEnB,QAASuW,EAAQvW,EAAQ,CACvB,IAAIoY,EAAMmB,EAAMhD,GAEZqa,EAAWhI,EACXA,EAAW/P,EAAOT,GAAM7J,EAAO6J,GAAMA,EAAKS,EAAQtK,GAClD/E,EAEAonB,IAAapnB,IACfonB,EAAWriB,EAAO6J,IAEhBqf,EACF9P,GAAgB9O,EAAQT,EAAKwY,GAE7BhJ,GAAY/O,EAAQT,EAAKwY,GAG7B,OAAO/X,EAWT,SAAS2Q,GAAYjb,EAAQsK,GAC3B,OAAOoP,GAAW1Z,EAAQmpB,GAAWnpB,GAASsK,GAWhD,SAAS0Q,GAAchb,EAAQsK,GAC7B,OAAOoP,GAAW1Z,EAAQopB,GAAappB,GAASsK,GAWlD,SAAS+e,GAAiBxhB,EAAQyhB,GAChC,OAAO,SAAS3f,EAAY7B,GAC1B,IAAIP,EAAOmM,GAAQ/J,GAAchC,GAAkB4R,GAC/CxR,EAAcuhB,EAAcA,IAAgB,GAEhD,OAAO/hB,EAAKoC,EAAY9B,EAAQmb,GAAYlb,EAAU,GAAIC,IAW9D,SAASwhB,GAAeC,GACtB,OAAOzF,IAAS,SAASzZ,EAAQmf,GAC/B,IAAIzhB,GAAS,EACTvW,EAASg4B,EAAQh4B,OACjB4oB,EAAa5oB,EAAS,EAAIg4B,EAAQh4B,EAAS,GAAKwJ,EAChDyuB,EAAQj4B,EAAS,EAAIg4B,EAAQ,GAAKxuB,EAEtCof,EAAcmP,EAAS/3B,OAAS,GAA0B,mBAAd4oB,GACvC5oB,IAAU4oB,GACXpf,EAEAyuB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDrP,EAAa5oB,EAAS,EAAIwJ,EAAYof,EACtC5oB,EAAS,GAEX6Y,EAAS7E,GAAO6E,GAChB,QAAStC,EAAQvW,EAAQ,CACvB,IAAIuO,EAASypB,EAAQzhB,GACjBhI,GACFwpB,EAASlf,EAAQtK,EAAQgI,EAAOqS,GAGpC,OAAO/P,KAYX,SAAS4R,GAAetS,EAAUI,GAChC,OAAO,SAASL,EAAY7B,GAC1B,GAAkB,MAAd6B,EACF,OAAOA,EAET,IAAKiY,GAAYjY,GACf,OAAOC,EAASD,EAAY7B,GAE9B,IAAIrW,EAASkY,EAAWlY,OACpBuW,EAAQgC,EAAYvY,GAAU,EAC9Bm4B,EAAWnkB,GAAOkE,GAEtB,MAAQK,EAAYhC,MAAYA,EAAQvW,EACtC,IAAmD,IAA/CqW,EAAS8hB,EAAS5hB,GAAQA,EAAO4hB,GACnC,MAGJ,OAAOjgB,GAWX,SAASuT,GAAclT,GACrB,OAAO,SAASM,EAAQxC,EAAUuT,GAChC,IAAIrT,GAAS,EACT4hB,EAAWnkB,GAAO6E,GAClBU,EAAQqQ,EAAS/Q,GACjB7Y,EAASuZ,EAAMvZ,OAEnB,MAAOA,IAAU,CACf,IAAIoY,EAAMmB,EAAMhB,EAAYvY,IAAWuW,GACvC,IAA+C,IAA3CF,EAAS8hB,EAAS/f,GAAMA,EAAK+f,GAC/B,MAGJ,OAAOtf,GAcX,SAASuf,GAAWtiB,EAAM6S,EAAS5S,GACjC,IAAIsiB,EAAS1P,EAAUre,EACnBguB,EAAOC,GAAWziB,GAEtB,SAAS0iB,IACP,IAAIC,EAAM53B,MAAQA,OAASsT,IAAQtT,gBAAgB23B,EAAWF,EAAOxiB,EACrE,OAAO2iB,EAAG5iB,MAAMwiB,EAAStiB,EAAUlV,KAAM63B,WAE3C,OAAOF,EAUT,SAASG,GAAgBC,GACvB,OAAO,SAAS9gB,GACdA,EAASsF,GAAStF,GAElB,IAAImC,EAAaU,GAAW7C,GACxBiE,GAAcjE,GACdtO,EAEAiR,EAAMR,EACNA,EAAW,GACXnC,EAAOmE,OAAO,GAEd4c,EAAW5e,EACXob,GAAUpb,EAAY,GAAG1H,KAAK,IAC9BuF,EAAOrR,MAAM,GAEjB,OAAOgU,EAAIme,KAAgBC,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAASjhB,GACd,OAAOP,GAAYyhB,GAAMC,GAAOnhB,GAAQ4B,QAAQ7G,GAAQ,KAAMkmB,EAAU,KAY5E,SAASR,GAAWD,GAClB,OAAO,WAIL,IAAItiB,EAAO0iB,UACX,OAAQ1iB,EAAKhW,QACX,KAAK,EAAG,OAAO,IAAIs4B,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKtiB,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIsiB,EAAKtiB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIkjB,EAAc7W,GAAWiW,EAAKvb,WAC9BjG,EAASwhB,EAAKziB,MAAMqjB,EAAaljB,GAIrC,OAAOuM,GAASzL,GAAUA,EAASoiB,GAavC,SAASC,GAAYrjB,EAAM6S,EAASyQ,GAClC,IAAId,EAAOC,GAAWziB,GAEtB,SAAS0iB,IACP,IAAIx4B,EAAS04B,UAAU14B,OACnBgW,EAAOoB,EAAMpX,GACbuW,EAAQvW,EACRqa,EAAcgf,GAAUb,GAE5B,MAAOjiB,IACLP,EAAKO,GAASmiB,UAAUniB,GAE1B,IAAIqgB,EAAW52B,EAAS,GAAKgW,EAAK,KAAOqE,GAAerE,EAAKhW,EAAS,KAAOqa,EACzE,GACAmB,GAAexF,EAAMqE,GAGzB,GADAra,GAAU42B,EAAQ52B,OACdA,EAASo5B,EACX,OAAOE,GACLxjB,EAAM6S,EAAS4Q,GAAcf,EAAQne,YAAa7Q,EAClDwM,EAAM4gB,EAASptB,EAAWA,EAAW4vB,EAAQp5B,GAEjD,IAAIy4B,EAAM53B,MAAQA,OAASsT,IAAQtT,gBAAgB23B,EAAWF,EAAOxiB,EACrE,OAAOD,GAAM4iB,EAAI53B,KAAMmV,GAEzB,OAAOwiB,EAUT,SAASgB,GAAWC,GAClB,OAAO,SAASvhB,EAAYvB,EAAW2B,GACrC,IAAI6f,EAAWnkB,GAAOkE,GACtB,IAAKiY,GAAYjY,GAAa,CAC5B,IAAI7B,EAAWkb,GAAY5a,EAAW,GACtCuB,EAAawF,GAAKxF,GAClBvB,EAAY,SAASyB,GAAO,OAAO/B,EAAS8hB,EAAS/f,GAAMA,EAAK+f,IAElE,IAAI5hB,EAAQkjB,EAAcvhB,EAAYvB,EAAW2B,GACjD,OAAO/B,GAAS,EAAI4hB,EAAS9hB,EAAW6B,EAAW3B,GAASA,GAAS/M,GAWzE,SAASkwB,GAAWnhB,GAClB,OAAOohB,IAAS,SAASC,GACvB,IAAI55B,EAAS45B,EAAM55B,OACfuW,EAAQvW,EACR65B,EAAS1X,GAAcpF,UAAU+c,KAEjCvhB,GACFqhB,EAAMhZ,UAER,MAAOrK,IAAS,CACd,IAAIT,EAAO8jB,EAAMrjB,GACjB,GAAmB,mBAART,EACT,MAAM,IAAI+G,GAAUjT,GAEtB,GAAIiwB,IAAWrB,GAAgC,WAArBuB,GAAYjkB,GACpC,IAAI0iB,EAAU,IAAIrW,GAAc,IAAI,GAGxC5L,EAAQiiB,EAAUjiB,EAAQvW,EAC1B,QAASuW,EAAQvW,EAAQ,CACvB8V,EAAO8jB,EAAMrjB,GAEb,IAAIyjB,EAAWD,GAAYjkB,GACvBhZ,EAAmB,WAAZk9B,EAAwBC,GAAQnkB,GAAQtM,EAMjDgvB,EAJE17B,GAAQo9B,GAAWp9B,EAAK,KACtBA,EAAK,KAAO+N,EAAgBJ,EAAkBE,EAAoBG,KACjEhO,EAAK,GAAGkD,QAAqB,GAAXlD,EAAK,GAElB07B,EAAQuB,GAAYj9B,EAAK,KAAK+Y,MAAM2iB,EAAS17B,EAAK,IAElC,GAAfgZ,EAAK9V,QAAek6B,GAAWpkB,GACtC0iB,EAAQwB,KACRxB,EAAQsB,KAAKhkB,GAGrB,OAAO,WACL,IAAIE,EAAO0iB,UACP7xB,EAAQmP,EAAK,GAEjB,GAAIwiB,GAA0B,GAAfxiB,EAAKhW,QAAeiiB,GAAQpb,GACzC,OAAO2xB,EAAQ2B,MAAMtzB,GAAOA,QAE9B,IAAI0P,EAAQ,EACRO,EAAS9W,EAAS45B,EAAMrjB,GAAOV,MAAMhV,KAAMmV,GAAQnP,EAEvD,QAAS0P,EAAQvW,EACf8W,EAAS8iB,EAAMrjB,GAAON,KAAKpV,KAAMiW,GAEnC,OAAOA,MAwBb,SAASyiB,GAAazjB,EAAM6S,EAAS5S,EAAS4gB,EAAUC,EAASwD,EAAeC,EAAcC,EAAQC,EAAKnB,GACzG,IAAIoB,EAAQ7R,EAAU9d,EAClBwtB,EAAS1P,EAAUre,EACnBmwB,EAAY9R,EAAUpe,EACtBssB,EAAYlO,GAAWle,EAAkBC,GACzCgwB,EAAS/R,EAAU5d,EACnButB,EAAOmC,EAAYjxB,EAAY+uB,GAAWziB,GAE9C,SAAS0iB,IACP,IAAIx4B,EAAS04B,UAAU14B,OACnBgW,EAAOoB,EAAMpX,GACbuW,EAAQvW,EAEZ,MAAOuW,IACLP,EAAKO,GAASmiB,UAAUniB,GAE1B,GAAIsgB,EACF,IAAIxc,EAAcgf,GAAUb,GACxBmC,EAAevgB,GAAapE,EAAMqE,GASxC,GAPIsc,IACF3gB,EAAO0gB,GAAY1gB,EAAM2gB,EAAUC,EAASC,IAE1CuD,IACFpkB,EAAOqhB,GAAiBrhB,EAAMokB,EAAeC,EAAcxD,IAE7D72B,GAAU26B,EACN9D,GAAa72B,EAASo5B,EAAO,CAC/B,IAAIwB,EAAapf,GAAexF,EAAMqE,GACtC,OAAOif,GACLxjB,EAAM6S,EAAS4Q,GAAcf,EAAQne,YAAatE,EAClDC,EAAM4kB,EAAYN,EAAQC,EAAKnB,EAAQp5B,GAG3C,IAAIk5B,EAAcb,EAAStiB,EAAUlV,KACjC43B,EAAKgC,EAAYvB,EAAYpjB,GAAQA,EAczC,OAZA9V,EAASgW,EAAKhW,OACVs6B,EACFtkB,EAAO6kB,GAAQ7kB,EAAMskB,GACZI,GAAU16B,EAAS,GAC5BgW,EAAK4K,UAEH4Z,GAASD,EAAMv6B,IACjBgW,EAAKhW,OAASu6B,GAEZ15B,MAAQA,OAASsT,IAAQtT,gBAAgB23B,IAC3CC,EAAKH,GAAQC,GAAWE,IAEnBA,EAAG5iB,MAAMqjB,EAAaljB,GAE/B,OAAOwiB,EAWT,SAASsC,GAAe1kB,EAAQ2kB,GAC9B,OAAO,SAASliB,EAAQxC,GACtB,OAAO8W,GAAatU,EAAQzC,EAAQ2kB,EAAW1kB,GAAW,KAY9D,SAAS2kB,GAAoBC,EAAUC,GACrC,OAAO,SAASr0B,EAAO0lB,GACrB,IAAIzV,EACJ,GAAIjQ,IAAU2C,GAAa+iB,IAAU/iB,EACnC,OAAO0xB,EAKT,GAHIr0B,IAAU2C,IACZsN,EAASjQ,GAEP0lB,IAAU/iB,EAAW,CACvB,GAAIsN,IAAWtN,EACb,OAAO+iB,EAEW,iBAAT1lB,GAAqC,iBAAT0lB,GACrC1lB,EAAQstB,GAAattB,GACrB0lB,EAAQ4H,GAAa5H,KAErB1lB,EAAQqtB,GAAartB,GACrB0lB,EAAQ2H,GAAa3H,IAEvBzV,EAASmkB,EAASp0B,EAAO0lB,GAE3B,OAAOzV,GAWX,SAASqkB,GAAWC,GAClB,OAAOzB,IAAS,SAAS1V,GAEvB,OADAA,EAAY9M,GAAS8M,EAAWtK,GAAU4X,OACnCe,IAAS,SAAStc,GACvB,IAAID,EAAUlV,KACd,OAAOu6B,EAAUnX,GAAW,SAAS5N,GACnC,OAAOR,GAAMQ,EAAUN,EAASC,YAexC,SAASqlB,GAAcr7B,EAAQs7B,GAC7BA,EAAQA,IAAU9xB,EAAY,IAAM2qB,GAAamH,GAEjD,IAAIC,EAAcD,EAAMt7B,OACxB,GAAIu7B,EAAc,EAChB,OAAOA,EAAclJ,GAAWiJ,EAAOt7B,GAAUs7B,EAEnD,IAAIxkB,EAASub,GAAWiJ,EAAO/b,GAAWvf,EAAS6b,GAAWyf,KAC9D,OAAO3gB,GAAW2gB,GACdjG,GAAUtZ,GAAcjF,GAAS,EAAG9W,GAAQuS,KAAK,IACjDuE,EAAOrQ,MAAM,EAAGzG,GAetB,SAASw7B,GAAc1lB,EAAM6S,EAAS5S,EAAS4gB,GAC7C,IAAI0B,EAAS1P,EAAUre,EACnBguB,EAAOC,GAAWziB,GAEtB,SAAS0iB,IACP,IAAI1B,GAAa,EACbC,EAAa2B,UAAU14B,OACvBi3B,GAAa,EACbC,EAAaP,EAAS32B,OACtBgW,EAAOoB,EAAM8f,EAAaH,GAC1B0B,EAAM53B,MAAQA,OAASsT,IAAQtT,gBAAgB23B,EAAWF,EAAOxiB,EAErE,QAASmhB,EAAYC,EACnBlhB,EAAKihB,GAAaN,EAASM,GAE7B,MAAOF,IACL/gB,EAAKihB,KAAeyB,YAAY5B,GAElC,OAAOjhB,GAAM4iB,EAAIJ,EAAStiB,EAAUlV,KAAMmV,GAE5C,OAAOwiB,EAUT,SAASiD,GAAYljB,GACnB,OAAO,SAASwL,EAAOC,EAAKoO,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB8F,GAAenU,EAAOC,EAAKoO,KAChEpO,EAAMoO,EAAO5oB,GAGfua,EAAQ2X,GAAS3X,GACbC,IAAQxa,GACVwa,EAAMD,EACNA,EAAQ,GAERC,EAAM0X,GAAS1X,GAEjBoO,EAAOA,IAAS5oB,EAAaua,EAAQC,EAAM,GAAK,EAAK0X,GAAStJ,GACvDD,GAAUpO,EAAOC,EAAKoO,EAAM7Z,IAWvC,SAASojB,GAA0BV,GACjC,OAAO,SAASp0B,EAAO0lB,GAKrB,MAJsB,iBAAT1lB,GAAqC,iBAAT0lB,IACvC1lB,EAAQ+0B,GAAS/0B,GACjB0lB,EAAQqP,GAASrP,IAEZ0O,EAASp0B,EAAO0lB,IAqB3B,SAAS+M,GAAcxjB,EAAM6S,EAASkT,EAAUxhB,EAAatE,EAAS4gB,EAAUC,EAAS0D,EAAQC,EAAKnB,GACpG,IAAI0C,EAAUnT,EAAUle,EACpBmwB,EAAakB,EAAUlF,EAAUptB,EACjCuyB,EAAkBD,EAAUtyB,EAAYotB,EACxCoF,EAAcF,EAAUnF,EAAWntB,EACnCyyB,EAAmBH,EAAUtyB,EAAYmtB,EAE7ChO,GAAYmT,EAAUnxB,EAAoBC,EAC1C+d,KAAamT,EAAUlxB,EAA0BD,GAE3Cge,EAAUne,IACdme,KAAare,EAAiBC,IAEhC,IAAI2xB,EAAU,CACZpmB,EAAM6S,EAAS5S,EAASimB,EAAapB,EAAYqB,EACjDF,EAAiBzB,EAAQC,EAAKnB,GAG5BtiB,EAAS+kB,EAAShmB,MAAMrM,EAAW0yB,GAKvC,OAJIhC,GAAWpkB,IACbqmB,GAAQrlB,EAAQolB,GAElBplB,EAAOuD,YAAcA,EACd+hB,GAAgBtlB,EAAQhB,EAAM6S,GAUvC,SAAS0T,GAAYzD,GACnB,IAAI9iB,EAAO6G,GAAKic,GAChB,OAAO,SAASrQ,EAAQ+T,GAGtB,GAFA/T,EAASqT,GAASrT,GAClB+T,EAAyB,MAAbA,EAAoB,EAAIjc,GAAU4K,GAAUqR,GAAY,KAChEA,GAAavc,GAAewI,GAAS,CAGvC,IAAIgU,GAAQnf,GAASmL,GAAU,KAAK5nB,MAAM,KACtCkG,EAAQiP,EAAKymB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAG7C,OADAC,GAAQnf,GAASvW,GAAS,KAAKlG,MAAM,OAC5B47B,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAEvC,OAAOxmB,EAAKyS,IAWhB,IAAI8L,GAAcrT,IAAQ,EAAIvF,GAAW,IAAIuF,GAAI,CAAC,EAAE,KAAK,IAAOzV,EAAmB,SAAS+L,GAC1F,OAAO,IAAI0J,GAAI1J,IAD2DklB,GAW5E,SAASC,GAAc7S,GACrB,OAAO,SAAS/Q,GACd,IAAIqQ,EAAMC,GAAOtQ,GACjB,OAAIqQ,GAAO1c,EACF2O,GAAWtC,GAEhBqQ,GAAOnc,GACF4O,GAAW9C,GAEbS,GAAYT,EAAQ+Q,EAAS/Q,KA6BxC,SAAS6jB,GAAW5mB,EAAM6S,EAAS5S,EAAS4gB,EAAUC,EAAS0D,EAAQC,EAAKnB,GAC1E,IAAIqB,EAAY9R,EAAUpe,EAC1B,IAAKkwB,GAA4B,mBAAR3kB,EACvB,MAAM,IAAI+G,GAAUjT,GAEtB,IAAI5J,EAAS22B,EAAWA,EAAS32B,OAAS,EAS1C,GARKA,IACH2oB,KAAahe,EAAoBC,GACjC+rB,EAAWC,EAAUptB,GAEvB+wB,EAAMA,IAAQ/wB,EAAY+wB,EAAMpa,GAAU8K,GAAUsP,GAAM,GAC1DnB,EAAQA,IAAU5vB,EAAY4vB,EAAQnO,GAAUmO,GAChDp5B,GAAU42B,EAAUA,EAAQ52B,OAAS,EAEjC2oB,EAAU/d,EAAyB,CACrC,IAAIwvB,EAAgBzD,EAChB0D,EAAezD,EAEnBD,EAAWC,EAAUptB,EAEvB,IAAI1M,EAAO29B,EAAYjxB,EAAYywB,GAAQnkB,GAEvComB,EAAU,CACZpmB,EAAM6S,EAAS5S,EAAS4gB,EAAUC,EAASwD,EAAeC,EAC1DC,EAAQC,EAAKnB,GAkBf,GAfIt8B,GACF6/B,GAAUT,EAASp/B,GAErBgZ,EAAOomB,EAAQ,GACfvT,EAAUuT,EAAQ,GAClBnmB,EAAUmmB,EAAQ,GAClBvF,EAAWuF,EAAQ,GACnBtF,EAAUsF,EAAQ,GAClB9C,EAAQ8C,EAAQ,GAAKA,EAAQ,KAAO1yB,EAC/BixB,EAAY,EAAI3kB,EAAK9V,OACtBmgB,GAAU+b,EAAQ,GAAKl8B,EAAQ,IAE9Bo5B,GAASzQ,GAAWle,EAAkBC,KACzCie,KAAale,EAAkBC,IAE5Bie,GAAWA,GAAWre,EAGzBwM,EADS6R,GAAWle,GAAmBke,GAAWje,EACzCyuB,GAAYrjB,EAAM6S,EAASyQ,GAC1BzQ,GAAWhe,GAAqBge,IAAYre,EAAiBK,IAAwBisB,EAAQ52B,OAG9Fu5B,GAAa1jB,MAAMrM,EAAW0yB,GAF9BV,GAAc1lB,EAAM6S,EAAS5S,EAAS4gB,QAJ/C,IAAI7f,EAASshB,GAAWtiB,EAAM6S,EAAS5S,GAQzC,IAAIK,EAAStZ,EAAO81B,GAAcuJ,GAClC,OAAOC,GAAgBhmB,EAAOU,EAAQolB,GAAUpmB,EAAM6S,GAexD,SAASiU,GAAuB/U,EAAUkH,EAAU3W,EAAKS,GACvD,OAAIgP,IAAare,GACZke,GAAGG,EAAU5K,GAAY7E,MAAUiF,GAAepH,KAAK4C,EAAQT,GAC3D2W,EAEFlH,EAiBT,SAASgV,GAAoBhV,EAAUkH,EAAU3W,EAAKS,EAAQtK,EAAQsa,GAOpE,OANItG,GAASsF,IAAatF,GAASwM,KAEjClG,EAAMnN,IAAIqT,EAAUlH,GACpB4I,GAAU5I,EAAUkH,EAAUvlB,EAAWqzB,GAAqBhU,GAC9DA,EAAM,UAAUkG,IAEXlH,EAYT,SAASiV,GAAgBj2B,GACvB,OAAOqqB,GAAcrqB,GAAS2C,EAAY3C,EAgB5C,SAASunB,GAAYjY,EAAOoW,EAAO5D,EAASC,EAAYgF,EAAW/E,GACjE,IAAIkU,EAAYpU,EAAUve,EACtBwZ,EAAYzN,EAAMnW,OAClB6sB,EAAYN,EAAMvsB,OAEtB,GAAI4jB,GAAaiJ,KAAekQ,GAAalQ,EAAYjJ,GACvD,OAAO,EAGT,IAAIoZ,EAAanU,EAAMjhB,IAAIuO,GACvB8mB,EAAapU,EAAMjhB,IAAI2kB,GAC3B,GAAIyQ,GAAcC,EAChB,OAAOD,GAAczQ,GAAS0Q,GAAc9mB,EAE9C,IAAII,GAAS,EACTO,GAAS,EACToW,EAAQvE,EAAUte,EAA0B,IAAI4b,GAAWzc,EAE/Dqf,EAAMnN,IAAIvF,EAAOoW,GACjB1D,EAAMnN,IAAI6Q,EAAOpW,GAGjB,QAASI,EAAQqN,EAAW,CAC1B,IAAIsZ,EAAW/mB,EAAMI,GACjB4mB,EAAW5Q,EAAMhW,GAErB,GAAIqS,EACF,IAAIwU,EAAWL,EACXnU,EAAWuU,EAAUD,EAAU3mB,EAAOgW,EAAOpW,EAAO0S,GACpDD,EAAWsU,EAAUC,EAAU5mB,EAAOJ,EAAOoW,EAAO1D,GAE1D,GAAIuU,IAAa5zB,EAAW,CAC1B,GAAI4zB,EACF,SAEFtmB,GAAS,EACT,MAGF,GAAIoW,GACF,IAAKxV,GAAU6U,GAAO,SAAS4Q,EAAUrQ,GACnC,IAAKjT,GAASqT,EAAMJ,KACfoQ,IAAaC,GAAYvP,EAAUsP,EAAUC,EAAUxU,EAASC,EAAYC,IAC/E,OAAOqE,EAAKhS,KAAK4R,MAEjB,CACNhW,GAAS,EACT,YAEG,GACDomB,IAAaC,IACXvP,EAAUsP,EAAUC,EAAUxU,EAASC,EAAYC,GACpD,CACL/R,GAAS,EACT,OAKJ,OAFA+R,EAAM,UAAU1S,GAChB0S,EAAM,UAAU0D,GACTzV,EAoBT,SAASuX,GAAWxV,EAAQ0T,EAAOrD,EAAKP,EAASC,EAAYgF,EAAW/E,GACtE,OAAQK,GACN,KAAK5b,GACH,GAAKuL,EAAO6c,YAAcnJ,EAAMmJ,YAC3B7c,EAAOgd,YAActJ,EAAMsJ,WAC9B,OAAO,EAEThd,EAASA,EAAOyc,OAChB/I,EAAQA,EAAM+I,OAEhB,KAAKjoB,GACH,QAAKwL,EAAO6c,YAAcnJ,EAAMmJ,aAC3B9H,EAAU,IAAI1P,GAAWrF,GAAS,IAAIqF,GAAWqO,KAKxD,KAAKrgB,EACL,KAAKC,EACL,KAAKM,GAGH,OAAOib,IAAI7O,GAAS0T,GAEtB,KAAKlgB,EACH,OAAOwM,EAAOwkB,MAAQ9Q,EAAM8Q,MAAQxkB,EAAOhW,SAAW0pB,EAAM1pB,QAE9D,KAAKiK,GACL,KAAKE,GAIH,OAAO6L,GAAW0T,EAAQ,GAE5B,KAAK/f,EACH,IAAI8wB,EAAUniB,GAEhB,KAAKpO,GACH,IAAIgwB,EAAYpU,EAAUve,EAG1B,GAFAkzB,IAAYA,EAAU7hB,IAElB5C,EAAOuC,MAAQmR,EAAMnR,OAAS2hB,EAChC,OAAO,EAGT,IAAIrT,EAAUb,EAAMjhB,IAAIiR,GACxB,GAAI6Q,EACF,OAAOA,GAAW6C,EAEpB5D,GAAWte,EAGXwe,EAAMnN,IAAI7C,EAAQ0T,GAClB,IAAIzV,EAASsX,GAAYkP,EAAQzkB,GAASykB,EAAQ/Q,GAAQ5D,EAASC,EAAYgF,EAAW/E,GAE1F,OADAA,EAAM,UAAUhQ,GACT/B,EAET,KAAK7J,GACH,GAAI2U,GACF,OAAOA,GAAc3L,KAAK4C,IAAW+I,GAAc3L,KAAKsW,GAG9D,OAAO,EAgBT,SAASmC,GAAa7V,EAAQ0T,EAAO5D,EAASC,EAAYgF,EAAW/E,GACnE,IAAIkU,EAAYpU,EAAUve,EACtBmzB,EAAWzT,GAAWjR,GACtB2kB,EAAYD,EAASv9B,OACrBy9B,EAAW3T,GAAWyC,GACtBM,EAAY4Q,EAASz9B,OAEzB,GAAIw9B,GAAa3Q,IAAckQ,EAC7B,OAAO,EAET,IAAIxmB,EAAQinB,EACZ,MAAOjnB,IAAS,CACd,IAAI6B,EAAMmlB,EAAShnB,GACnB,KAAMwmB,EAAY3kB,KAAOmU,EAAQlP,GAAepH,KAAKsW,EAAOnU,IAC1D,OAAO,EAIX,IAAIslB,EAAa7U,EAAMjhB,IAAIiR,GACvBokB,EAAapU,EAAMjhB,IAAI2kB,GAC3B,GAAImR,GAAcT,EAChB,OAAOS,GAAcnR,GAAS0Q,GAAcpkB,EAE9C,IAAI/B,GAAS,EACb+R,EAAMnN,IAAI7C,EAAQ0T,GAClB1D,EAAMnN,IAAI6Q,EAAO1T,GAEjB,IAAI8kB,EAAWZ,EACf,QAASxmB,EAAQinB,EAAW,CAC1BplB,EAAMmlB,EAAShnB,GACf,IAAIsR,EAAWhP,EAAOT,GAClB+kB,EAAW5Q,EAAMnU,GAErB,GAAIwQ,EACF,IAAIwU,EAAWL,EACXnU,EAAWuU,EAAUtV,EAAUzP,EAAKmU,EAAO1T,EAAQgQ,GACnDD,EAAWf,EAAUsV,EAAU/kB,EAAKS,EAAQ0T,EAAO1D,GAGzD,KAAMuU,IAAa5zB,EACVqe,IAAasV,GAAYvP,EAAU/F,EAAUsV,EAAUxU,EAASC,EAAYC,GAC7EuU,GACD,CACLtmB,GAAS,EACT,MAEF6mB,IAAaA,EAAkB,eAAPvlB,GAE1B,GAAItB,IAAW6mB,EAAU,CACvB,IAAIC,EAAU/kB,EAAO2R,YACjBqT,EAAUtR,EAAM/B,YAGhBoT,GAAWC,KACV,gBAAiBhlB,MAAU,gBAAiB0T,IACzB,mBAAXqR,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD/mB,GAAS,GAKb,OAFA+R,EAAM,UAAUhQ,GAChBgQ,EAAM,UAAU0D,GACTzV,EAUT,SAAS6iB,GAAS7jB,GAChB,OAAOyc,GAAYC,GAAS1c,EAAMtM,EAAWs0B,IAAUhoB,EAAO,IAUhE,SAASgU,GAAWjR,GAClB,OAAOoT,GAAepT,EAAQ6E,GAAMga,IAWtC,SAAS7N,GAAahR,GACpB,OAAOoT,GAAepT,EAAQsP,GAAQwP,IAUxC,IAAIsC,GAAW9Y,GAAiB,SAASrL,GACvC,OAAOqL,GAAQvZ,IAAIkO,IADI0mB,GAWzB,SAASzC,GAAYjkB,GACnB,IAAIgB,EAAUhB,EAAKunB,KAAO,GACtBlnB,EAAQiL,GAAUtK,GAClB9W,EAASqd,GAAepH,KAAKmL,GAAWtK,GAAUX,EAAMnW,OAAS,EAErE,MAAOA,IAAU,CACf,IAAIlD,EAAOqZ,EAAMnW,GACb+9B,EAAYjhC,EAAKgZ,KACrB,GAAiB,MAAbioB,GAAqBA,GAAajoB,EACpC,OAAOhZ,EAAKugC,KAGhB,OAAOvmB,EAUT,SAASuiB,GAAUvjB,GACjB,IAAI+C,EAASwE,GAAepH,KAAK8L,GAAQ,eAAiBA,GAASjM,EACnE,OAAO+C,EAAOwB,YAchB,SAASkX,KACP,IAAIza,EAASiL,GAAO1L,UAAYA,GAEhC,OADAS,EAASA,IAAWT,GAAWkZ,GAAezY,EACvC4hB,UAAU14B,OAAS8W,EAAO4hB,UAAU,GAAIA,UAAU,IAAM5hB,EAWjE,SAAS+O,GAAWjd,EAAKwP,GACvB,IAAItb,EAAO8L,EAAIic,SACf,OAAOmZ,GAAU5lB,GACbtb,EAAmB,iBAAPsb,EAAkB,SAAW,QACzCtb,EAAK8L,IAUX,SAASwnB,GAAavX,GACpB,IAAI/B,EAAS4G,GAAK7E,GACd7Y,EAAS8W,EAAO9W,OAEpB,MAAOA,IAAU,CACf,IAAIoY,EAAMtB,EAAO9W,GACb6G,EAAQgS,EAAOT,GAEnBtB,EAAO9W,GAAU,CAACoY,EAAKvR,EAAO0pB,GAAmB1pB,IAEnD,OAAOiQ,EAWT,SAASkI,GAAUnG,EAAQT,GACzB,IAAIvR,EAAQ6T,GAAS7B,EAAQT,GAC7B,OAAO4W,GAAanoB,GAASA,EAAQ2C,EAUvC,SAAS4iB,GAAUvlB,GACjB,IAAIo3B,EAAQ5gB,GAAepH,KAAKpP,EAAOgY,IACnCqK,EAAMriB,EAAMgY,IAEhB,IACEhY,EAAMgY,IAAkBrV,EACxB,IAAI00B,GAAW,EACf,MAAOj2B,IAET,IAAI6O,EAAS8G,GAAqB3H,KAAKpP,GAQvC,OAPIq3B,IACED,EACFp3B,EAAMgY,IAAkBqK,SAEjBriB,EAAMgY,KAGV/H,EAUT,IAAI4gB,GAAc/X,GAA+B,SAAS9G,GACxD,OAAc,MAAVA,EACK,IAETA,EAAS7E,GAAO6E,GACTjC,GAAY+I,GAAiB9G,IAAS,SAASod,GACpD,OAAOzX,GAAqBvI,KAAK4C,EAAQod,QANRkI,GAiBjCxG,GAAgBhY,GAA+B,SAAS9G,GAC1D,IAAI/B,EAAS,GACb,MAAO+B,EACLxB,GAAUP,EAAQ4gB,GAAW7e,IAC7BA,EAASuF,GAAavF,GAExB,OAAO/B,GAN8BqnB,GAgBnChV,GAASgD,GAoCb,SAASrI,GAAQC,EAAOC,EAAKoa,GAC3B,IAAI7nB,GAAS,EACTvW,EAASo+B,EAAWp+B,OAExB,QAASuW,EAAQvW,EAAQ,CACvB,IAAIlD,EAAOshC,EAAW7nB,GAClB6E,EAAOte,EAAKse,KAEhB,OAAQte,EAAKkG,MACX,IAAK,OAAa+gB,GAAS3I,EAAM,MACjC,IAAK,YAAa4I,GAAO5I,EAAM,MAC/B,IAAK,OAAa4I,EAAM3D,GAAU2D,EAAKD,EAAQ3I,GAAO,MACtD,IAAK,YAAa2I,EAAQ5D,GAAU4D,EAAOC,EAAM5I,GAAO,OAG5D,MAAO,CAAE,MAAS2I,EAAO,IAAOC,GAUlC,SAASqa,GAAe9vB,GACtB,IAAIyJ,EAAQzJ,EAAOyJ,MAAM5I,IACzB,OAAO4I,EAAQA,EAAM,GAAGrX,MAAM0O,IAAkB,GAYlD,SAASivB,GAAQzlB,EAAQiT,EAAMyS,GAC7BzS,EAAOC,GAASD,EAAMjT,GAEtB,IAAItC,GAAS,EACTvW,EAAS8rB,EAAK9rB,OACd8W,GAAS,EAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAIoY,EAAM4T,GAAMF,EAAKvV,IACrB,KAAMO,EAAmB,MAAV+B,GAAkB0lB,EAAQ1lB,EAAQT,IAC/C,MAEFS,EAASA,EAAOT,GAElB,OAAItB,KAAYP,GAASvW,EAChB8W,GAET9W,EAAmB,MAAV6Y,EAAiB,EAAIA,EAAO7Y,SAC5BA,GAAUsvB,GAAStvB,IAAWknB,GAAQ9O,EAAKpY,KACjDiiB,GAAQpJ,IAAWiO,GAAYjO,KAUpC,SAASoQ,GAAe9S,GACtB,IAAInW,EAASmW,EAAMnW,OACf8W,EAAS,IAAIX,EAAMqU,YAAYxqB,GAOnC,OAJIA,GAA6B,iBAAZmW,EAAM,IAAkBkH,GAAepH,KAAKE,EAAO,WACtEW,EAAOP,MAAQJ,EAAMI,MACrBO,EAAO0nB,MAAQroB,EAAMqoB,OAEhB1nB,EAUT,SAASwS,GAAgBzQ,GACvB,MAAqC,mBAAtBA,EAAO2R,aAA8BqF,GAAYhX,GAE5D,GADAwJ,GAAWjE,GAAavF,IAgB9B,SAAS4Q,GAAe5Q,EAAQqQ,EAAKJ,GACnC,IAAIwP,EAAOzf,EAAO2R,YAClB,OAAQtB,GACN,KAAK7b,GACH,OAAOmoB,GAAiB3c,GAE1B,KAAK3M,EACL,KAAKC,EACH,OAAO,IAAImsB,GAAMzf,GAEnB,KAAKvL,GACH,OAAOqoB,GAAc9c,EAAQiQ,GAE/B,KAAKvb,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOkjB,GAAgBpY,EAAQiQ,GAEjC,KAAKtc,EACH,OAAO,IAAI8rB,EAEb,KAAK7rB,GACL,KAAKO,GACH,OAAO,IAAIsrB,EAAKzf,GAElB,KAAK/L,GACH,OAAOgpB,GAAYjd,GAErB,KAAK9L,GACH,OAAO,IAAIurB,EAEb,KAAKrrB,GACH,OAAO+oB,GAAYnd,IAYzB,SAAS4lB,GAAkBlwB,EAAQmwB,GACjC,IAAI1+B,EAAS0+B,EAAQ1+B,OACrB,IAAKA,EACH,OAAOuO,EAET,IAAI4N,EAAYnc,EAAS,EAGzB,OAFA0+B,EAAQviB,IAAcnc,EAAS,EAAI,KAAO,IAAM0+B,EAAQviB,GACxDuiB,EAAUA,EAAQnsB,KAAKvS,EAAS,EAAI,KAAO,KACpCuO,EAAOmL,QAAQvK,GAAe,uBAAyBuvB,EAAU,UAU1E,SAASnT,GAAc1kB,GACrB,OAAOob,GAAQpb,IAAUigB,GAAYjgB,OAChC6X,IAAoB7X,GAASA,EAAM6X,KAW1C,SAASwI,GAAQrgB,EAAO7G,GACtB,IAAIgD,SAAc6D,EAGlB,OAFA7G,EAAmB,MAAVA,EAAiBwL,EAAmBxL,IAEpCA,IACE,UAARgD,GACU,UAARA,GAAoB+M,GAAS6K,KAAK/T,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ7G,EAajD,SAASk4B,GAAerxB,EAAO0P,EAAOsC,GACpC,IAAK0J,GAAS1J,GACZ,OAAO,EAET,IAAI7V,SAAcuT,EAClB,SAAY,UAARvT,EACKmtB,GAAYtX,IAAWqO,GAAQ3Q,EAAOsC,EAAO7Y,QACrC,UAARgD,GAAoBuT,KAASsC,IAE7B6O,GAAG7O,EAAOtC,GAAQ1P,GAa7B,SAASypB,GAAMzpB,EAAOgS,GACpB,GAAIoJ,GAAQpb,GACV,OAAO,EAET,IAAI7D,SAAc6D,EAClB,QAAY,UAAR7D,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAT6D,IAAiBkkB,GAASlkB,MAGvBgI,GAAc+L,KAAK/T,KAAW+H,GAAagM,KAAK/T,IAC1C,MAAVgS,GAAkBhS,KAASmN,GAAO6E,IAUvC,SAASmlB,GAAUn3B,GACjB,IAAI7D,SAAc6D,EAClB,MAAgB,UAAR7D,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV6D,EACU,OAAVA,EAWP,SAASqzB,GAAWpkB,GAClB,IAAIkkB,EAAWD,GAAYjkB,GACvByW,EAAQxK,GAAOiY,GAEnB,GAAoB,mBAATzN,KAAyByN,KAAY9X,GAAYnF,WAC1D,OAAO,EAET,GAAIjH,IAASyW,EACX,OAAO,EAET,IAAIzvB,EAAOm9B,GAAQ1N,GACnB,QAASzvB,GAAQgZ,IAAShZ,EAAK,GAUjC,SAASmyB,GAASnZ,GAChB,QAASyH,IAAeA,MAAczH,GAxTnC+K,IAAYsI,GAAO,IAAItI,GAAS,IAAI8d,YAAY,MAAQrxB,IACxDwT,IAAOqI,GAAO,IAAIrI,KAAQtU,GAC1BuU,IAAWoI,GAAOpI,GAAQ6d,YAAchyB,IACxCoU,IAAOmI,GAAO,IAAInI,KAAQjU,IAC1BkU,IAAWkI,GAAO,IAAIlI,KAAY9T,MACrCgc,GAAS,SAAStiB,GAChB,IAAIiQ,EAASqV,GAAWtlB,GACpByxB,EAAOxhB,GAAUnK,GAAY9F,EAAM2jB,YAAchhB,EACjDq1B,EAAavG,EAAOhX,GAASgX,GAAQ,GAEzC,GAAIuG,EACF,OAAQA,GACN,KAAKxd,GAAoB,OAAO/T,GAChC,KAAKiU,GAAe,OAAO/U,EAC3B,KAAKgV,GAAmB,OAAO5U,GAC/B,KAAK6U,GAAe,OAAO1U,GAC3B,KAAK2U,GAAmB,OAAOvU,GAGnC,OAAO2J,IA+SX,IAAIgoB,GAAa5hB,GAAa0O,GAAamT,GAS3C,SAASlP,GAAYhpB,GACnB,IAAIyxB,EAAOzxB,GAASA,EAAM2jB,YACtBlI,EAAwB,mBAARgW,GAAsBA,EAAKvb,WAAcE,GAE7D,OAAOpW,IAAUyb,EAWnB,SAASiO,GAAmB1pB,GAC1B,OAAOA,IAAUA,IAAU0b,GAAS1b,GAYtC,SAASwpB,GAAwBjY,EAAK2W,GACpC,OAAO,SAASlW,GACd,OAAc,MAAVA,IAGGA,EAAOT,KAAS2W,IACpBA,IAAavlB,GAAc4O,KAAOpE,GAAO6E,MAYhD,SAASmmB,GAAclpB,GACrB,IAAIgB,EAASmoB,GAAQnpB,GAAM,SAASsC,GAIlC,OAHI0B,EAAMsB,OAASrR,GACjB+P,EAAM4K,QAEDtM,KAGL0B,EAAQhD,EAAOgD,MACnB,OAAOhD,EAmBT,SAAS6lB,GAAU7/B,EAAMyR,GACvB,IAAIoa,EAAU7rB,EAAK,GACfoiC,EAAa3wB,EAAO,GACpB4wB,EAAaxW,EAAUuW,EACvB9U,EAAW+U,GAAc70B,EAAiBC,EAAqBM,GAE/Du0B,EACAF,GAAcr0B,GAAmB8d,GAAWle,GAC5Cy0B,GAAcr0B,GAAmB8d,GAAW7d,GAAqBhO,EAAK,GAAGkD,QAAUuO,EAAO,IAC1F2wB,IAAer0B,EAAgBC,IAAsByD,EAAO,GAAGvO,QAAUuO,EAAO,IAAQoa,GAAWle,EAGvG,IAAM2f,IAAYgV,EAChB,OAAOtiC,EAGLoiC,EAAa50B,IACfxN,EAAK,GAAKyR,EAAO,GAEjB4wB,GAAcxW,EAAUre,EAAiB,EAAIE,GAG/C,IAAI3D,EAAQ0H,EAAO,GACnB,GAAI1H,EAAO,CACT,IAAI8vB,EAAW75B,EAAK,GACpBA,EAAK,GAAK65B,EAAWD,GAAYC,EAAU9vB,EAAO0H,EAAO,IAAM1H,EAC/D/J,EAAK,GAAK65B,EAAWnb,GAAe1e,EAAK,GAAIkN,GAAeuE,EAAO,GA0BrE,OAvBA1H,EAAQ0H,EAAO,GACX1H,IACF8vB,EAAW75B,EAAK,GAChBA,EAAK,GAAK65B,EAAWU,GAAiBV,EAAU9vB,EAAO0H,EAAO,IAAM1H,EACpE/J,EAAK,GAAK65B,EAAWnb,GAAe1e,EAAK,GAAIkN,GAAeuE,EAAO,IAGrE1H,EAAQ0H,EAAO,GACX1H,IACF/J,EAAK,GAAK+J,GAGRq4B,EAAar0B,IACf/N,EAAK,GAAgB,MAAXA,EAAK,GAAayR,EAAO,GAAK8R,GAAUvjB,EAAK,GAAIyR,EAAO,KAGrD,MAAXzR,EAAK,KACPA,EAAK,GAAKyR,EAAO,IAGnBzR,EAAK,GAAKyR,EAAO,GACjBzR,EAAK,GAAKqiC,EAEHriC,EAYT,SAASizB,GAAalX,GACpB,IAAI/B,EAAS,GACb,GAAc,MAAV+B,EACF,IAAK,IAAIT,KAAOpE,GAAO6E,GACrB/B,EAAOoE,KAAK9C,GAGhB,OAAOtB,EAUT,SAASuV,GAAexlB,GACtB,OAAO+W,GAAqB3H,KAAKpP,GAYnC,SAAS2rB,GAAS1c,EAAMiO,EAAOzI,GAE7B,OADAyI,EAAQ5D,GAAU4D,IAAUva,EAAasM,EAAK9V,OAAS,EAAK+jB,EAAO,GAC5D,WACL,IAAI/N,EAAO0iB,UACPniB,GAAS,EACTvW,EAASmgB,GAAUnK,EAAKhW,OAAS+jB,EAAO,GACxC5N,EAAQiB,EAAMpX,GAElB,QAASuW,EAAQvW,EACfmW,EAAMI,GAASP,EAAK+N,EAAQxN,GAE9BA,GAAS,EACT,IAAI8oB,EAAYjoB,EAAM2M,EAAQ,GAC9B,QAASxN,EAAQwN,EACfsb,EAAU9oB,GAASP,EAAKO,GAG1B,OADA8oB,EAAUtb,GAASzI,EAAUnF,GACtBN,GAAMC,EAAMjV,KAAMw+B,IAY7B,SAAShS,GAAOxU,EAAQiT,GACtB,OAAOA,EAAK9rB,OAAS,EAAI6Y,EAASgT,GAAQhT,EAAQma,GAAUlH,EAAM,GAAI,IAaxE,SAAS+O,GAAQ1kB,EAAO6b,GACtB,IAAIpO,EAAYzN,EAAMnW,OAClBA,EAASqgB,GAAU2R,EAAQhyB,OAAQ4jB,GACnC0b,EAAWjc,GAAUlN,GAEzB,MAAOnW,IAAU,CACf,IAAIuW,EAAQyb,EAAQhyB,GACpBmW,EAAMnW,GAAUknB,GAAQ3Q,EAAOqN,GAAa0b,EAAS/oB,GAAS/M,EAEhE,OAAO2M,EAWT,SAAS0a,GAAQhY,EAAQT,GACvB,IAAY,gBAARA,GAAgD,oBAAhBS,EAAOT,KAIhC,aAAPA,EAIJ,OAAOS,EAAOT,GAiBhB,IAAI+jB,GAAUoD,GAAS3M,IAUnBtT,GAAaD,IAAiB,SAASvJ,EAAMoU,GAC/C,OAAO/V,GAAKmL,WAAWxJ,EAAMoU,IAW3BqI,GAAcgN,GAAS1M,IAY3B,SAASuJ,GAAgB5D,EAASgH,EAAW7W,GAC3C,IAAIpa,EAAUixB,EAAY,GAC1B,OAAOjN,GAAYiG,EAASiG,GAAkBlwB,EAAQkxB,GAAkBpB,GAAe9vB,GAASoa,KAYlG,SAAS4W,GAASzpB,GAChB,IAAI4pB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQrf,KACRsf,EAAY10B,GAAYy0B,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAASx0B,EACb,OAAOwtB,UAAU,QAGnBgH,EAAQ,EAEV,OAAO5pB,EAAKD,MAAMrM,EAAWkvB,YAYjC,SAASpR,GAAYnR,EAAOiF,GAC1B,IAAI7E,GAAS,EACTvW,EAASmW,EAAMnW,OACfmc,EAAYnc,EAAS,EAEzBob,EAAOA,IAAS5R,EAAYxJ,EAASob,EACrC,QAAS7E,EAAQ6E,EAAM,CACrB,IAAI0kB,EAAO1Y,GAAW7Q,EAAO4F,GACzBtV,EAAQsP,EAAM2pB,GAElB3pB,EAAM2pB,GAAQ3pB,EAAMI,GACpBJ,EAAMI,GAAS1P,EAGjB,OADAsP,EAAMnW,OAASob,EACRjF,EAUT,IAAIgf,GAAe6J,IAAc,SAASlnB,GACxC,IAAIhB,EAAS,GAOb,OAN6B,KAAzBgB,EAAOioB,WAAW,IACpBjpB,EAAOoE,KAAK,IAEdpD,EAAO4B,QAAQ5K,IAAY,SAASkJ,EAAOuQ,EAAQyX,EAAOC,GACxDnpB,EAAOoE,KAAK8kB,EAAQC,EAAUvmB,QAAQlK,GAAc,MAAS+Y,GAAUvQ,MAElElB,KAUT,SAASkV,GAAMnlB,GACb,GAAoB,iBAATA,GAAqBkkB,GAASlkB,GACvC,OAAOA,EAET,IAAIiQ,EAAUjQ,EAAQ,GACtB,MAAkB,KAAViQ,GAAkB,EAAIjQ,IAAW0E,EAAY,KAAOuL,EAU9D,SAASwK,GAASxL,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOqH,GAAalH,KAAKH,GACzB,MAAO7N,IACT,IACE,OAAQ6N,EAAO,GACf,MAAO7N,KAEX,MAAO,GAWT,SAASw3B,GAAkBf,EAAS/V,GAOlC,OANAnS,GAAU1K,GAAW,SAASywB,GAC5B,IAAI11B,EAAQ,KAAO01B,EAAK,GACnB5T,EAAU4T,EAAK,KAAQxlB,GAAc2nB,EAAS73B,IACjD63B,EAAQxjB,KAAKrU,MAGV63B,EAAQxlB,OAUjB,SAASkJ,GAAaoW,GACpB,GAAIA,aAAmBtW,GACrB,OAAOsW,EAAQjV,QAEjB,IAAIzM,EAAS,IAAIqL,GAAcqW,EAAQ9V,YAAa8V,EAAQ5V,WAI5D,OAHA9L,EAAO6L,YAAcU,GAAUmV,EAAQ7V,aACvC7L,EAAO+L,UAAa2V,EAAQ3V,UAC5B/L,EAAOgM,WAAa0V,EAAQ1V,WACrBhM,EA0BT,SAASopB,GAAM/pB,EAAOiF,EAAM6c,GAExB7c,GADG6c,EAAQC,GAAe/hB,EAAOiF,EAAM6c,GAAS7c,IAAS5R,GAClD,EAEA2W,GAAU8K,GAAU7P,GAAO,GAEpC,IAAIpb,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,IAAKA,GAAUob,EAAO,EACpB,MAAO,GAET,IAAI7E,EAAQ,EACRM,EAAW,EACXC,EAASM,EAAMmI,GAAWvf,EAASob,IAEvC,MAAO7E,EAAQvW,EACb8W,EAAOD,KAAcmc,GAAU7c,EAAOI,EAAQA,GAAS6E,GAEzD,OAAOtE,EAkBT,SAASqpB,GAAQhqB,GACf,IAAII,GAAS,EACTvW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACnC6W,EAAW,EACXC,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACd1P,IACFiQ,EAAOD,KAAchQ,GAGzB,OAAOiQ,EAyBT,SAASspB,KACP,IAAIpgC,EAAS04B,UAAU14B,OACvB,IAAKA,EACH,MAAO,GAET,IAAIgW,EAAOoB,EAAMpX,EAAS,GACtBmW,EAAQuiB,UAAU,GAClBniB,EAAQvW,EAEZ,MAAOuW,IACLP,EAAKO,EAAQ,GAAKmiB,UAAUniB,GAE9B,OAAOc,GAAU4K,GAAQ9L,GAASkN,GAAUlN,GAAS,CAACA,GAAQiV,GAAYpV,EAAM,IAwBlF,IAAIqqB,GAAa/N,IAAS,SAASnc,EAAOmB,GACxC,OAAO0Z,GAAkB7a,GACrBgU,GAAehU,EAAOiV,GAAY9T,EAAQ,EAAG0Z,IAAmB,IAChE,MA6BFsP,GAAehO,IAAS,SAASnc,EAAOmB,GAC1C,IAAIjB,EAAWiX,GAAKhW,GAIpB,OAHI0Z,GAAkB3a,KACpBA,EAAW7M,GAENwnB,GAAkB7a,GACrBgU,GAAehU,EAAOiV,GAAY9T,EAAQ,EAAG0Z,IAAmB,GAAOO,GAAYlb,EAAU,IAC7F,MA0BFkqB,GAAiBjO,IAAS,SAASnc,EAAOmB,GAC5C,IAAIJ,EAAaoW,GAAKhW,GAItB,OAHI0Z,GAAkB9Z,KACpBA,EAAa1N,GAERwnB,GAAkB7a,GACrBgU,GAAehU,EAAOiV,GAAY9T,EAAQ,EAAG0Z,IAAmB,GAAOxnB,EAAW0N,GAClF,MA4BN,SAASspB,GAAKrqB,EAAOkD,EAAG4e,GACtB,IAAIj4B,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGLqZ,EAAK4e,GAAS5e,IAAM7P,EAAa,EAAIyhB,GAAU5R,GACxC2Z,GAAU7c,EAAOkD,EAAI,EAAI,EAAIA,EAAGrZ,IAH9B,GA+BX,SAASygC,GAAUtqB,EAAOkD,EAAG4e,GAC3B,IAAIj4B,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGLqZ,EAAK4e,GAAS5e,IAAM7P,EAAa,EAAIyhB,GAAU5R,GAC/CA,EAAIrZ,EAASqZ,EACN2Z,GAAU7c,EAAO,EAAGkD,EAAI,EAAI,EAAIA,IAJ9B,GA0CX,SAASqnB,GAAevqB,EAAOQ,GAC7B,OAAQR,GAASA,EAAMnW,OACnBy0B,GAAUte,EAAOob,GAAY5a,EAAW,IAAI,GAAM,GAClD,GAsCN,SAASgqB,GAAUxqB,EAAOQ,GACxB,OAAQR,GAASA,EAAMnW,OACnBy0B,GAAUte,EAAOob,GAAY5a,EAAW,IAAI,GAC5C,GAgCN,SAASiqB,GAAKzqB,EAAOtP,EAAOkd,EAAOC,GACjC,IAAIhkB,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGD+jB,GAAyB,iBAATA,GAAqBmU,GAAe/hB,EAAOtP,EAAOkd,KACpEA,EAAQ,EACRC,EAAMhkB,GAEDgrB,GAAS7U,EAAOtP,EAAOkd,EAAOC,IAN5B,GA4CX,SAAS6c,GAAU1qB,EAAOQ,EAAW2B,GACnC,IAAItY,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuW,EAAqB,MAAb+B,EAAoB,EAAI2S,GAAU3S,GAI9C,OAHI/B,EAAQ,IACVA,EAAQ4J,GAAUngB,EAASuW,EAAO,IAE7B8B,GAAclC,EAAOob,GAAY5a,EAAW,GAAIJ,GAsCzD,SAASuqB,GAAc3qB,EAAOQ,EAAW2B,GACvC,IAAItY,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuW,EAAQvW,EAAS,EAOrB,OANIsY,IAAc9O,IAChB+M,EAAQ0U,GAAU3S,GAClB/B,EAAQ+B,EAAY,EAChB6H,GAAUngB,EAASuW,EAAO,GAC1B8J,GAAU9J,EAAOvW,EAAS,IAEzBqY,GAAclC,EAAOob,GAAY5a,EAAW,GAAIJ,GAAO,GAiBhE,SAASunB,GAAQ3nB,GACf,IAAInW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAASorB,GAAYjV,EAAO,GAAK,GAiB1C,SAAS4qB,GAAY5qB,GACnB,IAAInW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAASorB,GAAYjV,EAAO5K,GAAY,GAuBjD,SAASy1B,GAAa7qB,EAAOkV,GAC3B,IAAIrrB,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGLqrB,EAAQA,IAAU7hB,EAAY,EAAIyhB,GAAUI,GACrCD,GAAYjV,EAAOkV,IAHjB,GAqBX,SAAS4V,GAAUva,GACjB,IAAInQ,GAAS,EACTvW,EAAkB,MAAT0mB,EAAgB,EAAIA,EAAM1mB,OACnC8W,EAAS,GAEb,QAASP,EAAQvW,EAAQ,CACvB,IAAIu8B,EAAO7V,EAAMnQ,GACjBO,EAAOylB,EAAK,IAAMA,EAAK,GAEzB,OAAOzlB,EAqBT,SAASoqB,GAAK/qB,GACZ,OAAQA,GAASA,EAAMnW,OAAUmW,EAAM,GAAK3M,EA0B9C,SAAS5I,GAAQuV,EAAOtP,EAAOyR,GAC7B,IAAItY,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuW,EAAqB,MAAb+B,EAAoB,EAAI2S,GAAU3S,GAI9C,OAHI/B,EAAQ,IACVA,EAAQ4J,GAAUngB,EAASuW,EAAO,IAE7BS,GAAYb,EAAOtP,EAAO0P,GAiBnC,SAAS4qB,GAAQhrB,GACf,IAAInW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAASgzB,GAAU7c,EAAO,GAAI,GAAK,GAoB5C,IAAIirB,GAAe9O,IAAS,SAAS1F,GACnC,IAAIyU,EAASlqB,GAASyV,EAAQqI,IAC9B,OAAQoM,EAAOrhC,QAAUqhC,EAAO,KAAOzU,EAAO,GAC1CD,GAAiB0U,GACjB,MA0BFC,GAAiBhP,IAAS,SAAS1F,GACrC,IAAIvW,EAAWiX,GAAKV,GAChByU,EAASlqB,GAASyV,EAAQqI,IAO9B,OALI5e,IAAaiX,GAAK+T,GACpBhrB,EAAW7M,EAEX63B,EAAO/b,MAED+b,EAAOrhC,QAAUqhC,EAAO,KAAOzU,EAAO,GAC1CD,GAAiB0U,EAAQ9P,GAAYlb,EAAU,IAC/C,MAwBFkrB,GAAmBjP,IAAS,SAAS1F,GACvC,IAAI1V,EAAaoW,GAAKV,GAClByU,EAASlqB,GAASyV,EAAQqI,IAM9B,OAJA/d,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACxD0N,GACFmqB,EAAO/b,MAED+b,EAAOrhC,QAAUqhC,EAAO,KAAOzU,EAAO,GAC1CD,GAAiB0U,EAAQ73B,EAAW0N,GACpC,MAkBN,SAAS3E,GAAK4D,EAAOqrB,GACnB,OAAgB,MAATrrB,EAAgB,GAAK8J,GAAWhK,KAAKE,EAAOqrB,GAiBrD,SAASlU,GAAKnX,GACZ,IAAInW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAASmW,EAAMnW,EAAS,GAAKwJ,EAwBtC,SAASi4B,GAAYtrB,EAAOtP,EAAOyR,GACjC,IAAItY,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIuW,EAAQvW,EAKZ,OAJIsY,IAAc9O,IAChB+M,EAAQ0U,GAAU3S,GAClB/B,EAAQA,EAAQ,EAAI4J,GAAUngB,EAASuW,EAAO,GAAK8J,GAAU9J,EAAOvW,EAAS,IAExE6G,IAAUA,EACb+U,GAAkBzF,EAAOtP,EAAO0P,GAChC8B,GAAclC,EAAOsC,GAAWlC,GAAO,GAwB7C,SAASmrB,GAAIvrB,EAAOkD,GAClB,OAAQlD,GAASA,EAAMnW,OAAUoxB,GAAQjb,EAAO8U,GAAU5R,IAAM7P,EA0BlE,IAAIm4B,GAAOrP,GAASsP,IAsBpB,SAASA,GAAQzrB,EAAOmB,GACtB,OAAQnB,GAASA,EAAMnW,QAAUsX,GAAUA,EAAOtX,OAC9C8xB,GAAY3b,EAAOmB,GACnBnB,EA0BN,SAAS0rB,GAAU1rB,EAAOmB,EAAQjB,GAChC,OAAQF,GAASA,EAAMnW,QAAUsX,GAAUA,EAAOtX,OAC9C8xB,GAAY3b,EAAOmB,EAAQia,GAAYlb,EAAU,IACjDF,EA0BN,SAAS2rB,GAAY3rB,EAAOmB,EAAQJ,GAClC,OAAQf,GAASA,EAAMnW,QAAUsX,GAAUA,EAAOtX,OAC9C8xB,GAAY3b,EAAOmB,EAAQ9N,EAAW0N,GACtCf,EA2BN,IAAI4rB,GAASpI,IAAS,SAASxjB,EAAO6b,GACpC,IAAIhyB,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACnC8W,EAASsR,GAAOjS,EAAO6b,GAM3B,OAJAD,GAAW5b,EAAOgB,GAAS6a,GAAS,SAASzb,GAC3C,OAAO2Q,GAAQ3Q,EAAOvW,IAAWuW,EAAQA,KACxC2C,KAAKid,KAEDrf,KA+BT,SAASkrB,GAAO7rB,EAAOQ,GACrB,IAAIG,EAAS,GACb,IAAMX,IAASA,EAAMnW,OACnB,OAAO8W,EAET,IAAIP,GAAS,EACTyb,EAAU,GACVhyB,EAASmW,EAAMnW,OAEnB2W,EAAY4a,GAAY5a,EAAW,GACnC,QAASJ,EAAQvW,EAAQ,CACvB,IAAI6G,EAAQsP,EAAMI,GACdI,EAAU9P,EAAO0P,EAAOJ,KAC1BW,EAAOoE,KAAKrU,GACZmrB,EAAQ9W,KAAK3E,IAIjB,OADAwb,GAAW5b,EAAO6b,GACXlb,EA0BT,SAAS8J,GAAQzK,GACf,OAAgB,MAATA,EAAgBA,EAAQwK,GAAc1K,KAAKE,GAmBpD,SAAS1P,GAAM0P,EAAO4N,EAAOC,GAC3B,IAAIhkB,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGDgkB,GAAqB,iBAAPA,GAAmBkU,GAAe/hB,EAAO4N,EAAOC,IAChED,EAAQ,EACRC,EAAMhkB,IAGN+jB,EAAiB,MAATA,EAAgB,EAAIkH,GAAUlH,GACtCC,EAAMA,IAAQxa,EAAYxJ,EAASirB,GAAUjH,IAExCgP,GAAU7c,EAAO4N,EAAOC,IAVtB,GA8BX,SAASie,GAAY9rB,EAAOtP,GAC1B,OAAOqsB,GAAgB/c,EAAOtP,GA4BhC,SAASq7B,GAAc/rB,EAAOtP,EAAOwP,GACnC,OAAOkd,GAAkBpd,EAAOtP,EAAO0qB,GAAYlb,EAAU,IAmB/D,SAAS8rB,GAAchsB,EAAOtP,GAC5B,IAAI7G,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,GAAIA,EAAQ,CACV,IAAIuW,EAAQ2c,GAAgB/c,EAAOtP,GACnC,GAAI0P,EAAQvW,GAAU0nB,GAAGvR,EAAMI,GAAQ1P,GACrC,OAAO0P,EAGX,OAAQ,EAqBV,SAAS6rB,GAAgBjsB,EAAOtP,GAC9B,OAAOqsB,GAAgB/c,EAAOtP,GAAO,GA4BvC,SAASw7B,GAAkBlsB,EAAOtP,EAAOwP,GACvC,OAAOkd,GAAkBpd,EAAOtP,EAAO0qB,GAAYlb,EAAU,IAAI,GAmBnE,SAASisB,GAAkBnsB,EAAOtP,GAChC,IAAI7G,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,GAAIA,EAAQ,CACV,IAAIuW,EAAQ2c,GAAgB/c,EAAOtP,GAAO,GAAQ,EAClD,GAAI6gB,GAAGvR,EAAMI,GAAQ1P,GACnB,OAAO0P,EAGX,OAAQ,EAkBV,SAASgsB,GAAWpsB,GAClB,OAAQA,GAASA,EAAMnW,OACnBi0B,GAAe9d,GACf,GAmBN,SAASqsB,GAAarsB,EAAOE,GAC3B,OAAQF,GAASA,EAAMnW,OACnBi0B,GAAe9d,EAAOob,GAAYlb,EAAU,IAC5C,GAiBN,SAASosB,GAAKtsB,GACZ,IAAInW,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAOA,EAASgzB,GAAU7c,EAAO,EAAGnW,GAAU,GA4BhD,SAAS0iC,GAAKvsB,EAAOkD,EAAG4e,GACtB,OAAM9hB,GAASA,EAAMnW,QAGrBqZ,EAAK4e,GAAS5e,IAAM7P,EAAa,EAAIyhB,GAAU5R,GACxC2Z,GAAU7c,EAAO,EAAGkD,EAAI,EAAI,EAAIA,IAH9B,GA+BX,SAASspB,GAAUxsB,EAAOkD,EAAG4e,GAC3B,IAAIj4B,EAAkB,MAATmW,EAAgB,EAAIA,EAAMnW,OACvC,OAAKA,GAGLqZ,EAAK4e,GAAS5e,IAAM7P,EAAa,EAAIyhB,GAAU5R,GAC/CA,EAAIrZ,EAASqZ,EACN2Z,GAAU7c,EAAOkD,EAAI,EAAI,EAAIA,EAAGrZ,IAJ9B,GA0CX,SAAS4iC,GAAezsB,EAAOQ,GAC7B,OAAQR,GAASA,EAAMnW,OACnBy0B,GAAUte,EAAOob,GAAY5a,EAAW,IAAI,GAAO,GACnD,GAsCN,SAASksB,GAAU1sB,EAAOQ,GACxB,OAAQR,GAASA,EAAMnW,OACnBy0B,GAAUte,EAAOob,GAAY5a,EAAW,IACxC,GAmBN,IAAImsB,GAAQxQ,IAAS,SAAS1F,GAC5B,OAAOwH,GAAShJ,GAAYwB,EAAQ,EAAGoE,IAAmB,OA0BxD+R,GAAUzQ,IAAS,SAAS1F,GAC9B,IAAIvW,EAAWiX,GAAKV,GAIpB,OAHIoE,GAAkB3a,KACpBA,EAAW7M,GAEN4qB,GAAShJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAOO,GAAYlb,EAAU,OAwBrF2sB,GAAY1Q,IAAS,SAAS1F,GAChC,IAAI1V,EAAaoW,GAAKV,GAEtB,OADA1V,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACrD4qB,GAAShJ,GAAYwB,EAAQ,EAAGoE,IAAmB,GAAOxnB,EAAW0N,MAqB9E,SAAS+rB,GAAK9sB,GACZ,OAAQA,GAASA,EAAMnW,OAAUo0B,GAASje,GAAS,GA0BrD,SAAS+sB,GAAO/sB,EAAOE,GACrB,OAAQF,GAASA,EAAMnW,OAAUo0B,GAASje,EAAOob,GAAYlb,EAAU,IAAM,GAuB/E,SAAS8sB,GAAShtB,EAAOe,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACpD2M,GAASA,EAAMnW,OAAUo0B,GAASje,EAAO3M,EAAW0N,GAAc,GAsB5E,SAASksB,GAAMjtB,GACb,IAAMA,IAASA,EAAMnW,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAmW,EAAQS,GAAYT,GAAO,SAAS5O,GAClC,GAAIypB,GAAkBzpB,GAEpB,OADAvH,EAASmgB,GAAU5Y,EAAMvH,OAAQA,IAC1B,KAGJoZ,GAAUpZ,GAAQ,SAASuW,GAChC,OAAOY,GAAShB,EAAOyB,GAAarB,OAyBxC,SAAS8sB,GAAUltB,EAAOE,GACxB,IAAMF,IAASA,EAAMnW,OACnB,MAAO,GAET,IAAI8W,EAASssB,GAAMjtB,GACnB,OAAgB,MAAZE,EACKS,EAEFK,GAASL,GAAQ,SAASvP,GAC/B,OAAOsO,GAAMQ,EAAU7M,EAAWjC,MAwBtC,IAAI+7B,GAAUhR,IAAS,SAASnc,EAAOmB,GACrC,OAAO0Z,GAAkB7a,GACrBgU,GAAehU,EAAOmB,GACtB,MAqBFisB,GAAMjR,IAAS,SAAS1F,GAC1B,OAAOiI,GAAQje,GAAYgW,EAAQoE,QA0BjCwS,GAAQlR,IAAS,SAAS1F,GAC5B,IAAIvW,EAAWiX,GAAKV,GAIpB,OAHIoE,GAAkB3a,KACpBA,EAAW7M,GAENqrB,GAAQje,GAAYgW,EAAQoE,IAAoBO,GAAYlb,EAAU,OAwB3EotB,GAAUnR,IAAS,SAAS1F,GAC9B,IAAI1V,EAAaoW,GAAKV,GAEtB,OADA1V,EAAkC,mBAAdA,EAA2BA,EAAa1N,EACrDqrB,GAAQje,GAAYgW,EAAQoE,IAAoBxnB,EAAW0N,MAmBhEwsB,GAAMpR,GAAS8Q,IAkBnB,SAASO,GAAUpqB,EAAOjC,GACxB,OAAOwd,GAAcvb,GAAS,GAAIjC,GAAU,GAAIsQ,IAkBlD,SAASgc,GAAcrqB,EAAOjC,GAC5B,OAAOwd,GAAcvb,GAAS,GAAIjC,GAAU,GAAIsa,IAuBlD,IAAIiS,GAAUvR,IAAS,SAAS1F,GAC9B,IAAI5sB,EAAS4sB,EAAO5sB,OAChBqW,EAAWrW,EAAS,EAAI4sB,EAAO5sB,EAAS,GAAKwJ,EAGjD,OADA6M,EAA8B,mBAAZA,GAA0BuW,EAAOtH,MAAOjP,GAAY7M,EAC/D65B,GAAUzW,EAAQvW,MAkC3B,SAASytB,GAAMj9B,GACb,IAAIiQ,EAASiL,GAAOlb,GAEpB,OADAiQ,EAAO8L,WAAY,EACZ9L,EA0BT,SAASitB,GAAIl9B,EAAOm9B,GAElB,OADAA,EAAYn9B,GACLA,EA0BT,SAASizB,GAAKjzB,EAAOm9B,GACnB,OAAOA,EAAYn9B,GAmBrB,IAAIo9B,GAAYtK,IAAS,SAAStR,GAChC,IAAIroB,EAASqoB,EAAMroB,OACf+jB,EAAQ/jB,EAASqoB,EAAM,GAAK,EAC5BxhB,EAAQhG,KAAK6hB,YACbshB,EAAc,SAASnrB,GAAU,OAAOuP,GAAOvP,EAAQwP,IAE3D,QAAIroB,EAAS,GAAKa,KAAK8hB,YAAY3iB,SAC7B6G,aAAiBqb,IAAiBgF,GAAQnD,IAGhDld,EAAQA,EAAMJ,MAAMsd,GAAQA,GAAS/jB,EAAS,EAAI,IAClD6G,EAAM8b,YAAYzH,KAAK,CACrB,KAAQ4e,GACR,KAAQ,CAACkK,GACT,QAAWx6B,IAEN,IAAI2Y,GAActb,EAAOhG,KAAK+hB,WAAWkX,MAAK,SAAS3jB,GAI5D,OAHInW,IAAWmW,EAAMnW,QACnBmW,EAAM+E,KAAK1R,GAEN2M,MAZAtV,KAAKi5B,KAAKkK,MA2CrB,SAASE,KACP,OAAOJ,GAAMjjC,MA6Bf,SAASsjC,KACP,OAAO,IAAIhiB,GAActhB,KAAKgG,QAAShG,KAAK+hB,WAyB9C,SAASwhB,KACHvjC,KAAKiiB,aAAetZ,IACtB3I,KAAKiiB,WAAauhB,GAAQxjC,KAAKgG,UAEjC,IAAIoU,EAAOpa,KAAKgiB,WAAahiB,KAAKiiB,WAAW9iB,OACzC6G,EAAQoU,EAAOzR,EAAY3I,KAAKiiB,WAAWjiB,KAAKgiB,aAEpD,MAAO,CAAE,KAAQ5H,EAAM,MAASpU,GAqBlC,SAASy9B,KACP,OAAOzjC,KA2BT,SAAS0jC,GAAa19B,GACpB,IAAIiQ,EACAuW,EAASxsB,KAEb,MAAOwsB,aAAkB7K,GAAY,CACnC,IAAIe,EAAQnB,GAAaiL,GACzB9J,EAAMV,UAAY,EAClBU,EAAMT,WAAatZ,EACfsN,EACFmb,EAASvP,YAAca,EAEvBzM,EAASyM,EAEX,IAAI0O,EAAW1O,EACf8J,EAASA,EAAO3K,YAGlB,OADAuP,EAASvP,YAAc7b,EAChBiQ,EAuBT,SAAS0tB,KACP,IAAI39B,EAAQhG,KAAK6hB,YACjB,GAAI7b,aAAiBqb,GAAa,CAChC,IAAIuiB,EAAU59B,EAUd,OATIhG,KAAK8hB,YAAY3iB,SACnBykC,EAAU,IAAIviB,GAAYrhB,OAE5B4jC,EAAUA,EAAQ7jB,UAClB6jB,EAAQ9hB,YAAYzH,KAAK,CACvB,KAAQ4e,GACR,KAAQ,CAAClZ,IACT,QAAWpX,IAEN,IAAI2Y,GAAcsiB,EAAS5jC,KAAK+hB,WAEzC,OAAO/hB,KAAKi5B,KAAKlZ,IAiBnB,SAAS8jB,KACP,OAAOtgB,GAAiBvjB,KAAK6hB,YAAa7hB,KAAK8hB,aA2BjD,IAAIgiB,GAAU/M,IAAiB,SAAS9gB,EAAQjQ,EAAOuR,GACjDiF,GAAepH,KAAKa,EAAQsB,KAC5BtB,EAAOsB,GAETuP,GAAgB7Q,EAAQsB,EAAK,MA6CjC,SAASwsB,GAAM1sB,EAAYvB,EAAWshB,GACpC,IAAIniB,EAAOmM,GAAQ/J,GAAcxB,GAAamU,GAI9C,OAHIoN,GAASC,GAAehgB,EAAYvB,EAAWshB,KACjDthB,EAAYnN,GAEPsM,EAAKoC,EAAYqZ,GAAY5a,EAAW,IA4CjD,SAASxQ,GAAO+R,EAAYvB,GAC1B,IAAIb,EAAOmM,GAAQ/J,GAActB,GAAcuU,GAC/C,OAAOrV,EAAKoC,EAAYqZ,GAAY5a,EAAW,IAuCjD,IAAIkuB,GAAOrL,GAAWqH,IAqBlBiE,GAAWtL,GAAWsH,IAuB1B,SAASiE,GAAQ7sB,EAAY7B,GAC3B,OAAO+U,GAAYxiB,GAAIsP,EAAY7B,GAAW,GAuBhD,SAAS2uB,GAAY9sB,EAAY7B,GAC/B,OAAO+U,GAAYxiB,GAAIsP,EAAY7B,GAAW9K,GAwBhD,SAAS05B,GAAa/sB,EAAY7B,EAAUgV,GAE1C,OADAA,EAAQA,IAAU7hB,EAAY,EAAIyhB,GAAUI,GACrCD,GAAYxiB,GAAIsP,EAAY7B,GAAWgV,GAiChD,SAASrmB,GAAQkT,EAAY7B,GAC3B,IAAIP,EAAOmM,GAAQ/J,GAAc1B,GAAYuR,GAC7C,OAAOjS,EAAKoC,EAAYqZ,GAAYlb,EAAU,IAuBhD,SAAS6uB,GAAahtB,EAAY7B,GAChC,IAAIP,EAAOmM,GAAQ/J,GAAczB,GAAiBkU,GAClD,OAAO7U,EAAKoC,EAAYqZ,GAAYlb,EAAU,IA0BhD,IAAI8uB,GAAUvN,IAAiB,SAAS9gB,EAAQjQ,EAAOuR,GACjDiF,GAAepH,KAAKa,EAAQsB,GAC9BtB,EAAOsB,GAAK8C,KAAKrU,GAEjB8gB,GAAgB7Q,EAAQsB,EAAK,CAACvR,OAkClC,SAAS3B,GAASgT,EAAYrR,EAAOyR,EAAW2f,GAC9C/f,EAAaiY,GAAYjY,GAAcA,EAAaZ,GAAOY,GAC3DI,EAAaA,IAAc2f,EAAShN,GAAU3S,GAAa,EAE3D,IAAItY,EAASkY,EAAWlY,OAIxB,OAHIsY,EAAY,IACdA,EAAY6H,GAAUngB,EAASsY,EAAW,IAErC8sB,GAASltB,GACXI,GAAatY,GAAUkY,EAAWtX,QAAQiG,EAAOyR,IAAc,IAC7DtY,GAAUgX,GAAYkB,EAAYrR,EAAOyR,IAAc,EA0BhE,IAAI+sB,GAAY/S,IAAS,SAASpa,EAAY4T,EAAM9V,GAClD,IAAIO,GAAS,EACT6S,EAAwB,mBAAR0C,EAChBhV,EAASqZ,GAAYjY,GAAcd,EAAMc,EAAWlY,QAAU,GAKlE,OAHA+nB,GAAS7P,GAAY,SAASrR,GAC5BiQ,IAASP,GAAS6S,EAASvT,GAAMiW,EAAMjlB,EAAOmP,GAAQoX,GAAWvmB,EAAOilB,EAAM9V,MAEzEc,KA+BLwuB,GAAQ1N,IAAiB,SAAS9gB,EAAQjQ,EAAOuR,GACnDuP,GAAgB7Q,EAAQsB,EAAKvR,MA6C/B,SAAS+B,GAAIsP,EAAY7B,GACvB,IAAIP,EAAOmM,GAAQ/J,GAAcf,GAAW+Y,GAC5C,OAAOpa,EAAKoC,EAAYqZ,GAAYlb,EAAU,IAgChD,SAASkvB,GAAQrtB,EAAY+L,EAAWqN,EAAQ2G,GAC9C,OAAkB,MAAd/f,EACK,IAEJ+J,GAAQgC,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAExCqN,EAAS2G,EAAQzuB,EAAY8nB,EACxBrP,GAAQqP,KACXA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BD,GAAYnZ,EAAY+L,EAAWqN,IAuC5C,IAAIkU,GAAY5N,IAAiB,SAAS9gB,EAAQjQ,EAAOuR,GACvDtB,EAAOsB,EAAM,EAAI,GAAG8C,KAAKrU,MACxB,WAAa,MAAO,CAAC,GAAI,OAuC5B,SAAS4+B,GAAOvtB,EAAY7B,EAAUC,GACpC,IAAIR,EAAOmM,GAAQ/J,GAAcX,GAAcwB,GAC3CvB,EAAYkhB,UAAU14B,OAAS,EAEnC,OAAO8V,EAAKoC,EAAYqZ,GAAYlb,EAAU,GAAIC,EAAakB,EAAWuQ,IAyB5E,SAAS2d,GAAYxtB,EAAY7B,EAAUC,GACzC,IAAIR,EAAOmM,GAAQ/J,GAAcT,GAAmBsB,GAChDvB,EAAYkhB,UAAU14B,OAAS,EAEnC,OAAO8V,EAAKoC,EAAYqZ,GAAYlb,EAAU,GAAIC,EAAakB,EAAWmT,IAqC5E,SAASgb,GAAOztB,EAAYvB,GAC1B,IAAIb,EAAOmM,GAAQ/J,GAActB,GAAcuU,GAC/C,OAAOrV,EAAKoC,EAAY0tB,GAAOrU,GAAY5a,EAAW,KAiBxD,SAASkvB,GAAO3tB,GACd,IAAIpC,EAAOmM,GAAQ/J,GAAciP,GAAcsL,GAC/C,OAAO3c,EAAKoC,GAuBd,SAAS4tB,GAAW5tB,EAAYmB,EAAG4e,GAE/B5e,GADG4e,EAAQC,GAAehgB,EAAYmB,EAAG4e,GAAS5e,IAAM7P,GACpD,EAEAyhB,GAAU5R,GAEhB,IAAIvD,EAAOmM,GAAQ/J,GAAcmP,GAAkBqL,GACnD,OAAO5c,EAAKoC,EAAYmB,GAkB1B,SAAS0sB,GAAQ7tB,GACf,IAAIpC,EAAOmM,GAAQ/J,GAAcsP,GAAeuL,GAChD,OAAOjd,EAAKoC,GAwBd,SAASkD,GAAKlD,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIiY,GAAYjY,GACd,OAAOktB,GAASltB,GAAc2D,GAAW3D,GAAcA,EAAWlY,OAEpE,IAAIkpB,EAAMC,GAAOjR,GACjB,OAAIgR,GAAO1c,GAAU0c,GAAOnc,GACnBmL,EAAWkD,KAEbwU,GAAS1X,GAAYlY,OAuC9B,SAASgmC,GAAK9tB,EAAYvB,EAAWshB,GACnC,IAAIniB,EAAOmM,GAAQ/J,GAAcR,GAAYub,GAI7C,OAHIgF,GAASC,GAAehgB,EAAYvB,EAAWshB,KACjDthB,EAAYnN,GAEPsM,EAAKoC,EAAYqZ,GAAY5a,EAAW,IAgCjD,IAAIsvB,GAAS3T,IAAS,SAASpa,EAAY+L,GACzC,GAAkB,MAAd/L,EACF,MAAO,GAET,IAAIlY,EAASikB,EAAUjkB,OAMvB,OALIA,EAAS,GAAKk4B,GAAehgB,EAAY+L,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHjkB,EAAS,GAAKk4B,GAAejU,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBoN,GAAYnZ,EAAYkT,GAAYnH,EAAW,GAAI,OAqBxD7E,GAAMD,IAAU,WAClB,OAAOhL,GAAK7P,KAAK8a,OA6BnB,SAAS8mB,GAAM7sB,EAAGvD,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAI+G,GAAUjT,GAGtB,OADAyP,EAAI4R,GAAU5R,GACP,WACL,KAAMA,EAAI,EACR,OAAOvD,EAAKD,MAAMhV,KAAM63B,YAsB9B,SAAS6B,GAAIzkB,EAAMuD,EAAG4e,GAGpB,OAFA5e,EAAI4e,EAAQzuB,EAAY6P,EACxBA,EAAKvD,GAAa,MAALuD,EAAavD,EAAK9V,OAASqZ,EACjCqjB,GAAW5mB,EAAMjL,EAAerB,EAAWA,EAAWA,EAAWA,EAAW6P,GAoBrF,SAAS8sB,GAAO9sB,EAAGvD,GACjB,IAAIgB,EACJ,GAAmB,mBAARhB,EACT,MAAM,IAAI+G,GAAUjT,GAGtB,OADAyP,EAAI4R,GAAU5R,GACP,WAOL,QANMA,EAAI,IACRvC,EAAShB,EAAKD,MAAMhV,KAAM63B,YAExBrf,GAAK,IACPvD,EAAOtM,GAEFsN,GAuCX,IAAIsvB,GAAO9T,IAAS,SAASxc,EAAMC,EAAS4gB,GAC1C,IAAIhO,EAAUre,EACd,GAAIqsB,EAAS32B,OAAQ,CACnB,IAAI42B,EAAUpb,GAAemb,EAAU0C,GAAU+M,KACjDzd,GAAWhe,EAEb,OAAO+xB,GAAW5mB,EAAM6S,EAAS5S,EAAS4gB,EAAUC,MAgDlDyP,GAAU/T,IAAS,SAASzZ,EAAQT,EAAKue,GAC3C,IAAIhO,EAAUre,EAAiBC,EAC/B,GAAIosB,EAAS32B,OAAQ,CACnB,IAAI42B,EAAUpb,GAAemb,EAAU0C,GAAUgN,KACjD1d,GAAWhe,EAEb,OAAO+xB,GAAWtkB,EAAKuQ,EAAS9P,EAAQ8d,EAAUC,MA4CpD,SAAS0P,GAAMxwB,EAAMsjB,EAAOnB,GAC1BmB,EAAQnB,EAAQzuB,EAAY4vB,EAC5B,IAAItiB,EAAS4lB,GAAW5mB,EAAMrL,EAAiBjB,EAAWA,EAAWA,EAAWA,EAAWA,EAAW4vB,GAEtG,OADAtiB,EAAOuD,YAAcisB,GAAMjsB,YACpBvD,EAyCT,SAASyvB,GAAWzwB,EAAMsjB,EAAOnB,GAC/BmB,EAAQnB,EAAQzuB,EAAY4vB,EAC5B,IAAItiB,EAAS4lB,GAAW5mB,EAAMpL,EAAuBlB,EAAWA,EAAWA,EAAWA,EAAWA,EAAW4vB,GAE5G,OADAtiB,EAAOuD,YAAcksB,GAAWlsB,YACzBvD,EAyDT,SAAS0vB,GAAS1wB,EAAMoU,EAAMuc,GAC5B,IAAIC,EACAC,EACAC,EACA9vB,EACA+vB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTpO,GAAW,EAEf,GAAmB,mBAAR/iB,EACT,MAAM,IAAI+G,GAAUjT,GAUtB,SAASs9B,EAAWC,GAClB,IAAInxB,EAAO0wB,EACP3wB,EAAU4wB,EAKd,OAHAD,EAAWC,EAAWn9B,EACtBu9B,EAAiBI,EACjBrwB,EAAShB,EAAKD,MAAME,EAASC,GACtBc,EAGT,SAASswB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUvnB,GAAW+nB,EAAcnd,GAE5B8c,EAAUE,EAAWC,GAAQrwB,EAGtC,SAASwwB,EAAcH,GACrB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAC7BU,EAAcvd,EAAOqd,EAEzB,OAAON,EACH5mB,GAAUonB,EAAab,EAAUY,GACjCC,EAGN,SAASC,EAAaP,GACpB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAKjC,OAAQD,IAAiBt9B,GAAc+9B,GAAqBrd,GACzDqd,EAAoB,GAAON,GAAUO,GAAuBZ,EAGjE,SAASS,IACP,IAAIF,EAAO/nB,KACX,GAAIsoB,EAAaP,GACf,OAAOQ,EAAaR,GAGtBN,EAAUvnB,GAAW+nB,EAAcC,EAAcH,IAGnD,SAASQ,EAAaR,GAKpB,OAJAN,EAAUr9B,EAINqvB,GAAY6N,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWn9B,EACfsN,GAGT,SAAS8wB,IACHf,IAAYr9B,GACd0V,GAAa2nB,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUr9B,EAGjD,SAASq+B,IACP,OAAOhB,IAAYr9B,EAAYsN,EAAS6wB,EAAavoB,MAGvD,SAAS0oB,IACP,IAAIX,EAAO/nB,KACP2oB,EAAaL,EAAaP,GAM9B,GAJAT,EAAWhO,UACXiO,EAAW9lC,KACXimC,EAAeK,EAEXY,EAAY,CACd,GAAIlB,IAAYr9B,EACd,OAAO49B,EAAYN,GAErB,GAAIG,EAIF,OAFA/nB,GAAa2nB,GACbA,EAAUvnB,GAAW+nB,EAAcnd,GAC5Bgd,EAAWJ,GAMtB,OAHID,IAAYr9B,IACdq9B,EAAUvnB,GAAW+nB,EAAcnd,IAE9BpT,EAIT,OA3GAoT,EAAO0R,GAAS1R,IAAS,EACrB3H,GAASkkB,KACXO,IAAYP,EAAQO,QACpBC,EAAS,YAAaR,EACtBG,EAAUK,EAAS9mB,GAAUyb,GAAS6K,EAAQG,UAAY,EAAG1c,GAAQ0c,EACrE/N,EAAW,aAAc4N,IAAYA,EAAQ5N,SAAWA,GAoG1DiP,EAAUF,OAASA,EACnBE,EAAUD,MAAQA,EACXC,EAqBT,IAAIE,GAAQ1V,IAAS,SAASxc,EAAME,GAClC,OAAOiU,GAAUnU,EAAM,EAAGE,MAsBxBiyB,GAAQ3V,IAAS,SAASxc,EAAMoU,EAAMlU,GACxC,OAAOiU,GAAUnU,EAAM8lB,GAAS1R,IAAS,EAAGlU,MAqB9C,SAASkyB,GAAKpyB,GACZ,OAAO4mB,GAAW5mB,EAAM/K,GA+C1B,SAASk0B,GAAQnpB,EAAMqyB,GACrB,GAAmB,mBAARryB,GAAmC,MAAZqyB,GAAuC,mBAAZA,EAC3D,MAAM,IAAItrB,GAAUjT,GAEtB,IAAIw+B,EAAW,WACb,IAAIpyB,EAAO0iB,UACPtgB,EAAM+vB,EAAWA,EAAStyB,MAAMhV,KAAMmV,GAAQA,EAAK,GACnD8D,EAAQsuB,EAAStuB,MAErB,GAAIA,EAAMC,IAAI3B,GACZ,OAAO0B,EAAMlS,IAAIwQ,GAEnB,IAAItB,EAAShB,EAAKD,MAAMhV,KAAMmV,GAE9B,OADAoyB,EAAStuB,MAAQA,EAAM4B,IAAItD,EAAKtB,IAAWgD,EACpChD,GAGT,OADAsxB,EAAStuB,MAAQ,IAAKmlB,GAAQoJ,OAAS3iB,IAChC0iB,EA0BT,SAASxC,GAAOjvB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIkG,GAAUjT,GAEtB,OAAO,WACL,IAAIoM,EAAO0iB,UACX,OAAQ1iB,EAAKhW,QACX,KAAK,EAAG,OAAQ2W,EAAUV,KAAKpV,MAC/B,KAAK,EAAG,OAAQ8V,EAAUV,KAAKpV,KAAMmV,EAAK,IAC1C,KAAK,EAAG,OAAQW,EAAUV,KAAKpV,KAAMmV,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQW,EAAUV,KAAKpV,KAAMmV,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQW,EAAUd,MAAMhV,KAAMmV,IAsBlC,SAASsyB,GAAKxyB,GACZ,OAAOqwB,GAAO,EAAGrwB,GAzDnBmpB,GAAQoJ,MAAQ3iB,GA2FhB,IAAI6iB,GAAWnT,IAAS,SAAStf,EAAMsoB,GACrCA,EAAmC,GAArBA,EAAWp+B,QAAeiiB,GAAQmc,EAAW,IACvDjnB,GAASinB,EAAW,GAAIzkB,GAAU4X,OAClCpa,GAASiU,GAAYgT,EAAY,GAAIzkB,GAAU4X,OAEnD,IAAIiX,EAAcpK,EAAWp+B,OAC7B,OAAOsyB,IAAS,SAAStc,GACvB,IAAIO,GAAS,EACTvW,EAASqgB,GAAUrK,EAAKhW,OAAQwoC,GAEpC,QAASjyB,EAAQvW,EACfgW,EAAKO,GAAS6nB,EAAW7nB,GAAON,KAAKpV,KAAMmV,EAAKO,IAElD,OAAOV,GAAMC,EAAMjV,KAAMmV,SAqCzByyB,GAAUnW,IAAS,SAASxc,EAAM6gB,GACpC,IAAIC,EAAUpb,GAAemb,EAAU0C,GAAUoP,KACjD,OAAO/L,GAAW5mB,EAAMnL,EAAmBnB,EAAWmtB,EAAUC,MAmC9D8R,GAAepW,IAAS,SAASxc,EAAM6gB,GACzC,IAAIC,EAAUpb,GAAemb,EAAU0C,GAAUqP,KACjD,OAAOhM,GAAW5mB,EAAMlL,EAAyBpB,EAAWmtB,EAAUC,MAyBpE+R,GAAQhP,IAAS,SAAS7jB,EAAMkc,GAClC,OAAO0K,GAAW5mB,EAAMhL,EAAiBtB,EAAWA,EAAWA,EAAWwoB,MA4B5E,SAAS4W,GAAK9yB,EAAMiO,GAClB,GAAmB,mBAARjO,EACT,MAAM,IAAI+G,GAAUjT,GAGtB,OADAma,EAAQA,IAAUva,EAAYua,EAAQkH,GAAUlH,GACzCuO,GAASxc,EAAMiO,GAqCxB,SAAS8kB,GAAO/yB,EAAMiO,GACpB,GAAmB,mBAARjO,EACT,MAAM,IAAI+G,GAAUjT,GAGtB,OADAma,EAAiB,MAATA,EAAgB,EAAI5D,GAAU8K,GAAUlH,GAAQ,GACjDuO,IAAS,SAAStc,GACvB,IAAIG,EAAQH,EAAK+N,GACbsb,EAAYhK,GAAUrf,EAAM,EAAG+N,GAKnC,OAHI5N,GACFkB,GAAUgoB,EAAWlpB,GAEhBN,GAAMC,EAAMjV,KAAMw+B,MAgD7B,SAASyJ,GAAShzB,EAAMoU,EAAMuc,GAC5B,IAAIO,GAAU,EACVnO,GAAW,EAEf,GAAmB,mBAAR/iB,EACT,MAAM,IAAI+G,GAAUjT,GAMtB,OAJI2Y,GAASkkB,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrDnO,EAAW,aAAc4N,IAAYA,EAAQ5N,SAAWA,GAEnD2N,GAAS1wB,EAAMoU,EAAM,CAC1B,QAAW8c,EACX,QAAW9c,EACX,SAAY2O,IAmBhB,SAASkQ,GAAMjzB,GACb,OAAOykB,GAAIzkB,EAAM,GAyBnB,SAASkzB,GAAKniC,EAAO2xB,GACnB,OAAOiQ,GAAQvT,GAAasD,GAAU3xB,GAsCxC,SAASoiC,KACP,IAAKvQ,UAAU14B,OACb,MAAO,GAET,IAAI6G,EAAQ6xB,UAAU,GACtB,OAAOzW,GAAQpb,GAASA,EAAQ,CAACA,GA6BnC,SAAS0c,GAAM1c,GACb,OAAO6hB,GAAU7hB,EAAOsD,GAkC1B,SAAS++B,GAAUriC,EAAO+hB,GAExB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapf,EACrDkf,GAAU7hB,EAAOsD,EAAoBye,GAqB9C,SAASugB,GAAUtiC,GACjB,OAAO6hB,GAAU7hB,EAAOoD,EAAkBE,GA+B5C,SAASi/B,GAAcviC,EAAO+hB,GAE5B,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapf,EACrDkf,GAAU7hB,EAAOoD,EAAkBE,EAAoBye,GA2BhE,SAASygB,GAAWxwB,EAAQtK,GAC1B,OAAiB,MAAVA,GAAkByb,GAAenR,EAAQtK,EAAQmP,GAAKnP,IAmC/D,SAASmZ,GAAG7gB,EAAO0lB,GACjB,OAAO1lB,IAAU0lB,GAAU1lB,IAAUA,GAAS0lB,IAAUA,EA0B1D,IAAI+c,GAAK3N,GAA0BrP,IAyB/Bid,GAAM5N,IAA0B,SAAS90B,EAAO0lB,GAClD,OAAO1lB,GAAS0lB,KAqBdzF,GAAcyG,GAAgB,WAAa,OAAOmL,UAApB,IAAsCnL,GAAkB,SAAS1mB,GACjG,OAAOmb,GAAanb,IAAUwW,GAAepH,KAAKpP,EAAO,YACtD2X,GAAqBvI,KAAKpP,EAAO,WA0BlCob,GAAU7K,EAAM6K,QAmBhB/M,GAAgBD,GAAoB0E,GAAU1E,IAAqBuY,GA2BvE,SAAS2C,GAAYtpB,GACnB,OAAgB,MAATA,GAAiByoB,GAASzoB,EAAM7G,UAAY4rB,GAAW/kB,GA4BhE,SAASmqB,GAAkBnqB,GACzB,OAAOmb,GAAanb,IAAUspB,GAAYtpB,GAoB5C,SAAS2iC,GAAU3iC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBmb,GAAanb,IAAUslB,GAAWtlB,IAAUqF,EAoBjD,IAAI4T,GAAWD,IAAkBkf,GAmB7B3pB,GAASD,GAAawE,GAAUxE,IAAcsY,GAmBlD,SAASgc,GAAU5iC,GACjB,OAAOmb,GAAanb,IAA6B,IAAnBA,EAAM0N,WAAmB2c,GAAcrqB,GAoCvE,SAAS6iC,GAAQ7iC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIspB,GAAYtpB,KACXob,GAAQpb,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM4X,QAC1DqB,GAASjZ,IAAU+O,GAAa/O,IAAUigB,GAAYjgB,IAC1D,OAAQA,EAAM7G,OAEhB,IAAIkpB,EAAMC,GAAOtiB,GACjB,GAAIqiB,GAAO1c,GAAU0c,GAAOnc,GAC1B,OAAQlG,EAAMuU,KAEhB,GAAIyU,GAAYhpB,GACd,OAAQ+oB,GAAS/oB,GAAO7G,OAE1B,IAAK,IAAIoY,KAAOvR,EACd,GAAIwW,GAAepH,KAAKpP,EAAOuR,GAC7B,OAAO,EAGX,OAAO,EA+BT,SAASuxB,GAAQ9iC,EAAO0lB,GACtB,OAAOmB,GAAY7mB,EAAO0lB,GAmC5B,SAASqd,GAAY/iC,EAAO0lB,EAAO3D,GACjCA,EAAkC,mBAAdA,EAA2BA,EAAapf,EAC5D,IAAIsN,EAAS8R,EAAaA,EAAW/hB,EAAO0lB,GAAS/iB,EACrD,OAAOsN,IAAWtN,EAAYkkB,GAAY7mB,EAAO0lB,EAAO/iB,EAAWof,KAAgB9R,EAqBrF,SAAS+yB,GAAQhjC,GACf,IAAKmb,GAAanb,GAChB,OAAO,EAET,IAAIqiB,EAAMiD,GAAWtlB,GACrB,OAAOqiB,GAAO7c,GAAY6c,GAAO9c,GACN,iBAAjBvF,EAAMhE,SAA4C,iBAAdgE,EAAMw2B,OAAqBnM,GAAcrqB,GA6BzF,SAASmZ,GAASnZ,GAChB,MAAuB,iBAATA,GAAqBkZ,GAAelZ,GAoBpD,SAAS+kB,GAAW/kB,GAClB,IAAK0b,GAAS1b,GACZ,OAAO,EAIT,IAAIqiB,EAAMiD,GAAWtlB,GACrB,OAAOqiB,GAAO5c,GAAW4c,GAAO3c,GAAU2c,GAAOjd,GAAYid,GAAOrc,GA6BtE,SAASi9B,GAAUjjC,GACjB,MAAuB,iBAATA,GAAqBA,GAASokB,GAAUpkB,GA6BxD,SAASyoB,GAASzoB,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAAS2E,EA4B7C,SAAS+W,GAAS1b,GAChB,IAAI7D,SAAc6D,EAClB,OAAgB,MAATA,IAA0B,UAAR7D,GAA4B,YAARA,GA2B/C,SAASgf,GAAanb,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAIyO,GAAQD,GAAYsE,GAAUtE,IAAasZ,GA8B/C,SAASob,GAAQlxB,EAAQtK,GACvB,OAAOsK,IAAWtK,GAAUqgB,GAAY/V,EAAQtK,EAAQ6hB,GAAa7hB,IAmCvE,SAASy7B,GAAYnxB,EAAQtK,EAAQqa,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapf,EACrDolB,GAAY/V,EAAQtK,EAAQ6hB,GAAa7hB,GAASqa,GA+B3D,SAASqhB,GAAMpjC,GAIb,OAAOqjC,GAASrjC,IAAUA,IAAUA,EA6BtC,SAASsjC,GAAStjC,GAChB,GAAIi4B,GAAWj4B,GACb,MAAM,IAAI6V,EAAM/S,GAElB,OAAOqlB,GAAanoB,GAoBtB,SAASujC,GAAOvjC,GACd,OAAiB,OAAVA,EAuBT,SAASwjC,GAAMxjC,GACb,OAAgB,MAATA,EA6BT,SAASqjC,GAASrjC,GAChB,MAAuB,iBAATA,GACXmb,GAAanb,IAAUslB,GAAWtlB,IAAU4F,GA+BjD,SAASykB,GAAcrqB,GACrB,IAAKmb,GAAanb,IAAUslB,GAAWtlB,IAAU8F,GAC/C,OAAO,EAET,IAAI2V,EAAQlE,GAAavX,GACzB,GAAc,OAAVyb,EACF,OAAO,EAET,IAAIgW,EAAOjb,GAAepH,KAAKqM,EAAO,gBAAkBA,EAAMkI,YAC9D,MAAsB,mBAAR8N,GAAsBA,aAAgBA,GAClDnb,GAAalH,KAAKqiB,IAASza,GAoB/B,IAAIrI,GAAWD,GAAeoE,GAAUpE,IAAgB4Z,GA6BxD,SAASmb,GAAczjC,GACrB,OAAOijC,GAAUjjC,IAAUA,IAAU2E,GAAoB3E,GAAS2E,EAoBpE,IAAIkK,GAAQD,GAAYkE,GAAUlE,IAAa2Z,GAmB/C,SAASgW,GAASv+B,GAChB,MAAuB,iBAATA,IACVob,GAAQpb,IAAUmb,GAAanb,IAAUslB,GAAWtlB,IAAUmG,GAoBpE,SAAS+d,GAASlkB,GAChB,MAAuB,iBAATA,GACXmb,GAAanb,IAAUslB,GAAWtlB,IAAUoG,GAoBjD,IAAI2I,GAAeD,GAAmBgE,GAAUhE,IAAoB0Z,GAmBpE,SAASkb,GAAY1jC,GACnB,OAAOA,IAAU2C,EAoBnB,SAASghC,GAAU3jC,GACjB,OAAOmb,GAAanb,IAAUsiB,GAAOtiB,IAAUsG,GAoBjD,SAASs9B,GAAU5jC,GACjB,OAAOmb,GAAanb,IAAUslB,GAAWtlB,IAAUuG,GA0BrD,IAAIs9B,GAAK/O,GAA0B1L,IAyB/B0a,GAAMhP,IAA0B,SAAS90B,EAAO0lB,GAClD,OAAO1lB,GAAS0lB,KA0BlB,SAAS8X,GAAQx9B,GACf,IAAKA,EACH,MAAO,GAET,GAAIspB,GAAYtpB,GACd,OAAOu+B,GAASv+B,GAASkV,GAAclV,GAASwc,GAAUxc,GAE5D,GAAI+X,IAAe/X,EAAM+X,IACvB,OAAO9D,GAAgBjU,EAAM+X,OAE/B,IAAIsK,EAAMC,GAAOtiB,GACbiP,EAAOoT,GAAO1c,EAAS2O,GAAc+N,GAAOnc,GAAS0O,GAAanE,GAEtE,OAAOxB,EAAKjP,GA0Bd,SAAS60B,GAAS70B,GAChB,IAAKA,EACH,OAAiB,IAAVA,EAAcA,EAAQ,EAG/B,GADAA,EAAQ+0B,GAAS/0B,GACbA,IAAU0E,GAAY1E,KAAW0E,EAAU,CAC7C,IAAIq/B,EAAQ/jC,EAAQ,GAAK,EAAI,EAC7B,OAAO+jC,EAAOn/B,EAEhB,OAAO5E,IAAUA,EAAQA,EAAQ,EA6BnC,SAASokB,GAAUpkB,GACjB,IAAIiQ,EAAS4kB,GAAS70B,GAClBgkC,EAAY/zB,EAAS,EAEzB,OAAOA,IAAWA,EAAU+zB,EAAY/zB,EAAS+zB,EAAY/zB,EAAU,EA8BzE,SAASoU,GAASrkB,GAChB,OAAOA,EAAQ0gB,GAAU0D,GAAUpkB,GAAQ,EAAG8E,GAAoB,EA0BpE,SAASiwB,GAAS/0B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIkkB,GAASlkB,GACX,OAAO6E,EAET,GAAI6W,GAAS1b,GAAQ,CACnB,IAAI0lB,EAAgC,mBAAjB1lB,EAAMgb,QAAwBhb,EAAMgb,UAAYhb,EACnEA,EAAQ0b,GAASgK,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT1lB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ2S,GAAS3S,GACjB,IAAIikC,EAAWl7B,GAAWgL,KAAK/T,GAC/B,OAAQikC,GAAYh7B,GAAU8K,KAAK/T,GAC/BgN,GAAahN,EAAMJ,MAAM,GAAIqkC,EAAW,EAAI,GAC3Cn7B,GAAWiL,KAAK/T,GAAS6E,GAAO7E,EA2BvC,SAASsqB,GAActqB,GACrB,OAAOohB,GAAWphB,EAAOshB,GAAOthB,IA2BlC,SAASkkC,GAAclkC,GACrB,OAAOA,EACH0gB,GAAU0D,GAAUpkB,IAAS2E,EAAkBA,GACpC,IAAV3E,EAAcA,EAAQ,EAwB7B,SAASuW,GAASvW,GAChB,OAAgB,MAATA,EAAgB,GAAKstB,GAAattB,GAqC3C,IAAImkC,GAASlT,IAAe,SAASjf,EAAQtK,GAC3C,GAAIshB,GAAYthB,IAAW4hB,GAAY5hB,GACrC0Z,GAAW1Z,EAAQmP,GAAKnP,GAASsK,QAGnC,IAAK,IAAIT,KAAO7J,EACV8O,GAAepH,KAAK1H,EAAQ6J,IAC9BwP,GAAY/O,EAAQT,EAAK7J,EAAO6J,OAoClC6yB,GAAWnT,IAAe,SAASjf,EAAQtK,GAC7C0Z,GAAW1Z,EAAQ4Z,GAAO5Z,GAASsK,MAgCjCqyB,GAAepT,IAAe,SAASjf,EAAQtK,EAAQmiB,EAAU9H,GACnEX,GAAW1Z,EAAQ4Z,GAAO5Z,GAASsK,EAAQ+P,MA+BzCuiB,GAAarT,IAAe,SAASjf,EAAQtK,EAAQmiB,EAAU9H,GACjEX,GAAW1Z,EAAQmP,GAAKnP,GAASsK,EAAQ+P,MAoBvCwiB,GAAKzR,GAASvR,IAoClB,SAAS7J,GAAOxB,EAAWsuB,GACzB,IAAIv0B,EAASuL,GAAWtF,GACxB,OAAqB,MAAdsuB,EAAqBv0B,EAASkR,GAAWlR,EAAQu0B,GAwB1D,IAAI7uB,GAAW8V,IAAS,SAASzZ,EAAQmf,GACvCnf,EAAS7E,GAAO6E,GAEhB,IAAItC,GAAS,EACTvW,EAASg4B,EAAQh4B,OACjBi4B,EAAQj4B,EAAS,EAAIg4B,EAAQ,GAAKxuB,EAElCyuB,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDj4B,EAAS,GAGX,QAASuW,EAAQvW,EAAQ,CACvB,IAAIuO,EAASypB,EAAQzhB,GACjBgD,EAAQ4O,GAAO5Z,GACf+8B,GAAc,EACdC,EAAchyB,EAAMvZ,OAExB,QAASsrC,EAAaC,EAAa,CACjC,IAAInzB,EAAMmB,EAAM+xB,GACZzkC,EAAQgS,EAAOT,IAEfvR,IAAU2C,GACTke,GAAG7gB,EAAOoW,GAAY7E,MAAUiF,GAAepH,KAAK4C,EAAQT,MAC/DS,EAAOT,GAAO7J,EAAO6J,KAK3B,OAAOS,KAsBL2yB,GAAelZ,IAAS,SAAStc,GAEnC,OADAA,EAAKkF,KAAK1R,EAAWqzB,IACdhnB,GAAM41B,GAAWjiC,EAAWwM,MAsCrC,SAAS01B,GAAQ7yB,EAAQlC,GACvB,OAAOsB,GAAYY,EAAQ0Y,GAAY5a,EAAW,GAAI+T,IAsCxD,SAASihB,GAAY9yB,EAAQlC,GAC3B,OAAOsB,GAAYY,EAAQ0Y,GAAY5a,EAAW,GAAIiU,IA+BxD,SAASghB,GAAM/yB,EAAQxC,GACrB,OAAiB,MAAVwC,EACHA,EACA2S,GAAQ3S,EAAQ0Y,GAAYlb,EAAU,GAAI8R,IA6BhD,SAAS0jB,GAAWhzB,EAAQxC,GAC1B,OAAiB,MAAVwC,EACHA,EACA6S,GAAa7S,EAAQ0Y,GAAYlb,EAAU,GAAI8R,IA+BrD,SAAS2jB,GAAOjzB,EAAQxC,GACtB,OAAOwC,GAAU6R,GAAW7R,EAAQ0Y,GAAYlb,EAAU,IA6B5D,SAAS01B,GAAYlzB,EAAQxC,GAC3B,OAAOwC,GAAU+R,GAAgB/R,EAAQ0Y,GAAYlb,EAAU,IA0BjE,SAAS21B,GAAUnzB,GACjB,OAAiB,MAAVA,EAAiB,GAAK8S,GAAc9S,EAAQ6E,GAAK7E,IA0B1D,SAASozB,GAAYpzB,GACnB,OAAiB,MAAVA,EAAiB,GAAK8S,GAAc9S,EAAQsP,GAAOtP,IA4B5D,SAASjR,GAAIiR,EAAQiT,EAAMoP,GACzB,IAAIpkB,EAAmB,MAAV+B,EAAiBrP,EAAYqiB,GAAQhT,EAAQiT,GAC1D,OAAOhV,IAAWtN,EAAY0xB,EAAepkB,EA8B/C,SAASiD,GAAIlB,EAAQiT,GACnB,OAAiB,MAAVjT,GAAkBylB,GAAQzlB,EAAQiT,EAAMU,IA6BjD,SAASgE,GAAM3X,EAAQiT,GACrB,OAAiB,MAAVjT,GAAkBylB,GAAQzlB,EAAQiT,EAAMW,IAqBjD,IAAIyf,GAASpR,IAAe,SAAShkB,EAAQjQ,EAAOuR,GACrC,MAATvR,GACyB,mBAAlBA,EAAMuW,WACfvW,EAAQ+W,GAAqB3H,KAAKpP,IAGpCiQ,EAAOjQ,GAASuR,IACf0a,GAAStD,KA4BR2c,GAAWrR,IAAe,SAAShkB,EAAQjQ,EAAOuR,GACvC,MAATvR,GACyB,mBAAlBA,EAAMuW,WACfvW,EAAQ+W,GAAqB3H,KAAKpP,IAGhCwW,GAAepH,KAAKa,EAAQjQ,GAC9BiQ,EAAOjQ,GAAOqU,KAAK9C,GAEnBtB,EAAOjQ,GAAS,CAACuR,KAElBmZ,IAoBC6a,GAAS9Z,GAASlF,IA8BtB,SAAS1P,GAAK7E,GACZ,OAAOsX,GAAYtX,GAAU8N,GAAc9N,GAAU+W,GAAS/W,GA0BhE,SAASsP,GAAOtP,GACd,OAAOsX,GAAYtX,GAAU8N,GAAc9N,GAAQ,GAAQiX,GAAWjX,GAwBxE,SAASwzB,GAAQxzB,EAAQxC,GACvB,IAAIS,EAAS,GAMb,OALAT,EAAWkb,GAAYlb,EAAU,GAEjCqU,GAAW7R,GAAQ,SAAShS,EAAOuR,EAAKS,GACtC8O,GAAgB7Q,EAAQT,EAASxP,EAAOuR,EAAKS,GAAShS,MAEjDiQ,EA+BT,SAASw1B,GAAUzzB,EAAQxC,GACzB,IAAIS,EAAS,GAMb,OALAT,EAAWkb,GAAYlb,EAAU,GAEjCqU,GAAW7R,GAAQ,SAAShS,EAAOuR,EAAKS,GACtC8O,GAAgB7Q,EAAQsB,EAAK/B,EAASxP,EAAOuR,EAAKS,OAE7C/B,EAkCT,IAAIy1B,GAAQzU,IAAe,SAASjf,EAAQtK,EAAQmiB,GAClDD,GAAU5X,EAAQtK,EAAQmiB,MAkCxB+a,GAAY3T,IAAe,SAASjf,EAAQtK,EAAQmiB,EAAU9H,GAChE6H,GAAU5X,EAAQtK,EAAQmiB,EAAU9H,MAuBlC4jB,GAAO7S,IAAS,SAAS9gB,EAAQwP,GACnC,IAAIvR,EAAS,GACb,GAAc,MAAV+B,EACF,OAAO/B,EAET,IAAIgS,GAAS,EACbT,EAAQlR,GAASkR,GAAO,SAASyD,GAG/B,OAFAA,EAAOC,GAASD,EAAMjT,GACtBiQ,IAAWA,EAASgD,EAAK9rB,OAAS,GAC3B8rB,KAET7D,GAAWpP,EAAQgR,GAAahR,GAAS/B,GACrCgS,IACFhS,EAAS4R,GAAU5R,EAAQ7M,EAAkBC,EAAkBC,EAAoB2yB,KAErF,IAAI98B,EAASqoB,EAAMroB,OACnB,MAAOA,IACLkyB,GAAUpb,EAAQuR,EAAMroB,IAE1B,OAAO8W,KAuBT,SAAS21B,GAAO5zB,EAAQlC,GACtB,OAAO+1B,GAAO7zB,EAAQ+sB,GAAOrU,GAAY5a,KAoB3C,IAAI8F,GAAOkd,IAAS,SAAS9gB,EAAQwP,GACnC,OAAiB,MAAVxP,EAAiB,GAAK6Y,GAAS7Y,EAAQwP,MAqBhD,SAASqkB,GAAO7zB,EAAQlC,GACtB,GAAc,MAAVkC,EACF,MAAO,GAET,IAAIU,EAAQpC,GAAS0S,GAAahR,IAAS,SAAS8zB,GAClD,MAAO,CAACA,MAGV,OADAh2B,EAAY4a,GAAY5a,GACjBgb,GAAW9Y,EAAQU,GAAO,SAAS1S,EAAOilB,GAC/C,OAAOnV,EAAU9P,EAAOilB,EAAK,OAiCjC,SAAShV,GAAO+B,EAAQiT,EAAMoP,GAC5BpP,EAAOC,GAASD,EAAMjT,GAEtB,IAAItC,GAAS,EACTvW,EAAS8rB,EAAK9rB,OAGbA,IACHA,EAAS,EACT6Y,EAASrP,GAEX,QAAS+M,EAAQvW,EAAQ,CACvB,IAAI6G,EAAkB,MAAVgS,EAAiBrP,EAAYqP,EAAOmT,GAAMF,EAAKvV,KACvD1P,IAAU2C,IACZ+M,EAAQvW,EACR6G,EAAQq0B,GAEVriB,EAAS+S,GAAW/kB,GAASA,EAAMoP,KAAK4C,GAAUhS,EAEpD,OAAOgS,EA+BT,SAAS6C,GAAI7C,EAAQiT,EAAMjlB,GACzB,OAAiB,MAAVgS,EAAiBA,EAAS+Y,GAAQ/Y,EAAQiT,EAAMjlB,GA2BzD,SAAS+lC,GAAQ/zB,EAAQiT,EAAMjlB,EAAO+hB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapf,EAC3C,MAAVqP,EAAiBA,EAAS+Y,GAAQ/Y,EAAQiT,EAAMjlB,EAAO+hB,GA2BhE,IAAIikB,GAAUpQ,GAAc/e,IA0BxBovB,GAAYrQ,GAActU,IAgC9B,SAAS7M,GAAUzC,EAAQxC,EAAUC,GACnC,IAAIoN,EAAQzB,GAAQpJ,GAChBk0B,EAAYrpB,GAAS5D,GAASjH,IAAWjD,GAAaiD,GAG1D,GADAxC,EAAWkb,GAAYlb,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIgiB,EAAOzf,GAAUA,EAAO2R,YAE1BlU,EADEy2B,EACYrpB,EAAQ,IAAI4U,EAAO,GAE1B/V,GAAS1J,IACF+S,GAAW0M,GAAQjW,GAAWjE,GAAavF,IAG3C,GAMlB,OAHCk0B,EAAYv2B,GAAYkU,IAAY7R,GAAQ,SAAShS,EAAO0P,EAAOsC,GAClE,OAAOxC,EAASC,EAAazP,EAAO0P,EAAOsC,MAEtCvC,EA8BT,SAAS02B,GAAMn0B,EAAQiT,GACrB,OAAiB,MAAVjT,GAAwBqZ,GAAUrZ,EAAQiT,GA8BnD,SAASmhB,GAAOp0B,EAAQiT,EAAM0I,GAC5B,OAAiB,MAAV3b,EAAiBA,EAAS0b,GAAW1b,EAAQiT,EAAMoJ,GAAaV,IA2BzE,SAAS0Y,GAAWr0B,EAAQiT,EAAM0I,EAAS5L,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAapf,EAC3C,MAAVqP,EAAiBA,EAAS0b,GAAW1b,EAAQiT,EAAMoJ,GAAaV,GAAU5L,GA6BnF,SAAStR,GAAOuB,GACd,OAAiB,MAAVA,EAAiB,GAAKe,GAAWf,EAAQ6E,GAAK7E,IA2BvD,SAASs0B,GAASt0B,GAChB,OAAiB,MAAVA,EAAiB,GAAKe,GAAWf,EAAQsP,GAAOtP,IAwBzD,SAASu0B,GAAM7kB,EAAQC,EAAOC,GAa5B,OAZIA,IAAUjf,IACZif,EAAQD,EACRA,EAAQhf,GAENif,IAAUjf,IACZif,EAAQmT,GAASnT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAEhCD,IAAUhf,IACZgf,EAAQoT,GAASpT,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAE7BjB,GAAUqU,GAASrT,GAASC,EAAOC,GAyC5C,SAAS4kB,GAAQ9kB,EAAQxE,EAAOC,GAS9B,OARAD,EAAQ2X,GAAS3X,GACbC,IAAQxa,GACVwa,EAAMD,EACNA,EAAQ,GAERC,EAAM0X,GAAS1X,GAEjBuE,EAASqT,GAASrT,GACXmE,GAAYnE,EAAQxE,EAAOC,GAkCpC,SAAStD,GAAO8H,EAAOC,EAAO6kB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBpV,GAAe1P,EAAOC,EAAO6kB,KAC3E7kB,EAAQ6kB,EAAW9jC,GAEjB8jC,IAAa9jC,IACK,kBAATif,GACT6kB,EAAW7kB,EACXA,EAAQjf,GAEe,kBAATgf,IACd8kB,EAAW9kB,EACXA,EAAQhf,IAGRgf,IAAUhf,GAAaif,IAAUjf,GACnCgf,EAAQ,EACRC,EAAQ,IAGRD,EAAQkT,GAASlT,GACbC,IAAUjf,GACZif,EAAQD,EACRA,EAAQ,GAERC,EAAQiT,GAASjT,IAGjBD,EAAQC,EAAO,CACjB,IAAI8kB,EAAO/kB,EACXA,EAAQC,EACRA,EAAQ8kB,EAEV,GAAID,GAAY9kB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIqX,EAAOrf,KACX,OAAOJ,GAAUmI,EAASsX,GAAQrX,EAAQD,EAAQ7U,GAAe,QAAUmsB,EAAO,IAAI9/B,OAAS,KAAOyoB,GAExG,OAAOrB,GAAWoB,EAAOC,GAyB3B,IAAI+kB,GAAY1U,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GAEtD,OADAk3B,EAAOA,EAAKC,cACL52B,GAAUP,EAAQo3B,GAAWF,GAAQA,MAkB9C,SAASE,GAAW71B,GAClB,OAAO81B,GAAWxwB,GAAStF,GAAQ41B,eAqBrC,SAASzU,GAAOnhB,GAEd,OADAA,EAASsF,GAAStF,GACXA,GAAUA,EAAO4B,QAAQ1J,GAASsK,IAAcZ,QAAQ5G,GAAa,IA0B9E,SAAS+6B,GAAS/1B,EAAQg2B,EAAQC,GAChCj2B,EAASsF,GAAStF,GAClBg2B,EAAS3Z,GAAa2Z,GAEtB,IAAI9tC,EAAS8X,EAAO9X,OACpB+tC,EAAWA,IAAavkC,EACpBxJ,EACAunB,GAAU0D,GAAU8iB,GAAW,EAAG/tC,GAEtC,IAAIgkB,EAAM+pB,EAEV,OADAA,GAAYD,EAAO9tC,OACZ+tC,GAAY,GAAKj2B,EAAOrR,MAAMsnC,EAAU/pB,IAAQ8pB,EA+BzD,SAASE,GAAOl2B,GAEd,OADAA,EAASsF,GAAStF,GACVA,GAAUtJ,GAAmBoM,KAAK9C,GACtCA,EAAO4B,QAAQtL,GAAiBmM,IAChCzC,EAkBN,SAASm2B,GAAan2B,GAEpB,OADAA,EAASsF,GAAStF,GACVA,GAAU9I,GAAgB4L,KAAK9C,GACnCA,EAAO4B,QAAQ3K,GAAc,QAC7B+I,EAwBN,IAAIo2B,GAAYpV,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMk3B,EAAKC,iBAuBxCS,GAAYrV,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMk3B,EAAKC,iBAoBxCU,GAAazV,GAAgB,eAyBjC,SAAS0V,GAAIv2B,EAAQ9X,EAAQs7B,GAC3BxjB,EAASsF,GAAStF,GAClB9X,EAASirB,GAAUjrB,GAEnB,IAAIsuC,EAAYtuC,EAAS6b,GAAW/D,GAAU,EAC9C,IAAK9X,GAAUsuC,GAAatuC,EAC1B,OAAO8X,EAET,IAAIwb,GAAOtzB,EAASsuC,GAAa,EACjC,OACEjT,GAAc5b,GAAY6T,GAAMgI,GAChCxjB,EACAujB,GAAc9b,GAAW+T,GAAMgI,GA2BnC,SAASiT,GAAOz2B,EAAQ9X,EAAQs7B,GAC9BxjB,EAASsF,GAAStF,GAClB9X,EAASirB,GAAUjrB,GAEnB,IAAIsuC,EAAYtuC,EAAS6b,GAAW/D,GAAU,EAC9C,OAAQ9X,GAAUsuC,EAAYtuC,EACzB8X,EAASujB,GAAcr7B,EAASsuC,EAAWhT,GAC5CxjB,EA0BN,SAAS02B,GAAS12B,EAAQ9X,EAAQs7B,GAChCxjB,EAASsF,GAAStF,GAClB9X,EAASirB,GAAUjrB,GAEnB,IAAIsuC,EAAYtuC,EAAS6b,GAAW/D,GAAU,EAC9C,OAAQ9X,GAAUsuC,EAAYtuC,EACzBq7B,GAAcr7B,EAASsuC,EAAWhT,GAASxjB,EAC5CA,EA2BN,SAASvT,GAASuT,EAAQ22B,EAAOxW,GAM/B,OALIA,GAAkB,MAATwW,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJjuB,GAAepD,GAAStF,GAAQ4B,QAAQzK,GAAa,IAAKw/B,GAAS,GAyB5E,SAASC,GAAO52B,EAAQuB,EAAG4e,GAMzB,OAJE5e,GADG4e,EAAQC,GAAepgB,EAAQuB,EAAG4e,GAAS5e,IAAM7P,GAChD,EAEAyhB,GAAU5R,GAETgZ,GAAWjV,GAAStF,GAASuB,GAsBtC,SAASK,KACP,IAAI1D,EAAO0iB,UACP5gB,EAASsF,GAASpH,EAAK,IAE3B,OAAOA,EAAKhW,OAAS,EAAI8X,EAASA,EAAO4B,QAAQ1D,EAAK,GAAIA,EAAK,IAwBjE,IAAI24B,GAAY7V,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMk3B,EAAKC,iBAsB5C,SAAS/sC,GAAMmX,EAAQ0pB,EAAWoN,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB1W,GAAepgB,EAAQ0pB,EAAWoN,KACzEpN,EAAYoN,EAAQplC,GAEtBolC,EAAQA,IAAUplC,EAAYmC,EAAmBijC,IAAU,EACtDA,GAGL92B,EAASsF,GAAStF,GACdA,IACsB,iBAAb0pB,GACO,MAAbA,IAAsBhsB,GAASgsB,MAEpCA,EAAYrN,GAAaqN,IACpBA,GAAa7mB,GAAW7C,IACpBud,GAAUtZ,GAAcjE,GAAS,EAAG82B,GAGxC92B,EAAOnX,MAAM6gC,EAAWoN,IAZtB,GAoCX,IAAIC,GAAY/V,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMq3B,GAAWH,MA0BlD,SAASqB,GAAWh3B,EAAQg2B,EAAQC,GAOlC,OANAj2B,EAASsF,GAAStF,GAClBi2B,EAAuB,MAAZA,EACP,EACAxmB,GAAU0D,GAAU8iB,GAAW,EAAGj2B,EAAO9X,QAE7C8tC,EAAS3Z,GAAa2Z,GACfh2B,EAAOrR,MAAMsnC,EAAUA,EAAWD,EAAO9tC,SAAW8tC,EA2G7D,SAASiB,GAASj3B,EAAQ2uB,EAASxO,GAIjC,IAAI+W,EAAWjtB,GAAOwI,iBAElB0N,GAASC,GAAepgB,EAAQ2uB,EAASxO,KAC3CwO,EAAUj9B,GAEZsO,EAASsF,GAAStF,GAClB2uB,EAAUyE,GAAa,GAAIzE,EAASuI,EAAUpS,IAE9C,IAIIqS,EACAC,EALAC,EAAUjE,GAAa,GAAIzE,EAAQ0I,QAASH,EAASG,QAASvS,IAC9DwS,EAAc1xB,GAAKyxB,GACnBE,EAAgBz1B,GAAWu1B,EAASC,GAIpC74B,EAAQ,EACR+4B,EAAc7I,EAAQ6I,aAAer/B,GACrC1B,EAAS,WAGTghC,EAAejhC,IAChBm4B,EAAQuH,QAAU/9B,IAAW1B,OAAS,IACvC+gC,EAAY/gC,OAAS,KACpB+gC,IAAgB3gC,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEk4B,EAAQ+I,UAAYv/B,IAAW1B,OAAS,KACzC,KAMEkhC,EAAY,kBACbpyB,GAAepH,KAAKwwB,EAAS,cACzBA,EAAQgJ,UAAY,IAAI/1B,QAAQ,MAAO,KACvC,6BAA+BtG,GAAmB,KACnD,KAEN0E,EAAO4B,QAAQ61B,GAAc,SAASv3B,EAAO03B,EAAaC,EAAkBC,EAAiBC,EAAe/oC,GAsB1G,OArBA6oC,IAAqBA,EAAmBC,GAGxCrhC,GAAUuJ,EAAOrR,MAAM8P,EAAOzP,GAAQ4S,QAAQxJ,GAAmBsK,IAG7Dk1B,IACFT,GAAa,EACb1gC,GAAU,YAAcmhC,EAAc,UAEpCG,IACFX,GAAe,EACf3gC,GAAU,OAASshC,EAAgB,eAEjCF,IACFphC,GAAU,iBAAmBohC,EAAmB,+BAElDp5B,EAAQzP,EAASkR,EAAMhY,OAIhBgY,KAGTzJ,GAAU,OAIV,IAAIuhC,EAAWzyB,GAAepH,KAAKwwB,EAAS,aAAeA,EAAQqJ,SACnE,GAAKA,GAKA,GAAIvgC,GAA2BqL,KAAKk1B,GACvC,MAAM,IAAIpzB,EAAM7S,QALhB0E,EAAS,iBAAmBA,EAAS,QASvCA,GAAU2gC,EAAe3gC,EAAOmL,QAAQ1L,GAAsB,IAAMO,GACjEmL,QAAQzL,GAAqB,MAC7ByL,QAAQxL,GAAuB,OAGlCK,EAAS,aAAeuhC,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ3gC,EACA,gBAEF,IAAIuI,EAASi5B,IAAQ,WACnB,OAAO37B,GAASg7B,EAAaK,EAAY,UAAYlhC,GAClDsH,MAAMrM,EAAW6lC,MAMtB,GADAv4B,EAAOvI,OAASA,EACZs7B,GAAQ/yB,GACV,MAAMA,EAER,OAAOA,EAwBT,SAASk5B,GAAQnpC,GACf,OAAOuW,GAASvW,GAAO6mC,cAwBzB,SAASuC,GAAQppC,GACf,OAAOuW,GAASvW,GAAOqpC,cAyBzB,SAASC,GAAKr4B,EAAQwjB,EAAOrD,GAE3B,GADAngB,EAASsF,GAAStF,GACdA,IAAWmgB,GAASqD,IAAU9xB,GAChC,OAAOgQ,GAAS1B,GAElB,IAAKA,KAAYwjB,EAAQnH,GAAamH,IACpC,OAAOxjB,EAET,IAAImC,EAAa8B,GAAcjE,GAC3BoC,EAAa6B,GAAcuf,GAC3BvX,EAAQ/J,GAAgBC,EAAYC,GACpC8J,EAAM7J,GAAcF,EAAYC,GAAc,EAElD,OAAOmb,GAAUpb,EAAY8J,EAAOC,GAAKzR,KAAK,IAsBhD,SAAS69B,GAAQt4B,EAAQwjB,EAAOrD,GAE9B,GADAngB,EAASsF,GAAStF,GACdA,IAAWmgB,GAASqD,IAAU9xB,GAChC,OAAOsO,EAAOrR,MAAM,EAAGgT,GAAgB3B,GAAU,GAEnD,IAAKA,KAAYwjB,EAAQnH,GAAamH,IACpC,OAAOxjB,EAET,IAAImC,EAAa8B,GAAcjE,GAC3BkM,EAAM7J,GAAcF,EAAY8B,GAAcuf,IAAU,EAE5D,OAAOjG,GAAUpb,EAAY,EAAG+J,GAAKzR,KAAK,IAsB5C,SAAS89B,GAAUv4B,EAAQwjB,EAAOrD,GAEhC,GADAngB,EAASsF,GAAStF,GACdA,IAAWmgB,GAASqD,IAAU9xB,GAChC,OAAOsO,EAAO4B,QAAQzK,GAAa,IAErC,IAAK6I,KAAYwjB,EAAQnH,GAAamH,IACpC,OAAOxjB,EAET,IAAImC,EAAa8B,GAAcjE,GAC3BiM,EAAQ/J,GAAgBC,EAAY8B,GAAcuf,IAEtD,OAAOjG,GAAUpb,EAAY8J,GAAOxR,KAAK,IAwC3C,SAAS+9B,GAASx4B,EAAQ2uB,GACxB,IAAIzmC,EAASgL,EACTulC,EAAWtlC,EAEf,GAAIsX,GAASkkB,GAAU,CACrB,IAAIjF,EAAY,cAAeiF,EAAUA,EAAQjF,UAAYA,EAC7DxhC,EAAS,WAAYymC,EAAUxb,GAAUwb,EAAQzmC,QAAUA,EAC3DuwC,EAAW,aAAc9J,EAAUtS,GAAasS,EAAQ8J,UAAYA,EAEtEz4B,EAASsF,GAAStF,GAElB,IAAIw2B,EAAYx2B,EAAO9X,OACvB,GAAI2a,GAAW7C,GAAS,CACtB,IAAImC,EAAa8B,GAAcjE,GAC/Bw2B,EAAYr0B,EAAWja,OAEzB,GAAIA,GAAUsuC,EACZ,OAAOx2B,EAET,IAAIkM,EAAMhkB,EAAS6b,GAAW00B,GAC9B,GAAIvsB,EAAM,EACR,OAAOusB,EAET,IAAIz5B,EAASmD,EACTob,GAAUpb,EAAY,EAAG+J,GAAKzR,KAAK,IACnCuF,EAAOrR,MAAM,EAAGud,GAEpB,GAAIwd,IAAch4B,EAChB,OAAOsN,EAASy5B,EAKlB,GAHIt2B,IACF+J,GAAQlN,EAAO9W,OAASgkB,GAEtBxO,GAASgsB,IACX,GAAI1pB,EAAOrR,MAAMud,GAAKwsB,OAAOhP,GAAY,CACvC,IAAIxpB,EACAy4B,EAAY35B,EAEX0qB,EAAUztB,SACbytB,EAAYlzB,GAAOkzB,EAAUjzB,OAAQ6O,GAAS1N,GAAQ+N,KAAK+jB,IAAc,MAE3EA,EAAUrlB,UAAY,EACtB,MAAQnE,EAAQwpB,EAAU/jB,KAAKgzB,GAC7B,IAAIC,EAAS14B,EAAMzB,MAErBO,EAASA,EAAOrQ,MAAM,EAAGiqC,IAAWlnC,EAAYwa,EAAM0sB,SAEnD,GAAI54B,EAAOlX,QAAQuzB,GAAaqN,GAAYxd,IAAQA,EAAK,CAC9D,IAAIzN,EAAQO,EAAO2qB,YAAYD,GAC3BjrB,GAAS,IACXO,EAASA,EAAOrQ,MAAM,EAAG8P,IAG7B,OAAOO,EAASy5B,EAsBlB,SAASI,GAAS74B,GAEhB,OADAA,EAASsF,GAAStF,GACVA,GAAUzJ,GAAiBuM,KAAK9C,GACpCA,EAAO4B,QAAQvL,GAAe+N,IAC9BpE,EAuBN,IAAI84B,GAAY9X,IAAiB,SAAShiB,EAAQ22B,EAAMl3B,GACtD,OAAOO,GAAUP,EAAQ,IAAM,IAAMk3B,EAAKyC,iBAoBxCtC,GAAajV,GAAgB,eAqBjC,SAASK,GAAMlhB,EAAQoX,EAAS+I,GAI9B,OAHAngB,EAASsF,GAAStF,GAClBoX,EAAU+I,EAAQzuB,EAAY0lB,EAE1BA,IAAY1lB,EACPqR,GAAe/C,GAAUsE,GAAatE,GAAUC,GAAWD,GAE7DA,EAAOE,MAAMkX,IAAY,GA2BlC,IAAI6gB,GAAUzd,IAAS,SAASxc,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMtM,EAAWwM,GAC9B,MAAO/N,GACP,OAAO4hC,GAAQ5hC,GAAKA,EAAI,IAAIyU,EAAMzU,OA8BlC4oC,GAAUlX,IAAS,SAAS9gB,EAAQi4B,GAKtC,OAJAt6B,GAAUs6B,GAAa,SAAS14B,GAC9BA,EAAM4T,GAAM5T,GACZuP,GAAgB9O,EAAQT,EAAKguB,GAAKvtB,EAAOT,GAAMS,OAE1CA,KAgCT,SAASk4B,GAAKrqB,GACZ,IAAI1mB,EAAkB,MAAT0mB,EAAgB,EAAIA,EAAM1mB,OACnC+6B,EAAaxJ,KASjB,OAPA7K,EAAS1mB,EAAcmX,GAASuP,GAAO,SAAS6V,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAI1f,GAAUjT,GAEtB,MAAO,CAACmxB,EAAWwB,EAAK,IAAKA,EAAK,OAJlB,GAOXjK,IAAS,SAAStc,GACvB,IAAIO,GAAS,EACb,QAASA,EAAQvW,EAAQ,CACvB,IAAIu8B,EAAO7V,EAAMnQ,GACjB,GAAIV,GAAM0mB,EAAK,GAAI17B,KAAMmV,GACvB,OAAOH,GAAM0mB,EAAK,GAAI17B,KAAMmV,OA8BpC,SAASg7B,GAASziC,GAChB,OAAOwb,GAAarB,GAAUna,EAAQtE,IAsBxC,SAAS6oB,GAASjsB,GAChB,OAAO,WACL,OAAOA,GAwBX,SAASoqC,GAAUpqC,EAAOq0B,GACxB,OAAiB,MAATr0B,GAAiBA,IAAUA,EAASq0B,EAAer0B,EAyB7D,IAAIvG,GAAOo5B,KAuBPwX,GAAYxX,IAAW,GAkB3B,SAASlK,GAAS3oB,GAChB,OAAOA,EA6CT,SAASwP,GAASP,GAChB,OAAOyZ,GAA4B,mBAARzZ,EAAqBA,EAAO4S,GAAU5S,EAAM7L,IAsCzE,SAASknC,GAAQ5iC,GACf,OAAOmhB,GAAYhH,GAAUna,EAAQtE,IAoCvC,SAASmnC,GAAgBtlB,EAAMiD,GAC7B,OAAOU,GAAoB3D,EAAMpD,GAAUqG,EAAU9kB,IA2BvD,IAAIonC,GAAS/e,IAAS,SAASxG,EAAM9V,GACnC,OAAO,SAAS6C,GACd,OAAOuU,GAAWvU,EAAQiT,EAAM9V,OA2BhCs7B,GAAWhf,IAAS,SAASzZ,EAAQ7C,GACvC,OAAO,SAAS8V,GACd,OAAOsB,GAAWvU,EAAQiT,EAAM9V,OAwCpC,SAASu7B,GAAM14B,EAAQtK,EAAQk4B,GAC7B,IAAIltB,EAAQmE,GAAKnP,GACbuiC,EAAcnlB,GAAcpd,EAAQgL,GAEzB,MAAXktB,GACElkB,GAAShU,KAAYuiC,EAAY9wC,SAAWuZ,EAAMvZ,UACtDymC,EAAUl4B,EACVA,EAASsK,EACTA,EAAShY,KACTiwC,EAAcnlB,GAAcpd,EAAQmP,GAAKnP,KAE3C,IAAIu1B,IAAUvhB,GAASkkB,IAAY,UAAWA,MAAcA,EAAQ3C,MAChE1a,EAASwC,GAAW/S,GAqBxB,OAnBArC,GAAUs6B,GAAa,SAASlY,GAC9B,IAAI9iB,EAAOvH,EAAOqqB,GAClB/f,EAAO+f,GAAc9iB,EACjBsT,IACFvQ,EAAOkE,UAAU6b,GAAc,WAC7B,IAAInW,EAAW5hB,KAAK+hB,UACpB,GAAIkhB,GAASrhB,EAAU,CACrB,IAAI3L,EAAS+B,EAAOhY,KAAK6hB,aACrBiS,EAAU7d,EAAO6L,YAAcU,GAAUxiB,KAAK8hB,aAIlD,OAFAgS,EAAQzZ,KAAK,CAAE,KAAQpF,EAAM,KAAQ4iB,UAAW,QAAW7f,IAC3D/B,EAAO8L,UAAYH,EACZ3L,EAET,OAAOhB,EAAKD,MAAMgD,EAAQxB,GAAU,CAACxW,KAAKgG,SAAU6xB,iBAKnD7f,EAgBT,SAAS24B,KAIP,OAHIr9B,GAAKoI,IAAM1b,OACbsT,GAAKoI,EAAIuB,IAEJjd,KAeT,SAAS27B,MAwBT,SAASiV,GAAOp4B,GAEd,OADAA,EAAI4R,GAAU5R,GACPiZ,IAAS,SAAStc,GACvB,OAAOob,GAAQpb,EAAMqD,MAsBzB,IAAIq4B,GAAOvW,GAAWhkB,IA8BlBw6B,GAAYxW,GAAWzkB,IAiCvBk7B,GAAWzW,GAAWzjB,IAwB1B,SAASiY,GAAS7D,GAChB,OAAOwE,GAAMxE,GAAQlU,GAAaoU,GAAMF,IAAS+F,GAAiB/F,GAwBpE,SAAS+lB,GAAWh5B,GAClB,OAAO,SAASiT,GACd,OAAiB,MAAVjT,EAAiBrP,EAAYqiB,GAAQhT,EAAQiT,IA6CxD,IAAIgmB,GAAQrW,KAsCRsW,GAAatW,IAAY,GAoB7B,SAAS0C,KACP,MAAO,GAgBT,SAASY,KACP,OAAO,EAqBT,SAASiT,KACP,MAAO,GAgBT,SAASC,KACP,MAAO,GAgBT,SAASC,KACP,OAAO,EAsBT,SAASC,GAAM94B,EAAGhD,GAEhB,GADAgD,EAAI4R,GAAU5R,GACVA,EAAI,GAAKA,EAAI7N,EACf,MAAO,GAET,IAAI+K,EAAQ5K,EACR3L,EAASqgB,GAAUhH,EAAG1N,GAE1B0K,EAAWkb,GAAYlb,GACvBgD,GAAK1N,EAEL,IAAImL,EAASsC,GAAUpZ,EAAQqW,GAC/B,QAASE,EAAQ8C,EACfhD,EAASE,GAEX,OAAOO,EAoBT,SAASs7B,GAAOvrC,GACd,OAAIob,GAAQpb,GACHsQ,GAAStQ,EAAOmlB,IAElBjB,GAASlkB,GAAS,CAACA,GAASwc,GAAU8R,GAAa/X,GAASvW,KAoBrE,SAASwrC,GAASC,GAChB,IAAInyC,IAAOmd,GACX,OAAOF,GAASk1B,GAAUnyC,EAoB5B,IAAIwI,GAAMqyB,IAAoB,SAASuX,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBChzB,GAAO6c,GAAY,QAiBnBoW,GAASzX,IAAoB,SAAS0X,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBCjzB,GAAQ2c,GAAY,SAoBxB,SAASjc,GAAIjK,GACX,OAAQA,GAASA,EAAMnW,OACnB8qB,GAAa3U,EAAOqZ,GAAUlD,IAC9B9iB,EA0BN,SAASopC,GAAMz8B,EAAOE,GACpB,OAAQF,GAASA,EAAMnW,OACnB8qB,GAAa3U,EAAOob,GAAYlb,EAAU,GAAIiW,IAC9C9iB,EAiBN,SAASqpC,GAAK18B,GACZ,OAAOwC,GAASxC,EAAOqZ,IA0BzB,SAASsjB,GAAO38B,EAAOE,GACrB,OAAOsC,GAASxC,EAAOob,GAAYlb,EAAU,IAqB/C,SAASiK,GAAInK,GACX,OAAQA,GAASA,EAAMnW,OACnB8qB,GAAa3U,EAAOqZ,GAAUS,IAC9BzmB,EA0BN,SAASupC,GAAM58B,EAAOE,GACpB,OAAQF,GAASA,EAAMnW,OACnB8qB,GAAa3U,EAAOob,GAAYlb,EAAU,GAAI4Z,IAC9CzmB,EAkBN,IAAIwpC,GAAWhY,IAAoB,SAASiY,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQ9W,GAAY,SAiBpBl0B,GAAW6yB,IAAoB,SAASoY,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgBH,SAASC,GAAIn9B,GACX,OAAQA,GAASA,EAAMnW,OACnB4Y,GAAQzC,EAAOqZ,IACf,EA0BN,SAAS+jB,GAAMp9B,EAAOE,GACpB,OAAQF,GAASA,EAAMnW,OACnB4Y,GAAQzC,EAAOob,GAAYlb,EAAU,IACrC,EAgjBN,OA1iBA0L,GAAOmkB,MAAQA,GACfnkB,GAAOwY,IAAMA,GACbxY,GAAOipB,OAASA,GAChBjpB,GAAOkpB,SAAWA,GAClBlpB,GAAOmpB,aAAeA,GACtBnpB,GAAOopB,WAAaA,GACpBppB,GAAOqpB,GAAKA,GACZrpB,GAAOokB,OAASA,GAChBpkB,GAAOqkB,KAAOA,GACdrkB,GAAO8uB,QAAUA,GACjB9uB,GAAOskB,QAAUA,GACjBtkB,GAAOknB,UAAYA,GACnBlnB,GAAO+hB,MAAQA,GACf/hB,GAAOme,MAAQA,GACfne,GAAOoe,QAAUA,GACjBpe,GAAOqe,OAASA,GAChBre,GAAOgvB,KAAOA,GACdhvB,GAAOivB,SAAWA,GAClBjvB,GAAO+Q,SAAWA,GAClB/Q,GAAO4iB,QAAUA,GACjB5iB,GAAOxD,OAASA,GAChBwD,GAAOukB,MAAQA,GACfvkB,GAAOwkB,WAAaA,GACpBxkB,GAAOykB,SAAWA,GAClBzkB,GAAOvF,SAAWA,GAClBuF,GAAOypB,aAAeA,GACtBzpB,GAAOimB,MAAQA,GACfjmB,GAAOkmB,MAAQA,GACflmB,GAAOse,WAAaA,GACpBte,GAAOue,aAAeA,GACtBve,GAAOwe,eAAiBA,GACxBxe,GAAOye,KAAOA,GACdze,GAAO0e,UAAYA,GACnB1e,GAAO2e,eAAiBA,GACxB3e,GAAO4e,UAAYA,GACnB5e,GAAO6e,KAAOA,GACd7e,GAAO5b,OAASA,GAChB4b,GAAOgjB,QAAUA,GACjBhjB,GAAOijB,YAAcA,GACrBjjB,GAAOkjB,aAAeA,GACtBljB,GAAO+b,QAAUA,GACjB/b,GAAOgf,YAAcA,GACrBhf,GAAOif,aAAeA,GACtBjf,GAAOmmB,KAAOA,GACdnmB,GAAOzhB,KAAOA,GACdyhB,GAAOmvB,UAAYA,GACnBnvB,GAAOkf,UAAYA,GACnBlf,GAAOiqB,UAAYA,GACnBjqB,GAAOkqB,YAAcA,GACrBlqB,GAAOojB,QAAUA,GACjBpjB,GAAOof,QAAUA,GACjBpf,GAAOqf,aAAeA,GACtBrf,GAAOuf,eAAiBA,GACxBvf,GAAOwf,iBAAmBA,GAC1Bxf,GAAOmqB,OAASA,GAChBnqB,GAAOoqB,SAAWA,GAClBpqB,GAAOsjB,UAAYA,GACnBtjB,GAAO1L,SAAWA,GAClB0L,GAAOujB,MAAQA,GACfvjB,GAAOrE,KAAOA,GACdqE,GAAOoG,OAASA,GAChBpG,GAAOnZ,IAAMA,GACbmZ,GAAOsqB,QAAUA,GACjBtqB,GAAOuqB,UAAYA,GACnBvqB,GAAOovB,QAAUA,GACjBpvB,GAAOqvB,gBAAkBA,GACzBrvB,GAAOkd,QAAUA,GACjBld,GAAOwqB,MAAQA,GACfxqB,GAAO0pB,UAAYA,GACnB1pB,GAAOsvB,OAASA,GAChBtvB,GAAOuvB,SAAWA,GAClBvvB,GAAOwvB,MAAQA,GACfxvB,GAAO6jB,OAASA,GAChB7jB,GAAO0vB,OAASA,GAChB1vB,GAAOyqB,KAAOA,GACdzqB,GAAO0qB,OAASA,GAChB1qB,GAAOumB,KAAOA,GACdvmB,GAAOwjB,QAAUA,GACjBxjB,GAAO2vB,KAAOA,GACd3vB,GAAOwmB,SAAWA,GAClBxmB,GAAO4vB,UAAYA,GACnB5vB,GAAO6vB,SAAWA,GAClB7vB,GAAO0mB,QAAUA,GACjB1mB,GAAO2mB,aAAeA,GACtB3mB,GAAOyjB,UAAYA,GACnBzjB,GAAOtF,KAAOA,GACdsF,GAAO2qB,OAASA,GAChB3qB,GAAO4N,SAAWA,GAClB5N,GAAO8vB,WAAaA,GACpB9vB,GAAO4f,KAAOA,GACd5f,GAAO6f,QAAUA,GACjB7f,GAAO8f,UAAYA,GACnB9f,GAAO+f,YAAcA,GACrB/f,GAAOggB,OAASA,GAChBhgB,GAAO+vB,MAAQA,GACf/vB,GAAOgwB,WAAaA,GACpBhwB,GAAO4mB,MAAQA,GACf5mB,GAAO4jB,OAASA,GAChB5jB,GAAOigB,OAASA,GAChBjgB,GAAO6mB,KAAOA,GACd7mB,GAAOnB,QAAUA,GACjBmB,GAAO+jB,WAAaA,GACpB/jB,GAAOrG,IAAMA,GACbqG,GAAO6qB,QAAUA,GACjB7qB,GAAOgkB,QAAUA,GACjBhkB,GAAOtb,MAAQA,GACfsb,GAAOkkB,OAASA,GAChBlkB,GAAOwgB,WAAaA,GACpBxgB,GAAOygB,aAAeA,GACtBzgB,GAAOphB,MAAQA,GACfohB,GAAO8mB,OAASA,GAChB9mB,GAAO0gB,KAAOA,GACd1gB,GAAO2gB,KAAOA,GACd3gB,GAAO4gB,UAAYA,GACnB5gB,GAAO6gB,eAAiBA,GACxB7gB,GAAO8gB,UAAYA,GACnB9gB,GAAOgiB,IAAMA,GACbhiB,GAAO+mB,SAAWA,GAClB/mB,GAAO+X,KAAOA,GACd/X,GAAOsiB,QAAUA,GACjBtiB,GAAO8qB,QAAUA,GACjB9qB,GAAO+qB,UAAYA,GACnB/qB,GAAOqwB,OAASA,GAChBrwB,GAAOoP,cAAgBA,GACvBpP,GAAOzG,UAAYA,GACnByG,GAAOgnB,MAAQA,GACfhnB,GAAO+gB,MAAQA,GACf/gB,GAAOghB,QAAUA,GACjBhhB,GAAOihB,UAAYA,GACnBjhB,GAAOkhB,KAAOA,GACdlhB,GAAOmhB,OAASA,GAChBnhB,GAAOohB,SAAWA,GAClBphB,GAAOirB,MAAQA,GACfjrB,GAAOqhB,MAAQA,GACfrhB,GAAOshB,UAAYA,GACnBthB,GAAOkrB,OAASA,GAChBlrB,GAAOmrB,WAAaA,GACpBnrB,GAAOzK,OAASA,GAChByK,GAAOorB,SAAWA,GAClBprB,GAAOuhB,QAAUA,GACjBvhB,GAAOiX,MAAQA,GACfjX,GAAOinB,KAAOA,GACdjnB,GAAOwhB,IAAMA,GACbxhB,GAAOyhB,MAAQA,GACfzhB,GAAO0hB,QAAUA,GACjB1hB,GAAO2hB,IAAMA,GACb3hB,GAAO4hB,UAAYA,GACnB5hB,GAAO6hB,cAAgBA,GACvB7hB,GAAO8hB,QAAUA,GAGjB9hB,GAAO0C,QAAUooB,GACjB9qB,GAAOyxB,UAAY1G,GACnB/qB,GAAO0xB,OAASxI,GAChBlpB,GAAO2xB,WAAaxI,GAGpBqG,GAAMxvB,GAAQA,IAKdA,GAAOpZ,IAAMA,GACboZ,GAAOguB,QAAUA,GACjBhuB,GAAOyrB,UAAYA,GACnBzrB,GAAO4rB,WAAaA,GACpB5rB,GAAOvC,KAAOA,GACduC,GAAOqrB,MAAQA,GACfrrB,GAAOwB,MAAQA,GACfxB,GAAOonB,UAAYA,GACnBpnB,GAAOqnB,cAAgBA,GACvBrnB,GAAOmnB,UAAYA,GACnBnnB,GAAOsnB,WAAaA,GACpBtnB,GAAOkX,OAASA,GAChBlX,GAAOkvB,UAAYA,GACnBlvB,GAAO0wB,OAASA,GAChB1wB,GAAO8rB,SAAWA,GAClB9rB,GAAO2F,GAAKA,GACZ3F,GAAOisB,OAASA,GAChBjsB,GAAOksB,aAAeA,GACtBlsB,GAAO6iB,MAAQA,GACf7iB,GAAO8iB,KAAOA,GACd9iB,GAAO8e,UAAYA,GACnB9e,GAAO2pB,QAAUA,GACjB3pB,GAAO+iB,SAAWA,GAClB/iB,GAAO+e,cAAgBA,GACvB/e,GAAO4pB,YAAcA,GACrB5pB,GAAOrC,MAAQA,GACfqC,GAAO/c,QAAUA,GACjB+c,GAAOmjB,aAAeA,GACtBnjB,GAAO6pB,MAAQA,GACf7pB,GAAO8pB,WAAaA,GACpB9pB,GAAO+pB,OAASA,GAChB/pB,GAAOgqB,YAAcA,GACrBhqB,GAAOna,IAAMA,GACbma,GAAOunB,GAAKA,GACZvnB,GAAOwnB,IAAMA,GACbxnB,GAAOhI,IAAMA,GACbgI,GAAOyO,MAAQA,GACfzO,GAAOmf,KAAOA,GACdnf,GAAOyN,SAAWA,GAClBzN,GAAO7c,SAAWA,GAClB6c,GAAOnhB,QAAUA,GACjBmhB,GAAOsrB,QAAUA,GACjBtrB,GAAOqqB,OAASA,GAChBrqB,GAAO+E,YAAcA,GACrB/E,GAAOE,QAAUA,GACjBF,GAAO7M,cAAgBA,GACvB6M,GAAOoO,YAAcA,GACrBpO,GAAOiP,kBAAoBA,GAC3BjP,GAAOynB,UAAYA,GACnBznB,GAAOjC,SAAWA,GAClBiC,GAAO3M,OAASA,GAChB2M,GAAO0nB,UAAYA,GACnB1nB,GAAO2nB,QAAUA,GACjB3nB,GAAO4nB,QAAUA,GACjB5nB,GAAO6nB,YAAcA,GACrB7nB,GAAO8nB,QAAUA,GACjB9nB,GAAO/B,SAAWA,GAClB+B,GAAO6J,WAAaA,GACpB7J,GAAO+nB,UAAYA,GACnB/nB,GAAOuN,SAAWA,GAClBvN,GAAOzM,MAAQA,GACfyM,GAAOgoB,QAAUA,GACjBhoB,GAAOioB,YAAcA,GACrBjoB,GAAOkoB,MAAQA,GACfloB,GAAOooB,SAAWA,GAClBpoB,GAAOsoB,MAAQA,GACftoB,GAAOqoB,OAASA,GAChBroB,GAAOmoB,SAAWA,GAClBnoB,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOmP,cAAgBA,GACvBnP,GAAOvM,SAAWA,GAClBuM,GAAOuoB,cAAgBA,GACvBvoB,GAAOrM,MAAQA,GACfqM,GAAOqjB,SAAWA,GAClBrjB,GAAOgJ,SAAWA,GAClBhJ,GAAOnM,aAAeA,GACtBmM,GAAOwoB,YAAcA,GACrBxoB,GAAOyoB,UAAYA,GACnBzoB,GAAO0oB,UAAYA,GACnB1oB,GAAOxP,KAAOA,GACdwP,GAAOmsB,UAAYA,GACnBnsB,GAAOuL,KAAOA,GACdvL,GAAO0f,YAAcA,GACrB1f,GAAOosB,UAAYA,GACnBpsB,GAAOqsB,WAAaA,GACpBrsB,GAAO2oB,GAAKA,GACZ3oB,GAAO4oB,IAAMA,GACb5oB,GAAO3B,IAAMA,GACb2B,GAAO6wB,MAAQA,GACf7wB,GAAO8wB,KAAOA,GACd9wB,GAAO+wB,OAASA,GAChB/wB,GAAOzB,IAAMA,GACbyB,GAAOgxB,MAAQA,GACfhxB,GAAOoc,UAAYA,GACnBpc,GAAOgd,UAAYA,GACnBhd,GAAOiwB,WAAaA,GACpBjwB,GAAOkwB,WAAaA,GACpBlwB,GAAOmwB,SAAWA,GAClBnwB,GAAOixB,SAAWA,GAClBjxB,GAAO2f,IAAMA,GACb3f,GAAOyvB,WAAaA,GACpBzvB,GAAOya,KAAOA,GACdza,GAAO3C,IAAMA,GACb2C,GAAOssB,IAAMA,GACbtsB,GAAOwsB,OAASA,GAChBxsB,GAAOysB,SAAWA,GAClBzsB,GAAOxd,SAAWA,GAClBwd,GAAOrB,OAASA,GAChBqB,GAAO0jB,OAASA,GAChB1jB,GAAO2jB,YAAcA,GACrB3jB,GAAO2sB,OAASA,GAChB3sB,GAAOrI,QAAUA,GACjBqI,GAAOjL,OAASA,GAChBiL,GAAOoxB,MAAQA,GACfpxB,GAAO1F,aAAeA,EACtB0F,GAAO8jB,OAASA,GAChB9jB,GAAO3G,KAAOA,GACd2G,GAAO4sB,UAAYA,GACnB5sB,GAAOikB,KAAOA,GACdjkB,GAAOkgB,YAAcA,GACrBlgB,GAAOmgB,cAAgBA,GACvBngB,GAAOogB,cAAgBA,GACvBpgB,GAAOqgB,gBAAkBA,GACzBrgB,GAAOsgB,kBAAoBA,GAC3BtgB,GAAOugB,kBAAoBA,GAC3BvgB,GAAO8sB,UAAYA,GACnB9sB,GAAO+sB,WAAaA,GACpB/sB,GAAO5Z,SAAWA,GAClB4Z,GAAOuxB,IAAMA,GACbvxB,GAAOwxB,MAAQA,GACfxxB,GAAOgtB,SAAWA,GAClBhtB,GAAOowB,MAAQA,GACfpwB,GAAO2Z,SAAWA,GAClB3Z,GAAOkJ,UAAYA,GACnBlJ,GAAOmJ,SAAWA,GAClBnJ,GAAOiuB,QAAUA,GACjBjuB,GAAO6Z,SAAWA,GAClB7Z,GAAOgpB,cAAgBA,GACvBhpB,GAAO3E,SAAWA,GAClB2E,GAAOkuB,QAAUA,GACjBluB,GAAOouB,KAAOA,GACdpuB,GAAOquB,QAAUA,GACjBruB,GAAOsuB,UAAYA,GACnBtuB,GAAOuuB,SAAWA,GAClBvuB,GAAO4uB,SAAWA,GAClB5uB,GAAOswB,SAAWA,GAClBtwB,GAAO6uB,UAAYA,GACnB7uB,GAAO6rB,WAAaA,GAGpB7rB,GAAO4xB,KAAO3uC,GACd+c,GAAO6xB,UAAY1O,GACnBnjB,GAAO8xB,MAAQ3S,GAEfqQ,GAAMxvB,GAAS,WACb,IAAIxT,EAAS,GAMb,OALAmc,GAAW3I,IAAQ,SAASjM,EAAM8iB,GAC3Bvb,GAAepH,KAAK8L,GAAOhF,UAAW6b,KACzCrqB,EAAOqqB,GAAc9iB,MAGlBvH,EAPK,GAQR,CAAE,OAAS,IAWjBwT,GAAOtY,QAAUA,EAGjB+M,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASoiB,GACxF7W,GAAO6W,GAAYve,YAAc0H,MAInCvL,GAAU,CAAC,OAAQ,SAAS,SAASoiB,EAAYriB,GAC/C2L,GAAYnF,UAAU6b,GAAc,SAASvf,GAC3CA,EAAIA,IAAM7P,EAAY,EAAI2W,GAAU8K,GAAU5R,GAAI,GAElD,IAAIvC,EAAUjW,KAAKmiB,eAAiBzM,EAChC,IAAI2L,GAAYrhB,MAChBA,KAAK0iB,QAUT,OARIzM,EAAOkM,aACTlM,EAAOoM,cAAgB7C,GAAUhH,EAAGvC,EAAOoM,eAE3CpM,EAAOqM,UAAUjI,KAAK,CACpB,KAAQmF,GAAUhH,EAAG1N,GACrB,KAAQitB,GAAc9hB,EAAOiM,QAAU,EAAI,QAAU,MAGlDjM,GAGToL,GAAYnF,UAAU6b,EAAa,SAAW,SAASvf,GACrD,OAAOxY,KAAK+f,UAAUgY,GAAYvf,GAAGuH,cAKzCpK,GAAU,CAAC,SAAU,MAAO,cAAc,SAASoiB,EAAYriB,GAC7D,IAAIvT,EAAOuT,EAAQ,EACfu9B,EAAW9wC,GAAQoI,GAAoBpI,GAAQsI,EAEnD4W,GAAYnF,UAAU6b,GAAc,SAASviB,GAC3C,IAAIS,EAASjW,KAAK0iB,QAMlB,OALAzM,EAAOmM,cAAc/H,KAAK,CACxB,SAAYqW,GAAYlb,EAAU,GAClC,KAAQrT,IAEV8T,EAAOkM,aAAelM,EAAOkM,cAAgB8wB,EACtCh9B,MAKXN,GAAU,CAAC,OAAQ,SAAS,SAASoiB,EAAYriB,GAC/C,IAAIw9B,EAAW,QAAUx9B,EAAQ,QAAU,IAE3C2L,GAAYnF,UAAU6b,GAAc,WAClC,OAAO/3B,KAAKkzC,GAAU,GAAGltC,QAAQ,OAKrC2P,GAAU,CAAC,UAAW,SAAS,SAASoiB,EAAYriB,GAClD,IAAIy9B,EAAW,QAAUz9B,EAAQ,GAAK,SAEtC2L,GAAYnF,UAAU6b,GAAc,WAClC,OAAO/3B,KAAKmiB,aAAe,IAAId,GAAYrhB,MAAQA,KAAKmzC,GAAU,OAItE9xB,GAAYnF,UAAUojB,QAAU,WAC9B,OAAOt/B,KAAKsF,OAAOqpB,KAGrBtN,GAAYnF,UAAU8nB,KAAO,SAASluB,GACpC,OAAO9V,KAAKsF,OAAOwQ,GAAWuqB,QAGhChf,GAAYnF,UAAU+nB,SAAW,SAASnuB,GACxC,OAAO9V,KAAK+f,UAAUikB,KAAKluB,IAG7BuL,GAAYnF,UAAUsoB,UAAY/S,IAAS,SAASxG,EAAM9V,GACxD,MAAmB,mBAAR8V,EACF,IAAI5J,GAAYrhB,MAElBA,KAAK+H,KAAI,SAAS/B,GACvB,OAAOumB,GAAWvmB,EAAOilB,EAAM9V,SAInCkM,GAAYnF,UAAU4oB,OAAS,SAAShvB,GACtC,OAAO9V,KAAKsF,OAAOy/B,GAAOrU,GAAY5a,MAGxCuL,GAAYnF,UAAUtW,MAAQ,SAASsd,EAAOC,GAC5CD,EAAQkH,GAAUlH,GAElB,IAAIjN,EAASjW,KACb,OAAIiW,EAAOkM,eAAiBe,EAAQ,GAAKC,EAAM,GACtC,IAAI9B,GAAYpL,IAErBiN,EAAQ,EACVjN,EAASA,EAAO6rB,WAAW5e,GAClBA,IACTjN,EAASA,EAAO0pB,KAAKzc,IAEnBC,IAAQxa,IACVwa,EAAMiH,GAAUjH,GAChBlN,EAASkN,EAAM,EAAIlN,EAAO2pB,WAAWzc,GAAOlN,EAAO4rB,KAAK1e,EAAMD,IAEzDjN,IAGToL,GAAYnF,UAAU6lB,eAAiB,SAASjsB,GAC9C,OAAO9V,KAAK+f,UAAUiiB,UAAUlsB,GAAWiK,WAG7CsB,GAAYnF,UAAUsnB,QAAU,WAC9B,OAAOxjC,KAAK6hC,KAAK/2B,IAInB+e,GAAWxI,GAAYnF,WAAW,SAASjH,EAAM8iB,GAC/C,IAAIqb,EAAgB,qCAAqCr5B,KAAKge,GAC1Dsb,EAAU,kBAAkBt5B,KAAKge,GACjCub,EAAapyB,GAAOmyB,EAAW,QAAwB,QAAdtb,EAAuB,QAAU,IAAOA,GACjFwb,EAAeF,GAAW,QAAQt5B,KAAKge,GAEtCub,IAGLpyB,GAAOhF,UAAU6b,GAAc,WAC7B,IAAI/xB,EAAQhG,KAAK6hB,YACb1M,EAAOk+B,EAAU,CAAC,GAAKxb,UACvB2b,EAASxtC,aAAiBqb,GAC1B7L,EAAWL,EAAK,GAChBs+B,EAAUD,GAAUpyB,GAAQpb,GAE5Bm9B,EAAc,SAASn9B,GACzB,IAAIiQ,EAASq9B,EAAWt+B,MAAMkM,GAAQ1K,GAAU,CAACxQ,GAAQmP,IACzD,OAAQk+B,GAAWzxB,EAAY3L,EAAO,GAAKA,GAGzCw9B,GAAWL,GAAoC,mBAAZ59B,GAA6C,GAAnBA,EAASrW,SAExEq0C,EAASC,GAAU,GAErB,IAAI7xB,EAAW5hB,KAAK+hB,UAChB2xB,IAAa1zC,KAAK8hB,YAAY3iB,OAC9Bw0C,EAAcJ,IAAiB3xB,EAC/BgyB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BztC,EAAQ4tC,EAAW5tC,EAAQ,IAAIqb,GAAYrhB,MAC3C,IAAIiW,EAAShB,EAAKD,MAAMhP,EAAOmP,GAE/B,OADAc,EAAO6L,YAAYzH,KAAK,CAAE,KAAQ4e,GAAM,KAAQ,CAACkK,GAAc,QAAWx6B,IACnE,IAAI2Y,GAAcrL,EAAQ2L,GAEnC,OAAI+xB,GAAeC,EACV3+B,EAAKD,MAAMhV,KAAMmV,IAE1Bc,EAASjW,KAAKi5B,KAAKkK,GACZwQ,EAAeN,EAAUp9B,EAAOjQ,QAAQ,GAAKiQ,EAAOjQ,QAAWiQ,QAK1EN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASoiB,GACxE,IAAI9iB,EAAOgH,GAAW8b,GAClB8b,EAAY,0BAA0B95B,KAAKge,GAAc,MAAQ,OACjEwb,EAAe,kBAAkBx5B,KAAKge,GAE1C7W,GAAOhF,UAAU6b,GAAc,WAC7B,IAAI5iB,EAAO0iB,UACX,GAAI0b,IAAiBvzC,KAAK+hB,UAAW,CACnC,IAAI/b,EAAQhG,KAAKgG,QACjB,OAAOiP,EAAKD,MAAMoM,GAAQpb,GAASA,EAAQ,GAAImP,GAEjD,OAAOnV,KAAK6zC,IAAW,SAAS7tC,GAC9B,OAAOiP,EAAKD,MAAMoM,GAAQpb,GAASA,EAAQ,GAAImP,UAMrD0U,GAAWxI,GAAYnF,WAAW,SAASjH,EAAM8iB,GAC/C,IAAIub,EAAapyB,GAAO6W,GACxB,GAAIub,EAAY,CACd,IAAI/7B,EAAM+7B,EAAW9W,KAAO,GACvBhgB,GAAepH,KAAKmL,GAAWhJ,KAClCgJ,GAAUhJ,GAAO,IAEnBgJ,GAAUhJ,GAAK8C,KAAK,CAAE,KAAQ0d,EAAY,KAAQub,QAItD/yB,GAAUmY,GAAa/vB,EAAWe,GAAoB8yB,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQ7zB,IAIV0Y,GAAYnF,UAAUwG,MAAQH,GAC9BlB,GAAYnF,UAAU6D,QAAU0C,GAChCpB,GAAYnF,UAAUlW,MAAQ2c,GAG9BzB,GAAOhF,UAAUquB,GAAKnH,GACtBliB,GAAOhF,UAAU+mB,MAAQI,GACzBniB,GAAOhF,UAAU43B,OAASxQ,GAC1BpiB,GAAOhF,UAAU/B,KAAOopB,GACxBriB,GAAOhF,UAAUod,MAAQoK,GACzBxiB,GAAOhF,UAAU6D,QAAU4jB,GAC3BziB,GAAOhF,UAAU63B,OAAS7yB,GAAOhF,UAAU8E,QAAUE,GAAOhF,UAAUlW,MAAQ69B,GAG9E3iB,GAAOhF,UAAU82B,MAAQ9xB,GAAOhF,UAAUmkB,KAEtCtiB,KACFmD,GAAOhF,UAAU6B,IAAe0lB,IAE3BviB,IAMLxF,GAAIF,KAQNlI,GAAKoI,EAAIA,GAIT,aACE,OAAOA,IACR,qCAaHtG,KAAKpV,Q,uECxzhBP,IAAIg0C,EAAS,WAAkB,IAAIC,EAAIj0C,KAAKk0C,EAAGD,EAAIE,MAAMD,GAAG,OAAOA,EAAG,QAAQ,CAACE,MAAM,CAAC,QAAU,WAAW,CAACF,EAAG,WAAW,CAACE,MAAM,CAAC,MAAQH,EAAII,OAAO,WAAaJ,EAAIK,WAAW,YAAYL,EAAIM,SAAS,WAAaN,EAAIO,WAAW,MAAQP,EAAIQ,MAAM,WAAaR,EAAIS,aAAa,CAACT,EAAIU,GAAG,YAAY,IAAI,IAE1SC,EAAkB,GCcP,GACfpY,KAAA,SACA9jB,MAAA,CACA27B,OAAA,CACAlyC,KAAA0yC,QACAC,SAAA,GAEAR,WAAA,CACAnyC,KAAA0yC,QACAC,SAAA,GAEAC,WAAA,CACA5yC,KAAA0yC,QACAC,SAAA,GAEAN,WAAA,CACAryC,KAAA0yC,QACAC,SAAA,GAEAL,MAAA,CACAtyC,KAAA,CAAA6yC,OAAAj5B,QACA+4B,aAAAnsC,GAEA4rC,SAAA,CACApyC,KAAA,CAAA6yC,OAAAj5B,QACA+4B,aAAAnsC,GAEA+rC,WAAA,CACAvyC,KAAA,CAAA0yC,QAAA94B,QACA+4B,QAAA,uBC7C8V,I,YCO1VG,EAAY,eACd,EACAjB,EACAY,GACA,EACA,KACA,WACA,MAIa,OAAAK,E","file":"assets/2026-11-04T11:40:44.772Z/js/chunk-1ddce18f.63601e1ca29a5fe7186c.js?time=2026-11-04T11:40:45.407Z","sourcesContent":["import { mapMutations } from \"vuex\";\nimport moment from \"moment\";\nimport Repository from \"../services/api/Repository\";\nimport localStorage from \"@/common/localStorage\";\n\nconst mixins = {\n data: function () {\n return {\n codeStatusSupportFirst: 10,\n codeStatusSupportA: 20,\n codeStatusSupportB: 30,\n codeStatusSupportContinuing: 60, // 継続支援\n codeStatusSupportFinal: 40,\n\n INITIAL_SUPPORT: 10,\n CONTINUOUS_SUPPORT: 20,\n FINAL_EVALUATION: 30,\n\n BEFORE_START_SUPPORT: 10,\n SUPPORT_IN_PROGRESS: 20,\n SUPPORT_COMPLETE: 30,\n END_HALFWAY: 40,\n FIRST_INTERVIEW_DECLINE: 50,\n\n // Support flow segment status\n SUPPORT_FLOW_STATUS_PLAN: 10,\n SUPPORT_FLOW_STATUS_SCHEDULE: 20,\n SUPPORT_FLOW_STATUS_PROGRESS: 30,\n SUPPORT_FLOW_STATUS_CONFIRM: 40,\n SUPPORT_FLOW_STATUS_CANCEL: 50,\n\n HEALTH_GUIDANCE_DIV_ACTIVE: 1,\n\n // Support flow status\n SUPPORT_FLOW_STATUS_BEFORE_SUPPORT: 10,\n SUPPORT_FLOW_STATUS_IN_PROGRESS_SUPPORT: 20,\n SUPPORT_FLOW_STATUS_FINISH: 30,\n SUPPORT_FLOW_STATUS_PART_FINNISH_SUPPORT: 40,\n SUPPORT_FLOW_STATUS_DENIED_SUPPORT: 50,\n\n // // 第n期\n HEALTH_GUIDANCE_PERIOD_1: 1,\n HEALTH_GUIDANCE_PERIOD_2: 2,\n HEALTH_GUIDANCE_PERIOD_3: 3,\n HEALTH_GUIDANCE_PERIOD_4: 4,\n\n SYSTEM_USER: \"1\",\n SUPPORTER: \"2\",\n BACKOFFICE: \"4\",\n SYSTEM_MAINTAIN: \"8\",\n PLAN: 10,\n SCHEDULE: 20,\n IN_PROGRESS: 30,\n CONFIRM: 40,\n\n // アウトカム評価ポイント\n OUTCOME_EVAL_POINT_EATING: 20,\n OUTCOME_EVAL_POINT_EXERCISE: 20,\n OUTCOME_EVAL_POINT_SMOKING: 30,\n OUTCOME_EVAL_POINT_REST: 20,\n OUTCOME_EVAL_POINT_ELSE: 20,\n OUTCOME_EVAL_POINT_1CM_1KG: 20,\n OUTCOME_EVAL_POINT_2CM_2KG: 160, // 180ポイントだが、1cm_1kgの20と合わせて180ポイントになるように設定\n }\n },\n\n methods: {\n currentUserID() {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n return user.id;\n }\n },\n canAutoSend(reception, flow) {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n const roleSystem = user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0 || user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0;\n const healthGuidance = reception.health_guidance_div;\n const supportFlow = flow.support_flow_status == this.SUPPORT_FLOW_STATUS_IN_PROGRESS_SUPPORT || flow.support_flow_status == this.SUPPORT_FLOW_STATUS_PART_FINNISH_SUPPORT || flow.support_flow_status == this.SUPPORT_FLOW_STATUS_FINISH;\n\n // 分割面談の初回・2回目が確定していない場合は途中終了を制限\n const canStopSplitSupport = this.checkCanStopSplitSupport(flow);\n return roleSystem && healthGuidance && supportFlow && canStopSplitSupport\n }\n return false;\n },\n canStop(reception, flow) {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n const roleSystem = user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0 || user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0\n // const healthGuidance = reception.health_guidance_div == this.HEALTH_GUIDANCE_DIV_ACTIVE\n const supportFlow = flow.support_flow_status == this.SUPPORT_FLOW_STATUS_IN_PROGRESS_SUPPORT || flow.support_flow_status == this.SUPPORT_FLOW_STATUS_PART_FINNISH_SUPPORT\n \n // 分割面談の初回・2回目が確定していない場合は途中終了を制限\n const canStopSplitSupport = this.checkCanStopSplitSupport(flow);\n \n // return roleSystem && healthGuidance && supportFlow && canStopSplitSupport\n return roleSystem && supportFlow && canStopSplitSupport\n }\n return false;\n },\n canReject(reception, flow) {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n const roleSystem = user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0 || user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0\n const healthGuidance = reception.health_guidance_div\n const supportFlow = flow.support_flow_status == this.SUPPORT_FLOW_STATUS_BEFORE_SUPPORT || flow.support_flow_status == this.SUPPORT_FLOW_STATUS_DENIED_SUPPORT\n return roleSystem && healthGuidance && supportFlow\n }\n return false;\n },\n\n canIncomplete(reception, flow) {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n const roleSystem = user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0 || user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0\n // const healthGuidance = reception.health_guidance_div == this.HEALTH_GUIDANCE_DIV_ACTIVE\n // const supportFlow = flow.support_flow_status == this.SUPPORT_FLOW_STATUS_IN_PROGRESS_SUPPORT || flow.support_flow_status == this.SUPPORT_FLOW_STATUS_PART_FINNISH_SUPPORT\n \n const canStopSplitSupport = this.checkSplitFirstSupportSecond(reception);\n // return roleSystem && healthGuidance && supportFlow && canStopSplitSupport\n \n return roleSystem && canStopSplitSupport\n }\n return false;\n },\n\n //##################################################################################################################\n // システム権限\n isSystemAdminOrBackOffice() {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n return (user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0) ||\n (user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0);\n }\n return false;\n },\n isSystemAdmin() {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n return user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_USER) >= 0;\n }\n return false;\n },\n isSupporter(checkOnly = false) {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n const authDivs = user?.user_sys_auth_div.split(\",\");\n const hasSupporter = authDivs.indexOf(this.SUPPORTER) >= 0;\n\n // そもそも支援担当者でなければ判定結果を返す.\n if (!hasSupporter) return hasSupporter;\n // checkOnlyがfalseならば判定結果を返す.\n if (!checkOnly) return hasSupporter;\n\n // 事務局 or システム管理者が与えられていなければtrue.\n return !((authDivs.indexOf(this.BACKOFFICE) >= 0) || (authDivs.indexOf(this.SYSTEM_USER) >= 0));\n }\n return false;\n },\n isBackOffice() {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n return user?.user_sys_auth_div.split(\",\").indexOf(this.BACKOFFICE) >= 0;\n }\n return false;\n },\n isSystemMaintain() {\n let userRaw = localStorage.getInfo();\n let user = null;\n\n if (userRaw.length) {\n user = JSON.parse(userRaw);\n }\n\n if (user) {\n return user?.user_sys_auth_div.split(\",\").indexOf(this.SYSTEM_MAINTAIN) >= 0;\n }\n return false;\n },\n //##################################################################################################################\n\n\n //##################################################################################################################\n // toast notificaation\n notifyInfo(message = \"\") {\n this.$toast.open({\n message,\n type: \"info\",\n });\n },\n notifyError(message = \"\") {\n this.$toast.open({\n message,\n type: \"error\",\n });\n },\n notifySuccess(message = \"\") {\n this.$toast.open({\n message,\n type: \"success\",\n });\n },\n notifyWarn(message = \"\") {\n this.$toast.open({\n message,\n type: \"warning\",\n });\n },\n notifyNoSearchResults(message = \"\") {\n this.notifyInfo(\"検索結果がありません。\" + (message ? \"(\" + message + \")\" : \"\"));\n },\n notifyInputInvalidToast() {\n this.$toast.open({\n message: \"入力内容に誤りがあります。\",\n type: \"warning\",\n });\n },\n notifyInputWarnToast(item = \"\") {\n\n const m = (item) ? item + \" \" : \"\";\n\n this.$toast.open({\n message: m + \"入力内容に誤りがないかを確認してください。\",\n type: \"warning\",\n });\n },\n //##################################################################################################################\n\n ...mapMutations({\n showLoading: \"common/showLoading\",\n hideLoading: \"common/hideLoading\"\n }),\n classSegment(segment, ignoreOverDue = false) {\n return {\n \"bg-first-support\": this.checkSupportFirst(segment) || this.checkSplitFirstSupportSecond(segment),\n \"bg-continue-support\": this.checkContinueSupport(segment),\n \"bg-mid-eval\": this.checkMidEval(segment),\n \"bg-final-support\": this.checkSupportFinal(segment),\n \"bg-overdue\": !ignoreOverDue && ((segment?.scheduled_support_date ? segment?.scheduled_support_date : segment?.plan_support_date) < this.formatTime(new Date(), \"YYYY-MM-DD\")),\n \"confirmed\": parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM\n }\n },\n /**\n * 支援フロー領域タイトル部 カラー.\n * @param {*} flow \n * @returns \n */\n statusSegmentColor(flow) {\n const dateCurrent = moment(new Date()).format(\"YYYY-MM-DD\")\n let showError = false //期限超過フラグ\n let _this = this\n\n // 支援フローステータスが、「開始前」or「実施中」の場合\n if (flow.support_flow_status == this.BEFORE_START_SUPPORT || \n flow.support_flow_status == this.SUPPORT_IN_PROGRESS) {\n flow.health_support_flow_segments.forEach(function(segment) {\n // 進捗が「計画」、かつ支援中止フラグOFF、かつ計画日が期限超過.\n if (parseInt(segment?.support_progress_status) === _this.PLAN && segment?.support_stop_flag != 1) {\n if((segment?.plan_support_date && segment?.plan_support_date) < dateCurrent) {\n showError = true\n return\n }\n }\n // 進捗が「予定」or「実施中」、かつ支援中止フラグOFF、かつ支援予定日が期限超過.\n if ([_this.SCHEDULE, _this.IN_PROGRESS].includes(parseInt(segment?.support_progress_status)) && segment?.support_stop_flag != 1\n && segment?.scheduled_support_date\n && segment?.scheduled_support_date < dateCurrent) {\n showError = true\n return\n }\n })\n } \n\n return {\n \"bg-normal\": (!showError && (flow?.support_flow_status == this.BEFORE_START_SUPPORT || flow?.support_flow_status == this.SUPPORT_IN_PROGRESS)),\n \"bg-overdue\": showError,\n \"bg-finish-support\": flow?.support_flow_status == this.SUPPORT_COMPLETE,\n \"bg-end-halfway-support\": flow?.support_flow_status == this.END_HALFWAY,\n \"bg-first-interview-decline\": flow?.support_flow_status == this.FIRST_INTERVIEW_DECLINE,\n }\n },\n\n\n checkContinueSupport(segment) {\n return parseInt(segment?.support_exec_div) === this.CONTINUOUS_SUPPORT;\n },\n\n // 初回支援かどうか\n checkSupportFirst(segment) {\n return parseInt(segment?.health_support_form?.support_form_div) === this.codeStatusSupportFirst;\n },\n // 初回支援分割実施かどうか\n checkSplitFirstSupport(segment) {\n // 初回支援でない\n // if (parseInt(segment?.support_exec_div) !== this.codeStatusSupportFirst) {\n // return false;\n // }\n // 分割実施ではない\n if (!segment.split_first_support_flag) {\n return false;\n }\n return true;\n },\n // 初回支援分割実施の1回目かどうか\n checkSplitFirstSupportFirst(segment) {\n if (!this.checkSplitFirstSupport(segment)) {\n return false;\n }\n // 1回目\n if (segment.support_flow_seq > 0) {\n return false;\n }\n return true;\n },\n // 初回支援分割実施の2回目かどうか\n checkSplitFirstSupportSecond(segment) {\n if (!this.checkSplitFirstSupport(segment)) {\n return false;\n }\n // 1回目\n if (segment.support_flow_seq == 0) {\n return false;\n }\n return true;\n },\n checkSupportA(segment) {\n return parseInt(segment?.health_support_form?.support_form_div) === this.codeStatusSupportA;\n },\n checkSupportB(segment) {\n return parseInt(segment?.health_support_form?.support_form_div) === this.codeStatusSupportB;\n },\n checkSupport(segment) {\n return parseInt(segment?.health_support_form?.support_form_div) === this.codeStatusSupportContinuing;\n },\n checkSupportFinal(segment) {\n return parseInt(segment?.support_exec_div) === this.FINAL_EVALUATION;\n },\n checkMidEval(segment) {\n return segment?.mid_eval_flg;\n },\n\n // 分割面談の途中終了可否チェック\n checkCanStopSplitSupport(flow) {\n // health_support_flow_segmentsが存在しない場合はtrueを返す(通常の処理を継続)\n if (!flow.health_support_flow_segments || flow.health_support_flow_segments.length === 0) {\n return true;\n }\n\n // 分割面談のセグメントを取得\n const splitSupportSegments = flow.health_support_flow_segments.filter(segment => \n this.checkSplitFirstSupport(segment)\n );\n\n // 分割面談でない場合はtrueを返す(制限なし)\n if (splitSupportSegments.length === 0) {\n return true;\n }\n\n // 分割面談の初回・2回目セグメントをチェック\n for (const segment of splitSupportSegments) {\n const isFirstOrSecond = this.checkSplitFirstSupportFirst(segment) || this.checkSplitFirstSupportSecond(segment);\n const isConfirmed = parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM;\n \n // 初回または2回目で、かつ確定していない場合は途中終了を制限\n if (isFirstOrSecond && !isConfirmed) {\n return false;\n }\n }\n\n // すべての初回・2回目が確定している場合は途中終了を許可\n return true;\n },\n\n // (支援形態) 個別支援かどうか\n checkHealthSupportFormIndividual(supportFormCode) {\n const code = supportFormCode.slice(-2);\n return code == \"10\" || code == \"15\";\n },\n\n // (支援形態) グループ支援かどうか\n checkHealthSupportFormGroup(supportFormCode) {\n const code = supportFormCode.slice(-2);\n return code == \"20\" || code == \"25\";\n },\n\n // (支援形態) 電話かどうか\n checkHealthSupportFormPhone(supportFormCode) {\n return supportFormCode.slice(-2) == \"30\";\n },\n\n // (支援形態) 電話かどうか\n checkHealthSupportFormEmail(supportFormCode) {\n return supportFormCode.slice(-2) == \"40\";\n },\n\n formatTime(value, format, offset = \"+0900\") {\n if (moment(value).isValid()) {\n return moment(value).locale(\"ja\").utcOffset(offset).format(format);\n }\n return \"\"\n },\n\n // After clean code\n processTagColor(segment, supportFlowStatus, previewSegment) {\n if (parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM) {\n // セグメントの進捗状況が「確定」\n return \"block-segment-gray\";\n } else {\n // セグメントの進捗状況が「確定」以外の場合.\n\n if (segment?.support_stop_flag == 1 && (supportFlowStatus == 40 || supportFlowStatus == 50)) {\n // 支援中止フラグON、かつ支援フローステータスが「途中終了」or「初回面接辞退」の場合\n return \"block-segment-blue\";\n } else {\n // 期限超過判定用\n const dateCurrent = moment(new Date()).format(\"YYYY-MM-DD\")\n // 支援フローステータスが「開始前」or「実施中」or「完了」の場合\n if (supportFlowStatus != 40 && supportFlowStatus != 50) {\n // 支援進捗状況が「計画」の場合\n if (parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_PLAN) {\n // [セグメントの計画日] < 現在日 (計画日を過ぎている)場合.\n if (segment?.plan_support_date && segment?.plan_support_date < dateCurrent) {\n // 期限超過色.\n return \"block-segment-pink\";\n } else {\n // (直前セグメントが未定義 or 直前セグメントが確定)、かつ現在セグメントが「確定」以外\n if ((previewSegment?.support_progress_status == null\n || parseInt(previewSegment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM)\n && parseInt(segment?.support_progress_status) !== this.SUPPORT_FLOW_STATUS_CONFIRM) {\n return \"block-segment-green\";\n }\n }\n }\n\n // 支援進捗状況が「予定」or「実施中」の場合\n if (parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_SCHEDULE\n || parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_PROGRESS) {\n // [セグメントの支援予定日] < 現在日 (予定日を過ぎている)場合.\n if (segment?.scheduled_support_date && segment?.scheduled_support_date < dateCurrent) {\n // 期限超過色.\n return \"block-segment-pink\";\n } else {\n // (直前セグメントが未定義 or 直前セグメントが確定)、かつ現在セグメントが「確定」以外\n if ((previewSegment?.support_progress_status == null ||\n parseInt(previewSegment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM)\n && parseInt(segment?.support_progress_status) !== this.SUPPORT_FLOW_STATUS_CONFIRM) {\n return \"block-segment-green\";\n }\n }\n }\n return \"block-segment-white\";\n }\n }\n }\n return parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM\n },\n segmentConfirm(segment) {\n return parseInt(segment?.support_progress_status) === this.SUPPORT_FLOW_STATUS_CONFIRM\n },\n segmentDraft(segment) {\n return parseInt(segment?.support_progress_status) === this.SUPPORT_COMPLETE;\n },\n // TODO: コードの変更が収束したら戻す\n async getCodeDefine(group, value = \"\") {\n if (!window.localStorage.getItem(group+value)) {\n try {\n let txt = \"\";\n if (value !== \"\") {\n txt = `&value_field=${value}`;\n }\n await Repository.get(`code_define?group=${group}${txt}`).then(res => {\n window.localStorage.setItem(group+value, JSON.stringify(res.data))\n });\n } catch (e) {\n window.localStorage.setItem(group+value, JSON.stringify([]))\n }\n }\n return JSON.parse(window.localStorage.getItem(group+value));\n },\n getFiscalYear() {\n return moment().subtract(3, \"months\").year();\n },\n getFiscalYearFromDateStr(dateStr){\n try{\n return moment(dateStr, [\"YYYYMMDD\", \"YYYY-MM-DD\", \"YYYY/MM/DD\"]).subtract(3, \"months\").year();\n\n }catch(ex){\n return this.getFiscalYear();\n }\n },\n getFiscalYearFromDateArr(addDefault = false) {\n let arr = [\n moment(new Date()).subtract(3, \"months\").add(1, \"Y\").format(\"Y\"),\n moment(new Date()).subtract(3, \"months\").format(\"Y\"),\n moment(new Date()).subtract(3, \"months\").subtract(1, \"Y\").format(\"Y\"),\n ].map((year) => ({\n text: year.slice(-2) + \"年度\",\n value: parseInt(year),\n }));\n\n if(addDefault) {\n arr.unshift(\n {\n text: \"\",\n value: null,\n }\n )\n }\n return arr\n },\n\n /**\n * 切り替わりの年度\n */\n getPeriodSwitchingYears() {\n return [2013, 2018, 2024];\n },\n\n\n /**\n * 保健指導期間\n */\n getHealthGuidancePeriods(fiscalYear) {\n // 第1期 2008 ~ 2012\n // 第2期 2013 ~ 2017\n // 第3期 2018 ~ 2023\n // 第4期 2024 ~ 2029\n if (!fiscalYear) {\n return []\n }\n // 切り替わり年度 (両方を選択できるようにする)\n if (fiscalYear == 2013) {\n return [1, 2];\n }\n if (fiscalYear == 2018) {\n return [2, 3];\n }\n if (fiscalYear == 2024) {\n return [3, 4]\n }\n // それ以外\n if (fiscalYear <= 2012) {\n return [1];\n } else if (fiscalYear <= 2017) {\n return [2];\n } else if (fiscalYear <= 2023) {\n return [3];\n } else {\n return [4];\n }\n },\n copyToClipboard(text) {\n navigator.clipboard.writeText(text)\n .then(() => {\n this.$toast.open({\n message: \"テキストをコピーしました。\",\n type: \"success\",\n });\n })\n },\n\n //##################################################################################################################\n // 保健指導区分判定\n isHealthGuidanceDiv_ActiveSupport(hgDiv) {\n return hgDiv == 1;\n }\n\n //##################################################################################################################\n\n }\n}\n\nexport default mixins\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': '\n\n","import mod from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--13-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--1-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Dialog.vue?vue&type=script&lang=js\"; export default mod; export * from \"-!../../../node_modules/cache-loader/dist/cjs.js??ref--13-0!../../../node_modules/thread-loader/dist/cjs.js!../../../node_modules/babel-loader/lib/index.js!../../../node_modules/cache-loader/dist/cjs.js??ref--1-0!../../../node_modules/vue-loader/lib/index.js??vue-loader-options!./Dialog.vue?vue&type=script&lang=js\"","import { render, staticRenderFns } from \"./Dialog.vue?vue&type=template&id=28ec8864&scoped=true\"\nimport script from \"./Dialog.vue?vue&type=script&lang=js\"\nexport * from \"./Dialog.vue?vue&type=script&lang=js\"\n\n\n/* normalize component */\nimport normalizer from \"!../../../node_modules/vue-loader/lib/runtime/componentNormalizer.js\"\nvar component = normalizer(\n script,\n render,\n staticRenderFns,\n false,\n null,\n \"28ec8864\",\n null\n \n)\n\nexport default component.exports"],"sourceRoot":""}