{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///../node_modules/dom-select/index.js","webpack:///../node_modules/fizzy-ui-utils/utils.js","webpack:///../node_modules/flickity/js/index.js","webpack:///../node_modules/flickity/js/flickity.js","webpack:///../node_modules/lodash.throttle/index.js","webpack:///../node_modules/ev-emitter/ev-emitter.js","webpack:///../node_modules/unipointer/unipointer.js","webpack:///../node_modules/webpack/buildin/global.js","webpack:///../node_modules/get-size/get-size.js","webpack:///../node_modules/flickity-imagesloaded/flickity-imagesloaded.js","webpack:///../node_modules/flickity-fade/flickity-fade.js","webpack:///../node_modules/a11y-dialog/a11y-dialog.js","webpack:///../node_modules/desandro-matches-selector/matches-selector.js","webpack:///../node_modules/flickity/js/cell.js","webpack:///../node_modules/flickity/js/slide.js","webpack:///../node_modules/flickity/js/animate.js","webpack:///../node_modules/flickity/js/drag.js","webpack:///../node_modules/unidragger/unidragger.js","webpack:///../node_modules/flickity/js/prev-next-button.js","webpack:///../node_modules/flickity/js/page-dots.js","webpack:///../node_modules/flickity/js/player.js","webpack:///../node_modules/flickity/js/add-remove-cell.js","webpack:///../node_modules/flickity/js/lazyload.js","webpack:///../node_modules/imagesloaded/imagesloaded.js","webpack:///../node_modules/lodash/lodash.js","webpack:///../node_modules/webpack/buildin/module.js","webpack:///./ui/components/accordion/accordion.init.js","webpack:///./ui/components/carousel/carousel.init.js","webpack:///./ui/components/expandable/expandable.init.js","webpack:///./ui/components/gallery/gallery.init.js","webpack:///./ui/blocks/image/image.init.js","webpack:///./ui/components/interactive-map/interactive-map.init.js","webpack:///./ui/components/modal/modal.init.js","webpack:///./ui/blocks/table/table.init.js","webpack:///./ui/components/tabs/tabs.init.js","webpack:///./js/lib/measureViewport.js","webpack:///./ui/components/global-header/partials/nav-item/nav-item.init.js","webpack:///./ui/components/global-header/partials/navigation/navigation.init.js","webpack:///./js/lib/initModule.js","webpack:///./js/lib/detectIE11.js","webpack:///./js/browser.js","webpack:///./js/lib/domReady.js","webpack:///./js/lib/load-svg.js"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","selector","parent","document","querySelector","all","selection","querySelectorAll","Array","slice","window","factory","matchesSelector","utils","a","b","prop","num","div","arraySlice","makeArray","obj","isArray","length","removeFrom","ary","index","indexOf","splice","getParent","elem","parentNode","body","getQueryElement","handleEvent","event","method","type","this","filterFindElements","elems","ffElems","forEach","HTMLElement","push","childElems","debounceMethod","_class","methodName","threshold","timeoutName","timeout","clearTimeout","args","arguments","_this","setTimeout","apply","docReady","callback","readyState","addEventListener","toDashed","str","replace","match","$1","$2","toLowerCase","console","htmlInit","WidgetClass","namespace","dashedNamespace","dataAttr","dataAttrElems","jsDashElems","concat","dataOptionsAttr","jQuery","options","attr","getAttribute","JSON","parse","error","className","instance","data","Flickity","EvEmitter","getSize","Cell","Slide","animatePrototype","getComputedStyle","moveElements","toElem","appendChild","shift","GUID","instances","element","queryElement","flickityGUID","option","$element","extend","constructor","defaults","_create","accessibility","cellAlign","freeScrollFriction","friction","namespaceJQueryEvents","percentPosition","resize","selectedAttraction","setGallerySize","createMethods","proto","id","guid","eventName","selectedIndex","restingFrames","x","velocity","originSide","rightToLeft","viewport","createElement","_createSlider","watchCSS","on","listener","activate","opts","isActive","classList","add","_filterFindCellElements","children","slider","reloadCells","tabIndex","emitEvent","selectInitialIndex","isInitActivated","dispatchEvent","style","cellSelector","cells","_makeCells","positionCells","_getWrapShiftCells","map","cellElem","getLastCell","getLastSlide","slides","_sizeCells","_positionCells","maxCellHeight","cellX","startCell","size","outerWidth","len","cell","setPosition","Math","max","outerHeight","slideableWidth","updateSlides","_containSlides","slidesWidth","target","slide","nextMargin","canCellFit","_getCanCellFit","slideWidth","firstMargin","updateTarget","addCell","updateSelectedSlide","groupCells","number","parseInt","percentMatch","percent","innerWidth","_init","reposition","positionSliderAtSelected","setCellAlign","cursorPosition","cellAlignShorthands","center","left","right","shorthand","height","adaptiveHeight","selectedSlide","wrapAround","_unshiftCells","beforeShiftCells","afterShiftCells","gapX","cellIndex","_getGapCells","increment","contain","isRightToLeft","beginMargin","endMargin","contentWidth","isContentSmaller","beginBound","endBound","min","emitArgs","$event","jQEvent","Event","trigger","select","isWrap","isInstant","_wrapSelect","modulo","prevIndex","startAnimation","wrapIndex","delta","abs","backWrapDelta","forewardWrapDelta","isDragSelect","previous","next","unselectSelectedSlide","selectedCells","selectedElements","getCellElements","selectedCell","selectedElement","unselect","initialIndex","queryCell","selectCell","getCellSlideIndex","getCell","getCells","getParentCell","getAdjacentCellElements","adjCount","undefined","cellElems","slideIndex","uiChange","childUIPointerDown","preventDefault","focus","onresize","content","deactivate","onkeydown","isNotFocused","activeElement","handler","keyboardHandlers","keyCode","37","leftMethod","39","rightMethod","prevScrollY","pageYOffset","preventScroll","scrollTo","pageXOffset","remove","destroy","removeChild","removeAttribute","removeEventListener","allOff","removeData","bridget","setJQuery","jq","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","freeGlobal","global","freeSelf","self","root","Function","objectToString","toString","nativeMax","nativeMin","now","Date","debounce","func","wait","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","TypeError","invokeFunc","time","thisArg","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","remainingWait","debounced","isInvoking","toNumber","isObject","cancel","flush","isObjectLike","isSymbol","other","valueOf","isBinary","test","events","_events","listeners","once","onceEvents","_onceEvents","off","onceListeners","Unipointer","bindStartEvent","_bindStartEvent","unbindStartEvent","isAdd","bindMethod","startEvent","PointerEvent","getTouch","touches","touch","identifier","pointerIdentifier","onmousedown","button","_pointerDown","ontouchstart","changedTouches","onpointerdown","pointer","isPointerDown","pointerId","pointerDown","_bindPostStartEvents","postStartEvents","mousedown","touchstart","pointerdown","_boundPointerEvents","_unbindPostStartEvents","onmousemove","_pointerMove","onpointermove","ontouchmove","pointerMove","onmouseup","_pointerUp","onpointerup","ontouchend","_pointerDone","pointerUp","_pointerReset","pointerDone","onpointercancel","_pointerCancel","ontouchcancel","pointerCancel","getPointerPoint","pageX","y","pageY","g","e","getStyleSize","parseFloat","isNaN","logError","message","measurements","measurementsLength","getStyle","isBoxSizeOuter","isSetup","width","padding","borderStyle","borderWidth","boxSizing","documentElement","round","setup","nodeType","display","innerHeight","getZeroSize","offsetWidth","offsetHeight","isBorderBox","measurement","paddingWidth","paddingLeft","paddingRight","paddingHeight","paddingTop","paddingBottom","marginWidth","marginLeft","marginRight","marginHeight","marginTop","marginBottom","borderLeftWidth","borderRightWidth","borderHeight","borderTopWidth","borderBottomWidth","isBorderBoxSizeOuter","styleWidth","styleHeight","imagesLoaded","_createImagesLoaded","image","img","cellSizeChange","freeScroll","slideUpdateTarget","fade","slideTargetX","firstCellX","targetX","renderPosition","setOpacity","alpha","opacity","_createFade","fadeIndex","prevSelectedIndex","onSelectFade","onDragEndFade","onSettleFade","onActivateFade","onDeactivateFade","didDragEnd","positionSlider","fadeSlides","dispatchScrollEvent","setTranslateX","indexes","getFadeIndexes","fadeSlideA","fadeSlideB","distance","wrapDifference","progress","fadeHideIndex","isDragging","getFadeDragWrapIndexes","getFadeDragLimitIndexes","distances","getSlideDistance","absDistances","minDistance","closestIndex","dragIndex","diff","diffPlus","diffMinus","shiftWrapCells","focusedBeforeDialog","FOCUSABLE_ELEMENTS","A11yDialog","node","targets","_show","show","_hide","hide","_maintainFocus","_bindKeypress","container","dialog","role","useDialog","nodeName","_listeners","toArray","collection","$$","context","setFocusToFirstItem","focusableChildren","getFocusableChildren","focused","join","filter","child","getClientRects","instantiateDialogs","siblings","_targets","NodeList","isPrototypeOf","Element","collect","childNodes","shown","hasAttribute","setAttribute","_openers","opener","_closers","closer","_fire","showModal","close","which","focusedItemIndex","shiftKey","trapTabKey","contains","requestAnimationFrame","matchesMethod","ElemProto","matches","prefixes","position","side","setDefaultTarget","marginProperty","getPositionValue","wrapShift","isOriginLeft","lastCell","lastMargin","isAnimating","animate","applyDragForce","applySelectedAttraction","previousX","integratePhysics","settle","is3d","translateX","transform","firstSlide","positionX","isFreeScrolling","beforeGap","_shiftCells","afterGap","gap","cellShift","getFrictionFactor","force","isDraggable","dragForce","dragX","applyForce","Unidragger","draggable","dragThreshold","_touchActionValue","isTouch","isTouchmoveScrollCanceled","_createDrag","onActivateDrag","_uiChangeDrag","onDeactivateDrag","updateDraggable","handles","bindHandles","unbindHandles","bindDrag","unbindDrag","okayPointerDown","_pointerDownPreventDefault","pointerDownFocus","pointerDownBlur","pointerDownScroll","getScrollPosition","_pointerDownDefault","pointerDownPointer","focusNodes","INPUT","TEXTAREA","SELECT","isTouchStart","isTouchPointer","pointerType","isFocusNode","hasDragStarted","moveVector","isTouchScrolling","_dragPointerUp","dragStart","dragStartPosition","_dragPointerMove","_dragMove","dragMove","previousDragX","direction","originBound","dragMoveTime","dragEnd","dragEndRestingSelect","restingX","getRestingPosition","dragEndBoostSelect","positiveResting","_getClosestResting","negativeResting","Infinity","condition","dist","minDist","isWrapAround","wrap","floor","staticClick","clickedCell","onscroll","scroll","scrollMoveX","scrollMoveY","_bindHandles","touchAction","handle","cursorNodes","OPTION","clickTypes","radio","checkbox","submit","file","isCursorNode","isClickType","isOkay","blur","_dragStart","_dragEnd","_staticClick","isPreventingClicks","onclick","isIgnoringMouseUp","svgURI","PrevNextButton","isEnabled","isPrevious","leftDirection","isLeft","disable","svg","createSVG","update","createElementNS","shape","path","pathMovements","arrowShape","x0","x1","y1","x2","y2","x3","enable","disabled","lastIndex","boundIndex","prevNextButtons","_createPrevNextButtons","prevButton","nextButton","activatePrevNextButtons","deactivatePrevNextButtons","PageDots","holder","dots","handleClick","onClick","setDots","addDots","removeDots","count","fragment","createDocumentFragment","newDots","dot","updateSelected","selectedDot","onTap","pageDots","_createPageDots","activatePageDots","updateSelectedPageDots","updatePageDots","deactivatePageDots","Player","state","onVisibilityChange","visibilityChange","onVisibilityPlay","visibilityPlay","play","hidden","tick","autoPlay","clear","stop","pause","unpause","pauseAutoPlayOnHover","_createPlayer","player","activatePlayer","stopPlayer","deactivatePlayer","playPlayer","pausePlayer","unpausePlayer","onmouseenter","onmouseleave","insert","getCellsFragment","isAppend","insertCellElement","insertBefore","endCells","cellChange","append","prepend","minCellIndex","changedCellIndex","isPositioningSlider","prevSelectedElem","LazyLoader","flickity","load","_createLazyload","lazyLoad","lazyImages","lazyCellImages","lazyloadAttr","srcAttr","srcsetAttr","imgs","getCellLazyImages","src","srcset","onload","complete","onerror","$","ImagesLoaded","onAlways","queryElem","elements","getImages","jqDeferred","Deferred","check","images","addElementImages","addImage","background","addElementBackgroundImages","elementNodeTypes","childImgs","1","9","11","LoadingImage","Background","url","Image","reURL","exec","backgroundImage","addBackground","loadingImage","onProgress","progressedCount","hasAnyBroken","isLoaded","notify","debug","log","isComplete","jqMethod","getIsImageComplete","confirm","naturalWidth","proxyImage","unbindEvents","makeJQueryPlugin","fn","promise","FUNC_ERROR_TEXT","PLACEHOLDER","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsHostCtor","reIsUint","reLatin","reNoMatch","reUnescapedString","rsComboRange","rsComboMarksRange","rsBreakRange","rsMathOpRange","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsMiscLower","rsMiscUpper","reOptMod","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","freeExports","freeModule","moduleExports","freeProcess","process","nodeUtil","types","require","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","current","baseTimes","baseTrim","string","trimmedEndIndex","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","mapToArray","overArg","arg","replaceHolders","setToArray","set","setToPairs","stringSize","unicodeSize","stringToArray","unicodeToArray","split","asciiToArray","charAt","unescapeHtmlChar","_","runInContext","uid","pick","Error","String","arrayProto","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","ceil","nativeFloor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","entry","ListCache","MapCache","SetCache","__data__","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","paths","skip","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","pop","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","baseGt","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","seen","baseInvoke","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","comparer","sort","baseSortBy","objCriteria","criteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","MAX_ARRAY_LENGTH","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","createCompounder","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","newHolders","createRecurry","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrLength","arrStacked","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","oldArray","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","lastCalled","stamp","remaining","rand","memoize","memoizeCapped","charCodeAt","quote","subString","clone","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","find","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bindKey","WRAP_BIND_FLAG","timeWaiting","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","done","iteratorToArray","remainder","toLength","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","toPairs","toPairsIn","camelCase","word","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","toUpperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","subtract","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matchesProperty","nthArg","omitBy","orderBy","propertyOf","pullAllBy","pullAllWith","reject","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","updateWith","valuesIn","zipObject","zipObjectDeep","entriesIn","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","toJSON","webpackPolyfill","deprecate","toggle","AccordionGroup","el","ui","accordions","toggleAll","accordion","dataset","controlled","onControlToggle","onToggle","drawer","link","Accordion","control","flkty","innerHTML","Expandable","startOpen","isExpanded","closedHeight","aria","Gallery","imgTitle","imgContent","imgSrc","imgAlt","textContent","box","panel","lowImage","resolveImage","loadedImage","loadImage","then","catch","detectBoundingBox","getBoundingClientRect","top","clientWidth","bottom","clientHeight","calcPosition","mapWidth","viewportWidth","Modal","closeBtn","carousel","rows","heads","row","idx","innerText","tabsList","tabs","panels","tab","breakpoint","closeMenu","NavItem","menu","icon","backdrop","back","innerItems","menuOpen","desktop","windowIsLargerThan","onMenuOpen","openItem","firstElementChild","item","previousElementSibling","lastElementChild","nextElementSibling","onMenuClose","handleMenuToggle","closeMainMenu","Navigation","items","utility","utilityItems","globalHeader","toggleScroll","bool","isScrolled","navOpen","subNavOpen","closeNavMenu","handleResize","firstChild","handleToggle","openNavMenu","addEventListeners","updateStyles","inner","MSInputMethodContext","documentMode","svgSpritePath","location","protocol","host","cb","isTurnStorybook","MutationObserver","mutationsList","observe","getElementById","childList","subtree","domReady","initModule","sprite","ajax","XMLHttpRequest","open","send","responseText","substr","status"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,WAIjBlC,EAAoBA,EAAoBmC,EAAI,I,gBClFrDhC,EAAOD,QAGP,SAAckC,EAAUC,GAEtB,OADAA,IAAWA,EAASC,UACbD,EAAOE,cAAcH,IAJ9BjC,EAAOD,QAAQsC,IAOf,SAAcJ,EAAUC,GACtBA,IAAWA,EAASC,UACpB,IAAIG,EAAYJ,EAAOK,iBAAiBN,GACxC,OAAQO,MAAMX,UAAUY,MAAMrC,KAAKkC,K,gBCXrC,SAOE,SAAUI,EAAQC,GAMhB,EAAQ,CACN,YAGD,KAFE,EAAF,SAAYC,GACX,OAgBK,SAAkBF,EAAQE,GAErC,aAEA,IAAIC,EAAQ,CAKZ,OAAe,SAAUC,EAAGC,GAC1B,IAAM,IAAIC,KAAQD,EAChBD,EAAGE,GAASD,EAAGC,GAEjB,OAAOF,GAKT,OAAe,SAAUG,EAAKC,GAC5B,OAAWD,EAAMC,EAAQA,GAAQA,IAK/BC,EAAaX,MAAMX,UAAUY,MAGjCI,EAAMO,UAAY,SAAUC,GAC1B,OAAKb,MAAMc,QAASD,GAEXA,EAGJA,QACI,GAGuB,iBAAPA,GAAwC,iBAAdA,EAAIE,OAG9CJ,EAAW/C,KAAMiD,GAInB,CAAEA,IAKXR,EAAMW,WAAa,SAAUC,EAAKJ,GAChC,IAAIK,EAAQD,EAAIE,QAASN,IACV,GAAVK,GACHD,EAAIG,OAAQF,EAAO,IAMvBb,EAAMgB,UAAY,SAAUC,EAAM7B,GAChC,KAAQ6B,EAAKC,YAAcD,GAAQ3B,SAAS6B,MAE1C,GADAF,EAAOA,EAAKC,WACPnB,EAAiBkB,EAAM7B,GAC1B,OAAO6B,GAQbjB,EAAMoB,gBAAkB,SAAUH,GAChC,MAAoB,iBAARA,EACH3B,SAASC,cAAe0B,GAE1BA,GAMTjB,EAAMqB,YAAc,SAAUC,GAC5B,IAAIC,EAAS,KAAOD,EAAME,KACrBC,KAAMF,IACTE,KAAMF,GAAUD,IAMpBtB,EAAM0B,mBAAqB,SAAUC,EAAOvC,GAE1CuC,EAAQ3B,EAAMO,UAAWoB,GACzB,IAAIC,EAAU,GAyBd,OAvBAD,EAAME,SAAS,SAAUZ,GAEvB,GAAQA,aAAgBa,YAIxB,GAAM1C,EAAN,CAMKW,EAAiBkB,EAAM7B,IAC1BwC,EAAQG,KAAMd,GAKhB,IAFA,IAAIe,EAAaf,EAAKvB,iBAAkBN,GAE9BhC,EAAE,EAAGA,EAAI4E,EAAWtB,OAAQtD,IACpCwE,EAAQG,KAAMC,EAAW5E,SAZzBwE,EAAQG,KAAMd,MAgBXW,GAKT5B,EAAMiC,eAAiB,SAAUC,EAAQC,EAAYC,GACnDA,EAAYA,GAAa,IAEzB,IAAIb,EAASW,EAAOlD,UAAWmD,GAC3BE,EAAcF,EAAa,UAE/BD,EAAOlD,UAAWmD,GAAe,WAC/B,IAAIG,EAAUb,KAAMY,GACpBE,aAAcD,GAEd,IAAIE,EAAOC,UACPC,EAAQjB,KACZA,KAAMY,GAAgBM,YAAY,WAChCpB,EAAOqB,MAAOF,EAAOF,UACdE,EAAOL,KACbD,KAMPpC,EAAM6C,SAAW,SAAUC,GACzB,IAAIC,EAAazD,SAASyD,WACP,YAAdA,GAA0C,eAAdA,EAE/BJ,WAAYG,GAEZxD,SAAS0D,iBAAkB,mBAAoBF,IAOnD9C,EAAMiD,SAAW,SAAUC,GACzB,OAAOA,EAAIC,QAAS,eAAe,SAAUC,EAAOC,EAAIC,GACtD,OAAOD,EAAK,IAAMC,KACjBC,eAGL,IAAIC,EAAU3D,EAAO2D,QA4CrB,OAtCAxD,EAAMyD,SAAW,SAAUC,EAAaC,GACtC3D,EAAM6C,UAAU,WACd,IAAIe,EAAkB5D,EAAMiD,SAAUU,GAClCE,EAAW,QAAUD,EACrBE,EAAgBxE,SAASI,iBAAkB,IAAMmE,EAAW,KAC5DE,EAAczE,SAASI,iBAAkB,OAASkE,GAClDjC,EAAQ3B,EAAMO,UAAWuD,GAC1BE,OAAQhE,EAAMO,UAAWwD,IACxBE,EAAkBJ,EAAW,WAC7BK,EAASrE,EAAOqE,OAEpBvC,EAAME,SAAS,SAAUZ,GACvB,IAEIkD,EAFAC,EAAOnD,EAAKoD,aAAcR,IAC5B5C,EAAKoD,aAAcJ,GAErB,IACEE,EAAUC,GAAQE,KAAKC,MAAOH,GAC9B,MAAQI,GAMR,YAJKhB,GACHA,EAAQgB,MAAO,iBAAmBX,EAAW,OAAS5C,EAAKwD,UAC3D,KAAOD,IAKX,IAAIE,EAAW,IAAIhB,EAAazC,EAAMkD,GAEjCD,GACHA,EAAOS,KAAM1D,EAAM0C,EAAWe,UAS/B1E,EA9NMF,CAASD,EAAQE,IACzB,2BAVL,CAyBGF,S,gBChCH;;;;;;;;;;GAqCKA,OAtBD,EAAQ,CACN,KACA,MACA,MACA,MACA,MACA,MACA,YACQ,0BAAP,EAcM,SAAkB+E,GAC7B,OAAOA,IAfK,gC,gBCvBd,SAEE,SAAU/E,EAAQC,GAIhB,EAAQ,CACN,KACA,KACA,KACA,MACA,MACA,YAGD,KAFE,EAAF,SAAY+E,EAAWC,EAAS9E,EAAO+E,EAAMC,EAAOC,GACnD,OA4BK,SAAkBpF,EAAQgF,EAAWC,EAC5C9E,EAAO+E,EAAMC,EAAOC,GAGxB,aAGA,IAAIf,EAASrE,EAAOqE,OAChBgB,EAAmBrF,EAAOqF,iBAC1B1B,EAAU3D,EAAO2D,QAErB,SAAS2B,EAAcxD,EAAOyD,GAE5B,IADAzD,EAAQ3B,EAAMO,UAAWoB,GACjBA,EAAMjB,QACZ0E,EAAOC,YAAa1D,EAAM2D,SAO9B,IAAIC,EAAO,EAEPC,EAAY,GAEhB,SAASZ,EAAUa,EAAStB,GAC1B,IAAIuB,EAAe1F,EAAMoB,gBAAiBqE,GAC1C,GAAMC,EAAN,CAQA,GAFAjE,KAAKgE,QAAUC,EAEVjE,KAAKgE,QAAQE,aAAe,CAC/B,IAAIjB,EAAWc,EAAW/D,KAAKgE,QAAQE,cAEvC,OADKjB,GAAWA,EAASkB,OAAQzB,GAC1BO,EAIJR,IACHzC,KAAKoE,SAAW3B,EAAQzC,KAAKgE,UAG/BhE,KAAK0C,QAAUnE,EAAM8F,OAAQ,GAAIrE,KAAKsE,YAAYC,UAClDvE,KAAKmE,OAAQzB,GAGb1C,KAAKwE,eAtBEzC,GACHA,EAAQgB,MAAO,8BAAiCkB,GAAgBD,IAwBtEb,EAASoB,SAAW,CAClBE,eAAe,EAEfC,UAAW,SAGXC,mBAAoB,KACpBC,SAAU,IACVC,uBAAuB,EAEvBC,iBAAiB,EACjBC,QAAQ,EACRC,mBAAoB,KACpBC,gBAAgB,GAMlB9B,EAAS+B,cAAgB,GAEzB,IAAIC,EAAQhC,EAAS5F,UAErBgB,EAAM8F,OAAQc,EAAO/B,EAAU7F,WAE/B4H,EAAMX,QAAU,WAEd,IAAIY,EAAKpF,KAAKqF,OAASvB,EAqBvB,IAAM,IAAIwB,KApBVtF,KAAKgE,QAAQE,aAAekB,EAC5BrB,EAAWqB,GAAOpF,KAElBA,KAAKuF,cAAgB,EAErBvF,KAAKwF,cAAgB,EAErBxF,KAAKyF,EAAI,EACTzF,KAAK0F,SAAW,EAChB1F,KAAK2F,WAAa3F,KAAK0C,QAAQkD,YAAc,QAAU,OAEvD5F,KAAK6F,SAAWhI,SAASiI,cAAc,OACvC9F,KAAK6F,SAAS7C,UAAY,oBAC1BhD,KAAK+F,iBAEA/F,KAAK0C,QAAQqC,QAAU/E,KAAK0C,QAAQsD,WACvC5H,EAAOmD,iBAAkB,SAAUvB,MAIdA,KAAK0C,QAAQuD,GAAK,CACvC,IAAIC,EAAWlG,KAAK0C,QAAQuD,GAAIX,GAChCtF,KAAKiG,GAAIX,EAAWY,GAGtB/C,EAAS+B,cAAc9E,SAAS,SAAUN,GACxCE,KAAMF,OACLE,MAEEA,KAAK0C,QAAQsD,SAChBhG,KAAKgG,WAELhG,KAAKmG,YASThB,EAAMhB,OAAS,SAAUiC,GACvB7H,EAAM8F,OAAQrE,KAAK0C,QAAS0D,IAG9BjB,EAAMgB,SAAW,WACVnG,KAAKqG,WAGVrG,KAAKqG,UAAW,EAChBrG,KAAKgE,QAAQsC,UAAUC,IAAI,oBACtBvG,KAAK0C,QAAQkD,aAChB5F,KAAKgE,QAAQsC,UAAUC,IAAI,gBAG7BvG,KAAKqD,UAGLK,EADgB1D,KAAKwG,wBAAyBxG,KAAKgE,QAAQyC,UAClCzG,KAAK0G,QAC9B1G,KAAK6F,SAASjC,YAAa5D,KAAK0G,QAChC1G,KAAKgE,QAAQJ,YAAa5D,KAAK6F,UAE/B7F,KAAK2G,cAEA3G,KAAK0C,QAAQ+B,gBAEhBzE,KAAKgE,QAAQ4C,SAAW,EAExB5G,KAAKgE,QAAQzC,iBAAkB,UAAWvB,OAG5CA,KAAK6G,UAAU,YACf7G,KAAK8G,qBAEL9G,KAAK+G,iBAAkB,EAEvB/G,KAAKgH,cAAc,WAIrB7B,EAAMY,cAAgB,WAEpB,IAAIW,EAAS7I,SAASiI,cAAc,OACpCY,EAAO1D,UAAY,kBACnB0D,EAAOO,MAAOjH,KAAK2F,YAAe,EAClC3F,KAAK0G,OAASA,GAGhBvB,EAAMqB,wBAA0B,SAAUtG,GACxC,OAAO3B,EAAM0B,mBAAoBC,EAAOF,KAAK0C,QAAQwE,eAIvD/B,EAAMwB,YAAc,WAElB3G,KAAKmH,MAAQnH,KAAKoH,WAAYpH,KAAK0G,OAAOD,UAC1CzG,KAAKqH,gBACLrH,KAAKsH,qBACLtH,KAAKiF,kBAQPE,EAAMiC,WAAa,SAAUlH,GAQ3B,OAPgBF,KAAKwG,wBAAyBtG,GAGxBqH,KAAK,SAAUC,GACnC,OAAO,IAAIlE,EAAMkE,EAAUxH,QAC1BA,OAKLmF,EAAMsC,YAAc,WAClB,OAAOzH,KAAKmH,MAAOnH,KAAKmH,MAAMlI,OAAS,IAGzCkG,EAAMuC,aAAe,WACnB,OAAO1H,KAAK2H,OAAQ3H,KAAK2H,OAAO1I,OAAS,IAI3CkG,EAAMkC,cAAgB,WAEpBrH,KAAK4H,WAAY5H,KAAKmH,OAEtBnH,KAAK6H,eAAgB,IAOvB1C,EAAM0C,eAAiB,SAAUzI,GAC/BA,EAAQA,GAAS,EAGjBY,KAAK8H,cAAgB1I,GAAQY,KAAK8H,eAAqB,EACvD,IAAIC,EAAQ,EAEZ,GAAK3I,EAAQ,EAAI,CACf,IAAI4I,EAAYhI,KAAKmH,MAAO/H,EAAQ,GACpC2I,EAAQC,EAAUvC,EAAIuC,EAAUC,KAAKC,WAGvC,IADA,IAAIC,EAAMnI,KAAKmH,MAAMlI,OACXtD,EAAIyD,EAAOzD,EAAIwM,EAAKxM,IAAM,CAClC,IAAIyM,EAAOpI,KAAKmH,MAAMxL,GACtByM,EAAKC,YAAaN,GAClBA,GAASK,EAAKH,KAAKC,WACnBlI,KAAK8H,cAAgBQ,KAAKC,IAAKH,EAAKH,KAAKO,YAAaxI,KAAK8H,eAG7D9H,KAAKyI,eAAiBV,EAEtB/H,KAAK0I,eAEL1I,KAAK2I,iBAEL3I,KAAK4I,YAAcT,EAAMnI,KAAK0H,eAAemB,OAAS7I,KAAK2H,OAAO,GAAGkB,OAAS,GAOhF1D,EAAMyC,WAAa,SAAUT,GAC3BA,EAAM/G,SAAS,SAAUgI,GACvBA,EAAK/E,cAMT8B,EAAMuD,aAAe,WAEnB,GADA1I,KAAK2H,OAAS,GACR3H,KAAKmH,MAAMlI,OAAjB,CAIA,IAAI6J,EAAQ,IAAIvF,EAAOvD,MACvBA,KAAK2H,OAAOrH,KAAMwI,GAClB,IACIC,EADkC,QAAnB/I,KAAK2F,WACQ,cAAgB,aAE5CqD,EAAahJ,KAAKiJ,iBAEtBjJ,KAAKmH,MAAM/G,SAAS,SAAUgI,EAAMzM,GAElC,GAAMmN,EAAM3B,MAAMlI,OAAlB,CAKA,IAAIiK,EAAeJ,EAAMZ,WAAaY,EAAMK,aACxCf,EAAKH,KAAKC,WAAaE,EAAKH,KAAMc,IAEjCC,EAAWlN,KAAMkE,KAAMrE,EAAGuN,KAI7BJ,EAAMM,eAENN,EAAQ,IAAIvF,EAAOvD,MACnBA,KAAK2H,OAAOrH,KAAMwI,IANlBA,EAAMO,QAASjB,QARfU,EAAMO,QAASjB,KAiBhBpI,MAEH8I,EAAMM,eAENpJ,KAAKsJ,wBAGPnE,EAAM8D,eAAiB,WACrB,IAAIM,EAAavJ,KAAK0C,QAAQ6G,WAC9B,IAAMA,EACJ,OAAO,WACL,OAAO,GAEJ,GAA0B,iBAAdA,EAAyB,CAE1C,IAAIC,EAASC,SAAUF,EAAY,IACnC,OAAO,SAAU5N,GACf,OAASA,EAAI6N,GAAa,GAK9B,IAAIE,EAAoC,iBAAdH,GACxBA,EAAW5H,MAAO,YAChBgI,EAAUD,EAAeD,SAAUC,EAAa,GAAI,IAAO,IAAM,EACrE,OAAO,SAAU/N,EAAGuN,GAElB,OAAOA,IAAgBlJ,KAAKiI,KAAK2B,WAAa,GAAMD,IAKxDxE,EAAM0E,MACN1E,EAAM2E,WAAa,WACjB9J,KAAKqH,gBACLrH,KAAK+J,4BAGP5E,EAAM9B,QAAU,WACdrD,KAAKiI,KAAO5E,EAASrD,KAAKgE,SAC1BhE,KAAKgK,eACLhK,KAAKiK,eAAiBjK,KAAKiI,KAAK2B,WAAa5J,KAAK0E,WAGpD,IAAIwF,EAAsB,CAExBC,OAAQ,CACNC,KAAM,GACNC,MAAO,IAETD,KAAM,CACJA,KAAM,EACNC,MAAO,GAETA,MAAO,CACLA,MAAO,EACPD,KAAM,IAIVjF,EAAM6E,aAAe,WACnB,IAAIM,EAAYJ,EAAqBlK,KAAK0C,QAAQgC,WAClD1E,KAAK0E,UAAY4F,EAAYA,EAAWtK,KAAK2F,YAAe3F,KAAK0C,QAAQgC,WAG3ES,EAAMF,eAAiB,WACrB,GAAKjF,KAAK0C,QAAQuC,eAAiB,CACjC,IAAIsF,EAASvK,KAAK0C,QAAQ8H,gBAAkBxK,KAAKyK,cAC/CzK,KAAKyK,cAAcF,OAASvK,KAAK8H,cACnC9H,KAAK6F,SAASoB,MAAMsD,OAASA,EAAS,OAI1CpF,EAAMmC,mBAAqB,WAEzB,GAAMtH,KAAK0C,QAAQgI,WAAnB,CAIA1K,KAAK2K,cAAe3K,KAAK4K,kBACzB5K,KAAK2K,cAAe3K,KAAK6K,iBAGzB,IAAIC,EAAO9K,KAAKiK,eACZc,EAAY/K,KAAKmH,MAAMlI,OAAS,EACpCe,KAAK4K,iBAAmB5K,KAAKgL,aAAcF,EAAMC,GAAY,GAG7DD,EAAO9K,KAAKiI,KAAK2B,WAAa5J,KAAKiK,eAEnCjK,KAAK6K,gBAAkB7K,KAAKgL,aAAcF,EAAM,EAAG,KAGrD3F,EAAM6F,aAAe,SAAUF,EAAMC,EAAWE,GAG9C,IADA,IAAI9D,EAAQ,GACJ2D,EAAO,GAAI,CACjB,IAAI1C,EAAOpI,KAAKmH,MAAO4D,GACvB,IAAM3C,EACJ,MAEFjB,EAAM7G,KAAM8H,GACZ2C,GAAaE,EACbH,GAAQ1C,EAAKH,KAAKC,WAEpB,OAAOf,GAMThC,EAAMwD,eAAiB,WACrB,GAAM3I,KAAK0C,QAAQwI,UAAWlL,KAAK0C,QAAQgI,YAAe1K,KAAKmH,MAAMlI,OAArE,CAGA,IAAIkM,EAAgBnL,KAAK0C,QAAQkD,YAC7BwF,EAAcD,EAAgB,cAAgB,aAC9CE,EAAYF,EAAgB,aAAe,cAC3CG,EAAetL,KAAKyI,eAAiBzI,KAAKyH,cAAcQ,KAAMoD,GAE9DE,EAAmBD,EAAetL,KAAKiI,KAAK2B,WAE5C4B,EAAaxL,KAAKiK,eAAiBjK,KAAKmH,MAAM,GAAGc,KAAMmD,GACvDK,EAAWH,EAAetL,KAAKiI,KAAK2B,YAAe,EAAI5J,KAAK0E,WAEhE1E,KAAK2H,OAAOvH,SAAS,SAAU0I,GACxByC,EAEHzC,EAAMD,OAASyC,EAAetL,KAAK0E,WAGnCoE,EAAMD,OAASP,KAAKC,IAAKO,EAAMD,OAAQ2C,GACvC1C,EAAMD,OAASP,KAAKoD,IAAK5C,EAAMD,OAAQ4C,MAExCzL,QAWLmF,EAAM6B,cAAgB,SAAUjH,EAAMF,EAAOkB,GAC3C,IAAI4K,EAAW9L,EAAQ,CAAEA,GAAQ0C,OAAQxB,GAASA,EAGlD,GAFAf,KAAK6G,UAAW9G,EAAM4L,GAEjBlJ,GAAUzC,KAAKoE,SAAW,CAG7B,IAAIwH,EADJ7L,GAAQC,KAAK0C,QAAQmC,sBAAwB,YAAc,GAE3D,GAAKhF,EAAQ,CAEX,IAAIgM,EAAU,IAAIpJ,EAAOqJ,MAAOjM,GAChCgM,EAAQ9L,KAAOA,EACf6L,EAASC,EAEX7L,KAAKoE,SAAS2H,QAASH,EAAQ7K,KAWnCoE,EAAM6G,OAAS,SAAU5M,EAAO6M,EAAQC,GACtC,GAAMlM,KAAKqG,WAGXjH,EAAQqK,SAAUrK,EAAO,IACzBY,KAAKmM,YAAa/M,IAEbY,KAAK0C,QAAQgI,YAAcuB,KAC9B7M,EAAQb,EAAM6N,OAAQhN,EAAOY,KAAK2H,OAAO1I,SAGrCe,KAAK2H,OAAQvI,IAAnB,CAGA,IAAIiN,EAAYrM,KAAKuF,cACrBvF,KAAKuF,cAAgBnG,EACrBY,KAAKsJ,sBACA4C,EACHlM,KAAK+J,2BAEL/J,KAAKsM,iBAEFtM,KAAK0C,QAAQ8H,gBAChBxK,KAAKiF,iBAGPjF,KAAKgH,cAAe,SAAU,KAAM,CAAE5H,IAEjCA,GAASiN,GACZrM,KAAKgH,cAAe,SAAU,KAAM,CAAE5H,IAGxCY,KAAKgH,cAAc,gBAIrB7B,EAAMgH,YAAc,SAAU/M,GAC5B,IAAI+I,EAAMnI,KAAK2H,OAAO1I,OAEtB,KADiBe,KAAK0C,QAAQgI,YAAcvC,EAAM,GAEhD,OAAO/I,EAET,IAAImN,EAAYhO,EAAM6N,OAAQhN,EAAO+I,GAEjCqE,EAAQlE,KAAKmE,IAAKF,EAAYvM,KAAKuF,eACnCmH,EAAgBpE,KAAKmE,IAAOF,EAAYpE,EAAQnI,KAAKuF,eACrDoH,EAAoBrE,KAAKmE,IAAOF,EAAYpE,EAAQnI,KAAKuF,gBACvDvF,KAAK4M,cAAgBF,EAAgBF,EACzCpN,GAAS+I,GACEnI,KAAK4M,cAAgBD,EAAoBH,IACpDpN,GAAS+I,GAGN/I,EAAQ,EACXY,KAAKyF,GAAKzF,KAAKyI,eACLrJ,GAAS+I,IACnBnI,KAAKyF,GAAKzF,KAAKyI,iBAInBtD,EAAM0H,SAAW,SAAUZ,EAAQC,GACjClM,KAAKgM,OAAQhM,KAAKuF,cAAgB,EAAG0G,EAAQC,IAG/C/G,EAAM2H,KAAO,SAAUb,EAAQC,GAC7BlM,KAAKgM,OAAQhM,KAAKuF,cAAgB,EAAG0G,EAAQC,IAG/C/G,EAAMmE,oBAAsB,WAC1B,IAAIR,EAAQ9I,KAAK2H,OAAQ3H,KAAKuF,eAExBuD,IAIN9I,KAAK+M,wBAEL/M,KAAKyK,cAAgB3B,EACrBA,EAAMkD,SACNhM,KAAKgN,cAAgBlE,EAAM3B,MAC3BnH,KAAKiN,iBAAmBnE,EAAMoE,kBAG9BlN,KAAKmN,aAAerE,EAAM3B,MAAM,GAChCnH,KAAKoN,gBAAkBpN,KAAKiN,iBAAiB,KAG/C9H,EAAM4H,sBAAwB,WACvB/M,KAAKyK,eACRzK,KAAKyK,cAAc4C,YAIvBlI,EAAM2B,mBAAqB,WACzB,IAAIwG,EAAetN,KAAK0C,QAAQ4K,aAEhC,GAAKtN,KAAK+G,gBACR/G,KAAKgM,OAAQhM,KAAKuF,eAAe,GAAO,OAD1C,CAKA,GAAK+H,GAAuC,iBAAhBA,EAE1B,GADWtN,KAAKuN,UAAWD,GAGzB,YADAtN,KAAKwN,WAAYF,GAAc,GAAO,GAK1C,IAAIlO,EAAQ,EAEPkO,GAAgBtN,KAAK2H,OAAQ2F,KAChClO,EAAQkO,GAGVtN,KAAKgM,OAAQ5M,GAAO,GAAO,KAS7B+F,EAAMqI,WAAa,SAAU5Q,EAAOqP,EAAQC,GAE1C,IAAI9D,EAAOpI,KAAKuN,UAAW3Q,GAC3B,GAAMwL,EAAN,CAIA,IAAIhJ,EAAQY,KAAKyN,kBAAmBrF,GACpCpI,KAAKgM,OAAQ5M,EAAO6M,EAAQC,KAG9B/G,EAAMsI,kBAAoB,SAAUrF,GAElC,IAAM,IAAIzM,EAAI,EAAGA,EAAIqE,KAAK2H,OAAO1I,OAAQtD,IAAM,CAG7C,IAAe,GAFHqE,KAAK2H,OAAOhM,GACNwL,MAAM9H,QAAS+I,GAE/B,OAAOzM,IAYbwJ,EAAMuI,QAAU,SAAUlO,GAExB,IAAM,IAAI7D,EAAI,EAAGA,EAAIqE,KAAKmH,MAAMlI,OAAQtD,IAAM,CAC5C,IAAIyM,EAAOpI,KAAKmH,MAAMxL,GACtB,GAAKyM,EAAKpE,SAAWxE,EACnB,OAAO4I,IAUbjD,EAAMwI,SAAW,SAAUzN,GACzBA,EAAQ3B,EAAMO,UAAWoB,GACzB,IAAIiH,EAAQ,GAOZ,OANAjH,EAAME,SAAS,SAAUZ,GACvB,IAAI4I,EAAOpI,KAAK0N,QAASlO,GACpB4I,GACHjB,EAAM7G,KAAM8H,KAEbpI,MACImH,GAOThC,EAAM+H,gBAAkB,WACtB,OAAOlN,KAAKmH,MAAMI,KAAK,SAAUa,GAC/B,OAAOA,EAAKpE,YAShBmB,EAAMyI,cAAgB,SAAUpO,GAE9B,IAAI4I,EAAOpI,KAAK0N,QAASlO,GACzB,OAAK4I,IAIL5I,EAAOjB,EAAMgB,UAAWC,EAAM,wBACvBQ,KAAK0N,QAASlO,KASvB2F,EAAM0I,wBAA0B,SAAUC,EAAU1O,GAClD,IAAM0O,EACJ,OAAO9N,KAAKyK,cAAcyC,kBAE5B9N,OAAkB2O,IAAV3O,EAAsBY,KAAKuF,cAAgBnG,EAEnD,IAAI+I,EAAMnI,KAAK2H,OAAO1I,OACtB,GAAK,EAAiB,EAAX6O,GAAkB3F,EAC3B,OAAOnI,KAAKkN,kBAId,IADA,IAAIc,EAAY,GACNrS,EAAIyD,EAAQ0O,EAAUnS,GAAKyD,EAAQ0O,EAAUnS,IAAM,CAC3D,IAAIsS,EAAajO,KAAK0C,QAAQgI,WAAanM,EAAM6N,OAAQzQ,EAAGwM,GAAQxM,EAChEmN,EAAQ9I,KAAK2H,OAAQsG,GACpBnF,IACHkF,EAAYA,EAAUzL,OAAQuG,EAAMoE,oBAGxC,OAAOc,GAQT7I,EAAMoI,UAAY,SAAU5P,GAC1B,GAAwB,iBAAZA,EAEV,OAAOqC,KAAKmH,MAAOxJ,GAErB,GAAwB,iBAAZA,EAAuB,CAEjC,GAAKA,EAASgE,MAAO,eACnB,OAGFhE,EAAWqC,KAAKgE,QAAQlG,cAAeH,GAGzC,OAAOqC,KAAK0N,QAAS/P,IAKvBwH,EAAM+I,SAAW,WACflO,KAAK6G,UAAU,aAIjB1B,EAAMgJ,mBAAqB,SAAUtO,GAEhB,cAAdA,EAAME,MACTF,EAAMuO,iBAERpO,KAAKqO,SAKPlJ,EAAMmJ,SAAW,WACftO,KAAKgG,WACLhG,KAAK+E,UAGPxG,EAAMiC,eAAgB2C,EAAU,WAAY,KAE5CgC,EAAMJ,OAAS,WACb,GAAM/E,KAAKqG,SAAX,CAGArG,KAAKqD,UAEArD,KAAK0C,QAAQgI,aAChB1K,KAAKyF,EAAIlH,EAAM6N,OAAQpM,KAAKyF,EAAGzF,KAAKyI,iBAEtCzI,KAAKqH,gBACLrH,KAAKsH,qBACLtH,KAAKiF,iBACLjF,KAAK6G,UAAU,UAGf,IAAIuG,EAAkBpN,KAAKiN,kBAAoBjN,KAAKiN,iBAAiB,GACrEjN,KAAKwN,WAAYJ,GAAiB,GAAO,KAI3CjI,EAAMa,SAAW,WACGhG,KAAK0C,QAAQsD,YAOW,GAFvBvC,EAAkBzD,KAAKgE,QAAS,UAAWuK,QAE5ClP,QAAQ,YACxBW,KAAKmG,WAELnG,KAAKwO,eAOTrJ,EAAMsJ,UAAY,SAAU5O,GAE1B,IAAI6O,EAAe7Q,SAAS8Q,eAAiB9Q,SAAS8Q,eAAiB3O,KAAKgE,QAC5E,GAAMhE,KAAK0C,QAAQ+B,gBAAiBiK,EAApC,CAIA,IAAIE,EAAUzL,EAAS0L,iBAAkBhP,EAAMiP,SAC1CF,GACHA,EAAQ9S,KAAMkE,QAIlBmD,EAAS0L,iBAAmB,CAE1BE,GAAI,WACF,IAAIC,EAAahP,KAAK0C,QAAQkD,YAAc,OAAS,WACrD5F,KAAKkO,WACLlO,KAAMgP,MAGRC,GAAI,WACF,IAAIC,EAAclP,KAAK0C,QAAQkD,YAAc,WAAa,OAC1D5F,KAAKkO,WACLlO,KAAMkP,OAMV/J,EAAMkJ,MAAQ,WAIZ,IAAIc,EAAc/Q,EAAOgR,YACzBpP,KAAKgE,QAAQqK,MAAM,CAAEgB,eAAe,IAE/BjR,EAAOgR,aAAeD,GACzB/Q,EAAOkR,SAAUlR,EAAOmR,YAAaJ,IAOzChK,EAAMqJ,WAAa,WACXxO,KAAKqG,WAGXrG,KAAKgE,QAAQsC,UAAUkJ,OAAO,oBAC9BxP,KAAKgE,QAAQsC,UAAUkJ,OAAO,gBAC9BxP,KAAK+M,wBAEL/M,KAAKmH,MAAM/G,SAAS,SAAUgI,GAC5BA,EAAKqH,aAEPzP,KAAKgE,QAAQ0L,YAAa1P,KAAK6F,UAE/BnC,EAAc1D,KAAK0G,OAAOD,SAAUzG,KAAKgE,SACpChE,KAAK0C,QAAQ+B,gBAChBzE,KAAKgE,QAAQ2L,gBAAgB,YAC7B3P,KAAKgE,QAAQ4L,oBAAqB,UAAW5P,OAG/CA,KAAKqG,UAAW,EAChBrG,KAAK6G,UAAU,gBAGjB1B,EAAMsK,QAAU,WACdzP,KAAKwO,aACLpQ,EAAOwR,oBAAqB,SAAU5P,MACtCA,KAAK6P,SACL7P,KAAK6G,UAAU,WACVpE,GAAUzC,KAAKoE,UAClB3B,EAAOqN,WAAY9P,KAAKgE,QAAS,mBAE5BhE,KAAKgE,QAAQE,oBACbH,EAAW/D,KAAKqF,OAKzB9G,EAAM8F,OAAQc,EAAO3B,GASrBL,EAASD,KAAO,SAAU1D,GAExB,IAAI4F,GADJ5F,EAAOjB,EAAMoB,gBAAiBH,KACbA,EAAK0E,aACtB,OAAOkB,GAAMrB,EAAWqB,IAG1B7G,EAAMyD,SAAUmB,EAAU,YAErBV,GAAUA,EAAOsN,SACpBtN,EAAOsN,QAAS,WAAY5M,GAW9B,OAPAA,EAAS6M,UAAY,SAAUC,GAC7BxN,EAASwN,GAGX9M,EAASG,KAAOA,EAChBH,EAASI,MAAQA,EAEVJ,EAt5BM9E,CAASD,EAAQgF,EAAWC,EAAS9E,EAAO+E,EAAMC,EAAOC,IACjE,2BAbL,CAwCGpF,S,iBC1CH,YAUA,IASI8R,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAe7G,SAGf8G,EAA8B,iBAAVC,GAAsBA,GAAUA,EAAOnU,SAAWA,QAAUmU,EAGhFC,EAA0B,iBAARC,MAAoBA,MAAQA,KAAKrU,SAAWA,QAAUqU,KAGxEC,EAAOJ,GAAcE,GAAYG,SAAS,cAATA,GAUjCC,EAPcxU,OAAOkB,UAOQuT,SAG7BC,EAAYzI,KAAKC,IACjByI,EAAY1I,KAAKoD,IAkBjBuF,EAAM,WACR,OAAON,EAAKO,KAAKD,OAyDnB,SAASE,EAASC,EAAMC,EAAM3O,GAC5B,IAAI4O,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARX,EACT,MAAM,IAAIY,UArIQ,uBA+IpB,SAASC,EAAWC,GAClB,IAAInR,EAAOuQ,EACPa,EAAUZ,EAKd,OAHAD,EAAWC,OAAWxD,EACtB6D,EAAiBM,EACjBT,EAASL,EAAKjQ,MAAMgR,EAASpR,GAI/B,SAASqR,EAAYF,GAMnB,OAJAN,EAAiBM,EAEjBR,EAAUxQ,WAAWmR,EAAchB,GAE5BQ,EAAUI,EAAWC,GAAQT,EAWtC,SAASa,EAAaJ,GACpB,IAAIK,EAAoBL,EAAOP,EAM/B,YAAyB5D,IAAjB4D,GAA+BY,GAAqBlB,GACzDkB,EAAoB,GAAOT,GANJI,EAAON,GAM8BJ,EAGjE,SAASa,IACP,IAAIH,EAAOjB,IACX,GAAIqB,EAAaJ,GACf,OAAOM,EAAaN,GAGtBR,EAAUxQ,WAAWmR,EAzBvB,SAAuBH,GACrB,IAEIT,EAASJ,GAFWa,EAAOP,GAI/B,OAAOG,EAASd,EAAUS,EAAQD,GAHRU,EAAON,IAGkCH,EAoBhCgB,CAAcP,IAGnD,SAASM,EAAaN,GAKpB,OAJAR,OAAU3D,EAINgE,GAAYT,EACPW,EAAWC,IAEpBZ,EAAWC,OAAWxD,EACf0D,GAeT,SAASiB,IACP,IAAIR,EAAOjB,IACP0B,EAAaL,EAAaJ,GAM9B,GAJAZ,EAAWtQ,UACXuQ,EAAWvR,KACX2R,EAAeO,EAEXS,EAAY,CACd,QAAgB5E,IAAZ2D,EACF,OAAOU,EAAYT,GAErB,GAAIG,EAGF,OADAJ,EAAUxQ,WAAWmR,EAAchB,GAC5BY,EAAWN,GAMtB,YAHgB5D,IAAZ2D,IACFA,EAAUxQ,WAAWmR,EAAchB,IAE9BI,EAIT,OAxGAJ,EAAOuB,EAASvB,IAAS,EACrBwB,EAASnQ,KACXmP,IAAYnP,EAAQmP,QAEpBL,GADAM,EAAS,YAAapP,GACHqO,EAAU6B,EAASlQ,EAAQ8O,UAAY,EAAGH,GAAQG,EACrEO,EAAW,aAAcrP,IAAYA,EAAQqP,SAAWA,GAiG1DW,EAAUI,OAnCV,gBACkB/E,IAAZ2D,GACF5Q,aAAa4Q,GAEfE,EAAiB,EACjBN,EAAWK,EAAeJ,EAAWG,OAAU3D,GA+BjD2E,EAAUK,MA5BV,WACE,YAAmBhF,IAAZ2D,EAAwBD,EAASe,EAAavB,MA4BhDyB,EA0FT,SAASG,EAASjW,GAChB,IAAImD,SAAcnD,EAClB,QAASA,IAAkB,UAARmD,GAA4B,YAARA,GA4EzC,SAAS6S,EAAShW,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAhCF,SAAkBA,GAChB,MAAuB,iBAATA,GAtBhB,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,EAsBtBoW,CAAapW,IAvXF,mBAuXYiU,EAAe/U,KAAKc,GA8B1CqW,CAASrW,GACX,OAzZM,IA2ZR,GAAIiW,EAASjW,GAAQ,CACnB,IAAIsW,EAAgC,mBAAjBtW,EAAMuW,QAAwBvW,EAAMuW,UAAYvW,EACnEA,EAAQiW,EAASK,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATtW,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAM8E,QAAQwO,EAAQ,IAC9B,IAAIkD,EAAWhD,EAAWiD,KAAKzW,GAC/B,OAAQwW,GAAY/C,EAAUgD,KAAKzW,GAC/B0T,EAAa1T,EAAMuB,MAAM,GAAIiV,EAAW,EAAI,GAC3CjD,EAAWkD,KAAKzW,GAtab,KAsa6BA,EAGvClB,EAAOD,QA9IP,SAAkB2V,EAAMC,EAAM3O,GAC5B,IAAImP,GAAU,EACVE,GAAW,EAEf,GAAmB,mBAARX,EACT,MAAM,IAAIY,UAnSQ,uBAySpB,OAJIa,EAASnQ,KACXmP,EAAU,YAAanP,IAAYA,EAAQmP,QAAUA,EACrDE,EAAW,aAAcrP,IAAYA,EAAQqP,SAAWA,GAEnDZ,EAASC,EAAMC,EAAM,CAC1B,QAAWQ,EACX,QAAWR,EACX,SAAYU,O,iCCtThB,QAsBoB,oBAAV3T,QAAwBA,YATf,0BAAf,EAS6C,WAEjD,aAEA,SAASgF,KAET,IAAI+B,EAAQ/B,EAAU7F,UAiFtB,OA/EA4H,EAAMc,GAAK,SAAUX,EAAWY,GAC9B,GAAMZ,GAAcY,EAApB,CAIA,IAAIoN,EAAStT,KAAKuT,QAAUvT,KAAKuT,SAAW,GAExCC,EAAYF,EAAQhO,GAAcgO,EAAQhO,IAAe,GAM7D,OAJuC,GAAlCkO,EAAUnU,QAAS6G,IACtBsN,EAAUlT,KAAM4F,GAGXlG,OAGTmF,EAAMsO,KAAO,SAAUnO,EAAWY,GAChC,GAAMZ,GAAcY,EAApB,CAIAlG,KAAKiG,GAAIX,EAAWY,GAGpB,IAAIwN,EAAa1T,KAAK2T,YAAc3T,KAAK2T,aAAe,GAMxD,OAJoBD,EAAYpO,GAAcoO,EAAYpO,IAAe,IAE1DY,IAAa,EAErBlG,OAGTmF,EAAMyO,IAAM,SAAUtO,EAAWY,GAC/B,IAAIsN,EAAYxT,KAAKuT,SAAWvT,KAAKuT,QAASjO,GAC9C,GAAMkO,GAAcA,EAAUvU,OAA9B,CAGA,IAAIG,EAAQoU,EAAUnU,QAAS6G,GAK/B,OAJe,GAAV9G,GACHoU,EAAUlU,OAAQF,EAAO,GAGpBY,OAGTmF,EAAM0B,UAAY,SAAUvB,EAAWvE,GACrC,IAAIyS,EAAYxT,KAAKuT,SAAWvT,KAAKuT,QAASjO,GAC9C,GAAMkO,GAAcA,EAAUvU,OAA9B,CAIAuU,EAAYA,EAAUrV,MAAM,GAC5B4C,EAAOA,GAAQ,GAIf,IAFA,IAAI8S,EAAgB7T,KAAK2T,aAAe3T,KAAK2T,YAAarO,GAEhD3J,EAAE,EAAGA,EAAI6X,EAAUvU,OAAQtD,IAAM,CACzC,IAAIuK,EAAWsN,EAAU7X,GACZkY,GAAiBA,EAAe3N,KAI3ClG,KAAK4T,IAAKtO,EAAWY,UAEd2N,EAAe3N,IAGxBA,EAAS/E,MAAOnB,KAAMe,GAGxB,OAAOf,OAGTmF,EAAM0K,OAAS,kBACN7P,KAAKuT,eACLvT,KAAK2T,aAGPvQ,IAhGY,mC,gBCbnB;;;;;IAQE,SAAUhF,EAAQC,GAKhB,EAAQ,CACN,WAGD,KAFE,EAAF,SAAY+E,GACX,OAgBK,SAAkBhF,EAAQgF,GAErC,aAIA,SAAS0Q,KAGT,IAAI3O,EAAQ2O,EAAWvW,UAAYlB,OAAOY,OAAQmG,EAAU7F,WAE5D4H,EAAM4O,eAAiB,SAAUvU,GAC/BQ,KAAKgU,gBAAiBxU,GAAM,IAG9B2F,EAAM8O,iBAAmB,SAAUzU,GACjCQ,KAAKgU,gBAAiBxU,GAAM,IAO9B2F,EAAM6O,gBAAkB,SAAUxU,EAAM0U,GAGtC,IAAIC,GADJD,OAAkBnG,IAAVmG,GAA6BA,GACZ,mBAAqB,sBAG1CE,EAAa,YACZhW,EAAOiW,aAEVD,EAAa,cACH,iBAAkBhW,IAE5BgW,EAAa,cAEf5U,EAAM2U,GAAcC,EAAYpU,OAIlCmF,EAAMvF,YAAc,SAAUC,GAC5B,IAAIC,EAAS,KAAOD,EAAME,KACrBC,KAAMF,IACTE,KAAMF,GAAUD,IAKpBsF,EAAMmP,SAAW,SAAUC,GACzB,IAAM,IAAI5Y,EAAE,EAAGA,EAAI4Y,EAAQtV,OAAQtD,IAAM,CACvC,IAAI6Y,EAAQD,EAAQ5Y,GACpB,GAAK6Y,EAAMC,YAAczU,KAAK0U,kBAC5B,OAAOF,IAObrP,EAAMwP,YAAc,SAAU9U,GAE5B,IAAI+U,EAAS/U,EAAM+U,OACdA,GAAuB,IAAXA,GAA2B,IAAXA,GAGjC5U,KAAK6U,aAAchV,EAAOA,IAG5BsF,EAAM2P,aAAe,SAAUjV,GAC7BG,KAAK6U,aAAchV,EAAOA,EAAMkV,eAAe,KAGjD5P,EAAM6P,cAAgB,SAAUnV,GAC9BG,KAAK6U,aAAchV,EAAOA,IAQ5BsF,EAAM0P,aAAe,SAAUhV,EAAOoV,GAG/BpV,EAAM+U,QAAU5U,KAAKkV,gBAI1BlV,KAAKkV,eAAgB,EAErBlV,KAAK0U,uBAA0C3G,IAAtBkH,EAAQE,UAE/BF,EAAQE,UAAYF,EAAQR,WAE9BzU,KAAKoV,YAAavV,EAAOoV,KAG3B9P,EAAMiQ,YAAc,SAAUvV,EAAOoV,GACnCjV,KAAKqV,qBAAsBxV,GAC3BG,KAAK6G,UAAW,cAAe,CAAEhH,EAAOoV,KAI1C,IAAIK,EAAkB,CACpBC,UAAW,CAAE,YAAa,WAC1BC,WAAY,CAAE,YAAa,WAAY,eACvCC,YAAa,CAAE,cAAe,YAAa,kBA+J7C,OA5JAtQ,EAAMkQ,qBAAuB,SAAUxV,GACrC,GAAMA,EAAN,CAIA,IAAIyT,EAASgC,EAAiBzV,EAAME,MAEpCuT,EAAOlT,SAAS,SAAUkF,GACxBlH,EAAOmD,iBAAkB+D,EAAWtF,QACnCA,MAEHA,KAAK0V,oBAAsBpC,IAG7BnO,EAAMwQ,uBAAyB,WAEvB3V,KAAK0V,sBAGX1V,KAAK0V,oBAAoBtV,SAAS,SAAUkF,GAC1ClH,EAAOwR,oBAAqBtK,EAAWtF,QACtCA,aAEIA,KAAK0V,sBAKdvQ,EAAMyQ,YAAc,SAAU/V,GAC5BG,KAAK6V,aAAchW,EAAOA,IAG5BsF,EAAM2Q,cAAgB,SAAUjW,GACzBA,EAAMsV,WAAanV,KAAK0U,mBAC3B1U,KAAK6V,aAAchW,EAAOA,IAI9BsF,EAAM4Q,YAAc,SAAUlW,GAC5B,IAAI2U,EAAQxU,KAAKsU,SAAUzU,EAAMkV,gBAC5BP,GACHxU,KAAK6V,aAAchW,EAAO2U,IAU9BrP,EAAM0Q,aAAe,SAAUhW,EAAOoV,GACpCjV,KAAKgW,YAAanW,EAAOoV,IAI3B9P,EAAM6Q,YAAc,SAAUnW,EAAOoV,GACnCjV,KAAK6G,UAAW,cAAe,CAAEhH,EAAOoV,KAM1C9P,EAAM8Q,UAAY,SAAUpW,GAC1BG,KAAKkW,WAAYrW,EAAOA,IAG1BsF,EAAMgR,YAAc,SAAUtW,GACvBA,EAAMsV,WAAanV,KAAK0U,mBAC3B1U,KAAKkW,WAAYrW,EAAOA,IAI5BsF,EAAMiR,WAAa,SAAUvW,GAC3B,IAAI2U,EAAQxU,KAAKsU,SAAUzU,EAAMkV,gBAC5BP,GACHxU,KAAKkW,WAAYrW,EAAO2U,IAU5BrP,EAAM+Q,WAAa,SAAUrW,EAAOoV,GAClCjV,KAAKqW,eACLrW,KAAKsW,UAAWzW,EAAOoV,IAIzB9P,EAAMmR,UAAY,SAAUzW,EAAOoV,GACjCjV,KAAK6G,UAAW,YAAa,CAAEhH,EAAOoV,KAMxC9P,EAAMkR,aAAe,WACnBrW,KAAKuW,gBACLvW,KAAK2V,yBACL3V,KAAKwW,eAGPrR,EAAMoR,cAAgB,WAEpBvW,KAAKkV,eAAgB,SACdlV,KAAK0U,mBAGdvP,EAAMqR,YAzNN,aA6NArR,EAAMsR,gBAAkB,SAAU5W,GAC3BA,EAAMsV,WAAanV,KAAK0U,mBAC3B1U,KAAK0W,eAAgB7W,EAAOA,IAIhCsF,EAAMwR,cAAgB,SAAU9W,GAC9B,IAAI2U,EAAQxU,KAAKsU,SAAUzU,EAAMkV,gBAC5BP,GACHxU,KAAK0W,eAAgB7W,EAAO2U,IAUhCrP,EAAMuR,eAAiB,SAAU7W,EAAOoV,GACtCjV,KAAKqW,eACLrW,KAAK4W,cAAe/W,EAAOoV,IAI7B9P,EAAMyR,cAAgB,SAAU/W,EAAOoV,GACrCjV,KAAK6G,UAAW,gBAAiB,CAAEhH,EAAOoV,KAM5CnB,EAAW+C,gBAAkB,SAAU5B,GACrC,MAAO,CACLxP,EAAGwP,EAAQ6B,MACXC,EAAG9B,EAAQ+B,QAMRlD,EA1RMzV,CAASD,EAAQgF,IACzB,2BATL,CAwBGhF,S,cChCH,IAAI6Y,EAGJA,EAAI,WACH,OAAOjX,KADJ,GAIJ,IAECiX,EAAIA,GAAK,IAAIrG,SAAS,cAAb,GACR,MAAOsG,GAEc,iBAAX9Y,SAAqB6Y,EAAI7Y,QAOrC1C,EAAOD,QAAUwb,G,gBCnBjB;;;;;GAsBI7Y,YATe,0BAAf,EASQ,WACZ,aAKA,SAAS+Y,EAAcva,GACrB,IAAI+B,EAAMyY,WAAYxa,GAGtB,OADqC,GAAvBA,EAAMyC,QAAQ,OAAegY,MAAO1Y,IAChCA,EAKpB,IAAI2Y,EAA6B,oBAAXvV,QAFtB,aAGE,SAAUwV,GACRxV,QAAQgB,MAAOwU,IAKfC,EAAe,CACjB,cACA,eACA,aACA,gBACA,aACA,cACA,YACA,eACA,kBACA,mBACA,iBACA,qBAGEC,EAAqBD,EAAavY,OAwBtC,SAASyY,EAAUlY,GACjB,IAAIyH,EAAQxD,iBAAkBjE,GAM9B,OALMyH,GACJqQ,EAAU,kBAAoBrQ,EAApB,6FAILA,EAKT,IAEI0Q,EAFAC,GAAU,EAyCd,SAASvU,EAAS7D,GAShB,GAzCF,WAEE,IAAKoY,EAAL,CAGAA,GAAU,EAQV,IAAIhZ,EAAMf,SAASiI,cAAc,OACjClH,EAAIqI,MAAM4Q,MAAQ,QAClBjZ,EAAIqI,MAAM6Q,QAAU,kBACpBlZ,EAAIqI,MAAM8Q,YAAc,QACxBnZ,EAAIqI,MAAM+Q,YAAc,kBACxBpZ,EAAIqI,MAAMgR,UAAY,aAEtB,IAAIvY,EAAO7B,SAAS6B,MAAQ7B,SAASqa,gBACrCxY,EAAKkE,YAAahF,GAClB,IAAIqI,EAAQyQ,EAAU9Y,GAEtB+Y,EAA8D,KAA7CrP,KAAK6P,MAAOhB,EAAclQ,EAAM4Q,QACjDxU,EAAQsU,eAAiBA,EAEzBjY,EAAKgQ,YAAa9Q,IAMlBwZ,GAGoB,iBAAR5Y,IACVA,EAAO3B,SAASC,cAAe0B,IAI3BA,GAAuB,iBAARA,GAAqBA,EAAK6Y,SAA/C,CAIA,IAAIpR,EAAQyQ,EAAUlY,GAGtB,GAAsB,QAAjByH,EAAMqR,QACT,OA5FJ,WASE,IARA,IAAIrQ,EAAO,CACT4P,MAAO,EACPtN,OAAQ,EACRX,WAAY,EACZ2O,YAAa,EACbrQ,WAAY,EACZM,YAAa,GAEL7M,EAAE,EAAGA,EAAI8b,EAAoB9b,IAErCsM,EADkBuP,EAAa7b,IACT,EAExB,OAAOsM,EA+EEuQ,GAGT,IAAIvQ,EAAO,GACXA,EAAK4P,MAAQrY,EAAKiZ,YAClBxQ,EAAKsC,OAAS/K,EAAKkZ,aAKnB,IAHA,IAAIC,EAAc1Q,EAAK0Q,YAAiC,cAAnB1R,EAAMgR,UAGjCtc,EAAE,EAAGA,EAAI8b,EAAoB9b,IAAM,CAC3C,IAAIid,EAAcpB,EAAa7b,GAC3BiB,EAAQqK,EAAO2R,GACfja,EAAMyY,WAAYxa,GAEtBqL,EAAM2Q,GAAiBvB,MAAO1Y,GAAc,EAANA,EAGxC,IAAIka,EAAe5Q,EAAK6Q,YAAc7Q,EAAK8Q,aACvCC,EAAgB/Q,EAAKgR,WAAahR,EAAKiR,cACvCC,EAAclR,EAAKmR,WAAanR,EAAKoR,YACrCC,EAAerR,EAAKsR,UAAYtR,EAAKuR,aACrCxB,EAAc/P,EAAKwR,gBAAkBxR,EAAKyR,iBAC1CC,EAAe1R,EAAK2R,eAAiB3R,EAAK4R,kBAE1CC,EAAuBnB,GAAehB,EAGtCoC,EAAa5C,EAAclQ,EAAM4Q,QACjB,IAAfkC,IACH9R,EAAK4P,MAAQkC,GAETD,EAAuB,EAAIjB,EAAeb,IAGhD,IAAIgC,EAAc7C,EAAclQ,EAAMsD,QAatC,OAZqB,IAAhByP,IACH/R,EAAKsC,OAASyP,GAEVF,EAAuB,EAAId,EAAgBW,IAGjD1R,EAAK2B,WAAa3B,EAAK4P,OAAUgB,EAAeb,GAChD/P,EAAKsQ,YAActQ,EAAKsC,QAAWyO,EAAgBW,GAEnD1R,EAAKC,WAAaD,EAAK4P,MAAQsB,EAC/BlR,EAAKO,YAAcP,EAAKsC,OAAS+O,EAE1BrR,GAGT,OAAO5E,IA/LY,mC,gBCbnB;;;;GAkCGjF,OAtBC,EAAQ,CACN,KACA,YAGD,KAFE,EAAF,SAAY+E,EAAU8W,GACrB,OAkBK,SAAkB7b,EAAQ+E,EAAU8W,GAC/C,aAEA9W,EAAS+B,cAAc5E,KAAK,uBAE5B,IAAI6E,EAAQhC,EAAS5F,UAqBrB,OAnBA4H,EAAM+U,oBAAsB,WAC1Bla,KAAKiG,GAAI,WAAYjG,KAAKia,eAG5B9U,EAAM8U,aAAe,WACnB,GAAMja,KAAK0C,QAAQuX,aAAnB,CAGA,IAAIhZ,EAAQjB,KAQZia,EAAcja,KAAK0G,QAAST,GAAI,YAPhC,SAAiChD,EAAUkX,GACzC,IAAI/R,EAAOnH,EAAM2M,cAAeuM,EAAMC,KACtCnZ,EAAMoZ,eAAgBjS,GAAQA,EAAKpE,SAC7B/C,EAAMyB,QAAQ4X,YAClBrZ,EAAM8I,gCAML5G,EA5CM9E,CAASD,EAAQ+E,EAAU8W,IACnC,4B,gBCjBL,UAYI,EAAQ,CACN,KACA,WACQ,0BAAP,EAeE,SAAkB9W,EAAU5E,GAIrC,IAAIgF,EAAQJ,EAASI,MAEjBgX,EAAoBhX,EAAMhG,UAAU6L,aACxC7F,EAAMhG,UAAU6L,aAAe,WAE7B,GADAmR,EAAkBpZ,MAAOnB,KAAMgB,WACzBhB,KAAKpC,OAAO8E,QAAQ8X,KAA1B,CAIA,IAAIC,EAAeza,KAAK6I,OAAS7I,KAAKyF,EAClCiV,EAAa1a,KAAKmH,MAAM,GAAG1B,EAC/BzF,KAAKmH,MAAM/G,SAAS,SAAUgI,GAC5B,IAAIuS,EAAUvS,EAAK3C,EAAIiV,EAAaD,EACpCrS,EAAKwS,eAAgBD,QAIzBpX,EAAMhG,UAAUsd,WAAa,SAAUC,GACrC9a,KAAKmH,MAAM/G,SAAS,SAAUgI,GAC5BA,EAAKpE,QAAQiD,MAAM8T,QAAUD,MAMjC,IAAI3V,EAAQhC,EAAS5F,UAErB4F,EAAS+B,cAAc5E,KAAK,eAE5B6E,EAAM6V,YAAc,WAClBhb,KAAKib,UAAYjb,KAAKuF,cACtBvF,KAAKkb,kBAAoBlb,KAAKuF,cAC9BvF,KAAKiG,GAAI,SAAUjG,KAAKmb,cACxBnb,KAAKiG,GAAI,UAAWjG,KAAKob,eACzBpb,KAAKiG,GAAI,SAAUjG,KAAKqb,cACxBrb,KAAKiG,GAAI,WAAYjG,KAAKsb,gBAC1Btb,KAAKiG,GAAI,aAAcjG,KAAKub,mBAG9B,IAAI7S,EAAevD,EAAMuD,aACzBvD,EAAMuD,aAAe,WACnBA,EAAavH,MAAOnB,KAAMgB,WACpBhB,KAAK0C,QAAQ8X,MAInBxa,KAAK2H,OAAOvH,SAAS,SAAU0I,EAAOnN,GACpC,IAAImf,EAAQnf,GAAKqE,KAAKuF,cAAgB,EAAI,EAC1CuD,EAAM+R,WAAYC,KACjB9a,OAKLmF,EAAMgW,aAAe,WAEnBnb,KAAKib,UAAY3S,KAAKoD,IAAK1L,KAAKkb,kBAAmBlb,KAAK2H,OAAO1I,OAAS,GACxEe,KAAKkb,kBAAoBlb,KAAKuF,eAGhCJ,EAAMkW,aAAe,kBACZrb,KAAKwb,WACNxb,KAAK0C,QAAQ8X,OAInBxa,KAAKyK,cAAcoQ,WAAY,GACd7a,KAAK2H,OAAQ3H,KAAKib,YAChBjb,KAAKib,WAAajb,KAAKuF,eACxCvF,KAAK2H,OAAQ3H,KAAKib,WAAYJ,WAAY,KAI9C1V,EAAMiW,cAAgB,WAEpBpb,KAAKwb,YAAa,GAGpBrW,EAAMmW,eAAiB,WAChBtb,KAAK0C,QAAQ8X,MAChBxa,KAAKgE,QAAQsC,UAAUC,IAAI,YAI/BpB,EAAMoW,iBAAmB,WACjBvb,KAAK0C,QAAQ8X,OAGnBxa,KAAKgE,QAAQsC,UAAUkJ,OAAO,WAE9BxP,KAAK2H,OAAOvH,SAAS,SAAU0I,GAC7BA,EAAM+R,WAAW,SAMrB,IAAIY,EAAiBtW,EAAMsW,eAC3BtW,EAAMsW,eAAiB,WACfzb,KAAK0C,QAAQ8X,MAKnBxa,KAAK0b,aACL1b,KAAK2b,uBALHF,EAAeta,MAAOnB,KAAMgB,YAQhC,IAAI+I,EAA2B5E,EAAM4E,yBACrC5E,EAAM4E,yBAA2B,WAC1B/J,KAAK0C,QAAQ8X,MAEhBxa,KAAK4b,cAAe,GAEtB7R,EAAyB5I,MAAOnB,KAAMgB,YAGxCmE,EAAMuW,WAAa,WACjB,KAAK1b,KAAK2H,OAAO1I,OAAS,GAA1B,CAIA,IAAI4c,EAAU7b,KAAK8b,iBACfC,EAAa/b,KAAK2H,OAAQkU,EAAQrd,GAClCwd,EAAahc,KAAK2H,OAAQkU,EAAQpd,GAClCwd,EAAWjc,KAAKkc,eAAgBH,EAAWlT,OAAQmT,EAAWnT,QAC9DsT,EAAWnc,KAAKkc,eAAgBH,EAAWlT,QAAS7I,KAAKyF,GAC7D0W,GAAsBF,EAEtBF,EAAWlB,WAAY,EAAIsB,GAC3BH,EAAWnB,WAAYsB,GAGvB,IAAIC,EAAgBP,EAAQrd,EACvBwB,KAAKqc,aACRD,EAAgBD,EAAW,GAAMN,EAAQrd,EAAIqd,EAAQpd,GAEZsP,MAAtB/N,KAAKoc,eACxBpc,KAAKoc,eAAiBA,GACtBpc,KAAKoc,eAAiBP,EAAQrd,GAC9BwB,KAAKoc,eAAiBP,EAAQpd,GAG9BuB,KAAK2H,OAAQ3H,KAAKoc,eAAgBvB,WAAY,GAEhD7a,KAAKoc,cAAgBA,IAGvBjX,EAAM2W,eAAiB,WACrB,OAAM9b,KAAKqc,YAAerc,KAAKwb,WAM1Bxb,KAAK0C,QAAQgI,WACT1K,KAAKsc,yBAELtc,KAAKuc,0BARL,CACL/d,EAAGwB,KAAKib,UACRxc,EAAGuB,KAAKuF,gBAUdJ,EAAMmX,uBAAyB,WAC7B,IAAIE,EAAYxc,KAAK2H,OAAOJ,KAAK,SAAUuB,EAAOnN,GAChD,OAAOqE,KAAKyc,kBAAmBzc,KAAKyF,EAAG9J,KACtCqE,MACC0c,EAAeF,EAAUjV,KAAK,SAAU0U,GAC1C,OAAO3T,KAAKmE,IAAKwP,MAEfU,EAAcrU,KAAKoD,IAAIvK,MAAOmH,KAAMoU,GACpCE,EAAeF,EAAard,QAASsd,GACrCV,EAAWO,EAAWI,GACtBzU,EAAMnI,KAAK2H,OAAO1I,OAElBuN,EAAQyP,GAAY,EAAI,GAAK,EACjC,MAAO,CACLzd,EAAGoe,EACHne,EAAGF,EAAM6N,OAAQwQ,EAAepQ,EAAOrE,KAI3ChD,EAAMoX,wBAA0B,WAG9B,IADA,IAAIM,EAAY,EACNlhB,EAAE,EAAGA,EAAIqE,KAAK2H,OAAO1I,OAAS,EAAGtD,IAAM,CAC/C,IAAImN,EAAQ9I,KAAK2H,OAAOhM,GACxB,IAAMqE,KAAKyF,EAAIqD,EAAMD,OACnB,MAEFgU,EAAYlhB,EAEd,MAAO,CACL6C,EAAGqe,EACHpe,EAAGoe,EAAY,IAInB1X,EAAM+W,eAAiB,SAAU1d,EAAGC,GAClC,IAAIqe,EAAOre,EAAID,EAEf,IAAMwB,KAAK0C,QAAQgI,WACjB,OAAOoS,EAGT,IAAIC,EAAWD,EAAO9c,KAAKyI,eACvBuU,EAAYF,EAAO9c,KAAKyI,eAO5B,OANKH,KAAKmE,IAAKsQ,GAAazU,KAAKmE,IAAKqQ,KACpCA,EAAOC,GAEJzU,KAAKmE,IAAKuQ,GAAc1U,KAAKmE,IAAKqQ,KACrCA,EAAOE,GAEFF,GAKT,IAAIxV,EAAqBnC,EAAMmC,mBAC/BnC,EAAMmC,mBAAqB,WACnBtH,KAAK0C,QAAQ8X,MACjBlT,EAAmBnG,MAAOnB,KAAMgB,YAIpC,IAAIic,EAAiB9X,EAAM8X,eAO3B,OANA9X,EAAM8X,eAAiB,WACfjd,KAAK0C,QAAQ8X,MACjByC,EAAe9b,MAAOnB,KAAMgB,YAIzBmC,IA1PO,gC,iBCfd,mBAEC,SAAWqN,GACV,aAEA,IAeI0M,EAfAC,EAAqB,CACvB,4CACA,+CACA,qCACA,sCACA,wCACA,sCACA,2CACA,0CACA,0CACA,sDACA,gDAaF,SAASC,EAAWC,EAAMC,GAGxBtd,KAAKud,MAAQvd,KAAKwd,KAAKrgB,KAAK6C,MAC5BA,KAAKyd,MAAQzd,KAAK0d,KAAKvgB,KAAK6C,MAC5BA,KAAK2d,eAAiB3d,KAAK2d,eAAexgB,KAAK6C,MAC/CA,KAAK4d,cAAgB5d,KAAK4d,cAAczgB,KAAK6C,MAG7CA,KAAK6d,UAAYR,EACjBrd,KAAK8d,OAAST,EAAKvf,cACjB,iDAEFkC,KAAK+d,KAAO/d,KAAK8d,OAAOlb,aAAa,SAAW,SAChD5C,KAAKge,UACH,SAAUngB,EAASiI,cAAc,WACR,WAAzB9F,KAAK8d,OAAOG,SAGdje,KAAKke,WAAa,GAGlBle,KAAK/C,OAAOqgB,GA6Sd,SAASa,EAAQC,GACf,OAAOlgB,MAAMX,UAAUY,MAAMrC,KAAKsiB,GAWpC,SAASC,EAAG1gB,EAAU2gB,GACpB,OAAOH,GAASG,GAAWzgB,GAAUI,iBAAiBN,IA8BxD,SAAS4gB,EAAoBlB,GAC3B,IAAImB,EAAoBC,EAAqBpB,GACzCqB,EAAUrB,EAAKvf,cAAc,gBAAkB0gB,EAAkB,GAEjEE,GACFA,EAAQrQ,QAUZ,SAASoQ,EAAqBpB,GAC5B,OAAOgB,EAAGlB,EAAmBwB,KAAK,KAAMtB,GAAMuB,QAAO,SAAUC,GAC7D,SACEA,EAAMpG,aACNoG,EAAMnG,cACNmG,EAAMC,iBAAiB7f,WAkD7B,SAAS8f,IACPV,EAAG,sBAAsBje,SAAQ,SAAUid,GACzC,IAAID,EAAWC,EAAMA,EAAKza,aAAa,0BAAuBmL,MAIlE,GA3ZAqP,EAAW7f,UAAUN,OAAS,SAAUqgB,GA0YxC,IAAqBD,EAEf2B,EA3VJ,OA/CAhf,KAAKif,SACHjf,KAAKif,UAwTT,SAAiBpW,GACf,GAAIqW,SAAS3hB,UAAU4hB,cAActW,GACnC,OAAOsV,EAAQtV,GAGjB,GAAIuW,QAAQ7hB,UAAU4hB,cAActW,GAClC,MAAO,CAACA,GAGV,GAAsB,iBAAXA,EACT,OAAOwV,EAAGxV,GAlUOwW,CAAQ/B,KAuYRD,EAvYgCrd,KAAK6d,WAyYpDmB,EADQb,EAAQd,EAAK5d,WAAW6f,YACfV,QAAO,SAAUvB,GACpC,OAAyB,IAAlBA,EAAKhF,aAGL/Y,OAAO0f,EAAS3f,QAAQge,GAAO,GAEjC2B,GA5YPhf,KAAKuf,MAAQvf,KAAK8d,OAAO0B,aAAa,QAKtCxf,KAAK8d,OAAO2B,aAAa,OAAQzf,KAAK+d,MAEjC/d,KAAKge,WAORhe,KAAK6d,UAAU4B,aAAa,0BAA2B,IAGvDzf,KAAK6d,UAAUlO,gBAAgB,gBAT3B3P,KAAKuf,MACPvf,KAAK6d,UAAUlO,gBAAgB,eAE/B3P,KAAK6d,UAAU4B,aAAa,eAAe,GAW/Czf,KAAK0f,SAAWrB,EAAG,2BAA6Bre,KAAK6d,UAAUzY,GAAK,MACpEpF,KAAK0f,SAAStf,QACZ,SAAUuf,GACRA,EAAOpe,iBAAiB,QAASvB,KAAKud,QACtCpgB,KAAK6C,OAKTA,KAAK4f,SAAWvB,EAAG,0BAA2Bre,KAAK6d,WAAWtb,OAC5D8b,EAAG,2BAA6Bre,KAAK6d,UAAUzY,GAAK,OAEtDpF,KAAK4f,SAASxf,QACZ,SAAUyf,GACRA,EAAOte,iBAAiB,QAASvB,KAAKyd,QACtCtgB,KAAK6C,OAITA,KAAK8f,MAAM,UAEJ9f,MAWTod,EAAW7f,UAAUigB,KAAO,SAAU3d,GAEpC,OAAIG,KAAKuf,QAITvf,KAAKuf,OAAQ,EAIbrC,EAAsBrf,EAAS8Q,cAE3B3O,KAAKge,UACPhe,KAAK8d,OAAOiC,UAAUlgB,aAAiBiM,WAAQ,EAASjM,IAExDG,KAAK8d,OAAO2B,aAAa,OAAQ,IACjCzf,KAAK6d,UAAUlO,gBAAgB,eAI/B3P,KAAKif,SAAS7e,SAAQ,SAAUyI,GAC1BA,EAAO2W,aAAa,gBACtB3W,EAAO4W,aACL,wCACA5W,EAAOjG,aAAa,gBAGxBiG,EAAO4W,aAAa,cAAe,YAKvClB,EAAoBve,KAAK8d,QAKzBjgB,EAAS6B,KAAK6B,iBAAiB,QAASvB,KAAK2d,gBAAgB,GAC7D9f,EAAS0D,iBAAiB,UAAWvB,KAAK4d,eAG1C5d,KAAK8f,MAAM,OAAQjgB,IAtCVG,MAmDXod,EAAW7f,UAAUmgB,KAAO,SAAU7d,GAEpC,OAAKG,KAAKuf,OAIVvf,KAAKuf,OAAQ,EAETvf,KAAKge,UACPhe,KAAK8d,OAAOkC,MAAMngB,aAAiBiM,WAAQ,EAASjM,IAEpDG,KAAK8d,OAAOnO,gBAAgB,QAC5B3P,KAAK6d,UAAU4B,aAAa,cAAe,QAI3Czf,KAAKif,SAAS7e,SAAQ,SAAUyI,GAC1BA,EAAO2W,aAAa,0CACtB3W,EAAO4W,aACL,cACA5W,EAAOjG,aAAa,0CAEtBiG,EAAO8G,gBAAgB,0CAEvB9G,EAAO8G,gBAAgB,mBAQzBuN,GAAuBA,EAAoB7O,OAC7C6O,EAAoB7O,QAKtBxQ,EAAS6B,KAAKkQ,oBAAoB,QAAS5P,KAAK2d,gBAAgB,GAChE9f,EAAS+R,oBAAoB,UAAW5P,KAAK4d,eAG7C5d,KAAK8f,MAAM,OAAQjgB,GAEZG,MAzCEA,MAkDXod,EAAW7f,UAAUkS,QAAU,WAwB7B,OAtBAzP,KAAK0d,OAGL1d,KAAK0f,SAAStf,QACZ,SAAUuf,GACRA,EAAO/P,oBAAoB,QAAS5P,KAAKud,QACzCpgB,KAAK6C,OAITA,KAAK4f,SAASxf,QACZ,SAAUyf,GACRA,EAAOjQ,oBAAoB,QAAS5P,KAAKyd,QACzCtgB,KAAK6C,OAITA,KAAK8f,MAAM,WAGX9f,KAAKke,WAAa,GAEXle,MASTod,EAAW7f,UAAU0I,GAAK,SAAUlG,EAAM6O,GAOxC,YANqC,IAA1B5O,KAAKke,WAAWne,KACzBC,KAAKke,WAAWne,GAAQ,IAG1BC,KAAKke,WAAWne,GAAMO,KAAKsO,GAEpB5O,MASTod,EAAW7f,UAAUqW,IAAM,SAAU7T,EAAM6O,GACzC,IAAIxP,EAAQY,KAAKke,WAAWne,GAAMV,QAAQuP,GAM1C,OAJIxP,GAAS,GACXY,KAAKke,WAAWne,GAAMT,OAAOF,EAAO,GAG/BY,MAWTod,EAAW7f,UAAUuiB,MAAQ,SAAU/f,EAAMF,IAC3BG,KAAKke,WAAWne,IAAS,IAE/BK,QACR,SAAU8F,GACRA,EAASlG,KAAK6d,UAAWhe,IACzB1C,KAAK6C,QAWXod,EAAW7f,UAAUqgB,cAAgB,SAAU/d,GAK3CG,KAAKuf,OAzSQ,KA0Sb1f,EAAMogB,OACQ,gBAAdjgB,KAAK+d,OAELle,EAAMuO,iBACNpO,KAAK0d,KAAK7d,IAKRG,KAAKuf,OApTG,IAoTM1f,EAAMogB,OAoG1B,SAAoB5C,EAAMxd,GACxB,IAAI2e,EAAoBC,EAAqBpB,GACzC6C,EAAmB1B,EAAkBnf,QAAQxB,EAAS8Q,eAKtD9O,EAAMsgB,UAAiC,IAArBD,GACpB1B,EAAkBA,EAAkBvf,OAAS,GAAGoP,QAChDxO,EAAMuO,kBAKLvO,EAAMsgB,UACPD,IAAqB1B,EAAkBvf,OAAS,IAEhDuf,EAAkB,GAAGnQ,QACrBxO,EAAMuO,kBArHNgS,CAAWpgB,KAAK8d,OAAQje,IAW5Bud,EAAW7f,UAAUogB,eAAiB,SAAU9d,GAG1CG,KAAKuf,QAAUvf,KAAK6d,UAAUwC,SAASxgB,EAAMgJ,SAC/C0V,EAAoBve,KAAK8d,cAiIE,IAApBtN,EAAO3S,SAA0B,CAC1C,IAAIA,EAAW2S,EAAO3S,SAEM,YAAxBA,EAASyD,WACXzD,EAAS0D,iBAAiB,mBAAoBwd,GAE1CvO,EAAO8P,sBACT9P,EAAO8P,sBAAsBvB,GAE7BvO,EAAOtP,WAAW6d,EAAoB,SAKmB,IAAnBrjB,EAAOD,QACjDC,EAAOD,QAAU2hB,OAIhB,KAFwB,EAAF,WACrB,OAAOA,GACR,QAFoB,OAEpB,aAxeJ,MA4eoB,IAAX5M,EAAyBA,EAASpS,U,iCC9e5C,SAQE,SAAUA,EAAQC,GAElB,kBAIiB,0BAAf,KAAe,kCANnB,CAeGD,QAAQ,WACT,aAEA,IAAImiB,EAAgB,WAClB,IAAIC,EAAYpiB,OAAOghB,QAAQ7hB,UAE/B,GAAKijB,EAAUC,QACb,MAAO,UAGT,GAAKD,EAAUliB,gBACb,MAAO,kBAKT,IAFA,IAAIoiB,EAAW,CAAE,SAAU,MAAO,KAAM,KAE9B/kB,EAAE,EAAGA,EAAI+kB,EAASzhB,OAAQtD,IAAM,CACxC,IACImE,EADS4gB,EAAS/kB,GACA,kBACtB,GAAK6kB,EAAW1gB,GACd,OAAOA,GAjBO,GAsBpB,OAAO,SAA0BN,EAAM7B,GACrC,OAAO6B,EAAM+gB,GAAiB5iB,Q,gBCjDlC,QAyBGS,OApBC,EAAQ,CACN,WAGD,KAFE,EAAF,SAAYiF,GACX,OAiBK,SAAkBjF,EAAQiF,GAErC,aAEA,SAASC,EAAM9D,EAAM5B,GACnBoC,KAAKgE,QAAUxE,EACfQ,KAAKpC,OAASA,EAEdoC,KAAK/C,SAGP,IAAIkI,EAAQ7B,EAAK/F,UA+DjB,OA7DA4H,EAAMlI,OAAS,WACb+C,KAAKgE,QAAQiD,MAAM0Z,SAAW,WAC9B3gB,KAAKgE,QAAQyb,aAAc,cAAe,QAC1Czf,KAAKyF,EAAI,EACTzF,KAAK6D,MAAQ,GAGfsB,EAAMsK,QAAU,WAEdzP,KAAKqN,WACLrN,KAAKgE,QAAQiD,MAAM0Z,SAAW,GAC9B,IAAIC,EAAO5gB,KAAKpC,OAAO+H,WACvB3F,KAAKgE,QAAQiD,MAAO2Z,GAAS,GAC7B5gB,KAAKgE,QAAQ2L,gBAAgB,gBAG/BxK,EAAM9B,QAAU,WACdrD,KAAKiI,KAAO5E,EAASrD,KAAKgE,UAG5BmB,EAAMkD,YAAc,SAAU5C,GAC5BzF,KAAKyF,EAAIA,EACTzF,KAAKoJ,eACLpJ,KAAK4a,eAAgBnV,IAIvBN,EAAMiE,aAAejE,EAAM0b,iBAAmB,WAC5C,IAAIC,EAA2C,QAA1B9gB,KAAKpC,OAAO+H,WAAuB,aAAe,cACvE3F,KAAK6I,OAAS7I,KAAKyF,EAAIzF,KAAKiI,KAAM6Y,GAChC9gB,KAAKiI,KAAK4P,MAAQ7X,KAAKpC,OAAO8G,WAGlCS,EAAMyV,eAAiB,SAAUnV,GAE/B,IAAImb,EAAO5gB,KAAKpC,OAAO+H,WACvB3F,KAAKgE,QAAQiD,MAAO2Z,GAAS5gB,KAAKpC,OAAOmjB,iBAAkBtb,IAG7DN,EAAM6G,OAAS,WACbhM,KAAKgE,QAAQsC,UAAUC,IAAI,eAC3BvG,KAAKgE,QAAQ2L,gBAAgB,gBAG/BxK,EAAMkI,SAAW,WACfrN,KAAKgE,QAAQsC,UAAUkJ,OAAO,eAC9BxP,KAAKgE,QAAQyb,aAAc,cAAe,SAM5Cta,EAAM6b,UAAY,SAAUnd,GAC1B7D,KAAK6D,MAAQA,EACb7D,KAAK4a,eAAgB5a,KAAKyF,EAAIzF,KAAKpC,OAAO6K,eAAiB5E,IAG7DsB,EAAMqK,OAAS,WACbxP,KAAKgE,QAAQvE,WAAWiQ,YAAa1P,KAAKgE,UAGrCV,EA3FMjF,CAASD,EAAQiF,IACzB,4B,gBCTL,QAeGjF,YAVgB,0BAAf,EAUO,WACX,aAEA,SAASmF,EAAO3F,GACdoC,KAAKpC,OAASA,EACdoC,KAAKihB,aAAoC,QAArBrjB,EAAO+H,WAC3B3F,KAAKmH,MAAQ,GACbnH,KAAKkI,WAAa,EAClBlI,KAAKuK,OAAS,EAGhB,IAAIpF,EAAQ5B,EAAMhG,UA4ClB,OA1CA4H,EAAMkE,QAAU,SAAUjB,GAKxB,GAJApI,KAAKmH,MAAM7G,KAAM8H,GACjBpI,KAAKkI,YAAcE,EAAKH,KAAKC,WAC7BlI,KAAKuK,OAASjC,KAAKC,IAAKH,EAAKH,KAAKO,YAAaxI,KAAKuK,QAE1B,GAArBvK,KAAKmH,MAAMlI,OAAc,CAC5Be,KAAKyF,EAAI2C,EAAK3C,EACd,IAAI2F,EAAcpL,KAAKihB,aAAe,aAAe,cACrDjhB,KAAKmJ,YAAcf,EAAKH,KAAMmD,KAIlCjG,EAAMiE,aAAe,WACnB,IAAIiC,EAAYrL,KAAKihB,aAAe,cAAgB,aAChDC,EAAWlhB,KAAKyH,cAChB0Z,EAAaD,EAAWA,EAASjZ,KAAMoD,GAAc,EACrDnC,EAAalJ,KAAKkI,YAAelI,KAAKmJ,YAAcgY,GACxDnhB,KAAK6I,OAAS7I,KAAKyF,EAAIzF,KAAKmJ,YAAcD,EAAalJ,KAAKpC,OAAO8G,WAGrES,EAAMsC,YAAc,WAClB,OAAOzH,KAAKmH,MAAOnH,KAAKmH,MAAMlI,OAAS,IAGzCkG,EAAM6G,OAAS,WACbhM,KAAKmH,MAAM/G,SAAS,SAAUgI,GAC5BA,EAAK4D,aAIT7G,EAAMkI,SAAW,WACfrN,KAAKmH,MAAM/G,SAAS,SAAUgI,GAC5BA,EAAKiF,eAITlI,EAAM+H,gBAAkB,WACtB,OAAOlN,KAAKmH,MAAMI,KAAK,SAAUa,GAC/B,OAAOA,EAAKpE,YAITT,IAjEY,mC,gBCLnB,QAyBGnF,OApBC,EAAQ,CACN,WAGD,KAFE,EAAF,SAAYG,GACX,OAiBK,SAAkBH,EAAQG,GAErC,aAIA,IAAI4G,EAAQ,CAEZ,eAAuB,WAChBnF,KAAKohB,cAIVphB,KAAKohB,aAAc,EACnBphB,KAAKwF,cAAgB,EACrBxF,KAAKqhB,YAGP,QAAgB,WACdrhB,KAAKshB,iBACLthB,KAAKuhB,0BAEL,IAAIC,EAAYxhB,KAAKyF,EAMrB,GAJAzF,KAAKyhB,mBACLzhB,KAAKyb,iBACLzb,KAAK0hB,OAAQF,GAERxhB,KAAKohB,YAAc,CACtB,IAAIngB,EAAQjB,KACZsgB,uBAAuB,WACrBrf,EAAMogB,eAKZ,eAAuB,WACrB,IAAI5b,EAAIzF,KAAKyF,EAERzF,KAAK0C,QAAQgI,YAAc1K,KAAKmH,MAAMlI,OAAS,IAClDwG,EAAIlH,EAAM6N,OAAQ3G,EAAGzF,KAAKyI,gBAC1BhD,GAAKzF,KAAKyI,eACVzI,KAAKid,eAAgBxX,IAGvBzF,KAAK4b,cAAenW,EAAGzF,KAAKohB,aAC5BphB,KAAK2b,uBAGP,cAAsB,SAAUlW,EAAGkc,GACjClc,GAAKzF,KAAKiK,eAEVxE,EAAIzF,KAAK0C,QAAQkD,aAAeH,EAAIA,EACpC,IAAImc,EAAa5hB,KAAK+gB,iBAAkBtb,GAGxCzF,KAAK0G,OAAOO,MAAM4a,UAAYF,EAC5B,eAAiBC,EAAa,QAAU,cAAgBA,EAAa,KAGzE,oBAA4B,WAC1B,IAAIE,EAAa9hB,KAAK2H,OAAO,GAC7B,GAAMma,EAAN,CAGA,IAAIC,GAAa/hB,KAAKyF,EAAIqc,EAAWjZ,OACjCsT,EAAW4F,EAAY/hB,KAAK4I,YAChC5I,KAAKgH,cAAe,SAAU,KAAM,CAAEmV,EAAU4F,MAGlD,yBAAiC,WACzB/hB,KAAKmH,MAAMlI,SAGjBe,KAAKyF,GAAKzF,KAAKyK,cAAc5B,OAC7B7I,KAAK0F,SAAW,EAChB1F,KAAKyb,mBAGP,iBAAyB,SAAUkF,GACjC,OAAK3gB,KAAK0C,QAAQoC,gBAEqD,IAA5DwD,KAAK6P,MAASwI,EAAW3gB,KAAKiI,KAAK2B,WAAe,KAAmB,IAGvEtB,KAAK6P,MAAOwI,GAAa,MAIpC,OAAe,SAAUa,IAENxhB,KAAKkV,eAClB5M,KAAK6P,MAAgB,IAATnY,KAAKyF,IAAa6C,KAAK6P,MAAmB,IAAZqJ,IAE5CxhB,KAAKwF,gBAGFxF,KAAKwF,cAAgB,IACxBxF,KAAKohB,aAAc,SACZphB,KAAKgiB,gBAEZhiB,KAAKyb,iBACLzb,KAAKgH,cAAe,SAAU,KAAM,CAAEhH,KAAKuF,kBAI/C,eAAuB,SAAUE,GAE/B,IAAIwc,EAAYjiB,KAAKiK,eAAiBxE,EACtCzF,KAAKkiB,YAAaliB,KAAK4K,iBAAkBqX,GAAY,GAErD,IAAIE,EAAWniB,KAAKiI,KAAK2B,YAAenE,EAAIzF,KAAKyI,eAAiBzI,KAAKiK,gBACvEjK,KAAKkiB,YAAaliB,KAAK6K,gBAAiBsX,EAAU,IAGpD,YAAoB,SAAUhb,EAAOib,EAAKve,GACxC,IAAM,IAAIlI,EAAI,EAAGA,EAAIwL,EAAMlI,OAAQtD,IAAM,CACvC,IAAIyM,EAAOjB,EAAMxL,GACb0mB,EAAYD,EAAM,EAAIve,EAAQ,EAClCuE,EAAK4Y,UAAWqB,GAChBD,GAAOha,EAAKH,KAAKC,aAIrB,cAAsB,SAAUf,GAC9B,GAAMA,GAAUA,EAAMlI,OAGtB,IAAM,IAAItD,EAAI,EAAGA,EAAIwL,EAAMlI,OAAQtD,IACjCwL,EAAMxL,GAAGqlB,UAAW,IAMxB,iBAAyB,WACvBhhB,KAAKyF,GAAKzF,KAAK0F,SACf1F,KAAK0F,UAAY1F,KAAKsiB,qBAGxB,WAAmB,SAAUC,GAC3BviB,KAAK0F,UAAY6c,GAGnB,kBAA0B,WACxB,OAAO,EAAIviB,KAAK0C,QAAS1C,KAAKgiB,gBAAkB,qBAAuB,aAGzE,mBAA2B,WAEzB,OAAOhiB,KAAKyF,EAAIzF,KAAK0F,UAAa,EAAI1F,KAAKsiB,sBAG7C,eAAuB,WACrB,GAAMtiB,KAAKwiB,aAAgBxiB,KAAKkV,cAAhC,CAIA,IACIuN,EADeziB,KAAK0iB,MAAQ1iB,KAAKyF,EACNzF,KAAK0F,SACpC1F,KAAK2iB,WAAYF,KAGnB,wBAAgC,WAG9B,KADeziB,KAAKwiB,cAAexiB,KAAKkV,iBACvBlV,KAAKgiB,iBAAoBhiB,KAAK2H,OAAO1I,OAAtD,CAGA,IACIsjB,IADwC,EAA7BviB,KAAKyK,cAAc5B,OAAc7I,KAAKyF,GAC9BzF,KAAK0C,QAAQsC,mBACpChF,KAAK2iB,WAAYJ,MAGnB,OAAOpd,EA/LM9G,CAASD,EAAQG,IACzB,4B,gBCTL,SACE,SAAUH,EAAQC,GAIhB,EAAQ,CACN,KACA,MACA,WAGD,KAFE,EAAF,SAAY8E,EAAUyf,EAAYrkB,GACjC,OAoBK,SAAkBH,EAAQ+E,EAAUyf,EAAYrkB,GAE3D,aAIAA,EAAM8F,OAAQlB,EAASoB,SAAU,CAC/Bse,UAAW,KACXC,cAAe,IAKjB3f,EAAS+B,cAAc5E,KAAK,eAI5B,IAAI6E,EAAQhC,EAAS5F,UACrBgB,EAAM8F,OAAQc,EAAOyd,EAAWrlB,WAChC4H,EAAM4d,kBAAoB,QAI1B,IAAIC,EAAU,gBAAiBnlB,SAC3BolB,GAA4B,EAEhC9d,EAAM+d,YAAc,WAClBljB,KAAKiG,GAAI,WAAYjG,KAAKmjB,gBAC1BnjB,KAAKiG,GAAI,WAAYjG,KAAKojB,eAC1BpjB,KAAKiG,GAAI,aAAcjG,KAAKqjB,kBAC5BrjB,KAAKiG,GAAI,aAAcjG,KAAKsjB,iBAIvBN,IAAYC,IACf7kB,EAAOmD,iBAAkB,aAAa,eACtC0hB,GAA4B,IAIhC9d,EAAMge,eAAiB,WACrBnjB,KAAKujB,QAAU,CAAEvjB,KAAK6F,UACtB7F,KAAKwjB,cACLxjB,KAAKsjB,mBAGPne,EAAMke,iBAAmB,WACvBrjB,KAAKyjB,gBACLzjB,KAAKgE,QAAQsC,UAAUkJ,OAAO,iBAGhCrK,EAAMme,gBAAkB,WAES,MAA1BtjB,KAAK0C,QAAQmgB,UAChB7iB,KAAKwiB,YAAcxiB,KAAK2H,OAAO1I,OAAS,EAExCe,KAAKwiB,YAAcxiB,KAAK0C,QAAQmgB,UAE7B7iB,KAAKwiB,YACRxiB,KAAKgE,QAAQsC,UAAUC,IAAI,gBAE3BvG,KAAKgE,QAAQsC,UAAUkJ,OAAO,iBAKlCrK,EAAMue,SAAW,WACf1jB,KAAK0C,QAAQmgB,WAAY,EACzB7iB,KAAKsjB,mBAGPne,EAAMwe,WAAa,WACjB3jB,KAAK0C,QAAQmgB,WAAY,EACzB7iB,KAAKsjB,mBAGPne,EAAMie,cAAgB,kBACbpjB,KAAKgiB,iBAKd7c,EAAMiQ,YAAc,SAAUvV,EAAOoV,GAC7BjV,KAAKwiB,YAIExiB,KAAK4jB,gBAAiB/jB,KAKnCG,KAAK6jB,2BAA4BhkB,GACjCG,KAAK8jB,iBAAkBjkB,GAElBhC,SAAS8Q,eAAiB3O,KAAKgE,SAElChE,KAAK+jB,kBAIP/jB,KAAK0iB,MAAQ1iB,KAAKyF,EAClBzF,KAAK6F,SAASS,UAAUC,IAAI,mBAE5BvG,KAAKgkB,kBAAoBC,IACzB7lB,EAAOmD,iBAAkB,SAAUvB,MAEnCA,KAAKkkB,oBAAqBrkB,EAAOoV,IAvB/BjV,KAAKkkB,oBAAqBrkB,EAAOoV,IA2BrC9P,EAAM+e,oBAAsB,SAAUrkB,EAAOoV,GAG3CjV,KAAKmkB,mBAAqB,CACxBrN,MAAO7B,EAAQ6B,MACfE,MAAO/B,EAAQ+B,OAGjBhX,KAAKqV,qBAAsBxV,GAC3BG,KAAKgH,cAAe,cAAenH,EAAO,CAAEoV,KAG9C,IAAImP,EAAa,CACfC,OAAO,EACPC,UAAU,EACVC,QAAQ,GAqOV,SAASN,IACP,MAAO,CACLxe,EAAGrH,EAAOmR,YACVwH,EAAG3Y,EAAOgR,aAMd,OA3OAjK,EAAM2e,iBAAmB,SAAUjkB,GACfukB,EAAYvkB,EAAMgJ,OAAOoV,WAEzCje,KAAKqO,SAITlJ,EAAM0e,2BAA6B,SAAUhkB,GAC3C,IAAI2kB,EAA6B,cAAd3kB,EAAME,KACrB0kB,EAAsC,SAArB5kB,EAAM6kB,YACvBC,EAAcP,EAAYvkB,EAAMgJ,OAAOoV,UACrCuG,GAAiBC,GAAmBE,GACxC9kB,EAAMuO,kBAMVjJ,EAAMyf,eAAiB,SAAUC,GAC/B,OAAOvc,KAAKmE,IAAKoY,EAAWpf,GAAMzF,KAAK0C,QAAQogB,eAKjD3d,EAAMmR,UAAY,SAAUzW,EAAOoV,UAC1BjV,KAAK8kB,iBACZ9kB,KAAK6F,SAASS,UAAUkJ,OAAO,mBAC/BxP,KAAKgH,cAAe,YAAanH,EAAO,CAAEoV,IAC1CjV,KAAK+kB,eAAgBllB,EAAOoV,IAG9B9P,EAAMqR,YAAc,WAClBpY,EAAOwR,oBAAqB,SAAU5P,aAC/BA,KAAKgkB,mBAKd7e,EAAM6f,UAAY,SAAUnlB,EAAOoV,GAC3BjV,KAAKwiB,cAGXxiB,KAAKilB,kBAAoBjlB,KAAKyF,EAC9BzF,KAAKsM,iBACLlO,EAAOwR,oBAAqB,SAAU5P,MACtCA,KAAKgH,cAAe,YAAanH,EAAO,CAAEoV,MAG5C9P,EAAM6Q,YAAc,SAAUnW,EAAOoV,GACnC,IAAI4P,EAAa7kB,KAAKklB,iBAAkBrlB,EAAOoV,GAC/CjV,KAAKgH,cAAe,cAAenH,EAAO,CAAEoV,EAAS4P,IACrD7kB,KAAKmlB,UAAWtlB,EAAOoV,EAAS4P,IAGlC1f,EAAMigB,SAAW,SAAUvlB,EAAOoV,EAAS4P,GACzC,GAAM7kB,KAAKwiB,YAAX,CAGA3iB,EAAMuO,iBAENpO,KAAKqlB,cAAgBrlB,KAAK0iB,MAE1B,IAAI4C,EAAYtlB,KAAK0C,QAAQkD,aAAe,EAAI,EAC3C5F,KAAK0C,QAAQgI,aAEhBma,EAAWpf,GAAKzF,KAAKyI,gBAEvB,IAAIia,EAAQ1iB,KAAKilB,kBAAoBJ,EAAWpf,EAAI6f,EAEpD,IAAMtlB,KAAK0C,QAAQgI,YAAc1K,KAAK2H,OAAO1I,OAAS,CAEpD,IAAIsmB,EAAcjd,KAAKC,KAAMvI,KAAK2H,OAAO,GAAGkB,OAAQ7I,KAAKilB,mBACzDvC,EAAQA,EAAQ6C,EAAwC,IAAxB7C,EAAQ6C,GAAsB7C,EAC9D,IAAIjX,EAAWnD,KAAKoD,KAAM1L,KAAK0H,eAAemB,OAAQ7I,KAAKilB,mBAC3DvC,EAAQA,EAAQjX,EAAkC,IAArBiX,EAAQjX,GAAmBiX,EAG1D1iB,KAAK0iB,MAAQA,EAEb1iB,KAAKwlB,aAAe,IAAItU,KACxBlR,KAAKgH,cAAe,WAAYnH,EAAO,CAAEoV,EAAS4P,MAGpD1f,EAAMsgB,QAAU,SAAU5lB,EAAOoV,GAC/B,GAAMjV,KAAKwiB,YAAX,CAGKxiB,KAAK0C,QAAQ4X,aAChBta,KAAKgiB,iBAAkB,GAGzB,IAAI5iB,EAAQY,KAAK0lB,uBAEjB,GAAK1lB,KAAK0C,QAAQ4X,aAAeta,KAAK0C,QAAQgI,WAAa,CAIzD,IAAIib,EAAW3lB,KAAK4lB,qBACpB5lB,KAAKgiB,iBAAmB2D,EAAW3lB,KAAK2H,OAAO,GAAGkB,SAC/C8c,EAAW3lB,KAAK0H,eAAemB,YACvB7I,KAAK0C,QAAQ4X,YAAclb,GAASY,KAAKuF,gBAEpDnG,GAASY,KAAK6lB,6BAET7lB,KAAKqlB,cAIZrlB,KAAK4M,aAAe5M,KAAK0C,QAAQgI,WACjC1K,KAAKgM,OAAQ5M,UACNY,KAAK4M,aACZ5M,KAAKgH,cAAe,UAAWnH,EAAO,CAAEoV,MAG1C9P,EAAMugB,qBAAuB,WAC3B,IAAIC,EAAW3lB,KAAK4lB,qBAEhB3J,EAAW3T,KAAKmE,IAAKzM,KAAKyc,kBAAmBkJ,EAAU3lB,KAAKuF,gBAE5DugB,EAAkB9lB,KAAK+lB,mBAAoBJ,EAAU1J,EAAU,GAC/D+J,EAAkBhmB,KAAK+lB,mBAAoBJ,EAAU1J,GAAW,GAIpE,OAFY6J,EAAgB7J,SAAW+J,EAAgB/J,SACrD6J,EAAgB1mB,MAAQ4mB,EAAgB5mB,OAY5C+F,EAAM4gB,mBAAqB,SAAUJ,EAAU1J,EAAUhR,GAUvD,IATA,IAAI7L,EAAQY,KAAKuF,cACboX,EAAcsJ,IACdC,EAAYlmB,KAAK0C,QAAQwI,UAAYlL,KAAK0C,QAAQgI,WAEpD,SAAUyb,EAAMC,GACd,OAAOD,GAAQC,GACb,SAAUD,EAAMC,GAClB,OAAOD,EAAOC,GAEVF,EAAWjK,EAAUU,KAE3Bvd,GAAS6L,EACT0R,EAAcV,EAEI,QADlBA,EAAWjc,KAAKyc,kBAAmBkJ,EAAUvmB,MAI7C6c,EAAW3T,KAAKmE,IAAKwP,GAEvB,MAAO,CACLA,SAAUU,EAEVvd,MAAOA,EAAQ6L,IAUnB9F,EAAMsX,iBAAmB,SAAUhX,EAAGrG,GACpC,IAAI+I,EAAMnI,KAAK2H,OAAO1I,OAElBonB,EAAermB,KAAK0C,QAAQgI,YAAcvC,EAAM,EAChD8F,EAAaoY,EAAe9nB,EAAM6N,OAAQhN,EAAO+I,GAAQ/I,EACzD0J,EAAQ9I,KAAK2H,OAAQsG,GACzB,IAAMnF,EACJ,OAAO,KAGT,IAAIwd,EAAOD,EAAermB,KAAKyI,eAAiBH,KAAKie,MAAOnnB,EAAM+I,GAAQ,EAC1E,OAAO1C,GAAMqD,EAAMD,OAASyd,IAG9BnhB,EAAM0gB,mBAAqB,WAEzB,QAA4B9X,IAAvB/N,KAAKqlB,gBAAgCrlB,KAAKwlB,cAE7C,IAAItU,KAASlR,KAAKwlB,aAAe,IACjC,OAAO,EAGT,IAAIvJ,EAAWjc,KAAKyc,kBAAmBzc,KAAK0iB,MAAO1iB,KAAKuF,eACpDiH,EAAQxM,KAAKqlB,cAAgBrlB,KAAK0iB,MACtC,OAAKzG,EAAW,GAAKzP,EAAQ,EAEpB,EACGyP,EAAW,GAAKzP,EAAQ,GAE1B,EAEH,GAKTrH,EAAMqhB,YAAc,SAAU3mB,EAAOoV,GAEnC,IAAIwR,EAAczmB,KAAK4N,cAAe/N,EAAMgJ,QACxCrB,EAAWif,GAAeA,EAAYziB,QACtC+G,EAAY0b,GAAezmB,KAAKmH,MAAM9H,QAASonB,GACnDzmB,KAAKgH,cAAe,cAAenH,EAAO,CAAEoV,EAASzN,EAAUuD,KAKjE5F,EAAMuhB,SAAW,WACf,IAAIC,EAAS1C,IACT2C,EAAc5mB,KAAKgkB,kBAAkBve,EAAIkhB,EAAOlhB,EAChDohB,EAAc7mB,KAAKgkB,kBAAkBjN,EAAI4P,EAAO5P,GAE/CzO,KAAKmE,IAAKma,GAAgB,GAAKte,KAAKmE,IAAKoa,GAAgB,IAC5D7mB,KAAKqW,gBAeFlT,EAhYM9E,CAASD,EAAQ+E,EAAUyf,EAAYrkB,IAC/C,2BAVL,CA6BGH,S,gBC9BH;;;;;IAQE,SAAUA,EAAQC,GAMhB,EAAQ,CACN,WAGD,KAFE,EAAF,SAAYyV,GACX,OAgBK,SAAkB1V,EAAQ0V,GAErC,aAIA,SAAS8O,KAGT,IAAIzd,EAAQyd,EAAWrlB,UAAYlB,OAAOY,OAAQ6W,EAAWvW,WAI7D4H,EAAMqe,YAAc,WAClBxjB,KAAK8mB,cAAc,IAGrB3hB,EAAMse,cAAgB,WACpBzjB,KAAK8mB,cAAc,IAOrB3hB,EAAM2hB,aAAe,SAAU5S,GAM7B,IAFA,IAAIC,GAFJD,OAAkBnG,IAAVmG,GAA6BA,GAEZ,mBAAqB,sBAC1C6S,EAAc7S,EAAQlU,KAAK+iB,kBAAoB,GACzCpnB,EAAE,EAAGA,EAAIqE,KAAKujB,QAAQtkB,OAAQtD,IAAM,CAC5C,IAAIqrB,EAAShnB,KAAKujB,QAAQ5nB,GAC1BqE,KAAKgU,gBAAiBgT,EAAQ9S,GAC9B8S,EAAQ7S,GAAc,QAASnU,MAE1B5B,EAAOiW,eACV2S,EAAO/f,MAAM8f,YAAcA,KAMjC5hB,EAAM4d,kBAAoB,OAS1B5d,EAAMiQ,YAAc,SAAUvV,EAAOoV,GACtBjV,KAAK4jB,gBAAiB/jB,KAMnCG,KAAKmkB,mBAAqB,CACxBrN,MAAO7B,EAAQ6B,MACfE,MAAO/B,EAAQ+B,OAGjBnX,EAAMuO,iBACNpO,KAAK+jB,kBAEL/jB,KAAKqV,qBAAsBxV,GAC3BG,KAAK6G,UAAW,cAAe,CAAEhH,EAAOoV,MAI1C,IAAIgS,EAAc,CAChB3C,UAAU,EACVD,OAAO,EACPE,QAAQ,EACR2C,QAAQ,GAINC,EAAa,CACfC,OAAO,EACPC,UAAU,EACVzS,QAAQ,EACR0S,QAAQ,EACRnN,OAAO,EACPoN,MAAM,GAiKR,OA7JApiB,EAAMye,gBAAkB,SAAU/jB,GAChC,IAAI2nB,EAAeP,EAAapnB,EAAMgJ,OAAOoV,UACzCwJ,EAAcN,EAAYtnB,EAAMgJ,OAAO9I,MACvC2nB,GAAUF,GAAgBC,EAI9B,OAHMC,GACJ1nB,KAAKuW,gBAEAmR,GAITviB,EAAM4e,gBAAkB,WACtB,IAAIrF,EAAU7gB,SAAS8Q,cAET+P,GAAWA,EAAQiJ,MAAQjJ,GAAW7gB,SAAS6B,MAE3Dgf,EAAQiJ,QAWZxiB,EAAM6Q,YAAc,SAAUnW,EAAOoV,GACnC,IAAI4P,EAAa7kB,KAAKklB,iBAAkBrlB,EAAOoV,GAC/CjV,KAAK6G,UAAW,cAAe,CAAEhH,EAAOoV,EAAS4P,IACjD7kB,KAAKmlB,UAAWtlB,EAAOoV,EAAS4P,IAIlC1f,EAAM+f,iBAAmB,SAAUrlB,EAAOoV,GACxC,IAAI4P,EAAa,CACfpf,EAAGwP,EAAQ6B,MAAQ9W,KAAKmkB,mBAAmBrN,MAC3CC,EAAG9B,EAAQ+B,MAAQhX,KAAKmkB,mBAAmBnN,OAM7C,OAHMhX,KAAKqc,YAAcrc,KAAK4kB,eAAgBC,IAC5C7kB,KAAK4nB,WAAY/nB,EAAOoV,GAEnB4P,GAIT1f,EAAMyf,eAAiB,SAAUC,GAC/B,OAAOvc,KAAKmE,IAAKoY,EAAWpf,GAAM,GAAK6C,KAAKmE,IAAKoY,EAAW9N,GAAM,GAUpE5R,EAAMmR,UAAY,SAAUzW,EAAOoV,GACjCjV,KAAK6G,UAAW,YAAa,CAAEhH,EAAOoV,IACtCjV,KAAK+kB,eAAgBllB,EAAOoV,IAG9B9P,EAAM4f,eAAiB,SAAUllB,EAAOoV,GACjCjV,KAAKqc,WACRrc,KAAK6nB,SAAUhoB,EAAOoV,GAGtBjV,KAAK8nB,aAAcjoB,EAAOoV,IAO9B9P,EAAMyiB,WAAa,SAAU/nB,EAAOoV,GAClCjV,KAAKqc,YAAa,EAElBrc,KAAK+nB,oBAAqB,EAC1B/nB,KAAKglB,UAAWnlB,EAAOoV,IAGzB9P,EAAM6f,UAAY,SAAUnlB,EAAOoV,GACjCjV,KAAK6G,UAAW,YAAa,CAAEhH,EAAOoV,KAIxC9P,EAAMggB,UAAY,SAAUtlB,EAAOoV,EAAS4P,GAEpC7kB,KAAKqc,YAIXrc,KAAKolB,SAAUvlB,EAAOoV,EAAS4P,IAGjC1f,EAAMigB,SAAW,SAAUvlB,EAAOoV,EAAS4P,GACzChlB,EAAMuO,iBACNpO,KAAK6G,UAAW,WAAY,CAAEhH,EAAOoV,EAAS4P,KAIhD1f,EAAM0iB,SAAW,SAAUhoB,EAAOoV,GAEhCjV,KAAKqc,YAAa,EAElBnb,WAAY,kBACHlB,KAAK+nB,oBACZ5qB,KAAM6C,OAERA,KAAKylB,QAAS5lB,EAAOoV,IAGvB9P,EAAMsgB,QAAU,SAAU5lB,EAAOoV,GAC/BjV,KAAK6G,UAAW,UAAW,CAAEhH,EAAOoV,KAMtC9P,EAAM6iB,QAAU,SAAUnoB,GACnBG,KAAK+nB,oBACRloB,EAAMuO,kBAOVjJ,EAAM2iB,aAAe,SAAUjoB,EAAOoV,GAE/BjV,KAAKioB,mBAAmC,WAAdpoB,EAAME,OAIrCC,KAAKwmB,YAAa3mB,EAAOoV,GAGN,WAAdpV,EAAME,OACTC,KAAKioB,mBAAoB,EAEzB/mB,WAAY,kBACHlB,KAAKioB,mBACZ9qB,KAAM6C,MAAQ,QAIpBmF,EAAMqhB,YAAc,SAAU3mB,EAAOoV,GACnCjV,KAAK6G,UAAW,cAAe,CAAEhH,EAAOoV,KAK1C2N,EAAW/L,gBAAkB/C,EAAW+C,gBAIjC+L,EAvQMvkB,CAASD,EAAQ0V,IACzB,2BAVL,CAyBG1V,S,gBCjCH,QA8BGA,OAzBC,EAAQ,CACN,KACA,KACA,WAGD,KAFE,EAAF,SAAY+E,EAAU2Q,EAAYvV,GACjC,OAoBK,SAAkBH,EAAQ+E,EAAU2Q,EAAYvV,GAC3D,aAEA,IAAI2pB,EAAS,6BAIb,SAASC,EAAgB7C,EAAW1nB,GAClCoC,KAAKslB,UAAYA,EACjBtlB,KAAKpC,OAASA,EACdoC,KAAKwE,UAGP2jB,EAAe5qB,UAAYlB,OAAOY,OAAQ6W,EAAWvW,WAErD4qB,EAAe5qB,UAAUiH,QAAU,WAEjCxE,KAAKooB,WAAY,EACjBpoB,KAAKqoB,YAAgC,GAAnBroB,KAAKslB,UACvB,IAAIgD,EAAgBtoB,KAAKpC,OAAO8E,QAAQkD,YAAc,GAAK,EAC3D5F,KAAKuoB,OAASvoB,KAAKslB,WAAagD,EAEhC,IAAItkB,EAAUhE,KAAKgE,QAAUnG,SAASiI,cAAc,UACpD9B,EAAQhB,UAAY,4CACpBgB,EAAQhB,WAAahD,KAAKqoB,WAAa,YAAc,QAErDrkB,EAAQyb,aAAc,OAAQ,UAE9Bzf,KAAKwoB,UAELxkB,EAAQyb,aAAc,aAAczf,KAAKqoB,WAAa,WAAa,QAGnE,IAAII,EAAMzoB,KAAK0oB,YACf1kB,EAAQJ,YAAa6kB,GAErBzoB,KAAKpC,OAAOqI,GAAI,SAAUjG,KAAK2oB,OAAOxrB,KAAM6C,OAC5CA,KAAKiG,GAAI,cAAejG,KAAKpC,OAAOuQ,mBAAmBhR,KAAM6C,KAAKpC,UAGpEuqB,EAAe5qB,UAAU4I,SAAW,WAClCnG,KAAK+T,eAAgB/T,KAAKgE,SAC1BhE,KAAKgE,QAAQzC,iBAAkB,QAASvB,MAExCA,KAAKpC,OAAOoG,QAAQJ,YAAa5D,KAAKgE,UAGxCmkB,EAAe5qB,UAAUiR,WAAa,WAEpCxO,KAAKpC,OAAOoG,QAAQ0L,YAAa1P,KAAKgE,SAEtChE,KAAKiU,iBAAkBjU,KAAKgE,SAC5BhE,KAAKgE,QAAQ4L,oBAAqB,QAAS5P,OAG7CmoB,EAAe5qB,UAAUmrB,UAAY,WACnC,IAAID,EAAM5qB,SAAS+qB,gBAAiBV,EAAQ,OAC5CO,EAAIhJ,aAAc,QAAS,wBAC3BgJ,EAAIhJ,aAAc,UAAW,eAC7B,IAa0BoJ,EAbtBC,EAAOjrB,SAAS+qB,gBAAiBV,EAAQ,QACzCa,EAciB,iBAFKF,EAZa7oB,KAAKpC,OAAO8E,QAAQsmB,YAelDH,EAGF,KAAOA,EAAMI,GAAb,SACGJ,EAAMK,GAAK,KAAQL,EAAMM,GAAK,IACtC,MAAQN,EAAMO,GAAK,KAAQP,EAAMQ,GAAK,IACtC,MAAQR,EAAMS,GAHT,UAIGT,EAAMO,GAAK,KAAQ,GAAKP,EAAMQ,IACtC,MAAQR,EAAMK,GAAK,KAAQ,GAAKL,EAAMM,IACtC,KAhBF,OAPAL,EAAKrJ,aAAc,IAAKsJ,GACxBD,EAAKrJ,aAAc,QAAS,SAEtBzf,KAAKuoB,QACTO,EAAKrJ,aAAc,YAAa,oCAElCgJ,EAAI7kB,YAAaklB,GACVL,GAmBTN,EAAe5qB,UAAUqC,YAAcrB,EAAMqB,YAE7CuoB,EAAe5qB,UAAUyqB,QAAU,WACjC,GAAMhoB,KAAKooB,UAAX,CAGApoB,KAAKpC,OAAOsQ,WACZ,IAAIpO,EAASE,KAAKqoB,WAAa,WAAa,OAC5CroB,KAAKpC,OAAQkC,OAKfqoB,EAAe5qB,UAAUgsB,OAAS,WAC3BvpB,KAAKooB,YAGVpoB,KAAKgE,QAAQwlB,UAAW,EACxBxpB,KAAKooB,WAAY,IAGnBD,EAAe5qB,UAAUirB,QAAU,WAC3BxoB,KAAKooB,YAGXpoB,KAAKgE,QAAQwlB,UAAW,EACxBxpB,KAAKooB,WAAY,IAGnBD,EAAe5qB,UAAUorB,OAAS,WAEhC,IAAIhhB,EAAS3H,KAAKpC,OAAO+J,OAEzB,GAAK3H,KAAKpC,OAAO8E,QAAQgI,YAAc/C,EAAO1I,OAAS,EACrDe,KAAKupB,aADP,CAIA,IAAIE,EAAY9hB,EAAO1I,OAAS0I,EAAO1I,OAAS,EAAI,EAChDyqB,EAAa1pB,KAAKqoB,WAAa,EAAIoB,EAEvCzpB,KADaA,KAAKpC,OAAO2H,eAAiBmkB,EAAa,UAAY,cAIrEvB,EAAe5qB,UAAUkS,QAAU,WACjCzP,KAAKwO,aACLxO,KAAK6P,UAKPtR,EAAM8F,OAAQlB,EAASoB,SAAU,CAC/BolB,iBAAiB,EACjBX,WAAY,CACVC,GAAI,GACJC,GAAI,GAAIC,GAAI,GACZC,GAAI,GAAIC,GAAI,GACZC,GAAI,MAIRnmB,EAAS+B,cAAc5E,KAAK,0BAC5B,IAAI6E,EAAQhC,EAAS5F,UA6BrB,OA3BA4H,EAAMykB,uBAAyB,WACvB5pB,KAAK0C,QAAQinB,kBAInB3pB,KAAK6pB,WAAa,IAAI1B,GAAiB,EAAGnoB,MAC1CA,KAAK8pB,WAAa,IAAI3B,EAAgB,EAAGnoB,MAEzCA,KAAKiG,GAAI,WAAYjG,KAAK+pB,2BAG5B5kB,EAAM4kB,wBAA0B,WAC9B/pB,KAAK6pB,WAAW1jB,WAChBnG,KAAK8pB,WAAW3jB,WAChBnG,KAAKiG,GAAI,aAAcjG,KAAKgqB,4BAG9B7kB,EAAM6kB,0BAA4B,WAChChqB,KAAK6pB,WAAWrb,aAChBxO,KAAK8pB,WAAWtb,aAChBxO,KAAK4T,IAAK,aAAc5T,KAAKgqB,4BAK/B7mB,EAASglB,eAAiBA,EAEnBhlB,EArMM9E,CAASD,EAAQ+E,EAAU2Q,EAAYvV,IAC/C,4B,gBCXL,QA8BGH,OAzBC,EAAQ,CACN,KACA,KACA,WAGD,KAFE,EAAF,SAAY+E,EAAU2Q,EAAYvV,GACjC,OAoBK,SAAkBH,EAAQ+E,EAAU2Q,EAAYvV,GAI3D,aAEA,SAAS0rB,EAAUrsB,GACjBoC,KAAKpC,OAASA,EACdoC,KAAKwE,UAGPylB,EAAS1sB,UAAYlB,OAAOY,OAAQ6W,EAAWvW,WAE/C0sB,EAAS1sB,UAAUiH,QAAU,WAE3BxE,KAAKkqB,OAASrsB,SAASiI,cAAc,MACrC9F,KAAKkqB,OAAOlnB,UAAY,qBAExBhD,KAAKmqB,KAAO,GAEZnqB,KAAKoqB,YAAcpqB,KAAKqqB,QAAQltB,KAAM6C,MACtCA,KAAKiG,GAAI,cAAejG,KAAKpC,OAAOuQ,mBAAmBhR,KAAM6C,KAAKpC,UAGpEqsB,EAAS1sB,UAAU4I,SAAW,WAC5BnG,KAAKsqB,UACLtqB,KAAKkqB,OAAO3oB,iBAAkB,QAASvB,KAAKoqB,aAC5CpqB,KAAK+T,eAAgB/T,KAAKkqB,QAE1BlqB,KAAKpC,OAAOoG,QAAQJ,YAAa5D,KAAKkqB,SAGxCD,EAAS1sB,UAAUiR,WAAa,WAC9BxO,KAAKkqB,OAAOta,oBAAqB,QAAS5P,KAAKoqB,aAC/CpqB,KAAKiU,iBAAkBjU,KAAKkqB,QAE5BlqB,KAAKpC,OAAOoG,QAAQ0L,YAAa1P,KAAKkqB,SAGxCD,EAAS1sB,UAAU+sB,QAAU,WAE3B,IAAI9d,EAAQxM,KAAKpC,OAAO+J,OAAO1I,OAASe,KAAKmqB,KAAKlrB,OAC7CuN,EAAQ,EACXxM,KAAKuqB,QAAS/d,GACJA,EAAQ,GAClBxM,KAAKwqB,YAAahe,IAItByd,EAAS1sB,UAAUgtB,QAAU,SAAUE,GAMrC,IALA,IAAIC,EAAW7sB,SAAS8sB,yBACpBC,EAAU,GACV3rB,EAASe,KAAKmqB,KAAKlrB,OACnBsJ,EAAMtJ,EAASwrB,EAET9uB,EAAIsD,EAAQtD,EAAI4M,EAAK5M,IAAM,CACnC,IAAIkvB,EAAMhtB,SAASiI,cAAc,MACjC+kB,EAAI7nB,UAAY,MAChB6nB,EAAIpL,aAAc,aAAc,aAAgB9jB,EAAI,IACpD+uB,EAAS9mB,YAAainB,GACtBD,EAAQtqB,KAAMuqB,GAGhB7qB,KAAKkqB,OAAOtmB,YAAa8mB,GACzB1qB,KAAKmqB,KAAOnqB,KAAKmqB,KAAK5nB,OAAQqoB,IAGhCX,EAAS1sB,UAAUitB,WAAa,SAAUC,GAEvBzqB,KAAKmqB,KAAK7qB,OAAQU,KAAKmqB,KAAKlrB,OAASwrB,EAAOA,GAElDrqB,SAAS,SAAUyqB,GAC5B7qB,KAAKkqB,OAAOxa,YAAamb,KACxB7qB,OAGLiqB,EAAS1sB,UAAUutB,eAAiB,WAE7B9qB,KAAK+qB,cACR/qB,KAAK+qB,YAAY/nB,UAAY,MAC7BhD,KAAK+qB,YAAYpb,gBAAgB,iBAG7B3P,KAAKmqB,KAAKlrB,SAGhBe,KAAK+qB,YAAc/qB,KAAKmqB,KAAMnqB,KAAKpC,OAAO2H,eAC1CvF,KAAK+qB,YAAY/nB,UAAY,kBAC7BhD,KAAK+qB,YAAYtL,aAAc,eAAgB,UAGjDwK,EAAS1sB,UAAUytB,MACnBf,EAAS1sB,UAAU8sB,QAAU,SAAUxqB,GACrC,IAAIgJ,EAAShJ,EAAMgJ,OAEnB,GAAwB,MAAnBA,EAAOoV,SAAZ,CAIAje,KAAKpC,OAAOsQ,WACZ,IAAI9O,EAAQY,KAAKmqB,KAAK9qB,QAASwJ,GAC/B7I,KAAKpC,OAAOoO,OAAQ5M,KAGtB6qB,EAAS1sB,UAAUkS,QAAU,WAC3BzP,KAAKwO,aACLxO,KAAK6P,UAGP1M,EAAS8mB,SAAWA,EAIpB1rB,EAAM8F,OAAQlB,EAASoB,SAAU,CAC/B0mB,UAAU,IAGZ9nB,EAAS+B,cAAc5E,KAAK,mBAE5B,IAAI6E,EAAQhC,EAAS5F,UAmCrB,OAjCA4H,EAAM+lB,gBAAkB,WAChBlrB,KAAK0C,QAAQuoB,WAGnBjrB,KAAKirB,SAAW,IAAIhB,EAAUjqB,MAE9BA,KAAKiG,GAAI,WAAYjG,KAAKmrB,kBAC1BnrB,KAAKiG,GAAI,SAAUjG,KAAKorB,wBACxBprB,KAAKiG,GAAI,aAAcjG,KAAKqrB,gBAC5BrrB,KAAKiG,GAAI,SAAUjG,KAAKqrB,gBACxBrrB,KAAKiG,GAAI,aAAcjG,KAAKsrB,sBAG9BnmB,EAAMgmB,iBAAmB,WACvBnrB,KAAKirB,SAAS9kB,YAGhBhB,EAAMimB,uBAAyB,WAC7BprB,KAAKirB,SAASH,kBAGhB3lB,EAAMkmB,eAAiB,WACrBrrB,KAAKirB,SAASX,WAGhBnlB,EAAMmmB,mBAAqB,WACzBtrB,KAAKirB,SAASzc,cAKhBrL,EAAS8mB,SAAWA,EAEb9mB,EA9KM9E,CAASD,EAAQ+E,EAAU2Q,EAAYvV,IAC/C,4B,gBCXL,QA4BGH,OAvBC,EAAQ,CACN,KACA,KACA,WAGD,KAFE,EAAF,SAAYgF,EAAW7E,EAAO4E,GAC7B,OAkBK,SAAkBC,EAAW7E,EAAO4E,GAE/C,aAIA,SAASooB,EAAQ3tB,GACfoC,KAAKpC,OAASA,EACdoC,KAAKwrB,MAAQ,UAEbxrB,KAAKyrB,mBAAqBzrB,KAAK0rB,iBAAiBvuB,KAAM6C,MACtDA,KAAK2rB,iBAAmB3rB,KAAK4rB,eAAezuB,KAAM6C,MAGpDurB,EAAOhuB,UAAYlB,OAAOY,OAAQmG,EAAU7F,WAG5CguB,EAAOhuB,UAAUsuB,KAAO,WACH,WAAd7rB,KAAKwrB,QAIS3tB,SAASiuB,OAE1BjuB,SAAS0D,iBAAkB,mBAAoBvB,KAAK2rB,mBAItD3rB,KAAKwrB,MAAQ,UAEb3tB,SAAS0D,iBAAkB,mBAAoBvB,KAAKyrB,oBAEpDzrB,KAAK+rB,UAGPR,EAAOhuB,UAAUwuB,KAAO,WAEtB,GAAmB,WAAd/rB,KAAKwrB,MAAV,CAIA,IAAItZ,EAAOlS,KAAKpC,OAAO8E,QAAQspB,SAE/B9Z,EAAsB,iBAARA,EAAmBA,EAAO,IACxC,IAAIjR,EAAQjB,KAEZA,KAAKisB,QACLjsB,KAAKa,QAAUK,YAAY,WACzBD,EAAMrD,OAAOkP,MAAM,GACnB7L,EAAM8qB,SACL7Z,KAGLqZ,EAAOhuB,UAAU2uB,KAAO,WACtBlsB,KAAKwrB,MAAQ,UACbxrB,KAAKisB,QAELpuB,SAAS+R,oBAAqB,mBAAoB5P,KAAKyrB,qBAGzDF,EAAOhuB,UAAU0uB,MAAQ,WACvBnrB,aAAcd,KAAKa,UAGrB0qB,EAAOhuB,UAAU4uB,MAAQ,WACJ,WAAdnsB,KAAKwrB,QACRxrB,KAAKwrB,MAAQ,SACbxrB,KAAKisB,UAITV,EAAOhuB,UAAU6uB,QAAU,WAEN,UAAdpsB,KAAKwrB,OACRxrB,KAAK6rB,QAKTN,EAAOhuB,UAAUmuB,iBAAmB,WAElC1rB,KADmBnC,SAASiuB,OACP,QAAU,cAGjCP,EAAOhuB,UAAUquB,eAAiB,WAChC5rB,KAAK6rB,OACLhuB,SAAS+R,oBAAqB,mBAAoB5P,KAAK2rB,mBAKzDptB,EAAM8F,OAAQlB,EAASoB,SAAU,CAC/B8nB,sBAAsB,IAGxBlpB,EAAS+B,cAAc5E,KAAK,iBAC5B,IAAI6E,EAAQhC,EAAS5F,UA+DrB,OA7DA4H,EAAMmnB,cAAgB,WACpBtsB,KAAKusB,OAAS,IAAIhB,EAAQvrB,MAE1BA,KAAKiG,GAAI,WAAYjG,KAAKwsB,gBAC1BxsB,KAAKiG,GAAI,WAAYjG,KAAKysB,YAC1BzsB,KAAKiG,GAAI,cAAejG,KAAKysB,YAC7BzsB,KAAKiG,GAAI,aAAcjG,KAAK0sB,mBAG9BvnB,EAAMqnB,eAAiB,WACfxsB,KAAK0C,QAAQspB,WAGnBhsB,KAAKusB,OAAOV,OACZ7rB,KAAKgE,QAAQzC,iBAAkB,aAAcvB,QAK/CmF,EAAMwnB,WAAa,WACjB3sB,KAAKusB,OAAOV,QAGd1mB,EAAMsnB,WAAa,WACjBzsB,KAAKusB,OAAOL,QAGd/mB,EAAMynB,YAAc,WAClB5sB,KAAKusB,OAAOJ,SAGdhnB,EAAM0nB,cAAgB,WACpB7sB,KAAKusB,OAAOH,WAGdjnB,EAAMunB,iBAAmB,WACvB1sB,KAAKusB,OAAOL,OACZlsB,KAAKgE,QAAQ4L,oBAAqB,aAAc5P,OAMlDmF,EAAM2nB,aAAe,WACb9sB,KAAK0C,QAAQ2pB,uBAGnBrsB,KAAKusB,OAAOJ,QACZnsB,KAAKgE,QAAQzC,iBAAkB,aAAcvB,QAI/CmF,EAAM4nB,aAAe,WACnB/sB,KAAKusB,OAAOH,UACZpsB,KAAKgE,QAAQ4L,oBAAqB,aAAc5P,OAKlDmD,EAASooB,OAASA,EAEXpoB,EAjLM9E,CAAS+E,EAAW7E,EAAO4E,IACnC,4B,gBCXL,QA2BG/E,OAtBC,EAAQ,CACN,KACA,WAGD,KAFE,EAAF,SAAY+E,EAAU5E,GACrB,OAkBK,SAAkBH,EAAQ+E,EAAU5E,GAE/C,aAaA,IAAI4G,EAAQhC,EAAS5F,UAoHrB,OA7GA4H,EAAM6nB,OAAS,SAAU9sB,EAAOd,GAC9B,IAAI+H,EAAQnH,KAAKoH,WAAYlH,GAC7B,GAAMiH,GAAUA,EAAMlI,OAAtB,CAGA,IAAIkJ,EAAMnI,KAAKmH,MAAMlI,OAErBG,OAAkB2O,IAAV3O,EAAsB+I,EAAM/I,EAEpC,IAAIsrB,EA1BN,SAA2BvjB,GACzB,IAAIujB,EAAW7sB,SAAS8sB,yBAIxB,OAHAxjB,EAAM/G,SAAS,SAAUgI,GACvBsiB,EAAS9mB,YAAawE,EAAKpE,YAEtB0mB,EAqBQuC,CAAkB9lB,GAE7B+lB,EAAW9tB,GAAS+I,EACxB,GAAK+kB,EACHltB,KAAK0G,OAAO9C,YAAa8mB,OACpB,CACL,IAAIyC,EAAoBntB,KAAKmH,MAAO/H,GAAQ4E,QAC5ChE,KAAK0G,OAAO0mB,aAAc1C,EAAUyC,GAGtC,GAAe,IAAV/tB,EAEHY,KAAKmH,MAAQA,EAAM5E,OAAQvC,KAAKmH,YAC3B,GAAK+lB,EAEVltB,KAAKmH,MAAQnH,KAAKmH,MAAM5E,OAAQ4E,OAC3B,CAEL,IAAIkmB,EAAWrtB,KAAKmH,MAAM7H,OAAQF,EAAO+I,EAAM/I,GAC/CY,KAAKmH,MAAQnH,KAAKmH,MAAM5E,OAAQ4E,GAAQ5E,OAAQ8qB,GAGlDrtB,KAAK4H,WAAYT,GACjBnH,KAAKstB,WAAYluB,GAAO,KAG1B+F,EAAMooB,OAAS,SAAUrtB,GACvBF,KAAKgtB,OAAQ9sB,EAAOF,KAAKmH,MAAMlI,SAGjCkG,EAAMqoB,QAAU,SAAUttB,GACxBF,KAAKgtB,OAAQ9sB,EAAO,IAOtBiF,EAAMqK,OAAS,SAAUtP,GACvB,IAAIiH,EAAQnH,KAAK2N,SAAUzN,GAC3B,GAAMiH,GAAUA,EAAMlI,OAAtB,CAIA,IAAIwuB,EAAeztB,KAAKmH,MAAMlI,OAAS,EAEvCkI,EAAM/G,SAAS,SAAUgI,GACvBA,EAAKoH,SACL,IAAIpQ,EAAQY,KAAKmH,MAAM9H,QAAS+I,GAChCqlB,EAAenlB,KAAKoD,IAAKtM,EAAOquB,GAChClvB,EAAMW,WAAYc,KAAKmH,MAAOiB,KAC7BpI,MAEHA,KAAKstB,WAAYG,GAAc,KAOjCtoB,EAAMkV,eAAiB,SAAU7a,GAC/B,IAAI4I,EAAOpI,KAAK0N,QAASlO,GACzB,GAAM4I,EAAN,CAGAA,EAAK/E,UAEL,IAAIjE,EAAQY,KAAKmH,MAAM9H,QAAS+I,GAChCpI,KAAKstB,WAAYluB,KAQnB+F,EAAMmoB,WAAa,SAAUI,EAAkBC,GAC7C,IAAIC,EAAmB5tB,KAAKoN,gBAC5BpN,KAAK6H,eAAgB6lB,GACrB1tB,KAAKsH,qBACLtH,KAAKiF,iBAGL,IAAImD,EAAOpI,KAAK0N,QAASkgB,GACpBxlB,IACHpI,KAAKuF,cAAgBvF,KAAKyN,kBAAmBrF,IAE/CpI,KAAKuF,cAAgB+C,KAAKoD,IAAK1L,KAAK2H,OAAO1I,OAAS,EAAGe,KAAKuF,eAE5DvF,KAAK6G,UAAW,aAAc,CAAE6mB,IAEhC1tB,KAAKgM,OAAQhM,KAAKuF,eAEbooB,GACH3tB,KAAK+J,4BAMF5G,EArJM9E,CAASD,EAAQ+E,EAAU5E,IACnC,4B,gBCVL,QA2BGH,OAtBC,EAAQ,CACN,KACA,WAGD,KAFE,EAAF,SAAY+E,EAAU5E,GACrB,OAkBK,SAAkBH,EAAQ+E,EAAU5E,GAC/C,aAEA4E,EAAS+B,cAAc5E,KAAK,mBAC5B,IAAI6E,EAAQhC,EAAS5F,UAkDrB,SAASswB,EAAYzT,EAAK0T,GACxB9tB,KAAKoa,IAAMA,EACXpa,KAAK8tB,SAAWA,EAChB9tB,KAAK+tB,OAgDP,OAnGA5oB,EAAM6oB,gBAAkB,WACtBhuB,KAAKiG,GAAI,SAAUjG,KAAKiuB,WAG1B9oB,EAAM8oB,SAAW,WACf,IAAIA,EAAWjuB,KAAK0C,QAAQurB,SAC5B,GAAMA,EAAN,CAIA,IAAIngB,EAA8B,iBAAZmgB,EAAuBA,EAAW,EACpDjgB,EAAYhO,KAAK6N,wBAAyBC,GAE1CogB,EAAa,GACjBlgB,EAAU5N,SAAS,SAAUoH,GAC3B,IAAI2mB,EASR,SAA4B3mB,GAE1B,GAA0B,OAArBA,EAASyW,SAAoB,CAChC,IAAImQ,EAAe5mB,EAAS5E,aAAa,0BACrCyrB,EAAU7mB,EAAS5E,aAAa,8BAChC0rB,EAAa9mB,EAAS5E,aAAa,iCACvC,GAAKwrB,GAAgBC,GAAWC,EAC9B,MAAO,CAAE9mB,GAIb,IAEI+mB,EAAO/mB,EAASvJ,iBAFD,oGAGnB,OAAOM,EAAMO,UAAWyvB,GAvBDC,CAAmBhnB,GACxC0mB,EAAaA,EAAW3rB,OAAQ4rB,MAGlCD,EAAW9tB,SAAS,SAAUga,GAC5B,IAAIyT,EAAYzT,EAAKpa,QACpBA,QAiCL6tB,EAAWtwB,UAAUqC,YAAcrB,EAAMqB,YAEzCiuB,EAAWtwB,UAAUwwB,KAAO,WAC1B/tB,KAAKoa,IAAI7Y,iBAAkB,OAAQvB,MACnCA,KAAKoa,IAAI7Y,iBAAkB,QAASvB,MAEpC,IAAIyuB,EAAMzuB,KAAKoa,IAAIxX,aAAa,2BAC9B5C,KAAKoa,IAAIxX,aAAa,8BACpB8rB,EAAS1uB,KAAKoa,IAAIxX,aAAa,iCAEnC5C,KAAKoa,IAAIqU,IAAMA,EACVC,GACH1uB,KAAKoa,IAAIqF,aAAc,SAAUiP,GAGnC1uB,KAAKoa,IAAIzK,gBAAgB,0BACzB3P,KAAKoa,IAAIzK,gBAAgB,8BACzB3P,KAAKoa,IAAIzK,gBAAgB,kCAG3Bke,EAAWtwB,UAAUoxB,OAAS,SAAU9uB,GACtCG,KAAK4uB,SAAU/uB,EAAO,wBAGxBguB,EAAWtwB,UAAUsxB,QAAU,SAAUhvB,GACvCG,KAAK4uB,SAAU/uB,EAAO,uBAGxBguB,EAAWtwB,UAAUqxB,SAAW,SAAU/uB,EAAOmD,GAE/ChD,KAAKoa,IAAIxK,oBAAqB,OAAQ5P,MACtCA,KAAKoa,IAAIxK,oBAAqB,QAAS5P,MAEvC,IAAIoI,EAAOpI,KAAK8tB,SAASlgB,cAAe5N,KAAKoa,KACzC5S,EAAWY,GAAQA,EAAKpE,QAC5BhE,KAAK8tB,SAASzT,eAAgB7S,GAE9BxH,KAAKoa,IAAI9T,UAAUC,IAAKvD,GACxBhD,KAAK8tB,SAAS9mB,cAAe,WAAYnH,EAAO2H,IAKlDrE,EAAS0qB,WAAaA,EAEf1qB,EA3HM9E,CAASD,EAAQ+E,EAAU5E,IACnC,4B,gBCVL;;;;;IAMA,SAAYH,EAAQC,GAAY,aAO5B,EAAQ,CACN,WAGD,KAFE,EAAF,SAAY+E,GACX,OAoBN,SAAkBhF,EAAQgF,GAI1B,IAAI0rB,EAAI1wB,EAAOqE,OACXV,EAAU3D,EAAO2D,QAKrB,SAASsC,EAAQ7F,EAAGC,GAClB,IAAM,IAAIC,KAAQD,EAChBD,EAAGE,GAASD,EAAGC,GAEjB,OAAOF,EAGT,IAAIK,EAAaX,MAAMX,UAAUY,MA0BjC,SAAS4wB,EAAcvvB,EAAMkD,EAASssB,GAEpC,KAAQhvB,gBAAgB+uB,GACtB,OAAO,IAAIA,EAAcvvB,EAAMkD,EAASssB,GAG1C,IA7BkBjwB,EA6BdkwB,EAAYzvB,GACI,iBAARA,IACVyvB,EAAYpxB,SAASI,iBAAkBuB,IAGnCyvB,IAKNjvB,KAAKkvB,UAvCanwB,EAuCSkwB,EAtCtB/wB,MAAMc,QAASD,GAEXA,EAGuB,iBAAPA,GAAwC,iBAAdA,EAAIE,OAG9CJ,EAAW/C,KAAMiD,GAInB,CAAEA,IA2BTiB,KAAK0C,QAAU2B,EAAQ,GAAIrE,KAAK0C,SAET,mBAAXA,EACVssB,EAAWtsB,EAEX2B,EAAQrE,KAAK0C,QAASA,GAGnBssB,GACHhvB,KAAKiG,GAAI,SAAU+oB,GAGrBhvB,KAAKmvB,YAEAL,IAEH9uB,KAAKovB,WAAa,IAAIN,EAAEO,UAI1BnuB,WAAYlB,KAAKsvB,MAAMnyB,KAAM6C,QAzB3B+B,EAAQgB,MAAO,iCAAoCksB,GAAazvB,IA4BpEuvB,EAAaxxB,UAAYlB,OAAOY,OAAQmG,EAAU7F,WAElDwxB,EAAaxxB,UAAUmF,QAAU,GAEjCqsB,EAAaxxB,UAAU4xB,UAAY,WACjCnvB,KAAKuvB,OAAS,GAGdvvB,KAAKkvB,SAAS9uB,QAASJ,KAAKwvB,iBAAkBxvB,OAMhD+uB,EAAaxxB,UAAUiyB,iBAAmB,SAAUhwB,GAE5B,OAAjBA,EAAKye,UACRje,KAAKyvB,SAAUjwB,IAGgB,IAA5BQ,KAAK0C,QAAQgtB,YAChB1vB,KAAK2vB,2BAA4BnwB,GAKnC,IAAI6Y,EAAW7Y,EAAK6Y,SACpB,GAAMA,GAAauX,EAAkBvX,GAArC,CAKA,IAFA,IAAIwX,EAAYrwB,EAAKvB,iBAAiB,OAE5BtC,EAAE,EAAGA,EAAIk0B,EAAU5wB,OAAQtD,IAAM,CACzC,IAAIye,EAAMyV,EAAUl0B,GACpBqE,KAAKyvB,SAAUrV,GAIjB,GAAuC,iBAA3Bpa,KAAK0C,QAAQgtB,WAAyB,CAChD,IAAIjpB,EAAWjH,EAAKvB,iBAAkB+B,KAAK0C,QAAQgtB,YACnD,IAAM/zB,EAAE,EAAGA,EAAI8K,EAASxH,OAAQtD,IAAM,CACpC,IAAIkjB,EAAQpY,EAAS9K,GACrBqE,KAAK2vB,2BAA4B9Q,OAKvC,IAAI+Q,EAAmB,CACrBE,GAAG,EACHC,GAAG,EACHC,IAAI,GAwFN,SAASC,EAAc7V,GACrBpa,KAAKoa,IAAMA,EAiEb,SAAS8V,EAAYC,EAAKnsB,GACxBhE,KAAKmwB,IAAMA,EACXnwB,KAAKgE,QAAUA,EACfhE,KAAKoa,IAAM,IAAIgW,MAgDjB,OA1MArB,EAAaxxB,UAAUoyB,2BAA6B,SAAUnwB,GAC5D,IAAIyH,EAAQxD,iBAAkBjE,GAC9B,GAAMyH,EAON,IAFA,IAAIopB,EAAQ,0BACR5P,EAAU4P,EAAMC,KAAMrpB,EAAMspB,iBACZ,OAAZ9P,GAAmB,CACzB,IAAI0P,EAAM1P,GAAWA,EAAQ,GACxB0P,GACHnwB,KAAKwwB,cAAeL,EAAK3wB,GAE3BihB,EAAU4P,EAAMC,KAAMrpB,EAAMspB,mBAOhCxB,EAAaxxB,UAAUkyB,SAAW,SAAUrV,GAC1C,IAAIqW,EAAe,IAAIR,EAAc7V,GACrCpa,KAAKuvB,OAAOjvB,KAAMmwB,IAGpB1B,EAAaxxB,UAAUizB,cAAgB,SAAUL,EAAK3wB,GACpD,IAAIkwB,EAAa,IAAIQ,EAAYC,EAAK3wB,GACtCQ,KAAKuvB,OAAOjvB,KAAMovB,IAGpBX,EAAaxxB,UAAU+xB,MAAQ,WAC7B,IAAIruB,EAAQjB,KASZ,SAAS0wB,EAAYvW,EAAO3a,EAAM+X,GAEhCrW,YAAY,WACVD,EAAMkb,SAAUhC,EAAO3a,EAAM+X,MAXjCvX,KAAK2wB,gBAAkB,EACvB3wB,KAAK4wB,cAAe,EAEd5wB,KAAKuvB,OAAOtwB,OAYlBe,KAAKuvB,OAAOnvB,SAAS,SAAUqwB,GAC7BA,EAAahd,KAAM,WAAYid,GAC/BD,EAAanB,WAbbtvB,KAAK4uB,YAiBTG,EAAaxxB,UAAU4e,SAAW,SAAUhC,EAAO3a,EAAM+X,GACvDvX,KAAK2wB,kBACL3wB,KAAK4wB,aAAe5wB,KAAK4wB,eAAiBzW,EAAM0W,SAEhD7wB,KAAK6G,UAAW,WAAY,CAAE7G,KAAMma,EAAO3a,IACtCQ,KAAKovB,YAAcpvB,KAAKovB,WAAW0B,QACtC9wB,KAAKovB,WAAW0B,OAAQ9wB,KAAMma,GAG3Bna,KAAK2wB,iBAAmB3wB,KAAKuvB,OAAOtwB,QACvCe,KAAK4uB,WAGF5uB,KAAK0C,QAAQquB,OAAShvB,GACzBA,EAAQivB,IAAK,aAAezZ,EAAS4C,EAAO3a,IAIhDuvB,EAAaxxB,UAAUqxB,SAAW,WAChC,IAAItpB,EAAYtF,KAAK4wB,aAAe,OAAS,OAI7C,GAHA5wB,KAAKixB,YAAa,EAClBjxB,KAAK6G,UAAWvB,EAAW,CAAEtF,OAC7BA,KAAK6G,UAAW,SAAU,CAAE7G,OACvBA,KAAKovB,WAAa,CACrB,IAAI8B,EAAWlxB,KAAK4wB,aAAe,SAAW,UAC9C5wB,KAAKovB,WAAY8B,GAAYlxB,QAUjCiwB,EAAa1yB,UAAYlB,OAAOY,OAAQmG,EAAU7F,WAElD0yB,EAAa1yB,UAAU+xB,MAAQ,WAGZtvB,KAAKmxB,qBAGpBnxB,KAAKoxB,QAAmC,IAA1BpxB,KAAKoa,IAAIiX,aAAoB,iBAK7CrxB,KAAKsxB,WAAa,IAAIlB,MACtBpwB,KAAKsxB,WAAW/vB,iBAAkB,OAAQvB,MAC1CA,KAAKsxB,WAAW/vB,iBAAkB,QAASvB,MAE3CA,KAAKoa,IAAI7Y,iBAAkB,OAAQvB,MACnCA,KAAKoa,IAAI7Y,iBAAkB,QAASvB,MACpCA,KAAKsxB,WAAW7C,IAAMzuB,KAAKoa,IAAIqU,MAGjCwB,EAAa1yB,UAAU4zB,mBAAqB,WAG1C,OAAOnxB,KAAKoa,IAAIwU,UAAY5uB,KAAKoa,IAAIiX,cAGvCpB,EAAa1yB,UAAU6zB,QAAU,SAAUP,EAAUtZ,GACnDvX,KAAK6wB,SAAWA,EAChB7wB,KAAK6G,UAAW,WAAY,CAAE7G,KAAMA,KAAKoa,IAAK7C,KAMhD0Y,EAAa1yB,UAAUqC,YAAc,SAAUC,GAC7C,IAAIC,EAAS,KAAOD,EAAME,KACrBC,KAAMF,IACTE,KAAMF,GAAUD,IAIpBowB,EAAa1yB,UAAUoxB,OAAS,WAC9B3uB,KAAKoxB,SAAS,EAAM,UACpBpxB,KAAKuxB,gBAGPtB,EAAa1yB,UAAUsxB,QAAU,WAC/B7uB,KAAKoxB,SAAS,EAAO,WACrBpxB,KAAKuxB,gBAGPtB,EAAa1yB,UAAUg0B,aAAe,WACpCvxB,KAAKsxB,WAAW1hB,oBAAqB,OAAQ5P,MAC7CA,KAAKsxB,WAAW1hB,oBAAqB,QAAS5P,MAC9CA,KAAKoa,IAAIxK,oBAAqB,OAAQ5P,MACtCA,KAAKoa,IAAIxK,oBAAqB,QAAS5P,OAYzCkwB,EAAW3yB,UAAYlB,OAAOY,OAAQgzB,EAAa1yB,WAEnD2yB,EAAW3yB,UAAU+xB,MAAQ,WAC3BtvB,KAAKoa,IAAI7Y,iBAAkB,OAAQvB,MACnCA,KAAKoa,IAAI7Y,iBAAkB,QAASvB,MACpCA,KAAKoa,IAAIqU,IAAMzuB,KAAKmwB,IAEHnwB,KAAKmxB,uBAEpBnxB,KAAKoxB,QAAmC,IAA1BpxB,KAAKoa,IAAIiX,aAAoB,gBAC3CrxB,KAAKuxB,iBAITrB,EAAW3yB,UAAUg0B,aAAe,WAClCvxB,KAAKoa,IAAIxK,oBAAqB,OAAQ5P,MACtCA,KAAKoa,IAAIxK,oBAAqB,QAAS5P,OAGzCkwB,EAAW3yB,UAAU6zB,QAAU,SAAUP,EAAUtZ,GACjDvX,KAAK6wB,SAAWA,EAChB7wB,KAAK6G,UAAW,WAAY,CAAE7G,KAAMA,KAAKgE,QAASuT,KAKpDwX,EAAayC,iBAAmB,SAAU/uB,IACxCA,EAASA,GAAUrE,EAAOqE,WAK1BqsB,EAAIrsB,GAEFgvB,GAAGxX,aAAe,SAAUvX,EAASrB,GAErC,OADe,IAAI0tB,EAAc/uB,KAAM0C,EAASrB,GAChC+tB,WAAWsC,QAAS5C,EAAE9uB,UAI1C+uB,EAAayC,mBAINzC,EAtWM1wB,CAASD,EAAQgF,IACzB,2BAXL,CA0BsB,oBAAXhF,OAAyBA,OAAS4B,O,iBChC7C;;;;;;;;IAQE,WAGA,IAUI2xB,EAAkB,sBAUlBC,EAAc,yBAgDdC,EAAY,CACd,CAAC,MA9BiB,KA+BlB,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAtCqB,IAuCtB,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBC,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBAGZC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBAEXC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBC,OAAOH,EAAcI,QACxCC,EAAqBF,OAAOF,EAAgBG,QAG5CE,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,EAAgB,QAChBC,EAAa,mGAMbC,EAAe,sBACfC,EAAkBV,OAAOS,EAAaR,QAGtCU,EAAc,OAGdC,EAAe,KAGfC,EAAgB,4CAChBC,EAAgB,oCAChBC,EAAiB,QAGjBC,EAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGV9kB,GAAa,qBAGbC,GAAa,aAGb8kB,GAAe,8BAGf7kB,GAAY,cAGZ8kB,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAOpBC,GAAeC,gDASfC,GAAeC,8OAIfC,GAAW,oBACXC,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMN,GAAe,IAC/BO,GAAW,OACXC,GAAY,oBACZC,GAAU,8BACVC,GAAS,oBAAuBR,GAAeK,GAAtC,qEACTI,GAAS,2BAETC,GAAc,qBACdC,GAAa,kCACbC,GAAa,qCACbC,GAAU,8BAIVC,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAG/CQ,GAZa,MAAQZ,GAAU,IAAMK,GAAS,IAYtB,IAKxBQ,GAJW,oBAIQD,IAHP,gBAAwB,CAACN,GAAaC,GAAYC,IAAY1X,KAAK,KAAnE,qBAA2F8X,GAAW,MAIlHE,GAAU,MAAQ,CAACZ,GAAWK,GAAYC,IAAY1X,KAAK,KAAO,IAAM+X,GACxEE,GAAW,MAAQ,CAACT,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUhX,KAAK,KAAO,IAGxGkY,GAAShD,OA/BA,OA+Be,KAMxBiD,GAAcjD,OAAOgC,GAAS,KAG9BkB,GAAYlD,OAAOqC,GAAS,MAAQA,GAAS,KAAOU,GAAWF,GAAO,KAGtEM,GAAgBnD,OAAO,CACzByC,GAAU,IAAMN,GAAhBM,oCAA0D,CAACV,GAASU,GAAS,KAAK3X,KAAK,KAAO,IAC9F6X,uCAA8C,CAACZ,GAASU,GAAUC,GAAa,KAAK5X,KAAK,KAAO,IAChG2X,GAAU,IAAMC,GAAhBD,iCACAA,oCAtBe,mDADA,mDA0BfR,GACAa,IACAhY,KAAK,KAAM,KAGTsY,GAAepD,OAAO,0BAA+B0B,GAA/B,mBAGtB2B,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,GACrBA,GAAetE,GAAcsE,GAAerE,GAC5CqE,GAAepE,GAAWoE,GAAenE,GACzCmE,GAAelE,GAAYkE,GAAejE,GAC1CiE,GA5LsB,8BA4LYA,GAAehE,GACjDgE,GAAe/D,IAAa,EAC5B+D,GAAevF,GAAWuF,GAAetF,GACzCsF,GAAexE,GAAkBwE,GAAerF,GAChDqF,GAAevE,GAAeuE,GAAepF,GAC7CoF,GAAenF,GAAYmF,GAAelF,GAC1CkF,GAAehF,GAAUgF,GAAe/E,GACxC+E,GAAe9E,GAAa8E,GAAe7E,GAC3C6E,GAAe5E,GAAU4E,GAAe3E,GACxC2E,GAAezE,IAAc,EAG7B,IAAI0E,GAAgB,GACpBA,GAAcxF,GAAWwF,GAAcvF,GACvCuF,GAAczE,GAAkByE,GAAcxE,GAC9CwE,GAActF,GAAWsF,GAAcrF,GACvCqF,GAAcvE,GAAcuE,GAActE,GAC1CsE,GAAcrE,GAAWqE,GAAcpE,GACvCoE,GAAcnE,GAAYmE,GAAcjF,GACxCiF,GAAchF,GAAagF,GAAc/E,GACzC+E,GAAc9E,GAAa8E,GAAc7E,GACzC6E,GAAc5E,GAAa4E,GAAc3E,GACzC2E,GAAclE,GAAYkE,GAlNJ,8BAmNtBA,GAAcjE,GAAaiE,GAAchE,IAAa,EACtDgE,GAAcpF,GAAYoF,GAAcnF,GACxCmF,GAAc1E,IAAc,EAG5B,IA4EI2E,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBpgB,WACjB9G,GAAe7G,SAGf8G,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAOnU,SAAWA,QAAUmU,EAGhFC,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKrU,SAAWA,QAAUqU,KAGxEC,GAAOJ,IAAcE,IAAYG,SAAS,cAATA,GAGjC6mB,GAA4Ch8B,IAAYA,EAAQ4c,UAAY5c,EAG5Ei8B,GAAaD,IAAgC,iBAAV/7B,GAAsBA,IAAWA,EAAO2c,UAAY3c,EAGvFi8B,GAAgBD,IAAcA,GAAWj8B,UAAYg8B,GAGrDG,GAAcD,IAAiBpnB,GAAWsnB,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWM,SAAWN,GAAWM,QAAQ,QAAQD,MAE3E,OAAIA,GAKGH,IAAeA,GAAYK,SAAWL,GAAYK,QAAQ,QACjE,MAAO/gB,KAXI,GAeXghB,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAAS13B,GAAMiQ,EAAMe,EAASpR,GAC5B,OAAQA,EAAK9B,QACX,KAAK,EAAG,OAAOmS,EAAKtV,KAAKqW,GACzB,KAAK,EAAG,OAAOf,EAAKtV,KAAKqW,EAASpR,EAAK,IACvC,KAAK,EAAG,OAAOqQ,EAAKtV,KAAKqW,EAASpR,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOqQ,EAAKtV,KAAKqW,EAASpR,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOqQ,EAAKjQ,MAAMgR,EAASpR,GAa7B,SAAS+3B,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAI95B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,SAE9BG,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GAClB45B,EAAOE,EAAat8B,EAAOq8B,EAASr8B,GAAQm8B,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GAIxB,IAHA,IAAI75B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,SAE9BG,EAAQH,IAC8B,IAAzCg6B,EAASF,EAAM35B,GAAQA,EAAO25B,KAIpC,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAG7B,IAFA,IAAIh6B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OAEhCA,MAC0C,IAA3Cg6B,EAASF,EAAM95B,GAASA,EAAQ85B,KAItC,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GAIzB,IAHA,IAAIl6B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,SAE9BG,EAAQH,GACf,IAAKq6B,EAAUP,EAAM35B,GAAQA,EAAO25B,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAM1B,IALA,IAAIl6B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACnCu6B,EAAW,EACX/nB,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACdk6B,EAAU18B,EAAOwC,EAAO25B,KAC1BtnB,EAAO+nB,KAAc58B,GAGzB,OAAO6U,EAYT,SAASgoB,GAAcV,EAAOn8B,GAE5B,SADsB,MAATm8B,EAAgB,EAAIA,EAAM95B,SACpBy6B,GAAYX,EAAOn8B,EAAO,IAAM,EAYrD,SAAS+8B,GAAkBZ,EAAOn8B,EAAOg9B,GAIvC,IAHA,IAAIx6B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,SAE9BG,EAAQH,GACf,GAAI26B,EAAWh9B,EAAOm8B,EAAM35B,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASy6B,GAASd,EAAOE,GAKvB,IAJA,IAAI75B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACnCwS,EAASvT,MAAMe,KAEVG,EAAQH,GACfwS,EAAOrS,GAAS65B,EAASF,EAAM35B,GAAQA,EAAO25B,GAEhD,OAAOtnB,EAWT,SAASqoB,GAAUf,EAAOgB,GAKxB,IAJA,IAAI36B,GAAS,EACTH,EAAS86B,EAAO96B,OAChB+6B,EAASjB,EAAM95B,SAEVG,EAAQH,GACf85B,EAAMiB,EAAS56B,GAAS26B,EAAO36B,GAEjC,OAAO25B,EAeT,SAASkB,GAAYlB,EAAOE,EAAUC,EAAagB,GACjD,IAAI96B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OAKvC,IAHIi7B,GAAaj7B,IACfi6B,EAAcH,IAAQ35B,MAEfA,EAAQH,GACfi6B,EAAcD,EAASC,EAAaH,EAAM35B,GAAQA,EAAO25B,GAE3D,OAAOG,EAeT,SAASiB,GAAiBpB,EAAOE,EAAUC,EAAagB,GACtD,IAAIj7B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OAIvC,IAHIi7B,GAAaj7B,IACfi6B,EAAcH,IAAQ95B,IAEjBA,KACLi6B,EAAcD,EAASC,EAAaH,EAAM95B,GAASA,EAAQ85B,GAE7D,OAAOG,EAaT,SAASkB,GAAUrB,EAAOO,GAIxB,IAHA,IAAIl6B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,SAE9BG,EAAQH,GACf,GAAIq6B,EAAUP,EAAM35B,GAAQA,EAAO25B,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIsB,GAAYC,GAAa,UAmC7B,SAASC,GAAYnc,EAAYkb,EAAWkB,GAC1C,IAAI/oB,EAOJ,OANA+oB,EAASpc,GAAY,SAASxhB,EAAOM,EAAKkhB,GACxC,GAAIkb,EAAU18B,EAAOM,EAAKkhB,GAExB,OADA3M,EAASvU,GACF,KAGJuU,EAcT,SAASgpB,GAAc1B,EAAOO,EAAWoB,EAAWC,GAIlD,IAHA,IAAI17B,EAAS85B,EAAM95B,OACfG,EAAQs7B,GAAaC,EAAY,GAAK,GAElCA,EAAYv7B,MAAYA,EAAQH,GACtC,GAAIq6B,EAAUP,EAAM35B,GAAQA,EAAO25B,GACjC,OAAO35B,EAGX,OAAQ,EAYV,SAASs6B,GAAYX,EAAOn8B,EAAO89B,GACjC,OAAO99B,GAAUA,EAidnB,SAAuBm8B,EAAOn8B,EAAO89B,GACnC,IAAIt7B,EAAQs7B,EAAY,EACpBz7B,EAAS85B,EAAM95B,OAEnB,OAASG,EAAQH,GACf,GAAI85B,EAAM35B,KAAWxC,EACnB,OAAOwC,EAGX,OAAQ,EAzdJw7B,CAAc7B,EAAOn8B,EAAO89B,GAC5BD,GAAc1B,EAAO8B,GAAWH,GAatC,SAASI,GAAgB/B,EAAOn8B,EAAO89B,EAAWd,GAIhD,IAHA,IAAIx6B,EAAQs7B,EAAY,EACpBz7B,EAAS85B,EAAM95B,SAEVG,EAAQH,GACf,GAAI26B,EAAWb,EAAM35B,GAAQxC,GAC3B,OAAOwC,EAGX,OAAQ,EAUV,SAASy7B,GAAUj+B,GACjB,OAAOA,GAAUA,EAYnB,SAASm+B,GAAShC,EAAOE,GACvB,IAAIh6B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAOA,EAAU+7B,GAAQjC,EAAOE,GAAYh6B,EA1yBpC,IAozBV,SAASq7B,GAAap9B,GACpB,OAAO,SAASG,GACd,OAAiB,MAAVA,OAl3BP0Q,EAk3BoC1Q,EAAOH,IAW/C,SAAS+9B,GAAe59B,GACtB,OAAO,SAASH,GACd,OAAiB,MAAVG,OA/3BP0Q,EA+3BoC1Q,EAAOH,IAiB/C,SAASg+B,GAAW9c,EAAY6a,EAAUC,EAAagB,EAAWM,GAMhE,OALAA,EAASpc,GAAY,SAASxhB,EAAOwC,EAAOgf,GAC1C8a,EAAcgB,GACTA,GAAY,EAAOt9B,GACpBq8B,EAASC,EAAat8B,EAAOwC,EAAOgf,MAEnC8a,EAgCT,SAAS8B,GAAQjC,EAAOE,GAKtB,IAJA,IAAIxnB,EACArS,GAAS,EACTH,EAAS85B,EAAM95B,SAEVG,EAAQH,GAAQ,CACvB,IAAIk8B,EAAUlC,EAASF,EAAM35B,SA57B7B2O,IA67BIotB,IACF1pB,OA97BF1D,IA87BW0D,EAAuB0pB,EAAW1pB,EAAS0pB,GAGxD,OAAO1pB,EAYT,SAAS2pB,GAAUh+B,EAAG67B,GAIpB,IAHA,IAAI75B,GAAS,EACTqS,EAASvT,MAAMd,KAEVgC,EAAQhC,GACfqU,EAAOrS,GAAS65B,EAAS75B,GAE3B,OAAOqS,EAyBT,SAAS4pB,GAASC,GAChB,OAAOA,EACHA,EAAOn9B,MAAM,EAAGo9B,GAAgBD,GAAU,GAAG55B,QAAQ8yB,EAAa,IAClE8G,EAUN,SAASE,GAAUpqB,GACjB,OAAO,SAASxU,GACd,OAAOwU,EAAKxU,IAchB,SAAS6+B,GAAWp+B,EAAQq+B,GAC1B,OAAO7B,GAAS6B,GAAO,SAASx+B,GAC9B,OAAOG,EAAOH,MAYlB,SAASy+B,GAASC,EAAO1+B,GACvB,OAAO0+B,EAAMC,IAAI3+B,GAYnB,SAAS4+B,GAAgBC,EAAYC,GAInC,IAHA,IAAI58B,GAAS,EACTH,EAAS88B,EAAW98B,SAEfG,EAAQH,GAAUy6B,GAAYsC,EAAYD,EAAW38B,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAAS68B,GAAcF,EAAYC,GAGjC,IAFA,IAAI58B,EAAQ28B,EAAW98B,OAEhBG,KAAWs6B,GAAYsC,EAAYD,EAAW38B,GAAQ,IAAM,IACnE,OAAOA,EAWT,SAAS88B,GAAanD,EAAOoD,GAI3B,IAHA,IAAIl9B,EAAS85B,EAAM95B,OACfwS,EAAS,EAENxS,KACD85B,EAAM95B,KAAYk9B,KAClB1qB,EAGN,OAAOA,EAWT,IAAI2qB,GAAenB,GAjxBG,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,MAouBxBoB,GAAiBpB,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASqB,GAAiBC,GACxB,MAAO,KAAOhF,GAAcgF,GAsB9B,SAASC,GAAWlB,GAClB,OAAOrE,GAAa5jB,KAAKioB,GAsC3B,SAASmB,GAAWl1B,GAClB,IAAInI,GAAS,EACTqS,EAASvT,MAAMqJ,EAAIU,MAKvB,OAHAV,EAAInH,SAAQ,SAASxD,EAAOM,GAC1BuU,IAASrS,GAAS,CAAClC,EAAKN,MAEnB6U,EAWT,SAASirB,GAAQtrB,EAAMyQ,GACrB,OAAO,SAAS8a,GACd,OAAOvrB,EAAKyQ,EAAU8a,KAa1B,SAASC,GAAe7D,EAAOoD,GAM7B,IALA,IAAI/8B,GAAS,EACTH,EAAS85B,EAAM95B,OACfu6B,EAAW,EACX/nB,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACdxC,IAAUu/B,GAAev/B,IAAUg1B,IACrCmH,EAAM35B,GAASwyB,EACfngB,EAAO+nB,KAAcp6B,GAGzB,OAAOqS,EAUT,SAASorB,GAAWC,GAClB,IAAI19B,GAAS,EACTqS,EAASvT,MAAM4+B,EAAI70B,MAKvB,OAHA60B,EAAI18B,SAAQ,SAASxD,GACnB6U,IAASrS,GAASxC,KAEb6U,EAUT,SAASsrB,GAAWD,GAClB,IAAI19B,GAAS,EACTqS,EAASvT,MAAM4+B,EAAI70B,MAKvB,OAHA60B,EAAI18B,SAAQ,SAASxD,GACnB6U,IAASrS,GAAS,CAACxC,EAAOA,MAErB6U,EAoDT,SAASurB,GAAW1B,GAClB,OAAOkB,GAAWlB,GAiDpB,SAAqBA,GACnB,IAAI7pB,EAASslB,GAAUtN,UAAY,EACnC,KAAOsN,GAAU1jB,KAAKioB,MAClB7pB,EAEJ,OAAOA,EArDHwrB,CAAY3B,GACZjB,GAAUiB,GAUhB,SAAS4B,GAAc5B,GACrB,OAAOkB,GAAWlB,GAmDpB,SAAwBA,GACtB,OAAOA,EAAO35B,MAAMo1B,KAAc,GAnD9BoG,CAAe7B,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAO8B,MAAM,IA6kBhBC,CAAa/B,GAWnB,SAASC,GAAgBD,GAGvB,IAFA,IAAIl8B,EAAQk8B,EAAOr8B,OAEZG,KAAWq1B,EAAaphB,KAAKioB,EAAOgC,OAAOl+B,MAClD,OAAOA,EAUT,IAAIm+B,GAAmBtC,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MA4gCX,IAs3eIuC,GAt3ee,SAAUC,EAAanf,GAIxC,IA6BMof,EA7BFx/B,GAHJogB,EAAqB,MAAXA,EAAkB3N,GAAO6sB,GAAEj5B,SAASoM,GAAKtU,SAAUiiB,EAASkf,GAAEG,KAAKhtB,GAAMwmB,MAG/Dj5B,MAChBgT,EAAOoN,EAAQpN,KACf0sB,EAAQtf,EAAQsf,MAChBhtB,GAAW0N,EAAQ1N,SACnBtI,GAAOgW,EAAQhW,KACfjM,GAASiiB,EAAQjiB,OACjBw3B,GAASvV,EAAQuV,OACjBgK,GAASvf,EAAQuf,OACjB7rB,GAAYsM,EAAQtM,UAGpB8rB,GAAa5/B,EAAMX,UACnBwgC,GAAYntB,GAASrT,UACrBygC,GAAc3hC,GAAOkB,UAGrB0gC,GAAa3f,EAAQ,sBAGrB4f,GAAeH,GAAUjtB,SAGzBtT,GAAiBwgC,GAAYxgC,eAG7B2gC,GAAY,EAGZC,IACEV,EAAM,SAASpN,KAAK2N,IAAcA,GAAWI,MAAQJ,GAAWI,KAAKC,UAAY,KACvE,iBAAmBZ,EAAO,GAQtCa,GAAuBP,GAAYltB,SAGnC0tB,GAAmBN,GAAapiC,KAAKO,IAGrCoiC,GAAU9tB,GAAK6sB,EAGfkB,GAAa7K,GAAO,IACtBqK,GAAapiC,KAAK0B,IAAgBkE,QAAQ4yB,EAAc,QACvD5yB,QAAQ,yDAA0D,SAAW,KAI5Ei9B,GAAShH,GAAgBrZ,EAAQqgB,YAr9CnC5wB,EAs9CErR,GAAS4hB,EAAQ5hB,OACjBkiC,GAAatgB,EAAQsgB,WACrBC,GAAcF,GAASA,GAAOE,iBAx9ChC9wB,EAy9CE+wB,GAAepC,GAAQrgC,GAAO0iC,eAAgB1iC,IAC9C2iC,GAAe3iC,GAAOY,OACtBgiC,GAAuBjB,GAAYiB,qBACnC3/B,GAASw+B,GAAWx+B,OACpB4/B,GAAmBxiC,GAASA,GAAOyiC,wBA79CrCpxB,EA89CEqxB,GAAc1iC,GAASA,GAAO2iC,cA99ChCtxB,EA+9CEuxB,GAAiB5iC,GAASA,GAAOC,iBA/9CnCoR,EAi+CEzR,GAAkB,WACpB,IACE,IAAI8U,EAAOmuB,GAAUljC,GAAQ,kBAE7B,OADA+U,EAAK,GAAI,GAAI,IACNA,EACP,MAAO8F,KALU,GASjBsoB,GAAkBlhB,EAAQxd,eAAiB6P,GAAK7P,cAAgBwd,EAAQxd,aACxE2+B,GAASvuB,GAAQA,EAAKD,MAAQN,GAAKO,KAAKD,KAAOC,EAAKD,IACpDyuB,GAAgBphB,EAAQpd,aAAeyP,GAAKzP,YAAcod,EAAQpd,WAGlEy+B,GAAar3B,GAAKs3B,KAClBC,GAAcv3B,GAAKie,MACnBuZ,GAAmBzjC,GAAO0jC,sBAC1BC,GAAiBrB,GAASA,GAAOsB,cAl/CnClyB,EAm/CEmyB,GAAiB5hB,EAAQ6hB,SACzBC,GAAatC,GAAWnf,KACxB0hB,GAAa3D,GAAQrgC,GAAOgiC,KAAMhiC,IAClC0U,GAAYzI,GAAKC,IACjByI,GAAY1I,GAAKoD,IACjB40B,GAAYpvB,EAAKD,IACjBsvB,GAAiBjiB,EAAQ7U,SACzB+2B,GAAel4B,GAAKm4B,OACpBC,GAAgB5C,GAAW6C,QAG3BC,GAAWrB,GAAUjhB,EAAS,YAC9BuiB,GAAMtB,GAAUjhB,EAAS,OACzBwiB,GAAUvB,GAAUjhB,EAAS,WAC7ByiB,GAAMxB,GAAUjhB,EAAS,OACzB0iB,GAAUzB,GAAUjhB,EAAS,WAC7B2iB,GAAe1B,GAAUljC,GAAQ,UAGjC6kC,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAchlC,GAASA,GAAOa,eAnhDhCwQ,EAohDE4zB,GAAgBD,GAAcA,GAAYvuB,aAphD5CpF,EAqhDE6zB,GAAiBF,GAAcA,GAAY5wB,cArhD7C/C,EA8oDF,SAAS8zB,GAAOjlC,GACd,GAAIoW,GAAapW,KAAWoC,GAAQpC,MAAYA,aAAiBklC,IAAc,CAC7E,GAAIllC,aAAiBmlC,GACnB,OAAOnlC,EAET,GAAIY,GAAe1B,KAAKc,EAAO,eAC7B,OAAOolC,GAAaplC,GAGxB,OAAO,IAAImlC,GAAcnlC,GAW3B,IAAIqlC,GAAc,WAChB,SAAS5kC,KACT,OAAO,SAAS8H,GACd,IAAK0N,GAAS1N,GACZ,MAAO,GAET,GAAI65B,GACF,OAAOA,GAAa75B,GAEtB9H,EAAOE,UAAY4H,EACnB,IAAIsM,EAAS,IAAIpU,EAEjB,OADAA,EAAOE,eA7qDTwQ,EA8qDS0D,GAZM,GAqBjB,SAASywB,MAWT,SAASH,GAAcnlC,EAAOulC,GAC5BniC,KAAKoiC,YAAcxlC,EACnBoD,KAAKqiC,YAAc,GACnBriC,KAAKsiC,YAAcH,EACnBniC,KAAKuiC,UAAY,EACjBviC,KAAKwiC,gBAvsDLz0B,EAuxDF,SAAS+zB,GAAYllC,GACnBoD,KAAKoiC,YAAcxlC,EACnBoD,KAAKqiC,YAAc,GACnBriC,KAAKyiC,QAAU,EACfziC,KAAK0iC,cAAe,EACpB1iC,KAAK2iC,cAAgB,GACrB3iC,KAAK4iC,cA9tDc,WA+tDnB5iC,KAAK6iC,UAAY,GAgHnB,SAASC,GAAKC,GACZ,IAAI3jC,GAAS,EACTH,EAAoB,MAAX8jC,EAAkB,EAAIA,EAAQ9jC,OAG3C,IADAe,KAAKisB,UACI7sB,EAAQH,GAAQ,CACvB,IAAI+jC,EAAQD,EAAQ3jC,GACpBY,KAAK88B,IAAIkG,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUF,GACjB,IAAI3jC,GAAS,EACTH,EAAoB,MAAX8jC,EAAkB,EAAIA,EAAQ9jC,OAG3C,IADAe,KAAKisB,UACI7sB,EAAQH,GAAQ,CACvB,IAAI+jC,EAAQD,EAAQ3jC,GACpBY,KAAK88B,IAAIkG,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASH,GAChB,IAAI3jC,GAAS,EACTH,EAAoB,MAAX8jC,EAAkB,EAAIA,EAAQ9jC,OAG3C,IADAe,KAAKisB,UACI7sB,EAAQH,GAAQ,CACvB,IAAI+jC,EAAQD,EAAQ3jC,GACpBY,KAAK88B,IAAIkG,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAASpJ,GAChB,IAAI36B,GAAS,EACTH,EAAmB,MAAV86B,EAAiB,EAAIA,EAAO96B,OAGzC,IADAe,KAAKojC,SAAW,IAAIF,KACX9jC,EAAQH,GACfe,KAAKuG,IAAIwzB,EAAO36B,IA6CpB,SAASikC,GAAMN,GACb,IAAI7/B,EAAOlD,KAAKojC,SAAW,IAAIH,GAAUF,GACzC/iC,KAAKiI,KAAO/E,EAAK+E,KAqGnB,SAASq7B,GAAc1mC,EAAO2mC,GAC5B,IAAIC,EAAQxkC,GAAQpC,GAChB6mC,GAASD,GAASE,GAAY9mC,GAC9B+mC,GAAUH,IAAUC,GAASxD,GAASrjC,GACtCgnC,GAAUJ,IAAUC,IAAUE,GAAU9K,GAAaj8B,GACrDinC,EAAcL,GAASC,GAASE,GAAUC,EAC1CnyB,EAASoyB,EAAczI,GAAUx+B,EAAMqC,OAAQ4+B,IAAU,GACzD5+B,EAASwS,EAAOxS,OAEpB,IAAK,IAAI/B,KAAON,GACT2mC,IAAa/lC,GAAe1B,KAAKc,EAAOM,IACvC2mC,IAEQ,UAAP3mC,GAECymC,IAAkB,UAAPzmC,GAA0B,UAAPA,IAE9B0mC,IAAkB,UAAP1mC,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD4mC,GAAQ5mC,EAAK+B,KAElBwS,EAAOnR,KAAKpD,GAGhB,OAAOuU,EAUT,SAASsyB,GAAYhL,GACnB,IAAI95B,EAAS85B,EAAM95B,OACnB,OAAOA,EAAS85B,EAAMiL,GAAW,EAAG/kC,EAAS,SAj5E7C8O,EA45EF,SAASk2B,GAAgBlL,EAAO37B,GAC9B,OAAO8mC,GAAYC,GAAUpL,GAAQqL,GAAUhnC,EAAG,EAAG27B,EAAM95B,SAU7D,SAASolC,GAAatL,GACpB,OAAOmL,GAAYC,GAAUpL,IAY/B,SAASuL,GAAiBjnC,EAAQH,EAAKN,SAp7ErCmR,IAq7EKnR,IAAwB2nC,GAAGlnC,EAAOH,GAAMN,SAr7E7CmR,IAs7EKnR,KAAyBM,KAAOG,KACnCmnC,GAAgBnnC,EAAQH,EAAKN,GAcjC,SAAS6nC,GAAYpnC,EAAQH,EAAKN,GAChC,IAAI8nC,EAAWrnC,EAAOH,GAChBM,GAAe1B,KAAKuB,EAAQH,IAAQqnC,GAAGG,EAAU9nC,UAv8EvDmR,IAw8EKnR,GAAyBM,KAAOG,IACnCmnC,GAAgBnnC,EAAQH,EAAKN,GAYjC,SAAS+nC,GAAa5L,EAAO77B,GAE3B,IADA,IAAI+B,EAAS85B,EAAM95B,OACZA,KACL,GAAIslC,GAAGxL,EAAM95B,GAAQ,GAAI/B,GACvB,OAAO+B,EAGX,OAAQ,EAcV,SAAS2lC,GAAexmB,EAAY4a,EAAQC,EAAUC,GAIpD,OAHA2L,GAASzmB,GAAY,SAASxhB,EAAOM,EAAKkhB,GACxC4a,EAAOE,EAAat8B,EAAOq8B,EAASr8B,GAAQwhB,MAEvC8a,EAYT,SAAS4L,GAAWznC,EAAQy2B,GAC1B,OAAOz2B,GAAU0nC,GAAWjR,EAAQuK,GAAKvK,GAASz2B,GAyBpD,SAASmnC,GAAgBnnC,EAAQH,EAAKN,GACzB,aAAPM,GAAsBZ,GACxBA,GAAee,EAAQH,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASN,EACT,UAAY,IAGdS,EAAOH,GAAON,EAYlB,SAASooC,GAAO3nC,EAAQ4nC,GAMtB,IALA,IAAI7lC,GAAS,EACTH,EAASgmC,EAAMhmC,OACfwS,EAASvT,EAAMe,GACfimC,EAAiB,MAAV7nC,IAEF+B,EAAQH,GACfwS,EAAOrS,GAAS8lC,OAhjFlBn3B,EAgjFqCvR,GAAIa,EAAQ4nC,EAAM7lC,IAEvD,OAAOqS,EAYT,SAAS2yB,GAAU56B,EAAQ27B,EAAOC,GAShC,OARI57B,GAAWA,SA/jFfuE,IAgkFMq3B,IACF57B,EAASA,GAAU47B,EAAQ57B,EAAS47B,QAjkFxCr3B,IAmkFMo3B,IACF37B,EAASA,GAAU27B,EAAQ37B,EAAS27B,IAGjC37B,EAmBT,SAAS67B,GAAUzoC,EAAO0oC,EAASC,EAAYroC,EAAKG,EAAQmoC,GAC1D,IAAI/zB,EACAg0B,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACF9zB,EAASpU,EAASkoC,EAAW3oC,EAAOM,EAAKG,EAAQmoC,GAASD,EAAW3oC,SAjmFvEmR,IAmmFI0D,EACF,OAAOA,EAET,IAAKoB,GAASjW,GACZ,OAAOA,EAET,IAAI4mC,EAAQxkC,GAAQpC,GACpB,GAAI4mC,GAEF,GADA/xB,EA68GJ,SAAwBsnB,GACtB,IAAI95B,EAAS85B,EAAM95B,OACfwS,EAAS,IAAIsnB,EAAMz0B,YAAYrF,GAG/BA,GAA6B,iBAAZ85B,EAAM,IAAkBv7B,GAAe1B,KAAKi9B,EAAO,WACtEtnB,EAAOrS,MAAQ25B,EAAM35B,MACrBqS,EAAOm0B,MAAQ7M,EAAM6M,OAEvB,OAAOn0B,EAt9GIo0B,CAAejpC,IACnB6oC,EACH,OAAOtB,GAAUvnC,EAAO6U,OAErB,CACL,IAAIq0B,EAAMC,GAAOnpC,GACbopC,EAASF,GAAO3T,GAAW2T,GAAO1T,EAEtC,GAAI6N,GAASrjC,GACX,OAAOqpC,GAAYrpC,EAAO6oC,GAE5B,GAAIK,GAAOvT,GAAauT,GAAOhU,GAAYkU,IAAW3oC,GAEpD,GADAoU,EAAUi0B,GAAUM,EAAU,GAAKE,GAAgBtpC,IAC9C6oC,EACH,OAAOC,EA+nEf,SAAuB5R,EAAQz2B,GAC7B,OAAO0nC,GAAWjR,EAAQqS,GAAarS,GAASz2B,GA/nEtC+oC,CAAcxpC,EAnH1B,SAAsBS,EAAQy2B,GAC5B,OAAOz2B,GAAU0nC,GAAWjR,EAAQuS,GAAOvS,GAASz2B,GAkHrBipC,CAAa70B,EAAQ7U,IAknEtD,SAAqBk3B,EAAQz2B,GAC3B,OAAO0nC,GAAWjR,EAAQyS,GAAWzS,GAASz2B,GAlnEpCmpC,CAAY5pC,EAAOkoC,GAAWrzB,EAAQ7U,QAEvC,CACL,IAAK06B,GAAcwO,GACjB,OAAOzoC,EAAST,EAAQ,GAE1B6U,EA49GN,SAAwBpU,EAAQyoC,EAAKL,GACnC,IAAIgB,EAAOppC,EAAOiH,YAClB,OAAQwhC,GACN,KAAKjT,EACH,OAAO6T,GAAiBrpC,GAE1B,KAAK20B,EACL,KAAKC,EACH,OAAO,IAAIwU,GAAMppC,GAEnB,KAAKy1B,EACH,OA5nDN,SAAuB6T,EAAUlB,GAC/B,IAAImB,EAASnB,EAASiB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASriC,YAAYsiC,EAAQD,EAASE,WAAYF,EAASG,YA0nD3DC,CAAc1pC,EAAQooC,GAE/B,KAAK1S,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,IA5/LC,6BA4/LqB,KAAKC,EAAW,KAAKC,EACxD,OAAO0T,GAAgB3pC,EAAQooC,GAEjC,KAAKpT,EACH,OAAO,IAAIoU,EAEb,KAAKnU,EACL,KAAKI,EACH,OAAO,IAAI+T,EAAKppC,GAElB,KAAKm1B,EACH,OA/nDN,SAAqByU,GACnB,IAAIx1B,EAAS,IAAIw1B,EAAO3iC,YAAY2iC,EAAOnT,OAAQmB,GAAQ3E,KAAK2W,IAEhE,OADAx1B,EAAOgY,UAAYwd,EAAOxd,UACnBhY,EA4nDIy1B,CAAY7pC,GAErB,KAAKo1B,EACH,OAAO,IAAIgU,EAEb,KAAK9T,EACH,OAxnDewU,EAwnDI9pC,EAvnDhBskC,GAAgBtlC,GAAOslC,GAAc7lC,KAAKqrC,IAAW,GAD9D,IAAqBA,EAp4DNC,CAAexqC,EAAOkpC,EAAKL,IAIxCD,IAAUA,EAAQ,IAAInC,IACtB,IAAIgE,EAAU7B,EAAMhpC,IAAII,GACxB,GAAIyqC,EACF,OAAOA,EAET7B,EAAM1I,IAAIlgC,EAAO6U,GAEbknB,GAAM/7B,GACRA,EAAMwD,SAAQ,SAASknC,GACrB71B,EAAOlL,IAAI8+B,GAAUiC,EAAUhC,EAASC,EAAY+B,EAAU1qC,EAAO4oC,OAE9DjN,GAAM37B,IACfA,EAAMwD,SAAQ,SAASknC,EAAUpqC,GAC/BuU,EAAOqrB,IAAI5/B,EAAKmoC,GAAUiC,EAAUhC,EAASC,EAAYroC,EAAKN,EAAO4oC,OAIzE,IAII9J,EAAQ8H,OA1pFZz1B,GAspFe43B,EACVD,EAAS6B,GAAeC,GACxB9B,EAASW,GAAShI,IAEkBzhC,GASzC,OARAu8B,GAAUuC,GAAS9+B,GAAO,SAAS0qC,EAAUpqC,GACvCw+B,IAEF4L,EAAW1qC,EADXM,EAAMoqC,IAIR7C,GAAYhzB,EAAQvU,EAAKmoC,GAAUiC,EAAUhC,EAASC,EAAYroC,EAAKN,EAAO4oC,OAEzE/zB,EAyBT,SAASg2B,GAAepqC,EAAQy2B,EAAQ4H,GACtC,IAAIz8B,EAASy8B,EAAMz8B,OACnB,GAAc,MAAV5B,EACF,OAAQ4B,EAGV,IADA5B,EAAShB,GAAOgB,GACT4B,KAAU,CACf,IAAI/B,EAAMw+B,EAAMz8B,GACZq6B,EAAYxF,EAAO52B,GACnBN,EAAQS,EAAOH,GAEnB,QAvsFF6Q,IAusFOnR,KAAyBM,KAAOG,KAAai8B,EAAU18B,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS8qC,GAAUt2B,EAAMC,EAAMtQ,GAC7B,GAAmB,mBAARqQ,EACT,MAAM,IAAIY,GAAU2f,GAEtB,OAAOzwB,IAAW,WAAakQ,EAAKjQ,WA5tFpC4M,EA4tFqDhN,KAAUsQ,GAcjE,SAASs2B,GAAe5O,EAAOgB,EAAQd,EAAUW,GAC/C,IAAIx6B,GAAS,EACTwoC,EAAWnO,GACXoO,GAAW,EACX5oC,EAAS85B,EAAM95B,OACfwS,EAAS,GACTq2B,EAAe/N,EAAO96B,OAE1B,IAAKA,EACH,OAAOwS,EAELwnB,IACFc,EAASF,GAASE,EAAQyB,GAAUvC,KAElCW,GACFgO,EAAWjO,GACXkO,GAAW,GAEJ9N,EAAO96B,QAtvFG,MAuvFjB2oC,EAAWjM,GACXkM,GAAW,EACX9N,EAAS,IAAIoJ,GAASpJ,IAExBgO,EACA,OAAS3oC,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACd4oC,EAAuB,MAAZ/O,EAAmBr8B,EAAQq8B,EAASr8B,GAGnD,GADAA,EAASg9B,GAAwB,IAAVh9B,EAAeA,EAAQ,EAC1CirC,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIlO,EAAOkO,KAAiBD,EAC1B,SAASD,EAGbt2B,EAAOnR,KAAK1D,QAEJgrC,EAAS7N,EAAQiO,EAAUpO,IACnCnoB,EAAOnR,KAAK1D,GAGhB,OAAO6U,EAjkCTowB,GAAOqG,iBAAmB,CAQxB,OAAUlU,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAK2N,KAKTA,GAAOtkC,UAAY2kC,GAAW3kC,UAC9BskC,GAAOtkC,UAAU+G,YAAcu9B,GAE/BE,GAAcxkC,UAAY0kC,GAAWC,GAAW3kC,WAChDwkC,GAAcxkC,UAAU+G,YAAcy9B,GAsHtCD,GAAYvkC,UAAY0kC,GAAWC,GAAW3kC,WAC9CukC,GAAYvkC,UAAU+G,YAAcw9B,GAoGpCgB,GAAKvlC,UAAU0uB,MAvEf,WACEjsB,KAAKojC,SAAWnC,GAAeA,GAAa,MAAQ,GACpDjhC,KAAKiI,KAAO,GAsEd66B,GAAKvlC,UAAkB,OAzDvB,SAAoBL,GAClB,IAAIuU,EAASzR,KAAK67B,IAAI3+B,WAAe8C,KAAKojC,SAASlmC,GAEnD,OADA8C,KAAKiI,MAAQwJ,EAAS,EAAI,EACnBA,GAuDTqxB,GAAKvlC,UAAUf,IA3Cf,SAAiBU,GACf,IAAIgG,EAAOlD,KAAKojC,SAChB,GAAInC,GAAc,CAChB,IAAIxvB,EAASvO,EAAKhG,GAClB,MAp7De,8BAo7DRuU,OAl8DT1D,EAk8DiD0D,EAEjD,OAAOjU,GAAe1B,KAAKoH,EAAMhG,GAAOgG,EAAKhG,QAp8D7C6Q,GA0+DF+0B,GAAKvlC,UAAUs+B,IA1Bf,SAAiB3+B,GACf,IAAIgG,EAAOlD,KAAKojC,SAChB,OAAOnC,QAl9DPlzB,IAk9DuB7K,EAAKhG,GAAsBM,GAAe1B,KAAKoH,EAAMhG,IAyB9E4lC,GAAKvlC,UAAUu/B,IAZf,SAAiB5/B,EAAKN,GACpB,IAAIsG,EAAOlD,KAAKojC,SAGhB,OAFApjC,KAAKiI,MAAQjI,KAAK67B,IAAI3+B,GAAO,EAAI,EACjCgG,EAAKhG,GAAQ+jC,SAl+DblzB,IAk+D6BnR,EAp9DZ,4BAo9DoDA,EAC9DoD,MAyHTijC,GAAU1lC,UAAU0uB,MApFpB,WACEjsB,KAAKojC,SAAW,GAChBpjC,KAAKiI,KAAO,GAmFdg7B,GAAU1lC,UAAkB,OAvE5B,SAAyBL,GACvB,IAAIgG,EAAOlD,KAAKojC,SACZhkC,EAAQulC,GAAazhC,EAAMhG,GAE/B,QAAIkC,EAAQ,KAIRA,GADY8D,EAAKjE,OAAS,EAE5BiE,EAAKilC,MAEL7oC,GAAOxD,KAAKoH,EAAM9D,EAAO,KAEzBY,KAAKiI,MACA,IA0DTg7B,GAAU1lC,UAAUf,IA9CpB,SAAsBU,GACpB,IAAIgG,EAAOlD,KAAKojC,SACZhkC,EAAQulC,GAAazhC,EAAMhG,GAE/B,OAAOkC,EAAQ,OApjEf2O,EAojE+B7K,EAAK9D,GAAO,IA2C7C6jC,GAAU1lC,UAAUs+B,IA/BpB,SAAsB3+B,GACpB,OAAOynC,GAAa3kC,KAAKojC,SAAUlmC,IAAQ,GA+B7C+lC,GAAU1lC,UAAUu/B,IAlBpB,SAAsB5/B,EAAKN,GACzB,IAAIsG,EAAOlD,KAAKojC,SACZhkC,EAAQulC,GAAazhC,EAAMhG,GAQ/B,OANIkC,EAAQ,KACRY,KAAKiI,KACP/E,EAAK5C,KAAK,CAACpD,EAAKN,KAEhBsG,EAAK9D,GAAO,GAAKxC,EAEZoD,MA2GTkjC,GAAS3lC,UAAU0uB,MAtEnB,WACEjsB,KAAKiI,KAAO,EACZjI,KAAKojC,SAAW,CACd,KAAQ,IAAIN,GACZ,IAAO,IAAKjC,IAAOoC,IACnB,OAAU,IAAIH,KAkElBI,GAAS3lC,UAAkB,OArD3B,SAAwBL,GACtB,IAAIuU,EAAS22B,GAAWpoC,KAAM9C,GAAa,OAAEA,GAE7C,OADA8C,KAAKiI,MAAQwJ,EAAS,EAAI,EACnBA,GAmDTyxB,GAAS3lC,UAAUf,IAvCnB,SAAqBU,GACnB,OAAOkrC,GAAWpoC,KAAM9C,GAAKV,IAAIU,IAuCnCgmC,GAAS3lC,UAAUs+B,IA3BnB,SAAqB3+B,GACnB,OAAOkrC,GAAWpoC,KAAM9C,GAAK2+B,IAAI3+B,IA2BnCgmC,GAAS3lC,UAAUu/B,IAdnB,SAAqB5/B,EAAKN,GACxB,IAAIsG,EAAOklC,GAAWpoC,KAAM9C,GACxB+K,EAAO/E,EAAK+E,KAIhB,OAFA/E,EAAK45B,IAAI5/B,EAAKN,GACdoD,KAAKiI,MAAQ/E,EAAK+E,MAAQA,EAAO,EAAI,EAC9BjI,MA2DTmjC,GAAS5lC,UAAUgJ,IAAM48B,GAAS5lC,UAAU+C,KAnB5C,SAAqB1D,GAEnB,OADAoD,KAAKojC,SAAStG,IAAIlgC,EA1tED,6BA2tEVoD,MAkBTmjC,GAAS5lC,UAAUs+B,IANnB,SAAqBj/B,GACnB,OAAOoD,KAAKojC,SAASvH,IAAIj/B,IAuG3BymC,GAAM9lC,UAAU0uB,MA3EhB,WACEjsB,KAAKojC,SAAW,IAAIH,GACpBjjC,KAAKiI,KAAO,GA0Edo7B,GAAM9lC,UAAkB,OA9DxB,SAAqBL,GACnB,IAAIgG,EAAOlD,KAAKojC,SACZ3xB,EAASvO,EAAa,OAAEhG,GAG5B,OADA8C,KAAKiI,KAAO/E,EAAK+E,KACVwJ,GA0DT4xB,GAAM9lC,UAAUf,IA9ChB,SAAkBU,GAChB,OAAO8C,KAAKojC,SAAS5mC,IAAIU,IA8C3BmmC,GAAM9lC,UAAUs+B,IAlChB,SAAkB3+B,GAChB,OAAO8C,KAAKojC,SAASvH,IAAI3+B,IAkC3BmmC,GAAM9lC,UAAUu/B,IArBhB,SAAkB5/B,EAAKN,GACrB,IAAIsG,EAAOlD,KAAKojC,SAChB,GAAIlgC,aAAgB+/B,GAAW,CAC7B,IAAIoF,EAAQnlC,EAAKkgC,SACjB,IAAKvC,IAAQwH,EAAMppC,OAASqpC,IAG1B,OAFAD,EAAM/nC,KAAK,CAACpD,EAAKN,IACjBoD,KAAKiI,OAAS/E,EAAK+E,KACZjI,KAETkD,EAAOlD,KAAKojC,SAAW,IAAIF,GAASmF,GAItC,OAFAnlC,EAAK45B,IAAI5/B,EAAKN,GACdoD,KAAKiI,KAAO/E,EAAK+E,KACVjI,MAscT,IAAI6kC,GAAW0D,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUvqB,EAAYkb,GAC7B,IAAI7nB,GAAS,EAKb,OAJAozB,GAASzmB,GAAY,SAASxhB,EAAOwC,EAAOgf,GAE1C,OADA3M,IAAW6nB,EAAU18B,EAAOwC,EAAOgf,MAG9B3M,EAaT,SAASm3B,GAAa7P,EAAOE,EAAUW,GAIrC,IAHA,IAAIx6B,GAAS,EACTH,EAAS85B,EAAM95B,SAEVG,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACd+7B,EAAUlC,EAASr8B,GAEvB,GAAe,MAAXu+B,SA/0FNptB,IA+0F0Bi6B,EACf7M,GAAYA,IAAYloB,GAASkoB,GAClCvB,EAAWuB,EAAS6M,IAE1B,IAAIA,EAAW7M,EACX1pB,EAAS7U,EAGjB,OAAO6U,EAuCT,SAASo3B,GAAWzqB,EAAYkb,GAC9B,IAAI7nB,EAAS,GAMb,OALAozB,GAASzmB,GAAY,SAASxhB,EAAOwC,EAAOgf,GACtCkb,EAAU18B,EAAOwC,EAAOgf,IAC1B3M,EAAOnR,KAAK1D,MAGT6U,EAcT,SAASq3B,GAAY/P,EAAOgQ,EAAOzP,EAAW0P,EAAUv3B,GACtD,IAAIrS,GAAS,EACTH,EAAS85B,EAAM95B,OAKnB,IAHAq6B,IAAcA,EAAY2P,IAC1Bx3B,IAAWA,EAAS,MAEXrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACd2pC,EAAQ,GAAKzP,EAAU18B,GACrBmsC,EAAQ,EAEVD,GAAYlsC,EAAOmsC,EAAQ,EAAGzP,EAAW0P,EAAUv3B,GAEnDqoB,GAAUroB,EAAQ7U,GAEVosC,IACVv3B,EAAOA,EAAOxS,QAAUrC,GAG5B,OAAO6U,EAcT,IAAIy3B,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASX,GAAWnrC,EAAQ47B,GAC1B,OAAO57B,GAAU6rC,GAAQ7rC,EAAQ47B,EAAUoF,IAW7C,SAASqK,GAAgBrrC,EAAQ47B,GAC/B,OAAO57B,GAAU+rC,GAAa/rC,EAAQ47B,EAAUoF,IAYlD,SAASgL,GAAchsC,EAAQq+B,GAC7B,OAAOnC,GAAYmC,GAAO,SAASx+B,GACjC,OAAOosC,GAAWjsC,EAAOH,OAY7B,SAASqsC,GAAQlsC,EAAQyrB,GAMvB,IAHA,IAAI1pB,EAAQ,EACRH,GAHJ6pB,EAAO0gB,GAAS1gB,EAAMzrB,IAGJ4B,OAED,MAAV5B,GAAkB+B,EAAQH,GAC/B5B,EAASA,EAAOosC,GAAM3gB,EAAK1pB,OAE7B,OAAQA,GAASA,GAASH,EAAU5B,OA3/FpC0Q,EAygGF,SAAS27B,GAAersC,EAAQssC,EAAUC,GACxC,IAAIn4B,EAASk4B,EAAStsC,GACtB,OAAO2B,GAAQ3B,GAAUoU,EAASqoB,GAAUroB,EAAQm4B,EAAYvsC,IAUlE,SAASwsC,GAAWjtC,GAClB,OAAa,MAATA,OAthGJmR,IAuhGSnR,EAn7FM,qBARL,gBA67FF0iC,IAAkBA,MAAkBjjC,GAAOO,GA23FrD,SAAmBA,GACjB,IAAIktC,EAAQtsC,GAAe1B,KAAKc,EAAO0iC,IACnCwG,EAAMlpC,EAAM0iC,IAEhB,IACE1iC,EAAM0iC,SAz5LRvxB,EA05LE,IAAIg8B,GAAW,EACf,MAAO7yB,IAET,IAAIzF,EAAS8sB,GAAqBziC,KAAKc,GACnCmtC,IACED,EACFltC,EAAM0iC,IAAkBwG,SAEjBlpC,EAAM0iC,KAGjB,OAAO7tB,EA34FHu4B,CAAUptC,GA+5GhB,SAAwBA,GACtB,OAAO2hC,GAAqBziC,KAAKc,GA/5G7BiU,CAAejU,GAYrB,SAASqtC,GAAOrtC,EAAOsW,GACrB,OAAOtW,EAAQsW,EAWjB,SAASg3B,GAAQ7sC,EAAQH,GACvB,OAAiB,MAAVG,GAAkBG,GAAe1B,KAAKuB,EAAQH,GAWvD,SAASitC,GAAU9sC,EAAQH,GACzB,OAAiB,MAAVG,GAAkBH,KAAOb,GAAOgB,GA0BzC,SAAS+sC,GAAiBC,EAAQpR,EAAUW,GAS1C,IARA,IAAIgO,EAAWhO,EAAaD,GAAoBF,GAC5Cx6B,EAASorC,EAAO,GAAGprC,OACnBqrC,EAAYD,EAAOprC,OACnBsrC,EAAWD,EACXE,EAAStsC,EAAMosC,GACfG,EAAYxkB,IACZxU,EAAS,GAEN84B,KAAY,CACjB,IAAIxR,EAAQsR,EAAOE,GACfA,GAAYtR,IACdF,EAAQc,GAASd,EAAOyC,GAAUvC,KAEpCwR,EAAYz5B,GAAU+nB,EAAM95B,OAAQwrC,GACpCD,EAAOD,IAAa3Q,IAAeX,GAAah6B,GAAU,KAAO85B,EAAM95B,QAAU,KAC7E,IAAIkkC,GAASoH,GAAYxR,QA1mG/BhrB,EA6mGAgrB,EAAQsR,EAAO,GAEf,IAAIjrC,GAAS,EACTsrC,EAAOF,EAAO,GAElBzC,EACA,OAAS3oC,EAAQH,GAAUwS,EAAOxS,OAASwrC,GAAW,CACpD,IAAI7tC,EAAQm8B,EAAM35B,GACd4oC,EAAW/O,EAAWA,EAASr8B,GAASA,EAG5C,GADAA,EAASg9B,GAAwB,IAAVh9B,EAAeA,EAAQ,IACxC8tC,EACE/O,GAAS+O,EAAM1C,GACfJ,EAASn2B,EAAQu2B,EAAUpO,IAC5B,CAEL,IADA2Q,EAAWD,IACFC,GAAU,CACjB,IAAI3O,EAAQ4O,EAAOD,GACnB,KAAM3O,EACED,GAASC,EAAOoM,GAChBJ,EAASyC,EAAOE,GAAWvC,EAAUpO,IAE3C,SAASmO,EAGT2C,GACFA,EAAKpqC,KAAK0nC,GAEZv2B,EAAOnR,KAAK1D,IAGhB,OAAO6U,EA+BT,SAASk5B,GAAWttC,EAAQyrB,EAAM/nB,GAGhC,IAAIqQ,EAAiB,OADrB/T,EAASO,GAAOP,EADhByrB,EAAO0gB,GAAS1gB,EAAMzrB,KAEMA,EAASA,EAAOosC,GAAMmB,GAAK9hB,KACvD,OAAe,MAAR1X,OA/qGPrD,EA+qGkC5M,GAAMiQ,EAAM/T,EAAQ0D,GAUxD,SAAS8pC,GAAgBjuC,GACvB,OAAOoW,GAAapW,IAAUitC,GAAWjtC,IAAUk1B,EAuCrD,SAASgZ,GAAYluC,EAAOsW,EAAOoyB,EAASC,EAAYC,GACtD,OAAI5oC,IAAUsW,IAGD,MAATtW,GAA0B,MAATsW,IAAmBF,GAAapW,KAAWoW,GAAaE,GACpEtW,GAAUA,GAASsW,GAAUA,EAmBxC,SAAyB7V,EAAQ6V,EAAOoyB,EAASC,EAAYwF,EAAWvF,GACtE,IAAIwF,EAAWhsC,GAAQ3B,GACnB4tC,EAAWjsC,GAAQkU,GACnBg4B,EAASF,EAAWjZ,EAAWgU,GAAO1oC,GACtC8tC,EAASF,EAAWlZ,EAAWgU,GAAO7yB,GAKtCk4B,GAHJF,EAASA,GAAUpZ,EAAUS,EAAY2Y,IAGhB3Y,EACrB8Y,GAHJF,EAASA,GAAUrZ,EAAUS,EAAY4Y,IAGhB5Y,EACrB+Y,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarL,GAAS5iC,GAAS,CACjC,IAAK4iC,GAAS/sB,GACZ,OAAO,EAET83B,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADA5F,IAAUA,EAAQ,IAAInC,IACd2H,GAAYnS,GAAax7B,GAC7BkuC,GAAYluC,EAAQ6V,EAAOoyB,EAASC,EAAYwF,EAAWvF,GA81EnE,SAAoBnoC,EAAQ6V,EAAO4yB,EAAKR,EAASC,EAAYwF,EAAWvF,GACtE,OAAQM,GACN,KAAKhT,EACH,GAAKz1B,EAAOypC,YAAc5zB,EAAM4zB,YAC3BzpC,EAAOwpC,YAAc3zB,EAAM2zB,WAC9B,OAAO,EAETxpC,EAASA,EAAOupC,OAChB1zB,EAAQA,EAAM0zB,OAEhB,KAAK/T,EACH,QAAKx1B,EAAOypC,YAAc5zB,EAAM4zB,aAC3BiE,EAAU,IAAInM,GAAWvhC,GAAS,IAAIuhC,GAAW1rB,KAKxD,KAAK8e,EACL,KAAKC,EACL,KAAKK,EAGH,OAAOiS,IAAIlnC,GAAS6V,GAEtB,KAAKgf,EACH,OAAO70B,EAAOnB,MAAQgX,EAAMhX,MAAQmB,EAAOka,SAAWrE,EAAMqE,QAE9D,KAAKib,EACL,KAAKE,EAIH,OAAOr1B,GAAW6V,EAAQ,GAE5B,KAAKmf,EACH,IAAImZ,EAAU/O,GAEhB,KAAKhK,EACH,IAAIgZ,EAxnLe,EAwnLHnG,EAGhB,GAFAkG,IAAYA,EAAU3O,IAElBx/B,EAAO4K,MAAQiL,EAAMjL,OAASwjC,EAChC,OAAO,EAGT,IAAIpE,EAAU7B,EAAMhpC,IAAIa,GACxB,GAAIgqC,EACF,OAAOA,GAAWn0B,EAEpBoyB,GAloLqB,EAqoLrBE,EAAM1I,IAAIz/B,EAAQ6V,GAClB,IAAIzB,EAAS85B,GAAYC,EAAQnuC,GAASmuC,EAAQt4B,GAAQoyB,EAASC,EAAYwF,EAAWvF,GAE1F,OADAA,EAAc,OAAEnoC,GACToU,EAET,KAAKkhB,EACH,GAAIgP,GACF,OAAOA,GAAc7lC,KAAKuB,IAAWskC,GAAc7lC,KAAKoX,GAG9D,OAAO,EA35EDw4B,CAAWruC,EAAQ6V,EAAOg4B,EAAQ5F,EAASC,EAAYwF,EAAWvF,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAIqG,EAAeP,GAAY5tC,GAAe1B,KAAKuB,EAAQ,eACvDuuC,EAAeP,GAAY7tC,GAAe1B,KAAKoX,EAAO,eAE1D,GAAIy4B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAetuC,EAAOT,QAAUS,EAC/CyuC,EAAeF,EAAe14B,EAAMtW,QAAUsW,EAGlD,OADAsyB,IAAUA,EAAQ,IAAInC,IACf0H,EAAUc,EAAcC,EAAcxG,EAASC,EAAYC,IAGtE,IAAK8F,EACH,OAAO,EAGT,OADA9F,IAAUA,EAAQ,IAAInC,IA05ExB,SAAsBhmC,EAAQ6V,EAAOoyB,EAASC,EAAYwF,EAAWvF,GACnE,IAAIiG,EAjqLmB,EAiqLPnG,EACZyG,EAAWvE,GAAWnqC,GACtB2uC,EAAYD,EAAS9sC,OAErBqrC,EADW9C,GAAWt0B,GACDjU,OAEzB,GAAI+sC,GAAa1B,IAAcmB,EAC7B,OAAO,EAET,IAAIrsC,EAAQ4sC,EACZ,KAAO5sC,KAAS,CACd,IAAIlC,EAAM6uC,EAAS3sC,GACnB,KAAMqsC,EAAYvuC,KAAOgW,EAAQ1V,GAAe1B,KAAKoX,EAAOhW,IAC1D,OAAO,EAIX,IAAI+uC,EAAazG,EAAMhpC,IAAIa,GACvB6uC,EAAa1G,EAAMhpC,IAAI0W,GAC3B,GAAI+4B,GAAcC,EAChB,OAAOD,GAAc/4B,GAASg5B,GAAc7uC,EAE9C,IAAIoU,GAAS,EACb+zB,EAAM1I,IAAIz/B,EAAQ6V,GAClBsyB,EAAM1I,IAAI5pB,EAAO7V,GAEjB,IAAI8uC,EAAWV,EACf,OAASrsC,EAAQ4sC,GAAW,CAC1B9uC,EAAM6uC,EAAS3sC,GACf,IAAIslC,EAAWrnC,EAAOH,GAClBkvC,EAAWl5B,EAAMhW,GAErB,GAAIqoC,EACF,IAAI8G,EAAWZ,EACXlG,EAAW6G,EAAU1H,EAAUxnC,EAAKgW,EAAO7V,EAAQmoC,GACnDD,EAAWb,EAAU0H,EAAUlvC,EAAKG,EAAQ6V,EAAOsyB,GAGzD,UAnuLFz3B,IAmuLQs+B,EACG3H,IAAa0H,GAAYrB,EAAUrG,EAAU0H,EAAU9G,EAASC,EAAYC,GAC7E6G,GACD,CACL56B,GAAS,EACT,MAEF06B,IAAaA,EAAkB,eAAPjvC,GAE1B,GAAIuU,IAAW06B,EAAU,CACvB,IAAIG,EAAUjvC,EAAOiH,YACjBioC,EAAUr5B,EAAM5O,YAGhBgoC,GAAWC,KACV,gBAAiBlvC,MAAU,gBAAiB6V,IACzB,mBAAXo5B,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD96B,GAAS,GAKb,OAFA+zB,EAAc,OAAEnoC,GAChBmoC,EAAc,OAAEtyB,GACTzB,EAv9EA+6B,CAAanvC,EAAQ6V,EAAOoyB,EAASC,EAAYwF,EAAWvF,GA3D5DiH,CAAgB7vC,EAAOsW,EAAOoyB,EAASC,EAAYuF,GAAatF,IAmFzE,SAASkH,GAAYrvC,EAAQy2B,EAAQ6Y,EAAWpH,GAC9C,IAAInmC,EAAQutC,EAAU1tC,OAClBA,EAASG,EACTwtC,GAAgBrH,EAEpB,GAAc,MAAVloC,EACF,OAAQ4B,EAGV,IADA5B,EAAShB,GAAOgB,GACT+B,KAAS,CACd,IAAI8D,EAAOypC,EAAUvtC,GACrB,GAAKwtC,GAAgB1pC,EAAK,GAClBA,EAAK,KAAO7F,EAAO6F,EAAK,MACtBA,EAAK,KAAM7F,GAEnB,OAAO,EAGX,OAAS+B,EAAQH,GAAQ,CAEvB,IAAI/B,GADJgG,EAAOypC,EAAUvtC,IACF,GACXslC,EAAWrnC,EAAOH,GAClB2vC,EAAW3pC,EAAK,GAEpB,GAAI0pC,GAAgB1pC,EAAK,IACvB,QAp1GJ6K,IAo1GQ22B,KAA4BxnC,KAAOG,GACrC,OAAO,MAEJ,CACL,IAAImoC,EAAQ,IAAInC,GAChB,GAAIkC,EACF,IAAI9zB,EAAS8zB,EAAWb,EAAUmI,EAAU3vC,EAAKG,EAAQy2B,EAAQ0R,GAEnE,UA51GJz3B,IA41GU0D,EACEq5B,GAAY+B,EAAUnI,EAAUoI,EAA+CvH,EAAYC,GAC3F/zB,GAEN,OAAO,GAIb,OAAO,EAWT,SAASs7B,GAAanwC,GACpB,SAAKiW,GAASjW,KA05FEwU,EA15FiBxU,EA25FxBwhC,IAAeA,MAAchtB,MAx5FxBk4B,GAAW1sC,GAAS8hC,GAAaxJ,IAChC7hB,KAAKguB,GAASzkC,IAs5F/B,IAAkBwU,EA12FlB,SAAS47B,GAAapwC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKqwC,GAEW,iBAATrwC,EACFoC,GAAQpC,GACXswC,GAAoBtwC,EAAM,GAAIA,EAAM,IACpCuwC,GAAYvwC,GAEXU,GAASV,GAUlB,SAASwwC,GAAS/vC,GAChB,IAAKgwC,GAAYhwC,GACf,OAAOgjC,GAAWhjC,GAEpB,IAAIoU,EAAS,GACb,IAAK,IAAIvU,KAAOb,GAAOgB,GACjBG,GAAe1B,KAAKuB,EAAQH,IAAe,eAAPA,GACtCuU,EAAOnR,KAAKpD,GAGhB,OAAOuU,EAUT,SAAS67B,GAAWjwC,GAClB,IAAKwV,GAASxV,GACZ,OA09FJ,SAAsBA,GACpB,IAAIoU,EAAS,GACb,GAAc,MAAVpU,EACF,IAAK,IAAIH,KAAOb,GAAOgB,GACrBoU,EAAOnR,KAAKpD,GAGhB,OAAOuU,EAj+FE87B,CAAalwC,GAEtB,IAAImwC,EAAUH,GAAYhwC,GACtBoU,EAAS,GAEb,IAAK,IAAIvU,KAAOG,GACD,eAAPH,IAAyBswC,GAAYhwC,GAAe1B,KAAKuB,EAAQH,KACrEuU,EAAOnR,KAAKpD,GAGhB,OAAOuU,EAYT,SAASg8B,GAAO7wC,EAAOsW,GACrB,OAAOtW,EAAQsW,EAWjB,SAASw6B,GAAQtvB,EAAY6a,GAC3B,IAAI75B,GAAS,EACTqS,EAASk8B,GAAYvvB,GAAclgB,EAAMkgB,EAAWnf,QAAU,GAKlE,OAHA4lC,GAASzmB,GAAY,SAASxhB,EAAOM,EAAKkhB,GACxC3M,IAASrS,GAAS65B,EAASr8B,EAAOM,EAAKkhB,MAElC3M,EAUT,SAAS07B,GAAYrZ,GACnB,IAAI6Y,EAAYiB,GAAa9Z,GAC7B,OAAwB,GAApB6Y,EAAU1tC,QAAe0tC,EAAU,GAAG,GACjCkB,GAAwBlB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAStvC,GACd,OAAOA,IAAWy2B,GAAU4Y,GAAYrvC,EAAQy2B,EAAQ6Y,IAY5D,SAASO,GAAoBpkB,EAAM+jB,GACjC,OAAIiB,GAAMhlB,IAASilB,GAAmBlB,GAC7BgB,GAAwBpE,GAAM3gB,GAAO+jB,GAEvC,SAASxvC,GACd,IAAIqnC,EAAWloC,GAAIa,EAAQyrB,GAC3B,YAzhHF/a,IAyhHU22B,GAA0BA,IAAamI,EAC3CmB,GAAM3wC,EAAQyrB,GACdgiB,GAAY+B,EAAUnI,EAAUoI,IAexC,SAASmB,GAAU5wC,EAAQy2B,EAAQoa,EAAU3I,EAAYC,GACnDnoC,IAAWy2B,GAGfoV,GAAQpV,GAAQ,SAAS+Y,EAAU3vC,GAEjC,GADAsoC,IAAUA,EAAQ,IAAInC,IAClBxwB,GAASg6B,IA+BjB,SAAuBxvC,EAAQy2B,EAAQ52B,EAAKgxC,EAAUC,EAAW5I,EAAYC,GAC3E,IAAId,EAAW0J,GAAQ/wC,EAAQH,GAC3B2vC,EAAWuB,GAAQta,EAAQ52B,GAC3BmqC,EAAU7B,EAAMhpC,IAAIqwC,GAExB,GAAIxF,EAEF,YADA/C,GAAiBjnC,EAAQH,EAAKmqC,GAGhC,IAAIgH,EAAW9I,EACXA,EAAWb,EAAUmI,EAAW3vC,EAAM,GAAKG,EAAQy2B,EAAQ0R,QAzlH/Dz3B,EA4lHI85B,OA5lHJ95B,IA4lHesgC,EAEf,GAAIxG,EAAU,CACZ,IAAIrE,EAAQxkC,GAAQ6tC,GAChBlJ,GAAUH,GAASvD,GAAS4M,GAC5ByB,GAAW9K,IAAUG,GAAU9K,GAAagU,GAEhDwB,EAAWxB,EACPrJ,GAASG,GAAU2K,EACjBtvC,GAAQ0lC,GACV2J,EAAW3J,EAEJ6J,GAAkB7J,GACzB2J,EAAWlK,GAAUO,GAEdf,GACPkE,GAAW,EACXwG,EAAWpI,GAAY4G,GAAU,IAE1ByB,GACPzG,GAAW,EACXwG,EAAWrH,GAAgB6F,GAAU,IAGrCwB,EAAW,GAGNG,GAAc3B,IAAanJ,GAAYmJ,IAC9CwB,EAAW3J,EACPhB,GAAYgB,GACd2J,EAAWI,GAAc/J,GAEjB7xB,GAAS6xB,KAAa4E,GAAW5E,KACzC2J,EAAWnI,GAAgB2G,KAI7BhF,GAAW,EAGXA,IAEFrC,EAAM1I,IAAI+P,EAAUwB,GACpBF,EAAUE,EAAUxB,EAAUqB,EAAU3I,EAAYC,GACpDA,EAAc,OAAEqH,IAElBvI,GAAiBjnC,EAAQH,EAAKmxC,GAzF1BK,CAAcrxC,EAAQy2B,EAAQ52B,EAAKgxC,EAAUD,GAAW1I,EAAYC,OAEjE,CACH,IAAI6I,EAAW9I,EACXA,EAAW6I,GAAQ/wC,EAAQH,GAAM2vC,EAAW3vC,EAAM,GAAKG,EAAQy2B,EAAQ0R,QArjH/Ez3B,WAwjHQsgC,IACFA,EAAWxB,GAEbvI,GAAiBjnC,EAAQH,EAAKmxC,MAE/BhI,IAwFL,SAASsI,GAAQ5V,EAAO37B,GACtB,IAAI6B,EAAS85B,EAAM95B,OACnB,GAAKA,EAIL,OAAO6kC,GADP1mC,GAAKA,EAAI,EAAI6B,EAAS,EACJA,GAAU85B,EAAM37B,QA3pHlC2Q,EAuqHF,SAAS6gC,GAAYxwB,EAAYywB,EAAWC,GAExCD,EADEA,EAAU5vC,OACA46B,GAASgV,GAAW,SAAS5V,GACvC,OAAIj6B,GAAQi6B,GACH,SAASr8B,GACd,OAAO2sC,GAAQ3sC,EAA2B,IAApBq8B,EAASh6B,OAAeg6B,EAAS,GAAKA,IAGzDA,KAGG,CAACgU,IAGf,IAAI7tC,GAAS,EAUb,OATAyvC,EAAYhV,GAASgV,EAAWrT,GAAUuT,OAnxF9C,SAAoBhW,EAAOiW,GACzB,IAAI/vC,EAAS85B,EAAM95B,OAGnB,IADA85B,EAAMkW,KAAKD,GACJ/vC,KACL85B,EAAM95B,GAAU85B,EAAM95B,GAAQrC,MAEhC,OAAOm8B,EAqxFEmW,CAPMxB,GAAQtvB,GAAY,SAASxhB,EAAOM,EAAKkhB,GAIpD,MAAO,CAAE,SAHMyb,GAASgV,GAAW,SAAS5V,GAC1C,OAAOA,EAASr8B,MAEa,QAAWwC,EAAO,MAASxC,OAGlC,SAASS,EAAQ6V,GACzC,OA04BJ,SAAyB7V,EAAQ6V,EAAO47B,GACtC,IAAI1vC,GAAS,EACT+vC,EAAc9xC,EAAO+xC,SACrBC,EAAcn8B,EAAMk8B,SACpBnwC,EAASkwC,EAAYlwC,OACrBqwC,EAAeR,EAAO7vC,OAE1B,OAASG,EAAQH,GAAQ,CACvB,IAAIwS,EAAS89B,GAAiBJ,EAAY/vC,GAAQiwC,EAAYjwC,IAC9D,GAAIqS,EAAQ,CACV,GAAIrS,GAASkwC,EACX,OAAO79B,EAET,IAAI+9B,EAAQV,EAAO1vC,GACnB,OAAOqS,GAAmB,QAAT+9B,GAAmB,EAAI,IAU5C,OAAOnyC,EAAO+B,MAAQ8T,EAAM9T,MAl6BnBqwC,CAAgBpyC,EAAQ6V,EAAO47B,MA4B1C,SAASY,GAAWryC,EAAQ4nC,EAAO3L,GAKjC,IAJA,IAAIl6B,GAAS,EACTH,EAASgmC,EAAMhmC,OACfwS,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAI6pB,EAAOmc,EAAM7lC,GACbxC,EAAQ2sC,GAAQlsC,EAAQyrB,GAExBwQ,EAAU18B,EAAOksB,IACnB6mB,GAAQl+B,EAAQ+3B,GAAS1gB,EAAMzrB,GAAST,GAG5C,OAAO6U,EA2BT,SAASm+B,GAAY7W,EAAOgB,EAAQd,EAAUW,GAC5C,IAAIv6B,EAAUu6B,EAAakB,GAAkBpB,GACzCt6B,GAAS,EACTH,EAAS86B,EAAO96B,OAChByrC,EAAO3R,EAQX,IANIA,IAAUgB,IACZA,EAASoK,GAAUpK,IAEjBd,IACFyR,EAAO7Q,GAASd,EAAOyC,GAAUvC,OAE1B75B,EAAQH,GAKf,IAJA,IAAIy7B,EAAY,EACZ99B,EAAQm9B,EAAO36B,GACf4oC,EAAW/O,EAAWA,EAASr8B,GAASA,GAEpC89B,EAAYr7B,EAAQqrC,EAAM1C,EAAUtN,EAAWd,KAAgB,GACjE8Q,IAAS3R,GACXz5B,GAAOxD,KAAK4uC,EAAMhQ,EAAW,GAE/Bp7B,GAAOxD,KAAKi9B,EAAO2B,EAAW,GAGlC,OAAO3B,EAYT,SAAS8W,GAAW9W,EAAOld,GAIzB,IAHA,IAAI5c,EAAS85B,EAAQld,EAAQ5c,OAAS,EAClCwqB,EAAYxqB,EAAS,EAElBA,KAAU,CACf,IAAIG,EAAQyc,EAAQ5c,GACpB,GAAIA,GAAUwqB,GAAarqB,IAAUyN,EAAU,CAC7C,IAAIA,EAAWzN,EACX0kC,GAAQ1kC,GACVE,GAAOxD,KAAKi9B,EAAO35B,EAAO,GAE1B0wC,GAAU/W,EAAO35B,IAIvB,OAAO25B,EAYT,SAASiL,GAAWmB,EAAOC,GACzB,OAAOD,EAAQtF,GAAYW,MAAkB4E,EAAQD,EAAQ,IAkC/D,SAAS4K,GAAWzU,EAAQl+B,GAC1B,IAAIqU,EAAS,GACb,IAAK6pB,GAAUl+B,EAAI,GAAKA,EA9yHL,iBA+yHjB,OAAOqU,EAIT,GACMrU,EAAI,IACNqU,GAAU6pB,IAEZl+B,EAAIyiC,GAAYziC,EAAI,MAElBk+B,GAAUA,SAELl+B,GAET,OAAOqU,EAWT,SAASu+B,GAAS5+B,EAAM6+B,GACtB,OAAOC,GAAYC,GAAS/+B,EAAM6+B,EAAOhD,IAAW77B,EAAO,IAU7D,SAASg/B,GAAWhyB,GAClB,OAAO2lB,GAAYhK,GAAO3b,IAW5B,SAASiyB,GAAejyB,EAAYhhB,GAClC,IAAI27B,EAAQgB,GAAO3b,GACnB,OAAO8lB,GAAYnL,EAAOqL,GAAUhnC,EAAG,EAAG27B,EAAM95B,SAalD,SAAS0wC,GAAQtyC,EAAQyrB,EAAMlsB,EAAO2oC,GACpC,IAAK1yB,GAASxV,GACZ,OAAOA,EAST,IALA,IAAI+B,GAAS,EACTH,GAHJ6pB,EAAO0gB,GAAS1gB,EAAMzrB,IAGJ4B,OACdwqB,EAAYxqB,EAAS,EACrBqxC,EAASjzC,EAEI,MAAVizC,KAAoBlxC,EAAQH,GAAQ,CACzC,IAAI/B,EAAMusC,GAAM3gB,EAAK1pB,IACjBivC,EAAWzxC,EAEf,GAAY,cAARM,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOG,EAGT,GAAI+B,GAASqqB,EAAW,CACtB,IAAIib,EAAW4L,EAAOpzC,QA57H1B6Q,KA67HIsgC,EAAW9I,EAAaA,EAAWb,EAAUxnC,EAAKozC,QA77HtDviC,KA+7HMsgC,EAAWx7B,GAAS6xB,GAChBA,EACCZ,GAAQhb,EAAK1pB,EAAQ,IAAM,GAAK,IAGzCqlC,GAAY6L,EAAQpzC,EAAKmxC,GACzBiC,EAASA,EAAOpzC,GAElB,OAAOG,EAWT,IAAIkzC,GAAerP,GAAqB,SAAS9vB,EAAMlO,GAErD,OADAg+B,GAAQpE,IAAI1rB,EAAMlO,GACXkO,GAFoB67B,GAazBuD,GAAmBl0C,GAA4B,SAAS8U,EAAMkqB,GAChE,OAAOh/B,GAAe8U,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASq/B,GAASnV,GAClB,UAAY,KALwB2R,GAgBxC,SAASyD,GAAYtyB,GACnB,OAAO8lB,GAAYnK,GAAO3b,IAY5B,SAASuyB,GAAU5X,EAAOkX,EAAOW,GAC/B,IAAIxxC,GAAS,EACTH,EAAS85B,EAAM95B,OAEfgxC,EAAQ,IACVA,GAASA,EAAQhxC,EAAS,EAAKA,EAASgxC,IAE1CW,EAAMA,EAAM3xC,EAASA,EAAS2xC,GACpB,IACRA,GAAO3xC,GAETA,EAASgxC,EAAQW,EAAM,EAAMA,EAAMX,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIx+B,EAASvT,EAAMe,KACVG,EAAQH,GACfwS,EAAOrS,GAAS25B,EAAM35B,EAAQ6wC,GAEhC,OAAOx+B,EAYT,SAASo/B,GAASzyB,EAAYkb,GAC5B,IAAI7nB,EAMJ,OAJAozB,GAASzmB,GAAY,SAASxhB,EAAOwC,EAAOgf,GAE1C,QADA3M,EAAS6nB,EAAU18B,EAAOwC,EAAOgf,SAG1B3M,EAeX,SAASq/B,GAAgB/X,EAAOn8B,EAAOm0C,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATlY,EAAgBiY,EAAMjY,EAAM95B,OAEvC,GAAoB,iBAATrC,GAAqBA,GAAUA,GAASq0C,GAn/H3BC,WAm/H0D,CAChF,KAAOF,EAAMC,GAAM,CACjB,IAAIE,EAAOH,EAAMC,IAAU,EACvBjJ,EAAWjP,EAAMoY,GAEJ,OAAbnJ,IAAsB/0B,GAAS+0B,KAC9B+I,EAAc/I,GAAYprC,EAAUorC,EAAWprC,GAClDo0C,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAOF,EAET,OAAOG,GAAkBrY,EAAOn8B,EAAOqwC,GAAU8D,GAgBnD,SAASK,GAAkBrY,EAAOn8B,EAAOq8B,EAAU8X,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATlY,EAAgB,EAAIA,EAAM95B,OACrC,GAAa,IAATgyC,EACF,OAAO,EAST,IALA,IAAII,GADJz0C,EAAQq8B,EAASr8B,KACQA,EACrB00C,EAAsB,OAAV10C,EACZ20C,EAAct+B,GAASrW,GACvB40C,OA7lIJzjC,IA6lIqBnR,EAEdo0C,EAAMC,GAAM,CACjB,IAAIE,EAAMtR,IAAamR,EAAMC,GAAQ,GACjCjJ,EAAW/O,EAASF,EAAMoY,IAC1BM,OAlmIN1jC,IAkmIqBi6B,EACf0J,EAAyB,OAAb1J,EACZ2J,EAAiB3J,GAAaA,EAC9B4J,EAAc3+B,GAAS+0B,GAE3B,GAAIqJ,EACF,IAAIQ,EAASd,GAAcY,OAE3BE,EADSL,EACAG,IAAmBZ,GAAcU,GACjCH,EACAK,GAAkBF,IAAiBV,IAAeW,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcX,IAAea,IAChEF,IAAaE,IAGbb,EAAc/I,GAAYprC,EAAUorC,EAAWprC,GAEtDi1C,EACFb,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAOngC,GAAUigC,EA1jICC,YAskIpB,SAASY,GAAe/Y,EAAOE,GAM7B,IALA,IAAI75B,GAAS,EACTH,EAAS85B,EAAM95B,OACfu6B,EAAW,EACX/nB,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACd4oC,EAAW/O,EAAWA,EAASr8B,GAASA,EAE5C,IAAKwC,IAAUmlC,GAAGyD,EAAU0C,GAAO,CACjC,IAAIA,EAAO1C,EACXv2B,EAAO+nB,KAAwB,IAAV58B,EAAc,EAAIA,GAG3C,OAAO6U,EAWT,SAASsgC,GAAan1C,GACpB,MAAoB,iBAATA,EACFA,EAELqW,GAASrW,GAxmIP,KA2mIEA,EAWV,SAASo1C,GAAap1C,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIoC,GAAQpC,GAEV,OAAOi9B,GAASj9B,EAAOo1C,IAAgB,GAEzC,GAAI/+B,GAASrW,GACX,OAAOglC,GAAiBA,GAAe9lC,KAAKc,GAAS,GAEvD,IAAI6U,EAAU7U,EAAQ,GACtB,MAAkB,KAAV6U,GAAkB,EAAI7U,IAtoInB,IAsoI0C,KAAO6U,EAY9D,SAASwgC,GAASlZ,EAAOE,EAAUW,GACjC,IAAIx6B,GAAS,EACTwoC,EAAWnO,GACXx6B,EAAS85B,EAAM95B,OACf4oC,GAAW,EACXp2B,EAAS,GACTi5B,EAAOj5B,EAEX,GAAImoB,EACFiO,GAAW,EACXD,EAAWjO,QAER,GAAI16B,GAjtIU,IAitIkB,CACnC,IAAI69B,EAAM7D,EAAW,KAAOiZ,GAAUnZ,GACtC,GAAI+D,EACF,OAAOD,GAAWC,GAEpB+K,GAAW,EACXD,EAAWjM,GACX+O,EAAO,IAAIvH,QAGXuH,EAAOzR,EAAW,GAAKxnB,EAEzBs2B,EACA,OAAS3oC,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACd4oC,EAAW/O,EAAWA,EAASr8B,GAASA,EAG5C,GADAA,EAASg9B,GAAwB,IAAVh9B,EAAeA,EAAQ,EAC1CirC,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAImK,EAAYzH,EAAKzrC,OACdkzC,KACL,GAAIzH,EAAKyH,KAAenK,EACtB,SAASD,EAGT9O,GACFyR,EAAKpqC,KAAK0nC,GAEZv2B,EAAOnR,KAAK1D,QAEJgrC,EAAS8C,EAAM1C,EAAUpO,KAC7B8Q,IAASj5B,GACXi5B,EAAKpqC,KAAK0nC,GAEZv2B,EAAOnR,KAAK1D,IAGhB,OAAO6U,EAWT,SAASq+B,GAAUzyC,EAAQyrB,GAGzB,OAAiB,OADjBzrB,EAASO,GAAOP,EADhByrB,EAAO0gB,GAAS1gB,EAAMzrB,aAEUA,EAAOosC,GAAMmB,GAAK9hB,KAapD,SAASspB,GAAW/0C,EAAQyrB,EAAMupB,EAAS9M,GACzC,OAAOoK,GAAQtyC,EAAQyrB,EAAMupB,EAAQ9I,GAAQlsC,EAAQyrB,IAAQyc,GAc/D,SAAS+M,GAAUvZ,EAAOO,EAAWiZ,EAAQ5X,GAI3C,IAHA,IAAI17B,EAAS85B,EAAM95B,OACfG,EAAQu7B,EAAY17B,GAAU,GAE1B07B,EAAYv7B,MAAYA,EAAQH,IACtCq6B,EAAUP,EAAM35B,GAAQA,EAAO25B,KAEjC,OAAOwZ,EACH5B,GAAU5X,EAAQ4B,EAAY,EAAIv7B,EAASu7B,EAAYv7B,EAAQ,EAAIH,GACnE0xC,GAAU5X,EAAQ4B,EAAYv7B,EAAQ,EAAI,EAAKu7B,EAAY17B,EAASG,GAa1E,SAASozC,GAAiB51C,EAAO61C,GAC/B,IAAIhhC,EAAS7U,EAIb,OAHI6U,aAAkBqwB,KACpBrwB,EAASA,EAAO7U,SAEXq9B,GAAYwY,GAAS,SAAShhC,EAAQihC,GAC3C,OAAOA,EAAOthC,KAAKjQ,MAAMuxC,EAAOvgC,QAAS2nB,GAAU,CAACroB,GAASihC,EAAO3xC,SACnE0Q,GAaL,SAASkhC,GAAQtI,EAAQpR,EAAUW,GACjC,IAAI36B,EAASorC,EAAOprC,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASgzC,GAAS5H,EAAO,IAAM,GAKxC,IAHA,IAAIjrC,GAAS,EACTqS,EAASvT,EAAMe,KAEVG,EAAQH,GAIf,IAHA,IAAI85B,EAAQsR,EAAOjrC,GACfmrC,GAAY,IAEPA,EAAWtrC,GACdsrC,GAAYnrC,IACdqS,EAAOrS,GAASuoC,GAAel2B,EAAOrS,IAAU25B,EAAOsR,EAAOE,GAAWtR,EAAUW,IAIzF,OAAOqY,GAASnJ,GAAYr3B,EAAQ,GAAIwnB,EAAUW,GAYpD,SAASgZ,GAAclX,EAAO3B,EAAQ8Y,GAMpC,IALA,IAAIzzC,GAAS,EACTH,EAASy8B,EAAMz8B,OACf6zC,EAAa/Y,EAAO96B,OACpBwS,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQwC,EAAQ0zC,EAAa/Y,EAAO36B,QAr3I1C2O,EAs3IE8kC,EAAWphC,EAAQiqB,EAAMt8B,GAAQxC,GAEnC,OAAO6U,EAUT,SAASshC,GAAoBn2C,GAC3B,OAAO2xC,GAAkB3xC,GAASA,EAAQ,GAU5C,SAASo2C,GAAap2C,GACpB,MAAuB,mBAATA,EAAsBA,EAAQqwC,GAW9C,SAASzD,GAAS5sC,EAAOS,GACvB,OAAI2B,GAAQpC,GACHA,EAEFkxC,GAAMlxC,EAAOS,GAAU,CAACT,GAASq2C,GAAaniC,GAASlU,IAYhE,IAAIs2C,GAAWlD,GAWf,SAASmD,GAAUpa,EAAOkX,EAAOW,GAC/B,IAAI3xC,EAAS85B,EAAM95B,OAEnB,OADA2xC,OAt7IA7iC,IAs7IM6iC,EAAoB3xC,EAAS2xC,GAC1BX,GAASW,GAAO3xC,EAAU85B,EAAQ4X,GAAU5X,EAAOkX,EAAOW,GASrE,IAAI9vC,GAAe0+B,IAAmB,SAASp6B,GAC7C,OAAOuL,GAAK7P,aAAasE,IAW3B,SAAS6gC,GAAYW,EAAQnB,GAC3B,GAAIA,EACF,OAAOmB,EAAOzoC,QAEhB,IAAIc,EAAS2nC,EAAO3nC,OAChBwS,EAASotB,GAAcA,GAAY5/B,GAAU,IAAI2nC,EAAOtiC,YAAYrF,GAGxE,OADA2nC,EAAOwM,KAAK3hC,GACLA,EAUT,SAASi1B,GAAiB2M,GACxB,IAAI5hC,EAAS,IAAI4hC,EAAY/uC,YAAY+uC,EAAYvM,YAErD,OADA,IAAIlI,GAAWntB,GAAQqrB,IAAI,IAAI8B,GAAWyU,IACnC5hC,EAgDT,SAASu1B,GAAgBsM,EAAY7N,GACnC,IAAImB,EAASnB,EAASiB,GAAiB4M,EAAW1M,QAAU0M,EAAW1M,OACvE,OAAO,IAAI0M,EAAWhvC,YAAYsiC,EAAQ0M,EAAWzM,WAAYyM,EAAWr0C,QAW9E,SAASswC,GAAiB3yC,EAAOsW,GAC/B,GAAItW,IAAUsW,EAAO,CACnB,IAAIqgC,OAhiJNxlC,IAgiJqBnR,EACf00C,EAAsB,OAAV10C,EACZ42C,EAAiB52C,GAAUA,EAC3B20C,EAAct+B,GAASrW,GAEvB60C,OAriJN1jC,IAqiJqBmF,EACfw+B,EAAsB,OAAVx+B,EACZy+B,EAAiBz+B,GAAUA,EAC3B0+B,EAAc3+B,GAASC,GAE3B,IAAMw+B,IAAcE,IAAgBL,GAAe30C,EAAQsW,GACtDq+B,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B4B,GAAgB5B,IACjB6B,EACH,OAAO,EAET,IAAMlC,IAAcC,IAAgBK,GAAeh1C,EAAQsW,GACtD0+B,GAAe2B,GAAgBC,IAAmBlC,IAAcC,GAChEG,GAAa6B,GAAgBC,IAC5B/B,GAAgB+B,IACjB7B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS8B,GAAY1yC,EAAM2yC,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAa/yC,EAAK9B,OAClB80C,EAAgBJ,EAAQ10C,OACxB+0C,GAAa,EACbC,EAAaP,EAASz0C,OACtBi1C,EAAcnjC,GAAU+iC,EAAaC,EAAe,GACpDtiC,EAASvT,EAAM+1C,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBxiC,EAAOuiC,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BriC,EAAOkiC,EAAQE,IAAc9yC,EAAK8yC,IAGtC,KAAOK,KACLziC,EAAOuiC,KAAejzC,EAAK8yC,KAE7B,OAAOpiC,EAcT,SAAS2iC,GAAiBrzC,EAAM2yC,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAa/yC,EAAK9B,OAClBo1C,GAAgB,EAChBN,EAAgBJ,EAAQ10C,OACxBq1C,GAAc,EACdC,EAAcb,EAASz0C,OACvBi1C,EAAcnjC,GAAU+iC,EAAaC,EAAe,GACpDtiC,EAASvT,EAAMg2C,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBziC,EAAOoiC,GAAa9yC,EAAK8yC,GAG3B,IADA,IAAI7Z,EAAS6Z,IACJS,EAAaC,GACpB9iC,EAAOuoB,EAASsa,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BriC,EAAOuoB,EAAS2Z,EAAQU,IAAiBtzC,EAAK8yC,MAGlD,OAAOpiC,EAWT,SAAS0yB,GAAUrQ,EAAQiF,GACzB,IAAI35B,GAAS,EACTH,EAAS60B,EAAO70B,OAGpB,IADA85B,IAAUA,EAAQ76B,EAAMe,MACfG,EAAQH,GACf85B,EAAM35B,GAAS00B,EAAO10B,GAExB,OAAO25B,EAaT,SAASgM,GAAWjR,EAAQ4H,EAAOr+B,EAAQkoC,GACzC,IAAIiP,GAASn3C,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAI+B,GAAS,EACTH,EAASy8B,EAAMz8B,SAEVG,EAAQH,GAAQ,CACvB,IAAI/B,EAAMw+B,EAAMt8B,GAEZivC,EAAW9I,EACXA,EAAWloC,EAAOH,GAAM42B,EAAO52B,GAAMA,EAAKG,EAAQy2B,QArtJxD/lB,WAwtJMsgC,IACFA,EAAWva,EAAO52B,IAEhBs3C,EACFhQ,GAAgBnnC,EAAQH,EAAKmxC,GAE7B5J,GAAYpnC,EAAQH,EAAKmxC,GAG7B,OAAOhxC,EAmCT,SAASo3C,GAAiBzb,EAAQ0b,GAChC,OAAO,SAASt2B,EAAY6a,GAC1B,IAAI7nB,EAAOpS,GAAQof,GAAc0a,GAAkB8L,GAC/C1L,EAAcwb,EAAcA,IAAgB,GAEhD,OAAOtjC,EAAKgN,EAAY4a,EAAQ+V,GAAY9V,EAAU,GAAIC,IAW9D,SAASyb,GAAeC,GACtB,OAAO5E,IAAS,SAAS3yC,EAAQw3C,GAC/B,IAAIz1C,GAAS,EACTH,EAAS41C,EAAQ51C,OACjBsmC,EAAatmC,EAAS,EAAI41C,EAAQ51C,EAAS,QAxxJjD8O,EAyxJM+mC,EAAQ71C,EAAS,EAAI41C,EAAQ,QAzxJnC9mC,EAoyJE,IATAw3B,EAAcqP,EAAS31C,OAAS,GAA0B,mBAAdsmC,GACvCtmC,IAAUsmC,QA5xJjBx3B,EA+xJM+mC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDvP,EAAatmC,EAAS,OAhyJ1B8O,EAgyJ0Cw3B,EACtCtmC,EAAS,GAEX5B,EAAShB,GAAOgB,KACP+B,EAAQH,GAAQ,CACvB,IAAI60B,EAAS+gB,EAAQz1C,GACjB00B,GACF8gB,EAASv3C,EAAQy2B,EAAQ10B,EAAOmmC,GAGpC,OAAOloC,KAYX,SAASkrC,GAAe/N,EAAUG,GAChC,OAAO,SAASvc,EAAY6a,GAC1B,GAAkB,MAAd7a,EACF,OAAOA,EAET,IAAKuvB,GAAYvvB,GACf,OAAOoc,EAASpc,EAAY6a,GAM9B,IAJA,IAAIh6B,EAASmf,EAAWnf,OACpBG,EAAQu7B,EAAY17B,GAAU,EAC9B+1C,EAAW34C,GAAO+hB,IAEduc,EAAYv7B,MAAYA,EAAQH,KACa,IAA/Cg6B,EAAS+b,EAAS51C,GAAQA,EAAO41C,KAIvC,OAAO52B,GAWX,SAAS+qB,GAAcxO,GACrB,OAAO,SAASt9B,EAAQ47B,EAAU0Q,GAMhC,IALA,IAAIvqC,GAAS,EACT41C,EAAW34C,GAAOgB,GAClBq+B,EAAQiO,EAAStsC,GACjB4B,EAASy8B,EAAMz8B,OAEZA,KAAU,CACf,IAAI/B,EAAMw+B,EAAMf,EAAY17B,IAAWG,GACvC,IAA+C,IAA3C65B,EAAS+b,EAAS93C,GAAMA,EAAK83C,GAC/B,MAGJ,OAAO33C,GAgCX,SAAS43C,GAAgBv0C,GACvB,OAAO,SAAS46B,GAGd,IAAIS,EAAaS,GAFjBlB,EAASxqB,GAASwqB,IAGd4B,GAAc5B,QAp4JpBvtB,EAu4JMwuB,EAAMR,EACNA,EAAW,GACXT,EAAOgC,OAAO,GAEdvrB,EAAWgqB,EACXoX,GAAUpX,EAAY,GAAGpd,KAAK,IAC9B2c,EAAOn9B,MAAM,GAEjB,OAAOo+B,EAAI77B,KAAgBqR,GAW/B,SAASmjC,GAAiB7zC,GACxB,OAAO,SAASi6B,GACd,OAAOrB,GAAYkb,GAAMC,GAAO9Z,GAAQ55B,QAAQm1B,GAAQ,KAAMx1B,EAAU,KAY5E,SAASg0C,GAAW5O,GAClB,OAAO,WAIL,IAAI1lC,EAAOC,UACX,OAAQD,EAAK9B,QACX,KAAK,EAAG,OAAO,IAAIwnC,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK1lC,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI0lC,EAAK1lC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIu0C,EAAcrT,GAAWwE,EAAKlpC,WAC9BkU,EAASg1B,EAAKtlC,MAAMm0C,EAAav0C,GAIrC,OAAO8R,GAASpB,GAAUA,EAAS6jC,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAASp3B,EAAYkb,EAAWoB,GACrC,IAAIsa,EAAW34C,GAAO+hB,GACtB,IAAKuvB,GAAYvvB,GAAa,CAC5B,IAAI6a,EAAW8V,GAAYzV,EAAW,GACtClb,EAAaigB,GAAKjgB,GAClBkb,EAAY,SAASp8B,GAAO,OAAO+7B,EAAS+b,EAAS93C,GAAMA,EAAK83C,IAElE,IAAI51C,EAAQo2C,EAAcp3B,EAAYkb,EAAWoB,GACjD,OAAOt7B,GAAS,EAAI41C,EAAS/b,EAAW7a,EAAWhf,GAASA,QAt/J9D2O,GAigKF,SAAS0nC,GAAW9a,GAClB,OAAO+a,IAAS,SAASC,GACvB,IAAI12C,EAAS02C,EAAM12C,OACfG,EAAQH,EACR22C,EAAS7T,GAAcxkC,UAAUs4C,KAKrC,IAHIlb,GACFgb,EAAMhV,UAEDvhC,KAAS,CACd,IAAIgS,EAAOukC,EAAMv2C,GACjB,GAAmB,mBAARgS,EACT,MAAM,IAAIY,GAAU2f,GAEtB,GAAIikB,IAAWE,GAAgC,WAArBC,GAAY3kC,GACpC,IAAI0kC,EAAU,IAAI/T,GAAc,IAAI,GAIxC,IADA3iC,EAAQ02C,EAAU12C,EAAQH,IACjBG,EAAQH,GAAQ,CAGvB,IAAI+2C,EAAWD,GAFf3kC,EAAOukC,EAAMv2C,IAGT8D,EAAmB,WAAZ8yC,EAAwBC,GAAQ7kC,QAxhK/CrD,EA8hKM+nC,EAJE5yC,GAAQgzC,GAAWhzC,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGjE,QAAqB,GAAXiE,EAAK,GAElB4yC,EAAQC,GAAY7yC,EAAK,KAAK/B,MAAM20C,EAAS5yC,EAAK,IAElC,GAAfkO,EAAKnS,QAAei3C,GAAW9kC,GACtC0kC,EAAQE,KACRF,EAAQD,KAAKzkC,GAGrB,OAAO,WACL,IAAIrQ,EAAOC,UACPpE,EAAQmE,EAAK,GAEjB,GAAI+0C,GAA0B,GAAf/0C,EAAK9B,QAAeD,GAAQpC,GACzC,OAAOk5C,EAAQK,MAAMv5C,GAAOA,QAK9B,IAHA,IAAIwC,EAAQ,EACRqS,EAASxS,EAAS02C,EAAMv2C,GAAO+B,MAAMnB,KAAMe,GAAQnE,IAE9CwC,EAAQH,GACfwS,EAASkkC,EAAMv2C,GAAOtD,KAAKkE,KAAMyR,GAEnC,OAAOA,MAwBb,SAAS2kC,GAAahlC,EAAMk0B,EAASnzB,EAASuhC,EAAUC,EAAS0C,EAAeC,EAAcC,EAAQp3C,EAAKq3C,GACzG,IAAIC,EApiKY,IAoiKJnR,EACRoR,EA5iKa,EA4iKJpR,EACTqR,EA5iKiB,EA4iKLrR,EACZsO,EAAsB,GAAVtO,EACZsR,EAtiKa,IAsiKJtR,EACTmB,EAAOkQ,OAhlKX5oC,EAglKmCsnC,GAAWjkC,GA6C9C,OA3CA,SAAS0kC,IAKP,IAJA,IAAI72C,EAAS+B,UAAU/B,OACnB8B,EAAO7C,EAAMe,GACbG,EAAQH,EAELG,KACL2B,EAAK3B,GAAS4B,UAAU5B,GAE1B,GAAIw0C,EACF,IAAIzX,EAAc0a,GAAUf,GACxBgB,EAAe5a,GAAan7B,EAAMo7B,GASxC,GAPIuX,IACF3yC,EAAO0yC,GAAY1yC,EAAM2yC,EAAUC,EAASC,IAE1CyC,IACFt1C,EAAOqzC,GAAiBrzC,EAAMs1C,EAAeC,EAAc1C,IAE7D30C,GAAU63C,EACNlD,GAAa30C,EAASu3C,EAAO,CAC/B,IAAIO,EAAana,GAAe77B,EAAMo7B,GACtC,OAAO6a,GACL5lC,EAAMk0B,EAAS8Q,GAAcN,EAAQ3Z,YAAahqB,EAClDpR,EAAMg2C,EAAYR,EAAQp3C,EAAKq3C,EAAQv3C,GAG3C,IAAIq2C,EAAcoB,EAASvkC,EAAUnS,KACjCyxB,EAAKklB,EAAYrB,EAAYlkC,GAAQA,EAczC,OAZAnS,EAAS8B,EAAK9B,OACVs3C,EACFx1C,EAAOk2C,GAAQl2C,EAAMw1C,GACZK,GAAU33C,EAAS,GAC5B8B,EAAK4/B,UAEH8V,GAASt3C,EAAMF,IACjB8B,EAAK9B,OAASE,GAEZa,MAAQA,OAAS2Q,IAAQ3Q,gBAAgB81C,IAC3CrkB,EAAKgV,GAAQ4O,GAAW5jB,IAEnBA,EAAGtwB,MAAMm0C,EAAav0C,IAajC,SAASm2C,GAAele,EAAQme,GAC9B,OAAO,SAAS95C,EAAQ47B,GACtB,OAh/DJ,SAAsB57B,EAAQ27B,EAAQC,EAAUC,GAI9C,OAHAsP,GAAWnrC,GAAQ,SAAST,EAAOM,EAAKG,GACtC27B,EAAOE,EAAaD,EAASr8B,GAAQM,EAAKG,MAErC67B,EA4+DEke,CAAa/5C,EAAQ27B,EAAQme,EAAWle,GAAW,KAY9D,SAASoe,GAAoBC,EAAUC,GACrC,OAAO,SAAS36C,EAAOsW,GACrB,IAAIzB,EACJ,QAzpKF1D,IAypKMnR,QAzpKNmR,IAypK6BmF,EACzB,OAAOqkC,EAKT,QA/pKFxpC,IA4pKMnR,IACF6U,EAAS7U,QA7pKbmR,IA+pKMmF,EAAqB,CACvB,QAhqKJnF,IAgqKQ0D,EACF,OAAOyB,EAEW,iBAATtW,GAAqC,iBAATsW,GACrCtW,EAAQo1C,GAAap1C,GACrBsW,EAAQ8+B,GAAa9+B,KAErBtW,EAAQm1C,GAAan1C,GACrBsW,EAAQ6+B,GAAa7+B,IAEvBzB,EAAS6lC,EAAS16C,EAAOsW,GAE3B,OAAOzB,GAWX,SAAS+lC,GAAWC,GAClB,OAAO/B,IAAS,SAAS7G,GAEvB,OADAA,EAAYhV,GAASgV,EAAWrT,GAAUuT,OACnCiB,IAAS,SAASjvC,GACvB,IAAIoR,EAAUnS,KACd,OAAOy3C,EAAU5I,GAAW,SAAS5V,GACnC,OAAO93B,GAAM83B,EAAU9mB,EAASpR,YAexC,SAAS22C,GAAcz4C,EAAQ04C,GAG7B,IAAIC,GAFJD,OA7sKA5pC,IA6sKQ4pC,EAAsB,IAAM3F,GAAa2F,IAEzB14C,OACxB,GAAI24C,EAAc,EAChB,OAAOA,EAAc7H,GAAW4H,EAAO14C,GAAU04C,EAEnD,IAAIlmC,EAASs+B,GAAW4H,EAAOhY,GAAW1gC,EAAS+9B,GAAW2a,KAC9D,OAAOnb,GAAWmb,GACdxE,GAAUjW,GAAczrB,GAAS,EAAGxS,GAAQ0f,KAAK,IACjDlN,EAAOtT,MAAM,EAAGc,GA6CtB,SAAS44C,GAAYld,GACnB,OAAO,SAASsV,EAAOW,EAAKkH,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB/C,GAAe9E,EAAOW,EAAKkH,KAChElH,EAAMkH,OAtwKV/pC,GAywKEkiC,EAAQ8H,GAAS9H,QAzwKnBliC,IA0wKM6iC,GACFA,EAAMX,EACNA,EAAQ,GAERW,EAAMmH,GAASnH,GA57CrB,SAAmBX,EAAOW,EAAKkH,EAAMnd,GAKnC,IAJA,IAAIv7B,GAAS,EACTH,EAAS8R,GAAU4uB,IAAYiR,EAAMX,IAAU6H,GAAQ,IAAK,GAC5DrmC,EAASvT,EAAMe,GAEZA,KACLwS,EAAOkpB,EAAY17B,IAAWG,GAAS6wC,EACvCA,GAAS6H,EAEX,OAAOrmC,EAs7CEumC,CAAU/H,EAAOW,EADxBkH,OAhxKF/pC,IAgxKS+pC,EAAsB7H,EAAQW,EAAM,GAAK,EAAKmH,GAASD,GAC3Bnd,IAWvC,SAASsd,GAA0BX,GACjC,OAAO,SAAS16C,EAAOsW,GAKrB,MAJsB,iBAATtW,GAAqC,iBAATsW,IACvCtW,EAAQgW,GAAShW,GACjBsW,EAAQN,GAASM,IAEZokC,EAAS16C,EAAOsW,IAqB3B,SAAS8jC,GAAc5lC,EAAMk0B,EAAS4S,EAAU/b,EAAahqB,EAASuhC,EAAUC,EAAS4C,EAAQp3C,EAAKq3C,GACpG,IAAI2B,EArxKc,EAqxKJ7S,EAMdA,GAAY6S,EAzxKQ,GACM,GAJF,GA6xKxB7S,KAAa6S,EAzxKa,GADN,OA6xKlB7S,IAAW,GAEb,IAAI8S,EAAU,CACZhnC,EAAMk0B,EAASnzB,EAVCgmC,EAAUzE,OA3zK5B3lC,EAyzKiBoqC,EAAUxE,OAzzK3B5lC,EA4zKuBoqC,OA5zKvBpqC,EA4zK6C2lC,EAFvByE,OA1zKtBpqC,EA0zK4C4lC,EAYzB4C,EAAQp3C,EAAKq3C,GAG5B/kC,EAASymC,EAAS/2C,WAz0KtB4M,EAy0KuCqqC,GAKvC,OAJIlC,GAAW9kC,IACbinC,GAAQ5mC,EAAQ2mC,GAElB3mC,EAAO0qB,YAAcA,EACdmc,GAAgB7mC,EAAQL,EAAMk0B,GAUvC,SAASiT,GAAY73C,GACnB,IAAI0Q,EAAO9I,GAAK5H,GAChB,OAAO,SAAS8I,EAAQgvC,GAGtB,GAFAhvC,EAASoJ,GAASpJ,IAClBgvC,EAAyB,MAAbA,EAAoB,EAAIxnC,GAAUynC,GAAUD,GAAY,OACnDtY,GAAe12B,GAAS,CAGvC,IAAIkvC,GAAQ5nC,GAAStH,GAAU,KAAK4zB,MAAM,KAI1C,SADAsb,GAAQ5nC,GAFIM,EAAKsnC,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKpb,MAAM,MACvB,GAAK,MAAQsb,EAAK,GAAKF,IAEvC,OAAOpnC,EAAK5H,IAWhB,IAAI0oC,GAAcnR,IAAQ,EAAIlE,GAAW,IAAIkE,GAAI,CAAC,EAAE,KAAK,IAxzK5C,IAwzKsE,SAAShH,GAC1F,OAAO,IAAIgH,GAAIhH,IAD2D4e,GAW5E,SAASC,GAAcjP,GACrB,OAAO,SAAStsC,GACd,IAAIyoC,EAAMC,GAAO1oC,GACjB,OAAIyoC,GAAOzT,EACFoK,GAAWp/B,GAEhByoC,GAAOrT,EACFsK,GAAW1/B,GAn6I1B,SAAqBA,EAAQq+B,GAC3B,OAAO7B,GAAS6B,GAAO,SAASx+B,GAC9B,MAAO,CAACA,EAAKG,EAAOH,OAm6IX27C,CAAYx7C,EAAQssC,EAAStsC,KA6BxC,SAASy7C,GAAW1nC,EAAMk0B,EAASnzB,EAASuhC,EAAUC,EAAS4C,EAAQp3C,EAAKq3C,GAC1E,IAAIG,EAl4KiB,EAk4KLrR,EAChB,IAAKqR,GAA4B,mBAARvlC,EACvB,MAAM,IAAIY,GAAU2f,GAEtB,IAAI1yB,EAASy0C,EAAWA,EAASz0C,OAAS,EAS1C,GARKA,IACHqmC,IAAW,GACXoO,EAAWC,OA16Kb5lC,GA46KA5O,OA56KA4O,IA46KM5O,EAAoBA,EAAM4R,GAAU0nC,GAAUt5C,GAAM,GAC1Dq3C,OA76KAzoC,IA66KQyoC,EAAsBA,EAAQiC,GAAUjC,GAChDv3C,GAAU00C,EAAUA,EAAQ10C,OAAS,EAx4KX,GA04KtBqmC,EAAmC,CACrC,IAAI+Q,EAAgB3C,EAChB4C,EAAe3C,EAEnBD,EAAWC,OAp7Kb5lC,EAs7KA,IAAI7K,EAAOyzC,OAt7KX5oC,EAs7KmCkoC,GAAQ7kC,GAEvCgnC,EAAU,CACZhnC,EAAMk0B,EAASnzB,EAASuhC,EAAUC,EAAS0C,EAAeC,EAC1DC,EAAQp3C,EAAKq3C,GAkBf,GAfItzC,GA26BN,SAAmBA,EAAM4wB,GACvB,IAAIwR,EAAUpiC,EAAK,GACf61C,EAAajlB,EAAO,GACpBklB,EAAa1T,EAAUyT,EACvBlR,EAAWmR,EAAa,IAExBC,EAv0MY,KAw0MZF,GA50Mc,GA40MmBzT,GAx0MrB,KAy0MZyT,GAx0Mc,KAw0MmBzT,GAAgCpiC,EAAK,GAAGjE,QAAU60B,EAAO,IAC5E,KAAdilB,GAAqDjlB,EAAO,GAAG70B,QAAU60B,EAAO,IA90MlE,GA80M0EwR,EAG5F,IAAMuC,IAAYoR,EAChB,OAAO/1C,EAr1MQ,EAw1Mb61C,IACF71C,EAAK,GAAK4wB,EAAO,GAEjBklB,GA31Me,EA21MD1T,EAA2B,EAz1MnB,GA41MxB,IAAI1oC,EAAQk3B,EAAO,GACnB,GAAIl3B,EAAO,CACT,IAAI82C,EAAWxwC,EAAK,GACpBA,EAAK,GAAKwwC,EAAWD,GAAYC,EAAU92C,EAAOk3B,EAAO,IAAMl3B,EAC/DsG,EAAK,GAAKwwC,EAAW9W,GAAe15B,EAAK,GAAI0uB,GAAekC,EAAO,IAGrEl3B,EAAQk3B,EAAO,MAEb4f,EAAWxwC,EAAK,GAChBA,EAAK,GAAKwwC,EAAWU,GAAiBV,EAAU92C,EAAOk3B,EAAO,IAAMl3B,EACpEsG,EAAK,GAAKwwC,EAAW9W,GAAe15B,EAAK,GAAI0uB,GAAekC,EAAO,KAGrEl3B,EAAQk3B,EAAO,MAEb5wB,EAAK,GAAKtG,GAv2MI,IA02MZm8C,IACF71C,EAAK,GAAgB,MAAXA,EAAK,GAAa4wB,EAAO,GAAK9iB,GAAU9N,EAAK,GAAI4wB,EAAO,KAGrD,MAAX5wB,EAAK,KACPA,EAAK,GAAK4wB,EAAO,IAGnB5wB,EAAK,GAAK4wB,EAAO,GACjB5wB,EAAK,GAAK81C,EA59BRE,CAAUd,EAASl1C,GAErBkO,EAAOgnC,EAAQ,GACf9S,EAAU8S,EAAQ,GAClBjmC,EAAUimC,EAAQ,GAClB1E,EAAW0E,EAAQ,GACnBzE,EAAUyE,EAAQ,KAClB5B,EAAQ4B,EAAQ,QAr8KhBrqC,IAq8KqBqqC,EAAQ,GACxBzB,EAAY,EAAIvlC,EAAKnS,OACtB8R,GAAUqnC,EAAQ,GAAKn5C,EAAQ,KAEX,GAAVqmC,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGd7zB,EA56KgB,GA26KP6zB,GA16Ka,IA06KiBA,EApgB3C,SAAqBl0B,EAAMk0B,EAASkR,GAClC,IAAI/P,EAAO4O,GAAWjkC,GAwBtB,OAtBA,SAAS0kC,IAMP,IALA,IAAI72C,EAAS+B,UAAU/B,OACnB8B,EAAO7C,EAAMe,GACbG,EAAQH,EACRk9B,EAAc0a,GAAUf,GAErB12C,KACL2B,EAAK3B,GAAS4B,UAAU5B,GAE1B,IAAIu0C,EAAW10C,EAAS,GAAK8B,EAAK,KAAOo7B,GAAep7B,EAAK9B,EAAS,KAAOk9B,EACzE,GACAS,GAAe77B,EAAMo7B,GAGzB,IADAl9B,GAAU00C,EAAQ10C,QACLu3C,EACX,OAAOQ,GACL5lC,EAAMk0B,EAAS8Q,GAAcN,EAAQ3Z,iBA79J3CpuB,EA89JMhN,EAAM4yC,OA99JZ5lC,SA89J2CyoC,EAAQv3C,GAEjD,IAAIwyB,EAAMzxB,MAAQA,OAAS2Q,IAAQ3Q,gBAAgB81C,EAAWrP,EAAOr1B,EACrE,OAAOjQ,GAAMswB,EAAIzxB,KAAMe,IA8edo4C,CAAY/nC,EAAMk0B,EAASkR,GA16KlB,IA26KRlR,GAA2C,IAAXA,GAAqDqO,EAAQ10C,OAG9Fm3C,GAAaj1C,WAn9KxB4M,EAm9KyCqqC,GA9O3C,SAAuBhnC,EAAMk0B,EAASnzB,EAASuhC,GAC7C,IAAIgD,EAtsKa,EAssKJpR,EACTmB,EAAO4O,GAAWjkC,GAkBtB,OAhBA,SAAS0kC,IAQP,IAPA,IAAIjC,GAAa,EACbC,EAAa9yC,UAAU/B,OACvB+0C,GAAa,EACbC,EAAaP,EAASz0C,OACtB8B,EAAO7C,EAAM+1C,EAAaH,GAC1BriB,EAAMzxB,MAAQA,OAAS2Q,IAAQ3Q,gBAAgB81C,EAAWrP,EAAOr1B,IAE5D4iC,EAAYC,GACnBlzC,EAAKizC,GAAaN,EAASM,GAE7B,KAAOF,KACL/yC,EAAKizC,KAAehzC,YAAY6yC,GAElC,OAAO1yC,GAAMswB,EAAIilB,EAASvkC,EAAUnS,KAAMe,IA0NjCq4C,CAAchoC,EAAMk0B,EAASnzB,EAASuhC,QAJ/C,IAAIjiC,EAhmBR,SAAoBL,EAAMk0B,EAASnzB,GACjC,IAAIukC,EA90Ja,EA80JJpR,EACTmB,EAAO4O,GAAWjkC,GAMtB,OAJA,SAAS0kC,IACP,IAAIrkB,EAAMzxB,MAAQA,OAAS2Q,IAAQ3Q,gBAAgB81C,EAAWrP,EAAOr1B,EACrE,OAAOqgB,EAAGtwB,MAAMu1C,EAASvkC,EAAUnS,KAAMgB,YA0lB5Bq4C,CAAWjoC,EAAMk0B,EAASnzB,GASzC,OAAOmmC,IADMp1C,EAAOqtC,GAAc8H,IACJ5mC,EAAQ2mC,GAAUhnC,EAAMk0B,GAexD,SAASgU,GAAuB5U,EAAUmI,EAAU3vC,EAAKG,GACvD,YAt+KA0Q,IAs+KI22B,GACCH,GAAGG,EAAU1G,GAAY9gC,MAAUM,GAAe1B,KAAKuB,EAAQH,GAC3D2vC,EAEFnI,EAiBT,SAAS6U,GAAoB7U,EAAUmI,EAAU3vC,EAAKG,EAAQy2B,EAAQ0R,GAOpE,OANI3yB,GAAS6xB,IAAa7xB,GAASg6B,KAEjCrH,EAAM1I,IAAI+P,EAAUnI,GACpBuJ,GAAUvJ,EAAUmI,OA//KtB9+B,EA+/K2CwrC,GAAqB/T,GAC9DA,EAAc,OAAEqH,IAEXnI,EAYT,SAAS8U,GAAgB58C,GACvB,OAAO4xC,GAAc5xC,QA/gLrBmR,EA+gL0CnR,EAgB5C,SAAS2uC,GAAYxS,EAAO7lB,EAAOoyB,EAASC,EAAYwF,EAAWvF,GACjE,IAAIiG,EApgLmB,EAogLPnG,EACZmU,EAAY1gB,EAAM95B,OAClBqrC,EAAYp3B,EAAMjU,OAEtB,GAAIw6C,GAAanP,KAAemB,GAAanB,EAAYmP,GACvD,OAAO,EAGT,IAAIC,EAAalU,EAAMhpC,IAAIu8B,GACvBmT,EAAa1G,EAAMhpC,IAAI0W,GAC3B,GAAIwmC,GAAcxN,EAChB,OAAOwN,GAAcxmC,GAASg5B,GAAcnT,EAE9C,IAAI35B,GAAS,EACTqS,GAAS,EACTi5B,EAlhLqB,EAkhLbpF,EAAoC,IAAInC,QA/iLpDp1B,EAqjLA,IAJAy3B,EAAM1I,IAAI/D,EAAO7lB,GACjBsyB,EAAM1I,IAAI5pB,EAAO6lB,KAGR35B,EAAQq6C,GAAW,CAC1B,IAAIE,EAAW5gB,EAAM35B,GACjBgtC,EAAWl5B,EAAM9T,GAErB,GAAImmC,EACF,IAAI8G,EAAWZ,EACXlG,EAAW6G,EAAUuN,EAAUv6C,EAAO8T,EAAO6lB,EAAOyM,GACpDD,EAAWoU,EAAUvN,EAAUhtC,EAAO25B,EAAO7lB,EAAOsyB,GAE1D,QA9jLFz3B,IA8jLMs+B,EAAwB,CAC1B,GAAIA,EACF,SAEF56B,GAAS,EACT,MAGF,GAAIi5B,GACF,IAAKtQ,GAAUlnB,GAAO,SAASk5B,EAAU7B,GACnC,IAAK5O,GAAS+O,EAAMH,KACfoP,IAAavN,GAAYrB,EAAU4O,EAAUvN,EAAU9G,EAASC,EAAYC,IAC/E,OAAOkF,EAAKpqC,KAAKiqC,MAEjB,CACN94B,GAAS,EACT,YAEG,GACDkoC,IAAavN,IACXrB,EAAU4O,EAAUvN,EAAU9G,EAASC,EAAYC,GACpD,CACL/zB,GAAS,EACT,OAKJ,OAFA+zB,EAAc,OAAEzM,GAChByM,EAAc,OAAEtyB,GACTzB,EA0KT,SAASikC,GAAStkC,GAChB,OAAO8+B,GAAYC,GAAS/+B,OArwL5BrD,EAqwL6C6rC,IAAUxoC,EAAO,IAUhE,SAASo2B,GAAWnqC,GAClB,OAAOqsC,GAAersC,EAAQghC,GAAMkI,IAWtC,SAASgB,GAAalqC,GACpB,OAAOqsC,GAAersC,EAAQgpC,GAAQF,IAUxC,IAAI8P,GAAW/U,GAAiB,SAAS9vB,GACvC,OAAO8vB,GAAQ1kC,IAAI4U,IADIunC,GAWzB,SAAS5C,GAAY3kC,GAKnB,IAJA,IAAIK,EAAUL,EAAKlV,KAAO,GACtB68B,EAAQoI,GAAU1vB,GAClBxS,EAASzB,GAAe1B,KAAKqlC,GAAW1vB,GAAUsnB,EAAM95B,OAAS,EAE9DA,KAAU,CACf,IAAIiE,EAAO61B,EAAM95B,GACb46C,EAAY32C,EAAKkO,KACrB,GAAiB,MAAbyoC,GAAqBA,GAAazoC,EACpC,OAAOlO,EAAKhH,KAGhB,OAAOuV,EAUT,SAASolC,GAAUzlC,GAEjB,OADa5T,GAAe1B,KAAK+lC,GAAQ,eAAiBA,GAASzwB,GACrD+qB,YAchB,SAAS4S,KACP,IAAIt9B,EAASowB,GAAO5I,UAAYA,GAEhC,OADAxnB,EAASA,IAAWwnB,GAAW+T,GAAev7B,EACvCzQ,UAAU/B,OAASwS,EAAOzQ,UAAU,GAAIA,UAAU,IAAMyQ,EAWjE,SAAS22B,GAAW7gC,EAAKrK,GACvB,IAgYiBN,EACbmD,EAjYAmD,EAAOqE,EAAI67B,SACf,OAiYgB,WADZrjC,SADanD,EA/XAM,KAiYmB,UAAR6C,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVnD,EACU,OAAVA,GAlYDsG,EAAmB,iBAAPhG,EAAkB,SAAW,QACzCgG,EAAKqE,IAUX,SAASqmC,GAAavwC,GAIpB,IAHA,IAAIoU,EAAS4sB,GAAKhhC,GACd4B,EAASwS,EAAOxS,OAEbA,KAAU,CACf,IAAI/B,EAAMuU,EAAOxS,GACbrC,EAAQS,EAAOH,GAEnBuU,EAAOxS,GAAU,CAAC/B,EAAKN,EAAOmxC,GAAmBnxC,IAEnD,OAAO6U,EAWT,SAAS8tB,GAAUliC,EAAQH,GACzB,IAAIN,EAlxJR,SAAkBS,EAAQH,GACxB,OAAiB,MAAVG,OAxnCL0Q,EAwnCkC1Q,EAAOH,GAixJ7B48C,CAASz8C,EAAQH,GAC7B,OAAO6vC,GAAanwC,GAASA,OA14L7BmR,EA+6LF,IAAIw4B,GAAczG,GAA+B,SAASziC,GACxD,OAAc,MAAVA,EACK,IAETA,EAAShB,GAAOgB,GACTk8B,GAAYuG,GAAiBziC,IAAS,SAAS8pC,GACpD,OAAOlI,GAAqBnjC,KAAKuB,EAAQ8pC,QANR4S,GAiBjC5T,GAAgBrG,GAA+B,SAASziC,GAE1D,IADA,IAAIoU,EAAS,GACNpU,GACLy8B,GAAUroB,EAAQ80B,GAAWlpC,IAC7BA,EAASyhC,GAAazhC,GAExB,OAAOoU,GAN8BsoC,GAgBnChU,GAAS8D,GA2Eb,SAASmQ,GAAQ38C,EAAQyrB,EAAMmxB,GAO7B,IAJA,IAAI76C,GAAS,EACTH,GAHJ6pB,EAAO0gB,GAAS1gB,EAAMzrB,IAGJ4B,OACdwS,GAAS,IAEJrS,EAAQH,GAAQ,CACvB,IAAI/B,EAAMusC,GAAM3gB,EAAK1pB,IACrB,KAAMqS,EAAmB,MAAVpU,GAAkB48C,EAAQ58C,EAAQH,IAC/C,MAEFG,EAASA,EAAOH,GAElB,OAAIuU,KAAYrS,GAASH,EAChBwS,KAETxS,EAAmB,MAAV5B,EAAiB,EAAIA,EAAO4B,SAClBi7C,GAASj7C,IAAW6kC,GAAQ5mC,EAAK+B,KACjDD,GAAQ3B,IAAWqmC,GAAYrmC,IA6BpC,SAAS6oC,GAAgB7oC,GACvB,MAAqC,mBAAtBA,EAAOiH,aAA8B+oC,GAAYhwC,GAE5D,GADA4kC,GAAWnD,GAAazhC,IA8E9B,SAAS4rC,GAAcrsC,GACrB,OAAOoC,GAAQpC,IAAU8mC,GAAY9mC,OAChCsiC,IAAoBtiC,GAASA,EAAMsiC,KAW1C,SAAS4E,GAAQlnC,EAAOqC,GACtB,IAAIc,SAAcnD,EAGlB,SAFAqC,EAAmB,MAAVA,EAhnMU,iBAgnM0BA,KAGlC,UAARc,GACU,UAARA,GAAoBo1B,GAAS9hB,KAAKzW,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQqC,EAajD,SAAS81C,GAAen4C,EAAOwC,EAAO/B,GACpC,IAAKwV,GAASxV,GACZ,OAAO,EAET,IAAI0C,SAAcX,EAClB,SAAY,UAARW,EACK4tC,GAAYtwC,IAAWymC,GAAQ1kC,EAAO/B,EAAO4B,QACrC,UAARc,GAAoBX,KAAS/B,IAE7BknC,GAAGlnC,EAAO+B,GAAQxC,GAa7B,SAASkxC,GAAMlxC,EAAOS,GACpB,GAAI2B,GAAQpC,GACV,OAAO,EAET,IAAImD,SAAcnD,EAClB,QAAY,UAARmD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATnD,IAAiBqW,GAASrW,MAGvBw3B,EAAc/gB,KAAKzW,KAAWu3B,EAAa9gB,KAAKzW,IAC1C,MAAVS,GAAkBT,KAASP,GAAOgB,IAyBvC,SAAS64C,GAAW9kC,GAClB,IAAI4kC,EAAWD,GAAY3kC,GACvB8B,EAAQ2uB,GAAOmU,GAEnB,GAAoB,mBAAT9iC,KAAyB8iC,KAAYlU,GAAYvkC,WAC1D,OAAO,EAET,GAAI6T,IAAS8B,EACX,OAAO,EAET,IAAIhQ,EAAO+yC,GAAQ/iC,GACnB,QAAShQ,GAAQkO,IAASlO,EAAK,IA7S5B09B,IAAYmF,GAAO,IAAInF,GAAS,IAAIuZ,YAAY,MAAQrnB,GACxD+N,IAAOkF,GAAO,IAAIlF,KAAQxO,GAC1ByO,IAv3LU,oBAu3LCiF,GAAOjF,GAAQsZ,YAC1BrZ,IAAOgF,GAAO,IAAIhF,KAAQtO,GAC1BuO,IAAW+E,GAAO,IAAI/E,KAAYpO,KACrCmT,GAAS,SAASnpC,GAChB,IAAI6U,EAASo4B,GAAWjtC,GACpB6pC,EAAOh1B,GAAU8gB,EAAY31B,EAAM0H,iBA19LzCyJ,EA29LMssC,EAAa5T,EAAOpF,GAASoF,GAAQ,GAEzC,GAAI4T,EACF,OAAQA,GACN,KAAKjZ,GAAoB,OAAOtO,EAChC,KAAKwO,GAAe,OAAOjP,EAC3B,KAAKkP,GAAmB,MAn4LjB,mBAo4LP,KAAKC,GAAe,OAAO/O,EAC3B,KAAKgP,GAAmB,OAAO7O,EAGnC,OAAOnhB,IA+SX,IAAI6oC,GAAarc,GAAaqL,GAAaiR,GAS3C,SAASlN,GAAYzwC,GACnB,IAAI6pC,EAAO7pC,GAASA,EAAM0H,YAG1B,OAAO1H,KAFqB,mBAAR6pC,GAAsBA,EAAKlpC,WAAcygC,IAa/D,SAAS+P,GAAmBnxC,GAC1B,OAAOA,GAAUA,IAAUiW,GAASjW,GAYtC,SAASixC,GAAwB3wC,EAAK2vC,GACpC,OAAO,SAASxvC,GACd,OAAc,MAAVA,IAGGA,EAAOH,KAAS2vC,SA/zMzB9+B,IAg0MK8+B,GAA2B3vC,KAAOb,GAAOgB,MAsIhD,SAAS8yC,GAAS/+B,EAAM6+B,EAAOpuB,GAE7B,OADAouB,EAAQl/B,QAv8MRhD,IAu8MkBkiC,EAAuB7+B,EAAKnS,OAAS,EAAKgxC,EAAO,GAC5D,WAML,IALA,IAAIlvC,EAAOC,UACP5B,GAAS,EACTH,EAAS8R,GAAUhQ,EAAK9B,OAASgxC,EAAO,GACxClX,EAAQ76B,EAAMe,KAETG,EAAQH,GACf85B,EAAM35B,GAAS2B,EAAKkvC,EAAQ7wC,GAE9BA,GAAS,EAET,IADA,IAAIo7C,EAAYt8C,EAAM+xC,EAAQ,KACrB7wC,EAAQ6wC,GACfuK,EAAUp7C,GAAS2B,EAAK3B,GAG1B,OADAo7C,EAAUvK,GAASpuB,EAAUkX,GACtB53B,GAAMiQ,EAAMpR,KAAMw6C,IAY7B,SAAS58C,GAAOP,EAAQyrB,GACtB,OAAOA,EAAK7pB,OAAS,EAAI5B,EAASksC,GAAQlsC,EAAQszC,GAAU7nB,EAAM,GAAI,IAaxE,SAASmuB,GAAQle,EAAOld,GAKtB,IAJA,IAAI49B,EAAY1gB,EAAM95B,OAClBA,EAAS+R,GAAU6K,EAAQ5c,OAAQw6C,GACnCgB,EAAWtW,GAAUpL,GAElB95B,KAAU,CACf,IAAIG,EAAQyc,EAAQ5c,GACpB85B,EAAM95B,GAAU6kC,GAAQ1kC,EAAOq6C,GAAagB,EAASr7C,QAx/MvD2O,EA0/MA,OAAOgrB,EAWT,SAASqV,GAAQ/wC,EAAQH,GACvB,IAAY,gBAARA,GAAgD,mBAAhBG,EAAOH,KAIhC,aAAPA,EAIJ,OAAOG,EAAOH,GAiBhB,IAAIm7C,GAAUqC,GAASnK,IAUnBrvC,GAAaw+B,IAAiB,SAAStuB,EAAMC,GAC/C,OAAOV,GAAKzP,WAAWkQ,EAAMC,IAW3B6+B,GAAcwK,GAASlK,IAY3B,SAAS8H,GAAgBxC,EAAS6E,EAAWrV,GAC3C,IAAIxR,EAAU6mB,EAAY,GAC1B,OAAOzK,GAAY4F,EA1brB,SAA2BhiB,EAAQ8mB,GACjC,IAAI37C,EAAS27C,EAAQ37C,OACrB,IAAKA,EACH,OAAO60B,EAET,IAAIrK,EAAYxqB,EAAS,EAGzB,OAFA27C,EAAQnxB,IAAcxqB,EAAS,EAAI,KAAO,IAAM27C,EAAQnxB,GACxDmxB,EAAUA,EAAQj8B,KAAK1f,EAAS,EAAI,KAAO,KACpC60B,EAAOpyB,QAAQgzB,EAAe,uBAAyBkmB,EAAU,UAkb5CC,CAAkB/mB,EAqHhD,SAA2B8mB,EAAStV,GAOlC,OANAnM,GAAUtH,GAAW,SAAS6mB,GAC5B,IAAI97C,EAAQ,KAAO87C,EAAK,GACnBpT,EAAUoT,EAAK,KAAQjf,GAAcmhB,EAASh+C,IACjDg+C,EAAQt6C,KAAK1D,MAGVg+C,EAAQ3L,OA5HuC6L,CAtjBxD,SAAwBhnB,GACtB,IAAInyB,EAAQmyB,EAAOnyB,MAAMgzB,GACzB,OAAOhzB,EAAQA,EAAM,GAAGy7B,MAAMxI,GAAkB,GAojBwBmmB,CAAejnB,GAASwR,KAYlG,SAASoV,GAAStpC,GAChB,IAAIqZ,EAAQ,EACRuwB,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ3a,KACR4a,EApiNK,IAoiNmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMzwB,GAziNE,IA0iNN,OAAOzpB,UAAU,QAGnBypB,EAAQ,EAEV,OAAOrZ,EAAKjQ,WA/lNd4M,EA+lN+B/M,YAYjC,SAASkjC,GAAYnL,EAAO9wB,GAC1B,IAAI7I,GAAS,EACTH,EAAS85B,EAAM95B,OACfwqB,EAAYxqB,EAAS,EAGzB,IADAgJ,OAhnNA8F,IAgnNO9F,EAAqBhJ,EAASgJ,IAC5B7I,EAAQ6I,GAAM,CACrB,IAAIkzC,EAAOnX,GAAW5kC,EAAOqqB,GACzB7sB,EAAQm8B,EAAMoiB,GAElBpiB,EAAMoiB,GAAQpiB,EAAM35B,GACpB25B,EAAM35B,GAASxC,EAGjB,OADAm8B,EAAM95B,OAASgJ,EACR8wB,EAUT,IAAIka,GAvTJ,SAAuB7hC,GACrB,IAAIK,EAAS2pC,GAAQhqC,GAAM,SAASlU,GAIlC,OAh0MiB,MA6zMb0+B,EAAM3zB,MACR2zB,EAAM3P,QAED/uB,KAGL0+B,EAAQnqB,EAAOmqB,MACnB,OAAOnqB,EA8SU4pC,EAAc,SAAS/f,GACxC,IAAI7pB,EAAS,GAOb,OAN6B,KAAzB6pB,EAAOggB,WAAW,IACpB7pC,EAAOnR,KAAK,IAEdg7B,EAAO55B,QAAQ2yB,GAAY,SAAS1yB,EAAO6H,EAAQ+xC,EAAOC,GACxD/pC,EAAOnR,KAAKi7C,EAAQC,EAAU95C,QAAQqzB,GAAc,MAASvrB,GAAU7H,MAElE8P,KAUT,SAASg4B,GAAM7sC,GACb,GAAoB,iBAATA,GAAqBqW,GAASrW,GACvC,OAAOA,EAET,IAAI6U,EAAU7U,EAAQ,GACtB,MAAkB,KAAV6U,GAAkB,EAAI7U,IAjmNnB,IAimN0C,KAAO6U,EAU9D,SAAS4vB,GAASjwB,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO8sB,GAAapiC,KAAKsV,GACzB,MAAO8F,IACT,IACE,OAAQ9F,EAAO,GACf,MAAO8F,KAEX,MAAO,GA4BT,SAAS8qB,GAAa8T,GACpB,GAAIA,aAAmBhU,GACrB,OAAOgU,EAAQ2F,QAEjB,IAAIhqC,EAAS,IAAIswB,GAAc+T,EAAQ1T,YAAa0T,EAAQxT,WAI5D,OAHA7wB,EAAO4wB,YAAc8B,GAAU2R,EAAQzT,aACvC5wB,EAAO8wB,UAAauT,EAAQvT,UAC5B9wB,EAAO+wB,WAAasT,EAAQtT,WACrB/wB,EAsIT,IAAIiqC,GAAa1L,IAAS,SAASjX,EAAOgB,GACxC,OAAOwU,GAAkBxV,GACrB4O,GAAe5O,EAAO+P,GAAY/O,EAAQ,EAAGwU,IAAmB,IAChE,MA6BFoN,GAAe3L,IAAS,SAASjX,EAAOgB,GAC1C,IAAId,EAAW2R,GAAK7Q,GAIpB,OAHIwU,GAAkBtV,KACpBA,OA13NFlrB,GA43NOwgC,GAAkBxV,GACrB4O,GAAe5O,EAAO+P,GAAY/O,EAAQ,EAAGwU,IAAmB,GAAOQ,GAAY9V,EAAU,IAC7F,MA0BF2iB,GAAiB5L,IAAS,SAASjX,EAAOgB,GAC5C,IAAIH,EAAagR,GAAK7Q,GAItB,OAHIwU,GAAkB3U,KACpBA,OA35NF7rB,GA65NOwgC,GAAkBxV,GACrB4O,GAAe5O,EAAO+P,GAAY/O,EAAQ,EAAGwU,IAAmB,QA95NpExgC,EA85NsF6rB,GAClF,MAsON,SAASiiB,GAAU9iB,EAAOO,EAAWoB,GACnC,IAAIz7B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIG,EAAqB,MAAbs7B,EAAoB,EAAI+d,GAAU/d,GAI9C,OAHIt7B,EAAQ,IACVA,EAAQ2R,GAAU9R,EAASG,EAAO,IAE7Bq7B,GAAc1B,EAAOgW,GAAYzV,EAAW,GAAIl6B,GAsCzD,SAAS08C,GAAc/iB,EAAOO,EAAWoB,GACvC,IAAIz7B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIG,EAAQH,EAAS,EAOrB,YAhsOA8O,IA0rOI2sB,IACFt7B,EAAQq5C,GAAU/d,GAClBt7B,EAAQs7B,EAAY,EAChB3pB,GAAU9R,EAASG,EAAO,GAC1B4R,GAAU5R,EAAOH,EAAS,IAEzBw7B,GAAc1B,EAAOgW,GAAYzV,EAAW,GAAIl6B,GAAO,GAiBhE,SAASw6C,GAAQ7gB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAM95B,QACvB6pC,GAAY/P,EAAO,GAAK,GAgG1C,SAASgjB,GAAKhjB,GACZ,OAAQA,GAASA,EAAM95B,OAAU85B,EAAM,QApzOvChrB,EA83OF,IAAIiuC,GAAehM,IAAS,SAAS3F,GACnC,IAAI4R,EAASpiB,GAASwQ,EAAQ0I,IAC9B,OAAQkJ,EAAOh9C,QAAUg9C,EAAO,KAAO5R,EAAO,GAC1CD,GAAiB6R,GACjB,MA0BFC,GAAiBlM,IAAS,SAAS3F,GACrC,IAAIpR,EAAW2R,GAAKP,GAChB4R,EAASpiB,GAASwQ,EAAQ0I,IAO9B,OALI9Z,IAAa2R,GAAKqR,GACpBhjB,OAj6OFlrB,EAm6OEkuC,EAAO9T,MAED8T,EAAOh9C,QAAUg9C,EAAO,KAAO5R,EAAO,GAC1CD,GAAiB6R,EAAQlN,GAAY9V,EAAU,IAC/C,MAwBFkjB,GAAmBnM,IAAS,SAAS3F,GACvC,IAAIzQ,EAAagR,GAAKP,GAClB4R,EAASpiB,GAASwQ,EAAQ0I,IAM9B,OAJAnZ,EAAkC,mBAAdA,EAA2BA,OAn8O/C7rB,IAq8OEkuC,EAAO9T,MAED8T,EAAOh9C,QAAUg9C,EAAO,KAAO5R,EAAO,GAC1CD,GAAiB6R,OAx8OrBluC,EAw8OwC6rB,GACpC,MAoCN,SAASgR,GAAK7R,GACZ,IAAI95B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAOA,EAAS85B,EAAM95B,EAAS,QA/+O/B8O,EAskPF,IAAIquC,GAAOpM,GAASqM,IAsBpB,SAASA,GAAQtjB,EAAOgB,GACtB,OAAQhB,GAASA,EAAM95B,QAAU86B,GAAUA,EAAO96B,OAC9C2wC,GAAY7W,EAAOgB,GACnBhB,EAqFN,IAAIujB,GAAS5G,IAAS,SAAS3c,EAAOld,GACpC,IAAI5c,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACnCwS,EAASuzB,GAAOjM,EAAOld,GAM3B,OAJAg0B,GAAW9W,EAAOc,GAAShe,GAAS,SAASzc,GAC3C,OAAO0kC,GAAQ1kC,EAAOH,IAAWG,EAAQA,KACxC6vC,KAAKM,KAED99B,KA2ET,SAASkvB,GAAQ5H,GACf,OAAgB,MAATA,EAAgBA,EAAQ2H,GAAc5kC,KAAKi9B,GAkapD,IAAIwjB,GAAQvM,IAAS,SAAS3F,GAC5B,OAAO4H,GAASnJ,GAAYuB,EAAQ,EAAGkE,IAAmB,OA0BxDiO,GAAUxM,IAAS,SAAS3F,GAC9B,IAAIpR,EAAW2R,GAAKP,GAIpB,OAHIkE,GAAkBtV,KACpBA,OAxsQFlrB,GA0sQOkkC,GAASnJ,GAAYuB,EAAQ,EAAGkE,IAAmB,GAAOQ,GAAY9V,EAAU,OAwBrFwjB,GAAYzM,IAAS,SAAS3F,GAChC,IAAIzQ,EAAagR,GAAKP,GAEtB,OADAzQ,EAAkC,mBAAdA,EAA2BA,OApuQ/C7rB,EAquQOkkC,GAASnJ,GAAYuB,EAAQ,EAAGkE,IAAmB,QAruQ1DxgC,EAquQ4E6rB,MAgG9E,SAAS8iB,GAAM3jB,GACb,IAAMA,IAASA,EAAM95B,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANA85B,EAAQQ,GAAYR,GAAO,SAAS4jB,GAClC,GAAIpO,GAAkBoO,GAEpB,OADA19C,EAAS8R,GAAU4rC,EAAM19C,OAAQA,IAC1B,KAGJm8B,GAAUn8B,GAAQ,SAASG,GAChC,OAAOy6B,GAASd,EAAOuB,GAAal7B,OAyBxC,SAASw9C,GAAU7jB,EAAOE,GACxB,IAAMF,IAASA,EAAM95B,OACnB,MAAO,GAET,IAAIwS,EAASirC,GAAM3jB,GACnB,OAAgB,MAAZE,EACKxnB,EAEFooB,GAASpoB,GAAQ,SAASkrC,GAC/B,OAAOx7C,GAAM83B,OAn3QflrB,EAm3QoC4uC,MAwBtC,IAAIE,GAAU7M,IAAS,SAASjX,EAAOgB,GACrC,OAAOwU,GAAkBxV,GACrB4O,GAAe5O,EAAOgB,GACtB,MAqBF+iB,GAAM9M,IAAS,SAAS3F,GAC1B,OAAOsI,GAAQpZ,GAAY8Q,EAAQkE,QA0BjCwO,GAAQ/M,IAAS,SAAS3F,GAC5B,IAAIpR,EAAW2R,GAAKP,GAIpB,OAHIkE,GAAkBtV,KACpBA,OAj8QFlrB,GAm8QO4kC,GAAQpZ,GAAY8Q,EAAQkE,IAAoBQ,GAAY9V,EAAU,OAwB3E+jB,GAAUhN,IAAS,SAAS3F,GAC9B,IAAIzQ,EAAagR,GAAKP,GAEtB,OADAzQ,EAAkC,mBAAdA,EAA2BA,OA79Q/C7rB,EA89QO4kC,GAAQpZ,GAAY8Q,EAAQkE,SA99QnCxgC,EA89QkE6rB,MAmBhEqjB,GAAMjN,GAAS0M,IA6DnB,IAAIQ,GAAUlN,IAAS,SAAS3F,GAC9B,IAAIprC,EAASorC,EAAOprC,OAChBg6B,EAAWh6B,EAAS,EAAIorC,EAAOprC,EAAS,QAhjR5C8O,EAmjRA,OADAkrB,EAA8B,mBAAZA,GAA0BoR,EAAOlC,MAAOlP,QAljR1DlrB,EAmjRO6uC,GAAUvS,EAAQpR,MAkC3B,SAASkkB,GAAMvgD,GACb,IAAI6U,EAASowB,GAAOjlC,GAEpB,OADA6U,EAAO6wB,WAAY,EACZ7wB,EAsDT,SAASokC,GAAKj5C,EAAOwgD,GACnB,OAAOA,EAAYxgD,GAmBrB,IAAIygD,GAAY3H,IAAS,SAASzQ,GAChC,IAAIhmC,EAASgmC,EAAMhmC,OACfgxC,EAAQhxC,EAASgmC,EAAM,GAAK,EAC5BroC,EAAQoD,KAAKoiC,YACbgb,EAAc,SAAS//C,GAAU,OAAO2nC,GAAO3nC,EAAQ4nC,IAE3D,QAAIhmC,EAAS,GAAKe,KAAKqiC,YAAYpjC,SAC7BrC,aAAiBklC,IAAiBgC,GAAQmM,KAGhDrzC,EAAQA,EAAMuB,MAAM8xC,GAAQA,GAAShxC,EAAS,EAAI,KAC5CojC,YAAY/hC,KAAK,CACrB,KAAQu1C,GACR,KAAQ,CAACuH,GACT,aAhrRFrvC,IAkrRO,IAAIg0B,GAAcnlC,EAAOoD,KAAKsiC,WAAWuT,MAAK,SAAS9c,GAI5D,OAHI95B,IAAW85B,EAAM95B,QACnB85B,EAAMz4B,UAprRVyN,GAsrRSgrB,MAZA/4B,KAAK61C,KAAKuH,MA+PrB,IAAIE,GAAU7I,IAAiB,SAAShjC,EAAQ7U,EAAOM,GACjDM,GAAe1B,KAAK2V,EAAQvU,KAC5BuU,EAAOvU,GAETsnC,GAAgB/yB,EAAQvU,EAAK,MAuIjC,IAAIqgD,GAAOhI,GAAWsG,IAqBlB2B,GAAWjI,GAAWuG,IA2G1B,SAAS17C,GAAQge,EAAY6a,GAE3B,OADWj6B,GAAQof,GAAc+a,GAAY0L,IACjCzmB,EAAY2wB,GAAY9V,EAAU,IAuBhD,SAASwkB,GAAar/B,EAAY6a,GAEhC,OADWj6B,GAAQof,GAAcgb,GAAiBqP,IACtCrqB,EAAY2wB,GAAY9V,EAAU,IA0BhD,IAAIykB,GAAUjJ,IAAiB,SAAShjC,EAAQ7U,EAAOM,GACjDM,GAAe1B,KAAK2V,EAAQvU,GAC9BuU,EAAOvU,GAAKoD,KAAK1D,GAEjB4nC,GAAgB/yB,EAAQvU,EAAK,CAACN,OAsElC,IAAI+gD,GAAY3N,IAAS,SAAS5xB,EAAY0K,EAAM/nB,GAClD,IAAI3B,GAAS,EACT4mC,EAAwB,mBAARld,EAChBrX,EAASk8B,GAAYvvB,GAAclgB,EAAMkgB,EAAWnf,QAAU,GAKlE,OAHA4lC,GAASzmB,GAAY,SAASxhB,GAC5B6U,IAASrS,GAAS4mC,EAAS7kC,GAAM2nB,EAAMlsB,EAAOmE,GAAQ4pC,GAAW/tC,EAAOksB,EAAM/nB,MAEzE0Q,KA+BLmsC,GAAQnJ,IAAiB,SAAShjC,EAAQ7U,EAAOM,GACnDsnC,GAAgB/yB,EAAQvU,EAAKN,MA6C/B,SAAS2K,GAAI6W,EAAY6a,GAEvB,OADWj6B,GAAQof,GAAcyb,GAAW6T,IAChCtvB,EAAY2wB,GAAY9V,EAAU,IAkFhD,IAAI4kB,GAAYpJ,IAAiB,SAAShjC,EAAQ7U,EAAOM,GACvDuU,EAAOvU,EAAM,EAAI,GAAGoD,KAAK1D,MACxB,WAAa,MAAO,CAAC,GAAI,OAmS5B,IAAIkhD,GAAS9N,IAAS,SAAS5xB,EAAYywB,GACzC,GAAkB,MAAdzwB,EACF,MAAO,GAET,IAAInf,EAAS4vC,EAAU5vC,OAMvB,OALIA,EAAS,GAAK81C,GAAe32B,EAAYywB,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACH5vC,EAAS,GAAK81C,GAAelG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYxwB,EAAY0qB,GAAY+F,EAAW,GAAI,OAqBxD59B,GAAMwuB,IAAU,WAClB,OAAO9uB,GAAKO,KAAKD,OA0DnB,SAAS9R,GAAIiS,EAAMhU,EAAG03C,GAGpB,OAFA13C,EAAI03C,OA51TJ/mC,EA41TwB3Q,EAEjB07C,GAAW1nC,EAvzTF,SAvChBrD,uBA61TA3Q,EAAKgU,GAAa,MAALhU,EAAagU,EAAKnS,OAAS7B,GAqB1C,SAAS2gD,GAAO3gD,EAAGgU,GACjB,IAAIK,EACJ,GAAmB,mBAARL,EACT,MAAM,IAAIY,GAAU2f,GAGtB,OADAv0B,EAAIq7C,GAAUr7C,GACP,WAOL,QANMA,EAAI,IACRqU,EAASL,EAAKjQ,MAAMnB,KAAMgB,YAExB5D,GAAK,IACPgU,OA73TJrD,GA+3TS0D,GAuCX,IAAItU,GAAO6yC,IAAS,SAAS5+B,EAAMe,EAASuhC,GAC1C,IAAIpO,EAv4Ta,EAw4TjB,GAAIoO,EAASz0C,OAAQ,CACnB,IAAI00C,EAAU/W,GAAe8W,EAAUmD,GAAU15C,KACjDmoC,GAr4TkB,GAu4TpB,OAAOwT,GAAW1nC,EAAMk0B,EAASnzB,EAASuhC,EAAUC,MAgDlDqK,GAAUhO,IAAS,SAAS3yC,EAAQH,EAAKw2C,GAC3C,IAAIpO,EAAU2Y,EACd,GAAIvK,EAASz0C,OAAQ,CACnB,IAAI00C,EAAU/W,GAAe8W,EAAUmD,GAAUmH,KACjD1Y,GA37TkB,GA67TpB,OAAOwT,GAAW57C,EAAKooC,EAASjoC,EAAQq2C,EAAUC,MAsJpD,SAASxiC,GAASC,EAAMC,EAAM3O,GAC5B,IAAI4O,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,EAEf,GAAmB,mBAARX,EACT,MAAM,IAAIY,GAAU2f,GAUtB,SAAS1f,EAAWC,GAClB,IAAInR,EAAOuQ,EACPa,EAAUZ,EAKd,OAHAD,EAAWC,OAnpUbxD,EAopUE6D,EAAiBM,EACjBT,EAASL,EAAKjQ,MAAMgR,EAASpR,GAI/B,SAASqR,EAAYF,GAMnB,OAJAN,EAAiBM,EAEjBR,EAAUxQ,GAAWmR,EAAchB,GAE5BQ,EAAUI,EAAWC,GAAQT,EAatC,SAASa,EAAaJ,GACpB,IAAIK,EAAoBL,EAAOP,EAM/B,YAnrUF5D,IAmrUU4D,GAA+BY,GAAqBlB,GACzDkB,EAAoB,GAAOT,GANJI,EAAON,GAM8BJ,EAGjE,SAASa,IACP,IAAIH,EAAOjB,KACX,GAAIqB,EAAaJ,GACf,OAAOM,EAAaN,GAGtBR,EAAUxQ,GAAWmR,EA3BvB,SAAuBH,GACrB,IAEIgsC,EAAc7sC,GAFMa,EAAOP,GAI/B,OAAOG,EACHd,GAAUktC,EAAa1sC,GAJDU,EAAON,IAK7BssC,EAoB+BzrC,CAAcP,IAGnD,SAASM,EAAaN,GAKpB,OAJAR,OAjsUF3D,EAqsUMgE,GAAYT,EACPW,EAAWC,IAEpBZ,EAAWC,OAxsUbxD,EAysUS0D,GAeT,SAASiB,IACP,IAAIR,EAAOjB,KACP0B,EAAaL,EAAaJ,GAM9B,GAJAZ,EAAWtQ,UACXuQ,EAAWvR,KACX2R,EAAeO,EAEXS,EAAY,CACd,QAjuUJ5E,IAiuUQ2D,EACF,OAAOU,EAAYT,GAErB,GAAIG,EAIF,OAFAhR,GAAa4Q,GACbA,EAAUxQ,GAAWmR,EAAchB,GAC5BY,EAAWN,GAMtB,YA9uUF5D,IA2uUM2D,IACFA,EAAUxQ,GAAWmR,EAAchB,IAE9BI,EAIT,OA3GAJ,EAAOuB,GAASvB,IAAS,EACrBwB,GAASnQ,KACXmP,IAAYnP,EAAQmP,QAEpBL,GADAM,EAAS,YAAapP,GACHqO,GAAU6B,GAASlQ,EAAQ8O,UAAY,EAAGH,GAAQG,EACrEO,EAAW,aAAcrP,IAAYA,EAAQqP,SAAWA,GAoG1DW,EAAUI,OApCV,gBA5sUA/E,IA6sUM2D,GACF5Q,GAAa4Q,GAEfE,EAAiB,EACjBN,EAAWK,EAAeJ,EAAWG,OAjtUvC3D,GAivUA2E,EAAUK,MA7BV,WACE,YArtUFhF,IAqtUS2D,EAAwBD,EAASe,EAAavB,OA6BhDyB,EAqBT,IAAIyrC,GAAQnO,IAAS,SAAS5+B,EAAMrQ,GAClC,OAAO2mC,GAAUt2B,EAAM,EAAGrQ,MAsBxBq9C,GAAQpO,IAAS,SAAS5+B,EAAMC,EAAMtQ,GACxC,OAAO2mC,GAAUt2B,EAAMwB,GAASvB,IAAS,EAAGtQ,MAqE9C,SAASq6C,GAAQhqC,EAAMitC,GACrB,GAAmB,mBAARjtC,GAAmC,MAAZitC,GAAuC,mBAAZA,EAC3D,MAAM,IAAIrsC,GAAU2f,GAEtB,IAAI2sB,EAAW,WACb,IAAIv9C,EAAOC,UACP9D,EAAMmhD,EAAWA,EAASl9C,MAAMnB,KAAMe,GAAQA,EAAK,GACnD66B,EAAQ0iB,EAAS1iB,MAErB,GAAIA,EAAMC,IAAI3+B,GACZ,OAAO0+B,EAAMp/B,IAAIU,GAEnB,IAAIuU,EAASL,EAAKjQ,MAAMnB,KAAMe,GAE9B,OADAu9C,EAAS1iB,MAAQA,EAAMkB,IAAI5/B,EAAKuU,IAAWmqB,EACpCnqB,GAGT,OADA6sC,EAAS1iB,MAAQ,IAAKwf,GAAQmD,OAASrb,IAChCob,EA0BT,SAASE,GAAOllB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAItnB,GAAU2f,GAEtB,OAAO,WACL,IAAI5wB,EAAOC,UACX,OAAQD,EAAK9B,QACX,KAAK,EAAG,OAAQq6B,EAAUx9B,KAAKkE,MAC/B,KAAK,EAAG,OAAQs5B,EAAUx9B,KAAKkE,KAAMe,EAAK,IAC1C,KAAK,EAAG,OAAQu4B,EAAUx9B,KAAKkE,KAAMe,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQu4B,EAAUx9B,KAAKkE,KAAMe,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQu4B,EAAUn4B,MAAMnB,KAAMe,IAlClCq6C,GAAQmD,MAAQrb,GA2FhB,IAAIub,GAAWvL,IAAS,SAAS9hC,EAAMstC,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWz/C,QAAeD,GAAQ0/C,EAAW,IACvD7kB,GAAS6kB,EAAW,GAAIljB,GAAUuT,OAClClV,GAASiP,GAAY4V,EAAY,GAAIljB,GAAUuT,QAEtB9vC,OAC7B,OAAO+wC,IAAS,SAASjvC,GAIvB,IAHA,IAAI3B,GAAS,EACTH,EAAS+R,GAAUjQ,EAAK9B,OAAQ0/C,KAE3Bv/C,EAAQH,GACf8B,EAAK3B,GAASs/C,EAAWt/C,GAAOtD,KAAKkE,KAAMe,EAAK3B,IAElD,OAAO+B,GAAMiQ,EAAMpR,KAAMe,SAqCzB69C,GAAU5O,IAAS,SAAS5+B,EAAMsiC,GAEpC,OAAOoF,GAAW1nC,EAn+UE,QArCpBrD,EAwgVsD2lC,EADxC9W,GAAe8W,EAAUmD,GAAU+H,SAoC/CC,GAAe7O,IAAS,SAAS5+B,EAAMsiC,GAEzC,OAAOoF,GAAW1nC,EAvgVQ,QAtC1BrD,EA6iV4D2lC,EAD9C9W,GAAe8W,EAAUmD,GAAUgI,SA0B/CC,GAAQpJ,IAAS,SAAStkC,EAAMyK,GAClC,OAAOi9B,GAAW1nC,EA/hVA,SAxClBrD,gBAukV0E8N,MAia5E,SAAS0oB,GAAG3nC,EAAOsW,GACjB,OAAOtW,IAAUsW,GAAUtW,GAAUA,GAASsW,GAAUA,EA0B1D,IAAI6rC,GAAK9G,GAA0BhO,IAyB/B+U,GAAM/G,IAA0B,SAASr7C,EAAOsW,GAClD,OAAOtW,GAASsW,KAqBdwwB,GAAcmH,GAAgB,WAAa,OAAO7pC,UAApB,IAAsC6pC,GAAkB,SAASjuC,GACjG,OAAOoW,GAAapW,IAAUY,GAAe1B,KAAKc,EAAO,YACtDqiC,GAAqBnjC,KAAKc,EAAO,WA0BlCoC,GAAUd,EAAMc,QAmBhBm5B,GAAgBD,GAAoBsD,GAAUtD,IA75PlD,SAA2Bt7B,GACzB,OAAOoW,GAAapW,IAAUitC,GAAWjtC,IAAUi2B,GAu7PrD,SAAS8a,GAAY/wC,GACnB,OAAgB,MAATA,GAAiBs9C,GAASt9C,EAAMqC,UAAYqqC,GAAW1sC,GA4BhE,SAAS2xC,GAAkB3xC,GACzB,OAAOoW,GAAapW,IAAU+wC,GAAY/wC,GA0C5C,IAAIqjC,GAAWD,IAAkBua,GAmB7BliB,GAASD,GAAaoD,GAAUpD,IAxgQpC,SAAoBx7B,GAClB,OAAOoW,GAAapW,IAAUitC,GAAWjtC,IAAUq1B,GA+qQrD,SAASgtB,GAAQriD,GACf,IAAKoW,GAAapW,GAChB,OAAO,EAET,IAAIkpC,EAAM+D,GAAWjtC,GACrB,OAAOkpC,GAAO5T,GA9yWF,yBA8yWc4T,GACC,iBAAjBlpC,EAAM2a,SAA4C,iBAAd3a,EAAMV,OAAqBsyC,GAAc5xC,GAkDzF,SAAS0sC,GAAW1sC,GAClB,IAAKiW,GAASjW,GACZ,OAAO,EAIT,IAAIkpC,EAAM+D,GAAWjtC,GACrB,OAAOkpC,GAAO3T,GAAW2T,GAAO1T,GA32WrB,0BA22W+B0T,GA/1W/B,kBA+1WkDA,EA6B/D,SAASoZ,GAAUtiD,GACjB,MAAuB,iBAATA,GAAqBA,GAAS67C,GAAU77C,GA6BxD,SAASs9C,GAASt9C,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAj8Wf,iBA69WrB,SAASiW,GAASjW,GAChB,IAAImD,SAAcnD,EAClB,OAAgB,MAATA,IAA0B,UAARmD,GAA4B,YAARA,GA2B/C,SAASiT,GAAapW,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAI27B,GAAQD,GAAYkD,GAAUlD,IA5xQlC,SAAmB17B,GACjB,OAAOoW,GAAapW,IAAUmpC,GAAOnpC,IAAUy1B,GA6+QjD,SAAS8sB,GAASviD,GAChB,MAAuB,iBAATA,GACXoW,GAAapW,IAAUitC,GAAWjtC,IAAU01B,EA+BjD,SAASkc,GAAc5xC,GACrB,IAAKoW,GAAapW,IAAUitC,GAAWjtC,IAAU21B,EAC/C,OAAO,EAET,IAAIptB,EAAQ25B,GAAaliC,GACzB,GAAc,OAAVuI,EACF,OAAO,EAET,IAAIshC,EAAOjpC,GAAe1B,KAAKqJ,EAAO,gBAAkBA,EAAMb,YAC9D,MAAsB,mBAARmiC,GAAsBA,aAAgBA,GAClDvI,GAAapiC,KAAK2qC,IAASjI,GAoB/B,IAAI/F,GAAWD,GAAegD,GAAUhD,IA59QxC,SAAsB57B,GACpB,OAAOoW,GAAapW,IAAUitC,GAAWjtC,IAAU41B,GA6gRrD,IAAImG,GAAQD,GAAY8C,GAAU9C,IAngRlC,SAAmB97B,GACjB,OAAOoW,GAAapW,IAAUmpC,GAAOnpC,IAAU61B,GAqhRjD,SAAS2sB,GAASxiD,GAChB,MAAuB,iBAATA,IACVoC,GAAQpC,IAAUoW,GAAapW,IAAUitC,GAAWjtC,IAAU81B,EAoBpE,SAASzf,GAASrW,GAChB,MAAuB,iBAATA,GACXoW,GAAapW,IAAUitC,GAAWjtC,IAAU+1B,EAoBjD,IAAIkG,GAAeD,GAAmB4C,GAAU5C,IAvjRhD,SAA0Bh8B,GACxB,OAAOoW,GAAapW,IAClBs9C,GAASt9C,EAAMqC,WAAao4B,GAAewS,GAAWjtC,KA6oR1D,IAAIyiD,GAAKpH,GAA0BxK,IAyB/B6R,GAAMrH,IAA0B,SAASr7C,EAAOsW,GAClD,OAAOtW,GAASsW,KA0BlB,SAASiL,GAAQvhB,GACf,IAAKA,EACH,MAAO,GAET,GAAI+wC,GAAY/wC,GACd,OAAOwiD,GAASxiD,GAASsgC,GAActgC,GAASunC,GAAUvnC,GAE5D,GAAIwiC,IAAexiC,EAAMwiC,IACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIn8B,EACAuO,EAAS,KAEJvO,EAAOm8B,EAASvyB,QAAQyyC,MAC/B9tC,EAAOnR,KAAK4C,EAAKtG,OAEnB,OAAO6U,EAg8VI+tC,CAAgB5iD,EAAMwiC,OAE/B,IAAI0G,EAAMC,GAAOnpC,GAGjB,OAFWkpC,GAAOzT,EAASoK,GAAcqJ,GAAOrT,EAASoK,GAAa9C,IAE1Dn9B,GA0Bd,SAASm7C,GAASn7C,GAChB,OAAKA,GAGLA,EAAQgW,GAAShW,MAzkYN,KA0kYeA,KA1kYf,IAEG,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAAS67C,GAAU77C,GACjB,IAAI6U,EAASsmC,GAASn7C,GAClB6iD,EAAYhuC,EAAS,EAEzB,OAAOA,GAAWA,EAAUguC,EAAYhuC,EAASguC,EAAYhuC,EAAU,EA8BzE,SAASiuC,GAAS9iD,GAChB,OAAOA,EAAQwnC,GAAUqU,GAAU77C,GAAQ,EAxoYxB,YAwoY+C,EA0BpE,SAASgW,GAAShW,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIqW,GAASrW,GACX,OA1qYI,IA4qYN,GAAIiW,GAASjW,GAAQ,CACnB,IAAIsW,EAAgC,mBAAjBtW,EAAMuW,QAAwBvW,EAAMuW,UAAYvW,EACnEA,EAAQiW,GAASK,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATtW,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQy+B,GAASz+B,GACjB,IAAIwW,EAAWhD,GAAWiD,KAAKzW,GAC/B,OAAQwW,GAAY/C,GAAUgD,KAAKzW,GAC/B0T,GAAa1T,EAAMuB,MAAM,GAAIiV,EAAW,EAAI,GAC3CjD,GAAWkD,KAAKzW,GAvrYf,KAurY+BA,EA2BvC,SAAS6xC,GAAc7xC,GACrB,OAAOmoC,GAAWnoC,EAAOypC,GAAOzpC,IAsDlC,SAASkU,GAASlU,GAChB,OAAgB,MAATA,EAAgB,GAAKo1C,GAAap1C,GAqC3C,IAAI+iD,GAAShL,IAAe,SAASt3C,EAAQy2B,GAC3C,GAAIuZ,GAAYvZ,IAAW6Z,GAAY7Z,GACrCiR,GAAWjR,EAAQuK,GAAKvK,GAASz2B,QAGnC,IAAK,IAAIH,KAAO42B,EACVt2B,GAAe1B,KAAKg4B,EAAQ52B,IAC9BunC,GAAYpnC,EAAQH,EAAK42B,EAAO52B,OAoClC0iD,GAAWjL,IAAe,SAASt3C,EAAQy2B,GAC7CiR,GAAWjR,EAAQuS,GAAOvS,GAASz2B,MAgCjCwiD,GAAelL,IAAe,SAASt3C,EAAQy2B,EAAQoa,EAAU3I,GACnER,GAAWjR,EAAQuS,GAAOvS,GAASz2B,EAAQkoC,MA+BzCua,GAAanL,IAAe,SAASt3C,EAAQy2B,EAAQoa,EAAU3I,GACjER,GAAWjR,EAAQuK,GAAKvK,GAASz2B,EAAQkoC,MAoBvCwa,GAAKrK,GAAS1Q,IA8DlB,IAAIzgC,GAAWyrC,IAAS,SAAS3yC,EAAQw3C,GACvCx3C,EAAShB,GAAOgB,GAEhB,IAAI+B,GAAS,EACTH,EAAS41C,EAAQ51C,OACjB61C,EAAQ71C,EAAS,EAAI41C,EAAQ,QA/iZjC9mC,EAqjZA,IAJI+mC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD71C,EAAS,KAGFG,EAAQH,GAMf,IALA,IAAI60B,EAAS+gB,EAAQz1C,GACjBs8B,EAAQ2K,GAAOvS,GACfksB,GAAc,EACdC,EAAcvkB,EAAMz8B,SAEf+gD,EAAaC,GAAa,CACjC,IAAI/iD,EAAMw+B,EAAMskB,GACZpjD,EAAQS,EAAOH,SA7jZvB6Q,IA+jZQnR,GACC2nC,GAAG3nC,EAAOohC,GAAY9gC,MAAUM,GAAe1B,KAAKuB,EAAQH,MAC/DG,EAAOH,GAAO42B,EAAO52B,IAK3B,OAAOG,KAsBL6iD,GAAelQ,IAAS,SAASjvC,GAEnC,OADAA,EAAKT,UA7lZLyN,EA6lZqBwrC,IACdp4C,GAAMg/C,QA9lZbpyC,EA8lZmChN,MAgSrC,SAASvE,GAAIa,EAAQyrB,EAAMyuB,GACzB,IAAI9lC,EAAmB,MAAVpU,OA/3Zb0Q,EA+3Z0Cw7B,GAAQlsC,EAAQyrB,GAC1D,YAh4ZA/a,IAg4ZO0D,EAAuB8lC,EAAe9lC,EA4D/C,SAASu8B,GAAM3wC,EAAQyrB,GACrB,OAAiB,MAAVzrB,GAAkB28C,GAAQ38C,EAAQyrB,EAAMqhB,IAqBjD,IAAIiW,GAASlJ,IAAe,SAASzlC,EAAQ7U,EAAOM,GACrC,MAATN,GACyB,mBAAlBA,EAAMkU,WACflU,EAAQ2hC,GAAqBziC,KAAKc,IAGpC6U,EAAO7U,GAASM,IACfuzC,GAASxD,KA4BRoT,GAAWnJ,IAAe,SAASzlC,EAAQ7U,EAAOM,GACvC,MAATN,GACyB,mBAAlBA,EAAMkU,WACflU,EAAQ2hC,GAAqBziC,KAAKc,IAGhCY,GAAe1B,KAAK2V,EAAQ7U,GAC9B6U,EAAO7U,GAAO0D,KAAKpD,GAEnBuU,EAAO7U,GAAS,CAACM,KAElB6xC,IAoBCuR,GAAStQ,GAASrF,IA8BtB,SAAStM,GAAKhhC,GACZ,OAAOswC,GAAYtwC,GAAUimC,GAAcjmC,GAAU+vC,GAAS/vC,GA0BhE,SAASgpC,GAAOhpC,GACd,OAAOswC,GAAYtwC,GAAUimC,GAAcjmC,GAAQ,GAAQiwC,GAAWjwC,GAuGxE,IAAIkjD,GAAQ5L,IAAe,SAASt3C,EAAQy2B,EAAQoa,GAClDD,GAAU5wC,EAAQy2B,EAAQoa,MAkCxBiS,GAAYxL,IAAe,SAASt3C,EAAQy2B,EAAQoa,EAAU3I,GAChE0I,GAAU5wC,EAAQy2B,EAAQoa,EAAU3I,MAuBlCib,GAAO9K,IAAS,SAASr4C,EAAQ4nC,GACnC,IAAIxzB,EAAS,GACb,GAAc,MAAVpU,EACF,OAAOoU,EAET,IAAIg0B,GAAS,EACbR,EAAQpL,GAASoL,GAAO,SAASnc,GAG/B,OAFAA,EAAO0gB,GAAS1gB,EAAMzrB,GACtBooC,IAAWA,EAAS3c,EAAK7pB,OAAS,GAC3B6pB,KAETic,GAAW1nC,EAAQkqC,GAAalqC,GAASoU,GACrCg0B,IACFh0B,EAAS4zB,GAAU5zB,EAAQgvC,EAAwDjH,KAGrF,IADA,IAAIv6C,EAASgmC,EAAMhmC,OACZA,KACL6wC,GAAUr+B,EAAQwzB,EAAMhmC,IAE1B,OAAOwS,KA4CT,IAAIksB,GAAO+X,IAAS,SAASr4C,EAAQ4nC,GACnC,OAAiB,MAAV5nC,EAAiB,GAnmT1B,SAAkBA,EAAQ4nC,GACxB,OAAOyK,GAAWryC,EAAQ4nC,GAAO,SAASroC,EAAOksB,GAC/C,OAAOklB,GAAM3wC,EAAQyrB,MAimTM43B,CAASrjD,EAAQ4nC,MAqBhD,SAAS0b,GAAOtjD,EAAQi8B,GACtB,GAAc,MAAVj8B,EACF,MAAO,GAET,IAAIq+B,EAAQ7B,GAAS0N,GAAalqC,IAAS,SAASqB,GAClD,MAAO,CAACA,MAGV,OADA46B,EAAYyV,GAAYzV,GACjBoW,GAAWryC,EAAQq+B,GAAO,SAAS9+B,EAAOksB,GAC/C,OAAOwQ,EAAU18B,EAAOksB,EAAK,OA4IjC,IAAI83B,GAAUhI,GAAcva,IA0BxBwiB,GAAYjI,GAAcvS,IA4K9B,SAAStM,GAAO18B,GACd,OAAiB,MAAVA,EAAiB,GAAKo+B,GAAWp+B,EAAQghC,GAAKhhC,IAkNvD,IAAIyjD,GAAY5L,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GAEtD,OADA2hD,EAAOA,EAAKj/C,cACL2P,GAAUrS,EAAQ4hD,GAAWD,GAAQA,MAkB9C,SAASC,GAAW1lB,GAClB,OAAO2lB,GAAWnwC,GAASwqB,GAAQx5B,eAqBrC,SAASszC,GAAO9Z,GAEd,OADAA,EAASxqB,GAASwqB,KACDA,EAAO55B,QAAQ0zB,GAASgH,IAAc16B,QAAQo1B,GAAa,IAsH9E,IAAIoqB,GAAYhM,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GACtD,OAAOqS,GAAUrS,EAAQ,IAAM,IAAM2hD,EAAKj/C,iBAuBxCq/C,GAAYjM,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GACtD,OAAOqS,GAAUrS,EAAQ,IAAM,IAAM2hD,EAAKj/C,iBAoBxCs/C,GAAanM,GAAgB,eA0NjC,IAAIoM,GAAYnM,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GACtD,OAAOqS,GAAUrS,EAAQ,IAAM,IAAM2hD,EAAKj/C,iBAgE5C,IAAIw/C,GAAYpM,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GACtD,OAAOqS,GAAUrS,EAAQ,IAAM,IAAM6hD,GAAWF,MAsiBlD,IAAIQ,GAAYrM,IAAiB,SAASzjC,EAAQsvC,EAAM3hD,GACtD,OAAOqS,GAAUrS,EAAQ,IAAM,IAAM2hD,EAAKS,iBAoBxCP,GAAahM,GAAgB,eAqBjC,SAASE,GAAM7Z,EAAQmmB,EAAS3M,GAI9B,OAHAxZ,EAASxqB,GAASwqB,QA/6dlBvtB,KAg7dA0zC,EAAU3M,OAh7dV/mC,EAg7d8B0zC,GAnyblC,SAAwBnmB,GACtB,OAAOpE,GAAiB7jB,KAAKioB,GAqyblBomB,CAAepmB,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAO35B,MAAMq1B,KAAkB,GAyjbF2qB,CAAarmB,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAO35B,MAAMkzB,IAAgB,GAwrcuB+sB,CAAWtmB,GAE7DA,EAAO35B,MAAM8/C,IAAY,GA2BlC,IAAII,GAAU7R,IAAS,SAAS5+B,EAAMrQ,GACpC,IACE,OAAOI,GAAMiQ,OAl9dfrD,EAk9dgChN,GAC9B,MAAOmW,GACP,OAAO+nC,GAAQ/nC,GAAKA,EAAI,IAAI0mB,EAAM1mB,OA8BlC4qC,GAAUpM,IAAS,SAASr4C,EAAQ0kD,GAKtC,OAJA5oB,GAAU4oB,GAAa,SAAS7kD,GAC9BA,EAAMusC,GAAMvsC,GACZsnC,GAAgBnnC,EAAQH,EAAKC,GAAKE,EAAOH,GAAMG,OAE1CA,KAqGT,SAASozC,GAAS7zC,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIolD,GAAOvM,KAuBPwM,GAAYxM,IAAW,GAkB3B,SAASxI,GAASrwC,GAChB,OAAOA,EA6CT,SAASq8B,GAAS7nB,GAChB,OAAO47B,GAA4B,mBAAR57B,EAAqBA,EAAOi0B,GAAUj0B,EAjte/C,IAwzepB,IAAItR,GAASkwC,IAAS,SAASlnB,EAAM/nB,GACnC,OAAO,SAAS1D,GACd,OAAOstC,GAAWttC,EAAQyrB,EAAM/nB,OA2BhCmhD,GAAWlS,IAAS,SAAS3yC,EAAQ0D,GACvC,OAAO,SAAS+nB,GACd,OAAO6hB,GAAWttC,EAAQyrB,EAAM/nB,OAwCpC,SAASohD,GAAM9kD,EAAQy2B,EAAQpxB,GAC7B,IAAIg5B,EAAQ2C,GAAKvK,GACbiuB,EAAc1Y,GAAcvV,EAAQ4H,GAEzB,MAAXh5B,GACEmQ,GAASihB,KAAYiuB,EAAY9iD,SAAWy8B,EAAMz8B,UACtDyD,EAAUoxB,EACVA,EAASz2B,EACTA,EAAS2C,KACT+hD,EAAc1Y,GAAcvV,EAAQuK,GAAKvK,KAE3C,IAAIqpB,IAAUtqC,GAASnQ,IAAY,UAAWA,IAAcA,EAAQy6C,OAChEnX,EAASsD,GAAWjsC,GAqBxB,OAnBA87B,GAAU4oB,GAAa,SAASrhD,GAC9B,IAAI0Q,EAAO0iB,EAAOpzB,GAClBrD,EAAOqD,GAAc0Q,EACjB40B,IACF3oC,EAAOE,UAAUmD,GAAc,WAC7B,IAAIyhC,EAAWniC,KAAKsiC,UACpB,GAAI6a,GAAShb,EAAU,CACrB,IAAI1wB,EAASpU,EAAO2C,KAAKoiC,aACrBqQ,EAAUhhC,EAAO4wB,YAAc8B,GAAUnkC,KAAKqiC,aAIlD,OAFAoQ,EAAQnyC,KAAK,CAAE,KAAQ8Q,EAAM,KAAQpQ,UAAW,QAAW3D,IAC3DoU,EAAO6wB,UAAYH,EACZ1wB,EAET,OAAOL,EAAKjQ,MAAM9D,EAAQy8B,GAAU,CAAC95B,KAAKpD,SAAUoE,iBAKnD3D,EAmCT,SAASs7C,MAiDT,IAAIyJ,GAAO5K,GAAW3d,IA8BlBwoB,GAAY7K,GAAWne,IAiCvBipB,GAAW9K,GAAWpd,IAwB1B,SAAS98B,GAASwrB,GAChB,OAAOglB,GAAMhlB,GAAQwR,GAAamP,GAAM3gB,IAh3X1C,SAA0BA,GACxB,OAAO,SAASzrB,GACd,OAAOksC,GAAQlsC,EAAQyrB,IA82XwBy5B,CAAiBz5B,GAuEpE,IAAI05B,GAAQ3K,KAsCR4K,GAAa5K,IAAY,GAoB7B,SAASkC,KACP,MAAO,GAgBT,SAASQ,KACP,OAAO,EA+JT,IAAIh0C,GAAM8wC,IAAoB,SAASqL,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC/iB,GAAO2Y,GAAY,QAiBnBqK,GAASvL,IAAoB,SAASwL,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBCv8B,GAAQgyB,GAAY,SAwKxB,IAgaMzkB,GAhaFivB,GAAW1L,IAAoB,SAAS2L,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBC9qC,GAAQogC,GAAY,SAiBpB2K,GAAW7L,IAAoB,SAAS8L,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgmBH,OA1iBAvhB,GAAOwhB,MAp6MP,SAAejmD,EAAGgU,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIY,GAAU2f,GAGtB,OADAv0B,EAAIq7C,GAAUr7C,GACP,WACL,KAAMA,EAAI,EACR,OAAOgU,EAAKjQ,MAAMnB,KAAMgB,aA85M9B6gC,GAAO1iC,IAAMA,GACb0iC,GAAO8d,OAASA,GAChB9d,GAAO+d,SAAWA,GAClB/d,GAAOge,aAAeA,GACtBhe,GAAOie,WAAaA,GACpBje,GAAOke,GAAKA,GACZle,GAAOkc,OAASA,GAChBlc,GAAO1kC,KAAOA,GACd0kC,GAAOigB,QAAUA,GACjBjgB,GAAOmc,QAAUA,GACjBnc,GAAOyhB,UAl8KP,WACE,IAAKtiD,UAAU/B,OACb,MAAO,GAET,IAAIrC,EAAQoE,UAAU,GACtB,OAAOhC,GAAQpC,GAASA,EAAQ,CAACA,IA87KnCilC,GAAOsb,MAAQA,GACftb,GAAO0hB,MApgTP,SAAexqB,EAAO9wB,EAAM6sC,GAExB7sC,GADG6sC,EAAQC,GAAehc,EAAO9wB,EAAM6sC,QA5uNzC/mC,IA4uNkD9F,GACzC,EAEA8I,GAAU0nC,GAAUxwC,GAAO,GAEpC,IAAIhJ,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,IAAKA,GAAUgJ,EAAO,EACpB,MAAO,GAMT,IAJA,IAAI7I,EAAQ,EACRo6B,EAAW,EACX/nB,EAASvT,EAAMyhC,GAAW1gC,EAASgJ,IAEhC7I,EAAQH,GACbwS,EAAO+nB,KAAcmX,GAAU5X,EAAO35B,EAAQA,GAAS6I,GAEzD,OAAOwJ,GAo/STowB,GAAO2hB,QAl+SP,SAAiBzqB,GAMf,IALA,IAAI35B,GAAS,EACTH,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACnCu6B,EAAW,EACX/nB,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACdxC,IACF6U,EAAO+nB,KAAc58B,GAGzB,OAAO6U,GAu9STowB,GAAOt/B,OA97SP,WACE,IAAItD,EAAS+B,UAAU/B,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAI8B,EAAO7C,EAAMe,EAAS,GACtB85B,EAAQ/3B,UAAU,GAClB5B,EAAQH,EAELG,KACL2B,EAAK3B,EAAQ,GAAK4B,UAAU5B,GAE9B,OAAO06B,GAAU96B,GAAQ+5B,GAASoL,GAAUpL,GAAS,CAACA,GAAQ+P,GAAY/nC,EAAM,KAm7SlF8gC,GAAO4hB,KA3tCP,SAAcpb,GACZ,IAAIppC,EAAkB,MAATopC,EAAgB,EAAIA,EAAMppC,OACnCk4C,EAAapI,KASjB,OAPA1G,EAASppC,EAAc46B,GAASwO,GAAO,SAASqQ,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAI1mC,GAAU2f,GAEtB,MAAO,CAACwlB,EAAWuB,EAAK,IAAKA,EAAK,OAJlB,GAOX1I,IAAS,SAASjvC,GAEvB,IADA,IAAI3B,GAAS,IACJA,EAAQH,GAAQ,CACvB,IAAIy5C,EAAOrQ,EAAMjpC,GACjB,GAAI+B,GAAMu3C,EAAK,GAAI14C,KAAMe,GACvB,OAAOI,GAAMu3C,EAAK,GAAI14C,KAAMe,QA4sCpC8gC,GAAO6hB,SA9qCP,SAAkB5vB,GAChB,OAz5YF,SAAsBA,GACpB,IAAI4H,EAAQ2C,GAAKvK,GACjB,OAAO,SAASz2B,GACd,OAAOoqC,GAAepqC,EAAQy2B,EAAQ4H,IAs5YjCioB,CAAate,GAAUvR,EA/ieZ,KA6tgBpB+N,GAAO4O,SAAWA,GAClB5O,GAAOyb,QAAUA,GACjBzb,GAAO5kC,OAtuHP,SAAgBM,EAAWqmD,GACzB,IAAInyC,EAASwwB,GAAW1kC,GACxB,OAAqB,MAAdqmD,EAAqBnyC,EAASqzB,GAAWrzB,EAAQmyC,IAquH1D/hB,GAAOgiB,MAzuMP,SAASA,EAAMzyC,EAAMolC,EAAO1B,GAE1B,IAAIrjC,EAASqnC,GAAW1nC,EA7+TN,OAnClBrD,8BA+gUAyoC,EAAQ1B,OA/gUR/mC,EA+gU4ByoC,GAG5B,OADA/kC,EAAO0qB,YAAc0nB,EAAM1nB,YACpB1qB,GAsuMTowB,GAAOiiB,WA7rMP,SAASA,EAAW1yC,EAAMolC,EAAO1B,GAE/B,IAAIrjC,EAASqnC,GAAW1nC,EAzhUA,QApCxBrD,8BA4jUAyoC,EAAQ1B,OA5jUR/mC,EA4jU4ByoC,GAG5B,OADA/kC,EAAO0qB,YAAc2nB,EAAW3nB,YACzB1qB,GA0rMTowB,GAAO1wB,SAAWA,GAClB0wB,GAAOt9B,SAAWA,GAClBs9B,GAAOqe,aAAeA,GACtBre,GAAOsc,MAAQA,GACftc,GAAOuc,MAAQA,GACfvc,GAAO6Z,WAAaA,GACpB7Z,GAAO8Z,aAAeA,GACtB9Z,GAAO+Z,eAAiBA,GACxB/Z,GAAOkiB,KAt0SP,SAAchrB,EAAO37B,EAAG03C,GACtB,IAAI71C,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAKA,EAIE0xC,GAAU5X,GADjB37B,EAAK03C,QAh8NL/mC,IAg8Nc3Q,EAAmB,EAAIq7C,GAAUr7C,IACnB,EAAI,EAAIA,EAAG6B,GAH9B,IAo0SX4iC,GAAOmiB,UArySP,SAAmBjrB,EAAO37B,EAAG03C,GAC3B,IAAI71C,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAKA,EAKE0xC,GAAU5X,EAAO,GADxB37B,EAAI6B,GADJ7B,EAAK03C,QAl+NL/mC,IAk+Nc3Q,EAAmB,EAAIq7C,GAAUr7C,KAEhB,EAAI,EAAIA,GAJ9B,IAmySXykC,GAAOoiB,eAzvSP,SAAwBlrB,EAAOO,GAC7B,OAAQP,GAASA,EAAM95B,OACnBqzC,GAAUvZ,EAAOgW,GAAYzV,EAAW,IAAI,GAAM,GAClD,IAuvSNuI,GAAOqiB,UAjtSP,SAAmBnrB,EAAOO,GACxB,OAAQP,GAASA,EAAM95B,OACnBqzC,GAAUvZ,EAAOgW,GAAYzV,EAAW,IAAI,GAC5C,IA+sSNuI,GAAOsiB,KA/qSP,SAAcprB,EAAOn8B,EAAOqzC,EAAOW,GACjC,IAAI3xC,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAKA,GAGDgxC,GAAyB,iBAATA,GAAqB8E,GAAehc,EAAOn8B,EAAOqzC,KACpEA,EAAQ,EACRW,EAAM3xC,GAzvIV,SAAkB85B,EAAOn8B,EAAOqzC,EAAOW,GACrC,IAAI3xC,EAAS85B,EAAM95B,OAWnB,KATAgxC,EAAQwI,GAAUxI,IACN,IACVA,GAASA,EAAQhxC,EAAS,EAAKA,EAASgxC,IAE1CW,OA32FA7iC,IA22FO6iC,GAAqBA,EAAM3xC,EAAUA,EAASw5C,GAAU7H,IACrD,IACRA,GAAO3xC,GAET2xC,EAAMX,EAAQW,EAAM,EAAI8O,GAAS9O,GAC1BX,EAAQW,GACb7X,EAAMkX,KAAWrzC,EAEnB,OAAOm8B,EA4uIAqrB,CAASrrB,EAAOn8B,EAAOqzC,EAAOW,IAN5B,IA6qSX/O,GAAOjjB,OA3vOP,SAAgBR,EAAYkb,GAE1B,OADWt6B,GAAQof,GAAcmb,GAAcsP,IACnCzqB,EAAY2wB,GAAYzV,EAAW,KA0vOjDuI,GAAOwiB,QAvqOP,SAAiBjmC,EAAY6a,GAC3B,OAAO6P,GAAYvhC,GAAI6W,EAAY6a,GAAW,IAuqOhD4I,GAAOyiB,YAhpOP,SAAqBlmC,EAAY6a,GAC/B,OAAO6P,GAAYvhC,GAAI6W,EAAY6a,GAhkSxB,MAgtgBb4I,GAAO0iB,aAxnOP,SAAsBnmC,EAAY6a,EAAU8P,GAE1C,OADAA,OAlpSAh7B,IAkpSQg7B,EAAsB,EAAI0P,GAAU1P,GACrCD,GAAYvhC,GAAI6W,EAAY6a,GAAW8P,IAunOhDlH,GAAO+X,QAAUA,GACjB/X,GAAO2iB,YAviSP,SAAqBzrB,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAM95B,QACvB6pC,GAAY/P,EA7qOjB,KA6qOoC,IAsiSjD8I,GAAO4iB,aA/gSP,SAAsB1rB,EAAOgQ,GAE3B,OADsB,MAAThQ,EAAgB,EAAIA,EAAM95B,QAKhC6pC,GAAY/P,EADnBgQ,OAlwOAh7B,IAkwOQg7B,EAAsB,EAAI0P,GAAU1P,IAFnC,IA6gSXlH,GAAO6iB,KAz9LP,SAActzC,GACZ,OAAO0nC,GAAW1nC,EA5wUD,MAqugBnBywB,GAAOmgB,KAAOA,GACdngB,GAAOogB,UAAYA,GACnBpgB,GAAO8iB,UA3/RP,SAAmBtc,GAKjB,IAJA,IAAIjpC,GAAS,EACTH,EAAkB,MAATopC,EAAgB,EAAIA,EAAMppC,OACnCwS,EAAS,KAEJrS,EAAQH,GAAQ,CACvB,IAAIy5C,EAAOrQ,EAAMjpC,GACjBqS,EAAOinC,EAAK,IAAMA,EAAK,GAEzB,OAAOjnC,GAm/RTowB,GAAO+iB,UA38GP,SAAmBvnD,GACjB,OAAiB,MAAVA,EAAiB,GAAKgsC,GAAchsC,EAAQghC,GAAKhhC,KA28G1DwkC,GAAOgjB,YAj7GP,SAAqBxnD,GACnB,OAAiB,MAAVA,EAAiB,GAAKgsC,GAAchsC,EAAQgpC,GAAOhpC,KAi7G5DwkC,GAAO6b,QAAUA,GACjB7b,GAAOijB,QA56RP,SAAiB/rB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAM95B,QACvB0xC,GAAU5X,EAAO,GAAI,GAAK,IA26R5C8I,GAAOma,aAAeA,GACtBna,GAAOqa,eAAiBA,GACxBra,GAAOsa,iBAAmBA,GAC1Bta,GAAOue,OAASA,GAChBve,GAAOwe,SAAWA,GAClBxe,GAAO8b,UAAYA,GACnB9b,GAAO5I,SAAWA,GAClB4I,GAAO+b,MAAQA,GACf/b,GAAOxD,KAAOA,GACdwD,GAAOwE,OAASA,GAChBxE,GAAOt6B,IAAMA,GACbs6B,GAAOkjB,QA1rGP,SAAiB1nD,EAAQ47B,GACvB,IAAIxnB,EAAS,GAMb,OALAwnB,EAAW8V,GAAY9V,EAAU,GAEjCuP,GAAWnrC,GAAQ,SAAST,EAAOM,EAAKG,GACtCmnC,GAAgB/yB,EAAQwnB,EAASr8B,EAAOM,EAAKG,GAAST,MAEjD6U,GAorGTowB,GAAOmjB,UArpGP,SAAmB3nD,EAAQ47B,GACzB,IAAIxnB,EAAS,GAMb,OALAwnB,EAAW8V,GAAY9V,EAAU,GAEjCuP,GAAWnrC,GAAQ,SAAST,EAAOM,EAAKG,GACtCmnC,GAAgB/yB,EAAQvU,EAAK+7B,EAASr8B,EAAOM,EAAKG,OAE7CoU,GA+oGTowB,GAAOphB,QAphCP,SAAiBqT,GACf,OAAOqZ,GAAY9H,GAAUvR,EAxveX,KA4wgBpB+N,GAAOojB,gBAh/BP,SAAyBn8B,EAAM+jB,GAC7B,OAAOK,GAAoBpkB,EAAMuc,GAAUwH,EA7xezB,KA6wgBpBhL,GAAOuZ,QAAUA,GACjBvZ,GAAO0e,MAAQA,GACf1e,GAAOse,UAAYA,GACnBte,GAAO/hC,OAASA,GAChB+hC,GAAOqgB,SAAWA,GAClBrgB,GAAOsgB,MAAQA,GACftgB,GAAO2c,OAASA,GAChB3c,GAAOqjB,OAzzBP,SAAgB9nD,GAEd,OADAA,EAAIq7C,GAAUr7C,GACP4yC,IAAS,SAASjvC,GACvB,OAAO4tC,GAAQ5tC,EAAM3D,OAuzBzBykC,GAAO2e,KAAOA,GACd3e,GAAOsjB,OAnhGP,SAAgB9nD,EAAQi8B,GACtB,OAAOqnB,GAAOtjD,EAAQmhD,GAAOzP,GAAYzV,MAmhG3CuI,GAAOpuB,KA73LP,SAAcrC,GACZ,OAAO2sC,GAAO,EAAG3sC,IA63LnBywB,GAAOujB,QAr4NP,SAAiBhnC,EAAYywB,EAAWC,EAAQgG,GAC9C,OAAkB,MAAd12B,EACK,IAEJpf,GAAQ6vC,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnC7vC,GADL8vC,EAASgG,OAj7ST/mC,EAi7S6B+gC,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYxwB,EAAYywB,EAAWC,KA23N5CjN,GAAOugB,KAAOA,GACdvgB,GAAO4c,SAAWA,GAClB5c,GAAOwgB,UAAYA,GACnBxgB,GAAOygB,SAAWA,GAClBzgB,GAAO+c,QAAUA,GACjB/c,GAAOgd,aAAeA,GACtBhd,GAAOgc,UAAYA,GACnBhc,GAAOlE,KAAOA,GACdkE,GAAO8e,OAASA,GAChB9e,GAAOvkC,SAAWA,GAClBukC,GAAOwjB,WA/rBP,SAAoBhoD,GAClB,OAAO,SAASyrB,GACd,OAAiB,MAAVzrB,OA7nfT0Q,EA6nfsCw7B,GAAQlsC,EAAQyrB,KA8rBxD+Y,GAAOua,KAAOA,GACdva,GAAOwa,QAAUA,GACjBxa,GAAOyjB,UApsRP,SAAmBvsB,EAAOgB,EAAQd,GAChC,OAAQF,GAASA,EAAM95B,QAAU86B,GAAUA,EAAO96B,OAC9C2wC,GAAY7W,EAAOgB,EAAQgV,GAAY9V,EAAU,IACjDF,GAksRN8I,GAAO0jB,YAxqRP,SAAqBxsB,EAAOgB,EAAQH,GAClC,OAAQb,GAASA,EAAM95B,QAAU86B,GAAUA,EAAO96B,OAC9C2wC,GAAY7W,EAAOgB,OAxpPvBhsB,EAwpP0C6rB,GACtCb,GAsqRN8I,GAAOya,OAASA,GAChBza,GAAO2gB,MAAQA,GACf3gB,GAAO4gB,WAAaA,GACpB5gB,GAAOid,MAAQA,GACfjd,GAAO2jB,OAxvNP,SAAgBpnC,EAAYkb,GAE1B,OADWt6B,GAAQof,GAAcmb,GAAcsP,IACnCzqB,EAAYogC,GAAOzP,GAAYzV,EAAW,MAuvNxDuI,GAAOryB,OAzmRP,SAAgBupB,EAAOO,GACrB,IAAI7nB,EAAS,GACb,IAAMsnB,IAASA,EAAM95B,OACnB,OAAOwS,EAET,IAAIrS,GAAS,EACTyc,EAAU,GACV5c,EAAS85B,EAAM95B,OAGnB,IADAq6B,EAAYyV,GAAYzV,EAAW,KAC1Bl6B,EAAQH,GAAQ,CACvB,IAAIrC,EAAQm8B,EAAM35B,GACdk6B,EAAU18B,EAAOwC,EAAO25B,KAC1BtnB,EAAOnR,KAAK1D,GACZif,EAAQvb,KAAKlB,IAIjB,OADAywC,GAAW9W,EAAOld,GACXpK,GAwlRTowB,GAAO4jB,KAluLP,SAAcr0C,EAAM6+B,GAClB,GAAmB,mBAAR7+B,EACT,MAAM,IAAIY,GAAU2f,GAGtB,OAAOqe,GAAS5+B,EADhB6+B,OAvmVAliC,IAumVQkiC,EAAsBA,EAAQwI,GAAUxI,KA+tLlDpO,GAAOlB,QAAUA,GACjBkB,GAAO6jB,WAhtNP,SAAoBtnC,EAAYhhB,EAAG03C,GAOjC,OALE13C,GADG03C,EAAQC,GAAe32B,EAAYhhB,EAAG03C,QAxnT3C/mC,IAwnToD3Q,GAC9C,EAEAq7C,GAAUr7C,IAEL4B,GAAQof,GAAc6lB,GAAkBoM,IACvCjyB,EAAYhhB,IA0sN1BykC,GAAO/E,IAv6FP,SAAaz/B,EAAQyrB,EAAMlsB,GACzB,OAAiB,MAAVS,EAAiBA,EAASsyC,GAAQtyC,EAAQyrB,EAAMlsB,IAu6FzDilC,GAAO8jB,QA54FP,SAAiBtoD,EAAQyrB,EAAMlsB,EAAO2oC,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,OA97a/Cx3B,EA+7aiB,MAAV1Q,EAAiBA,EAASsyC,GAAQtyC,EAAQyrB,EAAMlsB,EAAO2oC,IA24FhE1D,GAAO+jB,QA1rNP,SAAiBxnC,GAEf,OADWpf,GAAQof,GAAcimB,GAAeqM,IACpCtyB,IAyrNdyjB,GAAO1jC,MAhjRP,SAAe46B,EAAOkX,EAAOW,GAC3B,IAAI3xC,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAKA,GAGD2xC,GAAqB,iBAAPA,GAAmBmE,GAAehc,EAAOkX,EAAOW,IAChEX,EAAQ,EACRW,EAAM3xC,IAGNgxC,EAAiB,MAATA,EAAgB,EAAIwI,GAAUxI,GACtCW,OAtyPF7iC,IAsyPQ6iC,EAAoB3xC,EAASw5C,GAAU7H,IAExCD,GAAU5X,EAAOkX,EAAOW,IAVtB,IA8iRX/O,GAAOic,OAASA,GAChBjc,GAAOgkB,WAx3QP,SAAoB9sB,GAClB,OAAQA,GAASA,EAAM95B,OACnB6yC,GAAe/Y,GACf,IAs3QN8I,GAAOikB,aAn2QP,SAAsB/sB,EAAOE,GAC3B,OAAQF,GAASA,EAAM95B,OACnB6yC,GAAe/Y,EAAOgW,GAAY9V,EAAU,IAC5C,IAi2QN4I,GAAOzE,MA5hEP,SAAe9B,EAAQyqB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBjR,GAAezZ,EAAQyqB,EAAWC,KACzED,EAAYC,OArzcdj4C,IAuzcAi4C,OAvzcAj4C,IAuzcQi4C,EAxvcW,WAwvc8BA,IAAU,IAI3D1qB,EAASxqB,GAASwqB,MAEQ,iBAAbyqB,GACO,MAAbA,IAAsBttB,GAASstB,OAEpCA,EAAY/T,GAAa+T,KACPvpB,GAAWlB,GACpB6X,GAAUjW,GAAc5B,GAAS,EAAG0qB,GAGxC1qB,EAAO8B,MAAM2oB,EAAWC,GAZtB,IAuhEXnkB,GAAOokB,OAnsLP,SAAgB70C,EAAM6+B,GACpB,GAAmB,mBAAR7+B,EACT,MAAM,IAAIY,GAAU2f,GAGtB,OADAse,EAAiB,MAATA,EAAgB,EAAIl/B,GAAU0nC,GAAUxI,GAAQ,GACjDD,IAAS,SAASjvC,GACvB,IAAIg4B,EAAQh4B,EAAKkvC,GACbuK,EAAYrH,GAAUpyC,EAAM,EAAGkvC,GAKnC,OAHIlX,GACFe,GAAU0gB,EAAWzhB,GAEhB53B,GAAMiQ,EAAMpR,KAAMw6C,OAwrL7B3Y,GAAOqkB,KAl1QP,SAAcntB,GACZ,IAAI95B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAOA,EAAS0xC,GAAU5X,EAAO,EAAG95B,GAAU,IAi1QhD4iC,GAAOskB,KArzQP,SAAcptB,EAAO37B,EAAG03C,GACtB,OAAM/b,GAASA,EAAM95B,OAId0xC,GAAU5X,EAAO,GADxB37B,EAAK03C,QAjiQL/mC,IAiiQc3Q,EAAmB,EAAIq7C,GAAUr7C,IAChB,EAAI,EAAIA,GAH9B,IAozQXykC,GAAOukB,UArxQP,SAAmBrtB,EAAO37B,EAAG03C,GAC3B,IAAI71C,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,OAAKA,EAKE0xC,GAAU5X,GADjB37B,EAAI6B,GADJ7B,EAAK03C,QAnkQL/mC,IAmkQc3Q,EAAmB,EAAIq7C,GAAUr7C,KAEnB,EAAI,EAAIA,EAAG6B,GAJ9B,IAmxQX4iC,GAAOwkB,eAzuQP,SAAwBttB,EAAOO,GAC7B,OAAQP,GAASA,EAAM95B,OACnBqzC,GAAUvZ,EAAOgW,GAAYzV,EAAW,IAAI,GAAO,GACnD,IAuuQNuI,GAAOykB,UAjsQP,SAAmBvtB,EAAOO,GACxB,OAAQP,GAASA,EAAM95B,OACnBqzC,GAAUvZ,EAAOgW,GAAYzV,EAAW,IACxC,IA+rQNuI,GAAO0kB,IApuPP,SAAa3pD,EAAOwgD,GAElB,OADAA,EAAYxgD,GACLA,GAmuPTilC,GAAO2kB,SA9oLP,SAAkBp1C,EAAMC,EAAM3O,GAC5B,IAAImP,GAAU,EACVE,GAAW,EAEf,GAAmB,mBAARX,EACT,MAAM,IAAIY,GAAU2f,GAMtB,OAJI9e,GAASnQ,KACXmP,EAAU,YAAanP,IAAYA,EAAQmP,QAAUA,EACrDE,EAAW,aAAcrP,IAAYA,EAAQqP,SAAWA,GAEnDZ,GAASC,EAAMC,EAAM,CAC1B,QAAWQ,EACX,QAAWR,EACX,SAAYU,KAioLhB8vB,GAAOgU,KAAOA,GACdhU,GAAO1jB,QAAUA,GACjB0jB,GAAO+e,QAAUA,GACjB/e,GAAOgf,UAAYA,GACnBhf,GAAO4kB,OArfP,SAAgB7pD,GACd,OAAIoC,GAAQpC,GACHi9B,GAASj9B,EAAO6sC,IAElBx2B,GAASrW,GAAS,CAACA,GAASunC,GAAU8O,GAAaniC,GAASlU,MAkfrEilC,GAAO4M,cAAgBA,GACvB5M,GAAOhgB,UA10FP,SAAmBxkB,EAAQ47B,EAAUC,GACnC,IAAIsK,EAAQxkC,GAAQ3B,GAChBqpD,EAAYljB,GAASvD,GAAS5iC,IAAWw7B,GAAax7B,GAG1D,GADA47B,EAAW8V,GAAY9V,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIuN,EAAOppC,GAAUA,EAAOiH,YAE1B40B,EADEwtB,EACYljB,EAAQ,IAAIiD,EAAO,GAE1B5zB,GAASxV,IACFisC,GAAW7C,GAAQxE,GAAWnD,GAAazhC,IAG3C,GAMlB,OAHCqpD,EAAYvtB,GAAYqP,IAAYnrC,GAAQ,SAAST,EAAOwC,EAAO/B,GAClE,OAAO47B,EAASC,EAAat8B,EAAOwC,EAAO/B,MAEtC67B,GAuzFT2I,GAAO8kB,MArnLP,SAAev1C,GACb,OAAOjS,GAAIiS,EAAM,IAqnLnBywB,GAAO0a,MAAQA,GACf1a,GAAO2a,QAAUA,GACjB3a,GAAO4a,UAAYA,GACnB5a,GAAO+kB,KAzmQP,SAAc7tB,GACZ,OAAQA,GAASA,EAAM95B,OAAUgzC,GAASlZ,GAAS,IAymQrD8I,GAAOglB,OA/kQP,SAAgB9tB,EAAOE,GACrB,OAAQF,GAASA,EAAM95B,OAAUgzC,GAASlZ,EAAOgW,GAAY9V,EAAU,IAAM,IA+kQ/E4I,GAAOilB,SAxjQP,SAAkB/tB,EAAOa,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,OA9yQ/C7rB,EA+yQQgrB,GAASA,EAAM95B,OAAUgzC,GAASlZ,OA/yQ1ChrB,EA+yQ4D6rB,GAAc,IAujQ5EiI,GAAOklB,MAhyFP,SAAe1pD,EAAQyrB,GACrB,OAAiB,MAAVzrB,GAAwByyC,GAAUzyC,EAAQyrB,IAgyFnD+Y,GAAO6a,MAAQA,GACf7a,GAAO+a,UAAYA,GACnB/a,GAAOlZ,OApwFP,SAAgBtrB,EAAQyrB,EAAMupB,GAC5B,OAAiB,MAAVh1C,EAAiBA,EAAS+0C,GAAW/0C,EAAQyrB,EAAMkqB,GAAaX,KAowFzExQ,GAAOmlB,WAzuFP,SAAoB3pD,EAAQyrB,EAAMupB,EAAS9M,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,OAlob/Cx3B,EAmobiB,MAAV1Q,EAAiBA,EAAS+0C,GAAW/0C,EAAQyrB,EAAMkqB,GAAaX,GAAU9M,IAwuFnF1D,GAAO9H,OAASA,GAChB8H,GAAOolB,SAhrFP,SAAkB5pD,GAChB,OAAiB,MAAVA,EAAiB,GAAKo+B,GAAWp+B,EAAQgpC,GAAOhpC,KAgrFzDwkC,GAAOgb,QAAUA,GACjBhb,GAAOsT,MAAQA,GACftT,GAAOvb,KA3mLP,SAAc1pB,EAAOk5C,GACnB,OAAO8I,GAAQ5L,GAAa8C,GAAUl5C,IA2mLxCilC,GAAOib,IAAMA,GACbjb,GAAOkb,MAAQA,GACflb,GAAOmb,QAAUA,GACjBnb,GAAOob,IAAMA,GACbpb,GAAOqlB,UAj3PP,SAAmBxrB,EAAO3B,GACxB,OAAO6Y,GAAclX,GAAS,GAAI3B,GAAU,GAAI0K,KAi3PlD5C,GAAOslB,cA/1PP,SAAuBzrB,EAAO3B,GAC5B,OAAO6Y,GAAclX,GAAS,GAAI3B,GAAU,GAAI4V,KA+1PlD9N,GAAOqb,QAAUA,GAGjBrb,GAAOkB,QAAU6d,GACjB/e,GAAOulB,UAAYvG,GACnBhf,GAAOx9B,OAASu7C,GAChB/d,GAAOwlB,WAAaxH,GAGpBsC,GAAMtgB,GAAQA,IAKdA,GAAOt7B,IAAMA,GACbs7B,GAAOggB,QAAUA,GACjBhgB,GAAOif,UAAYA,GACnBjf,GAAOmf,WAAaA,GACpBnf,GAAOjC,KAAOA,GACdiC,GAAOylB,MAprFP,SAAe99C,EAAQ27B,EAAOC,GAa5B,YAlubAr3B,IAstbIq3B,IACFA,EAAQD,EACRA,OAxtbFp3B,YA0tbIq3B,IAEFA,GADAA,EAAQxyB,GAASwyB,KACCA,EAAQA,EAAQ,QA5tbpCr3B,IA8tbIo3B,IAEFA,GADAA,EAAQvyB,GAASuyB,KACCA,EAAQA,EAAQ,GAE7Bf,GAAUxxB,GAASpJ,GAAS27B,EAAOC,IAwqF5CvD,GAAO4Z,MA7jLP,SAAe7+C,GACb,OAAOyoC,GAAUzoC,EArzVI,IAk3gBvBilC,GAAO0lB,UApgLP,SAAmB3qD,GACjB,OAAOyoC,GAAUzoC,EAAO6jD,IAogL1B5e,GAAO2lB,cAr+KP,SAAuB5qD,EAAO2oC,GAE5B,OAAOF,GAAUzoC,EAAO6jD,EADxBlb,EAAkC,mBAAdA,EAA2BA,OAx6V/Cx3B,IA64gBF8zB,GAAO4lB,UA7hLP,SAAmB7qD,EAAO2oC,GAExB,OAAOF,GAAUzoC,EAz1VI,EAw1VrB2oC,EAAkC,mBAAdA,EAA2BA,OAj3V/Cx3B,IA84gBF8zB,GAAO6lB,WA18KP,SAAoBrqD,EAAQy2B,GAC1B,OAAiB,MAAVA,GAAkB2T,GAAepqC,EAAQy2B,EAAQuK,GAAKvK,KA08K/D+N,GAAOuT,OAASA,GAChBvT,GAAO8lB,UA1xCP,SAAmB/qD,EAAO26C,GACxB,OAAiB,MAAT36C,GAAiBA,GAAUA,EAAS26C,EAAe36C,GA0xC7DilC,GAAO+gB,OAASA,GAChB/gB,GAAO+lB,SAz9EP,SAAkBtsB,EAAQzyB,EAAQ8X,GAChC2a,EAASxqB,GAASwqB,GAClBzyB,EAASmpC,GAAanpC,GAEtB,IAAI5J,EAASq8B,EAAOr8B,OAKhB2xC,EAJJjwB,OA97bA5S,IA87bW4S,EACP1hB,EACAmlC,GAAUqU,GAAU93B,GAAW,EAAG1hB,GAItC,OADA0hB,GAAY9X,EAAO5J,SACA,GAAKq8B,EAAOn9B,MAAMwiB,EAAUiwB,IAAQ/nC,GA+8EzDg5B,GAAO0C,GAAKA,GACZ1C,GAAOgmB,OAj7EP,SAAgBvsB,GAEd,OADAA,EAASxqB,GAASwqB,KACAvH,EAAmB1gB,KAAKioB,GACtCA,EAAO55B,QAAQiyB,EAAiB0I,IAChCf,GA86ENuG,GAAOimB,aA55EP,SAAsBxsB,GAEpB,OADAA,EAASxqB,GAASwqB,KACA/G,EAAgBlhB,KAAKioB,GACnCA,EAAO55B,QAAQ4yB,EAAc,QAC7BgH,GAy5ENuG,GAAOkmB,MA57OP,SAAe3pC,EAAYkb,EAAWwb,GACpC,IAAI1jC,EAAOpS,GAAQof,GAAcib,GAAasP,GAI9C,OAHImM,GAASC,GAAe32B,EAAYkb,EAAWwb,KACjDxb,OA79RFvrB,GA+9ROqD,EAAKgN,EAAY2wB,GAAYzV,EAAW,KAw7OjDuI,GAAO0b,KAAOA,GACd1b,GAAOga,UAAYA,GACnBha,GAAOmmB,QArxHP,SAAiB3qD,EAAQi8B,GACvB,OAAOiB,GAAYl9B,EAAQ0xC,GAAYzV,EAAW,GAAIkP,KAqxHxD3G,GAAO2b,SAAWA,GAClB3b,GAAOia,cAAgBA,GACvBja,GAAOomB,YAjvHP,SAAqB5qD,EAAQi8B,GAC3B,OAAOiB,GAAYl9B,EAAQ0xC,GAAYzV,EAAW,GAAIoP,KAivHxD7G,GAAOtb,MAAQA,GACfsb,GAAOzhC,QAAUA,GACjByhC,GAAO4b,aAAeA,GACtB5b,GAAOqmB,MArtHP,SAAe7qD,EAAQ47B,GACrB,OAAiB,MAAV57B,EACHA,EACA6rC,GAAQ7rC,EAAQ0xC,GAAY9V,EAAU,GAAIoN,KAmtHhDxE,GAAOsmB,WAtrHP,SAAoB9qD,EAAQ47B,GAC1B,OAAiB,MAAV57B,EACHA,EACA+rC,GAAa/rC,EAAQ0xC,GAAY9V,EAAU,GAAIoN,KAorHrDxE,GAAOumB,OArpHP,SAAgB/qD,EAAQ47B,GACtB,OAAO57B,GAAUmrC,GAAWnrC,EAAQ0xC,GAAY9V,EAAU,KAqpH5D4I,GAAOwmB,YAxnHP,SAAqBhrD,EAAQ47B,GAC3B,OAAO57B,GAAUqrC,GAAgBrrC,EAAQ0xC,GAAY9V,EAAU,KAwnHjE4I,GAAOrlC,IAAMA,GACbqlC,GAAOkd,GAAKA,GACZld,GAAOmd,IAAMA,GACbnd,GAAOhG,IAzgHP,SAAax+B,EAAQyrB,GACnB,OAAiB,MAAVzrB,GAAkB28C,GAAQ38C,EAAQyrB,EAAMohB,KAygHjDrI,GAAOmM,MAAQA,GACfnM,GAAOka,KAAOA,GACdla,GAAOoL,SAAWA,GAClBpL,GAAO+F,SA5pOP,SAAkBxpB,EAAYxhB,EAAO89B,EAAWoa,GAC9C12B,EAAauvB,GAAYvvB,GAAcA,EAAa2b,GAAO3b,GAC3Dsc,EAAaA,IAAcoa,EAAS2D,GAAU/d,GAAa,EAE3D,IAAIz7B,EAASmf,EAAWnf,OAIxB,OAHIy7B,EAAY,IACdA,EAAY3pB,GAAU9R,EAASy7B,EAAW,IAErC0kB,GAAShhC,GACXsc,GAAaz7B,GAAUmf,EAAW/e,QAAQzC,EAAO89B,IAAc,IAC7Dz7B,GAAUy6B,GAAYtb,EAAYxhB,EAAO89B,IAAc,GAmpOhEmH,GAAOxiC,QA9lSP,SAAiB05B,EAAOn8B,EAAO89B,GAC7B,IAAIz7B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIG,EAAqB,MAAbs7B,EAAoB,EAAI+d,GAAU/d,GAI9C,OAHIt7B,EAAQ,IACVA,EAAQ2R,GAAU9R,EAASG,EAAO,IAE7Bs6B,GAAYX,EAAOn8B,EAAOwC,IAslSnCyiC,GAAOymB,QAlqFP,SAAiB9+C,EAAQymC,EAAOW,GAS9B,OARAX,EAAQ8H,GAAS9H,QA5wbjBliC,IA6wbI6iC,GACFA,EAAMX,EACNA,EAAQ,GAERW,EAAMmH,GAASnH,GArsVnB,SAAqBpnC,EAAQymC,EAAOW,GAClC,OAAOpnC,GAAUwH,GAAUi/B,EAAOW,IAAQpnC,EAASuH,GAAUk/B,EAAOW,GAusV7D2X,CADP/+C,EAASoJ,GAASpJ,GACSymC,EAAOW,IA0pFpC/O,GAAOye,OAASA,GAChBze,GAAO6B,YAAcA,GACrB7B,GAAO7iC,QAAUA,GACjB6iC,GAAO1J,cAAgBA,GACvB0J,GAAO8L,YAAcA,GACrB9L,GAAO0M,kBAAoBA,GAC3B1M,GAAO2mB,UAtwKP,SAAmB5rD,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBoW,GAAapW,IAAUitC,GAAWjtC,IAAUo1B,GAqwKjD6P,GAAO5B,SAAWA,GAClB4B,GAAOxJ,OAASA,GAChBwJ,GAAO4mB,UA7sKP,SAAmB7rD,GACjB,OAAOoW,GAAapW,IAA6B,IAAnBA,EAAMyb,WAAmBm2B,GAAc5xC,IA6sKvEilC,GAAO6mB,QAzqKP,SAAiB9rD,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAI+wC,GAAY/wC,KACXoC,GAAQpC,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM0C,QAC1D2gC,GAASrjC,IAAUi8B,GAAaj8B,IAAU8mC,GAAY9mC,IAC1D,OAAQA,EAAMqC,OAEhB,IAAI6mC,EAAMC,GAAOnpC,GACjB,GAAIkpC,GAAOzT,GAAUyT,GAAOrT,EAC1B,OAAQ71B,EAAMqL,KAEhB,GAAIolC,GAAYzwC,GACd,OAAQwwC,GAASxwC,GAAOqC,OAE1B,IAAK,IAAI/B,KAAON,EACd,GAAIY,GAAe1B,KAAKc,EAAOM,GAC7B,OAAO,EAGX,OAAO,GAqpKT2kC,GAAO8mB,QAtnKP,SAAiB/rD,EAAOsW,GACtB,OAAO43B,GAAYluC,EAAOsW,IAsnK5B2uB,GAAO+mB,YAnlKP,SAAqBhsD,EAAOsW,EAAOqyB,GAEjC,IAAI9zB,GADJ8zB,EAAkC,mBAAdA,EAA2BA,OAx2W/Cx3B,GAy2W0Bw3B,EAAW3oC,EAAOsW,QAz2W5CnF,EA02WA,YA12WAA,IA02WO0D,EAAuBq5B,GAAYluC,EAAOsW,OA12WjDnF,EA02WmEw3B,KAAgB9zB,GAilKrFowB,GAAOod,QAAUA,GACjBpd,GAAO1B,SA1hKP,SAAkBvjC,GAChB,MAAuB,iBAATA,GAAqBsjC,GAAetjC,IA0hKpDilC,GAAOyH,WAAaA,GACpBzH,GAAOqd,UAAYA,GACnBrd,GAAOqY,SAAWA,GAClBrY,GAAOtJ,MAAQA,GACfsJ,GAAOgnB,QA11JP,SAAiBxrD,EAAQy2B,GACvB,OAAOz2B,IAAWy2B,GAAU4Y,GAAYrvC,EAAQy2B,EAAQ8Z,GAAa9Z,KA01JvE+N,GAAOinB,YAvzJP,SAAqBzrD,EAAQy2B,EAAQyR,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,OA5oX/Cx3B,EA6oXO2+B,GAAYrvC,EAAQy2B,EAAQ8Z,GAAa9Z,GAASyR,IAszJ3D1D,GAAOxqB,MAvxJP,SAAeza,GAIb,OAAOuiD,GAASviD,IAAUA,IAAUA,GAoxJtCilC,GAAOknB,SAvvJP,SAAkBnsD,GAChB,GAAI09C,GAAW19C,GACb,MAAM,IAAIghC,EAtsXM,mEAwsXlB,OAAOmP,GAAanwC,IAovJtBilC,GAAOmnB,MAxsJP,SAAepsD,GACb,OAAgB,MAATA,GAwsJTilC,GAAOonB,OAjuJP,SAAgBrsD,GACd,OAAiB,OAAVA,GAiuJTilC,GAAOsd,SAAWA,GAClBtd,GAAOhvB,SAAWA,GAClBgvB,GAAO7uB,aAAeA,GACtB6uB,GAAO2M,cAAgBA,GACvB3M,GAAOpJ,SAAWA,GAClBoJ,GAAOqnB,cArlJP,SAAuBtsD,GACrB,OAAOsiD,GAAUtiD,IAAUA,IA9zXR,kBA8zXsCA,GA9zXtC,kBAm5gBrBilC,GAAOlJ,MAAQA,GACfkJ,GAAOud,SAAWA,GAClBvd,GAAO5uB,SAAWA,GAClB4uB,GAAOhJ,aAAeA,GACtBgJ,GAAOsnB,YAn/IP,SAAqBvsD,GACnB,YA/9XAmR,IA+9XOnR,GAm/ITilC,GAAOunB,UA/9IP,SAAmBxsD,GACjB,OAAOoW,GAAapW,IAAUmpC,GAAOnpC,IAAUg2B,GA+9IjDiP,GAAOwnB,UA38IP,SAAmBzsD,GACjB,OAAOoW,GAAapW,IAn6XP,oBAm6XiBitC,GAAWjtC,IA28I3CilC,GAAOljB,KAz/RP,SAAcoa,EAAOgtB,GACnB,OAAgB,MAAThtB,EAAgB,GAAKqH,GAAWtkC,KAAKi9B,EAAOgtB,IAy/RrDlkB,GAAOqf,UAAYA,GACnBrf,GAAO+I,KAAOA,GACd/I,GAAOynB,YAh9RP,SAAqBvwB,EAAOn8B,EAAO89B,GACjC,IAAIz7B,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIG,EAAQH,EAKZ,YAjhPA8O,IA6gPI2sB,IAEFt7B,GADAA,EAAQq5C,GAAU/d,IACF,EAAI3pB,GAAU9R,EAASG,EAAO,GAAK4R,GAAU5R,EAAOH,EAAS,IAExErC,GAAUA,EArvMrB,SAA2Bm8B,EAAOn8B,EAAO89B,GAEvC,IADA,IAAIt7B,EAAQs7B,EAAY,EACjBt7B,KACL,GAAI25B,EAAM35B,KAAWxC,EACnB,OAAOwC,EAGX,OAAOA,EA+uMDmqD,CAAkBxwB,EAAOn8B,EAAOwC,GAChCq7B,GAAc1B,EAAO8B,GAAWz7B,GAAO,IAq8R7CyiC,GAAOsf,UAAYA,GACnBtf,GAAOuf,WAAaA,GACpBvf,GAAOwd,GAAKA,GACZxd,GAAOyd,IAAMA,GACbzd,GAAOt5B,IAhfP,SAAawwB,GACX,OAAQA,GAASA,EAAM95B,OACnB2pC,GAAa7P,EAAOkU,GAAUhD,SA9+flCl8B,GA69gBF8zB,GAAO2nB,MApdP,SAAezwB,EAAOE,GACpB,OAAQF,GAASA,EAAM95B,OACnB2pC,GAAa7P,EAAOgW,GAAY9V,EAAU,GAAIgR,SA3ggBlDl8B,GA89gBF8zB,GAAO4nB,KAjcP,SAAc1wB,GACZ,OAAOgC,GAAShC,EAAOkU,KAiczBpL,GAAO6nB,OAvaP,SAAgB3wB,EAAOE,GACrB,OAAO8B,GAAShC,EAAOgW,GAAY9V,EAAU,KAua/C4I,GAAOn2B,IAlZP,SAAaqtB,GACX,OAAQA,GAASA,EAAM95B,OACnB2pC,GAAa7P,EAAOkU,GAAUQ,SAhlgBlC1/B,GAi+gBF8zB,GAAO8nB,MAtXP,SAAe5wB,EAAOE,GACpB,OAAQF,GAASA,EAAM95B,OACnB2pC,GAAa7P,EAAOgW,GAAY9V,EAAU,GAAIwU,SA7mgBlD1/B,GAk+gBF8zB,GAAOkY,UAAYA,GACnBlY,GAAO0Y,UAAYA,GACnB1Y,GAAO+nB,WAztBP,WACE,MAAO,IAytBT/nB,GAAOgoB,WAzsBP,WACE,MAAO,IAysBThoB,GAAOioB,SAzrBP,WACE,OAAO,GAyrBTjoB,GAAOkhB,SAAWA,GAClBlhB,GAAOkoB,IA77RP,SAAahxB,EAAO37B,GAClB,OAAQ27B,GAASA,EAAM95B,OAAU0vC,GAAQ5V,EAAO0f,GAAUr7C,SA5iP1D2Q,GAy+gBF8zB,GAAOmoB,WAliCP,WAIE,OAHIr5C,GAAK6sB,IAAMx9B,OACb2Q,GAAK6sB,EAAIiB,IAEJz+B,MA+hCT6hC,GAAO8W,KAAOA,GACd9W,GAAO5wB,IAAMA,GACb4wB,GAAOooB,IAj5EP,SAAa3uB,EAAQr8B,EAAQ04C,GAC3Brc,EAASxqB,GAASwqB,GAGlB,IAAI4uB,GAFJjrD,EAASw5C,GAAUx5C,IAEM+9B,GAAW1B,GAAU,EAC9C,IAAKr8B,GAAUirD,GAAajrD,EAC1B,OAAOq8B,EAET,IAAI6V,GAAOlyC,EAASirD,GAAa,EACjC,OACExS,GAAc7X,GAAYsR,GAAMwG,GAChCrc,EACAoc,GAAc/X,GAAWwR,GAAMwG,IAs4EnC9V,GAAOsoB,OA32EP,SAAgB7uB,EAAQr8B,EAAQ04C,GAC9Brc,EAASxqB,GAASwqB,GAGlB,IAAI4uB,GAFJjrD,EAASw5C,GAAUx5C,IAEM+9B,GAAW1B,GAAU,EAC9C,OAAQr8B,GAAUirD,EAAYjrD,EACzBq8B,EAASoc,GAAcz4C,EAASirD,EAAWvS,GAC5Crc,GAq2ENuG,GAAOuoB,SA30EP,SAAkB9uB,EAAQr8B,EAAQ04C,GAChCrc,EAASxqB,GAASwqB,GAGlB,IAAI4uB,GAFJjrD,EAASw5C,GAAUx5C,IAEM+9B,GAAW1B,GAAU,EAC9C,OAAQr8B,GAAUirD,EAAYjrD,EACzBy4C,GAAcz4C,EAASirD,EAAWvS,GAASrc,EAC5CA,GAq0ENuG,GAAOp4B,SA1yEP,SAAkB6xB,EAAQ+uB,EAAOvV,GAM/B,OALIA,GAAkB,MAATuV,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJ9pB,GAAezvB,GAASwqB,GAAQ55B,QAAQ8yB,EAAa,IAAK61B,GAAS,IAqyE5ExoB,GAAOpB,OA1rFP,SAAgB0E,EAAOC,EAAOklB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBvV,GAAe5P,EAAOC,EAAOklB,KAC3EllB,EAAQklB,OAxzbVv8C,YA0zbIu8C,IACkB,kBAATllB,GACTklB,EAAWllB,EACXA,OA7zbJr3B,GA+zb2B,kBAATo3B,IACdmlB,EAAWnlB,EACXA,OAj0bJp3B,aAo0bIo3B,QAp0bJp3B,IAo0b2Bq3B,GACzBD,EAAQ,EACRC,EAAQ,IAGRD,EAAQ4S,GAAS5S,QAz0bnBp3B,IA00bMq3B,GACFA,EAAQD,EACRA,EAAQ,GAERC,EAAQ2S,GAAS3S,IAGjBD,EAAQC,EAAO,CACjB,IAAImlB,EAAOplB,EACXA,EAAQC,EACRA,EAAQmlB,EAEV,GAAID,GAAYnlB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI+V,EAAO3a,KACX,OAAOxvB,GAAUm0B,EAASgW,GAAQ/V,EAAQD,EAAQ3N,GAAe,QAAU2jB,EAAO,IAAIl8C,OAAS,KAAOmmC,GAExG,OAAOpB,GAAWmB,EAAOC,IAupF3BvD,GAAO2oB,OA5+NP,SAAgBpsC,EAAY6a,EAAUC,GACpC,IAAI9nB,EAAOpS,GAAQof,GAAc6b,GAAciB,GAC3ChB,EAAYl5B,UAAU/B,OAAS,EAEnC,OAAOmS,EAAKgN,EAAY2wB,GAAY9V,EAAU,GAAIC,EAAagB,EAAW2K,KAy+N5EhD,GAAO4oB,YAh9NP,SAAqBrsC,EAAY6a,EAAUC,GACzC,IAAI9nB,EAAOpS,GAAQof,GAAc+b,GAAmBe,GAChDhB,EAAYl5B,UAAU/B,OAAS,EAEnC,OAAOmS,EAAKgN,EAAY2wB,GAAY9V,EAAU,GAAIC,EAAagB,EAAWuO,KA68N5E5G,GAAO6oB,OA/wEP,SAAgBpvB,EAAQl+B,EAAG03C,GAMzB,OAJE13C,GADG03C,EAAQC,GAAezZ,EAAQl+B,EAAG03C,QArucvC/mC,IAqucgD3Q,GAC1C,EAEAq7C,GAAUr7C,GAET2yC,GAAWj/B,GAASwqB,GAASl+B,IA0wEtCykC,GAAOngC,QApvEP,WACE,IAAIX,EAAOC,UACPs6B,EAASxqB,GAAS/P,EAAK,IAE3B,OAAOA,EAAK9B,OAAS,EAAIq8B,EAASA,EAAO55B,QAAQX,EAAK,GAAIA,EAAK,KAivEjE8gC,GAAOpwB,OAtoGP,SAAgBpU,EAAQyrB,EAAMyuB,GAG5B,IAAIn4C,GAAS,EACTH,GAHJ6pB,EAAO0gB,GAAS1gB,EAAMzrB,IAGJ4B,OAOlB,IAJKA,IACHA,EAAS,EACT5B,OAx3aF0Q,KA03aS3O,EAAQH,GAAQ,CACvB,IAAIrC,EAAkB,MAAVS,OA33ad0Q,EA23a2C1Q,EAAOosC,GAAM3gB,EAAK1pB,UA33a7D2O,IA43aMnR,IACFwC,EAAQH,EACRrC,EAAQ26C,GAEVl6C,EAASisC,GAAW1sC,GAASA,EAAMd,KAAKuB,GAAUT,EAEpD,OAAOS,GAonGTwkC,GAAO1pB,MAAQA,GACf0pB,GAAOpE,aAAeA,EACtBoE,GAAO8oB,OA15NP,SAAgBvsC,GAEd,OADWpf,GAAQof,GAAc2lB,GAAcqM,IACnChyB,IAy5NdyjB,GAAO55B,KA/0NP,SAAcmW,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIuvB,GAAYvvB,GACd,OAAOghC,GAAShhC,GAAc4e,GAAW5e,GAAcA,EAAWnf,OAEpE,IAAI6mC,EAAMC,GAAO3nB,GACjB,OAAI0nB,GAAOzT,GAAUyT,GAAOrT,EACnBrU,EAAWnW,KAEbmlC,GAAShvB,GAAYnf,QAq0N9B4iC,GAAOwf,UAAYA,GACnBxf,GAAO+oB,KA/xNP,SAAcxsC,EAAYkb,EAAWwb,GACnC,IAAI1jC,EAAOpS,GAAQof,GAAcgc,GAAYyW,GAI7C,OAHIiE,GAASC,GAAe32B,EAAYkb,EAAWwb,KACjDxb,OA/tTFvrB,GAiuTOqD,EAAKgN,EAAY2wB,GAAYzV,EAAW,KA2xNjDuI,GAAOgpB,YAhsRP,SAAqB9xB,EAAOn8B,GAC1B,OAAOk0C,GAAgB/X,EAAOn8B,IAgsRhCilC,GAAOipB,cApqRP,SAAuB/xB,EAAOn8B,EAAOq8B,GACnC,OAAOmY,GAAkBrY,EAAOn8B,EAAOmyC,GAAY9V,EAAU,KAoqR/D4I,GAAOkpB,cAjpRP,SAAuBhyB,EAAOn8B,GAC5B,IAAIqC,EAAkB,MAAT85B,EAAgB,EAAIA,EAAM95B,OACvC,GAAIA,EAAQ,CACV,IAAIG,EAAQ0xC,GAAgB/X,EAAOn8B,GACnC,GAAIwC,EAAQH,GAAUslC,GAAGxL,EAAM35B,GAAQxC,GACrC,OAAOwC,EAGX,OAAQ,GA0oRVyiC,GAAOmpB,gBArnRP,SAAyBjyB,EAAOn8B,GAC9B,OAAOk0C,GAAgB/X,EAAOn8B,GAAO,IAqnRvCilC,GAAOopB,kBAzlRP,SAA2BlyB,EAAOn8B,EAAOq8B,GACvC,OAAOmY,GAAkBrY,EAAOn8B,EAAOmyC,GAAY9V,EAAU,IAAI,IAylRnE4I,GAAOqpB,kBAtkRP,SAA2BnyB,EAAOn8B,GAEhC,GADsB,MAATm8B,EAAgB,EAAIA,EAAM95B,OAC3B,CACV,IAAIG,EAAQ0xC,GAAgB/X,EAAOn8B,GAAO,GAAQ,EAClD,GAAI2nC,GAAGxL,EAAM35B,GAAQxC,GACnB,OAAOwC,EAGX,OAAQ,GA+jRVyiC,GAAOyf,UAAYA,GACnBzf,GAAOspB,WA3oEP,SAAoB7vB,EAAQzyB,EAAQ8X,GAOlC,OANA2a,EAASxqB,GAASwqB,GAClB3a,EAAuB,MAAZA,EACP,EACAyjB,GAAUqU,GAAU93B,GAAW,EAAG2a,EAAOr8B,QAE7C4J,EAASmpC,GAAanpC,GACfyyB,EAAOn9B,MAAMwiB,EAAUA,EAAW9X,EAAO5J,SAAW4J,GAqoE7Dg5B,GAAOqhB,SAAWA,GAClBrhB,GAAOupB,IAzUP,SAAaryB,GACX,OAAQA,GAASA,EAAM95B,OACnB+7B,GAAQjC,EAAOkU,IACf,GAuUNpL,GAAOwpB,MA7SP,SAAetyB,EAAOE,GACpB,OAAQF,GAASA,EAAM95B,OACnB+7B,GAAQjC,EAAOgW,GAAY9V,EAAU,IACrC,GA2SN4I,GAAOypB,SA7hEP,SAAkBhwB,EAAQ54B,EAASoyC,GAIjC,IAAIyW,EAAW1pB,GAAOqG,iBAElB4M,GAASC,GAAezZ,EAAQ54B,EAASoyC,KAC3CpyC,OAj/cFqL,GAm/cAutB,EAASxqB,GAASwqB,GAClB54B,EAAUm9C,GAAa,GAAIn9C,EAAS6oD,EAAUjS,IAE9C,IAIIkS,EACAC,EALAC,EAAU7L,GAAa,GAAIn9C,EAAQgpD,QAASH,EAASG,QAASpS,IAC9DqS,EAActtB,GAAKqtB,GACnBE,EAAgBnwB,GAAWiwB,EAASC,GAIpCvsD,EAAQ,EACRysD,EAAcnpD,EAAQmpD,aAAex2B,GACrCvB,EAAS,WAGTg4B,EAAej4B,IAChBnxB,EAAQmlD,QAAUxyB,IAAWvB,OAAS,IACvC+3B,EAAY/3B,OAAS,KACpB+3B,IAAgB33B,EAAgBc,GAAeK,IAAWvB,OAAS,KACnEpxB,EAAQqpD,UAAY12B,IAAWvB,OAAS,KACzC,KAMEk4B,EAAY,kBACbxuD,GAAe1B,KAAK4G,EAAS,cACzBA,EAAQspD,UAAY,IAAItqD,QAAQ,MAAO,KACvC,6BAA+B01B,GAAmB,KACnD,KAENkE,EAAO55B,QAAQoqD,GAAc,SAASnqD,EAAOsqD,EAAaC,EAAkBC,EAAiBC,EAAepyB,GAsB1G,OArBAkyB,IAAqBA,EAAmBC,GAGxCr4B,GAAUwH,EAAOn9B,MAAMiB,EAAO46B,GAAQt4B,QAAQ4zB,GAAmBgH,IAG7D2vB,IACFT,GAAa,EACb13B,GAAU,YAAcm4B,EAAc,UAEpCG,IACFX,GAAe,EACf33B,GAAU,OAASs4B,EAAgB,eAEjCF,IACFp4B,GAAU,iBAAmBo4B,EAAmB,+BAElD9sD,EAAQ46B,EAASr4B,EAAM1C,OAIhB0C,KAGTmyB,GAAU,OAIV,IAAIu4B,EAAW7uD,GAAe1B,KAAK4G,EAAS,aAAeA,EAAQ2pD,SACnE,GAAKA,GAKA,GAAIv3B,GAA2BzhB,KAAKg5C,GACvC,MAAM,IAAIzuB,EA3idmB,2DAsid7B9J,EAAS,iBAAmBA,EAAS,QASvCA,GAAU23B,EAAe33B,EAAOpyB,QAAQ6xB,EAAsB,IAAMO,GACjEpyB,QAAQ8xB,EAAqB,MAC7B9xB,QAAQ+xB,EAAuB,OAGlCK,EAAS,aAAeu4B,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ33B,EACA,gBAEF,IAAIriB,EAASowC,IAAQ,WACnB,OAAOjxC,GAAS+6C,EAAaK,EAAY,UAAYl4B,GAClD3yB,WAnldL4M,EAmldsB69C,MAMtB,GADAn6C,EAAOqiB,OAASA,EACZmrB,GAAQxtC,GACV,MAAMA,EAER,OAAOA,GA46DTowB,GAAOyqB,MApsBP,SAAelvD,EAAG67B,GAEhB,IADA77B,EAAIq7C,GAAUr7C,IACN,GAAKA,EA5wfM,iBA6wfjB,MAAO,GAET,IAAIgC,EA1wfe,WA2wffH,EAAS+R,GAAU5T,EA3wfJ,YA8wfnBA,GA9wfmB,WAixfnB,IADA,IAAIqU,EAAS2pB,GAAUn8B,EAHvBg6B,EAAW8V,GAAY9V,MAId75B,EAAQhC,GACf67B,EAAS75B,GAEX,OAAOqS,GAsrBTowB,GAAOkW,SAAWA,GAClBlW,GAAO4W,UAAYA,GACnB5W,GAAO6d,SAAWA,GAClB7d,GAAO0qB,QAx5DP,SAAiB3vD,GACf,OAAOkU,GAASlU,GAAOkF,eAw5DzB+/B,GAAOjvB,SAAWA,GAClBivB,GAAO2qB,cApuIP,SAAuB5vD,GACrB,OAAOA,EACHwnC,GAAUqU,GAAU77C,IAlvYL,mCAmvYJ,IAAVA,EAAcA,EAAQ,GAkuI7BilC,GAAO/wB,SAAWA,GAClB+wB,GAAO4qB,QAn4DP,SAAiB7vD,GACf,OAAOkU,GAASlU,GAAO4kD,eAm4DzB3f,GAAO6qB,KA12DP,SAAcpxB,EAAQqc,EAAO7C,GAE3B,IADAxZ,EAASxqB,GAASwqB,MACHwZ,QAzqdf/mC,IAyqdwB4pC,GACtB,OAAOtc,GAASC,GAElB,IAAKA,KAAYqc,EAAQ3F,GAAa2F,IACpC,OAAOrc,EAET,IAAIS,EAAamB,GAAc5B,GAC3BU,EAAakB,GAAcya,GAI/B,OAAOxE,GAAUpX,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETrd,KAAK,KA81DhDkjB,GAAO8qB,QAx0DP,SAAiBrxB,EAAQqc,EAAO7C,GAE9B,IADAxZ,EAASxqB,GAASwqB,MACHwZ,QA5sdf/mC,IA4sdwB4pC,GACtB,OAAOrc,EAAOn9B,MAAM,EAAGo9B,GAAgBD,GAAU,GAEnD,IAAKA,KAAYqc,EAAQ3F,GAAa2F,IACpC,OAAOrc,EAET,IAAIS,EAAamB,GAAc5B,GAG/B,OAAO6X,GAAUpX,EAAY,EAFnBE,GAAcF,EAAYmB,GAAcya,IAAU,GAEvBh5B,KAAK,KA8zD5CkjB,GAAO+qB,UAxyDP,SAAmBtxB,EAAQqc,EAAO7C,GAEhC,IADAxZ,EAASxqB,GAASwqB,MACHwZ,QA7udf/mC,IA6udwB4pC,GACtB,OAAOrc,EAAO55B,QAAQ8yB,EAAa,IAErC,IAAK8G,KAAYqc,EAAQ3F,GAAa2F,IACpC,OAAOrc,EAET,IAAIS,EAAamB,GAAc5B,GAG/B,OAAO6X,GAAUpX,EAFLD,GAAgBC,EAAYmB,GAAcya,KAElBh5B,KAAK,KA8xD3CkjB,GAAOgrB,SAtvDP,SAAkBvxB,EAAQ54B,GACxB,IAAIzD,EAnvdmB,GAovdnB6tD,EAnvdqB,MAqvdzB,GAAIj6C,GAASnQ,GAAU,CACrB,IAAIqjD,EAAY,cAAerjD,EAAUA,EAAQqjD,UAAYA,EAC7D9mD,EAAS,WAAYyD,EAAU+1C,GAAU/1C,EAAQzD,QAAUA,EAC3D6tD,EAAW,aAAcpqD,EAAUsvC,GAAatvC,EAAQoqD,UAAYA,EAItE,IAAI5C,GAFJ5uB,EAASxqB,GAASwqB,IAEKr8B,OACvB,GAAIu9B,GAAWlB,GAAS,CACtB,IAAIS,EAAamB,GAAc5B,GAC/B4uB,EAAYnuB,EAAW98B,OAEzB,GAAIA,GAAUirD,EACZ,OAAO5uB,EAET,IAAIsV,EAAM3xC,EAAS+9B,GAAW8vB,GAC9B,GAAIlc,EAAM,EACR,OAAOkc,EAET,IAAIr7C,EAASsqB,EACToX,GAAUpX,EAAY,EAAG6U,GAAKjyB,KAAK,IACnC2c,EAAOn9B,MAAM,EAAGyyC,GAEpB,QAzzdA7iC,IAyzdIg4C,EACF,OAAOt0C,EAASq7C,EAKlB,GAHI/wB,IACF6U,GAAQn/B,EAAOxS,OAAS2xC,GAEtBnY,GAASstB,IACX,GAAIzqB,EAAOn9B,MAAMyyC,GAAKmc,OAAOhH,GAAY,CACvC,IAAIpkD,EACAqrD,EAAYv7C,EAMhB,IAJKs0C,EAAUv1C,SACbu1C,EAAYlyB,GAAOkyB,EAAUjyB,OAAQhjB,GAASmkB,GAAQ3E,KAAKy1B,IAAc,MAE3EA,EAAUt8B,UAAY,EACd9nB,EAAQokD,EAAUz1B,KAAK08B,IAC7B,IAAIC,EAAStrD,EAAMvC,MAErBqS,EAASA,EAAOtT,MAAM,OA30d1B4P,IA20d6Bk/C,EAAuBrc,EAAMqc,SAEnD,GAAI3xB,EAAOj8B,QAAQ2yC,GAAa+T,GAAYnV,IAAQA,EAAK,CAC9D,IAAIxxC,EAAQqS,EAAO63C,YAAYvD,GAC3B3mD,GAAS,IACXqS,EAASA,EAAOtT,MAAM,EAAGiB,IAG7B,OAAOqS,EAASq7C,GAksDlBjrB,GAAOqrB,SA5qDP,SAAkB5xB,GAEhB,OADAA,EAASxqB,GAASwqB,KACA1H,EAAiBvgB,KAAKioB,GACpCA,EAAO55B,QAAQgyB,EAAe6J,IAC9BjC,GAyqDNuG,GAAOsrB,SAvpBP,SAAkBC,GAChB,IAAIhoD,IAAO+4B,GACX,OAAOrtB,GAASs8C,GAAUhoD,GAspB5By8B,GAAO0f,UAAYA,GACnB1f,GAAOof,WAAaA,GAGpBpf,GAAOwrB,KAAOjtD,GACdyhC,GAAOyrB,UAAY7P,GACnB5b,GAAO0rB,MAAQxR,GAEfoG,GAAMtgB,IACA/N,GAAS,GACb0U,GAAW3G,IAAQ,SAASzwB,EAAM1Q,GAC3BlD,GAAe1B,KAAK+lC,GAAOtkC,UAAWmD,KACzCozB,GAAOpzB,GAAc0Q,MAGlB0iB,IACH,CAAE,OAAS,IAWjB+N,GAAO2rB,QA/ihBK,UAkjhBZr0B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASz4B,GACxFmhC,GAAOnhC,GAAYy7B,YAAc0F,MAInC1I,GAAU,CAAC,OAAQ,SAAS,SAASz4B,EAAYtB,GAC/C0iC,GAAYvkC,UAAUmD,GAAc,SAAStD,GAC3CA,OA5jhBF2Q,IA4jhBM3Q,EAAkB,EAAI2T,GAAU0nC,GAAUr7C,GAAI,GAElD,IAAIqU,EAAUzR,KAAK0iC,eAAiBtjC,EAChC,IAAI0iC,GAAY9hC,MAChBA,KAAKy7C,QAUT,OARIhqC,EAAOixB,aACTjxB,EAAOmxB,cAAgB5xB,GAAU5T,EAAGqU,EAAOmxB,eAE3CnxB,EAAOoxB,UAAUviC,KAAK,CACpB,KAAQ0Q,GAAU5T,EAvghBL,YAwghBb,KAAQsD,GAAc+Q,EAAOgxB,QAAU,EAAI,QAAU,MAGlDhxB,GAGTqwB,GAAYvkC,UAAUmD,EAAa,SAAW,SAAStD,GACrD,OAAO4C,KAAK2gC,UAAUjgC,GAAYtD,GAAGujC,cAKzCxH,GAAU,CAAC,SAAU,MAAO,cAAc,SAASz4B,EAAYtB,GAC7D,IAAIW,EAAOX,EAAQ,EACfquD,EAjihBe,GAiihBJ1tD,GA/hhBG,GA+hhByBA,EAE3C+hC,GAAYvkC,UAAUmD,GAAc,SAASu4B,GAC3C,IAAIxnB,EAASzR,KAAKy7C,QAMlB,OALAhqC,EAAOkxB,cAAcriC,KAAK,CACxB,SAAYyuC,GAAY9V,EAAU,GAClC,KAAQl5B,IAEV0R,EAAOixB,aAAejxB,EAAOixB,cAAgB+qB,EACtCh8C,MAKX0nB,GAAU,CAAC,OAAQ,SAAS,SAASz4B,EAAYtB,GAC/C,IAAIsuD,EAAW,QAAUtuD,EAAQ,QAAU,IAE3C0iC,GAAYvkC,UAAUmD,GAAc,WAClC,OAAOV,KAAK0tD,GAAU,GAAG9wD,QAAQ,OAKrCu8B,GAAU,CAAC,UAAW,SAAS,SAASz4B,EAAYtB,GAClD,IAAIuuD,EAAW,QAAUvuD,EAAQ,GAAK,SAEtC0iC,GAAYvkC,UAAUmD,GAAc,WAClC,OAAOV,KAAK0iC,aAAe,IAAIZ,GAAY9hC,MAAQA,KAAK2tD,GAAU,OAItE7rB,GAAYvkC,UAAUimD,QAAU,WAC9B,OAAOxjD,KAAK4e,OAAOquB,KAGrBnL,GAAYvkC,UAAUggD,KAAO,SAASjkB,GACpC,OAAOt5B,KAAK4e,OAAO0a,GAAWyiB,QAGhCja,GAAYvkC,UAAUigD,SAAW,SAASlkB,GACxC,OAAOt5B,KAAK2gC,UAAU4c,KAAKjkB,IAG7BwI,GAAYvkC,UAAUogD,UAAY3N,IAAS,SAASlnB,EAAM/nB,GACxD,MAAmB,mBAAR+nB,EACF,IAAIgZ,GAAY9hC,MAElBA,KAAKuH,KAAI,SAAS3K,GACvB,OAAO+tC,GAAW/tC,EAAOksB,EAAM/nB,SAInC+gC,GAAYvkC,UAAUioD,OAAS,SAASlsB,GACtC,OAAOt5B,KAAK4e,OAAO4/B,GAAOzP,GAAYzV,MAGxCwI,GAAYvkC,UAAUY,MAAQ,SAAS8xC,EAAOW,GAC5CX,EAAQwI,GAAUxI,GAElB,IAAIx+B,EAASzR,KACb,OAAIyR,EAAOixB,eAAiBuN,EAAQ,GAAKW,EAAM,GACtC,IAAI9O,GAAYrwB,IAErBw+B,EAAQ,EACVx+B,EAASA,EAAO20C,WAAWnW,GAClBA,IACTx+B,EAASA,EAAOsyC,KAAK9T,SAvphBvBliC,IAyphBI6iC,IAEFn/B,GADAm/B,EAAM6H,GAAU7H,IACD,EAAIn/B,EAAOuyC,WAAWpT,GAAOn/B,EAAO00C,KAAKvV,EAAMX,IAEzDx+B,IAGTqwB,GAAYvkC,UAAU8oD,eAAiB,SAAS/sB,GAC9C,OAAOt5B,KAAK2gC,UAAU2lB,UAAUhtB,GAAWqH,WAG7CmB,GAAYvkC,UAAU4gB,QAAU,WAC9B,OAAOne,KAAKmmD,KAtmhBO,aA0mhBrB3d,GAAW1G,GAAYvkC,WAAW,SAAS6T,EAAM1Q,GAC/C,IAAIktD,EAAgB,qCAAqCv6C,KAAK3S,GAC1DmtD,EAAU,kBAAkBx6C,KAAK3S,GACjCotD,EAAajsB,GAAOgsB,EAAW,QAAwB,QAAdntD,EAAuB,QAAU,IAAOA,GACjFqtD,EAAeF,GAAW,QAAQx6C,KAAK3S,GAEtCotD,IAGLjsB,GAAOtkC,UAAUmD,GAAc,WAC7B,IAAI9D,EAAQoD,KAAKoiC,YACbrhC,EAAO8sD,EAAU,CAAC,GAAK7sD,UACvBgtD,EAASpxD,aAAiBklC,GAC1B7I,EAAWl4B,EAAK,GAChBktD,EAAUD,GAAUhvD,GAAQpC,GAE5BwgD,EAAc,SAASxgD,GACzB,IAAI6U,EAASq8C,EAAW3sD,MAAM0gC,GAAQ/H,GAAU,CAACl9B,GAAQmE,IACzD,OAAQ8sD,GAAW1rB,EAAY1wB,EAAO,GAAKA,GAGzCw8C,GAAWL,GAAoC,mBAAZ30B,GAA6C,GAAnBA,EAASh6B,SAExE+uD,EAASC,GAAU,GAErB,IAAI9rB,EAAWniC,KAAKsiC,UAChB4rB,IAAaluD,KAAKqiC,YAAYpjC,OAC9BkvD,EAAcJ,IAAiB5rB,EAC/BisB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5BrxD,EAAQwxD,EAAWxxD,EAAQ,IAAIklC,GAAY9hC,MAC3C,IAAIyR,EAASL,EAAKjQ,MAAMvE,EAAOmE,GAE/B,OADA0Q,EAAO4wB,YAAY/hC,KAAK,CAAE,KAAQu1C,GAAM,KAAQ,CAACuH,GAAc,aA1shBnErvC,IA2shBW,IAAIg0B,GAActwB,EAAQ0wB,GAEnC,OAAIgsB,GAAeC,EACVh9C,EAAKjQ,MAAMnB,KAAMe,IAE1B0Q,EAASzR,KAAK61C,KAAKuH,GACZ+Q,EAAeN,EAAUp8C,EAAO7U,QAAQ,GAAK6U,EAAO7U,QAAW6U,QAK1E0nB,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASz4B,GACxE,IAAI0Q,EAAO0sB,GAAWp9B,GAClB2tD,EAAY,0BAA0Bh7C,KAAK3S,GAAc,MAAQ,OACjEqtD,EAAe,kBAAkB16C,KAAK3S,GAE1CmhC,GAAOtkC,UAAUmD,GAAc,WAC7B,IAAIK,EAAOC,UACX,GAAI+sD,IAAiB/tD,KAAKsiC,UAAW,CACnC,IAAI1lC,EAAQoD,KAAKpD,QACjB,OAAOwU,EAAKjQ,MAAMnC,GAAQpC,GAASA,EAAQ,GAAImE,GAEjD,OAAOf,KAAKquD,IAAW,SAASzxD,GAC9B,OAAOwU,EAAKjQ,MAAMnC,GAAQpC,GAASA,EAAQ,GAAImE,UAMrDynC,GAAW1G,GAAYvkC,WAAW,SAAS6T,EAAM1Q,GAC/C,IAAIotD,EAAajsB,GAAOnhC,GACxB,GAAIotD,EAAY,CACd,IAAI5wD,EAAM4wD,EAAW5xD,KAAO,GACvBsB,GAAe1B,KAAKqlC,GAAWjkC,KAClCikC,GAAUjkC,GAAO,IAEnBikC,GAAUjkC,GAAKoD,KAAK,CAAE,KAAQI,EAAY,KAAQotD,QAItD3sB,GAAUiV,QAnvhBRroC,EAiCqB,GAkthB+B7R,MAAQ,CAAC,CAC7D,KAAQ,UACR,UArvhBA6R,IAyvhBF+zB,GAAYvkC,UAAUk+C,MAh9dtB,WACE,IAAIhqC,EAAS,IAAIqwB,GAAY9hC,KAAKoiC,aAOlC,OANA3wB,EAAO4wB,YAAc8B,GAAUnkC,KAAKqiC,aACpC5wB,EAAOgxB,QAAUziC,KAAKyiC,QACtBhxB,EAAOixB,aAAe1iC,KAAK0iC,aAC3BjxB,EAAOkxB,cAAgBwB,GAAUnkC,KAAK2iC,eACtClxB,EAAOmxB,cAAgB5iC,KAAK4iC,cAC5BnxB,EAAOoxB,UAAYsB,GAAUnkC,KAAK6iC,WAC3BpxB,GAy8dTqwB,GAAYvkC,UAAUojC,QA97dtB,WACE,GAAI3gC,KAAK0iC,aAAc,CACrB,IAAIjxB,EAAS,IAAIqwB,GAAY9hC,MAC7ByR,EAAOgxB,SAAW,EAClBhxB,EAAOixB,cAAe,OAEtBjxB,EAASzR,KAAKy7C,SACPhZ,UAAY,EAErB,OAAOhxB,GAs7dTqwB,GAAYvkC,UAAUX,MA36dtB,WACE,IAAIm8B,EAAQ/4B,KAAKoiC,YAAYxlC,QACzB0xD,EAAMtuD,KAAKyiC,QACXe,EAAQxkC,GAAQ+5B,GAChBw1B,EAAUD,EAAM,EAChB7U,EAAYjW,EAAQzK,EAAM95B,OAAS,EACnCuvD,EA8pIN,SAAiBve,EAAOW,EAAK8N,GAC3B,IAAIt/C,GAAS,EACTH,EAASy/C,EAAWz/C,OAExB,OAASG,EAAQH,GAAQ,CACvB,IAAIiE,EAAOw7C,EAAWt/C,GAClB6I,EAAO/E,EAAK+E,KAEhB,OAAQ/E,EAAKnD,MACX,IAAK,OAAakwC,GAAShoC,EAAM,MACjC,IAAK,YAAa2oC,GAAO3oC,EAAM,MAC/B,IAAK,OAAa2oC,EAAM5/B,GAAU4/B,EAAKX,EAAQhoC,GAAO,MACtD,IAAK,YAAagoC,EAAQl/B,GAAUk/B,EAAOW,EAAM3oC,IAGrD,MAAO,CAAE,MAASgoC,EAAO,IAAOW,GA7qIrB6d,CAAQ,EAAGhV,EAAWz5C,KAAK6iC,WAClCoN,EAAQue,EAAKve,MACbW,EAAM4d,EAAK5d,IACX3xC,EAAS2xC,EAAMX,EACf7wC,EAAQmvD,EAAU3d,EAAOX,EAAQ,EACjCpB,EAAY7uC,KAAK2iC,cACjB+rB,EAAa7f,EAAU5vC,OACvBu6B,EAAW,EACXm1B,EAAY39C,GAAU/R,EAAQe,KAAK4iC,eAEvC,IAAKY,IAAW+qB,GAAW9U,GAAax6C,GAAU0vD,GAAa1vD,EAC7D,OAAOuzC,GAAiBzZ,EAAO/4B,KAAKqiC,aAEtC,IAAI5wB,EAAS,GAEbs2B,EACA,KAAO9oC,KAAYu6B,EAAWm1B,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbhyD,EAAQm8B,EAHZ35B,GAASkvD,KAKAM,EAAYF,GAAY,CAC/B,IAAIxrD,EAAO2rC,EAAU+f,GACjB31B,EAAW/1B,EAAK+1B,SAChBl5B,EAAOmD,EAAKnD,KACZioC,EAAW/O,EAASr8B,GAExB,GA7zDY,GA6zDRmD,EACFnD,EAAQorC,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTjoC,EACF,SAASgoC,EAET,MAAMA,GAIZt2B,EAAO+nB,KAAc58B,EAEvB,OAAO6U,GAg4dTowB,GAAOtkC,UAAUwiD,GAAK1C,GACtBxb,GAAOtkC,UAAU4/C,MA1iQjB,WACE,OAAOA,GAAMn9C,OA0iQf6hC,GAAOtkC,UAAUsxD,OA7gQjB,WACE,OAAO,IAAI9sB,GAAc/hC,KAAKpD,QAASoD,KAAKsiC,YA6gQ9CT,GAAOtkC,UAAUuP,KAp/PjB,gBA7wREiB,IA8wRI/N,KAAKwiC,aACPxiC,KAAKwiC,WAAarkB,GAAQne,KAAKpD,UAEjC,IAAI2iD,EAAOv/C,KAAKuiC,WAAaviC,KAAKwiC,WAAWvjC,OAG7C,MAAO,CAAE,KAAQsgD,EAAM,MAFXA,OAlxRZxxC,EAkxR+B/N,KAAKwiC,WAAWxiC,KAAKuiC,eAg/PtDV,GAAOtkC,UAAU44C,MA77PjB,SAAsBv5C,GAIpB,IAHA,IAAI6U,EACA7T,EAASoC,KAENpC,aAAkBskC,IAAY,CACnC,IAAIuZ,EAAQzZ,GAAapkC,GACzB69C,EAAMlZ,UAAY,EAClBkZ,EAAMjZ,gBA50RRz0B,EA60RM0D,EACF5E,EAASu1B,YAAcqZ,EAEvBhqC,EAASgqC,EAEX,IAAI5uC,EAAW4uC,EACf79C,EAASA,EAAOwkC,YAGlB,OADAv1B,EAASu1B,YAAcxlC,EAChB6U,GA66PTowB,GAAOtkC,UAAUojC,QAt5PjB,WACE,IAAI/jC,EAAQoD,KAAKoiC,YACjB,GAAIxlC,aAAiBklC,GAAa,CAChC,IAAIgtB,EAAUlyD,EAUd,OATIoD,KAAKqiC,YAAYpjC,SACnB6vD,EAAU,IAAIhtB,GAAY9hC,QAE5B8uD,EAAUA,EAAQnuB,WACV0B,YAAY/hC,KAAK,CACvB,KAAQu1C,GACR,KAAQ,CAAClV,IACT,aAx3RJ5yB,IA03RS,IAAIg0B,GAAc+sB,EAAS9uD,KAAKsiC,WAEzC,OAAOtiC,KAAK61C,KAAKlV,KAw4PnBkB,GAAOtkC,UAAUwxD,OAASltB,GAAOtkC,UAAU4V,QAAU0uB,GAAOtkC,UAAUX,MAv3PtE,WACE,OAAO41C,GAAiBxyC,KAAKoiC,YAAapiC,KAAKqiC,cAy3PjDR,GAAOtkC,UAAUgwD,MAAQ1rB,GAAOtkC,UAAUw+C,KAEtC3c,KACFyC,GAAOtkC,UAAU6hC,IAj+PnB,WACE,OAAOp/B,OAk+PF6hC,GAMDpE,GAQN9sB,GAAK6sB,EAAIA,QA1xhBPzvB,KA8xhBF,aACE,OAAOyvB,IACR,gCAaH1hC,KAAKkE,Q,wCCxzhBPtE,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOszD,kBACXtzD,EAAOuzD,UAAY,aACnBvzD,EAAOupC,MAAQ,GAEVvpC,EAAO+K,WAAU/K,EAAO+K,SAAW,IACxCpK,OAAOC,eAAeZ,EAAQ,SAAU,CACvCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOE,KAGhBS,OAAOC,eAAeZ,EAAQ,KAAM,CACnCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOC,KAGhBD,EAAOszD,gBAAkB,GAEnBtzD,I,oCCpBR,MAAMwzD,EAAS,IAAIpjD,MAAM,UAeZqjD,EAAkBC,IAC7B,MAAMC,EAAK,CACTD,KACAE,WAAYF,EAAGnxD,iBAAiB,cAChCsxD,UAAWH,EAAGtxD,cAAc,0BAG9BuxD,EAAGE,UAAUhuD,iBAAiB,QAAS,KACrC8tD,EAAGE,UAAUjpD,UAAU4oD,OAAO,aAE1BG,EAAGE,UAAUjpD,UAAU+Z,SAAS,aAElCgvC,EAAGC,WAAWlvD,QAASovD,IAGN,SAFAA,EAAU1xD,cAAc,uBAAuB8E,aAAa,gBAGzE4sD,EAAU1xD,cAAc,uBAAuBkJ,cAAckoD,KAMjEG,EAAGC,WAAWlvD,QAASovD,IAGN,UAFAA,EAAU1xD,cAAc,uBAAuB8E,aAAa,gBAGzE4sD,EAAU1xD,cAAc,uBAAuBkJ,cAAckoD,OAOrE,MAAM1jC,EACQ6jC,EAAGD,GAAGK,QAAQC,WAGtBC,EAAmBx0B,IAEvBk0B,EAAGC,WAAWlvD,QAASovD,IACrB,GAAIA,IAAcr0B,EAAS,CAGV,UAFAq0B,EAAU1xD,cAAc,uBAAuB8E,aAAa,gBAGzE4sD,EAAU1xD,cAAc,uBAAuBkJ,cAAckoD,OAM/DU,EAAYJ,IAChB,MAAMK,EAASL,EAAU1xD,cAAc,uBAGvC,GAAe,UAFA+xD,EAAOjtD,aAAa,eAEX,CACRitD,EAAO5xD,iBAAiB,SAEhCmC,QAAS0vD,IACbA,EAAKrwC,aAAa,WAAY,SAE3B,CACSowC,EAAO5xD,iBAAiB,SAEhCmC,QAAS0vD,IACbA,EAAKrwC,aAAa,YAAa,OAMnC4vC,EAAGC,WAAWlvD,QAASovD,IACrBA,EAAUjuD,iBAAiB,QAAS,IAAMquD,EAASJ,IAEnDA,EAAUjuD,iBAAiB,UAAY2V,IAA0B,KAAdA,EAAEpI,SAAkB8gD,EAASJ,OAGzD,SAArBhkC,GACF6jC,EAAGC,WAAWlvD,QAAS+6B,IACrBA,EAAQ55B,iBAAiB,QAAS,KAChCouD,EAAgBx0B,KAGlBA,EAAQ55B,iBAAiB,UAAY2V,IACjB,KAAdA,EAAEpI,SACJ6gD,EAAgBx0B,OAUxBk0B,EAAGC,WAAWlvD,QAASovD,IACrB,MAAMK,EAASL,EAAU1xD,cAAc,uBAGxB,UAFA+xD,EAAOjtD,aAAa,eAGnBitD,EAAO5xD,iBAAiB,SAEhCmC,QAAS0vD,IACbA,EAAKrwC,aAAa,WAAY,KAGlBowC,EAAO5xD,iBAAiB,SAEhCmC,QAAS0vD,IACbA,EAAKrwC,aAAa,YAAa,QAS1BswC,MAlIWX,IACxB,MAAMC,EAAK,CACTD,KACAY,QAASZ,EAAGtxD,cAAc,wBAG5BuxD,EAAGW,QAAQzuD,iBAAiB,UAAY2V,IACpB,KAAdA,EAAEpI,SACJugD,EAAGW,QAAQhpD,cAAckoD,M,gDCJfE,G,WAAAA,IACd,MAAMC,EAAK,CACTD,KACAvxC,UAAW7R,IAAO,uBAAwBojD,GAC1CjoD,MAAO6E,IAAOjO,IAAI,kBAAmBqxD,GACrChwD,MAAO4M,IAAO,mBAAoBojD,IAGpC,GAAIC,EAAGloD,MAAMlI,OAAS,EAAG,CACvB,MAAMgxD,EAAQ,IAAI9sD,IAASksD,EAAGxxC,UAAW,CACvCrT,gBAAgB,EAChBwhB,SAAU,EACVxR,MAAM,EACNP,cAAc,EACdgR,UAAU,EACVvgB,YAAY,EACZif,iBAAiB,EACjBsE,UAAU,IAGZgiC,EAAMhqD,GAAG,SAAW7G,IAClBiwD,EAAGjwD,MAAM8wD,UAAa9wD,EAAQ,IAIhChB,OAAOmD,iBAAiB,SAAUilD,IAAS,KACzCyJ,EAAMlrD,UAER,IACA,CACEgN,UAAU,EACVF,SAAS,QCwCAs+C,MA7EYf,IACzB,MAAMC,EAAK,CACTD,KACAS,OAAQT,EAAGtxD,cAAc,uBACzBoxD,YAAQnhD,GAGJyd,EAAQ,CACZ4kC,UAAuC,SAA5Bf,EAAGD,GAAGK,QAAQW,YAAwB,EACjDC,YAAY,EACZC,aAAcjB,EAAGD,GAAGK,QAAQa,cAAgB,EAC5CC,UAAMxiD,GAGFmhD,EAAS,IAAIpjD,MAAM,UAEnB8jD,EAAW,KACf,GAAIpkC,EAAM6kC,WACRhB,EAAGD,GAAGnoD,MAAMsD,OAASihB,EAAM8kC,aAE3BpvD,WAAW,KACTmuD,EAAGD,GAAG9oD,UAAUkJ,OAAO,gBACtB,KAECgc,EAAM+kC,OACJlB,EAAGH,QACLG,EAAGH,OAAOzvC,aAAa,iBAAiB,GAG1C4vC,EAAGQ,OAAOpwC,aAAa,eAAe,QAEnC,CACL,MAAMlV,EAAS8kD,EAAGQ,OAAOn3C,aACzB22C,EAAGD,GAAGnoD,MAAMsD,OAAYA,EAAF,KACtB8kD,EAAGD,GAAG9oD,UAAUC,IAAI,eAEhBilB,EAAM+kC,OACJlB,EAAGH,QACLG,EAAGH,OAAOzvC,aAAa,iBAAiB,GAG1C4vC,EAAGQ,OAAOpwC,aAAa,eAAe,IAI1C+L,EAAM6kC,YAAc7kC,EAAM6kC,YAK1BhB,EAAGD,GAAGnoD,MAAMsD,OAASihB,EAAM8kC,aAC3B9kC,EAAM+kC,KAA8B,MAAvB/kC,EAAM8kC,aAEnBjB,EAAGH,OAASrxD,SAASC,cAAe,IAAGuxD,EAAGD,GAAGhqD,yBAEzComB,EAAM4kC,YACRvyD,SAAS8wB,OAASihC,KAGhBP,EAAGH,SACD1jC,EAAM+kC,MACRlB,EAAGH,OAAOzvC,aAAa,iBAAiB,GAG1C4vC,EAAGH,OAAO3tD,iBAAiB,SAAU,KACnCquD,MAGFP,EAAGH,OAAO3tD,iBAAiB,QAAS,KAClC8tD,EAAGH,OAAOloD,cAAckoD,OCjCjBsB,MAlCSpB,IACtB,MAAMC,EAAK,CACTD,KACAjoD,MAAOioD,EAAGnxD,iBAAiB,kBAC3Bmc,IAAKpO,IAAO,gBAAiBojD,GAC7BqB,SAAUzkD,IAAO,uBACjB0kD,WAAY1kD,IAAO,0BAInBqjD,EAAGloD,MAAM/G,QAASgI,IAIhBA,EAAK7G,iBAAiB,QAAS,KAC7B,MAAMovD,EAASvoD,EAAKxF,aAAa,eAC3BguD,EAASxoD,EAAKxF,aAAa,eAC3B6tD,EAAWroD,EAAKxF,aAAa,iBAC7B8tD,EAAatoD,EAAKxF,aAAa,mBACrCysD,EAAGj1C,IAAIqF,aAAa,MAAOkxC,GAC3BtB,EAAGj1C,IAAIqF,aAAa,MAAOmxC,GAC3BvB,EAAGoB,SAASI,YAAcJ,EAC1BpB,EAAGqB,WAAWR,UAAYQ,OChBlBtB,MACd,MAAMC,EAAK,CACTD,KACAj1C,MAAOi1C,EAAGtxD,cAAc,UACxBgzD,IAAK1B,EAAGtxD,cAAc,oBACtBizD,MAAO3B,EAAGtxD,cAAc,sBACxBkzD,SAAU5B,EAAGtxD,cAAc,qBAGvB,IAAE2wB,GAAQ4gC,EAAGD,GAAGK,SAChB,OAAE/gC,GAAW2gC,EAAGD,GAAGK,QAEnBwB,EAAgBlyD,IAQDA,IAAQ,IAAI+hC,QAAQ,CAACsZ,EAASoL,KAC/C,MAAM0L,EAAc,IAAI9gC,MAExB8gC,EAAYnyD,EAAIgB,MAAQhB,EAAI0vB,IAC5ByiC,EAAYviC,OAAS,IAAMyrB,EAAQr7C,GACnCmyD,EAAYriC,QAAU,KACpB,MAAM,IAAI+O,MAAO,kBAAiB7+B,EAAIgB,aAAahB,EAAI0vB,UAI3D0iC,CAAUpyD,GAAKqyD,KAAMryD,IACnBswD,EAAGl1C,MAAMpb,EAAIgB,MAAQhB,EAAI0vB,IAEzBvtB,WAAW,KACTmuD,EAAGD,GAAG9oD,UAAUC,IAAI,aACpB8oD,EAAGD,GAAG9oD,UAAUkJ,OAAO,aACtB,OACF6hD,MAAOn6C,IAMRnV,QAAQivB,IAAI9Z,EAAEK,SAEdrW,WAAW,KACTmuD,EAAGD,GAAG9oD,UAAUkJ,OAAO,aACtB,QAeD8hD,EAAoB,KAOxB,MAAMR,EAAMzB,EAAGD,GAAGmC,wBAIhBT,EAAIU,KAAO,GACXV,EAAI1mD,MAAQ,GACZ0mD,EAAIzmD,QAAUjM,OAAOwL,YAAc/L,SAASqa,gBAAgBu5C,cAC5DX,EAAIY,OAASZ,EAAIvmD,SAAWnM,OAAOma,aAAe1a,SAASqa,gBAAgBy5C,eApB3EV,EADEviC,EACW,CAACD,IAAKC,EAAQ3uB,KAAM,UAEpB,CAAC0uB,IAAKA,EAAK1uB,KAAM,SA8BhCsvD,EAAGD,GAAG9oD,UAAUC,IAAI,YAOpBnI,OAAOmD,iBAAiB,SAAU,KAChC+vD,MAaFA,KCjHYlC,G,MAAAA,IACd,MAAMC,EAAK,CACTD,KACA7nD,IAAKyE,IAAO,wBAAyBojD,GACrCvpD,SAAUmG,IAAO,6BAA8BojD,GAC/CY,QAAShkD,IAAO,4BAA6BojD,IAGzCwC,EAAe,KACnB,MAAMjxC,EAAWqvC,QAAQpzD,MACnBi1D,EAAWxC,EAAG9nD,IAAIkqD,YAClBK,EAAgBzC,EAAGxpD,SAAS4rD,YAClC,IAAIz3B,EAAS,EAEG,KAAZrZ,IACFqZ,EAAS,KAEK,KAAZrZ,IACFqZ,EAAuC,IAA7B83B,EAAgBD,IAEZ,KAAZlxC,IACFqZ,EAAuC,GAA7B83B,EAAgBD,IAG5BxC,EAAG9nD,IAAIkY,aAAa,QAAS,yBAA2Bua,EAAS,QASnE57B,OAAOmD,iBAAiB,SAAUilD,IAAS,KACzCoL,KAEF,MAREvC,EAAGW,QAAQzuD,iBAAiB,SAAU,KACpCqwD,Q,iBCaSG,MA1CO3C,IACpB,MAAMC,EAAK,CACTD,KACA4C,SAAUhmD,IAAO,gBAAiBojD,GAClC6C,SAAUjmD,IAAO,uBAAwBojD,KAGrC,GAAEhqD,GAAOiqD,EAAGD,GAElBC,EAAGH,OAASrxD,SAASC,cAAe,WAAUsH,GAE9C,MAAM0Y,EAAS,IAAIV,IAAWiyC,EAAGD,IAG/BC,EAAGH,OAAO3tD,iBAAiB,QAAS,KAClCuc,EAAON,SAGTM,EAAO7X,GAAG,OAAQ,KAGhB,GAFAopD,EAAG2C,SAASrqC,OAER0nC,EAAG4C,SAAU,CACf,MAAMhC,EAAQ9sD,IAASD,KAAKmsD,EAAG4C,UAC/B5C,EAAG4C,SAAS3rD,UAAUC,IAAI,WAC1B0pD,EAAMlrD,YAIV+Y,EAAO7X,GAAG,OAAQ,KACZopD,EAAG4C,UACL5C,EAAG4C,SAAS3rD,UAAUkJ,OAAO,cC7BrB4/C,MACd,MAAMC,EAAK,CACTD,KACA8C,KAAMlmD,IAAOjO,IAAI,KAAMqxD,IAGzBC,EAAG8C,MAAQnmD,IAAOjO,IAAI,KAAMsxD,EAAG6C,KAAK,IAEpC7C,EAAG6C,KAAK9xD,QAASgyD,IACDpmD,IAAOjO,IAAI,KAAMq0D,GAEzBhyD,QAAQ,CAACgI,EAAMiqD,KACnBjqD,EAAKqX,aAAa,eAAgB4vC,EAAG8C,MAAME,GAAKC,gBCXtClD,MACd,MAAMC,EAAK,CACTD,KACAmD,SAAUvmD,IAAO,kBAAmBojD,GACpCoD,KAAMxmD,IAAOjO,IAAI,aAAcqxD,GAC/BqD,OAAQzmD,IAAO,oBAAqBojD,IAIhCa,EAAQ,IAAI9sD,IAASksD,EAAGoD,OAAQ,CACpCjoD,gBAAgB,EAChBwhB,UAAU,EACVxR,MAAM,EACNP,cAAc,EACdgR,UAAU,EACVtB,iBAAiB,IAIjBsmC,EAAMjkD,OAAO,GACbqjD,EAAGmD,KAAK,GAAGlsD,UAAUC,IAAI,aAM3B8oD,EAAGmD,KAAKpyD,QAAQ,CAACsyD,EAAKtzD,KACpBszD,EAAInxD,iBAAiB,QAAS,KAC5B0uD,EAAMjkD,OAAO5M,GACbiwD,EAAGmD,KAAKpyD,QAASvD,IACfA,EAAEyJ,UAAUkJ,OAAO,eAErBkjD,EAAIpsD,UAAUC,IAAI,aAClBmsD,EAAI/qC,WAKRsoC,EAAMhqD,GAAG,SAAW7G,IAClB6wD,EAAMlrD,WAGRkrD,EAAMhqD,GAAG,SAAW7G,IAClBiwD,EAAGmD,KAAKpyD,QAASvD,IACfA,EAAEyJ,UAAUkJ,OAAO,eAGrB6/C,EAAGmD,KAAKpzD,GAAOkH,UAAUC,IAAI,eAI/BnI,OAAOmD,iBAAiB,SAAUilD,IAAS,KACzCyJ,EAAMlrD,UAER,IACA,CACEgN,UAAU,EACVF,SAAS,MCrDE,MAVa8gD,IAC1B,MAAM,YAAElB,GAAgB5zD,SAAS6B,KAEjC,OAAI+xD,GAAekB,GCAd,MAAMC,EAAY,IAAI9mD,MAAM,aA4KpB+mD,MA1KEzD,IACf,MAAMC,EAAK,CACTD,KACA0D,KAAM1D,EAAGtxD,cAAc,mBACvBoxD,OAAQE,EAAGtxD,cAAc,oBACzBi1D,KAAM/mD,IAAO,kBAAmBojD,GAChCpvC,MAAOhU,IAAO,wBAAyBojD,GACvC4D,SAAUhnD,IAAO,2BAA4BnO,UAC7Co1D,KAAMjnD,IAAO,oBAAqBnO,UAClC8S,KAAM3E,IAAO,iBAAkBnO,UAC/Bq1D,WAAY,MAWR1nC,EAAQ,CACZ2nC,UAAU,EACVC,QAASC,EAJQ,MA8CbC,EAAcp8C,IAClB,GAAIm4C,EAAGyD,KAAM,CACX,MAAMS,EAAWvnD,IAAO,oBAAqBnO,UAEzC01D,GAAUA,EAASvsD,cAAc4rD,GAErCpnC,EAAM2nC,UAAW,EACjB9D,EAAGD,GAAG9oD,UAAUC,IAAI,WACpB8oD,EAAGH,OAAOzvC,aAAa,iBAAiB,IAED,IAAnC4zC,EAxDW,MAyDbhE,EAAG4D,KAAKtjD,gBAAgB,UACxB0/C,EAAG4D,KAAKxzC,aAAa,WAAY,IAEjC4vC,EAAG1+C,KAAKrK,UAAUC,IAAI,YAGR,OAAZ8oD,EAAG0D,MAAe1D,EAAG0D,KAAKtzC,aAAa,UAAU,GACpC,OAAb4vC,EAAGrvC,OAAgBqvC,EAAGrvC,MAAMrQ,gBAAgB,UAEjC,YAAXuH,EAAEnX,MACJsvD,EAAGyD,KAAKU,kBAAkBnlD,QA3D9BghD,EAAG6D,WAAalnD,IAAOjO,IAAI,QAASsxD,EAAGyD,MAEvCzD,EAAG6D,WAAW9yD,QAASqzD,IACrBA,EAAKlyD,iBAAiB,UAAY2V,IAChC,MAAM,QAAEpI,GAAYoI,EAEJ,KAAZpI,GACFoI,EAAE9I,iBAGY,KAAZU,GACqB,IAAnB0c,EAAM2nC,WACJM,EAAKC,uBACPD,EAAKC,uBAAuBrlD,QAE5BghD,EAAGyD,KAAKa,iBAAiBtlD,SAGR,KAAZS,GACc,IAAnB0c,EAAM2nC,WACJM,EAAKG,mBACPH,EAAKG,mBAAmBvlD,QAExBghD,EAAGyD,KAAKU,kBAAkBnlD,SAGT,IAAZS,KACa,IAAlB0c,EAAM4nC,SACR/D,EAAGD,GAAGpoD,cAAc4rD,GACpBvD,EAAGyD,KAAKY,uBAAuBrlD,SAE/BghD,EAAG4D,KAAK5kD,eAmCZwlD,EAAc,KAClBroC,EAAM2nC,UAAW,EACjB9D,EAAGD,GAAG9oD,UAAUkJ,OAAO,WAGvB6/C,EAAGH,OAAOzvC,aAAa,iBAAiB,GACxC4vC,EAAG1+C,KAAKrK,UAAUkJ,OAAO,YAER,OAAb6/C,EAAGrvC,OAAgBqvC,EAAGrvC,MAAMP,aAAa,UAAU,GACvC,OAAZ4vC,EAAG0D,MAAe1D,EAAG0D,KAAKpjD,gBAAgB,UAE9C0/C,EAAGH,OAAO7gD,SAGNylD,EAAoB58C,KACD,IAAnBsU,EAAM2nC,SACRG,EAAWp8C,GAEXm4C,EAAGD,GAAGpoD,cAAc4rD,IAKtBvD,EAAGD,GAAG7tD,iBAAiB,YAAasyD,GAEpCxE,EAAG2D,SAASzxD,iBAAiB,QAAS,KACpC8tD,EAAGD,GAAGpoD,cAAc4rD,KAGJ,OAAdvD,EAAGH,SACLG,EAAGH,OAAO3tD,iBAAiB,QAAU2V,IACnC48C,EAAiB58C,KAGnBm4C,EAAGH,OAAO3tD,iBAAiB,UAAY2V,IACrC,MAAM,QAAEpI,GAAYoI,EAWJ,IAAZpI,GACFoI,EAAE9I,iBAGY,KAAZU,GACFglD,EAAiB58C,IAIG,IAAlBsU,EAAM4nC,UACQ,KAAZtkD,GACqB,IAAnB0c,EAAM2nC,UACR9D,EAAGD,GAAGpoD,cAAc4rD,GAED,KAAZ9jD,EACTglD,EAAiB58C,GACK,KAAZpI,IAAsC,IAAnB0c,EAAM2nC,UACnCG,EAAWp8C,QC7JvB,MAAM68C,EAAgB,IAAIjoD,MAAM,iBAsPjBkoD,MApPY5E,IACzB,MAAMC,EAAK,CACTD,KACA6E,MAAOjoD,IAAOjO,IAAI,YAAaqxD,GAC/BF,OAAQljD,IAAO,sBAAuBojD,GACtC6D,KAAMjnD,IAAO,oBAAqBojD,GAClC8E,QAASloD,IAAO,eAAgBnO,UAChCs2D,aAAc,KACdC,aAAcpoD,IAAO,iBAAkBnO,UACvC6B,KAAMsM,IAAO,OAAQnO,WAKjBw2D,EAAgBC,GAAS9oC,EAAM+oC,WAAaD,EAE5C9oC,EAAQ,CACZ4nC,QAASC,EALQ,KAMjB7M,UAAU,EACVgO,SAAS,EACTC,YAAY,GAkCRC,EAAe,KACnBrF,EAAGD,GAAG9oD,UAAUkJ,OAAO,YACvB6/C,EAAGD,GAAG9oD,UAAUkJ,OAAO,YACvB6/C,EAAG+E,aAAa9tD,UAAUkJ,OAAO,YACjC6/C,EAAGH,OAAOzvC,aAAa,iBAAiB,GACxC4vC,EAAG3vD,KAAK4G,UAAUkJ,OAAO,aAEzBtO,WAAW,KACJsqB,EAAM4nC,SACT/D,EAAG4E,MAAM7zD,QAASqzD,IAChBA,EAAKh0C,aAAa,UAAU,GAC5Bg0C,EAAKntD,UAAUkJ,OAAO,WAEtBikD,EAAK31D,cAAc,oBAAoB2hB,aAAa,YAAa,GAEjEg0C,EAAKzsD,cAAc4rD,MAGtB,KAEHpnC,EAAMgpC,SAAU,EAChBhpC,EAAMipC,YAAa,GAGfE,EAAe,MACoB,IAAnCtB,EAnEa,MAoEfhE,EAAGD,GAAGpoD,cAAc+sD,GACpB1E,EAAG4E,MAAM7zD,QAASqzD,IAChBA,EAAK9jD,gBAAgB,UACrB8jD,EAAKntD,UAAUkJ,OAAO,aACRxD,IAAO,mBAAoBynD,GACnCh0C,aAAa,WAAY,KAGjC4vC,EAAGH,OAAOzvC,aAAa,UAAU,GACjC4vC,EAAGH,OAAOzvC,aAAa,YAAa,GAEZ,OAApB4vC,EAAG8E,cACL9E,EAAG8E,aAAa/zD,QAASqzD,IACvBA,EAAKmB,WAAWn1C,aAAa,WAAY,OAGD,IAAnC4zC,EApFM,OAqFfqB,IACArF,EAAGH,OAAOv/C,gBAAgB,UAC1B0/C,EAAGH,OAAOzvC,aAAa,WAAY,GAEnC4vC,EAAG4E,MAAM7zD,QAASqzD,IAChBA,EAAKntD,UAAUkJ,OAAO,aACtBikD,EAAK9jD,gBAAgB,UACP3D,IAAO,mBAAoBynD,GACnCh0C,aAAa,YAAa,KAGV,OAApB4vC,EAAG8E,cACL9E,EAAG8E,aAAa/zD,QAASqzD,IACvBA,EAAKmB,WAAWn1C,aAAa,WAAY,MAK/C+L,EAAM4nC,QAAUC,EAvGC,MA0GbwB,EAAgB39C,IACpBA,EAAE9I,kBAEoB,IAAlBod,EAAMgpC,QAzFSt9C,KACnB,MAAM,KAAEnX,GAASmX,EAEjBm4C,EAAGD,GAAG9oD,UAAUC,IAAI,YACpB8oD,EAAG+E,aAAa9tD,UAAUC,IAAI,YAC9B8oD,EAAGH,OAAOzvC,aAAa,iBAAiB,GACxC4vC,EAAG3vD,KAAK4G,UAAUC,IAAI,aAEtB8oD,EAAG4E,MAAM7zD,QAASqzD,IAChBA,EAAK9jD,gBAAgB,UAErB8jD,EAAK31D,cAAc,oBAAoB2hB,aAAa,WAAY,MAG5C,IAAlB+L,EAAM4nC,SAA8B,YAATrzD,GAC7BsvD,EAAG4E,MAAM,GAAGn2D,cAAc,oBAAoBuQ,QAGhDmd,EAAMgpC,SAAU,EAChBhpC,EAAMipC,YAAa,GAuEjBK,CAAY59C,GAEZw9C,KAIEK,EAAoB,KACxB32D,OAAOmD,iBAAiB,SAAU,KAC5BiqB,EAAM4nC,UAAYC,EAtHP,MAWF,EAACjiD,EAAM40C,KAAUjlD,MAET,IAAnByqB,EAAMg7B,WACRp1C,EAAKjQ,WAFS,EAEMJ,GACpByqB,EAAMg7B,UAAW,EACjBtlD,WAAW,KAAQsqB,EAAMg7B,UAAW,GAAUR,KAuG5CQ,CAASmO,EAAc,OAI3Bv2D,OAAOmD,iBAAiB,SAAW2V,IACjC,MAAM,YAAE9H,GAAgBhR,OAGtBi2D,EADEjlD,EAAc,IAOlB4lD,MAGF3F,EAAGD,GAAG7tD,iBAAiB,gBAAiB,KACtCmzD,MAGFrF,EAAGH,OAAO3tD,iBAAiB,QAAU2V,GAAM29C,EAAa39C,IACxDm4C,EAAGH,OAAO3tD,iBAAiB,UAAY2V,IACrC,GAAkB,KAAdA,EAAEpI,QACJ+lD,EAAa39C,QACR,GAAkB,IAAdA,EAAEpI,QAGX,GAFAoI,EAAE9I,iBAEEod,EAAMipC,WAAY,CACpB,MAAMlB,EAAWvnD,IAAO,qBAEPA,IAAO,QAASunD,GACxBllD,aACJ,GAAImd,EAAMgpC,QAAS,CACTxoD,IAAO,oBAAqBqjD,EAAG4E,MAAM,IAC7C5lD,WAKbghD,EAAG4E,MAAM7zD,QAAQ,CAACqzD,EAAMr0D,KACtB,MAAMwV,EAAS5I,IAAO,oBAAqBynD,GACrCwB,EAAQjpD,IAAO,mBAAoBynD,GAE1B,OAAX7+C,IACFA,EAAOrT,iBAAiB,QAAS,KAC/BiqB,EAAMipC,YAAa,EACnBpF,EAAGD,GAAG9oD,UAAUC,IAAI,cAGtBqO,EAAOrT,iBAAiB,UAAY2V,IAClC,MAAM,QAAEpI,GAAYoI,EAEJ,KAAZpI,IAEJ0c,EAAMipC,YAAa,EACnBpF,EAAGD,GAAG9oD,UAAUC,IAAI,gBAIxB0uD,EAAM1zD,iBAAiB,UAAY2V,IACjC,MAAM,QAAEpI,GAAYoI,GAEmB,IAAnCm8C,EAtLS,OAuLK,KAAZvkD,EACY,IAAV1P,EACFiwD,EAAG4E,MAAM70D,EAAQ,GAAGtB,cAAc,oBAAoBuQ,QAEtDghD,EAAG4E,MAAM5E,EAAG4E,MAAMh1D,OAAS,GAAGnB,cAAc,oBAAoBuQ,QAE7C,KAAZS,EACL1P,IAAUiwD,EAAG4E,MAAMh1D,OAAS,EAC9BowD,EAAG4E,MAAM70D,EAAQ,GAAGtB,cAAc,oBAAoBuQ,QAEtDghD,EAAG4E,MAAM,GAAGn2D,cAAc,oBAAoBuQ,QAE3B,IAAZS,IACToI,EAAE9I,iBACFihD,EAAGH,OAAO7gD,eAOd2mD,EAAe,KACfxpC,EAAM+oC,WACRlF,EAAG+E,aAAa9tD,UAAUC,IAAI,eAG9B8oD,EAAG+E,aAAa9tD,UAAUkJ,OAAO,iBAKI,IAAnC6jD,EAtNa,OAuNfhE,EAAGH,OAAOzvC,aAAa,UAAU,GACjC4vC,EAAGH,OAAOzvC,aAAa,YAAa,GAEpC4vC,EAAG4E,MAAM7zD,QAASqzD,IAChBA,EAAKntD,UAAUkJ,OAAO,aACtBikD,EAAK9jD,gBAAgB,UAErB8jD,EAAK31D,cAAc,oBAAoB2hB,aAAa,WAAY,MAIpEs1C,KClPW,UACb,IAAOh3D,IAAIJ,EAAUE,UAClBuC,QAASgvD,IACRtvD,EAAOsvD,MCCE,MANSA,IAChBhxD,OAAO82D,sBAA0Br3D,SAASs3D,cAC9C/F,EAAG9oD,UAAUC,IAAI,SCerB,MAAM6uD,EAAgB,GAAGh3D,OAAOi3D,SAASC,aAAal3D,OAAOi3D,SAASE,qBCjBvD,gBASb13D,SAAS0D,iBAAiB,mBAAoB,KAI5C,GAXAi0D,KAWKp3D,OAAOq3D,gBAAiB,OAWZ,IAAIC,iBATHC,IAChB,IAAK,IAAIh6D,EAAI,EAAGwM,EAAMwtD,EAAc12D,OAAQtD,EAAIwM,EAAKxM,IACnD,GAA8B,cAA1Bg6D,EAAch6D,GAAGoE,KAAsB,CAX/Cy1D,IAaM,SAQGI,QAAQ/3D,SAASg4D,eAAe,QAF1B,CAAEC,WAAW,EAAMC,SAAS,MAG1C,ID4BLC,CArBmB,KACjBC,EAAW,EAAW,cACtBA,EAAW9G,EAAgB,qBAC3B8G,EAAW,EAAgB,QAC3BA,EAAW,EAAU,aACrBA,EAAW,EAAY,eACvBA,EAAW,EAAS,YACpBA,EAAW,EAAO,wBAClBA,EAAW,EAAgB,oBAC3BA,EAAW,EAAO,UAClBA,EAAW,EAAY,eACvBA,EAAW,EAAS,aACpBA,EAAW,EAAO,mBAClBA,EAAW,EAAM,SE9CJ,KACb,MACMC,EAAS,IAAO,kBAGtB,GAAmB,iBAAR/lC,EACT,MAAM,IAAIyN,MAAM,wBAKds4B,GACFA,EAAO1mD,SAIT,MAAM2mD,EAAO,IAAIC,eACjBD,EAAKE,KAAK,MAAOlmC,GAAK,GACtBgmC,EAAKG,OACLH,EAAKxnC,OAAS,KACZ,IAAKwnC,EAAKI,cAAmD,SAAnCJ,EAAKI,aAAaC,OAAO,EAAG,GACpD,MAAM54B,MAAM,uBAEd,GAAIu4B,EAAKM,OAAS,KAAON,EAAKM,QAAU,IACtC,OAGF,MAAM73D,EAAMf,SAASiI,cAAc,OACnClH,EAAIwG,GA3BW,gBA4BfxG,EAAIqI,MAAMsD,OAAS,IACnB3L,EAAIsxD,UAAYiG,EAAKI,aAGrB14D,SAAS6B,KAAK0tB,aAAaxuB,EAAKf,SAAS6B,KAAK4f,WAAW,MFc3D,CAAQ81C","file":"bundle.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/assets/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 26);\n","module.exports = one;\nmodule.exports.all = all;\n\nfunction one (selector, parent) {\n parent || (parent = document);\n return parent.querySelector(selector);\n}\n\nfunction all (selector, parent) {\n parent || (parent = document);\n var selection = parent.querySelectorAll(selector);\n return Array.prototype.slice.call(selection);\n}\n","/**\n * Fizzy UI utils v2.0.7\n * MIT license\n */\n\n/*jshint browser: true, undef: true, unused: true, strict: true */\n\n( function( window, factory ) {\n // universal module definition\n /*jshint strict: false */ /*globals define, module, require */\n\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'desandro-matches-selector/matches-selector'\n ], function( matchesSelector ) {\n return factory( window, matchesSelector );\n });\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('desandro-matches-selector')\n );\n } else {\n // browser global\n window.fizzyUIUtils = factory(\n window,\n window.matchesSelector\n );\n }\n\n}( window, function factory( window, matchesSelector ) {\n\n'use strict';\n\nvar utils = {};\n\n// ----- extend ----- //\n\n// extends objects\nutils.extend = function( a, b ) {\n for ( var prop in b ) {\n a[ prop ] = b[ prop ];\n }\n return a;\n};\n\n// ----- modulo ----- //\n\nutils.modulo = function( num, div ) {\n return ( ( num % div ) + div ) % div;\n};\n\n// ----- makeArray ----- //\n\nvar arraySlice = Array.prototype.slice;\n\n// turn element or nodeList into an array\nutils.makeArray = function( obj ) {\n if ( Array.isArray( obj ) ) {\n // use object if already an array\n return obj;\n }\n // return empty array if undefined or null. #6\n if ( obj === null || obj === undefined ) {\n return [];\n }\n\n var isArrayLike = typeof obj == 'object' && typeof obj.length == 'number';\n if ( isArrayLike ) {\n // convert nodeList to array\n return arraySlice.call( obj );\n }\n\n // array of single index\n return [ obj ];\n};\n\n// ----- removeFrom ----- //\n\nutils.removeFrom = function( ary, obj ) {\n var index = ary.indexOf( obj );\n if ( index != -1 ) {\n ary.splice( index, 1 );\n }\n};\n\n// ----- getParent ----- //\n\nutils.getParent = function( elem, selector ) {\n while ( elem.parentNode && elem != document.body ) {\n elem = elem.parentNode;\n if ( matchesSelector( elem, selector ) ) {\n return elem;\n }\n }\n};\n\n// ----- getQueryElement ----- //\n\n// use element as selector string\nutils.getQueryElement = function( elem ) {\n if ( typeof elem == 'string' ) {\n return document.querySelector( elem );\n }\n return elem;\n};\n\n// ----- handleEvent ----- //\n\n// enable .ontype to trigger from .addEventListener( elem, 'type' )\nutils.handleEvent = function( event ) {\n var method = 'on' + event.type;\n if ( this[ method ] ) {\n this[ method ]( event );\n }\n};\n\n// ----- filterFindElements ----- //\n\nutils.filterFindElements = function( elems, selector ) {\n // make array of elems\n elems = utils.makeArray( elems );\n var ffElems = [];\n\n elems.forEach( function( elem ) {\n // check that elem is an actual element\n if ( !( elem instanceof HTMLElement ) ) {\n return;\n }\n // add elem if no selector\n if ( !selector ) {\n ffElems.push( elem );\n return;\n }\n // filter & find items if we have a selector\n // filter\n if ( matchesSelector( elem, selector ) ) {\n ffElems.push( elem );\n }\n // find children\n var childElems = elem.querySelectorAll( selector );\n // concat childElems to filterFound array\n for ( var i=0; i < childElems.length; i++ ) {\n ffElems.push( childElems[i] );\n }\n });\n\n return ffElems;\n};\n\n// ----- debounceMethod ----- //\n\nutils.debounceMethod = function( _class, methodName, threshold ) {\n threshold = threshold || 100;\n // original method\n var method = _class.prototype[ methodName ];\n var timeoutName = methodName + 'Timeout';\n\n _class.prototype[ methodName ] = function() {\n var timeout = this[ timeoutName ];\n clearTimeout( timeout );\n\n var args = arguments;\n var _this = this;\n this[ timeoutName ] = setTimeout( function() {\n method.apply( _this, args );\n delete _this[ timeoutName ];\n }, threshold );\n };\n};\n\n// ----- docReady ----- //\n\nutils.docReady = function( callback ) {\n var readyState = document.readyState;\n if ( readyState == 'complete' || readyState == 'interactive' ) {\n // do async to allow for other scripts to run. metafizzy/flickity#441\n setTimeout( callback );\n } else {\n document.addEventListener( 'DOMContentLoaded', callback );\n }\n};\n\n// ----- htmlInit ----- //\n\n// http://jamesroberts.name/blog/2010/02/22/string-functions-for-javascript-trim-to-camel-case-to-dashed-and-to-underscore/\nutils.toDashed = function( str ) {\n return str.replace( /(.)([A-Z])/g, function( match, $1, $2 ) {\n return $1 + '-' + $2;\n }).toLowerCase();\n};\n\nvar console = window.console;\n/**\n * allow user to initialize classes via [data-namespace] or .js-namespace class\n * htmlInit( Widget, 'widgetName' )\n * options are parsed from data-namespace-options\n */\nutils.htmlInit = function( WidgetClass, namespace ) {\n utils.docReady( function() {\n var dashedNamespace = utils.toDashed( namespace );\n var dataAttr = 'data-' + dashedNamespace;\n var dataAttrElems = document.querySelectorAll( '[' + dataAttr + ']' );\n var jsDashElems = document.querySelectorAll( '.js-' + dashedNamespace );\n var elems = utils.makeArray( dataAttrElems )\n .concat( utils.makeArray( jsDashElems ) );\n var dataOptionsAttr = dataAttr + '-options';\n var jQuery = window.jQuery;\n\n elems.forEach( function( elem ) {\n var attr = elem.getAttribute( dataAttr ) ||\n elem.getAttribute( dataOptionsAttr );\n var options;\n try {\n options = attr && JSON.parse( attr );\n } catch ( error ) {\n // log error, do not initialize\n if ( console ) {\n console.error( 'Error parsing ' + dataAttr + ' on ' + elem.className +\n ': ' + error );\n }\n return;\n }\n // initialize\n var instance = new WidgetClass( elem, options );\n // make available via $().data('namespace')\n if ( jQuery ) {\n jQuery.data( elem, namespace, instance );\n }\n });\n\n });\n};\n\n// ----- ----- //\n\nreturn utils;\n\n}));\n","/*!\n * Flickity v2.2.2\n * Touch, responsive, flickable carousels\n *\n * Licensed GPLv3 for open source use\n * or Flickity Commercial License for commercial use\n *\n * https://flickity.metafizzy.co\n * Copyright 2015-2021 Metafizzy\n */\n\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n './drag',\n './prev-next-button',\n './page-dots',\n './player',\n './add-remove-cell',\n './lazyload',\n ], factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n require('./flickity'),\n require('./drag'),\n require('./prev-next-button'),\n require('./page-dots'),\n require('./player'),\n require('./add-remove-cell'),\n require('./lazyload')\n );\n }\n\n} )( window, function factory( Flickity ) {\n return Flickity;\n} );\n","// Flickity main\n/* eslint-disable max-params */\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'ev-emitter/ev-emitter',\n 'get-size/get-size',\n 'fizzy-ui-utils/utils',\n './cell',\n './slide',\n './animate',\n ], function( EvEmitter, getSize, utils, Cell, Slide, animatePrototype ) {\n return factory( window, EvEmitter, getSize, utils, Cell, Slide, animatePrototype );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('ev-emitter'),\n require('get-size'),\n require('fizzy-ui-utils'),\n require('./cell'),\n require('./slide'),\n require('./animate')\n );\n } else {\n // browser global\n var _Flickity = window.Flickity;\n\n window.Flickity = factory(\n window,\n window.EvEmitter,\n window.getSize,\n window.fizzyUIUtils,\n _Flickity.Cell,\n _Flickity.Slide,\n _Flickity.animatePrototype\n );\n }\n\n}( window, function factory( window, EvEmitter, getSize,\n utils, Cell, Slide, animatePrototype ) {\n\n/* eslint-enable max-params */\n'use strict';\n\n// vars\nvar jQuery = window.jQuery;\nvar getComputedStyle = window.getComputedStyle;\nvar console = window.console;\n\nfunction moveElements( elems, toElem ) {\n elems = utils.makeArray( elems );\n while ( elems.length ) {\n toElem.appendChild( elems.shift() );\n }\n}\n\n// -------------------------- Flickity -------------------------- //\n\n// globally unique identifiers\nvar GUID = 0;\n// internal store of all Flickity intances\nvar instances = {};\n\nfunction Flickity( element, options ) {\n var queryElement = utils.getQueryElement( element );\n if ( !queryElement ) {\n if ( console ) {\n console.error( 'Bad element for Flickity: ' + ( queryElement || element ) );\n }\n return;\n }\n this.element = queryElement;\n // do not initialize twice on same element\n if ( this.element.flickityGUID ) {\n var instance = instances[ this.element.flickityGUID ];\n if ( instance ) instance.option( options );\n return instance;\n }\n\n // add jQuery\n if ( jQuery ) {\n this.$element = jQuery( this.element );\n }\n // options\n this.options = utils.extend( {}, this.constructor.defaults );\n this.option( options );\n\n // kick things off\n this._create();\n}\n\nFlickity.defaults = {\n accessibility: true,\n // adaptiveHeight: false,\n cellAlign: 'center',\n // cellSelector: undefined,\n // contain: false,\n freeScrollFriction: 0.075, // friction when free-scrolling\n friction: 0.28, // friction when selecting\n namespaceJQueryEvents: true,\n // initialIndex: 0,\n percentPosition: true,\n resize: true,\n selectedAttraction: 0.025,\n setGallerySize: true,\n // watchCSS: false,\n // wrapAround: false\n};\n\n// hash of methods triggered on _create()\nFlickity.createMethods = [];\n\nvar proto = Flickity.prototype;\n// inherit EventEmitter\nutils.extend( proto, EvEmitter.prototype );\n\nproto._create = function() {\n // add id for Flickity.data\n var id = this.guid = ++GUID;\n this.element.flickityGUID = id; // expando\n instances[ id ] = this; // associate via id\n // initial properties\n this.selectedIndex = 0;\n // how many frames slider has been in same position\n this.restingFrames = 0;\n // initial physics properties\n this.x = 0;\n this.velocity = 0;\n this.originSide = this.options.rightToLeft ? 'right' : 'left';\n // create viewport & slider\n this.viewport = document.createElement('div');\n this.viewport.className = 'flickity-viewport';\n this._createSlider();\n\n if ( this.options.resize || this.options.watchCSS ) {\n window.addEventListener( 'resize', this );\n }\n\n // add listeners from on option\n for ( var eventName in this.options.on ) {\n var listener = this.options.on[ eventName ];\n this.on( eventName, listener );\n }\n\n Flickity.createMethods.forEach( function( method ) {\n this[ method ]();\n }, this );\n\n if ( this.options.watchCSS ) {\n this.watchCSS();\n } else {\n this.activate();\n }\n\n};\n\n/**\n * set options\n * @param {Object} opts - options to extend\n */\nproto.option = function( opts ) {\n utils.extend( this.options, opts );\n};\n\nproto.activate = function() {\n if ( this.isActive ) {\n return;\n }\n this.isActive = true;\n this.element.classList.add('flickity-enabled');\n if ( this.options.rightToLeft ) {\n this.element.classList.add('flickity-rtl');\n }\n\n this.getSize();\n // move initial cell elements so they can be loaded as cells\n var cellElems = this._filterFindCellElements( this.element.children );\n moveElements( cellElems, this.slider );\n this.viewport.appendChild( this.slider );\n this.element.appendChild( this.viewport );\n // get cells from children\n this.reloadCells();\n\n if ( this.options.accessibility ) {\n // allow element to focusable\n this.element.tabIndex = 0;\n // listen for key presses\n this.element.addEventListener( 'keydown', this );\n }\n\n this.emitEvent('activate');\n this.selectInitialIndex();\n // flag for initial activation, for using initialIndex\n this.isInitActivated = true;\n // ready event. #493\n this.dispatchEvent('ready');\n};\n\n// slider positions the cells\nproto._createSlider = function() {\n // slider element does all the positioning\n var slider = document.createElement('div');\n slider.className = 'flickity-slider';\n slider.style[ this.originSide ] = 0;\n this.slider = slider;\n};\n\nproto._filterFindCellElements = function( elems ) {\n return utils.filterFindElements( elems, this.options.cellSelector );\n};\n\n// goes through all children\nproto.reloadCells = function() {\n // collection of item elements\n this.cells = this._makeCells( this.slider.children );\n this.positionCells();\n this._getWrapShiftCells();\n this.setGallerySize();\n};\n\n/**\n * turn elements into Flickity.Cells\n * @param {[Array, NodeList, HTMLElement]} elems - elements to make into cells\n * @returns {Array} items - collection of new Flickity Cells\n */\nproto._makeCells = function( elems ) {\n var cellElems = this._filterFindCellElements( elems );\n\n // create new Flickity for collection\n var cells = cellElems.map( function( cellElem ) {\n return new Cell( cellElem, this );\n }, this );\n\n return cells;\n};\n\nproto.getLastCell = function() {\n return this.cells[ this.cells.length - 1 ];\n};\n\nproto.getLastSlide = function() {\n return this.slides[ this.slides.length - 1 ];\n};\n\n// positions all cells\nproto.positionCells = function() {\n // size all cells\n this._sizeCells( this.cells );\n // position all cells\n this._positionCells( 0 );\n};\n\n/**\n * position certain cells\n * @param {Integer} index - which cell to start with\n */\nproto._positionCells = function( index ) {\n index = index || 0;\n // also measure maxCellHeight\n // start 0 if positioning all cells\n this.maxCellHeight = index ? this.maxCellHeight || 0 : 0;\n var cellX = 0;\n // get cellX\n if ( index > 0 ) {\n var startCell = this.cells[ index - 1 ];\n cellX = startCell.x + startCell.size.outerWidth;\n }\n var len = this.cells.length;\n for ( var i = index; i < len; i++ ) {\n var cell = this.cells[i];\n cell.setPosition( cellX );\n cellX += cell.size.outerWidth;\n this.maxCellHeight = Math.max( cell.size.outerHeight, this.maxCellHeight );\n }\n // keep track of cellX for wrap-around\n this.slideableWidth = cellX;\n // slides\n this.updateSlides();\n // contain slides target\n this._containSlides();\n // update slidesWidth\n this.slidesWidth = len ? this.getLastSlide().target - this.slides[0].target : 0;\n};\n\n/**\n * cell.getSize() on multiple cells\n * @param {Array} cells - cells to size\n */\nproto._sizeCells = function( cells ) {\n cells.forEach( function( cell ) {\n cell.getSize();\n } );\n};\n\n// -------------------------- -------------------------- //\n\nproto.updateSlides = function() {\n this.slides = [];\n if ( !this.cells.length ) {\n return;\n }\n\n var slide = new Slide( this );\n this.slides.push( slide );\n var isOriginLeft = this.originSide == 'left';\n var nextMargin = isOriginLeft ? 'marginRight' : 'marginLeft';\n\n var canCellFit = this._getCanCellFit();\n\n this.cells.forEach( function( cell, i ) {\n // just add cell if first cell in slide\n if ( !slide.cells.length ) {\n slide.addCell( cell );\n return;\n }\n\n var slideWidth = ( slide.outerWidth - slide.firstMargin ) +\n ( cell.size.outerWidth - cell.size[ nextMargin ] );\n\n if ( canCellFit.call( this, i, slideWidth ) ) {\n slide.addCell( cell );\n } else {\n // doesn't fit, new slide\n slide.updateTarget();\n\n slide = new Slide( this );\n this.slides.push( slide );\n slide.addCell( cell );\n }\n }, this );\n // last slide\n slide.updateTarget();\n // update .selectedSlide\n this.updateSelectedSlide();\n};\n\nproto._getCanCellFit = function() {\n var groupCells = this.options.groupCells;\n if ( !groupCells ) {\n return function() {\n return false;\n };\n } else if ( typeof groupCells == 'number' ) {\n // group by number. 3 -> [0,1,2], [3,4,5], ...\n var number = parseInt( groupCells, 10 );\n return function( i ) {\n return ( i % number ) !== 0;\n };\n }\n // default, group by width of slide\n // parse '75%\n var percentMatch = typeof groupCells == 'string' &&\n groupCells.match( /^(\\d+)%$/ );\n var percent = percentMatch ? parseInt( percentMatch[1], 10 ) / 100 : 1;\n return function( i, slideWidth ) {\n /* eslint-disable-next-line no-invalid-this */\n return slideWidth <= ( this.size.innerWidth + 1 ) * percent;\n };\n};\n\n// alias _init for jQuery plugin .flickity()\nproto._init =\nproto.reposition = function() {\n this.positionCells();\n this.positionSliderAtSelected();\n};\n\nproto.getSize = function() {\n this.size = getSize( this.element );\n this.setCellAlign();\n this.cursorPosition = this.size.innerWidth * this.cellAlign;\n};\n\nvar cellAlignShorthands = {\n // cell align, then based on origin side\n center: {\n left: 0.5,\n right: 0.5,\n },\n left: {\n left: 0,\n right: 1,\n },\n right: {\n right: 0,\n left: 1,\n },\n};\n\nproto.setCellAlign = function() {\n var shorthand = cellAlignShorthands[ this.options.cellAlign ];\n this.cellAlign = shorthand ? shorthand[ this.originSide ] : this.options.cellAlign;\n};\n\nproto.setGallerySize = function() {\n if ( this.options.setGallerySize ) {\n var height = this.options.adaptiveHeight && this.selectedSlide ?\n this.selectedSlide.height : this.maxCellHeight;\n this.viewport.style.height = height + 'px';\n }\n};\n\nproto._getWrapShiftCells = function() {\n // only for wrap-around\n if ( !this.options.wrapAround ) {\n return;\n }\n // unshift previous cells\n this._unshiftCells( this.beforeShiftCells );\n this._unshiftCells( this.afterShiftCells );\n // get before cells\n // initial gap\n var gapX = this.cursorPosition;\n var cellIndex = this.cells.length - 1;\n this.beforeShiftCells = this._getGapCells( gapX, cellIndex, -1 );\n // get after cells\n // ending gap between last cell and end of gallery viewport\n gapX = this.size.innerWidth - this.cursorPosition;\n // start cloning at first cell, working forwards\n this.afterShiftCells = this._getGapCells( gapX, 0, 1 );\n};\n\nproto._getGapCells = function( gapX, cellIndex, increment ) {\n // keep adding cells until the cover the initial gap\n var cells = [];\n while ( gapX > 0 ) {\n var cell = this.cells[ cellIndex ];\n if ( !cell ) {\n break;\n }\n cells.push( cell );\n cellIndex += increment;\n gapX -= cell.size.outerWidth;\n }\n return cells;\n};\n\n// ----- contain ----- //\n\n// contain cell targets so no excess sliding\nproto._containSlides = function() {\n if ( !this.options.contain || this.options.wrapAround || !this.cells.length ) {\n return;\n }\n var isRightToLeft = this.options.rightToLeft;\n var beginMargin = isRightToLeft ? 'marginRight' : 'marginLeft';\n var endMargin = isRightToLeft ? 'marginLeft' : 'marginRight';\n var contentWidth = this.slideableWidth - this.getLastCell().size[ endMargin ];\n // content is less than gallery size\n var isContentSmaller = contentWidth < this.size.innerWidth;\n // bounds\n var beginBound = this.cursorPosition + this.cells[0].size[ beginMargin ];\n var endBound = contentWidth - this.size.innerWidth * ( 1 - this.cellAlign );\n // contain each cell target\n this.slides.forEach( function( slide ) {\n if ( isContentSmaller ) {\n // all cells fit inside gallery\n slide.target = contentWidth * this.cellAlign;\n } else {\n // contain to bounds\n slide.target = Math.max( slide.target, beginBound );\n slide.target = Math.min( slide.target, endBound );\n }\n }, this );\n};\n\n// ----- ----- //\n\n/**\n * emits events via eventEmitter and jQuery events\n * @param {String} type - name of event\n * @param {Event} event - original event\n * @param {Array} args - extra arguments\n */\nproto.dispatchEvent = function( type, event, args ) {\n var emitArgs = event ? [ event ].concat( args ) : args;\n this.emitEvent( type, emitArgs );\n\n if ( jQuery && this.$element ) {\n // default trigger with type if no event\n type += this.options.namespaceJQueryEvents ? '.flickity' : '';\n var $event = type;\n if ( event ) {\n // create jQuery event\n var jQEvent = new jQuery.Event( event );\n jQEvent.type = type;\n $event = jQEvent;\n }\n this.$element.trigger( $event, args );\n }\n};\n\n// -------------------------- select -------------------------- //\n\n/**\n * @param {Integer} index - index of the slide\n * @param {Boolean} isWrap - will wrap-around to last/first if at the end\n * @param {Boolean} isInstant - will immediately set position at selected cell\n */\nproto.select = function( index, isWrap, isInstant ) {\n if ( !this.isActive ) {\n return;\n }\n index = parseInt( index, 10 );\n this._wrapSelect( index );\n\n if ( this.options.wrapAround || isWrap ) {\n index = utils.modulo( index, this.slides.length );\n }\n // bail if invalid index\n if ( !this.slides[ index ] ) {\n return;\n }\n var prevIndex = this.selectedIndex;\n this.selectedIndex = index;\n this.updateSelectedSlide();\n if ( isInstant ) {\n this.positionSliderAtSelected();\n } else {\n this.startAnimation();\n }\n if ( this.options.adaptiveHeight ) {\n this.setGallerySize();\n }\n // events\n this.dispatchEvent( 'select', null, [ index ] );\n // change event if new index\n if ( index != prevIndex ) {\n this.dispatchEvent( 'change', null, [ index ] );\n }\n // old v1 event name, remove in v3\n this.dispatchEvent('cellSelect');\n};\n\n// wraps position for wrapAround, to move to closest slide. #113\nproto._wrapSelect = function( index ) {\n var len = this.slides.length;\n var isWrapping = this.options.wrapAround && len > 1;\n if ( !isWrapping ) {\n return index;\n }\n var wrapIndex = utils.modulo( index, len );\n // go to shortest\n var delta = Math.abs( wrapIndex - this.selectedIndex );\n var backWrapDelta = Math.abs( ( wrapIndex + len ) - this.selectedIndex );\n var forewardWrapDelta = Math.abs( ( wrapIndex - len ) - this.selectedIndex );\n if ( !this.isDragSelect && backWrapDelta < delta ) {\n index += len;\n } else if ( !this.isDragSelect && forewardWrapDelta < delta ) {\n index -= len;\n }\n // wrap position so slider is within normal area\n if ( index < 0 ) {\n this.x -= this.slideableWidth;\n } else if ( index >= len ) {\n this.x += this.slideableWidth;\n }\n};\n\nproto.previous = function( isWrap, isInstant ) {\n this.select( this.selectedIndex - 1, isWrap, isInstant );\n};\n\nproto.next = function( isWrap, isInstant ) {\n this.select( this.selectedIndex + 1, isWrap, isInstant );\n};\n\nproto.updateSelectedSlide = function() {\n var slide = this.slides[ this.selectedIndex ];\n // selectedIndex could be outside of slides, if triggered before resize()\n if ( !slide ) {\n return;\n }\n // unselect previous selected slide\n this.unselectSelectedSlide();\n // update new selected slide\n this.selectedSlide = slide;\n slide.select();\n this.selectedCells = slide.cells;\n this.selectedElements = slide.getCellElements();\n // HACK: selectedCell & selectedElement is first cell in slide, backwards compatibility\n // Remove in v3?\n this.selectedCell = slide.cells[0];\n this.selectedElement = this.selectedElements[0];\n};\n\nproto.unselectSelectedSlide = function() {\n if ( this.selectedSlide ) {\n this.selectedSlide.unselect();\n }\n};\n\nproto.selectInitialIndex = function() {\n var initialIndex = this.options.initialIndex;\n // already activated, select previous selectedIndex\n if ( this.isInitActivated ) {\n this.select( this.selectedIndex, false, true );\n return;\n }\n // select with selector string\n if ( initialIndex && typeof initialIndex == 'string' ) {\n var cell = this.queryCell( initialIndex );\n if ( cell ) {\n this.selectCell( initialIndex, false, true );\n return;\n }\n }\n\n var index = 0;\n // select with number\n if ( initialIndex && this.slides[ initialIndex ] ) {\n index = initialIndex;\n }\n // select instantly\n this.select( index, false, true );\n};\n\n/**\n * select slide from number or cell element\n * @param {[Element, Number]} value - zero-based index or element to select\n * @param {Boolean} isWrap - enables wrapping around for extra index\n * @param {Boolean} isInstant - disables slide animation\n */\nproto.selectCell = function( value, isWrap, isInstant ) {\n // get cell\n var cell = this.queryCell( value );\n if ( !cell ) {\n return;\n }\n\n var index = this.getCellSlideIndex( cell );\n this.select( index, isWrap, isInstant );\n};\n\nproto.getCellSlideIndex = function( cell ) {\n // get index of slides that has cell\n for ( var i = 0; i < this.slides.length; i++ ) {\n var slide = this.slides[i];\n var index = slide.cells.indexOf( cell );\n if ( index != -1 ) {\n return i;\n }\n }\n};\n\n// -------------------------- get cells -------------------------- //\n\n/**\n * get Flickity.Cell, given an Element\n * @param {Element} elem - matching cell element\n * @returns {Flickity.Cell} cell - matching cell\n */\nproto.getCell = function( elem ) {\n // loop through cells to get the one that matches\n for ( var i = 0; i < this.cells.length; i++ ) {\n var cell = this.cells[i];\n if ( cell.element == elem ) {\n return cell;\n }\n }\n};\n\n/**\n * get collection of Flickity.Cells, given Elements\n * @param {[Element, Array, NodeList]} elems - multiple elements\n * @returns {Array} cells - Flickity.Cells\n */\nproto.getCells = function( elems ) {\n elems = utils.makeArray( elems );\n var cells = [];\n elems.forEach( function( elem ) {\n var cell = this.getCell( elem );\n if ( cell ) {\n cells.push( cell );\n }\n }, this );\n return cells;\n};\n\n/**\n * get cell elements\n * @returns {Array} cellElems\n */\nproto.getCellElements = function() {\n return this.cells.map( function( cell ) {\n return cell.element;\n } );\n};\n\n/**\n * get parent cell from an element\n * @param {Element} elem - child element\n * @returns {Flickit.Cell} cell - parent cell\n */\nproto.getParentCell = function( elem ) {\n // first check if elem is cell\n var cell = this.getCell( elem );\n if ( cell ) {\n return cell;\n }\n // try to get parent cell elem\n elem = utils.getParent( elem, '.flickity-slider > *' );\n return this.getCell( elem );\n};\n\n/**\n * get cells adjacent to a slide\n * @param {Integer} adjCount - number of adjacent slides\n * @param {Integer} index - index of slide to start\n * @returns {Array} cells - array of Flickity.Cells\n */\nproto.getAdjacentCellElements = function( adjCount, index ) {\n if ( !adjCount ) {\n return this.selectedSlide.getCellElements();\n }\n index = index === undefined ? this.selectedIndex : index;\n\n var len = this.slides.length;\n if ( 1 + ( adjCount * 2 ) >= len ) {\n return this.getCellElements();\n }\n\n var cellElems = [];\n for ( var i = index - adjCount; i <= index + adjCount; i++ ) {\n var slideIndex = this.options.wrapAround ? utils.modulo( i, len ) : i;\n var slide = this.slides[ slideIndex ];\n if ( slide ) {\n cellElems = cellElems.concat( slide.getCellElements() );\n }\n }\n return cellElems;\n};\n\n/**\n * select slide from number or cell element\n * @param {[Element, String, Number]} selector - element, selector string, or index\n * @returns {Flickity.Cell} - matching cell\n */\nproto.queryCell = function( selector ) {\n if ( typeof selector == 'number' ) {\n // use number as index\n return this.cells[ selector ];\n }\n if ( typeof selector == 'string' ) {\n // do not select invalid selectors from hash: #123, #/. #791\n if ( selector.match( /^[#.]?[\\d/]/ ) ) {\n return;\n }\n // use string as selector, get element\n selector = this.element.querySelector( selector );\n }\n // get cell from element\n return this.getCell( selector );\n};\n\n// -------------------------- events -------------------------- //\n\nproto.uiChange = function() {\n this.emitEvent('uiChange');\n};\n\n// keep focus on element when child UI elements are clicked\nproto.childUIPointerDown = function( event ) {\n // HACK iOS does not allow touch events to bubble up?!\n if ( event.type != 'touchstart' ) {\n event.preventDefault();\n }\n this.focus();\n};\n\n// ----- resize ----- //\n\nproto.onresize = function() {\n this.watchCSS();\n this.resize();\n};\n\nutils.debounceMethod( Flickity, 'onresize', 150 );\n\nproto.resize = function() {\n if ( !this.isActive ) {\n return;\n }\n this.getSize();\n // wrap values\n if ( this.options.wrapAround ) {\n this.x = utils.modulo( this.x, this.slideableWidth );\n }\n this.positionCells();\n this._getWrapShiftCells();\n this.setGallerySize();\n this.emitEvent('resize');\n // update selected index for group slides, instant\n // TODO: position can be lost between groups of various numbers\n var selectedElement = this.selectedElements && this.selectedElements[0];\n this.selectCell( selectedElement, false, true );\n};\n\n// watches the :after property, activates/deactivates\nproto.watchCSS = function() {\n var watchOption = this.options.watchCSS;\n if ( !watchOption ) {\n return;\n }\n\n var afterContent = getComputedStyle( this.element, ':after' ).content;\n // activate if :after { content: 'flickity' }\n if ( afterContent.indexOf('flickity') != -1 ) {\n this.activate();\n } else {\n this.deactivate();\n }\n};\n\n// ----- keydown ----- //\n\n// go previous/next if left/right keys pressed\nproto.onkeydown = function( event ) {\n // only work if element is in focus\n var isNotFocused = document.activeElement && document.activeElement != this.element;\n if ( !this.options.accessibility || isNotFocused ) {\n return;\n }\n\n var handler = Flickity.keyboardHandlers[ event.keyCode ];\n if ( handler ) {\n handler.call( this );\n }\n};\n\nFlickity.keyboardHandlers = {\n // left arrow\n 37: function() {\n var leftMethod = this.options.rightToLeft ? 'next' : 'previous';\n this.uiChange();\n this[ leftMethod ]();\n },\n // right arrow\n 39: function() {\n var rightMethod = this.options.rightToLeft ? 'previous' : 'next';\n this.uiChange();\n this[ rightMethod ]();\n },\n};\n\n// ----- focus ----- //\n\nproto.focus = function() {\n // TODO remove scrollTo once focus options gets more support\n // https://developer.mozilla.org/en-US/docs/Web/API/HTMLElement/focus ...\n // #Browser_compatibility\n var prevScrollY = window.pageYOffset;\n this.element.focus({ preventScroll: true });\n // hack to fix scroll jump after focus, #76\n if ( window.pageYOffset != prevScrollY ) {\n window.scrollTo( window.pageXOffset, prevScrollY );\n }\n};\n\n// -------------------------- destroy -------------------------- //\n\n// deactivate all Flickity functionality, but keep stuff available\nproto.deactivate = function() {\n if ( !this.isActive ) {\n return;\n }\n this.element.classList.remove('flickity-enabled');\n this.element.classList.remove('flickity-rtl');\n this.unselectSelectedSlide();\n // destroy cells\n this.cells.forEach( function( cell ) {\n cell.destroy();\n } );\n this.element.removeChild( this.viewport );\n // move child elements back into element\n moveElements( this.slider.children, this.element );\n if ( this.options.accessibility ) {\n this.element.removeAttribute('tabIndex');\n this.element.removeEventListener( 'keydown', this );\n }\n // set flags\n this.isActive = false;\n this.emitEvent('deactivate');\n};\n\nproto.destroy = function() {\n this.deactivate();\n window.removeEventListener( 'resize', this );\n this.allOff();\n this.emitEvent('destroy');\n if ( jQuery && this.$element ) {\n jQuery.removeData( this.element, 'flickity' );\n }\n delete this.element.flickityGUID;\n delete instances[ this.guid ];\n};\n\n// -------------------------- prototype -------------------------- //\n\nutils.extend( proto, animatePrototype );\n\n// -------------------------- extras -------------------------- //\n\n/**\n * get Flickity instance from element\n * @param {[Element, String]} elem - element or selector string\n * @returns {Flickity} - Flickity instance\n */\nFlickity.data = function( elem ) {\n elem = utils.getQueryElement( elem );\n var id = elem && elem.flickityGUID;\n return id && instances[ id ];\n};\n\nutils.htmlInit( Flickity, 'flickity' );\n\nif ( jQuery && jQuery.bridget ) {\n jQuery.bridget( 'flickity', Flickity );\n}\n\n// set internal jQuery, for Webpack + jQuery v3, #478\nFlickity.setJQuery = function( jq ) {\n jQuery = jq;\n};\n\nFlickity.Cell = Cell;\nFlickity.Slide = Slide;\n\nreturn Flickity;\n\n} ) );\n","/**\n * lodash (Custom Build) \n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery 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\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\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 */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n nativeMin = Math.min;\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 */\nvar now = function() {\n return root.Date.now();\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 */\nfunction 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 result = wait - timeSinceLastCall;\n\n return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\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 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 * 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 */\nfunction 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 * 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 */\nfunction isObject(value) {\n var type = typeof value;\n return !!value && (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 */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\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 */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && objectToString.call(value) == symbolTag);\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 */\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = throttle;\n","/**\n * EvEmitter v1.1.0\n * Lil' event emitter\n * MIT License\n */\n\n/* jshint unused: true, undef: true, strict: true */\n\n( function( global, factory ) {\n // universal module definition\n /* jshint strict: false */ /* globals define, module, window */\n if ( typeof define == 'function' && define.amd ) {\n // AMD - RequireJS\n define( factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS - Browserify, Webpack\n module.exports = factory();\n } else {\n // Browser globals\n global.EvEmitter = factory();\n }\n\n}( typeof window != 'undefined' ? window : this, function() {\n\n\"use strict\";\n\nfunction EvEmitter() {}\n\nvar proto = EvEmitter.prototype;\n\nproto.on = function( eventName, listener ) {\n if ( !eventName || !listener ) {\n return;\n }\n // set events hash\n var events = this._events = this._events || {};\n // set listeners array\n var listeners = events[ eventName ] = events[ eventName ] || [];\n // only add once\n if ( listeners.indexOf( listener ) == -1 ) {\n listeners.push( listener );\n }\n\n return this;\n};\n\nproto.once = function( eventName, listener ) {\n if ( !eventName || !listener ) {\n return;\n }\n // add event\n this.on( eventName, listener );\n // set once flag\n // set onceEvents hash\n var onceEvents = this._onceEvents = this._onceEvents || {};\n // set onceListeners object\n var onceListeners = onceEvents[ eventName ] = onceEvents[ eventName ] || {};\n // set flag\n onceListeners[ listener ] = true;\n\n return this;\n};\n\nproto.off = function( eventName, listener ) {\n var listeners = this._events && this._events[ eventName ];\n if ( !listeners || !listeners.length ) {\n return;\n }\n var index = listeners.indexOf( listener );\n if ( index != -1 ) {\n listeners.splice( index, 1 );\n }\n\n return this;\n};\n\nproto.emitEvent = function( eventName, args ) {\n var listeners = this._events && this._events[ eventName ];\n if ( !listeners || !listeners.length ) {\n return;\n }\n // copy over to avoid interference if .off() in listener\n listeners = listeners.slice(0);\n args = args || [];\n // once stuff\n var onceListeners = this._onceEvents && this._onceEvents[ eventName ];\n\n for ( var i=0; i < listeners.length; i++ ) {\n var listener = listeners[i]\n var isOnce = onceListeners && onceListeners[ listener ];\n if ( isOnce ) {\n // remove listener\n // remove before trigger to prevent recursion\n this.off( eventName, listener );\n // unset once flag\n delete onceListeners[ listener ];\n }\n // trigger listener\n listener.apply( this, args );\n }\n\n return this;\n};\n\nproto.allOff = function() {\n delete this._events;\n delete this._onceEvents;\n};\n\nreturn EvEmitter;\n\n}));\n","/*!\n * Unipointer v2.3.0\n * base class for doing one thing with pointer event\n * MIT license\n */\n\n/*jshint browser: true, undef: true, unused: true, strict: true */\n\n( function( window, factory ) {\n // universal module definition\n /* jshint strict: false */ /*global define, module, require */\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'ev-emitter/ev-emitter'\n ], function( EvEmitter ) {\n return factory( window, EvEmitter );\n });\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('ev-emitter')\n );\n } else {\n // browser global\n window.Unipointer = factory(\n window,\n window.EvEmitter\n );\n }\n\n}( window, function factory( window, EvEmitter ) {\n\n'use strict';\n\nfunction noop() {}\n\nfunction Unipointer() {}\n\n// inherit EvEmitter\nvar proto = Unipointer.prototype = Object.create( EvEmitter.prototype );\n\nproto.bindStartEvent = function( elem ) {\n this._bindStartEvent( elem, true );\n};\n\nproto.unbindStartEvent = function( elem ) {\n this._bindStartEvent( elem, false );\n};\n\n/**\n * Add or remove start event\n * @param {Boolean} isAdd - remove if falsey\n */\nproto._bindStartEvent = function( elem, isAdd ) {\n // munge isAdd, default to true\n isAdd = isAdd === undefined ? true : isAdd;\n var bindMethod = isAdd ? 'addEventListener' : 'removeEventListener';\n\n // default to mouse events\n var startEvent = 'mousedown';\n if ( window.PointerEvent ) {\n // Pointer Events\n startEvent = 'pointerdown';\n } else if ( 'ontouchstart' in window ) {\n // Touch Events. iOS Safari\n startEvent = 'touchstart';\n }\n elem[ bindMethod ]( startEvent, this );\n};\n\n// trigger handler methods for events\nproto.handleEvent = function( event ) {\n var method = 'on' + event.type;\n if ( this[ method ] ) {\n this[ method ]( event );\n }\n};\n\n// returns the touch that we're keeping track of\nproto.getTouch = function( touches ) {\n for ( var i=0; i < touches.length; i++ ) {\n var touch = touches[i];\n if ( touch.identifier == this.pointerIdentifier ) {\n return touch;\n }\n }\n};\n\n// ----- start event ----- //\n\nproto.onmousedown = function( event ) {\n // dismiss clicks from right or middle buttons\n var button = event.button;\n if ( button && ( button !== 0 && button !== 1 ) ) {\n return;\n }\n this._pointerDown( event, event );\n};\n\nproto.ontouchstart = function( event ) {\n this._pointerDown( event, event.changedTouches[0] );\n};\n\nproto.onpointerdown = function( event ) {\n this._pointerDown( event, event );\n};\n\n/**\n * pointer start\n * @param {Event} event\n * @param {Event or Touch} pointer\n */\nproto._pointerDown = function( event, pointer ) {\n // dismiss right click and other pointers\n // button = 0 is okay, 1-4 not\n if ( event.button || this.isPointerDown ) {\n return;\n }\n\n this.isPointerDown = true;\n // save pointer identifier to match up touch events\n this.pointerIdentifier = pointer.pointerId !== undefined ?\n // pointerId for pointer events, touch.indentifier for touch events\n pointer.pointerId : pointer.identifier;\n\n this.pointerDown( event, pointer );\n};\n\nproto.pointerDown = function( event, pointer ) {\n this._bindPostStartEvents( event );\n this.emitEvent( 'pointerDown', [ event, pointer ] );\n};\n\n// hash of events to be bound after start event\nvar postStartEvents = {\n mousedown: [ 'mousemove', 'mouseup' ],\n touchstart: [ 'touchmove', 'touchend', 'touchcancel' ],\n pointerdown: [ 'pointermove', 'pointerup', 'pointercancel' ],\n};\n\nproto._bindPostStartEvents = function( event ) {\n if ( !event ) {\n return;\n }\n // get proper events to match start event\n var events = postStartEvents[ event.type ];\n // bind events to node\n events.forEach( function( eventName ) {\n window.addEventListener( eventName, this );\n }, this );\n // save these arguments\n this._boundPointerEvents = events;\n};\n\nproto._unbindPostStartEvents = function() {\n // check for _boundEvents, in case dragEnd triggered twice (old IE8 bug)\n if ( !this._boundPointerEvents ) {\n return;\n }\n this._boundPointerEvents.forEach( function( eventName ) {\n window.removeEventListener( eventName, this );\n }, this );\n\n delete this._boundPointerEvents;\n};\n\n// ----- move event ----- //\n\nproto.onmousemove = function( event ) {\n this._pointerMove( event, event );\n};\n\nproto.onpointermove = function( event ) {\n if ( event.pointerId == this.pointerIdentifier ) {\n this._pointerMove( event, event );\n }\n};\n\nproto.ontouchmove = function( event ) {\n var touch = this.getTouch( event.changedTouches );\n if ( touch ) {\n this._pointerMove( event, touch );\n }\n};\n\n/**\n * pointer move\n * @param {Event} event\n * @param {Event or Touch} pointer\n * @private\n */\nproto._pointerMove = function( event, pointer ) {\n this.pointerMove( event, pointer );\n};\n\n// public\nproto.pointerMove = function( event, pointer ) {\n this.emitEvent( 'pointerMove', [ event, pointer ] );\n};\n\n// ----- end event ----- //\n\n\nproto.onmouseup = function( event ) {\n this._pointerUp( event, event );\n};\n\nproto.onpointerup = function( event ) {\n if ( event.pointerId == this.pointerIdentifier ) {\n this._pointerUp( event, event );\n }\n};\n\nproto.ontouchend = function( event ) {\n var touch = this.getTouch( event.changedTouches );\n if ( touch ) {\n this._pointerUp( event, touch );\n }\n};\n\n/**\n * pointer up\n * @param {Event} event\n * @param {Event or Touch} pointer\n * @private\n */\nproto._pointerUp = function( event, pointer ) {\n this._pointerDone();\n this.pointerUp( event, pointer );\n};\n\n// public\nproto.pointerUp = function( event, pointer ) {\n this.emitEvent( 'pointerUp', [ event, pointer ] );\n};\n\n// ----- pointer done ----- //\n\n// triggered on pointer up & pointer cancel\nproto._pointerDone = function() {\n this._pointerReset();\n this._unbindPostStartEvents();\n this.pointerDone();\n};\n\nproto._pointerReset = function() {\n // reset properties\n this.isPointerDown = false;\n delete this.pointerIdentifier;\n};\n\nproto.pointerDone = noop;\n\n// ----- pointer cancel ----- //\n\nproto.onpointercancel = function( event ) {\n if ( event.pointerId == this.pointerIdentifier ) {\n this._pointerCancel( event, event );\n }\n};\n\nproto.ontouchcancel = function( event ) {\n var touch = this.getTouch( event.changedTouches );\n if ( touch ) {\n this._pointerCancel( event, touch );\n }\n};\n\n/**\n * pointer cancel\n * @param {Event} event\n * @param {Event or Touch} pointer\n * @private\n */\nproto._pointerCancel = function( event, pointer ) {\n this._pointerDone();\n this.pointerCancel( event, pointer );\n};\n\n// public\nproto.pointerCancel = function( event, pointer ) {\n this.emitEvent( 'pointerCancel', [ event, pointer ] );\n};\n\n// ----- ----- //\n\n// utility function for getting x/y coords from event\nUnipointer.getPointerPoint = function( pointer ) {\n return {\n x: pointer.pageX,\n y: pointer.pageY\n };\n};\n\n// ----- ----- //\n\nreturn Unipointer;\n\n}));\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/*!\n * getSize v2.0.3\n * measure size of elements\n * MIT license\n */\n\n/* jshint browser: true, strict: true, undef: true, unused: true */\n/* globals console: false */\n\n( function( window, factory ) {\n /* jshint strict: false */ /* globals define, module */\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory();\n } else {\n // browser global\n window.getSize = factory();\n }\n\n})( window, function factory() {\n'use strict';\n\n// -------------------------- helpers -------------------------- //\n\n// get a number from a string, not a percentage\nfunction getStyleSize( value ) {\n var num = parseFloat( value );\n // not a percent like '100%', and a number\n var isValid = value.indexOf('%') == -1 && !isNaN( num );\n return isValid && num;\n}\n\nfunction noop() {}\n\nvar logError = typeof console == 'undefined' ? noop :\n function( message ) {\n console.error( message );\n };\n\n// -------------------------- measurements -------------------------- //\n\nvar measurements = [\n 'paddingLeft',\n 'paddingRight',\n 'paddingTop',\n 'paddingBottom',\n 'marginLeft',\n 'marginRight',\n 'marginTop',\n 'marginBottom',\n 'borderLeftWidth',\n 'borderRightWidth',\n 'borderTopWidth',\n 'borderBottomWidth'\n];\n\nvar measurementsLength = measurements.length;\n\nfunction getZeroSize() {\n var size = {\n width: 0,\n height: 0,\n innerWidth: 0,\n innerHeight: 0,\n outerWidth: 0,\n outerHeight: 0\n };\n for ( var i=0; i < measurementsLength; i++ ) {\n var measurement = measurements[i];\n size[ measurement ] = 0;\n }\n return size;\n}\n\n// -------------------------- getStyle -------------------------- //\n\n/**\n * getStyle, get style of element, check for Firefox bug\n * https://bugzilla.mozilla.org/show_bug.cgi?id=548397\n */\nfunction getStyle( elem ) {\n var style = getComputedStyle( elem );\n if ( !style ) {\n logError( 'Style returned ' + style +\n '. Are you running this code in a hidden iframe on Firefox? ' +\n 'See https://bit.ly/getsizebug1' );\n }\n return style;\n}\n\n// -------------------------- setup -------------------------- //\n\nvar isSetup = false;\n\nvar isBoxSizeOuter;\n\n/**\n * setup\n * check isBoxSizerOuter\n * do on first getSize() rather than on page load for Firefox bug\n */\nfunction setup() {\n // setup once\n if ( isSetup ) {\n return;\n }\n isSetup = true;\n\n // -------------------------- box sizing -------------------------- //\n\n /**\n * Chrome & Safari measure the outer-width on style.width on border-box elems\n * IE11 & Firefox<29 measures the inner-width\n */\n var div = document.createElement('div');\n div.style.width = '200px';\n div.style.padding = '1px 2px 3px 4px';\n div.style.borderStyle = 'solid';\n div.style.borderWidth = '1px 2px 3px 4px';\n div.style.boxSizing = 'border-box';\n\n var body = document.body || document.documentElement;\n body.appendChild( div );\n var style = getStyle( div );\n // round value for browser zoom. desandro/masonry#928\n isBoxSizeOuter = Math.round( getStyleSize( style.width ) ) == 200;\n getSize.isBoxSizeOuter = isBoxSizeOuter;\n\n body.removeChild( div );\n}\n\n// -------------------------- getSize -------------------------- //\n\nfunction getSize( elem ) {\n setup();\n\n // use querySeletor if elem is string\n if ( typeof elem == 'string' ) {\n elem = document.querySelector( elem );\n }\n\n // do not proceed on non-objects\n if ( !elem || typeof elem != 'object' || !elem.nodeType ) {\n return;\n }\n\n var style = getStyle( elem );\n\n // if hidden, everything is 0\n if ( style.display == 'none' ) {\n return getZeroSize();\n }\n\n var size = {};\n size.width = elem.offsetWidth;\n size.height = elem.offsetHeight;\n\n var isBorderBox = size.isBorderBox = style.boxSizing == 'border-box';\n\n // get all measurements\n for ( var i=0; i < measurementsLength; i++ ) {\n var measurement = measurements[i];\n var value = style[ measurement ];\n var num = parseFloat( value );\n // any 'auto', 'medium' value will be 0\n size[ measurement ] = !isNaN( num ) ? num : 0;\n }\n\n var paddingWidth = size.paddingLeft + size.paddingRight;\n var paddingHeight = size.paddingTop + size.paddingBottom;\n var marginWidth = size.marginLeft + size.marginRight;\n var marginHeight = size.marginTop + size.marginBottom;\n var borderWidth = size.borderLeftWidth + size.borderRightWidth;\n var borderHeight = size.borderTopWidth + size.borderBottomWidth;\n\n var isBorderBoxSizeOuter = isBorderBox && isBoxSizeOuter;\n\n // overwrite width and height if we can get it from style\n var styleWidth = getStyleSize( style.width );\n if ( styleWidth !== false ) {\n size.width = styleWidth +\n // add padding and border unless it's already including it\n ( isBorderBoxSizeOuter ? 0 : paddingWidth + borderWidth );\n }\n\n var styleHeight = getStyleSize( style.height );\n if ( styleHeight !== false ) {\n size.height = styleHeight +\n // add padding and border unless it's already including it\n ( isBorderBoxSizeOuter ? 0 : paddingHeight + borderHeight );\n }\n\n size.innerWidth = size.width - ( paddingWidth + borderWidth );\n size.innerHeight = size.height - ( paddingHeight + borderHeight );\n\n size.outerWidth = size.width + marginWidth;\n size.outerHeight = size.height + marginHeight;\n\n return size;\n}\n\nreturn getSize;\n\n});\n","/*!\n * Flickity imagesLoaded v2.0.0\n * enables imagesLoaded option for Flickity\n */\n\n/*jshint browser: true, strict: true, undef: true, unused: true */\n\n( function( window, factory ) {\n // universal module definition\n /*jshint strict: false */ /*globals define, module, require */\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'flickity/js/index',\n 'imagesloaded/imagesloaded'\n ], function( Flickity, imagesLoaded ) {\n return factory( window, Flickity, imagesLoaded );\n });\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('flickity'),\n require('imagesloaded')\n );\n } else {\n // browser global\n window.Flickity = factory(\n window,\n window.Flickity,\n window.imagesLoaded\n );\n }\n\n}( window, function factory( window, Flickity, imagesLoaded ) {\n'use strict';\n\nFlickity.createMethods.push('_createImagesLoaded');\n\nvar proto = Flickity.prototype;\n\nproto._createImagesLoaded = function() {\n this.on( 'activate', this.imagesLoaded );\n};\n\nproto.imagesLoaded = function() {\n if ( !this.options.imagesLoaded ) {\n return;\n }\n var _this = this;\n function onImagesLoadedProgress( instance, image ) {\n var cell = _this.getParentCell( image.img );\n _this.cellSizeChange( cell && cell.element );\n if ( !_this.options.freeScroll ) {\n _this.positionSliderAtSelected();\n }\n }\n imagesLoaded( this.slider ).on( 'progress', onImagesLoadedProgress );\n};\n\nreturn Flickity;\n\n}));\n","/**\n * Flickity fade v1.0.0\n * Fade between Flickity slides\n */\n\n/* jshint browser: true, undef: true, unused: true */\n\n( function( window, factory ) {\n // universal module definition\n /*globals define, module, require */\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'flickity/js/index',\n 'fizzy-ui-utils/utils',\n ], factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n require('flickity'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n factory(\n window.Flickity,\n window.fizzyUIUtils\n );\n }\n\n}( this, function factory( Flickity, utils ) {\n\n// ---- Slide ---- //\n\nvar Slide = Flickity.Slide;\n\nvar slideUpdateTarget = Slide.prototype.updateTarget;\nSlide.prototype.updateTarget = function() {\n slideUpdateTarget.apply( this, arguments );\n if ( !this.parent.options.fade ) {\n return;\n }\n // position cells at selected target\n var slideTargetX = this.target - this.x;\n var firstCellX = this.cells[0].x;\n this.cells.forEach( function( cell ) {\n var targetX = cell.x - firstCellX - slideTargetX;\n cell.renderPosition( targetX );\n });\n};\n\nSlide.prototype.setOpacity = function( alpha ) {\n this.cells.forEach( function( cell ) {\n cell.element.style.opacity = alpha;\n });\n};\n\n// ---- Flickity ---- //\n\nvar proto = Flickity.prototype;\n\nFlickity.createMethods.push('_createFade');\n\nproto._createFade = function() {\n this.fadeIndex = this.selectedIndex;\n this.prevSelectedIndex = this.selectedIndex;\n this.on( 'select', this.onSelectFade );\n this.on( 'dragEnd', this.onDragEndFade );\n this.on( 'settle', this.onSettleFade );\n this.on( 'activate', this.onActivateFade );\n this.on( 'deactivate', this.onDeactivateFade );\n};\n\nvar updateSlides = proto.updateSlides;\nproto.updateSlides = function() {\n updateSlides.apply( this, arguments );\n if ( !this.options.fade ) {\n return;\n }\n // set initial opacity\n this.slides.forEach( function( slide, i ) {\n var alpha = i == this.selectedIndex ? 1 : 0;\n slide.setOpacity( alpha );\n }, this );\n};\n\n/* ---- events ---- */\n\nproto.onSelectFade = function() {\n // in case of resize, keep fadeIndex within current count\n this.fadeIndex = Math.min( this.prevSelectedIndex, this.slides.length - 1 );\n this.prevSelectedIndex = this.selectedIndex;\n};\n\nproto.onSettleFade = function() {\n delete this.didDragEnd;\n if ( !this.options.fade ) {\n return;\n }\n // set full and 0 opacity on selected & faded slides\n this.selectedSlide.setOpacity( 1 );\n var fadedSlide = this.slides[ this.fadeIndex ];\n if ( fadedSlide && this.fadeIndex != this.selectedIndex ) {\n this.slides[ this.fadeIndex ].setOpacity( 0 );\n }\n};\n\nproto.onDragEndFade = function() {\n // set flag\n this.didDragEnd = true;\n};\n\nproto.onActivateFade = function() {\n if ( this.options.fade ) {\n this.element.classList.add('is-fade');\n }\n};\n\nproto.onDeactivateFade = function() {\n if ( !this.options.fade ) {\n return;\n }\n this.element.classList.remove('is-fade');\n // reset opacity\n this.slides.forEach( function( slide ) {\n slide.setOpacity('');\n });\n};\n\n/* ---- position & fading ---- */\n\nvar positionSlider = proto.positionSlider;\nproto.positionSlider = function() {\n if ( !this.options.fade ) {\n positionSlider.apply( this, arguments );\n return;\n }\n\n this.fadeSlides();\n this.dispatchScrollEvent();\n};\n\nvar positionSliderAtSelected = proto.positionSliderAtSelected;\nproto.positionSliderAtSelected = function() {\n if ( this.options.fade ) {\n // position fade slider at origin\n this.setTranslateX( 0 );\n }\n positionSliderAtSelected.apply( this, arguments );\n};\n\nproto.fadeSlides = function() {\n if ( this.slides.length < 2 ) {\n return;\n }\n // get slides to fade-in & fade-out\n var indexes = this.getFadeIndexes();\n var fadeSlideA = this.slides[ indexes.a ];\n var fadeSlideB = this.slides[ indexes.b ];\n var distance = this.wrapDifference( fadeSlideA.target, fadeSlideB.target );\n var progress = this.wrapDifference( fadeSlideA.target, -this.x );\n progress = progress / distance;\n\n fadeSlideA.setOpacity( 1 - progress );\n fadeSlideB.setOpacity( progress );\n\n // hide previous slide\n var fadeHideIndex = indexes.a;\n if ( this.isDragging ) {\n fadeHideIndex = progress > 0.5 ? indexes.a : indexes.b;\n }\n var isNewHideIndex = this.fadeHideIndex != undefined &&\n this.fadeHideIndex != fadeHideIndex &&\n this.fadeHideIndex != indexes.a &&\n this.fadeHideIndex != indexes.b;\n if ( isNewHideIndex ) {\n // new fadeHideSlide set, hide previous\n this.slides[ this.fadeHideIndex ].setOpacity( 0 );\n }\n this.fadeHideIndex = fadeHideIndex;\n};\n\nproto.getFadeIndexes = function() {\n if ( !this.isDragging && !this.didDragEnd ) {\n return {\n a: this.fadeIndex,\n b: this.selectedIndex,\n };\n }\n if ( this.options.wrapAround ) {\n return this.getFadeDragWrapIndexes();\n } else {\n return this.getFadeDragLimitIndexes();\n }\n};\n\nproto.getFadeDragWrapIndexes = function() {\n var distances = this.slides.map( function( slide, i ) {\n return this.getSlideDistance( -this.x, i );\n }, this );\n var absDistances = distances.map( function( distance ) {\n return Math.abs( distance );\n });\n var minDistance = Math.min.apply( Math, absDistances );\n var closestIndex = absDistances.indexOf( minDistance );\n var distance = distances[ closestIndex ];\n var len = this.slides.length;\n\n var delta = distance >= 0 ? 1 : -1;\n return {\n a: closestIndex,\n b: utils.modulo( closestIndex + delta, len ),\n };\n};\n\nproto.getFadeDragLimitIndexes = function() {\n // calculate closest previous slide\n var dragIndex = 0;\n for ( var i=0; i < this.slides.length - 1; i++ ) {\n var slide = this.slides[i];\n if ( -this.x < slide.target ) {\n break;\n }\n dragIndex = i;\n }\n return {\n a: dragIndex,\n b: dragIndex + 1,\n };\n};\n\nproto.wrapDifference = function( a, b ) {\n var diff = b - a;\n\n if ( !this.options.wrapAround ) {\n return diff;\n }\n\n var diffPlus = diff + this.slideableWidth;\n var diffMinus = diff - this.slideableWidth;\n if ( Math.abs( diffPlus ) < Math.abs( diff ) ) {\n diff = diffPlus;\n }\n if ( Math.abs( diffMinus ) < Math.abs( diff ) ) {\n diff = diffMinus;\n }\n return diff;\n};\n\n// ---- wrapAround ---- //\n\nvar _getWrapShiftCells = proto._getWrapShiftCells;\nproto._getWrapShiftCells = function() {\n if ( !this.options.fade ) {\n _getWrapShiftCells.apply( this, arguments );\n }\n};\n\nvar shiftWrapCells = proto.shiftWrapCells;\nproto.shiftWrapCells = function() {\n if ( !this.options.fade ) {\n shiftWrapCells.apply( this, arguments );\n }\n};\n\nreturn Flickity;\n\n}));\n","/* global NodeList, Element, Event, define */\n\n;(function (global) {\n 'use strict'\n\n var FOCUSABLE_ELEMENTS = [\n 'a[href]:not([tabindex^=\"-\"]):not([inert])',\n 'area[href]:not([tabindex^=\"-\"]):not([inert])',\n 'input:not([disabled]):not([inert])',\n 'select:not([disabled]):not([inert])',\n 'textarea:not([disabled]):not([inert])',\n 'button:not([disabled]):not([inert])',\n 'iframe:not([tabindex^=\"-\"]):not([inert])',\n 'audio:not([tabindex^=\"-\"]):not([inert])',\n 'video:not([tabindex^=\"-\"]):not([inert])',\n '[contenteditable]:not([tabindex^=\"-\"]):not([inert])',\n '[tabindex]:not([tabindex^=\"-\"]):not([inert])',\n ]\n var TAB_KEY = 9\n var ESCAPE_KEY = 27\n var focusedBeforeDialog\n\n /**\n * Define the constructor to instantiate a dialog\n *\n * @constructor\n * @param {Element} node\n * @param {(NodeList | Element | string)} targets\n */\n function A11yDialog(node, targets) {\n // Prebind the functions that will be bound in addEventListener and\n // removeEventListener to avoid losing references\n this._show = this.show.bind(this)\n this._hide = this.hide.bind(this)\n this._maintainFocus = this._maintainFocus.bind(this)\n this._bindKeypress = this._bindKeypress.bind(this)\n\n // Keep a reference of the node and the actual dialog on the instance\n this.container = node\n this.dialog = node.querySelector(\n 'dialog, [role=\"dialog\"], [role=\"alertdialog\"]'\n )\n this.role = this.dialog.getAttribute('role') || 'dialog'\n this.useDialog =\n 'show' in document.createElement('dialog') &&\n this.dialog.nodeName === 'DIALOG'\n\n // Keep an object of listener types mapped to callback functions\n this._listeners = {}\n\n // Initialise everything needed for the dialog to work properly\n this.create(targets)\n }\n\n /**\n * Set up everything necessary for the dialog to be functioning\n *\n * @param {(NodeList | Element | string)} targets\n * @return {this}\n */\n A11yDialog.prototype.create = function (targets) {\n // Keep a collection of nodes to disable/enable when toggling the dialog\n this._targets =\n this._targets || collect(targets) || getSiblings(this.container)\n\n // Set the `shown` property to match the status from the DOM\n this.shown = this.dialog.hasAttribute('open')\n\n // Despite using a `` element, `role=\"dialog\"` is not necessarily\n // implied by all screen-readers (yet)\n // See: https://github.com/edenspiekermann/a11y-dialog/commit/6ba711a777aed0dbda0719a18a02f742098c64d9#commitcomment-28694166\n this.dialog.setAttribute('role', this.role)\n\n if (!this.useDialog) {\n if (this.shown) {\n this.container.removeAttribute('aria-hidden')\n } else {\n this.container.setAttribute('aria-hidden', true)\n }\n } else {\n this.container.setAttribute('data-a11y-dialog-native', '')\n // Remove initial `aria-hidden` from container\n // See: https://github.com/edenspiekermann/a11y-dialog/pull/117#issuecomment-706056246\n this.container.removeAttribute('aria-hidden')\n }\n\n // Keep a collection of dialog openers, each of which will be bound a click\n // event listener to open the dialog\n this._openers = $$('[data-a11y-dialog-show=\"' + this.container.id + '\"]')\n this._openers.forEach(\n function (opener) {\n opener.addEventListener('click', this._show)\n }.bind(this)\n )\n\n // Keep a collection of dialog closers, each of which will be bound a click\n // event listener to close the dialog\n this._closers = $$('[data-a11y-dialog-hide]', this.container).concat(\n $$('[data-a11y-dialog-hide=\"' + this.container.id + '\"]')\n )\n this._closers.forEach(\n function (closer) {\n closer.addEventListener('click', this._hide)\n }.bind(this)\n )\n\n // Execute all callbacks registered for the `create` event\n this._fire('create')\n\n return this\n }\n\n /**\n * Show the dialog element, disable all the targets (siblings), trap the\n * current focus within it, listen for some specific key presses and fire all\n * registered callbacks for `show` event\n *\n * @param {Event} event\n * @return {this}\n */\n A11yDialog.prototype.show = function (event) {\n // If the dialog is already open, abort\n if (this.shown) {\n return this\n }\n\n this.shown = true\n\n // Keep a reference to the currently focused element to be able to restore\n // it later\n focusedBeforeDialog = document.activeElement\n\n if (this.useDialog) {\n this.dialog.showModal(event instanceof Event ? void 0 : event)\n } else {\n this.dialog.setAttribute('open', '')\n this.container.removeAttribute('aria-hidden')\n\n // Iterate over the targets to disable them by setting their `aria-hidden`\n // attribute to `true` and, if present, storing the current value of `aria-hidden`\n this._targets.forEach(function (target) {\n if (target.hasAttribute('aria-hidden')) {\n target.setAttribute(\n 'data-a11y-dialog-original-aria-hidden',\n target.getAttribute('aria-hidden')\n )\n }\n target.setAttribute('aria-hidden', 'true')\n })\n }\n\n // Set the focus to the first focusable child of the dialog element\n setFocusToFirstItem(this.dialog)\n\n // Bind a focus event listener to the body element to make sure the focus\n // stays trapped inside the dialog while open, and start listening for some\n // specific key presses (TAB and ESC)\n document.body.addEventListener('focus', this._maintainFocus, true)\n document.addEventListener('keydown', this._bindKeypress)\n\n // Execute all callbacks registered for the `show` event\n this._fire('show', event)\n\n return this\n }\n\n /**\n * Hide the dialog element, enable all the targets (siblings), restore the\n * focus to the previously active element, stop listening for some specific\n * key presses and fire all registered callbacks for `hide` event\n *\n * @param {Event} event\n * @return {this}\n */\n A11yDialog.prototype.hide = function (event) {\n // If the dialog is already closed, abort\n if (!this.shown) {\n return this\n }\n\n this.shown = false\n\n if (this.useDialog) {\n this.dialog.close(event instanceof Event ? void 0 : event)\n } else {\n this.dialog.removeAttribute('open')\n this.container.setAttribute('aria-hidden', 'true')\n\n // Iterate over the targets to enable them by removing their `aria-hidden`\n // attribute or resetting it to its original value\n this._targets.forEach(function (target) {\n if (target.hasAttribute('data-a11y-dialog-original-aria-hidden')) {\n target.setAttribute(\n 'aria-hidden',\n target.getAttribute('data-a11y-dialog-original-aria-hidden')\n )\n target.removeAttribute('data-a11y-dialog-original-aria-hidden')\n } else {\n target.removeAttribute('aria-hidden')\n }\n })\n }\n\n // If there was a focused element before the dialog was opened (and it has a\n // `focus` method), restore the focus back to it\n // See: https://github.com/edenspiekermann/a11y-dialog/issues/108\n if (focusedBeforeDialog && focusedBeforeDialog.focus) {\n focusedBeforeDialog.focus()\n }\n\n // Remove the focus event listener to the body element and stop listening\n // for specific key presses\n document.body.removeEventListener('focus', this._maintainFocus, true)\n document.removeEventListener('keydown', this._bindKeypress)\n\n // Execute all callbacks registered for the `hide` event\n this._fire('hide', event)\n\n return this\n }\n\n /**\n * Destroy the current instance (after making sure the dialog has been hidden)\n * and remove all associated listeners from dialog openers and closers\n *\n * @return {this}\n */\n A11yDialog.prototype.destroy = function () {\n // Hide the dialog to avoid destroying an open instance\n this.hide()\n\n // Remove the click event listener from all dialog openers\n this._openers.forEach(\n function (opener) {\n opener.removeEventListener('click', this._show)\n }.bind(this)\n )\n\n // Remove the click event listener from all dialog closers\n this._closers.forEach(\n function (closer) {\n closer.removeEventListener('click', this._hide)\n }.bind(this)\n )\n\n // Execute all callbacks registered for the `destroy` event\n this._fire('destroy')\n\n // Keep an object of listener types mapped to callback functions\n this._listeners = {}\n\n return this\n }\n\n /**\n * Register a new callback for the given event type\n *\n * @param {string} type\n * @param {Function} handler\n */\n A11yDialog.prototype.on = function (type, handler) {\n if (typeof this._listeners[type] === 'undefined') {\n this._listeners[type] = []\n }\n\n this._listeners[type].push(handler)\n\n return this\n }\n\n /**\n * Unregister an existing callback for the given event type\n *\n * @param {string} type\n * @param {Function} handler\n */\n A11yDialog.prototype.off = function (type, handler) {\n var index = this._listeners[type].indexOf(handler)\n\n if (index > -1) {\n this._listeners[type].splice(index, 1)\n }\n\n return this\n }\n\n /**\n * Iterate over all registered handlers for given type and call them all with\n * the dialog element as first argument, event as second argument (if any).\n *\n * @access private\n * @param {string} type\n * @param {Event} event\n */\n A11yDialog.prototype._fire = function (type, event) {\n var listeners = this._listeners[type] || []\n\n listeners.forEach(\n function (listener) {\n listener(this.container, event)\n }.bind(this)\n )\n }\n\n /**\n * Private event handler used when listening to some specific key presses\n * (namely ESCAPE and TAB)\n *\n * @access private\n * @param {Event} event\n */\n A11yDialog.prototype._bindKeypress = function (event) {\n // If the dialog is shown and the ESCAPE key is being pressed, prevent any\n // further effects from the ESCAPE key and hide the dialog, unless its role\n // is 'alertdialog', which should be modal\n if (\n this.shown &&\n event.which === ESCAPE_KEY &&\n this.role !== 'alertdialog'\n ) {\n event.preventDefault()\n this.hide(event)\n }\n\n // If the dialog is shown and the TAB key is being pressed, make sure the\n // focus stays trapped within the dialog element\n if (this.shown && event.which === TAB_KEY) {\n trapTabKey(this.dialog, event)\n }\n }\n\n /**\n * Private event handler used when making sure the focus stays within the\n * currently open dialog\n *\n * @access private\n * @param {Event} event\n */\n A11yDialog.prototype._maintainFocus = function (event) {\n // If the dialog is shown and the focus is not within the dialog element,\n // move it back to its first focusable child\n if (this.shown && !this.container.contains(event.target)) {\n setFocusToFirstItem(this.dialog)\n }\n }\n\n /**\n * Convert a NodeList into an array\n *\n * @param {NodeList} collection\n * @return {Array}\n */\n function toArray(collection) {\n return Array.prototype.slice.call(collection)\n }\n\n /**\n * Query the DOM for nodes matching the given selector, scoped to context (or\n * the whole document)\n *\n * @param {String} selector\n * @param {Element} [context = document]\n * @return {Array}\n */\n function $$(selector, context) {\n return toArray((context || document).querySelectorAll(selector))\n }\n\n /**\n * Return an array of Element based on given argument (NodeList, Element or\n * string representing a selector)\n *\n * @param {(NodeList | Element | string)} target\n * @return {Array}\n */\n function collect(target) {\n if (NodeList.prototype.isPrototypeOf(target)) {\n return toArray(target)\n }\n\n if (Element.prototype.isPrototypeOf(target)) {\n return [target]\n }\n\n if (typeof target === 'string') {\n return $$(target)\n }\n }\n\n /**\n * Set the focus to the first element with `autofocus` or the first focusable\n * child of the given element\n *\n * @param {Element} node\n */\n function setFocusToFirstItem(node) {\n var focusableChildren = getFocusableChildren(node)\n var focused = node.querySelector('[autofocus]') || focusableChildren[0]\n\n if (focused) {\n focused.focus()\n }\n }\n\n /**\n * Get the focusable children of the given element\n *\n * @param {Element} node\n * @return {Array}\n */\n function getFocusableChildren(node) {\n return $$(FOCUSABLE_ELEMENTS.join(','), node).filter(function (child) {\n return !!(\n child.offsetWidth ||\n child.offsetHeight ||\n child.getClientRects().length\n )\n })\n }\n\n /**\n * Trap the focus inside the given element\n *\n * @param {Element} node\n * @param {Event} event\n */\n function trapTabKey(node, event) {\n var focusableChildren = getFocusableChildren(node)\n var focusedItemIndex = focusableChildren.indexOf(document.activeElement)\n\n // If the SHIFT key is being pressed while tabbing (moving backwards) and\n // the currently focused item is the first one, move the focus to the last\n // focusable item from the dialog element\n if (event.shiftKey && focusedItemIndex === 0) {\n focusableChildren[focusableChildren.length - 1].focus()\n event.preventDefault()\n // If the SHIFT key is not being pressed (moving forwards) and the currently\n // focused item is the last one, move the focus to the first focusable item\n // from the dialog element\n } else if (\n !event.shiftKey &&\n focusedItemIndex === focusableChildren.length - 1\n ) {\n focusableChildren[0].focus()\n event.preventDefault()\n }\n }\n\n /**\n * Retrieve siblings from given element\n *\n * @param {Element} node\n * @return {Array}\n */\n function getSiblings(node) {\n var nodes = toArray(node.parentNode.childNodes)\n var siblings = nodes.filter(function (node) {\n return node.nodeType === 1\n })\n\n siblings.splice(siblings.indexOf(node), 1)\n\n return siblings\n }\n\n function instantiateDialogs() {\n $$('[data-a11y-dialog]').forEach(function (node) {\n new A11yDialog(node, node.getAttribute('data-a11y-dialog') || undefined)\n })\n }\n\n if (typeof global.document !== 'undefined') {\n var document = global.document\n\n if (document.readyState === 'loading') {\n document.addEventListener('DOMContentLoaded', instantiateDialogs)\n } else {\n if (global.requestAnimationFrame) {\n global.requestAnimationFrame(instantiateDialogs)\n } else {\n global.setTimeout(instantiateDialogs, 16)\n }\n }\n }\n\n if (typeof module !== 'undefined' && typeof module.exports !== 'undefined') {\n module.exports = A11yDialog\n } else if (typeof define === 'function' && define.amd) {\n define('A11yDialog', [], function () {\n return A11yDialog\n })\n } else if (typeof global === 'object') {\n global.A11yDialog = A11yDialog\n }\n})(typeof global !== 'undefined' ? global : window)\n","/**\n * matchesSelector v2.0.2\n * matchesSelector( element, '.selector' )\n * MIT license\n */\n\n/*jshint browser: true, strict: true, undef: true, unused: true */\n\n( function( window, factory ) {\n /*global define: false, module: false */\n 'use strict';\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory();\n } else {\n // browser global\n window.matchesSelector = factory();\n }\n\n}( window, function factory() {\n 'use strict';\n\n var matchesMethod = ( function() {\n var ElemProto = window.Element.prototype;\n // check for the standard method name first\n if ( ElemProto.matches ) {\n return 'matches';\n }\n // check un-prefixed\n if ( ElemProto.matchesSelector ) {\n return 'matchesSelector';\n }\n // check vendor prefixes\n var prefixes = [ 'webkit', 'moz', 'ms', 'o' ];\n\n for ( var i=0; i < prefixes.length; i++ ) {\n var prefix = prefixes[i];\n var method = prefix + 'MatchesSelector';\n if ( ElemProto[ method ] ) {\n return method;\n }\n }\n })();\n\n return function matchesSelector( elem, selector ) {\n return elem[ matchesMethod ]( selector );\n };\n\n}));\n","// Flickity.Cell\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'get-size/get-size',\n ], function( getSize ) {\n return factory( window, getSize );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('get-size')\n );\n } else {\n // browser global\n window.Flickity = window.Flickity || {};\n window.Flickity.Cell = factory(\n window,\n window.getSize\n );\n }\n\n}( window, function factory( window, getSize ) {\n\n'use strict';\n\nfunction Cell( elem, parent ) {\n this.element = elem;\n this.parent = parent;\n\n this.create();\n}\n\nvar proto = Cell.prototype;\n\nproto.create = function() {\n this.element.style.position = 'absolute';\n this.element.setAttribute( 'aria-hidden', 'true' );\n this.x = 0;\n this.shift = 0;\n};\n\nproto.destroy = function() {\n // reset style\n this.unselect();\n this.element.style.position = '';\n var side = this.parent.originSide;\n this.element.style[ side ] = '';\n this.element.removeAttribute('aria-hidden');\n};\n\nproto.getSize = function() {\n this.size = getSize( this.element );\n};\n\nproto.setPosition = function( x ) {\n this.x = x;\n this.updateTarget();\n this.renderPosition( x );\n};\n\n// setDefaultTarget v1 method, backwards compatibility, remove in v3\nproto.updateTarget = proto.setDefaultTarget = function() {\n var marginProperty = this.parent.originSide == 'left' ? 'marginLeft' : 'marginRight';\n this.target = this.x + this.size[ marginProperty ] +\n this.size.width * this.parent.cellAlign;\n};\n\nproto.renderPosition = function( x ) {\n // render position of cell with in slider\n var side = this.parent.originSide;\n this.element.style[ side ] = this.parent.getPositionValue( x );\n};\n\nproto.select = function() {\n this.element.classList.add('is-selected');\n this.element.removeAttribute('aria-hidden');\n};\n\nproto.unselect = function() {\n this.element.classList.remove('is-selected');\n this.element.setAttribute( 'aria-hidden', 'true' );\n};\n\n/**\n * @param {Integer} shift - 0, 1, or -1\n */\nproto.wrapShift = function( shift ) {\n this.shift = shift;\n this.renderPosition( this.x + this.parent.slideableWidth * shift );\n};\n\nproto.remove = function() {\n this.element.parentNode.removeChild( this.element );\n};\n\nreturn Cell;\n\n} ) );\n","// slide\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( factory );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory();\n } else {\n // browser global\n window.Flickity = window.Flickity || {};\n window.Flickity.Slide = factory();\n }\n\n}( window, function factory() {\n'use strict';\n\nfunction Slide( parent ) {\n this.parent = parent;\n this.isOriginLeft = parent.originSide == 'left';\n this.cells = [];\n this.outerWidth = 0;\n this.height = 0;\n}\n\nvar proto = Slide.prototype;\n\nproto.addCell = function( cell ) {\n this.cells.push( cell );\n this.outerWidth += cell.size.outerWidth;\n this.height = Math.max( cell.size.outerHeight, this.height );\n // first cell stuff\n if ( this.cells.length == 1 ) {\n this.x = cell.x; // x comes from first cell\n var beginMargin = this.isOriginLeft ? 'marginLeft' : 'marginRight';\n this.firstMargin = cell.size[ beginMargin ];\n }\n};\n\nproto.updateTarget = function() {\n var endMargin = this.isOriginLeft ? 'marginRight' : 'marginLeft';\n var lastCell = this.getLastCell();\n var lastMargin = lastCell ? lastCell.size[ endMargin ] : 0;\n var slideWidth = this.outerWidth - ( this.firstMargin + lastMargin );\n this.target = this.x + this.firstMargin + slideWidth * this.parent.cellAlign;\n};\n\nproto.getLastCell = function() {\n return this.cells[ this.cells.length - 1 ];\n};\n\nproto.select = function() {\n this.cells.forEach( function( cell ) {\n cell.select();\n } );\n};\n\nproto.unselect = function() {\n this.cells.forEach( function( cell ) {\n cell.unselect();\n } );\n};\n\nproto.getCellElements = function() {\n return this.cells.map( function( cell ) {\n return cell.element;\n } );\n};\n\nreturn Slide;\n\n} ) );\n","// animate\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'fizzy-ui-utils/utils',\n ], function( utils ) {\n return factory( window, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n window.Flickity = window.Flickity || {};\n window.Flickity.animatePrototype = factory(\n window,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, utils ) {\n\n'use strict';\n\n// -------------------------- animate -------------------------- //\n\nvar proto = {};\n\nproto.startAnimation = function() {\n if ( this.isAnimating ) {\n return;\n }\n\n this.isAnimating = true;\n this.restingFrames = 0;\n this.animate();\n};\n\nproto.animate = function() {\n this.applyDragForce();\n this.applySelectedAttraction();\n\n var previousX = this.x;\n\n this.integratePhysics();\n this.positionSlider();\n this.settle( previousX );\n // animate next frame\n if ( this.isAnimating ) {\n var _this = this;\n requestAnimationFrame( function animateFrame() {\n _this.animate();\n } );\n }\n};\n\nproto.positionSlider = function() {\n var x = this.x;\n // wrap position around\n if ( this.options.wrapAround && this.cells.length > 1 ) {\n x = utils.modulo( x, this.slideableWidth );\n x -= this.slideableWidth;\n this.shiftWrapCells( x );\n }\n\n this.setTranslateX( x, this.isAnimating );\n this.dispatchScrollEvent();\n};\n\nproto.setTranslateX = function( x, is3d ) {\n x += this.cursorPosition;\n // reverse if right-to-left and using transform\n x = this.options.rightToLeft ? -x : x;\n var translateX = this.getPositionValue( x );\n // use 3D transforms for hardware acceleration on iOS\n // but use 2D when settled, for better font-rendering\n this.slider.style.transform = is3d ?\n 'translate3d(' + translateX + ',0,0)' : 'translateX(' + translateX + ')';\n};\n\nproto.dispatchScrollEvent = function() {\n var firstSlide = this.slides[0];\n if ( !firstSlide ) {\n return;\n }\n var positionX = -this.x - firstSlide.target;\n var progress = positionX / this.slidesWidth;\n this.dispatchEvent( 'scroll', null, [ progress, positionX ] );\n};\n\nproto.positionSliderAtSelected = function() {\n if ( !this.cells.length ) {\n return;\n }\n this.x = -this.selectedSlide.target;\n this.velocity = 0; // stop wobble\n this.positionSlider();\n};\n\nproto.getPositionValue = function( position ) {\n if ( this.options.percentPosition ) {\n // percent position, round to 2 digits, like 12.34%\n return ( Math.round( ( position / this.size.innerWidth ) * 10000 ) * 0.01 ) + '%';\n } else {\n // pixel positioning\n return Math.round( position ) + 'px';\n }\n};\n\nproto.settle = function( previousX ) {\n // keep track of frames where x hasn't moved\n var isResting = !this.isPointerDown &&\n Math.round( this.x * 100 ) == Math.round( previousX * 100 );\n if ( isResting ) {\n this.restingFrames++;\n }\n // stop animating if resting for 3 or more frames\n if ( this.restingFrames > 2 ) {\n this.isAnimating = false;\n delete this.isFreeScrolling;\n // render position with translateX when settled\n this.positionSlider();\n this.dispatchEvent( 'settle', null, [ this.selectedIndex ] );\n }\n};\n\nproto.shiftWrapCells = function( x ) {\n // shift before cells\n var beforeGap = this.cursorPosition + x;\n this._shiftCells( this.beforeShiftCells, beforeGap, -1 );\n // shift after cells\n var afterGap = this.size.innerWidth - ( x + this.slideableWidth + this.cursorPosition );\n this._shiftCells( this.afterShiftCells, afterGap, 1 );\n};\n\nproto._shiftCells = function( cells, gap, shift ) {\n for ( var i = 0; i < cells.length; i++ ) {\n var cell = cells[i];\n var cellShift = gap > 0 ? shift : 0;\n cell.wrapShift( cellShift );\n gap -= cell.size.outerWidth;\n }\n};\n\nproto._unshiftCells = function( cells ) {\n if ( !cells || !cells.length ) {\n return;\n }\n for ( var i = 0; i < cells.length; i++ ) {\n cells[i].wrapShift( 0 );\n }\n};\n\n// -------------------------- physics -------------------------- //\n\nproto.integratePhysics = function() {\n this.x += this.velocity;\n this.velocity *= this.getFrictionFactor();\n};\n\nproto.applyForce = function( force ) {\n this.velocity += force;\n};\n\nproto.getFrictionFactor = function() {\n return 1 - this.options[ this.isFreeScrolling ? 'freeScrollFriction' : 'friction' ];\n};\n\nproto.getRestingPosition = function() {\n // my thanks to Steven Wittens, who simplified this math greatly\n return this.x + this.velocity / ( 1 - this.getFrictionFactor() );\n};\n\nproto.applyDragForce = function() {\n if ( !this.isDraggable || !this.isPointerDown ) {\n return;\n }\n // change the position to drag position by applying force\n var dragVelocity = this.dragX - this.x;\n var dragForce = dragVelocity - this.velocity;\n this.applyForce( dragForce );\n};\n\nproto.applySelectedAttraction = function() {\n // do not attract if pointer down or no slides\n var dragDown = this.isDraggable && this.isPointerDown;\n if ( dragDown || this.isFreeScrolling || !this.slides.length ) {\n return;\n }\n var distance = this.selectedSlide.target * -1 - this.x;\n var force = distance * this.options.selectedAttraction;\n this.applyForce( force );\n};\n\nreturn proto;\n\n} ) );\n","// drag\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n 'unidragger/unidragger',\n 'fizzy-ui-utils/utils',\n ], function( Flickity, Unidragger, utils ) {\n return factory( window, Flickity, Unidragger, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('./flickity'),\n require('unidragger'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n window.Flickity = factory(\n window,\n window.Flickity,\n window.Unidragger,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, Flickity, Unidragger, utils ) {\n\n'use strict';\n\n// ----- defaults ----- //\n\nutils.extend( Flickity.defaults, {\n draggable: '>1',\n dragThreshold: 3,\n} );\n\n// ----- create ----- //\n\nFlickity.createMethods.push('_createDrag');\n\n// -------------------------- drag prototype -------------------------- //\n\nvar proto = Flickity.prototype;\nutils.extend( proto, Unidragger.prototype );\nproto._touchActionValue = 'pan-y';\n\n// -------------------------- -------------------------- //\n\nvar isTouch = 'createTouch' in document;\nvar isTouchmoveScrollCanceled = false;\n\nproto._createDrag = function() {\n this.on( 'activate', this.onActivateDrag );\n this.on( 'uiChange', this._uiChangeDrag );\n this.on( 'deactivate', this.onDeactivateDrag );\n this.on( 'cellChange', this.updateDraggable );\n // TODO updateDraggable on resize? if groupCells & slides change\n // HACK - add seemingly innocuous handler to fix iOS 10 scroll behavior\n // #457, RubaXa/Sortable#973\n if ( isTouch && !isTouchmoveScrollCanceled ) {\n window.addEventListener( 'touchmove', function() {} );\n isTouchmoveScrollCanceled = true;\n }\n};\n\nproto.onActivateDrag = function() {\n this.handles = [ this.viewport ];\n this.bindHandles();\n this.updateDraggable();\n};\n\nproto.onDeactivateDrag = function() {\n this.unbindHandles();\n this.element.classList.remove('is-draggable');\n};\n\nproto.updateDraggable = function() {\n // disable dragging if less than 2 slides. #278\n if ( this.options.draggable == '>1' ) {\n this.isDraggable = this.slides.length > 1;\n } else {\n this.isDraggable = this.options.draggable;\n }\n if ( this.isDraggable ) {\n this.element.classList.add('is-draggable');\n } else {\n this.element.classList.remove('is-draggable');\n }\n};\n\n// backwards compatibility\nproto.bindDrag = function() {\n this.options.draggable = true;\n this.updateDraggable();\n};\n\nproto.unbindDrag = function() {\n this.options.draggable = false;\n this.updateDraggable();\n};\n\nproto._uiChangeDrag = function() {\n delete this.isFreeScrolling;\n};\n\n// -------------------------- pointer events -------------------------- //\n\nproto.pointerDown = function( event, pointer ) {\n if ( !this.isDraggable ) {\n this._pointerDownDefault( event, pointer );\n return;\n }\n var isOkay = this.okayPointerDown( event );\n if ( !isOkay ) {\n return;\n }\n\n this._pointerDownPreventDefault( event );\n this.pointerDownFocus( event );\n // blur\n if ( document.activeElement != this.element ) {\n // do not blur if already focused\n this.pointerDownBlur();\n }\n\n // stop if it was moving\n this.dragX = this.x;\n this.viewport.classList.add('is-pointer-down');\n // track scrolling\n this.pointerDownScroll = getScrollPosition();\n window.addEventListener( 'scroll', this );\n\n this._pointerDownDefault( event, pointer );\n};\n\n// default pointerDown logic, used for staticClick\nproto._pointerDownDefault = function( event, pointer ) {\n // track start event position\n // Safari 9 overrides pageX and pageY. These values needs to be copied. #779\n this.pointerDownPointer = {\n pageX: pointer.pageX,\n pageY: pointer.pageY,\n };\n // bind move and end events\n this._bindPostStartEvents( event );\n this.dispatchEvent( 'pointerDown', event, [ pointer ] );\n};\n\nvar focusNodes = {\n INPUT: true,\n TEXTAREA: true,\n SELECT: true,\n};\n\nproto.pointerDownFocus = function( event ) {\n var isFocusNode = focusNodes[ event.target.nodeName ];\n if ( !isFocusNode ) {\n this.focus();\n }\n};\n\nproto._pointerDownPreventDefault = function( event ) {\n var isTouchStart = event.type == 'touchstart';\n var isTouchPointer = event.pointerType == 'touch';\n var isFocusNode = focusNodes[ event.target.nodeName ];\n if ( !isTouchStart && !isTouchPointer && !isFocusNode ) {\n event.preventDefault();\n }\n};\n\n// ----- move ----- //\n\nproto.hasDragStarted = function( moveVector ) {\n return Math.abs( moveVector.x ) > this.options.dragThreshold;\n};\n\n// ----- up ----- //\n\nproto.pointerUp = function( event, pointer ) {\n delete this.isTouchScrolling;\n this.viewport.classList.remove('is-pointer-down');\n this.dispatchEvent( 'pointerUp', event, [ pointer ] );\n this._dragPointerUp( event, pointer );\n};\n\nproto.pointerDone = function() {\n window.removeEventListener( 'scroll', this );\n delete this.pointerDownScroll;\n};\n\n// -------------------------- dragging -------------------------- //\n\nproto.dragStart = function( event, pointer ) {\n if ( !this.isDraggable ) {\n return;\n }\n this.dragStartPosition = this.x;\n this.startAnimation();\n window.removeEventListener( 'scroll', this );\n this.dispatchEvent( 'dragStart', event, [ pointer ] );\n};\n\nproto.pointerMove = function( event, pointer ) {\n var moveVector = this._dragPointerMove( event, pointer );\n this.dispatchEvent( 'pointerMove', event, [ pointer, moveVector ] );\n this._dragMove( event, pointer, moveVector );\n};\n\nproto.dragMove = function( event, pointer, moveVector ) {\n if ( !this.isDraggable ) {\n return;\n }\n event.preventDefault();\n\n this.previousDragX = this.dragX;\n // reverse if right-to-left\n var direction = this.options.rightToLeft ? -1 : 1;\n if ( this.options.wrapAround ) {\n // wrap around move. #589\n moveVector.x %= this.slideableWidth;\n }\n var dragX = this.dragStartPosition + moveVector.x * direction;\n\n if ( !this.options.wrapAround && this.slides.length ) {\n // slow drag\n var originBound = Math.max( -this.slides[0].target, this.dragStartPosition );\n dragX = dragX > originBound ? ( dragX + originBound ) * 0.5 : dragX;\n var endBound = Math.min( -this.getLastSlide().target, this.dragStartPosition );\n dragX = dragX < endBound ? ( dragX + endBound ) * 0.5 : dragX;\n }\n\n this.dragX = dragX;\n\n this.dragMoveTime = new Date();\n this.dispatchEvent( 'dragMove', event, [ pointer, moveVector ] );\n};\n\nproto.dragEnd = function( event, pointer ) {\n if ( !this.isDraggable ) {\n return;\n }\n if ( this.options.freeScroll ) {\n this.isFreeScrolling = true;\n }\n // set selectedIndex based on where flick will end up\n var index = this.dragEndRestingSelect();\n\n if ( this.options.freeScroll && !this.options.wrapAround ) {\n // if free-scroll & not wrap around\n // do not free-scroll if going outside of bounding slides\n // so bounding slides can attract slider, and keep it in bounds\n var restingX = this.getRestingPosition();\n this.isFreeScrolling = -restingX > this.slides[0].target &&\n -restingX < this.getLastSlide().target;\n } else if ( !this.options.freeScroll && index == this.selectedIndex ) {\n // boost selection if selected index has not changed\n index += this.dragEndBoostSelect();\n }\n delete this.previousDragX;\n // apply selection\n // TODO refactor this, selecting here feels weird\n // HACK, set flag so dragging stays in correct direction\n this.isDragSelect = this.options.wrapAround;\n this.select( index );\n delete this.isDragSelect;\n this.dispatchEvent( 'dragEnd', event, [ pointer ] );\n};\n\nproto.dragEndRestingSelect = function() {\n var restingX = this.getRestingPosition();\n // how far away from selected slide\n var distance = Math.abs( this.getSlideDistance( -restingX, this.selectedIndex ) );\n // get closet resting going up and going down\n var positiveResting = this._getClosestResting( restingX, distance, 1 );\n var negativeResting = this._getClosestResting( restingX, distance, -1 );\n // use closer resting for wrap-around\n var index = positiveResting.distance < negativeResting.distance ?\n positiveResting.index : negativeResting.index;\n return index;\n};\n\n/**\n * given resting X and distance to selected cell\n * get the distance and index of the closest cell\n * @param {Number} restingX - estimated post-flick resting position\n * @param {Number} distance - distance to selected cell\n * @param {Integer} increment - +1 or -1, going up or down\n * @returns {Object} - { distance: {Number}, index: {Integer} }\n */\nproto._getClosestResting = function( restingX, distance, increment ) {\n var index = this.selectedIndex;\n var minDistance = Infinity;\n var condition = this.options.contain && !this.options.wrapAround ?\n // if contain, keep going if distance is equal to minDistance\n function( dist, minDist ) {\n return dist <= minDist;\n } : function( dist, minDist ) {\n return dist < minDist;\n };\n while ( condition( distance, minDistance ) ) {\n // measure distance to next cell\n index += increment;\n minDistance = distance;\n distance = this.getSlideDistance( -restingX, index );\n if ( distance === null ) {\n break;\n }\n distance = Math.abs( distance );\n }\n return {\n distance: minDistance,\n // selected was previous index\n index: index - increment,\n };\n};\n\n/**\n * measure distance between x and a slide target\n * @param {Number} x - horizontal position\n * @param {Integer} index - slide index\n * @returns {Number} - slide distance\n */\nproto.getSlideDistance = function( x, index ) {\n var len = this.slides.length;\n // wrap around if at least 2 slides\n var isWrapAround = this.options.wrapAround && len > 1;\n var slideIndex = isWrapAround ? utils.modulo( index, len ) : index;\n var slide = this.slides[ slideIndex ];\n if ( !slide ) {\n return null;\n }\n // add distance for wrap-around slides\n var wrap = isWrapAround ? this.slideableWidth * Math.floor( index/len ) : 0;\n return x - ( slide.target + wrap );\n};\n\nproto.dragEndBoostSelect = function() {\n // do not boost if no previousDragX or dragMoveTime\n if ( this.previousDragX === undefined || !this.dragMoveTime ||\n // or if drag was held for 100 ms\n new Date() - this.dragMoveTime > 100 ) {\n return 0;\n }\n\n var distance = this.getSlideDistance( -this.dragX, this.selectedIndex );\n var delta = this.previousDragX - this.dragX;\n if ( distance > 0 && delta > 0 ) {\n // boost to next if moving towards the right, and positive velocity\n return 1;\n } else if ( distance < 0 && delta < 0 ) {\n // boost to previous if moving towards the left, and negative velocity\n return -1;\n }\n return 0;\n};\n\n// ----- staticClick ----- //\n\nproto.staticClick = function( event, pointer ) {\n // get clickedCell, if cell was clicked\n var clickedCell = this.getParentCell( event.target );\n var cellElem = clickedCell && clickedCell.element;\n var cellIndex = clickedCell && this.cells.indexOf( clickedCell );\n this.dispatchEvent( 'staticClick', event, [ pointer, cellElem, cellIndex ] );\n};\n\n// ----- scroll ----- //\n\nproto.onscroll = function() {\n var scroll = getScrollPosition();\n var scrollMoveX = this.pointerDownScroll.x - scroll.x;\n var scrollMoveY = this.pointerDownScroll.y - scroll.y;\n // cancel click/tap if scroll is too much\n if ( Math.abs( scrollMoveX ) > 3 || Math.abs( scrollMoveY ) > 3 ) {\n this._pointerDone();\n }\n};\n\n// ----- utils ----- //\n\nfunction getScrollPosition() {\n return {\n x: window.pageXOffset,\n y: window.pageYOffset,\n };\n}\n\n// ----- ----- //\n\nreturn Flickity;\n\n} ) );\n","/*!\n * Unidragger v2.3.1\n * Draggable base class\n * MIT license\n */\n\n/*jshint browser: true, unused: true, undef: true, strict: true */\n\n( function( window, factory ) {\n // universal module definition\n /*jshint strict: false */ /*globals define, module, require */\n\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'unipointer/unipointer'\n ], function( Unipointer ) {\n return factory( window, Unipointer );\n });\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('unipointer')\n );\n } else {\n // browser global\n window.Unidragger = factory(\n window,\n window.Unipointer\n );\n }\n\n}( window, function factory( window, Unipointer ) {\n\n'use strict';\n\n// -------------------------- Unidragger -------------------------- //\n\nfunction Unidragger() {}\n\n// inherit Unipointer & EvEmitter\nvar proto = Unidragger.prototype = Object.create( Unipointer.prototype );\n\n// ----- bind start ----- //\n\nproto.bindHandles = function() {\n this._bindHandles( true );\n};\n\nproto.unbindHandles = function() {\n this._bindHandles( false );\n};\n\n/**\n * Add or remove start event\n * @param {Boolean} isAdd\n */\nproto._bindHandles = function( isAdd ) {\n // munge isAdd, default to true\n isAdd = isAdd === undefined ? true : isAdd;\n // bind each handle\n var bindMethod = isAdd ? 'addEventListener' : 'removeEventListener';\n var touchAction = isAdd ? this._touchActionValue : '';\n for ( var i=0; i < this.handles.length; i++ ) {\n var handle = this.handles[i];\n this._bindStartEvent( handle, isAdd );\n handle[ bindMethod ]( 'click', this );\n // touch-action: none to override browser touch gestures. metafizzy/flickity#540\n if ( window.PointerEvent ) {\n handle.style.touchAction = touchAction;\n }\n }\n};\n\n// prototype so it can be overwriteable by Flickity\nproto._touchActionValue = 'none';\n\n// ----- start event ----- //\n\n/**\n * pointer start\n * @param {Event} event\n * @param {Event or Touch} pointer\n */\nproto.pointerDown = function( event, pointer ) {\n var isOkay = this.okayPointerDown( event );\n if ( !isOkay ) {\n return;\n }\n // track start event position\n // Safari 9 overrides pageX and pageY. These values needs to be copied. flickity#842\n this.pointerDownPointer = {\n pageX: pointer.pageX,\n pageY: pointer.pageY,\n };\n\n event.preventDefault();\n this.pointerDownBlur();\n // bind move and end events\n this._bindPostStartEvents( event );\n this.emitEvent( 'pointerDown', [ event, pointer ] );\n};\n\n// nodes that have text fields\nvar cursorNodes = {\n TEXTAREA: true,\n INPUT: true,\n SELECT: true,\n OPTION: true,\n};\n\n// input types that do not have text fields\nvar clickTypes = {\n radio: true,\n checkbox: true,\n button: true,\n submit: true,\n image: true,\n file: true,\n};\n\n// dismiss inputs with text fields. flickity#403, flickity#404\nproto.okayPointerDown = function( event ) {\n var isCursorNode = cursorNodes[ event.target.nodeName ];\n var isClickType = clickTypes[ event.target.type ];\n var isOkay = !isCursorNode || isClickType;\n if ( !isOkay ) {\n this._pointerReset();\n }\n return isOkay;\n};\n\n// kludge to blur previously focused input\nproto.pointerDownBlur = function() {\n var focused = document.activeElement;\n // do not blur body for IE10, metafizzy/flickity#117\n var canBlur = focused && focused.blur && focused != document.body;\n if ( canBlur ) {\n focused.blur();\n }\n};\n\n// ----- move event ----- //\n\n/**\n * drag move\n * @param {Event} event\n * @param {Event or Touch} pointer\n */\nproto.pointerMove = function( event, pointer ) {\n var moveVector = this._dragPointerMove( event, pointer );\n this.emitEvent( 'pointerMove', [ event, pointer, moveVector ] );\n this._dragMove( event, pointer, moveVector );\n};\n\n// base pointer move logic\nproto._dragPointerMove = function( event, pointer ) {\n var moveVector = {\n x: pointer.pageX - this.pointerDownPointer.pageX,\n y: pointer.pageY - this.pointerDownPointer.pageY\n };\n // start drag if pointer has moved far enough to start drag\n if ( !this.isDragging && this.hasDragStarted( moveVector ) ) {\n this._dragStart( event, pointer );\n }\n return moveVector;\n};\n\n// condition if pointer has moved far enough to start drag\nproto.hasDragStarted = function( moveVector ) {\n return Math.abs( moveVector.x ) > 3 || Math.abs( moveVector.y ) > 3;\n};\n\n// ----- end event ----- //\n\n/**\n * pointer up\n * @param {Event} event\n * @param {Event or Touch} pointer\n */\nproto.pointerUp = function( event, pointer ) {\n this.emitEvent( 'pointerUp', [ event, pointer ] );\n this._dragPointerUp( event, pointer );\n};\n\nproto._dragPointerUp = function( event, pointer ) {\n if ( this.isDragging ) {\n this._dragEnd( event, pointer );\n } else {\n // pointer didn't move enough for drag to start\n this._staticClick( event, pointer );\n }\n};\n\n// -------------------------- drag -------------------------- //\n\n// dragStart\nproto._dragStart = function( event, pointer ) {\n this.isDragging = true;\n // prevent clicks\n this.isPreventingClicks = true;\n this.dragStart( event, pointer );\n};\n\nproto.dragStart = function( event, pointer ) {\n this.emitEvent( 'dragStart', [ event, pointer ] );\n};\n\n// dragMove\nproto._dragMove = function( event, pointer, moveVector ) {\n // do not drag if not dragging yet\n if ( !this.isDragging ) {\n return;\n }\n\n this.dragMove( event, pointer, moveVector );\n};\n\nproto.dragMove = function( event, pointer, moveVector ) {\n event.preventDefault();\n this.emitEvent( 'dragMove', [ event, pointer, moveVector ] );\n};\n\n// dragEnd\nproto._dragEnd = function( event, pointer ) {\n // set flags\n this.isDragging = false;\n // re-enable clicking async\n setTimeout( function() {\n delete this.isPreventingClicks;\n }.bind( this ) );\n\n this.dragEnd( event, pointer );\n};\n\nproto.dragEnd = function( event, pointer ) {\n this.emitEvent( 'dragEnd', [ event, pointer ] );\n};\n\n// ----- onclick ----- //\n\n// handle all clicks and prevent clicks when dragging\nproto.onclick = function( event ) {\n if ( this.isPreventingClicks ) {\n event.preventDefault();\n }\n};\n\n// ----- staticClick ----- //\n\n// triggered after pointer down & up with no/tiny movement\nproto._staticClick = function( event, pointer ) {\n // ignore emulated mouse up clicks\n if ( this.isIgnoringMouseUp && event.type == 'mouseup' ) {\n return;\n }\n\n this.staticClick( event, pointer );\n\n // set flag for emulated clicks 300ms after touchend\n if ( event.type != 'mouseup' ) {\n this.isIgnoringMouseUp = true;\n // reset flag after 300ms\n setTimeout( function() {\n delete this.isIgnoringMouseUp;\n }.bind( this ), 400 );\n }\n};\n\nproto.staticClick = function( event, pointer ) {\n this.emitEvent( 'staticClick', [ event, pointer ] );\n};\n\n// ----- utils ----- //\n\nUnidragger.getPointerPoint = Unipointer.getPointerPoint;\n\n// ----- ----- //\n\nreturn Unidragger;\n\n}));\n","// prev/next buttons\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n 'unipointer/unipointer',\n 'fizzy-ui-utils/utils',\n ], function( Flickity, Unipointer, utils ) {\n return factory( window, Flickity, Unipointer, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('./flickity'),\n require('unipointer'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n factory(\n window,\n window.Flickity,\n window.Unipointer,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, Flickity, Unipointer, utils ) {\n'use strict';\n\nvar svgURI = 'http://www.w3.org/2000/svg';\n\n// -------------------------- PrevNextButton -------------------------- //\n\nfunction PrevNextButton( direction, parent ) {\n this.direction = direction;\n this.parent = parent;\n this._create();\n}\n\nPrevNextButton.prototype = Object.create( Unipointer.prototype );\n\nPrevNextButton.prototype._create = function() {\n // properties\n this.isEnabled = true;\n this.isPrevious = this.direction == -1;\n var leftDirection = this.parent.options.rightToLeft ? 1 : -1;\n this.isLeft = this.direction == leftDirection;\n\n var element = this.element = document.createElement('button');\n element.className = 'flickity-button flickity-prev-next-button';\n element.className += this.isPrevious ? ' previous' : ' next';\n // prevent button from submitting form http://stackoverflow.com/a/10836076/182183\n element.setAttribute( 'type', 'button' );\n // init as disabled\n this.disable();\n\n element.setAttribute( 'aria-label', this.isPrevious ? 'Previous' : 'Next' );\n\n // create arrow\n var svg = this.createSVG();\n element.appendChild( svg );\n // events\n this.parent.on( 'select', this.update.bind( this ) );\n this.on( 'pointerDown', this.parent.childUIPointerDown.bind( this.parent ) );\n};\n\nPrevNextButton.prototype.activate = function() {\n this.bindStartEvent( this.element );\n this.element.addEventListener( 'click', this );\n // add to DOM\n this.parent.element.appendChild( this.element );\n};\n\nPrevNextButton.prototype.deactivate = function() {\n // remove from DOM\n this.parent.element.removeChild( this.element );\n // click events\n this.unbindStartEvent( this.element );\n this.element.removeEventListener( 'click', this );\n};\n\nPrevNextButton.prototype.createSVG = function() {\n var svg = document.createElementNS( svgURI, 'svg' );\n svg.setAttribute( 'class', 'flickity-button-icon' );\n svg.setAttribute( 'viewBox', '0 0 100 100' );\n var path = document.createElementNS( svgURI, 'path' );\n var pathMovements = getArrowMovements( this.parent.options.arrowShape );\n path.setAttribute( 'd', pathMovements );\n path.setAttribute( 'class', 'arrow' );\n // rotate arrow\n if ( !this.isLeft ) {\n path.setAttribute( 'transform', 'translate(100, 100) rotate(180) ' );\n }\n svg.appendChild( path );\n return svg;\n};\n\n// get SVG path movmement\nfunction getArrowMovements( shape ) {\n // use shape as movement if string\n if ( typeof shape == 'string' ) {\n return shape;\n }\n // create movement string\n return 'M ' + shape.x0 + ',50' +\n ' L ' + shape.x1 + ',' + ( shape.y1 + 50 ) +\n ' L ' + shape.x2 + ',' + ( shape.y2 + 50 ) +\n ' L ' + shape.x3 + ',50 ' +\n ' L ' + shape.x2 + ',' + ( 50 - shape.y2 ) +\n ' L ' + shape.x1 + ',' + ( 50 - shape.y1 ) +\n ' Z';\n}\n\nPrevNextButton.prototype.handleEvent = utils.handleEvent;\n\nPrevNextButton.prototype.onclick = function() {\n if ( !this.isEnabled ) {\n return;\n }\n this.parent.uiChange();\n var method = this.isPrevious ? 'previous' : 'next';\n this.parent[ method ]();\n};\n\n// ----- ----- //\n\nPrevNextButton.prototype.enable = function() {\n if ( this.isEnabled ) {\n return;\n }\n this.element.disabled = false;\n this.isEnabled = true;\n};\n\nPrevNextButton.prototype.disable = function() {\n if ( !this.isEnabled ) {\n return;\n }\n this.element.disabled = true;\n this.isEnabled = false;\n};\n\nPrevNextButton.prototype.update = function() {\n // index of first or last slide, if previous or next\n var slides = this.parent.slides;\n // enable is wrapAround and at least 2 slides\n if ( this.parent.options.wrapAround && slides.length > 1 ) {\n this.enable();\n return;\n }\n var lastIndex = slides.length ? slides.length - 1 : 0;\n var boundIndex = this.isPrevious ? 0 : lastIndex;\n var method = this.parent.selectedIndex == boundIndex ? 'disable' : 'enable';\n this[ method ]();\n};\n\nPrevNextButton.prototype.destroy = function() {\n this.deactivate();\n this.allOff();\n};\n\n// -------------------------- Flickity prototype -------------------------- //\n\nutils.extend( Flickity.defaults, {\n prevNextButtons: true,\n arrowShape: {\n x0: 10,\n x1: 60, y1: 50,\n x2: 70, y2: 40,\n x3: 30,\n },\n} );\n\nFlickity.createMethods.push('_createPrevNextButtons');\nvar proto = Flickity.prototype;\n\nproto._createPrevNextButtons = function() {\n if ( !this.options.prevNextButtons ) {\n return;\n }\n\n this.prevButton = new PrevNextButton( -1, this );\n this.nextButton = new PrevNextButton( 1, this );\n\n this.on( 'activate', this.activatePrevNextButtons );\n};\n\nproto.activatePrevNextButtons = function() {\n this.prevButton.activate();\n this.nextButton.activate();\n this.on( 'deactivate', this.deactivatePrevNextButtons );\n};\n\nproto.deactivatePrevNextButtons = function() {\n this.prevButton.deactivate();\n this.nextButton.deactivate();\n this.off( 'deactivate', this.deactivatePrevNextButtons );\n};\n\n// -------------------------- -------------------------- //\n\nFlickity.PrevNextButton = PrevNextButton;\n\nreturn Flickity;\n\n} ) );\n","// page dots\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n 'unipointer/unipointer',\n 'fizzy-ui-utils/utils',\n ], function( Flickity, Unipointer, utils ) {\n return factory( window, Flickity, Unipointer, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('./flickity'),\n require('unipointer'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n factory(\n window,\n window.Flickity,\n window.Unipointer,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, Flickity, Unipointer, utils ) {\n\n// -------------------------- PageDots -------------------------- //\n\n'use strict';\n\nfunction PageDots( parent ) {\n this.parent = parent;\n this._create();\n}\n\nPageDots.prototype = Object.create( Unipointer.prototype );\n\nPageDots.prototype._create = function() {\n // create holder element\n this.holder = document.createElement('ol');\n this.holder.className = 'flickity-page-dots';\n // create dots, array of elements\n this.dots = [];\n // events\n this.handleClick = this.onClick.bind( this );\n this.on( 'pointerDown', this.parent.childUIPointerDown.bind( this.parent ) );\n};\n\nPageDots.prototype.activate = function() {\n this.setDots();\n this.holder.addEventListener( 'click', this.handleClick );\n this.bindStartEvent( this.holder );\n // add to DOM\n this.parent.element.appendChild( this.holder );\n};\n\nPageDots.prototype.deactivate = function() {\n this.holder.removeEventListener( 'click', this.handleClick );\n this.unbindStartEvent( this.holder );\n // remove from DOM\n this.parent.element.removeChild( this.holder );\n};\n\nPageDots.prototype.setDots = function() {\n // get difference between number of slides and number of dots\n var delta = this.parent.slides.length - this.dots.length;\n if ( delta > 0 ) {\n this.addDots( delta );\n } else if ( delta < 0 ) {\n this.removeDots( -delta );\n }\n};\n\nPageDots.prototype.addDots = function( count ) {\n var fragment = document.createDocumentFragment();\n var newDots = [];\n var length = this.dots.length;\n var max = length + count;\n\n for ( var i = length; i < max; i++ ) {\n var dot = document.createElement('li');\n dot.className = 'dot';\n dot.setAttribute( 'aria-label', 'Page dot ' + ( i + 1 ) );\n fragment.appendChild( dot );\n newDots.push( dot );\n }\n\n this.holder.appendChild( fragment );\n this.dots = this.dots.concat( newDots );\n};\n\nPageDots.prototype.removeDots = function( count ) {\n // remove from this.dots collection\n var removeDots = this.dots.splice( this.dots.length - count, count );\n // remove from DOM\n removeDots.forEach( function( dot ) {\n this.holder.removeChild( dot );\n }, this );\n};\n\nPageDots.prototype.updateSelected = function() {\n // remove selected class on previous\n if ( this.selectedDot ) {\n this.selectedDot.className = 'dot';\n this.selectedDot.removeAttribute('aria-current');\n }\n // don't proceed if no dots\n if ( !this.dots.length ) {\n return;\n }\n this.selectedDot = this.dots[ this.parent.selectedIndex ];\n this.selectedDot.className = 'dot is-selected';\n this.selectedDot.setAttribute( 'aria-current', 'step' );\n};\n\nPageDots.prototype.onTap = // old method name, backwards-compatible\nPageDots.prototype.onClick = function( event ) {\n var target = event.target;\n // only care about dot clicks\n if ( target.nodeName != 'LI' ) {\n return;\n }\n\n this.parent.uiChange();\n var index = this.dots.indexOf( target );\n this.parent.select( index );\n};\n\nPageDots.prototype.destroy = function() {\n this.deactivate();\n this.allOff();\n};\n\nFlickity.PageDots = PageDots;\n\n// -------------------------- Flickity -------------------------- //\n\nutils.extend( Flickity.defaults, {\n pageDots: true,\n} );\n\nFlickity.createMethods.push('_createPageDots');\n\nvar proto = Flickity.prototype;\n\nproto._createPageDots = function() {\n if ( !this.options.pageDots ) {\n return;\n }\n this.pageDots = new PageDots( this );\n // events\n this.on( 'activate', this.activatePageDots );\n this.on( 'select', this.updateSelectedPageDots );\n this.on( 'cellChange', this.updatePageDots );\n this.on( 'resize', this.updatePageDots );\n this.on( 'deactivate', this.deactivatePageDots );\n};\n\nproto.activatePageDots = function() {\n this.pageDots.activate();\n};\n\nproto.updateSelectedPageDots = function() {\n this.pageDots.updateSelected();\n};\n\nproto.updatePageDots = function() {\n this.pageDots.setDots();\n};\n\nproto.deactivatePageDots = function() {\n this.pageDots.deactivate();\n};\n\n// ----- ----- //\n\nFlickity.PageDots = PageDots;\n\nreturn Flickity;\n\n} ) );\n","// player & autoPlay\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'ev-emitter/ev-emitter',\n 'fizzy-ui-utils/utils',\n './flickity',\n ], function( EvEmitter, utils, Flickity ) {\n return factory( EvEmitter, utils, Flickity );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n require('ev-emitter'),\n require('fizzy-ui-utils'),\n require('./flickity')\n );\n } else {\n // browser global\n factory(\n window.EvEmitter,\n window.fizzyUIUtils,\n window.Flickity\n );\n }\n\n}( window, function factory( EvEmitter, utils, Flickity ) {\n\n'use strict';\n\n// -------------------------- Player -------------------------- //\n\nfunction Player( parent ) {\n this.parent = parent;\n this.state = 'stopped';\n // visibility change event handler\n this.onVisibilityChange = this.visibilityChange.bind( this );\n this.onVisibilityPlay = this.visibilityPlay.bind( this );\n}\n\nPlayer.prototype = Object.create( EvEmitter.prototype );\n\n// start play\nPlayer.prototype.play = function() {\n if ( this.state == 'playing' ) {\n return;\n }\n // do not play if page is hidden, start playing when page is visible\n var isPageHidden = document.hidden;\n if ( isPageHidden ) {\n document.addEventListener( 'visibilitychange', this.onVisibilityPlay );\n return;\n }\n\n this.state = 'playing';\n // listen to visibility change\n document.addEventListener( 'visibilitychange', this.onVisibilityChange );\n // start ticking\n this.tick();\n};\n\nPlayer.prototype.tick = function() {\n // do not tick if not playing\n if ( this.state != 'playing' ) {\n return;\n }\n\n var time = this.parent.options.autoPlay;\n // default to 3 seconds\n time = typeof time == 'number' ? time : 3000;\n var _this = this;\n // HACK: reset ticks if stopped and started within interval\n this.clear();\n this.timeout = setTimeout( function() {\n _this.parent.next( true );\n _this.tick();\n }, time );\n};\n\nPlayer.prototype.stop = function() {\n this.state = 'stopped';\n this.clear();\n // remove visibility change event\n document.removeEventListener( 'visibilitychange', this.onVisibilityChange );\n};\n\nPlayer.prototype.clear = function() {\n clearTimeout( this.timeout );\n};\n\nPlayer.prototype.pause = function() {\n if ( this.state == 'playing' ) {\n this.state = 'paused';\n this.clear();\n }\n};\n\nPlayer.prototype.unpause = function() {\n // re-start play if paused\n if ( this.state == 'paused' ) {\n this.play();\n }\n};\n\n// pause if page visibility is hidden, unpause if visible\nPlayer.prototype.visibilityChange = function() {\n var isPageHidden = document.hidden;\n this[ isPageHidden ? 'pause' : 'unpause' ]();\n};\n\nPlayer.prototype.visibilityPlay = function() {\n this.play();\n document.removeEventListener( 'visibilitychange', this.onVisibilityPlay );\n};\n\n// -------------------------- Flickity -------------------------- //\n\nutils.extend( Flickity.defaults, {\n pauseAutoPlayOnHover: true,\n} );\n\nFlickity.createMethods.push('_createPlayer');\nvar proto = Flickity.prototype;\n\nproto._createPlayer = function() {\n this.player = new Player( this );\n\n this.on( 'activate', this.activatePlayer );\n this.on( 'uiChange', this.stopPlayer );\n this.on( 'pointerDown', this.stopPlayer );\n this.on( 'deactivate', this.deactivatePlayer );\n};\n\nproto.activatePlayer = function() {\n if ( !this.options.autoPlay ) {\n return;\n }\n this.player.play();\n this.element.addEventListener( 'mouseenter', this );\n};\n\n// Player API, don't hate the ... thanks I know where the door is\n\nproto.playPlayer = function() {\n this.player.play();\n};\n\nproto.stopPlayer = function() {\n this.player.stop();\n};\n\nproto.pausePlayer = function() {\n this.player.pause();\n};\n\nproto.unpausePlayer = function() {\n this.player.unpause();\n};\n\nproto.deactivatePlayer = function() {\n this.player.stop();\n this.element.removeEventListener( 'mouseenter', this );\n};\n\n// ----- mouseenter/leave ----- //\n\n// pause auto-play on hover\nproto.onmouseenter = function() {\n if ( !this.options.pauseAutoPlayOnHover ) {\n return;\n }\n this.player.pause();\n this.element.addEventListener( 'mouseleave', this );\n};\n\n// resume auto-play on hover off\nproto.onmouseleave = function() {\n this.player.unpause();\n this.element.removeEventListener( 'mouseleave', this );\n};\n\n// ----- ----- //\n\nFlickity.Player = Player;\n\nreturn Flickity;\n\n} ) );\n","// add, remove cell\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n 'fizzy-ui-utils/utils',\n ], function( Flickity, utils ) {\n return factory( window, Flickity, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('./flickity'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n factory(\n window,\n window.Flickity,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, Flickity, utils ) {\n\n'use strict';\n\n// append cells to a document fragment\nfunction getCellsFragment( cells ) {\n var fragment = document.createDocumentFragment();\n cells.forEach( function( cell ) {\n fragment.appendChild( cell.element );\n } );\n return fragment;\n}\n\n// -------------------------- add/remove cell prototype -------------------------- //\n\nvar proto = Flickity.prototype;\n\n/**\n * Insert, prepend, or append cells\n * @param {[Element, Array, NodeList]} elems - Elements to insert\n * @param {Integer} index - Zero-based number to insert\n */\nproto.insert = function( elems, index ) {\n var cells = this._makeCells( elems );\n if ( !cells || !cells.length ) {\n return;\n }\n var len = this.cells.length;\n // default to append\n index = index === undefined ? len : index;\n // add cells with document fragment\n var fragment = getCellsFragment( cells );\n // append to slider\n var isAppend = index == len;\n if ( isAppend ) {\n this.slider.appendChild( fragment );\n } else {\n var insertCellElement = this.cells[ index ].element;\n this.slider.insertBefore( fragment, insertCellElement );\n }\n // add to this.cells\n if ( index === 0 ) {\n // prepend, add to start\n this.cells = cells.concat( this.cells );\n } else if ( isAppend ) {\n // append, add to end\n this.cells = this.cells.concat( cells );\n } else {\n // insert in this.cells\n var endCells = this.cells.splice( index, len - index );\n this.cells = this.cells.concat( cells ).concat( endCells );\n }\n\n this._sizeCells( cells );\n this.cellChange( index, true );\n};\n\nproto.append = function( elems ) {\n this.insert( elems, this.cells.length );\n};\n\nproto.prepend = function( elems ) {\n this.insert( elems, 0 );\n};\n\n/**\n * Remove cells\n * @param {[Element, Array, NodeList]} elems - ELements to remove\n */\nproto.remove = function( elems ) {\n var cells = this.getCells( elems );\n if ( !cells || !cells.length ) {\n return;\n }\n\n var minCellIndex = this.cells.length - 1;\n // remove cells from collection & DOM\n cells.forEach( function( cell ) {\n cell.remove();\n var index = this.cells.indexOf( cell );\n minCellIndex = Math.min( index, minCellIndex );\n utils.removeFrom( this.cells, cell );\n }, this );\n\n this.cellChange( minCellIndex, true );\n};\n\n/**\n * logic to be run after a cell's size changes\n * @param {Element} elem - cell's element\n */\nproto.cellSizeChange = function( elem ) {\n var cell = this.getCell( elem );\n if ( !cell ) {\n return;\n }\n cell.getSize();\n\n var index = this.cells.indexOf( cell );\n this.cellChange( index );\n};\n\n/**\n * logic any time a cell is changed: added, removed, or size changed\n * @param {Integer} changedCellIndex - index of the changed cell, optional\n * @param {Boolean} isPositioningSlider - Positions slider after selection\n */\nproto.cellChange = function( changedCellIndex, isPositioningSlider ) {\n var prevSelectedElem = this.selectedElement;\n this._positionCells( changedCellIndex );\n this._getWrapShiftCells();\n this.setGallerySize();\n // update selectedIndex\n // try to maintain position & select previous selected element\n var cell = this.getCell( prevSelectedElem );\n if ( cell ) {\n this.selectedIndex = this.getCellSlideIndex( cell );\n }\n this.selectedIndex = Math.min( this.slides.length - 1, this.selectedIndex );\n\n this.emitEvent( 'cellChange', [ changedCellIndex ] );\n // position slider\n this.select( this.selectedIndex );\n // do not position slider after lazy load\n if ( isPositioningSlider ) {\n this.positionSliderAtSelected();\n }\n};\n\n// ----- ----- //\n\nreturn Flickity;\n\n} ) );\n","// lazyload\n( function( window, factory ) {\n // universal module definition\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n './flickity',\n 'fizzy-ui-utils/utils',\n ], function( Flickity, utils ) {\n return factory( window, Flickity, utils );\n } );\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('./flickity'),\n require('fizzy-ui-utils')\n );\n } else {\n // browser global\n factory(\n window,\n window.Flickity,\n window.fizzyUIUtils\n );\n }\n\n}( window, function factory( window, Flickity, utils ) {\n'use strict';\n\nFlickity.createMethods.push('_createLazyload');\nvar proto = Flickity.prototype;\n\nproto._createLazyload = function() {\n this.on( 'select', this.lazyLoad );\n};\n\nproto.lazyLoad = function() {\n var lazyLoad = this.options.lazyLoad;\n if ( !lazyLoad ) {\n return;\n }\n // get adjacent cells, use lazyLoad option for adjacent count\n var adjCount = typeof lazyLoad == 'number' ? lazyLoad : 0;\n var cellElems = this.getAdjacentCellElements( adjCount );\n // get lazy images in those cells\n var lazyImages = [];\n cellElems.forEach( function( cellElem ) {\n var lazyCellImages = getCellLazyImages( cellElem );\n lazyImages = lazyImages.concat( lazyCellImages );\n } );\n // load lazy images\n lazyImages.forEach( function( img ) {\n new LazyLoader( img, this );\n }, this );\n};\n\nfunction getCellLazyImages( cellElem ) {\n // check if cell element is lazy image\n if ( cellElem.nodeName == 'IMG' ) {\n var lazyloadAttr = cellElem.getAttribute('data-flickity-lazyload');\n var srcAttr = cellElem.getAttribute('data-flickity-lazyload-src');\n var srcsetAttr = cellElem.getAttribute('data-flickity-lazyload-srcset');\n if ( lazyloadAttr || srcAttr || srcsetAttr ) {\n return [ cellElem ];\n }\n }\n // select lazy images in cell\n var lazySelector = 'img[data-flickity-lazyload], ' +\n 'img[data-flickity-lazyload-src], img[data-flickity-lazyload-srcset]';\n var imgs = cellElem.querySelectorAll( lazySelector );\n return utils.makeArray( imgs );\n}\n\n// -------------------------- LazyLoader -------------------------- //\n\n/**\n * class to handle loading images\n * @param {Image} img - Image element\n * @param {Flickity} flickity - Flickity instance\n */\nfunction LazyLoader( img, flickity ) {\n this.img = img;\n this.flickity = flickity;\n this.load();\n}\n\nLazyLoader.prototype.handleEvent = utils.handleEvent;\n\nLazyLoader.prototype.load = function() {\n this.img.addEventListener( 'load', this );\n this.img.addEventListener( 'error', this );\n // get src & srcset\n var src = this.img.getAttribute('data-flickity-lazyload') ||\n this.img.getAttribute('data-flickity-lazyload-src');\n var srcset = this.img.getAttribute('data-flickity-lazyload-srcset');\n // set src & serset\n this.img.src = src;\n if ( srcset ) {\n this.img.setAttribute( 'srcset', srcset );\n }\n // remove attr\n this.img.removeAttribute('data-flickity-lazyload');\n this.img.removeAttribute('data-flickity-lazyload-src');\n this.img.removeAttribute('data-flickity-lazyload-srcset');\n};\n\nLazyLoader.prototype.onload = function( event ) {\n this.complete( event, 'flickity-lazyloaded' );\n};\n\nLazyLoader.prototype.onerror = function( event ) {\n this.complete( event, 'flickity-lazyerror' );\n};\n\nLazyLoader.prototype.complete = function( event, className ) {\n // unbind events\n this.img.removeEventListener( 'load', this );\n this.img.removeEventListener( 'error', this );\n\n var cell = this.flickity.getParentCell( this.img );\n var cellElem = cell && cell.element;\n this.flickity.cellSizeChange( cellElem );\n\n this.img.classList.add( className );\n this.flickity.dispatchEvent( 'lazyLoad', event, cellElem );\n};\n\n// ----- ----- //\n\nFlickity.LazyLoader = LazyLoader;\n\nreturn Flickity;\n\n} ) );\n","/*!\n * imagesLoaded v4.1.4\n * JavaScript is all like \"You images are done yet or what?\"\n * MIT License\n */\n\n( function( window, factory ) { 'use strict';\n // universal module definition\n\n /*global define: false, module: false, require: false */\n\n if ( typeof define == 'function' && define.amd ) {\n // AMD\n define( [\n 'ev-emitter/ev-emitter'\n ], function( EvEmitter ) {\n return factory( window, EvEmitter );\n });\n } else if ( typeof module == 'object' && module.exports ) {\n // CommonJS\n module.exports = factory(\n window,\n require('ev-emitter')\n );\n } else {\n // browser global\n window.imagesLoaded = factory(\n window,\n window.EvEmitter\n );\n }\n\n})( typeof window !== 'undefined' ? window : this,\n\n// -------------------------- factory -------------------------- //\n\nfunction factory( window, EvEmitter ) {\n\n'use strict';\n\nvar $ = window.jQuery;\nvar console = window.console;\n\n// -------------------------- helpers -------------------------- //\n\n// extend objects\nfunction extend( a, b ) {\n for ( var prop in b ) {\n a[ prop ] = b[ prop ];\n }\n return a;\n}\n\nvar arraySlice = Array.prototype.slice;\n\n// turn element or nodeList into an array\nfunction makeArray( obj ) {\n if ( Array.isArray( obj ) ) {\n // use object if already an array\n return obj;\n }\n\n var isArrayLike = typeof obj == 'object' && typeof obj.length == 'number';\n if ( isArrayLike ) {\n // convert nodeList to array\n return arraySlice.call( obj );\n }\n\n // array of single index\n return [ obj ];\n}\n\n// -------------------------- imagesLoaded -------------------------- //\n\n/**\n * @param {Array, Element, NodeList, String} elem\n * @param {Object or Function} options - if function, use as callback\n * @param {Function} onAlways - callback function\n */\nfunction ImagesLoaded( elem, options, onAlways ) {\n // coerce ImagesLoaded() without new, to be new ImagesLoaded()\n if ( !( this instanceof ImagesLoaded ) ) {\n return new ImagesLoaded( elem, options, onAlways );\n }\n // use elem as selector string\n var queryElem = elem;\n if ( typeof elem == 'string' ) {\n queryElem = document.querySelectorAll( elem );\n }\n // bail if bad element\n if ( !queryElem ) {\n console.error( 'Bad element for imagesLoaded ' + ( queryElem || elem ) );\n return;\n }\n\n this.elements = makeArray( queryElem );\n this.options = extend( {}, this.options );\n // shift arguments if no options set\n if ( typeof options == 'function' ) {\n onAlways = options;\n } else {\n extend( this.options, options );\n }\n\n if ( onAlways ) {\n this.on( 'always', onAlways );\n }\n\n this.getImages();\n\n if ( $ ) {\n // add jQuery Deferred object\n this.jqDeferred = new $.Deferred();\n }\n\n // HACK check async to allow time to bind listeners\n setTimeout( this.check.bind( this ) );\n}\n\nImagesLoaded.prototype = Object.create( EvEmitter.prototype );\n\nImagesLoaded.prototype.options = {};\n\nImagesLoaded.prototype.getImages = function() {\n this.images = [];\n\n // filter & find items if we have an item selector\n this.elements.forEach( this.addElementImages, this );\n};\n\n/**\n * @param {Node} element\n */\nImagesLoaded.prototype.addElementImages = function( elem ) {\n // filter siblings\n if ( elem.nodeName == 'IMG' ) {\n this.addImage( elem );\n }\n // get background image on element\n if ( this.options.background === true ) {\n this.addElementBackgroundImages( elem );\n }\n\n // find children\n // no non-element nodes, #143\n var nodeType = elem.nodeType;\n if ( !nodeType || !elementNodeTypes[ nodeType ] ) {\n return;\n }\n var childImgs = elem.querySelectorAll('img');\n // concat childElems to filterFound array\n for ( var i=0; i < childImgs.length; i++ ) {\n var img = childImgs[i];\n this.addImage( img );\n }\n\n // get child background images\n if ( typeof this.options.background == 'string' ) {\n var children = elem.querySelectorAll( this.options.background );\n for ( i=0; i < children.length; i++ ) {\n var child = children[i];\n this.addElementBackgroundImages( child );\n }\n }\n};\n\nvar elementNodeTypes = {\n 1: true,\n 9: true,\n 11: true\n};\n\nImagesLoaded.prototype.addElementBackgroundImages = function( elem ) {\n var style = getComputedStyle( elem );\n if ( !style ) {\n // Firefox returns null if in a hidden iframe https://bugzil.la/548397\n return;\n }\n // get url inside url(\"...\")\n var reURL = /url\\((['\"])?(.*?)\\1\\)/gi;\n var matches = reURL.exec( style.backgroundImage );\n while ( matches !== null ) {\n var url = matches && matches[2];\n if ( url ) {\n this.addBackground( url, elem );\n }\n matches = reURL.exec( style.backgroundImage );\n }\n};\n\n/**\n * @param {Image} img\n */\nImagesLoaded.prototype.addImage = function( img ) {\n var loadingImage = new LoadingImage( img );\n this.images.push( loadingImage );\n};\n\nImagesLoaded.prototype.addBackground = function( url, elem ) {\n var background = new Background( url, elem );\n this.images.push( background );\n};\n\nImagesLoaded.prototype.check = function() {\n var _this = this;\n this.progressedCount = 0;\n this.hasAnyBroken = false;\n // complete if no images\n if ( !this.images.length ) {\n this.complete();\n return;\n }\n\n function onProgress( image, elem, message ) {\n // HACK - Chrome triggers event before object properties have changed. #83\n setTimeout( function() {\n _this.progress( image, elem, message );\n });\n }\n\n this.images.forEach( function( loadingImage ) {\n loadingImage.once( 'progress', onProgress );\n loadingImage.check();\n });\n};\n\nImagesLoaded.prototype.progress = function( image, elem, message ) {\n this.progressedCount++;\n this.hasAnyBroken = this.hasAnyBroken || !image.isLoaded;\n // progress event\n this.emitEvent( 'progress', [ this, image, elem ] );\n if ( this.jqDeferred && this.jqDeferred.notify ) {\n this.jqDeferred.notify( this, image );\n }\n // check if completed\n if ( this.progressedCount == this.images.length ) {\n this.complete();\n }\n\n if ( this.options.debug && console ) {\n console.log( 'progress: ' + message, image, elem );\n }\n};\n\nImagesLoaded.prototype.complete = function() {\n var eventName = this.hasAnyBroken ? 'fail' : 'done';\n this.isComplete = true;\n this.emitEvent( eventName, [ this ] );\n this.emitEvent( 'always', [ this ] );\n if ( this.jqDeferred ) {\n var jqMethod = this.hasAnyBroken ? 'reject' : 'resolve';\n this.jqDeferred[ jqMethod ]( this );\n }\n};\n\n// -------------------------- -------------------------- //\n\nfunction LoadingImage( img ) {\n this.img = img;\n}\n\nLoadingImage.prototype = Object.create( EvEmitter.prototype );\n\nLoadingImage.prototype.check = function() {\n // If complete is true and browser supports natural sizes,\n // try to check for image status manually.\n var isComplete = this.getIsImageComplete();\n if ( isComplete ) {\n // report based on naturalWidth\n this.confirm( this.img.naturalWidth !== 0, 'naturalWidth' );\n return;\n }\n\n // If none of the checks above matched, simulate loading on detached element.\n this.proxyImage = new Image();\n this.proxyImage.addEventListener( 'load', this );\n this.proxyImage.addEventListener( 'error', this );\n // bind to image as well for Firefox. #191\n this.img.addEventListener( 'load', this );\n this.img.addEventListener( 'error', this );\n this.proxyImage.src = this.img.src;\n};\n\nLoadingImage.prototype.getIsImageComplete = function() {\n // check for non-zero, non-undefined naturalWidth\n // fixes Safari+InfiniteScroll+Masonry bug infinite-scroll#671\n return this.img.complete && this.img.naturalWidth;\n};\n\nLoadingImage.prototype.confirm = function( isLoaded, message ) {\n this.isLoaded = isLoaded;\n this.emitEvent( 'progress', [ this, this.img, message ] );\n};\n\n// ----- events ----- //\n\n// trigger specified handler for event type\nLoadingImage.prototype.handleEvent = function( event ) {\n var method = 'on' + event.type;\n if ( this[ method ] ) {\n this[ method ]( event );\n }\n};\n\nLoadingImage.prototype.onload = function() {\n this.confirm( true, 'onload' );\n this.unbindEvents();\n};\n\nLoadingImage.prototype.onerror = function() {\n this.confirm( false, 'onerror' );\n this.unbindEvents();\n};\n\nLoadingImage.prototype.unbindEvents = function() {\n this.proxyImage.removeEventListener( 'load', this );\n this.proxyImage.removeEventListener( 'error', this );\n this.img.removeEventListener( 'load', this );\n this.img.removeEventListener( 'error', this );\n};\n\n// -------------------------- Background -------------------------- //\n\nfunction Background( url, element ) {\n this.url = url;\n this.element = element;\n this.img = new Image();\n}\n\n// inherit LoadingImage prototype\nBackground.prototype = Object.create( LoadingImage.prototype );\n\nBackground.prototype.check = function() {\n this.img.addEventListener( 'load', this );\n this.img.addEventListener( 'error', this );\n this.img.src = this.url;\n // check if image is already complete\n var isComplete = this.getIsImageComplete();\n if ( isComplete ) {\n this.confirm( this.img.naturalWidth !== 0, 'naturalWidth' );\n this.unbindEvents();\n }\n};\n\nBackground.prototype.unbindEvents = function() {\n this.img.removeEventListener( 'load', this );\n this.img.removeEventListener( 'error', this );\n};\n\nBackground.prototype.confirm = function( isLoaded, message ) {\n this.isLoaded = isLoaded;\n this.emitEvent( 'progress', [ this, this.element, message ] );\n};\n\n// -------------------------- jQuery -------------------------- //\n\nImagesLoaded.makeJQueryPlugin = function( jQuery ) {\n jQuery = jQuery || window.jQuery;\n if ( !jQuery ) {\n return;\n }\n // set local variable\n $ = jQuery;\n // $().imagesLoaded()\n $.fn.imagesLoaded = function( options, callback ) {\n var instance = new ImagesLoaded( this, options, callback );\n return instance.jqDeferred.promise( $(this) );\n };\n};\n// try making plugin\nImagesLoaded.makeJQueryPlugin();\n\n// -------------------------- -------------------------- //\n\nreturn ImagesLoaded;\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': '