{"version":3,"sources":["webpack:///../../../src/components/VList/VListItemAction.ts","webpack:///../../../src/components/VChip/VChip.ts","webpack:///../../../src/components/VChip/index.ts","webpack:///../../../src/components/VMenu/VMenu.ts","webpack:///../../../src/components/VMenu/index.ts","webpack:///../../../src/components/VCheckbox/VSimpleCheckbox.ts","webpack:///../../../src/components/VSubheader/VSubheader.ts","webpack:///../../../src/components/VSubheader/index.ts","webpack:///../../../src/components/VSelect/VSelectList.ts","webpack:///../../../src/mixins/filterable/index.ts","webpack:///../../../src/components/VSelect/VSelect.ts","webpack:///../../../src/components/VAutocomplete/VAutocomplete.ts","webpack:///../../../src/components/VCombobox/VCombobox.ts","webpack:///./node_modules/lodash/lodash.js","webpack:///../../../src/components/VThemeProvider/VThemeProvider.ts","webpack:///../../../src/components/VList/VListItemIcon.ts","webpack:///../../../src/components/VList/VListGroup.ts","webpack:///../../../src/components/VList/VListItemGroup.ts","webpack:///../../../src/components/VList/index.ts","webpack:///../../../src/components/VItemGroup/VItemGroup.ts","webpack:///(webpack)/buildin/module.js","webpack:///../../../src/components/VAvatar/VAvatar.ts","webpack:///../../../src/components/VAvatar/index.ts","webpack:///../../../src/components/VList/VListItemAvatar.ts","webpack:///../../../src/mixins/comparable/index.ts","webpack:///../../../src/components/VList/VList.ts","webpack:///../../../src/directives/click-outside/index.ts","webpack:///../../../src/components/VDivider/index.ts","webpack:///../../../src/components/VList/VListItem.ts","webpack:///../../../src/mixins/returnable/index.ts"],"names":["Vue","extend","name","functional","render","h","data","children","staticClass","filteredChild","filter","VNode","isComment","text","length","mixins","Colorable","Sizeable","Routable","Themeable","GroupableFactory","ToggleableFactory","props","active","type","Boolean","default","activeClass","String","this","chipGroup","close","closeIcon","closeLabel","disabled","draggable","filterIcon","label","link","outlined","pill","tag","textColor","value","proxyClass","computed","classes","options","call","isClickable","isLink","color","hasClose","themeClasses","sizeableClasses","groupClasses","created","breakingProps","forEach","original","replacement","$attrs","hasOwnProperty","breaking","methods","click","e","$emit","toggle","genFilter","isActive","push","$createElement","VIcon","left","VExpandXTransition","genClose","right","size","attrs","$vuetify","lang","t","on","stopPropagation","preventDefault","genContent","getSlot","generateRouteLink","undefined","tabindex","directives","setBackgroundColor","setTextColor","VChip","baseMixins","Dependent","Delayable","Returnable","Roundable","Menuable","ClickOutside","Resize","provide","isInMenu","theme","auto","closeOnClick","closeOnContentClick","disableKeys","maxHeight","Number","offsetX","offsetY","openOnHover","origin","transition","contentProps","Object","calculatedTopAuto","defaultOffset","hasJustFocused","listIndex","resizeTimeout","selectedIndex","tiles","activeTile","calculatedLeft","menuWidth","Math","max","dimensions","content","width","parseFloat","calculatedMinWidth","convertToUnit","calcXOverflow","calcLeftAuto","calcLeft","calculatedMaxHeight","height","calculatedMaxWidth","maxWidth","minWidth","min","activator","nudgeWidth","pageWidth","isNaN","parseInt","calculatedTop","top","calcYOverflow","calcTop","hasClickableTiles","find","tile","tabIndex","styles","transformOrigin","zIndex","activeZIndex","watch","val","isContentActive","next","prev","classList","add","scrollTop","$refs","contentHeight","clientHeight","offsetTop","goTo","appOffset","duration","container","remove","removed","mounted","callActivate","activate","updateDimensions","requestAnimationFrame","startTransition","then","calcTopAuto","calcScrollPosition","$el","querySelector","maxScrollTop","scrollHeight","offsetHeight","computedTop","Array","from","indexOf","tileDistanceFromMenuTop","firstTileOffsetTop","changeListIndex","getTiles","keyCode","keyCodes","tab","down","nextTile","up","prevTile","end","lastTile","home","firstTile","enter","closeConditional","target","_isDestroyed","contains","genActivatorAttributes","attributes","Activatable","id","genActivatorListeners","listeners","keydown","onKeyDown","genTransition","genDirectives","handler","include","getOpenDependentElements","getScopeIdAttrs","role","class","rootThemeClasses","roundedClasses","activatorFixed","menuable__content__active","contentClass","trim","style","ref","getAttribute","$listeners","scroll","mouseenter","mouseEnterHandler","mouseleave","mouseLeaveHandler","getContentSlot","querySelectorAll","runDelay","_a","relatedTarget","callDeactivate","esc","setTimeout","getActivator","$nextTick","focus","includes","onResize","offsetWidth","clearTimeout","window","attach","arg","genActivator","showLazyContent","VThemeProvider","root","light","dark","VMenu","Ripple","ripple","indeterminate","indeterminateIcon","onIcon","offIcon","icon","def","center","mergeData","input","wrapInArray","f","inset","VSubheader","action","dense","hideSelected","items","itemDisabled","Function","itemText","itemValue","noDataText","noFilter","searchInput","selectedItems","parsedItems","map","item","getValue","tileActiveClass","keys","join","staticNoDataTile","mousedown","VListItem","genTileContent","genAction","inputValue","VListItemAction","VSimpleCheckbox","genDivider","VDivider","genFilteredText","start","middle","getMaskedCharacters","genHighlight","genHeader","header","toString","toLocaleLowerCase","index","slice","genTile","hasItem","getDisabled","_uid","$scopedSlots","parent","scopedSlot","needsTile","VListItemContent","VListItemTitle","getText","slot","componentOptions","Ctor","getPropertyFromItem","itemsLength","divider","$slots","unshift","VList","defaultMenuProps","openOnClick","VTextField","Comparable","Filterable","appendIcon","cacheItems","chips","clearable","deletableChips","disableLookup","eager","itemColor","menuProps","multiple","openOnClear","returnObject","smallChips","cachedItems","menuIsBooted","isMenuActive","lastItem","lazyValue","keyboardLookupPrefix","keyboardLookupLastTime","allItems","filterDuplicates","concat","hasChips","computedItems","computedOwns","computedCounterValue","counterValue","isFocused","blur","dynamicHeight","hasSlot","selection","isDirty","listData","scopeId","$vnode","context","$options","_scopeId","virtualizedItems","select","selectItem","scopedSlots","staticList","consoleError","VSelectList","$_menuProps","menuCanShow","normalisedProps","split","isArray","reduce","acc","p","nudgeBottom","internalValue","initialValue","setSelectedItems","menu","onScroll","onMenuActiveChange","immediate","setMenuIndex","activateMenu","isInteractive","clearableCallback","setValue","getContent","arr","uniqueValues","Map","set","has","values","findExistingIndex","findIndex","i","valueComparator","genChipSelection","isDisabled","small","click:close","onChipInput","key","JSON","stringify","genCommaSelection","last","computedColor","genDefaultSlot","selections","genSelections","genInput","genFieldset","genLabel","prefix","genAffix","suffix","genClearIcon","genIconSlot","genHiddenInput","genMenu","genProgress","genIcon","cb","extraData","VInput","domProps","readonly","isReadonly","getObjectValueByPath","autocomplete","placeholder","persistentPlaceholder","hasLabel","keypress","onKeyPress","attrs$","genInputSlot","genList","genListWithSlot","slots","slotName","genSelection","genSlotSelection","selected","getMenuIndex","onBlur","onClick","isAppendInner","onEscDown","ctrlKey","metaKey","altKey","KEYBOARD_LOOKUP_THRESHOLD","now","performance","toLowerCase","startsWith","space","onUpDown","onTabDown","onSpaceDown","onMouseUp","hasMouseDown","which","showMoreItems","isBooted","splice","v","appendInner","VSelectMenuProps","offsetOverflow","VSelect","autoSelectFirst","queryText","hideNoData","lazySearch","filteredItems","selectedValues","hasDisplayedItems","some","currentRange","selectedItem","isSearching","internalSearch","get","isAnyValueAllowed","searchIsDirty","document","addEventListener","onCopy","removeEventListener","updateSelf","oldVal","setSearch","destroyed","onFilteredItemsChanged","preSelectedItem","onInternalSearchChanged","updateMenuDimensions","changeSelectedIndex","backspace","delete","deleteCurrentItem","curIndex","curItem","lastIndex","nextIndex","nextItem","onFocus","onInput","badInput","validity","event","currentItem","currentItemText","clipboardData","setData","_b","VAutocomplete","delimiters","editingIndex","delimiter","d","endsWith","updateTags","paste","onPaste","chip","dblclick","onEnterDown","selectionStart","updateEditing","assign","updateCombobox","isUsingSlot","menuIndex","itemToSelect","pastedItemText","getData","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","rsOrdLower","rsOrdUpper","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","deburredLetters","htmlEscapes","htmlUnescapes","stringEscapes","freeParseFloat","freeParseInt","freeGlobal","global","freeSelf","self","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","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","asciiToArray","string","asciiWords","match","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","baseSortBy","comparer","sort","current","baseTimes","n","baseToPairs","baseTrim","trimmedEndIndex","replace","baseUnary","baseValues","cacheHas","cache","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","test","hasUnicodeWord","iteratorToArray","iterator","done","mapToArray","overArg","transform","replaceHolders","setToArray","setToPairs","strictLastIndexOf","stringSize","unicodeSize","stringToArray","unicodeToArray","charAt","unescapeHtmlChar","unicodeWords","runInContext","_","defaults","pick","Date","Error","TypeError","arrayProto","prototype","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","uid","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","lazyClone","copyArray","lazyReverse","clone","dir","isArr","isRight","arrLength","view","getView","iteratees","iterLength","takeCount","baseWrapperValue","outer","iterIndex","Hash","entries","clear","entry","hashClear","__data__","hashDelete","hashGet","hashHas","hashSet","ListCache","listCacheClear","listCacheDelete","assocIndexOf","pop","listCacheGet","listCacheHas","listCacheSet","MapCache","mapCacheClear","mapCacheDelete","getMapData","mapCacheGet","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","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","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","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","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","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","setWrapToString","createRound","precision","pair","noop","createToPairs","createWrap","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","isPartial","arrStacked","othStacked","arrValue","othValue","compared","message","convert","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","flatten","otherFunc","isKeyable","isOwn","unmasked","stubArray","transforms","getWrapDetails","hasPath","hasFunc","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","difference","differenceBy","differenceWith","drop","dropRight","dropRightWhile","dropWhile","fill","findLastIndex","flattenDeep","flattenDepth","fromPairs","head","initial","intersection","mapped","intersectionBy","intersectionWith","separator","lastIndexOf","nth","pull","pullAll","pullAllBy","pullAllWith","pullAt","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sortedUniq","sortedUniqBy","tail","take","takeRight","takeRightWhile","takeWhile","union","unionBy","unionWith","uniq","uniqBy","uniqWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipObject","zipObjectDeep","zipWith","chain","tap","interceptor","wrapperAt","wrapperChain","wrapperCommit","wrapperNext","toArray","wrapperToIterator","wrapperPlant","wrapperReverse","wrapped","wrapperValue","countBy","every","findLast","flatMap","flatMapDeep","flatMapDepth","forEachRight","groupBy","isString","invokeMap","keyBy","orderBy","partition","reduceRight","reject","negate","sample","sampleSize","shuffle","sortBy","after","before","bind","bindKey","curry","curryRight","debounce","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","isNumber","isNative","isNull","isNil","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lt","lte","sign","remainder","isBinary","toSafeInteger","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","capitalize","upperFirst","position","escape","escapeRegExp","kebabCase","lowerCase","lowerFirst","pad","strLength","padEnd","padStart","radix","repeat","snakeCase","limit","startCase","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","attempt","toLower","toUpper","toUpperCase","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","upperCase","bindAll","methodNames","cond","conforms","defaultTo","flow","flowRight","matches","matchesProperty","method","methodOf","mixin","noConflict","nthArg","over","overEvery","overSome","propertyOf","range","rangeRight","stubObject","stubString","stubTrue","times","toPath","uniqueId","augend","addend","divide","dividend","divisor","maxBy","mean","meanBy","minBy","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","sum","sumBy","entriesIn","extendWith","each","eachRight","first","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","commit","toJSON","isDark","rootIsDark","node","BindsAttrs","Bootable","RegistrableInject","Toggleable","noAction","prependIcon","subGroup","list","listClick","$route","register","matchRoute","beforeDestroy","unregister","genAppendIcon","VListItemIcon","listeners$","genPrependIcon","genItems","onRouteChange","to","VExpandTransition","BaseItemGroup","isInGroup","listItemGroup","genData","VListItemActionText","createSimpleFunctional","VListItemSubtitle","VListItemAvatar","Proxyable","mandatory","internalLazyValue","toggleMethod","intern","consoleWarn","updateInternalValue","$on","updateMandatory","updateItem","valueIndex","updateItemsState","updateMultiple","updateSingle","isSame","itemGroup","webpackPolyfill","deprecate","enumerable","l","Measurable","measurableStyles","VAvatar","horizontal","deepEqual","VSheet","isInList","inject","isInNav","expand","flat","nav","rounded","subheader","threeLine","twoLine","groups","g","defaultConditional","checkEvent","el","checkIsActive","attachedRoot","ShadowRoot","host","elements","directive","_clickOutside","lastMousedownWasOutside","handleShadow","inserted","vnode","onMousedown","app","unbind","inheritAttrs","inactive","selectable","detail","genAttrs","nativeOn","returnValue","originalValue","save"],"mappings":"sMAIeA,cAAIC,OAAO,CACxBC,KAAM,qBAENC,YAAY,EAEZC,OAAQC,GAAG,KAAEC,EAAF,SAAQC,EAAW,KAC5BD,EAAKE,YAAcF,EAAKE,YAAc,uBAAuBF,EAAKE,YAAgB,sBAClF,MAAMC,EAAgBF,EAASG,OAAOC,IACT,IAApBA,EAAMC,WAAsC,MAAfD,EAAME,MAI5C,OAFIJ,EAAcK,OAAS,IAAGR,EAAKE,aAAe,+BAE3CH,EAAE,MAAOC,EAAMC,O,0RCWXQ,iBACbC,OACAC,OACAC,OACAC,OACAC,eAAiB,aACjBC,eAAkB,eAClBpB,OAAO,CACPC,KAAM,SAENoB,MAAO,CACLC,OAAQ,CACNC,KAAMC,QACNC,SAAS,GAEXC,YAAa,CACXH,KAAMI,OACNF,UACE,OAAKG,KAAKC,UAEHD,KAAKC,UAAUH,YAFM,KAKhCI,MAAON,QACPO,UAAW,CACTR,KAAMI,OACNF,QAAS,WAEXO,WAAY,CACVT,KAAMI,OACNF,QAAS,kBAEXQ,SAAUT,QACVU,UAAWV,QACXf,OAAQe,QACRW,WAAY,CACVZ,KAAMI,OACNF,QAAS,aAEXW,MAAOZ,QACPa,KAAMb,QACNc,SAAUd,QACVe,KAAMf,QACNgB,IAAK,CACHjB,KAAMI,OACNF,QAAS,QAEXgB,UAAWd,OACXe,MAAO,MAGTrC,KAAMA,KAAA,CACJsC,WAAY,mBAGdC,SAAU,CACRC,UACE,MAAO,CACL,UAAU,KACP5B,OAAS6B,QAAQF,SAASC,QAAQE,KAAKnB,MAC1C,oBAAqBA,KAAKoB,YAC1B,mBAAoBpB,KAAKK,SACzB,oBAAqBL,KAAKM,UAC1B,gBAAiBN,KAAKQ,MACtB,eAAgBR,KAAKqB,OACrB,oBAAqBrB,KAAKsB,MAC1B,mBAAoBtB,KAAKU,SACzB,eAAgBV,KAAKW,KACrB,oBAAqBX,KAAKuB,YACvBvB,KAAKwB,gBACLxB,KAAKyB,mBACLzB,KAAK0B,eAGZH,WACE,OAAO3B,QAAQI,KAAKE,QAEtBkB,cACE,OAAOxB,QACLP,OAAS6B,QAAQF,SAASI,YAAYD,KAAKnB,OAC3CA,KAAKC,aAKX0B,UACE,MAAMC,EAAgB,CACpB,CAAC,UAAW,YACZ,CAAC,WAAY,eACb,CAAC,QAAS,UACV,CAAC,SAAU,iBAIbA,EAAcC,QAAQ,EAAEC,EAAUC,MAC5B/B,KAAKgC,OAAOC,eAAeH,IAAWI,eAASJ,EAAUC,EAAa/B,SAI9EmC,QAAS,CACPC,MAAOC,GACLrC,KAAKsC,MAAM,QAASD,GAEpBrC,KAAKC,WAAaD,KAAKuC,UAEzBC,YACE,MAAM9D,EAAW,GAWjB,OATIsB,KAAKyC,UACP/D,EAASgE,KACP1C,KAAK2C,eAAeC,OAAO,CACzBjE,YAAa,iBACbc,MAAO,CAAEoD,MAAM,IACd7C,KAAKO,aAILP,KAAK2C,eAAeG,OAAoBpE,IAEjDqE,WACE,OAAO/C,KAAK2C,eAAeC,OAAO,CAChCjE,YAAa,gBACbc,MAAO,CACLuD,OAAO,EACPC,KAAM,IAERC,MAAO,CACL,aAAclD,KAAKmD,SAASC,KAAKC,EAAErD,KAAKI,aAE1CkD,GAAI,CACFlB,MAAQC,IACNA,EAAEkB,kBACFlB,EAAEmB,iBAEFxD,KAAKsC,MAAM,eACXtC,KAAKsC,MAAM,iBAAiB,MAG/BtC,KAAKG,YAEVsD,aACE,OAAOzD,KAAK2C,eAAe,OAAQ,CACjChE,YAAa,mBACZ,CACDqB,KAAKnB,QAAUmB,KAAKwC,YACpBkB,eAAQ1D,MACRA,KAAKuB,UAAYvB,KAAK+C,eAK5BxE,OAAQC,GACN,MAAME,EAAW,CAACsB,KAAKyD,cACvB,IAAI,IAAE7C,EAAF,KAAOnC,GAASuB,KAAK2D,oBAEzBlF,EAAKyE,MAAQ,IACRzE,EAAKyE,MACR5C,UAAWN,KAAKM,UAAY,YAASsD,EACrCC,SAAU7D,KAAKC,YAAcD,KAAKK,SAAW,EAAI5B,EAAKyE,MAAOW,UAE/DpF,EAAKqF,WAAYpB,KAAK,CACpBrE,KAAM,OACNyC,MAAOd,KAAKN,SAEdjB,EAAOuB,KAAK+D,mBAAmB/D,KAAKsB,MAAO7C,GAE3C,MAAM6C,EAAQtB,KAAKa,WAAcb,KAAKU,UAAYV,KAAKsB,MAEvD,OAAO9C,EAAEoC,EAAKZ,KAAKgE,aAAa1C,EAAO7C,GAAOC,MChMnCuF,I,oIC4Bf,MAAMC,EAAahF,eACjBiF,OACAC,OACAC,OACAC,OACAhF,OACAiF,QAIaL,QAAW9F,OAAO,CAC/BC,KAAM,SAENyF,WAAY,CACVU,oBACAC,eAGFC,UACE,MAAO,CACLC,UAAU,EAEVC,MAAO5E,KAAK4E,QAIhBnF,MAAO,CACLoF,KAAMjF,QACNkF,aAAc,CACZnF,KAAMC,QACNC,SAAS,GAEXkF,oBAAqB,CACnBpF,KAAMC,QACNC,SAAS,GAEXQ,SAAUT,QACVoF,YAAapF,QACbqF,UAAW,CACTtF,KAAM,CAACuF,OAAQnF,QACfF,QAAS,QAEXsF,QAASvF,QACTwF,QAASxF,QACTyF,YAAazF,QACb0F,OAAQ,CACN3F,KAAMI,OACNF,QAAS,YAEX0F,WAAY,CACV5F,KAAM,CAACC,QAASG,QAChBF,QAAS,qBAEX2F,aAAc,CACZ7F,KAAM8F,OACN5F,QAASA,KAAA,MAIbpB,OACE,MAAO,CACLiH,kBAAmB,EACnBC,cAAe,EACfC,gBAAgB,EAChBC,WAAY,EACZC,cAAe,EACfC,cAAe,KACfC,MAAO,KAIXhF,SAAU,CACRiF,aACE,OAAOjG,KAAKgG,MAAMhG,KAAK6F,YAEzBK,iBACE,MAAMC,EAAYC,KAAKC,IAAIrG,KAAKsG,WAAWC,QAAQC,MAAOC,WAAWzG,KAAK0G,qBAE1E,OAAK1G,KAAK6E,KAEH8B,eAAc3G,KAAK4G,cAAc5G,KAAK6G,eAAgBV,KAAe,IAFrDnG,KAAK8G,SAASX,IAAc,KAIrDY,sBACE,MAAMC,EAAShH,KAAK6E,KAChB,QACA8B,eAAc3G,KAAKiF,WAEvB,OAAO+B,GAAU,KAEnBC,qBACE,OAAON,eAAc3G,KAAKkH,WAAa,KAEzCR,qBACE,GAAI1G,KAAKmH,SACP,OAAOR,eAAc3G,KAAKmH,WAAa,IAGzC,MAAMA,EAAWf,KAAKgB,IACpBpH,KAAKsG,WAAWe,UAAUb,MAC1BtB,OAAOlF,KAAKsH,aACXtH,KAAK6E,KAAO,GAAK,GAClBuB,KAAKC,IAAIrG,KAAKuH,UAAY,GAAI,IAG1BN,EAAqBO,MAAMC,SAASzH,KAAKiH,qBAC3CE,EACAM,SAASzH,KAAKiH,oBAElB,OAAON,eAAcP,KAAKgB,IACxBH,EACAE,KACI,KAERO,gBACE,MAAMC,EAAO3H,KAAK6E,KAEd8B,eAAc3G,KAAK4H,cAAc5H,KAAK0F,oBADtC1F,KAAK6H,UAGT,OAAOF,GAAO,KAEhBG,oBACE,OAAOlI,QAAQI,KAAKgG,MAAM+B,KAAKC,GAAQA,EAAKC,UAAY,KAE1DC,SACE,MAAO,CACLjD,UAAWjF,KAAK+G,oBAChBI,SAAUnH,KAAK0G,mBACfQ,SAAUlH,KAAKiH,mBACfU,IAAK3H,KAAK0H,cACV7E,KAAM7C,KAAKkG,eACXiC,gBAAiBnI,KAAKsF,OACtB8C,OAAQpI,KAAKoI,QAAUpI,KAAKqI,gBAKlCC,MAAO,CACL7F,SAAU8F,GACHA,IAAKvI,KAAK6F,WAAa,IAE9B2C,gBAAiBD,GACfvI,KAAK4F,eAAiB2C,GAExB1C,UAAW4C,EAAMC,GACf,GAAID,KAAQzI,KAAKgG,MAAO,CACtB,MAAMgC,EAAOhI,KAAKgG,MAAMyC,GACxBT,EAAKW,UAAUC,IAAI,4BACnB,MAAMC,EAAY7I,KAAK8I,MAAMvC,QAAQsC,UAC/BE,EAAgB/I,KAAK8I,MAAMvC,QAAQyC,aAErCH,EAAYb,EAAKiB,UAAY,EAC/BC,eAAKlB,EAAKiB,UAAYjB,EAAKgB,aAAc,CACvCG,WAAW,EACXC,SAAU,IACVC,UAAWrJ,KAAK8I,MAAMvC,UAEfsC,EAAYE,EAAgBf,EAAKiB,UAAYjB,EAAKgB,aAAe,GAC1EE,eAAKlB,EAAKiB,UAAYF,EAAoC,EAApBf,EAAKgB,aAAkB,CAC3DG,WAAW,EACXC,SAAU,IACVC,UAAWrJ,KAAK8I,MAAMvC,UAK5BmC,KAAQ1I,KAAKgG,OACXhG,KAAKgG,MAAM0C,GAAMC,UAAUW,OAAO,8BAIxC3H,UAEM3B,KAAKgC,OAAOC,eAAe,eAC7BsH,eAAQ,aAAcvJ,OAI1BwJ,UACExJ,KAAKyC,UAAYzC,KAAKyJ,gBAGxBtH,QAAS,CACPuH,WAGE1J,KAAK2J,mBAELC,sBAAsB,KAEpB5J,KAAK6J,kBAAkBC,KAAK,KACtB9J,KAAK8I,MAAMvC,UACbvG,KAAK0F,kBAAoB1F,KAAK+J,cAC9B/J,KAAK6E,OAAS7E,KAAK8I,MAAMvC,QAAQsC,UAAY7I,KAAKgK,4BAK1DA,qBACE,MAAMC,EAAMjK,KAAK8I,MAAMvC,QACjBN,EAAagE,EAAIC,cAAc,wBAC/BC,EAAeF,EAAIG,aAAeH,EAAII,aAE5C,OAAOpE,EACHG,KAAKgB,IAAI+C,EAAc/D,KAAKC,IAAI,EAAGJ,EAAWgD,UAAYgB,EAAII,aAAe,EAAIpE,EAAWoE,aAAe,IAC3GJ,EAAIpB,WAEVhC,eACE,OAAOY,SAASzH,KAAKsG,WAAWe,UAAUxE,KAA4B,EAArB7C,KAAK2F,gBAExDoE,cACE,MAAME,EAAMjK,KAAK8I,MAAMvC,QACjBN,EAAagE,EAAIC,cAAc,wBAMrC,GAJKjE,IACHjG,KAAK+F,cAAgB,MAGnB/F,KAAKoF,UAAYa,EACnB,OAAOjG,KAAKsK,YAGdtK,KAAK+F,cAAgBwE,MAAMC,KAAKxK,KAAKgG,OAAOyE,QAAQxE,GAEpD,MAAMyE,EAA0BzE,EAAWgD,UAAYjJ,KAAKgK,qBACtDW,EAAsBV,EAAIC,cAAc,gBAAgCjB,UAE9E,OAAOjJ,KAAKsK,YAAcI,EAA0BC,EAAqB,GAE3EC,gBAAiBvI,GAIf,GAFArC,KAAK6K,WAEA7K,KAAKyC,UAAazC,KAAK8H,kBAErB,GAAIzF,EAAEyI,UAAYC,OAASC,IAA3B,CAGA,GAAI3I,EAAEyI,UAAYC,OAASE,KAChCjL,KAAKkL,gBACA,GAAI7I,EAAEyI,UAAYC,OAASI,GAChCnL,KAAKoL,gBACA,GAAI/I,EAAEyI,UAAYC,OAASM,IAChCrL,KAAKsL,gBACA,GAAIjJ,EAAEyI,UAAYC,OAASQ,KAChCvL,KAAKwL,gBACA,IAAInJ,EAAEyI,UAAYC,OAASU,QAA6B,IAApBzL,KAAK6F,UAEvC,OADP7F,KAAKgG,MAAMhG,KAAK6F,WAAWzD,QAG7BC,EAAEmB,sBAdAxD,KAAKyC,UAAW,GAgBpBiJ,iBAAkBrJ,GAChB,MAAMsJ,EAAStJ,EAAEsJ,OAEjB,OAAO3L,KAAKyC,WACTzC,KAAK4L,cACN5L,KAAK8E,eACJ9E,KAAK8I,MAAMvC,QAAQsF,SAASF,IAEjCG,yBACE,MAAMC,EAAaC,OAAY9K,QAAQiB,QAAQ2J,uBAAuB3K,KAAKnB,MAE3E,OAAIA,KAAKiG,YAAcjG,KAAKiG,WAAWgG,GAC9B,IACFF,EACH,wBAAyB/L,KAAKiG,WAAWgG,IAItCF,GAETG,wBACE,MAAMC,EAAY5H,OAASrD,QAAQiB,QAAQ+J,sBAAsB/K,KAAKnB,MAMtE,OAJKA,KAAKgF,cACRmH,EAAUC,QAAUpM,KAAKqM,WAGpBF,GAETG,gBACE,MAAM/F,EAAUvG,KAAKyD,aAErB,OAAKzD,KAAKuF,WAEHvF,KAAK2C,eAAe,aAAc,CACvClD,MAAO,CACLpB,KAAM2B,KAAKuF,aAEZ,CAACgB,IANyBA,GAQ/BgG,gBACE,MAAMzI,EAA+B,CAAC,CACpCzF,KAAM,OACNyC,MAAOd,KAAKwI,kBAed,OAXKxI,KAAKqF,aAAerF,KAAK8E,cAC5BhB,EAAWpB,KAAK,CACdrE,KAAM,gBACNyC,MAAO,CACL0L,QAASA,KAAQxM,KAAKyC,UAAW,GACjCiJ,iBAAkB1L,KAAK0L,iBACvBe,QAASA,IAAM,CAACzM,KAAKiK,OAAQjK,KAAK0M,+BAKjC5I,GAETL,aACE,MAAMvC,EAAU,CACdgC,MAAO,IACFlD,KAAK2M,qBACL3M,KAAKwF,aACRoH,KAAM,SAAU5M,KAAKgC,OAAShC,KAAKgC,OAAO4K,KAAO,QAEnDjO,YAAa,kBACbkO,MAAO,IACF7M,KAAK8M,oBACL9M,KAAK+M,eACR,wBAAyB/M,KAAK6E,KAC9B,yBAA0B7E,KAAKgN,eAC/BC,0BAA2BjN,KAAKyC,SAChC,CAACzC,KAAKkN,aAAaC,SAAS,GAE9BC,MAAOpN,KAAKkI,OACZpE,WAAY9D,KAAKuM,gBACjBc,IAAK,UACL/J,GAAI,CACFlB,MAAQC,IACN,MAAMsJ,EAAStJ,EAAEsJ,OAEbA,EAAO2B,aAAa,aACpBtN,KAAK+E,sBAAqB/E,KAAKyC,UAAW,IAEhD2J,QAASpM,KAAKqM,YAmBlB,OAfIrM,KAAKuN,WAAWC,SAClBtM,EAAQoC,GAAKpC,EAAQoC,IAAM,GAC3BpC,EAAQoC,GAAGkK,OAASxN,KAAKuN,WAAWC,SAGjCxN,KAAKK,UAAYL,KAAKqF,cACzBnE,EAAQoC,GAAKpC,EAAQoC,IAAM,GAC3BpC,EAAQoC,GAAGmK,WAAazN,KAAK0N,mBAG3B1N,KAAKqF,cACPnE,EAAQoC,GAAKpC,EAAQoC,IAAM,GAC3BpC,EAAQoC,GAAGqK,WAAa3N,KAAK4N,mBAGxB5N,KAAK2C,eAAe,MAAOzB,EAASlB,KAAK6N,mBAElDhD,WACO7K,KAAK8I,MAAMvC,UAEhBvG,KAAKgG,MAAQuE,MAAMC,KAAKxK,KAAK8I,MAAMvC,QAAQuH,iBAAiB,6CAE9DJ,oBACE1N,KAAK+N,SAAS,OAAQ,KAChB/N,KAAK4F,iBAET5F,KAAK4F,gBAAiB,MAG1BgI,kBAAmBvL,GAEjBrC,KAAK+N,SAAS,QAAS,K,OACC,QAAlBC,EAAAhO,KAAK8I,MAAMvC,eAAO,IAAAyH,OAAA,EAAAA,EAAEnC,SAASxJ,EAAE4L,iBAEnCrE,sBAAsB,KACpB5J,KAAKyC,UAAW,EAChBzC,KAAKkO,sBAIXhD,WACE,MAAMlD,EAAOhI,KAAKgG,MAAMhG,KAAK6F,UAAY,GAEzC,IAAKmC,EAAM,CACT,IAAKhI,KAAKgG,MAAM/G,OAAQ,OAKxB,OAHAe,KAAK6F,WAAa,OAClB7F,KAAKkL,WAKPlL,KAAK6F,aACkB,IAAnBmC,EAAKC,UAAiBjI,KAAKkL,YAEjCE,WACE,MAAMpD,EAAOhI,KAAKgG,MAAMhG,KAAK6F,UAAY,GAEzC,IAAKmC,EAAM,CACT,IAAKhI,KAAKgG,MAAM/G,OAAQ,OAKxB,OAHAe,KAAK6F,UAAY7F,KAAKgG,MAAM/G,YAC5Be,KAAKoL,WAKPpL,KAAK6F,aACkB,IAAnBmC,EAAKC,UAAiBjI,KAAKoL,YAEjCE,WACE,MAAMtD,EAAOhI,KAAKgG,MAAMhG,KAAKgG,MAAM/G,OAAS,GAEvC+I,IAELhI,KAAK6F,UAAY7F,KAAKgG,MAAM/G,OAAS,GAEd,IAAnB+I,EAAKC,UAAiBjI,KAAKoL,aAEjCI,YACE,MAAMxD,EAAOhI,KAAKgG,MAAM,GAEnBgC,IAELhI,KAAK6F,UAAY,GAEM,IAAnBmC,EAAKC,UAAiBjI,KAAKkL,aAEjCmB,UAAWhK,GACT,IAAIrC,KAAKgF,YAAT,CAEA,GAAI3C,EAAEyI,UAAYC,OAASoD,IAAK,CAE9BC,WAAW,KAAQpO,KAAKyC,UAAW,IACnC,MAAM4E,EAAYrH,KAAKqO,eACvBrO,KAAKsO,UAAU,IAAMjH,GAAaA,EAAUkH,cAE3CvO,KAAKyC,UACN,CAACsI,OAASI,GAAIJ,OAASE,MAAMuD,SAASnM,EAAEyI,WAExC9K,KAAKyC,UAAW,GAIlBzC,KAAKsO,UAAU,IAAMtO,KAAK4K,gBAAgBvI,MAE5CoM,WACOzO,KAAKyC,WAKVzC,KAAK8I,MAAMvC,QAAQmI,YACnB1O,KAAK2J,mBAOLgF,aAAa3O,KAAK8F,eAClB9F,KAAK8F,cAAgB8I,OAAOR,WAAWpO,KAAK2J,iBAAkB,QAIlEpL,OAAQC,GACN,MAAMC,EAAO,CACXE,YAAa,SACbkO,MAAO,CACL,mBACkB,KAAhB7M,KAAK6O,SACW,IAAhB7O,KAAK6O,QACW,WAAhB7O,KAAK6O,QAET/K,WAAY,CAAC,CACXgL,IAAK,MACLzQ,KAAM,SACNyC,MAAOd,KAAKyO,YAIhB,OAAOjQ,EAAE,MAAOC,EAAM,EACnBuB,KAAKqH,WAAarH,KAAK+O,eACxB/O,KAAKgP,gBAAgB,IAAM,CACzBhP,KAAK2C,eAAesM,OAAgB,CAClCxP,MAAO,CACLyP,MAAM,EACNC,MAAOnP,KAAKmP,MACZC,KAAMpP,KAAKoP,OAEZ,CAACpP,KAAKsM,yBCvgBF+C,I,sECYAlR,SAAIC,OAAO,CACxBC,KAAM,oBAENC,YAAY,EAEZwF,WAAY,CACVwL,eAGF7P,MAAO,IACFN,OAAU+B,QAAQzB,SAClBH,OAAU4B,QAAQzB,MACrBY,SAAUT,QACV2P,OAAQ,CACN5P,KAAMC,QACNC,SAAS,GAEXiB,MAAOlB,QACP4P,cAAe5P,QACf6P,kBAAmB,CACjB9P,KAAMI,OACNF,QAAS,0BAEX6P,OAAQ,CACN/P,KAAMI,OACNF,QAAS,eAEX8P,QAAS,CACPhQ,KAAMI,OACNF,QAAS,iBAIbtB,OAAQC,GAAG,MAAEiB,EAAF,KAAShB,EAAT,UAAe0N,IACxB,MAAMzN,EAAW,GACjB,IAAIkR,EAAOnQ,EAAMkQ,QAYjB,GAXIlQ,EAAM+P,cAAeI,EAAOnQ,EAAMgQ,kBAC7BhQ,EAAMqB,QAAO8O,EAAOnQ,EAAMiQ,QAEnChR,EAASgE,KAAKlE,EAAEoE,OAAOzD,OAAU+B,QAAQiB,QAAQ6B,aAAavE,EAAMqB,OAASrB,EAAM6B,MAAO,CACxF7B,MAAO,CACLY,SAAUZ,EAAMY,SAChB+O,KAAM3P,EAAM2P,KACZD,MAAO1P,EAAM0P,SAEbS,IAEAnQ,EAAM8P,SAAW9P,EAAMY,SAAU,CACnC,MAAMkP,EAAS/Q,EAAE,MAAOW,OAAU+B,QAAQiB,QAAQ6B,aAAavE,EAAM6B,MAAO,CAC1E3C,YAAa,sCACbmF,WAAY,CAAC,CACX+L,IAAKP,OACLjR,KAAM,SACNyC,MAAO,CAAEgP,QAAQ,QAIrBpR,EAASgE,KAAK6M,GAGhB,OAAO/Q,EAAE,MACPuR,eAAUtR,EAAM,CACdoO,MAAO,CACL,qBAAqB,EACrB,8BAA+BpN,EAAMY,UAEvCiD,GAAI,CACFlB,MAAQC,IACNA,EAAEkB,kBAEE9E,EAAK6E,IAAM7E,EAAK6E,GAAG0M,QAAUvQ,EAAMY,UACrC4P,eAAYxR,EAAK6E,GAAG0M,OAAOnO,QAAQqO,GAAKA,GAAGzQ,EAAMqB,YAIrD,CACFtC,EAAE,MAAO,CAAEG,YAAa,sCAAwCD,Q,YChFzDQ,G,UAAAA,eACbI,QAEAlB,OAAO,CACPC,KAAM,cAENoB,MAAO,CACL0Q,MAAOvQ,SAGTrB,OAAQC,GACN,OAAOA,EAAE,MAAO,CACdG,YAAa,cACbkO,MAAO,CACL,qBAAsB7M,KAAKmQ,SACxBnQ,KAAKwB,cAEV0B,MAAOlD,KAAKgC,OACZsB,GAAItD,KAAKuN,YACR7J,eAAQ1D,WC3BAoQ,I,gDC4BAlR,iBAAOC,OAAWG,QAAWlB,OAAO,CACjDC,KAAM,gBAGNyF,WAAY,CACVyL,eAGF9P,MAAO,CACL4Q,OAAQzQ,QACR0Q,MAAO1Q,QACP2Q,aAAc3Q,QACd4Q,MAAO,CACL7Q,KAAM4K,MACN1K,QAASA,IAAM,IAEjB4Q,aAAc,CACZ9Q,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,YAEX8Q,SAAU,CACRhR,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,QAEX+Q,UAAW,CACTjR,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,SAEXgR,WAAY9Q,OACZ+Q,SAAUlR,QACVmR,YAAa,KACbC,cAAe,CACbrR,KAAM4K,MACN1K,QAASA,IAAM,KAInBmB,SAAU,CACRiQ,cACE,OAAOjR,KAAKgR,cAAcE,IAAIC,GAAQnR,KAAKoR,SAASD,KAEtDE,kBACE,OAAO5L,OAAO6L,KAAKtR,KAAKgE,aAAahE,KAAKsB,OAAOuL,OAAS,IAAI0E,KAAK,MAErEC,mBACE,MAAMxJ,EAAO,CACX9E,MAAO,CACL0J,UAAMhJ,GAERN,GAAI,CACFmO,UAAYpP,GAAaA,EAAEmB,mBAI/B,OAAOxD,KAAK2C,eAAe+O,OAAW1J,EAAM,CAC1ChI,KAAK2R,eAAe3R,KAAK6Q,gBAK/B1O,QAAS,CACPyP,UAAWT,EAAcU,GACvB,OAAO7R,KAAK2C,eAAemP,OAAiB,CAC1C9R,KAAK2C,eAAeoP,EAAiB,CACnCtS,MAAO,CACL6B,MAAOtB,KAAKsB,MACZR,MAAO+Q,EACPtC,QAAQ,GAEVjM,GAAI,CACF0M,MAAOA,IAAMhQ,KAAKsC,MAAM,SAAU6O,SAK1Ca,WAAYvS,GACV,OAAOO,KAAK2C,eAAesP,OAAU,CAAExS,WAEzCyS,gBAAiBlT,GAGf,GAFAA,EAAOA,GAAQ,IAEVgB,KAAK+Q,aAAe/Q,KAAK8Q,SAAU,OAAO9R,EAE/C,MAAM,MAAEmT,EAAF,OAASC,EAAT,IAAiB/G,GAAQrL,KAAKqS,oBAAoBrT,GAExD,MAAO,CAACmT,EAAOnS,KAAKsS,aAAaF,GAAS/G,IAE5CkH,UAAW9S,GACT,OAAOO,KAAK2C,eAAeyN,EAAY,CAAE3Q,SAASA,EAAM+S,SAE1DF,aAActT,GACZ,OAAOgB,KAAK2C,eAAe,OAAQ,CAAEhE,YAAa,qBAAuBK,IAE3EqT,oBAAqBrT,GAKnB,MAAM+R,GAAe/Q,KAAK+Q,aAAe,IAAI0B,WAAWC,oBAClDC,EAAQ3T,EAAK0T,oBAAoBjI,QAAQsG,GAE/C,GAAI4B,EAAQ,EAAG,MAAO,CAAER,MAAOnT,EAAMoT,OAAQ,GAAI/G,IAAK,IAEtD,MAAM8G,EAAQnT,EAAK4T,MAAM,EAAGD,GACtBP,EAASpT,EAAK4T,MAAMD,EAAOA,EAAQ5B,EAAY9R,QAC/CoM,EAAMrM,EAAK4T,MAAMD,EAAQ5B,EAAY9R,QAC3C,MAAO,CAAEkT,QAAOC,SAAQ/G,QAE1BwH,SAAS,KACP1B,EADO,MAEPwB,EAFO,SAGPtS,EAAW,KAHJ,MAIPS,GAAQ,IAEHA,IAAOA,EAAQd,KAAK8S,QAAQ3B,IAE7BA,IAAS1L,OAAO0L,KAClB9Q,EAAwB,OAAbA,EACPA,EACAL,KAAK+S,YAAY5B,IAGvB,MAAMnJ,EAAO,CACX9E,MAAO,CAGL,gBAAiBnD,OAAOe,GACxBmL,GAAI,aAAajM,KAAKgT,QAAQL,IAC9B/F,KAAM,UAERtJ,GAAI,CACFmO,UAAYpP,IAEVA,EAAEmB,kBAEJpB,MAAOA,IAAM/B,GAAYL,KAAKsC,MAAM,SAAU6O,IAEhD1R,MAAO,CACLK,YAAaE,KAAKqR,gBAClBhR,WACAkP,QAAQ,EACRsC,WAAY/Q,IAIhB,IAAKd,KAAKiT,aAAa9B,KACrB,OAAOnR,KAAK2C,eAAe+O,OAAW1J,EAAM,CAC1ChI,KAAKqQ,SAAWrQ,KAAKuQ,cAAgBvQ,KAAKwQ,MAAMvR,OAAS,EACrDe,KAAK4R,UAAUT,EAAMrQ,GACrB,KACJd,KAAK2R,eAAeR,EAAMwB,KAI9B,MAAMO,EAASlT,KACTmT,EAAanT,KAAKiT,aAAa9B,KAAK,CACxC+B,SACA/B,OACAjO,MAAO,IACF8E,EAAK9E,SACL8E,EAAKvI,OAEV6D,GAAI0E,EAAK1E,KAGX,OAAOtD,KAAKoT,UAAUD,GAClBnT,KAAK2C,eAAe+O,OAAW1J,EAAMmL,GACrCA,GAENxB,eAAgBR,EAAWwB,EAAQ,GACjC,OAAO3S,KAAK2C,eAAe0Q,OAAkB,CAC3CrT,KAAK2C,eAAe2Q,OAAgB,CAClCtT,KAAKkS,gBAAgBlS,KAAKuT,QAAQpC,SAIxC2B,QAAS3B,GACP,OAAOnR,KAAKiR,YAAYxG,QAAQzK,KAAKoR,SAASD,KAAU,GAE1DiC,UAAWI,GACT,OAAwB,IAAjBA,EAAMvU,QACkB,MAA7BuU,EAAM,GAAGC,kBACuC,gBAAhDD,EAAM,GAAGC,iBAAiBC,KAAKxS,QAAQ7C,MAE3C0U,YAAa5B,GACX,OAAOvR,QAAQ+T,eAAoBxC,EAAMnR,KAAKyQ,cAAc,KAE9D8C,QAASpC,GACP,OAAOpR,OAAO4T,eAAoBxC,EAAMnR,KAAK2Q,SAAUQ,KAEzDC,SAAUD,GACR,OAAOwC,eAAoBxC,EAAMnR,KAAK4Q,UAAW5Q,KAAKuT,QAAQpC,MAIlE5S,SACE,MAAMG,EAA0B,GAC1BkV,EAAc5T,KAAKwQ,MAAMvR,OAC/B,IAAK,IAAI0T,EAAQ,EAAGA,EAAQiB,EAAajB,IAAS,CAChD,MAAMxB,EAAOnR,KAAKwQ,MAAMmC,GAEpB3S,KAAKuQ,cACPvQ,KAAK8S,QAAQ3B,KAGH,MAARA,EAAczS,EAASgE,KAAK1C,KAAK6S,QAAQ,CAAE1B,OAAMwB,WAC5CxB,EAAKqB,OAAQ9T,EAASgE,KAAK1C,KAAKuS,UAAUpB,IAC1CA,EAAK0C,QAASnV,EAASgE,KAAK1C,KAAKgS,WAAWb,IAChDzS,EAASgE,KAAK1C,KAAK6S,QAAQ,CAAE1B,OAAMwB,YAS1C,OANAjU,EAASO,QAAUP,EAASgE,KAAK1C,KAAK8T,OAAO,YAAc9T,KAAKwR,kBAEhExR,KAAK8T,OAAO,iBAAmBpV,EAASqV,QAAQ/T,KAAK8T,OAAO,iBAE5D9T,KAAK8T,OAAO,gBAAkBpV,EAASgE,KAAK1C,KAAK8T,OAAO,gBAEjD9T,KAAK2C,eAAeqR,OAAO,CAChCrV,YAAa,gBACbkO,MAAO7M,KAAKwB,aACZ0B,MAAO,CACL0J,KAAM,UACN/I,UAAW,GAEbP,GAAI,CACFmO,UAAYpP,IACVA,EAAEmB,mBAGN/D,MAAO,CAAE6Q,MAAOtQ,KAAKsQ,QACpB5R,M,oCClQQP,SAAIC,OAAO,CACxBC,KAAM,aAENoB,MAAO,CACLoR,WAAY,CACVlR,KAAMI,OACNF,QAAS,0BCuBR,MAAMoU,EAAmB,CAC9BnP,cAAc,EACdC,qBAAqB,EACrBC,aAAa,EACbkP,aAAa,EACbjP,UAAW,KAIPf,EAAahF,eACjBiV,OACAC,OACAjQ,OACAkQ,GAiBanQ,QAAW9F,SAAkBA,OAAO,CACjDC,KAAM,WAENyF,WAAY,CACVU,qBAGF/E,MAAO,CACL6U,WAAY,CACV3U,KAAMI,OACNF,QAAS,aAEXgP,OAAQ,CACNlP,KAAM,KACNE,SAAS,GAEX0U,WAAY3U,QACZ4U,MAAO5U,QACP6U,UAAW7U,QACX8U,eAAgB9U,QAChB+U,cAAe/U,QACfgV,MAAOhV,QACP2Q,aAAc3Q,QACd4Q,MAAO,CACL7Q,KAAM4K,MACN1K,QAASA,IAAM,IAEjBgV,UAAW,CACTlV,KAAMI,OACNF,QAAS,WAEX4Q,aAAc,CACZ9Q,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,YAEX8Q,SAAU,CACRhR,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,QAEX+Q,UAAW,CACTjR,KAAM,CAACI,OAAQwK,MAAOmG,UACtB7Q,QAAS,SAEXiV,UAAW,CACTnV,KAAM,CAACI,OAAQwK,MAAO9E,QACtB5F,QAASA,IAAMoU,GAEjBc,SAAUnV,QACVoV,YAAapV,QACbqV,aAAcrV,QACdsV,WAAYtV,SAGdnB,OACE,MAAO,CACL0W,YAAanV,KAAKuU,WAAavU,KAAKwQ,MAAQ,GAC5C4E,cAAc,EACdC,cAAc,EACdC,SAAU,GAIVC,eAA0B3R,IAAf5D,KAAKc,MACZd,KAAKc,MACLd,KAAK+U,SAAW,QAAKnR,EACzBmC,eAAgB,EAChBiL,cAAe,GACfwE,qBAAsB,GACtBC,uBAAwB,IAI5BzU,SAAU,CAER0U,WACE,OAAO1V,KAAK2V,iBAAiB3V,KAAKmV,YAAYS,OAAO5V,KAAKwQ,SAE5DvP,UACE,MAAO,IACFkT,OAAWjT,QAAQF,SAASC,QAAQE,KAAKnB,MAC5C,YAAY,EACZ,kBAAmBA,KAAK6V,SACxB,yBAA0B7V,KAAKkV,WAC/B,2BAA4BlV,KAAKqV,aACjC,qBAAsBrV,KAAK+U,WAI/Be,gBACE,OAAO9V,KAAK0V,UAEdK,eACE,MAAO,QAAQ/V,KAAKgT,MAEtBgD,uB,MACE,MAAMlV,EAAQd,KAAK+U,SACf/U,KAAKgR,eAC+B,QAAnChD,EAAAhO,KAAKuT,QAAQvT,KAAKgR,cAAc,WAAG,IAAAhD,IAAI,IAAIyE,WAEhD,MAAiC,oBAAtBzS,KAAKiW,aACPjW,KAAKiW,aAAanV,GAGpBA,EAAM7B,QAEf6E,aACE,OAAO9D,KAAKkW,UAAY,CAAC,CACvB7X,KAAM,gBACNyC,MAAO,CACL0L,QAASxM,KAAKmW,KACdzK,iBAAkB1L,KAAK0L,iBACvBe,QAASA,IAAMzM,KAAK0M,mCAEnB9I,GAEPwS,gBACE,MAAO,QAETP,WACE,OAAO7V,KAAKwU,OAASxU,KAAKkV,YAE5BmB,UACE,OAAOzW,QAAQI,KAAK6V,UAAY7V,KAAKiT,aAAaqD,YAEpDC,UACE,OAAOvW,KAAKgR,cAAc/R,OAAS,GAErCuX,WACE,MAAMC,EAAUzW,KAAK0W,QAAW1W,KAAK0W,OAAOC,QAASC,SAAoCC,SACnF3T,EAAQuT,EAAU,CACtB,CAACA,IAAU,GACT,GAEJ,MAAO,CACLvT,MAAO,IACFA,EACH+I,GAAIjM,KAAK+V,cAEXtW,MAAO,CACL4Q,OAAQrQ,KAAK+U,SACbzT,MAAOtB,KAAK6U,UACZvE,MAAOtQ,KAAKsQ,MACZC,aAAcvQ,KAAKuQ,aACnBC,MAAOxQ,KAAK8W,iBACZrG,aAAczQ,KAAKyQ,aACnBE,SAAU3Q,KAAK2Q,SACfC,UAAW5Q,KAAK4Q,UAChBC,WAAY7Q,KAAKmD,SAASC,KAAKC,EAAErD,KAAK6Q,YACtCG,cAAehR,KAAKgR,eAEtB1N,GAAI,CACFyT,OAAQ/W,KAAKgX,YAEfC,YAAa,CACX9F,KAAMnR,KAAKiT,aAAa9B,QAI9B+F,aAKE,OAJIlX,KAAK8T,OAAO,YAAc9T,KAAK8T,OAAO,iBAAmB9T,KAAK8T,OAAO,iBACvEqD,eAAa,6DAGRnX,KAAK2C,eAAeyU,EAAapX,KAAKwW,WAE/CM,mBACE,OAAQ9W,KAAKqX,YAAoBxS,KAC7B7E,KAAK8V,cACL9V,KAAK8V,cAAclD,MAAM,EAAG5S,KAAKsV,WAEvCgC,YAAaA,KAAM,EACnBD,cACE,IAAIE,EAA4C,kBAAnBvX,KAAK8U,UAC9B9U,KAAK8U,UAAU0C,MAAM,KACrBxX,KAAK8U,UAST,OAPIvK,MAAMkN,QAAQF,KAChBA,EAAkBA,EAAgBG,OAAO,CAACC,EAAKC,KAC7CD,EAAIC,EAAEzK,SAAU,EACTwK,GACN,KAGE,IACF1D,EACHW,MAAO5U,KAAK4U,MACZ9T,MAAOd,KAAKsX,aAAetX,KAAKqV,aAChCwC,YAAaN,EAAgBnS,QAAU,EAAI,KACxCmS,KAKTjP,MAAO,CACLwP,cAAevP,GACbvI,KAAK+X,aAAexP,EACpBvI,KAAKgY,mBAEDhY,KAAK+U,UACP/U,KAAKsO,UAAU,K,MACE,QAAfN,EAAAhO,KAAK8I,MAAMmP,YAAI,IAAAjK,KAAErE,qBAGjB3J,KAAKuQ,cACPvQ,KAAKsO,UAAU,KACbtO,KAAKkY,cAIX7C,aAAc9M,GACZqG,OAAOR,WAAW,IAAMpO,KAAKmY,mBAAmB5P,KAElDiI,MAAO,CACL4H,WAAW,EACX5L,QAASjE,GACHvI,KAAKuU,YAIPvU,KAAKsO,UAAU,KACbtO,KAAKmV,YAAcnV,KAAK2V,iBAAiB3V,KAAKmV,YAAYS,OAAOrN,MAIrEvI,KAAKgY,sBAKX7V,QAAS,CAEPgU,KAAM9T,GACJ8R,OAAWjT,QAAQiB,QAAQgU,KAAKhV,KAAKnB,KAAMqC,GAC3CrC,KAAKqV,cAAe,EACpBrV,KAAKkW,WAAY,EACjBlW,KAAK+F,eAAiB,EACtB/F,KAAKqY,cAAc,IAGrBC,eAEKtY,KAAKuY,gBACNvY,KAAKqV,eAGPrV,KAAKqV,cAAe,IAEtBmD,oBACExY,KAAKyY,SAASzY,KAAK+U,SAAW,GAAK,MACnC/U,KAAKqY,cAAc,GACnBrY,KAAKsO,UAAU,IAAMtO,KAAK8I,MAAMkH,OAAShQ,KAAK8I,MAAMkH,MAAMzB,SAEtDvO,KAAKgV,cAAahV,KAAKqV,cAAe,IAE5C3J,iBAAkBrJ,GAChB,OAAKrC,KAAKqV,eAGPrV,KAAK4L,gBAIJ5L,KAAK0Y,eACN1Y,KAAK0Y,aAAa7M,SAASxJ,EAAEsJ,UAG9B3L,KAAKiK,MACJjK,KAAKiK,IAAI4B,SAASxJ,EAAEsJ,SACrBtJ,EAAEsJ,SAAW3L,KAAKiK,KAGtB0L,iBAAkBgD,GAChB,MAAMC,EAAe,IAAIC,IACzB,IAAK,IAAIlG,EAAQ,EAAGA,EAAQgG,EAAI1Z,SAAU0T,EAAO,CAC/C,MAAMxB,EAAOwH,EAAIhG,GAGjB,GAAY,MAARxB,EACF,SAGF,GAAIA,EAAKqB,QAAUrB,EAAK0C,QAAS,CAC/B+E,EAAaE,IAAI3H,EAAMA,GACvB,SAGF,MAAM5I,EAAMvI,KAAKoR,SAASD,IAGzByH,EAAaG,IAAIxQ,IAAQqQ,EAAaE,IAAIvQ,EAAK4I,GAElD,OAAO5G,MAAMC,KAAKoO,EAAaI,WAEjCC,kBAAmB9H,GACjB,MAAMP,EAAY5Q,KAAKoR,SAASD,GAEhC,OAAQnR,KAAK8X,eAAiB,IAAIoB,UAAWC,GAAcnZ,KAAKoZ,gBAAgBpZ,KAAKoR,SAAS+H,GAAIvI,KAEpG8H,aACE,OAAO1Y,KAAK8I,MAAMmP,MAAQjY,KAAK8I,MAAMmP,KAAKnP,MAAMvC,SAElD8S,iBAAkBlI,EAAcwB,GAC9B,MAAM2G,EACJtZ,KAAKsZ,YACLtZ,KAAK+S,YAAY5B,GAEboH,GAAiBe,GAActZ,KAAKuY,cAE1C,OAAOvY,KAAK2C,eAAesB,EAAO,CAChCtF,YAAa,iBACbuE,MAAO,CAAEW,UAAW,GACpBpE,MAAO,CACLS,MAAOF,KAAK0U,gBAAkB6D,EAC9BlY,SAAUiZ,EACVzH,WAAYc,IAAU3S,KAAK+F,cAC3BwT,MAAOvZ,KAAKkV,YAEd5R,GAAI,CACFlB,MAAQC,IACDkW,IAELlW,EAAEkB,kBAEFvD,KAAK+F,cAAgB4M,IAEvB,cAAe6G,IAAMxZ,KAAKyZ,YAAYtI,IAExCuI,IAAKC,KAAKC,UAAU5Z,KAAKoR,SAASD,KACjCnR,KAAKuT,QAAQpC,KAElB0I,kBAAmB1I,EAAcwB,EAAemH,GAC9C,MAAMxY,EAAQqR,IAAU3S,KAAK+F,eAAiB/F,KAAK+Z,cAC7CT,EACJtZ,KAAKsZ,YACLtZ,KAAK+S,YAAY5B,GAGnB,OAAOnR,KAAK2C,eAAe,MAAO3C,KAAKgE,aAAa1C,EAAO,CACzD3C,YAAa,iDACbkO,MAAO,CACL,gCAAiCyM,GAEnCI,IAAKC,KAAKC,UAAU5Z,KAAKoR,SAASD,MAChC,GAAGnR,KAAKuT,QAAQpC,KAAQ2I,EAAO,GAAK,SAE1CE,iBACE,MAAMC,EAAaja,KAAKka,gBAClBlK,EAAQhQ,KAAKma,WAYnB,OARI5P,MAAMkN,QAAQwC,GAChBA,EAAWvX,KAAKsN,IAGhBiK,EAAWvb,SAAWub,EAAWvb,UAAY,GAC7Cub,EAAWvb,SAASgE,KAAKsN,IAGpB,CACLhQ,KAAKoa,cACLpa,KAAK2C,eAAe,MAAO,CACzBhE,YAAa,iBACbmF,WAAY9D,KAAK8D,YAChB,CACD9D,KAAKqa,WACLra,KAAKsa,OAASta,KAAKua,SAAS,UAAY,KACxCN,EACAja,KAAKwa,OAASxa,KAAKua,SAAS,UAAY,KACxCva,KAAKya,eACLza,KAAK0a,cACL1a,KAAK2a,mBAEP3a,KAAK4a,UACL5a,KAAK6a,gBAGTC,QACEnb,EACAob,EACAC,GAEA,MAAMpL,EAAOqL,OAAO/Z,QAAQiB,QAAQ2Y,QAAQ3Z,KAAKnB,KAAML,EAAMob,EAAIC,GAajE,MAXa,WAATrb,IAEFiQ,EAAKlR,SAAU,GAAGD,KAAOsR,eAAUH,EAAKlR,SAAU,GAAGD,KAAO,CAC1DyE,MAAO,CACLW,SAAU+L,EAAKlR,SAAU,GAAG+U,iBAAkBtH,WAAa,KAC3D,cAAe,OACf,kBAAcvI,MAKbgM,GAETuK,WACE,MAAMnK,EAAQmE,OAAWjT,QAAQiB,QAAQgY,SAAShZ,KAAKnB,MAiBvD,cAfOgQ,EAAMvR,KAAMyE,MAAO7E,KAE1B2R,EAAMvR,KAAOsR,eAAUC,EAAMvR,KAAO,CAClCyc,SAAU,CAAEpa,MAAO,MACnBoC,MAAO,CACLiY,UAAU,EACVxb,KAAM,OACN,gBAAiBI,OAAOC,KAAKob,YAC7B,wBAAyBC,eAAqBrb,KAAK8I,MAAMmP,KAAM,iBAC/DqD,aAAcD,eAAqBrL,EAAMvR,KAAO,qBAAsB,OACtE8c,YAAevb,KAAKuW,UAAYvW,KAAKwb,wBAAyBxb,KAAKkW,WAAclW,KAAKyb,cAAgC7X,EAAnB5D,KAAKub,aAE1GjY,GAAI,CAAEoY,SAAU1b,KAAK2b,cAGhB3L,GAET2K,iBACE,OAAO3a,KAAK2C,eAAe,QAAS,CAClCuY,SAAU,CAAEpa,MAAOd,KAAKuV,WACxBrS,MAAO,CACLvD,KAAM,SACNtB,KAAM2B,KAAK4b,OAAOvd,SAIxBwd,eACE,MAAMtd,EAAS4V,OAAWjT,QAAQiB,QAAQ0Z,aAAa1a,KAAKnB,MAU5D,OARAzB,EAAOE,KAAMyE,MAAQ,IAChB3E,EAAOE,KAAMyE,MAChB0J,KAAM,SACN,gBAAiB,UACjB,gBAAiB7M,OAAOC,KAAKqV,cAC7B,YAAarV,KAAK+V,cAGbxX,GAETud,UAEE,OAAI9b,KAAK8T,OAAO,YAAc9T,KAAK8T,OAAO,iBAAmB9T,KAAK8T,OAAO,eAChE9T,KAAK+b,kBAEL/b,KAAKkX,YAGhB6E,kBACE,MAAMC,EAAQ,CAAC,eAAgB,UAAW,eACvCnd,OAAOod,GAAYjc,KAAK8T,OAAOmI,IAC/B/K,IAAI+K,GAAYjc,KAAK2C,eAAe,WAAY,CAC/C6Q,KAAMyI,GACLjc,KAAK8T,OAAOmI,KAIjB,OAAOjc,KAAK2C,eAAeyU,EAAa,IACnCpX,KAAKwW,UACPwF,IAELpB,UACE,MAAMnb,EAAQO,KAAKqX,YAiBnB,OAhBA5X,EAAM4H,UAAYrH,KAAK8I,MAAM,cAEzB,WAAYrJ,IAGE,KAAhBO,KAAK6O,SACW,IAAhB7O,KAAK6O,QACW,WAAhB7O,KAAK6O,OAILpP,EAAMoP,OAAS7O,KAAKiK,IAEpBxK,EAAMoP,OAAS7O,KAAK6O,QAGf7O,KAAK2C,eAAe0M,EAAO,CAChCnM,MAAO,CAAE0J,UAAMhJ,GACfnE,QACA6D,GAAI,CACF0M,MAAQzH,IACNvI,KAAKqV,aAAe9M,EACpBvI,KAAKkW,UAAY3N,GAEnBiF,OAAQxN,KAAKkY,UAEf7K,IAAK,QACJ,CAACrN,KAAK8b,aAEX5B,gBACE,IAAIjb,EAASe,KAAKgR,cAAc/R,OAChC,MAAMP,EAAW,IAAI6L,MAAMtL,GAE3B,IAAIid,EAEFA,EADElc,KAAKiT,aAAaqD,UACLtW,KAAKmc,iBACXnc,KAAK6V,SACC7V,KAAKqZ,iBAELrZ,KAAK6Z,kBAGtB,MAAO5a,IACLP,EAASO,GAAUid,EACjBlc,KAAKgR,cAAc/R,GACnBA,EACAA,IAAWP,EAASO,OAAS,GAIjC,OAAOe,KAAK2C,eAAe,MAAO,CAChChE,YAAa,wBACZD,IAELyd,iBAAkBhL,EAAcwB,GAC9B,OAAO3S,KAAKiT,aAAaqD,UAAW,CAClCpT,MAAO,CACL2J,MAAO,kBAETqG,OAAQlT,KACRmR,OACAwB,QACAoE,OAAS1U,IACPA,EAAEkB,kBACFvD,KAAK+F,cAAgB4M,GAEvByJ,SAAUzJ,IAAU3S,KAAK+F,cACzB1F,UAAWL,KAAKuY,iBAGpB8D,eACE,OAAOrc,KAAK8I,MAAMmP,KAAQjY,KAAK8I,MAAMmP,KAAgCpS,WAAa,GAEpFkN,YAAa5B,GACX,OAAOwC,eAAoBxC,EAAMnR,KAAKyQ,cAAc,IAEtD8C,QAASpC,GACP,OAAOwC,eAAoBxC,EAAMnR,KAAK2Q,SAAUQ,IAElDC,SAAUD,GACR,OAAOwC,eAAoBxC,EAAMnR,KAAK4Q,UAAW5Q,KAAKuT,QAAQpC,KAEhEmL,OAAQja,GACNA,GAAKrC,KAAKsC,MAAM,OAAQD,IAE1BoX,YAAatI,GACPnR,KAAK+U,SAAU/U,KAAKgX,WAAW7F,GAC9BnR,KAAKyY,SAAS,MAGe,IAA9BzY,KAAKgR,cAAc/R,OACrBe,KAAKqV,cAAe,EAEpBrV,KAAKqV,cAAe,EAEtBrV,KAAK+F,eAAiB,GAExBwW,QAASla,GACFrC,KAAKuY,gBAELvY,KAAKwc,cAAcna,EAAEsJ,UACxB3L,KAAKqV,cAAe,GAGjBrV,KAAKkW,YACRlW,KAAKkW,WAAY,EACjBlW,KAAKsC,MAAM,UAGbtC,KAAKsC,MAAM,QAASD,KAEtBoa,UAAWpa,GACTA,EAAEmB,iBACExD,KAAKqV,eACPhT,EAAEkB,kBACFvD,KAAKqV,cAAe,IAGxBsG,WAAYtZ,GACV,GACErC,KAAK+U,WACJ/U,KAAKuY,eACNvY,KAAK2U,eACLtS,EAAEqX,IAAIza,OAAS,GACfoD,EAAEqa,SAAWra,EAAEsa,SAAWta,EAAEua,OAC5B,OAEF,MAAMC,EAA4B,IAC5BC,EAAMC,YAAYD,MACpBA,EAAM9c,KAAKyV,uBAAyBoH,IACtC7c,KAAKwV,qBAAuB,IAE9BxV,KAAKwV,sBAAwBnT,EAAEqX,IAAIsD,cACnChd,KAAKyV,uBAAyBqH,EAE9B,MAAMnK,EAAQ3S,KAAK0V,SAASwD,UAAU/H,I,MACpC,MAAMnS,GAA0B,QAAlBgP,EAAAhO,KAAKuT,QAAQpC,UAAK,IAAAnD,IAAI,IAAIyE,WAExC,OAAOzT,EAAKge,cAAcC,WAAWjd,KAAKwV,wBAEtCrE,EAAOnR,KAAK0V,SAAS/C,IACZ,IAAXA,IACF3S,KAAKsV,SAAWlP,KAAKC,IAAIrG,KAAKsV,SAAU3C,EAAQ,GAChD3S,KAAKyY,SAASzY,KAAKiV,aAAe9D,EAAOnR,KAAKoR,SAASD,IACvDnR,KAAKsO,UAAU,IAAMtO,KAAK8I,MAAMmP,KAAKpN,YACrCuD,WAAW,IAAMpO,KAAKqY,aAAa1F,MAGvCtG,UAAWhK,GACT,GAAIrC,KAAKob,YAAc/Y,EAAEyI,UAAYC,OAASC,IAAK,OAEnD,MAAMF,EAAUzI,EAAEyI,QACZmN,EAAOjY,KAAK8I,MAAMmP,KAIxB,OAFAjY,KAAKsC,MAAM,UAAWD,GAEjB4V,GAIDjY,KAAKqV,cAAgB,CAACtK,OAASI,GAAIJ,OAASE,KAAMF,OAASQ,KAAMR,OAASM,IAAKN,OAASU,OAAO+C,SAAS1D,IAC1G9K,KAAKsO,UAAU,KACb2J,EAAKrN,gBAAgBvI,GACrBrC,KAAKsC,MAAM,oBAAqB2V,EAAKpS,aAKrC,CACFkF,OAASU,MACTV,OAASmS,OACT1O,SAAS1D,IAAU9K,KAAKsY,gBAOvBtY,KAAKqV,cACN,CAACtK,OAASI,GAAIJ,OAASE,KAAMF,OAASQ,KAAMR,OAASM,KAAKmD,SAAS1D,GAC5D9K,KAAKmd,SAAS9a,GAGnByI,IAAYC,OAASoD,IAAYnO,KAAKyc,UAAUpa,GAGhDyI,IAAYC,OAASC,IAAYhL,KAAKod,UAAU/a,GAGhDyI,IAAYC,OAASmS,MAAcld,KAAKqd,YAAYhb,QAAxD,QAjCA,GAmCF8V,mBAAoB5P,GAIlB,GACGvI,KAAK+U,WAAaxM,GACnBvI,KAAKqc,gBAAkB,EACvB,OAEF,MAAMpE,EAAOjY,KAAK8I,MAAMmP,KAExB,GAAKA,GAASjY,KAAKuW,QAAnB,CAGAvW,KAAK8I,MAAMmP,KAAKpN,WAChB,IAAK,IAAIsO,EAAI,EAAGA,EAAIlB,EAAKjS,MAAM/G,OAAQka,IACrC,GAAoD,SAAhDlB,EAAKjS,MAAMmT,GAAG7L,aAAa,iBAA6B,CAC1DtN,KAAKqY,aAAac,GAClB,SAINmE,UAAWjb,GAGPrC,KAAKud,cACO,IAAZlb,EAAEmb,OACFxd,KAAKuY,eAKDvY,KAAKwc,cAAcna,EAAEsJ,SACvB3L,KAAKsO,UAAU,IAAOtO,KAAKqV,cAAgBrV,KAAKqV,cAIpDlB,OAAWjT,QAAQiB,QAAQmb,UAAUnc,KAAKnB,KAAMqC,IAElD6V,WACE,GAAKlY,KAAKqV,aAKH,CACL,GAAIrV,KAAKsV,SAAWtV,KAAK8V,cAAc7W,OAAQ,OAE/C,MAAMwe,EACJzd,KAAK0Y,aAAatO,cACjBpK,KAAK0Y,aAAa7P,UACnB7I,KAAK0Y,aAAa1P,cAChB,IAEAyU,IACFzd,KAAKsV,UAAY,SAdnB1L,sBAAsB,KACpB,MAAMrD,EAAUvG,KAAK0Y,aACjBnS,IAASA,EAAQsC,UAAY,MAgBvCwU,YAAahb,GACXA,EAAEmB,kBAEJ4Z,UAAW/a,GACT,MAAM4V,EAAOjY,KAAK8I,MAAMmP,KAExB,IAAKA,EAAM,OAEX,MAAMhS,EAAagS,EAAKhS,YAKrBjG,KAAK+U,UACN9O,GACAjG,KAAKqV,cAELhT,EAAEmB,iBACFnB,EAAEkB,kBAEF0C,EAAW7D,SAKXpC,KAAKmW,KAAK9T,IAGd8a,SAAU9a,GACR,MAAM4V,EAAOjY,KAAK8I,MAAMmP,KAExB,IAAKA,EAAM,OAOX,GALA5V,EAAEmB,iBAKExD,KAAK+U,SAAU,OAAO/U,KAAKsY,eAE/B,MAAMxN,EAAUzI,EAAEyI,QAIlBmN,EAAKyF,UAAW,EAEhB9O,OAAOhF,sBAAsB,KAG3B,GAFAqO,EAAKpN,YAEAoN,EAAKnQ,kBAAmB,OAAO9H,KAAKsY,eAEzC,OAAQxN,GACN,KAAKC,OAASI,GACZ8M,EAAK7M,WACL,MACF,KAAKL,OAASE,KACZgN,EAAK/M,WACL,MACF,KAAKH,OAASQ,KACZ0M,EAAKzM,YACL,MACF,KAAKT,OAASM,IACZ4M,EAAK3M,WACL,MAEJtL,KAAKgX,WAAWhX,KAAK0V,SAAS1V,KAAKqc,oBAGvCrF,WAAY7F,GACV,GAAKnR,KAAK+U,SAGH,CACL,MAAM+C,GAAiB9X,KAAK8X,eAAiB,IAAIlF,QAC3CuG,EAAInZ,KAAKiZ,kBAAkB9H,GASjC,IAPO,IAAPgI,EAAWrB,EAAc6F,OAAOxE,EAAG,GAAKrB,EAAcpV,KAAKyO,GAC3DnR,KAAKyY,SAASX,EAAc5G,IAAKiI,GACxBnZ,KAAKiV,aAAekE,EAAInZ,KAAKoR,SAAS+H,KAK3CnZ,KAAKuQ,aACPvQ,KAAKqY,cAAc,OACd,CACL,MAAM1F,EAAQ3S,KAAK8V,cAAcrL,QAAQ0G,IACpCwB,IACH3S,KAAKsO,UAAU,IAAMtO,KAAK8I,MAAMmP,KAAKpN,YACrCuD,WAAW,IAAMpO,KAAKqY,aAAa1F,WAnBvC3S,KAAKyY,SAASzY,KAAKiV,aAAe9D,EAAOnR,KAAKoR,SAASD,IACvDnR,KAAKqV,cAAe,GAuBxBgD,aAAc1F,GACZ3S,KAAK8I,MAAMmP,OAAUjY,KAAK8I,MAAMmP,KAAgCpS,UAAY8M,IAE9EqF,mBACE,MAAMhH,EAAgB,GAChBgI,EAAUhZ,KAAK+U,UAAaxK,MAAMkN,QAAQzX,KAAK8X,eAEjD9X,KAAK8X,cADL,CAAC9X,KAAK8X,eAGV,IAAK,MAAMhX,KAASkY,EAAQ,CAC1B,MAAMrG,EAAQ3S,KAAK0V,SAASwD,UAAU0E,GAAK5d,KAAKoZ,gBAC9CpZ,KAAKoR,SAASwM,GACd5d,KAAKoR,SAAStQ,KAGZ6R,GAAS,GACX3B,EAActO,KAAK1C,KAAK0V,SAAS/C,IAIrC3S,KAAKgR,cAAgBA,GAEvByH,SAAU3X,GACHd,KAAKoZ,gBAAgBtY,EAAOd,KAAK8X,iBACpC9X,KAAK8X,cAAgBhX,EACrBd,KAAKsC,MAAM,SAAUxB,KAGzB0b,cAAe7Q,GAGb,MAAMkS,EAAc7d,KAAK8I,MAAM,gBAE/B,OAAO+U,IAAgBA,IAAgBlS,GAAUkS,EAAYhS,SAASF,Q,UCl3B5E,MAAMsI,EAAmB,IACpB6J,EACH1Y,SAAS,EACT2Y,gBAAgB,EAChBxY,YAAY,GAICyY,QAAQ5f,OAAO,CAC5BC,KAAM,iBAENoB,MAAO,CACLwe,gBAAiB,CACfte,KAAMC,QACNC,SAAS,GAEXhB,OAAQ,CACNc,KAAM+Q,SACN7Q,QAASA,CAACsR,EAAW+M,EAAmBvN,IAC/BA,EAAS+B,oBAAoBjI,QAAQyT,EAAUxL,sBAAwB,GAGlFyL,WAAYve,QACZkV,UAAW,CACTnV,KAAMqe,EAAQ9c,QAAQzB,MAAMqV,UAAUnV,KACtCE,QAASA,IAAMoU,GAEjBnD,SAAUlR,QACVmR,YAAa,CACXpR,KAAMI,SAIVtB,OACE,MAAO,CACL2f,WAAYpe,KAAK+Q,cAIrB/P,SAAU,CACRC,UACE,MAAO,IACF+c,EAAQ9c,QAAQF,SAASC,QAAQE,KAAKnB,MACzC,kBAAkB,EAClB,qCAAsCA,KAAK+F,eAAiB,IAGhE+P,gBACE,OAAO9V,KAAKqe,eAEdC,iBACE,OAAOte,KAAKgR,cAAcE,IAAIC,GAAQnR,KAAKoR,SAASD,KAEtDoN,oBACE,OAAOve,KAAKuQ,aACRvQ,KAAKqe,cAAcG,KAAKrN,IAASnR,KAAK8S,QAAQ3B,IAC9CnR,KAAKqe,cAAcpf,OAAS,GAElCwf,eACE,OAAyB,MAArBze,KAAK0e,aAA6B,EAE/B3e,OAAOC,KAAKuT,QAAQvT,KAAK0e,eAAezf,QAEjDof,gBACE,OAAKre,KAAK2e,aAAe3e,KAAK8Q,UAAmC,MAAvB9Q,KAAK4e,eAA+B5e,KAAK0V,SAE5E1V,KAAK0V,SAAS7W,OAAOsS,IAC1B,MAAMrQ,EAAQ6S,eAAoBxC,EAAMnR,KAAK2Q,UACvC3R,EAAgB,MAAT8B,EAAgBf,OAAOe,GAAS,GAE7C,OAAOd,KAAKnB,OAAOsS,EAAMpR,OAAOC,KAAK4e,gBAAiB5f,MAG1D4f,eAAgB,CACdC,MACE,OAAO7e,KAAKoe,YAEdtF,IAAKvQ,GAGCvI,KAAKoe,aAAe7V,IACtBvI,KAAKoe,WAAa7V,EAClBvI,KAAKsC,MAAM,sBAAuBiG,MAIxCuW,oBACE,OAAO,GAETvI,UACE,OAAOvW,KAAK+e,eAAiB/e,KAAKgR,cAAc/R,OAAS,GAE3D0f,cACE,OACE3e,KAAK+U,UACL/U,KAAK+e,eAEL/e,KAAK+e,eACL/e,KAAK4e,iBAAmB5e,KAAKuT,QAAQvT,KAAK0e,eAG9CpH,cACE,QAAKtX,KAAKkW,YAEHlW,KAAKue,oBAAsBve,KAAKme,aAEzC9G,cACE,MAAM5X,EAAQue,EAAQ9c,QAAQF,SAASqW,YAAYlW,KAAKnB,MAExD,OADCP,EAAcyN,cAAe,4BAA4BzN,EAAcyN,cAAgB,KAAKC,OACtF,IACF8G,KACAxU,IAGPsf,gBACE,OAA8B,MAAvB/e,KAAK4e,gBACc,KAAxB5e,KAAK4e,gBAETF,eACE,OAAI1e,KAAK+U,SAAiB,KAEnB/U,KAAKgR,cAAcjJ,KAAKoR,GACtBnZ,KAAKoZ,gBAAgBpZ,KAAKoR,SAAS+H,GAAInZ,KAAKoR,SAASpR,KAAK8X,kBAGrEtB,WACE,MAAM/X,EAAOuf,EAAQ9c,QAAQF,SAASwV,SAASrV,KAAKnB,MAapD,OAXAvB,EAAKgB,MAAQ,IACRhB,EAAKgB,MACR+Q,MAAOxQ,KAAK8W,iBACZhG,SACE9Q,KAAK8Q,WACJ9Q,KAAK2e,cACL3e,KAAKqe,cAAcpf,OAEtB8R,YAAa/Q,KAAK4e,gBAGbngB,IAIX6J,MAAO,CACL+V,cAAe,yBACfvG,cAAe,YACf5B,UAAW3N,GACLA,GACFyW,SAASC,iBAAiB,OAAQjf,KAAKkf,QACvClf,KAAK8I,MAAMkH,OAAShQ,KAAK8I,MAAMkH,MAAM+G,WAErCiI,SAASG,oBAAoB,OAAQnf,KAAKkf,QAC1Clf,KAAKmW,OACLnW,KAAKof,eAGT/J,aAAc9M,IACRA,GAAQvI,KAAKqW,UAEjBrW,KAAKoe,WAAa,OAEpB5N,MAAOjI,EAAK8W,GAONA,GAAUA,EAAOpgB,SACnBe,KAAKme,aACLne,KAAKkW,WACJlW,KAAKqV,eACN9M,EAAItJ,QACJe,KAAKsY,gBAETvH,YAAaxI,GACXvI,KAAKoe,WAAa7V,GAEpBqW,eAAgB,0BAChBjO,SAAU,cAGZhP,UACE3B,KAAKsf,aAGPC,YACEP,SAASG,oBAAoB,OAAQnf,KAAKkf,SAG5C/c,QAAS,CACPqd,uBAAwBjX,EAAc8W,GAGpC,GAAI9W,IAAQ8W,EAAZ,CAEA,IAAKrf,KAAKie,gBAAiB,CACzB,MAAMwB,EAAkBJ,EAAOrf,KAAK8I,MAAMmP,KAAKpS,WAE3C4Z,EACFzf,KAAKqY,aAAa9P,EAAI2Q,UAAUC,GAAKA,IAAMsG,IAE3Czf,KAAKqY,cAAc,GAErBrY,KAAKsC,MAAM,oBAAqBtC,KAAK8I,MAAMmP,KAAKpS,WAGlD7F,KAAKsO,UAAU,KAEVtO,KAAK4e,iBACU,IAAfrW,EAAItJ,QACFe,KAAKie,mBAGVje,KAAK8I,MAAMmP,KAAKpN,WAEZ7K,KAAKie,iBAAmB1V,EAAItJ,SAC9Be,KAAKqY,aAAa,GAClBrY,KAAKsC,MAAM,oBAAqBtC,KAAK8I,MAAMmP,KAAKpS,iBAItD6Z,0BACE1f,KAAK2f,wBAEPA,uBAEE3f,KAAKqV,cAAgBrV,KAAK8I,MAAMmP,MAAQjY,KAAK8I,MAAMmP,KAAKtO,oBAE1DiW,oBAAqB9U,GAGf9K,KAAK+e,gBAEL/e,KAAK+U,UAAYjK,IAAYC,OAASlI,MACZ,IAAxB7C,KAAK+F,cACP/F,KAAK+F,cAAgB/F,KAAKgR,cAAc/R,OAAS,EAEjDe,KAAK+F,gBAEE/F,KAAK+U,UAAYjK,IAAYC,OAAS/H,MAC3ChD,KAAK+F,eAAiB/F,KAAKgR,cAAc/R,OAAS,EACpDe,KAAK+F,eAAiB,EAEtB/F,KAAK+F,gBAEE+E,IAAYC,OAAS8U,WAAa/U,IAAYC,OAAS+U,QAChE9f,KAAK+f,sBAGTA,oBACE,MAAMC,EAAWhgB,KAAK+F,cAChBka,EAAUjgB,KAAKgR,cAAcgP,GAGnC,IACGhgB,KAAKuY,eACNvY,KAAK+S,YAAYkN,GACjB,OAEF,MAAMC,EAAYlgB,KAAKgR,cAAc/R,OAAS,EAI9C,IAC0B,IAAxBe,KAAK+F,eACS,IAAdma,EAIA,YAFAlgB,KAAK+F,cAAgBma,GAKvB,MAAMjhB,EAASe,KAAKgR,cAAc/R,OAC5BkhB,EAAYH,IAAa/gB,EAAS,EACpC+gB,EACAA,EAAW,EACTI,EAAWpgB,KAAKgR,cAAcmP,GAE/BC,EAGHpgB,KAAKgX,WAAWiJ,GAFhBjgB,KAAKyY,SAASzY,KAAK+U,SAAW,GAAK,MAKrC/U,KAAK+F,cAAgBoa,GAEvB3H,oBACExY,KAAK4e,eAAiB,KAEtBZ,EAAQ9c,QAAQiB,QAAQqW,kBAAkBrX,KAAKnB,OAEjDma,WACE,MAAMnK,EAAQmE,OAAWjT,QAAQiB,QAAQgY,SAAShZ,KAAKnB,MAUvD,OARAgQ,EAAMvR,KAAOsR,eAAUC,EAAMvR,KAAO,CAClCyE,MAAO,CACL,wBAAyBmY,eAAqBrb,KAAK8I,MAAMmP,KAAM,iBAC/DqD,aAAcD,eAAqBrL,EAAMvR,KAAO,qBAAsB,QAExEyc,SAAU,CAAEpa,MAAOd,KAAK4e,kBAGnB5O,GAET6L,eACE,MAAMrI,EAAOwK,EAAQ9c,QAAQiB,QAAQ0Z,aAAa1a,KAAKnB,MAIvD,OAFAwT,EAAK/U,KAAMyE,MAAO0J,KAAO,WAElB4G,GAET0G,gBACE,OAAOla,KAAKqW,SAAWrW,KAAK+U,SACxBiJ,EAAQ9c,QAAQiB,QAAQ+X,cAAc/Y,KAAKnB,MAC3C,IAENuc,QAASla,GACFrC,KAAKuY,gBAEVvY,KAAK+F,eAAiB,EACjB/F,KAAK+F,eAAiB,EACvB/F,KAAKqgB,UAEJrgB,KAAKwc,cAAcna,EAAEsJ,SAAS3L,KAAKsY,iBAE1CgI,QAASje,GACP,GACErC,KAAK+F,eAAiB,IACrB1D,EAAEsJ,OACH,OAEF,MAAMA,EAAStJ,EAAEsJ,OACX7K,EAAQ6K,EAAO7K,MAGjB6K,EAAO7K,OAAOd,KAAKsY,eAElBtY,KAAK+U,UAAsB,KAAVjU,GAAcd,KAAK+f,oBAEzC/f,KAAK4e,eAAiB9d,EACtBd,KAAKugB,SAAW5U,EAAO6U,UAAY7U,EAAO6U,SAASD,UAErDlU,UAAWhK,GACT,MAAMyI,EAAUzI,EAAEyI,SAGhBzI,EAAEqa,SACD,CAAC3R,OAASQ,KAAMR,OAASM,KAAKmD,SAAS1D,IAExCkT,EAAQ9c,QAAQiB,QAAQkK,UAAUlL,KAAKnB,KAAMqC,GAO/CrC,KAAK4f,oBAAoB9U,IAE3BuS,YAAahb,KACb+a,UAAW/a,GACT2b,EAAQ9c,QAAQiB,QAAQib,UAAUjc,KAAKnB,KAAMqC,GAC7CrC,KAAKof,cAEPjC,SAAU9a,GAERA,EAAEmB,iBAKFxD,KAAKsY,gBAEPtB,WAAY7F,GACV6M,EAAQ9c,QAAQiB,QAAQ6U,WAAW7V,KAAKnB,KAAMmR,GAC9CnR,KAAKsf,aAEPtH,mBACEgG,EAAQ9c,QAAQiB,QAAQ6V,iBAAiB7W,KAAKnB,MAIzCA,KAAKkW,WAAWlW,KAAKsf,aAE5BA,YAGEtf,KAAKsO,UAAU,KAEVtO,KAAK+U,UACL/U,KAAK4e,gBACL5e,KAAKqV,eAENrV,KAAK4e,gBACF5e,KAAKgR,cAAc/R,QACpBe,KAAK+U,UACL/U,KAAKqW,QAEH,KACArW,KAAKuT,QAAQvT,KAAK0e,kBAI5BU,cAEKpf,KAAK+e,eACL/e,KAAK8X,iBAIL9X,KAAK+U,UACL/U,KAAKoZ,gBACJpZ,KAAK4e,eACL5e,KAAKoR,SAASpR,KAAK8X,iBAGrB9X,KAAKsf,cAGTxM,QAAS3B,GACP,OAAOnR,KAAKse,eAAe7T,QAAQzK,KAAKoR,SAASD,KAAU,GAE7D+N,OAAQuB,G,QACN,IAA4B,IAAxBzgB,KAAK+F,cAAsB,OAE/B,MAAM2a,EAAc1gB,KAAKgR,cAAchR,KAAK+F,eACtC4a,EAAkB3gB,KAAKuT,QAAQmN,GAClB,QAAnB1S,EAAAyS,EAAMG,qBAAa,IAAA5S,KAAE6S,QAAQ,aAAcF,GACxB,QAAnBG,EAAAL,EAAMG,qBAAa,IAAAE,KAAED,QAAQ,2CAA4CF,GACzEF,EAAMjd,qBClbGud,SAAc3iB,OAAO,CAClCC,KAAM,aAENoB,MAAO,CACLuhB,WAAY,CACVrhB,KAAM4K,MACN1K,QAASA,IAAO,IAElBoV,aAAc,CACZtV,KAAMC,QACNC,SAAS,IAIbpB,KAAMA,KAAA,CACJwiB,cAAe,IAGjBjgB,SAAU,CACRgV,uBACE,OAAOhW,KAAK+U,SACR/U,KAAKgR,cAAc/R,QAClBe,KAAK4e,gBAAkB,IAAInM,WAAWxT,QAE7CoX,UACE,OAAO2H,EAAQ9c,QAAQF,SAASqV,QAAQlV,KAAKnB,OAASA,KAAK+U,UAE7D+J,oBACE,OAAO,GAETxH,cACE,QAAKtX,KAAKkW,YAEHlW,KAAKue,qBACPve,KAAK8T,OAAO,aAAe9T,KAAKme,aAEvCY,gBACE,OAA8B,MAAvB/e,KAAK4e,iBAIhBzc,QAAS,CACPud,wBAAyBnX,GACvB,GACEA,GACAvI,KAAK+U,UACL/U,KAAKghB,WAAW/hB,OAChB,CACA,MAAMiiB,EAAYlhB,KAAKghB,WAAWjZ,KAAKoZ,GAAK5Y,EAAI6Y,SAASD,IACxC,MAAbD,IACFlhB,KAAK4e,eAAiBrW,EAAIqK,MAAM,EAAGrK,EAAItJ,OAASiiB,EAAUjiB,QAC1De,KAAKqhB,cAITrhB,KAAK2f,wBAEPxF,WACE,MAAMnK,EAAQ+Q,EAAc7f,QAAQiB,QAAQgY,SAAShZ,KAAKnB,MAK1D,cAHOgQ,EAAMvR,KAAMyE,MAAO7E,KAC1B2R,EAAMvR,KAAM6E,GAAIge,MAAQthB,KAAKuhB,QAEtBvR,GAETqJ,iBAAkBlI,EAAcwB,GAC9B,MAAM6O,EAAOxD,EAAQ9c,QAAQiB,QAAQkX,iBAAiBlY,KAAKnB,KAAMmR,EAAMwB,GAcvE,OAXI3S,KAAK+U,WACPyM,EAAK/N,iBAAkBtH,UAAa,IAC/BqV,EAAK/N,iBAAkBtH,UAC1BsV,SAAUA,KACRzhB,KAAKihB,aAAetO,EACpB3S,KAAK4e,eAAiB5e,KAAKuT,QAAQpC,GACnCnR,KAAK+F,eAAiB,KAKrByb,GAET/H,YAAatI,GACX6M,EAAQ9c,QAAQiB,QAAQsX,YAAYtY,KAAKnB,KAAMmR,GAE/CnR,KAAKihB,cAAgB,GAIvBS,YAAarf,GACXA,EAAEmB,iBAEExD,KAAKqc,gBAAkB,GAE3Brc,KAAKsO,UAAUtO,KAAKof,aAEtB/S,UAAWhK,GACT,MAAMyI,EAAUzI,EAAEyI,SAGhBzI,EAAEqa,SACD,CAAC3R,OAASQ,KAAMR,OAASM,KAAKmD,SAAS1D,IAExCkT,EAAQ9c,QAAQiB,QAAQkK,UAAUlL,KAAKnB,KAAMqC,GAK3CrC,KAAK+U,UACPjK,IAAYC,OAASlI,MACe,IAApC7C,KAAK8I,MAAMkH,MAAM2R,eAEjB3hB,KAAKof,aACItU,IAAYC,OAASU,OAC9BzL,KAAK0hB,YAAYrf,GAOnBrC,KAAK4f,oBAAoB9U,IAE3BsS,UAAW/a,GAIT,GAAIrC,KAAK+U,UACP/U,KAAK4e,iBACoB,IAAzB5e,KAAKqc,eAKL,OAHAha,EAAEmB,iBACFnB,EAAEkB,kBAEKvD,KAAKqhB,aAGdN,EAAc7f,QAAQiB,QAAQib,UAAUjc,KAAKnB,KAAMqC,IAErD2U,WAAY7F,GAENnR,KAAKihB,cAAgB,EACvBjhB,KAAK4hB,iBAELb,EAAc7f,QAAQiB,QAAQ6U,WAAW7V,KAAKnB,KAAMmR,GAKlDnR,KAAK4e,gBACL5e,KAAK+U,UACL/U,KAAKuT,QAAQpC,GAAMuB,oBAAoBlE,SAASxO,KAAK4e,eAAelM,uBAEpE1S,KAAK4e,eAAiB,QAI5B5G,mBAC4B,MAAtBhY,KAAK8X,eACgB,KAAvB9X,KAAK8X,cAEL9X,KAAKgR,cAAgB,GAErBhR,KAAKgR,cAAgBhR,KAAK+U,SAAW/U,KAAK8X,cAAgB,CAAC9X,KAAK8X,gBAGpEW,SAAU3X,GACRkd,EAAQ9c,QAAQiB,QAAQsW,SAAStX,KAAKnB,UAAgB4D,IAAV9C,EAAsBd,KAAK4e,eAAiB9d,IAE1F8gB,gBACE,MAAM9gB,EAAQd,KAAK8X,cAAclF,QAC3BD,EAAQ3S,KAAKgR,cAAckI,UAAU/H,GACzCnR,KAAKuT,QAAQpC,KAAUnR,KAAK4e,gBAI9B,GAAIjM,GAAS,EAAG,CACd,MAAMxB,EAA+B,kBAAjBrQ,EAAM6R,GACtBlN,OAAOoc,OAAO,GAAI/gB,EAAM6R,IACxB7R,EAAM6R,GAEV7R,EAAM6c,OAAOhL,EAAO,GACpB7R,EAAM4B,KAAKyO,QAEXrQ,EAAMd,KAAKihB,cAAgBjhB,KAAK4e,eAGlC5e,KAAKyY,SAAS3X,GACdd,KAAKihB,cAAgB,EACrBjhB,KAAK4e,eAAiB,MAExBkD,iBAEE,IAAK9hB,KAAK+e,cAAe,OAIrB/e,KAAK4e,iBAAmB5e,KAAKuT,QAAQvT,KAAK8X,gBAAgB9X,KAAKyY,WAGnE,MAAMsJ,EAAcniB,QAAQI,KAAKiT,aAAaqD,YAActW,KAAK6V,SAC7DkM,IAAa/hB,KAAK4e,eAAiB,OAEzCQ,aACEpf,KAAK+U,SAAW/U,KAAKqhB,aAAerhB,KAAK8hB,kBAE3CT,aACE,MAAMW,EAAYhiB,KAAKqc,eAMvB,GAAK2F,EAAY,IAAMhiB,KAAK+e,gBACvB/e,KAAK4e,eAAgB,OAE1B,GAAI5e,KAAKihB,cAAgB,EACvB,OAAOjhB,KAAK4hB,gBAGd,MAAMjP,EAAQ3S,KAAKgR,cAAckI,UAAU/H,GACzCnR,KAAK4e,iBAAmB5e,KAAKuT,QAAQpC,IAIjC8Q,EAAetP,GAAS,GAA0C,kBAA9B3S,KAAKgR,cAAc2B,GACzDlN,OAAOoc,OAAO,GAAI7hB,KAAKgR,cAAc2B,IACrC3S,KAAK4e,eAKT,GAAIjM,GAAS,EAAG,CACd,MAAMmF,EAAgB9X,KAAK8X,cAAclF,QACzCkF,EAAc6F,OAAOhL,EAAO,GAE5B3S,KAAKyY,SAASX,GAMhB,GAAIkK,GAAa,EAAG,OAAQhiB,KAAK4e,eAAiB,KAElD5e,KAAKgX,WAAWiL,GAEhBjiB,KAAK4e,eAAiB,MAExB2C,QAASd,G,MAEP,GADAzgB,KAAKsC,MAAM,QAASme,IACfzgB,KAAK+U,UAAY/U,KAAK+e,cAAe,OAE1C,MAAMmD,EAAoC,QAAnBlU,EAAAyS,EAAMG,qBAAa,IAAA5S,OAAA,EAAAA,EAAEmU,QAAQ,4CAChDD,IAAqE,IAAnDliB,KAAKiZ,kBAAkBiJ,KAC3CzB,EAAMjd,iBACNwa,EAAQ9c,QAAQiB,QAAQ6U,WAAW7V,KAAKnB,KAAMkiB,KAGlD1J,oBACExY,KAAKihB,cAAgB,EAErBF,EAAc7f,QAAQiB,QAAQqW,kBAAkBrX,KAAKnB,W,iDCnR3D;;;;;;;;IAQE,WAGA,IAAI4D,EAGAwe,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,IAAYjZ,KAAK,KAAO,IAAMyZ,GAAWD,GAAW,KAClHG,GAAa,mDACbC,GAAa,mDACbC,GAAQJ,GAAWD,GAAWE,GAC9BI,GAAU,MAAQ,CAACpB,GAAWM,GAAYC,IAAYjZ,KAAK,KAAO,IAAM6Z,GACxEE,GAAW,MAAQ,CAAChB,GAAcP,GAAU,IAAKA,GAASQ,GAAYC,GAAYX,IAAUtY,KAAK,KAAO,IAGxGga,GAAStE,OAAO2C,GAAQ,KAMxB4B,GAAcvE,OAAO8C,GAAS,KAG9B0B,GAAYxE,OAAOmD,GAAS,MAAQA,GAAS,KAAOkB,GAAWF,GAAO,KAGtEM,GAAgBzE,OAAO,CACzBwD,GAAU,IAAMP,GAAU,IAAMW,GAAkB,MAAQ,CAACf,GAASW,GAAS,KAAKlZ,KAAK,KAAO,IAC9FqZ,GAAc,IAAME,GAAkB,MAAQ,CAAChB,GAASW,GAAUE,GAAa,KAAKpZ,KAAK,KAAO,IAChGkZ,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAChBK,GACAD,GACAlB,GACAqB,IACA9Z,KAAK,KAAM,KAGToa,GAAe1E,OAAO,IAAMyD,GAAQ5B,GAAiBI,GAAeQ,GAAa,KAGjFkC,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,GAAe7F,IAAc6F,GAAe5F,IAC5C4F,GAAe3F,IAAW2F,GAAe1F,IACzC0F,GAAezF,IAAYyF,GAAexF,IAC1CwF,GAAevF,IAAmBuF,GAAetF,IACjDsF,GAAerF,KAAa,EAC5BqF,GAAerH,GAAWqH,GAAepH,GACzCoH,GAAe/F,IAAkB+F,GAAelH,GAChDkH,GAAe9F,IAAe8F,GAAejH,GAC7CiH,GAAe/G,GAAY+G,GAAe9G,GAC1C8G,GAAe5G,GAAU4G,GAAe3G,IACxC2G,GAAezG,IAAayG,GAAetG,IAC3CsG,GAAerG,IAAUqG,GAAepG,IACxCoG,GAAejG,KAAc,EAG7B,IAAIkG,GAAgB,GACpBA,GAActH,GAAWsH,GAAcrH,GACvCqH,GAAchG,IAAkBgG,GAAc/F,IAC9C+F,GAAcnH,GAAWmH,GAAclH,GACvCkH,GAAc9F,IAAc8F,GAAc7F,IAC1C6F,GAAc5F,IAAW4F,GAAc3F,IACvC2F,GAAc1F,IAAY0F,GAAc7G,GACxC6G,GAAc5G,IAAa4G,GAAc1G,IACzC0G,GAAcvG,IAAauG,GAActG,IACzCsG,GAAcrG,IAAaqG,GAAcpG,IACzCoG,GAAczF,IAAYyF,GAAcxF,IACxCwF,GAAcvF,IAAauF,GAActF,KAAa,EACtDsF,GAAchH,GAAYgH,GAAc/G,GACxC+G,GAAclG,KAAc,EAG5B,IAAImG,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,GAAiB5lB,WACjB6lB,GAAe7kB,SAGf8kB,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAO/mB,SAAWA,QAAU+mB,EAGhFC,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKjnB,SAAWA,QAAUinB,KAGxExd,GAAOqd,IAAcE,IAAY/b,SAAS,cAATA,GAGjCic,GAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,GAAaH,IAAgC,iBAAVI,GAAsBA,IAAWA,EAAOF,UAAYE,EAGvFC,GAAgBF,IAAcA,GAAWF,UAAYD,GAGrDM,GAAcD,IAAiBT,GAAWW,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQN,IAAcA,GAAWO,SAAWP,GAAWO,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAOjrB,KAXI,GAeXkrB,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,EAAKrvB,QACX,KAAK,EAAG,OAAOmvB,EAAKjtB,KAAKktB,GACzB,KAAK,EAAG,OAAOD,EAAKjtB,KAAKktB,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKjtB,KAAKktB,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKjtB,KAAKktB,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASC,GAAgBC,EAAOC,EAAQC,EAAUC,GAChD,IAAIhc,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GAClB8b,EAAOE,EAAa7tB,EAAO4tB,EAAS5tB,GAAQ0tB,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GACxB,IAAI/b,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,QAAS0T,EAAQ1T,EACf,IAA6C,IAAzCyvB,EAASF,EAAM7b,GAAQA,EAAO6b,GAChC,MAGJ,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAC7B,IAAIzvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,MAAOA,IACL,IAA+C,IAA3CyvB,EAASF,EAAMvvB,GAASA,EAAQuvB,GAClC,MAGJ,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GACzB,IAAIpc,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,QAAS0T,EAAQ1T,EACf,IAAK8vB,EAAUP,EAAM7b,GAAQA,EAAO6b,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAC1B,IAAIpc,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACnCgwB,EAAW,EACXC,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACdoc,EAAUjuB,EAAO6R,EAAO6b,KAC1BU,EAAOD,KAAcnuB,GAGzB,OAAOouB,EAYT,SAASC,GAAcX,EAAO1tB,GAC5B,IAAI7B,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,QAASA,GAAUmwB,GAAYZ,EAAO1tB,EAAO,IAAM,EAYrD,SAASuuB,GAAkBb,EAAO1tB,EAAOwuB,GACvC,IAAI3c,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,QAAS0T,EAAQ1T,EACf,GAAIqwB,EAAWxuB,EAAO0tB,EAAM7b,IAC1B,OAAO,EAGX,OAAO,EAYT,SAAS4c,GAASf,EAAOE,GACvB,IAAI/b,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACnCiwB,EAAS3kB,MAAMtL,GAEnB,QAAS0T,EAAQ1T,EACfiwB,EAAOvc,GAAS+b,EAASF,EAAM7b,GAAQA,EAAO6b,GAEhD,OAAOU,EAWT,SAASM,GAAUhB,EAAOxV,GACxB,IAAIrG,GAAS,EACT1T,EAAS+Z,EAAO/Z,OAChBwwB,EAASjB,EAAMvvB,OAEnB,QAAS0T,EAAQ1T,EACfuvB,EAAMiB,EAAS9c,GAASqG,EAAOrG,GAEjC,OAAO6b,EAeT,SAASkB,GAAYlB,EAAOE,EAAUC,EAAagB,GACjD,IAAIhd,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEnC0wB,GAAa1wB,IACf0vB,EAAcH,IAAQ7b,IAExB,QAASA,EAAQ1T,EACf0vB,EAAcD,EAASC,EAAaH,EAAM7b,GAAQA,EAAO6b,GAE3D,OAAOG,EAeT,SAASiB,GAAiBpB,EAAOE,EAAUC,EAAagB,GACtD,IAAI1wB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACnC0wB,GAAa1wB,IACf0vB,EAAcH,IAAQvvB,IAExB,MAAOA,IACL0vB,EAAcD,EAASC,EAAaH,EAAMvvB,GAASA,EAAQuvB,GAE7D,OAAOG,EAaT,SAASkB,GAAUrB,EAAOO,GACxB,IAAIpc,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OAEvC,QAAS0T,EAAQ1T,EACf,GAAI8vB,EAAUP,EAAM7b,GAAQA,EAAO6b,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIsB,GAAYC,GAAa,UAS7B,SAASC,GAAaC,GACpB,OAAOA,EAAOzY,MAAM,IAUtB,SAAS0Y,GAAWD,GAClB,OAAOA,EAAOE,MAAMlI,KAAgB,GActC,SAASmI,GAAYC,EAAYtB,EAAWuB,GAC1C,IAAIpB,EAOJ,OANAoB,EAASD,GAAY,SAASvvB,EAAO4Y,EAAK2W,GACxC,GAAItB,EAAUjuB,EAAO4Y,EAAK2W,GAExB,OADAnB,EAASxV,GACF,KAGJwV,EAcT,SAASqB,GAAc/B,EAAOO,EAAWyB,EAAWC,GAClD,IAAIxxB,EAASuvB,EAAMvvB,OACf0T,EAAQ6d,GAAaC,EAAY,GAAK,GAE1C,MAAQA,EAAY9d,MAAYA,EAAQ1T,EACtC,GAAI8vB,EAAUP,EAAM7b,GAAQA,EAAO6b,GACjC,OAAO7b,EAGX,OAAQ,EAYV,SAASyc,GAAYZ,EAAO1tB,EAAO0vB,GACjC,OAAO1vB,IAAUA,EACb4vB,GAAclC,EAAO1tB,EAAO0vB,GAC5BD,GAAc/B,EAAOmC,GAAWH,GAatC,SAASI,GAAgBpC,EAAO1tB,EAAO0vB,EAAWlB,GAChD,IAAI3c,EAAQ6d,EAAY,EACpBvxB,EAASuvB,EAAMvvB,OAEnB,QAAS0T,EAAQ1T,EACf,GAAIqwB,EAAWd,EAAM7b,GAAQ7R,GAC3B,OAAO6R,EAGX,OAAQ,EAUV,SAASge,GAAU7vB,GACjB,OAAOA,IAAUA,EAYnB,SAAS+vB,GAASrC,EAAOE,GACvB,IAAIzvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAAU6xB,GAAQtC,EAAOE,GAAYzvB,EAAUolB,EAUxD,SAAS0L,GAAarW,GACpB,OAAO,SAASqX,GACd,OAAiB,MAAVA,EAAiBntB,EAAYmtB,EAAOrX,IAW/C,SAASsX,GAAeD,GACtB,OAAO,SAASrX,GACd,OAAiB,MAAVqX,EAAiBntB,EAAYmtB,EAAOrX,IAiB/C,SAASuX,GAAWZ,EAAY3B,EAAUC,EAAagB,EAAWW,GAMhE,OALAA,EAASD,GAAY,SAASvvB,EAAO6R,EAAO0d,GAC1C1B,EAAcgB,GACTA,GAAY,EAAO7uB,GACpB4tB,EAASC,EAAa7tB,EAAO6R,EAAO0d,MAEnC1B,EAaT,SAASuC,GAAW1C,EAAO2C,GACzB,IAAIlyB,EAASuvB,EAAMvvB,OAEnBuvB,EAAM4C,KAAKD,GACX,MAAOlyB,IACLuvB,EAAMvvB,GAAUuvB,EAAMvvB,GAAQ6B,MAEhC,OAAO0tB,EAYT,SAASsC,GAAQtC,EAAOE,GACtB,IAAIQ,EACAvc,GAAS,EACT1T,EAASuvB,EAAMvvB,OAEnB,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIoyB,EAAU3C,EAASF,EAAM7b,IACzB0e,IAAYztB,IACdsrB,EAASA,IAAWtrB,EAAYytB,EAAWnC,EAASmC,GAGxD,OAAOnC,EAYT,SAASoC,GAAUC,EAAG7C,GACpB,IAAI/b,GAAS,EACTuc,EAAS3kB,MAAMgnB,GAEnB,QAAS5e,EAAQ4e,EACfrC,EAAOvc,GAAS+b,EAAS/b,GAE3B,OAAOuc,EAYT,SAASsC,GAAYT,EAAQtxB,GAC3B,OAAO8vB,GAAS9vB,GAAO,SAASia,GAC9B,MAAO,CAACA,EAAKqX,EAAOrX,OAWxB,SAAS+X,GAASxB,GAChB,OAAOA,EACHA,EAAOrd,MAAM,EAAG8e,GAAgBzB,GAAU,GAAG0B,QAAQ/J,GAAa,IAClEqI,EAUN,SAAS2B,GAAUxD,GACjB,OAAO,SAASttB,GACd,OAAOstB,EAAKttB,IAchB,SAAS+wB,GAAWd,EAAQtxB,GAC1B,OAAO8vB,GAAS9vB,GAAO,SAASia,GAC9B,OAAOqX,EAAOrX,MAYlB,SAASoY,GAASC,EAAOrY,GACvB,OAAOqY,EAAMhZ,IAAIW,GAYnB,SAASsY,GAAgBC,EAAYC,GACnC,IAAIvf,GAAS,EACT1T,EAASgzB,EAAWhzB,OAExB,QAAS0T,EAAQ1T,GAAUmwB,GAAY8C,EAAYD,EAAWtf,GAAQ,IAAM,GAC5E,OAAOA,EAYT,SAASwf,GAAcF,EAAYC,GACjC,IAAIvf,EAAQsf,EAAWhzB,OAEvB,MAAO0T,KAAWyc,GAAY8C,EAAYD,EAAWtf,GAAQ,IAAM,GACnE,OAAOA,EAWT,SAASyf,GAAa5D,EAAOjT,GAC3B,IAAItc,EAASuvB,EAAMvvB,OACfiwB,EAAS,EAEb,MAAOjwB,IACDuvB,EAAMvvB,KAAYsc,KAClB2T,EAGN,OAAOA,EAWT,IAAImD,GAAerB,GAAe/E,IAS9BqG,GAAiBtB,GAAe9E,IASpC,SAASqG,GAAiBC,GACxB,MAAO,KAAOpG,GAAcoG,GAW9B,SAASphB,GAAS2f,EAAQrX,GACxB,OAAiB,MAAVqX,EAAiBntB,EAAYmtB,EAAOrX,GAU7C,SAAS+Y,GAAWxC,GAClB,OAAOtE,GAAa+G,KAAKzC,GAU3B,SAAS0C,GAAe1C,GACtB,OAAOrE,GAAiB8G,KAAKzC,GAU/B,SAAS2C,GAAgBC,GACvB,IAAIp0B,EACAywB,EAAS,GAEb,QAASzwB,EAAOo0B,EAASpqB,QAAQqqB,KAC/B5D,EAAOxsB,KAAKjE,EAAKqC,OAEnB,OAAOouB,EAUT,SAAS6D,GAAW7hB,GAClB,IAAIyB,GAAS,EACTuc,EAAS3kB,MAAM2G,EAAIjO,MAKvB,OAHAiO,EAAIrP,SAAQ,SAASf,EAAO4Y,GAC1BwV,IAASvc,GAAS,CAAC+G,EAAK5Y,MAEnBouB,EAWT,SAAS8D,GAAQ5E,EAAM6E,GACrB,OAAO,SAASnkB,GACd,OAAOsf,EAAK6E,EAAUnkB,KAa1B,SAASokB,GAAe1E,EAAOjT,GAC7B,IAAI5I,GAAS,EACT1T,EAASuvB,EAAMvvB,OACfgwB,EAAW,EACXC,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd7R,IAAUya,GAAeza,IAAU6hB,IACrC6L,EAAM7b,GAASgQ,EACfuM,EAAOD,KAActc,GAGzB,OAAOuc,EAUT,SAASiE,GAAWra,GAClB,IAAInG,GAAS,EACTuc,EAAS3kB,MAAMuO,EAAI7V,MAKvB,OAHA6V,EAAIjX,SAAQ,SAASf,GACnBouB,IAASvc,GAAS7R,KAEbouB,EAUT,SAASkE,GAAWta,GAClB,IAAInG,GAAS,EACTuc,EAAS3kB,MAAMuO,EAAI7V,MAKvB,OAHA6V,EAAIjX,SAAQ,SAASf,GACnBouB,IAASvc,GAAS,CAAC7R,EAAOA,MAErBouB,EAaT,SAASwB,GAAclC,EAAO1tB,EAAO0vB,GACnC,IAAI7d,EAAQ6d,EAAY,EACpBvxB,EAASuvB,EAAMvvB,OAEnB,QAAS0T,EAAQ1T,EACf,GAAIuvB,EAAM7b,KAAW7R,EACnB,OAAO6R,EAGX,OAAQ,EAaV,SAAS0gB,GAAkB7E,EAAO1tB,EAAO0vB,GACvC,IAAI7d,EAAQ6d,EAAY,EACxB,MAAO7d,IACL,GAAI6b,EAAM7b,KAAW7R,EACnB,OAAO6R,EAGX,OAAOA,EAUT,SAAS2gB,GAAWrD,GAClB,OAAOwC,GAAWxC,GACdsD,GAAYtD,GACZH,GAAUG,GAUhB,SAASuD,GAAcvD,GACrB,OAAOwC,GAAWxC,GACdwD,GAAexD,GACfD,GAAaC,GAWnB,SAASyB,GAAgBzB,GACvB,IAAItd,EAAQsd,EAAOhxB,OAEnB,MAAO0T,KAAWkV,GAAa6K,KAAKzC,EAAOyD,OAAO/gB,KAClD,OAAOA,EAUT,IAAIghB,GAAmB3C,GAAe7E,IAStC,SAASoH,GAAYtD,GACnB,IAAIf,EAASzD,GAAUvL,UAAY,EACnC,MAAOuL,GAAUiH,KAAKzC,KAClBf,EAEJ,OAAOA,EAUT,SAASuE,GAAexD,GACtB,OAAOA,EAAOE,MAAM1E,KAAc,GAUpC,SAASmI,GAAa3D,GACpB,OAAOA,EAAOE,MAAMzE,KAAkB,GAkCxC,IAAImI,GAAe,SAAUA,EAAald,GACxCA,EAAqB,MAAXA,EAAkBzH,GAAO4kB,GAAEC,SAAS7kB,GAAKzJ,SAAUkR,EAASmd,GAAEE,KAAK9kB,GAAM2c,KAGnF,IAAIthB,EAAQoM,EAAQpM,MAChB0pB,EAAOtd,EAAQsd,KACfC,EAAQvd,EAAQud,MAChBxjB,GAAWiG,EAAQjG,SACnBtK,GAAOuQ,EAAQvQ,KACfX,GAASkR,EAAQlR,OACjBwhB,GAAStQ,EAAQsQ,OACjBlnB,GAAS4W,EAAQ5W,OACjBo0B,GAAYxd,EAAQwd,UAGpBC,GAAa7pB,EAAM8pB,UACnBC,GAAY5jB,GAAS2jB,UACrBE,GAAc9uB,GAAO4uB,UAGrBG,GAAa7d,EAAQ,sBAGrB8d,GAAeH,GAAU7hB,SAGzBxQ,GAAiBsyB,GAAYtyB,eAG7ByyB,GAAY,EAGZC,GAAc,WAChB,IAAIC,EAAM,SAASC,KAAKL,IAAcA,GAAWljB,MAAQkjB,GAAWljB,KAAKwjB,UAAY,IACrF,OAAOF,EAAO,iBAAmBA,EAAO,GAFzB,GAUbG,GAAuBR,GAAY9hB,SAGnCuiB,GAAmBP,GAAatzB,KAAKsE,IAGrCwvB,GAAU/lB,GAAK4kB,EAGfoB,GAAajO,GAAO,IACtBwN,GAAatzB,KAAKc,IAAgB0vB,QAAQjK,GAAc,QACvDiK,QAAQ,yDAA0D,SAAW,KAI5EwD,GAASnI,GAAgBrW,EAAQwe,OAASvxB,EAC1CwxB,GAASze,EAAQye,OACjBC,GAAa1e,EAAQ0e,WACrBC,GAAcH,GAASA,GAAOG,YAAc1xB,EAC5C2xB,GAAevC,GAAQvtB,GAAO+vB,eAAgB/vB,IAC9CgwB,GAAehwB,GAAOiwB,OACtBC,GAAuBpB,GAAYoB,qBACnChY,GAASyW,GAAWzW,OACpBiY,GAAmBR,GAASA,GAAOS,mBAAqBjyB,EACxDkyB,GAAcV,GAASA,GAAOvC,SAAWjvB,EACzCmyB,GAAiBX,GAASA,GAAOY,YAAcpyB,EAE/CqyB,GAAkB,WACpB,IACE,IAAI7H,EAAO8H,GAAUzwB,GAAQ,kBAE7B,OADA2oB,EAAK,GAAI,GAAI,IACNA,EACP,MAAO/rB,KALU,GASjB8zB,GAAkBxf,EAAQhI,eAAiBO,GAAKP,cAAgBgI,EAAQhI,aACxEynB,GAASnC,GAAQA,EAAKnX,MAAQ5N,GAAK+kB,KAAKnX,KAAOmX,EAAKnX,IACpDuZ,GAAgB1f,EAAQvI,aAAec,GAAKd,YAAcuI,EAAQvI,WAGlEkoB,GAAalwB,GAAKmwB,KAClBC,GAAcpwB,GAAKqwB,MACnBC,GAAmBjxB,GAAOkxB,sBAC1BC,GAAiBzB,GAASA,GAAO0B,SAAWjzB,EAC5CkzB,GAAiBngB,EAAQogB,SACzBC,GAAa5C,GAAW7iB,KACxB0lB,GAAajE,GAAQvtB,GAAO6L,KAAM7L,IAClCyxB,GAAY9wB,GAAKC,IACjB8wB,GAAY/wB,GAAKgB,IACjBgwB,GAAYnD,EAAKnX,IACjBua,GAAiB1gB,EAAQlP,SACzB6vB,GAAelxB,GAAKmxB,OACpBC,GAAgBpD,GAAWqD,QAG3BC,GAAWxB,GAAUvf,EAAS,YAC9BkC,GAAMqd,GAAUvf,EAAS,OACzBghB,GAAUzB,GAAUvf,EAAS,WAC7BihB,GAAM1B,GAAUvf,EAAS,OACzBkhB,GAAU3B,GAAUvf,EAAS,WAC7BmhB,GAAe5B,GAAUzwB,GAAQ,UAGjCsyB,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAASR,IAC9BS,GAAgBD,GAASrf,IACzBuf,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAcnD,GAASA,GAAOf,UAAYzwB,EAC1C40B,GAAgBD,GAAcA,GAAYE,QAAU70B,EACpD80B,GAAiBH,GAAcA,GAAY9lB,SAAW7O,EAyH1D,SAAS+0B,GAAO73B,GACd,GAAI83B,GAAa93B,KAAW2W,GAAQ3W,MAAYA,aAAiB+3B,IAAc,CAC7E,GAAI/3B,aAAiBg4B,GACnB,OAAOh4B,EAET,GAAImB,GAAed,KAAKL,EAAO,eAC7B,OAAOi4B,GAAaj4B,GAGxB,OAAO,IAAIg4B,GAAch4B,GAW3B,IAAIk4B,GAAc,WAChB,SAASjI,KACT,OAAO,SAASkI,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAIxD,GACF,OAAOA,GAAawD,GAEtBlI,EAAOsD,UAAY4E,EACnB,IAAI/J,EAAS,IAAI6B,EAEjB,OADAA,EAAOsD,UAAYzwB,EACZsrB,GAZM,GAqBjB,SAASiK,MAWT,SAASL,GAAch4B,EAAOs4B,GAC5Bp5B,KAAKq5B,YAAcv4B,EACnBd,KAAKs5B,YAAc,GACnBt5B,KAAKu5B,YAAcH,EACnBp5B,KAAKw5B,UAAY,EACjBx5B,KAAKy5B,WAAa71B,EAgFpB,SAASi1B,GAAY/3B,GACnBd,KAAKq5B,YAAcv4B,EACnBd,KAAKs5B,YAAc,GACnBt5B,KAAK05B,QAAU,EACf15B,KAAK25B,cAAe,EACpB35B,KAAK45B,cAAgB,GACrB55B,KAAK65B,cAAgBvV,EACrBtkB,KAAK85B,UAAY,GAWnB,SAASC,KACP,IAAI7K,EAAS,IAAI2J,GAAY74B,KAAKq5B,aAOlC,OANAnK,EAAOoK,YAAcU,GAAUh6B,KAAKs5B,aACpCpK,EAAOwK,QAAU15B,KAAK05B,QACtBxK,EAAOyK,aAAe35B,KAAK25B,aAC3BzK,EAAO0K,cAAgBI,GAAUh6B,KAAK45B,eACtC1K,EAAO2K,cAAgB75B,KAAK65B,cAC5B3K,EAAO4K,UAAYE,GAAUh6B,KAAK85B,WAC3B5K,EAWT,SAAS+K,KACP,GAAIj6B,KAAK25B,aAAc,CACrB,IAAIzK,EAAS,IAAI2J,GAAY74B,MAC7BkvB,EAAOwK,SAAW,EAClBxK,EAAOyK,cAAe,OAEtBzK,EAASlvB,KAAKk6B,QACdhL,EAAOwK,UAAY,EAErB,OAAOxK,EAWT,SAAS3Z,KACP,IAAIiZ,EAAQxuB,KAAKq5B,YAAYv4B,QACzBq5B,EAAMn6B,KAAK05B,QACXU,EAAQ3iB,GAAQ+W,GAChB6L,EAAUF,EAAM,EAChBG,EAAYF,EAAQ5L,EAAMvvB,OAAS,EACnCs7B,EAAOC,GAAQ,EAAGF,EAAWt6B,KAAK85B,WAClC3nB,EAAQooB,EAAKpoB,MACb9G,EAAMkvB,EAAKlvB,IACXpM,EAASoM,EAAM8G,EACfQ,EAAQ0nB,EAAUhvB,EAAO8G,EAAQ,EACjCsoB,EAAYz6B,KAAK45B,cACjBc,EAAaD,EAAUx7B,OACvBgwB,EAAW,EACX0L,EAAYxD,GAAUl4B,EAAQe,KAAK65B,eAEvC,IAAKO,IAAWC,GAAWC,GAAar7B,GAAU07B,GAAa17B,EAC7D,OAAO27B,GAAiBpM,EAAOxuB,KAAKs5B,aAEtC,IAAIpK,EAAS,GAEb2L,EACA,MAAO57B,KAAYgwB,EAAW0L,EAAW,CACvChoB,GAASwnB,EAET,IAAIW,GAAa,EACbh6B,EAAQ0tB,EAAM7b,GAElB,QAASmoB,EAAYJ,EAAY,CAC/B,IAAIj8B,EAAOg8B,EAAUK,GACjBpM,EAAWjwB,EAAKiwB,SAChB/uB,EAAOlB,EAAKkB,KACZqB,EAAW0tB,EAAS5tB,GAExB,GAAInB,GAAQqkB,EACVljB,EAAQE,OACH,IAAKA,EAAU,CACpB,GAAIrB,GAAQokB,EACV,SAAS8W,EAET,MAAMA,GAIZ3L,EAAOD,KAAcnuB,EAEvB,OAAOouB,EAgBT,SAAS6L,GAAKC,GACZ,IAAIroB,GAAS,EACT1T,EAAoB,MAAX+7B,EAAkB,EAAIA,EAAQ/7B,OAE3Ce,KAAKi7B,QACL,QAAStoB,EAAQ1T,EAAQ,CACvB,IAAIi8B,EAAQF,EAAQroB,GACpB3S,KAAK8Y,IAAIoiB,EAAM,GAAIA,EAAM,KAW7B,SAASC,KACPn7B,KAAKo7B,SAAWtD,GAAeA,GAAa,MAAQ,GACpD93B,KAAKiD,KAAO,EAad,SAASo4B,GAAW3hB,GAClB,IAAIwV,EAASlvB,KAAK+Y,IAAIW,WAAe1Z,KAAKo7B,SAAS1hB,GAEnD,OADA1Z,KAAKiD,MAAQisB,EAAS,EAAI,EACnBA,EAYT,SAASoM,GAAQ5hB,GACf,IAAIjb,EAAOuB,KAAKo7B,SAChB,GAAItD,GAAc,CAChB,IAAI5I,EAASzwB,EAAKib,GAClB,OAAOwV,IAAWzM,EAAiB7e,EAAYsrB,EAEjD,OAAOjtB,GAAed,KAAK1C,EAAMib,GAAOjb,EAAKib,GAAO9V,EAYtD,SAAS23B,GAAQ7hB,GACf,IAAIjb,EAAOuB,KAAKo7B,SAChB,OAAOtD,GAAgBr5B,EAAKib,KAAS9V,EAAa3B,GAAed,KAAK1C,EAAMib,GAa9E,SAAS8hB,GAAQ9hB,EAAK5Y,GACpB,IAAIrC,EAAOuB,KAAKo7B,SAGhB,OAFAp7B,KAAKiD,MAAQjD,KAAK+Y,IAAIW,GAAO,EAAI,EACjCjb,EAAKib,GAAQoe,IAAgBh3B,IAAU8C,EAAa6e,EAAiB3hB,EAC9Dd,KAmBT,SAASy7B,GAAUT,GACjB,IAAIroB,GAAS,EACT1T,EAAoB,MAAX+7B,EAAkB,EAAIA,EAAQ/7B,OAE3Ce,KAAKi7B,QACL,QAAStoB,EAAQ1T,EAAQ,CACvB,IAAIi8B,EAAQF,EAAQroB,GACpB3S,KAAK8Y,IAAIoiB,EAAM,GAAIA,EAAM,KAW7B,SAASQ,KACP17B,KAAKo7B,SAAW,GAChBp7B,KAAKiD,KAAO,EAYd,SAAS04B,GAAgBjiB,GACvB,IAAIjb,EAAOuB,KAAKo7B,SACZzoB,EAAQipB,GAAan9B,EAAMib,GAE/B,GAAI/G,EAAQ,EACV,OAAO,EAET,IAAIuN,EAAYzhB,EAAKQ,OAAS,EAO9B,OANI0T,GAASuN,EACXzhB,EAAKo9B,MAELle,GAAOxc,KAAK1C,EAAMkU,EAAO,KAEzB3S,KAAKiD,MACA,EAYT,SAAS64B,GAAapiB,GACpB,IAAIjb,EAAOuB,KAAKo7B,SACZzoB,EAAQipB,GAAan9B,EAAMib,GAE/B,OAAO/G,EAAQ,EAAI/O,EAAYnF,EAAKkU,GAAO,GAY7C,SAASopB,GAAariB,GACpB,OAAOkiB,GAAa57B,KAAKo7B,SAAU1hB,IAAQ,EAa7C,SAASsiB,GAAatiB,EAAK5Y,GACzB,IAAIrC,EAAOuB,KAAKo7B,SACZzoB,EAAQipB,GAAan9B,EAAMib,GAQ/B,OANI/G,EAAQ,KACR3S,KAAKiD,KACPxE,EAAKiE,KAAK,CAACgX,EAAK5Y,KAEhBrC,EAAKkU,GAAO,GAAK7R,EAEZd,KAmBT,SAASi8B,GAASjB,GAChB,IAAIroB,GAAS,EACT1T,EAAoB,MAAX+7B,EAAkB,EAAIA,EAAQ/7B,OAE3Ce,KAAKi7B,QACL,QAAStoB,EAAQ1T,EAAQ,CACvB,IAAIi8B,EAAQF,EAAQroB,GACpB3S,KAAK8Y,IAAIoiB,EAAM,GAAIA,EAAM,KAW7B,SAASgB,KACPl8B,KAAKiD,KAAO,EACZjD,KAAKo7B,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKliB,IAAO4iB,IACnB,OAAU,IAAIV,IAalB,SAASoB,GAAeziB,GACtB,IAAIwV,EAASkN,GAAWp8B,KAAM0Z,GAAK,UAAUA,GAE7C,OADA1Z,KAAKiD,MAAQisB,EAAS,EAAI,EACnBA,EAYT,SAASmN,GAAY3iB,GACnB,OAAO0iB,GAAWp8B,KAAM0Z,GAAKmF,IAAInF,GAYnC,SAAS4iB,GAAY5iB,GACnB,OAAO0iB,GAAWp8B,KAAM0Z,GAAKX,IAAIW,GAanC,SAAS6iB,GAAY7iB,EAAK5Y,GACxB,IAAIrC,EAAO29B,GAAWp8B,KAAM0Z,GACxBzW,EAAOxE,EAAKwE,KAIhB,OAFAxE,EAAKqa,IAAIY,EAAK5Y,GACdd,KAAKiD,MAAQxE,EAAKwE,MAAQA,EAAO,EAAI,EAC9BjD,KAoBT,SAASw8B,GAASxjB,GAChB,IAAIrG,GAAS,EACT1T,EAAmB,MAAV+Z,EAAiB,EAAIA,EAAO/Z,OAEzCe,KAAKo7B,SAAW,IAAIa,GACpB,QAAStpB,EAAQ1T,EACfe,KAAK4I,IAAIoQ,EAAOrG,IAcpB,SAAS8pB,GAAY37B,GAEnB,OADAd,KAAKo7B,SAAStiB,IAAIhY,EAAO2hB,GAClBziB,KAYT,SAAS08B,GAAY57B,GACnB,OAAOd,KAAKo7B,SAASriB,IAAIjY,GAgB3B,SAAS67B,GAAM3B,GACb,IAAIv8B,EAAOuB,KAAKo7B,SAAW,IAAIK,GAAUT,GACzCh7B,KAAKiD,KAAOxE,EAAKwE,KAUnB,SAAS25B,KACP58B,KAAKo7B,SAAW,IAAIK,GACpBz7B,KAAKiD,KAAO,EAYd,SAAS45B,GAAYnjB,GACnB,IAAIjb,EAAOuB,KAAKo7B,SACZlM,EAASzwB,EAAK,UAAUib,GAG5B,OADA1Z,KAAKiD,KAAOxE,EAAKwE,KACVisB,EAYT,SAAS4N,GAASpjB,GAChB,OAAO1Z,KAAKo7B,SAASvc,IAAInF,GAY3B,SAASqjB,GAASrjB,GAChB,OAAO1Z,KAAKo7B,SAASriB,IAAIW,GAa3B,SAASsjB,GAAStjB,EAAK5Y,GACrB,IAAIrC,EAAOuB,KAAKo7B,SAChB,GAAI38B,aAAgBg9B,GAAW,CAC7B,IAAIwB,EAAQx+B,EAAK28B,SACjB,IAAKviB,IAAQokB,EAAMh+B,OAASojB,EAAmB,EAG7C,OAFA4a,EAAMv6B,KAAK,CAACgX,EAAK5Y,IACjBd,KAAKiD,OAASxE,EAAKwE,KACZjD,KAETvB,EAAOuB,KAAKo7B,SAAW,IAAIa,GAASgB,GAItC,OAFAx+B,EAAKqa,IAAIY,EAAK5Y,GACdd,KAAKiD,KAAOxE,EAAKwE,KACVjD,KAoBT,SAASk9B,GAAcp8B,EAAOq8B,GAC5B,IAAI/C,EAAQ3iB,GAAQ3W,GAChBs8B,GAAShD,GAASiD,GAAYv8B,GAC9Bw8B,GAAUlD,IAAUgD,GAASvG,GAAS/1B,GACtCy8B,GAAUnD,IAAUgD,IAAUE,GAAUpP,GAAaptB,GACrD08B,EAAcpD,GAASgD,GAASE,GAAUC,EAC1CrO,EAASsO,EAAclM,GAAUxwB,EAAM7B,OAAQc,IAAU,GACzDd,EAASiwB,EAAOjwB,OAEpB,IAAK,IAAIya,KAAO5Y,GACTq8B,IAAal7B,GAAed,KAAKL,EAAO4Y,IACvC8jB,IAEQ,UAAP9jB,GAEC4jB,IAAkB,UAAP5jB,GAA0B,UAAPA,IAE9B6jB,IAAkB,UAAP7jB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD+jB,GAAQ/jB,EAAKza,KAElBiwB,EAAOxsB,KAAKgX,GAGhB,OAAOwV,EAUT,SAASwO,GAAYlP,GACnB,IAAIvvB,EAASuvB,EAAMvvB,OACnB,OAAOA,EAASuvB,EAAMmP,GAAW,EAAG1+B,EAAS,IAAM2E,EAWrD,SAASg6B,GAAgBpP,EAAO+C,GAC9B,OAAOsM,GAAY7D,GAAUxL,GAAQsP,GAAUvM,EAAG,EAAG/C,EAAMvvB,SAU7D,SAAS8+B,GAAavP,GACpB,OAAOqP,GAAY7D,GAAUxL,IAY/B,SAASwP,GAAiBjN,EAAQrX,EAAK5Y,IAChCA,IAAU8C,IAAcq6B,GAAGlN,EAAOrX,GAAM5Y,IACxCA,IAAU8C,KAAe8V,KAAOqX,KACnCmN,GAAgBnN,EAAQrX,EAAK5Y,GAcjC,SAASq9B,GAAYpN,EAAQrX,EAAK5Y,GAChC,IAAIs9B,EAAWrN,EAAOrX,GAChBzX,GAAed,KAAK4vB,EAAQrX,IAAQukB,GAAGG,EAAUt9B,KAClDA,IAAU8C,GAAe8V,KAAOqX,IACnCmN,GAAgBnN,EAAQrX,EAAK5Y,GAYjC,SAAS86B,GAAapN,EAAO9U,GAC3B,IAAIza,EAASuvB,EAAMvvB,OACnB,MAAOA,IACL,GAAIg/B,GAAGzP,EAAMvvB,GAAQ,GAAIya,GACvB,OAAOza,EAGX,OAAQ,EAcV,SAASo/B,GAAehO,EAAY5B,EAAQC,EAAUC,GAIpD,OAHA2P,GAASjO,GAAY,SAASvvB,EAAO4Y,EAAK2W,GACxC5B,EAAOE,EAAa7tB,EAAO4tB,EAAS5tB,GAAQuvB,MAEvC1B,EAYT,SAAS4P,GAAWxN,EAAQ7J,GAC1B,OAAO6J,GAAUyN,GAAWtX,EAAQ5V,GAAK4V,GAAS6J,GAYpD,SAAS0N,GAAa1N,EAAQ7J,GAC5B,OAAO6J,GAAUyN,GAAWtX,EAAQwX,GAAOxX,GAAS6J,GAYtD,SAASmN,GAAgBnN,EAAQrX,EAAK5Y,GACzB,aAAP4Y,GAAsBuc,GACxBA,GAAelF,EAAQrX,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAAS5Y,EACT,UAAY,IAGdiwB,EAAOrX,GAAO5Y,EAYlB,SAAS69B,GAAO5N,EAAQ6N,GACtB,IAAIjsB,GAAS,EACT1T,EAAS2/B,EAAM3/B,OACfiwB,EAAS3kB,EAAMtL,GACf4/B,EAAiB,MAAV9N,EAEX,QAASpe,EAAQ1T,EACfiwB,EAAOvc,GAASksB,EAAOj7B,EAAYib,GAAIkS,EAAQ6N,EAAMjsB,IAEvD,OAAOuc,EAYT,SAAS4O,GAAUgB,EAAQC,EAAOC,GAShC,OARIF,IAAWA,IACTE,IAAUp7B,IACZk7B,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAUn7B,IACZk7B,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUn+B,EAAOo+B,EAASC,EAAYzlB,EAAKqX,EAAQqO,GAC1D,IAAIlQ,EACAmQ,EAASH,EAAUtc,EACnB0c,EAASJ,EAAUrc,EACnB0c,EAASL,EAAUpc,EAKvB,GAHIqc,IACFjQ,EAAS6B,EAASoO,EAAWr+B,EAAO4Y,EAAKqX,EAAQqO,GAASD,EAAWr+B,IAEnEouB,IAAWtrB,EACb,OAAOsrB,EAET,IAAKgK,GAASp4B,GACZ,OAAOA,EAET,IAAIs5B,EAAQ3iB,GAAQ3W,GACpB,GAAIs5B,GAEF,GADAlL,EAASsQ,GAAe1+B,IACnBu+B,EACH,OAAOrF,GAAUl5B,EAAOouB,OAErB,CACL,IAAItuB,EAAM6+B,GAAO3+B,GACb4+B,EAAS9+B,GAAOqkB,GAAWrkB,GAAOskB,EAEtC,GAAI2R,GAAS/1B,GACX,OAAO6+B,GAAY7+B,EAAOu+B,GAE5B,GAAIz+B,GAAO0kB,IAAa1kB,GAAO8jB,GAAYgb,IAAW3O,GAEpD,GADA7B,EAAUoQ,GAAUI,EAAU,GAAKE,GAAgB9+B,IAC9Cu+B,EACH,OAAOC,EACHO,GAAc/+B,EAAO29B,GAAavP,EAAQpuB,IAC1Cg/B,GAAYh/B,EAAOy9B,GAAWrP,EAAQpuB,QAEvC,CACL,IAAKkrB,GAAcprB,GACjB,OAAOmwB,EAASjwB,EAAQ,GAE1BouB,EAAS6Q,GAAej/B,EAAOF,EAAKy+B,IAIxCD,IAAUA,EAAQ,IAAIzC,IACtB,IAAIqD,EAAUZ,EAAMvgB,IAAI/d,GACxB,GAAIk/B,EACF,OAAOA,EAETZ,EAAMtmB,IAAIhY,EAAOouB,GAEblB,GAAMltB,GACRA,EAAMe,SAAQ,SAASo+B,GACrB/Q,EAAOtmB,IAAIq2B,GAAUgB,EAAUf,EAASC,EAAYc,EAAUn/B,EAAOs+B,OAE9DxR,GAAM9sB,IACfA,EAAMe,SAAQ,SAASo+B,EAAUvmB,GAC/BwV,EAAOpW,IAAIY,EAAKulB,GAAUgB,EAAUf,EAASC,EAAYzlB,EAAK5Y,EAAOs+B,OAIzE,IAAIc,EAAWX,EACVD,EAASa,GAAeC,GACxBd,EAASZ,GAASptB,GAEnB7R,EAAQ26B,EAAQx2B,EAAYs8B,EAASp/B,GASzC,OARA8tB,GAAUnvB,GAASqB,GAAO,SAASm/B,EAAUvmB,GACvCja,IACFia,EAAMumB,EACNA,EAAWn/B,EAAM4Y,IAGnBykB,GAAYjP,EAAQxV,EAAKulB,GAAUgB,EAAUf,EAASC,EAAYzlB,EAAK5Y,EAAOs+B,OAEzElQ,EAUT,SAASmR,GAAanZ,GACpB,IAAIznB,EAAQ6R,GAAK4V,GACjB,OAAO,SAAS6J,GACd,OAAOuP,GAAevP,EAAQ7J,EAAQznB,IAY1C,SAAS6gC,GAAevP,EAAQ7J,EAAQznB,GACtC,IAAIR,EAASQ,EAAMR,OACnB,GAAc,MAAV8xB,EACF,OAAQ9xB,EAEV8xB,EAAStrB,GAAOsrB,GAChB,MAAO9xB,IAAU,CACf,IAAIya,EAAMja,EAAMR,GACZ8vB,EAAY7H,EAAOxN,GACnB5Y,EAAQiwB,EAAOrX,GAEnB,GAAK5Y,IAAU8C,KAAe8V,KAAOqX,KAAahC,EAAUjuB,GAC1D,OAAO,EAGX,OAAO,EAaT,SAASy/B,GAAUnS,EAAMoS,EAAMlS,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAI+F,GAAU5R,GAEtB,OAAOnU,IAAW,WAAaggB,EAAKD,MAAMvqB,EAAW0qB,KAAUkS,GAcjE,SAASC,GAAejS,EAAOxV,EAAQ0V,EAAUY,GAC/C,IAAI3c,GAAS,EACTnE,EAAW2gB,GACXuR,GAAW,EACXzhC,EAASuvB,EAAMvvB,OACfiwB,EAAS,GACTyR,EAAe3nB,EAAO/Z,OAE1B,IAAKA,EACH,OAAOiwB,EAELR,IACF1V,EAASuW,GAASvW,EAAQ4Y,GAAUlD,KAElCY,GACF9gB,EAAW6gB,GACXqR,GAAW,GAEJ1nB,EAAO/Z,QAAUojB,IACxB7T,EAAWsjB,GACX4O,GAAW,EACX1nB,EAAS,IAAIwjB,GAASxjB,IAExB6hB,EACA,QAASloB,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd3R,EAAuB,MAAZ0tB,EAAmB5tB,EAAQ4tB,EAAS5tB,GAGnD,GADAA,EAASwuB,GAAwB,IAAVxuB,EAAeA,EAAQ,EAC1C4/B,GAAY1/B,IAAaA,EAAU,CACrC,IAAI4/B,EAAcD,EAClB,MAAOC,IACL,GAAI5nB,EAAO4nB,KAAiB5/B,EAC1B,SAAS65B,EAGb3L,EAAOxsB,KAAK5B,QAEJ0N,EAASwK,EAAQhY,EAAUsuB,IACnCJ,EAAOxsB,KAAK5B,GAGhB,OAAOouB,EAjkCTyJ,GAAOkI,iBAAmB,CAQxB,OAAUzZ,GAQV,SAAYC,GAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAKqR,KAKTA,GAAOtE,UAAY8E,GAAW9E,UAC9BsE,GAAOtE,UAAUyM,YAAcnI,GAE/BG,GAAczE,UAAY2E,GAAWG,GAAW9E,WAChDyE,GAAczE,UAAUyM,YAAchI,GAsHtCD,GAAYxE,UAAY2E,GAAWG,GAAW9E,WAC9CwE,GAAYxE,UAAUyM,YAAcjI,GAoGpCkC,GAAK1G,UAAU4G,MAAQE,GACvBJ,GAAK1G,UAAU,UAAYgH,GAC3BN,GAAK1G,UAAUxV,IAAMyc,GACrBP,GAAK1G,UAAUtb,IAAMwiB,GACrBR,GAAK1G,UAAUvb,IAAM0iB,GAiHrBC,GAAUpH,UAAU4G,MAAQS,GAC5BD,GAAUpH,UAAU,UAAYsH,GAChCF,GAAUpH,UAAUxV,IAAMid,GAC1BL,GAAUpH,UAAUtb,IAAMgjB,GAC1BN,GAAUpH,UAAUvb,IAAMkjB,GAmG1BC,GAAS5H,UAAU4G,MAAQiB,GAC3BD,GAAS5H,UAAU,UAAY8H,GAC/BF,GAAS5H,UAAUxV,IAAMwd,GACzBJ,GAAS5H,UAAUtb,IAAMujB,GACzBL,GAAS5H,UAAUvb,IAAMyjB,GAmDzBC,GAASnI,UAAUzrB,IAAM4zB,GAASnI,UAAU3xB,KAAO+5B,GACnDD,GAASnI,UAAUtb,IAAM2jB,GAkGzBC,GAAMtI,UAAU4G,MAAQ2B,GACxBD,GAAMtI,UAAU,UAAYwI,GAC5BF,GAAMtI,UAAUxV,IAAMie,GACtBH,GAAMtI,UAAUtb,IAAMgkB,GACtBJ,GAAMtI,UAAUvb,IAAMkkB,GA8btB,IAAIsB,GAAWyC,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU9Q,EAAYtB,GAC7B,IAAIG,GAAS,EAKb,OAJAoP,GAASjO,GAAY,SAASvvB,EAAO6R,EAAO0d,GAE1C,OADAnB,IAAWH,EAAUjuB,EAAO6R,EAAO0d,GAC5BnB,KAEFA,EAaT,SAASkS,GAAa5S,EAAOE,EAAUY,GACrC,IAAI3c,GAAS,EACT1T,EAASuvB,EAAMvvB,OAEnB,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd0e,EAAU3C,EAAS5tB,GAEvB,GAAe,MAAXuwB,IAAoBrwB,IAAa4C,EAC5BytB,IAAYA,IAAYgQ,GAAShQ,GAClC/B,EAAW+B,EAASrwB,IAE1B,IAAIA,EAAWqwB,EACXnC,EAASpuB,EAGjB,OAAOouB,EAaT,SAASoS,GAAS9S,EAAO1tB,EAAOqR,EAAO9G,GACrC,IAAIpM,EAASuvB,EAAMvvB,OAEnBkT,EAAQovB,GAAUpvB,GACdA,EAAQ,IACVA,GAASA,EAAQlT,EAAS,EAAKA,EAASkT,GAE1C9G,EAAOA,IAAQzH,GAAayH,EAAMpM,EAAUA,EAASsiC,GAAUl2B,GAC3DA,EAAM,IACRA,GAAOpM,GAEToM,EAAM8G,EAAQ9G,EAAM,EAAIm2B,GAASn2B,GACjC,MAAO8G,EAAQ9G,EACbmjB,EAAMrc,KAAWrR,EAEnB,OAAO0tB,EAWT,SAASiT,GAAWpR,EAAYtB,GAC9B,IAAIG,EAAS,GAMb,OALAoP,GAASjO,GAAY,SAASvvB,EAAO6R,EAAO0d,GACtCtB,EAAUjuB,EAAO6R,EAAO0d,IAC1BnB,EAAOxsB,KAAK5B,MAGTouB,EAcT,SAASwS,GAAYlT,EAAOmT,EAAO5S,EAAW6S,EAAU1S,GACtD,IAAIvc,GAAS,EACT1T,EAASuvB,EAAMvvB,OAEnB8vB,IAAcA,EAAY8S,IAC1B3S,IAAWA,EAAS,IAEpB,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACdgvB,EAAQ,GAAK5S,EAAUjuB,GACrB6gC,EAAQ,EAEVD,GAAY5gC,EAAO6gC,EAAQ,EAAG5S,EAAW6S,EAAU1S,GAEnDM,GAAUN,EAAQpuB,GAEV8gC,IACV1S,EAAOA,EAAOjwB,QAAU6B,GAG5B,OAAOouB,EAcT,IAAI4S,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASf,GAAWjQ,EAAQrC,GAC1B,OAAOqC,GAAU+Q,GAAQ/Q,EAAQrC,EAAUpd,IAW7C,SAAS4vB,GAAgBnQ,EAAQrC,GAC/B,OAAOqC,GAAUiR,GAAajR,EAAQrC,EAAUpd,IAYlD,SAAS2wB,GAAclR,EAAQtxB,GAC7B,OAAOuvB,GAAYvvB,GAAO,SAASia,GACjC,OAAOwoB,GAAWnR,EAAOrX,OAY7B,SAASyoB,GAAQpR,EAAQqR,GACvBA,EAAOC,GAASD,EAAMrR,GAEtB,IAAIpe,EAAQ,EACR1T,EAASmjC,EAAKnjC,OAElB,MAAiB,MAAV8xB,GAAkBpe,EAAQ1T,EAC/B8xB,EAASA,EAAOuR,GAAMF,EAAKzvB,OAE7B,OAAQA,GAASA,GAAS1T,EAAU8xB,EAASntB,EAc/C,SAAS2+B,GAAexR,EAAQmP,EAAUsC,GACxC,IAAItT,EAASgR,EAASnP,GACtB,OAAOtZ,GAAQsZ,GAAU7B,EAASM,GAAUN,EAAQsT,EAAYzR,IAUlE,SAAS0R,GAAW3hC,GAClB,OAAa,MAATA,EACKA,IAAU8C,EAAYiiB,GAAeR,GAEtC0Q,IAAkBA,MAAkBtwB,GAAO3E,GAC/C4hC,GAAU5hC,GACV6hC,GAAe7hC,GAYrB,SAAS8hC,GAAO9hC,EAAO+hC,GACrB,OAAO/hC,EAAQ+hC,EAWjB,SAASC,GAAQ/R,EAAQrX,GACvB,OAAiB,MAAVqX,GAAkB9uB,GAAed,KAAK4vB,EAAQrX,GAWvD,SAASqpB,GAAUhS,EAAQrX,GACzB,OAAiB,MAAVqX,GAAkBrX,KAAOjU,GAAOsrB,GAYzC,SAASiS,GAAYlE,EAAQ3sB,EAAO9G,GAClC,OAAOyzB,GAAU3H,GAAUhlB,EAAO9G,IAAQyzB,EAAS5H,GAAU/kB,EAAO9G,GAatE,SAAS43B,GAAiBC,EAAQxU,EAAUY,GAC1C,IAAI9gB,EAAW8gB,EAAaD,GAAoBF,GAC5ClwB,EAASikC,EAAO,GAAGjkC,OACnBkkC,EAAYD,EAAOjkC,OACnBmkC,EAAWD,EACXE,EAAS94B,EAAM44B,GACfG,EAAYC,IACZrU,EAAS,GAEb,MAAOkU,IAAY,CACjB,IAAI5U,EAAQ0U,EAAOE,GACfA,GAAY1U,IACdF,EAAQe,GAASf,EAAOoD,GAAUlD,KAEpC4U,EAAYnM,GAAU3I,EAAMvvB,OAAQqkC,GACpCD,EAAOD,IAAa9T,IAAeZ,GAAazvB,GAAU,KAAOuvB,EAAMvvB,QAAU,KAC7E,IAAIu9B,GAAS4G,GAAY5U,GACzB5qB,EAEN4qB,EAAQ0U,EAAO,GAEf,IAAIvwB,GAAS,EACT6wB,EAAOH,EAAO,GAElBxI,EACA,QAASloB,EAAQ1T,GAAUiwB,EAAOjwB,OAASqkC,EAAW,CACpD,IAAIxiC,EAAQ0tB,EAAM7b,GACd3R,EAAW0tB,EAAWA,EAAS5tB,GAASA,EAG5C,GADAA,EAASwuB,GAAwB,IAAVxuB,EAAeA,EAAQ,IACxC0iC,EACE1R,GAAS0R,EAAMxiC,GACfwN,EAAS0gB,EAAQluB,EAAUsuB,IAC5B,CACL8T,EAAWD,EACX,QAASC,EAAU,CACjB,IAAIrR,EAAQsR,EAAOD,GACnB,KAAMrR,EACED,GAASC,EAAO/wB,GAChBwN,EAAS00B,EAAOE,GAAWpiC,EAAUsuB,IAE3C,SAASuL,EAGT2I,GACFA,EAAK9gC,KAAK1B,GAEZkuB,EAAOxsB,KAAK5B,IAGhB,OAAOouB,EAcT,SAASuU,GAAa1S,EAAQtC,EAAQC,EAAUC,GAI9C,OAHAqS,GAAWjQ,GAAQ,SAASjwB,EAAO4Y,EAAKqX,GACtCtC,EAAOE,EAAaD,EAAS5tB,GAAQ4Y,EAAKqX,MAErCpC,EAaT,SAAS+U,GAAW3S,EAAQqR,EAAM9T,GAChC8T,EAAOC,GAASD,EAAMrR,GACtBA,EAAS7d,GAAO6d,EAAQqR,GACxB,IAAIhU,EAAiB,MAAV2C,EAAiBA,EAASA,EAAOuR,GAAMxoB,GAAKsoB,KACvD,OAAe,MAARhU,EAAexqB,EAAYuqB,GAAMC,EAAM2C,EAAQzC,GAUxD,SAASqV,GAAgB7iC,GACvB,OAAO83B,GAAa93B,IAAU2hC,GAAW3hC,IAAU4jB,EAUrD,SAASkf,GAAkB9iC,GACzB,OAAO83B,GAAa93B,IAAU2hC,GAAW3hC,IAAUklB,GAUrD,SAAS6d,GAAW/iC,GAClB,OAAO83B,GAAa93B,IAAU2hC,GAAW3hC,IAAUgkB,EAiBrD,SAASgf,GAAYhjC,EAAO+hC,EAAO3D,EAASC,EAAYC,GACtD,OAAIt+B,IAAU+hC,IAGD,MAAT/hC,GAA0B,MAAT+hC,IAAmBjK,GAAa93B,KAAW83B,GAAaiK,GACpE/hC,IAAUA,GAAS+hC,IAAUA,EAE/BkB,GAAgBjjC,EAAO+hC,EAAO3D,EAASC,EAAY2E,GAAa1E,IAiBzE,SAAS2E,GAAgBhT,EAAQ8R,EAAO3D,EAASC,EAAY6E,EAAW5E,GACtE,IAAI6E,EAAWxsB,GAAQsZ,GACnBmT,EAAWzsB,GAAQorB,GACnBsB,EAASF,EAAWtf,EAAW8a,GAAO1O,GACtCqT,EAASF,EAAWvf,EAAW8a,GAAOoD,GAE1CsB,EAASA,GAAUzf,EAAUY,GAAY6e,EACzCC,EAASA,GAAU1f,EAAUY,GAAY8e,EAEzC,IAAIC,EAAWF,GAAU7e,GACrBgf,EAAWF,GAAU9e,GACrBif,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa1N,GAAS9F,GAAS,CACjC,IAAK8F,GAASgM,GACZ,OAAO,EAEToB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAjF,IAAUA,EAAQ,IAAIzC,IACdsH,GAAY/V,GAAa6C,GAC7ByT,GAAYzT,EAAQ8R,EAAO3D,EAASC,EAAY6E,EAAW5E,GAC3DqF,GAAW1T,EAAQ8R,EAAOsB,EAAQjF,EAASC,EAAY6E,EAAW5E,GAExE,KAAMF,EAAUnc,GAAuB,CACrC,IAAI2hB,EAAeL,GAAYpiC,GAAed,KAAK4vB,EAAQ,eACvD4T,EAAeL,GAAYriC,GAAed,KAAK0hC,EAAO,eAE1D,GAAI6B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe3T,EAAOjwB,QAAUiwB,EAC/C8T,EAAeF,EAAe9B,EAAM/hC,QAAU+hC,EAGlD,OADAzD,IAAUA,EAAQ,IAAIzC,IACfqH,EAAUY,EAAcC,EAAc3F,EAASC,EAAYC,IAGtE,QAAKmF,IAGLnF,IAAUA,EAAQ,IAAIzC,IACfmI,GAAa/T,EAAQ8R,EAAO3D,EAASC,EAAY6E,EAAW5E,IAUrE,SAAS2F,GAAUjkC,GACjB,OAAO83B,GAAa93B,IAAU2+B,GAAO3+B,IAAUqkB,EAajD,SAAS6f,GAAYjU,EAAQ7J,EAAQ+d,EAAW9F,GAC9C,IAAIxsB,EAAQsyB,EAAUhmC,OAClBA,EAAS0T,EACTuyB,GAAgB/F,EAEpB,GAAc,MAAVpO,EACF,OAAQ9xB,EAEV8xB,EAAStrB,GAAOsrB,GAChB,MAAOpe,IAAS,CACd,IAAIlU,EAAOwmC,EAAUtyB,GACrB,GAAKuyB,GAAgBzmC,EAAK,GAClBA,EAAK,KAAOsyB,EAAOtyB,EAAK,MACtBA,EAAK,KAAMsyB,GAEnB,OAAO,EAGX,QAASpe,EAAQ1T,EAAQ,CACvBR,EAAOwmC,EAAUtyB,GACjB,IAAI+G,EAAMjb,EAAK,GACX2/B,EAAWrN,EAAOrX,GAClByrB,EAAW1mC,EAAK,GAEpB,GAAIymC,GAAgBzmC,EAAK,IACvB,GAAI2/B,IAAax6B,KAAe8V,KAAOqX,GACrC,OAAO,MAEJ,CACL,IAAIqO,EAAQ,IAAIzC,GAChB,GAAIwC,EACF,IAAIjQ,EAASiQ,EAAWf,EAAU+G,EAAUzrB,EAAKqX,EAAQ7J,EAAQkY,GAEnE,KAAMlQ,IAAWtrB,EACTkgC,GAAYqB,EAAU/G,EAAUrb,EAAuBC,EAAwBmc,EAAYC,GAC3FlQ,GAEN,OAAO,GAIb,OAAO,EAWT,SAASkW,GAAatkC,GACpB,IAAKo4B,GAASp4B,IAAUukC,GAASvkC,GAC/B,OAAO,EAET,IAAIwkC,EAAUpD,GAAWphC,GAASo0B,GAAa1M,GAC/C,OAAO8c,EAAQ5S,KAAKwF,GAASp3B,IAU/B,SAASykC,GAAazkC,GACpB,OAAO83B,GAAa93B,IAAU2hC,GAAW3hC,IAAU2kB,GAUrD,SAAS+f,GAAU1kC,GACjB,OAAO83B,GAAa93B,IAAU2+B,GAAO3+B,IAAU4kB,GAUjD,SAAS+f,GAAiB3kC,GACxB,OAAO83B,GAAa93B,IAClB4kC,GAAS5kC,EAAM7B,WAAa8sB,GAAe0W,GAAW3hC,IAU1D,SAAS6kC,GAAa7kC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK8kC,GAEW,iBAAT9kC,EACF2W,GAAQ3W,GACX+kC,GAAoB/kC,EAAM,GAAIA,EAAM,IACpCglC,GAAYhlC,GAEXilC,GAASjlC,GAUlB,SAASklC,GAASjV,GAChB,IAAKkV,GAAYlV,GACf,OAAOkG,GAAWlG,GAEpB,IAAI7B,EAAS,GACb,IAAK,IAAIxV,KAAOjU,GAAOsrB,GACjB9uB,GAAed,KAAK4vB,EAAQrX,IAAe,eAAPA,GACtCwV,EAAOxsB,KAAKgX,GAGhB,OAAOwV,EAUT,SAASgX,GAAWnV,GAClB,IAAKmI,GAASnI,GACZ,OAAOoV,GAAapV,GAEtB,IAAIqV,EAAUH,GAAYlV,GACtB7B,EAAS,GAEb,IAAK,IAAIxV,KAAOqX,GACD,eAAPrX,IAAyB0sB,GAAYnkC,GAAed,KAAK4vB,EAAQrX,KACrEwV,EAAOxsB,KAAKgX,GAGhB,OAAOwV,EAYT,SAASmX,GAAOvlC,EAAO+hC,GACrB,OAAO/hC,EAAQ+hC,EAWjB,SAASyD,GAAQjW,EAAY3B,GAC3B,IAAI/b,GAAS,EACTuc,EAASqX,GAAYlW,GAAc9lB,EAAM8lB,EAAWpxB,QAAU,GAKlE,OAHAq/B,GAASjO,GAAY,SAASvvB,EAAO4Y,EAAK2W,GACxCnB,IAASvc,GAAS+b,EAAS5tB,EAAO4Y,EAAK2W,MAElCnB,EAUT,SAAS4W,GAAY5e,GACnB,IAAI+d,EAAYuB,GAAatf,GAC7B,OAAwB,GAApB+d,EAAUhmC,QAAegmC,EAAU,GAAG,GACjCwB,GAAwBxB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASlU,GACd,OAAOA,IAAW7J,GAAU8d,GAAYjU,EAAQ7J,EAAQ+d,IAY5D,SAASY,GAAoBzD,EAAM+C,GACjC,OAAIuB,GAAMtE,IAASuE,GAAmBxB,GAC7BsB,GAAwBnE,GAAMF,GAAO+C,GAEvC,SAASpU,GACd,IAAIqN,EAAWvf,GAAIkS,EAAQqR,GAC3B,OAAQhE,IAAax6B,GAAaw6B,IAAa+G,EAC3CyB,GAAM7V,EAAQqR,GACd0B,GAAYqB,EAAU/G,EAAUrb,EAAuBC,IAe/D,SAAS6jB,GAAU9V,EAAQ7J,EAAQ4f,EAAU3H,EAAYC,GACnDrO,IAAW7J,GAGf4a,GAAQ5a,GAAQ,SAASie,EAAUzrB,GAEjC,GADA0lB,IAAUA,EAAQ,IAAIzC,IAClBzD,GAASiM,GACX4B,GAAchW,EAAQ7J,EAAQxN,EAAKotB,EAAUD,GAAW1H,EAAYC,OAEjE,CACH,IAAI4H,EAAW7H,EACXA,EAAW8H,GAAQlW,EAAQrX,GAAMyrB,EAAWzrB,EAAM,GAAKqX,EAAQ7J,EAAQkY,GACvEx7B,EAEAojC,IAAapjC,IACfojC,EAAW7B,GAEbnH,GAAiBjN,EAAQrX,EAAKstB,MAE/BtI,IAkBL,SAASqI,GAAchW,EAAQ7J,EAAQxN,EAAKotB,EAAUI,EAAW/H,EAAYC,GAC3E,IAAIhB,EAAW6I,GAAQlW,EAAQrX,GAC3ByrB,EAAW8B,GAAQ/f,EAAQxN,GAC3BsmB,EAAUZ,EAAMvgB,IAAIsmB,GAExB,GAAInF,EACFhC,GAAiBjN,EAAQrX,EAAKsmB,OADhC,CAIA,IAAIgH,EAAW7H,EACXA,EAAWf,EAAU+G,EAAWzrB,EAAM,GAAKqX,EAAQ7J,EAAQkY,GAC3Dx7B,EAEA88B,EAAWsG,IAAapjC,EAE5B,GAAI88B,EAAU,CACZ,IAAItG,EAAQ3iB,GAAQ0tB,GAChB7H,GAAUlD,GAASvD,GAASsO,GAC5BgC,GAAW/M,IAAUkD,GAAUpP,GAAaiX,GAEhD6B,EAAW7B,EACP/K,GAASkD,GAAU6J,EACjB1vB,GAAQ2mB,GACV4I,EAAW5I,EAEJgJ,GAAkBhJ,GACzB4I,EAAWhN,GAAUoE,GAEdd,GACPoD,GAAW,EACXsG,EAAWrH,GAAYwF,GAAU,IAE1BgC,GACPzG,GAAW,EACXsG,EAAWK,GAAgBlC,GAAU,IAGrC6B,EAAW,GAGNM,GAAcnC,IAAa9H,GAAY8H,IAC9C6B,EAAW5I,EACPf,GAAYe,GACd4I,EAAWO,GAAcnJ,GAEjBlF,GAASkF,KAAa8D,GAAW9D,KACzC4I,EAAWpH,GAAgBuF,KAI7BzE,GAAW,EAGXA,IAEFtB,EAAMtmB,IAAIqsB,EAAU6B,GACpBE,EAAUF,EAAU7B,EAAU2B,EAAU3H,EAAYC,GACpDA,EAAM,UAAU+F,IAElBnH,GAAiBjN,EAAQrX,EAAKstB,IAWhC,SAASQ,GAAQhZ,EAAO+C,GACtB,IAAItyB,EAASuvB,EAAMvvB,OACnB,GAAKA,EAIL,OADAsyB,GAAKA,EAAI,EAAItyB,EAAS,EACfw+B,GAAQlM,EAAGtyB,GAAUuvB,EAAM+C,GAAK3tB,EAYzC,SAAS6jC,GAAYpX,EAAYoK,EAAWiN,GAExCjN,EADEA,EAAUx7B,OACAswB,GAASkL,GAAW,SAAS/L,GACvC,OAAIjX,GAAQiX,GACH,SAAS5tB,GACd,OAAOqhC,GAAQrhC,EAA2B,IAApB4tB,EAASzvB,OAAeyvB,EAAS,GAAKA,IAGzDA,KAGG,CAACkX,IAGf,IAAIjzB,GAAS,EACb8nB,EAAYlL,GAASkL,EAAW7I,GAAU+V,OAE1C,IAAIzY,EAASoX,GAAQjW,GAAY,SAASvvB,EAAO4Y,EAAK2W,GACpD,IAAIuX,EAAWrY,GAASkL,GAAW,SAAS/L,GAC1C,OAAOA,EAAS5tB,MAElB,MAAO,CAAE,SAAY8mC,EAAU,QAAWj1B,EAAO,MAAS7R,MAG5D,OAAOowB,GAAWhC,GAAQ,SAAS6B,EAAQ8R,GACzC,OAAOgF,GAAgB9W,EAAQ8R,EAAO6E,MAa1C,SAASI,GAAS/W,EAAQ6N,GACxB,OAAOmJ,GAAWhX,EAAQ6N,GAAO,SAAS99B,EAAOshC,GAC/C,OAAOwE,GAAM7V,EAAQqR,MAazB,SAAS2F,GAAWhX,EAAQ6N,EAAO7P,GACjC,IAAIpc,GAAS,EACT1T,EAAS2/B,EAAM3/B,OACfiwB,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAImjC,EAAOxD,EAAMjsB,GACb7R,EAAQqhC,GAAQpR,EAAQqR,GAExBrT,EAAUjuB,EAAOshC,IACnB4F,GAAQ9Y,EAAQmT,GAASD,EAAMrR,GAASjwB,GAG5C,OAAOouB,EAUT,SAAS+Y,GAAiB7F,GACxB,OAAO,SAASrR,GACd,OAAOoR,GAAQpR,EAAQqR,IAe3B,SAAS8F,GAAY1Z,EAAOxV,EAAQ0V,EAAUY,GAC5C,IAAI7kB,EAAU6kB,EAAasB,GAAkBxB,GACzCzc,GAAS,EACT1T,EAAS+Z,EAAO/Z,OAChBukC,EAAOhV,EAEPA,IAAUxV,IACZA,EAASghB,GAAUhhB,IAEjB0V,IACF8U,EAAOjU,GAASf,EAAOoD,GAAUlD,KAEnC,QAAS/b,EAAQ1T,EAAQ,CACvB,IAAIuxB,EAAY,EACZ1vB,EAAQkY,EAAOrG,GACf3R,EAAW0tB,EAAWA,EAAS5tB,GAASA,EAE5C,OAAQ0vB,EAAY/lB,EAAQ+4B,EAAMxiC,EAAUwvB,EAAWlB,KAAgB,EACjEkU,IAAShV,GACX7Q,GAAOxc,KAAKqiC,EAAMhT,EAAW,GAE/B7S,GAAOxc,KAAKqtB,EAAOgC,EAAW,GAGlC,OAAOhC,EAYT,SAAS2Z,GAAW3Z,EAAO4Z,GACzB,IAAInpC,EAASuvB,EAAQ4Z,EAAQnpC,OAAS,EAClCihB,EAAYjhB,EAAS,EAEzB,MAAOA,IAAU,CACf,IAAI0T,EAAQy1B,EAAQnpC,GACpB,GAAIA,GAAUihB,GAAavN,IAAU01B,EAAU,CAC7C,IAAIA,EAAW11B,EACX8qB,GAAQ9qB,GACVgL,GAAOxc,KAAKqtB,EAAO7b,EAAO,GAE1B21B,GAAU9Z,EAAO7b,IAIvB,OAAO6b,EAYT,SAASmP,GAAWoB,EAAOC,GACzB,OAAOD,EAAQvI,GAAYc,MAAkB0H,EAAQD,EAAQ,IAc/D,SAASwJ,GAAUp2B,EAAO9G,EAAKm9B,EAAM/X,GACnC,IAAI9d,GAAS,EACT1T,EAASi4B,GAAUZ,IAAYjrB,EAAM8G,IAAUq2B,GAAQ,IAAK,GAC5DtZ,EAAS3kB,EAAMtL,GAEnB,MAAOA,IACLiwB,EAAOuB,EAAYxxB,IAAW0T,GAASR,EACvCA,GAASq2B,EAEX,OAAOtZ,EAWT,SAASuZ,GAAWxY,EAAQsB,GAC1B,IAAIrC,EAAS,GACb,IAAKe,GAAUsB,EAAI,GAAKA,EAAIpN,EAC1B,OAAO+K,EAIT,GACMqC,EAAI,IACNrC,GAAUe,GAEZsB,EAAIiF,GAAYjF,EAAI,GAChBA,IACFtB,GAAUA,SAELsB,GAET,OAAOrC,EAWT,SAASwZ,GAASta,EAAMjc,GACtB,OAAOw2B,GAAYC,GAASxa,EAAMjc,EAAOyzB,IAAWxX,EAAO,IAU7D,SAASya,GAAWxY,GAClB,OAAOqN,GAAY1kB,GAAOqX,IAW5B,SAASyY,GAAezY,EAAYkB,GAClC,IAAI/C,EAAQxV,GAAOqX,GACnB,OAAOwN,GAAYrP,EAAOsP,GAAUvM,EAAG,EAAG/C,EAAMvvB,SAalD,SAAS+oC,GAAQjX,EAAQqR,EAAMthC,EAAOq+B,GACpC,IAAKjG,GAASnI,GACZ,OAAOA,EAETqR,EAAOC,GAASD,EAAMrR,GAEtB,IAAIpe,GAAS,EACT1T,EAASmjC,EAAKnjC,OACdihB,EAAYjhB,EAAS,EACrB8pC,EAAShY,EAEb,MAAiB,MAAVgY,KAAoBp2B,EAAQ1T,EAAQ,CACzC,IAAIya,EAAM4oB,GAAMF,EAAKzvB,IACjBq0B,EAAWlmC,EAEf,GAAY,cAAR4Y,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOqX,EAGT,GAAIpe,GAASuN,EAAW,CACtB,IAAIke,EAAW2K,EAAOrvB,GACtBstB,EAAW7H,EAAaA,EAAWf,EAAU1kB,EAAKqvB,GAAUnlC,EACxDojC,IAAapjC,IACfojC,EAAW9N,GAASkF,GAChBA,EACCX,GAAQ2E,EAAKzvB,EAAQ,IAAM,GAAK,IAGzCwrB,GAAY4K,EAAQrvB,EAAKstB,GACzB+B,EAASA,EAAOrvB,GAElB,OAAOqX,EAWT,IAAIiY,GAAejR,GAAqB,SAAS3J,EAAM3vB,GAErD,OADAs5B,GAAQjf,IAAIsV,EAAM3vB,GACX2vB,GAFoBwX,GAazBqD,GAAmBhT,GAA4B,SAAS7H,EAAM6B,GAChE,OAAOgG,GAAe7H,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAAS8a,GAASjZ,GAClB,UAAY,KALwB2V,GAgBxC,SAASuD,GAAY9Y,GACnB,OAAOwN,GAAY7kB,GAAOqX,IAY5B,SAAS+Y,GAAU5a,EAAOrc,EAAO9G,GAC/B,IAAIsH,GAAS,EACT1T,EAASuvB,EAAMvvB,OAEfkT,EAAQ,IACVA,GAASA,EAAQlT,EAAS,EAAKA,EAASkT,GAE1C9G,EAAMA,EAAMpM,EAASA,EAASoM,EAC1BA,EAAM,IACRA,GAAOpM,GAETA,EAASkT,EAAQ9G,EAAM,EAAMA,EAAM8G,IAAW,EAC9CA,KAAW,EAEX,IAAI+c,EAAS3kB,EAAMtL,GACnB,QAAS0T,EAAQ1T,EACfiwB,EAAOvc,GAAS6b,EAAM7b,EAAQR,GAEhC,OAAO+c,EAYT,SAASma,GAAShZ,EAAYtB,GAC5B,IAAIG,EAMJ,OAJAoP,GAASjO,GAAY,SAASvvB,EAAO6R,EAAO0d,GAE1C,OADAnB,EAASH,EAAUjuB,EAAO6R,EAAO0d,IACzBnB,OAEDA,EAeX,SAASoa,GAAgB9a,EAAO1tB,EAAOyoC,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATjb,EAAgBgb,EAAMhb,EAAMvvB,OAEvC,GAAoB,iBAAT6B,GAAqBA,IAAUA,GAAS2oC,GAAQjlB,EAAuB,CAChF,MAAOglB,EAAMC,EAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvBzoC,EAAWwtB,EAAMkb,GAEJ,OAAb1oC,IAAsBqgC,GAASrgC,KAC9BuoC,EAAcvoC,GAAYF,EAAUE,EAAWF,GAClD0oC,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBnb,EAAO1tB,EAAO8kC,GAAU2D,GAgBnD,SAASI,GAAkBnb,EAAO1tB,EAAO4tB,EAAU6a,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATjb,EAAgB,EAAIA,EAAMvvB,OACrC,GAAa,IAATwqC,EACF,OAAO,EAGT3oC,EAAQ4tB,EAAS5tB,GACjB,IAAI8oC,EAAW9oC,IAAUA,EACrB+oC,EAAsB,OAAV/oC,EACZgpC,EAAczI,GAASvgC,GACvBipC,EAAiBjpC,IAAU8C,EAE/B,MAAO4lC,EAAMC,EAAM,CACjB,IAAIC,EAAMlT,IAAagT,EAAMC,GAAQ,GACjCzoC,EAAW0tB,EAASF,EAAMkb,IAC1BM,EAAehpC,IAAa4C,EAC5BqmC,EAAyB,OAAbjpC,EACZkpC,EAAiBlpC,IAAaA,EAC9BmpC,EAAc9I,GAASrgC,GAE3B,GAAI4oC,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAcvoC,GAAYF,EAAUE,EAAWF,GAEtDspC,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOvS,GAAUsS,EAAMllB,GAYzB,SAAS8lB,GAAe7b,EAAOE,GAC7B,IAAI/b,GAAS,EACT1T,EAASuvB,EAAMvvB,OACfgwB,EAAW,EACXC,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd3R,EAAW0tB,EAAWA,EAAS5tB,GAASA,EAE5C,IAAK6R,IAAUsrB,GAAGj9B,EAAUwiC,GAAO,CACjC,IAAIA,EAAOxiC,EACXkuB,EAAOD,KAAwB,IAAVnuB,EAAc,EAAIA,GAG3C,OAAOouB,EAWT,SAASob,GAAaxpC,GACpB,MAAoB,iBAATA,EACFA,EAELugC,GAASvgC,GACJujB,GAEDvjB,EAWV,SAASypC,GAAazpC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI2W,GAAQ3W,GAEV,OAAOyuB,GAASzuB,EAAOypC,IAAgB,GAEzC,GAAIlJ,GAASvgC,GACX,OAAO43B,GAAiBA,GAAev3B,KAAKL,GAAS,GAEvD,IAAIouB,EAAUpuB,EAAQ,GACtB,MAAkB,KAAVouB,GAAkB,EAAIpuB,IAAWojB,EAAY,KAAOgL,EAY9D,SAASsb,GAAShc,EAAOE,EAAUY,GACjC,IAAI3c,GAAS,EACTnE,EAAW2gB,GACXlwB,EAASuvB,EAAMvvB,OACfyhC,GAAW,EACXxR,EAAS,GACTsU,EAAOtU,EAEX,GAAII,EACFoR,GAAW,EACXlyB,EAAW6gB,QAER,GAAIpwB,GAAUojB,EAAkB,CACnC,IAAIvJ,EAAM4V,EAAW,KAAO+b,GAAUjc,GACtC,GAAI1V,EACF,OAAOqa,GAAWra,GAEpB4nB,GAAW,EACXlyB,EAAWsjB,GACX0R,EAAO,IAAIhH,QAGXgH,EAAO9U,EAAW,GAAKQ,EAEzB2L,EACA,QAASloB,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd3R,EAAW0tB,EAAWA,EAAS5tB,GAASA,EAG5C,GADAA,EAASwuB,GAAwB,IAAVxuB,EAAeA,EAAQ,EAC1C4/B,GAAY1/B,IAAaA,EAAU,CACrC,IAAI0pC,EAAYlH,EAAKvkC,OACrB,MAAOyrC,IACL,GAAIlH,EAAKkH,KAAe1pC,EACtB,SAAS65B,EAGTnM,GACF8U,EAAK9gC,KAAK1B,GAEZkuB,EAAOxsB,KAAK5B,QAEJ0N,EAASg1B,EAAMxiC,EAAUsuB,KAC7BkU,IAAStU,GACXsU,EAAK9gC,KAAK1B,GAEZkuB,EAAOxsB,KAAK5B,IAGhB,OAAOouB,EAWT,SAASoZ,GAAUvX,EAAQqR,GAGzB,OAFAA,EAAOC,GAASD,EAAMrR,GACtBA,EAAS7d,GAAO6d,EAAQqR,GACP,MAAVrR,UAAyBA,EAAOuR,GAAMxoB,GAAKsoB,KAapD,SAASuI,GAAW5Z,EAAQqR,EAAMwI,EAASzL,GACzC,OAAO6I,GAAQjX,EAAQqR,EAAMwI,EAAQzI,GAAQpR,EAAQqR,IAAQjD,GAc/D,SAAS0L,GAAUrc,EAAOO,EAAW+b,EAAQra,GAC3C,IAAIxxB,EAASuvB,EAAMvvB,OACf0T,EAAQ8d,EAAYxxB,GAAU,EAElC,OAAQwxB,EAAY9d,MAAYA,EAAQ1T,IACtC8vB,EAAUP,EAAM7b,GAAQA,EAAO6b,IAEjC,OAAOsc,EACH1B,GAAU5a,EAAQiC,EAAY,EAAI9d,EAAS8d,EAAY9d,EAAQ,EAAI1T,GACnEmqC,GAAU5a,EAAQiC,EAAY9d,EAAQ,EAAI,EAAK8d,EAAYxxB,EAAS0T,GAa1E,SAASioB,GAAiB95B,EAAOiqC,GAC/B,IAAI7b,EAASpuB,EAIb,OAHIouB,aAAkB2J,KACpB3J,EAASA,EAAOpuB,SAEX4uB,GAAYqb,GAAS,SAAS7b,EAAQ7e,GAC3C,OAAOA,EAAO+d,KAAKD,MAAM9d,EAAOge,QAASmB,GAAU,CAACN,GAAS7e,EAAOie,SACnEY,GAaL,SAAS8b,GAAQ9H,EAAQxU,EAAUY,GACjC,IAAIrwB,EAASikC,EAAOjkC,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASurC,GAAStH,EAAO,IAAM,GAExC,IAAIvwB,GAAS,EACTuc,EAAS3kB,EAAMtL,GAEnB,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIuvB,EAAQ0U,EAAOvwB,GACfywB,GAAY,EAEhB,QAASA,EAAWnkC,EACdmkC,GAAYzwB,IACduc,EAAOvc,GAAS8tB,GAAevR,EAAOvc,IAAU6b,EAAO0U,EAAOE,GAAW1U,EAAUY,IAIzF,OAAOkb,GAAS9I,GAAYxS,EAAQ,GAAIR,EAAUY,GAYpD,SAAS2b,GAAcxrC,EAAOuZ,EAAQkyB,GACpC,IAAIv4B,GAAS,EACT1T,EAASQ,EAAMR,OACfksC,EAAanyB,EAAO/Z,OACpBiwB,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ6R,EAAQw4B,EAAanyB,EAAOrG,GAAS/O,EACjDsnC,EAAWhc,EAAQzvB,EAAMkT,GAAQ7R,GAEnC,OAAOouB,EAUT,SAASkc,GAAoBtqC,GAC3B,OAAOsmC,GAAkBtmC,GAASA,EAAQ,GAU5C,SAASuqC,GAAavqC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ8kC,GAW9C,SAASvD,GAASvhC,EAAOiwB,GACvB,OAAItZ,GAAQ3W,GACHA,EAEF4lC,GAAM5lC,EAAOiwB,GAAU,CAACjwB,GAASwqC,GAAa74B,GAAS3R,IAYhE,IAAIyqC,GAAW7C,GAWf,SAAS8C,GAAUhd,EAAOrc,EAAO9G,GAC/B,IAAIpM,EAASuvB,EAAMvvB,OAEnB,OADAoM,EAAMA,IAAQzH,EAAY3E,EAASoM,GAC1B8G,GAAS9G,GAAOpM,EAAUuvB,EAAQ4a,GAAU5a,EAAOrc,EAAO9G,GASrE,IAAIsD,GAAewnB,IAAmB,SAASlqB,GAC7C,OAAOiD,GAAKP,aAAa1C,IAW3B,SAAS0zB,GAAY8L,EAAQpM,GAC3B,GAAIA,EACF,OAAOoM,EAAO74B,QAEhB,IAAI3T,EAASwsC,EAAOxsC,OAChBiwB,EAASoG,GAAcA,GAAYr2B,GAAU,IAAIwsC,EAAO3K,YAAY7hC,GAGxE,OADAwsC,EAAOC,KAAKxc,GACLA,EAUT,SAASyc,GAAiBC,GACxB,IAAI1c,EAAS,IAAI0c,EAAY9K,YAAY8K,EAAYC,YAErD,OADA,IAAIxW,GAAWnG,GAAQpW,IAAI,IAAIuc,GAAWuW,IACnC1c,EAWT,SAAS4c,GAAcC,EAAU1M,GAC/B,IAAIoM,EAASpM,EAASsM,GAAiBI,EAASN,QAAUM,EAASN,OACnE,OAAO,IAAIM,EAASjL,YAAY2K,EAAQM,EAASC,WAAYD,EAASF,YAUxE,SAASI,GAAYC,GACnB,IAAIhd,EAAS,IAAIgd,EAAOpL,YAAYoL,EAAOhlB,OAAQmB,GAAQwM,KAAKqX,IAEhE,OADAhd,EAAOhP,UAAYgsB,EAAOhsB,UACnBgP,EAUT,SAASid,GAAYC,GACnB,OAAO5T,GAAgB/yB,GAAO+yB,GAAcr3B,KAAKirC,IAAW,GAW9D,SAAS/E,GAAgBgF,EAAYhN,GACnC,IAAIoM,EAASpM,EAASsM,GAAiBU,EAAWZ,QAAUY,EAAWZ,OACvE,OAAO,IAAIY,EAAWvL,YAAY2K,EAAQY,EAAWL,WAAYK,EAAWptC,QAW9E,SAASqtC,GAAiBxrC,EAAO+hC,GAC/B,GAAI/hC,IAAU+hC,EAAO,CACnB,IAAI0J,EAAezrC,IAAU8C,EACzBimC,EAAsB,OAAV/oC,EACZ0rC,EAAiB1rC,IAAUA,EAC3BgpC,EAAczI,GAASvgC,GAEvBkpC,EAAenH,IAAUj/B,EACzBqmC,EAAsB,OAAVpH,EACZqH,EAAiBrH,IAAUA,EAC3BsH,EAAc9I,GAASwB,GAE3B,IAAMoH,IAAcE,IAAgBL,GAAehpC,EAAQ+hC,GACtDiH,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BqC,GAAgBrC,IACjBsC,EACH,OAAO,EAET,IAAM3C,IAAcC,IAAgBK,GAAerpC,EAAQ+hC,GACtDsH,GAAeoC,GAAgBC,IAAmB3C,IAAcC,GAChEG,GAAasC,GAAgBC,IAC5BxC,GAAgBwC,IACjBtC,EACH,OAAQ,EAGZ,OAAO,EAiBT,SAASrC,GAAgB9W,EAAQ8R,EAAO6E,GACtC,IAAI/0B,GAAS,EACT85B,EAAc1b,EAAO6W,SACrB8E,EAAc7J,EAAM+E,SACpB3oC,EAASwtC,EAAYxtC,OACrB0tC,EAAejF,EAAOzoC,OAE1B,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIiwB,EAASod,GAAiBG,EAAY95B,GAAQ+5B,EAAY/5B,IAC9D,GAAIuc,EAAQ,CACV,GAAIvc,GAASg6B,EACX,OAAOzd,EAET,IAAI0d,EAAQlF,EAAO/0B,GACnB,OAAOuc,GAAmB,QAAT0d,GAAmB,EAAI,IAU5C,OAAO7b,EAAOpe,MAAQkwB,EAAMlwB,MAc9B,SAASk6B,GAAYve,EAAMwe,EAAUC,EAASC,GAC5C,IAAIC,GAAa,EACbC,EAAa5e,EAAKrvB,OAClBkuC,EAAgBJ,EAAQ9tC,OACxBmuC,GAAa,EACbC,EAAaP,EAAS7tC,OACtBquC,EAAcpW,GAAUgW,EAAaC,EAAe,GACpDje,EAAS3kB,EAAM8iC,EAAaC,GAC5BC,GAAeP,EAEnB,QAASI,EAAYC,EACnBne,EAAOke,GAAaN,EAASM,GAE/B,QAASH,EAAYE,GACfI,GAAeN,EAAYC,KAC7Bhe,EAAO6d,EAAQE,IAAc3e,EAAK2e,IAGtC,MAAOK,IACLpe,EAAOke,KAAe9e,EAAK2e,KAE7B,OAAO/d,EAcT,SAASse,GAAiBlf,EAAMwe,EAAUC,EAASC,GACjD,IAAIC,GAAa,EACbC,EAAa5e,EAAKrvB,OAClBwuC,GAAgB,EAChBN,EAAgBJ,EAAQ9tC,OACxByuC,GAAc,EACdC,EAAcb,EAAS7tC,OACvBquC,EAAcpW,GAAUgW,EAAaC,EAAe,GACpDje,EAAS3kB,EAAM+iC,EAAcK,GAC7BJ,GAAeP,EAEnB,QAASC,EAAYK,EACnBpe,EAAO+d,GAAa3e,EAAK2e,GAE3B,IAAIxd,EAASwd,EACb,QAASS,EAAaC,EACpBze,EAAOO,EAASie,GAAcZ,EAASY,GAEzC,QAASD,EAAeN,GAClBI,GAAeN,EAAYC,KAC7Bhe,EAAOO,EAASsd,EAAQU,IAAiBnf,EAAK2e,MAGlD,OAAO/d,EAWT,SAAS8K,GAAU9S,EAAQsH,GACzB,IAAI7b,GAAS,EACT1T,EAASioB,EAAOjoB,OAEpBuvB,IAAUA,EAAQjkB,EAAMtL,IACxB,QAAS0T,EAAQ1T,EACfuvB,EAAM7b,GAASuU,EAAOvU,GAExB,OAAO6b,EAaT,SAASgQ,GAAWtX,EAAQznB,EAAOsxB,EAAQoO,GACzC,IAAIyO,GAAS7c,EACbA,IAAWA,EAAS,IAEpB,IAAIpe,GAAS,EACT1T,EAASQ,EAAMR,OAEnB,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIya,EAAMja,EAAMkT,GAEZq0B,EAAW7H,EACXA,EAAWpO,EAAOrX,GAAMwN,EAAOxN,GAAMA,EAAKqX,EAAQ7J,GAClDtjB,EAEAojC,IAAapjC,IACfojC,EAAW9f,EAAOxN,IAEhBk0B,EACF1P,GAAgBnN,EAAQrX,EAAKstB,GAE7B7I,GAAYpN,EAAQrX,EAAKstB,GAG7B,OAAOjW,EAWT,SAAS+O,GAAY5Y,EAAQ6J,GAC3B,OAAOyN,GAAWtX,EAAQ2mB,GAAW3mB,GAAS6J,GAWhD,SAAS8O,GAAc3Y,EAAQ6J,GAC7B,OAAOyN,GAAWtX,EAAQ4mB,GAAa5mB,GAAS6J,GAWlD,SAASgd,GAAiBtf,EAAQuf,GAChC,OAAO,SAAS3d,EAAY3B,GAC1B,IAAIN,EAAO3W,GAAQ4Y,GAAc9B,GAAkB8P,GAC/C1P,EAAcqf,EAAcA,IAAgB,GAEhD,OAAO5f,EAAKiC,EAAY5B,EAAQkZ,GAAYjZ,EAAU,GAAIC,IAW9D,SAASsf,GAAeC,GACtB,OAAOxF,IAAS,SAAS3X,EAAQod,GAC/B,IAAIx7B,GAAS,EACT1T,EAASkvC,EAAQlvC,OACjBkgC,EAAalgC,EAAS,EAAIkvC,EAAQlvC,EAAS,GAAK2E,EAChDwqC,EAAQnvC,EAAS,EAAIkvC,EAAQ,GAAKvqC,EAEtCu7B,EAAc+O,EAASjvC,OAAS,GAA0B,mBAAdkgC,GACvClgC,IAAUkgC,GACXv7B,EAEAwqC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDjP,EAAalgC,EAAS,EAAI2E,EAAYu7B,EACtClgC,EAAS,GAEX8xB,EAAStrB,GAAOsrB,GAChB,QAASpe,EAAQ1T,EAAQ,CACvB,IAAIioB,EAASinB,EAAQx7B,GACjBuU,GACFgnB,EAASnd,EAAQ7J,EAAQvU,EAAOwsB,GAGpC,OAAOpO,KAYX,SAASgQ,GAAezQ,EAAUG,GAChC,OAAO,SAASJ,EAAY3B,GAC1B,GAAkB,MAAd2B,EACF,OAAOA,EAET,IAAKkW,GAAYlW,GACf,OAAOC,EAASD,EAAY3B,GAE9B,IAAIzvB,EAASoxB,EAAWpxB,OACpB0T,EAAQ8d,EAAYxxB,GAAU,EAC9BqvC,EAAW7oC,GAAO4qB,GAEtB,MAAQI,EAAY9d,MAAYA,EAAQ1T,EACtC,IAAmD,IAA/CyvB,EAAS4f,EAAS37B,GAAQA,EAAO27B,GACnC,MAGJ,OAAOje,GAWX,SAAS0R,GAActR,GACrB,OAAO,SAASM,EAAQrC,EAAUwR,GAChC,IAAIvtB,GAAS,EACT27B,EAAW7oC,GAAOsrB,GAClBtxB,EAAQygC,EAASnP,GACjB9xB,EAASQ,EAAMR,OAEnB,MAAOA,IAAU,CACf,IAAIya,EAAMja,EAAMgxB,EAAYxxB,IAAW0T,GACvC,IAA+C,IAA3C+b,EAAS4f,EAAS50B,GAAMA,EAAK40B,GAC/B,MAGJ,OAAOvd,GAcX,SAASwd,GAAWngB,EAAM8Q,EAAS7Q,GACjC,IAAImgB,EAAStP,EAAUjc,EACnBvP,EAAO+6B,GAAWrgB,GAEtB,SAASsgB,IACP,IAAIC,EAAM3uC,MAAQA,OAASkP,IAAQlP,gBAAgB0uC,EAAWh7B,EAAO0a,EACrE,OAAOugB,EAAGxgB,MAAMqgB,EAASngB,EAAUruB,KAAM4uC,WAE3C,OAAOF,EAUT,SAASG,GAAgBC,GACvB,OAAO,SAAS7e,GACdA,EAASxd,GAASwd,GAElB,IAAIgC,EAAaQ,GAAWxC,GACxBuD,GAAcvD,GACdrsB,EAEA4uB,EAAMP,EACNA,EAAW,GACXhC,EAAOyD,OAAO,GAEdqb,EAAW9c,EACXuZ,GAAUvZ,EAAY,GAAG1gB,KAAK,IAC9B0e,EAAOrd,MAAM,GAEjB,OAAO4f,EAAIsc,KAAgBC,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAAShf,GACd,OAAOP,GAAYwf,GAAMC,GAAOlf,GAAQ0B,QAAQpG,GAAQ,KAAM0jB,EAAU,KAY5E,SAASR,GAAW/6B,GAClB,OAAO,WAIL,IAAI4a,EAAOsgB,UACX,OAAQtgB,EAAKrvB,QACX,KAAK,EAAG,OAAO,IAAIyU,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK4a,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI5a,EAAK4a,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAI8gB,EAAcpW,GAAWtlB,EAAK2gB,WAC9BnF,EAASxb,EAAKya,MAAMihB,EAAa9gB,GAIrC,OAAO4K,GAAShK,GAAUA,EAASkgB,GAavC,SAASC,GAAYjhB,EAAM8Q,EAASoQ,GAClC,IAAI57B,EAAO+6B,GAAWrgB,GAEtB,SAASsgB,IACP,IAAIzvC,EAAS2vC,UAAU3vC,OACnBqvB,EAAO/jB,EAAMtL,GACb0T,EAAQ1T,EACRsc,EAAcg0B,GAAUb,GAE5B,MAAO/7B,IACL2b,EAAK3b,GAASi8B,UAAUj8B,GAE1B,IAAIo6B,EAAW9tC,EAAS,GAAKqvB,EAAK,KAAO/S,GAAe+S,EAAKrvB,EAAS,KAAOsc,EACzE,GACA2X,GAAe5E,EAAM/S,GAGzB,GADAtc,GAAU8tC,EAAQ9tC,OACdA,EAASqwC,EACX,OAAOE,GACLphB,EAAM8Q,EAASuQ,GAAcf,EAAQnzB,YAAa3X,EAClD0qB,EAAMye,EAASnpC,EAAWA,EAAW0rC,EAAQrwC,GAEjD,IAAI0vC,EAAM3uC,MAAQA,OAASkP,IAAQlP,gBAAgB0uC,EAAWh7B,EAAO0a,EACrE,OAAOD,GAAMwgB,EAAI3uC,KAAMsuB,GAEzB,OAAOogB,EAUT,SAASgB,GAAWC,GAClB,OAAO,SAAStf,EAAYtB,EAAWyB,GACrC,IAAI8d,EAAW7oC,GAAO4qB,GACtB,IAAKkW,GAAYlW,GAAa,CAC5B,IAAI3B,EAAWiZ,GAAY5Y,EAAW,GACtCsB,EAAa/e,GAAK+e,GAClBtB,EAAY,SAASrV,GAAO,OAAOgV,EAAS4f,EAAS50B,GAAMA,EAAK40B,IAElE,IAAI37B,EAAQg9B,EAActf,EAAYtB,EAAWyB,GACjD,OAAO7d,GAAS,EAAI27B,EAAS5f,EAAW2B,EAAW1d,GAASA,GAAS/O,GAWzE,SAASgsC,GAAWnf,GAClB,OAAOof,IAAS,SAASC,GACvB,IAAI7wC,EAAS6wC,EAAM7wC,OACf0T,EAAQ1T,EACR8wC,EAASjX,GAAczE,UAAU2b,KAEjCvf,GACFqf,EAAMrY,UAER,MAAO9kB,IAAS,CACd,IAAIyb,EAAO0hB,EAAMn9B,GACjB,GAAmB,mBAARyb,EACT,MAAM,IAAI+F,GAAU5R,GAEtB,GAAIwtB,IAAWrB,GAAgC,WAArBuB,GAAY7hB,GACpC,IAAIsgB,EAAU,IAAI5V,GAAc,IAAI,GAGxCnmB,EAAQ+7B,EAAU/7B,EAAQ1T,EAC1B,QAAS0T,EAAQ1T,EAAQ,CACvBmvB,EAAO0hB,EAAMn9B,GAEb,IAAIu9B,EAAWD,GAAY7hB,GACvB3vB,EAAmB,WAAZyxC,EAAwB/tB,GAAQiM,GAAQxqB,EAMjD8qC,EAJEjwC,GAAQ0xC,GAAW1xC,EAAK,KACtBA,EAAK,KAAO+kB,EAAgBJ,EAAkBE,EAAoBG,KACjEhlB,EAAK,GAAGQ,QAAqB,GAAXR,EAAK,GAElBiwC,EAAQuB,GAAYxxC,EAAK,KAAK0vB,MAAMugB,EAASjwC,EAAK,IAElC,GAAf2vB,EAAKnvB,QAAekxC,GAAW/hB,GACtCsgB,EAAQwB,KACRxB,EAAQsB,KAAK5hB,GAGrB,OAAO,WACL,IAAIE,EAAOsgB,UACP9tC,EAAQwtB,EAAK,GAEjB,GAAIogB,GAA0B,GAAfpgB,EAAKrvB,QAAewY,GAAQ3W,GACzC,OAAO4tC,EAAQ0B,MAAMtvC,GAAOA,QAE9B,IAAI6R,EAAQ,EACRuc,EAASjwB,EAAS6wC,EAAMn9B,GAAOwb,MAAMnuB,KAAMsuB,GAAQxtB,EAEvD,QAAS6R,EAAQ1T,EACfiwB,EAAS4gB,EAAMn9B,GAAOxR,KAAKnB,KAAMkvB,GAEnC,OAAOA,MAwBb,SAASugB,GAAarhB,EAAM8Q,EAAS7Q,EAASye,EAAUC,EAASsD,EAAeC,EAAcC,EAAQC,EAAKlB,GACzG,IAAImB,EAAQvR,EAAU1b,EAClBgrB,EAAStP,EAAUjc,EACnBytB,EAAYxR,EAAUhc,EACtB8pB,EAAY9N,GAAW9b,EAAkBC,GACzCstB,EAASzR,EAAUxb,EACnBhQ,EAAOg9B,EAAY9sC,EAAY6qC,GAAWrgB,GAE9C,SAASsgB,IACP,IAAIzvC,EAAS2vC,UAAU3vC,OACnBqvB,EAAO/jB,EAAMtL,GACb0T,EAAQ1T,EAEZ,MAAO0T,IACL2b,EAAK3b,GAASi8B,UAAUj8B,GAE1B,GAAIq6B,EACF,IAAIzxB,EAAcg0B,GAAUb,GACxBkC,EAAexe,GAAa9D,EAAM/S,GASxC,GAPIuxB,IACFxe,EAAOue,GAAYve,EAAMwe,EAAUC,EAASC,IAE1CqD,IACF/hB,EAAOkf,GAAiBlf,EAAM+hB,EAAeC,EAActD,IAE7D/tC,GAAU2xC,EACN5D,GAAa/tC,EAASqwC,EAAO,CAC/B,IAAIuB,EAAa3d,GAAe5E,EAAM/S,GACtC,OAAOi0B,GACLphB,EAAM8Q,EAASuQ,GAAcf,EAAQnzB,YAAa8S,EAClDC,EAAMuiB,EAAYN,EAAQC,EAAKlB,EAAQrwC,GAG3C,IAAImwC,EAAcZ,EAASngB,EAAUruB,KACjC2uC,EAAK+B,EAAYtB,EAAYhhB,GAAQA,EAczC,OAZAnvB,EAASqvB,EAAKrvB,OACVsxC,EACFjiB,EAAOwiB,GAAQxiB,EAAMiiB,GACZI,GAAU1xC,EAAS,GAC5BqvB,EAAKmJ,UAEHgZ,GAASD,EAAMvxC,IACjBqvB,EAAKrvB,OAASuxC,GAEZxwC,MAAQA,OAASkP,IAAQlP,gBAAgB0uC,IAC3CC,EAAKj7B,GAAQ+6B,GAAWE,IAEnBA,EAAGxgB,MAAMihB,EAAa9gB,GAE/B,OAAOogB,EAWT,SAASqC,GAAetiB,EAAQuiB,GAC9B,OAAO,SAASjgB,EAAQrC,GACtB,OAAO+U,GAAa1S,EAAQtC,EAAQuiB,EAAWtiB,GAAW,KAY9D,SAASuiB,GAAoBC,EAAUC,GACrC,OAAO,SAASrwC,EAAO+hC,GACrB,IAAI3T,EACJ,GAAIpuB,IAAU8C,GAAai/B,IAAUj/B,EACnC,OAAOutC,EAKT,GAHIrwC,IAAU8C,IACZsrB,EAASpuB,GAEP+hC,IAAUj/B,EAAW,CACvB,GAAIsrB,IAAWtrB,EACb,OAAOi/B,EAEW,iBAAT/hC,GAAqC,iBAAT+hC,GACrC/hC,EAAQypC,GAAazpC,GACrB+hC,EAAQ0H,GAAa1H,KAErB/hC,EAAQwpC,GAAaxpC,GACrB+hC,EAAQyH,GAAazH,IAEvB3T,EAASgiB,EAASpwC,EAAO+hC,GAE3B,OAAO3T,GAWX,SAASkiB,GAAWC,GAClB,OAAOxB,IAAS,SAASpV,GAEvB,OADAA,EAAYlL,GAASkL,EAAW7I,GAAU+V,OACnCe,IAAS,SAASpa,GACvB,IAAID,EAAUruB,KACd,OAAOqxC,EAAU5W,GAAW,SAAS/L,GACnC,OAAOP,GAAMO,EAAUL,EAASC,YAexC,SAASgjB,GAAcryC,EAAQsyC,GAC7BA,EAAQA,IAAU3tC,EAAY,IAAM2mC,GAAagH,GAEjD,IAAIC,EAAcD,EAAMtyC,OACxB,GAAIuyC,EAAc,EAChB,OAAOA,EAAc/I,GAAW8I,EAAOtyC,GAAUsyC,EAEnD,IAAIriB,EAASuZ,GAAW8I,EAAOjb,GAAWr3B,EAASq0B,GAAWie,KAC9D,OAAO9e,GAAW8e,GACd/F,GAAUhY,GAActE,GAAS,EAAGjwB,GAAQsS,KAAK,IACjD2d,EAAOtc,MAAM,EAAG3T,GAetB,SAASwyC,GAAcrjB,EAAM8Q,EAAS7Q,EAASye,GAC7C,IAAI0B,EAAStP,EAAUjc,EACnBvP,EAAO+6B,GAAWrgB,GAEtB,SAASsgB,IACP,IAAIzB,GAAa,EACbC,EAAa0B,UAAU3vC,OACvBmuC,GAAa,EACbC,EAAaP,EAAS7tC,OACtBqvB,EAAO/jB,EAAM8iC,EAAaH,GAC1ByB,EAAM3uC,MAAQA,OAASkP,IAAQlP,gBAAgB0uC,EAAWh7B,EAAO0a,EAErE,QAASgf,EAAYC,EACnB/e,EAAK8e,GAAaN,EAASM,GAE7B,MAAOF,IACL5e,EAAK8e,KAAewB,YAAY3B,GAElC,OAAO9e,GAAMwgB,EAAIH,EAASngB,EAAUruB,KAAMsuB,GAE5C,OAAOogB,EAUT,SAASgD,GAAYjhB,GACnB,OAAO,SAASte,EAAO9G,EAAKm9B,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB6F,GAAel8B,EAAO9G,EAAKm9B,KAChEn9B,EAAMm9B,EAAO5kC,GAGfuO,EAAQw/B,GAASx/B,GACb9G,IAAQzH,GACVyH,EAAM8G,EACNA,EAAQ,GAER9G,EAAMsmC,GAAStmC,GAEjBm9B,EAAOA,IAAS5kC,EAAauO,EAAQ9G,EAAM,GAAK,EAAKsmC,GAASnJ,GACvDD,GAAUp2B,EAAO9G,EAAKm9B,EAAM/X,IAWvC,SAASmhB,GAA0BV,GACjC,OAAO,SAASpwC,EAAO+hC,GAKrB,MAJsB,iBAAT/hC,GAAqC,iBAAT+hC,IACvC/hC,EAAQ+wC,GAAS/wC,GACjB+hC,EAAQgP,GAAShP,IAEZqO,EAASpwC,EAAO+hC,IAqB3B,SAAS2M,GAAcphB,EAAM8Q,EAAS4S,EAAUv2B,EAAa8S,EAASye,EAAUC,EAASwD,EAAQC,EAAKlB,GACpG,IAAIyC,EAAU7S,EAAU9b,EACpBytB,EAAakB,EAAUhF,EAAUnpC,EACjCouC,EAAkBD,EAAUnuC,EAAYmpC,EACxCkF,EAAcF,EAAUjF,EAAWlpC,EACnCsuC,EAAmBH,EAAUnuC,EAAYkpC,EAE7C5N,GAAY6S,EAAUzuB,EAAoBC,EAC1C2b,KAAa6S,EAAUxuB,EAA0BD,GAE3C4b,EAAU/b,IACd+b,KAAajc,EAAiBC,IAEhC,IAAIivB,EAAU,CACZ/jB,EAAM8Q,EAAS7Q,EAAS4jB,EAAapB,EAAYqB,EACjDF,EAAiBzB,EAAQC,EAAKlB,GAG5BpgB,EAAS4iB,EAAS3jB,MAAMvqB,EAAWuuC,GAKvC,OAJIhC,GAAW/hB,IACbvN,GAAQqO,EAAQijB,GAElBjjB,EAAO3T,YAAcA,EACd62B,GAAgBljB,EAAQd,EAAM8Q,GAUvC,SAASmT,GAAYvD,GACnB,IAAI1gB,EAAOhoB,GAAK0oC,GAChB,OAAO,SAAShQ,EAAQwT,GAGtB,GAFAxT,EAAS+S,GAAS/S,GAClBwT,EAAyB,MAAbA,EAAoB,EAAInb,GAAUoK,GAAU+Q,GAAY,KAChEA,GAAaxb,GAAegI,GAAS,CAGvC,IAAIyT,GAAQ9/B,GAASqsB,GAAU,KAAKtnB,MAAM,KACtC1W,EAAQstB,EAAKmkB,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAG7C,OADAC,GAAQ9/B,GAAS3R,GAAS,KAAK0W,MAAM,OAC5B+6B,EAAK,GAAK,MAAQA,EAAK,GAAKD,IAEvC,OAAOlkB,EAAK0Q,IAWhB,IAAI2L,GAAc7S,IAAQ,EAAIzE,GAAW,IAAIyE,GAAI,CAAC,EAAE,KAAK,IAAO1T,EAAmB,SAASlL,GAC1F,OAAO,IAAI4e,GAAI5e,IAD2Dw5B,GAW5E,SAASC,GAAcvS,GACrB,OAAO,SAASnP,GACd,IAAInwB,EAAM6+B,GAAO1O,GACjB,OAAInwB,GAAOukB,EACF4N,GAAWhC,GAEhBnwB,GAAO8kB,GACF0N,GAAWrC,GAEbS,GAAYT,EAAQmP,EAASnP,KA6BxC,SAAS2hB,GAAWtkB,EAAM8Q,EAAS7Q,EAASye,EAAUC,EAASwD,EAAQC,EAAKlB,GAC1E,IAAIoB,EAAYxR,EAAUhc,EAC1B,IAAKwtB,GAA4B,mBAARtiB,EACvB,MAAM,IAAI+F,GAAU5R,GAEtB,IAAItjB,EAAS6tC,EAAWA,EAAS7tC,OAAS,EAS1C,GARKA,IACHigC,KAAa5b,EAAoBC,GACjCupB,EAAWC,EAAUnpC,GAEvB4sC,EAAMA,IAAQ5sC,EAAY4sC,EAAMtZ,GAAUqK,GAAUiP,GAAM,GAC1DlB,EAAQA,IAAU1rC,EAAY0rC,EAAQ/N,GAAU+N,GAChDrwC,GAAU8tC,EAAUA,EAAQ9tC,OAAS,EAEjCigC,EAAU3b,EAAyB,CACrC,IAAI8sB,EAAgBvD,EAChBwD,EAAevD,EAEnBD,EAAWC,EAAUnpC,EAEvB,IAAInF,EAAOiyC,EAAY9sC,EAAYue,GAAQiM,GAEvC+jB,EAAU,CACZ/jB,EAAM8Q,EAAS7Q,EAASye,EAAUC,EAASsD,EAAeC,EAC1DC,EAAQC,EAAKlB,GAkBf,GAfI7wC,GACFsR,GAAUoiC,EAAS1zC,GAErB2vB,EAAO+jB,EAAQ,GACfjT,EAAUiT,EAAQ,GAClB9jB,EAAU8jB,EAAQ,GAClBrF,EAAWqF,EAAQ,GACnBpF,EAAUoF,EAAQ,GAClB7C,EAAQ6C,EAAQ,GAAKA,EAAQ,KAAOvuC,EAC/B8sC,EAAY,EAAItiB,EAAKnvB,OACtBi4B,GAAUib,EAAQ,GAAKlzC,EAAQ,IAE9BqwC,GAASpQ,GAAW9b,EAAkBC,KACzC6b,KAAa9b,EAAkBC,IAE5B6b,GAAWA,GAAWjc,EAGzBiM,EADSgQ,GAAW9b,GAAmB8b,GAAW7b,EACzCgsB,GAAYjhB,EAAM8Q,EAASoQ,GAC1BpQ,GAAW5b,GAAqB4b,IAAYjc,EAAiBK,IAAwBypB,EAAQ9tC,OAG9FwwC,GAAathB,MAAMvqB,EAAWuuC,GAF9BV,GAAcrjB,EAAM8Q,EAAS7Q,EAASye,QAJ/C,IAAI5d,EAASqf,GAAWngB,EAAM8Q,EAAS7Q,GAQzC,IAAII,EAAShwB,EAAOuqC,GAAcnoB,GAClC,OAAOuxB,GAAgB3jB,EAAOS,EAAQijB,GAAU/jB,EAAM8Q,GAexD,SAASyT,GAAuBvU,EAAU+G,EAAUzrB,EAAKqX,GACvD,OAAIqN,IAAax6B,GACZq6B,GAAGG,EAAU7J,GAAY7a,MAAUzX,GAAed,KAAK4vB,EAAQrX,GAC3DyrB,EAEF/G,EAiBT,SAASwU,GAAoBxU,EAAU+G,EAAUzrB,EAAKqX,EAAQ7J,EAAQkY,GAOpE,OANIlG,GAASkF,IAAalF,GAASiM,KAEjC/F,EAAMtmB,IAAIqsB,EAAU/G,GACpByI,GAAUzI,EAAU+G,EAAUvhC,EAAWgvC,GAAqBxT,GAC9DA,EAAM,UAAU+F,IAEX/G,EAYT,SAASyU,GAAgB/xC,GACvB,OAAOwmC,GAAcxmC,GAAS8C,EAAY9C,EAgB5C,SAAS0jC,GAAYhW,EAAOqU,EAAO3D,EAASC,EAAY6E,EAAW5E,GACjE,IAAI0T,EAAY5T,EAAUnc,EACtBuX,EAAY9L,EAAMvvB,OAClBkkC,EAAYN,EAAM5jC,OAEtB,GAAIq7B,GAAa6I,KAAe2P,GAAa3P,EAAY7I,GACvD,OAAO,EAGT,IAAIyY,EAAa3T,EAAMvgB,IAAI2P,GACvBwkB,EAAa5T,EAAMvgB,IAAIgkB,GAC3B,GAAIkQ,GAAcC,EAChB,OAAOD,GAAclQ,GAASmQ,GAAcxkB,EAE9C,IAAI7b,GAAS,EACTuc,GAAS,EACTsU,EAAQtE,EAAUlc,EAA0B,IAAIwZ,GAAW54B,EAE/Dw7B,EAAMtmB,IAAI0V,EAAOqU,GACjBzD,EAAMtmB,IAAI+pB,EAAOrU,GAGjB,QAAS7b,EAAQ2nB,EAAW,CAC1B,IAAI2Y,EAAWzkB,EAAM7b,GACjBugC,EAAWrQ,EAAMlwB,GAErB,GAAIwsB,EACF,IAAIgU,EAAWL,EACX3T,EAAW+T,EAAUD,EAAUtgC,EAAOkwB,EAAOrU,EAAO4Q,GACpDD,EAAW8T,EAAUC,EAAUvgC,EAAO6b,EAAOqU,EAAOzD,GAE1D,GAAI+T,IAAavvC,EAAW,CAC1B,GAAIuvC,EACF,SAEFjkB,GAAS,EACT,MAGF,GAAIsU,GACF,IAAK3T,GAAUgT,GAAO,SAASqQ,EAAU9P,GACnC,IAAKtR,GAAS0R,EAAMJ,KACf6P,IAAaC,GAAYlP,EAAUiP,EAAUC,EAAUhU,EAASC,EAAYC,IAC/E,OAAOoE,EAAK9gC,KAAK0gC,MAEjB,CACNlU,GAAS,EACT,YAEG,GACD+jB,IAAaC,IACXlP,EAAUiP,EAAUC,EAAUhU,EAASC,EAAYC,GACpD,CACLlQ,GAAS,EACT,OAKJ,OAFAkQ,EAAM,UAAU5Q,GAChB4Q,EAAM,UAAUyD,GACT3T,EAoBT,SAASuV,GAAW1T,EAAQ8R,EAAOjiC,EAAKs+B,EAASC,EAAY6E,EAAW5E,GACtE,OAAQx+B,GACN,KAAKqlB,GACH,GAAK8K,EAAO8a,YAAchJ,EAAMgJ,YAC3B9a,EAAOib,YAAcnJ,EAAMmJ,WAC9B,OAAO,EAETjb,EAASA,EAAO0a,OAChB5I,EAAQA,EAAM4I,OAEhB,KAAKzlB,GACH,QAAK+K,EAAO8a,YAAchJ,EAAMgJ,aAC3B7H,EAAU,IAAI3O,GAAWtE,GAAS,IAAIsE,GAAWwN,KAKxD,KAAKhe,EACL,KAAKC,EACL,KAAKM,GAGH,OAAO6Y,IAAIlN,GAAS8R,GAEtB,KAAK7d,EACH,OAAO+L,EAAO1yB,MAAQwkC,EAAMxkC,MAAQ0yB,EAAOqiB,SAAWvQ,EAAMuQ,QAE9D,KAAK3tB,GACL,KAAKE,GAIH,OAAOoL,GAAW8R,EAAQ,GAE5B,KAAK1d,EACH,IAAIkuB,EAAUtgB,GAEhB,KAAKrN,GACH,IAAIotB,EAAY5T,EAAUnc,EAG1B,GAFAswB,IAAYA,EAAUlgB,IAElBpC,EAAO9tB,MAAQ4/B,EAAM5/B,OAAS6vC,EAChC,OAAO,EAGT,IAAI9S,EAAUZ,EAAMvgB,IAAIkS,GACxB,GAAIiP,EACF,OAAOA,GAAW6C,EAEpB3D,GAAWlc,EAGXoc,EAAMtmB,IAAIiY,EAAQ8R,GAClB,IAAI3T,EAASsV,GAAY6O,EAAQtiB,GAASsiB,EAAQxQ,GAAQ3D,EAASC,EAAY6E,EAAW5E,GAE1F,OADAA,EAAM,UAAUrO,GACT7B,EAET,KAAKtJ,GACH,GAAI4S,GACF,OAAOA,GAAcr3B,KAAK4vB,IAAWyH,GAAcr3B,KAAK0hC,GAG9D,OAAO,EAgBT,SAASiC,GAAa/T,EAAQ8R,EAAO3D,EAASC,EAAY6E,EAAW5E,GACnE,IAAI0T,EAAY5T,EAAUnc,EACtBuwB,EAAWlT,GAAWrP,GACtBwiB,EAAYD,EAASr0C,OACrBu0C,EAAWpT,GAAWyC,GACtBM,EAAYqQ,EAASv0C,OAEzB,GAAIs0C,GAAapQ,IAAc2P,EAC7B,OAAO,EAET,IAAIngC,EAAQ4gC,EACZ,MAAO5gC,IAAS,CACd,IAAI+G,EAAM45B,EAAS3gC,GACnB,KAAMmgC,EAAYp5B,KAAOmpB,EAAQ5gC,GAAed,KAAK0hC,EAAOnpB,IAC1D,OAAO,EAIX,IAAI+5B,EAAarU,EAAMvgB,IAAIkS,GACvBiiB,EAAa5T,EAAMvgB,IAAIgkB,GAC3B,GAAI4Q,GAAcT,EAChB,OAAOS,GAAc5Q,GAASmQ,GAAcjiB,EAE9C,IAAI7B,GAAS,EACbkQ,EAAMtmB,IAAIiY,EAAQ8R,GAClBzD,EAAMtmB,IAAI+pB,EAAO9R,GAEjB,IAAI2iB,EAAWZ,EACf,QAASngC,EAAQ4gC,EAAW,CAC1B75B,EAAM45B,EAAS3gC,GACf,IAAIyrB,EAAWrN,EAAOrX,GAClBw5B,EAAWrQ,EAAMnpB,GAErB,GAAIylB,EACF,IAAIgU,EAAWL,EACX3T,EAAW+T,EAAU9U,EAAU1kB,EAAKmpB,EAAO9R,EAAQqO,GACnDD,EAAWf,EAAU8U,EAAUx5B,EAAKqX,EAAQ8R,EAAOzD,GAGzD,KAAM+T,IAAavvC,EACVw6B,IAAa8U,GAAYlP,EAAU5F,EAAU8U,EAAUhU,EAASC,EAAYC,GAC7E+T,GACD,CACLjkB,GAAS,EACT,MAEFwkB,IAAaA,EAAkB,eAAPh6B,GAE1B,GAAIwV,IAAWwkB,EAAU,CACvB,IAAIC,EAAU5iB,EAAO+P,YACjB8S,EAAU/Q,EAAM/B,YAGhB6S,GAAWC,KACV,gBAAiB7iB,MAAU,gBAAiB8R,IACzB,mBAAX8Q,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD1kB,GAAS,GAKb,OAFAkQ,EAAM,UAAUrO,GAChBqO,EAAM,UAAUyD,GACT3T,EAUT,SAAS2gB,GAASzhB,GAChB,OAAOua,GAAYC,GAASxa,EAAMxqB,EAAWiwC,IAAUzlB,EAAO,IAUhE,SAASgS,GAAWrP,GAClB,OAAOwR,GAAexR,EAAQzf,GAAMu8B,IAWtC,SAAS1N,GAAapP,GACpB,OAAOwR,GAAexR,EAAQ2N,GAAQoP,IAUxC,IAAI3rB,GAAW4V,GAAiB,SAAS3J,GACvC,OAAO2J,GAAQlZ,IAAIuP,IADIokB,GAWzB,SAASvC,GAAY7hB,GACnB,IAAIc,EAAUd,EAAK/vB,KAAO,GACtBmwB,EAAQwJ,GAAU9I,GAClBjwB,EAASgD,GAAed,KAAK62B,GAAW9I,GAAUV,EAAMvvB,OAAS,EAErE,MAAOA,IAAU,CACf,IAAIR,EAAO+vB,EAAMvvB,GACb60C,EAAYr1C,EAAK2vB,KACrB,GAAiB,MAAb0lB,GAAqBA,GAAa1lB,EACpC,OAAO3vB,EAAKJ,KAGhB,OAAO6wB,EAUT,SAASqgB,GAAUnhB,GACjB,IAAI2C,EAAS9uB,GAAed,KAAKw3B,GAAQ,eAAiBA,GAASvK,EACnE,OAAO2C,EAAOxV,YAchB,SAASosB,KACP,IAAIzY,EAASyJ,GAAOjK,UAAYA,GAEhC,OADAQ,EAASA,IAAWR,GAAWiX,GAAezW,EACvC0f,UAAU3vC,OAASiwB,EAAO0f,UAAU,GAAIA,UAAU,IAAM1f,EAWjE,SAASkN,GAAWlrB,EAAKwI,GACvB,IAAIjb,EAAOyS,EAAIkqB,SACf,OAAO2Y,GAAUr6B,GACbjb,EAAmB,iBAAPib,EAAkB,SAAW,QACzCjb,EAAKyS,IAUX,SAASs1B,GAAazV,GACpB,IAAI7B,EAAS5d,GAAKyf,GACd9xB,EAASiwB,EAAOjwB,OAEpB,MAAOA,IAAU,CACf,IAAIya,EAAMwV,EAAOjwB,GACb6B,EAAQiwB,EAAOrX,GAEnBwV,EAAOjwB,GAAU,CAACya,EAAK5Y,EAAO6lC,GAAmB7lC,IAEnD,OAAOouB,EAWT,SAASgH,GAAUnF,EAAQrX,GACzB,IAAI5Y,EAAQsQ,GAAS2f,EAAQrX,GAC7B,OAAO0rB,GAAatkC,GAASA,EAAQ8C,EAUvC,SAAS8+B,GAAU5hC,GACjB,IAAIkzC,EAAQ/xC,GAAed,KAAKL,EAAOi1B,IACnCn1B,EAAME,EAAMi1B,IAEhB,IACEj1B,EAAMi1B,IAAkBnyB,EACxB,IAAIqwC,GAAW,EACf,MAAO5xC,IAET,IAAI6sB,EAAS6F,GAAqB5zB,KAAKL,GAQvC,OAPImzC,IACED,EACFlzC,EAAMi1B,IAAkBn1B,SAEjBE,EAAMi1B,KAGV7G,EAUT,IAAI2e,GAAcnX,GAA+B,SAAS3F,GACxD,OAAc,MAAVA,EACK,IAETA,EAAStrB,GAAOsrB,GACT/B,GAAY0H,GAAiB3F,IAAS,SAASqb,GACpD,OAAOzW,GAAqBx0B,KAAK4vB,EAAQqb,QANR8H,GAiBjCpG,GAAgBpX,GAA+B,SAAS3F,GAC1D,IAAI7B,EAAS,GACb,MAAO6B,EACLvB,GAAUN,EAAQ2e,GAAW9c,IAC7BA,EAASwE,GAAaxE,GAExB,OAAO7B,GAN8BglB,GAgBnCzU,GAASgD,GAoCb,SAASjI,GAAQroB,EAAO9G,EAAK8oC,GAC3B,IAAIxhC,GAAS,EACT1T,EAASk1C,EAAWl1C,OAExB,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIR,EAAO01C,EAAWxhC,GAClB1P,EAAOxE,EAAKwE,KAEhB,OAAQxE,EAAKkB,MACX,IAAK,OAAawS,GAASlP,EAAM,MACjC,IAAK,YAAaoI,GAAOpI,EAAM,MAC/B,IAAK,OAAaoI,EAAM8rB,GAAU9rB,EAAK8G,EAAQlP,GAAO,MACtD,IAAK,YAAakP,EAAQ+kB,GAAU/kB,EAAO9G,EAAMpI,GAAO,OAG5D,MAAO,CAAE,MAASkP,EAAO,IAAO9G,GAUlC,SAAS+oC,GAAeltB,GACtB,IAAIiJ,EAAQjJ,EAAOiJ,MAAMpI,IACzB,OAAOoI,EAAQA,EAAM,GAAG3Y,MAAMwQ,IAAkB,GAYlD,SAASqsB,GAAQtjB,EAAQqR,EAAMkS,GAC7BlS,EAAOC,GAASD,EAAMrR,GAEtB,IAAIpe,GAAS,EACT1T,EAASmjC,EAAKnjC,OACdiwB,GAAS,EAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAIya,EAAM4oB,GAAMF,EAAKzvB,IACrB,KAAMuc,EAAmB,MAAV6B,GAAkBujB,EAAQvjB,EAAQrX,IAC/C,MAEFqX,EAASA,EAAOrX,GAElB,OAAIwV,KAAYvc,GAAS1T,EAChBiwB,GAETjwB,EAAmB,MAAV8xB,EAAiB,EAAIA,EAAO9xB,SAC5BA,GAAUymC,GAASzmC,IAAWw+B,GAAQ/jB,EAAKza,KACjDwY,GAAQsZ,IAAWsM,GAAYtM,KAUpC,SAASyO,GAAehR,GACtB,IAAIvvB,EAASuvB,EAAMvvB,OACfiwB,EAAS,IAAIV,EAAMsS,YAAY7hC,GAOnC,OAJIA,GAA6B,iBAAZuvB,EAAM,IAAkBvsB,GAAed,KAAKqtB,EAAO,WACtEU,EAAOvc,MAAQ6b,EAAM7b,MACrBuc,EAAOlf,MAAQwe,EAAMxe,OAEhBkf,EAUT,SAAS0Q,GAAgB7O,GACvB,MAAqC,mBAAtBA,EAAO+P,aAA8BmF,GAAYlV,GAE5D,GADAiI,GAAWzD,GAAaxE,IAgB9B,SAASgP,GAAehP,EAAQnwB,EAAKy+B,GACnC,IAAI3rB,EAAOqd,EAAO+P,YAClB,OAAQlgC,GACN,KAAKolB,GACH,OAAO2lB,GAAiB5a,GAE1B,KAAKlM,EACL,KAAKC,EACH,OAAO,IAAIpR,GAAMqd,GAEnB,KAAK9K,GACH,OAAO6lB,GAAc/a,EAAQsO,GAE/B,KAAKnZ,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAO2gB,GAAgBtW,EAAQsO,GAEjC,KAAKla,EACH,OAAO,IAAIzR,EAEb,KAAK0R,GACL,KAAKO,GACH,OAAO,IAAIjS,EAAKqd,GAElB,KAAKtL,GACH,OAAOwmB,GAAYlb,GAErB,KAAKrL,GACH,OAAO,IAAIhS,EAEb,KAAKkS,GACH,OAAOumB,GAAYpb,IAYzB,SAASwjB,GAAkBrtB,EAAQstB,GACjC,IAAIv1C,EAASu1C,EAAQv1C,OACrB,IAAKA,EACH,OAAOioB,EAET,IAAIhH,EAAYjhB,EAAS,EAGzB,OAFAu1C,EAAQt0B,IAAcjhB,EAAS,EAAI,KAAO,IAAMu1C,EAAQt0B,GACxDs0B,EAAUA,EAAQjjC,KAAKtS,EAAS,EAAI,KAAO,KACpCioB,EAAOyK,QAAQ7J,GAAe,uBAAyB0sB,EAAU,UAU1E,SAAS3S,GAAc/gC,GACrB,OAAO2W,GAAQ3W,IAAUu8B,GAAYv8B,OAChC80B,IAAoB90B,GAASA,EAAM80B,KAW1C,SAAS6H,GAAQ38B,EAAO7B,GACtB,IAAIU,SAAcmB,EAGlB,OAFA7B,EAAmB,MAAVA,EAAiBklB,EAAmBllB,IAEpCA,IACE,UAARU,GACU,UAARA,GAAoB+oB,GAASgK,KAAK5xB,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ7B,EAajD,SAASovC,GAAevtC,EAAO6R,EAAOoe,GACpC,IAAKmI,GAASnI,GACZ,OAAO,EAET,IAAIpxB,SAAcgT,EAClB,SAAY,UAARhT,EACK4mC,GAAYxV,IAAW0M,GAAQ9qB,EAAOoe,EAAO9xB,QACrC,UAARU,GAAoBgT,KAASoe,IAE7BkN,GAAGlN,EAAOpe,GAAQ7R,GAa7B,SAAS4lC,GAAM5lC,EAAOiwB,GACpB,GAAItZ,GAAQ3W,GACV,OAAO,EAET,IAAInB,SAAcmB,EAClB,QAAY,UAARnB,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATmB,IAAiBugC,GAASvgC,MAGvB0mB,GAAckL,KAAK5xB,KAAWymB,GAAamL,KAAK5xB,IAC1C,MAAViwB,GAAkBjwB,KAAS2E,GAAOsrB,IAUvC,SAASgjB,GAAUjzC,GACjB,IAAInB,SAAcmB,EAClB,MAAgB,UAARnB,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVmB,EACU,OAAVA,EAWP,SAASqvC,GAAW/hB,GAClB,IAAI8hB,EAAWD,GAAY7hB,GACvByU,EAAQlK,GAAOuX,GAEnB,GAAoB,mBAATrN,KAAyBqN,KAAYrX,GAAYxE,WAC1D,OAAO,EAET,GAAIjG,IAASyU,EACX,OAAO,EAET,IAAIpkC,EAAO0jB,GAAQ0gB,GACnB,QAASpkC,GAAQ2vB,IAAS3vB,EAAK,GAUjC,SAAS4mC,GAASjX,GAChB,QAASuG,IAAeA,MAAcvG,GAxTnCsJ,IAAY+H,GAAO,IAAI/H,GAAS,IAAI+c,YAAY,MAAQxuB,IACxDpN,IAAO4mB,GAAO,IAAI5mB,KAAQsM,GAC1BwS,IAAW8H,GAAO9H,GAAQ+c,YAAcnvB,IACxCqS,IAAO6H,GAAO,IAAI7H,KAAQlS,IAC1BmS,IAAW4H,GAAO,IAAI5H,KAAY/R,MACrC2Z,GAAS,SAAS3+B,GAChB,IAAIouB,EAASuT,GAAW3hC,GACpB4S,EAAOwb,GAAU5J,GAAYxkB,EAAMggC,YAAcl9B,EACjD+wC,EAAajhC,EAAOwkB,GAASxkB,GAAQ,GAEzC,GAAIihC,EACF,OAAQA,GACN,KAAK1c,GAAoB,OAAOhS,GAChC,KAAKkS,GAAe,OAAOhT,EAC3B,KAAKiT,GAAmB,OAAO7S,GAC/B,KAAK8S,GAAe,OAAO3S,GAC3B,KAAK4S,GAAmB,OAAOxS,GAGnC,OAAOoJ,IA+SX,IAAI0lB,GAAapgB,GAAa0N,GAAa2S,GAS3C,SAAS5O,GAAYnlC,GACnB,IAAI4S,EAAO5S,GAASA,EAAMggC,YACtB7H,EAAwB,mBAARvlB,GAAsBA,EAAK2gB,WAAcE,GAE7D,OAAOzzB,IAAUm4B,EAWnB,SAAS0N,GAAmB7lC,GAC1B,OAAOA,IAAUA,IAAUo4B,GAASp4B,GAYtC,SAAS2lC,GAAwB/sB,EAAKyrB,GACpC,OAAO,SAASpU,GACd,OAAc,MAAVA,IAGGA,EAAOrX,KAASyrB,IACpBA,IAAavhC,GAAc8V,KAAOjU,GAAOsrB,MAYhD,SAAS+jB,GAAc1mB,GACrB,IAAIc,EAAS6lB,GAAQ3mB,GAAM,SAAS1U,GAIlC,OAHIqY,EAAM9uB,OAASyf,GACjBqP,EAAMkJ,QAEDvhB,KAGLqY,EAAQ7C,EAAO6C,MACnB,OAAO7C,EAmBT,SAASnf,GAAUtR,EAAMyoB,GACvB,IAAIgY,EAAUzgC,EAAK,GACfu2C,EAAa9tB,EAAO,GACpB+tB,EAAa/V,EAAU8V,EACvBtU,EAAWuU,GAAchyB,EAAiBC,EAAqBM,GAE/D0xB,EACAF,GAAcxxB,GAAmB0b,GAAW9b,GAC5C4xB,GAAcxxB,GAAmB0b,GAAWzb,GAAqBhlB,EAAK,GAAGQ,QAAUioB,EAAO,IAC1F8tB,IAAexxB,EAAgBC,IAAsByD,EAAO,GAAGjoB,QAAUioB,EAAO,IAAQgY,GAAW9b,EAGvG,IAAMsd,IAAYwU,EAChB,OAAOz2C,EAGLu2C,EAAa/xB,IACfxkB,EAAK,GAAKyoB,EAAO,GAEjB+tB,GAAc/V,EAAUjc,EAAiB,EAAIE,GAG/C,IAAIriB,EAAQomB,EAAO,GACnB,GAAIpmB,EAAO,CACT,IAAIgsC,EAAWruC,EAAK,GACpBA,EAAK,GAAKquC,EAAWD,GAAYC,EAAUhsC,EAAOomB,EAAO,IAAMpmB,EAC/DrC,EAAK,GAAKquC,EAAW5Z,GAAez0B,EAAK,GAAIkkB,GAAeuE,EAAO,GA0BrE,OAvBApmB,EAAQomB,EAAO,GACXpmB,IACFgsC,EAAWruC,EAAK,GAChBA,EAAK,GAAKquC,EAAWU,GAAiBV,EAAUhsC,EAAOomB,EAAO,IAAMpmB,EACpErC,EAAK,GAAKquC,EAAW5Z,GAAez0B,EAAK,GAAIkkB,GAAeuE,EAAO,IAGrEpmB,EAAQomB,EAAO,GACXpmB,IACFrC,EAAK,GAAKqC,GAGRk0C,EAAaxxB,IACf/kB,EAAK,GAAgB,MAAXA,EAAK,GAAayoB,EAAO,GAAKiQ,GAAU14B,EAAK,GAAIyoB,EAAO,KAGrD,MAAXzoB,EAAK,KACPA,EAAK,GAAKyoB,EAAO,IAGnBzoB,EAAK,GAAKyoB,EAAO,GACjBzoB,EAAK,GAAKw2C,EAEHx2C,EAYT,SAAS0nC,GAAapV,GACpB,IAAI7B,EAAS,GACb,GAAc,MAAV6B,EACF,IAAK,IAAIrX,KAAOjU,GAAOsrB,GACrB7B,EAAOxsB,KAAKgX,GAGhB,OAAOwV,EAUT,SAASyT,GAAe7hC,GACtB,OAAOi0B,GAAqB5zB,KAAKL,GAYnC,SAAS8nC,GAASxa,EAAMjc,EAAO8gB,GAE7B,OADA9gB,EAAQ+kB,GAAU/kB,IAAUvO,EAAawqB,EAAKnvB,OAAS,EAAKkT,EAAO,GAC5D,WACL,IAAImc,EAAOsgB,UACPj8B,GAAS,EACT1T,EAASi4B,GAAU5I,EAAKrvB,OAASkT,EAAO,GACxCqc,EAAQjkB,EAAMtL,GAElB,QAAS0T,EAAQ1T,EACfuvB,EAAM7b,GAAS2b,EAAKnc,EAAQQ,GAE9BA,GAAS,EACT,IAAIwiC,EAAY5qC,EAAM4H,EAAQ,GAC9B,QAASQ,EAAQR,EACfgjC,EAAUxiC,GAAS2b,EAAK3b,GAG1B,OADAwiC,EAAUhjC,GAAS8gB,EAAUzE,GACtBL,GAAMC,EAAMpuB,KAAMm1C,IAY7B,SAASjiC,GAAO6d,EAAQqR,GACtB,OAAOA,EAAKnjC,OAAS,EAAI8xB,EAASoR,GAAQpR,EAAQqY,GAAUhH,EAAM,GAAI,IAaxE,SAAS0O,GAAQtiB,EAAO4Z,GACtB,IAAI9N,EAAY9L,EAAMvvB,OAClBA,EAASk4B,GAAUiR,EAAQnpC,OAAQq7B,GACnC8a,EAAWpb,GAAUxL,GAEzB,MAAOvvB,IAAU,CACf,IAAI0T,EAAQy1B,EAAQnpC,GACpBuvB,EAAMvvB,GAAUw+B,GAAQ9qB,EAAO2nB,GAAa8a,EAASziC,GAAS/O,EAEhE,OAAO4qB,EAWT,SAASyY,GAAQlW,EAAQrX,GACvB,IAAY,gBAARA,GAAgD,oBAAhBqX,EAAOrX,KAIhC,aAAPA,EAIJ,OAAOqX,EAAOrX,GAiBhB,IAAImH,GAAUw0B,GAASrM,IAUnB56B,GAAaioB,IAAiB,SAASjI,EAAMoS,GAC/C,OAAOtxB,GAAKd,WAAWggB,EAAMoS,IAW3BmI,GAAc0M,GAASpM,IAY3B,SAASmJ,GAAgB1D,EAAS4G,EAAWpW,GAC3C,IAAIhY,EAAUouB,EAAY,GAC1B,OAAO3M,GAAY+F,EAAS6F,GAAkBrtB,EAAQquB,GAAkBnB,GAAeltB,GAASgY,KAYlG,SAASmW,GAASjnB,GAChB,IAAIonB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQte,KACRue,EAAY7xB,GAAY4xB,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAAS3xB,EACb,OAAO+qB,UAAU,QAGnB4G,EAAQ,EAEV,OAAOpnB,EAAKD,MAAMvqB,EAAWgrC,YAYjC,SAAS/Q,GAAYrP,EAAOvrB,GAC1B,IAAI0P,GAAS,EACT1T,EAASuvB,EAAMvvB,OACfihB,EAAYjhB,EAAS,EAEzBgE,EAAOA,IAASW,EAAY3E,EAASgE,EACrC,QAAS0P,EAAQ1P,EAAM,CACrB,IAAI2yC,EAAOjY,GAAWhrB,EAAOuN,GACzBpf,EAAQ0tB,EAAMonB,GAElBpnB,EAAMonB,GAAQpnB,EAAM7b,GACpB6b,EAAM7b,GAAS7R,EAGjB,OADA0tB,EAAMvvB,OAASgE,EACRurB,EAUT,IAAI8c,GAAewJ,IAAc,SAAS7kB,GACxC,IAAIf,EAAS,GAOb,OAN6B,KAAzBe,EAAO4lB,WAAW,IACpB3mB,EAAOxsB,KAAK,IAEdutB,EAAO0B,QAAQlK,IAAY,SAAS0I,EAAO2O,EAAQgX,EAAOC,GACxD7mB,EAAOxsB,KAAKozC,EAAQC,EAAUpkB,QAAQxJ,GAAc,MAAS2W,GAAU3O,MAElEjB,KAUT,SAASoT,GAAMxhC,GACb,GAAoB,iBAATA,GAAqBugC,GAASvgC,GACvC,OAAOA,EAET,IAAIouB,EAAUpuB,EAAQ,GACtB,MAAkB,KAAVouB,GAAkB,EAAIpuB,IAAWojB,EAAY,KAAOgL,EAU9D,SAASgJ,GAAS9J,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOqG,GAAatzB,KAAKitB,GACzB,MAAO/rB,IACT,IACE,OAAQ+rB,EAAO,GACf,MAAO/rB,KAEX,MAAO,GAWT,SAASkzC,GAAkBf,EAAStV,GAOlC,OANAtQ,GAAUnK,GAAW,SAAS8tB,GAC5B,IAAIzxC,EAAQ,KAAOyxC,EAAK,GACnBrT,EAAUqT,EAAK,KAAQpjB,GAAcqlB,EAAS1zC,IACjD0zC,EAAQ9xC,KAAK5B,MAGV0zC,EAAQpjB,OAUjB,SAAS2H,GAAa2V,GACpB,GAAIA,aAAmB7V,GACrB,OAAO6V,EAAQxU,QAEjB,IAAIhL,EAAS,IAAI4J,GAAc4V,EAAQrV,YAAaqV,EAAQnV,WAI5D,OAHArK,EAAOoK,YAAcU,GAAU0U,EAAQpV,aACvCpK,EAAOsK,UAAakV,EAAQlV,UAC5BtK,EAAOuK,WAAaiV,EAAQjV,WACrBvK,EA0BT,SAAS8mB,GAAMxnB,EAAOvrB,EAAMmrC,GAExBnrC,GADGmrC,EAAQC,GAAe7f,EAAOvrB,EAAMmrC,GAASnrC,IAASW,GAClD,EAEAszB,GAAUqK,GAAUt+B,GAAO,GAEpC,IAAIhE,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,IAAKA,GAAUgE,EAAO,EACpB,MAAO,GAET,IAAI0P,EAAQ,EACRsc,EAAW,EACXC,EAAS3kB,EAAM+rB,GAAWr3B,EAASgE,IAEvC,MAAO0P,EAAQ1T,EACbiwB,EAAOD,KAAcma,GAAU5a,EAAO7b,EAAQA,GAAS1P,GAEzD,OAAOisB,EAkBT,SAAS+mB,GAAQznB,GACf,IAAI7b,GAAS,EACT1T,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACnCgwB,EAAW,EACXC,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACd7R,IACFouB,EAAOD,KAAcnuB,GAGzB,OAAOouB,EAyBT,SAAStZ,KACP,IAAI3W,EAAS2vC,UAAU3vC,OACvB,IAAKA,EACH,MAAO,GAET,IAAIqvB,EAAO/jB,EAAMtL,EAAS,GACtBuvB,EAAQogB,UAAU,GAClBj8B,EAAQ1T,EAEZ,MAAO0T,IACL2b,EAAK3b,EAAQ,GAAKi8B,UAAUj8B,GAE9B,OAAO6c,GAAU/X,GAAQ+W,GAASwL,GAAUxL,GAAS,CAACA,GAAQkT,GAAYpT,EAAM,IAwBlF,IAAI4nB,GAAaxN,IAAS,SAASla,EAAOxV,GACxC,OAAOouB,GAAkB5Y,GACrBiS,GAAejS,EAAOkT,GAAY1oB,EAAQ,EAAGouB,IAAmB,IAChE,MA6BF+O,GAAezN,IAAS,SAASla,EAAOxV,GAC1C,IAAI0V,EAAW5U,GAAKd,GAIpB,OAHIouB,GAAkB1Y,KACpBA,EAAW9qB,GAENwjC,GAAkB5Y,GACrBiS,GAAejS,EAAOkT,GAAY1oB,EAAQ,EAAGouB,IAAmB,GAAOO,GAAYjZ,EAAU,IAC7F,MA0BF0nB,GAAiB1N,IAAS,SAASla,EAAOxV,GAC5C,IAAIsW,EAAaxV,GAAKd,GAItB,OAHIouB,GAAkB9X,KACpBA,EAAa1rB,GAERwjC,GAAkB5Y,GACrBiS,GAAejS,EAAOkT,GAAY1oB,EAAQ,EAAGouB,IAAmB,GAAOxjC,EAAW0rB,GAClF,MA4BN,SAAS+mB,GAAK7nB,EAAO+C,EAAG6c,GACtB,IAAInvC,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGLsyB,EAAK6c,GAAS7c,IAAM3tB,EAAa,EAAI29B,GAAUhQ,GACxC6X,GAAU5a,EAAO+C,EAAI,EAAI,EAAIA,EAAGtyB,IAH9B,GA+BX,SAASq3C,GAAU9nB,EAAO+C,EAAG6c,GAC3B,IAAInvC,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGLsyB,EAAK6c,GAAS7c,IAAM3tB,EAAa,EAAI29B,GAAUhQ,GAC/CA,EAAItyB,EAASsyB,EACN6X,GAAU5a,EAAO,EAAG+C,EAAI,EAAI,EAAIA,IAJ9B,GA0CX,SAASglB,GAAe/nB,EAAOO,GAC7B,OAAQP,GAASA,EAAMvvB,OACnB4rC,GAAUrc,EAAOmZ,GAAY5Y,EAAW,IAAI,GAAM,GAClD,GAsCN,SAASynB,GAAUhoB,EAAOO,GACxB,OAAQP,GAASA,EAAMvvB,OACnB4rC,GAAUrc,EAAOmZ,GAAY5Y,EAAW,IAAI,GAC5C,GAgCN,SAAS0nB,GAAKjoB,EAAO1tB,EAAOqR,EAAO9G,GACjC,IAAIpM,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGDkT,GAAyB,iBAATA,GAAqBk8B,GAAe7f,EAAO1tB,EAAOqR,KACpEA,EAAQ,EACR9G,EAAMpM,GAEDqiC,GAAS9S,EAAO1tB,EAAOqR,EAAO9G,IAN5B,GA4CX,SAAS6N,GAAUsV,EAAOO,EAAWyB,GACnC,IAAIvxB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0T,EAAqB,MAAb6d,EAAoB,EAAI+Q,GAAU/Q,GAI9C,OAHI7d,EAAQ,IACVA,EAAQukB,GAAUj4B,EAAS0T,EAAO,IAE7B4d,GAAc/B,EAAOmZ,GAAY5Y,EAAW,GAAIpc,GAsCzD,SAAS+jC,GAAcloB,EAAOO,EAAWyB,GACvC,IAAIvxB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0T,EAAQ1T,EAAS,EAOrB,OANIuxB,IAAc5sB,IAChB+O,EAAQ4uB,GAAU/Q,GAClB7d,EAAQ6d,EAAY,EAChB0G,GAAUj4B,EAAS0T,EAAO,GAC1BwkB,GAAUxkB,EAAO1T,EAAS,IAEzBsxB,GAAc/B,EAAOmZ,GAAY5Y,EAAW,GAAIpc,GAAO,GAiBhE,SAASkhC,GAAQrlB,GACf,IAAIvvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAASyiC,GAAYlT,EAAO,GAAK,GAiB1C,SAASmoB,GAAYnoB,GACnB,IAAIvvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAASyiC,GAAYlT,EAAOtK,GAAY,GAuBjD,SAAS0yB,GAAapoB,EAAOmT,GAC3B,IAAI1iC,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGL0iC,EAAQA,IAAU/9B,EAAY,EAAI29B,GAAUI,GACrCD,GAAYlT,EAAOmT,IAHjB,GAqBX,SAASkV,GAAU5Z,GACjB,IAAItqB,GAAS,EACT1T,EAAkB,MAATg+B,EAAgB,EAAIA,EAAMh+B,OACnCiwB,EAAS,GAEb,QAASvc,EAAQ1T,EAAQ,CACvB,IAAIszC,EAAOtV,EAAMtqB,GACjBuc,EAAOqjB,EAAK,IAAMA,EAAK,GAEzB,OAAOrjB,EAqBT,SAAS4nB,GAAKtoB,GACZ,OAAQA,GAASA,EAAMvvB,OAAUuvB,EAAM,GAAK5qB,EA0B9C,SAAS6G,GAAQ+jB,EAAO1tB,EAAO0vB,GAC7B,IAAIvxB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0T,EAAqB,MAAb6d,EAAoB,EAAI+Q,GAAU/Q,GAI9C,OAHI7d,EAAQ,IACVA,EAAQukB,GAAUj4B,EAAS0T,EAAO,IAE7Byc,GAAYZ,EAAO1tB,EAAO6R,GAiBnC,SAASokC,GAAQvoB,GACf,IAAIvvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAASmqC,GAAU5a,EAAO,GAAI,GAAK,GAoB5C,IAAIwoB,GAAetO,IAAS,SAASxF,GACnC,IAAI+T,EAAS1nB,GAAS2T,EAAQkI,IAC9B,OAAQ6L,EAAOh4C,QAAUg4C,EAAO,KAAO/T,EAAO,GAC1CD,GAAiBgU,GACjB,MA0BFC,GAAiBxO,IAAS,SAASxF,GACrC,IAAIxU,EAAW5U,GAAKopB,GAChB+T,EAAS1nB,GAAS2T,EAAQkI,IAO9B,OALI1c,IAAa5U,GAAKm9B,GACpBvoB,EAAW9qB,EAEXqzC,EAAOpb,MAEDob,EAAOh4C,QAAUg4C,EAAO,KAAO/T,EAAO,GAC1CD,GAAiBgU,EAAQtP,GAAYjZ,EAAU,IAC/C,MAwBFyoB,GAAmBzO,IAAS,SAASxF,GACvC,IAAI5T,EAAaxV,GAAKopB,GAClB+T,EAAS1nB,GAAS2T,EAAQkI,IAM9B,OAJA9b,EAAkC,mBAAdA,EAA2BA,EAAa1rB,EACxD0rB,GACF2nB,EAAOpb,MAEDob,EAAOh4C,QAAUg4C,EAAO,KAAO/T,EAAO,GAC1CD,GAAiBgU,EAAQrzC,EAAW0rB,GACpC,MAkBN,SAAS/d,GAAKid,EAAO4oB,GACnB,OAAgB,MAAT5oB,EAAgB,GAAKwI,GAAW71B,KAAKqtB,EAAO4oB,GAiBrD,SAASt9B,GAAK0U,GACZ,IAAIvvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAASuvB,EAAMvvB,EAAS,GAAK2E,EAwBtC,SAASyzC,GAAY7oB,EAAO1tB,EAAO0vB,GACjC,IAAIvxB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI0T,EAAQ1T,EAKZ,OAJIuxB,IAAc5sB,IAChB+O,EAAQ4uB,GAAU/Q,GAClB7d,EAAQA,EAAQ,EAAIukB,GAAUj4B,EAAS0T,EAAO,GAAKwkB,GAAUxkB,EAAO1T,EAAS,IAExE6B,IAAUA,EACbuyB,GAAkB7E,EAAO1tB,EAAO6R,GAChC4d,GAAc/B,EAAOmC,GAAWhe,GAAO,GAwB7C,SAAS2kC,GAAI9oB,EAAO+C,GAClB,OAAQ/C,GAASA,EAAMvvB,OAAUuoC,GAAQhZ,EAAO+S,GAAUhQ,IAAM3tB,EA0BlE,IAAI2zC,GAAO7O,GAAS8O,IAsBpB,SAASA,GAAQhpB,EAAOxV,GACtB,OAAQwV,GAASA,EAAMvvB,QAAU+Z,GAAUA,EAAO/Z,OAC9CipC,GAAY1Z,EAAOxV,GACnBwV,EA0BN,SAASipB,GAAUjpB,EAAOxV,EAAQ0V,GAChC,OAAQF,GAASA,EAAMvvB,QAAU+Z,GAAUA,EAAO/Z,OAC9CipC,GAAY1Z,EAAOxV,EAAQ2uB,GAAYjZ,EAAU,IACjDF,EA0BN,SAASkpB,GAAYlpB,EAAOxV,EAAQsW,GAClC,OAAQd,GAASA,EAAMvvB,QAAU+Z,GAAUA,EAAO/Z,OAC9CipC,GAAY1Z,EAAOxV,EAAQpV,EAAW0rB,GACtCd,EA2BN,IAAImpB,GAAS9H,IAAS,SAASrhB,EAAO4Z,GACpC,IAAInpC,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACnCiwB,EAASyP,GAAOnQ,EAAO4Z,GAM3B,OAJAD,GAAW3Z,EAAOe,GAAS6Y,GAAS,SAASz1B,GAC3C,OAAO8qB,GAAQ9qB,EAAO1T,IAAW0T,EAAQA,KACxCye,KAAKkb,KAEDpd,KA+BT,SAAS5lB,GAAOklB,EAAOO,GACrB,IAAIG,EAAS,GACb,IAAMV,IAASA,EAAMvvB,OACnB,OAAOiwB,EAET,IAAIvc,GAAS,EACTy1B,EAAU,GACVnpC,EAASuvB,EAAMvvB,OAEnB8vB,EAAY4Y,GAAY5Y,EAAW,GACnC,QAASpc,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAQ0tB,EAAM7b,GACdoc,EAAUjuB,EAAO6R,EAAO6b,KAC1BU,EAAOxsB,KAAK5B,GACZsnC,EAAQ1lC,KAAKiQ,IAIjB,OADAw1B,GAAW3Z,EAAO4Z,GACXlZ,EA0BT,SAASuI,GAAQjJ,GACf,OAAgB,MAATA,EAAgBA,EAAQgJ,GAAcr2B,KAAKqtB,GAmBpD,SAAS5b,GAAM4b,EAAOrc,EAAO9G,GAC3B,IAAIpM,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGDoM,GAAqB,iBAAPA,GAAmBgjC,GAAe7f,EAAOrc,EAAO9G,IAChE8G,EAAQ,EACR9G,EAAMpM,IAGNkT,EAAiB,MAATA,EAAgB,EAAIovB,GAAUpvB,GACtC9G,EAAMA,IAAQzH,EAAY3E,EAASsiC,GAAUl2B,IAExC+9B,GAAU5a,EAAOrc,EAAO9G,IAVtB,GA8BX,SAASusC,GAAYppB,EAAO1tB,GAC1B,OAAOwoC,GAAgB9a,EAAO1tB,GA4BhC,SAAS+2C,GAAcrpB,EAAO1tB,EAAO4tB,GACnC,OAAOib,GAAkBnb,EAAO1tB,EAAO6mC,GAAYjZ,EAAU,IAmB/D,SAASopB,GAActpB,EAAO1tB,GAC5B,IAAI7B,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,GAAIA,EAAQ,CACV,IAAI0T,EAAQ22B,GAAgB9a,EAAO1tB,GACnC,GAAI6R,EAAQ1T,GAAUg/B,GAAGzP,EAAM7b,GAAQ7R,GACrC,OAAO6R,EAGX,OAAQ,EAqBV,SAASolC,GAAgBvpB,EAAO1tB,GAC9B,OAAOwoC,GAAgB9a,EAAO1tB,GAAO,GA4BvC,SAASk3C,GAAkBxpB,EAAO1tB,EAAO4tB,GACvC,OAAOib,GAAkBnb,EAAO1tB,EAAO6mC,GAAYjZ,EAAU,IAAI,GAmBnE,SAASupB,GAAkBzpB,EAAO1tB,GAChC,IAAI7B,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,GAAIA,EAAQ,CACV,IAAI0T,EAAQ22B,GAAgB9a,EAAO1tB,GAAO,GAAQ,EAClD,GAAIm9B,GAAGzP,EAAM7b,GAAQ7R,GACnB,OAAO6R,EAGX,OAAQ,EAkBV,SAASulC,GAAW1pB,GAClB,OAAQA,GAASA,EAAMvvB,OACnBorC,GAAe7b,GACf,GAmBN,SAAS2pB,GAAa3pB,EAAOE,GAC3B,OAAQF,GAASA,EAAMvvB,OACnBorC,GAAe7b,EAAOmZ,GAAYjZ,EAAU,IAC5C,GAiBN,SAAS0pB,GAAK5pB,GACZ,IAAIvvB,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAOA,EAASmqC,GAAU5a,EAAO,EAAGvvB,GAAU,GA4BhD,SAASo5C,GAAK7pB,EAAO+C,EAAG6c,GACtB,OAAM5f,GAASA,EAAMvvB,QAGrBsyB,EAAK6c,GAAS7c,IAAM3tB,EAAa,EAAI29B,GAAUhQ,GACxC6X,GAAU5a,EAAO,EAAG+C,EAAI,EAAI,EAAIA,IAH9B,GA+BX,SAAS+mB,GAAU9pB,EAAO+C,EAAG6c,GAC3B,IAAInvC,EAAkB,MAATuvB,EAAgB,EAAIA,EAAMvvB,OACvC,OAAKA,GAGLsyB,EAAK6c,GAAS7c,IAAM3tB,EAAa,EAAI29B,GAAUhQ,GAC/CA,EAAItyB,EAASsyB,EACN6X,GAAU5a,EAAO+C,EAAI,EAAI,EAAIA,EAAGtyB,IAJ9B,GA0CX,SAASs5C,GAAe/pB,EAAOO,GAC7B,OAAQP,GAASA,EAAMvvB,OACnB4rC,GAAUrc,EAAOmZ,GAAY5Y,EAAW,IAAI,GAAO,GACnD,GAsCN,SAASypB,GAAUhqB,EAAOO,GACxB,OAAQP,GAASA,EAAMvvB,OACnB4rC,GAAUrc,EAAOmZ,GAAY5Y,EAAW,IACxC,GAmBN,IAAI0pB,GAAQ/P,IAAS,SAASxF,GAC5B,OAAOsH,GAAS9I,GAAYwB,EAAQ,EAAGkE,IAAmB,OA0BxDsR,GAAUhQ,IAAS,SAASxF,GAC9B,IAAIxU,EAAW5U,GAAKopB,GAIpB,OAHIkE,GAAkB1Y,KACpBA,EAAW9qB,GAEN4mC,GAAS9I,GAAYwB,EAAQ,EAAGkE,IAAmB,GAAOO,GAAYjZ,EAAU,OAwBrFiqB,GAAYjQ,IAAS,SAASxF,GAChC,IAAI5T,EAAaxV,GAAKopB,GAEtB,OADA5T,EAAkC,mBAAdA,EAA2BA,EAAa1rB,EACrD4mC,GAAS9I,GAAYwB,EAAQ,EAAGkE,IAAmB,GAAOxjC,EAAW0rB,MAqB9E,SAASspB,GAAKpqB,GACZ,OAAQA,GAASA,EAAMvvB,OAAUurC,GAAShc,GAAS,GA0BrD,SAASqqB,GAAOrqB,EAAOE,GACrB,OAAQF,GAASA,EAAMvvB,OAAUurC,GAAShc,EAAOmZ,GAAYjZ,EAAU,IAAM,GAuB/E,SAASoqB,GAAStqB,EAAOc,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa1rB,EACpD4qB,GAASA,EAAMvvB,OAAUurC,GAAShc,EAAO5qB,EAAW0rB,GAAc,GAsB5E,SAASypB,GAAMvqB,GACb,IAAMA,IAASA,EAAMvvB,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAuvB,EAAQQ,GAAYR,GAAO,SAASwqB,GAClC,GAAI5R,GAAkB4R,GAEpB,OADA/5C,EAASi4B,GAAU8hB,EAAM/5C,OAAQA,IAC1B,KAGJqyB,GAAUryB,GAAQ,SAAS0T,GAChC,OAAO4c,GAASf,EAAOuB,GAAapd,OAyBxC,SAASsmC,GAAUzqB,EAAOE,GACxB,IAAMF,IAASA,EAAMvvB,OACnB,MAAO,GAET,IAAIiwB,EAAS6pB,GAAMvqB,GACnB,OAAgB,MAAZE,EACKQ,EAEFK,GAASL,GAAQ,SAAS8pB,GAC/B,OAAO7qB,GAAMO,EAAU9qB,EAAWo1C,MAwBtC,IAAIE,GAAUxQ,IAAS,SAASla,EAAOxV,GACrC,OAAOouB,GAAkB5Y,GACrBiS,GAAejS,EAAOxV,GACtB,MAqBFmgC,GAAMzQ,IAAS,SAASxF,GAC1B,OAAO8H,GAAQhc,GAAYkU,EAAQkE,QA0BjCgS,GAAQ1Q,IAAS,SAASxF,GAC5B,IAAIxU,EAAW5U,GAAKopB,GAIpB,OAHIkE,GAAkB1Y,KACpBA,EAAW9qB,GAENonC,GAAQhc,GAAYkU,EAAQkE,IAAoBO,GAAYjZ,EAAU,OAwB3E2qB,GAAU3Q,IAAS,SAASxF,GAC9B,IAAI5T,EAAaxV,GAAKopB,GAEtB,OADA5T,EAAkC,mBAAdA,EAA2BA,EAAa1rB,EACrDonC,GAAQhc,GAAYkU,EAAQkE,IAAoBxjC,EAAW0rB,MAmBhEgqB,GAAM5Q,GAASqQ,IAkBnB,SAASQ,GAAU95C,EAAOuZ,GACxB,OAAOiyB,GAAcxrC,GAAS,GAAIuZ,GAAU,GAAImlB,IAkBlD,SAASqb,GAAc/5C,EAAOuZ,GAC5B,OAAOiyB,GAAcxrC,GAAS,GAAIuZ,GAAU,GAAIgvB,IAuBlD,IAAIyR,GAAU/Q,IAAS,SAASxF,GAC9B,IAAIjkC,EAASikC,EAAOjkC,OAChByvB,EAAWzvB,EAAS,EAAIikC,EAAOjkC,EAAS,GAAK2E,EAGjD,OADA8qB,EAA8B,mBAAZA,GAA0BwU,EAAOrH,MAAOnN,GAAY9qB,EAC/Dq1C,GAAU/V,EAAQxU,MAkC3B,SAASgrB,GAAM54C,GACb,IAAIouB,EAASyJ,GAAO73B,GAEpB,OADAouB,EAAOqK,WAAY,EACZrK,EA0BT,SAASyqB,GAAI74C,EAAO84C,GAElB,OADAA,EAAY94C,GACLA,EA0BT,SAASkvC,GAAKlvC,EAAO84C,GACnB,OAAOA,EAAY94C,GAmBrB,IAAI+4C,GAAYhK,IAAS,SAASjR,GAChC,IAAI3/B,EAAS2/B,EAAM3/B,OACfkT,EAAQlT,EAAS2/B,EAAM,GAAK,EAC5B99B,EAAQd,KAAKq5B,YACbugB,EAAc,SAAS7oB,GAAU,OAAO4N,GAAO5N,EAAQ6N,IAE3D,QAAI3/B,EAAS,GAAKe,KAAKs5B,YAAYr6B,SAC7B6B,aAAiB+3B,IAAiB4E,GAAQtrB,IAGhDrR,EAAQA,EAAM8R,MAAMT,GAAQA,GAASlT,EAAS,EAAI,IAClD6B,EAAMw4B,YAAY52B,KAAK,CACrB,KAAQstC,GACR,KAAQ,CAAC4J,GACT,QAAWh2C,IAEN,IAAIk1B,GAAch4B,EAAOd,KAAKu5B,WAAWyW,MAAK,SAASxhB,GAI5D,OAHIvvB,IAAWuvB,EAAMvvB,QACnBuvB,EAAM9rB,KAAKkB,GAEN4qB,MAZAxuB,KAAKgwC,KAAK4J,MA2CrB,SAASE,KACP,OAAOJ,GAAM15C,MA6Bf,SAAS+5C,KACP,OAAO,IAAIjhB,GAAc94B,KAAKc,QAASd,KAAKu5B,WAyB9C,SAASygB,KACHh6C,KAAKy5B,aAAe71B,IACtB5D,KAAKy5B,WAAawgB,GAAQj6C,KAAKc,UAEjC,IAAIgyB,EAAO9yB,KAAKw5B,WAAax5B,KAAKy5B,WAAWx6B,OACzC6B,EAAQgyB,EAAOlvB,EAAY5D,KAAKy5B,WAAWz5B,KAAKw5B,aAEpD,MAAO,CAAE,KAAQ1G,EAAM,MAAShyB,GAqBlC,SAASo5C,KACP,OAAOl6C,KA2BT,SAASm6C,GAAar5C,GACpB,IAAIouB,EACAhc,EAASlT,KAEb,MAAOkT,aAAkBimB,GAAY,CACnC,IAAIe,EAAQnB,GAAa7lB,GACzBgnB,EAAMV,UAAY,EAClBU,EAAMT,WAAa71B,EACfsrB,EACFmZ,EAAShP,YAAca,EAEvBhL,EAASgL,EAEX,IAAImO,EAAWnO,EACfhnB,EAASA,EAAOmmB,YAGlB,OADAgP,EAAShP,YAAcv4B,EAChBouB,EAuBT,SAASkrB,KACP,IAAIt5C,EAAQd,KAAKq5B,YACjB,GAAIv4B,aAAiB+3B,GAAa,CAChC,IAAIwhB,EAAUv5C,EAUd,OATId,KAAKs5B,YAAYr6B,SACnBo7C,EAAU,IAAIxhB,GAAY74B,OAE5Bq6C,EAAUA,EAAQ5iB,UAClB4iB,EAAQ/gB,YAAY52B,KAAK,CACvB,KAAQstC,GACR,KAAQ,CAACvY,IACT,QAAW7zB,IAEN,IAAIk1B,GAAcuhB,EAASr6C,KAAKu5B,WAEzC,OAAOv5B,KAAKgwC,KAAKvY,IAiBnB,SAAS6iB,KACP,OAAO1f,GAAiB56B,KAAKq5B,YAAar5B,KAAKs5B,aA2BjD,IAAIihB,GAAUxM,IAAiB,SAAS7e,EAAQpuB,EAAO4Y,GACjDzX,GAAed,KAAK+tB,EAAQxV,KAC5BwV,EAAOxV,GAETwkB,GAAgBhP,EAAQxV,EAAK,MA6CjC,SAAS8gC,GAAMnqB,EAAYtB,EAAWqf,GACpC,IAAIhgB,EAAO3W,GAAQ4Y,GAAcvB,GAAaqS,GAI9C,OAHIiN,GAASC,GAAehe,EAAYtB,EAAWqf,KACjDrf,EAAYnrB,GAEPwqB,EAAKiC,EAAYsX,GAAY5Y,EAAW,IA4CjD,SAASlwB,GAAOwxB,EAAYtB,GAC1B,IAAIX,EAAO3W,GAAQ4Y,GAAcrB,GAAcyS,GAC/C,OAAOrT,EAAKiC,EAAYsX,GAAY5Y,EAAW,IAuCjD,IAAIhnB,GAAO2nC,GAAWx2B,IAqBlBuhC,GAAW/K,GAAWgH,IAuB1B,SAASgE,GAAQrqB,EAAY3B,GAC3B,OAAOgT,GAAYxwB,GAAImf,EAAY3B,GAAW,GAuBhD,SAASisB,GAAYtqB,EAAY3B,GAC/B,OAAOgT,GAAYxwB,GAAImf,EAAY3B,GAAWxK,GAwBhD,SAAS02B,GAAavqB,EAAY3B,EAAUiT,GAE1C,OADAA,EAAQA,IAAU/9B,EAAY,EAAI29B,GAAUI,GACrCD,GAAYxwB,GAAImf,EAAY3B,GAAWiT,GAiChD,SAAS9/B,GAAQwuB,EAAY3B,GAC3B,IAAIN,EAAO3W,GAAQ4Y,GAAczB,GAAY0P,GAC7C,OAAOlQ,EAAKiC,EAAYsX,GAAYjZ,EAAU,IAuBhD,SAASmsB,GAAaxqB,EAAY3B,GAChC,IAAIN,EAAO3W,GAAQ4Y,GAAcxB,GAAiBoS,GAClD,OAAO7S,EAAKiC,EAAYsX,GAAYjZ,EAAU,IA0BhD,IAAIosB,GAAU/M,IAAiB,SAAS7e,EAAQpuB,EAAO4Y,GACjDzX,GAAed,KAAK+tB,EAAQxV,GAC9BwV,EAAOxV,GAAKhX,KAAK5B,GAEjBo9B,GAAgBhP,EAAQxV,EAAK,CAAC5Y,OAkClC,SAAS0N,GAAS6hB,EAAYvvB,EAAO0vB,EAAW4d,GAC9C/d,EAAakW,GAAYlW,GAAcA,EAAarX,GAAOqX,GAC3DG,EAAaA,IAAc4d,EAAS7M,GAAU/Q,GAAa,EAE3D,IAAIvxB,EAASoxB,EAAWpxB,OAIxB,OAHIuxB,EAAY,IACdA,EAAY0G,GAAUj4B,EAASuxB,EAAW,IAErCuqB,GAAS1qB,GACXG,GAAavxB,GAAUoxB,EAAW5lB,QAAQ3J,EAAO0vB,IAAc,IAC7DvxB,GAAUmwB,GAAYiB,EAAYvvB,EAAO0vB,IAAc,EA0BhE,IAAIwqB,GAAYtS,IAAS,SAASrY,EAAY+R,EAAM9T,GAClD,IAAI3b,GAAS,EACT+sB,EAAwB,mBAAR0C,EAChBlT,EAASqX,GAAYlW,GAAc9lB,EAAM8lB,EAAWpxB,QAAU,GAKlE,OAHAq/B,GAASjO,GAAY,SAASvvB,GAC5BouB,IAASvc,GAAS+sB,EAASvR,GAAMiU,EAAMthC,EAAOwtB,GAAQoV,GAAW5iC,EAAOshC,EAAM9T,MAEzEY,KA+BL+rB,GAAQlN,IAAiB,SAAS7e,EAAQpuB,EAAO4Y,GACnDwkB,GAAgBhP,EAAQxV,EAAK5Y,MA6C/B,SAASoQ,GAAImf,EAAY3B,GACvB,IAAIN,EAAO3W,GAAQ4Y,GAAcd,GAAW+W,GAC5C,OAAOlY,EAAKiC,EAAYsX,GAAYjZ,EAAU,IAgChD,SAASwsB,GAAQ7qB,EAAYoK,EAAWiN,EAAQ0G,GAC9C,OAAkB,MAAd/d,EACK,IAEJ5Y,GAAQgjB,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAExCiN,EAAS0G,EAAQxqC,EAAY8jC,EACxBjwB,GAAQiwB,KACXA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BD,GAAYpX,EAAYoK,EAAWiN,IAuC5C,IAAIyT,GAAYpN,IAAiB,SAAS7e,EAAQpuB,EAAO4Y,GACvDwV,EAAOxV,EAAM,EAAI,GAAGhX,KAAK5B,MACxB,WAAa,MAAO,CAAC,GAAI,OAuC5B,SAAS4W,GAAO2Y,EAAY3B,EAAUC,GACpC,IAAIP,EAAO3W,GAAQ4Y,GAAcX,GAAcuB,GAC3CtB,EAAYif,UAAU3vC,OAAS,EAEnC,OAAOmvB,EAAKiC,EAAYsX,GAAYjZ,EAAU,GAAIC,EAAagB,EAAW2O,IAyB5E,SAAS8c,GAAY/qB,EAAY3B,EAAUC,GACzC,IAAIP,EAAO3W,GAAQ4Y,GAAcT,GAAmBqB,GAChDtB,EAAYif,UAAU3vC,OAAS,EAEnC,OAAOmvB,EAAKiC,EAAYsX,GAAYjZ,EAAU,GAAIC,EAAagB,EAAWsR,IAqC5E,SAASoa,GAAOhrB,EAAYtB,GAC1B,IAAIX,EAAO3W,GAAQ4Y,GAAcrB,GAAcyS,GAC/C,OAAOrT,EAAKiC,EAAYirB,GAAO3T,GAAY5Y,EAAW,KAiBxD,SAASwsB,GAAOlrB,GACd,IAAIjC,EAAO3W,GAAQ4Y,GAAcqN,GAAcmL,GAC/C,OAAOza,EAAKiC,GAuBd,SAASmrB,GAAWnrB,EAAYkB,EAAG6c,GAE/B7c,GADG6c,EAAQC,GAAehe,EAAYkB,EAAG6c,GAAS7c,IAAM3tB,GACpD,EAEA29B,GAAUhQ,GAEhB,IAAInD,EAAO3W,GAAQ4Y,GAAcuN,GAAkBkL,GACnD,OAAO1a,EAAKiC,EAAYkB,GAkB1B,SAASkqB,GAAQprB,GACf,IAAIjC,EAAO3W,GAAQ4Y,GAAc0N,GAAeoL,GAChD,OAAO/a,EAAKiC,GAwBd,SAASptB,GAAKotB,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIkW,GAAYlW,GACd,OAAO0qB,GAAS1qB,GAAciD,GAAWjD,GAAcA,EAAWpxB,OAEpE,IAAI2B,EAAM6+B,GAAOpP,GACjB,OAAIzvB,GAAOukB,GAAUvkB,GAAO8kB,GACnB2K,EAAWptB,KAEb+iC,GAAS3V,GAAYpxB,OAuC9B,SAASuf,GAAK6R,EAAYtB,EAAWqf,GACnC,IAAIhgB,EAAO3W,GAAQ4Y,GAAcR,GAAYwZ,GAI7C,OAHI+E,GAASC,GAAehe,EAAYtB,EAAWqf,KACjDrf,EAAYnrB,GAEPwqB,EAAKiC,EAAYsX,GAAY5Y,EAAW,IAgCjD,IAAI2sB,GAAShT,IAAS,SAASrY,EAAYoK,GACzC,GAAkB,MAAdpK,EACF,MAAO,GAET,IAAIpxB,EAASw7B,EAAUx7B,OAMvB,OALIA,EAAS,GAAKovC,GAAehe,EAAYoK,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHx7B,EAAS,GAAKovC,GAAe5T,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBgN,GAAYpX,EAAYqR,GAAYjH,EAAW,GAAI,OAqBxD3d,GAAMsZ,IAAU,WAClB,OAAOlnB,GAAK+kB,KAAKnX,OA6BnB,SAAS6+B,GAAMpqB,EAAGnD,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAI+F,GAAU5R,GAGtB,OADAgP,EAAIgQ,GAAUhQ,GACP,WACL,KAAMA,EAAI,EACR,OAAOnD,EAAKD,MAAMnuB,KAAM4uC,YAsB9B,SAAS4B,GAAIpiB,EAAMmD,EAAG6c,GAGpB,OAFA7c,EAAI6c,EAAQxqC,EAAY2tB,EACxBA,EAAKnD,GAAa,MAALmD,EAAanD,EAAKnvB,OAASsyB,EACjCmhB,GAAWtkB,EAAM5K,EAAe5f,EAAWA,EAAWA,EAAWA,EAAW2tB,GAoBrF,SAASqqB,GAAOrqB,EAAGnD,GACjB,IAAIc,EACJ,GAAmB,mBAARd,EACT,MAAM,IAAI+F,GAAU5R,GAGtB,OADAgP,EAAIgQ,GAAUhQ,GACP,WAOL,QANMA,EAAI,IACRrC,EAASd,EAAKD,MAAMnuB,KAAM4uC,YAExBrd,GAAK,IACPnD,EAAOxqB,GAEFsrB,GAuCX,IAAI2sB,GAAOnT,IAAS,SAASta,EAAMC,EAASye,GAC1C,IAAI5N,EAAUjc,EACd,GAAI6pB,EAAS7tC,OAAQ,CACnB,IAAI8tC,EAAU7Z,GAAe4Z,EAAUyC,GAAUsM,KACjD3c,GAAW5b,EAEb,OAAOovB,GAAWtkB,EAAM8Q,EAAS7Q,EAASye,EAAUC,MAgDlD+O,GAAUpT,IAAS,SAAS3X,EAAQrX,EAAKozB,GAC3C,IAAI5N,EAAUjc,EAAiBC,EAC/B,GAAI4pB,EAAS7tC,OAAQ,CACnB,IAAI8tC,EAAU7Z,GAAe4Z,EAAUyC,GAAUuM,KACjD5c,GAAW5b,EAEb,OAAOovB,GAAWh5B,EAAKwlB,EAASnO,EAAQ+b,EAAUC,MA4CpD,SAASgP,GAAM3tB,EAAMkhB,EAAOlB,GAC1BkB,EAAQlB,EAAQxqC,EAAY0rC,EAC5B,IAAIpgB,EAASwjB,GAAWtkB,EAAMhL,EAAiBxf,EAAWA,EAAWA,EAAWA,EAAWA,EAAW0rC,GAEtG,OADApgB,EAAO3T,YAAcwgC,GAAMxgC,YACpB2T,EAyCT,SAAS8sB,GAAW5tB,EAAMkhB,EAAOlB,GAC/BkB,EAAQlB,EAAQxqC,EAAY0rC,EAC5B,IAAIpgB,EAASwjB,GAAWtkB,EAAM/K,EAAuBzf,EAAWA,EAAWA,EAAWA,EAAWA,EAAW0rC,GAE5G,OADApgB,EAAO3T,YAAcygC,GAAWzgC,YACzB2T,EAyDT,SAAS+sB,GAAS7tB,EAAMoS,EAAMt/B,GAC5B,IAAIg7C,EACAC,EACAC,EACAltB,EACAmtB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT1N,GAAW,EAEf,GAAmB,mBAAR3gB,EACT,MAAM,IAAI+F,GAAU5R,GAUtB,SAASm6B,EAAWC,GAClB,IAAIruB,EAAO4tB,EACP7tB,EAAU8tB,EAKd,OAHAD,EAAWC,EAAWv4C,EACtB24C,EAAiBI,EACjBztB,EAASd,EAAKD,MAAME,EAASC,GACtBY,EAGT,SAAS0tB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAUjuC,GAAWyuC,EAAcrc,GAE5Bgc,EAAUE,EAAWC,GAAQztB,EAGtC,SAAS4tB,EAAcH,GACrB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAC7BU,EAAczc,EAAOuc,EAEzB,OAAON,EACHtlB,GAAU8lB,EAAab,EAAUY,GACjCC,EAGN,SAASC,EAAaP,GACpB,IAAII,EAAoBJ,EAAOL,EAC3BU,EAAsBL,EAAOJ,EAKjC,OAAQD,IAAiB14C,GAAcm5C,GAAqBvc,GACzDuc,EAAoB,GAAON,GAAUO,GAAuBZ,EAGjE,SAASS,IACP,IAAIF,EAAO7/B,KACX,GAAIogC,EAAaP,GACf,OAAOQ,EAAaR,GAGtBN,EAAUjuC,GAAWyuC,EAAcC,EAAcH,IAGnD,SAASQ,EAAaR,GAKpB,OAJAN,EAAUz4C,EAINmrC,GAAYmN,EACPQ,EAAWC,IAEpBT,EAAWC,EAAWv4C,EACfsrB,GAGT,SAASkuB,IACHf,IAAYz4C,GACd+K,GAAa0tC,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUz4C,EAGjD,SAASy5C,IACP,OAAOhB,IAAYz4C,EAAYsrB,EAASiuB,EAAargC,MAGvD,SAASwgC,IACP,IAAIX,EAAO7/B,KACPygC,EAAaL,EAAaP,GAM9B,GAJAT,EAAWtN,UACXuN,EAAWn8C,KACXs8C,EAAeK,EAEXY,EAAY,CACd,GAAIlB,IAAYz4C,EACd,OAAOg5C,EAAYN,GAErB,GAAIG,EAIF,OAFA9tC,GAAa0tC,GACbA,EAAUjuC,GAAWyuC,EAAcrc,GAC5Bkc,EAAWJ,GAMtB,OAHID,IAAYz4C,IACdy4C,EAAUjuC,GAAWyuC,EAAcrc,IAE9BtR,EAIT,OA3GAsR,EAAOqR,GAASrR,IAAS,EACrBtH,GAASh4B,KACXs7C,IAAYt7C,EAAQs7C,QACpBC,EAAS,YAAav7C,EACtBk7C,EAAUK,EAASvlB,GAAU2a,GAAS3wC,EAAQk7C,UAAY,EAAG5b,GAAQ4b,EACrErN,EAAW,aAAc7tC,IAAYA,EAAQ6tC,SAAWA,GAoG1DuO,EAAUF,OAASA,EACnBE,EAAUD,MAAQA,EACXC,EAqBT,IAAIE,GAAQ9U,IAAS,SAASta,EAAME,GAClC,OAAOiS,GAAUnS,EAAM,EAAGE,MAsBxBmvB,GAAQ/U,IAAS,SAASta,EAAMoS,EAAMlS,GACxC,OAAOiS,GAAUnS,EAAMyjB,GAASrR,IAAS,EAAGlS,MAqB9C,SAASovB,GAAKtvB,GACZ,OAAOskB,GAAWtkB,EAAM1K,GA+C1B,SAASqxB,GAAQ3mB,EAAMuvB,GACrB,GAAmB,mBAARvvB,GAAmC,MAAZuvB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIxpB,GAAU5R,GAEtB,IAAIq7B,EAAW,WACb,IAAItvB,EAAOsgB,UACPl1B,EAAMikC,EAAWA,EAASxvB,MAAMnuB,KAAMsuB,GAAQA,EAAK,GACnDyD,EAAQ6rB,EAAS7rB,MAErB,GAAIA,EAAMhZ,IAAIW,GACZ,OAAOqY,EAAMlT,IAAInF,GAEnB,IAAIwV,EAASd,EAAKD,MAAMnuB,KAAMsuB,GAE9B,OADAsvB,EAAS7rB,MAAQA,EAAMjZ,IAAIY,EAAKwV,IAAW6C,EACpC7C,GAGT,OADA0uB,EAAS7rB,MAAQ,IAAKgjB,GAAQ8I,OAAS5hB,IAChC2hB,EA0BT,SAAStC,GAAOvsB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIoF,GAAU5R,GAEtB,OAAO,WACL,IAAI+L,EAAOsgB,UACX,OAAQtgB,EAAKrvB,QACX,KAAK,EAAG,OAAQ8vB,EAAU5tB,KAAKnB,MAC/B,KAAK,EAAG,OAAQ+uB,EAAU5tB,KAAKnB,KAAMsuB,EAAK,IAC1C,KAAK,EAAG,OAAQS,EAAU5tB,KAAKnB,KAAMsuB,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQS,EAAU5tB,KAAKnB,KAAMsuB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQS,EAAUZ,MAAMnuB,KAAMsuB,IAsBlC,SAASwvB,GAAK1vB,GACZ,OAAOwtB,GAAO,EAAGxtB,GAzDnB2mB,GAAQ8I,MAAQ5hB,GA2FhB,IAAI8hB,GAAWxS,IAAS,SAASnd,EAAM+lB,GACrCA,EAAmC,GAArBA,EAAWl1C,QAAewY,GAAQ08B,EAAW,IACvD5kB,GAAS4kB,EAAW,GAAIviB,GAAU+V,OAClCpY,GAASmS,GAAYyS,EAAY,GAAIviB,GAAU+V,OAEnD,IAAIqW,EAAc7J,EAAWl1C,OAC7B,OAAOypC,IAAS,SAASpa,GACvB,IAAI3b,GAAS,EACT1T,EAASk4B,GAAU7I,EAAKrvB,OAAQ++C,GAEpC,QAASrrC,EAAQ1T,EACfqvB,EAAK3b,GAASwhC,EAAWxhC,GAAOxR,KAAKnB,KAAMsuB,EAAK3b,IAElD,OAAOwb,GAAMC,EAAMpuB,KAAMsuB,SAqCzB2vB,GAAUvV,IAAS,SAASta,EAAM0e,GACpC,IAAIC,EAAU7Z,GAAe4Z,EAAUyC,GAAU0O,KACjD,OAAOvL,GAAWtkB,EAAM9K,EAAmB1f,EAAWkpC,EAAUC,MAmC9DmR,GAAexV,IAAS,SAASta,EAAM0e,GACzC,IAAIC,EAAU7Z,GAAe4Z,EAAUyC,GAAU2O,KACjD,OAAOxL,GAAWtkB,EAAM7K,EAAyB3f,EAAWkpC,EAAUC,MAyBpEoR,GAAQtO,IAAS,SAASzhB,EAAMga,GAClC,OAAOsK,GAAWtkB,EAAM3K,EAAiB7f,EAAWA,EAAWA,EAAWwkC,MA4B5E,SAASgW,GAAKhwB,EAAMjc,GAClB,GAAmB,mBAARic,EACT,MAAM,IAAI+F,GAAU5R,GAGtB,OADApQ,EAAQA,IAAUvO,EAAYuO,EAAQovB,GAAUpvB,GACzCu2B,GAASta,EAAMjc,GAqCxB,SAASksC,GAAOjwB,EAAMjc,GACpB,GAAmB,mBAARic,EACT,MAAM,IAAI+F,GAAU5R,GAGtB,OADApQ,EAAiB,MAATA,EAAgB,EAAI+kB,GAAUqK,GAAUpvB,GAAQ,GACjDu2B,IAAS,SAASpa,GACvB,IAAIE,EAAQF,EAAKnc,GACbgjC,EAAY3J,GAAUld,EAAM,EAAGnc,GAKnC,OAHIqc,GACFgB,GAAU2lB,EAAW3mB,GAEhBL,GAAMC,EAAMpuB,KAAMm1C,MAgD7B,SAASmJ,GAASlwB,EAAMoS,EAAMt/B,GAC5B,IAAIs7C,GAAU,EACVzN,GAAW,EAEf,GAAmB,mBAAR3gB,EACT,MAAM,IAAI+F,GAAU5R,GAMtB,OAJI2W,GAASh4B,KACXs7C,EAAU,YAAat7C,IAAYA,EAAQs7C,QAAUA,EACrDzN,EAAW,aAAc7tC,IAAYA,EAAQ6tC,SAAWA,GAEnDkN,GAAS7tB,EAAMoS,EAAM,CAC1B,QAAWgc,EACX,QAAWhc,EACX,SAAYuO,IAmBhB,SAASwP,GAAMnwB,GACb,OAAOoiB,GAAIpiB,EAAM,GAyBnB,SAASowB,GAAK19C,EAAO4tC,GACnB,OAAOuP,GAAQ5S,GAAaqD,GAAU5tC,GAsCxC,SAAS29C,KACP,IAAK7P,UAAU3vC,OACb,MAAO,GAET,IAAI6B,EAAQ8tC,UAAU,GACtB,OAAOn3B,GAAQ3W,GAASA,EAAQ,CAACA,GA6BnC,SAASo5B,GAAMp5B,GACb,OAAOm+B,GAAUn+B,EAAOgiB,GAkC1B,SAAS47B,GAAU59C,EAAOq+B,GAExB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EACrDq7B,GAAUn+B,EAAOgiB,EAAoBqc,GAqB9C,SAASwf,GAAU79C,GACjB,OAAOm+B,GAAUn+B,EAAO8hB,EAAkBE,GA+B5C,SAAS87B,GAAc99C,EAAOq+B,GAE5B,OADAA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EACrDq7B,GAAUn+B,EAAO8hB,EAAkBE,EAAoBqc,GA2BhE,SAAS0f,GAAW9tB,EAAQ7J,GAC1B,OAAiB,MAAVA,GAAkBoZ,GAAevP,EAAQ7J,EAAQ5V,GAAK4V,IAmC/D,SAAS+W,GAAGn9B,EAAO+hC,GACjB,OAAO/hC,IAAU+hC,GAAU/hC,IAAUA,GAAS+hC,IAAUA,EA0B1D,IAAIic,GAAKlN,GAA0BhP,IAyB/Bmc,GAAMnN,IAA0B,SAAS9wC,EAAO+hC,GAClD,OAAO/hC,GAAS+hC,KAqBdxF,GAAcsG,GAAgB,WAAa,OAAOiL,UAApB,IAAsCjL,GAAkB,SAAS7iC,GACjG,OAAO83B,GAAa93B,IAAUmB,GAAed,KAAKL,EAAO,YACtD60B,GAAqBx0B,KAAKL,EAAO,WA0BlC2W,GAAUlN,EAAMkN,QAmBhB+V,GAAgBD,GAAoBqE,GAAUrE,IAAqBqW,GA2BvE,SAAS2C,GAAYzlC,GACnB,OAAgB,MAATA,GAAiB4kC,GAAS5kC,EAAM7B,UAAYijC,GAAWphC,GA4BhE,SAASsmC,GAAkBtmC,GACzB,OAAO83B,GAAa93B,IAAUylC,GAAYzlC,GAoB5C,SAASk+C,GAAUl+C,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB83B,GAAa93B,IAAU2hC,GAAW3hC,IAAU+jB,EAoBjD,IAAIgS,GAAWD,IAAkBie,GAmB7BnnB,GAASD,GAAamE,GAAUnE,IAAcoW,GAmBlD,SAASob,GAAUn+C,GACjB,OAAO83B,GAAa93B,IAA6B,IAAnBA,EAAM+rB,WAAmBya,GAAcxmC,GAoCvE,SAASo+C,GAAQp+C,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIylC,GAAYzlC,KACX2W,GAAQ3W,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM6c,QAC1DkZ,GAAS/1B,IAAUotB,GAAaptB,IAAUu8B,GAAYv8B,IAC1D,OAAQA,EAAM7B,OAEhB,IAAI2B,EAAM6+B,GAAO3+B,GACjB,GAAIF,GAAOukB,GAAUvkB,GAAO8kB,GAC1B,OAAQ5kB,EAAMmC,KAEhB,GAAIgjC,GAAYnlC,GACd,OAAQklC,GAASllC,GAAO7B,OAE1B,IAAK,IAAIya,KAAO5Y,EACd,GAAImB,GAAed,KAAKL,EAAO4Y,GAC7B,OAAO,EAGX,OAAO,EA+BT,SAASylC,GAAQr+C,EAAO+hC,GACtB,OAAOiB,GAAYhjC,EAAO+hC,GAmC5B,SAASuc,GAAYt+C,EAAO+hC,EAAO1D,GACjCA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EAC5D,IAAIsrB,EAASiQ,EAAaA,EAAWr+B,EAAO+hC,GAASj/B,EACrD,OAAOsrB,IAAWtrB,EAAYkgC,GAAYhjC,EAAO+hC,EAAOj/B,EAAWu7B,KAAgBjQ,EAqBrF,SAASmwB,GAAQv+C,GACf,IAAK83B,GAAa93B,GAChB,OAAO,EAET,IAAIF,EAAM6hC,GAAW3hC,GACrB,OAAOF,GAAOokB,GAAYpkB,GAAOmkB,GACN,iBAAjBjkB,EAAMsyC,SAA4C,iBAAdtyC,EAAMzC,OAAqBipC,GAAcxmC,GA6BzF,SAASi2B,GAASj2B,GAChB,MAAuB,iBAATA,GAAqBg2B,GAAeh2B,GAoBpD,SAASohC,GAAWphC,GAClB,IAAKo4B,GAASp4B,GACZ,OAAO,EAIT,IAAIF,EAAM6hC,GAAW3hC,GACrB,OAAOF,GAAOqkB,GAAWrkB,GAAOskB,GAAUtkB,GAAOgkB,GAAYhkB,GAAO4kB,GA6BtE,SAAS85B,GAAUx+C,GACjB,MAAuB,iBAATA,GAAqBA,GAASygC,GAAUzgC,GA6BxD,SAAS4kC,GAAS5kC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASqjB,EA4B7C,SAAS+U,GAASp4B,GAChB,IAAInB,SAAcmB,EAClB,OAAgB,MAATA,IAA0B,UAARnB,GAA4B,YAARA,GA2B/C,SAASi5B,GAAa93B,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAI8sB,GAAQD,GAAYiE,GAAUjE,IAAaoX,GA8B/C,SAASwa,GAAQxuB,EAAQ7J,GACvB,OAAO6J,IAAW7J,GAAU8d,GAAYjU,EAAQ7J,EAAQsf,GAAatf,IAmCvE,SAASs4B,GAAYzuB,EAAQ7J,EAAQiY,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EACrDohC,GAAYjU,EAAQ7J,EAAQsf,GAAatf,GAASiY,GA+B3D,SAAS33B,GAAM1G,GAIb,OAAO2+C,GAAS3+C,IAAUA,IAAUA,EA6BtC,SAAS4+C,GAAS5+C,GAChB,GAAI8zC,GAAW9zC,GACb,MAAM,IAAIozB,EAAM5R,GAElB,OAAO8iB,GAAatkC,GAoBtB,SAAS6+C,GAAO7+C,GACd,OAAiB,OAAVA,EAuBT,SAAS8+C,GAAM9+C,GACb,OAAgB,MAATA,EA6BT,SAAS2+C,GAAS3+C,GAChB,MAAuB,iBAATA,GACX83B,GAAa93B,IAAU2hC,GAAW3hC,IAAUskB,GA+BjD,SAASkiB,GAAcxmC,GACrB,IAAK83B,GAAa93B,IAAU2hC,GAAW3hC,IAAUwkB,GAC/C,OAAO,EAET,IAAI2T,EAAQ1D,GAAaz0B,GACzB,GAAc,OAAVm4B,EACF,OAAO,EAET,IAAIvlB,EAAOzR,GAAed,KAAK83B,EAAO,gBAAkBA,EAAM6H,YAC9D,MAAsB,mBAARptB,GAAsBA,aAAgBA,GAClD+gB,GAAatzB,KAAKuS,IAASshB,GAoB/B,IAAIlH,GAAWD,GAAe+D,GAAU/D,IAAgB0X,GA6BxD,SAASsa,GAAc/+C,GACrB,OAAOw+C,GAAUx+C,IAAUA,IAAUqjB,GAAoBrjB,GAASqjB,EAoBpE,IAAI6J,GAAQD,GAAY6D,GAAU7D,IAAayX,GAmB/C,SAASuV,GAASj6C,GAChB,MAAuB,iBAATA,IACV2W,GAAQ3W,IAAU83B,GAAa93B,IAAU2hC,GAAW3hC,IAAU6kB,GAoBpE,SAAS0b,GAASvgC,GAChB,MAAuB,iBAATA,GACX83B,GAAa93B,IAAU2hC,GAAW3hC,IAAU8kB,GAoBjD,IAAIsI,GAAeD,GAAmB2D,GAAU3D,IAAoBwX,GAmBpE,SAASqa,GAAYh/C,GACnB,OAAOA,IAAU8C,EAoBnB,SAASm8C,GAAUj/C,GACjB,OAAO83B,GAAa93B,IAAU2+B,GAAO3+B,IAAUglB,GAoBjD,SAASk6B,GAAUl/C,GACjB,OAAO83B,GAAa93B,IAAU2hC,GAAW3hC,IAAUilB,GA0BrD,IAAIk6B,GAAKrO,GAA0BvL,IAyB/B6Z,GAAMtO,IAA0B,SAAS9wC,EAAO+hC,GAClD,OAAO/hC,GAAS+hC,KA0BlB,SAASoX,GAAQn5C,GACf,IAAKA,EACH,MAAO,GAET,GAAIylC,GAAYzlC,GACd,OAAOi6C,GAASj6C,GAAS0yB,GAAc1yB,GAASk5B,GAAUl5B,GAE5D,GAAIg1B,IAAeh1B,EAAMg1B,IACvB,OAAOlD,GAAgB9xB,EAAMg1B,OAE/B,IAAIl1B,EAAM6+B,GAAO3+B,GACbstB,EAAOxtB,GAAOukB,EAAS4N,GAAcnyB,GAAO8kB,GAASyN,GAAana,GAEtE,OAAOoV,EAAKttB,GA0Bd,SAAS6wC,GAAS7wC,GAChB,IAAKA,EACH,OAAiB,IAAVA,EAAcA,EAAQ,EAG/B,GADAA,EAAQ+wC,GAAS/wC,GACbA,IAAUojB,GAAYpjB,KAAWojB,EAAU,CAC7C,IAAIi8B,EAAQr/C,EAAQ,GAAK,EAAI,EAC7B,OAAOq/C,EAAO/7B,EAEhB,OAAOtjB,IAAUA,EAAQA,EAAQ,EA6BnC,SAASygC,GAAUzgC,GACjB,IAAIouB,EAASyiB,GAAS7wC,GAClBs/C,EAAYlxB,EAAS,EAEzB,OAAOA,IAAWA,EAAUkxB,EAAYlxB,EAASkxB,EAAYlxB,EAAU,EA8BzE,SAASsS,GAAS1gC,GAChB,OAAOA,EAAQg9B,GAAUyD,GAAUzgC,GAAQ,EAAGwjB,GAAoB,EA0BpE,SAASutB,GAAS/wC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIugC,GAASvgC,GACX,OAAOujB,EAET,GAAI6U,GAASp4B,GAAQ,CACnB,IAAI+hC,EAAgC,mBAAjB/hC,EAAM23B,QAAwB33B,EAAM23B,UAAY33B,EACnEA,EAAQo4B,GAAS2J,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT/hC,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ2wB,GAAS3wB,GACjB,IAAIu/C,EAAW93B,GAAWmK,KAAK5xB,GAC/B,OAAQu/C,GAAY53B,GAAUiK,KAAK5xB,GAC/BwrB,GAAaxrB,EAAM8R,MAAM,GAAIytC,EAAW,EAAI,GAC3C/3B,GAAWoK,KAAK5xB,GAASujB,GAAOvjB,EA2BvC,SAASymC,GAAczmC,GACrB,OAAO09B,GAAW19B,EAAO49B,GAAO59B,IA2BlC,SAASw/C,GAAcx/C,GACrB,OAAOA,EACHg9B,GAAUyD,GAAUzgC,IAASqjB,EAAkBA,GACpC,IAAVrjB,EAAcA,EAAQ,EAwB7B,SAAS2R,GAAS3R,GAChB,OAAgB,MAATA,EAAgB,GAAKypC,GAAazpC,GAqC3C,IAAI+gB,GAASosB,IAAe,SAASld,EAAQ7J,GAC3C,GAAI+e,GAAY/e,IAAWqf,GAAYrf,GACrCsX,GAAWtX,EAAQ5V,GAAK4V,GAAS6J,QAGnC,IAAK,IAAIrX,KAAOwN,EACVjlB,GAAed,KAAK+lB,EAAQxN,IAC9BykB,GAAYpN,EAAQrX,EAAKwN,EAAOxN,OAoClC6mC,GAAWtS,IAAe,SAASld,EAAQ7J,GAC7CsX,GAAWtX,EAAQwX,GAAOxX,GAAS6J,MAgCjCyvB,GAAevS,IAAe,SAASld,EAAQ7J,EAAQ4f,EAAU3H,GACnEX,GAAWtX,EAAQwX,GAAOxX,GAAS6J,EAAQoO,MA+BzCshB,GAAaxS,IAAe,SAASld,EAAQ7J,EAAQ4f,EAAU3H,GACjEX,GAAWtX,EAAQ5V,GAAK4V,GAAS6J,EAAQoO,MAoBvCuhB,GAAK7Q,GAASlR,IAoClB,SAASjJ,GAAOrB,EAAWssB,GACzB,IAAIzxB,EAAS8J,GAAW3E,GACxB,OAAqB,MAAdssB,EAAqBzxB,EAASqP,GAAWrP,EAAQyxB,GAwB1D,IAAI5sB,GAAW2U,IAAS,SAAS3X,EAAQod,GACvCpd,EAAStrB,GAAOsrB,GAEhB,IAAIpe,GAAS,EACT1T,EAASkvC,EAAQlvC,OACjBmvC,EAAQnvC,EAAS,EAAIkvC,EAAQ,GAAKvqC,EAElCwqC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDnvC,EAAS,GAGX,QAAS0T,EAAQ1T,EAAQ,CACvB,IAAIioB,EAASinB,EAAQx7B,GACjBlT,EAAQi/B,GAAOxX,GACf05B,GAAc,EACdC,EAAcphD,EAAMR,OAExB,QAAS2hD,EAAaC,EAAa,CACjC,IAAInnC,EAAMja,EAAMmhD,GACZ9/C,EAAQiwB,EAAOrX,IAEf5Y,IAAU8C,GACTq6B,GAAGn9B,EAAOyzB,GAAY7a,MAAUzX,GAAed,KAAK4vB,EAAQrX,MAC/DqX,EAAOrX,GAAOwN,EAAOxN,KAK3B,OAAOqX,KAsBL+vB,GAAepY,IAAS,SAASpa,GAEnC,OADAA,EAAK5rB,KAAKkB,EAAWgvC,IACdzkB,GAAM4yB,GAAWn9C,EAAW0qB,MAsCrC,SAAS0yB,GAAQjwB,EAAQhC,GACvB,OAAOqB,GAAYW,EAAQ4W,GAAY5Y,EAAW,GAAIiS,IAsCxD,SAASigB,GAAYlwB,EAAQhC,GAC3B,OAAOqB,GAAYW,EAAQ4W,GAAY5Y,EAAW,GAAImS,IA+BxD,SAASggB,GAAMnwB,EAAQrC,GACrB,OAAiB,MAAVqC,EACHA,EACA+Q,GAAQ/Q,EAAQ4W,GAAYjZ,EAAU,GAAIgQ,IA6BhD,SAASyiB,GAAWpwB,EAAQrC,GAC1B,OAAiB,MAAVqC,EACHA,EACAiR,GAAajR,EAAQ4W,GAAYjZ,EAAU,GAAIgQ,IA+BrD,SAAS0iB,GAAOrwB,EAAQrC,GACtB,OAAOqC,GAAUiQ,GAAWjQ,EAAQ4W,GAAYjZ,EAAU,IA6B5D,SAAS2yB,GAAYtwB,EAAQrC,GAC3B,OAAOqC,GAAUmQ,GAAgBnQ,EAAQ4W,GAAYjZ,EAAU,IA0BjE,SAAS4yB,GAAUvwB,GACjB,OAAiB,MAAVA,EAAiB,GAAKkR,GAAclR,EAAQzf,GAAKyf,IA0B1D,SAASwwB,GAAYxwB,GACnB,OAAiB,MAAVA,EAAiB,GAAKkR,GAAclR,EAAQ2N,GAAO3N,IA4B5D,SAASlS,GAAIkS,EAAQqR,EAAM+O,GACzB,IAAIjiB,EAAmB,MAAV6B,EAAiBntB,EAAYu+B,GAAQpR,EAAQqR,GAC1D,OAAOlT,IAAWtrB,EAAYutC,EAAejiB,EA8B/C,SAASnW,GAAIgY,EAAQqR,GACnB,OAAiB,MAAVrR,GAAkBsjB,GAAQtjB,EAAQqR,EAAMU,IA6BjD,SAAS8D,GAAM7V,EAAQqR,GACrB,OAAiB,MAAVrR,GAAkBsjB,GAAQtjB,EAAQqR,EAAMW,IAqBjD,IAAIye,GAASzQ,IAAe,SAAS7hB,EAAQpuB,EAAO4Y,GACrC,MAAT5Y,GACyB,mBAAlBA,EAAM2R,WACf3R,EAAQi0B,GAAqB5zB,KAAKL,IAGpCouB,EAAOpuB,GAAS4Y,IACfwvB,GAAStD,KA4BR6b,GAAW1Q,IAAe,SAAS7hB,EAAQpuB,EAAO4Y,GACvC,MAAT5Y,GACyB,mBAAlBA,EAAM2R,WACf3R,EAAQi0B,GAAqB5zB,KAAKL,IAGhCmB,GAAed,KAAK+tB,EAAQpuB,GAC9BouB,EAAOpuB,GAAO4B,KAAKgX,GAEnBwV,EAAOpuB,GAAS,CAAC4Y,KAElBiuB,IAoBC+Z,GAAShZ,GAAShF,IA8BtB,SAASpyB,GAAKyf,GACZ,OAAOwV,GAAYxV,GAAUmM,GAAcnM,GAAUiV,GAASjV,GA0BhE,SAAS2N,GAAO3N,GACd,OAAOwV,GAAYxV,GAAUmM,GAAcnM,GAAQ,GAAQmV,GAAWnV,GAwBxE,SAAS4wB,GAAQ5wB,EAAQrC,GACvB,IAAIQ,EAAS,GAMb,OALAR,EAAWiZ,GAAYjZ,EAAU,GAEjCsS,GAAWjQ,GAAQ,SAASjwB,EAAO4Y,EAAKqX,GACtCmN,GAAgBhP,EAAQR,EAAS5tB,EAAO4Y,EAAKqX,GAASjwB,MAEjDouB,EA+BT,SAAS0yB,GAAU7wB,EAAQrC,GACzB,IAAIQ,EAAS,GAMb,OALAR,EAAWiZ,GAAYjZ,EAAU,GAEjCsS,GAAWjQ,GAAQ,SAASjwB,EAAO4Y,EAAKqX,GACtCmN,GAAgBhP,EAAQxV,EAAKgV,EAAS5tB,EAAO4Y,EAAKqX,OAE7C7B,EAkCT,IAAI2yB,GAAQ5T,IAAe,SAASld,EAAQ7J,EAAQ4f,GAClDD,GAAU9V,EAAQ7J,EAAQ4f,MAkCxBia,GAAY9S,IAAe,SAASld,EAAQ7J,EAAQ4f,EAAU3H,GAChE0H,GAAU9V,EAAQ7J,EAAQ4f,EAAU3H,MAuBlC2iB,GAAOjS,IAAS,SAAS9e,EAAQ6N,GACnC,IAAI1P,EAAS,GACb,GAAc,MAAV6B,EACF,OAAO7B,EAET,IAAImQ,GAAS,EACbT,EAAQrP,GAASqP,GAAO,SAASwD,GAG/B,OAFAA,EAAOC,GAASD,EAAMrR,GACtBsO,IAAWA,EAAS+C,EAAKnjC,OAAS,GAC3BmjC,KAET5D,GAAWzN,EAAQoP,GAAapP,GAAS7B,GACrCmQ,IACFnQ,EAAS+P,GAAU/P,EAAQtM,EAAkBC,EAAkBC,EAAoB+vB,KAErF,IAAI5zC,EAAS2/B,EAAM3/B,OACnB,MAAOA,IACLqpC,GAAUpZ,EAAQ0P,EAAM3/B,IAE1B,OAAOiwB,KAuBT,SAAS6yB,GAAOhxB,EAAQhC,GACtB,OAAOizB,GAAOjxB,EAAQuqB,GAAO3T,GAAY5Y,KAoB3C,IAAIiF,GAAO6b,IAAS,SAAS9e,EAAQ6N,GACnC,OAAiB,MAAV7N,EAAiB,GAAK+W,GAAS/W,EAAQ6N,MAqBhD,SAASojB,GAAOjxB,EAAQhC,GACtB,GAAc,MAAVgC,EACF,MAAO,GAET,IAAItxB,EAAQ8vB,GAAS4Q,GAAapP,IAAS,SAASkxB,GAClD,MAAO,CAACA,MAGV,OADAlzB,EAAY4Y,GAAY5Y,GACjBgZ,GAAWhX,EAAQtxB,GAAO,SAASqB,EAAOshC,GAC/C,OAAOrT,EAAUjuB,EAAOshC,EAAK,OAiCjC,SAASlT,GAAO6B,EAAQqR,EAAM+O,GAC5B/O,EAAOC,GAASD,EAAMrR,GAEtB,IAAIpe,GAAS,EACT1T,EAASmjC,EAAKnjC,OAGbA,IACHA,EAAS,EACT8xB,EAASntB,GAEX,QAAS+O,EAAQ1T,EAAQ,CACvB,IAAI6B,EAAkB,MAAViwB,EAAiBntB,EAAYmtB,EAAOuR,GAAMF,EAAKzvB,KACvD7R,IAAU8C,IACZ+O,EAAQ1T,EACR6B,EAAQqwC,GAEVpgB,EAASmR,GAAWphC,GAASA,EAAMK,KAAK4vB,GAAUjwB,EAEpD,OAAOiwB,EA+BT,SAASjY,GAAIiY,EAAQqR,EAAMthC,GACzB,OAAiB,MAAViwB,EAAiBA,EAASiX,GAAQjX,EAAQqR,EAAMthC,GA2BzD,SAASohD,GAAQnxB,EAAQqR,EAAMthC,EAAOq+B,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EAC3C,MAAVmtB,EAAiBA,EAASiX,GAAQjX,EAAQqR,EAAMthC,EAAOq+B,GA2BhE,IAAIgjB,GAAU1P,GAAcnhC,IA0BxB8wC,GAAY3P,GAAc/T,IAgC9B,SAASzL,GAAUlC,EAAQrC,EAAUC,GACnC,IAAIyL,EAAQ3iB,GAAQsZ,GAChBsxB,EAAYjoB,GAASvD,GAAS9F,IAAW7C,GAAa6C,GAG1D,GADArC,EAAWiZ,GAAYjZ,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIjb,EAAOqd,GAAUA,EAAO+P,YAE1BnS,EADE0zB,EACYjoB,EAAQ,IAAI1mB,EAAO,GAE1BwlB,GAASnI,IACFmR,GAAWxuB,GAAQslB,GAAWzD,GAAaxE,IAG3C,GAMlB,OAHCsxB,EAAYzzB,GAAYoS,IAAYjQ,GAAQ,SAASjwB,EAAO6R,EAAOoe,GAClE,OAAOrC,EAASC,EAAa7tB,EAAO6R,EAAOoe,MAEtCpC,EA8BT,SAAS2zB,GAAMvxB,EAAQqR,GACrB,OAAiB,MAAVrR,GAAwBuX,GAAUvX,EAAQqR,GA8BnD,SAASmgB,GAAOxxB,EAAQqR,EAAMwI,GAC5B,OAAiB,MAAV7Z,EAAiBA,EAAS4Z,GAAW5Z,EAAQqR,EAAMiJ,GAAaT,IA2BzE,SAAS4X,GAAWzxB,EAAQqR,EAAMwI,EAASzL,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAav7B,EAC3C,MAAVmtB,EAAiBA,EAAS4Z,GAAW5Z,EAAQqR,EAAMiJ,GAAaT,GAAUzL,GA6BnF,SAASnmB,GAAO+X,GACd,OAAiB,MAAVA,EAAiB,GAAKc,GAAWd,EAAQzf,GAAKyf,IA2BvD,SAAS0xB,GAAS1xB,GAChB,OAAiB,MAAVA,EAAiB,GAAKc,GAAWd,EAAQ2N,GAAO3N,IAwBzD,SAAS2xB,GAAM5jB,EAAQC,EAAOC,GAa5B,OAZIA,IAAUp7B,IACZo7B,EAAQD,EACRA,EAAQn7B,GAENo7B,IAAUp7B,IACZo7B,EAAQ6S,GAAS7S,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAEhCD,IAAUn7B,IACZm7B,EAAQ8S,GAAS9S,GACjBA,EAAQA,IAAUA,EAAQA,EAAQ,GAE7BjB,GAAU+T,GAAS/S,GAASC,EAAOC,GAyC5C,SAAS2jB,GAAQ7jB,EAAQ3sB,EAAO9G,GAS9B,OARA8G,EAAQw/B,GAASx/B,GACb9G,IAAQzH,GACVyH,EAAM8G,EACNA,EAAQ,GAER9G,EAAMsmC,GAAStmC,GAEjByzB,EAAS+S,GAAS/S,GACXkE,GAAYlE,EAAQ3sB,EAAO9G,GAkCpC,SAASksB,GAAOwH,EAAOC,EAAO4jB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBvU,GAAetP,EAAOC,EAAO4jB,KAC3E5jB,EAAQ4jB,EAAWh/C,GAEjBg/C,IAAah/C,IACK,kBAATo7B,GACT4jB,EAAW5jB,EACXA,EAAQp7B,GAEe,kBAATm7B,IACd6jB,EAAW7jB,EACXA,EAAQn7B,IAGRm7B,IAAUn7B,GAAao7B,IAAUp7B,GACnCm7B,EAAQ,EACRC,EAAQ,IAGRD,EAAQ4S,GAAS5S,GACbC,IAAUp7B,GACZo7B,EAAQD,EACRA,EAAQ,GAERC,EAAQ2S,GAAS3S,IAGjBD,EAAQC,EAAO,CACjB,IAAI6jB,EAAO9jB,EACXA,EAAQC,EACRA,EAAQ6jB,EAEV,GAAID,GAAY7jB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI4W,EAAOte,KACX,OAAOH,GAAU4H,EAAS6W,GAAQ5W,EAAQD,EAAQ1S,GAAe,QAAUupB,EAAO,IAAI32C,OAAS,KAAO+/B,GAExG,OAAOrB,GAAWoB,EAAOC,GAyB3B,IAAI8jB,GAAY9T,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GAEtD,OADAowC,EAAOA,EAAK/lC,cACLkS,GAAUvc,EAAQqwC,GAAWD,GAAQA,MAkB9C,SAASC,GAAW/yB,GAClB,OAAOgzB,GAAWxwC,GAASwd,GAAQjT,eAqBrC,SAASmyB,GAAOlf,GAEd,OADAA,EAASxd,GAASwd,GACXA,GAAUA,EAAO0B,QAAQhJ,GAAS0J,IAAcV,QAAQnG,GAAa,IA0B9E,SAASpK,GAAS6O,EAAQtkB,EAAQu3C,GAChCjzB,EAASxd,GAASwd,GAClBtkB,EAAS4+B,GAAa5+B,GAEtB,IAAI1M,EAASgxB,EAAOhxB,OACpBikD,EAAWA,IAAat/C,EACpB3E,EACA6+B,GAAUyD,GAAU2hB,GAAW,EAAGjkD,GAEtC,IAAIoM,EAAM63C,EAEV,OADAA,GAAYv3C,EAAO1M,OACZikD,GAAY,GAAKjzB,EAAOrd,MAAMswC,EAAU73C,IAAQM,EA+BzD,SAASw3C,GAAOlzB,GAEd,OADAA,EAASxd,GAASwd,GACVA,GAAU9I,GAAmBuL,KAAKzC,GACtCA,EAAO0B,QAAQ5K,GAAiBuL,IAChCrC,EAkBN,SAASmzB,GAAanzB,GAEpB,OADAA,EAASxd,GAASwd,GACVA,GAAUtI,GAAgB+K,KAAKzC,GACnCA,EAAO0B,QAAQjK,GAAc,QAC7BuI,EAwBN,IAAIozB,GAAYrU,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GACtD,OAAOuc,GAAUvc,EAAQ,IAAM,IAAMowC,EAAK/lC,iBAuBxCsmC,GAAYtU,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GACtD,OAAOuc,GAAUvc,EAAQ,IAAM,IAAMowC,EAAK/lC,iBAoBxCumC,GAAa1U,GAAgB,eAyBjC,SAAS2U,GAAIvzB,EAAQhxB,EAAQsyC,GAC3BthB,EAASxd,GAASwd,GAClBhxB,EAASsiC,GAAUtiC,GAEnB,IAAIwkD,EAAYxkD,EAASq0B,GAAWrD,GAAU,EAC9C,IAAKhxB,GAAUwkD,GAAaxkD,EAC1B,OAAOgxB,EAET,IAAIyZ,GAAOzqC,EAASwkD,GAAa,EACjC,OACEnS,GAAc9a,GAAYkT,GAAM6H,GAChCthB,EACAqhB,GAAchb,GAAWoT,GAAM6H,GA2BnC,SAASmS,GAAOzzB,EAAQhxB,EAAQsyC,GAC9BthB,EAASxd,GAASwd,GAClBhxB,EAASsiC,GAAUtiC,GAEnB,IAAIwkD,EAAYxkD,EAASq0B,GAAWrD,GAAU,EAC9C,OAAQhxB,GAAUwkD,EAAYxkD,EACzBgxB,EAASqhB,GAAcryC,EAASwkD,EAAWlS,GAC5CthB,EA0BN,SAAS0zB,GAAS1zB,EAAQhxB,EAAQsyC,GAChCthB,EAASxd,GAASwd,GAClBhxB,EAASsiC,GAAUtiC,GAEnB,IAAIwkD,EAAYxkD,EAASq0B,GAAWrD,GAAU,EAC9C,OAAQhxB,GAAUwkD,EAAYxkD,EACzBqyC,GAAcryC,EAASwkD,EAAWlS,GAASthB,EAC5CA,EA2BN,SAASxoB,GAASwoB,EAAQ2zB,EAAOxV,GAM/B,OALIA,GAAkB,MAATwV,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJvsB,GAAe5kB,GAASwd,GAAQ0B,QAAQ/J,GAAa,IAAKg8B,GAAS,GAyB5E,SAASC,GAAO5zB,EAAQsB,EAAG6c,GAMzB,OAJE7c,GADG6c,EAAQC,GAAepe,EAAQsB,EAAG6c,GAAS7c,IAAM3tB,GAChD,EAEA29B,GAAUhQ,GAETkX,GAAWh2B,GAASwd,GAASsB,GAsBtC,SAASI,KACP,IAAIrD,EAAOsgB,UACP3e,EAASxd,GAAS6b,EAAK,IAE3B,OAAOA,EAAKrvB,OAAS,EAAIgxB,EAASA,EAAO0B,QAAQrD,EAAK,GAAIA,EAAK,IAwBjE,IAAIw1B,GAAY9U,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GACtD,OAAOuc,GAAUvc,EAAQ,IAAM,IAAMowC,EAAK/lC,iBAsB5C,SAASxF,GAAMyY,EAAQmnB,EAAW2M,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB1V,GAAepe,EAAQmnB,EAAW2M,KACzE3M,EAAY2M,EAAQngD,GAEtBmgD,EAAQA,IAAUngD,EAAY0gB,EAAmBy/B,IAAU,EACtDA,GAGL9zB,EAASxd,GAASwd,GACdA,IACsB,iBAAbmnB,GACO,MAAbA,IAAsBtpB,GAASspB,MAEpCA,EAAY7M,GAAa6M,IACpBA,GAAa3kB,GAAWxC,IACpBub,GAAUhY,GAAcvD,GAAS,EAAG8zB,GAGxC9zB,EAAOzY,MAAM4/B,EAAW2M,IAZtB,GAoCX,IAAIC,GAAYhV,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GACtD,OAAOuc,GAAUvc,EAAQ,IAAM,IAAMswC,GAAWF,MA0BlD,SAAS9lC,GAAWgT,EAAQtkB,EAAQu3C,GAOlC,OANAjzB,EAASxd,GAASwd,GAClBizB,EAAuB,MAAZA,EACP,EACAplB,GAAUyD,GAAU2hB,GAAW,EAAGjzB,EAAOhxB,QAE7C0M,EAAS4+B,GAAa5+B,GACfskB,EAAOrd,MAAMswC,EAAUA,EAAWv3C,EAAO1M,SAAW0M,EA2G7D,SAASs4C,GAASh0B,EAAQ/uB,EAASktC,GAIjC,IAAI8V,EAAWvrB,GAAOkI,iBAElBuN,GAASC,GAAepe,EAAQ/uB,EAASktC,KAC3CltC,EAAU0C,GAEZqsB,EAASxd,GAASwd,GAClB/uB,EAAUs/C,GAAa,GAAIt/C,EAASgjD,EAAUvR,IAE9C,IAIIwR,EACAC,EALAC,EAAU7D,GAAa,GAAIt/C,EAAQmjD,QAASH,EAASG,QAAS1R,IAC9D2R,EAAchzC,GAAK+yC,GACnBE,EAAgB1yB,GAAWwyB,EAASC,GAIpC3xC,EAAQ,EACR6xC,EAActjD,EAAQsjD,aAAe57B,GACrC1B,EAAS,WAGTu9B,EAAex9B,IAChB/lB,EAAQiiD,QAAUv6B,IAAW1B,OAAS,IACvCs9B,EAAYt9B,OAAS,KACpBs9B,IAAgBl9B,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEhmB,EAAQwjD,UAAY97B,IAAW1B,OAAS,KACzC,KAMEy9B,EAAY,kBACb1iD,GAAed,KAAKD,EAAS,cACzBA,EAAQyjD,UAAY,IAAIhzB,QAAQ,MAAO,KACvC,6BAA+B7F,GAAmB,KACnD,KAENmE,EAAO0B,QAAQ8yB,GAAc,SAASt0B,EAAOy0B,EAAaC,EAAkBC,EAAiBC,EAAet1B,GAsB1G,OArBAo1B,IAAqBA,EAAmBC,GAGxC59B,GAAU+I,EAAOrd,MAAMD,EAAO8c,GAAQkC,QAAQ9I,GAAmB0J,IAG7DqyB,IACFT,GAAa,EACbj9B,GAAU,YAAc09B,EAAc,UAEpCG,IACFX,GAAe,EACfl9B,GAAU,OAAS69B,EAAgB,eAEjCF,IACF39B,GAAU,iBAAmB29B,EAAmB,+BAElDlyC,EAAQ8c,EAASU,EAAMlxB,OAIhBkxB,KAGTjJ,GAAU,OAIV,IAAI89B,EAAW/iD,GAAed,KAAKD,EAAS,aAAeA,EAAQ8jD,SACnE,GAAKA,GAKA,GAAI98B,GAA2BwK,KAAKsyB,GACvC,MAAM,IAAI9wB,EAAM1R,QALhB0E,EAAS,iBAAmBA,EAAS,QASvCA,GAAUk9B,EAAel9B,EAAOyK,QAAQhL,GAAsB,IAAMO,GACjEyK,QAAQ/K,GAAqB,MAC7B+K,QAAQ9K,GAAuB,OAGlCK,EAAS,aAAe89B,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJl9B,EACA,gBAEF,IAAIgI,EAAS+1B,IAAQ,WACnB,OAAOv0C,GAAS4zC,EAAaK,EAAY,UAAYz9B,GAClDiH,MAAMvqB,EAAW2gD,MAMtB,GADAr1B,EAAOhI,OAASA,EACZm4B,GAAQnwB,GACV,MAAMA,EAER,OAAOA,EAwBT,SAASg2B,GAAQpkD,GACf,OAAO2R,GAAS3R,GAAOkc,cAwBzB,SAASmoC,GAAQrkD,GACf,OAAO2R,GAAS3R,GAAOskD,cAyBzB,SAASj4C,GAAK8iB,EAAQshB,EAAOnD,GAE3B,GADAne,EAASxd,GAASwd,GACdA,IAAWme,GAASmD,IAAU3tC,GAChC,OAAO6tB,GAASxB,GAElB,IAAKA,KAAYshB,EAAQhH,GAAagH,IACpC,OAAOthB,EAET,IAAIgC,EAAauB,GAAcvD,GAC3BiC,EAAasB,GAAc+d,GAC3Bp/B,EAAQ6f,GAAgBC,EAAYC,GACpC7mB,EAAM8mB,GAAcF,EAAYC,GAAc,EAElD,OAAOsZ,GAAUvZ,EAAY9f,EAAO9G,GAAKkG,KAAK,IAsBhD,SAAS8zC,GAAQp1B,EAAQshB,EAAOnD,GAE9B,GADAne,EAASxd,GAASwd,GACdA,IAAWme,GAASmD,IAAU3tC,GAChC,OAAOqsB,EAAOrd,MAAM,EAAG8e,GAAgBzB,GAAU,GAEnD,IAAKA,KAAYshB,EAAQhH,GAAagH,IACpC,OAAOthB,EAET,IAAIgC,EAAauB,GAAcvD,GAC3B5kB,EAAM8mB,GAAcF,EAAYuB,GAAc+d,IAAU,EAE5D,OAAO/F,GAAUvZ,EAAY,EAAG5mB,GAAKkG,KAAK,IAsB5C,SAAS+zC,GAAUr1B,EAAQshB,EAAOnD,GAEhC,GADAne,EAASxd,GAASwd,GACdA,IAAWme,GAASmD,IAAU3tC,GAChC,OAAOqsB,EAAO0B,QAAQ/J,GAAa,IAErC,IAAKqI,KAAYshB,EAAQhH,GAAagH,IACpC,OAAOthB,EAET,IAAIgC,EAAauB,GAAcvD,GAC3B9d,EAAQ6f,GAAgBC,EAAYuB,GAAc+d,IAEtD,OAAO/F,GAAUvZ,EAAY9f,GAAOZ,KAAK,IAwC3C,SAASg0C,GAASt1B,EAAQ/uB,GACxB,IAAIjC,EAAS0kB,EACT6hC,EAAW5hC,EAEf,GAAIsV,GAASh4B,GAAU,CACrB,IAAIk2C,EAAY,cAAel2C,EAAUA,EAAQk2C,UAAYA,EAC7Dn4C,EAAS,WAAYiC,EAAUqgC,GAAUrgC,EAAQjC,QAAUA,EAC3DumD,EAAW,aAActkD,EAAUqpC,GAAarpC,EAAQskD,UAAYA,EAEtEv1B,EAASxd,GAASwd,GAElB,IAAIwzB,EAAYxzB,EAAOhxB,OACvB,GAAIwzB,GAAWxC,GAAS,CACtB,IAAIgC,EAAauB,GAAcvD,GAC/BwzB,EAAYxxB,EAAWhzB,OAEzB,GAAIA,GAAUwkD,EACZ,OAAOxzB,EAET,IAAI5kB,EAAMpM,EAASq0B,GAAWkyB,GAC9B,GAAIn6C,EAAM,EACR,OAAOm6C,EAET,IAAIt2B,EAAS+C,EACTuZ,GAAUvZ,EAAY,EAAG5mB,GAAKkG,KAAK,IACnC0e,EAAOrd,MAAM,EAAGvH,GAEpB,GAAI+rC,IAAcxzC,EAChB,OAAOsrB,EAASs2B,EAKlB,GAHIvzB,IACF5mB,GAAQ6jB,EAAOjwB,OAASoM,GAEtByiB,GAASspB,IACX,GAAInnB,EAAOrd,MAAMvH,GAAKo6C,OAAOrO,GAAY,CACvC,IAAIjnB,EACAu1B,EAAYx2B,EAEXkoB,EAAU5qB,SACb4qB,EAAYnwB,GAAOmwB,EAAUlwB,OAAQzU,GAAS4V,GAAQwM,KAAKuiB,IAAc,MAE3EA,EAAUl3B,UAAY,EACtB,MAAQiQ,EAAQinB,EAAUviB,KAAK6wB,GAC7B,IAAIC,EAASx1B,EAAMxd,MAErBuc,EAASA,EAAOtc,MAAM,EAAG+yC,IAAW/hD,EAAYyH,EAAMs6C,SAEnD,GAAI11B,EAAOxlB,QAAQ8/B,GAAa6M,GAAY/rC,IAAQA,EAAK,CAC9D,IAAIsH,EAAQuc,EAAOmoB,YAAYD,GAC3BzkC,GAAS,IACXuc,EAASA,EAAOtc,MAAM,EAAGD,IAG7B,OAAOuc,EAASs2B,EAsBlB,SAASI,GAAS31B,GAEhB,OADAA,EAASxd,GAASwd,GACVA,GAAUjJ,GAAiB0L,KAAKzC,GACpCA,EAAO0B,QAAQ7K,GAAe6M,IAC9B1D,EAuBN,IAAI41B,GAAY7W,IAAiB,SAAS9f,EAAQ6zB,EAAMpwC,GACtD,OAAOuc,GAAUvc,EAAQ,IAAM,IAAMowC,EAAKqC,iBAoBxCnC,GAAapU,GAAgB,eAqBjC,SAASK,GAAMjf,EAAQqV,EAAS8I,GAI9B,OAHAne,EAASxd,GAASwd,GAClBqV,EAAU8I,EAAQxqC,EAAY0hC,EAE1BA,IAAY1hC,EACP+uB,GAAe1C,GAAU2D,GAAa3D,GAAUC,GAAWD,GAE7DA,EAAOE,MAAMmV,IAAY,GA2BlC,IAAI2f,GAAUvc,IAAS,SAASta,EAAME,GACpC,IACE,OAAOH,GAAMC,EAAMxqB,EAAW0qB,GAC9B,MAAOjsB,GACP,OAAOg9C,GAAQh9C,GAAKA,EAAI,IAAI6xB,EAAM7xB,OA8BlCyjD,GAAUjW,IAAS,SAAS9e,EAAQg1B,GAKtC,OAJAn3B,GAAUm3B,GAAa,SAASrsC,GAC9BA,EAAM4oB,GAAM5oB,GACZwkB,GAAgBnN,EAAQrX,EAAKmiC,GAAK9qB,EAAOrX,GAAMqX,OAE1CA,KAgCT,SAASi1B,GAAK/oB,GACZ,IAAIh+B,EAAkB,MAATg+B,EAAgB,EAAIA,EAAMh+B,OACnC+xC,EAAarJ,KASjB,OAPA1K,EAASh+B,EAAcswB,GAAS0N,GAAO,SAASsV,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIpe,GAAU5R,GAEtB,MAAO,CAACyuB,EAAWuB,EAAK,IAAKA,EAAK,OAJlB,GAOX7J,IAAS,SAASpa,GACvB,IAAI3b,GAAS,EACb,QAASA,EAAQ1T,EAAQ,CACvB,IAAIszC,EAAOtV,EAAMtqB,GACjB,GAAIwb,GAAMokB,EAAK,GAAIvyC,KAAMsuB,GACvB,OAAOH,GAAMokB,EAAK,GAAIvyC,KAAMsuB,OA8BpC,SAAS23B,GAAS/+B,GAChB,OAAOmZ,GAAapB,GAAU/X,EAAQtE,IAsBxC,SAASsmB,GAASpoC,GAChB,OAAO,WACL,OAAOA,GAwBX,SAASolD,GAAUplD,EAAOqwC,GACxB,OAAiB,MAATrwC,GAAiBA,IAAUA,EAASqwC,EAAerwC,EAyB7D,IAAIqlD,GAAOvW,KAuBPwW,GAAYxW,IAAW,GAkB3B,SAAShK,GAAS9kC,GAChB,OAAOA,EA6CT,SAAS4tB,GAASN,GAChB,OAAOuX,GAA4B,mBAARvX,EAAqBA,EAAO6Q,GAAU7Q,EAAMxL,IAsCzE,SAASyjC,GAAQn/B,GACf,OAAO4e,GAAY7G,GAAU/X,EAAQtE,IAoCvC,SAAS0jC,GAAgBlkB,EAAM+C,GAC7B,OAAOU,GAAoBzD,EAAMnD,GAAUkG,EAAUviB,IA2BvD,IAAI2jC,GAAS7d,IAAS,SAAStG,EAAM9T,GACnC,OAAO,SAASyC,GACd,OAAO2S,GAAW3S,EAAQqR,EAAM9T,OA2BhCk4B,GAAW9d,IAAS,SAAS3X,EAAQzC,GACvC,OAAO,SAAS8T,GACd,OAAOsB,GAAW3S,EAAQqR,EAAM9T,OAwCpC,SAASm4B,GAAM11B,EAAQ7J,EAAQhmB,GAC7B,IAAIzB,EAAQ6R,GAAK4V,GACb6+B,EAAc9jB,GAAc/a,EAAQznB,GAEzB,MAAXyB,GACEg4B,GAAShS,KAAY6+B,EAAY9mD,SAAWQ,EAAMR,UACtDiC,EAAUgmB,EACVA,EAAS6J,EACTA,EAAS/wB,KACT+lD,EAAc9jB,GAAc/a,EAAQ5V,GAAK4V,KAE3C,IAAIwyB,IAAUxgB,GAASh4B,IAAY,UAAWA,MAAcA,EAAQw4C,MAChEha,EAASwC,GAAWnR,GAqBxB,OAnBAnC,GAAUm3B,GAAa,SAASjX,GAC9B,IAAI1gB,EAAOlH,EAAO4nB,GAClB/d,EAAO+d,GAAc1gB,EACjBsR,IACF3O,EAAOsD,UAAUya,GAAc,WAC7B,IAAI1V,EAAWp5B,KAAKu5B,UACpB,GAAImgB,GAAStgB,EAAU,CACrB,IAAIlK,EAAS6B,EAAO/wB,KAAKq5B,aACrB0R,EAAU7b,EAAOoK,YAAcU,GAAUh6B,KAAKs5B,aAIlD,OAFAyR,EAAQroC,KAAK,CAAE,KAAQ0rB,EAAM,KAAQwgB,UAAW,QAAW7d,IAC3D7B,EAAOqK,UAAYH,EACZlK,EAET,OAAOd,EAAKD,MAAM4C,EAAQvB,GAAU,CAACxvB,KAAKc,SAAU8tC,iBAKnD7d,EAgBT,SAAS21B,KAIP,OAHIx3C,GAAK4kB,IAAM9zB,OACbkP,GAAK4kB,EAAImB,IAEJj1B,KAeT,SAASwyC,MAwBT,SAASmU,GAAOp1B,GAEd,OADAA,EAAIgQ,GAAUhQ,GACPmX,IAAS,SAASpa,GACvB,OAAOkZ,GAAQlZ,EAAMiD,MAsBzB,IAAIq1B,GAAOxV,GAAW7hB,IA8BlBs3B,GAAYzV,GAAWtiB,IAiCvBg4B,GAAW1V,GAAWvhB,IAwB1B,SAASkW,GAAS3D,GAChB,OAAOsE,GAAMtE,GAAQrS,GAAauS,GAAMF,IAAS6F,GAAiB7F,GAwBpE,SAAS2kB,GAAWh2B,GAClB,OAAO,SAASqR,GACd,OAAiB,MAAVrR,EAAiBntB,EAAYu+B,GAAQpR,EAAQqR,IA6CxD,IAAI4kB,GAAQtV,KAsCRuV,GAAavV,IAAY,GAoB7B,SAASwC,KACP,MAAO,GAgBT,SAASW,KACP,OAAO,EAqBT,SAASqS,KACP,MAAO,GAgBT,SAASC,KACP,MAAO,GAgBT,SAASC,KACP,OAAO,EAsBT,SAASC,GAAM91B,EAAG7C,GAEhB,GADA6C,EAAIgQ,GAAUhQ,GACVA,EAAI,GAAKA,EAAIpN,EACf,MAAO,GAET,IAAIxR,EAAQ2R,EACRrlB,EAASk4B,GAAU5F,EAAGjN,GAE1BoK,EAAWiZ,GAAYjZ,GACvB6C,GAAKjN,EAEL,IAAI4K,EAASoC,GAAUryB,EAAQyvB,GAC/B,QAAS/b,EAAQ4e,EACf7C,EAAS/b,GAEX,OAAOuc,EAoBT,SAASo4B,GAAOxmD,GACd,OAAI2W,GAAQ3W,GACHyuB,GAASzuB,EAAOwhC,IAElBjB,GAASvgC,GAAS,CAACA,GAASk5B,GAAUsR,GAAa74B,GAAS3R,KAoBrE,SAASymD,GAASjtC,GAChB,IAAIrO,IAAOyoB,GACX,OAAOjiB,GAAS6H,GAAUrO,EAoB5B,IAAIrD,GAAMqoC,IAAoB,SAASuW,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBClxB,GAAO8b,GAAY,QAiBnBqV,GAASzW,IAAoB,SAAS0W,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBCnxB,GAAQ4b,GAAY,SAoBxB,SAAShsC,GAAImoB,GACX,OAAQA,GAASA,EAAMvvB,OACnBmiC,GAAa5S,EAAOoX,GAAUhD,IAC9Bh/B,EA0BN,SAASikD,GAAMr5B,EAAOE,GACpB,OAAQF,GAASA,EAAMvvB,OACnBmiC,GAAa5S,EAAOmZ,GAAYjZ,EAAU,GAAIkU,IAC9Ch/B,EAiBN,SAASkkD,GAAKt5B,GACZ,OAAOqC,GAASrC,EAAOoX,IA0BzB,SAASmiB,GAAOv5B,EAAOE,GACrB,OAAOmC,GAASrC,EAAOmZ,GAAYjZ,EAAU,IAqB/C,SAAStnB,GAAIonB,GACX,OAAQA,GAASA,EAAMvvB,OACnBmiC,GAAa5S,EAAOoX,GAAUS,IAC9BziC,EA0BN,SAASokD,GAAMx5B,EAAOE,GACpB,OAAQF,GAASA,EAAMvvB,OACnBmiC,GAAa5S,EAAOmZ,GAAYjZ,EAAU,GAAI2X,IAC9CziC,EAkBN,IAAIqkD,GAAWhX,IAAoB,SAASiX,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQ/V,GAAY,SAiBpBgW,GAAWpX,IAAoB,SAASqX,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgBH,SAASC,GAAIh6B,GACX,OAAQA,GAASA,EAAMvvB,OACnB6xB,GAAQtC,EAAOoX,IACf,EA0BN,SAAS6iB,GAAMj6B,EAAOE,GACpB,OAAQF,GAASA,EAAMvvB,OACnB6xB,GAAQtC,EAAOmZ,GAAYjZ,EAAU,IACrC,EAgjBN,OA1iBAiK,GAAOgjB,MAAQA,GACfhjB,GAAO6X,IAAMA,GACb7X,GAAO9W,OAASA,GAChB8W,GAAO4nB,SAAWA,GAClB5nB,GAAO6nB,aAAeA,GACtB7nB,GAAO8nB,WAAaA,GACpB9nB,GAAO+nB,GAAKA,GACZ/nB,GAAOijB,OAASA,GAChBjjB,GAAOkjB,KAAOA,GACdljB,GAAOmtB,QAAUA,GACjBntB,GAAOmjB,QAAUA,GACjBnjB,GAAO8lB,UAAYA,GACnB9lB,GAAO+gB,MAAQA,GACf/gB,GAAOqd,MAAQA,GACfrd,GAAOsd,QAAUA,GACjBtd,GAAO/iB,OAASA,GAChB+iB,GAAOqtB,KAAOA,GACdrtB,GAAOstB,SAAWA,GAClBttB,GAAOuQ,SAAWA,GAClBvQ,GAAO4hB,QAAUA,GACjB5hB,GAAOjD,OAASA,GAChBiD,GAAOojB,MAAQA,GACfpjB,GAAOqjB,WAAaA,GACpBrjB,GAAOsjB,SAAWA,GAClBtjB,GAAO5E,SAAWA,GAClB4E,GAAOmoB,aAAeA,GACtBnoB,GAAO6kB,MAAQA,GACf7kB,GAAO8kB,MAAQA,GACf9kB,GAAOud,WAAaA,GACpBvd,GAAOwd,aAAeA,GACtBxd,GAAOyd,eAAiBA,GACxBzd,GAAO0d,KAAOA,GACd1d,GAAO2d,UAAYA,GACnB3d,GAAO4d,eAAiBA,GACxB5d,GAAO6d,UAAYA,GACnB7d,GAAO8d,KAAOA,GACd9d,GAAO95B,OAASA,GAChB85B,GAAO+hB,QAAUA,GACjB/hB,GAAOgiB,YAAcA,GACrBhiB,GAAOiiB,aAAeA,GACtBjiB,GAAOkb,QAAUA,GACjBlb,GAAOge,YAAcA,GACrBhe,GAAOie,aAAeA,GACtBje,GAAO+kB,KAAOA,GACd/kB,GAAOwtB,KAAOA,GACdxtB,GAAOytB,UAAYA,GACnBztB,GAAOke,UAAYA,GACnBle,GAAO2oB,UAAYA,GACnB3oB,GAAO4oB,YAAcA,GACrB5oB,GAAOmiB,QAAUA,GACjBniB,GAAOoe,QAAUA,GACjBpe,GAAOqe,aAAeA,GACtBre,GAAOue,eAAiBA,GACxBve,GAAOwe,iBAAmBA,GAC1Bxe,GAAO6oB,OAASA,GAChB7oB,GAAO8oB,SAAWA,GAClB9oB,GAAOqiB,UAAYA,GACnBriB,GAAOjK,SAAWA,GAClBiK,GAAOsiB,MAAQA,GACftiB,GAAOrnB,KAAOA,GACdqnB,GAAO+F,OAASA,GAChB/F,GAAOznB,IAAMA,GACbynB,GAAOgpB,QAAUA,GACjBhpB,GAAOipB,UAAYA,GACnBjpB,GAAO0tB,QAAUA,GACjB1tB,GAAO2tB,gBAAkBA,GACzB3tB,GAAOoc,QAAUA,GACjBpc,GAAOkpB,MAAQA,GACflpB,GAAOooB,UAAYA,GACnBpoB,GAAO4tB,OAASA,GAChB5tB,GAAO6tB,SAAWA,GAClB7tB,GAAO8tB,MAAQA,GACf9tB,GAAO2iB,OAASA,GAChB3iB,GAAOguB,OAASA,GAChBhuB,GAAOmpB,KAAOA,GACdnpB,GAAOopB,OAASA,GAChBppB,GAAOmlB,KAAOA,GACdnlB,GAAOuiB,QAAUA,GACjBviB,GAAOiuB,KAAOA,GACdjuB,GAAOolB,SAAWA,GAClBplB,GAAOkuB,UAAYA,GACnBluB,GAAOmuB,SAAWA,GAClBnuB,GAAOslB,QAAUA,GACjBtlB,GAAOulB,aAAeA,GACtBvlB,GAAOwiB,UAAYA,GACnBxiB,GAAO3E,KAAOA,GACd2E,GAAOqpB,OAASA,GAChBrpB,GAAOoN,SAAWA,GAClBpN,GAAOouB,WAAaA,GACpBpuB,GAAO4e,KAAOA,GACd5e,GAAO6e,QAAUA,GACjB7e,GAAO8e,UAAYA,GACnB9e,GAAO+e,YAAcA,GACrB/e,GAAOgf,OAASA,GAChBhf,GAAOquB,MAAQA,GACfruB,GAAOsuB,WAAaA,GACpBtuB,GAAOwlB,MAAQA,GACfxlB,GAAO0iB,OAASA,GAChB1iB,GAAOrvB,OAASA,GAChBqvB,GAAOylB,KAAOA,GACdzlB,GAAOlB,QAAUA,GACjBkB,GAAO6iB,WAAaA,GACpB7iB,GAAO7f,IAAMA,GACb6f,GAAOupB,QAAUA,GACjBvpB,GAAO8iB,QAAUA,GACjB9iB,GAAO/lB,MAAQA,GACf+lB,GAAO+iB,OAASA,GAChB/iB,GAAOuf,WAAaA,GACpBvf,GAAOwf,aAAeA,GACtBxf,GAAOnhB,MAAQA,GACfmhB,GAAO0lB,OAASA,GAChB1lB,GAAOyf,KAAOA,GACdzf,GAAO0f,KAAOA,GACd1f,GAAO2f,UAAYA,GACnB3f,GAAO4f,eAAiBA,GACxB5f,GAAO6f,UAAYA,GACnB7f,GAAOghB,IAAMA,GACbhhB,GAAO2lB,SAAWA,GAClB3lB,GAAOqX,KAAOA,GACdrX,GAAOshB,QAAUA,GACjBthB,GAAOwpB,QAAUA,GACjBxpB,GAAOypB,UAAYA,GACnBzpB,GAAO2uB,OAASA,GAChB3uB,GAAO4O,cAAgBA,GACvB5O,GAAO1F,UAAYA,GACnB0F,GAAO4lB,MAAQA,GACf5lB,GAAO8f,MAAQA,GACf9f,GAAO+f,QAAUA,GACjB/f,GAAOggB,UAAYA,GACnBhgB,GAAOigB,KAAOA,GACdjgB,GAAOkgB,OAASA,GAChBlgB,GAAOmgB,SAAWA,GAClBngB,GAAO2pB,MAAQA,GACf3pB,GAAOogB,MAAQA,GACfpgB,GAAOsgB,UAAYA,GACnBtgB,GAAO4pB,OAASA,GAChB5pB,GAAO6pB,WAAaA,GACpB7pB,GAAO3f,OAASA,GAChB2f,GAAO8pB,SAAWA,GAClB9pB,GAAOugB,QAAUA,GACjBvgB,GAAOuW,MAAQA,GACfvW,GAAO6lB,KAAOA,GACd7lB,GAAOwgB,IAAMA,GACbxgB,GAAOygB,MAAQA,GACfzgB,GAAO0gB,QAAUA,GACjB1gB,GAAO2gB,IAAMA,GACb3gB,GAAO4gB,UAAYA,GACnB5gB,GAAO6gB,cAAgBA,GACvB7gB,GAAO8gB,QAAUA,GAGjB9gB,GAAOqC,QAAUmnB,GACjBxpB,GAAO+vB,UAAYtG,GACnBzpB,GAAOv6B,OAASmiD,GAChB5nB,GAAOgwB,WAAanI,GAGpBiG,GAAM9tB,GAAQA,IAKdA,GAAO/vB,IAAMA,GACb+vB,GAAOssB,QAAUA,GACjBtsB,GAAOmqB,UAAYA,GACnBnqB,GAAOqqB,WAAaA,GACpBrqB,GAAOpC,KAAOA,GACdoC,GAAO+pB,MAAQA,GACf/pB,GAAOuB,MAAQA,GACfvB,GAAOgmB,UAAYA,GACnBhmB,GAAOimB,cAAgBA,GACvBjmB,GAAO+lB,UAAYA,GACnB/lB,GAAOkmB,WAAaA,GACpBlmB,GAAOwW,OAASA,GAChBxW,GAAOutB,UAAYA,GACnBvtB,GAAO+uB,OAASA,GAChB/uB,GAAOvX,SAAWA,GAClBuX,GAAOsF,GAAKA,GACZtF,GAAOwqB,OAASA,GAChBxqB,GAAOyqB,aAAeA,GACtBzqB,GAAO6hB,MAAQA,GACf7hB,GAAO5wB,KAAOA,GACd4wB,GAAOzf,UAAYA,GACnByf,GAAOqoB,QAAUA,GACjBroB,GAAO8hB,SAAWA,GAClB9hB,GAAO+d,cAAgBA,GACvB/d,GAAOsoB,YAAcA,GACrBtoB,GAAOlC,MAAQA,GACfkC,GAAO92B,QAAUA,GACjB82B,GAAOkiB,aAAeA,GACtBliB,GAAOuoB,MAAQA,GACfvoB,GAAOwoB,WAAaA,GACpBxoB,GAAOyoB,OAASA,GAChBzoB,GAAO0oB,YAAcA,GACrB1oB,GAAO9Z,IAAMA,GACb8Z,GAAOmmB,GAAKA,GACZnmB,GAAOomB,IAAMA,GACbpmB,GAAO5f,IAAMA,GACb4f,GAAOiO,MAAQA,GACfjO,GAAOme,KAAOA,GACdne,GAAOiN,SAAWA,GAClBjN,GAAOnqB,SAAWA,GAClBmqB,GAAOluB,QAAUA,GACjBkuB,GAAOgqB,QAAUA,GACjBhqB,GAAO+oB,OAASA,GAChB/oB,GAAO0E,YAAcA,GACrB1E,GAAOlhB,QAAUA,GACjBkhB,GAAOnL,cAAgBA,GACvBmL,GAAO4N,YAAcA,GACrB5N,GAAOyO,kBAAoBA,GAC3BzO,GAAOqmB,UAAYA,GACnBrmB,GAAO9B,SAAWA,GAClB8B,GAAOjL,OAASA,GAChBiL,GAAOsmB,UAAYA,GACnBtmB,GAAOumB,QAAUA,GACjBvmB,GAAOwmB,QAAUA,GACjBxmB,GAAOymB,YAAcA,GACrBzmB,GAAO0mB,QAAUA,GACjB1mB,GAAO5B,SAAWA,GAClB4B,GAAOuJ,WAAaA,GACpBvJ,GAAO2mB,UAAYA,GACnB3mB,GAAO+M,SAAWA,GAClB/M,GAAO/K,MAAQA,GACf+K,GAAO4mB,QAAUA,GACjB5mB,GAAO6mB,YAAcA,GACrB7mB,GAAOnxB,MAAQA,GACfmxB,GAAO+mB,SAAWA,GAClB/mB,GAAOinB,MAAQA,GACfjnB,GAAOgnB,OAASA,GAChBhnB,GAAO8mB,SAAWA,GAClB9mB,GAAOO,SAAWA,GAClBP,GAAOC,aAAeA,GACtBD,GAAO2O,cAAgBA,GACvB3O,GAAO7K,SAAWA,GAClB6K,GAAOknB,cAAgBA,GACvBlnB,GAAO3K,MAAQA,GACf2K,GAAOoiB,SAAWA,GAClBpiB,GAAO0I,SAAWA,GAClB1I,GAAOzK,aAAeA,GACtByK,GAAOmnB,YAAcA,GACrBnnB,GAAOonB,UAAYA,GACnBpnB,GAAOqnB,UAAYA,GACnBrnB,GAAOpnB,KAAOA,GACdonB,GAAO0qB,UAAYA,GACnB1qB,GAAO7e,KAAOA,GACd6e,GAAO0e,YAAcA,GACrB1e,GAAO2qB,UAAYA,GACnB3qB,GAAO4qB,WAAaA,GACpB5qB,GAAOsnB,GAAKA,GACZtnB,GAAOunB,IAAMA,GACbvnB,GAAOtyB,IAAMA,GACbsyB,GAAOkvB,MAAQA,GACflvB,GAAOmvB,KAAOA,GACdnvB,GAAOovB,OAASA,GAChBpvB,GAAOvxB,IAAMA,GACbuxB,GAAOqvB,MAAQA,GACfrvB,GAAOub,UAAYA,GACnBvb,GAAOkc,UAAYA,GACnBlc,GAAOuuB,WAAaA,GACpBvuB,GAAOwuB,WAAaA,GACpBxuB,GAAOyuB,SAAWA,GAClBzuB,GAAOsvB,SAAWA,GAClBtvB,GAAO2e,IAAMA,GACb3e,GAAO+tB,WAAaA,GACpB/tB,GAAO6Z,KAAOA,GACd7Z,GAAO7b,IAAMA,GACb6b,GAAO6qB,IAAMA,GACb7qB,GAAO+qB,OAASA,GAChB/qB,GAAOgrB,SAAWA,GAClBhrB,GAAOlxB,SAAWA,GAClBkxB,GAAOpB,OAASA,GAChBoB,GAAOjhB,OAASA,GAChBihB,GAAOyiB,YAAcA,GACrBziB,GAAOkrB,OAASA,GAChBlrB,GAAOhH,QAAUA,GACjBgH,GAAOzJ,OAASA,GAChByJ,GAAOyvB,MAAQA,GACfzvB,GAAO9E,aAAeA,EACtB8E,GAAO4iB,OAASA,GAChB5iB,GAAO11B,KAAOA,GACd01B,GAAOmrB,UAAYA,GACnBnrB,GAAOna,KAAOA,GACdma,GAAOif,YAAcA,GACrBjf,GAAOkf,cAAgBA,GACvBlf,GAAOmf,cAAgBA,GACvBnf,GAAOof,gBAAkBA,GACzBpf,GAAOqf,kBAAoBA,GAC3Brf,GAAOsf,kBAAoBA,GAC3Btf,GAAOqrB,UAAYA,GACnBrrB,GAAO1b,WAAaA,GACpB0b,GAAO0vB,SAAWA,GAClB1vB,GAAO6vB,IAAMA,GACb7vB,GAAO8vB,MAAQA,GACf9vB,GAAOsrB,SAAWA,GAClBtrB,GAAO0uB,MAAQA,GACf1uB,GAAOgZ,SAAWA,GAClBhZ,GAAO4I,UAAYA,GACnB5I,GAAO6I,SAAWA,GAClB7I,GAAOusB,QAAUA,GACjBvsB,GAAOkZ,SAAWA,GAClBlZ,GAAO2nB,cAAgBA,GACvB3nB,GAAOlmB,SAAWA,GAClBkmB,GAAOwsB,QAAUA,GACjBxsB,GAAOxrB,KAAOA,GACdwrB,GAAO0sB,QAAUA,GACjB1sB,GAAO2sB,UAAYA,GACnB3sB,GAAO4sB,SAAWA,GAClB5sB,GAAOitB,SAAWA,GAClBjtB,GAAO4uB,SAAWA,GAClB5uB,GAAOktB,UAAYA,GACnBltB,GAAOsqB,WAAaA,GAGpBtqB,GAAOiwB,KAAO/mD,GACd82B,GAAOkwB,UAAYhO,GACnBliB,GAAOmwB,MAAQhS,GAEf2P,GAAM9tB,GAAS,WACb,IAAIzR,EAAS,GAMb,OALA8Z,GAAWrI,IAAQ,SAASvK,EAAM0gB,GAC3B7sC,GAAed,KAAKw3B,GAAOtE,UAAWya,KACzC5nB,EAAO4nB,GAAc1gB,MAGlBlH,EAPK,GAQR,CAAE,OAAS,IAWjByR,GAAOvW,QAAUA,EAGjBwM,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASkgB,GACxFnW,GAAOmW,GAAYvzB,YAAcod,MAInC/J,GAAU,CAAC,OAAQ,SAAS,SAASkgB,EAAYn8B,GAC/CkmB,GAAYxE,UAAUya,GAAc,SAASvd,GAC3CA,EAAIA,IAAM3tB,EAAY,EAAIszB,GAAUqK,GAAUhQ,GAAI,GAElD,IAAIrC,EAAUlvB,KAAK25B,eAAiBhnB,EAChC,IAAIkmB,GAAY74B,MAChBA,KAAKk6B,QAUT,OARIhL,EAAOyK,aACTzK,EAAO2K,cAAgB1C,GAAU5F,EAAGrC,EAAO2K,eAE3C3K,EAAO4K,UAAUp3B,KAAK,CACpB,KAAQy0B,GAAU5F,EAAGjN,GACrB,KAAQwqB,GAAc5f,EAAOwK,QAAU,EAAI,QAAU,MAGlDxK,GAGT2J,GAAYxE,UAAUya,EAAa,SAAW,SAASvd,GACrD,OAAOvxB,KAAKy3B,UAAUqX,GAAYvd,GAAGkG,cAKzC7I,GAAU,CAAC,SAAU,MAAO,cAAc,SAASkgB,EAAYn8B,GAC7D,IAAIhT,EAAOgT,EAAQ,EACfo2C,EAAWppD,GAAQokB,GAAoBpkB,GAAQskB,EAEnD4U,GAAYxE,UAAUya,GAAc,SAASpgB,GAC3C,IAAIQ,EAASlvB,KAAKk6B,QAMlB,OALAhL,EAAO0K,cAAcl3B,KAAK,CACxB,SAAYilC,GAAYjZ,EAAU,GAClC,KAAQ/uB,IAEVuvB,EAAOyK,aAAezK,EAAOyK,cAAgBovB,EACtC75B,MAKXN,GAAU,CAAC,OAAQ,SAAS,SAASkgB,EAAYn8B,GAC/C,IAAIq2C,EAAW,QAAUr2C,EAAQ,QAAU,IAE3CkmB,GAAYxE,UAAUya,GAAc,WAClC,OAAO9uC,KAAKgpD,GAAU,GAAGloD,QAAQ,OAKrC8tB,GAAU,CAAC,UAAW,SAAS,SAASkgB,EAAYn8B,GAClD,IAAIs2C,EAAW,QAAUt2C,EAAQ,GAAK,SAEtCkmB,GAAYxE,UAAUya,GAAc,WAClC,OAAO9uC,KAAK25B,aAAe,IAAId,GAAY74B,MAAQA,KAAKipD,GAAU,OAItEpwB,GAAYxE,UAAU4hB,QAAU,WAC9B,OAAOj2C,KAAKnB,OAAO+mC,KAGrB/M,GAAYxE,UAAUtsB,KAAO,SAASgnB,GACpC,OAAO/uB,KAAKnB,OAAOkwB,GAAW+nB,QAGhCje,GAAYxE,UAAUomB,SAAW,SAAS1rB,GACxC,OAAO/uB,KAAKy3B,UAAU1vB,KAAKgnB,IAG7B8J,GAAYxE,UAAU2mB,UAAYtS,IAAS,SAAStG,EAAM9T,GACxD,MAAmB,mBAAR8T,EACF,IAAIvJ,GAAY74B,MAElBA,KAAKkR,KAAI,SAASpQ,GACvB,OAAO4iC,GAAW5iC,EAAOshC,EAAM9T,SAInCuK,GAAYxE,UAAUgnB,OAAS,SAAStsB,GACtC,OAAO/uB,KAAKnB,OAAOy8C,GAAO3T,GAAY5Y,MAGxC8J,GAAYxE,UAAUzhB,MAAQ,SAAST,EAAO9G,GAC5C8G,EAAQovB,GAAUpvB,GAElB,IAAI+c,EAASlvB,KACb,OAAIkvB,EAAOyK,eAAiBxnB,EAAQ,GAAK9G,EAAM,GACtC,IAAIwtB,GAAY3J,IAErB/c,EAAQ,EACV+c,EAASA,EAAOopB,WAAWnmC,GAClBA,IACT+c,EAASA,EAAOmnB,KAAKlkC,IAEnB9G,IAAQzH,IACVyH,EAAMk2B,GAAUl2B,GAChB6jB,EAAS7jB,EAAM,EAAI6jB,EAAOonB,WAAWjrC,GAAO6jB,EAAOmpB,KAAKhtC,EAAM8G,IAEzD+c,IAGT2J,GAAYxE,UAAUkkB,eAAiB,SAASxpB,GAC9C,OAAO/uB,KAAKy3B,UAAU+gB,UAAUzpB,GAAW0I,WAG7CoB,GAAYxE,UAAU4lB,QAAU,WAC9B,OAAOj6C,KAAKq4C,KAAK/zB,IAInB0c,GAAWnI,GAAYxE,WAAW,SAASjG,EAAM0gB,GAC/C,IAAIoa,EAAgB,qCAAqCx2B,KAAKoc,GAC1Dqa,EAAU,kBAAkBz2B,KAAKoc,GACjCsa,EAAazwB,GAAOwwB,EAAW,QAAwB,QAAdra,EAAuB,QAAU,IAAOA,GACjFua,EAAeF,GAAW,QAAQz2B,KAAKoc,GAEtCsa,IAGLzwB,GAAOtE,UAAUya,GAAc,WAC7B,IAAIhuC,EAAQd,KAAKq5B,YACb/K,EAAO66B,EAAU,CAAC,GAAKva,UACvB0a,EAASxoD,aAAiB+3B,GAC1BnK,EAAWJ,EAAK,GAChBi7B,EAAUD,GAAU7xC,GAAQ3W,GAE5B84C,EAAc,SAAS94C,GACzB,IAAIouB,EAASk6B,EAAWj7B,MAAMwK,GAAQnJ,GAAU,CAAC1uB,GAAQwtB,IACzD,OAAQ66B,GAAW/vB,EAAYlK,EAAO,GAAKA,GAGzCq6B,GAAWL,GAAoC,mBAAZx6B,GAA6C,GAAnBA,EAASzvB,SAExEqqD,EAASC,GAAU,GAErB,IAAInwB,EAAWp5B,KAAKu5B,UAChBiwB,IAAaxpD,KAAKs5B,YAAYr6B,OAC9BwqD,EAAcJ,IAAiBjwB,EAC/BswB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BzoD,EAAQ4oD,EAAW5oD,EAAQ,IAAI+3B,GAAY74B,MAC3C,IAAIkvB,EAASd,EAAKD,MAAMrtB,EAAOwtB,GAE/B,OADAY,EAAOoK,YAAY52B,KAAK,CAAE,KAAQstC,GAAM,KAAQ,CAAC4J,GAAc,QAAWh2C,IACnE,IAAIk1B,GAAc5J,EAAQkK,GAEnC,OAAIqwB,GAAeC,EACVt7B,EAAKD,MAAMnuB,KAAMsuB,IAE1BY,EAASlvB,KAAKgwC,KAAK4J,GACZ6P,EAAeN,EAAUj6B,EAAOpuB,QAAQ,GAAKouB,EAAOpuB,QAAWouB,QAK1EN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASkgB,GACxE,IAAI1gB,EAAOgG,GAAW0a,GAClB6a,EAAY,0BAA0Bj3B,KAAKoc,GAAc,MAAQ,OACjEua,EAAe,kBAAkB32B,KAAKoc,GAE1CnW,GAAOtE,UAAUya,GAAc,WAC7B,IAAIxgB,EAAOsgB,UACX,GAAIya,IAAiBrpD,KAAKu5B,UAAW,CACnC,IAAIz4B,EAAQd,KAAKc,QACjB,OAAOstB,EAAKD,MAAM1W,GAAQ3W,GAASA,EAAQ,GAAIwtB,GAEjD,OAAOtuB,KAAK2pD,IAAW,SAAS7oD,GAC9B,OAAOstB,EAAKD,MAAM1W,GAAQ3W,GAASA,EAAQ,GAAIwtB,UAMrD0S,GAAWnI,GAAYxE,WAAW,SAASjG,EAAM0gB,GAC/C,IAAIsa,EAAazwB,GAAOmW,GACxB,GAAIsa,EAAY,CACd,IAAI1vC,EAAM0vC,EAAW/qD,KAAO,GACvB4D,GAAed,KAAK62B,GAAWte,KAClCse,GAAUte,GAAO,IAEnBse,GAAUte,GAAKhX,KAAK,CAAE,KAAQosC,EAAY,KAAQsa,QAItDpxB,GAAUyX,GAAa7rC,EAAWsf,GAAoB7kB,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQuF,IAIVi1B,GAAYxE,UAAU6F,MAAQH,GAC9BlB,GAAYxE,UAAUoD,QAAUwC,GAChCpB,GAAYxE,UAAUvzB,MAAQyU,GAG9BojB,GAAOtE,UAAUqsB,GAAK7G,GACtBlhB,GAAOtE,UAAUqlB,MAAQI,GACzBnhB,GAAOtE,UAAUu1B,OAAS7P,GAC1BphB,GAAOtE,UAAU5rB,KAAOuxC,GACxBrhB,GAAOtE,UAAU+b,MAAQ+J,GACzBxhB,GAAOtE,UAAUoD,QAAU2iB,GAC3BzhB,GAAOtE,UAAUw1B,OAASlxB,GAAOtE,UAAUoE,QAAUE,GAAOtE,UAAUvzB,MAAQw5C,GAG9E3hB,GAAOtE,UAAUy0B,MAAQnwB,GAAOtE,UAAUyiB,KAEtChhB,KACF6C,GAAOtE,UAAUyB,IAAeokB,IAE3BvhB,IAML7E,GAAID,KAQN3kB,GAAK4kB,EAAIA,GAIT,aACE,OAAOA,IACR,qCAaH3yB,KAAKnB,Q,2JCjzhBQV,cAAUlB,OAAO,CAC9BC,KAAM,mBAENoB,MAAO,CAAEyP,KAAMtP,SAEfoB,SAAU,CACR8oD,SACE,OAAO9pD,KAAKkP,KACRlP,KAAK+pD,WACLzqD,OAAU4B,QAAQF,SAAS8oD,OAAO3oD,KAAKnB,QAI/CzB,SAEE,OACEyB,KAAK8T,OAAOjU,SACZG,KAAK8T,OAAOjU,QAASkI,KAAKiiD,IAASA,EAAKjrD,WAA2B,MAAdirD,EAAKhrD,U,sNCpBjDb,SAAIC,OAAO,CACxBC,KAAM,mBAENC,YAAY,EAEZC,OAAQC,GAAG,KAAEC,EAAF,SAAQC,IAGjB,OAFAD,EAAKE,aAAe,sBAAqBF,EAAKE,aAAe,KAAMwO,OAE5D3O,EAAE,MAAOC,EAAMC,M,gGCkB1B,MAAMwF,EAAahF,eACjB+qD,OACAC,OACA/qD,OACAgrD,eAAkB,QAClBC,QAaalmD,QAAW9F,SAAkBA,OAAO,CACjDC,KAAM,eAENyF,WAAY,CAAEyL,eAEd9P,MAAO,CACLK,YAAa,CACXH,KAAMI,OACNF,QAAS,IAEXyU,WAAY,CACV3U,KAAMI,OACNF,QAAS,WAEXyB,MAAO,CACL3B,KAAMI,OACNF,QAAS,WAEXQ,SAAUT,QACVo5C,MAAO,CAACj5C,OAAQknB,QAChBojC,SAAUzqD,QACV0qD,YAAavqD,OACbwP,OAAQ,CACN5P,KAAM,CAACC,QAAS6F,QAChB5F,SAAS,GAEX0qD,SAAU3qD,SAGZoB,SAAU,CACRC,UACE,MAAO,CACL,uBAAwBjB,KAAKyC,SAC7B,yBAA0BzC,KAAKK,SAC/B,0BAA2BL,KAAKqqD,SAChC,0BAA2BrqD,KAAKuqD,YAKtCjiD,MAAO,CACL7F,SAAU8F,IAEHvI,KAAKuqD,UAAYhiD,GACpBvI,KAAKwqD,MAAQxqD,KAAKwqD,KAAKC,UAAUzqD,KAAKgT,OAG1C03C,OAAQ,iBAGV/oD,UACE3B,KAAKwqD,MAAQxqD,KAAKwqD,KAAKG,SAAS3qD,MAE5BA,KAAKg5C,OACPh5C,KAAK0qD,QACS,MAAd1qD,KAAKc,QAELd,KAAKyC,SAAWzC,KAAK4qD,WAAW5qD,KAAK0qD,OAAOtoB,QAIhDyoB,gBACE7qD,KAAKwqD,MAAQxqD,KAAKwqD,KAAKM,WAAW9qD,OAGpCmC,QAAS,CACPC,MAAOC,GACDrC,KAAKK,WAETL,KAAK0d,UAAW,EAEhB1d,KAAKsC,MAAM,QAASD,GACpBrC,KAAKsO,UAAU,IAAOtO,KAAKyC,UAAYzC,KAAKyC,YAE9CqY,QAASlL,GACP,OAAO5P,KAAK2C,eAAeC,OAAOgN,IAEpCm7C,gBACE,MAAMn7C,GAAQ5P,KAAKuqD,UAAWvqD,KAAKsU,WAC7Bd,EAAO9P,eAAQ1D,KAAM,cAE3B,OAAK4P,GAAS4D,EAEPxT,KAAK2C,eAAeqoD,EAAe,CACxCrsD,YAAa,qCACZ,CACD6U,GAAQxT,KAAK8a,QAAQlL,KALI,MAQ7B2C,YACE,OAAOvS,KAAK2C,eAAe+O,OAAW,CACpC/S,YAAa,uBACbuE,MAAO,CACL,gBAAiBnD,OAAOC,KAAKyC,UAC7BmK,KAAM,UAERC,MAAO,CACL,CAAC7M,KAAKF,aAAcE,KAAKyC,UAE3BhD,MAAO,CACLoS,WAAY7R,KAAKyC,UAEnBqB,WAAY,CAAC,CACXzF,KAAM,SACNyC,MAAOd,KAAKuP,SAEdjM,GAAI,IACCtD,KAAKirD,WACR7oD,MAAOpC,KAAKoC,QAEb,CACDpC,KAAKkrD,iBACLxnD,eAAQ1D,KAAM,aACdA,KAAK+qD,mBAGTI,WACE,OAAOnrD,KAAKgP,gBAAgB,IAAM,CAChChP,KAAK2C,eAAe,MAAO,CACzBhE,YAAa,sBACbmF,WAAY,CAAC,CACXzF,KAAM,OACNyC,MAAOd,KAAKyC,YAEbiB,eAAQ1D,UAGfkrD,iBACE,MAAMt7C,EAAO5P,KAAKuqD,UAAgC,MAApBvqD,KAAKsqD,YAC/B,YACAtqD,KAAKsqD,YACH92C,EAAO9P,eAAQ1D,KAAM,eAE3B,OAAK4P,GAAS4D,EAEPxT,KAAK2C,eAAeqoD,EAAe,CACxCrsD,YAAa,sCACZ,CACD6U,GAAQxT,KAAK8a,QAAQlL,KALI,MAQ7Bw7C,cAAeC,GAEb,IAAKrrD,KAAKg5C,MAAO,OAEjB,MAAMv2C,EAAWzC,KAAK4qD,WAAWS,EAAGjpB,MAGhC3/B,GAAYzC,KAAKyC,WAAaA,GAChCzC,KAAKwqD,MAAQxqD,KAAKwqD,KAAKC,UAAUzqD,KAAKgT,MAGxChT,KAAKyC,SAAWA,GAElBF,OAAQqyB,GACN,MAAMnyB,EAAWzC,KAAKgT,OAAS4hB,EAE3BnyB,IAAUzC,KAAK0d,UAAW,GAC9B1d,KAAKsO,UAAU,IAAOtO,KAAKyC,SAAWA,IAExCmoD,WAAYS,GACV,OAAgC,OAAzBA,EAAGl7B,MAAMnwB,KAAKg5C,SAIzBz6C,OAAQC,GACN,OAAOA,EAAE,MAAOwB,KAAKgE,aAAahE,KAAKyC,UAAYzC,KAAKsB,MAAO,CAC7D3C,YAAa,eACbkO,MAAO7M,KAAKiB,UACV,CACFjB,KAAKuS,YACL/T,EAAE8sD,OAAmBtrD,KAAKmrD,iB,wBC/MjBjsD,iBACbqsD,OACApsD,QACAf,OAAO,CACPC,KAAM,oBAENqG,UACE,MAAO,CACL8mD,WAAW,EACXC,cAAezrD,OAInBgB,SAAU,CACRC,UACE,MAAO,IACFsqD,OAAcrqD,QAAQF,SAASC,QAAQE,KAAKnB,MAC/C,qBAAqB,KAK3BmC,QAAS,CACPupD,UACE,OAAO1rD,KAAKgE,aAAahE,KAAKsB,MAAO,IAChCiqD,OAAcrqD,QAAQiB,QAAQupD,QAAQvqD,KAAKnB,MAC9CkD,MAAO,CACL0J,KAAM,iB,wBC7BT,MAAM++C,EAAsBC,eAAuB,2BAA4B,QACzEv4C,EAAmBu4C,eAAuB,uBAAwB,OAClEt4C,EAAiBs4C,eAAuB,qBAAsB,OAC9DC,EAAoBD,eAAuB,wBAAyB,OAc7E53C,OAEAtC,OACAI,OAEAg6C,Q,wNCTG,MAAMP,EAAgBrsD,eAC3BkV,OACA23C,OACAzsD,QACAlB,OAAO,CACPC,KAAM,kBAENoB,MAAO,CACLK,YAAa,CACXH,KAAMI,OACNF,QAAS,kBAEXmsD,UAAWpsD,QACXyG,IAAK,CACH1G,KAAM,CAACuF,OAAQnF,QACfF,QAAS,MAEXkV,SAAUnV,QACVgB,IAAK,CACHjB,KAAMI,OACNF,QAAS,QAIbpB,OACE,MAAO,CAILwtD,uBAAkCroD,IAAf5D,KAAKc,MACpBd,KAAKc,MACLd,KAAK+U,SAAW,QAAKnR,EACzB4M,MAAO,KAIXxP,SAAU,CACRC,UACE,MAAO,CACL,gBAAgB,KACbjB,KAAKwB,eAGZuE,gBACE,OAAQ/F,KAAK0e,cAAgB1e,KAAKwQ,MAAM/F,QAAQzK,KAAK0e,gBAAmB,GAE1EA,eACE,IAAI1e,KAAK+U,SAET,OAAO/U,KAAKgR,cAAc,IAE5BA,gBACE,OAAOhR,KAAKwQ,MAAM3R,OAAO,CAACsS,EAAMwB,IACvB3S,KAAKksD,aAAalsD,KAAKoR,SAASD,EAAMwB,MAGjD2L,iBACE,OAA0B,MAAtBte,KAAK8X,cAA8B,GAEhCvN,MAAMkN,QAAQzX,KAAK8X,eACtB9X,KAAK8X,cACL,CAAC9X,KAAK8X,gBAEZo0C,eACE,IAAKlsD,KAAK+U,SACR,OAAQ6I,GAAW5d,KAAKoZ,gBAAgBpZ,KAAK8X,cAAe8F,GAG9D,MAAM9F,EAAgB9X,KAAK8X,cAC3B,OAAIvN,MAAMkN,QAAQK,GACR8F,GAAW9F,EAAc0G,KAAK2tC,GAAUnsD,KAAKoZ,gBAAgB+yC,EAAQvuC,IAGxE,KAAM,IAIjBtV,MAAO,CACLwP,cAAe,mBACftH,MAAO,oBAGT7O,UACM3B,KAAK+U,WAAaxK,MAAMkN,QAAQzX,KAAK8X,gBACvCs0C,eAAY,oEAAqEpsD,OAIrFmC,QAAS,CAEPupD,UACE,MAAO,CACL7+C,MAAO7M,KAAKiB,UAGhBmQ,SAAUD,EAAyBgI,GACjC,YAAsBvV,IAAfuN,EAAKrQ,MACRqY,EACAhI,EAAKrQ,OAEXyb,QAASpL,GACPnR,KAAKqsD,oBACHrsD,KAAKoR,SAASD,EAAMnR,KAAKwQ,MAAM/F,QAAQ0G,MAG3Cw5C,SAAUx5C,GACR,MAAMwB,EAAQ3S,KAAKwQ,MAAM9N,KAAKyO,GAAQ,EAEtCA,EAAKm7C,IAAI,SAAU,IAAMtsD,KAAKuc,QAAQpL,IAIlCnR,KAAKgsD,YAAchsD,KAAKse,eAAerf,QACzCe,KAAKusD,kBAGPvsD,KAAKwsD,WAAWr7C,EAAMwB,IAExBm4C,WAAY35C,GACV,GAAInR,KAAK4L,aAAc,OAEvB,MAAM+G,EAAQ3S,KAAKwQ,MAAM/F,QAAQ0G,GAC3BrQ,EAAQd,KAAKoR,SAASD,EAAMwB,GAElC3S,KAAKwQ,MAAMmN,OAAOhL,EAAO,GAEzB,MAAM85C,EAAazsD,KAAKse,eAAe7T,QAAQ3J,GAG/C,KAAI2rD,EAAa,GAAjB,CAGA,IAAKzsD,KAAKgsD,UACR,OAAOhsD,KAAKqsD,oBAAoBvrD,GAI9Bd,KAAK+U,UAAYxK,MAAMkN,QAAQzX,KAAK8X,eACtC9X,KAAK8X,cAAgB9X,KAAK8X,cAAcjZ,OAAO+e,GAAKA,IAAM9c,GAE1Dd,KAAK8X,mBAAgBlU,EAMlB5D,KAAKgR,cAAc/R,QACtBe,KAAKusD,iBAAgB,KAGzBC,WAAYr7C,EAAyBwB,GACnC,MAAM7R,EAAQd,KAAKoR,SAASD,EAAMwB,GAElCxB,EAAK1O,SAAWzC,KAAKksD,aAAaprD,IAGpC4rD,mBACE1sD,KAAKsO,UAAU,KACb,GAAItO,KAAKgsD,YACNhsD,KAAKgR,cAAc/R,OAEpB,OAAOe,KAAKusD,kBAMdvsD,KAAKwQ,MAAM3O,QAAQ7B,KAAKwsD,eAG5BH,oBAAqBvrD,GACnBd,KAAK+U,SACD/U,KAAK2sD,eAAe7rD,GACpBd,KAAK4sD,aAAa9rD,IAExByrD,gBAAiBzyC,GACf,IAAK9Z,KAAKwQ,MAAMvR,OAAQ,OAExB,MAAMuR,EAAQxQ,KAAKwQ,MAAMoC,QAErBkH,GAAMtJ,EAAMinB,UAEhB,MAAMtmB,EAAOX,EAAMzI,KAAKoJ,IAASA,EAAK9Q,UAItC,IAAK8Q,EAAM,OAEX,MAAMwB,EAAQ3S,KAAKwQ,MAAM/F,QAAQ0G,GAEjCnR,KAAKqsD,oBACHrsD,KAAKoR,SAASD,EAAMwB,KAGxBg6C,eAAgB7rD,GACd,MAAMqwC,EAAe5mC,MAAMkN,QAAQzX,KAAK8X,eACpC9X,KAAK8X,cACL,GACEA,EAAgBq5B,EAAav+B,QAC7BD,EAAQmF,EAAcoB,UAAU3Q,GAAOvI,KAAKoZ,gBAAgB7Q,EAAKzH,IAGrEd,KAAKgsD,WAELr5C,GAAS,GAETmF,EAAc7Y,OAAS,EAAI,GAKf,MAAZe,KAAKqG,KAELsM,EAAQ,GAERmF,EAAc7Y,OAAS,EAAIe,KAAKqG,MAGlCsM,GAAS,EACLmF,EAAc6F,OAAOhL,EAAO,GAC5BmF,EAAcpV,KAAK5B,GAEvBd,KAAK8X,cAAgBA,IAEvB80C,aAAc9rD,GACZ,MAAM+rD,EAAS7sD,KAAKoZ,gBAAgBpZ,KAAK8X,cAAehX,GAEpDd,KAAKgsD,WAAaa,IAEtB7sD,KAAK8X,cAAgB+0C,OAASjpD,EAAY9C,KAI9CvC,OAAQC,GACN,OAAOA,EAAEwB,KAAKY,IAAKZ,KAAK0rD,UAAWhoD,eAAQ1D,UAIhCurD,EAAcntD,OAAO,CAClCC,KAAM,eAENqG,UACE,MAAO,CACLooD,UAAW9sD,U,8CC1QjB+sB,EAAOH,QAAU,SAASG,GAoBzB,OAnBKA,EAAOggC,kBACXhgC,EAAOigC,UAAY,aACnBjgC,EAAO6R,MAAQ,GAEV7R,EAAOruB,WAAUquB,EAAOruB,SAAW,IACxC+G,OAAOwwB,eAAelJ,EAAQ,SAAU,CACvCkgC,YAAY,EACZpuC,IAAK,WACJ,OAAOkO,EAAOmgC,KAGhBznD,OAAOwwB,eAAelJ,EAAQ,KAAM,CACnCkgC,YAAY,EACZpuC,IAAK,WACJ,OAAOkO,EAAO5T,KAGhB4T,EAAOggC,gBAAkB,GAEnBhgC,I,qICNO7tB,iBACbC,OACAguD,OACA7oD,QAEAlG,OAAO,CACPC,KAAM,WAENoB,MAAO,CACLoD,KAAMjD,QACNoD,MAAOpD,QACPqD,KAAM,CACJtD,KAAM,CAACuF,OAAQnF,QACfF,QAAS,KAIbmB,SAAU,CACRC,UACE,MAAO,CACL,iBAAkBjB,KAAK6C,KACvB,kBAAmB7C,KAAKgD,SACrBhD,KAAK+M,iBAGZ7E,SACE,MAAO,CACLlB,OAAQL,eAAc3G,KAAKiD,MAC3BkE,SAAUR,eAAc3G,KAAKiD,MAC7BuD,MAAOG,eAAc3G,KAAKiD,SACvBjD,KAAKotD,oBAKd7uD,OAAQC,GACN,MAAMC,EAAO,CACXE,YAAa,WACbkO,MAAO7M,KAAKiB,QACZmM,MAAOpN,KAAKkI,OACZ5E,GAAItD,KAAKuN,YAGX,OAAO/O,EAAE,MAAOwB,KAAK+D,mBAAmB/D,KAAKsB,MAAO7C,GAAOiF,eAAQ1D,UCtDxDqtD,ICIAA,SAAQjvD,OAAO,CAC5BC,KAAM,qBAENoB,MAAO,CACL6tD,WAAY1tD,QACZqD,KAAM,CACJtD,KAAM,CAACuF,OAAQnF,QACfF,QAAS,KAIbmB,SAAU,CACRC,UACE,MAAO,CACL,kCAAmCjB,KAAKstD,cACrCD,EAAQnsD,QAAQF,SAASC,QAAQE,KAAKnB,MACzC,iBAAkBA,KAAKgI,MAAQhI,KAAKstD,cAK1C/uD,OAAQC,GACN,MAAMD,EAAS8uD,EAAQnsD,QAAQ3C,OAAO4C,KAAKnB,KAAMxB,GAKjD,OAHAD,EAAOE,KAAOF,EAAOE,MAAQ,GAC7BF,EAAOE,KAAKE,aAAe,uBAEpBJ,M,kCClCX,4BAIeJ,cAAIC,OAAO,CACxBC,KAAM,aACNoB,MAAO,CACL2Z,gBAAiB,CACfzZ,KAAM+Q,SACN7Q,QAAS0tD,Y,kFCUAC,cAAOpvD,SAAkBA,OAAO,CAC7CC,KAAM,SAENqG,UACE,MAAO,CACL+oD,UAAU,EACVjD,KAAMxqD,OAIV0tD,OAAQ,CACN/oD,SAAU,CACR9E,SAAS,GAEX8tD,QAAS,CACP9tD,SAAS,IAIbJ,MAAO,CACL6Q,MAAO1Q,QACPS,SAAUT,QACVguD,OAAQhuD,QACRiuD,KAAMjuD,QACNkuD,IAAKluD,QACLmuD,QAASnuD,QACTouD,UAAWpuD,QACXquD,UAAWruD,QACXsuD,QAAStuD,SAGXnB,KAAMA,KAAA,CACJ0vD,OAAQ,KAGVntD,SAAU,CACRC,UACE,MAAO,IACFusD,OAAOtsD,QAAQF,SAASC,QAAQE,KAAKnB,MACxC,gBAAiBA,KAAKsQ,MACtB,mBAAoBtQ,KAAKK,SACzB,eAAgBL,KAAK6tD,KACrB,cAAe7tD,KAAK8tD,IACpB,kBAAmB9tD,KAAK+tD,QACxB,oBAAqB/tD,KAAKguD,UAC1B,mBAAoBhuD,KAAKkuD,QACzB,qBAAsBluD,KAAKiuD,aAKjC9rD,QAAS,CACPwoD,SAAUpkD,GACRvG,KAAKmuD,OAAOzrD,KAAK6D,IAEnBukD,WAAYvkD,GACV,MAAMoM,EAAQ3S,KAAKmuD,OAAOj1C,UAAUk1C,GAAKA,EAAEp7C,OAASzM,EAAQyM,MAExDL,GAAS,GAAG3S,KAAKmuD,OAAOxwC,OAAOhL,EAAO,IAE5C83C,UAAW71B,GACT,IAAI50B,KAAK4tD,OAET,IAAK,MAAM5U,KAASh5C,KAAKmuD,OACvBnV,EAAMz2C,OAAOqyB,KAKnBr2B,OAAQC,GACN,MAAMC,EAAO,CACXE,YAAa,SACbkO,MAAO7M,KAAKiB,QACZmM,MAAOpN,KAAKkI,OACZhF,MAAO,CACL0J,KAAM5M,KAAK2tD,SAAW3tD,KAAK2E,cAAWf,EAAY,UAC/C5D,KAAK4b,QAEVtY,GAAItD,KAAKirD,YAGX,OAAOzsD,EAAEwB,KAAKY,IAAKZ,KAAK+D,mBAAmB/D,KAAKsB,MAAO7C,GAAOiF,eAAQ1D,W,kICtF1E,SAASquD,IACP,OAAO,EAGT,SAASC,EAAYjsD,EAAiBksD,EAAiBjhC,GAKrD,IAAKjrB,IAAmC,IAA9BmsD,EAAcnsD,EAAGirB,GAAoB,OAAO,EAKtD,MAAMpe,EAAOu/C,eAAaF,GAC1B,GACwB,qBAAfG,YACPx/C,aAAgBw/C,YAChBx/C,EAAKy/C,OAAStsD,EAAEsJ,OAChB,OAAO,EAIT,MAAMijD,GAAsC,kBAAlBthC,EAAQxsB,OAAsBwsB,EAAQxsB,MAAM2L,SAApD,KAAuE,OASzF,OAPAmiD,EAASlsD,KAAK6rD,IAONK,EAASpwC,KAAK+vC,GAAMA,EAAG1iD,SAASxJ,EAAEsJ,SAG5C,SAAS6iD,EAAensD,EAAiBirB,GACvC,MAAM7qB,EAAqC,kBAAlB6qB,EAAQxsB,OAAsBwsB,EAAQxsB,MAAM4K,kBAAqB2iD,EAE1F,OAAO5rD,EAASJ,GAGlB,SAASwsD,EAAWxsD,EAAiBksD,EAAiBjhC,GACpD,MAAM9gB,EAAmC,oBAAlB8gB,EAAQxsB,MAAuBwsB,EAAQxsB,MAAQwsB,EAAQxsB,MAAO0L,QAErF+hD,EAAGO,cAAeC,yBAA2BT,EAAWjsD,EAAGksD,EAAIjhC,IAAYlf,WAAW,KACpFogD,EAAcnsD,EAAGirB,IAAY9gB,GAAWA,EAAQnK,IAC/C,GAGL,SAAS2sD,EAAcT,EAAiBtf,GACtC,MAAM//B,EAAOu/C,eAAaF,GAE1Btf,EAASjwB,UAEiB,qBAAf0vC,YAA8Bx/C,aAAgBw/C,YACvDzf,EAAS//B,GAIN,MAAM1K,EAAe,CAM1ByqD,SAAUV,EAAiBjhC,EAAgC4hC,GACzD,MAAM3yC,EAAWla,GAAawsD,EAAUxsD,EAAmBksD,EAAIjhC,GACzD6hC,EAAe9sD,IACnBksD,EAAGO,cAAeC,wBAA0BT,EAAWjsD,EAAmBksD,EAAIjhC,IAGhF0hC,EAAaT,EAAKa,IAChBA,EAAInwC,iBAAiB,QAAS1C,GAAS,GACvC6yC,EAAInwC,iBAAiB,YAAakwC,GAAa,KAG5CZ,EAAGO,gBACNP,EAAGO,cAAgB,CACjBC,yBAAyB,IAI7BR,EAAGO,cAAcI,EAAMv4C,QAAS3D,MAAQ,CACtCuJ,UACA4yC,gBAIJE,OAAQd,EAAiBjhC,EAAgC4hC,GAClDX,EAAGO,gBAERE,EAAaT,EAAKa,I,MAChB,IAAKA,KAAwB,QAAhBphD,EAAAugD,EAAGO,qBAAa,IAAA9gD,OAAA,EAAAA,EAAGkhD,EAAMv4C,QAAS3D,OAAO,OAEtD,MAAM,QAAEuJ,EAAF,YAAW4yC,GAAgBZ,EAAGO,cAAcI,EAAMv4C,QAAS3D,MAEjEo8C,EAAIjwC,oBAAoB,QAAS5C,GAAS,GAC1C6yC,EAAIjwC,oBAAoB,YAAagwC,GAAa,YAG7CZ,EAAGO,cAAcI,EAAMv4C,QAAS3D,SAI5BxO,U,kCCtHf,gBAGeyN,e,yDCHf,0HAuBA,MAAM/N,EAAahF,eACjBC,OACAE,OACAC,OACAC,eAAiB,iBACjBC,eAAkB,eAYL0E,SAAW9F,SAAkBA,OAAO,CACjDC,KAAM,cAENyF,WAAY,CACVwL,eAGFo+C,OAAQ,CACNlC,UAAW,CACT3rD,SAAS,GAEX4tD,SAAU,CACR5tD,SAAS,GAEX8E,SAAU,CACR9E,SAAS,GAEX8tD,QAAS,CACP9tD,SAAS,IAIbyvD,cAAc,EAEd7vD,MAAO,CACLK,YAAa,CACXH,KAAMI,OACNF,UACE,OAAKG,KAAKyrD,cAEHzrD,KAAKyrD,cAAc3rD,YAFM,KAKpCwQ,MAAO1Q,QACP2vD,SAAU3vD,QACVa,KAAMb,QACN4vD,WAAY,CACV7vD,KAAMC,SAERgB,IAAK,CACHjB,KAAMI,OACNF,QAAS,OAEXouD,UAAWruD,QACXsuD,QAAStuD,QACTkB,MAAO,MAGTrC,KAAMA,KAAA,CACJsC,WAAY,wBAGdC,SAAU,CACRC,UACE,MAAO,CACL,eAAe,KACZ5B,OAAS6B,QAAQF,SAASC,QAAQE,KAAKnB,MAC1C,qBAAsBA,KAAKsQ,MAC3B,wBAAyBtQ,KAAKK,SAC9B,oBAAqBL,KAAKoB,cAAgBpB,KAAKuvD,SAC/C,0BAA2BvvD,KAAKwvD,WAChC,0BAA2BxvD,KAAKiuD,UAChC,wBAAyBjuD,KAAKkuD,WAC3BluD,KAAKwB,eAGZJ,cACE,OAAOxB,QACLP,OAAS6B,QAAQF,SAASI,YAAYD,KAAKnB,OAC3CA,KAAKyrD,iBAKX9pD,UAEM3B,KAAKgC,OAAOC,eAAe,WAC7BsH,eAAQ,SAAUvJ,OAItBmC,QAAS,CACPC,MAAOC,GACDA,EAAEotD,QAAQzvD,KAAKiK,IAAIkM,OAEvBnW,KAAKsC,MAAM,QAASD,GAEpBrC,KAAKqrD,IAAMrrD,KAAKuC,UAElBmtD,WACE,MAAMxsD,EAA6B,CACjC,kBAAiBlD,KAAKK,eAAkBuD,EACxCC,SAAU7D,KAAKoB,cAAgBpB,KAAKK,SAAW,GAAK,KACjDL,KAAKgC,QAiBV,OAdIhC,KAAKgC,OAAOC,eAAe,SAEpBjC,KAAK2tD,UAEL3tD,KAAKwrD,WACdtoD,EAAM0J,KAAO,SACb1J,EAAM,iBAAmBnD,OAAOC,KAAKyC,WAC5BzC,KAAK2E,UACdzB,EAAM0J,KAAO5M,KAAKoB,YAAc,gBAAawC,EAC7CV,EAAM+I,GAAK/I,EAAM+I,IAAM,aAAajM,KAAKgT,MAChChT,KAAKytD,WACdvqD,EAAM0J,KAAO,aAGR1J,GAETX,SACMvC,KAAKqrD,SAA0BznD,IAApB5D,KAAK6R,aAClB7R,KAAKyC,UAAYzC,KAAKyC,UAExBzC,KAAKsC,MAAM,YAIf/D,OAAQC,GACN,IAAI,IAAEoC,EAAF,KAAOnC,GAASuB,KAAK2D,oBAEzBlF,EAAKyE,MAAQ,IACRzE,EAAKyE,SACLlD,KAAK0vD,YAEVjxD,EAAKuB,KAAKqrD,GAAK,WAAa,MAAQ,IAC/B5sD,EAAKuB,KAAKqrD,GAAK,WAAa,MAC/Bj/C,QAAU/J,IACHrC,KAAKK,WAEJgC,EAAEyI,UAAYC,OAASU,OAAOzL,KAAKoC,MAAMC,GAE7CrC,KAAKsC,MAAM,UAAWD,MAKxBrC,KAAKuvD,WAAU3uD,EAAM,OACrBZ,KAAKuvD,UAAYvvD,KAAKqrD,KACxB5sD,EAAK6E,GAAK7E,EAAKkxD,gBACRlxD,EAAKkxD,UAGd,MAAMjxD,EAAWgF,eAAQ1D,KAAM,UAAW,CACxCN,OAAQM,KAAKyC,SACbF,OAAQvC,KAAKuC,SAGf,OAAO/D,EAAEoC,EAAKZ,KAAKyC,SAAWzC,KAAKgE,aAAahE,KAAKsB,MAAO7C,GAAQA,EAAMC,O,yDC9L9E,gBAGeP,cAAIC,OAAO,CACxBC,KAAM,aAENoB,MAAO,CACLmwD,YAAa,MAGfnxD,KAAMA,KAAA,CACJgE,UAAU,EACVotD,cAAe,OAGjBvnD,MAAO,CACL7F,SAAU8F,GACJA,EACFvI,KAAK6vD,cAAgB7vD,KAAK4vD,YAE1B5vD,KAAKsC,MAAM,sBAAuBtC,KAAK6vD,iBAK7C1tD,QAAS,CACP2tD,KAAMhvD,GACJd,KAAK6vD,cAAgB/uD,EACrBsN,WAAW,KACTpO,KAAKyC,UAAW,S","file":"js/chunk-018967fb.957afee9.js","sourcesContent":["// Types\nimport Vue, { VNode } from 'vue'\n\n/* @vue/component */\nexport default Vue.extend({\n name: 'v-list-item-action',\n\n functional: true,\n\n render (h, { data, children = [] }): VNode {\n data.staticClass = data.staticClass ? `v-list-item__action ${data.staticClass}` : 'v-list-item__action'\n const filteredChild = children.filter(VNode => {\n return VNode.isComment === false && VNode.text !== ' '\n })\n if (filteredChild.length > 1) data.staticClass += ' v-list-item__action--stack'\n\n return h('div', data, children)\n },\n})\n","// Styles\nimport './VChip.sass'\n\n// Types\nimport { VNode } from 'vue'\nimport mixins from '../../util/mixins'\n\n// Components\nimport { VExpandXTransition } from '../transitions'\nimport VIcon from '../VIcon'\n\n// Mixins\nimport Colorable from '../../mixins/colorable'\nimport { factory as GroupableFactory } from '../../mixins/groupable'\nimport Themeable from '../../mixins/themeable'\nimport { factory as ToggleableFactory } from '../../mixins/toggleable'\nimport Routable from '../../mixins/routable'\nimport Sizeable from '../../mixins/sizeable'\n\n// Utilities\nimport { breaking } from '../../util/console'\nimport { getSlot } from '../../util/helpers'\n\n// Types\nimport { PropValidator, PropType } from 'vue/types/options'\n\n/* @vue/component */\nexport default mixins(\n Colorable,\n Sizeable,\n Routable,\n Themeable,\n GroupableFactory('chipGroup'),\n ToggleableFactory('inputValue')\n).extend({\n name: 'v-chip',\n\n props: {\n active: {\n type: Boolean,\n default: true,\n },\n activeClass: {\n type: String,\n default (): string | undefined {\n if (!this.chipGroup) return ''\n\n return this.chipGroup.activeClass\n },\n } as any as PropValidator,\n close: Boolean,\n closeIcon: {\n type: String,\n default: '$delete',\n },\n closeLabel: {\n type: String,\n default: '$vuetify.close',\n },\n disabled: Boolean,\n draggable: Boolean,\n filter: Boolean,\n filterIcon: {\n type: String,\n default: '$complete',\n },\n label: Boolean,\n link: Boolean,\n outlined: Boolean,\n pill: Boolean,\n tag: {\n type: String,\n default: 'span',\n },\n textColor: String,\n value: null as any as PropType,\n },\n\n data: () => ({\n proxyClass: 'v-chip--active',\n }),\n\n computed: {\n classes (): object {\n return {\n 'v-chip': true,\n ...Routable.options.computed.classes.call(this),\n 'v-chip--clickable': this.isClickable,\n 'v-chip--disabled': this.disabled,\n 'v-chip--draggable': this.draggable,\n 'v-chip--label': this.label,\n 'v-chip--link': this.isLink,\n 'v-chip--no-color': !this.color,\n 'v-chip--outlined': this.outlined,\n 'v-chip--pill': this.pill,\n 'v-chip--removable': this.hasClose,\n ...this.themeClasses,\n ...this.sizeableClasses,\n ...this.groupClasses,\n }\n },\n hasClose (): boolean {\n return Boolean(this.close)\n },\n isClickable (): boolean {\n return Boolean(\n Routable.options.computed.isClickable.call(this) ||\n this.chipGroup\n )\n },\n },\n\n created () {\n const breakingProps = [\n ['outline', 'outlined'],\n ['selected', 'input-value'],\n ['value', 'active'],\n ['@input', '@active.sync'],\n ]\n\n /* istanbul ignore next */\n breakingProps.forEach(([original, replacement]) => {\n if (this.$attrs.hasOwnProperty(original)) breaking(original, replacement, this)\n })\n },\n\n methods: {\n click (e: MouseEvent): void {\n this.$emit('click', e)\n\n this.chipGroup && this.toggle()\n },\n genFilter (): VNode {\n const children = []\n\n if (this.isActive) {\n children.push(\n this.$createElement(VIcon, {\n staticClass: 'v-chip__filter',\n props: { left: true },\n }, this.filterIcon)\n )\n }\n\n return this.$createElement(VExpandXTransition, children)\n },\n genClose (): VNode {\n return this.$createElement(VIcon, {\n staticClass: 'v-chip__close',\n props: {\n right: true,\n size: 18,\n },\n attrs: {\n 'aria-label': this.$vuetify.lang.t(this.closeLabel),\n },\n on: {\n click: (e: Event) => {\n e.stopPropagation()\n e.preventDefault()\n\n this.$emit('click:close')\n this.$emit('update:active', false)\n },\n },\n }, this.closeIcon)\n },\n genContent (): VNode {\n return this.$createElement('span', {\n staticClass: 'v-chip__content',\n }, [\n this.filter && this.genFilter(),\n getSlot(this),\n this.hasClose && this.genClose(),\n ])\n },\n },\n\n render (h): VNode {\n const children = [this.genContent()]\n let { tag, data } = this.generateRouteLink()\n\n data.attrs = {\n ...data.attrs,\n draggable: this.draggable ? 'true' : undefined,\n tabindex: this.chipGroup && !this.disabled ? 0 : data.attrs!.tabindex,\n }\n data.directives!.push({\n name: 'show',\n value: this.active,\n })\n data = this.setBackgroundColor(this.color, data)\n\n const color = this.textColor || (this.outlined && this.color)\n\n return h(tag, this.setTextColor(color, data), children)\n },\n})\n","import VChip from './VChip'\n\nexport { VChip }\nexport default VChip\n","// Styles\nimport './VMenu.sass'\n\n// Components\nimport { VThemeProvider } from '../VThemeProvider'\n\n// Mixins\nimport Activatable from '../../mixins/activatable'\nimport Delayable from '../../mixins/delayable'\nimport Dependent from '../../mixins/dependent'\nimport Menuable from '../../mixins/menuable'\nimport Returnable from '../../mixins/returnable'\nimport Roundable from '../../mixins/roundable'\nimport Themeable from '../../mixins/themeable'\n\n// Directives\nimport ClickOutside from '../../directives/click-outside'\nimport Resize from '../../directives/resize'\n\n// Utilities\nimport mixins from '../../util/mixins'\nimport { removed } from '../../util/console'\nimport {\n convertToUnit,\n keyCodes,\n} from '../../util/helpers'\nimport goTo from '../../services/goto'\n\n// Types\nimport { VNode, VNodeDirective, VNodeData, PropType } from 'vue'\n\nconst baseMixins = mixins(\n Dependent,\n Delayable,\n Returnable,\n Roundable,\n Themeable,\n Menuable,\n)\n\n/* @vue/component */\nexport default baseMixins.extend({\n name: 'v-menu',\n\n directives: {\n ClickOutside,\n Resize,\n },\n\n provide (): object {\n return {\n isInMenu: true,\n // Pass theme through to default slot\n theme: this.theme,\n }\n },\n\n props: {\n auto: Boolean,\n closeOnClick: {\n type: Boolean,\n default: true,\n },\n closeOnContentClick: {\n type: Boolean,\n default: true,\n },\n disabled: Boolean,\n disableKeys: Boolean,\n maxHeight: {\n type: [Number, String],\n default: 'auto',\n },\n offsetX: Boolean,\n offsetY: Boolean,\n openOnHover: Boolean,\n origin: {\n type: String,\n default: 'top left',\n },\n transition: {\n type: [Boolean, String],\n default: 'v-menu-transition',\n },\n contentProps: {\n type: Object as PropType>,\n default: () => ({}),\n },\n },\n\n data () {\n return {\n calculatedTopAuto: 0,\n defaultOffset: 8,\n hasJustFocused: false,\n listIndex: -1,\n resizeTimeout: 0,\n selectedIndex: null as null | number,\n tiles: [] as HTMLElement[],\n }\n },\n\n computed: {\n activeTile (): HTMLElement | undefined {\n return this.tiles[this.listIndex]\n },\n calculatedLeft (): string {\n const menuWidth = Math.max(this.dimensions.content.width, parseFloat(this.calculatedMinWidth))\n\n if (!this.auto) return this.calcLeft(menuWidth) || '0'\n\n return convertToUnit(this.calcXOverflow(this.calcLeftAuto(), menuWidth)) || '0'\n },\n calculatedMaxHeight (): string {\n const height = this.auto\n ? '200px'\n : convertToUnit(this.maxHeight)\n\n return height || '0'\n },\n calculatedMaxWidth (): string {\n return convertToUnit(this.maxWidth) || '0'\n },\n calculatedMinWidth (): string {\n if (this.minWidth) {\n return convertToUnit(this.minWidth) || '0'\n }\n\n const minWidth = Math.min(\n this.dimensions.activator.width +\n Number(this.nudgeWidth) +\n (this.auto ? 16 : 0),\n Math.max(this.pageWidth - 24, 0)\n )\n\n const calculatedMaxWidth = isNaN(parseInt(this.calculatedMaxWidth))\n ? minWidth\n : parseInt(this.calculatedMaxWidth)\n\n return convertToUnit(Math.min(\n calculatedMaxWidth,\n minWidth\n )) || '0'\n },\n calculatedTop (): string {\n const top = !this.auto\n ? this.calcTop()\n : convertToUnit(this.calcYOverflow(this.calculatedTopAuto))\n\n return top || '0'\n },\n hasClickableTiles (): boolean {\n return Boolean(this.tiles.find(tile => tile.tabIndex > -1))\n },\n styles (): object {\n return {\n maxHeight: this.calculatedMaxHeight,\n minWidth: this.calculatedMinWidth,\n maxWidth: this.calculatedMaxWidth,\n top: this.calculatedTop,\n left: this.calculatedLeft,\n transformOrigin: this.origin,\n zIndex: this.zIndex || this.activeZIndex,\n }\n },\n },\n\n watch: {\n isActive (val) {\n if (!val) this.listIndex = -1\n },\n isContentActive (val) {\n this.hasJustFocused = val\n },\n listIndex (next, prev) {\n if (next in this.tiles) {\n const tile = this.tiles[next]\n tile.classList.add('v-list-item--highlighted')\n const scrollTop = this.$refs.content.scrollTop\n const contentHeight = this.$refs.content.clientHeight\n\n if (scrollTop > tile.offsetTop - 8) {\n goTo(tile.offsetTop - tile.clientHeight, {\n appOffset: false,\n duration: 300,\n container: this.$refs.content,\n })\n } else if (scrollTop + contentHeight < tile.offsetTop + tile.clientHeight + 8) {\n goTo(tile.offsetTop - contentHeight + tile.clientHeight * 2, {\n appOffset: false,\n duration: 300,\n container: this.$refs.content,\n })\n }\n }\n\n prev in this.tiles &&\n this.tiles[prev].classList.remove('v-list-item--highlighted')\n },\n },\n\n created () {\n /* istanbul ignore next */\n if (this.$attrs.hasOwnProperty('full-width')) {\n removed('full-width', this)\n }\n },\n\n mounted () {\n this.isActive && this.callActivate()\n },\n\n methods: {\n activate () {\n // Update coordinates and dimensions of menu\n // and its activator\n this.updateDimensions()\n // Start the transition\n requestAnimationFrame(() => {\n // Once transitioning, calculate scroll and top position\n this.startTransition().then(() => {\n if (this.$refs.content) {\n this.calculatedTopAuto = this.calcTopAuto()\n this.auto && (this.$refs.content.scrollTop = this.calcScrollPosition())\n }\n })\n })\n },\n calcScrollPosition () {\n const $el = this.$refs.content\n const activeTile = $el.querySelector('.v-list-item--active') as HTMLElement\n const maxScrollTop = $el.scrollHeight - $el.offsetHeight\n\n return activeTile\n ? Math.min(maxScrollTop, Math.max(0, activeTile.offsetTop - $el.offsetHeight / 2 + activeTile.offsetHeight / 2))\n : $el.scrollTop\n },\n calcLeftAuto () {\n return parseInt(this.dimensions.activator.left - this.defaultOffset * 2)\n },\n calcTopAuto () {\n const $el = this.$refs.content\n const activeTile = $el.querySelector('.v-list-item--active') as HTMLElement | null\n\n if (!activeTile) {\n this.selectedIndex = null\n }\n\n if (this.offsetY || !activeTile) {\n return this.computedTop\n }\n\n this.selectedIndex = Array.from(this.tiles).indexOf(activeTile)\n\n const tileDistanceFromMenuTop = activeTile.offsetTop - this.calcScrollPosition()\n const firstTileOffsetTop = ($el.querySelector('.v-list-item') as HTMLElement).offsetTop\n\n return this.computedTop - tileDistanceFromMenuTop - firstTileOffsetTop - 1\n },\n changeListIndex (e: KeyboardEvent) {\n // For infinite scroll and autocomplete, re-evaluate children\n this.getTiles()\n\n if (!this.isActive || !this.hasClickableTiles) {\n return\n } else if (e.keyCode === keyCodes.tab) {\n this.isActive = false\n return\n } else if (e.keyCode === keyCodes.down) {\n this.nextTile()\n } else if (e.keyCode === keyCodes.up) {\n this.prevTile()\n } else if (e.keyCode === keyCodes.end) {\n this.lastTile()\n } else if (e.keyCode === keyCodes.home) {\n this.firstTile()\n } else if (e.keyCode === keyCodes.enter && this.listIndex !== -1) {\n this.tiles[this.listIndex].click()\n } else { return }\n // One of the conditions was met, prevent default action (#2988)\n e.preventDefault()\n },\n closeConditional (e: Event) {\n const target = e.target as HTMLElement\n\n return this.isActive &&\n !this._isDestroyed &&\n this.closeOnClick &&\n !this.$refs.content.contains(target)\n },\n genActivatorAttributes () {\n const attributes = Activatable.options.methods.genActivatorAttributes.call(this)\n\n if (this.activeTile && this.activeTile.id) {\n return {\n ...attributes,\n 'aria-activedescendant': this.activeTile.id,\n }\n }\n\n return attributes\n },\n genActivatorListeners () {\n const listeners = Menuable.options.methods.genActivatorListeners.call(this)\n\n if (!this.disableKeys) {\n listeners.keydown = this.onKeyDown\n }\n\n return listeners\n },\n genTransition (): VNode {\n const content = this.genContent()\n\n if (!this.transition) return content\n\n return this.$createElement('transition', {\n props: {\n name: this.transition,\n },\n }, [content])\n },\n genDirectives (): VNodeDirective[] {\n const directives: VNodeDirective[] = [{\n name: 'show',\n value: this.isContentActive,\n }]\n\n // Do not add click outside for hover menu\n if (!this.openOnHover && this.closeOnClick) {\n directives.push({\n name: 'click-outside',\n value: {\n handler: () => { this.isActive = false },\n closeConditional: this.closeConditional,\n include: () => [this.$el, ...this.getOpenDependentElements()],\n },\n })\n }\n\n return directives\n },\n genContent (): VNode {\n const options = {\n attrs: {\n ...this.getScopeIdAttrs(),\n ...this.contentProps,\n role: 'role' in this.$attrs ? this.$attrs.role : 'menu',\n },\n staticClass: 'v-menu__content',\n class: {\n ...this.rootThemeClasses,\n ...this.roundedClasses,\n 'v-menu__content--auto': this.auto,\n 'v-menu__content--fixed': this.activatorFixed,\n menuable__content__active: this.isActive,\n [this.contentClass.trim()]: true,\n },\n style: this.styles,\n directives: this.genDirectives(),\n ref: 'content',\n on: {\n click: (e: Event) => {\n const target = e.target as HTMLElement\n\n if (target.getAttribute('disabled')) return\n if (this.closeOnContentClick) this.isActive = false\n },\n keydown: this.onKeyDown,\n },\n } as VNodeData\n\n if (this.$listeners.scroll) {\n options.on = options.on || {}\n options.on.scroll = this.$listeners.scroll\n }\n\n if (!this.disabled && this.openOnHover) {\n options.on = options.on || {}\n options.on.mouseenter = this.mouseEnterHandler\n }\n\n if (this.openOnHover) {\n options.on = options.on || {}\n options.on.mouseleave = this.mouseLeaveHandler\n }\n\n return this.$createElement('div', options, this.getContentSlot())\n },\n getTiles () {\n if (!this.$refs.content) return\n\n this.tiles = Array.from(this.$refs.content.querySelectorAll('.v-list-item, .v-divider, .v-subheader'))\n },\n mouseEnterHandler () {\n this.runDelay('open', () => {\n if (this.hasJustFocused) return\n\n this.hasJustFocused = true\n })\n },\n mouseLeaveHandler (e: MouseEvent) {\n // Prevent accidental re-activation\n this.runDelay('close', () => {\n if (this.$refs.content?.contains(e.relatedTarget as HTMLElement)) return\n\n requestAnimationFrame(() => {\n this.isActive = false\n this.callDeactivate()\n })\n })\n },\n nextTile () {\n const tile = this.tiles[this.listIndex + 1]\n\n if (!tile) {\n if (!this.tiles.length) return\n\n this.listIndex = -1\n this.nextTile()\n\n return\n }\n\n this.listIndex++\n if (tile.tabIndex === -1) this.nextTile()\n },\n prevTile () {\n const tile = this.tiles[this.listIndex - 1]\n\n if (!tile) {\n if (!this.tiles.length) return\n\n this.listIndex = this.tiles.length\n this.prevTile()\n\n return\n }\n\n this.listIndex--\n if (tile.tabIndex === -1) this.prevTile()\n },\n lastTile () {\n const tile = this.tiles[this.tiles.length - 1]\n\n if (!tile) return\n\n this.listIndex = this.tiles.length - 1\n\n if (tile.tabIndex === -1) this.prevTile()\n },\n firstTile () {\n const tile = this.tiles[0]\n\n if (!tile) return\n\n this.listIndex = 0\n\n if (tile.tabIndex === -1) this.nextTile()\n },\n onKeyDown (e: KeyboardEvent) {\n if (this.disableKeys) return\n\n if (e.keyCode === keyCodes.esc) {\n // Wait for dependent elements to close first\n setTimeout(() => { this.isActive = false })\n const activator = this.getActivator()\n this.$nextTick(() => activator && activator.focus())\n } else if (\n !this.isActive &&\n [keyCodes.up, keyCodes.down].includes(e.keyCode)\n ) {\n this.isActive = true\n }\n\n // Allow for isActive watcher to generate tile list\n this.$nextTick(() => this.changeListIndex(e))\n },\n onResize () {\n if (!this.isActive) return\n\n // Account for screen resize\n // and orientation change\n // eslint-disable-next-line no-unused-expressions\n this.$refs.content.offsetWidth\n this.updateDimensions()\n\n // When resizing to a smaller width\n // content width is evaluated before\n // the new activator width has been\n // set, causing it to not size properly\n // hacky but will revisit in the future\n clearTimeout(this.resizeTimeout)\n this.resizeTimeout = window.setTimeout(this.updateDimensions, 100)\n },\n },\n\n render (h): VNode {\n const data = {\n staticClass: 'v-menu',\n class: {\n 'v-menu--attached':\n this.attach === '' ||\n this.attach === true ||\n this.attach === 'attach',\n },\n directives: [{\n arg: '500',\n name: 'resize',\n value: this.onResize,\n }],\n }\n\n return h('div', data, [\n !this.activator && this.genActivator(),\n this.showLazyContent(() => [\n this.$createElement(VThemeProvider, {\n props: {\n root: true,\n light: this.light,\n dark: this.dark,\n },\n }, [this.genTransition()]),\n ]),\n ])\n },\n})\n","import VMenu from './VMenu'\n\nexport { VMenu }\nexport default VMenu\n","import './VSimpleCheckbox.sass'\n\nimport Ripple from '../../directives/ripple'\n\nimport Vue, { VNode, VNodeDirective } from 'vue'\nimport { VIcon } from '../VIcon'\n\n// Mixins\nimport Colorable from '../../mixins/colorable'\nimport Themeable from '../../mixins/themeable'\n\n// Utilities\nimport mergeData from '../../util/mergeData'\nimport { wrapInArray } from '../../util/helpers'\n\nexport default Vue.extend({\n name: 'v-simple-checkbox',\n\n functional: true,\n\n directives: {\n Ripple,\n },\n\n props: {\n ...Colorable.options.props,\n ...Themeable.options.props,\n disabled: Boolean,\n ripple: {\n type: Boolean,\n default: true,\n },\n value: Boolean,\n indeterminate: Boolean,\n indeterminateIcon: {\n type: String,\n default: '$checkboxIndeterminate',\n },\n onIcon: {\n type: String,\n default: '$checkboxOn',\n },\n offIcon: {\n type: String,\n default: '$checkboxOff',\n },\n },\n\n render (h, { props, data, listeners }): VNode {\n const children = []\n let icon = props.offIcon\n if (props.indeterminate) icon = props.indeterminateIcon\n else if (props.value) icon = props.onIcon\n\n children.push(h(VIcon, Colorable.options.methods.setTextColor(props.value && props.color, {\n props: {\n disabled: props.disabled,\n dark: props.dark,\n light: props.light,\n },\n }), icon))\n\n if (props.ripple && !props.disabled) {\n const ripple = h('div', Colorable.options.methods.setTextColor(props.color, {\n staticClass: 'v-input--selection-controls__ripple',\n directives: [{\n def: Ripple,\n name: 'ripple',\n value: { center: true },\n }] as VNodeDirective[],\n }))\n\n children.push(ripple)\n }\n\n return h('div',\n mergeData(data, {\n class: {\n 'v-simple-checkbox': true,\n 'v-simple-checkbox--disabled': props.disabled,\n },\n on: {\n click: (e: MouseEvent) => {\n e.stopPropagation()\n\n if (data.on && data.on.input && !props.disabled) {\n wrapInArray(data.on.input).forEach(f => f(!props.value))\n }\n },\n },\n }), [\n h('div', { staticClass: 'v-input--selection-controls__input' }, children),\n ])\n },\n})\n","// Styles\nimport './VSubheader.sass'\n\n// Mixins\nimport Themeable from '../../mixins/themeable'\nimport mixins from '../../util/mixins'\nimport { getSlot } from '../../util/helpers'\n\n// Types\nimport { VNode } from 'vue'\n\nexport default mixins(\n Themeable\n /* @vue/component */\n).extend({\n name: 'v-subheader',\n\n props: {\n inset: Boolean,\n },\n\n render (h): VNode {\n return h('div', {\n staticClass: 'v-subheader',\n class: {\n 'v-subheader--inset': this.inset,\n ...this.themeClasses,\n },\n attrs: this.$attrs,\n on: this.$listeners,\n }, getSlot(this))\n },\n})\n","import VSubheader from './VSubheader'\n\nexport { VSubheader }\nexport default VSubheader\n","// Components\nimport VSimpleCheckbox from '../VCheckbox/VSimpleCheckbox'\nimport VDivider from '../VDivider'\nimport VSubheader from '../VSubheader'\nimport {\n VList,\n VListItem,\n VListItemAction,\n VListItemContent,\n VListItemTitle,\n} from '../VList'\n\n// Directives\nimport ripple from '../../directives/ripple'\n\n// Mixins\nimport Colorable from '../../mixins/colorable'\nimport Themeable from '../../mixins/themeable'\n\n// Helpers\nimport { getPropertyFromItem } from '../../util/helpers'\n\n// Types\nimport mixins from '../../util/mixins'\nimport { VNode, PropType, VNodeChildren } from 'vue'\nimport { PropValidator } from 'vue/types/options'\nimport { SelectItemKey } from 'vuetify/types'\n\ntype ListTile = { item: any, disabled?: null | boolean, value?: boolean, index: number };\n\n/* @vue/component */\nexport default mixins(Colorable, Themeable).extend({\n name: 'v-select-list',\n\n // https://github.com/vuejs/vue/issues/6872\n directives: {\n ripple,\n },\n\n props: {\n action: Boolean,\n dense: Boolean,\n hideSelected: Boolean,\n items: {\n type: Array,\n default: () => [],\n } as PropValidator,\n itemDisabled: {\n type: [String, Array, Function] as PropType,\n default: 'disabled',\n },\n itemText: {\n type: [String, Array, Function] as PropType,\n default: 'text',\n },\n itemValue: {\n type: [String, Array, Function] as PropType,\n default: 'value',\n },\n noDataText: String,\n noFilter: Boolean,\n searchInput: null as unknown as PropType,\n selectedItems: {\n type: Array,\n default: () => [],\n } as PropValidator,\n },\n\n computed: {\n parsedItems (): any[] {\n return this.selectedItems.map(item => this.getValue(item))\n },\n tileActiveClass (): string {\n return Object.keys(this.setTextColor(this.color).class || {}).join(' ')\n },\n staticNoDataTile (): VNode {\n const tile = {\n attrs: {\n role: undefined,\n },\n on: {\n mousedown: (e: Event) => e.preventDefault(), // Prevent onBlur from being called\n },\n }\n\n return this.$createElement(VListItem, tile, [\n this.genTileContent(this.noDataText),\n ])\n },\n },\n\n methods: {\n genAction (item: object, inputValue: any): VNode {\n return this.$createElement(VListItemAction, [\n this.$createElement(VSimpleCheckbox, {\n props: {\n color: this.color,\n value: inputValue,\n ripple: false,\n },\n on: {\n input: () => this.$emit('select', item),\n },\n }),\n ])\n },\n genDivider (props: { [key: string]: any }) {\n return this.$createElement(VDivider, { props })\n },\n genFilteredText (text: string) {\n text = text || ''\n\n if (!this.searchInput || this.noFilter) return text\n\n const { start, middle, end } = this.getMaskedCharacters(text)\n\n return [start, this.genHighlight(middle), end]\n },\n genHeader (props: { [key: string]: any }): VNode {\n return this.$createElement(VSubheader, { props }, props.header)\n },\n genHighlight (text: string) {\n return this.$createElement('span', { staticClass: 'v-list-item__mask' }, text)\n },\n getMaskedCharacters (text: string): {\n start: string\n middle: string\n end: string\n } {\n const searchInput = (this.searchInput || '').toString().toLocaleLowerCase()\n const index = text.toLocaleLowerCase().indexOf(searchInput)\n\n if (index < 0) return { start: text, middle: '', end: '' }\n\n const start = text.slice(0, index)\n const middle = text.slice(index, index + searchInput.length)\n const end = text.slice(index + searchInput.length)\n return { start, middle, end }\n },\n genTile ({\n item,\n index,\n disabled = null,\n value = false,\n }: ListTile): VNode | VNode[] | undefined {\n if (!value) value = this.hasItem(item)\n\n if (item === Object(item)) {\n disabled = disabled !== null\n ? disabled\n : this.getDisabled(item)\n }\n\n const tile = {\n attrs: {\n // Default behavior in list does not\n // contain aria-selected by default\n 'aria-selected': String(value),\n id: `list-item-${this._uid}-${index}`,\n role: 'option',\n },\n on: {\n mousedown: (e: Event) => {\n // Prevent onBlur from being called\n e.preventDefault()\n },\n click: () => disabled || this.$emit('select', item),\n },\n props: {\n activeClass: this.tileActiveClass,\n disabled,\n ripple: true,\n inputValue: value,\n },\n }\n\n if (!this.$scopedSlots.item) {\n return this.$createElement(VListItem, tile, [\n this.action && !this.hideSelected && this.items.length > 0\n ? this.genAction(item, value)\n : null,\n this.genTileContent(item, index),\n ])\n }\n\n const parent = this\n const scopedSlot = this.$scopedSlots.item({\n parent,\n item,\n attrs: {\n ...tile.attrs,\n ...tile.props,\n },\n on: tile.on,\n })\n\n return this.needsTile(scopedSlot)\n ? this.$createElement(VListItem, tile, scopedSlot)\n : scopedSlot\n },\n genTileContent (item: any, index = 0): VNode {\n return this.$createElement(VListItemContent, [\n this.$createElement(VListItemTitle, [\n this.genFilteredText(this.getText(item)),\n ]),\n ])\n },\n hasItem (item: object) {\n return this.parsedItems.indexOf(this.getValue(item)) > -1\n },\n needsTile (slot: VNode[] | undefined) {\n return slot!.length !== 1 ||\n slot![0].componentOptions == null ||\n slot![0].componentOptions.Ctor.options.name !== 'v-list-item'\n },\n getDisabled (item: object) {\n return Boolean(getPropertyFromItem(item, this.itemDisabled, false))\n },\n getText (item: object) {\n return String(getPropertyFromItem(item, this.itemText, item))\n },\n getValue (item: object) {\n return getPropertyFromItem(item, this.itemValue, this.getText(item))\n },\n },\n\n render (): VNode {\n const children: VNodeChildren = []\n const itemsLength = this.items.length\n for (let index = 0; index < itemsLength; index++) {\n const item = this.items[index]\n\n if (this.hideSelected &&\n this.hasItem(item)\n ) continue\n\n if (item == null) children.push(this.genTile({ item, index }))\n else if (item.header) children.push(this.genHeader(item))\n else if (item.divider) children.push(this.genDivider(item))\n else children.push(this.genTile({ item, index }))\n }\n\n children.length || children.push(this.$slots['no-data'] || this.staticNoDataTile)\n\n this.$slots['prepend-item'] && children.unshift(this.$slots['prepend-item'])\n\n this.$slots['append-item'] && children.push(this.$slots['append-item'])\n\n return this.$createElement(VList, {\n staticClass: 'v-select-list',\n class: this.themeClasses,\n attrs: {\n role: 'listbox',\n tabindex: -1,\n },\n on: {\n mousedown: (e: Event) => {\n e.preventDefault()\n },\n },\n props: { dense: this.dense },\n }, children)\n },\n})\n","import Vue from 'vue'\n\n/* @vue/component */\nexport default Vue.extend({\n name: 'filterable',\n\n props: {\n noDataText: {\n type: String,\n default: '$vuetify.noDataText',\n },\n },\n})\n","// Styles\nimport '../VTextField/VTextField.sass'\nimport './VSelect.sass'\n\n// Components\nimport VChip from '../VChip'\nimport VMenu from '../VMenu'\nimport VSelectList from './VSelectList'\n\n// Extensions\nimport VInput from '../VInput'\nimport VTextField from '../VTextField/VTextField'\n\n// Mixins\nimport Comparable from '../../mixins/comparable'\nimport Dependent from '../../mixins/dependent'\nimport Filterable from '../../mixins/filterable'\n\n// Directives\nimport ClickOutside from '../../directives/click-outside'\n\n// Utilities\nimport mergeData from '../../util/mergeData'\nimport { getPropertyFromItem, getObjectValueByPath, keyCodes } from '../../util/helpers'\nimport { consoleError } from '../../util/console'\n\n// Types\nimport mixins from '../../util/mixins'\nimport { VNode, VNodeDirective, PropType, VNodeData } from 'vue'\nimport { PropValidator } from 'vue/types/options'\nimport { SelectItemKey } from 'vuetify/types'\n\nexport const defaultMenuProps = {\n closeOnClick: false,\n closeOnContentClick: false,\n disableKeys: true,\n openOnClick: false,\n maxHeight: 304,\n}\n\n// Types\nconst baseMixins = mixins(\n VTextField,\n Comparable,\n Dependent,\n Filterable\n)\n\ninterface options extends InstanceType {\n $refs: {\n menu: InstanceType\n content: HTMLElement\n label: HTMLElement\n input: HTMLInputElement\n 'prepend-inner': HTMLElement\n 'append-inner': HTMLElement\n prefix: HTMLElement\n suffix: HTMLElement\n }\n}\n\n/* @vue/component */\nexport default baseMixins.extend().extend({\n name: 'v-select',\n\n directives: {\n ClickOutside,\n },\n\n props: {\n appendIcon: {\n type: String,\n default: '$dropdown',\n },\n attach: {\n type: null as unknown as PropType,\n default: false,\n },\n cacheItems: Boolean,\n chips: Boolean,\n clearable: Boolean,\n deletableChips: Boolean,\n disableLookup: Boolean,\n eager: Boolean,\n hideSelected: Boolean,\n items: {\n type: Array,\n default: () => [],\n } as PropValidator,\n itemColor: {\n type: String,\n default: 'primary',\n },\n itemDisabled: {\n type: [String, Array, Function] as PropType,\n default: 'disabled',\n },\n itemText: {\n type: [String, Array, Function] as PropType,\n default: 'text',\n },\n itemValue: {\n type: [String, Array, Function] as PropType,\n default: 'value',\n },\n menuProps: {\n type: [String, Array, Object],\n default: () => defaultMenuProps,\n },\n multiple: Boolean,\n openOnClear: Boolean,\n returnObject: Boolean,\n smallChips: Boolean,\n },\n\n data () {\n return {\n cachedItems: this.cacheItems ? this.items : [],\n menuIsBooted: false,\n isMenuActive: false,\n lastItem: 20,\n // As long as a value is defined, show it\n // Otherwise, check if multiple\n // to determine which default to provide\n lazyValue: this.value !== undefined\n ? this.value\n : this.multiple ? [] : undefined,\n selectedIndex: -1,\n selectedItems: [] as any[],\n keyboardLookupPrefix: '',\n keyboardLookupLastTime: 0,\n }\n },\n\n computed: {\n /* All items that the select has */\n allItems (): object[] {\n return this.filterDuplicates(this.cachedItems.concat(this.items))\n },\n classes (): object {\n return {\n ...VTextField.options.computed.classes.call(this),\n 'v-select': true,\n 'v-select--chips': this.hasChips,\n 'v-select--chips--small': this.smallChips,\n 'v-select--is-menu-active': this.isMenuActive,\n 'v-select--is-multi': this.multiple,\n }\n },\n /* Used by other components to overwrite */\n computedItems (): object[] {\n return this.allItems\n },\n computedOwns (): string {\n return `list-${this._uid}`\n },\n computedCounterValue (): number {\n const value = this.multiple\n ? this.selectedItems\n : (this.getText(this.selectedItems[0]) ?? '').toString()\n\n if (typeof this.counterValue === 'function') {\n return this.counterValue(value)\n }\n\n return value.length\n },\n directives (): VNodeDirective[] | undefined {\n return this.isFocused ? [{\n name: 'click-outside',\n value: {\n handler: this.blur,\n closeConditional: this.closeConditional,\n include: () => this.getOpenDependentElements(),\n },\n }] : undefined\n },\n dynamicHeight () {\n return 'auto'\n },\n hasChips (): boolean {\n return this.chips || this.smallChips\n },\n hasSlot (): boolean {\n return Boolean(this.hasChips || this.$scopedSlots.selection)\n },\n isDirty (): boolean {\n return this.selectedItems.length > 0\n },\n listData (): object {\n const scopeId = this.$vnode && (this.$vnode.context!.$options as { [key: string]: any })._scopeId\n const attrs = scopeId ? {\n [scopeId]: true,\n } : {}\n\n return {\n attrs: {\n ...attrs,\n id: this.computedOwns,\n },\n props: {\n action: this.multiple,\n color: this.itemColor,\n dense: this.dense,\n hideSelected: this.hideSelected,\n items: this.virtualizedItems,\n itemDisabled: this.itemDisabled,\n itemText: this.itemText,\n itemValue: this.itemValue,\n noDataText: this.$vuetify.lang.t(this.noDataText),\n selectedItems: this.selectedItems,\n },\n on: {\n select: this.selectItem,\n },\n scopedSlots: {\n item: this.$scopedSlots.item,\n },\n }\n },\n staticList (): VNode {\n if (this.$slots['no-data'] || this.$slots['prepend-item'] || this.$slots['append-item']) {\n consoleError('assert: staticList should not be called if slots are used')\n }\n\n return this.$createElement(VSelectList, this.listData)\n },\n virtualizedItems (): object[] {\n return (this.$_menuProps as any).auto\n ? this.computedItems\n : this.computedItems.slice(0, this.lastItem)\n },\n menuCanShow: () => true,\n $_menuProps (): object {\n let normalisedProps = typeof this.menuProps === 'string'\n ? this.menuProps.split(',')\n : this.menuProps\n\n if (Array.isArray(normalisedProps)) {\n normalisedProps = normalisedProps.reduce((acc, p) => {\n acc[p.trim()] = true\n return acc\n }, {})\n }\n\n return {\n ...defaultMenuProps,\n eager: this.eager,\n value: this.menuCanShow && this.isMenuActive,\n nudgeBottom: normalisedProps.offsetY ? 1 : 0, // convert to int\n ...normalisedProps,\n }\n },\n },\n\n watch: {\n internalValue (val) {\n this.initialValue = val\n this.setSelectedItems()\n\n if (this.multiple) {\n this.$nextTick(() => {\n this.$refs.menu?.updateDimensions()\n })\n }\n if (this.hideSelected) {\n this.$nextTick(() => {\n this.onScroll()\n })\n }\n },\n isMenuActive (val) {\n window.setTimeout(() => this.onMenuActiveChange(val))\n },\n items: {\n immediate: true,\n handler (val) {\n if (this.cacheItems) {\n // Breaks vue-test-utils if\n // this isn't calculated\n // on the next tick\n this.$nextTick(() => {\n this.cachedItems = this.filterDuplicates(this.cachedItems.concat(val))\n })\n }\n\n this.setSelectedItems()\n },\n },\n },\n\n methods: {\n /** @public */\n blur (e?: Event) {\n VTextField.options.methods.blur.call(this, e)\n this.isMenuActive = false\n this.isFocused = false\n this.selectedIndex = -1\n this.setMenuIndex(-1)\n },\n /** @public */\n activateMenu () {\n if (\n !this.isInteractive ||\n this.isMenuActive\n ) return\n\n this.isMenuActive = true\n },\n clearableCallback () {\n this.setValue(this.multiple ? [] : null)\n this.setMenuIndex(-1)\n this.$nextTick(() => this.$refs.input && this.$refs.input.focus())\n\n if (this.openOnClear) this.isMenuActive = true\n },\n closeConditional (e: Event) {\n if (!this.isMenuActive) return true\n\n return (\n !this._isDestroyed &&\n\n // Click originates from outside the menu content\n // Multiple selects don't close when an item is clicked\n (!this.getContent() ||\n !this.getContent().contains(e.target as Node)) &&\n\n // Click originates from outside the element\n this.$el &&\n !this.$el.contains(e.target as Node) &&\n e.target !== this.$el\n )\n },\n filterDuplicates (arr: any[]) {\n const uniqueValues = new Map()\n for (let index = 0; index < arr.length; ++index) {\n const item = arr[index]\n\n // Do not return null values if existant (#14421)\n if (item == null) {\n continue\n }\n // Do not deduplicate headers or dividers (#12517)\n if (item.header || item.divider) {\n uniqueValues.set(item, item)\n continue\n }\n\n const val = this.getValue(item)\n\n // TODO: comparator\n !uniqueValues.has(val) && uniqueValues.set(val, item)\n }\n return Array.from(uniqueValues.values())\n },\n findExistingIndex (item: object) {\n const itemValue = this.getValue(item)\n\n return (this.internalValue || []).findIndex((i: object) => this.valueComparator(this.getValue(i), itemValue))\n },\n getContent () {\n return this.$refs.menu && this.$refs.menu.$refs.content\n },\n genChipSelection (item: object, index: number) {\n const isDisabled = (\n this.isDisabled ||\n this.getDisabled(item)\n )\n const isInteractive = !isDisabled && this.isInteractive\n\n return this.$createElement(VChip, {\n staticClass: 'v-chip--select',\n attrs: { tabindex: -1 },\n props: {\n close: this.deletableChips && isInteractive,\n disabled: isDisabled,\n inputValue: index === this.selectedIndex,\n small: this.smallChips,\n },\n on: {\n click: (e: MouseEvent) => {\n if (!isInteractive) return\n\n e.stopPropagation()\n\n this.selectedIndex = index\n },\n 'click:close': () => this.onChipInput(item),\n },\n key: JSON.stringify(this.getValue(item)),\n }, this.getText(item))\n },\n genCommaSelection (item: object, index: number, last: boolean) {\n const color = index === this.selectedIndex && this.computedColor\n const isDisabled = (\n this.isDisabled ||\n this.getDisabled(item)\n )\n\n return this.$createElement('div', this.setTextColor(color, {\n staticClass: 'v-select__selection v-select__selection--comma',\n class: {\n 'v-select__selection--disabled': isDisabled,\n },\n key: JSON.stringify(this.getValue(item)),\n }), `${this.getText(item)}${last ? '' : ', '}`)\n },\n genDefaultSlot (): (VNode | VNode[] | null)[] {\n const selections = this.genSelections()\n const input = this.genInput()\n\n // If the return is an empty array\n // push the input\n if (Array.isArray(selections)) {\n selections.push(input)\n // Otherwise push it into children\n } else {\n selections.children = selections.children || []\n selections.children.push(input)\n }\n\n return [\n this.genFieldset(),\n this.$createElement('div', {\n staticClass: 'v-select__slot',\n directives: this.directives,\n }, [\n this.genLabel(),\n this.prefix ? this.genAffix('prefix') : null,\n selections,\n this.suffix ? this.genAffix('suffix') : null,\n this.genClearIcon(),\n this.genIconSlot(),\n this.genHiddenInput(),\n ]),\n this.genMenu(),\n this.genProgress(),\n ]\n },\n genIcon (\n type: string,\n cb?: (e: Event) => void,\n extraData?: VNodeData\n ) {\n const icon = VInput.options.methods.genIcon.call(this, type, cb, extraData)\n\n if (type === 'append') {\n // Don't allow the dropdown icon to be focused\n icon.children![0].data = mergeData(icon.children![0].data!, {\n attrs: {\n tabindex: icon.children![0].componentOptions!.listeners && '-1',\n 'aria-hidden': 'true',\n 'aria-label': undefined,\n },\n })\n }\n\n return icon\n },\n genInput (): VNode {\n const input = VTextField.options.methods.genInput.call(this)\n\n delete input.data!.attrs!.name\n\n input.data = mergeData(input.data!, {\n domProps: { value: null },\n attrs: {\n readonly: true,\n type: 'text',\n 'aria-readonly': String(this.isReadonly),\n 'aria-activedescendant': getObjectValueByPath(this.$refs.menu, 'activeTile.id'),\n autocomplete: getObjectValueByPath(input.data!, 'attrs.autocomplete', 'off'),\n placeholder: (!this.isDirty && (this.persistentPlaceholder || this.isFocused || !this.hasLabel)) ? this.placeholder : undefined,\n },\n on: { keypress: this.onKeyPress },\n })\n\n return input\n },\n genHiddenInput (): VNode {\n return this.$createElement('input', {\n domProps: { value: this.lazyValue },\n attrs: {\n type: 'hidden',\n name: this.attrs$.name,\n },\n })\n },\n genInputSlot (): VNode {\n const render = VTextField.options.methods.genInputSlot.call(this)\n\n render.data!.attrs = {\n ...render.data!.attrs,\n role: 'button',\n 'aria-haspopup': 'listbox',\n 'aria-expanded': String(this.isMenuActive),\n 'aria-owns': this.computedOwns,\n }\n\n return render\n },\n genList (): VNode {\n // If there's no slots, we can use a cached VNode to improve performance\n if (this.$slots['no-data'] || this.$slots['prepend-item'] || this.$slots['append-item']) {\n return this.genListWithSlot()\n } else {\n return this.staticList\n }\n },\n genListWithSlot (): VNode {\n const slots = ['prepend-item', 'no-data', 'append-item']\n .filter(slotName => this.$slots[slotName])\n .map(slotName => this.$createElement('template', {\n slot: slotName,\n }, this.$slots[slotName]))\n // Requires destructuring due to Vue\n // modifying the `on` property when passed\n // as a referenced object\n return this.$createElement(VSelectList, {\n ...this.listData,\n }, slots)\n },\n genMenu (): VNode {\n const props = this.$_menuProps as any\n props.activator = this.$refs['input-slot']\n\n if ('attach' in props) void 0\n else if (\n // TODO: make this a computed property or helper or something\n this.attach === '' || // If used as a boolean prop ()\n this.attach === true || // If bound to a boolean ()\n this.attach === 'attach' // If bound as boolean prop in pug (v-menu(attach))\n ) {\n // Attach to root el so that\n // menu covers prepend/append icons\n props.attach = this.$el\n } else {\n props.attach = this.attach\n }\n\n return this.$createElement(VMenu, {\n attrs: { role: undefined },\n props,\n on: {\n input: (val: boolean) => {\n this.isMenuActive = val\n this.isFocused = val\n },\n scroll: this.onScroll,\n },\n ref: 'menu',\n }, [this.genList()])\n },\n genSelections (): VNode {\n let length = this.selectedItems.length\n const children = new Array(length)\n\n let genSelection\n if (this.$scopedSlots.selection) {\n genSelection = this.genSlotSelection\n } else if (this.hasChips) {\n genSelection = this.genChipSelection\n } else {\n genSelection = this.genCommaSelection\n }\n\n while (length--) {\n children[length] = genSelection(\n this.selectedItems[length],\n length,\n length === children.length - 1\n )\n }\n\n return this.$createElement('div', {\n staticClass: 'v-select__selections',\n }, children)\n },\n genSlotSelection (item: object, index: number): VNode[] | undefined {\n return this.$scopedSlots.selection!({\n attrs: {\n class: 'v-chip--select',\n },\n parent: this,\n item,\n index,\n select: (e: Event) => {\n e.stopPropagation()\n this.selectedIndex = index\n },\n selected: index === this.selectedIndex,\n disabled: !this.isInteractive,\n })\n },\n getMenuIndex () {\n return this.$refs.menu ? (this.$refs.menu as { [key: string]: any }).listIndex : -1\n },\n getDisabled (item: object) {\n return getPropertyFromItem(item, this.itemDisabled, false)\n },\n getText (item: object) {\n return getPropertyFromItem(item, this.itemText, item)\n },\n getValue (item: object) {\n return getPropertyFromItem(item, this.itemValue, this.getText(item))\n },\n onBlur (e?: Event) {\n e && this.$emit('blur', e)\n },\n onChipInput (item: object) {\n if (this.multiple) this.selectItem(item)\n else this.setValue(null)\n // If all items have been deleted,\n // open `v-menu`\n if (this.selectedItems.length === 0) {\n this.isMenuActive = true\n } else {\n this.isMenuActive = false\n }\n this.selectedIndex = -1\n },\n onClick (e: MouseEvent) {\n if (!this.isInteractive) return\n\n if (!this.isAppendInner(e.target)) {\n this.isMenuActive = true\n }\n\n if (!this.isFocused) {\n this.isFocused = true\n this.$emit('focus')\n }\n\n this.$emit('click', e)\n },\n onEscDown (e: Event) {\n e.preventDefault()\n if (this.isMenuActive) {\n e.stopPropagation()\n this.isMenuActive = false\n }\n },\n onKeyPress (e: KeyboardEvent) {\n if (\n this.multiple ||\n !this.isInteractive ||\n this.disableLookup ||\n e.key.length > 1 ||\n e.ctrlKey || e.metaKey || e.altKey\n ) return\n\n const KEYBOARD_LOOKUP_THRESHOLD = 1000 // milliseconds\n const now = performance.now()\n if (now - this.keyboardLookupLastTime > KEYBOARD_LOOKUP_THRESHOLD) {\n this.keyboardLookupPrefix = ''\n }\n this.keyboardLookupPrefix += e.key.toLowerCase()\n this.keyboardLookupLastTime = now\n\n const index = this.allItems.findIndex(item => {\n const text = (this.getText(item) ?? '').toString()\n\n return text.toLowerCase().startsWith(this.keyboardLookupPrefix)\n })\n const item = this.allItems[index]\n if (index !== -1) {\n this.lastItem = Math.max(this.lastItem, index + 5)\n this.setValue(this.returnObject ? item : this.getValue(item))\n this.$nextTick(() => this.$refs.menu.getTiles())\n setTimeout(() => this.setMenuIndex(index))\n }\n },\n onKeyDown (e: KeyboardEvent) {\n if (this.isReadonly && e.keyCode !== keyCodes.tab) return\n\n const keyCode = e.keyCode\n const menu = this.$refs.menu\n\n this.$emit('keydown', e)\n\n if (!menu) return\n\n // If menu is active, allow default\n // listIndex change from menu\n if (this.isMenuActive && [keyCodes.up, keyCodes.down, keyCodes.home, keyCodes.end, keyCodes.enter].includes(keyCode)) {\n this.$nextTick(() => {\n menu.changeListIndex(e)\n this.$emit('update:list-index', menu.listIndex)\n })\n }\n\n // If enter, space, open menu\n if ([\n keyCodes.enter,\n keyCodes.space,\n ].includes(keyCode)) this.activateMenu()\n\n // If menu is not active, up/down/home/end can do\n // one of 2 things. If multiple, opens the\n // menu, if not, will cycle through all\n // available options\n if (\n !this.isMenuActive &&\n [keyCodes.up, keyCodes.down, keyCodes.home, keyCodes.end].includes(keyCode)\n ) return this.onUpDown(e)\n\n // If escape deactivate the menu\n if (keyCode === keyCodes.esc) return this.onEscDown(e)\n\n // If tab - select item or close menu\n if (keyCode === keyCodes.tab) return this.onTabDown(e)\n\n // If space preventDefault\n if (keyCode === keyCodes.space) return this.onSpaceDown(e)\n },\n onMenuActiveChange (val: boolean) {\n // If menu is closing and mulitple\n // or menuIndex is already set\n // skip menu index recalculation\n if (\n (this.multiple && !val) ||\n this.getMenuIndex() > -1\n ) return\n\n const menu = this.$refs.menu\n\n if (!menu || !this.isDirty) return\n\n // When menu opens, set index of first active item\n this.$refs.menu.getTiles()\n for (let i = 0; i < menu.tiles.length; i++) {\n if (menu.tiles[i].getAttribute('aria-selected') === 'true') {\n this.setMenuIndex(i)\n break\n }\n }\n },\n onMouseUp (e: MouseEvent) {\n // eslint-disable-next-line sonarjs/no-collapsible-if\n if (\n this.hasMouseDown &&\n e.which !== 3 &&\n this.isInteractive\n ) {\n // If append inner is present\n // and the target is itself\n // or inside, toggle menu\n if (this.isAppendInner(e.target)) {\n this.$nextTick(() => (this.isMenuActive = !this.isMenuActive))\n }\n }\n\n VTextField.options.methods.onMouseUp.call(this, e)\n },\n onScroll () {\n if (!this.isMenuActive) {\n requestAnimationFrame(() => {\n const content = this.getContent()\n if (content) content.scrollTop = 0\n })\n } else {\n if (this.lastItem > this.computedItems.length) return\n\n const showMoreItems = (\n this.getContent().scrollHeight -\n (this.getContent().scrollTop +\n this.getContent().clientHeight)\n ) < 200\n\n if (showMoreItems) {\n this.lastItem += 20\n }\n }\n },\n onSpaceDown (e: KeyboardEvent) {\n e.preventDefault()\n },\n onTabDown (e: KeyboardEvent) {\n const menu = this.$refs.menu\n\n if (!menu) return\n\n const activeTile = menu.activeTile\n\n // An item that is selected by\n // menu-index should toggled\n if (\n !this.multiple &&\n activeTile &&\n this.isMenuActive\n ) {\n e.preventDefault()\n e.stopPropagation()\n\n activeTile.click()\n } else {\n // If we make it here,\n // the user has no selected indexes\n // and is probably tabbing out\n this.blur(e)\n }\n },\n onUpDown (e: KeyboardEvent) {\n const menu = this.$refs.menu\n\n if (!menu) return\n\n e.preventDefault()\n\n // Multiple selects do not cycle their value\n // when pressing up or down, instead activate\n // the menu\n if (this.multiple) return this.activateMenu()\n\n const keyCode = e.keyCode\n\n // Cycle through available values to achieve\n // select native behavior\n menu.isBooted = true\n\n window.requestAnimationFrame(() => {\n menu.getTiles()\n\n if (!menu.hasClickableTiles) return this.activateMenu()\n\n switch (keyCode) {\n case keyCodes.up:\n menu.prevTile()\n break\n case keyCodes.down:\n menu.nextTile()\n break\n case keyCodes.home:\n menu.firstTile()\n break\n case keyCodes.end:\n menu.lastTile()\n break\n }\n this.selectItem(this.allItems[this.getMenuIndex()])\n })\n },\n selectItem (item: object) {\n if (!this.multiple) {\n this.setValue(this.returnObject ? item : this.getValue(item))\n this.isMenuActive = false\n } else {\n const internalValue = (this.internalValue || []).slice()\n const i = this.findExistingIndex(item)\n\n i !== -1 ? internalValue.splice(i, 1) : internalValue.push(item)\n this.setValue(internalValue.map((i: object) => {\n return this.returnObject ? i : this.getValue(i)\n }))\n\n // There is no item to re-highlight\n // when selections are hidden\n if (this.hideSelected) {\n this.setMenuIndex(-1)\n } else {\n const index = this.computedItems.indexOf(item)\n if (~index) {\n this.$nextTick(() => this.$refs.menu.getTiles())\n setTimeout(() => this.setMenuIndex(index))\n }\n }\n }\n },\n setMenuIndex (index: number) {\n this.$refs.menu && ((this.$refs.menu as { [key: string]: any }).listIndex = index)\n },\n setSelectedItems () {\n const selectedItems = []\n const values = !this.multiple || !Array.isArray(this.internalValue)\n ? [this.internalValue]\n : this.internalValue\n\n for (const value of values) {\n const index = this.allItems.findIndex(v => this.valueComparator(\n this.getValue(v),\n this.getValue(value)\n ))\n\n if (index > -1) {\n selectedItems.push(this.allItems[index])\n }\n }\n\n this.selectedItems = selectedItems\n },\n setValue (value: any) {\n if (!this.valueComparator(value, this.internalValue)) {\n this.internalValue = value\n this.$emit('change', value)\n }\n },\n isAppendInner (target: any) {\n // return true if append inner is present\n // and the target is itself or inside\n const appendInner = this.$refs['append-inner']\n\n return appendInner && (appendInner === target || appendInner.contains(target))\n },\n },\n})\n","// Styles\nimport './VAutocomplete.sass'\n\n// Extensions\nimport VSelect, { defaultMenuProps as VSelectMenuProps } from '../VSelect/VSelect'\nimport VTextField from '../VTextField/VTextField'\n\n// Utilities\nimport mergeData from '../../util/mergeData'\nimport {\n getObjectValueByPath,\n getPropertyFromItem,\n keyCodes,\n} from '../../util/helpers'\n\n// Types\nimport { PropType, VNode } from 'vue'\nimport { PropValidator } from 'vue/types/options'\n\nconst defaultMenuProps = {\n ...VSelectMenuProps,\n offsetY: true,\n offsetOverflow: true,\n transition: false,\n}\n\n/* @vue/component */\nexport default VSelect.extend({\n name: 'v-autocomplete',\n\n props: {\n autoSelectFirst: {\n type: Boolean,\n default: false,\n },\n filter: {\n type: Function,\n default: (item: any, queryText: string, itemText: string) => {\n return itemText.toLocaleLowerCase().indexOf(queryText.toLocaleLowerCase()) > -1\n },\n } as PropValidator<(item: any, queryText: string, itemText: string) => boolean>,\n hideNoData: Boolean,\n menuProps: {\n type: VSelect.options.props.menuProps.type,\n default: () => defaultMenuProps,\n },\n noFilter: Boolean,\n searchInput: {\n type: String as PropType,\n },\n },\n\n data () {\n return {\n lazySearch: this.searchInput,\n }\n },\n\n computed: {\n classes (): object {\n return {\n ...VSelect.options.computed.classes.call(this),\n 'v-autocomplete': true,\n 'v-autocomplete--is-selecting-index': this.selectedIndex > -1,\n }\n },\n computedItems (): object[] {\n return this.filteredItems\n },\n selectedValues (): object[] {\n return this.selectedItems.map(item => this.getValue(item))\n },\n hasDisplayedItems (): boolean {\n return this.hideSelected\n ? this.filteredItems.some(item => !this.hasItem(item))\n : this.filteredItems.length > 0\n },\n currentRange (): number {\n if (this.selectedItem == null) return 0\n\n return String(this.getText(this.selectedItem)).length\n },\n filteredItems (): object[] {\n if (!this.isSearching || this.noFilter || this.internalSearch == null) return this.allItems\n\n return this.allItems.filter(item => {\n const value = getPropertyFromItem(item, this.itemText)\n const text = value != null ? String(value) : ''\n\n return this.filter(item, String(this.internalSearch), text)\n })\n },\n internalSearch: {\n get (): string | null {\n return this.lazySearch\n },\n set (val: any) { // TODO: this should be `string | null` but it breaks lots of other types\n // emit update event only when the new\n // search value is different from previous\n if (this.lazySearch !== val) {\n this.lazySearch = val\n this.$emit('update:search-input', val)\n }\n },\n },\n isAnyValueAllowed (): boolean {\n return false\n },\n isDirty (): boolean {\n return this.searchIsDirty || this.selectedItems.length > 0\n },\n isSearching (): boolean {\n return (\n this.multiple &&\n this.searchIsDirty\n ) || (\n this.searchIsDirty &&\n this.internalSearch !== this.getText(this.selectedItem)\n )\n },\n menuCanShow (): boolean {\n if (!this.isFocused) return false\n\n return this.hasDisplayedItems || !this.hideNoData\n },\n $_menuProps (): object {\n const props = VSelect.options.computed.$_menuProps.call(this);\n (props as any).contentClass = `v-autocomplete__content ${(props as any).contentClass || ''}`.trim()\n return {\n ...defaultMenuProps,\n ...props,\n }\n },\n searchIsDirty (): boolean {\n return this.internalSearch != null &&\n this.internalSearch !== ''\n },\n selectedItem (): any {\n if (this.multiple) return null\n\n return this.selectedItems.find(i => {\n return this.valueComparator(this.getValue(i), this.getValue(this.internalValue))\n })\n },\n listData () {\n const data = VSelect.options.computed.listData.call(this) as any\n\n data.props = {\n ...data.props,\n items: this.virtualizedItems,\n noFilter: (\n this.noFilter ||\n !this.isSearching ||\n !this.filteredItems.length\n ),\n searchInput: this.internalSearch,\n }\n\n return data\n },\n },\n\n watch: {\n filteredItems: 'onFilteredItemsChanged',\n internalValue: 'setSearch',\n isFocused (val) {\n if (val) {\n document.addEventListener('copy', this.onCopy)\n this.$refs.input && this.$refs.input.select()\n } else {\n document.removeEventListener('copy', this.onCopy)\n this.blur()\n this.updateSelf()\n }\n },\n isMenuActive (val) {\n if (val || !this.hasSlot) return\n\n this.lazySearch = null\n },\n items (val, oldVal) {\n // If we are focused, the menu\n // is not active, hide no data is enabled,\n // and items change\n // User is probably async loading\n // items, try to activate the menu\n if (\n !(oldVal && oldVal.length) &&\n this.hideNoData &&\n this.isFocused &&\n !this.isMenuActive &&\n val.length\n ) this.activateMenu()\n },\n searchInput (val: string) {\n this.lazySearch = val\n },\n internalSearch: 'onInternalSearchChanged',\n itemText: 'updateSelf',\n },\n\n created () {\n this.setSearch()\n },\n\n destroyed () {\n document.removeEventListener('copy', this.onCopy)\n },\n\n methods: {\n onFilteredItemsChanged (val: never[], oldVal: never[]) {\n // TODO: How is the watcher triggered\n // for duplicate items? no idea\n if (val === oldVal) return\n\n if (!this.autoSelectFirst) {\n const preSelectedItem = oldVal[this.$refs.menu.listIndex]\n\n if (preSelectedItem) {\n this.setMenuIndex(val.findIndex(i => i === preSelectedItem))\n } else {\n this.setMenuIndex(-1)\n }\n this.$emit('update:list-index', this.$refs.menu.listIndex)\n }\n\n this.$nextTick(() => {\n if (\n !this.internalSearch ||\n (val.length !== 1 &&\n !this.autoSelectFirst)\n ) return\n\n this.$refs.menu.getTiles()\n\n if (this.autoSelectFirst && val.length) {\n this.setMenuIndex(0)\n this.$emit('update:list-index', this.$refs.menu.listIndex)\n }\n })\n },\n onInternalSearchChanged () {\n this.updateMenuDimensions()\n },\n updateMenuDimensions () {\n // Type from menuable is not making it through\n this.isMenuActive && this.$refs.menu && this.$refs.menu.updateDimensions()\n },\n changeSelectedIndex (keyCode: number) {\n // Do not allow changing of selectedIndex\n // when search is dirty\n if (this.searchIsDirty) return\n\n if (this.multiple && keyCode === keyCodes.left) {\n if (this.selectedIndex === -1) {\n this.selectedIndex = this.selectedItems.length - 1\n } else {\n this.selectedIndex--\n }\n } else if (this.multiple && keyCode === keyCodes.right) {\n if (this.selectedIndex >= this.selectedItems.length - 1) {\n this.selectedIndex = -1\n } else {\n this.selectedIndex++\n }\n } else if (keyCode === keyCodes.backspace || keyCode === keyCodes.delete) {\n this.deleteCurrentItem()\n }\n },\n deleteCurrentItem () {\n const curIndex = this.selectedIndex\n const curItem = this.selectedItems[curIndex]\n\n // Do nothing if input or item is disabled\n if (\n !this.isInteractive ||\n this.getDisabled(curItem)\n ) return\n\n const lastIndex = this.selectedItems.length - 1\n\n // Select the last item if\n // there is no selection\n if (\n this.selectedIndex === -1 &&\n lastIndex !== 0\n ) {\n this.selectedIndex = lastIndex\n\n return\n }\n\n const length = this.selectedItems.length\n const nextIndex = curIndex !== length - 1\n ? curIndex\n : curIndex - 1\n const nextItem = this.selectedItems[nextIndex]\n\n if (!nextItem) {\n this.setValue(this.multiple ? [] : null)\n } else {\n this.selectItem(curItem)\n }\n\n this.selectedIndex = nextIndex\n },\n clearableCallback () {\n this.internalSearch = null\n\n VSelect.options.methods.clearableCallback.call(this)\n },\n genInput () {\n const input = VTextField.options.methods.genInput.call(this)\n\n input.data = mergeData(input.data!, {\n attrs: {\n 'aria-activedescendant': getObjectValueByPath(this.$refs.menu, 'activeTile.id'),\n autocomplete: getObjectValueByPath(input.data!, 'attrs.autocomplete', 'off'),\n },\n domProps: { value: this.internalSearch },\n })\n\n return input\n },\n genInputSlot () {\n const slot = VSelect.options.methods.genInputSlot.call(this)\n\n slot.data!.attrs!.role = 'combobox'\n\n return slot\n },\n genSelections (): VNode | never[] {\n return this.hasSlot || this.multiple\n ? VSelect.options.methods.genSelections.call(this)\n : []\n },\n onClick (e: MouseEvent) {\n if (!this.isInteractive) return\n\n this.selectedIndex > -1\n ? (this.selectedIndex = -1)\n : this.onFocus()\n\n if (!this.isAppendInner(e.target)) this.activateMenu()\n },\n onInput (e: Event) {\n if (\n this.selectedIndex > -1 ||\n !e.target\n ) return\n\n const target = e.target as HTMLInputElement\n const value = target.value\n\n // If typing and menu is not currently active\n if (target.value) this.activateMenu()\n\n if (!this.multiple && value === '') this.deleteCurrentItem()\n\n this.internalSearch = value\n this.badInput = target.validity && target.validity.badInput\n },\n onKeyDown (e: KeyboardEvent) {\n const keyCode = e.keyCode\n\n if (\n e.ctrlKey ||\n ![keyCodes.home, keyCodes.end].includes(keyCode)\n ) {\n VSelect.options.methods.onKeyDown.call(this, e)\n }\n\n // The ordering is important here\n // allows new value to be updated\n // and then moves the index to the\n // proper location\n this.changeSelectedIndex(keyCode)\n },\n onSpaceDown (e: KeyboardEvent) { /* noop */ },\n onTabDown (e: KeyboardEvent) {\n VSelect.options.methods.onTabDown.call(this, e)\n this.updateSelf()\n },\n onUpDown (e: Event) {\n // Prevent screen from scrolling\n e.preventDefault()\n\n // For autocomplete / combobox, cycling\n // interfers with native up/down behavior\n // instead activate the menu\n this.activateMenu()\n },\n selectItem (item: object) {\n VSelect.options.methods.selectItem.call(this, item)\n this.setSearch()\n },\n setSelectedItems () {\n VSelect.options.methods.setSelectedItems.call(this)\n\n // #4273 Don't replace if searching\n // #4403 Don't replace if focused\n if (!this.isFocused) this.setSearch()\n },\n setSearch () {\n // Wait for nextTick so selectedItem\n // has had time to update\n this.$nextTick(() => {\n if (\n !this.multiple ||\n !this.internalSearch ||\n !this.isMenuActive\n ) {\n this.internalSearch = (\n !this.selectedItems.length ||\n this.multiple ||\n this.hasSlot\n )\n ? null\n : this.getText(this.selectedItem)\n }\n })\n },\n updateSelf () {\n if (\n !this.searchIsDirty &&\n !this.internalValue\n ) return\n\n if (\n !this.multiple &&\n !this.valueComparator(\n this.internalSearch,\n this.getValue(this.internalValue)\n )\n ) {\n this.setSearch()\n }\n },\n hasItem (item: any): boolean {\n return this.selectedValues.indexOf(this.getValue(item)) > -1\n },\n onCopy (event: ClipboardEvent) {\n if (this.selectedIndex === -1) return\n\n const currentItem = this.selectedItems[this.selectedIndex]\n const currentItemText = this.getText(currentItem)\n event.clipboardData?.setData('text/plain', currentItemText)\n event.clipboardData?.setData('text/vnd.vuetify.autocomplete.item+plain', currentItemText)\n event.preventDefault()\n },\n },\n})\n","// Styles\nimport '../VAutocomplete/VAutocomplete.sass'\n\n// Extensions\nimport VSelect from '../VSelect/VSelect'\nimport VAutocomplete from '../VAutocomplete/VAutocomplete'\n\n// Utils\nimport { keyCodes } from '../../util/helpers'\n\n// Types\nimport { PropValidator } from 'vue/types/options'\n\n/* @vue/component */\nexport default VAutocomplete.extend({\n name: 'v-combobox',\n\n props: {\n delimiters: {\n type: Array,\n default: () => ([]),\n } as PropValidator,\n returnObject: {\n type: Boolean,\n default: true,\n },\n },\n\n data: () => ({\n editingIndex: -1,\n }),\n\n computed: {\n computedCounterValue (): number {\n return this.multiple\n ? this.selectedItems.length\n : (this.internalSearch || '').toString().length\n },\n hasSlot (): boolean {\n return VSelect.options.computed.hasSlot.call(this) || this.multiple\n },\n isAnyValueAllowed (): boolean {\n return true\n },\n menuCanShow (): boolean {\n if (!this.isFocused) return false\n\n return this.hasDisplayedItems ||\n (!!this.$slots['no-data'] && !this.hideNoData)\n },\n searchIsDirty (): boolean {\n return this.internalSearch != null\n },\n },\n\n methods: {\n onInternalSearchChanged (val: any) {\n if (\n val &&\n this.multiple &&\n this.delimiters.length\n ) {\n const delimiter = this.delimiters.find(d => val.endsWith(d))\n if (delimiter != null) {\n this.internalSearch = val.slice(0, val.length - delimiter.length)\n this.updateTags()\n }\n }\n\n this.updateMenuDimensions()\n },\n genInput () {\n const input = VAutocomplete.options.methods.genInput.call(this)\n\n delete input.data!.attrs!.name\n input.data!.on!.paste = this.onPaste\n\n return input\n },\n genChipSelection (item: object, index: number) {\n const chip = VSelect.options.methods.genChipSelection.call(this, item, index)\n\n // Allow user to update an existing value\n if (this.multiple) {\n chip.componentOptions!.listeners! = {\n ...chip.componentOptions!.listeners!,\n dblclick: () => {\n this.editingIndex = index\n this.internalSearch = this.getText(item)\n this.selectedIndex = -1\n },\n }\n }\n\n return chip\n },\n onChipInput (item: object) {\n VSelect.options.methods.onChipInput.call(this, item)\n\n this.editingIndex = -1\n },\n // Requires a manual definition\n // to overwrite removal in v-autocomplete\n onEnterDown (e: Event) {\n e.preventDefault()\n // If has menu index, let v-select-list handle\n if (this.getMenuIndex() > -1) return\n\n this.$nextTick(this.updateSelf)\n },\n onKeyDown (e: KeyboardEvent) {\n const keyCode = e.keyCode\n\n if (\n e.ctrlKey ||\n ![keyCodes.home, keyCodes.end].includes(keyCode)\n ) {\n VSelect.options.methods.onKeyDown.call(this, e)\n }\n\n // If user is at selection index of 0\n // create a new tag\n if (this.multiple &&\n keyCode === keyCodes.left &&\n this.$refs.input.selectionStart === 0\n ) {\n this.updateSelf()\n } else if (keyCode === keyCodes.enter) {\n this.onEnterDown(e)\n }\n\n // The ordering is important here\n // allows new value to be updated\n // and then moves the index to the\n // proper location\n this.changeSelectedIndex(keyCode)\n },\n onTabDown (e: KeyboardEvent) {\n // When adding tags, if searching and\n // there is not a filtered options,\n // add the value to the tags list\n if (this.multiple &&\n this.internalSearch &&\n this.getMenuIndex() === -1\n ) {\n e.preventDefault()\n e.stopPropagation()\n\n return this.updateTags()\n }\n\n VAutocomplete.options.methods.onTabDown.call(this, e)\n },\n selectItem (item: object) {\n // Currently only supports items:\n if (this.editingIndex > -1) {\n this.updateEditing()\n } else {\n VAutocomplete.options.methods.selectItem.call(this, item)\n\n // if selected item contains search value,\n // remove the search string\n if (\n this.internalSearch &&\n this.multiple &&\n this.getText(item).toLocaleLowerCase().includes(this.internalSearch.toLocaleLowerCase())\n ) {\n this.internalSearch = null\n }\n }\n },\n setSelectedItems () {\n if (this.internalValue == null ||\n this.internalValue === ''\n ) {\n this.selectedItems = []\n } else {\n this.selectedItems = this.multiple ? this.internalValue : [this.internalValue]\n }\n },\n setValue (value?: any) {\n VSelect.options.methods.setValue.call(this, value === undefined ? this.internalSearch : value)\n },\n updateEditing () {\n const value = this.internalValue.slice()\n const index = this.selectedItems.findIndex(item =>\n this.getText(item) === this.internalSearch)\n\n // If user enters a duplicate text on chip edit,\n // don't add it, move it to the end of the list\n if (index > -1) {\n const item = typeof value[index] === 'object'\n ? Object.assign({}, value[index])\n : value[index]\n\n value.splice(index, 1)\n value.push(item)\n } else {\n value[this.editingIndex] = this.internalSearch\n }\n\n this.setValue(value)\n this.editingIndex = -1\n this.internalSearch = null\n },\n updateCombobox () {\n // If search is not dirty, do nothing\n if (!this.searchIsDirty) return\n\n // The internal search is not matching\n // the internal value, update the input\n if (this.internalSearch !== this.getText(this.internalValue)) this.setValue()\n\n // Reset search if using slot to avoid a double input\n const isUsingSlot = Boolean(this.$scopedSlots.selection) || this.hasChips\n if (isUsingSlot) this.internalSearch = null\n },\n updateSelf () {\n this.multiple ? this.updateTags() : this.updateCombobox()\n },\n updateTags () {\n const menuIndex = this.getMenuIndex()\n\n // If the user is not searching\n // and no menu item is selected\n // or if the search is empty\n // do nothing\n if ((menuIndex < 0 && !this.searchIsDirty) ||\n !this.internalSearch) return\n\n if (this.editingIndex > -1) {\n return this.updateEditing()\n }\n\n const index = this.selectedItems.findIndex(item =>\n this.internalSearch === this.getText(item))\n\n // If the duplicate item is an object,\n // copy it, so that it can be added again later\n const itemToSelect = index > -1 && typeof this.selectedItems[index] === 'object'\n ? Object.assign({}, this.selectedItems[index])\n : this.internalSearch\n\n // If it already exists, do nothing\n // this might need to change to bring\n // the duplicated item to the last entered\n if (index > -1) {\n const internalValue = this.internalValue.slice()\n internalValue.splice(index, 1)\n\n this.setValue(internalValue)\n }\n\n // If menu index is greater than 1\n // the selection is handled elsewhere\n // TODO: find out where\n if (menuIndex > -1) return (this.internalSearch = null)\n\n this.selectItem(itemToSelect)\n\n this.internalSearch = null\n },\n onPaste (event: ClipboardEvent) {\n this.$emit('paste', event)\n if (!this.multiple || this.searchIsDirty) return\n\n const pastedItemText = event.clipboardData?.getData('text/vnd.vuetify.autocomplete.item+plain')\n if (pastedItemText && this.findExistingIndex(pastedItemText as any) === -1) {\n event.preventDefault()\n VSelect.options.methods.selectItem.call(this, pastedItemText as any)\n }\n },\n clearableCallback () {\n this.editingIndex = -1\n\n VAutocomplete.options.methods.clearableCallback.call(this)\n },\n },\n})\n","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

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

fred, barney, & pebbles

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