{"version":3,"sources":["dependencies-bundle.js"],"names":["require","r","e","n","t","o","i","f","c","u","a","Error","code","p","exports","call","length","1","module","window","factory","define","amd","matchesSelector","matchesMethod","ElemProto","Element","prototype","matches","prefixes","method","elem","selector","2","global","this","EvEmitter","proto","on","eventName","listener","events","_events","listeners","indexOf","push","once","onceEvents","_onceEvents","off","index","splice","emitEvent","args","slice","onceListeners","apply","allOff","3","utils","extend","b","prop","modulo","num","div","arraySlice","Array","makeArray","obj","isArray","removeFrom","ary","getParent","parentNode","document","body","getQueryElement","querySelector","handleEvent","event","type","filterFindElements","elems","ffElems","forEach","HTMLElement","childElems","querySelectorAll","debounceMethod","_class","methodName","threshold","timeoutName","timeout","clearTimeout","arguments","_this","setTimeout","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","fizzyUIUtils","desandro-matches-selector","4","getStyleSize","value","parseFloat","isNaN","logError","message","measurements","measurementsLength","getStyle","style","getComputedStyle","isBoxSizeOuter","isSetup","getSize","createElement","width","padding","borderStyle","borderWidth","boxSizing","documentElement","appendChild","Math","round","removeChild","setup","nodeType","display","size","height","innerWidth","innerHeight","outerWidth","outerHeight","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","5","Outlayer","Item","Object","create","_create","id","layout","itemGUID","sortData","updateSortData","isIgnored","random","getSortData","sorters","_sorters","key","sorter","element","_destroy","destroy","css","Isotope","outlayer","6","LayoutMode","isotope","items","filteredItems","needsVerticalResizeLayout","_getMeasurement","getColumnWidth","getSegmentSize","getRowHeight","segment","segmentName","outerSize","firstItemSize","getFirstItemSize","firstItem","modes","Mode","constructor","get-size","7","FitRows","_resetLayout","x","y","maxY","_getItemLayoutPosition","item","itemWidth","gutter","containerWidth","position","max","_getContainerSize","../layout-mode","8","Masonry","MasonryMode","keepModeMethods","_getElementOffset","measureColumns","_getOption","option","undefined","isFitWidth","fitWidth","masonry-layout","9","Vertical","horizontalAlignment","10","compatOptions","colYs","cols","horizontalColIndex","getContainerWidth","columnWidth","firstItemElem","excess","container","remainder","colSpan","min","colPosition","horizontalOrder","col","setHeight","setMax","_getTopColPosition","colGroup","_getTopColGroup","minimumY","groupCount","_getColGroupY","groupColYs","_getHorizontalColPosition","hasSize","_manageStamp","stamp","stampSize","offset","firstX","left","right","lastX","firstCol","floor","lastCol","stampMaxY","top","bottom","_getContainerFitWidth","unusedCols","needsResizeLayout","previousWidth","11","docElemStyle","transitionProperty","transition","transformProperty","transform","transitionEndEvent","WebkitTransition","vendorProperties","transitionDuration","transitionDelay","_transn","ingProperties","clean","onEnd","elemStyle","getPosition","isOriginLeft","isOriginTop","xValue","yValue","layoutSize","layoutPosition","xPadding","xProperty","xResetProperty","getXValue","yPadding","yProperty","yResetProperty","getYValue","isHorizontal","percentPosition","_transitionTo","curX","curY","didNotMove","setPosition","isTransitioning","transX","transY","transitionStyle","getTranslate","to","onTransitionEnd","isCleaning","goTo","moveTo","_nonTransition","_removeStyles","_transition","from","enableTransition","transitionProps","duration","staggerDelay","onwebkitTransitionEnd","ontransitionend","onotransitionend","dashedVendorProperties","-webkit-transform","target","propertyName","isEmptyObj","disableTransition","removeTransitionStyles","removeEventListener","cleanStyle","cleanTransitionStyle","stagger","delay","removeElem","remove","hide","reveal","isHidden","getHideRevealTransitionEndProperty","onRevealTransitionEnd","hiddenStyle","visibleStyle","styleProperty","optionStyle","opacity","onHideTransitionEnd","ev-emitter","12","noop","GUID","instances","queryElement","$element","defaults","outlayerGUID","containerStyle","initLayout","originLeft","originTop","resize","resizeContainer","subclass","Parent","SubClass","opts","oldOption","horizontal","layoutInstant","reloadItems","stamps","bindResize","_itemize","children","itemElems","_filterFindItemElements","itemSelector","getItemElements","map","_manageStamps","isInstant","_isLayoutInited","layoutItems","_init","_getItemsForLayout","_layoutItems","_postLayout","filter","_emitCompleteOnItems","queue","isLayoutInstant","_processLayoutQueue","updateStagger","_positionItem","time","unit","mult","msUnits","getMilliseconds","_setContainerMeasure","measure","isWidth","elemSize","onComplete","dispatchEvent","count","doneCount","tick","emitArgs","$event","Event","trigger","ignore","getItem","unignore","_find","unstamp","_getBoundingRect","boundingRect","getBoundingClientRect","_boundingRect","thisRect","isResizeBound","unbindResize","onresize","addItems","appended","prepended","previousItems","revealItemElements","getItems","hideItemElements","removeItems","removeData","Layout","bridget","ms","s","./item","fizzy-ui-utils","isotope-layout","trim","String","layoutMode","isJQueryFiltering","sortAscending","name","_getSorters","sortHistory","_initLayoutMode","_updateItemsSortData","initialOpts","_layout","arrange","_getIsInstant","filtered","_filter","_bindArrangeComplete","_isInstant","_noTransition","_hideReveal","_sort","needReveal","needHide","isLayoutComplete","isHideComplete","isRevealComplete","arrangeParallelCallback","hiddenMatched","visibleUnmatched","test","_getFilterTest","isMatched","is","mungeSorter","len","query","split","attrMatch","getValue","child","textContent","parser","sortDataParsers","parseInt","val","sortBy","sortBys","_getIsSameSortBy","sortAsc","itemSorter","itemA","itemB","isAscending","direction","sort","_mode","mode","_filterRevealAdded","insert","filteredInsertItems","_remove","shuffle","fn","returnValue","getFilteredItemElements","./layout-mode","./layout-modes/fit-rows","./layout-modes/masonry","./layout-modes/vertical","lodash","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_ARY_FLAG","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboRange","rsComboMarksRange","rsDingbatRange","rsLowerRange","rsUpperRange","rsVarRange","rsBreakRange","rsMathOpRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsSeq","join","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","\\","'","\n","\r","
","
","freeParseFloat","freeParseInt","freeGlobal","freeSelf","self","root","Function","freeExports","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","func","thisArg","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","values","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","current","baseTimes","baseTrim","string","trimmedEndIndex","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","À","Á","Â","Ã","Ä","Å","à","á","â","ã","ä","å","Ç","ç","Ð","ð","È","É","Ê","Ë","è","é","ê","ë","Ì","Í","Î","Ï","ì","í","î","ï","Ñ","ñ","Ò","Ó","Ô","Õ","Ö","Ø","ò","ó","ô","õ","ö","ø","Ù","Ú","Û","Ü","ù","ú","û","ü","Ý","ý","ÿ","Æ","æ","Þ","þ","ß","Ā","Ă","Ą","ā","ă","ą","Ć","Ĉ","Ċ","Č","ć","ĉ","ċ","č","Ď","Đ","ď","đ","Ē","Ĕ","Ė","Ę","Ě","ē","ĕ","ė","ę","ě","Ĝ","Ğ","Ġ","Ģ","ĝ","ğ","ġ","ģ","Ĥ","Ħ","ĥ","ħ","Ĩ","Ī","Ĭ","Į","İ","ĩ","ī","ĭ","į","ı","Ĵ","ĵ","Ķ","ķ","ĸ","Ĺ","Ļ","Ľ","Ŀ","Ł","ĺ","ļ","ľ","ŀ","ł","Ń","Ņ","Ň","Ŋ","ń","ņ","ň","ŋ","Ō","Ŏ","Ő","ō","ŏ","ő","Ŕ","Ŗ","Ř","ŕ","ŗ","ř","Ś","Ŝ","Ş","Š","ś","ŝ","ş","š","Ţ","Ť","Ŧ","ţ","ť","ŧ","Ũ","Ū","Ŭ","Ů","Ű","Ų","ũ","ū","ŭ","ů","ű","ų","Ŵ","ŵ","Ŷ","ŷ","Ÿ","Ź","Ż","Ž","ź","ż","ž","IJ","ij","Œ","œ","ʼn","ſ","escapeHtmlChar","&","<",">","\"","escapeStringChar","chr","hasUnicode","mapToArray","overArg","arg","replaceHolders","placeholder","setToArray","set","stringSize","lastIndex","unicodeSize","stringToArray","charAt","unescapeHtmlChar","&amp;","&lt;","&gt;","&quot;","&#39;","_","runInContext","context","uid","pick","Date","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","toString","hasOwnProperty","idCounter","maskSrcKey","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Symbol","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","ctxNow","now","ctxSetTimeout","nativeCeil","ceil","nativeFloor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","nativeReverse","reverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","isObjectLike","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","clear","entry","ListCache","MapCache","SetCache","__data__","add","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","configurable","enumerable","writable","baseAt","paths","skip","get","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","tag","getTag","isFunc","cloneBuffer","initCloneObject","keysIn","getSymbolsIn","getSymbols","symbol","regexp","dataView","buffer","Ctor","cloneArrayBuffer","byteOffset","byteLength","cloneTypedArray","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","escape","evaluate","interpolate","variable","imports","pop","hash","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","parent","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","property","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","baseSortBy","criteria","objCriteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","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","trailing","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","countHolders","newHolders","createRecurry","arrLength","oldArray","reorder","createInverter","toIteratee","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","createToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","details","insertWrapDetails","lastCalled","remaining","rand","memoize","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","before","bind","bindKey","WRAP_BIND_FLAG","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","shouldInvoke","timeSinceLastCall","timerExpired","timeWaiting","trailingEdge","debounced","isInvoking","cancel","flush","defer","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","next","done","iteratorToArray","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","pickBy","toPairs","toPairsIn","camelCase","word","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","toUpperCase","pattern","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","subtract","minuend","subtrahend","after","castArray","chunk","compact","cond","conforms","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","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","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","importsKeys","importsValues","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","times","toLower","toSafeInteger","toUpper","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","velocity-animate","$","init","isWindow","class2type","hasOwn","isArraylike","node","getId","expando","store","setId","uuid","src","copyIsArray","deep","arr","results","ret","q","second","j","dequeue","shift","unshift","box","pageYOffset","scrollTop","clientTop","pageXOffset","scrollLeft","clientLeft","offsetParent","nodeName","offsetParentFn","parentOffset","getTime","Velocity","Utilities","timeLast","IE","documentMode","innerHTML","getElementsByTagName","rAFShim","webkitRequestAnimationFrame","mozRequestAnimationFrame","timeDelta","timeCurrent","performance","perf","nowOffset","timing","navigationStart","_slice","begin","cloned","_inArray","sanitizeElements","elements","Type","isWrapped","isNode","isSVG","SVGElement","isEmptyObject","isJQuery","jquery","EASING_DEFAULT","State","isMobile","navigator","userAgent","isAndroid","isGingerbread","isChrome","chrome","isFirefox","prefixElement","prefixMatches","scrollAnchor","scrollPropertyLeft","scrollPropertyTop","isTicking","calls","delayedElements","CSS","Redirects","Easings","easing","complete","progress","visibility","loop","mobileHA","_cacheValues","promiseRejectEmpty","isAnimating","computedStyle","tweensContainer","rootPropertyValueCache","transformCache","hook","mock","version","major","minor","patch","debug","timestamp","pauseAll","queueName","currentTime","activeCall","resume","k","pauseDelayOnElement","resumeAll","resumeDelayOnElement","generateSpringRK4","springAccelerationForState","state","tension","friction","v","springEvaluateStateWithDerivative","initialState","dt","derivative","dx","dv","springRK4Factory","have_duration","last_state","d","dxdt","dvdt","initState","time_lapsed","abs","percentComplete","linear","swing","cos","PI","spring","exp","easingArray","generateBezier","RegEx","isHex","valueUnwrap","wrappedValueAlreadyExtracted","valueSplit","Lists","colors","transformsBase","transforms3D","units","colorNames","aliceblue","antiquewhite","aquamarine","aqua","azure","beige","bisque","black","blanchedalmond","blueviolet","blue","brown","burlywood","cadetblue","chartreuse","chocolate","coral","cornflowerblue","cornsilk","crimson","cyan","darkblue","darkcyan","darkgoldenrod","darkgray","darkgrey","darkgreen","darkkhaki","darkmagenta","darkolivegreen","darkorange","darkorchid","darkred","darksalmon","darkseagreen","darkslateblue","darkslategray","darkturquoise","darkviolet","deeppink","deepskyblue","dimgray","dimgrey","dodgerblue","firebrick","floralwhite","forestgreen","fuchsia","gainsboro","ghostwhite","gold","goldenrod","gray","grey","greenyellow","green","honeydew","hotpink","indianred","indigo","ivory","khaki","lavenderblush","lavender","lawngreen","lemonchiffon","lightblue","lightcoral","lightcyan","lightgoldenrodyellow","lightgray","lightgrey","lightgreen","lightpink","lightsalmon","lightseagreen","lightskyblue","lightslategray","lightsteelblue","lightyellow","limegreen","lime","linen","magenta","maroon","mediumaquamarine","mediumblue","mediumorchid","mediumpurple","mediumseagreen","mediumslateblue","mediumspringgreen","mediumturquoise","mediumvioletred","midnightblue","mintcream","mistyrose","moccasin","navajowhite","navy","oldlace","olivedrab","olive","orangered","orange","orchid","palegoldenrod","palegreen","paleturquoise","palevioletred","papayawhip","peachpuff","peru","pink","plum","powderblue","purple","red","rosybrown","royalblue","saddlebrown","salmon","sandybrown","seagreen","seashell","sienna","silver","skyblue","slateblue","slategray","snow","springgreen","steelblue","tan","teal","thistle","tomato","turquoise","violet","wheat","whitesmoke","white","yellowgreen","yellow","Hooks","templates","textShadow","boxShadow","clip","backgroundPosition","transformOrigin","perspectiveOrigin","registered","register","rgbComponents","rootProperty","hookTemplate","hookNames","defaultValues","fullHookName","hookPosition","getRoot","hookData","getUnit","substr","fixColors","$0","cleanRootPropertyValue","rootPropertyValue","Values","isCSSNullValue","extractValue","hookRoot","injectValue","hookValue","rootPropertyValueParts","Normalizations","propertyValue","extracted","blur","blurComponent","zoom","transformName","Data","invalid","colorName","converted","hexToRgb","augmentDimension","wantInner","getPropertyValue","augment","sides","fields","getDimension","Names","subMatch","SVGAttribute","SVGAttributes","prefixCheck","vendors","vendorsLength","propertyPrefixed","hex","rgbParts","m","g","getUnitType","getDisplayType","tagName","addClass","classList","currentClass","setAttribute","removeClass","forceStyleLookup","computePropertyValue","computedValue","toggleDisplay","setPropertyValue","revertDisplay","contentBoxHeight","contentBoxWidth","normalizedPropertyName","normalizedPropertyValue","getBBox","log","scrollData","scrollTo","alternateValue","hookName","flushTransformCache","transformString","getTransformFloat","SVGTransforms","translate","skewX","skewY","scale","rotate","transformValue","perspective","arg2","arg3","adjustedSet","animate","getChain","isUtility","promiseData","promise","elementsWrapped","argumentIndex","propertiesMap","syntacticSugar","names","rejecter","elementsLength","elementsIndex","found","activeElement","l","delayTimer","callsToStop","activeTween","endValue","currentValue","completeCall","durationOriginal","delayOriginal","backwards","elementIndex","drag","abortError","callUnitConversionData","lastParent","lastPosition","lastFontSize","lastPercentToPxWidth","lastPercentToPxHeight","lastEmToPx","remToPx","vwToPx","vhToPx","elementArrayIndex","elementUnitConversionData","clearQueue","velocityQueueEntryFlag","callIndex","delayComplete","delayBegin","buildQueue","lastTweensContainer","valueData","skipResolvingEasing","startValue","scrollPositionCurrent","scrollPositionCurrentAlternate","scrollPositionEnd","scrollDirection","axis","scrollOffset","scroll","unitType","lastTween","lastStartValue","stringify","fixPropertyValue","separatedValue","endValueUnitType","startValueUnitType","separateValue","numericValue","iStart","iEnd","aStart","aEnd","inCalc","inRGB","inRGBA","cStart","cEnd","tStart","tEnd","dotStart","dotEnd","uStart","uEnd","nStart","nEnd","sameRatioIndicators","myParent","fontSize","samePercentRatio","sameEmRatio","unitRatios","emToPx","percentToPxWidth","percentToPxHeight","dummy","createElementNS","calculateUnitRatios","parsePropertyValue","getEasing","colorComponents","endValueRGB","startValueRGB","dataArray","processElement","reverseCallsCount","reverseOptions","ticker","requestAnimationFrame","hidden","updateTicker","velocity","elementsSize","inlineValues","computedValues","overflow","response","delayPaused","delayRemaining","mX1","mY1","mX2","mY2","NEWTON_ITERATIONS","SUBDIVISION_PRECISION","SUBDIVISION_MAX_ITERATIONS","kSplineTableSize","kSampleStepSize","float32ArraySupported","mSampleValues","Float32Array","A","aA1","aA2","B","C","calcBezier","aT","getSlope","getTForX","aX","intervalStart","currentSample","lastSample","guessForT","initialSlope","aGuessT","currentSlope","newtonRaphsonIterate","aA","aB","currentX","currentT","binarySubdivide","_precomputed","precompute","calcSampleValues","getControlPoints","steps","callsLength","compactSparseArray","callContainer","timeStart","firstTick","tweenDummyValue","pauseObject","millisecondsEllapsed","callLength","transformPropertyExists","flexValue","tween","patternReplace","tweenDelta","adjustedSetData","translate3d","isStopped","remainingCallsExist","transformHAPropertyExists","tweenContainer","oldStartValue","Zepto"],"mappings":"AAAAA,QAAoB,SAASC,EAAEC,EAAEC,EAAEC,GAAG,SAASC,EAAEC,EAAEC,GAAG,IAAIJ,EAAEG,GAAG,CAAC,IAAIJ,EAAEI,GAAG,CAAC,IAAIE,EAAE,mBAAmBR,SAASA,QAAQ,IAAIO,GAAGC,EAAE,OAAOA,EAAEF,GAAE,GAAI,GAAGG,EAAE,OAAOA,EAAEH,GAAE,GAAI,IAAII,EAAE,IAAIC,MAAM,uBAAuBL,EAAE,KAAK,MAAMI,EAAEE,KAAK,mBAAmBF,EAAE,IAAIG,EAAEV,EAAEG,GAAG,CAACQ,QAAQ,IAAIZ,EAAEI,GAAG,GAAGS,KAAKF,EAAEC,QAAQ,SAASb,GAAoB,OAAOI,EAAlBH,EAAEI,GAAG,GAAGL,IAAeA,IAAIY,EAAEA,EAAEC,QAAQb,EAAEC,EAAEC,EAAEC,GAAG,OAAOD,EAAEG,GAAGQ,QAAQ,IAAI,IAAIL,EAAE,mBAAmBT,SAASA,QAAQM,EAAE,EAAEA,EAAEF,EAAEY,OAAOV,IAAID,EAAED,EAAEE,IAAI,OAAOD,EAA7b,CAA4c,CAACY,EAAE,CAAC,SAASjB,EAAQkB,EAAOJ,IAS9e,SAAUK,EAAQC,GAElB,aAEsB,mBAAVC,QAAwBA,OAAOC,IAEzCD,OAAQD,GACmB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,IAGjBD,EAAOI,gBAAkBH,IAZ7B,CAeGD,OAAQ,WACT,aAEA,IAAIK,EAAgB,WAClB,IAAIC,EAAYN,OAAOO,QAAQC,UAE/B,GAAKF,EAAUG,QACb,MAAO,UAGT,GAAKH,EAAUF,gBACb,MAAO,kBAKT,IAFA,IAAIM,EAAW,CAAE,SAAU,MAAO,KAAM,KAE9BvB,EAAE,EAAGA,EAAIuB,EAASb,OAAQV,IAAM,CACxC,IACIwB,EADSD,EAASvB,GACA,kBACtB,GAAKmB,EAAWK,GACd,OAAOA,GAjBO,GAsBpB,OAAO,SAA0BC,EAAMC,GACrC,OAAOD,EAAMP,GAAiBQ,OAKhC,IAAIC,EAAE,CAAC,SAASjC,EAAQkB,EAAOJ,GAS/B,IAAUoB,EAAQd,EAARc,EAcQ,oBAAVf,OAAwBA,OAASgB,KAdvBf,EAc6B,WAEjD,aAEA,SAASgB,KAET,IAAIC,EAAQD,EAAUT,UAiFtB,OA/EAU,EAAMC,GAAK,SAAUC,EAAWC,GAC9B,GAAMD,GAAcC,EAApB,CAIA,IAAIC,EAASN,KAAKO,QAAUP,KAAKO,SAAW,GAExCC,EAAYF,EAAQF,GAAcE,EAAQF,IAAe,GAM7D,OAJuC,GAAlCI,EAAUC,QAASJ,IACtBG,EAAUE,KAAML,GAGXL,OAGTE,EAAMS,KAAO,SAAUP,EAAWC,GAChC,GAAMD,GAAcC,EAApB,CAIAL,KAAKG,GAAIC,EAAWC,GAGpB,IAAIO,EAAaZ,KAAKa,YAAcb,KAAKa,aAAe,GAMxD,OAJoBD,EAAYR,GAAcQ,EAAYR,IAAe,IAE1DC,IAAa,EAErBL,OAGTE,EAAMY,IAAM,SAAUV,EAAWC,GAC/B,IAAIG,EAAYR,KAAKO,SAAWP,KAAKO,QAASH,GAC9C,GAAMI,GAAcA,EAAU3B,OAA9B,CAGA,IAAIkC,EAAQP,EAAUC,QAASJ,GAK/B,OAJe,GAAVU,GACHP,EAAUQ,OAAQD,EAAO,GAGpBf,OAGTE,EAAMe,UAAY,SAAUb,EAAWc,GACrC,IAAIV,EAAYR,KAAKO,SAAWP,KAAKO,QAASH,GAC9C,GAAMI,GAAcA,EAAU3B,OAA9B,CAIA2B,EAAYA,EAAUW,MAAM,GAC5BD,EAAOA,GAAQ,GAIf,IAFA,IAAIE,EAAgBpB,KAAKa,aAAeb,KAAKa,YAAaT,GAEhDjC,EAAE,EAAGA,EAAIqC,EAAU3B,OAAQV,IAAM,CACzC,IAAIkC,EAAWG,EAAUrC,GACZiD,GAAiBA,EAAef,KAI3CL,KAAKc,IAAKV,EAAWC,UAEde,EAAef,IAGxBA,EAASgB,MAAOrB,KAAMkB,GAGxB,OAAOlB,OAGTE,EAAMoB,OAAS,kBACNtB,KAAKO,eACLP,KAAKa,aAGPZ,GAlGiB,mBAAVf,QAAwBA,OAAOC,IAEzCD,OAAQD,GACmB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,IAGjBc,EAAOE,UAAYhB,KA8FrB,IAAIsC,EAAE,CAAC,SAAS1D,EAAQkB,EAAOJ,GAQ/B,IAAUK,EAAQC,EAARD,EAyBTA,OAzBiBC,EAyBT,SAAkBD,EAAQI,GAErC,aAEA,IAAIoC,EAAQ,CAKZC,OAAe,SAAUlD,EAAGmD,GAC1B,IAAM,IAAIC,KAAQD,EAChBnD,EAAGoD,GAASD,EAAGC,GAEjB,OAAOpD,GAKTqD,OAAe,SAAUC,EAAKC,GAC5B,OAAWD,EAAMC,EAAQA,GAAQA,IAK/BC,EAAaC,MAAMxC,UAAU2B,MAGjCK,EAAMS,UAAY,SAAUC,GAC1B,OAAKF,MAAMG,QAASD,GAEXA,EAGJA,MAAAA,EACI,GAGuB,iBAAPA,GAAwC,iBAAdA,EAAIrD,OAG9CkD,EAAWnD,KAAMsD,GAInB,CAAEA,IAKXV,EAAMY,WAAa,SAAUC,EAAKH,GAChC,IAAInB,EAAQsB,EAAI5B,QAASyB,IACV,GAAVnB,GACHsB,EAAIrB,OAAQD,EAAO,IAMvBS,EAAMc,UAAY,SAAU1C,EAAMC,GAChC,KAAQD,EAAK2C,YAAc3C,GAAQ4C,SAASC,MAE1C,GADA7C,EAAOA,EAAK2C,WACPnD,EAAiBQ,EAAMC,GAC1B,OAAOD,GAQb4B,EAAMkB,gBAAkB,SAAU9C,GAChC,MAAoB,iBAARA,EACH4C,SAASG,cAAe/C,GAE1BA,GAMT4B,EAAMoB,YAAc,SAAUC,GAC5B,IAAIlD,EAAS,KAAOkD,EAAMC,KACrB9C,KAAML,IACTK,KAAML,GAAUkD,IAMpBrB,EAAMuB,mBAAqB,SAAUC,EAAOnD,GAE1CmD,EAAQxB,EAAMS,UAAWe,GACzB,IAAIC,EAAU,GAyBd,OAvBAD,EAAME,QAAS,SAAUtD,GAEvB,GAAQA,aAAgBuD,YAIxB,GAAMtD,EAAN,CAMKT,EAAiBQ,EAAMC,IAC1BoD,EAAQvC,KAAMd,GAKhB,IAFA,IAAIwD,EAAaxD,EAAKyD,iBAAkBxD,GAE9B1B,EAAE,EAAGA,EAAIiF,EAAWvE,OAAQV,IACpC8E,EAAQvC,KAAM0C,EAAWjF,SAZzB8E,EAAQvC,KAAMd,KAgBXqD,GAKTzB,EAAM8B,eAAiB,SAAUC,EAAQC,EAAYC,GACnDA,EAAYA,GAAa,IAEzB,IAAI9D,EAAS4D,EAAO/D,UAAWgE,GAC3BE,EAAcF,EAAa,UAE/BD,EAAO/D,UAAWgE,GAAe,WAC/B,IAAIG,EAAU3D,KAAM0D,GACpBE,aAAcD,GAEd,IAAIzC,EAAO2C,UACPC,EAAQ9D,KACZA,KAAM0D,GAAgBK,WAAY,WAChCpE,EAAO0B,MAAOyC,EAAO5C,UACd4C,EAAOJ,IACbD,KAMPjC,EAAMwC,SAAW,SAAUC,GACzB,IAAIC,EAAa1B,SAAS0B,WACP,YAAdA,GAA0C,eAAdA,EAE/BH,WAAYE,GAEZzB,SAAS2B,iBAAkB,mBAAoBF,IAOnDzC,EAAM4C,SAAW,SAAUC,GACzB,OAAOA,EAAIC,QAAS,cAAe,SAAUC,EAAOC,EAAIC,GACtD,OAAOD,EAAK,IAAMC,IACjBC,eAGL,IAAIC,EAAU3F,EAAO2F,QA4CrB,OAtCAnD,EAAMoD,SAAW,SAAUC,EAAaC,GACtCtD,EAAMwC,SAAU,WACd,IAAIe,EAAkBvD,EAAM4C,SAAUU,GAClCE,EAAW,QAAUD,EACrBE,EAAgBzC,SAASa,iBAAkB,IAAM2B,EAAW,KAC5DE,EAAc1C,SAASa,iBAAkB,OAAS0B,GAClD/B,EAAQxB,EAAMS,UAAWgD,GAC1BE,OAAQ3D,EAAMS,UAAWiD,IACxBE,EAAkBJ,EAAW,WAC7BK,EAASrG,EAAOqG,OAEpBrC,EAAME,QAAS,SAAUtD,GACvB,IAEI0F,EAFAC,EAAO3F,EAAK4F,aAAcR,IAC5BpF,EAAK4F,aAAcJ,GAErB,IACEE,EAAUC,GAAQE,KAAKC,MAAOH,GAC9B,MAAQI,GAMR,YAJKhB,GACHA,EAAQgB,MAAO,iBAAmBX,EAAW,OAASpF,EAAKgG,UAC3D,KAAOD,IAKX,IAAIE,EAAW,IAAIhB,EAAajF,EAAM0F,GAEjCD,GACHA,EAAOS,KAAMlG,EAAMkF,EAAWe,QAS/BrE,GAnOiB,mBAAVtC,QAAwBA,OAAOC,IAEzCD,OAAQ,CACN,8CACC,SAAUE,GACX,OAAOH,EAASD,EAAQI,KAEC,iBAAVL,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfD,EACAnB,EAAQ,8BAIVmB,EAAO+G,aAAe9G,EACpBD,EACAA,EAAOI,kBAsNX,CAAC4G,4BAA4B,IAAIC,EAAE,CAAC,SAASpI,EAAQkB,EAAOJ,GAU9D,IAAYK,EAAQC,EAARD,EAaRA,OAbgBC,EAaR,WACZ,aAKA,SAASiH,EAAcC,GACrB,IAAItE,EAAMuE,WAAYD,GAGtB,OADqC,GAAvBA,EAAM1F,QAAQ,OAAe4F,MAAOxE,IAChCA,EAKpB,IAAIyE,EAA6B,oBAAX3B,QAFtB,aAGE,SAAU4B,GACR5B,QAAQgB,MAAOY,IAKfC,EAAe,CACjB,cACA,eACA,aACA,gBACA,aACA,cACA,YACA,eACA,kBACA,mBACA,iBACA,qBAGEC,EAAqBD,EAAa3H,OAwBtC,SAAS6H,EAAU9G,GACjB,IAAI+G,EAAQC,iBAAkBhH,GAM9B,OALM+G,GACJL,EAAU,kBAAoBK,EAC5B,6FAGGA,EAKT,IAEIE,EAFAC,GAAU,EAyCd,SAASC,EAASnH,GAShB,GAzCF,WAEE,IAAKkH,EAAL,CAGAA,GAAU,EAQV,IAAIhF,EAAMU,SAASwE,cAAc,OACjClF,EAAI6E,MAAMM,MAAQ,QAClBnF,EAAI6E,MAAMO,QAAU,kBACpBpF,EAAI6E,MAAMQ,YAAc,QACxBrF,EAAI6E,MAAMS,YAAc,kBACxBtF,EAAI6E,MAAMU,UAAY,aAEtB,IAAI5E,EAAOD,SAASC,MAAQD,SAAS8E,gBACrC7E,EAAK8E,YAAazF,GAClB,IAAI6E,EAAQD,EAAU5E,GAEtB+E,EAA8D,KAA7CW,KAAKC,MAAOvB,EAAcS,EAAMM,QACjDF,EAAQF,eAAiBA,EAEzBpE,EAAKiF,YAAa5F,IAMlB6F,GAGoB,iBAAR/H,IACVA,EAAO4C,SAASG,cAAe/C,IAI3BA,GAAuB,iBAARA,GAAqBA,EAAKgI,SAA/C,CAIA,IAAIjB,EAAQD,EAAU9G,GAGtB,GAAsB,QAAjB+G,EAAMkB,QACT,OA5FJ,WASE,IARA,IAAIC,EAAO,CACTb,MAAO,EACPc,OAAQ,EACRC,WAAY,EACZC,YAAa,EACbC,WAAY,EACZC,YAAa,GAELhK,EAAE,EAAGA,EAAIsI,EAAoBtI,IAErC2J,EADkBtB,EAAarI,IACT,EAExB,OAAO2J,EA+EEM,GAGT,IAAIN,EAAO,GACXA,EAAKb,MAAQrH,EAAKyI,YAClBP,EAAKC,OAASnI,EAAK0I,aAKnB,IAHA,IAAIC,EAAcT,EAAKS,YAAiC,cAAnB5B,EAAMU,UAGjClJ,EAAE,EAAGA,EAAIsI,EAAoBtI,IAAM,CAC3C,IAAIqK,EAAchC,EAAarI,GAC3BgI,EAAQQ,EAAO6B,GACf3G,EAAMuE,WAAYD,GAEtB2B,EAAMU,GAAiBnC,MAAOxE,GAAc,EAANA,EAGxC,IAAI4G,EAAeX,EAAKY,YAAcZ,EAAKa,aACvCC,EAAgBd,EAAKe,WAAaf,EAAKgB,cACvCC,EAAcjB,EAAKkB,WAAalB,EAAKmB,YACrCC,EAAepB,EAAKqB,UAAYrB,EAAKsB,aACrChC,EAAcU,EAAKuB,gBAAkBvB,EAAKwB,iBAC1CC,EAAezB,EAAK0B,eAAiB1B,EAAK2B,kBAE1CC,EAAuBnB,GAAe1B,EAGtC8C,EAAazD,EAAcS,EAAMM,QACjB,IAAf0C,IACH7B,EAAKb,MAAQ0C,GAETD,EAAuB,EAAIjB,EAAerB,IAGhD,IAAIwC,EAAc1D,EAAcS,EAAMoB,QAatC,OAZqB,IAAhB6B,IACH9B,EAAKC,OAAS6B,GAEVF,EAAuB,EAAId,EAAgBW,IAGjDzB,EAAKE,WAAaF,EAAKb,OAAUwB,EAAerB,GAChDU,EAAKG,YAAcH,EAAKC,QAAWa,EAAgBW,GAEnDzB,EAAKI,WAAaJ,EAAKb,MAAQ8B,EAC/BjB,EAAKK,YAAcL,EAAKC,OAASmB,EAE1BpB,GAGT,OAAOf,GAjMiB,mBAAV7H,QAAwBA,OAAOC,IAEzCD,OAAQD,GACmB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,IAGjBD,EAAO+H,QAAU9H,KA6LnB,IAAI4K,EAAE,CAAC,SAAShM,EAAQkB,EAAOJ,GAK/B,IAAUK,EAAQC,EAARD,EAsBTA,OAtBiBC,EAsBT,SAAkB6K,GAC7B,aAKA,SAASC,IACPD,EAASC,KAAK1I,MAAOrB,KAAM6D,WAG7B,IAAI3D,EAAQ6J,EAAKvK,UAAYwK,OAAOC,OAAQH,EAASC,KAAKvK,WAEtD0K,EAAUhK,EAAMgK,QACpBhK,EAAMgK,QAAU,WAEdlK,KAAKmK,GAAKnK,KAAKoK,OAAOC,WACtBH,EAAQtL,KAAMoB,MACdA,KAAKsK,SAAW,IAGlBpK,EAAMqK,eAAiB,WACrB,IAAKvK,KAAKwK,UAAV,CAIAxK,KAAKsK,SAASH,GAAKnK,KAAKmK,GAExBnK,KAAKsK,SAAS,kBAAoBtK,KAAKmK,GACvCnK,KAAKsK,SAASG,OAASjD,KAAKiD,SAE5B,IAAIC,EAAc1K,KAAKoK,OAAO9E,QAAQoF,YAClCC,EAAU3K,KAAKoK,OAAOQ,SAC1B,IAAM,IAAIC,KAAOH,EAAc,CAC7B,IAAII,EAASH,EAASE,GACtB7K,KAAKsK,SAAUO,GAAQC,EAAQ9K,KAAK+K,QAAS/K,SAIjD,IAAIgL,EAAW9K,EAAM+K,QAUrB,OATA/K,EAAM+K,QAAU,WAEdD,EAAS3J,MAAOrB,KAAM6D,WAEtB7D,KAAKkL,IAAI,CACPrD,QAAS,MAINkC,GAnEiB,mBAAV7K,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,qBAEFD,GACyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,cAIVmB,EAAOmM,QAAUnM,EAAOmM,SAAW,GACnCnM,EAAOmM,QAAQpB,KAAO9K,EACpBD,EAAO8K,YAwDX,CAACsB,SAAW,KAAKC,EAAE,CAAC,SAASxN,EAAQkB,EAAOJ,GAK5C,IAAUK,EAAQC,EAARD,EAyBTA,OAzBiBC,EAyBT,SAAkB8H,EAAS+C,GACpC,aAGA,SAASwB,EAAYC,IACnBvL,KAAKuL,QAAUA,KAGbvL,KAAKsF,QAAUiG,EAAQjG,QAAStF,KAAK8E,WACrC9E,KAAK+K,QAAUQ,EAAQR,QACvB/K,KAAKwL,MAAQD,EAAQE,cACrBzL,KAAK8H,KAAOyD,EAAQzD,MAIxB,IAAI5H,EAAQoL,EAAW9L,UA8GvB,MAxGoB,CAClB,eACA,yBACA,eACA,oBACA,oBACA,oBACA,cAGY0D,QAAS,SAAUM,GAC/BtD,EAAOsD,GAAe,WACpB,OAAOsG,EAAStK,UAAWgE,GAAanC,MAAOrB,KAAKuL,QAAS1H,cAOjE3D,EAAMwL,0BAA4B,WAEhC,IAAI5D,EAAOf,EAAS/G,KAAKuL,QAAQR,SAIjC,OADe/K,KAAKuL,QAAQzD,MAAQA,GACjBA,EAAKG,aAAejI,KAAKuL,QAAQzD,KAAKG,aAK3D/H,EAAMyL,gBAAkB,WACtB3L,KAAKuL,QAAQI,gBAAgBtK,MAAOrB,KAAM6D,YAG5C3D,EAAM0L,eAAiB,WACrB5L,KAAK6L,eAAgB,SAAU,UAGjC3L,EAAM4L,aAAe,WACnB9L,KAAK6L,eAAgB,MAAO,WAQ9B3L,EAAM2L,eAAiB,SAAUE,EAASjE,GACxC,IAAIkE,EAAcD,EAAUjE,EACxBmE,EAAY,QAAUnE,EAI1B,GAFA9H,KAAK2L,gBAAiBK,EAAaC,IAE9BjM,KAAMgM,GAAX,CAIA,IAAIE,EAAgBlM,KAAKmM,mBACzBnM,KAAMgM,GAAgBE,GAAiBA,EAAeD,IAEpDjM,KAAKuL,QAAQzD,KAAM,QAAUA,KAGjC5H,EAAMiM,iBAAmB,WACvB,IAAIC,EAAYpM,KAAKuL,QAAQE,cAAc,GAC3C,OAAOW,GAAaA,EAAUrB,SAAWhE,EAASqF,EAAUrB,UAK9D7K,EAAMkK,OAAS,WACbpK,KAAKuL,QAAQnB,OAAO/I,MAAOrB,KAAKuL,QAAS1H,YAG3C3D,EAAM6G,QAAU,WACd/G,KAAKuL,QAAQxE,UACb/G,KAAK8H,KAAO9H,KAAKuL,QAAQzD,MAK3BwD,EAAWe,MAAQ,GAEnBf,EAAWrB,OAAS,SAAUnF,EAAWQ,GAEvC,SAASgH,IACPhB,EAAWjK,MAAOrB,KAAM6D,WAe1B,OAZAyI,EAAK9M,UAAYwK,OAAOC,OAAQ/J,IACjBqM,YAAcD,EAGxBhH,IACHgH,EAAKhH,QAAUA,GAKjBgG,EAAWe,MAFXC,EAAK9M,UAAUsF,UAAYA,GAEKwH,GAK3BhB,GAnJe,mBAAVpM,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,oBACA,qBAEFD,GACyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,YACRA,EAAQ,cAIVmB,EAAOmM,QAAUnM,EAAOmM,SAAW,GACnCnM,EAAOmM,QAAQG,WAAarM,EAC1BD,EAAO+H,QACP/H,EAAO8K,YAqIX,CAAC0C,WAAW,EAAEpB,SAAW,KAAKqB,EAAE,CAAC,SAAS5O,EAAQkB,EAAOJ,GAKzD,IAAUK,EAAQC,EAARD,EAqBTA,OArBiBC,EAqBT,SAAkBqM,GAC7B,aAEA,IAAIoB,EAAUpB,EAAWrB,OAAO,WAE5B/J,EAAQwM,EAAQlN,UAmCpB,OAjCAU,EAAMyM,aAAe,WACnB3M,KAAK4M,EAAI,EACT5M,KAAK6M,EAAI,EACT7M,KAAK8M,KAAO,EACZ9M,KAAK2L,gBAAiB,SAAU,eAGlCzL,EAAM6M,uBAAyB,SAAUC,GACvCA,EAAKjG,UAEL,IAAIkG,EAAYD,EAAKlF,KAAKI,WAAalI,KAAKkN,OAExCC,EAAiBnN,KAAKuL,QAAQzD,KAAKE,WAAahI,KAAKkN,OACzC,IAAXlN,KAAK4M,GAAWK,EAAYjN,KAAK4M,EAAIO,IACxCnN,KAAK4M,EAAI,EACT5M,KAAK6M,EAAI7M,KAAK8M,MAGhB,IAAIM,EAAW,CACbR,EAAG5M,KAAK4M,EACRC,EAAG7M,KAAK6M,GAMV,OAHA7M,KAAK8M,KAAOtF,KAAK6F,IAAKrN,KAAK8M,KAAM9M,KAAK6M,EAAIG,EAAKlF,KAAKK,aACpDnI,KAAK4M,GAAKK,EAEHG,GAGTlN,EAAMoN,kBAAoB,WACxB,MAAO,CAAEvF,OAAQ/H,KAAK8M,OAGjBJ,GA1DiB,mBAAVxN,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,kBAEFD,GAC0B,iBAAXN,EAEjBI,EAAOJ,QAAUM,EACfpB,EAAQ,mBAIVoB,EACED,EAAOmM,QAAQG,aAgDnB,CAACiC,iBAAiB,IAAIC,EAAE,CAAC,SAAS3P,EAAQkB,EAAOJ,GAOjD,IAAUK,EAAQC,EAARD,EAwBTA,OAxBiBC,EAwBT,SAAkBqM,EAAYmC,GACzC,aAKE,IAAIC,EAAcpC,EAAWrB,OAAO,WAEhC/J,EAAQwN,EAAYlO,UAEpBmO,EAAkB,CACpBC,mBAAmB,EACnBxD,QAAQ,EACRuB,iBAAiB,GAInB,IAAM,IAAIhM,KAAU8N,EAAQjO,UAEpBmO,EAAiBhO,KACrBO,EAAOP,GAAW8N,EAAQjO,UAAWG,IAIzC,IAAIkO,EAAiB3N,EAAM2N,eAC3B3N,EAAM2N,eAAiB,WAErB7N,KAAKwL,MAAQxL,KAAKuL,QAAQE,cAC1BoC,EAAejP,KAAMoB,OAIvB,IAAI8N,EAAa5N,EAAM4N,WASvB,OARA5N,EAAM4N,WAAa,SAAUC,GAC3B,MAAe,YAAVA,OACgCC,IAA5BhO,KAAKsF,QAAQ2I,WAClBjO,KAAKsF,QAAQ2I,WAAajO,KAAKsF,QAAQ4I,SAEpCJ,EAAWzM,MAAOrB,KAAKuL,QAAS1H,YAGlC6J,GA9De,mBAAVxO,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,iBACA,0BAEFD,GACyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,kBACRA,EAAQ,mBAIVoB,EACED,EAAOmM,QAAQG,WACftM,EAAOyO,UAiDX,CAACF,iBAAiB,EAAEY,iBAAiB,KAAKC,EAAE,CAAC,SAASvQ,EAAQkB,EAAOJ,GAKrE,IAAUK,EAAQC,EAARD,EAqBTA,OArBiBC,EAqBT,SAAkBqM,GAC7B,aAEA,IAAI+C,EAAW/C,EAAWrB,OAAQ,WAAY,CAC5CqE,oBAAqB,IAGnBpO,EAAQmO,EAAS7O,UAmBrB,OAjBAU,EAAMyM,aAAe,WACnB3M,KAAK6M,EAAI,GAGX3M,EAAM6M,uBAAyB,SAAUC,GACvCA,EAAKjG,UACL,IAAI6F,GAAM5M,KAAKuL,QAAQzD,KAAKE,WAAagF,EAAKlF,KAAKI,YACjDlI,KAAKsF,QAAQgJ,oBACXzB,EAAI7M,KAAK6M,EAEb,OADA7M,KAAK6M,GAAKG,EAAKlF,KAAKK,YACb,CAAEyE,EAAGA,EAAGC,EAAGA,IAGpB3M,EAAMoN,kBAAoB,WACxB,MAAO,CAAEvF,OAAQ/H,KAAK6M,IAGjBwB,GA5CiB,mBAAVnP,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,kBAEFD,GACyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,mBAIVoB,EACED,EAAOmM,QAAQG,aAkCnB,CAACiC,iBAAiB,IAAIgB,GAAG,CAAC,SAAS1Q,EAAQkB,EAAOJ,GASlD,IAAUK,EAAQC,EAARD,EAwBTA,OAxBiBC,EAwBT,SAAkB6K,EAAU/C,GAEvC,aAKE,IAAI0G,EAAU3D,EAASG,OAAO,WAE9BwD,EAAQe,cAAcN,SAAW,aAEjC,IAAIhO,EAAQuN,EAAQjO,UAiMpB,OA/LAU,EAAMyM,aAAe,WACnB3M,KAAK+G,UACL/G,KAAK2L,gBAAiB,cAAe,cACrC3L,KAAK2L,gBAAiB,SAAU,cAChC3L,KAAK6N,iBAGL7N,KAAKyO,MAAQ,GACb,IAAM,IAAItQ,EAAE,EAAGA,EAAI6B,KAAK0O,KAAMvQ,IAC5B6B,KAAKyO,MAAM/N,KAAM,GAGnBV,KAAK8M,KAAO,EACZ9M,KAAK2O,mBAAqB,GAG5BzO,EAAM2N,eAAiB,WAGrB,GAFA7N,KAAK4O,qBAEC5O,KAAK6O,YAAc,CACvB,IAAIzC,EAAYpM,KAAKwL,MAAM,GACvBsD,EAAgB1C,GAAaA,EAAUrB,QAE3C/K,KAAK6O,YAAcC,GAAiB/H,EAAS+H,GAAgB5G,YAE3DlI,KAAKmN,eAGT,IAAI0B,EAAc7O,KAAK6O,aAAe7O,KAAKkN,OAGvCC,EAAiBnN,KAAKmN,eAAiBnN,KAAKkN,OAC5CwB,EAAOvB,EAAiB0B,EAExBE,EAASF,EAAc1B,EAAiB0B,EAG5CH,EAAOlH,KADUuH,GAAUA,EAAS,EAAI,QAAU,SACvBL,GAC3B1O,KAAK0O,KAAOlH,KAAK6F,IAAKqB,EAAM,IAG9BxO,EAAM0O,kBAAoB,WAExB,IACII,EADahP,KAAK8N,WAAW,YACJ9N,KAAK+K,QAAQxI,WAAavC,KAAK+K,QAGxDjD,EAAOf,EAASiI,GACpBhP,KAAKmN,eAAiBrF,GAAQA,EAAKE,YAGrC9H,EAAM6M,uBAAyB,SAAUC,GACvCA,EAAKjG,UAEL,IAAIkI,EAAYjC,EAAKlF,KAAKI,WAAalI,KAAK6O,YAGxCK,EAAU1H,KAFGyH,GAAaA,EAAY,EAAI,QAAU,QAEtBjC,EAAKlF,KAAKI,WAAalI,KAAK6O,aAC9DK,EAAU1H,KAAK2H,IAAKD,EAASlP,KAAK0O,MAalC,IAXA,IAEIU,EAAcpP,KAFCA,KAAKsF,QAAQ+J,gBAC9B,4BAA8B,sBACQH,EAASlC,GAE7CI,EAAW,CACbR,EAAG5M,KAAK6O,YAAcO,EAAYE,IAClCzC,EAAGuC,EAAYvC,GAGb0C,EAAYH,EAAYvC,EAAIG,EAAKlF,KAAKK,YACtCqH,EAASN,EAAUE,EAAYE,IACzBnR,EAAIiR,EAAYE,IAAKnR,EAAIqR,EAAQrR,IACzC6B,KAAKyO,MAAMtQ,GAAKoR,EAGlB,OAAOnC,GAGTlN,EAAMuP,mBAAqB,SAAUP,GACnC,IAAIQ,EAAW1P,KAAK2P,gBAAiBT,GAEjCU,EAAWpI,KAAK2H,IAAI9N,MAAOmG,KAAMkI,GAErC,MAAO,CACLJ,IAAKI,EAASjP,QAASmP,GACvB/C,EAAG+C,IAQP1P,EAAMyP,gBAAkB,SAAUT,GAChC,GAAKA,EAAU,EAEb,OAAOlP,KAAKyO,MAOd,IAJA,IAAIiB,EAAW,GAEXG,EAAa7P,KAAK0O,KAAO,EAAIQ,EAEvB/Q,EAAI,EAAGA,EAAI0R,EAAY1R,IAC/BuR,EAASvR,GAAK6B,KAAK8P,cAAe3R,EAAG+Q,GAEvC,OAAOQ,GAGTxP,EAAM4P,cAAgB,SAAUR,EAAKJ,GACnC,GAAKA,EAAU,EACb,OAAOlP,KAAKyO,MAAOa,GAGrB,IAAIS,EAAa/P,KAAKyO,MAAMtN,MAAOmO,EAAKA,EAAMJ,GAE9C,OAAO1H,KAAK6F,IAAIhM,MAAOmG,KAAMuI,IAI/B7P,EAAM8P,0BAA4B,SAAUd,EAASlC,GACnD,IAAIsC,EAAMtP,KAAK2O,mBAAqB3O,KAAK0O,KAGzCY,EAFuB,EAAVJ,GAAeI,EAAMJ,EAAUlP,KAAK0O,KAElC,EAAIY,EAEnB,IAAIW,EAAUjD,EAAKlF,KAAKI,YAAc8E,EAAKlF,KAAKK,YAGhD,OAFAnI,KAAK2O,mBAAqBsB,EAAUX,EAAMJ,EAAUlP,KAAK2O,mBAElD,CACLW,IAAKA,EACLzC,EAAG7M,KAAK8P,cAAeR,EAAKJ,KAIhChP,EAAMgQ,aAAe,SAAUC,GAC7B,IAAIC,EAAYrJ,EAASoJ,GACrBE,EAASrQ,KAAK4N,kBAAmBuC,GAGjCG,EADetQ,KAAK8N,WAAW,cACPuC,EAAOE,KAAOF,EAAOG,MAC7CC,EAAQH,EAASF,EAAUlI,WAC3BwI,EAAWlJ,KAAKmJ,MAAOL,EAAStQ,KAAK6O,aACzC6B,EAAWlJ,KAAK6F,IAAK,EAAGqD,GACxB,IAAIE,EAAUpJ,KAAKmJ,MAAOF,EAAQzQ,KAAK6O,aAEvC+B,GAAWH,EAAQzQ,KAAK6O,YAAc,EAAI,EAC1C+B,EAAUpJ,KAAK2H,IAAKnP,KAAK0O,KAAO,EAAGkC,GAMnC,IAHA,IACIC,GADc7Q,KAAK8N,WAAW,aACFuC,EAAOS,IAAMT,EAAOU,QAClDX,EAAUjI,YACFhK,EAAIuS,EAAUvS,GAAKyS,EAASzS,IACpC6B,KAAKyO,MAAMtQ,GAAKqJ,KAAK6F,IAAKwD,EAAW7Q,KAAKyO,MAAMtQ,KAIpD+B,EAAMoN,kBAAoB,WACxBtN,KAAK8M,KAAOtF,KAAK6F,IAAIhM,MAAOmG,KAAMxH,KAAKyO,OACvC,IAAI3G,EAAO,CACTC,OAAQ/H,KAAK8M,MAOf,OAJK9M,KAAK8N,WAAW,cACnBhG,EAAKb,MAAQjH,KAAKgR,yBAGblJ,GAGT5H,EAAM8Q,sBAAwB,WAI5B,IAHA,IAAIC,EAAa,EAEb9S,EAAI6B,KAAK0O,OACHvQ,GACe,IAAlB6B,KAAKyO,MAAMtQ,IAGhB8S,IAGF,OAASjR,KAAK0O,KAAOuC,GAAejR,KAAK6O,YAAc7O,KAAKkN,QAG9DhN,EAAMgR,kBAAoB,WACxB,IAAIC,EAAgBnR,KAAKmN,eAEzB,OADAnN,KAAK4O,oBACEuC,GAAiBnR,KAAKmN,gBAGxBM,GAjOe,mBAAVvO,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,oBACA,qBAEFD,GACyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,YACRA,EAAQ,aAIVmB,EAAOyO,QAAUxO,EACfD,EAAO8K,SACP9K,EAAO+H,UAoNX,CAACyF,WAAW,EAAEpB,SAAW,KAAKgG,GAAG,CAAC,SAASvT,EAAQkB,EAAOJ,GAK1D,IAAUK,EAAQC,EAARD,EA0BTA,OA1BiBC,EA0BT,SAAkBgB,EAAW8G,GACxC,aAeA,IAAIsK,EAAe7O,SAAS8E,gBAAgBX,MAExC2K,EAAuD,iBAA3BD,EAAaE,WAC3C,aAAe,mBACbC,EAAqD,iBAA1BH,EAAaI,UAC1C,YAAc,kBAEZC,EAAqB,CACvBC,iBAAkB,sBAClBJ,WAAY,iBACXD,GAGCM,EAAmB,CACrBH,UAAWD,EACXD,WAAYD,EACZO,mBAAoBP,EAAqB,WACzCA,mBAAoBA,EAAqB,WACzCQ,gBAAiBR,EAAqB,SAKxC,SAASvH,EAAMgB,EAASX,GAChBW,IAIN/K,KAAK+K,QAAUA,EAEf/K,KAAKoK,OAASA,EACdpK,KAAKoN,SAAW,CACdR,EAAG,EACHC,EAAG,GAGL7M,KAAKkK,WAIP,IAAIhK,EAAQ6J,EAAKvK,UAAYwK,OAAOC,OAAQhK,EAAUT,WACtDU,EAAMqM,YAAcxC,EAEpB7J,EAAMgK,QAAU,WAEdlK,KAAK+R,QAAU,CACbC,cAAe,GACfC,MAAO,GACPC,MAAO,IAGTlS,KAAKkL,IAAI,CACPkC,SAAU,cAKdlN,EAAM0C,YAAc,SAAUC,GAC5B,IAAIlD,EAAS,KAAOkD,EAAMC,KACrB9C,KAAML,IACTK,KAAML,GAAUkD,IAIpB3C,EAAM6G,QAAU,WACd/G,KAAK8H,KAAOf,EAAS/G,KAAK+K,UAO5B7K,EAAMgL,IAAM,SAAUvE,GACpB,IAAIwL,EAAYnS,KAAK+K,QAAQpE,MAE7B,IAAM,IAAIhF,KAAQgF,EAAQ,CAGxBwL,EADoBP,EAAkBjQ,IAAUA,GACnBgF,EAAOhF,KAKxCzB,EAAMkS,YAAc,WAClB,IAAIzL,EAAQC,iBAAkB5G,KAAK+K,SAC/BsH,EAAerS,KAAKoK,OAAO0D,WAAW,cACtCwE,EAActS,KAAKoK,OAAO0D,WAAW,aACrCyE,EAAS5L,EAAO0L,EAAe,OAAS,SACxCG,EAAS7L,EAAO2L,EAAc,MAAQ,UACtC1F,EAAIxG,WAAYmM,GAChB1F,EAAIzG,WAAYoM,GAEhBC,EAAazS,KAAKoK,OAAOtC,MACA,GAAxByK,EAAO9R,QAAQ,OAClBmM,EAAMA,EAAI,IAAQ6F,EAAWxL,QAEF,GAAxBuL,EAAO/R,QAAQ,OAClBoM,EAAMA,EAAI,IAAQ4F,EAAW1K,QAG/B6E,EAAIvG,MAAOuG,GAAM,EAAIA,EACrBC,EAAIxG,MAAOwG,GAAM,EAAIA,EAErBD,GAAKyF,EAAeI,EAAW/J,YAAc+J,EAAW9J,aACxDkE,GAAKyF,EAAcG,EAAW5J,WAAa4J,EAAW3J,cAEtD9I,KAAKoN,SAASR,EAAIA,EAClB5M,KAAKoN,SAASP,EAAIA,GAIpB3M,EAAMwS,eAAiB,WACrB,IAAID,EAAazS,KAAKoK,OAAOtC,KACzBnB,EAAQ,GACR0L,EAAerS,KAAKoK,OAAO0D,WAAW,cACtCwE,EAActS,KAAKoK,OAAO0D,WAAW,aAGrC6E,EAAWN,EAAe,cAAgB,eAC1CO,EAAYP,EAAe,OAAS,QACpCQ,EAAiBR,EAAe,QAAU,OAE1CzF,EAAI5M,KAAKoN,SAASR,EAAI6F,EAAYE,GAEtChM,EAAOiM,GAAc5S,KAAK8S,UAAWlG,GAErCjG,EAAOkM,GAAmB,GAG1B,IAAIE,EAAWT,EAAc,aAAe,gBACxCU,EAAYV,EAAc,MAAQ,SAClCW,EAAiBX,EAAc,SAAW,MAE1CzF,EAAI7M,KAAKoN,SAASP,EAAI4F,EAAYM,GAEtCpM,EAAOqM,GAAchT,KAAKkT,UAAWrG,GAErClG,EAAOsM,GAAmB,GAE1BjT,KAAKkL,IAAKvE,GACV3G,KAAKiB,UAAW,SAAU,CAAEjB,QAG9BE,EAAM4S,UAAY,SAAUlG,GAC1B,IAAIuG,EAAenT,KAAKoK,OAAO0D,WAAW,cAC1C,OAAO9N,KAAKoK,OAAO9E,QAAQ8N,kBAAoBD,EACzCvG,EAAI5M,KAAKoK,OAAOtC,KAAKb,MAAU,IAAQ,IAAM2F,EAAI,MAGzD1M,EAAMgT,UAAY,SAAUrG,GAC1B,IAAIsG,EAAenT,KAAKoK,OAAO0D,WAAW,cAC1C,OAAO9N,KAAKoK,OAAO9E,QAAQ8N,iBAAmBD,EACxCtG,EAAI7M,KAAKoK,OAAOtC,KAAKC,OAAW,IAAQ,IAAM8E,EAAI,MAG1D3M,EAAMmT,cAAgB,SAAUzG,EAAGC,GACjC7M,KAAKoS,cAEL,IAAIkB,EAAOtT,KAAKoN,SAASR,EACrB2G,EAAOvT,KAAKoN,SAASP,EAErB2G,EAAa5G,GAAK5M,KAAKoN,SAASR,GAAKC,GAAK7M,KAAKoN,SAASP,EAM5D,GAHA7M,KAAKyT,YAAa7G,EAAGC,IAGhB2G,GAAexT,KAAK0T,gBAAzB,CAKA,IAAIC,EAAS/G,EAAI0G,EACbM,EAAS/G,EAAI0G,EACbM,EAAkB,GACtBA,EAAgBpC,UAAYzR,KAAK8T,aAAcH,EAAQC,GAEvD5T,KAAKuR,WAAW,CACdwC,GAAIF,EACJG,gBAAiB,CACfvC,UAAWzR,KAAK0S,gBAElBuB,YAAY,SAdZjU,KAAK0S,kBAkBTxS,EAAM4T,aAAe,SAAUlH,EAAGC,GAMhC,MAAO,gBAFPD,EAFmB5M,KAAKoK,OAAO0D,WAAW,cAEvBlB,GAAKA,GAEI,QAD5BC,EAFkB7M,KAAKoK,OAAO0D,WAAW,aAEvBjB,GAAKA,GACkB,UAI3C3M,EAAMgU,KAAO,SAAUtH,EAAGC,GACxB7M,KAAKyT,YAAa7G,EAAGC,GACrB7M,KAAK0S,kBAGPxS,EAAMiU,OAASjU,EAAMmT,cAErBnT,EAAMuT,YAAc,SAAU7G,EAAGC,GAC/B7M,KAAKoN,SAASR,EAAIxG,WAAYwG,GAC9B5M,KAAKoN,SAASP,EAAIzG,WAAYyG,IAWhC3M,EAAMkU,eAAiB,SAAUlT,GAK/B,IAAM,IAAIS,KAJV3B,KAAKkL,IAAKhK,EAAK6S,IACV7S,EAAK+S,YACRjU,KAAKqU,cAAenT,EAAK6S,IAET7S,EAAK8S,gBACrB9S,EAAK8S,gBAAiBrS,GAAO/C,KAAMoB,OAYvCE,EAAMqR,WAAa,SAAUrQ,GAE3B,GAAMkF,WAAYpG,KAAKoK,OAAO9E,QAAQuM,oBAAtC,CAKA,IAAIyC,EAActU,KAAK+R,QAEvB,IAAM,IAAIpQ,KAAQT,EAAK8S,gBACrBM,EAAYpC,MAAOvQ,GAAST,EAAK8S,gBAAiBrS,GAGpD,IAAMA,KAAQT,EAAK6S,GACjBO,EAAYtC,cAAerQ,IAAS,EAE/BT,EAAK+S,aACRK,EAAYrC,MAAOtQ,IAAS,GAKhC,GAAKT,EAAKqT,KAAO,CACfvU,KAAKkL,IAAKhK,EAAKqT,MAEPvU,KAAK+K,QAAQzC,aAEjB,KAGNtI,KAAKwU,iBAAkBtT,EAAK6S,IAE5B/T,KAAKkL,IAAKhK,EAAK6S,IAEf/T,KAAK0T,iBAAkB,OA/BrB1T,KAAKoU,eAAgBlT,IA2CzB,IAAIuT,EAAkB,WAA0BjD,EALnClN,QAAS,WAAY,SAAUE,GACxC,MAAO,IAAMA,EAAGE,gBAMpBxE,EAAMsU,iBAAmB,WAGvB,IAAKxU,KAAK0T,gBAAV,CAcA,IAAIgB,EAAW1U,KAAKoK,OAAO9E,QAAQuM,mBACnC6C,EAA8B,iBAAZA,EAAuBA,EAAW,KAAOA,EAE3D1U,KAAKkL,IAAI,CACPoG,mBAAoBmD,EACpB5C,mBAAoB6C,EACpB5C,gBAAiB9R,KAAK2U,cAAgB,IAGxC3U,KAAK+K,QAAQ5G,iBAAkBuN,EAAoB1R,MAAM,KAK3DE,EAAM0U,sBAAwB,SAAU/R,GACtC7C,KAAK6U,gBAAiBhS,IAGxB3C,EAAM4U,iBAAmB,SAAUjS,GACjC7C,KAAK6U,gBAAiBhS,IAIxB,IAAIkS,EAAyB,CAC3BC,oBAAqB,aAGvB9U,EAAM2U,gBAAkB,SAAUhS,GAEhC,GAAKA,EAAMoS,SAAWjV,KAAK+K,QAA3B,CAGA,IAAIuJ,EAActU,KAAK+R,QAEnBmD,EAAeH,EAAwBlS,EAAMqS,eAAkBrS,EAAMqS,aAgBzE,UAbOZ,EAAYtC,cAAekD,GA3VpC,SAAqBhT,GACnB,IAAM,IAAIP,KAAQO,EAChB,OAAO,EAGT,OAAO,EAwVFiT,CAAYb,EAAYtC,gBAE3BhS,KAAKoV,oBAGFF,KAAgBZ,EAAYrC,QAE/BjS,KAAK+K,QAAQpE,MAAO9D,EAAMqS,cAAiB,UACpCZ,EAAYrC,MAAOiD,IAGvBA,KAAgBZ,EAAYpC,MACToC,EAAYpC,MAAOgD,GACzBtW,KAAMoB,aACfsU,EAAYpC,MAAOgD,GAG5BlV,KAAKiB,UAAW,gBAAiB,CAAEjB,SAGrCE,EAAMkV,kBAAoB,WACxBpV,KAAKqV,yBACLrV,KAAK+K,QAAQuK,oBAAqB5D,EAAoB1R,MAAM,GAC5DA,KAAK0T,iBAAkB,GAOzBxT,EAAMmU,cAAgB,SAAU1N,GAE9B,IAAI4O,EAAa,GACjB,IAAM,IAAI5T,KAAQgF,EAChB4O,EAAY5T,GAAS,GAEvB3B,KAAKkL,IAAKqK,IAGZ,IAAIC,EAAuB,CACzBlE,mBAAoB,GACpBO,mBAAoB,GACpBC,gBAAiB,IA6HnB,OA1HA5R,EAAMmV,uBAAyB,WAE7BrV,KAAKkL,IAAKsK,IAKZtV,EAAMuV,QAAU,SAAUC,GACxBA,EAAQrP,MAAOqP,GAAU,EAAIA,EAC7B1V,KAAK2U,aAAee,EAAQ,MAM9BxV,EAAMyV,WAAa,WACjB3V,KAAK+K,QAAQxI,WAAWmF,YAAa1H,KAAK+K,SAE1C/K,KAAKkL,IAAI,CAAErD,QAAS,KACpB7H,KAAKiB,UAAW,SAAU,CAAEjB,QAG9BE,EAAM0V,OAAS,WAEPtE,GAAuBlL,WAAYpG,KAAKoK,OAAO9E,QAAQuM,qBAM7D7R,KAAKW,KAAM,gBAAiB,WAC1BX,KAAK2V,eAEP3V,KAAK6V,QARH7V,KAAK2V,cAWTzV,EAAM4V,OAAS,kBACN9V,KAAK+V,SAEZ/V,KAAKkL,IAAI,CAAErD,QAAS,KAEpB,IAAIvC,EAAUtF,KAAKoK,OAAO9E,QAEtB0O,EAAkB,GAEtBA,EAD4BhU,KAAKgW,mCAAmC,iBACzBhW,KAAKiW,sBAEhDjW,KAAKuR,WAAW,CACdgD,KAAMjP,EAAQ4Q,YACdnC,GAAIzO,EAAQ6Q,aACZlC,YAAY,EACZD,gBAAiBA,KAIrB9T,EAAM+V,sBAAwB,WAGtBjW,KAAK+V,UACT/V,KAAKiB,UAAU,WASnBf,EAAM8V,mCAAqC,SAAUI,GACnD,IAAIC,EAAcrW,KAAKoK,OAAO9E,QAAS8Q,GAEvC,GAAKC,EAAYC,QACf,MAAO,UAGT,IAAM,IAAI3U,KAAQ0U,EAChB,OAAO1U,GAIXzB,EAAM2V,KAAO,WAEX7V,KAAK+V,UAAW,EAEhB/V,KAAKkL,IAAI,CAAErD,QAAS,KAEpB,IAAIvC,EAAUtF,KAAKoK,OAAO9E,QAEtB0O,EAAkB,GAEtBA,EAD4BhU,KAAKgW,mCAAmC,gBACzBhW,KAAKuW,oBAEhDvW,KAAKuR,WAAW,CACdgD,KAAMjP,EAAQ6Q,aACdpC,GAAIzO,EAAQ4Q,YAEZjC,YAAY,EACZD,gBAAiBA,KAIrB9T,EAAMqW,oBAAsB,WAGrBvW,KAAK+V,WACR/V,KAAKkL,IAAI,CAAErD,QAAS,SACpB7H,KAAKiB,UAAU,UAInBf,EAAM+K,QAAU,WACdjL,KAAKkL,IAAI,CACPkC,SAAU,GACVmD,KAAM,GACNC,MAAO,GACPM,IAAK,GACLC,OAAQ,GACRQ,WAAY,GACZE,UAAW,MAIR1H,GAhiBiB,mBAAV7K,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,wBACA,qBAEFD,GAEyB,iBAAVF,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfpB,EAAQ,cACRA,EAAQ,cAIVmB,EAAO8K,SAAW,GAClB9K,EAAO8K,SAASC,KAAO9K,EACrBD,EAAOiB,UACPjB,EAAO+H,WAihBX,CAACyP,aAAa,EAAEhK,WAAW,IAAIiK,GAAG,CAAC,SAAS5Y,EAAQkB,EAAOJ,IAO3D,SAAUK,EAAQC,GAClB,aAGsB,mBAAVC,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,wBACA,oBACA,uBACA,UAEF,SAAUe,EAAW8G,EAASvF,EAAOuI,GACnC,OAAO9K,EAASD,EAAQiB,EAAW8G,EAASvF,EAAOuI,KAG5B,iBAAVhL,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfD,EACAnB,EAAQ,cACRA,EAAQ,YACRA,EAAQ,kBACRA,EAAQ,WAIVmB,EAAO8K,SAAW7K,EAChBD,EACAA,EAAOiB,UACPjB,EAAO+H,QACP/H,EAAO+G,aACP/G,EAAO8K,SAASC,MAhCtB,CAoCG/K,OAAQ,SAAkBA,EAAQiB,EAAW8G,EAASvF,EAAOuI,GAChE,aAIA,IAAIpF,EAAU3F,EAAO2F,QACjBU,EAASrG,EAAOqG,OAChBqR,EAAO,aAKPC,EAAO,EAEPC,EAAY,GAQhB,SAAS9M,EAAUiB,EAASzF,GAC1B,IAAIuR,EAAerV,EAAMkB,gBAAiBqI,GAC1C,GAAM8L,EAAN,CAOA7W,KAAK+K,QAAU8L,EAEVxR,IACHrF,KAAK8W,SAAWzR,EAAQrF,KAAK+K,UAI/B/K,KAAKsF,QAAU9D,EAAMC,OAAQ,GAAIzB,KAAKuM,YAAYwK,UAClD/W,KAAK+N,OAAQzI,GAGb,IAAI6E,IAAOwM,EACX3W,KAAK+K,QAAQiM,aAAe7M,GAC5ByM,EAAWzM,GAAOnK,MAGbkK,UAEclK,KAAK8N,WAAW,eAEjC9N,KAAKoK,cA1BAzF,GACHA,EAAQgB,MAAO,mBAAqB3F,KAAKuM,YAAYzH,UACnD,MAAS+R,GAAgB9L,IA6BjCjB,EAAShF,UAAY,WACrBgF,EAASC,KAAOA,EAGhBD,EAASiN,SAAW,CAClBE,eAAgB,CACd7J,SAAU,YAEZ8J,YAAY,EACZC,YAAY,EACZC,WAAW,EACXC,QAAQ,EACRC,iBAAiB,EAEjBzF,mBAAoB,OACpBqE,YAAa,CACXI,QAAS,EACT7E,UAAW,gBAEb0E,aAAc,CACZG,QAAS,EACT7E,UAAW,aAIf,IAAIvR,EAAQ4J,EAAStK,UAowBrB,SAAS+X,EAAUC,GACjB,SAASC,IACPD,EAAOnW,MAAOrB,KAAM6D,WAMtB,OAHA4T,EAASjY,UAAYwK,OAAOC,OAAQuN,EAAOhY,YACxB+M,YAAckL,EAxwBnCjW,EAAMC,OAAQvB,EAAOD,EAAUT,WAM/BU,EAAM6N,OAAS,SAAU2J,GACvBlW,EAAMC,OAAQzB,KAAKsF,QAASoS,IAM9BxX,EAAM4N,WAAa,SAAUC,GAC3B,IAAI4J,EAAY3X,KAAKuM,YAAYiC,cAAeT,GAChD,OAAO4J,QAA2C3J,IAA9BhO,KAAKsF,QAASqS,GAChC3X,KAAKsF,QAASqS,GAAc3X,KAAKsF,QAASyI,IAG9CjE,EAAS0E,cAAgB,CAEvB0I,WAAY,eACZU,WAAY,eACZC,cAAe,kBACfV,WAAY,eACZC,UAAW,cACXC,OAAQ,gBACRC,gBAAiB,uBAGnBpX,EAAMgK,QAAU,WAEdlK,KAAK8X,cAEL9X,KAAK+X,OAAS,GACd/X,KAAKmQ,MAAOnQ,KAAKsF,QAAQ6K,OAEzB3O,EAAMC,OAAQzB,KAAK+K,QAAQpE,MAAO3G,KAAKsF,QAAQ2R,gBAG3BjX,KAAK8N,WAAW,WAElC9N,KAAKgY,cAKT9X,EAAM4X,YAAc,WAElB9X,KAAKwL,MAAQxL,KAAKiY,SAAUjY,KAAK+K,QAAQmN,WAS3ChY,EAAM+X,SAAW,SAAUjV,GAOzB,IALA,IAAImV,EAAYnY,KAAKoY,wBAAyBpV,GAC1C+G,EAAO/J,KAAKuM,YAAYxC,KAGxByB,EAAQ,GACFrN,EAAE,EAAGA,EAAIga,EAAUtZ,OAAQV,IAAM,CACzC,IACI6O,EAAO,IAAIjD,EADJoO,EAAUha,GACM6B,MAC3BwL,EAAM9K,KAAMsM,GAGd,OAAOxB,GAQTtL,EAAMkY,wBAA0B,SAAUpV,GACxC,OAAOxB,EAAMuB,mBAAoBC,EAAOhD,KAAKsF,QAAQ+S,eAOvDnY,EAAMoY,gBAAkB,WACtB,OAAOtY,KAAKwL,MAAM+M,IAAK,SAAUvL,GAC/B,OAAOA,EAAKjC,WAShB7K,EAAMkK,OAAS,WACbpK,KAAK2M,eACL3M,KAAKwY,gBAGL,IAAIX,EAAgB7X,KAAK8N,WAAW,iBAChC2K,OAA8BzK,IAAlB6J,EACdA,GAAiB7X,KAAK0Y,gBACxB1Y,KAAK2Y,YAAa3Y,KAAKwL,MAAOiN,GAG9BzY,KAAK0Y,iBAAkB,GAIzBxY,EAAM0Y,MAAQ1Y,EAAMkK,OAKpBlK,EAAMyM,aAAe,WACnB3M,KAAK+G,WAIP7G,EAAM6G,QAAU,WACd/G,KAAK8H,KAAOf,EAAS/G,KAAK+K,UAa5B7K,EAAMyL,gBAAkB,SAAUnD,EAAaV,GAC7C,IACIlI,EADAmO,EAAS/N,KAAKsF,QAASkD,GAErBuF,GAKkB,iBAAVA,EACVnO,EAAOI,KAAK+K,QAAQpI,cAAeoL,GACzBA,aAAkB5K,cAC5BvD,EAAOmO,GAGT/N,KAAMwI,GAAgB5I,EAAOmH,EAASnH,GAAQkI,GAASiG,GATvD/N,KAAMwI,GAAgB,GAiB1BtI,EAAMyY,YAAc,SAAUnN,EAAOiN,GACnCjN,EAAQxL,KAAK6Y,mBAAoBrN,GAEjCxL,KAAK8Y,aAActN,EAAOiN,GAE1BzY,KAAK+Y,eASP7Y,EAAM2Y,mBAAqB,SAAUrN,GACnC,OAAOA,EAAMwN,OAAQ,SAAUhM,GAC7B,OAAQA,EAAKxC,aASjBtK,EAAM4Y,aAAe,SAAUtN,EAAOiN,GAGpC,GAFAzY,KAAKiZ,qBAAsB,SAAUzN,GAE/BA,GAAUA,EAAM3M,OAAtB,CAKA,IAAIqa,EAAQ,GAEZ1N,EAAMtI,QAAS,SAAU8J,GAEvB,IAAII,EAAWpN,KAAK+M,uBAAwBC,GAE5CI,EAASJ,KAAOA,EAChBI,EAASqL,UAAYA,GAAazL,EAAKmM,gBACvCD,EAAMxY,KAAM0M,IACXpN,MAEHA,KAAKoZ,oBAAqBF,KAQ5BhZ,EAAM6M,uBAAyB,WAC7B,MAAO,CACLH,EAAG,EACHC,EAAG,IAUP3M,EAAMkZ,oBAAsB,SAAUF,GACpClZ,KAAKqZ,gBACLH,EAAMhW,QAAS,SAAUhB,EAAK/D,GAC5B6B,KAAKsZ,cAAepX,EAAI8K,KAAM9K,EAAI0K,EAAG1K,EAAI2K,EAAG3K,EAAIuW,UAAWta,IAC1D6B,OAILE,EAAMmZ,cAAgB,WACpB,IAAI5D,EAAUzV,KAAKsF,QAAQmQ,QAC3B,GAAKA,MAAAA,EAKL,OADAzV,KAAKyV,QAyiBP,SAA0B8D,GACxB,GAAoB,iBAARA,EACV,OAAOA,EAET,IAAI9Z,EAAU8Z,EAAKhV,MAAO,qBACtB1C,EAAMpC,GAAWA,EAAQ,GACzB+Z,EAAO/Z,GAAWA,EAAQ,GAC9B,IAAMoC,EAAIhD,OACR,OAAO,EAETgD,EAAMuE,WAAYvE,GAClB,IAAI4X,EAAOC,EAASF,IAAU,EAC9B,OAAO3X,EAAM4X,EArjBEE,CAAiBlE,GACzBzV,KAAKyV,QAJVzV,KAAKyV,QAAU,GAcnBvV,EAAMoZ,cAAgB,SAAUtM,EAAMJ,EAAGC,EAAG4L,EAAWta,GAChDsa,EAEHzL,EAAKkH,KAAMtH,EAAGC,IAEdG,EAAKyI,QAAStX,EAAI6B,KAAKyV,SACvBzI,EAAKmH,OAAQvH,EAAGC,KAQpB3M,EAAM6Y,YAAc,WAClB/Y,KAAKsX,mBAGPpX,EAAMoX,gBAAkB,WAEtB,GAD0BtX,KAAK8N,WAAW,mBAC1C,CAGA,IAAIhG,EAAO9H,KAAKsN,oBACXxF,IACH9H,KAAK4Z,qBAAsB9R,EAAKb,OAAO,GACvCjH,KAAK4Z,qBAAsB9R,EAAKC,QAAQ,MAU5C7H,EAAMoN,kBAAoBoJ,EAM1BxW,EAAM0Z,qBAAuB,SAAUC,EAASC,GAC9C,QAAiB9L,IAAZ6L,EAAL,CAIA,IAAIE,EAAW/Z,KAAK8H,KAEfiS,EAASxR,cACZsR,GAAWC,EAAUC,EAASrR,YAAcqR,EAASpR,aACnDoR,EAAS1Q,gBAAkB0Q,EAASzQ,iBACpCyQ,EAASjR,cAAgBiR,EAASlR,WAClCkR,EAASvQ,eAAiBuQ,EAAStQ,mBAGvCoQ,EAAUrS,KAAK6F,IAAKwM,EAAS,GAC7B7Z,KAAK+K,QAAQpE,MAAOmT,EAAU,QAAU,UAAaD,EAAU,OAQjE3Z,EAAM+Y,qBAAuB,SAAU7Y,EAAWoL,GAChD,IAAI1H,EAAQ9D,KACZ,SAASga,IACPlW,EAAMmW,cAAe7Z,EAAY,WAAY,KAAM,CAAEoL,IAGvD,IAAI0O,EAAQ1O,EAAM3M,OAClB,GAAM2M,GAAU0O,EAAhB,CAKA,IAAIC,EAAY,EAShB3O,EAAMtI,QAAS,SAAU8J,GACvBA,EAAKrM,KAAMP,EAAWga,UAdtBJ,IAKF,SAASI,MACPD,GACkBD,GAChBF,MAgBN9Z,EAAM+Z,cAAgB,SAAUnX,EAAMD,EAAO3B,GAE3C,IAAImZ,EAAWxX,EAAQ,CAAEA,GAAQsC,OAAQjE,GAASA,EAGlD,GAFAlB,KAAKiB,UAAW6B,EAAMuX,GAEjBhV,EAGH,GADArF,KAAK8W,SAAW9W,KAAK8W,UAAYzR,EAAQrF,KAAK+K,SACzClI,EAAQ,CAEX,IAAIyX,EAASjV,EAAOkV,MAAO1X,GAC3ByX,EAAOxX,KAAOA,EACd9C,KAAK8W,SAAS0D,QAASF,EAAQpZ,QAG/BlB,KAAK8W,SAAS0D,QAAS1X,EAAM5B,IAanChB,EAAMua,OAAS,SAAU7a,GACvB,IAAIoN,EAAOhN,KAAK0a,QAAS9a,GACpBoN,IACHA,EAAKxC,WAAY,IAQrBtK,EAAMya,SAAW,SAAU/a,GACzB,IAAIoN,EAAOhN,KAAK0a,QAAS9a,GACpBoN,UACIA,EAAKxC,WAQhBtK,EAAMiQ,MAAQ,SAAUnN,IACtBA,EAAQhD,KAAK4a,MAAO5X,MAKpBhD,KAAK+X,OAAS/X,KAAK+X,OAAO5S,OAAQnC,GAElCA,EAAME,QAASlD,KAAKya,OAAQza,QAO9BE,EAAM2a,QAAU,SAAU7X,IACxBA,EAAQhD,KAAK4a,MAAO5X,KAKpBA,EAAME,QAAS,SAAUtD,GAEvB4B,EAAMY,WAAYpC,KAAK+X,OAAQnY,GAC/BI,KAAK2a,SAAU/a,IACdI,OAQLE,EAAM0a,MAAQ,SAAU5X,GACtB,GAAMA,EAQN,MAJqB,iBAATA,IACVA,EAAQhD,KAAK+K,QAAQ1H,iBAAkBL,IAEzCA,EAAQxB,EAAMS,UAAWe,IAI3B9C,EAAMsY,cAAgB,WACdxY,KAAK+X,QAAW/X,KAAK+X,OAAOlZ,SAIlCmB,KAAK8a,mBAEL9a,KAAK+X,OAAO7U,QAASlD,KAAKkQ,aAAclQ,QAI1CE,EAAM4a,iBAAmB,WAEvB,IAAIC,EAAe/a,KAAK+K,QAAQiQ,wBAC5BlT,EAAO9H,KAAK8H,KAChB9H,KAAKib,cAAgB,CACnB1K,KAAMwK,EAAaxK,KAAOzI,EAAKY,YAAcZ,EAAKuB,gBAClDyH,IAAKiK,EAAajK,IAAMhJ,EAAKe,WAAaf,EAAK0B,eAC/CgH,MAAOuK,EAAavK,OAAU1I,EAAKa,aAAeb,EAAKwB,kBACvDyH,OAAQgK,EAAahK,QAAWjJ,EAAKgB,cAAgBhB,EAAK2B,qBAO9DvJ,EAAMgQ,aAAewG,EAOrBxW,EAAM0N,kBAAoB,SAAUhO,GAClC,IAAImb,EAAenb,EAAKob,wBACpBE,EAAWlb,KAAKib,cAChBnT,EAAOf,EAASnH,GAOpB,MANa,CACX2Q,KAAMwK,EAAaxK,KAAO2K,EAAS3K,KAAOzI,EAAKkB,WAC/C8H,IAAKiK,EAAajK,IAAMoK,EAASpK,IAAMhJ,EAAKqB,UAC5CqH,MAAO0K,EAAS1K,MAAQuK,EAAavK,MAAQ1I,EAAKmB,YAClD8H,OAAQmK,EAASnK,OAASgK,EAAahK,OAASjJ,EAAKsB,eASzDlJ,EAAM0C,YAAcpB,EAAMoB,YAK1B1C,EAAM8X,WAAa,WACjBhZ,EAAOmF,iBAAkB,SAAUnE,MACnCA,KAAKmb,eAAgB,GAMvBjb,EAAMkb,aAAe,WACnBpc,EAAOsW,oBAAqB,SAAUtV,MACtCA,KAAKmb,eAAgB,GAGvBjb,EAAMmb,SAAW,WACfrb,KAAKqX,UAGP7V,EAAM8B,eAAgBwG,EAAU,WAAY,KAE5C5J,EAAMmX,OAAS,WAGPrX,KAAKmb,eAAkBnb,KAAKkR,qBAIlClR,KAAKoK,UAOPlK,EAAMgR,kBAAoB,WACxB,IAAIpJ,EAAOf,EAAS/G,KAAK+K,SAIzB,OADe/K,KAAK8H,MAAQA,GACTA,EAAKE,aAAehI,KAAK8H,KAAKE,YAUnD9H,EAAMob,SAAW,SAAUtY,GACzB,IAAIwI,EAAQxL,KAAKiY,SAAUjV,GAK3B,OAHKwI,EAAM3M,SACTmB,KAAKwL,MAAQxL,KAAKwL,MAAMrG,OAAQqG,IAE3BA,GAOTtL,EAAMqb,SAAW,SAAUvY,GACzB,IAAIwI,EAAQxL,KAAKsb,SAAUtY,GACrBwI,EAAM3M,SAIZmB,KAAK2Y,YAAanN,GAAO,GACzBxL,KAAK8V,OAAQtK,KAOftL,EAAMsb,UAAY,SAAUxY,GAC1B,IAAIwI,EAAQxL,KAAKiY,SAAUjV,GAC3B,GAAMwI,EAAM3M,OAAZ,CAIA,IAAI4c,EAAgBzb,KAAKwL,MAAMrK,MAAM,GACrCnB,KAAKwL,MAAQA,EAAMrG,OAAQsW,GAE3Bzb,KAAK2M,eACL3M,KAAKwY,gBAELxY,KAAK2Y,YAAanN,GAAO,GACzBxL,KAAK8V,OAAQtK,GAEbxL,KAAK2Y,YAAa8C,KAOpBvb,EAAM4V,OAAS,SAAUtK,GAEvB,GADAxL,KAAKiZ,qBAAsB,SAAUzN,GAC/BA,GAAUA,EAAM3M,OAAtB,CAGA,IAAI4W,EAAUzV,KAAKqZ,gBACnB7N,EAAMtI,QAAS,SAAU8J,EAAM7O,GAC7B6O,EAAKyI,QAAStX,EAAIsX,GAClBzI,EAAK8I,aAQT5V,EAAM2V,KAAO,SAAUrK,GAErB,GADAxL,KAAKiZ,qBAAsB,OAAQzN,GAC7BA,GAAUA,EAAM3M,OAAtB,CAGA,IAAI4W,EAAUzV,KAAKqZ,gBACnB7N,EAAMtI,QAAS,SAAU8J,EAAM7O,GAC7B6O,EAAKyI,QAAStX,EAAIsX,GAClBzI,EAAK6I,WAQT3V,EAAMwb,mBAAqB,SAAU1Y,GACnC,IAAIwI,EAAQxL,KAAK2b,SAAU3Y,GAC3BhD,KAAK8V,OAAQtK,IAOftL,EAAM0b,iBAAmB,SAAU5Y,GACjC,IAAIwI,EAAQxL,KAAK2b,SAAU3Y,GAC3BhD,KAAK6V,KAAMrK,IASbtL,EAAMwa,QAAU,SAAU9a,GAExB,IAAM,IAAIzB,EAAE,EAAGA,EAAI6B,KAAKwL,MAAM3M,OAAQV,IAAM,CAC1C,IAAI6O,EAAOhN,KAAKwL,MAAMrN,GACtB,GAAK6O,EAAKjC,SAAWnL,EAEnB,OAAOoN,IAUb9M,EAAMyb,SAAW,SAAU3Y,GACzBA,EAAQxB,EAAMS,UAAWe,GACzB,IAAIwI,EAAQ,GAQZ,OAPAxI,EAAME,QAAS,SAAUtD,GACvB,IAAIoN,EAAOhN,KAAK0a,QAAS9a,GACpBoN,GACHxB,EAAM9K,KAAMsM,IAEbhN,MAEIwL,GAOTtL,EAAM0V,OAAS,SAAU5S,GACvB,IAAI6Y,EAAc7b,KAAK2b,SAAU3Y,GAEjChD,KAAKiZ,qBAAsB,SAAU4C,GAG/BA,GAAgBA,EAAYhd,QAIlCgd,EAAY3Y,QAAS,SAAU8J,GAC7BA,EAAK4I,SAELpU,EAAMY,WAAYpC,KAAKwL,MAAOwB,IAC7BhN,OAMLE,EAAM+K,QAAU,WAEd,IAAItE,EAAQ3G,KAAK+K,QAAQpE,MACzBA,EAAMoB,OAAS,GACfpB,EAAMyG,SAAW,GACjBzG,EAAMM,MAAQ,GAEdjH,KAAKwL,MAAMtI,QAAS,SAAU8J,GAC5BA,EAAK/B,YAGPjL,KAAKob,eAEL,IAAIjR,EAAKnK,KAAK+K,QAAQiM,oBACfJ,EAAWzM,UACXnK,KAAK+K,QAAQiM,aAEf3R,GACHA,EAAOyW,WAAY9b,KAAK+K,QAAS/K,KAAKuM,YAAYzH,YAYtDgF,EAAShE,KAAO,SAAUlG,GAExB,IAAIuK,GADJvK,EAAO4B,EAAMkB,gBAAiB9C,KACbA,EAAKoX,aACtB,OAAO7M,GAAMyM,EAAWzM,IAU1BL,EAASG,OAAS,SAAUnF,EAAWQ,GAErC,IAAIyW,EAASxE,EAAUzN,GAwBvB,OAtBAiS,EAAOhF,SAAWvV,EAAMC,OAAQ,GAAIqI,EAASiN,UAC7CvV,EAAMC,OAAQsa,EAAOhF,SAAUzR,GAC/ByW,EAAOvN,cAAgBhN,EAAMC,OAAQ,GAAIqI,EAAS0E,eAElDuN,EAAOjX,UAAYA,EAEnBiX,EAAOjW,KAAOgE,EAAShE,KAGvBiW,EAAOhS,KAAOwN,EAAUxN,GAIxBvI,EAAMoD,SAAUmX,EAAQjX,GAKnBO,GAAUA,EAAO2W,SACpB3W,EAAO2W,QAASlX,EAAWiX,GAGtBA,GAiBT,IAAIrC,EAAU,CACZuC,GAAI,EACJC,EAAG,KAyBL,OAFApS,EAASC,KAAOA,EAETD,KAIL,CAACqS,SAAS,GAAG3F,aAAa,EAAE4F,iBAAiB,EAAE5P,WAAW,IAAI6P,iBAAiB,CAAC,SAASxe,EAAQkB,EAAOJ,GAWxG,IAAUK,EAAQC,EAARD,EAgDTA,OAhDiBC,EAgDT,SAAkBD,EAAQ8K,EAAU/C,EAAS3H,EAAiBoC,EACvEuI,EAAMuB,GAER,aAIA,IAAIjG,EAASrG,EAAOqG,OAIhBiX,EAAOC,OAAO/c,UAAU8c,KAC1B,SAAUjY,GACR,OAAOA,EAAIiY,QAEb,SAAUjY,GACR,OAAOA,EAAIC,QAAS,aAAc,KAMhC6G,EAAUrB,EAASG,OAAQ,UAAW,CACxCuS,WAAY,UACZC,mBAAmB,EACnBC,eAAe,IAGjBvR,EAAQpB,KAAOA,EACfoB,EAAQG,WAAaA,EAErB,IAAIpL,EAAQiL,EAAQ3L,UAEpBU,EAAMgK,QAAU,WAed,IAAM,IAAIyS,KAdV3c,KAAKqK,SAAW,EAEhBrK,KAAK4K,SAAW,GAChB5K,KAAK4c,cAEL9S,EAAStK,UAAU0K,QAAQtL,KAAMoB,MAGjCA,KAAKqM,MAAQ,GAEbrM,KAAKyL,cAAgBzL,KAAKwL,MAE1BxL,KAAK6c,YAAc,CAAE,kBAEHvR,EAAWe,MAC3BrM,KAAK8c,gBAAiBH,IAI1Bzc,EAAM4X,YAAc,WAElB9X,KAAKqK,SAAW,EAEhBP,EAAStK,UAAUsY,YAAYlZ,KAAMoB,OAGvCE,EAAM+X,SAAW,WAGf,IAFA,IAAIzM,EAAQ1B,EAAStK,UAAUyY,SAAS5W,MAAOrB,KAAM6D,WAE3C1F,EAAE,EAAGA,EAAIqN,EAAM3M,OAAQV,IAAM,CAC1BqN,EAAMrN,GACZgM,GAAKnK,KAAKqK,WAGjB,OADArK,KAAK+c,qBAAsBvR,GACpBA,GAMTtL,EAAM4c,gBAAkB,SAAUH,GAChC,IAAIrQ,EAAOhB,EAAWe,MAAOsQ,GAGzBK,EAAchd,KAAKsF,QAASqX,IAAU,GAC1C3c,KAAKsF,QAASqX,GAASrQ,EAAKhH,QAC1B9D,EAAMC,OAAQ6K,EAAKhH,QAAS0X,GAAgBA,EAE9Chd,KAAKqM,MAAOsQ,GAAS,IAAIrQ,EAAMtM,OAIjCE,EAAMkK,OAAS,WAEPpK,KAAK0Y,kBAAmB1Y,KAAK8N,WAAW,cAI9C9N,KAAKid,UAHHjd,KAAKkd,WAOThd,EAAM+c,QAAU,WAEd,IAAIxE,EAAYzY,KAAKmd,gBAErBnd,KAAK2M,eACL3M,KAAKwY,gBACLxY,KAAK2Y,YAAa3Y,KAAKyL,cAAegN,GAGtCzY,KAAK0Y,iBAAkB,GAIzBxY,EAAMgd,QAAU,SAAUxF,GAExB1X,KAAK+N,OAAQ2J,GACb1X,KAAKmd,gBAIL,IAAIC,EAAWpd,KAAKqd,QAASrd,KAAKwL,OAClCxL,KAAKyL,cAAgB2R,EAAS3d,QAE9BO,KAAKsd,uBAEAtd,KAAKud,WACRvd,KAAKwd,cAAexd,KAAKyd,YAAa,CAAEL,IAExCpd,KAAKyd,YAAaL,GAGpBpd,KAAK0d,QACL1d,KAAKid,WAGP/c,EAAM0Y,MAAQ1Y,EAAMgd,QAEpBhd,EAAMud,YAAc,SAAUL,GAC5Bpd,KAAK8V,OAAQsH,EAASO,YACtB3d,KAAK6V,KAAMuH,EAASQ,WAMtB1d,EAAMid,cAAgB,WACpB,IAAIhE,EAAkBnZ,KAAK8N,WAAW,iBAClC2K,OAAgCzK,IAApBmL,EAAgCA,GAC7CnZ,KAAK0Y,gBAER,OADA1Y,KAAKud,WAAa9E,GAMpBvY,EAAMod,qBAAuB,WAE3B,IAAIO,EAAkBC,EAAgBC,EAClCja,EAAQ9D,KACZ,SAASge,IACFH,GAAoBC,GAAkBC,GACzCja,EAAMmW,cAAe,kBAAmB,KAAM,CAAEnW,EAAM2H,gBAG1DzL,KAAKW,KAAM,iBAAkB,WAC3Bkd,GAAmB,EACnBG,MAEFhe,KAAKW,KAAM,eAAgB,WACzBmd,GAAiB,EACjBE,MAEFhe,KAAKW,KAAM,iBAAkB,WAC3Bod,GAAmB,EACnBC,OAMJ9d,EAAMmd,QAAU,SAAU7R,GACxB,IAAIwN,EAAShZ,KAAKsF,QAAQ0T,OAC1BA,EAASA,GAAU,IAQnB,IAPA,IAAIvZ,EAAU,GACVwe,EAAgB,GAChBC,EAAmB,GAEnBC,EAAOne,KAAKoe,eAAgBpF,GAGtB7a,EAAE,EAAGA,EAAIqN,EAAM3M,OAAQV,IAAM,CACrC,IAAI6O,EAAOxB,EAAMrN,GACjB,IAAK6O,EAAKxC,UAAV,CAIA,IAAI6T,EAAYF,EAAMnR,GAGjBqR,GACH5e,EAAQiB,KAAMsM,GAGXqR,GAAarR,EAAK+I,SACrBkI,EAAcvd,KAAMsM,GACTqR,GAAcrR,EAAK+I,UAC9BmI,EAAiBxd,KAAMsM,IAK3B,MAAO,CACLvN,QAASA,EACTke,WAAYM,EACZL,SAAUM,IAKdhe,EAAMke,eAAiB,SAAUpF,GAC/B,OAAK3T,GAAUrF,KAAKsF,QAAQmX,kBAEnB,SAAUzP,GACf,OAAO3H,EAAQ2H,EAAKjC,SAAUuT,GAAItF,IAGhB,mBAAVA,EAEH,SAAUhM,GACf,OAAOgM,EAAQhM,EAAKjC,UAIjB,SAAUiC,GACf,OAAO5N,EAAiB4N,EAAKjC,QAASiO,KAU1C9Y,EAAMqK,eAAiB,SAAUvH,GAE/B,IAAIwI,EAGFA,EAFGxI,GACHA,EAAQxB,EAAMS,UAAWe,GACjBhD,KAAK2b,SAAU3Y,IAGfhD,KAAKwL,MAGfxL,KAAK4c,cACL5c,KAAK+c,qBAAsBvR,IAG7BtL,EAAM0c,YAAc,WAClB,IAAIlS,EAAc1K,KAAKsF,QAAQoF,YAC/B,IAAM,IAAIG,KAAOH,EAAc,CAC7B,IAAII,EAASJ,EAAaG,GAC1B7K,KAAK4K,SAAUC,GAAQ0T,EAAazT,KAQxC5K,EAAM6c,qBAAuB,SAAUvR,GAIrC,IAFA,IAAIgT,EAAMhT,GAASA,EAAM3M,OAEfV,EAAE,EAAGqgB,GAAOrgB,EAAIqgB,EAAKrgB,IAAM,CACxBqN,EAAMrN,GACZoM,mBAQT,IAAIgU,EAMF,SAAsBzT,GAEpB,GAAsB,iBAAVA,EACV,OAAOA,EAGT,IAqBuBvF,EAAMkZ,EArBzBvd,EAAOob,EAAMxR,GAAS4T,MAAM,KAC5BD,EAAQvd,EAAK,GAEbyd,EAAYF,EAAMla,MAAO,cAEzBqa,GAgBmBrZ,EAjBZoZ,GAAaA,EAAU,GAiBLF,EAhBQA,EAkBhClZ,EACI,SAAuB3F,GAC5B,OAAOA,EAAK4F,aAAcD,IAKvB,SAAuB3F,GAC5B,IAAIif,EAAQjf,EAAK+C,cAAe8b,GAChC,OAAOI,GAASA,EAAMC,cAzBpBC,EAAS5T,EAAQ6T,gBAAiB9d,EAAK,IAU3C,OARA4J,EAASiU,EAAS,SAAUnf,GAC1B,OAAOA,GAAQmf,EAAQH,EAAUhf,KAGnC,SAAUA,GACR,OAAOA,GAAQgf,EAAUhf,KA0B/BuL,EAAQ6T,gBAAkB,CACxBC,SAAY,SAAUC,GACpB,OAAOD,SAAUC,EAAK,KAExB9Y,WAAc,SAAU8Y,GACtB,OAAO9Y,WAAY8Y,KAOvBhf,EAAMwd,MAAQ,WACZ,GAAM1d,KAAKsF,QAAQ6Z,OAAnB,CAIA,IAAIC,EAAU5d,EAAMS,UAAWjC,KAAKsF,QAAQ6Z,QACtCnf,KAAKqf,iBAAkBD,KAE3Bpf,KAAK6c,YAAcuC,EAAQja,OAAQnF,KAAK6c,cAG1C,IAesBuC,EAASE,EAf3BC,GAekBH,EAfUpf,KAAK6c,YAeNyC,EAfmBtf,KAAKsF,QAAQoX,cAgBxD,SAAiB8C,EAAOC,GAE7B,IAAM,IAAIthB,EAAI,EAAGA,EAAIihB,EAAQvgB,OAAQV,IAAM,CACzC,IAAIghB,EAASC,EAAQjhB,GACjBI,EAAIihB,EAAMlV,SAAU6U,GACpBzd,EAAI+d,EAAMnV,SAAU6U,GACxB,GAASzd,EAAJnD,GAASA,EAAImD,EAAI,CAEpB,IAAIge,OAAoC1R,IAAtBsR,EAASH,GAAyBG,EAASH,GAAWG,EACpEK,EAAYD,EAAc,GAAK,EACnC,OAAahe,EAAJnD,EAAQ,GAAK,GAAMohB,GAGhC,OAAO,IA5BT3f,KAAKyL,cAAcmU,KAAML,KAI3Brf,EAAMmf,iBAAmB,SAAUD,GACjC,IAAM,IAAIjhB,EAAE,EAAGA,EAAIihB,EAAQvgB,OAAQV,IACjC,GAAKihB,EAAQjhB,IAAM6B,KAAK6c,YAAY1e,GAClC,OAAO,EAGX,OAAO,GAyBT+B,EAAM2f,MAAQ,WACZ,IAAIrD,EAAaxc,KAAKsF,QAAQkX,WAC1BsD,EAAO9f,KAAKqM,MAAOmQ,GACvB,IAAMsD,EAEJ,MAAM,IAAIthB,MAAO,mBAAqBge,GAKxC,OADAsD,EAAKxa,QAAUtF,KAAKsF,QAASkX,GACtBsD,GAGT5f,EAAMyM,aAAe,WAEnB7C,EAAStK,UAAUmN,aAAa/N,KAAMoB,MACtCA,KAAK6f,QAAQlT,gBAGfzM,EAAM6M,uBAAyB,SAAUC,GACvC,OAAOhN,KAAK6f,QAAQ9S,uBAAwBC,IAG9C9M,EAAMgQ,aAAe,SAAUC,GAC7BnQ,KAAK6f,QAAQ3P,aAAcC,IAG7BjQ,EAAMoN,kBAAoB,WACxB,OAAOtN,KAAK6f,QAAQvS,qBAGtBpN,EAAMgR,kBAAoB,WACxB,OAAOlR,KAAK6f,QAAQ3O,qBAMtBhR,EAAMqb,SAAW,SAAUvY,GACzB,IAAIwI,EAAQxL,KAAKsb,SAAUtY,GAC3B,GAAMwI,EAAM3M,OAAZ,CAIA,IAAI4M,EAAgBzL,KAAK+f,mBAAoBvU,GAE7CxL,KAAKyL,cAAgBzL,KAAKyL,cAActG,OAAQsG,KAIlDvL,EAAMsb,UAAY,SAAUxY,GAC1B,IAAIwI,EAAQxL,KAAKiY,SAAUjV,GAC3B,GAAMwI,EAAM3M,OAAZ,CAIAmB,KAAK2M,eACL3M,KAAKwY,gBAEL,IAAI/M,EAAgBzL,KAAK+f,mBAAoBvU,GAE7CxL,KAAK2Y,YAAa3Y,KAAKyL,eAEvBzL,KAAKyL,cAAgBA,EAActG,OAAQnF,KAAKyL,eAChDzL,KAAKwL,MAAQA,EAAMrG,OAAQnF,KAAKwL,SAGlCtL,EAAM6f,mBAAqB,SAAUvU,GACnC,IAAI4R,EAAWpd,KAAKqd,QAAS7R,GAM7B,OALAxL,KAAK6V,KAAMuH,EAASQ,UAEpB5d,KAAK8V,OAAQsH,EAAS3d,SAEtBO,KAAK2Y,YAAayE,EAAS3d,SAAS,GAC7B2d,EAAS3d,SAOlBS,EAAM8f,OAAS,SAAUhd,GACvB,IAAIwI,EAAQxL,KAAKsb,SAAUtY,GAC3B,GAAMwI,EAAM3M,OAAZ,CAIA,IAAIV,EAAG6O,EACHwR,EAAMhT,EAAM3M,OAChB,IAAMV,EAAE,EAAGA,EAAIqgB,EAAKrgB,IAClB6O,EAAOxB,EAAMrN,GACb6B,KAAK+K,QAAQxD,YAAayF,EAAKjC,SAGjC,IAAIkV,EAAsBjgB,KAAKqd,QAAS7R,GAAQ/L,QAEhD,IAAMtB,EAAE,EAAGA,EAAIqgB,EAAKrgB,IAClBqN,EAAMrN,GAAGgb,iBAAkB,EAI7B,IAFAnZ,KAAKkd,UAEC/e,EAAE,EAAGA,EAAIqgB,EAAKrgB,WACXqN,EAAMrN,GAAGgb,gBAElBnZ,KAAK8V,OAAQmK,KAGf,IAAIC,EAAUhgB,EAAM0V,OA6DpB,OA5DA1V,EAAM0V,OAAS,SAAU5S,GACvBA,EAAQxB,EAAMS,UAAWe,GACzB,IAAI6Y,EAAc7b,KAAK2b,SAAU3Y,GAEjCkd,EAAQthB,KAAMoB,KAAMgD,GAIpB,IAFA,IAAIwb,EAAM3C,GAAeA,EAAYhd,OAE3BV,EAAE,EAAGqgB,GAAOrgB,EAAIqgB,EAAKrgB,IAAM,CACnC,IAAI6O,EAAO6O,EAAY1d,GAEvBqD,EAAMY,WAAYpC,KAAKyL,cAAeuB,KAI1C9M,EAAMigB,QAAU,WAEd,IAAM,IAAIhiB,EAAE,EAAGA,EAAI6B,KAAKwL,MAAM3M,OAAQV,IAAM,CAC/B6B,KAAKwL,MAAMrN,GACjBmM,SAASG,OAASjD,KAAKiD,SAE9BzK,KAAKsF,QAAQ6Z,OAAS,SACtBnf,KAAK0d,QACL1d,KAAKid,WAWP/c,EAAMsd,cAAgB,SAAU4C,EAAIlf,GAElC,IAAI2Q,EAAqB7R,KAAKsF,QAAQuM,mBAEtC7R,KAAKsF,QAAQuM,mBAAqB,EAElC,IAAIwO,EAAcD,EAAG/e,MAAOrB,KAAMkB,GAGlC,OADAlB,KAAKsF,QAAQuM,mBAAqBA,EAC3BwO,GASTngB,EAAMogB,wBAA0B,WAC9B,OAAOtgB,KAAKyL,cAAc8M,IAAK,SAAUvL,GACvC,OAAOA,EAAKjC,WAMTI,GA7lBe,mBAAVjM,QAAwBA,OAAOC,IAEzCD,OAAQ,CACJ,oBACA,oBACA,6CACA,uBACA,SACA,gBAEA,yBACA,0BACA,2BAEF,SAAU4K,EAAU/C,EAAS3H,EAAiBoC,EAAOuI,EAAMuB,GACzD,OAAOrM,EAASD,EAAQ8K,EAAU/C,EAAS3H,EAAiBoC,EAAOuI,EAAMuB,KAElD,iBAAVvM,GAAsBA,EAAOJ,QAE9CI,EAAOJ,QAAUM,EACfD,EACAnB,EAAQ,YACRA,EAAQ,YACRA,EAAQ,6BACRA,EAAQ,kBACRA,EAAQ,UACRA,EAAQ,iBAERA,EAAQ,0BACRA,EAAQ,2BACRA,EAAQ,4BAIVmB,EAAOmM,QAAUlM,EACfD,EACAA,EAAO8K,SACP9K,EAAO+H,QACP/H,EAAOI,gBACPJ,EAAO+G,aACP/G,EAAOmM,QAAQpB,KACf/K,EAAOmM,QAAQG,aAwjBnB,CAAC6Q,SAAS,EAAEoE,gBAAgB,EAAEC,0BAA0B,EAAEC,yBAAyB,EAAEC,0BAA0B,EAAE1a,4BAA4B,EAAEoW,iBAAiB,EAAE5P,WAAW,EAAEpB,SAAW,KAAKuV,OAAS,CAAC,SAAS9iB,EAAQkB,EAAOJ,IACnO,SAAWoB,IAAQ,YASjB,WAGA,IAAIiO,GAUA4S,GAAkB,sBAIlBC,GAAiB,4BAMjBC,GAAc,yBAmBdC,GAAgB,IAmBhBC,GAAmB,iBAEnBC,GAAM,IAGNC,GAAmB,WAKnBC,GAAY,CACd,CAAC,MAAOJ,IACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAtCqB,IAuCtB,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBK,GAAU,qBACVC,GAAW,iBAEXC,GAAU,mBACVC,GAAU,gBAEVC,GAAW,iBACXC,GAAU,oBACVC,GAAS,6BACTC,GAAS,eACTC,GAAY,kBAEZC,GAAY,kBACZC,GAAa,mBAEbC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBAEZC,GAAa,mBAGbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAuB,iBACvBC,GAAsB,qBACtBC,GAAwB,gCAGxBC,GAAgB,4BAChBC,GAAkB,WAClBC,GAAmBC,OAAOH,GAAcI,QACxCC,GAAqBF,OAAOF,GAAgBG,QAG5CE,GAAW,mBACXC,GAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkBV,OAAOS,GAAaR,QAGtCU,GAAc,OAGdC,EAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,EAAgB,kBAIhBC,EAAeC,gDACfC,EAAiB,kBACjBC,EAAe,4BAKfC,EAAe,4BACfC,EAAa,iBACbC,EAAeC,8OAGfC,EAAS,OACTC,EAAW,IAAMV,EAAgB,IACjCW,EAAU,IAAMJ,EAAe,IAC/BK,EAAU,IAAMX,EAAe,IAC/BY,EAAW,OACXC,EAAY,IAAMX,EAAiB,IACnCY,EAAU,IAAMX,EAAe,IAC/BY,EAAS,KAAOhB,EAAgBO,EAAeM,EAAWV,EAAiBC,EAAeC,EAAe,IACzGY,EAAS,2BAETC,EAAc,KAAOlB,EAAgB,IACrCmB,EAAa,kCACbC,EAAa,qCACbC,EAAU,IAAMhB,EAAe,IAC/BiB,EAAQ,UAGRC,EAAc,MAAQR,EAAU,IAAMC,EAAS,IAC/CQ,EAAc,MAAQH,EAAU,IAAML,EAAS,IAC/CS,EAAkB,gCAClBC,EAAkB,gCAClBC,EAZa,MAAQf,EAAU,IAAMK,EAAS,IAYtB,IACxBW,EAAW,IAAMtB,EAAa,KAI9BuB,EAAQD,EAAWD,GAHP,MAAQL,EAAQ,MAAQ,CAACJ,EAAaC,EAAYC,GAAYU,KAAK,KAAO,IAAMF,EAAWD,EAAW,MAIlHI,EAAU,MAAQ,CAACjB,EAAWK,EAAYC,GAAYU,KAAK,KAAO,IAAMD,EACxEG,EAAW,MAAQ,CAACd,EAAcN,EAAU,IAAKA,EAASO,EAAYC,EAAYV,GAAUoB,KAAK,KAAO,IAGxGG,GAAS9D,OAAOsC,EAAQ,KAMxByB,GAAc/D,OAAOyC,EAAS,KAG9BuB,EAAYhE,OAAO8C,EAAS,MAAQA,EAAS,KAAOe,EAAWH,EAAO,KAGtEO,GAAgBjE,OAAO,CACzBkD,EAAU,IAAMN,EAAU,IAAMU,EAAkB,MAAQ,CAACd,EAASU,EAAS,KAAKS,KAAK,KAAO,IAC9FN,EAAc,IAAME,EAAkB,MAAQ,CAACf,EAASU,EAAUE,EAAa,KAAKO,KAAK,KAAO,IAChGT,EAAU,IAAME,EAAc,IAAME,EACpCJ,EAAU,IAAMK,EAtBD,mDADA,mDA0Bfb,EACAkB,GACAD,KAAK,KAAM,KAGTO,EAAelE,OAAO,IAAMmD,EAAQtB,EAAiBC,EAAeK,EAAa,KAGjFgC,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,GAAerF,IAAcqF,GAAepF,IAC5CoF,GAAenF,IAAWmF,GAAelF,IACzCkF,GAAejF,IAAYiF,GAAehF,IAC1CgF,GAAe/E,IAAmB+E,GAAe9E,IACjD8E,GAAe7E,KAAa,EAC5B6E,GAAevG,IAAWuG,GAAetG,IACzCsG,GAAevF,IAAkBuF,GAAerG,IAChDqG,GAAetF,IAAesF,GAAepG,IAC7CoG,GAAenG,IAAYmG,GAAelG,IAC1CkG,GAAehG,IAAUgG,GAAe/F,IACxC+F,GAAe9F,IAAa8F,GAAe5F,IAC3C4F,GAAe3F,IAAU2F,GAAe1F,IACxC0F,GAAexF,KAAc,EAG7B,IAAIyF,GAAgB,GACpBA,GAAcxG,IAAWwG,GAAcvG,IACvCuG,GAAcxF,IAAkBwF,GAAcvF,IAC9CuF,GAActG,IAAWsG,GAAcrG,IACvCqG,GAActF,IAAcsF,GAAcrF,IAC1CqF,GAAcpF,IAAWoF,GAAcnF,IACvCmF,GAAclF,IAAYkF,GAAcjG,IACxCiG,GAAchG,IAAagG,GAAc/F,IACzC+F,GAAc7F,IAAa6F,GAAc5F,IACzC4F,GAAc3F,IAAa2F,GAAc1F,IACzC0F,GAAcjF,IAAYiF,GAAchF,IACxCgF,GAAc/E,IAAa+E,GAAc9E,KAAa,EACtD8E,GAAcpG,IAAYoG,GAAcnG,IACxCmG,GAAczF,KAAc,EAG5B,IA4EI0F,EAAgB,CAClBC,KAAM,KACNC,IAAK,IACLC,KAAM,IACNC,KAAM,IACNC,SAAU,QACVC,SAAU,SAIRC,GAAiBhiB,WACjBiiB,GAAepJ,SAGfqJ,EAA8B,iBAAVvoB,GAAsBA,GAAUA,EAAOiK,SAAWA,QAAUjK,EAGhFwoB,EAA0B,iBAARC,MAAoBA,MAAQA,KAAKxe,SAAWA,QAAUwe,KAGxEC,GAAOH,GAAcC,GAAYG,SAAS,cAATA,GAGjCC,EAAgC,iBAAXhqB,GAAuBA,IAAYA,EAAQiJ,UAAYjJ,EAG5EiqB,EAAaD,GAAgC,iBAAV5pB,GAAsBA,IAAWA,EAAO6I,UAAY7I,EAGvF8pB,GAAgBD,GAAcA,EAAWjqB,UAAYgqB,EAGrDG,EAAcD,IAAiBP,EAAWS,QAG1CC,EAAY,WACd,IAEE,IAAIC,EAAQL,GAAcA,EAAW/qB,SAAW+qB,EAAW/qB,QAAQ,QAAQorB,MAE3E,OAAIA,GAKGH,GAAeA,EAAYI,SAAWJ,EAAYI,QAAQ,QACjE,MAAOnrB,KAXI,GAeXorB,GAAoBH,GAAYA,EAASI,cACzCC,GAAaL,GAAYA,EAASM,OAClCC,GAAYP,GAAYA,EAASQ,MACjCC,GAAeT,GAAYA,EAASU,SACpCC,GAAYX,GAAYA,EAASY,MACjCC,GAAmBb,GAAYA,EAASc,aAc5C,SAASzoB,GAAM0oB,EAAMC,EAAS9oB,GAC5B,OAAQA,EAAKrC,QACX,KAAK,EAAG,OAAOkrB,EAAKnrB,KAAKorB,GACzB,KAAK,EAAG,OAAOD,EAAKnrB,KAAKorB,EAAS9oB,EAAK,IACvC,KAAK,EAAG,OAAO6oB,EAAKnrB,KAAKorB,EAAS9oB,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAO6oB,EAAKnrB,KAAKorB,EAAS9oB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAO6oB,EAAK1oB,MAAM2oB,EAAS9oB,GAa7B,SAAS+oB,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAItpB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,SAE9BkC,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GAClBopB,EAAOE,EAAalkB,EAAOikB,EAASjkB,GAAQ+jB,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GAIxB,IAHA,IAAIrpB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,SAE9BkC,EAAQlC,IAC8B,IAAzCurB,EAASF,EAAMnpB,GAAQA,EAAOmpB,KAIpC,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAG7B,IAFA,IAAIvrB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OAEhCA,MAC0C,IAA3CurB,EAASF,EAAMrrB,GAASA,EAAQqrB,KAItC,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GAIzB,IAHA,IAAI1pB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,SAE9BkC,EAAQlC,GACf,IAAK4rB,EAAUP,EAAMnpB,GAAQA,EAAOmpB,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAM1B,IALA,IAAI1pB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACnC8rB,EAAW,EACXC,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACd0pB,EAAUtkB,EAAOpF,EAAOmpB,KAC1BU,EAAOD,KAAcxkB,GAGzB,OAAOykB,EAYT,SAASC,GAAcX,EAAO/jB,GAE5B,SADsB,MAAT+jB,EAAgB,EAAIA,EAAMrrB,UACY,EAAhCisB,GAAYZ,EAAO/jB,EAAO,GAY/C,SAAS4kB,GAAkBb,EAAO/jB,EAAO6kB,GAIvC,IAHA,IAAIjqB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,SAE9BkC,EAAQlC,GACf,GAAImsB,EAAW7kB,EAAO+jB,EAAMnpB,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASkqB,GAASf,EAAOE,GAKvB,IAJA,IAAIrpB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACnC+rB,EAAS5oB,MAAMnD,KAEVkC,EAAQlC,GACf+rB,EAAO7pB,GAASqpB,EAASF,EAAMnpB,GAAQA,EAAOmpB,GAEhD,OAAOU,EAWT,SAASM,GAAUhB,EAAOiB,GAKxB,IAJA,IAAIpqB,GAAS,EACTlC,EAASssB,EAAOtsB,OAChBwR,EAAS6Z,EAAMrrB,SAEVkC,EAAQlC,GACfqrB,EAAM7Z,EAAStP,GAASoqB,EAAOpqB,GAEjC,OAAOmpB,EAeT,SAASkB,GAAYlB,EAAOE,EAAUC,EAAagB,GACjD,IAAItqB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OAKvC,IAHIwsB,GAAaxsB,IACfwrB,EAAcH,IAAQnpB,MAEfA,EAAQlC,GACfwrB,EAAcD,EAASC,EAAaH,EAAMnpB,GAAQA,EAAOmpB,GAE3D,OAAOG,EAeT,SAASiB,GAAiBpB,EAAOE,EAAUC,EAAagB,GACtD,IAAIxsB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OAIvC,IAHIwsB,GAAaxsB,IACfwrB,EAAcH,IAAQrrB,IAEjBA,KACLwrB,EAAcD,EAASC,EAAaH,EAAMrrB,GAASA,EAAQqrB,GAE7D,OAAOG,EAaT,SAASkB,GAAUrB,EAAOO,GAIxB,IAHA,IAAI1pB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,SAE9BkC,EAAQlC,GACf,GAAI4rB,EAAUP,EAAMnpB,GAAQA,EAAOmpB,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIsB,EAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYlB,EAAWmB,GAC1C,IAAIhB,EAOJ,OANAgB,EAASD,EAAY,SAASxlB,EAAO0E,EAAK8gB,GACxC,GAAIlB,EAAUtkB,EAAO0E,EAAK8gB,GAExB,OADAf,EAAS/f,GACF,IAGJ+f,EAcT,SAASiB,GAAc3B,EAAOO,EAAWqB,EAAWC,GAIlD,IAHA,IAAIltB,EAASqrB,EAAMrrB,OACfkC,EAAQ+qB,GAAaC,EAAY,GAAK,GAElCA,EAAYhrB,MAAYA,EAAQlC,GACtC,GAAI4rB,EAAUP,EAAMnpB,GAAQA,EAAOmpB,GACjC,OAAOnpB,EAGX,OAAQ,EAYV,SAAS+pB,GAAYZ,EAAO/jB,EAAO2lB,GACjC,OAAO3lB,GAAUA,EAidnB,SAAuB+jB,EAAO/jB,EAAO2lB,GACnC,IAAI/qB,EAAQ+qB,EAAY,EACpBjtB,EAASqrB,EAAMrrB,OAEnB,OAASkC,EAAQlC,GACf,GAAIqrB,EAAMnpB,KAAWoF,EACnB,OAAOpF,EAGX,OAAQ,EAzdJirB,CAAc9B,EAAO/jB,EAAO2lB,GAC5BD,GAAc3B,EAAO+B,GAAWH,GAatC,SAASI,GAAgBhC,EAAO/jB,EAAO2lB,EAAWd,GAIhD,IAHA,IAAIjqB,EAAQ+qB,EAAY,EACpBjtB,EAASqrB,EAAMrrB,SAEVkC,EAAQlC,GACf,GAAImsB,EAAWd,EAAMnpB,GAAQoF,GAC3B,OAAOpF,EAGX,OAAQ,EAUV,SAASkrB,GAAU9lB,GACjB,OAAOA,GAAUA,EAYnB,SAASgmB,GAASjC,EAAOE,GACvB,IAAIvrB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAOA,EAAUutB,GAAQlC,EAAOE,GAAYvrB,EAAUoiB,GAUxD,SAASwK,GAAa5gB,GACpB,OAAO,SAASwhB,GACd,OAAiB,MAAVA,EAAiBre,GAAYqe,EAAOxhB,IAW/C,SAASyhB,EAAeD,GACtB,OAAO,SAASxhB,GACd,OAAiB,MAAVwhB,EAAiBre,GAAYqe,EAAOxhB,IAiB/C,SAAS0hB,GAAWZ,EAAYvB,EAAUC,EAAagB,EAAWO,GAMhE,OALAA,EAASD,EAAY,SAASxlB,EAAOpF,EAAO4qB,GAC1CtB,EAAcgB,GACTA,GAAY,EAAOllB,GACpBikB,EAASC,EAAalkB,EAAOpF,EAAO4qB,KAEnCtB,EAgCT,SAAS+B,GAAQlC,EAAOE,GAKtB,IAJA,IAAIQ,EACA7pB,GAAS,EACTlC,EAASqrB,EAAMrrB,SAEVkC,EAAQlC,GAAQ,CACvB,IAAI2tB,EAAUpC,EAASF,EAAMnpB,IACzByrB,IAAYxe,KACd4c,EAASA,IAAW5c,GAAYwe,EAAW5B,EAAS4B,GAGxD,OAAO5B,EAYT,SAAS6B,GAAUzuB,EAAGosB,GAIpB,IAHA,IAAIrpB,GAAS,EACT6pB,EAAS5oB,MAAMhE,KAEV+C,EAAQ/C,GACf4sB,EAAO7pB,GAASqpB,EAASrpB,GAE3B,OAAO6pB,EAyBT,SAAS8B,GAASC,GAChB,OAAOA,EACHA,EAAOxrB,MAAM,EAAGyrB,GAAgBD,GAAU,GAAGroB,QAAQ0f,GAAa,IAClE2I,EAUN,SAASE,GAAU9C,GACjB,OAAO,SAAS5jB,GACd,OAAO4jB,EAAK5jB,IAchB,SAAS2mB,GAAWT,EAAQU,GAC1B,OAAO9B,GAAS8B,EAAO,SAASliB,GAC9B,OAAOwhB,EAAOxhB,KAYlB,SAASmiB,GAASC,EAAOpiB,GACvB,OAAOoiB,EAAMC,IAAIriB,GAYnB,SAASsiB,GAAgBC,EAAYC,GAInC,IAHA,IAAItsB,GAAS,EACTlC,EAASuuB,EAAWvuB,SAEfkC,EAAQlC,IAA2D,EAAjDisB,GAAYuC,EAAYD,EAAWrsB,GAAQ,KACtE,OAAOA,EAYT,SAASusB,GAAcF,EAAYC,GAGjC,IAFA,IAAItsB,EAAQqsB,EAAWvuB,OAEhBkC,MAA4D,EAAjD+pB,GAAYuC,EAAYD,EAAWrsB,GAAQ,KAC7D,OAAOA,EA+BT,IAAIwsB,GAAejB,EAjxBG,CAEpBkB,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IACtBC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAC1EC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IAAKC,IAAQ,IAChDC,IAAQ,IAAMC,IAAQ,IAAKC,IAAQ,IACnCC,IAAQ,KAAMC,IAAQ,KACtBC,IAAQ,KAAMC,IAAQ,KACtBC,IAAQ,KAERC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAC1BC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACvEC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACxDC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACtFC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IAAKC,IAAU,IACtFC,IAAU,IAAMC,IAAU,IAC1BC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,IAAMC,IAAU,IAAKC,IAAU,IACzCC,IAAU,KAAMC,IAAU,KAC1BC,IAAU,KAAMC,IAAU,KAC1BC,IAAU,KAAMC,IAAU,MAouBxBC,GAAiBhN,EAhuBH,CAChBiN,IAAK,QACLC,IAAK,OACLC,IAAK,OACLC,IAAK,SACL3R,IAAK,UAouBP,SAAS4R,GAAiBC,GACxB,MAAO,KAAO/R,EAAc+R,GAsB9B,SAASC,GAAWlN,GAClB,OAAOpF,EAAapJ,KAAKwO,GAsC3B,SAASmN,GAAWvhB,GAClB,IAAIxX,GAAS,EACT6pB,EAAS5oB,MAAMuW,EAAIzQ,MAKvB,OAHAyQ,EAAIrV,QAAQ,SAASiD,EAAO0E,GAC1B+f,IAAS7pB,GAAS,CAAC8J,EAAK1E,KAEnBykB,EAWT,SAASmP,GAAQhQ,EAAMtY,GACrB,OAAO,SAASuoB,GACd,OAAOjQ,EAAKtY,EAAUuoB,KAa1B,SAASC,GAAe/P,EAAOgQ,GAM7B,IALA,IAAIn5B,GAAS,EACTlC,EAASqrB,EAAMrrB,OACf8rB,EAAW,EACXC,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdoF,IAAU+zB,GAAe/zB,IAAU2a,KACrCoJ,EAAMnpB,GAAS+f,GACf8J,EAAOD,KAAc5pB,GAGzB,OAAO6pB,EAUT,SAASuP,GAAWC,GAClB,IAAIr5B,GAAS,EACT6pB,EAAS5oB,MAAMo4B,EAAItyB,MAKvB,OAHAsyB,EAAIl3B,QAAQ,SAASiD,GACnBykB,IAAS7pB,GAASoF,IAEbykB,EAqET,SAASyP,GAAW1N,GAClB,OAAOkN,GAAWlN,GAiDpB,SAAqBA,GACnB,IAAI/B,EAASvD,EAAUiT,UAAY,EACnC,KAAOjT,EAAUlJ,KAAKwO,MAClB/B,EAEJ,OAAOA,EArDH2P,CAAY5N,GACZnB,EAAUmB,GAUhB,SAAS6N,GAAc7N,GACrB,OAAOkN,GAAWlN,GACCA,EAmDLpoB,MAAM8iB,IAAc,GAlDjBsF,EA7kBHjO,MAAM,IAwlBtB,SAASkO,GAAgBD,GAGvB,IAFA,IAAI5rB,EAAQ4rB,EAAO9tB,OAEZkC,KAAWkjB,EAAa9F,KAAKwO,EAAO8N,OAAO15B,MAClD,OAAOA,EAUT,IAAI25B,GAAmBpO,EA38BH,CAClBqO,QAAS,IACTC,OAAQ,IACRC,OAAQ,IACRC,SAAU,IACVC,QAAS,MA4gCX,IAs3eIC,GAt3ee,SAAUC,EAAaC,GAIxC,IA6BMC,EA7BFn5B,GAHJk5B,EAAqB,MAAXA,EAAkBzS,GAAOuS,GAAEjkB,SAAS0R,GAAKze,SAAUkxB,EAASF,GAAEI,KAAK3S,GAAMhB,MAG/DzlB,MAChBq5B,EAAOH,EAAQG,KACf78B,EAAQ08B,EAAQ18B,MAChBkqB,EAAWwS,EAAQxS,SACnBlhB,EAAO0zB,EAAQ1zB,KACfwC,EAASkxB,EAAQlxB,OACjBqZ,EAAS6X,EAAQ7X,OACjB9G,EAAS2e,EAAQ3e,OACjB+e,EAAYJ,EAAQI,UAGpBC,EAAav5B,EAAMxC,UACnBg8B,EAAY9S,EAASlpB,UACrBi8B,EAAczxB,EAAOxK,UAGrBk8B,EAAaR,EAAQ,sBAGrBS,EAAeH,EAAUI,SAGzBC,EAAiBJ,EAAYI,eAG7BC,EAAY,EAGZC,GACEZ,EAAM,SAASa,KAAKN,GAAcA,EAAWO,MAAQP,EAAWO,KAAKC,UAAY,KACvE,iBAAmBf,EAAO,GAQtCgB,EAAuBV,EAAYG,SAGnCQ,EAAmBT,EAAa/8B,KAAKoL,GAGrCqyB,EAAU5T,GAAKuS,EAGfsB,EAAajZ,EAAO,IACtBsY,EAAa/8B,KAAKi9B,GAAgBv3B,QAAQwf,GAAc,QACvDxf,QAAQ,yDAA0D,SAAW,KAI5Ei4B,EAAS1T,GAAgBqS,EAAQqB,OAASvuB,GAC1CwuB,EAAStB,EAAQsB,OACjBC,EAAavB,EAAQuB,WACrBC,EAAcH,EAASA,EAAOG,YAAc1uB,GAC5C2uB,EAAe5C,GAAQ/vB,EAAO4yB,eAAgB5yB,GAC9C6yB,EAAe7yB,EAAOC,OACtB6yB,EAAuBrB,EAAYqB,qBACnC97B,EAASu6B,EAAWv6B,OACpB+7B,EAAmBP,EAASA,EAAOQ,mBAAqBhvB,GACxDivB,EAAcT,EAASA,EAAOU,SAAWlvB,GACzCmvB,EAAiBX,EAASA,EAAOY,YAAcpvB,GAE/CqvB,EAAkB,WACpB,IACE,IAAItT,EAAOuT,GAAUtzB,EAAQ,kBAE7B,OADA+f,EAAK,GAAI,GAAI,IACNA,EACP,MAAOhsB,KALU,GASjBw/B,EAAkBrC,EAAQt3B,eAAiB6kB,GAAK7kB,cAAgBs3B,EAAQt3B,aACxE45B,EAASnC,GAAQA,EAAKoC,MAAQhV,GAAK4S,KAAKoC,KAAOpC,EAAKoC,IACpDC,EAAgBxC,EAAQn3B,aAAe0kB,GAAK1kB,YAAcm3B,EAAQn3B,WAGlE45B,EAAan2B,EAAKo2B,KAClBC,EAAcr2B,EAAKmJ,MACnBmtB,EAAmB9zB,EAAO+zB,sBAC1BC,EAAiBzB,EAASA,EAAO0B,SAAWjwB,GAC5CkwB,EAAiBhD,EAAQiD,SACzBC,EAAa7C,EAAWvU,KACxBqX,EAAatE,GAAQ/vB,EAAOiyB,KAAMjyB,GAClCs0B,EAAY92B,EAAK6F,IACjBkxB,EAAY/2B,EAAK2H,IACjBqvB,EAAYnD,EAAKoC,IACjBgB,EAAiBvD,EAAQjc,SACzByf,EAAel3B,EAAKiD,OACpBk0B,EAAgBpD,EAAWqD,QAG3BC,EAAWvB,GAAUpC,EAAS,YAC9B4D,EAAMxB,GAAUpC,EAAS,OACzB6D,GAAUzB,GAAUpC,EAAS,WAC7B8D,GAAM1B,GAAUpC,EAAS,OACzB+D,GAAU3B,GAAUpC,EAAS,WAC7BgE,GAAe5B,GAAUtzB,EAAQ,UAGjCm1B,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,GAC9BU,GAAgBD,GAASR,GACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAcnD,EAASA,EAAOh9B,UAAYwO,GAC1C4xB,GAAgBD,GAAcA,GAAYE,QAAU7xB,GACpD8xB,GAAiBH,GAAcA,GAAY/D,SAAW5tB,GAyH1D,SAAS2S,GAAOxa,GACd,GAAI45B,GAAa55B,KAAWhE,GAAQgE,MAAYA,aAAiB65B,IAAc,CAC7E,GAAI75B,aAAiB85B,GACnB,OAAO95B,EAET,GAAI01B,EAAej9B,KAAKuH,EAAO,eAC7B,OAAO+5B,GAAa/5B,GAGxB,OAAO,IAAI85B,GAAc95B,GAW3B,IAAIg6B,GAAc,WAChB,SAAS9T,KACT,OAAO,SAASnsB,GACd,IAAKkgC,GAASlgC,GACZ,MAAO,GAET,GAAI28B,EACF,OAAOA,EAAa38B,GAEtBmsB,EAAO7sB,UAAYU,EACnB,IAAI0qB,EAAS,IAAIyB,EAEjB,OADAA,EAAO7sB,UAAYwO,GACZ4c,GAZM,GAqBjB,SAASyV,MAWT,SAASJ,GAAc95B,EAAOm6B,GAC5BtgC,KAAKugC,YAAcp6B,EACnBnG,KAAKwgC,YAAc,GACnBxgC,KAAKygC,YAAcH,EACnBtgC,KAAK0gC,UAAY,EACjB1gC,KAAK2gC,WAAa3yB,GAgFpB,SAASgyB,GAAY75B,GACnBnG,KAAKugC,YAAcp6B,EACnBnG,KAAKwgC,YAAc,GACnBxgC,KAAK4gC,QAAU,EACf5gC,KAAK6gC,cAAe,EACpB7gC,KAAK8gC,cAAgB,GACrB9gC,KAAK+gC,cAAgB7f,GACrBlhB,KAAKghC,UAAY,GAgHnB,SAASC,GAAKC,GACZ,IAAIngC,GAAS,EACTlC,EAAoB,MAAXqiC,EAAkB,EAAIA,EAAQriC,OAG3C,IADAmB,KAAKmhC,UACIpgC,EAAQlC,GAAQ,CACvB,IAAIuiC,EAAQF,EAAQngC,GACpBf,KAAKo6B,IAAIgH,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUH,GACjB,IAAIngC,GAAS,EACTlC,EAAoB,MAAXqiC,EAAkB,EAAIA,EAAQriC,OAG3C,IADAmB,KAAKmhC,UACIpgC,EAAQlC,GAAQ,CACvB,IAAIuiC,EAAQF,EAAQngC,GACpBf,KAAKo6B,IAAIgH,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASJ,GAChB,IAAIngC,GAAS,EACTlC,EAAoB,MAAXqiC,EAAkB,EAAIA,EAAQriC,OAG3C,IADAmB,KAAKmhC,UACIpgC,EAAQlC,GAAQ,CACvB,IAAIuiC,EAAQF,EAAQngC,GACpBf,KAAKo6B,IAAIgH,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAASpW,GAChB,IAAIpqB,GAAS,EACTlC,EAAmB,MAAVssB,EAAiB,EAAIA,EAAOtsB,OAGzC,IADAmB,KAAKwhC,SAAW,IAAIF,KACXvgC,EAAQlC,GACfmB,KAAKyhC,IAAItW,EAAOpqB,IA6CpB,SAAS2gC,GAAMR,GACb,IAAIp7B,EAAO9F,KAAKwhC,SAAW,IAAIH,GAAUH,GACzClhC,KAAK8H,KAAOhC,EAAKgC,KAqGnB,SAAS65B,GAAcx7B,EAAOy7B,GAC5B,IAAIC,EAAQ1/B,GAAQgE,GAChB27B,GAASD,GAASE,GAAY57B,GAC9B67B,GAAUH,IAAUC,GAAS7D,GAAS93B,GACtC87B,GAAUJ,IAAUC,IAAUE,GAAUlY,GAAa3jB,GACrD+7B,EAAcL,GAASC,GAASE,GAAUC,EAC1CrX,EAASsX,EAAczV,GAAUtmB,EAAMtH,OAAQ0d,GAAU,GACzD1d,EAAS+rB,EAAO/rB,OAEpB,IAAK,IAAIgM,KAAO1E,GACTy7B,IAAa/F,EAAej9B,KAAKuH,EAAO0E,IACvCq3B,IAEQ,UAAPr3B,GAECm3B,IAAkB,UAAPn3B,GAA0B,UAAPA,IAE9Bo3B,IAAkB,UAAPp3B,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDs3B,GAAQt3B,EAAKhM,KAElB+rB,EAAOlqB,KAAKmK,GAGhB,OAAO+f,EAUT,SAASwX,GAAYlY,GACnB,IAAIrrB,EAASqrB,EAAMrrB,OACnB,OAAOA,EAASqrB,EAAMmY,GAAW,EAAGxjC,EAAS,IAAMmP,GAWrD,SAASs0B,GAAgBpY,EAAOlsB,GAC9B,OAAOukC,GAAYC,GAAUtY,GAAQuY,GAAUzkC,EAAG,EAAGksB,EAAMrrB,SAU7D,SAAS6jC,GAAaxY,GACpB,OAAOqY,GAAYC,GAAUtY,IAY/B,SAASyY,GAAiBtW,EAAQxhB,EAAK1E,IAChCA,IAAU6H,IAAc40B,GAAGvW,EAAOxhB,GAAM1E,MACxCA,IAAU6H,IAAenD,KAAOwhB,IACnCwW,GAAgBxW,EAAQxhB,EAAK1E,GAcjC,SAAS28B,GAAYzW,EAAQxhB,EAAK1E,GAChC,IAAI48B,EAAW1W,EAAOxhB,GAChBgxB,EAAej9B,KAAKytB,EAAQxhB,IAAQ+3B,GAAGG,EAAU58B,KAClDA,IAAU6H,IAAenD,KAAOwhB,IACnCwW,GAAgBxW,EAAQxhB,EAAK1E,GAYjC,SAAS68B,GAAa9Y,EAAOrf,GAE3B,IADA,IAAIhM,EAASqrB,EAAMrrB,OACZA,KACL,GAAI+jC,GAAG1Y,EAAMrrB,GAAQ,GAAIgM,GACvB,OAAOhM,EAGX,OAAQ,EAcV,SAASokC,GAAetX,EAAYxB,EAAQC,EAAUC,GAIpD,OAHA6Y,GAASvX,EAAY,SAASxlB,EAAO0E,EAAK8gB,GACxCxB,EAAOE,EAAalkB,EAAOikB,EAASjkB,GAAQwlB,KAEvCtB,EAYT,SAAS8Y,GAAW9W,EAAQ/I,GAC1B,OAAO+I,GAAU+W,GAAW9f,EAAQ2Y,GAAK3Y,GAAS+I,GAyBpD,SAASwW,GAAgBxW,EAAQxhB,EAAK1E,GACzB,aAAP0E,GAAsBwyB,EACxBA,EAAehR,EAAQxhB,EAAK,CAC1Bw4B,cAAgB,EAChBC,YAAc,EACdn9B,MAASA,EACTo9B,UAAY,IAGdlX,EAAOxhB,GAAO1E,EAYlB,SAASq9B,GAAOnX,EAAQoX,GAMtB,IALA,IAAI1iC,GAAS,EACTlC,EAAS4kC,EAAM5kC,OACf+rB,EAAS5oB,EAAMnD,GACf6kC,EAAiB,MAAVrX,IAEFtrB,EAAQlC,GACf+rB,EAAO7pB,GAAS2iC,EAAO11B,GAAY21B,GAAItX,EAAQoX,EAAM1iC,IAEvD,OAAO6pB,EAYT,SAAS6X,GAAUmB,EAAQC,EAAOC,GAShC,OARIF,GAAWA,IACTE,IAAU91B,KACZ41B,EAASA,GAAUE,EAAQF,EAASE,GAElCD,IAAU71B,KACZ41B,EAAmBC,GAAVD,EAAkBA,EAASC,IAGjCD,EAmBT,SAASG,GAAU59B,EAAO69B,EAASC,EAAYp5B,EAAKwhB,EAAQ6X,GAC1D,IAAItZ,EACAuZ,EArkFc,EAqkFLH,EACTI,EArkFc,EAqkFLJ,EACTK,EArkFiB,EAqkFRL,EAKb,GAHIC,IACFrZ,EAASyB,EAAS4X,EAAW99B,EAAO0E,EAAKwhB,EAAQ6X,GAASD,EAAW99B,IAEnEykB,IAAW5c,GACb,OAAO4c,EAET,IAAKwV,GAASj6B,GACZ,OAAOA,EAET,IAmoEmBmd,EAAQ+I,EAYN/I,EAAQ+I,EAjvETA,EAAQ/I,EAijHN4G,EAClBrrB,EACA+rB,EAj9GAiX,EAAQ1/B,GAAQgE,GACpB,GAAI07B,GAEF,GA68GEhjC,GADkBqrB,EA78GI/jB,GA88GPtH,OACf+rB,EAAS,IAAIV,EAAM3d,YAAY1N,GAG/BA,GAA6B,iBAAZqrB,EAAM,IAAkB2R,EAAej9B,KAAKsrB,EAAO,WACtEU,EAAO7pB,MAAQmpB,EAAMnpB,MACrB6pB,EAAO0Z,MAAQpa,EAAMoa,OAp9GrB1Z,EAs9GKA,GAr9GAuZ,EACH,OAAO3B,GAAUr8B,EAAOykB,OAErB,CACL,IAAI2Z,EAAMC,GAAOr+B,GACbs+B,EAASF,GAAO9iB,IAAW8iB,GAAO7iB,GAEtC,GAAIuc,GAAS93B,GACX,OAAOu+B,GAAYv+B,EAAOg+B,GAE5B,GAAII,GAAO1iB,IAAa0iB,GAAOnjB,IAAYqjB,IAAWpY,GAEpD,GADAzB,EAAUwZ,GAAUK,EAAU,GAAKE,GAAgBx+B,IAC9Cg+B,EACH,OAAOC,GAlHe9gB,EAivEPA,EA9nEGnd,EA8nEKkmB,GAjvETA,EAmHwBzB,IAlH3BwY,GAAW9f,EAAQshB,GAAOthB,GAAS+I,GAivE7C+W,GAAW9f,EAAQuhB,GAAavhB,GAAS+I,KAbrBA,EAjnEE8W,GAAWvY,EAinErBtH,EAjnEGnd,GAknEfi9B,GAAW9f,EAAQwhB,GAAWxhB,GAAS+I,QAhnErC,CACL,IAAKzE,GAAc2c,GACjB,OAAOlY,EAASlmB,EAAQ,GAE1BykB,EA49GN,SAAwByB,EAAQkY,EAAKJ,GACnC,IAzlDmBY,EAbAC,EACfpa,EAbiBqa,EACjBC,EAinDAC,EAAO9Y,EAAO9f,YAClB,OAAQg4B,GACN,KAAKniB,GACH,OAAOgjB,GAAiB/Y,GAE1B,KAAK/K,GACL,KAAKC,GACH,OAAO,IAAI4jB,GAAM9Y,GAEnB,KAAKhK,GACH,OA5nDiB4iB,EA4nDI5Y,EA3nDrB6Y,EA2nD6Bf,EA3nDXiB,GAAiBH,EAASC,QAAUD,EAASC,OAC5D,IAAID,EAAS14B,YAAY24B,EAAQD,EAASI,WAAYJ,EAASK,YA4nDpE,KAAKhjB,GAAY,KAAKC,GACtB,KAAKC,GAAS,KAAKC,GAAU,KAAKC,GAClC,KAAKC,GAAU,KAAKC,GAAiB,KAAKC,GAAW,KAAKC,GACxD,OAAOyiB,GAAgBlZ,EAAQ8X,GAEjC,KAAKxiB,GACH,OAAO,IAAIwjB,EAEb,KAAKvjB,GACL,KAAKK,GACH,OAAO,IAAIkjB,EAAK9Y,GAElB,KAAKtK,GACH,OA9nDA6I,EAAS,IADMoa,EA+nDI3Y,GA9nDC9f,YAAYy4B,EAAO1hB,OAAQmB,GAAQuX,KAAKgJ,KACzD1K,UAAY0K,EAAO1K,UACnB1P,EA8nDL,KAAK5I,GACH,OAAO,IAAImjB,EAEb,KAAKjjB,GACH,OAxnDe6iB,EAwnDI1Y,EAvnDhBuT,GAAgB51B,EAAO41B,GAAchhC,KAAKmmC,IAAW,IAr4D/CS,CAAer/B,EAAOo+B,EAAKJ,IAIxCD,IAAUA,EAAQ,IAAIxC,IACtB,IAAI+D,EAAUvB,EAAMP,IAAIx9B,GACxB,GAAIs/B,EACF,OAAOA,EAETvB,EAAM9J,IAAIj0B,EAAOykB,GAEbhB,GAAMzjB,GACRA,EAAMjD,QAAQ,SAASwiC,GACrB9a,EAAO6W,IAAIsC,GAAU2B,EAAU1B,EAASC,EAAYyB,EAAUv/B,EAAO+9B,MAE9D1a,GAAMrjB,IACfA,EAAMjD,QAAQ,SAASwiC,EAAU76B,GAC/B+f,EAAOwP,IAAIvvB,EAAKk5B,GAAU2B,EAAU1B,EAASC,EAAYp5B,EAAK1E,EAAO+9B,MAIzE,IAIInX,EAAQ8U,EAAQ7zB,IAJLq2B,EACVD,EAASuB,GAAeC,GACxBxB,EAASQ,GAAS3I,IAEkB91B,GASzC,OARAmkB,GAAUyC,GAAS5mB,EAAO,SAASu/B,EAAU76B,GACvCkiB,IAEF2Y,EAAWv/B,EADX0E,EAAM66B,IAIR5C,GAAYlY,EAAQ/f,EAAKk5B,GAAU2B,EAAU1B,EAASC,EAAYp5B,EAAK1E,EAAO+9B,MAEzEtZ,EAyBT,SAASib,GAAexZ,EAAQ/I,EAAQyJ,GACtC,IAAIluB,EAASkuB,EAAMluB,OACnB,GAAc,MAAVwtB,EACF,OAAQxtB,EAGV,IADAwtB,EAASriB,EAAOqiB,GACTxtB,KAAU,CACf,IAAIgM,EAAMkiB,EAAMluB,GACZ4rB,EAAYnH,EAAOzY,GACnB1E,EAAQkmB,EAAOxhB,GAEnB,GAAK1E,IAAU6H,MAAenD,KAAOwhB,KAAa5B,EAAUtkB,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS2/B,GAAU/b,EAAMgc,EAAM7kC,GAC7B,GAAmB,mBAAR6oB,EACT,MAAM,IAAIuR,EAAU1a,IAEtB,OAAO7c,GAAW,WAAagmB,EAAK1oB,MAAM2M,GAAW9M,IAAU6kC,GAcjE,SAASC,GAAe9b,EAAOiB,EAAQf,EAAUY,GAC/C,IAAIjqB,GAAS,EACTklC,EAAWpb,GACXqb,GAAW,EACXrnC,EAASqrB,EAAMrrB,OACf+rB,EAAS,GACTub,EAAehb,EAAOtsB,OAE1B,IAAKA,EACH,OAAO+rB,EAELR,IACFe,EAASF,GAASE,EAAQ0B,GAAUzC,KAElCY,GACFib,EAAWlb,GACXmb,GAAW,GApvFM,KAsvFV/a,EAAOtsB,SACdonC,EAAWjZ,GACXkZ,GAAW,EACX/a,EAAS,IAAIoW,GAASpW,IAExBib,EACA,OAASrlC,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdslC,EAAuB,MAAZjc,EAAmBjkB,EAAQikB,EAASjkB,GAGnD,GADAA,EAAS6kB,GAAwB,IAAV7kB,EAAeA,EAAQ,EAC1C+/B,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAInb,EAAOmb,KAAiBD,EAC1B,SAASD,EAGbxb,EAAOlqB,KAAKyF,QAEJ8/B,EAAS9a,EAAQkb,EAAUrb,IACnCJ,EAAOlqB,KAAKyF,GAGhB,OAAOykB,EAjkCTjK,GAAO4lB,iBAAmB,CAQxBC,OAAUhjB,GAQVijB,SAAYhjB,GAQZijB,YAAehjB,GAQfijB,SAAY,GAQZC,QAAW,CAQT5L,EAAKra,MAKTA,GAAOnhB,UAAY6gC,GAAW7gC,WACb+M,YAAcoU,IAE/Bsf,GAAczgC,UAAY2gC,GAAWE,GAAW7gC,YACxB+M,YAAc0zB,IAsHtCD,GAAYxgC,UAAY2gC,GAAWE,GAAW7gC,YACxB+M,YAAcyzB,GAoGpCiB,GAAKzhC,UAAU2hC,MAvEf,WACEnhC,KAAKwhC,SAAWtC,GAAeA,GAAa,MAAQ,GACpDl/B,KAAK8H,KAAO,GAsEdm5B,GAAKzhC,UAAkB,OAzDvB,SAAoBqL,GAClB,IAAI+f,EAAS5qB,KAAKktB,IAAIriB,WAAe7K,KAAKwhC,SAAS32B,GAEnD,OADA7K,KAAK8H,MAAQ8iB,EAAS,EAAI,EACnBA,GAuDTqW,GAAKzhC,UAAUmkC,IA3Cf,SAAiB94B,GACf,IAAI/E,EAAO9F,KAAKwhC,SAChB,GAAItC,GAAc,CAChB,IAAItU,EAAS9kB,EAAK+E,GAClB,OAAO+f,IAAW/J,GAAiB7S,GAAY4c,EAEjD,OAAOiR,EAAej9B,KAAKkH,EAAM+E,GAAO/E,EAAK+E,GAAOmD,IAsCtDizB,GAAKzhC,UAAU0tB,IA1Bf,SAAiBriB,GACf,IAAI/E,EAAO9F,KAAKwhC,SAChB,OAAOtC,GAAgBp5B,EAAK+E,KAASmD,GAAa6tB,EAAej9B,KAAKkH,EAAM+E,IAyB9Eo2B,GAAKzhC,UAAU46B,IAZf,SAAiBvvB,EAAK1E,GACpB,IAAIL,EAAO9F,KAAKwhC,SAGhB,OAFAxhC,KAAK8H,MAAQ9H,KAAKktB,IAAIriB,GAAO,EAAI,EACjC/E,EAAK+E,GAAQq0B,IAAgB/4B,IAAU6H,GAAa6S,GAAiB1a,EAC9DnG,MAyHTqhC,GAAU7hC,UAAU2hC,MApFpB,WACEnhC,KAAKwhC,SAAW,GAChBxhC,KAAK8H,KAAO,GAmFdu5B,GAAU7hC,UAAkB,OAvE5B,SAAyBqL,GACvB,IAAI/E,EAAO9F,KAAKwhC,SACZzgC,EAAQiiC,GAAal9B,EAAM+E,GAE/B,QAAI9J,EAAQ,IAIRA,GADY+E,EAAKjH,OAAS,EAE5BiH,EAAK+gC,MAEL7lC,EAAOpC,KAAKkH,EAAM/E,EAAO,KAEzBf,KAAK8H,KACA,KA0DTu5B,GAAU7hC,UAAUmkC,IA9CpB,SAAsB94B,GACpB,IAAI/E,EAAO9F,KAAKwhC,SACZzgC,EAAQiiC,GAAal9B,EAAM+E,GAE/B,OAAO9J,EAAQ,EAAIiN,GAAYlI,EAAK/E,GAAO,IA2C7CsgC,GAAU7hC,UAAU0tB,IA/BpB,SAAsBriB,GACpB,OAA2C,EAApCm4B,GAAahjC,KAAKwhC,SAAU32B,IA+BrCw2B,GAAU7hC,UAAU46B,IAlBpB,SAAsBvvB,EAAK1E,GACzB,IAAIL,EAAO9F,KAAKwhC,SACZzgC,EAAQiiC,GAAal9B,EAAM+E,GAQ/B,OANI9J,EAAQ,KACRf,KAAK8H,KACPhC,EAAKpF,KAAK,CAACmK,EAAK1E,KAEhBL,EAAK/E,GAAO,GAAKoF,EAEZnG,MA2GTshC,GAAS9hC,UAAU2hC,MAtEnB,WACEnhC,KAAK8H,KAAO,EACZ9H,KAAKwhC,SAAW,CACdsF,KAAQ,IAAI7F,GACZ1oB,IAAO,IAAKumB,GAAOuC,IACnB1U,OAAU,IAAIsU,KAkElBK,GAAS9hC,UAAkB,OArD3B,SAAwBqL,GACtB,IAAI+f,EAASmc,GAAW/mC,KAAM6K,GAAa,OAAEA,GAE7C,OADA7K,KAAK8H,MAAQ8iB,EAAS,EAAI,EACnBA,GAmDT0W,GAAS9hC,UAAUmkC,IAvCnB,SAAqB94B,GACnB,OAAOk8B,GAAW/mC,KAAM6K,GAAK84B,IAAI94B,IAuCnCy2B,GAAS9hC,UAAU0tB,IA3BnB,SAAqBriB,GACnB,OAAOk8B,GAAW/mC,KAAM6K,GAAKqiB,IAAIriB,IA2BnCy2B,GAAS9hC,UAAU46B,IAdnB,SAAqBvvB,EAAK1E,GACxB,IAAIL,EAAOihC,GAAW/mC,KAAM6K,GACxB/C,EAAOhC,EAAKgC,KAIhB,OAFAhC,EAAKs0B,IAAIvvB,EAAK1E,GACdnG,KAAK8H,MAAQhC,EAAKgC,MAAQA,EAAO,EAAI,EAC9B9H,MA2DTuhC,GAAS/hC,UAAUiiC,IAAMF,GAAS/hC,UAAUkB,KAnB5C,SAAqByF,GAEnB,OADAnG,KAAKwhC,SAASpH,IAAIj0B,EAAO0a,IAClB7gB,MAkBTuhC,GAAS/hC,UAAU0tB,IANnB,SAAqB/mB,GACnB,OAAOnG,KAAKwhC,SAAStU,IAAI/mB,IAuG3Bu7B,GAAMliC,UAAU2hC,MA3EhB,WACEnhC,KAAKwhC,SAAW,IAAIH,GACpBrhC,KAAK8H,KAAO,GA0Ed45B,GAAMliC,UAAkB,OA9DxB,SAAqBqL,GACnB,IAAI/E,EAAO9F,KAAKwhC,SACZ5W,EAAS9kB,EAAa,OAAE+E,GAG5B,OADA7K,KAAK8H,KAAOhC,EAAKgC,KACV8iB,GA0DT8W,GAAMliC,UAAUmkC,IA9ChB,SAAkB94B,GAChB,OAAO7K,KAAKwhC,SAASmC,IAAI94B,IA8C3B62B,GAAMliC,UAAU0tB,IAlChB,SAAkBriB,GAChB,OAAO7K,KAAKwhC,SAAStU,IAAIriB,IAkC3B62B,GAAMliC,UAAU46B,IArBhB,SAAkBvvB,EAAK1E,GACrB,IAAIL,EAAO9F,KAAKwhC,SAChB,GAAI17B,aAAgBu7B,GAAW,CAC7B,IAAI2F,EAAQlhC,EAAK07B,SACjB,IAAK1C,GAAQkI,EAAMnoC,OAASooC,IAG1B,OAFAD,EAAMtmC,KAAK,CAACmK,EAAK1E,IACjBnG,KAAK8H,OAAShC,EAAKgC,KACZ9H,KAET8F,EAAO9F,KAAKwhC,SAAW,IAAIF,GAAS0F,GAItC,OAFAlhC,EAAKs0B,IAAIvvB,EAAK1E,GACdnG,KAAK8H,KAAOhC,EAAKgC,KACV9H,MAscT,IAAIkjC,GAAWgE,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU3b,EAAYlB,GAC7B,IAAIG,GAAS,EAKb,OAJAsY,GAASvX,EAAY,SAASxlB,EAAOpF,EAAO4qB,GAE1C,OADAf,IAAWH,EAAUtkB,EAAOpF,EAAO4qB,KAG9Bf,EAaT,SAAS2c,GAAard,EAAOE,EAAUY,GAIrC,IAHA,IAAIjqB,GAAS,EACTlC,EAASqrB,EAAMrrB,SAEVkC,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdyrB,EAAUpC,EAASjkB,GAEvB,GAAe,MAAXqmB,IAAoB6Z,IAAar4B,GAC5Bwe,GAAYA,IAAYgb,GAAShb,GAClCxB,EAAWwB,EAAS6Z,IAE1B,IAAIA,EAAW7Z,EACX5B,EAASzkB,EAGjB,OAAOykB,EAuCT,SAAS6c,GAAW9b,EAAYlB,GAC9B,IAAIG,EAAS,GAMb,OALAsY,GAASvX,EAAY,SAASxlB,EAAOpF,EAAO4qB,GACtClB,EAAUtkB,EAAOpF,EAAO4qB,IAC1Bf,EAAOlqB,KAAKyF,KAGTykB,EAcT,SAAS8c,GAAYxd,EAAOyd,EAAOld,EAAWmd,EAAUhd,GACtD,IAAI7pB,GAAS,EACTlC,EAASqrB,EAAMrrB,OAKnB,IAHA4rB,IAAcA,EAAYod,IAC1Bjd,IAAWA,EAAS,MAEX7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACN,EAAR4mC,GAAald,EAAUtkB,GACb,EAARwhC,EAEFD,GAAYvhC,EAAOwhC,EAAQ,EAAGld,EAAWmd,EAAUhd,GAEnDM,GAAUN,EAAQzkB,GAEVyhC,IACVhd,EAAOA,EAAO/rB,QAAUsH,GAG5B,OAAOykB,EAcT,IAAIkd,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAW9a,EAAQjC,GAC1B,OAAOiC,GAAUyb,GAAQzb,EAAQjC,EAAU6R,IAW7C,SAASoL,GAAgBhb,EAAQjC,GAC/B,OAAOiC,GAAU2b,GAAa3b,EAAQjC,EAAU6R,IAYlD,SAASgM,GAAc5b,EAAQU,GAC7B,OAAOrC,GAAYqC,EAAO,SAASliB,GACjC,OAAOq9B,GAAW7b,EAAOxhB,MAY7B,SAASs9B,GAAQ9b,EAAQ+b,GAMvB,IAHA,IAAIrnC,EAAQ,EACRlC,GAHJupC,EAAOC,GAASD,EAAM/b,IAGJxtB,OAED,MAAVwtB,GAAkBtrB,EAAQlC,GAC/BwtB,EAASA,EAAOic,GAAMF,EAAKrnC,OAE7B,OAAQA,GAASA,GAASlC,EAAUwtB,EAASre,GAc/C,SAASu6B,GAAelc,EAAQmc,EAAUC,GACxC,IAAI7d,EAAS4d,EAASnc,GACtB,OAAOlqB,GAAQkqB,GAAUzB,EAASM,GAAUN,EAAQ6d,EAAYpc,IAUlE,SAASqc,GAAWviC,GAClB,OAAa,MAATA,EACKA,IAAU6H,GAn7FJ,qBARL,gBA67FFmvB,GAAkBA,KAAkBnzB,EAAO7D,GA23FrD,SAAmBA,GACjB,IAAIwiC,EAAQ9M,EAAej9B,KAAKuH,EAAOg3B,GACnCoH,EAAMp+B,EAAMg3B,GAEhB,IACEh3B,EAAMg3B,GAAkBnvB,GACxB,IAAI46B,GAAW,EACf,MAAO7qC,IAET,IAAI6sB,EAASuR,EAAqBv9B,KAAKuH,GAQvC,OAPIyiC,IACED,EACFxiC,EAAMg3B,GAAkBoH,SAEjBp+B,EAAMg3B,IAGVvS,EA34FHie,CAAU1iC,IA+5GQA,EA95GHA,EA+5GZg2B,EAAqBv9B,KAAKuH,IADnC,IAAwBA,EAl5GxB,SAAS2iC,GAAO3iC,EAAO4iC,GACrB,OAAeA,EAAR5iC,EAWT,SAAS6iC,GAAQ3c,EAAQxhB,GACvB,OAAiB,MAAVwhB,GAAkBwP,EAAej9B,KAAKytB,EAAQxhB,GAWvD,SAASo+B,GAAU5c,EAAQxhB,GACzB,OAAiB,MAAVwhB,GAAkBxhB,KAAOb,EAAOqiB,GA0BzC,SAAS6c,GAAiBC,EAAQ/e,EAAUY,GAS1C,IARA,IAAIib,EAAWjb,EAAaD,GAAoBF,GAC5ChsB,EAASsqC,EAAO,GAAGtqC,OACnBuqC,EAAYD,EAAOtqC,OACnBwqC,EAAWD,EACXE,EAAStnC,EAAMonC,GACfG,EAAYC,EAAAA,EACZ5e,EAAS,GAENye,KAAY,CACjB,IAAInf,EAAQif,EAAOE,GACfA,GAAYjf,IACdF,EAAQe,GAASf,EAAO2C,GAAUzC,KAEpCmf,EAAYhL,EAAUrU,EAAMrrB,OAAQ0qC,GACpCD,EAAOD,IAAare,IAAeZ,GAAuB,KAAVvrB,GAAiC,KAAhBqrB,EAAMrrB,QACnE,IAAI0iC,GAAS8H,GAAYnf,GACzBlc,GAENkc,EAAQif,EAAO,GAEf,IAAIpoC,GAAS,EACT0oC,EAAOH,EAAO,GAElBlD,EACA,OAASrlC,EAAQlC,GAAU+rB,EAAO/rB,OAAS0qC,GAAW,CACpD,IAAIpjC,EAAQ+jB,EAAMnpB,GACdslC,EAAWjc,EAAWA,EAASjkB,GAASA,EAG5C,GADAA,EAAS6kB,GAAwB,IAAV7kB,EAAeA,EAAQ,IACxCsjC,EACEzc,GAASyc,EAAMpD,GACfJ,EAASrb,EAAQyb,EAAUrb,IAC5B,CAEL,IADAqe,EAAWD,IACFC,GAAU,CACjB,IAAIpc,EAAQqc,EAAOD,GACnB,KAAMpc,EACED,GAASC,EAAOoZ,GAChBJ,EAASkD,EAAOE,GAAWhD,EAAUrb,IAE3C,SAASob,EAGTqD,GACFA,EAAK/oC,KAAK2lC,GAEZzb,EAAOlqB,KAAKyF,IAGhB,OAAOykB,EA+BT,SAAS8e,GAAWrd,EAAQ+b,EAAMlnC,GAGhC,IAAI6oB,EAAiB,OADrBsC,EAASsd,GAAOtd,EADhB+b,EAAOC,GAASD,EAAM/b,KAEMA,EAASA,EAAOic,GAAMsB,GAAKxB,KACvD,OAAe,MAARre,EAAe/b,GAAY3M,GAAM0oB,EAAMsC,EAAQnrB,GAUxD,SAAS2oC,GAAgB1jC,GACvB,OAAO45B,GAAa55B,IAAUuiC,GAAWviC,IAAUib,GAuCrD,SAAS0oB,GAAY3jC,EAAO4iC,EAAO/E,EAASC,EAAYC,GACtD,OAAI/9B,IAAU4iC,IAGD,MAAT5iC,GAA0B,MAAT4iC,IAAmBhJ,GAAa55B,KAAW45B,GAAagJ,GACpE5iC,GAAUA,GAAS4iC,GAAUA,EAmBxC,SAAyB1c,EAAQ0c,EAAO/E,EAASC,EAAY8F,EAAW7F,GACtE,IAAI8F,EAAW7nC,GAAQkqB,GACnB4d,EAAW9nC,GAAQ4mC,GACnBmB,EAASF,EAAW3oB,GAAWmjB,GAAOnY,GACtC8d,EAASF,EAAW5oB,GAAWmjB,GAAOuE,GAKtCqB,GAHJF,EAASA,GAAU9oB,GAAUS,GAAYqoB,IAGhBroB,GACrBwoB,GAHJF,EAASA,GAAU/oB,GAAUS,GAAYsoB,IAGhBtoB,GACrByoB,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarM,GAAS5R,GAAS,CACjC,IAAK4R,GAAS8K,GACZ,OAAO,EAGTqB,IADAJ,GAAW,GAGb,GAAIM,IAAcF,EAEhB,OADAlG,IAAUA,EAAQ,IAAIxC,IACdsI,GAAYlgB,GAAauC,GAC7Bke,GAAYle,EAAQ0c,EAAO/E,EAASC,EAAY8F,EAAW7F,GA81EnE,SAAoB7X,EAAQ0c,EAAOxE,EAAKP,EAASC,EAAY8F,EAAW7F,GACtE,OAAQK,GACN,KAAKliB,GACH,GAAKgK,EAAOiZ,YAAcyD,EAAMzD,YAC3BjZ,EAAOgZ,YAAc0D,EAAM1D,WAC9B,OAAO,EAEThZ,EAASA,EAAO6Y,OAChB6D,EAAQA,EAAM7D,OAEhB,KAAK9iB,GACH,QAAKiK,EAAOiZ,YAAcyD,EAAMzD,aAC3ByE,EAAU,IAAItN,EAAWpQ,GAAS,IAAIoQ,EAAWsM,KAKxD,KAAKznB,GACL,KAAKC,GACL,KAAKK,GAGH,OAAOghB,IAAIvW,GAAS0c,GAEtB,KAAKvnB,GACH,OAAO6K,EAAO1P,MAAQosB,EAAMpsB,MAAQ0P,EAAO9lB,SAAWwiC,EAAMxiC,QAE9D,KAAKwb,GACL,KAAKE,GAIH,OAAOoK,GAAW0c,EAAQ,GAE5B,KAAKpnB,GACH,IAAI6oB,EAAU1Q,GAEhB,KAAK9X,GACH,IAAIyoB,EAxnLe,EAwnLHzG,EAGhB,GAFAwG,IAAYA,EAAUrQ,IAElB9N,EAAOvkB,MAAQihC,EAAMjhC,OAAS2iC,EAChC,OAAO,EAGT,IAAIhF,EAAUvB,EAAMP,IAAItX,GACxB,GAAIoZ,EACF,OAAOA,GAAWsD,EAEpB/E,GAloLqB,EAqoLrBE,EAAM9J,IAAI/N,EAAQ0c,GAClB,IAAIne,EAAS2f,GAAYC,EAAQne,GAASme,EAAQzB,GAAQ/E,EAASC,EAAY8F,EAAW7F,GAE1F,OADAA,EAAc,OAAE7X,GACTzB,EAET,KAAK1I,GACH,GAAI0d,GACF,OAAOA,GAAchhC,KAAKytB,IAAWuT,GAAchhC,KAAKmqC,GAG9D,OAAO,EA35ED2B,CAAWre,EAAQ0c,EAAOmB,EAAQlG,EAASC,EAAY8F,EAAW7F,GAExE,KAvvGuB,EAuvGjBF,GAAiC,CACrC,IAAI2G,EAAeP,GAAYvO,EAAej9B,KAAKytB,EAAQ,eACvDue,EAAeP,GAAYxO,EAAej9B,KAAKmqC,EAAO,eAE1D,GAAI4B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAete,EAAOlmB,QAAUkmB,EAC/Cye,EAAeF,EAAe7B,EAAM5iC,QAAU4iC,EAGlD,OADA7E,IAAUA,EAAQ,IAAIxC,IACfqI,EAAUc,EAAcC,EAAc9G,EAASC,EAAYC,IAGtE,QAAKoG,IAGLpG,IAAUA,EAAQ,IAAIxC,IA05ExB,SAAsBrV,EAAQ0c,EAAO/E,EAASC,EAAY8F,EAAW7F,GACnE,IAAIuG,EAjqLmB,EAiqLPzG,EACZ+G,EAAWnF,GAAWvZ,GACtB2e,EAAYD,EAASlsC,OAErBuqC,EADWxD,GAAWmD,GACDlqC,OAEzB,GAAImsC,GAAa5B,IAAcqB,EAC7B,OAAO,EAGT,IADA,IAAI1pC,EAAQiqC,EACLjqC,KAAS,CACd,IAAI8J,EAAMkgC,EAAShqC,GACnB,KAAM0pC,EAAY5/B,KAAOk+B,EAAQlN,EAAej9B,KAAKmqC,EAAOl+B,IAC1D,OAAO,EAIX,IAAIogC,EAAa/G,EAAMP,IAAItX,GACvB6e,EAAahH,EAAMP,IAAIoF,GAC3B,GAAIkC,GAAcC,EAChB,OAAOD,GAAclC,GAASmC,GAAc7e,EAE9C,IAAIzB,GAAS,EACbsZ,EAAM9J,IAAI/N,EAAQ0c,GAClB7E,EAAM9J,IAAI2O,EAAO1c,GAGjB,IADA,IAAI8e,EAAWV,IACN1pC,EAAQiqC,GAAW,CAC1BngC,EAAMkgC,EAAShqC,GACf,IAAIgiC,EAAW1W,EAAOxhB,GAClBugC,EAAWrC,EAAMl+B,GAErB,GAAIo5B,EACF,IAAIoH,EAAWZ,EACXxG,EAAWmH,EAAUrI,EAAUl4B,EAAKk+B,EAAO1c,EAAQ6X,GACnDD,EAAWlB,EAAUqI,EAAUvgC,EAAKwhB,EAAQ0c,EAAO7E,GAGzD,KAAMmH,IAAar9B,GACV+0B,IAAaqI,GAAYrB,EAAUhH,EAAUqI,EAAUpH,EAASC,EAAYC,GAC7EmH,GACD,CACLzgB,GAAS,EACT,MAEFugB,IAAaA,EAAkB,eAAPtgC,GAE1B,GAAI+f,IAAWugB,EAAU,CACvB,IAAIG,EAAUjf,EAAO9f,YACjBg/B,EAAUxC,EAAMx8B,YAGhB++B,GAAWC,GACV,gBAAiBlf,GAAU,gBAAiB0c,KACzB,mBAAXuC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,KACvD3gB,GAAS,GAKb,OAFAsZ,EAAc,OAAE7X,GAChB6X,EAAc,OAAE6E,GACTne,EAv9EA4gB,CAAanf,EAAQ0c,EAAO/E,EAASC,EAAY8F,EAAW7F,IA3D5DuH,CAAgBtlC,EAAO4iC,EAAO/E,EAASC,EAAY6F,GAAa5F,IAmFzE,SAASwH,GAAYrf,EAAQ/I,EAAQqoB,EAAW1H,GAC9C,IAAIljC,EAAQ4qC,EAAU9sC,OAClBA,EAASkC,EACT6qC,GAAgB3H,EAEpB,GAAc,MAAV5X,EACF,OAAQxtB,EAGV,IADAwtB,EAASriB,EAAOqiB,GACTtrB,KAAS,CACd,IAAI+E,EAAO6lC,EAAU5qC,GACrB,GAAK6qC,GAAgB9lC,EAAK,GAClBA,EAAK,KAAOumB,EAAOvmB,EAAK,MACtBA,EAAK,KAAMumB,GAEnB,OAAO,EAGX,OAAStrB,EAAQlC,GAAQ,CAEvB,IAAIgM,GADJ/E,EAAO6lC,EAAU5qC,IACF,GACXgiC,EAAW1W,EAAOxhB,GAClBghC,EAAW/lC,EAAK,GAEpB,GAAI8lC,GAAgB9lC,EAAK,IACvB,GAAIi9B,IAAa/0B,MAAenD,KAAOwhB,GACrC,OAAO,MAEJ,CACL,IAAI6X,EAAQ,IAAIxC,GAChB,GAAIuC,EACF,IAAIrZ,EAASqZ,EAAWlB,EAAU8I,EAAUhhC,EAAKwhB,EAAQ/I,EAAQ4gB,GAEnE,KAAMtZ,IAAW5c,GACT87B,GAAY+B,EAAU9I,EAAU+I,EAA+C7H,EAAYC,GAC3FtZ,GAEN,OAAO,GAIb,OAAO,EAWT,SAASmhB,GAAa5lC,GACpB,SAAKi6B,GAASj6B,KA05FE4jB,EA15FiB5jB,EA25FxB41B,GAAeA,KAAchS,MAx5FxBme,GAAW/hC,GAASm2B,EAAa1X,IAChCzG,KAAKmhB,GAASn5B,IAs5F/B,IAAkB4jB,EA12FlB,SAASiiB,GAAa7lC,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK8lC,GAEW,iBAAT9lC,EACFhE,GAAQgE,GACX+lC,GAAoB/lC,EAAM,GAAIA,EAAM,IACpCgmC,GAAYhmC,GAEXimC,GAASjmC,GAUlB,SAASkmC,GAAShgB,GAChB,IAAKigB,GAAYjgB,GACf,OAAOgS,EAAWhS,GAEpB,IAAIzB,EAAS,GACb,IAAK,IAAI/f,KAAOb,EAAOqiB,GACjBwP,EAAej9B,KAAKytB,EAAQxhB,IAAe,eAAPA,GACtC+f,EAAOlqB,KAAKmK,GAGhB,OAAO+f,EAUT,SAAS2hB,GAAWlgB,GAClB,IAAK+T,GAAS/T,GACZ,OA09FJ,SAAsBA,GACpB,IAAIzB,EAAS,GACb,GAAc,MAAVyB,EACF,IAAK,IAAIxhB,KAAOb,EAAOqiB,GACrBzB,EAAOlqB,KAAKmK,GAGhB,OAAO+f,EAj+FE4hB,CAAangB,GAEtB,IAAIogB,EAAUH,GAAYjgB,GACtBzB,EAAS,GAEb,IAAK,IAAI/f,KAAOwhB,GACD,eAAPxhB,IAAyB4hC,GAAY5Q,EAAej9B,KAAKytB,EAAQxhB,KACrE+f,EAAOlqB,KAAKmK,GAGhB,OAAO+f,EAYT,SAAS8hB,GAAOvmC,EAAO4iC,GACrB,OAAO5iC,EAAQ4iC,EAWjB,SAAS4D,GAAQhhB,EAAYvB,GAC3B,IAAIrpB,GAAS,EACT6pB,EAASgiB,GAAYjhB,GAAc3pB,EAAM2pB,EAAW9sB,QAAU,GAKlE,OAHAqkC,GAASvX,EAAY,SAASxlB,EAAO0E,EAAK8gB,GACxCf,IAAS7pB,GAASqpB,EAASjkB,EAAO0E,EAAK8gB,KAElCf,EAUT,SAASuhB,GAAY7oB,GACnB,IAAIqoB,EAAYkB,GAAavpB,GAC7B,OAAwB,GAApBqoB,EAAU9sC,QAAe8sC,EAAU,GAAG,GACjCmB,GAAwBnB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAStf,GACd,OAAOA,IAAW/I,GAAUooB,GAAYrf,EAAQ/I,EAAQqoB,IAY5D,SAASO,GAAoB9D,EAAMyD,GACjC,OAAIkB,GAAM3E,IAAS4E,GAAmBnB,GAC7BiB,GAAwBxE,GAAMF,GAAOyD,GAEvC,SAASxf,GACd,IAAI0W,EAAWY,GAAItX,EAAQ+b,GAC3B,OAAQrF,IAAa/0B,IAAa+0B,IAAa8I,EAC3CoB,GAAM5gB,EAAQ+b,GACd0B,GAAY+B,EAAU9I,EAAU+I,IAexC,SAASoB,GAAU7gB,EAAQ/I,EAAQ6pB,EAAUlJ,EAAYC,GACnD7X,IAAW/I,GAGfwkB,GAAQxkB,EAAQ,SAASuoB,EAAUhhC,GAEjC,GADAq5B,IAAUA,EAAQ,IAAIxC,IAClBtB,GAASyL,IA+BjB,SAAuBxf,EAAQ/I,EAAQzY,EAAKsiC,EAAUC,EAAWnJ,EAAYC,GAC3E,IAAInB,EAAWsK,GAAQhhB,EAAQxhB,GAC3BghC,EAAWwB,GAAQ/pB,EAAQzY,GAC3B46B,EAAUvB,EAAMP,IAAIkI,GAExB,GAAIpG,EAEF,OADA9C,GAAiBtW,EAAQxhB,EAAK46B,GAGhC,IAAI6H,EAAWrJ,EACXA,EAAWlB,EAAU8I,EAAWhhC,EAAM,GAAKwhB,EAAQ/I,EAAQ4gB,GAC3Dl2B,GAEAk4B,EAAWoH,IAAat/B,GAE5B,GAAIk4B,EAAU,CACZ,IAAIrE,EAAQ1/B,GAAQ0pC,GAChB7J,GAAUH,GAAS5D,GAAS4N,GAC5B0B,GAAW1L,IAAUG,GAAUlY,GAAa+hB,GAEhDyB,EAAWzB,EACPhK,GAASG,GAAUuL,EAEnBD,EADEnrC,GAAQ4gC,GACCA,EAEJyK,GAAkBzK,GACdP,GAAUO,GAEdf,EAEI0C,GAAYmH,IADvB3F,GAAW,IAGJqH,EAEIhI,GAAgBsG,IAD3B3F,GAAW,IAIA,GAGNuH,GAAc5B,IAAa9J,GAAY8J,GAE1C9J,GADJuL,EAAWvK,GAETuK,EAAWI,GAAc3K,GAEjB3C,GAAS2C,KAAamF,GAAWnF,KACzCuK,EAAW3I,GAAgBkH,IAI7B3F,GAAW,EAGXA,IAEFhC,EAAM9J,IAAIyR,EAAUyB,GACpBF,EAAUE,EAAUzB,EAAUsB,EAAUlJ,EAAYC,GACpDA,EAAc,OAAE2H,IAElBlJ,GAAiBtW,EAAQxhB,EAAKyiC,GAzF1BK,CAActhB,EAAQ/I,EAAQzY,EAAKsiC,EAAUD,GAAWjJ,EAAYC,OAEjE,CACH,IAAIoJ,EAAWrJ,EACXA,EAAWoJ,GAAQhhB,EAAQxhB,GAAMghC,EAAWhhC,EAAM,GAAKwhB,EAAQ/I,EAAQ4gB,GACvEl2B,GAEAs/B,IAAat/B,KACfs/B,EAAWzB,GAEblJ,GAAiBtW,EAAQxhB,EAAKyiC,KAE/B1I,IAwFL,SAASgJ,GAAQ1jB,EAAOlsB,GACtB,IAAIa,EAASqrB,EAAMrrB,OACnB,GAAKA,EAIL,OAAOsjC,GADPnkC,GAAKA,EAAI,EAAIa,EAAS,EACJA,GAAUqrB,EAAMlsB,GAAKgQ,GAYzC,SAAS6/B,GAAYliB,EAAYmiB,EAAWC,GAExCD,EADEA,EAAUjvC,OACAosB,GAAS6iB,EAAW,SAAS1jB,GACvC,OAAIjoB,GAAQioB,GACH,SAASjkB,GACd,OAAOgiC,GAAQhiC,EAA2B,IAApBikB,EAASvrB,OAAeurB,EAAS,GAAKA,IAGzDA,IAGG,CAAC6hB,IAGf,IAAIlrC,GAAS,EAUb,OATA+sC,EAAY7iB,GAAS6iB,EAAWjhB,GAAUmhB,OAnxF9C,SAAoB9jB,EAAO+jB,GACzB,IAAIpvC,EAASqrB,EAAMrrB,OAGnB,IADAqrB,EAAMtK,KAAKquB,GACJpvC,KACLqrB,EAAMrrB,GAAUqrB,EAAMrrB,GAAQsH,MAEhC,OAAO+jB,EAqxFEgkB,CAPMvB,GAAQhhB,EAAY,SAASxlB,EAAO0E,EAAK8gB,GAIpD,MAAO,CAAEwiB,SAHMljB,GAAS6iB,EAAW,SAAS1jB,GAC1C,OAAOA,EAASjkB,KAEapF,QAAWA,EAAOoF,MAASA,KAGlC,SAASkmB,EAAQ0c,GACzC,OA04BJ,SAAyB1c,EAAQ0c,EAAOgF,GAOtC,IANA,IAAIhtC,GAAS,EACTqtC,EAAc/hB,EAAO8hB,SACrBE,EAActF,EAAMoF,SACpBtvC,EAASuvC,EAAYvvC,OACrByvC,EAAeP,EAAOlvC,SAEjBkC,EAAQlC,GAAQ,CACvB,IAAI+rB,EAAS2jB,GAAiBH,EAAYrtC,GAAQstC,EAAYttC,IAC9D,GAAI6pB,EAAQ,CACV,GAAa0jB,GAATvtC,EACF,OAAO6pB,EAET,IAAI4jB,EAAQT,EAAOhtC,GACnB,OAAO6pB,GAAmB,QAAT4jB,GAAmB,EAAI,IAU5C,OAAOniB,EAAOtrB,MAAQgoC,EAAMhoC,MAl6BnB0tC,CAAgBpiB,EAAQ0c,EAAOgF,KA4B1C,SAASW,GAAWriB,EAAQoX,EAAOhZ,GAKjC,IAJA,IAAI1pB,GAAS,EACTlC,EAAS4kC,EAAM5kC,OACf+rB,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIupC,EAAO3E,EAAM1iC,GACboF,EAAQgiC,GAAQ9b,EAAQ+b,GAExB3d,EAAUtkB,EAAOiiC,IACnBuG,GAAQ/jB,EAAQyd,GAASD,EAAM/b,GAASlmB,GAG5C,OAAOykB,EA2BT,SAASgkB,GAAY1kB,EAAOiB,EAAQf,EAAUY,GAC5C,IAAIvqB,EAAUuqB,EAAakB,GAAkBpB,GACzC/pB,GAAS,EACTlC,EAASssB,EAAOtsB,OAChB4qC,EAAOvf,EAQX,IANIA,IAAUiB,IACZA,EAASqX,GAAUrX,IAEjBf,IACFqf,EAAOxe,GAASf,EAAO2C,GAAUzC,OAE1BrpB,EAAQlC,GAKf,IAJA,IAAIitB,EAAY,EACZ3lB,EAAQglB,EAAOpqB,GACfslC,EAAWjc,EAAWA,EAASjkB,GAASA,GAE2B,GAA/D2lB,EAAYrrB,EAAQgpC,EAAMpD,EAAUva,EAAWd,KACjDye,IAASvf,GACXlpB,EAAOpC,KAAK6qC,EAAM3d,EAAW,GAE/B9qB,EAAOpC,KAAKsrB,EAAO4B,EAAW,GAGlC,OAAO5B,EAYT,SAAS2kB,GAAW3kB,EAAO4kB,GAIzB,IAHA,IAAIjwC,EAASqrB,EAAQ4kB,EAAQjwC,OAAS,EAClCy7B,EAAYz7B,EAAS,EAElBA,KAAU,CACf,IAAIkC,EAAQ+tC,EAAQjwC,GACpB,GAAIA,GAAUy7B,GAAav5B,IAAUguC,EAAU,CAC7C,IAAIA,EAAWhuC,EACXohC,GAAQphC,GACVC,EAAOpC,KAAKsrB,EAAOnpB,EAAO,GAE1BiuC,GAAU9kB,EAAOnpB,IAIvB,OAAOmpB,EAYT,SAASmY,GAAWwB,EAAOC,GACzB,OAAOD,EAAQhG,EAAYa,KAAkBoF,EAAQD,EAAQ,IAkC/D,SAASoL,GAAWtiB,EAAQ3uB,GAC1B,IAAI4sB,EAAS,GACb,IAAK+B,GAAU3uB,EAAI,GAASgjB,GAAJhjB,EACtB,OAAO4sB,EAIT,KACM5sB,EAAI,IACN4sB,GAAU+B,IAEZ3uB,EAAI6/B,EAAY7/B,EAAI,MAElB2uB,GAAUA,GAEL3uB,IAET,OAAO4sB,EAWT,SAASskB,GAASnlB,EAAMolB,GACtB,OAAOC,GAAYC,GAAStlB,EAAMolB,EAAOlD,IAAWliB,EAAO,IAU7D,SAASulB,GAAW3jB,GAClB,OAAOyW,GAAYjX,GAAOQ,IAW5B,SAAS4jB,GAAe5jB,EAAY3tB,GAClC,IAAIksB,EAAQiB,GAAOQ,GACnB,OAAO4W,GAAYrY,EAAOuY,GAAUzkC,EAAG,EAAGksB,EAAMrrB,SAalD,SAAS8vC,GAAQtiB,EAAQ+b,EAAMjiC,EAAO89B,GACpC,IAAK7D,GAAS/T,GACZ,OAAOA,EAST,IALA,IAAItrB,GAAS,EACTlC,GAHJupC,EAAOC,GAASD,EAAM/b,IAGJxtB,OACdy7B,EAAYz7B,EAAS,EACrB2wC,EAASnjB,EAEI,MAAVmjB,KAAoBzuC,EAAQlC,GAAQ,CACzC,IAAIgM,EAAMy9B,GAAMF,EAAKrnC,IACjBusC,EAAWnnC,EAEf,GAAY,cAAR0E,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOwhB,EAGT,GAAItrB,GAASu5B,EAAW,CACtB,IAAIyI,EAAWyM,EAAO3kC,IACtByiC,EAAWrJ,EAAaA,EAAWlB,EAAUl4B,EAAK2kC,GAAUxhC,MAC3CA,KACfs/B,EAAWlN,GAAS2C,GAChBA,EACCZ,GAAQiG,EAAKrnC,EAAQ,IAAM,GAAK,IAGzC+hC,GAAY0M,EAAQ3kC,EAAKyiC,GACzBkC,EAASA,EAAO3kC,GAElB,OAAOwhB,EAWT,IAAIojB,GAAetQ,GAAqB,SAASpV,EAAMjkB,GAErD,OADAq5B,GAAQ/E,IAAIrQ,EAAMjkB,GACXikB,GAFoBkiB,GAazByD,GAAmBrS,EAA4B,SAAStT,EAAM4C,GAChE,OAAO0Q,EAAetT,EAAM,WAAY,CACtCsZ,cAAgB,EAChBC,YAAc,EACdn9B,MAASwpC,GAAShjB,GAClB4W,UAAY,KALwB0I,GAgBxC,SAAS2D,GAAYjkB,GACnB,OAAO4W,GAAYpX,GAAOQ,IAY5B,SAASkkB,GAAU3lB,EAAOilB,EAAOW,GAC/B,IAAI/uC,GAAS,EACTlC,EAASqrB,EAAMrrB,OAEfswC,EAAQ,IACVA,EAAiBtwC,GAARswC,EAAiB,EAAKtwC,EAASswC,IAE1CW,EAAYjxC,EAANixC,EAAejxC,EAASixC,GACpB,IACRA,GAAOjxC,GAETA,EAAiBixC,EAARX,EAAc,EAAMW,EAAMX,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIvkB,EAAS5oB,EAAMnD,KACVkC,EAAQlC,GACf+rB,EAAO7pB,GAASmpB,EAAMnpB,EAAQouC,GAEhC,OAAOvkB,EAYT,SAASmlB,GAASpkB,EAAYlB,GAC5B,IAAIG,EAMJ,OAJAsY,GAASvX,EAAY,SAASxlB,EAAOpF,EAAO4qB,GAE1C,QADAf,EAASH,EAAUtkB,EAAOpF,EAAO4qB,QAG1Bf,EAeX,SAASolB,GAAgB9lB,EAAO/jB,EAAO8pC,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATjmB,EAAgBgmB,EAAMhmB,EAAMrrB,OAEvC,GAAoB,iBAATsH,GAAqBA,GAAUA,GAASgqC,GAn/H3BjvB,WAm/H0D,CAChF,KAAOgvB,EAAMC,GAAM,CACjB,IAAIC,EAAOF,EAAMC,IAAU,EACvB9J,EAAWnc,EAAMkmB,GAEJ,OAAb/J,IAAsBmB,GAASnB,KAC9B4J,EAAc5J,GAAYlgC,EAAUkgC,EAAWlgC,GAClD+pC,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAOD,EAET,OAAOE,GAAkBnmB,EAAO/jB,EAAO8lC,GAAUgE,GAgBnD,SAASI,GAAkBnmB,EAAO/jB,EAAOikB,EAAU6lB,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATjmB,EAAgB,EAAIA,EAAMrrB,OACrC,GAAa,IAATsxC,EACF,OAAO,EAST,IALA,IAAIG,GADJnqC,EAAQikB,EAASjkB,KACQA,EACrBoqC,EAAsB,OAAVpqC,EACZqqC,EAAchJ,GAASrhC,GACvBsqC,EAAiBtqC,IAAU6H,GAExBkiC,EAAMC,GAAM,CACjB,IAAIC,EAAMvS,GAAaqS,EAAMC,GAAQ,GACjC9J,EAAWjc,EAASF,EAAMkmB,IAC1BM,EAAerK,IAAar4B,GAC5B2iC,EAAyB,OAAbtK,EACZuK,EAAiBvK,GAAaA,EAC9BwK,EAAcrJ,GAASnB,GAE3B,GAAIiK,EACF,IAAIQ,EAASb,GAAcW,OAE3BE,EADSL,EACAG,IAAmBX,GAAcS,GACjCH,EACAK,GAAkBF,IAAiBT,IAAeU,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcV,IAAeY,IAChEF,IAAaE,IAGbZ,EAAc5J,GAAYlgC,EAAUkgC,EAAWlgC,GAEtD2qC,EACFZ,EAAME,EAAM,EAEZD,EAAOC,EAGX,OAAO7R,EAAU4R,EA1jICjvB,YAskIpB,SAAS6vB,GAAe7mB,EAAOE,GAM7B,IALA,IAAIrpB,GAAS,EACTlC,EAASqrB,EAAMrrB,OACf8rB,EAAW,EACXC,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdslC,EAAWjc,EAAWA,EAASjkB,GAASA,EAE5C,IAAKpF,IAAU6hC,GAAGyD,EAAUoD,GAAO,CACjC,IAAIA,EAAOpD,EACXzb,EAAOD,KAAwB,IAAVxkB,EAAc,EAAIA,GAG3C,OAAOykB,EAWT,SAASomB,GAAa7qC,GACpB,MAAoB,iBAATA,EACFA,EAELqhC,GAASrhC,GACJ8a,IAED9a,EAWV,SAAS8qC,GAAa9qC,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIhE,GAAQgE,GAEV,OAAO8kB,GAAS9kB,EAAO8qC,IAAgB,GAEzC,GAAIzJ,GAASrhC,GACX,OAAO25B,GAAiBA,GAAelhC,KAAKuH,GAAS,GAEvD,IAAIykB,EAAUzkB,EAAQ,GACtB,MAAkB,KAAVykB,GAAkB,EAAIzkB,IAAU,EAAA,EAAa,KAAOykB,EAY9D,SAASsmB,GAAShnB,EAAOE,EAAUY,GACjC,IAAIjqB,GAAS,EACTklC,EAAWpb,GACXhsB,EAASqrB,EAAMrrB,OACfqnC,GAAW,EACXtb,EAAS,GACT6e,EAAO7e,EAEX,GAAII,EACFkb,GAAW,EACXD,EAAWlb,QAER,GAjtIc,KAitIVlsB,EAA4B,CACnC,IAAIu7B,EAAMhQ,EAAW,KAAO+mB,GAAUjnB,GACtC,GAAIkQ,EACF,OAAOD,GAAWC,GAEpB8L,GAAW,EACXD,EAAWjZ,GACXyc,EAAO,IAAIlI,QAGXkI,EAAOrf,EAAW,GAAKQ,EAEzBwb,EACA,OAASrlC,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdslC,EAAWjc,EAAWA,EAASjkB,GAASA,EAG5C,GADAA,EAAS6kB,GAAwB,IAAV7kB,EAAeA,EAAQ,EAC1C+/B,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAI+K,EAAY3H,EAAK5qC,OACduyC,KACL,GAAI3H,EAAK2H,KAAe/K,EACtB,SAASD,EAGThc,GACFqf,EAAK/oC,KAAK2lC,GAEZzb,EAAOlqB,KAAKyF,QAEJ8/B,EAASwD,EAAMpD,EAAUrb,KAC7Bye,IAAS7e,GACX6e,EAAK/oC,KAAK2lC,GAEZzb,EAAOlqB,KAAKyF,IAGhB,OAAOykB,EAWT,SAASokB,GAAU3iB,EAAQ+b,GAGzB,OAAiB,OADjB/b,EAASsd,GAAOtd,EADhB+b,EAAOC,GAASD,EAAM/b,aAEUA,EAAOic,GAAMsB,GAAKxB,KAapD,SAASiJ,GAAWhlB,EAAQ+b,EAAMkJ,EAASrN,GACzC,OAAO0K,GAAQtiB,EAAQ+b,EAAMkJ,EAAQnJ,GAAQ9b,EAAQ+b,IAAQnE,GAc/D,SAASsN,GAAUrnB,EAAOO,EAAW+mB,EAAQzlB,GAI3C,IAHA,IAAIltB,EAASqrB,EAAMrrB,OACfkC,EAAQgrB,EAAYltB,GAAU,GAE1BktB,EAAYhrB,MAAYA,EAAQlC,IACtC4rB,EAAUP,EAAMnpB,GAAQA,EAAOmpB,KAEjC,OAAOsnB,EACH3B,GAAU3lB,EAAQ6B,EAAY,EAAIhrB,EAASgrB,EAAYhrB,EAAQ,EAAIlC,GACnEgxC,GAAU3lB,EAAQ6B,EAAYhrB,EAAQ,EAAI,EAAKgrB,EAAYltB,EAASkC,GAa1E,SAAS0wC,GAAiBtrC,EAAOurC,GAC/B,IAAI9mB,EAASzkB,EAIb,OAHIykB,aAAkBoV,KACpBpV,EAASA,EAAOzkB,SAEXilB,GAAYsmB,EAAS,SAAS9mB,EAAQ+mB,GAC3C,OAAOA,EAAO5nB,KAAK1oB,MAAMswC,EAAO3nB,QAASkB,GAAU,CAACN,GAAS+mB,EAAOzwC,QACnE0pB,GAaL,SAASgnB,GAAQzI,EAAQ/e,EAAUY,GACjC,IAAInsB,EAASsqC,EAAOtqC,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASqyC,GAAS/H,EAAO,IAAM,GAKxC,IAHA,IAAIpoC,GAAS,EACT6pB,EAAS5oB,EAAMnD,KAEVkC,EAAQlC,GAIf,IAHA,IAAIqrB,EAAQif,EAAOpoC,GACfsoC,GAAY,IAEPA,EAAWxqC,GACdwqC,GAAYtoC,IACd6pB,EAAO7pB,GAASilC,GAAepb,EAAO7pB,IAAUmpB,EAAOif,EAAOE,GAAWjf,EAAUY,IAIzF,OAAOkmB,GAASxJ,GAAY9c,EAAQ,GAAIR,EAAUY,GAYpD,SAAS6mB,GAAc9kB,EAAO5B,EAAQ2mB,GAMpC,IALA,IAAI/wC,GAAS,EACTlC,EAASkuB,EAAMluB,OACfkzC,EAAa5mB,EAAOtsB,OACpB+rB,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQpF,EAAQgxC,EAAa5mB,EAAOpqB,GAASiN,GACjD8jC,EAAWlnB,EAAQmC,EAAMhsB,GAAQoF,GAEnC,OAAOykB,EAUT,SAASonB,GAAoB7rC,GAC3B,OAAOqnC,GAAkBrnC,GAASA,EAAQ,GAU5C,SAAS8rC,GAAa9rC,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ8lC,GAW9C,SAAS5D,GAASliC,EAAOkmB,GACvB,OAAIlqB,GAAQgE,GACHA,EAEF4mC,GAAM5mC,EAAOkmB,GAAU,CAAClmB,GAAS+rC,GAAatW,GAASz1B,IAYhE,IAAIgsC,GAAWjD,GAWf,SAASkD,GAAUloB,EAAOilB,EAAOW,GAC/B,IAAIjxC,EAASqrB,EAAMrrB,OAEnB,OADAixC,EAAMA,IAAQ9hC,GAAYnP,EAASixC,GAC1BX,GAAgBtwC,GAAPixC,EAAiB5lB,EAAQ2lB,GAAU3lB,EAAOilB,EAAOW,GASrE,IAAIlsC,GAAe25B,GAAmB,SAASpzB,GAC7C,OAAOse,GAAK7kB,aAAauG,IAW3B,SAASu6B,GAAYQ,EAAQf,GAC3B,GAAIA,EACF,OAAOe,EAAO/jC,QAEhB,IAAItC,EAASqmC,EAAOrmC,OAChB+rB,EAAS8R,EAAcA,EAAY79B,GAAU,IAAIqmC,EAAO34B,YAAY1N,GAGxE,OADAqmC,EAAOmN,KAAKznB,GACLA,EAUT,SAASwa,GAAiBkN,GACxB,IAAI1nB,EAAS,IAAI0nB,EAAY/lC,YAAY+lC,EAAYhN,YAErD,OADA,IAAI7I,EAAW7R,GAAQwP,IAAI,IAAIqC,EAAW6V,IACnC1nB,EAgDT,SAAS2a,GAAgBgN,EAAYpO,GACnC,IAAIe,EAASf,EAASiB,GAAiBmN,EAAWrN,QAAUqN,EAAWrN,OACvE,OAAO,IAAIqN,EAAWhmC,YAAY24B,EAAQqN,EAAWlN,WAAYkN,EAAW1zC,QAW9E,SAAS0vC,GAAiBpoC,EAAO4iC,GAC/B,GAAI5iC,IAAU4iC,EAAO,CACnB,IAAIyJ,EAAersC,IAAU6H,GACzBuiC,EAAsB,OAAVpqC,EACZssC,EAAiBtsC,GAAUA,EAC3BqqC,EAAchJ,GAASrhC,GAEvBuqC,EAAe3H,IAAU/6B,GACzB2iC,EAAsB,OAAV5H,EACZ6H,EAAiB7H,GAAUA,EAC3B8H,EAAcrJ,GAASuB,GAE3B,IAAM4H,IAAcE,IAAgBL,GAAuBzH,EAAR5iC,GAC9CqqC,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B4B,GAAgB5B,IACjB6B,EACH,OAAO,EAET,IAAMlC,IAAcC,IAAgBK,GAAe1qC,EAAQ4iC,GACtD8H,GAAe2B,GAAgBC,IAAmBlC,IAAcC,GAChEG,GAAa6B,GAAgBC,IAC5B/B,GAAgB+B,IACjB7B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAAS8B,GAAYxxC,EAAMyxC,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAa7xC,EAAKrC,OAClBm0C,EAAgBJ,EAAQ/zC,OACxBo0C,GAAa,EACbC,EAAaP,EAAS9zC,OACtBs0C,EAAc7U,EAAUyU,EAAaC,EAAe,GACpDpoB,EAAS5oB,EAAMkxC,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBtoB,EAAOqoB,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BnoB,EAAOgoB,EAAQE,IAAc5xC,EAAK4xC,IAGtC,KAAOK,KACLvoB,EAAOqoB,KAAe/xC,EAAK4xC,KAE7B,OAAOloB,EAcT,SAASyoB,GAAiBnyC,EAAMyxC,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAa7xC,EAAKrC,OAClBy0C,GAAgB,EAChBN,EAAgBJ,EAAQ/zC,OACxB00C,GAAc,EACdC,EAAcb,EAAS9zC,OACvBs0C,EAAc7U,EAAUyU,EAAaC,EAAe,GACpDpoB,EAAS5oB,EAAMmxC,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBvoB,EAAOkoB,GAAa5xC,EAAK4xC,GAG3B,IADA,IAAIziC,EAASyiC,IACJS,EAAaC,GACpB5oB,EAAOva,EAASkjC,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BnoB,EAAOva,EAASuiC,EAAQU,IAAiBpyC,EAAK4xC,MAGlD,OAAOloB,EAWT,SAAS4X,GAAUlf,EAAQ4G,GACzB,IAAInpB,GAAS,EACTlC,EAASykB,EAAOzkB,OAGpB,IADAqrB,IAAUA,EAAQloB,EAAMnD,MACfkC,EAAQlC,GACfqrB,EAAMnpB,GAASuiB,EAAOviB,GAExB,OAAOmpB,EAaT,SAASkZ,GAAW9f,EAAQyJ,EAAOV,EAAQ4X,GACzC,IAAIwP,GAASpnB,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAItrB,GAAS,EACTlC,EAASkuB,EAAMluB,SAEVkC,EAAQlC,GAAQ,CACvB,IAAIgM,EAAMkiB,EAAMhsB,GAEZusC,EAAWrJ,EACXA,EAAW5X,EAAOxhB,GAAMyY,EAAOzY,GAAMA,EAAKwhB,EAAQ/I,GAClDtV,GAEAs/B,IAAat/B,KACfs/B,EAAWhqB,EAAOzY,IAEhB4oC,EACF5Q,GAAgBxW,EAAQxhB,EAAKyiC,GAE7BxK,GAAYzW,EAAQxhB,EAAKyiC,GAG7B,OAAOjhB,EAmCT,SAASqnB,GAAiBvpB,EAAQwpB,GAChC,OAAO,SAAShoB,EAAYvB,GAC1B,IAAIL,EAAO5nB,GAAQwpB,GAAc1B,GAAkBgZ,GAC/C5Y,EAAcspB,EAAcA,IAAgB,GAEhD,OAAO5pB,EAAK4B,EAAYxB,EAAQ6jB,GAAY5jB,EAAU,GAAIC,IAW9D,SAASupB,GAAeC,GACtB,OAAO3E,GAAS,SAAS7iB,EAAQynB,GAC/B,IAAI/yC,GAAS,EACTlC,EAASi1C,EAAQj1C,OACjBolC,EAAsB,EAATplC,EAAai1C,EAAQj1C,EAAS,GAAKmP,GAChD+lC,EAAiB,EAATl1C,EAAai1C,EAAQ,GAAK9lC,GAWtC,IATAi2B,EAAgC,EAAlB4P,EAASh1C,QAAmC,mBAAdolC,GACvCplC,IAAUolC,GACXj2B,GAEA+lC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD9P,EAAaplC,EAAS,EAAImP,GAAYi2B,EACtCplC,EAAS,GAEXwtB,EAASriB,EAAOqiB,KACPtrB,EAAQlC,GAAQ,CACvB,IAAIykB,EAASwwB,EAAQ/yC,GACjBuiB,GACFuwB,EAASxnB,EAAQ/I,EAAQviB,EAAOkjC,GAGpC,OAAO5X,IAYX,SAAS6a,GAAetb,EAAUG,GAChC,OAAO,SAASJ,EAAYvB,GAC1B,GAAkB,MAAduB,EACF,OAAOA,EAET,IAAKihB,GAAYjhB,GACf,OAAOC,EAASD,EAAYvB,GAM9B,IAJA,IAAIvrB,EAAS8sB,EAAW9sB,OACpBkC,EAAQgrB,EAAYltB,GAAU,EAC9Bo1C,EAAWjqC,EAAO2hB,IAEdI,EAAYhrB,MAAYA,EAAQlC,KACa,IAA/CurB,EAAS6pB,EAASlzC,GAAQA,EAAOkzC,KAIvC,OAAOtoB,GAWX,SAASoc,GAAchc,GACrB,OAAO,SAASM,EAAQjC,EAAUoe,GAMhC,IALA,IAAIznC,GAAS,EACTkzC,EAAWjqC,EAAOqiB,GAClBU,EAAQyb,EAASnc,GACjBxtB,EAASkuB,EAAMluB,OAEZA,KAAU,CACf,IAAIgM,EAAMkiB,EAAMhB,EAAYltB,IAAWkC,GACvC,IAA+C,IAA3CqpB,EAAS6pB,EAASppC,GAAMA,EAAKopC,GAC/B,MAGJ,OAAO5nB,GAgCX,SAAS6nB,GAAgB1wC,GACvB,OAAO,SAASmpB,GAGd,IAAIS,EAAayM,GAFjBlN,EAASiP,GAASjP,IAGd6N,GAAc7N,GACd3e,GAEA4rB,EAAMxM,EACNA,EAAW,GACXT,EAAO8N,OAAO,GAEd0Z,EAAW/mB,EACXglB,GAAUhlB,EAAY,GAAGpG,KAAK,IAC9B2F,EAAOxrB,MAAM,GAEjB,OAAOy4B,EAAIp2B,KAAgB2wC,GAW/B,SAASC,GAAiBnwC,GACxB,OAAO,SAAS0oB,GACd,OAAOvB,GAAYipB,GAAMC,GAAO3nB,GAAQroB,QAAQ6iB,GAAQ,KAAMljB,EAAU,KAY5E,SAASswC,GAAWpP,GAClB,OAAO,WAIL,IAAIjkC,EAAO2C,UACX,OAAQ3C,EAAKrC,QACX,KAAK,EAAG,OAAO,IAAIsmC,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKjkC,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIikC,EAAKjkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIszC,EAAcrU,GAAWgF,EAAK3lC,WAC9BorB,EAASua,EAAK9jC,MAAMmzC,EAAatzC,GAIrC,OAAOk/B,GAASxV,GAAUA,EAAS4pB,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAAS/oB,EAAYlB,EAAWqB,GACrC,IAAImoB,EAAWjqC,EAAO2hB,GACtB,IAAKihB,GAAYjhB,GAAa,CAC5B,IAAIvB,EAAW4jB,GAAYvjB,EAAW,GACtCkB,EAAasQ,GAAKtQ,GAClBlB,EAAY,SAAS5f,GAAO,OAAOuf,EAAS6pB,EAASppC,GAAMA,EAAKopC,IAElE,IAAIlzC,EAAQ2zC,EAAc/oB,EAAYlB,EAAWqB,GACjD,OAAgB,EAAT/qB,EAAakzC,EAAS7pB,EAAWuB,EAAW5qB,GAASA,GAASiN,IAWzE,SAAS2mC,GAAW5oB,GAClB,OAAO6oB,GAAS,SAASC,GACvB,IAAIh2C,EAASg2C,EAAMh2C,OACfkC,EAAQlC,EACRi2C,EAAS7U,GAAczgC,UAAUu1C,KAKrC,IAHIhpB,GACF8oB,EAAMjW,UAED79B,KAAS,CACd,IAAIgpB,EAAO8qB,EAAM9zC,GACjB,GAAmB,mBAARgpB,EACT,MAAM,IAAIuR,EAAU1a,IAEtB,GAAIk0B,IAAWE,GAAgC,WAArBC,GAAYlrB,GACpC,IAAIirB,EAAU,IAAI/U,GAAc,IAAI,GAIxC,IADAl/B,EAAQi0C,EAAUj0C,EAAQlC,IACjBkC,EAAQlC,GAAQ,CAGvB,IAAIq2C,EAAWD,GAFflrB,EAAO8qB,EAAM9zC,IAGT+E,EAAmB,WAAZovC,EAAwBC,GAAQprB,GAAQ/b,GAMjDgnC,EAJElvC,GAAQsvC,GAAWtvC,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGjH,QAAqB,GAAXiH,EAAK,GAElBkvC,EAAQC,GAAYnvC,EAAK,KAAKzE,MAAM2zC,EAASlvC,EAAK,IAElC,GAAfikB,EAAKlrB,QAAeu2C,GAAWrrB,GACtCirB,EAAQE,KACRF,EAAQD,KAAKhrB,GAGrB,OAAO,WACL,IAAI7oB,EAAO2C,UACPsC,EAAQjF,EAAK,GAEjB,GAAI8zC,GAA0B,GAAf9zC,EAAKrC,QAAesD,GAAQgE,GACzC,OAAO6uC,EAAQK,MAAMlvC,GAAOA,QAK9B,IAHA,IAAIpF,EAAQ,EACR6pB,EAAS/rB,EAASg2C,EAAM9zC,GAAOM,MAAMrB,KAAMkB,GAAQiF,IAE9CpF,EAAQlC,GACf+rB,EAASiqB,EAAM9zC,GAAOnC,KAAKoB,KAAM4qB,GAEnC,OAAOA,KAwBb,SAAS0qB,GAAavrB,EAAMia,EAASha,EAAS2oB,EAAUC,EAAS2C,EAAeC,EAAcC,EAAQpzC,EAAKqzC,GACzG,IAAIC,EAAQ3R,EAAUjjB,GAClB60B,EA5iKa,EA4iKJ5R,EACT6R,EA5iKiB,EA4iKL7R,EACZ6O,EAAsB,GAAV7O,EACZ8R,EAtiKa,IAsiKJ9R,EACTmB,EAAO0Q,EAAY7nC,GAAYumC,GAAWxqB,GA6C9C,OA3CA,SAASirB,IAKP,IAJA,IAAIn2C,EAASgF,UAAUhF,OACnBqC,EAAOc,EAAMnD,GACbkC,EAAQlC,EAELkC,KACLG,EAAKH,GAAS8C,UAAU9C,GAE1B,GAAI8xC,EACF,IAAI3Y,EAAc6b,GAAUf,GACxBgB,EAvhIZ,SAAsB9rB,EAAOgQ,GAI3B,IAHA,IAAIr7B,EAASqrB,EAAMrrB,OACf+rB,EAAS,EAEN/rB,KACDqrB,EAAMrrB,KAAYq7B,KAClBtP,EAGN,OAAOA,EA8gIkBqrB,CAAa/0C,EAAMg5B,GASxC,GAPIyY,IACFzxC,EAAOwxC,GAAYxxC,EAAMyxC,EAAUC,EAASC,IAE1C0C,IACFr0C,EAAOmyC,GAAiBnyC,EAAMq0C,EAAeC,EAAc3C,IAE7Dh0C,GAAUm3C,EACNnD,GAAah0C,EAAS62C,EAAO,CAC/B,IAAIQ,EAAajc,GAAe/4B,EAAMg5B,GACtC,OAAOic,GACLpsB,EAAMia,EAASsR,GAAcN,EAAQ9a,YAAalQ,EAClD9oB,EAAMg1C,EAAYT,EAAQpzC,EAAKqzC,EAAQ72C,GAG3C,IAAI21C,EAAcoB,EAAS5rB,EAAUhqB,KACjCogB,EAAKy1B,EAAYrB,EAAYzqB,GAAQA,EAczC,OAZAlrB,EAASqC,EAAKrC,OACV42C,EACFv0C,EAg4CN,SAAiBgpB,EAAO4kB,GAKtB,IAJA,IAAIsH,EAAYlsB,EAAMrrB,OAClBA,EAAS0/B,EAAUuQ,EAAQjwC,OAAQu3C,GACnCC,EAAW7T,GAAUtY,GAElBrrB,KAAU,CACf,IAAIkC,EAAQ+tC,EAAQjwC,GACpBqrB,EAAMrrB,GAAUsjC,GAAQphC,EAAOq1C,GAAaC,EAASt1C,GAASiN,GAEhE,OAAOkc,EAz4CIosB,CAAQp1C,EAAMu0C,GACZK,GAAmB,EAATj3C,GACnBqC,EAAK09B,UAEH+W,GAAStzC,EAAMxD,IACjBqC,EAAKrC,OAASwD,GAEZrC,MAAQA,OAASyoB,IAAQzoB,gBAAgBg1C,IAC3C50B,EAAK+kB,GAAQoP,GAAWn0B,IAEnBA,EAAG/e,MAAMmzC,EAAatzC,IAajC,SAASq1C,GAAepsB,EAAQqsB,GAC9B,OAAO,SAASnqB,EAAQjC,GACtB,OAh/DkBiC,EAg/DEA,EAh/DMlC,EAg/DEA,EAh/DMC,EAg/DEosB,EAAWpsB,GAh/DHC,EAg/Dc,GA/+D5D8c,GAAW9a,EAAQ,SAASlmB,EAAO0E,EAAKwhB,GACtClC,EAAOE,EAAaD,EAASjkB,GAAQ0E,EAAKwhB,KAErChC,EAJT,IAAsBgC,EAAQlC,EAAQC,EAAUC,GA4/DhD,SAASosB,GAAoBC,EAAUC,GACrC,OAAO,SAASxwC,EAAO4iC,GACrB,IAAIne,EACJ,GAAIzkB,IAAU6H,IAAa+6B,IAAU/6B,GACnC,OAAO2oC,EAKT,GAHIxwC,IAAU6H,KACZ4c,EAASzkB,GAEP4iC,IAAU/6B,GAAW,CACvB,GAAI4c,IAAW5c,GACb,OAAO+6B,EAIPA,EAFkB,iBAAT5iC,GAAqC,iBAAT4iC,GACrC5iC,EAAQ8qC,GAAa9qC,GACb8qC,GAAalI,KAErB5iC,EAAQ6qC,GAAa7qC,GACb6qC,GAAajI,IAEvBne,EAAS8rB,EAASvwC,EAAO4iC,GAE3B,OAAOne,GAWX,SAASgsB,GAAWC,GAClB,OAAOjC,GAAS,SAAS9G,GAEvB,OADAA,EAAY7iB,GAAS6iB,EAAWjhB,GAAUmhB,OACnCkB,GAAS,SAAShuC,GACvB,IAAI8oB,EAAUhqB,KACd,OAAO62C,EAAU/I,EAAW,SAAS1jB,GACnC,OAAO/oB,GAAM+oB,EAAUJ,EAAS9oB,SAexC,SAAS41C,GAAcj4C,EAAQk4C,GAG7B,IAAIC,GAFJD,EAAQA,IAAU/oC,GAAY,IAAMijC,GAAa8F,IAEzBl4C,OACxB,GAAIm4C,EAAc,EAChB,OAAOA,EAAc/H,GAAW8H,EAAOl4C,GAAUk4C,EAEnD,IAAInsB,EAASqkB,GAAW8H,EAAOpZ,EAAW9+B,EAASw7B,GAAW0c,KAC9D,OAAOld,GAAWkd,GACd3E,GAAU5X,GAAc5P,GAAS,EAAG/rB,GAAQmoB,KAAK,IACjD4D,EAAOzpB,MAAM,EAAGtC,GA6CtB,SAASo4C,GAAYlrB,GACnB,OAAO,SAASojB,EAAOW,EAAKoH,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBlD,GAAe7E,EAAOW,EAAKoH,KAChEpH,EAAMoH,EAAOlpC,IAGfmhC,EAAQgI,GAAShI,GACbW,IAAQ9hC,IACV8hC,EAAMX,EACNA,EAAQ,GAERW,EAAMqH,GAASrH,GA57CrB,SAAmBX,EAAOW,EAAKoH,EAAMnrB,GAKnC,IAJA,IAAIhrB,GAAS,EACTlC,EAASy/B,EAAUX,GAAYmS,EAAMX,IAAU+H,GAAQ,IAAK,GAC5DtsB,EAAS5oB,EAAMnD,GAEZA,KACL+rB,EAAOmB,EAAYltB,IAAWkC,GAASouC,EACvCA,GAAS+H,EAEX,OAAOtsB,EAs7CEwsB,CAAUjI,EAAOW,EADxBoH,EAAOA,IAASlpC,GAAamhC,EAAQW,EAAM,GAAK,EAAKqH,GAASD,GAC3BnrB,IAWvC,SAASsrB,GAA0BX,GACjC,OAAO,SAASvwC,EAAO4iC,GAKrB,MAJsB,iBAAT5iC,GAAqC,iBAAT4iC,IACvC5iC,EAAQmxC,GAASnxC,GACjB4iC,EAAQuO,GAASvO,IAEZ2N,EAASvwC,EAAO4iC,IAqB3B,SAASoN,GAAcpsB,EAAMia,EAASuT,EAAUrd,EAAalQ,EAAS2oB,EAAUC,EAAS6C,EAAQpzC,EAAKqzC,GACpG,IAAI8B,EArxKc,EAqxKJxT,EAMdA,GAAYwT,EAzxKQ,GACM,GAJF,GA6xKxBxT,KAAawT,EAzxKa,GADN,OA6xKlBxT,IAAW,GAEb,IAAIyT,EAAU,CACZ1tB,EAAMia,EAASha,EAVCwtB,EAAU7E,EAAW3kC,GAFtBwpC,EAAU5E,EAAU5kC,GAGdwpC,EAAUxpC,GAAY2kC,EAFvB6E,EAAUxpC,GAAY4kC,EAYzB6C,EAAQpzC,EAAKqzC,GAG5B9qB,EAAS2sB,EAASl2C,MAAM2M,GAAWypC,GAKvC,OAJIrC,GAAWrrB,IACb2tB,GAAQ9sB,EAAQ6sB,GAElB7sB,EAAOsP,YAAcA,EACdyd,GAAgB/sB,EAAQb,EAAMia,GAUvC,SAAS4T,GAAYp0C,GACnB,IAAIumB,EAAOviB,EAAKhE,GAChB,OAAO,SAASogC,EAAQiU,GAGtB,GAFAjU,EAAS0T,GAAS1T,IAClBiU,EAAyB,MAAbA,EAAoB,EAAItZ,EAAUuZ,GAAUD,GAAY,OACnD3Z,EAAe0F,GAAS,CAGvC,IAAImU,GAAQnc,GAASgI,GAAU,KAAKllB,MAAM,KAI1C,SADAq5B,GAAQnc,GAFI7R,EAAKguB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAKn5B,MAAM,MACvB,GAAK,MAAQq5B,EAAK,GAAKF,IAEvC,OAAO9tB,EAAK6Z,IAWhB,IAAIuN,GAAcnS,IAAQ,EAAI7E,GAAW,IAAI6E,GAAI,CAAC,EAAE,KAAK,IAxzK5C,EAAA,EAwzKsE,SAAS7T,GAC1F,OAAO,IAAI6T,GAAI7T,IAD2DzU,GAW5E,SAASshC,GAAcxP,GACrB,OAAO,SAASnc,GACd,IA5oIc+N,EACdr5B,EACA6pB,EApReyB,EA85IXkY,EAAMC,GAAOnY,GACjB,OAAIkY,GAAO5iB,GACFmY,GAAWzN,GAEhBkY,GAAOviB,IAhpIGoY,EAipIM/N,EAhpIpBtrB,GAAS,EACT6pB,EAAS5oB,MAAMo4B,EAAItyB,MAEvBsyB,EAAIl3B,QAAQ,SAASiD,GACnBykB,IAAS7pB,GAAS,CAACoF,EAAOA,KAErBykB,GAxRAK,GAo6IwBud,EAr6IZnc,EAq6IIA,GAp6IA,SAASxhB,GAC9B,MAAO,CAACA,EAAKwhB,EAAOxhB,OAg8ItB,SAASotC,GAAWluB,EAAMia,EAASha,EAAS2oB,EAAUC,EAAS6C,EAAQpzC,EAAKqzC,GAC1E,IAAIG,EAl4KiB,EAk4KL7R,EAChB,IAAK6R,GAA4B,mBAAR9rB,EACvB,MAAM,IAAIuR,EAAU1a,IAEtB,IAAI/hB,EAAS8zC,EAAWA,EAAS9zC,OAAS,EAS1C,GARKA,IACHmlC,IAAW,GACX2O,EAAWC,EAAU5kC,IAEvB3L,EAAMA,IAAQ2L,GAAY3L,EAAMi8B,EAAUwZ,GAAUz1C,GAAM,GAC1DqzC,EAAQA,IAAU1nC,GAAY0nC,EAAQoC,GAAUpC,GAChD72C,GAAU+zC,EAAUA,EAAQ/zC,OAAS,EAx4KX,GA04KtBmlC,EAAmC,CACrC,IAAIuR,EAAgB5C,EAChB6C,EAAe5C,EAEnBD,EAAWC,EAAU5kC,GAEvB,IAjNqB+b,EAAeC,EAAS2oB,EACzCiD,EACAzQ,EA7Repb,EAAMia,EAAS0R,EAC9BvQ,EA9Fcpb,EAAeC,EAC7B4rB,EACAzQ,EAukBAr/B,EAAO+vC,EAAY7nC,GAAYmnC,GAAQprB,GAEvC0tB,EAAU,CACZ1tB,EAAMia,EAASha,EAAS2oB,EAAUC,EAAS2C,EAAeC,EAC1DC,EAAQpzC,EAAKqzC,GAkBf,GAfI5vC,GA26BN,SAAmBA,EAAMwd,GACvB,IAAI0gB,EAAUl+B,EAAK,GACfoyC,EAAa50B,EAAO,GACpB60B,EAAanU,EAAUkU,EACvBhS,EAAWiS,EAAa,IAExBC,EACAF,GAAcn3B,IA50MA,GA40MmBijB,GACjCkU,GAAcn3B,IAx0MA,KAw0MmBijB,GAAgCl+B,EAAK,GAAGjH,QAAUykB,EAAO,IAC5E,KAAd40B,GAAqD50B,EAAO,GAAGzkB,QAAUykB,EAAO,IA90MlE,GA80M0E0gB,EAG5F,GAAMkC,GAAYkS,EAAlB,CAp1MiB,EAw1MbF,IACFpyC,EAAK,GAAKwd,EAAO,GAEjB60B,GA31Me,EA21MDnU,EAA2B,EAz1MnB,GA41MxB,IAAI79B,EAAQmd,EAAO,GACnB,GAAInd,EAAO,CACT,IAAIwsC,EAAW7sC,EAAK,GACpBA,EAAK,GAAK6sC,EAAWD,GAAYC,EAAUxsC,EAAOmd,EAAO,IAAMnd,EAC/DL,EAAK,GAAK6sC,EAAW1Y,GAAen0B,EAAK,GAAIgb,IAAewC,EAAO,IAGrEnd,EAAQmd,EAAO,MAEbqvB,EAAW7sC,EAAK,GAChBA,EAAK,GAAK6sC,EAAWU,GAAiBV,EAAUxsC,EAAOmd,EAAO,IAAMnd,EACpEL,EAAK,GAAK6sC,EAAW1Y,GAAen0B,EAAK,GAAIgb,IAAewC,EAAO,KAGrEnd,EAAQmd,EAAO,MAEbxd,EAAK,GAAKK,GAGR+xC,EAAan3B,KACfjb,EAAK,GAAgB,MAAXA,EAAK,GAAawd,EAAO,GAAKib,EAAUz4B,EAAK,GAAIwd,EAAO,KAGrD,MAAXxd,EAAK,KACPA,EAAK,GAAKwd,EAAO,IAGnBxd,EAAK,GAAKwd,EAAO,GACjBxd,EAAK,GAAKqyC,GA59BRE,CAAUZ,EAAS3xC,GAErBikB,EAAO0tB,EAAQ,GACfzT,EAAUyT,EAAQ,GAClBztB,EAAUytB,EAAQ,GAClB9E,EAAW8E,EAAQ,GACnB7E,EAAU6E,EAAQ,KAClB/B,EAAQ+B,EAAQ,GAAKA,EAAQ,KAAOzpC,GAC/B6nC,EAAY,EAAI9rB,EAAKlrB,OACtBy/B,EAAUmZ,EAAQ,GAAK54C,EAAQ,KAEX,GAAVmlC,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGdpZ,EA56KgB,GA26KPoZ,GA16Ka,IA06KiBA,GApgBhBA,EAqgBIA,EArgBK0R,EAqgBIA,EApgBlCvQ,EAAOoP,GADQxqB,EAqgBIA,GAlgBvB,SAASirB,IAMP,IALA,IAAIn2C,EAASgF,UAAUhF,OACnBqC,EAAOc,EAAMnD,GACbkC,EAAQlC,EACRq7B,EAAc6b,GAAUf,GAErBj0C,KACLG,EAAKH,GAAS8C,UAAU9C,GAE1B,IAAI6xC,EAAW/zC,EAAS,GAAKqC,EAAK,KAAOg5B,GAAeh5B,EAAKrC,EAAS,KAAOq7B,EACzE,GACAD,GAAe/4B,EAAMg5B,GAGzB,OADAr7B,GAAU+zC,EAAQ/zC,QACL62C,EACJS,GACLpsB,EAAMia,EAASsR,GAAcN,EAAQ9a,YAAalsB,GAClD9M,EAAM0xC,EAAS5kC,GAAWA,GAAW0nC,EAAQ72C,GAG1CwC,GADGrB,MAAQA,OAASyoB,IAAQzoB,gBAAgBg1C,EAAW7P,EAAOpb,EACpD/pB,KAAMkB,KA57JL,IA26KR8iC,GAA2C,IAAXA,GAAqD4O,EAAQ/zC,OAG9Fy2C,GAAaj0C,MAAM2M,GAAWypC,IA9OLztB,EA4OIA,EA5OK2oB,EA4OIA,EA3O7CiD,EAtsKa,EAi7Kc5R,EA1O3BmB,EAAOoP,GAFUxqB,EA4OIA,GAxOzB,SAASirB,IAQP,IAPA,IAAIlC,GAAa,EACbC,EAAalvC,UAAUhF,OACvBo0C,GAAa,EACbC,EAAaP,EAAS9zC,OACtBqC,EAAOc,EAAMkxC,EAAaH,GAC1B3yB,EAAMpgB,MAAQA,OAASyoB,IAAQzoB,gBAAgBg1C,EAAW7P,EAAOpb,IAE5DkpB,EAAYC,GACnBhyC,EAAK+xC,GAAaN,EAASM,GAE7B,KAAOF,KACL7xC,EAAK+xC,KAAepvC,YAAYivC,GAElC,OAAOzxC,GAAM+e,EAAIw1B,EAAS5rB,EAAUhqB,KAAMkB,UAsN1C,IAAI0pB,GAhmB2BZ,EAgmBQA,EA/lBrC4rB,EA90Ja,EA66Ke5R,EA9lB5BmB,EAAOoP,GAFOxqB,EAgmBQA,GA5lB1B,SAASirB,IAEP,OADUh1C,MAAQA,OAASyoB,IAAQzoB,gBAAgBg1C,EAAW7P,EAAOpb,GAC3D1oB,MAAMu0C,EAAS5rB,EAAUhqB,KAAM6D,aAmmB3C,OAAO8zC,IADM7xC,EAAO2pC,GAAciI,IACJ9sB,EAAQ6sB,GAAU1tB,EAAMia,GAexD,SAASsU,GAAuBvV,EAAU8I,EAAUhhC,EAAKwhB,GACvD,OAAI0W,IAAa/0B,IACZ40B,GAAGG,EAAUtH,EAAY5wB,MAAUgxB,EAAej9B,KAAKytB,EAAQxhB,GAC3DghC,EAEF9I,EAiBT,SAASwV,GAAoBxV,EAAU8I,EAAUhhC,EAAKwhB,EAAQ/I,EAAQ4gB,GAOpE,OANI9D,GAAS2C,IAAa3C,GAASyL,KAEjC3H,EAAM9J,IAAIyR,EAAU9I,GACpBmK,GAAUnK,EAAU8I,EAAU79B,GAAWuqC,GAAqBrU,GAC9DA,EAAc,OAAE2H,IAEX9I,EAYT,SAASyV,GAAgBryC,GACvB,OAAOsnC,GAActnC,GAAS6H,GAAY7H,EAgB5C,SAASokC,GAAYrgB,EAAO6e,EAAO/E,EAASC,EAAY8F,EAAW7F,GACjE,IAAIuG,EApgLmB,EAogLPzG,EACZoS,EAAYlsB,EAAMrrB,OAClBuqC,EAAYL,EAAMlqC,OAEtB,GAAIu3C,GAAahN,KAAeqB,GAAyB2L,EAAZhN,GAC3C,OAAO,EAGT,IAAIqP,EAAavU,EAAMP,IAAIzZ,GACvBghB,EAAahH,EAAMP,IAAIoF,GAC3B,GAAI0P,GAAcvN,EAChB,OAAOuN,GAAc1P,GAASmC,GAAchhB,EAE9C,IAAInpB,GAAS,EACT6pB,GAAS,EACT6e,EAlhLqB,EAkhLbzF,EAAoC,IAAIzC,GAAWvzB,GAM/D,IAJAk2B,EAAM9J,IAAIlQ,EAAO6e,GACjB7E,EAAM9J,IAAI2O,EAAO7e,KAGRnpB,EAAQq1C,GAAW,CAC1B,IAAIsC,EAAWxuB,EAAMnpB,GACjBqqC,EAAWrC,EAAMhoC,GAErB,GAAIkjC,EACF,IAAIoH,EAAWZ,EACXxG,EAAWmH,EAAUsN,EAAU33C,EAAOgoC,EAAO7e,EAAOga,GACpDD,EAAWyU,EAAUtN,EAAUrqC,EAAOmpB,EAAO6e,EAAO7E,GAE1D,GAAImH,IAAar9B,GAAW,CAC1B,GAAIq9B,EACF,SAEFzgB,GAAS,EACT,MAGF,GAAI6e,GACF,IAAKle,GAAUwd,EAAO,SAASqC,EAAU/B,GACnC,IAAKrc,GAASyc,EAAMJ,KACfqP,IAAatN,GAAYrB,EAAU2O,EAAUtN,EAAUpH,EAASC,EAAYC,IAC/E,OAAOuF,EAAK/oC,KAAK2oC,KAEjB,CACNze,GAAS,EACT,YAEG,GACD8tB,IAAatN,IACXrB,EAAU2O,EAAUtN,EAAUpH,EAASC,EAAYC,GACpD,CACLtZ,GAAS,EACT,OAKJ,OAFAsZ,EAAc,OAAEha,GAChBga,EAAc,OAAE6E,GACTne,EA0KT,SAASgqB,GAAS7qB,GAChB,OAAOqlB,GAAYC,GAAStlB,EAAM/b,GAAW2qC,IAAU5uB,EAAO,IAUhE,SAAS6b,GAAWvZ,GAClB,OAAOkc,GAAelc,EAAQ4P,GAAM6I,IAWtC,SAASa,GAAatZ,GACpB,OAAOkc,GAAelc,EAAQuY,GAAQC,IAUxC,IAAIsQ,GAAWhW,GAAiB,SAASpV,GACvC,OAAOoV,GAAQwE,IAAI5Z,IADIrT,GAWzB,SAASu+B,GAAYlrB,GAKnB,IAJA,IAAIa,EAAUb,EAAKpN,KAAO,GACtBuN,EAAQkV,GAAUxU,GAClB/rB,EAASg9B,EAAej9B,KAAKwgC,GAAWxU,GAAUV,EAAMrrB,OAAS,EAE9DA,KAAU,CACf,IAAIiH,EAAOokB,EAAMrrB,GACb+5C,EAAY9yC,EAAKikB,KACrB,GAAiB,MAAb6uB,GAAqBA,GAAa7uB,EACpC,OAAOjkB,EAAK6W,KAGhB,OAAOiO,EAUT,SAASmrB,GAAUhsB,GAEjB,OADa8R,EAAej9B,KAAK+hB,GAAQ,eAAiBA,GAASoJ,GACrDmQ,YAchB,SAAS8T,KACP,IAAIpjB,EAASjK,GAAOyJ,UAAYA,GAEhC,OADAQ,EAASA,IAAWR,GAAW4hB,GAAephB,EACvC/mB,UAAUhF,OAAS+rB,EAAO/mB,UAAU,GAAIA,UAAU,IAAM+mB,EAWjE,SAASmc,GAAWxuB,EAAK1N,GACvB,IAgYiB1E,EACbrD,EAjYAgD,EAAOyS,EAAIipB,SACf,OAiYgB,WADZ1+B,SADaqD,EA/XA0E,KAiYmB,UAAR/H,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVqD,EACU,OAAVA,GAlYDL,EAAmB,iBAAP+E,EAAkB,SAAW,QACzC/E,EAAKyS,IAUX,SAASs0B,GAAaxgB,GAIpB,IAHA,IAAIzB,EAASqR,GAAK5P,GACdxtB,EAAS+rB,EAAO/rB,OAEbA,KAAU,CACf,IAAIgM,EAAM+f,EAAO/rB,GACbsH,EAAQkmB,EAAOxhB,GAEnB+f,EAAO/rB,GAAU,CAACgM,EAAK1E,EAAO6mC,GAAmB7mC,IAEnD,OAAOykB,EAWT,SAAS0S,GAAUjR,EAAQxhB,GACzB,IAlxJcwhB,EAAQxhB,EAkxJlB1E,GAlxJkB0E,EAkxJOA,EAjxJd,OADDwhB,EAkxJOA,GAjxJCre,GAAYqe,EAAOxhB,IAkxJzC,OAAOkhC,GAAa5lC,GAASA,EAAQ6H,GAqCvC,IAAI82B,GAAchH,EAA+B,SAASzR,GACxD,OAAc,MAAVA,EACK,IAETA,EAASriB,EAAOqiB,GACT3B,GAAYoT,EAAiBzR,GAAS,SAAS0Y,GACpD,OAAOjI,EAAqBl+B,KAAKytB,EAAQ0Y,OANR8T,GAiBjChU,GAAgB/G,EAA+B,SAASzR,GAE1D,IADA,IAAIzB,EAAS,GACNyB,GACLnB,GAAUN,EAAQka,GAAWzY,IAC7BA,EAASsQ,EAAatQ,GAExB,OAAOzB,GAN8BiuB,GAgBnCrU,GAASkE,GA2Eb,SAASoQ,GAAQzsB,EAAQ+b,EAAM2Q,GAO7B,IAJA,IAAIh4C,GAAS,EACTlC,GAHJupC,EAAOC,GAASD,EAAM/b,IAGJxtB,OACd+rB,GAAS,IAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIgM,EAAMy9B,GAAMF,EAAKrnC,IACrB,KAAM6pB,EAAmB,MAAVyB,GAAkB0sB,EAAQ1sB,EAAQxhB,IAC/C,MAEFwhB,EAASA,EAAOxhB,GAElB,OAAI+f,KAAY7pB,GAASlC,EAChB+rB,KAET/rB,EAAmB,MAAVwtB,EAAiB,EAAIA,EAAOxtB,SAClBm6C,GAASn6C,IAAWsjC,GAAQt3B,EAAKhM,KACjDsD,GAAQkqB,IAAW0V,GAAY1V,IA6BpC,SAASsY,GAAgBtY,GACvB,MAAqC,mBAAtBA,EAAO9f,aAA8B+/B,GAAYjgB,GAE5D,GADA8T,GAAWxD,EAAatQ,IA8E9B,SAASwb,GAAc1hC,GACrB,OAAOhE,GAAQgE,IAAU47B,GAAY57B,OAChC42B,GAAoB52B,GAASA,EAAM42B,IAW1C,SAASoF,GAAQh8B,EAAOtH,GACtB,IAAIiE,SAAcqD,EAGlB,SAFAtH,EAAmB,MAAVA,EAAiBmiB,GAAmBniB,KAGlC,UAARiE,GACU,UAARA,GAAoBgiB,GAAS3G,KAAKhY,MACvB,EAATA,GAAcA,EAAQ,GAAK,GAAKA,EAAQtH,EAajD,SAASm1C,GAAe7tC,EAAOpF,EAAOsrB,GACpC,IAAK+T,GAAS/T,GACZ,OAAO,EAET,IAAIvpB,SAAc/B,EAClB,SAAY,UAAR+B,EACK8pC,GAAYvgB,IAAW8V,GAAQphC,EAAOsrB,EAAOxtB,QACrC,UAARiE,GAAoB/B,KAASsrB,IAE7BuW,GAAGvW,EAAOtrB,GAAQoF,GAa7B,SAAS4mC,GAAM5mC,EAAOkmB,GACpB,GAAIlqB,GAAQgE,GACV,OAAO,EAET,IAAIrD,SAAcqD,EAClB,QAAY,UAARrD,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATqD,IAAiBqhC,GAASrhC,KAGvByd,GAAczF,KAAKhY,KAAWwd,GAAaxF,KAAKhY,IAC1C,MAAVkmB,GAAkBlmB,KAAS6D,EAAOqiB,GAyBvC,SAAS+oB,GAAWrrB,GAClB,IAAImrB,EAAWD,GAAYlrB,GACvBgf,EAAQpoB,GAAOu0B,GAEnB,GAAoB,mBAATnM,KAAyBmM,KAAYlV,GAAYxgC,WAC1D,OAAO,EAET,GAAIuqB,IAASgf,EACX,OAAO,EAET,IAAIjjC,EAAOqvC,GAAQpM,GACnB,QAASjjC,GAAQikB,IAASjkB,EAAK,IA7S5B+4B,GAAY2F,GAAO,IAAI3F,EAAS,IAAIoa,YAAY,MAAQ52B,IACxDyc,GAAO0F,GAAO,IAAI1F,IAAQnd,IAC1Bod,IAAWyF,GAAOzF,GAAQma,YAAcp3B,IACxCkd,IAAOwF,GAAO,IAAIxF,KAAQhd,IAC1Bid,IAAWuF,GAAO,IAAIvF,KAAY9c,MACrCqiB,GAAS,SAASr+B,GAChB,IAAIykB,EAAS8d,GAAWviC,GACpBg/B,EAAOva,GAAU/I,GAAY1b,EAAMoG,YAAcyB,GACjDmrC,EAAahU,EAAO7F,GAAS6F,GAAQ,GAEzC,GAAIgU,EACF,OAAQA,GACN,KAAK9Z,GAAoB,OAAOhd,GAChC,KAAKkd,GAAe,OAAO5d,GAC3B,KAAK6d,GAAmB,OAAO1d,GAC/B,KAAK2d,GAAe,OAAOzd,GAC3B,KAAK0d,GAAmB,OAAOvd,GAGnC,OAAOyI,IA+SX,IAAIwuB,GAAa1d,EAAawM,GAAamR,GAS3C,SAAS/M,GAAYnmC,GACnB,IAAIg/B,EAAOh/B,GAASA,EAAMoG,YAG1B,OAAOpG,KAFqB,mBAARg/B,GAAsBA,EAAK3lC,WAAci8B,GAa/D,SAASuR,GAAmB7mC,GAC1B,OAAOA,GAAUA,IAAUi6B,GAASj6B,GAYtC,SAAS2mC,GAAwBjiC,EAAKghC,GACpC,OAAO,SAASxf,GACd,OAAc,MAAVA,GAGGA,EAAOxhB,KAASghC,IACpBA,IAAa79B,IAAcnD,KAAOb,EAAOqiB,KAsIhD,SAASgjB,GAAStlB,EAAMolB,EAAO19B,GAE7B,OADA09B,EAAQ7Q,EAAU6Q,IAAUnhC,GAAa+b,EAAKlrB,OAAS,EAAKswC,EAAO,GAC5D,WAML,IALA,IAAIjuC,EAAO2C,UACP9C,GAAS,EACTlC,EAASy/B,EAAUp9B,EAAKrC,OAASswC,EAAO,GACxCjlB,EAAQloB,EAAMnD,KAETkC,EAAQlC,GACfqrB,EAAMnpB,GAASG,EAAKiuC,EAAQpuC,GAE9BA,GAAS,EAET,IADA,IAAIu4C,EAAYt3C,EAAMmtC,EAAQ,KACrBpuC,EAAQouC,GACfmK,EAAUv4C,GAASG,EAAKH,GAG1B,OADAu4C,EAAUnK,GAAS19B,EAAUyY,GACtB7oB,GAAM0oB,EAAM/pB,KAAMs5C,IAY7B,SAAS3P,GAAOtd,EAAQ+b,GACtB,OAAOA,EAAKvpC,OAAS,EAAIwtB,EAAS8b,GAAQ9b,EAAQwjB,GAAUzH,EAAM,GAAI,IAiCxE,SAASiF,GAAQhhB,EAAQxhB,GACvB,IAAY,gBAARA,GAAgD,mBAAhBwhB,EAAOxhB,KAIhC,aAAPA,EAIJ,OAAOwhB,EAAOxhB,GAiBhB,IAAI6sC,GAAU6B,GAAS9J,IAUnB1rC,GAAa25B,GAAiB,SAAS3T,EAAMgc,GAC/C,OAAOtd,GAAK1kB,WAAWgmB,EAAMgc,IAW3BqJ,GAAcmK,GAAS7J,IAY3B,SAASiI,GAAgB3C,EAASwE,EAAWxV,GAC3C,IAsHyByV,EAASzV,EA1qB9Bz/B,EAojBA+e,EAAUk2B,EAAY,GAC1B,OAAOpK,GAAY4F,EA1brB,SAA2B1xB,EAAQm2B,GACjC,IAAI56C,EAAS46C,EAAQ56C,OACrB,IAAKA,EACH,OAAOykB,EAET,IAAIgX,EAAYz7B,EAAS,EAGzB,OAFA46C,EAAQnf,IAAuB,EAATz7B,EAAa,KAAO,IAAM46C,EAAQnf,GACxDmf,EAAUA,EAAQzyB,KAAc,EAATnoB,EAAa,KAAO,KACpCykB,EAAOhf,QAAQ4f,GAAe,uBAAyBu1B,EAAU,UAkb5CC,CAAkBp2B,GArjB1C/e,EAqjBmF+e,EArjBpE/e,MAAM4f,IA0qBAs1B,EAzqBlBl1C,EAAQA,EAAM,GAAGma,MAAM0F,IAAkB,GAyqBd4f,EArH8DA,EAsHhG1Z,GAAUnJ,GAAW,SAAS42B,GAC5B,IAAI5xC,EAAQ,KAAO4xC,EAAK,GACnB/T,EAAU+T,EAAK,KAAQltB,GAAc4uB,EAAStzC,IACjDszC,EAAQ/4C,KAAKyF,KAGVszC,EAAQ75B,UAhHjB,SAAS25B,GAASxvB,GAChB,IAAI7P,EAAQ,EACRy/B,EAAa,EAEjB,OAAO,WACL,IAAIxpC,EAAQquB,IACRob,EApiNK,IAoiNmBzpC,EAAQwpC,GAGpC,GADAA,EAAaxpC,EACG,EAAZypC,GACF,GAziNQ,OAyiNF1/B,EACJ,OAAOrW,UAAU,QAGnBqW,EAAQ,EAEV,OAAO6P,EAAK1oB,MAAM2M,GAAWnK,YAYjC,SAAS0+B,GAAYrY,EAAOpiB,GAC1B,IAAI/G,GAAS,EACTlC,EAASqrB,EAAMrrB,OACfy7B,EAAYz7B,EAAS,EAGzB,IADAiJ,EAAOA,IAASkG,GAAYnP,EAASiJ,IAC5B/G,EAAQ+G,GAAM,CACrB,IAAI+xC,EAAOxX,GAAWthC,EAAOu5B,GACzBn0B,EAAQ+jB,EAAM2vB,GAElB3vB,EAAM2vB,GAAQ3vB,EAAMnpB,GACpBmpB,EAAMnpB,GAASoF,EAGjB,OADA+jB,EAAMrrB,OAASiJ,EACRoiB,EAUT,IAtTMU,GAOAqC,GA+SFilB,IA/SEjlB,IAPArC,GAASkvB,GAsTkB,SAASntB,GACxC,IAAI/B,EAAS,GAOb,OAN6B,KAAzB+B,EAAOotB,WAAW,IACpBnvB,EAAOlqB,KAAK,IAEdisB,EAAOroB,QAAQuf,GAAY,SAAStf,EAAOq/B,EAAQoW,EAAOC,GACxDrvB,EAAOlqB,KAAKs5C,EAAQC,EAAU31C,QAAQigB,GAAc,MAASqf,GAAUr/B,KAElEqmB,GA9ToB,SAAS/f,GAIlC,OAh0MiB,MA6zMboiB,GAAMnlB,MACRmlB,GAAMkU,QAEDt2B,KAGUoiB,MACZrC,IAgUT,SAAS0d,GAAMniC,GACb,GAAoB,iBAATA,GAAqBqhC,GAASrhC,GACvC,OAAOA,EAET,IAAIykB,EAAUzkB,EAAQ,GACtB,MAAkB,KAAVykB,GAAkB,EAAIzkB,IAAU,EAAA,EAAa,KAAOykB,EAU9D,SAAS0U,GAASvV,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO4R,EAAa/8B,KAAKmrB,GACzB,MAAOhsB,IACT,IACE,OAAQgsB,EAAO,GACf,MAAOhsB,KAEX,MAAO,GA4BT,SAASmiC,GAAa8U,GACpB,GAAIA,aAAmBhV,GACrB,OAAOgV,EAAQkF,QAEjB,IAAItvB,EAAS,IAAIqV,GAAc+U,EAAQzU,YAAayU,EAAQvU,WAI5D,OAHA7V,EAAO4V,YAAcgC,GAAUwS,EAAQxU,aACvC5V,EAAO8V,UAAasU,EAAQtU,UAC5B9V,EAAO+V,WAAaqU,EAAQrU,WACrB/V,EAsIT,IAAIuvB,GAAajL,GAAS,SAAShlB,EAAOiB,GACxC,OAAOqiB,GAAkBtjB,GACrB8b,GAAe9b,EAAOwd,GAAYvc,EAAQ,EAAGqiB,IAAmB,IAChE,KA6BF4M,GAAelL,GAAS,SAAShlB,EAAOiB,GAC1C,IAAIf,EAAWwf,GAAKze,GAIpB,OAHIqiB,GAAkBpjB,KACpBA,EAAWpc,IAENw/B,GAAkBtjB,GACrB8b,GAAe9b,EAAOwd,GAAYvc,EAAQ,EAAGqiB,IAAmB,GAAOQ,GAAY5jB,EAAU,IAC7F,KA0BFiwB,GAAiBnL,GAAS,SAAShlB,EAAOiB,GAC5C,IAAIH,EAAa4e,GAAKze,GAItB,OAHIqiB,GAAkBxiB,KACpBA,EAAahd,IAERw/B,GAAkBtjB,GACrB8b,GAAe9b,EAAOwd,GAAYvc,EAAQ,EAAGqiB,IAAmB,GAAOx/B,GAAWgd,GAClF,KAsON,SAASsvB,GAAUpwB,EAAOO,EAAWqB,GACnC,IAAIjtB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIkC,EAAqB,MAAb+qB,EAAoB,EAAIgsB,GAAUhsB,GAI9C,OAHI/qB,EAAQ,IACVA,EAAQu9B,EAAUz/B,EAASkC,EAAO,IAE7B8qB,GAAc3B,EAAO8jB,GAAYvjB,EAAW,GAAI1pB,GAsCzD,SAASw5C,GAAcrwB,EAAOO,EAAWqB,GACvC,IAAIjtB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIkC,EAAQlC,EAAS,EAOrB,OANIitB,IAAc9d,KAChBjN,EAAQ+2C,GAAUhsB,GAClB/qB,EAAQ+qB,EAAY,EAChBwS,EAAUz/B,EAASkC,EAAO,GAC1Bw9B,EAAUx9B,EAAOlC,EAAS,IAEzBgtB,GAAc3B,EAAO8jB,GAAYvjB,EAAW,GAAI1pB,GAAO,GAiBhE,SAAS43C,GAAQzuB,GAEf,OADsB,MAATA,GAAoBA,EAAMrrB,OACvB6oC,GAAYxd,EAAO,GAAK,GAgG1C,SAASswB,GAAKtwB,GACZ,OAAQA,GAASA,EAAMrrB,OAAUqrB,EAAM,GAAKlc,GA0E9C,IAAIysC,GAAevL,GAAS,SAAS/F,GACnC,IAAIuR,EAASzvB,GAASke,EAAQ6I,IAC9B,OAAQ0I,EAAO77C,QAAU67C,EAAO,KAAOvR,EAAO,GAC1CD,GAAiBwR,GACjB,KA0BFC,GAAiBzL,GAAS,SAAS/F,GACrC,IAAI/e,EAAWwf,GAAKT,GAChBuR,EAASzvB,GAASke,EAAQ6I,IAO9B,OALI5nB,IAAawf,GAAK8Q,GACpBtwB,EAAWpc,GAEX0sC,EAAO7T,MAED6T,EAAO77C,QAAU67C,EAAO,KAAOvR,EAAO,GAC1CD,GAAiBwR,EAAQ1M,GAAY5jB,EAAU,IAC/C,KAwBFwwB,GAAmB1L,GAAS,SAAS/F,GACvC,IAAIne,EAAa4e,GAAKT,GAClBuR,EAASzvB,GAASke,EAAQ6I,IAM9B,OAJAhnB,EAAkC,mBAAdA,EAA2BA,EAAahd,KAE1D0sC,EAAO7T,MAED6T,EAAO77C,QAAU67C,EAAO,KAAOvR,EAAO,GAC1CD,GAAiBwR,EAAQ1sC,GAAWgd,GACpC,KAoCN,SAAS4e,GAAK1f,GACZ,IAAIrrB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAOA,EAASqrB,EAAMrrB,EAAS,GAAKmP,GAuFtC,IAAI6sC,GAAO3L,GAAS4L,IAsBpB,SAASA,GAAQ5wB,EAAOiB,GACtB,OAAQjB,GAASA,EAAMrrB,QAAUssB,GAAUA,EAAOtsB,OAC9C+vC,GAAY1kB,EAAOiB,GACnBjB,EAqFN,IAAI6wB,GAASnG,GAAS,SAAS1qB,EAAO4kB,GACpC,IAAIjwC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACnC+rB,EAAS4Y,GAAOtZ,EAAO4kB,GAM3B,OAJAD,GAAW3kB,EAAOe,GAAS6jB,EAAS,SAAS/tC,GAC3C,OAAOohC,GAAQphC,EAAOlC,IAAWkC,EAAQA,IACxC6e,KAAK2uB,KAED3jB,IA2ET,SAASgU,GAAQ1U,GACf,OAAgB,MAATA,EAAgBA,EAAQyU,EAAc//B,KAAKsrB,GAkapD,IAAI8wB,GAAQ9L,GAAS,SAAS/F,GAC5B,OAAO+H,GAASxJ,GAAYyB,EAAQ,EAAGqE,IAAmB,MA0BxDyN,GAAU/L,GAAS,SAAS/F,GAC9B,IAAI/e,EAAWwf,GAAKT,GAIpB,OAHIqE,GAAkBpjB,KACpBA,EAAWpc,IAENkjC,GAASxJ,GAAYyB,EAAQ,EAAGqE,IAAmB,GAAOQ,GAAY5jB,EAAU,MAwBrF8wB,GAAYhM,GAAS,SAAS/F,GAChC,IAAIne,EAAa4e,GAAKT,GAEtB,OADAne,EAAkC,mBAAdA,EAA2BA,EAAahd,GACrDkjC,GAASxJ,GAAYyB,EAAQ,EAAGqE,IAAmB,GAAOx/B,GAAWgd,KAgG9E,SAASmwB,GAAMjxB,GACb,IAAMA,IAASA,EAAMrrB,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAqrB,EAAQQ,GAAYR,EAAO,SAASkxB,GAClC,GAAI5N,GAAkB4N,GAEpB,OADAv8C,EAASy/B,EAAU8c,EAAMv8C,OAAQA,IAC1B,IAGJ4tB,GAAU5tB,EAAQ,SAASkC,GAChC,OAAOkqB,GAASf,EAAOuB,GAAa1qB,MAyBxC,SAASs6C,GAAUnxB,EAAOE,GACxB,IAAMF,IAASA,EAAMrrB,OACnB,MAAO,GAET,IAAI+rB,EAASuwB,GAAMjxB,GACnB,OAAgB,MAAZE,EACKQ,EAEFK,GAASL,EAAQ,SAASwwB,GAC/B,OAAO/5C,GAAM+oB,EAAUpc,GAAWotC,KAwBtC,IAAIE,GAAUpM,GAAS,SAAShlB,EAAOiB,GACrC,OAAOqiB,GAAkBtjB,GACrB8b,GAAe9b,EAAOiB,GACtB,KAqBFowB,GAAMrM,GAAS,SAAS/F,GAC1B,OAAOyI,GAAQlnB,GAAYye,EAAQqE,OA0BjCgO,GAAQtM,GAAS,SAAS/F,GAC5B,IAAI/e,EAAWwf,GAAKT,GAIpB,OAHIqE,GAAkBpjB,KACpBA,EAAWpc,IAEN4jC,GAAQlnB,GAAYye,EAAQqE,IAAoBQ,GAAY5jB,EAAU,MAwB3EqxB,GAAUvM,GAAS,SAAS/F,GAC9B,IAAIne,EAAa4e,GAAKT,GAEtB,OADAne,EAAkC,mBAAdA,EAA2BA,EAAahd,GACrD4jC,GAAQlnB,GAAYye,EAAQqE,IAAoBx/B,GAAWgd,KAmBhE0wB,GAAMxM,GAASiM,IA6DnB,IAAIQ,GAAUzM,GAAS,SAAS/F,GAC9B,IAAItqC,EAASsqC,EAAOtqC,OAChBurB,EAAoB,EAATvrB,EAAasqC,EAAOtqC,EAAS,GAAKmP,GAGjD,OADAoc,EAA8B,mBAAZA,GAA0B+e,EAAOtC,MAAOzc,GAAYpc,GAC/DqtC,GAAUlS,EAAQ/e,KAkC3B,SAASwxB,GAAMz1C,GACb,IAAIykB,EAASjK,GAAOxa,GAEpB,OADAykB,EAAO6V,WAAY,EACZ7V,EAsDT,SAASmqB,GAAK5uC,EAAO01C,GACnB,OAAOA,EAAY11C,GAmBrB,IAAI21C,GAAYlH,GAAS,SAASnR,GAChC,IAAI5kC,EAAS4kC,EAAM5kC,OACfswC,EAAQtwC,EAAS4kC,EAAM,GAAK,EAC5Bt9B,EAAQnG,KAAKugC,YACbsb,EAAc,SAASxvB,GAAU,OAAOmX,GAAOnX,EAAQoX,IAE3D,QAAa,EAAT5kC,GAAcmB,KAAKwgC,YAAY3hC,SAC7BsH,aAAiB65B,IAAiBmC,GAAQgN,KAGhDhpC,EAAQA,EAAMhF,MAAMguC,GAAQA,GAAStwC,EAAS,EAAI,KAC5C2hC,YAAY9/B,KAAK,CACrBqpB,KAAQgrB,GACR7zC,KAAQ,CAAC26C,GACT7xB,QAAWhc,KAEN,IAAIiyB,GAAc95B,EAAOnG,KAAKygC,WAAWsU,KAAK,SAAS7qB,GAI5D,OAHIrrB,IAAWqrB,EAAMrrB,QACnBqrB,EAAMxpB,KAAKsN,IAENkc,KAZAlqB,KAAK+0C,KAAK8G,KA+PrB,IAAIE,GAAUrI,GAAiB,SAAS9oB,EAAQzkB,EAAO0E,GACjDgxB,EAAej9B,KAAKgsB,EAAQ/f,KAC5B+f,EAAO/f,GAETg4B,GAAgBjY,EAAQ/f,EAAK,KAuIjC,IAAImxC,GAAOvH,GAAW6F,IAqBlB2B,GAAWxH,GAAW8F,IA2G1B,SAASr3C,GAAQyoB,EAAYvB,GAE3B,OADWjoB,GAAQwpB,GAAcrB,GAAY4Y,IACjCvX,EAAYqiB,GAAY5jB,EAAU,IAuBhD,SAAS8xB,GAAavwB,EAAYvB,GAEhC,OADWjoB,GAAQwpB,GAAcpB,GAAiB6c,IACtCzb,EAAYqiB,GAAY5jB,EAAU,IA0BhD,IAAI+xB,GAAUzI,GAAiB,SAAS9oB,EAAQzkB,EAAO0E,GACjDgxB,EAAej9B,KAAKgsB,EAAQ/f,GAC9B+f,EAAO/f,GAAKnK,KAAKyF,GAEjB08B,GAAgBjY,EAAQ/f,EAAK,CAAC1E,MAsElC,IAAIi2C,GAAYlN,GAAS,SAASvjB,EAAYyc,EAAMlnC,GAClD,IAAIH,GAAS,EACT0jC,EAAwB,mBAAR2D,EAChBxd,EAASgiB,GAAYjhB,GAAc3pB,EAAM2pB,EAAW9sB,QAAU,GAKlE,OAHAqkC,GAASvX,EAAY,SAASxlB,GAC5BykB,IAAS7pB,GAAS0jC,EAASpjC,GAAM+mC,EAAMjiC,EAAOjF,GAAQwoC,GAAWvjC,EAAOiiC,EAAMlnC,KAEzE0pB,IA+BLyxB,GAAQ3I,GAAiB,SAAS9oB,EAAQzkB,EAAO0E,GACnDg4B,GAAgBjY,EAAQ/f,EAAK1E,KA6C/B,SAASoS,GAAIoT,EAAYvB,GAEvB,OADWjoB,GAAQwpB,GAAcV,GAAW0hB,IAChChhB,EAAYqiB,GAAY5jB,EAAU,IAkFhD,IAAIkyB,GAAY5I,GAAiB,SAAS9oB,EAAQzkB,EAAO0E,GACvD+f,EAAO/f,EAAM,EAAI,GAAGnK,KAAKyF,IACxB,WAAa,MAAO,CAAC,GAAI,MAmS5B,IAAIgZ,GAAS+vB,GAAS,SAASvjB,EAAYmiB,GACzC,GAAkB,MAAdniB,EACF,MAAO,GAET,IAAI9sB,EAASivC,EAAUjvC,OAMvB,OALa,EAATA,GAAcm1C,GAAeroB,EAAYmiB,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACM,EAATjvC,GAAcm1C,GAAelG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYliB,EAAY+b,GAAYoG,EAAW,GAAI,MAqBxDrQ,GAAMD,GAAU,WAClB,OAAO/U,GAAK4S,KAAKoC,OA0DnB,SAASp7B,GAAI0nB,EAAM/rB,EAAG+1C,GAGpB,OAFA/1C,EAAI+1C,EAAQ/lC,GAAYhQ,EACxBA,EAAK+rB,GAAa,MAAL/rB,EAAa+rB,EAAKlrB,OAASb,EACjCi6C,GAAWluB,EAAMhJ,GAAe/S,GAAWA,GAAWA,GAAWA,GAAWhQ,GAoBrF,SAASu+C,GAAOv+C,EAAG+rB,GACjB,IAAIa,EACJ,GAAmB,mBAARb,EACT,MAAM,IAAIuR,EAAU1a,IAGtB,OADA5iB,EAAI85C,GAAU95C,GACP,WAOL,OANU,IAAJA,IACJ4sB,EAASb,EAAK1oB,MAAMrB,KAAM6D,YAExB7F,GAAK,IACP+rB,EAAO/b,IAEF4c,GAuCX,IAAI4xB,GAAOtN,GAAS,SAASnlB,EAAMC,EAAS2oB,GAC1C,IAAI3O,EAv4Ta,EAw4TjB,GAAI2O,EAAS9zC,OAAQ,CACnB,IAAI+zC,EAAU3Y,GAAe0Y,EAAUoD,GAAUyG,KACjDxY,GAr4TkB,GAu4TpB,OAAOiU,GAAWluB,EAAMia,EAASha,EAAS2oB,EAAUC,KAgDlD6J,GAAUvN,GAAS,SAAS7iB,EAAQxhB,EAAK8nC,GAC3C,IAAI3O,EAAU0Y,EACd,GAAI/J,EAAS9zC,OAAQ,CACnB,IAAI+zC,EAAU3Y,GAAe0Y,EAAUoD,GAAU0G,KACjDzY,GA37TkB,GA67TpB,OAAOiU,GAAWptC,EAAKm5B,EAAS3X,EAAQsmB,EAAUC,KAsJpD,SAAS+J,GAAS5yB,EAAMgc,EAAMzgC,GAC5B,IAAIs3C,EACAC,EACAC,EACAlyB,EACAmyB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACThJ,GAAW,EAEf,GAAmB,mBAARpqB,EACT,MAAM,IAAIuR,EAAU1a,IAUtB,SAASw8B,EAAW7jC,GAClB,IAAIrY,EAAO07C,EACP5yB,EAAU6yB,EAKd,OAHAD,EAAWC,EAAW7uC,GACtBivC,EAAiB1jC,EACjBqR,EAASb,EAAK1oB,MAAM2oB,EAAS9oB,GAuB/B,SAASm8C,EAAa9jC,GACpB,IAAI+jC,EAAoB/jC,EAAOyjC,EAM/B,OAAQA,IAAiBhvC,IAAmC+3B,GAArBuX,GACpCA,EAAoB,GAAOH,GAAiCL,GANrCvjC,EAAO0jC,EASnC,SAASM,IACP,IAtBqBhkC,EAGjBikC,EAmBAjkC,EAAOkkB,KACX,GAAI4f,EAAa9jC,GACf,OAAOkkC,EAAalkC,GAGtBwjC,EAAUh5C,GAAWw5C,GAxBjBC,EAAczX,IAHGxsB,EA2B4BA,GA1BlByjC,GAIxBG,EACH5e,EAAUif,EAAaV,GAJDvjC,EAAO0jC,IAK7BO,IAuBN,SAASC,EAAalkC,GAKpB,OAJAwjC,EAAU/uC,GAINmmC,GAAYyI,EACPQ,EAAW7jC,IAEpBqjC,EAAWC,EAAW7uC,GACf4c,GAeT,SAAS8yB,IACP,IAhEmBnkC,EAgEfA,EAAOkkB,KACPkgB,EAAaN,EAAa9jC,GAM9B,GAJAqjC,EAAW/4C,UACXg5C,EAAW78C,KACXg9C,EAAezjC,EAEXokC,EAAY,CACd,GAAIZ,IAAY/uC,GACd,OAvEJivC,EAFmB1jC,EAyEIyjC,EArEvBD,EAAUh5C,GAAWw5C,EAAcxX,GAE5BmX,EAAUE,EAAW7jC,GAAQqR,EAqElC,GAAIuyB,EAIF,OAFAv5C,GAAam5C,GACbA,EAAUh5C,GAAWw5C,EAAcxX,GAC5BqX,EAAWJ,GAMtB,OAHID,IAAY/uC,KACd+uC,EAAUh5C,GAAWw5C,EAAcxX,IAE9Bnb,EAIT,OA3GAmb,EAAOuR,GAASvR,IAAS,EACrB3F,GAAS96B,KACX43C,IAAY53C,EAAQ43C,QAEpBJ,GADAK,EAAS,YAAa73C,GACHg5B,EAAUgZ,GAAShyC,EAAQw3C,UAAY,EAAG/W,GAAQ+W,EACrE3I,EAAW,aAAc7uC,IAAYA,EAAQ6uC,SAAWA,GAoG1DuJ,EAAUE,OApCV,WACMb,IAAY/uC,IACdpK,GAAam5C,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAU/uC,IAgCjD0vC,EAAUG,MA7BV,WACE,OAAOd,IAAY/uC,GAAY4c,EAAS6yB,EAAahgB,OA6BhDigB,EAqBT,IAAII,GAAQ5O,GAAS,SAASnlB,EAAM7oB,GAClC,OAAO4kC,GAAU/b,EAAM,EAAG7oB,KAsBxBwU,GAAQw5B,GAAS,SAASnlB,EAAMgc,EAAM7kC,GACxC,OAAO4kC,GAAU/b,EAAMutB,GAASvR,IAAS,EAAG7kC,KAqE9C,SAAS44C,GAAQ/vB,EAAMg0B,GACrB,GAAmB,mBAARh0B,GAAmC,MAAZg0B,GAAuC,mBAAZA,EAC3D,MAAM,IAAIziB,EAAU1a,IAEtB,IAAIo9B,EAAW,WACb,IAAI98C,EAAO2C,UACPgH,EAAMkzC,EAAWA,EAAS18C,MAAMrB,KAAMkB,GAAQA,EAAK,GACnD+rB,EAAQ+wB,EAAS/wB,MAErB,GAAIA,EAAMC,IAAIriB,GACZ,OAAOoiB,EAAM0W,IAAI94B,GAEnB,IAAI+f,EAASb,EAAK1oB,MAAMrB,KAAMkB,GAE9B,OADA88C,EAAS/wB,MAAQA,EAAMmN,IAAIvvB,EAAK+f,IAAWqC,EACpCrC,GAGT,OADAozB,EAAS/wB,MAAQ,IAAK6sB,GAAQmE,OAAS3c,IAChC0c,EA0BT,SAASE,GAAOzzB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAI6Q,EAAU1a,IAEtB,OAAO,WACL,IAAI1f,EAAO2C,UACX,OAAQ3C,EAAKrC,QACX,KAAK,EAAG,OAAQ4rB,EAAU7rB,KAAKoB,MAC/B,KAAK,EAAG,OAAQyqB,EAAU7rB,KAAKoB,KAAMkB,EAAK,IAC1C,KAAK,EAAG,OAAQupB,EAAU7rB,KAAKoB,KAAMkB,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQupB,EAAU7rB,KAAKoB,KAAMkB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQupB,EAAUppB,MAAMrB,KAAMkB,IAlClC44C,GAAQmE,MAAQ3c,GA2FhB,IAAI6c,GAAWhM,GAAS,SAASpoB,EAAMq0B,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWv/C,QAAesD,GAAQi8C,EAAW,IACvDnzB,GAASmzB,EAAW,GAAIvxB,GAAUmhB,OAClC/iB,GAASyc,GAAY0W,EAAY,GAAIvxB,GAAUmhB,QAEtBnvC,OAC7B,OAAOqwC,GAAS,SAAShuC,GAIvB,IAHA,IAAIH,GAAS,EACTlC,EAAS0/B,EAAUr9B,EAAKrC,OAAQw/C,KAE3Bt9C,EAAQlC,GACfqC,EAAKH,GAASq9C,EAAWr9C,GAAOnC,KAAKoB,KAAMkB,EAAKH,IAElD,OAAOM,GAAM0oB,EAAM/pB,KAAMkB,OAqCzBo9C,GAAUpP,GAAS,SAASnlB,EAAM4oB,GACpC,IAAIC,EAAU3Y,GAAe0Y,EAAUoD,GAAUuI,KACjD,OAAOrG,GAAWluB,EAn+UE,GAm+UuB/b,GAAW2kC,EAAUC,KAmC9D2L,GAAerP,GAAS,SAASnlB,EAAM4oB,GACzC,IAAIC,EAAU3Y,GAAe0Y,EAAUoD,GAAUwI,KACjD,OAAOtG,GAAWluB,EAvgVQ,GAugVuB/b,GAAW2kC,EAAUC,KAyBpE4L,GAAQ5J,GAAS,SAAS7qB,EAAM+kB,GAClC,OAAOmJ,GAAWluB,EA/hVA,IA+hVuB/b,GAAWA,GAAWA,GAAW8gC,KAia5E,SAASlM,GAAGz8B,EAAO4iC,GACjB,OAAO5iC,IAAU4iC,GAAU5iC,GAAUA,GAAS4iC,GAAUA,EA0B1D,IAAI0V,GAAKpH,GAA0BvO,IAyB/B4V,GAAMrH,GAA0B,SAASlxC,EAAO4iC,GAClD,OAAgBA,GAAT5iC,IAqBL47B,GAAc8H,GAAgB,WAAa,OAAOhmC,UAApB,IAAsCgmC,GAAkB,SAAS1jC,GACjG,OAAO45B,GAAa55B,IAAU01B,EAAej9B,KAAKuH,EAAO,YACtD22B,EAAqBl+B,KAAKuH,EAAO,WA0BlChE,GAAUH,EAAMG,QAmBhBinB,GAAgBD,GAAoB0D,GAAU1D,IA75PlD,SAA2BhjB,GACzB,OAAO45B,GAAa55B,IAAUuiC,GAAWviC,IAAUic,IAu7PrD,SAASwqB,GAAYzmC,GACnB,OAAgB,MAATA,GAAiB6yC,GAAS7yC,EAAMtH,UAAYqpC,GAAW/hC,GA4BhE,SAASqnC,GAAkBrnC,GACzB,OAAO45B,GAAa55B,IAAUymC,GAAYzmC,GA0C5C,IAAI83B,GAAWD,GAAkBqb,GAmB7B/vB,GAASD,GAAawD,GAAUxD,IAxgQpC,SAAoBljB,GAClB,OAAO45B,GAAa55B,IAAUuiC,GAAWviC,IAAUob,IA+qQrD,SAASo9B,GAAQx4C,GACf,IAAK45B,GAAa55B,GAChB,OAAO,EAET,IAAIo+B,EAAMmE,GAAWviC,GACrB,OAAOo+B,GAAO/iB,IA9yWF,yBA8yWc+iB,GACC,iBAAjBp+B,EAAMI,SAA4C,iBAAdJ,EAAMwW,OAAqB8wB,GAActnC,GAkDzF,SAAS+hC,GAAW/hC,GAClB,IAAKi6B,GAASj6B,GACZ,OAAO,EAIT,IAAIo+B,EAAMmE,GAAWviC,GACrB,OAAOo+B,GAAO9iB,IAAW8iB,GAAO7iB,IA32WrB,0BA22W+B6iB,GA/1W/B,kBA+1WkDA,EA6B/D,SAASqa,GAAUz4C,GACjB,MAAuB,iBAATA,GAAqBA,GAAS2xC,GAAU3xC,GA6BxD,SAAS6yC,GAAS7yC,GAChB,MAAuB,iBAATA,IACH,EAATA,GAAcA,EAAQ,GAAK,GAAKA,GAAS6a,GA4B7C,SAASof,GAASj6B,GAChB,IAAIrD,SAAcqD,EAClB,OAAgB,MAATA,IAA0B,UAARrD,GAA4B,YAARA,GA2B/C,SAASi9B,GAAa55B,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAIqjB,GAAQD,GAAYsD,GAAUtD,IA5xQlC,SAAmBpjB,GACjB,OAAO45B,GAAa55B,IAAUq+B,GAAOr+B,IAAUwb,IA6+QjD,SAASk9B,GAAS14C,GAChB,MAAuB,iBAATA,GACX45B,GAAa55B,IAAUuiC,GAAWviC,IAAUyb,GA+BjD,SAAS6rB,GAActnC,GACrB,IAAK45B,GAAa55B,IAAUuiC,GAAWviC,IAAU0b,GAC/C,OAAO,EAET,IAAI3hB,EAAQy8B,EAAax2B,GACzB,GAAc,OAAVjG,EACF,OAAO,EAET,IAAIilC,EAAOtJ,EAAej9B,KAAKsB,EAAO,gBAAkBA,EAAMqM,YAC9D,MAAsB,mBAAR44B,GAAsBA,aAAgBA,GAClDxJ,EAAa/8B,KAAKumC,IAAS/I,EAoB/B,IAAI1S,GAAWD,GAAeoD,GAAUpD,IA59QxC,SAAsBtjB,GACpB,OAAO45B,GAAa55B,IAAUuiC,GAAWviC,IAAU4b,IA6gRrD,IAAI6H,GAAQD,GAAYkD,GAAUlD,IAngRlC,SAAmBxjB,GACjB,OAAO45B,GAAa55B,IAAUq+B,GAAOr+B,IAAU6b,IAqhRjD,SAAS88B,GAAS34C,GAChB,MAAuB,iBAATA,IACVhE,GAAQgE,IAAU45B,GAAa55B,IAAUuiC,GAAWviC,IAAU8b,GAoBpE,SAASulB,GAASrhC,GAChB,MAAuB,iBAATA,GACX45B,GAAa55B,IAAUuiC,GAAWviC,IAAU+b,GAoBjD,IAAI4H,GAAeD,GAAmBgD,GAAUhD,IAvjRhD,SAA0B1jB,GACxB,OAAO45B,GAAa55B,IAClB6yC,GAAS7yC,EAAMtH,WAAa8oB,GAAe+gB,GAAWviC,KA6oR1D,IAAI44C,GAAK1H,GAA0B3K,IAyB/BsS,GAAM3H,GAA0B,SAASlxC,EAAO4iC,GAClD,OAAO5iC,GAAS4iC,IA0BlB,SAASkW,GAAQ94C,GACf,IAAKA,EACH,MAAO,GAET,GAAIymC,GAAYzmC,GACd,OAAO24C,GAAS34C,GAASq0B,GAAcr0B,GAASq8B,GAAUr8B,GAE5D,GAAI82B,GAAe92B,EAAM82B,GACvB,OAv8VN,SAAyBC,GAIvB,IAHA,IAAIp3B,EACA8kB,EAAS,KAEJ9kB,EAAOo3B,EAASgiB,QAAQC,MAC/Bv0B,EAAOlqB,KAAKoF,EAAKK,OAEnB,OAAOykB,EAg8VIw0B,CAAgBj5C,EAAM82B,MAE/B,IAAIsH,EAAMC,GAAOr+B,GAGjB,OAFWo+B,GAAO5iB,GAASmY,GAAcyK,GAAOviB,GAASmY,GAAahP,IAE1DhlB,GA0Bd,SAASgxC,GAAShxC,GAChB,OAAKA,GAGLA,EAAQmxC,GAASnxC,MAzkYN,EAAA,GA0kYeA,KAAU,EAAA,EAI7BA,GAAUA,EAAQA,EAAQ,EA5kYnB,uBAykYAA,EAAQ,GAAK,EAAI,GAJZ,IAAVA,EAAcA,EAAQ,EAoCjC,SAAS2xC,GAAU3xC,GACjB,IAAIykB,EAASusB,GAAShxC,GAClB8I,EAAY2b,EAAS,EAEzB,OAAOA,GAAWA,EAAU3b,EAAY2b,EAAS3b,EAAY2b,EAAU,EA8BzE,SAASy0B,GAASl5C,GAChB,OAAOA,EAAQs8B,GAAUqV,GAAU3xC,GAAQ,EAAG+a,IAAoB,EA0BpE,SAASo2B,GAASnxC,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIqhC,GAASrhC,GACX,OAAO8a,GAET,GAAImf,GAASj6B,GAAQ,CACnB,IAAI4iC,EAAgC,mBAAjB5iC,EAAM05B,QAAwB15B,EAAM05B,UAAY15B,EACnEA,EAAQi6B,GAAS2I,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAAT5iC,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQumB,GAASvmB,GACjB,IAAIm5C,EAAW36B,GAAWxG,KAAKhY,GAC/B,OAAQm5C,GAAYz6B,GAAU1G,KAAKhY,GAC/BkiB,GAAaliB,EAAMhF,MAAM,GAAIm+C,EAAW,EAAI,GAC3C56B,GAAWvG,KAAKhY,GAAS8a,IAAO9a,EA2BvC,SAASunC,GAAcvnC,GACrB,OAAOi9B,GAAWj9B,EAAOy+B,GAAOz+B,IAsDlC,SAASy1B,GAASz1B,GAChB,OAAgB,MAATA,EAAgB,GAAK8qC,GAAa9qC,GAqC3C,IAAIo5C,GAAS3L,GAAe,SAASvnB,EAAQ/I,GAC3C,GAAIgpB,GAAYhpB,IAAWspB,GAAYtpB,GACrC8f,GAAW9f,EAAQ2Y,GAAK3Y,GAAS+I,QAGnC,IAAK,IAAIxhB,KAAOyY,EACVuY,EAAej9B,KAAK0kB,EAAQzY,IAC9Bi4B,GAAYzW,EAAQxhB,EAAKyY,EAAOzY,MAoClC20C,GAAW5L,GAAe,SAASvnB,EAAQ/I,GAC7C8f,GAAW9f,EAAQshB,GAAOthB,GAAS+I,KAgCjCozB,GAAe7L,GAAe,SAASvnB,EAAQ/I,EAAQ6pB,EAAUlJ,GACnEb,GAAW9f,EAAQshB,GAAOthB,GAAS+I,EAAQ4X,KA+BzCyb,GAAa9L,GAAe,SAASvnB,EAAQ/I,EAAQ6pB,EAAUlJ,GACjEb,GAAW9f,EAAQ2Y,GAAK3Y,GAAS+I,EAAQ4X,KAoBvC0b,GAAK/K,GAASpR,IA8DlB,IAAIzsB,GAAWm4B,GAAS,SAAS7iB,EAAQynB,GACvCznB,EAASriB,EAAOqiB,GAEhB,IAAItrB,GAAS,EACTlC,EAASi1C,EAAQj1C,OACjBk1C,EAAiB,EAATl1C,EAAai1C,EAAQ,GAAK9lC,GAMtC,IAJI+lC,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDl1C,EAAS,KAGFkC,EAAQlC,GAMf,IALA,IAAIykB,EAASwwB,EAAQ/yC,GACjBgsB,EAAQ6X,GAAOthB,GACfs8B,GAAc,EACdC,EAAc9yB,EAAMluB,SAEf+gD,EAAaC,GAAa,CACjC,IAAIh1C,EAAMkiB,EAAM6yB,GACZz5C,EAAQkmB,EAAOxhB,IAEf1E,IAAU6H,IACT40B,GAAGz8B,EAAOs1B,EAAY5wB,MAAUgxB,EAAej9B,KAAKytB,EAAQxhB,MAC/DwhB,EAAOxhB,GAAOyY,EAAOzY,IAK3B,OAAOwhB,IAsBLyzB,GAAe5Q,GAAS,SAAShuC,GAEnC,OADAA,EAAKR,KAAKsN,GAAWuqC,IACdl3C,GAAM0+C,GAAW/xC,GAAW9M,KAgSrC,SAASyiC,GAAItX,EAAQ+b,EAAMuO,GACzB,IAAI/rB,EAAmB,MAAVyB,EAAiBre,GAAYm6B,GAAQ9b,EAAQ+b,GAC1D,OAAOxd,IAAW5c,GAAY2oC,EAAe/rB,EA4D/C,SAASqiB,GAAM5gB,EAAQ+b,GACrB,OAAiB,MAAV/b,GAAkBysB,GAAQzsB,EAAQ+b,EAAMa,IAqBjD,IAAI+W,GAASzJ,GAAe,SAAS3rB,EAAQzkB,EAAO0E,GACrC,MAAT1E,GACyB,mBAAlBA,EAAMy1B,WACfz1B,EAAQg2B,EAAqBv9B,KAAKuH,IAGpCykB,EAAOzkB,GAAS0E,GACf8kC,GAAS1D,KA4BRgU,GAAW1J,GAAe,SAAS3rB,EAAQzkB,EAAO0E,GACvC,MAAT1E,GACyB,mBAAlBA,EAAMy1B,WACfz1B,EAAQg2B,EAAqBv9B,KAAKuH,IAGhC01B,EAAej9B,KAAKgsB,EAAQzkB,GAC9BykB,EAAOzkB,GAAOzF,KAAKmK,GAEnB+f,EAAOzkB,GAAS,CAAC0E,IAElBmjC,IAoBCkS,GAAShR,GAASxF,IA8BtB,SAASzN,GAAK5P,GACZ,OAAOugB,GAAYvgB,GAAUsV,GAActV,GAAUggB,GAAShgB,GA0BhE,SAASuY,GAAOvY,GACd,OAAOugB,GAAYvgB,GAAUsV,GAActV,GAAQ,GAAQkgB,GAAWlgB,GAuGxE,IAAI8zB,GAAQvM,GAAe,SAASvnB,EAAQ/I,EAAQ6pB,GAClDD,GAAU7gB,EAAQ/I,EAAQ6pB,KAkCxB4S,GAAYnM,GAAe,SAASvnB,EAAQ/I,EAAQ6pB,EAAUlJ,GAChEiJ,GAAU7gB,EAAQ/I,EAAQ6pB,EAAUlJ,KAuBlCmc,GAAOxL,GAAS,SAASvoB,EAAQoX,GACnC,IAAI7Y,EAAS,GACb,GAAc,MAAVyB,EACF,OAAOzB,EAET,IAAIuZ,GAAS,EACbV,EAAQxY,GAASwY,EAAO,SAAS2E,GAG/B,OAFAA,EAAOC,GAASD,EAAM/b,GACtB8X,IAAWA,EAAuB,EAAdiE,EAAKvpC,QAClBupC,IAEThF,GAAW/W,EAAQsZ,GAAatZ,GAASzB,GACrCuZ,IACFvZ,EAASmZ,GAAUnZ,EAAQy1B,EAAwD7H,KAGrF,IADA,IAAI35C,EAAS4kC,EAAM5kC,OACZA,KACLmwC,GAAUpkB,EAAQ6Y,EAAM5kC,IAE1B,OAAO+rB,IA4CT,IAAIwQ,GAAOwZ,GAAS,SAASvoB,EAAQoX,GACnC,OAAiB,MAAVpX,EAAiB,GAlmTjBqiB,GADSriB,EAmmTsBA,EAAQoX,EAlmTb,SAASt9B,EAAOiiC,GAC/C,OAAO6E,GAAM5gB,EAAQ+b,KAFzB,IAAkB/b,IAwnTlB,SAASi0B,GAAOj0B,EAAQ5B,GACtB,GAAc,MAAV4B,EACF,MAAO,GAET,IAAIU,EAAQ9B,GAAS0a,GAAatZ,GAAS,SAAS1qB,GAClD,MAAO,CAACA,KAGV,OADA8oB,EAAYujB,GAAYvjB,GACjBikB,GAAWriB,EAAQU,EAAO,SAAS5mB,EAAOiiC,GAC/C,OAAO3d,EAAUtkB,EAAOiiC,EAAK,MA4IjC,IAAImY,GAAUvI,GAAc/b,IA0BxBukB,GAAYxI,GAAcpT,IA4K9B,SAASzZ,GAAOkB,GACd,OAAiB,MAAVA,EAAiB,GAAKS,GAAWT,EAAQ4P,GAAK5P,IAkNvD,IAAIo0B,GAAYrM,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GAEtD,OADA2/C,EAAOA,EAAKh8C,cACLkmB,GAAU7pB,EAAQ4/C,GAAWD,GAAQA,KAkB9C,SAASC,GAAWh0B,GAClB,OAAOi0B,GAAWhlB,GAASjP,GAAQjoB,eAqBrC,SAAS4vC,GAAO3nB,GAEd,OADAA,EAASiP,GAASjP,KACDA,EAAOroB,QAAQygB,GAASwI,IAAcjpB,QAAQ8iB,GAAa,IAsH9E,IAAIy5B,GAAYzM,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GACtD,OAAO6pB,GAAU7pB,EAAQ,IAAM,IAAM2/C,EAAKh8C,gBAuBxCo8C,GAAY1M,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GACtD,OAAO6pB,GAAU7pB,EAAQ,IAAM,IAAM2/C,EAAKh8C,gBAoBxCq8C,GAAa7M,GAAgB,eA0NjC,IAAI8M,GAAY5M,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GACtD,OAAO6pB,GAAU7pB,EAAQ,IAAM,IAAM2/C,EAAKh8C,gBAgE5C,IAAIu8C,GAAY7M,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GACtD,OAAO6pB,GAAU7pB,EAAQ,IAAM,IAAM6/C,GAAWF,KAsiBlD,IAAIQ,GAAY9M,GAAiB,SAASxpB,EAAQ81B,EAAM3/C,GACtD,OAAO6pB,GAAU7pB,EAAQ,IAAM,IAAM2/C,EAAKS,gBAoBxCP,GAAa1M,GAAgB,eAqBjC,SAASG,GAAM1nB,EAAQy0B,EAASrN,GAI9B,OAHApnB,EAASiP,GAASjP,IAClBy0B,EAAUrN,EAAQ/lC,GAAYozC,KAEdpzC,IArybI2e,EAsybIA,EArybnBnF,GAAiBrJ,KAAKwO,GAqyboBA,EAzjbnCpoB,MAAM+iB,KAAkB,GAyjbgCqF,EAxrcxDpoB,MAAM8f,KAAgB,IA0rc3BsI,EAAOpoB,MAAM68C,IAAY,GA3rcpC,IAmZwBz0B,EAm0btB,IAAI00B,GAAUnS,GAAS,SAASnlB,EAAM7oB,GACpC,IACE,OAAOG,GAAM0oB,EAAM/b,GAAW9M,GAC9B,MAAOnD,GACP,OAAO4gD,GAAQ5gD,GAAKA,EAAI,IAAIS,EAAMT,MA8BlCujD,GAAU1M,GAAS,SAASvoB,EAAQk1B,GAKtC,OAJAj3B,GAAUi3B,EAAa,SAAS12C,GAC9BA,EAAMy9B,GAAMz9B,GACZg4B,GAAgBxW,EAAQxhB,EAAK2xC,GAAKnwB,EAAOxhB,GAAMwhB,MAE1CA,IAqGT,SAASsjB,GAASxpC,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIq7C,GAAO7M,KAuBP8M,GAAY9M,IAAW,GAkB3B,SAAS1I,GAAS9lC,GAChB,OAAOA,EA6CT,SAASikB,GAASL,GAChB,OAAOiiB,GAA4B,mBAARjiB,EAAqBA,EAAOga,GAAUha,EAjte/C,IAwzepB,IAAIpqB,GAASuvC,GAAS,SAAS9G,EAAMlnC,GACnC,OAAO,SAASmrB,GACd,OAAOqd,GAAWrd,EAAQ+b,EAAMlnC,MA2BhCwgD,GAAWxS,GAAS,SAAS7iB,EAAQnrB,GACvC,OAAO,SAASknC,GACd,OAAOsB,GAAWrd,EAAQ+b,EAAMlnC,MAwCpC,SAASygD,GAAMt1B,EAAQ/I,EAAQhe,GAC7B,IAAIynB,EAAQkP,GAAK3Y,GACbi+B,EAActZ,GAAc3kB,EAAQyJ,GAEzB,MAAXznB,GACE86B,GAAS9c,KAAYi+B,EAAY1iD,SAAWkuB,EAAMluB,UACtDyG,EAAUge,EACVA,EAAS+I,EACTA,EAASrsB,KACTuhD,EAActZ,GAAc3kB,EAAQ2Y,GAAK3Y,KAE3C,IAAIs4B,IAAUxb,GAAS96B,IAAY,UAAWA,IAAcA,EAAQs2C,OAChEnX,EAASyD,GAAW7b,GAqBxB,OAnBA/B,GAAUi3B,EAAa,SAAS/9C,GAC9B,IAAIumB,EAAOzG,EAAO9f,GAClB6oB,EAAO7oB,GAAcumB,EACjB0a,IACFpY,EAAO7sB,UAAUgE,GAAc,WAC7B,IAAI88B,EAAWtgC,KAAKygC,UACpB,GAAImb,GAAStb,EAAU,CACrB,IAAI1V,EAASyB,EAAOrsB,KAAKugC,aAKzB,OAJc3V,EAAO4V,YAAcgC,GAAUxiC,KAAKwgC,cAE1C9/B,KAAK,CAAEqpB,KAAQA,EAAM7oB,KAAQ2C,UAAWmmB,QAAWqC,IAC3DzB,EAAO6V,UAAYH,EACZ1V,EAET,OAAOb,EAAK1oB,MAAMgrB,EAAQnB,GAAU,CAAClrB,KAAKmG,SAAUtC,gBAKnDwoB,EAmCT,SAAS3V,MAiDT,IAAIkrC,GAAOhL,GAAW3rB,IA8BlB42B,GAAYjL,GAAWpsB,IAiCvBs3B,GAAWlL,GAAWrrB,IAwB1B,SAAS6gB,GAAShE,GAChB,OAAO2E,GAAM3E,GAAQ3c,GAAa6c,GAAMF,KAh3XhBA,EAg3X0CA,EA/2X3D,SAAS/b,GACd,OAAO8b,GAAQ9b,EAAQ+b,KAF3B,IAA0BA,EAu7X1B,IAAI2Z,GAAQ9K,KAsCR+K,GAAa/K,IAAY,GAoB7B,SAAS4B,KACP,MAAO,GAgBT,SAASQ,KACP,OAAO,EA+JT,IAAI5X,GAAMgV,GAAoB,SAASwL,EAAQC,GAC7C,OAAOD,EAASC,GACf,GAuBCtkB,GAAOga,GAAY,QAiBnBuK,GAAS1L,GAAoB,SAAS2L,EAAUC,GAClD,OAAOD,EAAWC,GACjB,GAuBC1xC,GAAQinC,GAAY,SAwKxB,IAgaMt0B,GAhaFg/B,GAAW7L,GAAoB,SAAS8L,EAAYC,GACtD,OAAOD,EAAaC,GACnB,GAuBC/6C,GAAQmwC,GAAY,SAiBpB6K,GAAWhM,GAAoB,SAASiM,EAASC,GACnD,OAAOD,EAAUC,GAChB,GAgmBH,OA1iBAhiC,GAAOiiC,MAp6MP,SAAe5kD,EAAG+rB,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAIuR,EAAU1a,IAGtB,OADA5iB,EAAI85C,GAAU95C,GACP,WACL,KAAMA,EAAI,EACR,OAAO+rB,EAAK1oB,MAAMrB,KAAM6D,aA85M9B8c,GAAOte,IAAMA,GACbse,GAAO4+B,OAASA,GAChB5+B,GAAO6+B,SAAWA,GAClB7+B,GAAO8+B,aAAeA,GACtB9+B,GAAO++B,WAAaA,GACpB/+B,GAAOg/B,GAAKA,GACZh/B,GAAO47B,OAASA,GAChB57B,GAAO67B,KAAOA,GACd77B,GAAO2gC,QAAUA,GACjB3gC,GAAO87B,QAAUA,GACjB97B,GAAOkiC,UAl8KP,WACE,IAAKh/C,UAAUhF,OACb,MAAO,GAET,IAAIsH,EAAQtC,UAAU,GACtB,OAAO1B,GAAQgE,GAASA,EAAQ,CAACA,IA87KnCwa,GAAOi7B,MAAQA,GACfj7B,GAAOmiC,MApgTP,SAAe54B,EAAOpiB,EAAMisC,GAExBjsC,GADGisC,EAAQC,GAAe9pB,EAAOpiB,EAAMisC,GAASjsC,IAASkG,IAClD,EAEAswB,EAAUwZ,GAAUhwC,GAAO,GAEpC,IAAIjJ,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,IAAKA,GAAUiJ,EAAO,EACpB,MAAO,GAMT,IAJA,IAAI/G,EAAQ,EACR4pB,EAAW,EACXC,EAAS5oB,EAAM27B,EAAW9+B,EAASiJ,IAEhC/G,EAAQlC,GACb+rB,EAAOD,KAAcklB,GAAU3lB,EAAOnpB,EAAQA,GAAS+G,GAEzD,OAAO8iB,GAo/STjK,GAAOoiC,QAl+SP,SAAiB74B,GAMf,IALA,IAAInpB,GAAS,EACTlC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACnC8rB,EAAW,EACXC,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACdoF,IACFykB,EAAOD,KAAcxkB,GAGzB,OAAOykB,GAu9STjK,GAAOxb,OA97SP,WACE,IAAItG,EAASgF,UAAUhF,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAIqC,EAAOc,EAAMnD,EAAS,GACtBqrB,EAAQrmB,UAAU,GAClB9C,EAAQlC,EAELkC,KACLG,EAAKH,EAAQ,GAAK8C,UAAU9C,GAE9B,OAAOmqB,GAAU/oB,GAAQ+nB,GAASsY,GAAUtY,GAAS,CAACA,GAAQwd,GAAYxmC,EAAM,KAm7SlFyf,GAAOqiC,KA3tCP,SAAchc,GACZ,IAAInoC,EAAkB,MAATmoC,EAAgB,EAAIA,EAAMnoC,OACnC23C,EAAaxI,KASjB,OAPAhH,EAASnoC,EAAcosB,GAAS+b,EAAO,SAAS+Q,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIzc,EAAU1a,IAEtB,MAAO,CAAC41B,EAAWuB,EAAK,IAAKA,EAAK,MAJlB,GAOX7I,GAAS,SAAShuC,GAEvB,IADA,IAAIH,GAAS,IACJA,EAAQlC,GAAQ,CACvB,IAAIk5C,EAAO/Q,EAAMjmC,GACjB,GAAIM,GAAM02C,EAAK,GAAI/3C,KAAMkB,GACvB,OAAOG,GAAM02C,EAAK,GAAI/3C,KAAMkB,OA4sCpCyf,GAAOsiC,SA9qCP,SAAkB3/B,GAChB,OAz5YoBA,EAy5YAygB,GAAUzgB,EA/ieZ,GAupFdyJ,EAAQkP,GAAK3Y,GACV,SAAS+I,GACd,OAAOwZ,GAAexZ,EAAQ/I,EAAQyJ,IAH1C,IAAsBzJ,EAChByJ,GAskbNpM,GAAOgvB,SAAWA,GAClBhvB,GAAOo7B,QAAUA,GACjBp7B,GAAO1W,OAtuHP,SAAgBzK,EAAW0jD,GACzB,IAAIt4B,EAASuV,GAAW3gC,GACxB,OAAqB,MAAd0jD,EAAqBt4B,EAASuY,GAAWvY,EAAQs4B,IAquH1DviC,GAAOwiC,MAzuMP,SAASA,EAAMp5B,EAAM2rB,EAAO3B,GAE1B,IAAInpB,EAASqtB,GAAWluB,EA7+TN,EA6+T6B/b,GAAWA,GAAWA,GAAWA,GAAWA,GAD3F0nC,EAAQ3B,EAAQ/lC,GAAY0nC,GAG5B,OADA9qB,EAAOsP,YAAcipB,EAAMjpB,YACpBtP,GAsuMTjK,GAAOyiC,WA7rMP,SAASA,EAAWr5B,EAAM2rB,EAAO3B,GAE/B,IAAInpB,EAASqtB,GAAWluB,EAzhUA,GAyhU6B/b,GAAWA,GAAWA,GAAWA,GAAWA,GADjG0nC,EAAQ3B,EAAQ/lC,GAAY0nC,GAG5B,OADA9qB,EAAOsP,YAAckpB,EAAWlpB,YACzBtP,GA0rMTjK,GAAOg8B,SAAWA,GAClBh8B,GAAO5J,SAAWA,GAClB4J,GAAOm/B,aAAeA,GACtBn/B,GAAOm9B,MAAQA,GACfn9B,GAAOjL,MAAQA,GACfiL,GAAOw5B,WAAaA,GACpBx5B,GAAOy5B,aAAeA,GACtBz5B,GAAO05B,eAAiBA,GACxB15B,GAAO0iC,KAt0SP,SAAcn5B,EAAOlsB,EAAG+1C,GACtB,IAAIl1C,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAKA,EAIEgxC,GAAU3lB,GADjBlsB,EAAK+1C,GAAS/1C,IAAMgQ,GAAa,EAAI8pC,GAAU95C,IACnB,EAAI,EAAIA,EAAGa,GAH9B,IAo0SX8hB,GAAO2iC,UArySP,SAAmBp5B,EAAOlsB,EAAG+1C,GAC3B,IAAIl1C,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAKA,EAKEgxC,GAAU3lB,EAAO,GADxBlsB,EAAIa,GADJb,EAAK+1C,GAAS/1C,IAAMgQ,GAAa,EAAI8pC,GAAU95C,KAEhB,EAAI,EAAIA,GAJ9B,IAmySX2iB,GAAO4iC,eAzvSP,SAAwBr5B,EAAOO,GAC7B,OAAQP,GAASA,EAAMrrB,OACnB0yC,GAAUrnB,EAAO8jB,GAAYvjB,EAAW,IAAI,GAAM,GAClD,IAuvSN9J,GAAO6iC,UAjtSP,SAAmBt5B,EAAOO,GACxB,OAAQP,GAASA,EAAMrrB,OACnB0yC,GAAUrnB,EAAO8jB,GAAYvjB,EAAW,IAAI,GAC5C,IA+sSN9J,GAAO8iC,KA/qSP,SAAcv5B,EAAO/jB,EAAOgpC,EAAOW,GACjC,IAAIjxC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAKA,GAGDswC,GAAyB,iBAATA,GAAqB6E,GAAe9pB,EAAO/jB,EAAOgpC,KACpEA,EAAQ,EACRW,EAAMjxC,GAzvIV,SAAkBqrB,EAAO/jB,EAAOgpC,EAAOW,GACrC,IAAIjxC,EAASqrB,EAAMrrB,OAWnB,KATAswC,EAAQ2I,GAAU3I,IACN,IACVA,EAAiBtwC,GAARswC,EAAiB,EAAKtwC,EAASswC,IAE1CW,EAAOA,IAAQ9hC,IAAmBnP,EAANixC,EAAgBjxC,EAASi5C,GAAUhI,IACrD,IACRA,GAAOjxC,GAETixC,EAAcA,EAARX,EAAc,EAAIkQ,GAASvP,GAC1BX,EAAQW,GACb5lB,EAAMilB,KAAWhpC,EAEnB,OAAO+jB,EA4uIAw5B,CAASx5B,EAAO/jB,EAAOgpC,EAAOW,IAN5B,IA6qSXnvB,GAAO3H,OA3vOP,SAAgB2S,EAAYlB,GAE1B,OADWtoB,GAAQwpB,GAAcjB,GAAc+c,IACnC9b,EAAYqiB,GAAYvjB,EAAW,KA0vOjD9J,GAAOgjC,QAvqOP,SAAiBh4B,EAAYvB,GAC3B,OAAOsd,GAAYnvB,GAAIoT,EAAYvB,GAAW,IAuqOhDzJ,GAAOijC,YAhpOP,SAAqBj4B,EAAYvB,GAC/B,OAAOsd,GAAYnvB,GAAIoT,EAAYvB,GAhkSxB,EAAA,IAgtgBbzJ,GAAOkjC,aAxnOP,SAAsBl4B,EAAYvB,EAAUud,GAE1C,OADAA,EAAQA,IAAU35B,GAAY,EAAI8pC,GAAUnQ,GACrCD,GAAYnvB,GAAIoT,EAAYvB,GAAWud,IAunOhDhnB,GAAOg4B,QAAUA,GACjBh4B,GAAOmjC,YAviSP,SAAqB55B,GAEnB,OADsB,MAATA,GAAoBA,EAAMrrB,OACvB6oC,GAAYxd,EA7qOjB,EAAA,GA6qOoC,IAsiSjDvJ,GAAOojC,aA/gSP,SAAsB75B,EAAOyd,GAE3B,OADsB,MAATzd,GAAoBA,EAAMrrB,OAKhC6oC,GAAYxd,EADnByd,EAAQA,IAAU35B,GAAY,EAAI8pC,GAAUnQ,IAFnC,IA6gSXhnB,GAAOqjC,KAz9LP,SAAcj6B,GACZ,OAAOkuB,GAAWluB,EA5wUD,MAqugBnBpJ,GAAO6gC,KAAOA,GACd7gC,GAAO8gC,UAAYA,GACnB9gC,GAAOsjC,UA3/RP,SAAmBjd,GAKjB,IAJA,IAAIjmC,GAAS,EACTlC,EAAkB,MAATmoC,EAAgB,EAAIA,EAAMnoC,OACnC+rB,EAAS,KAEJ7pB,EAAQlC,GAAQ,CACvB,IAAIk5C,EAAO/Q,EAAMjmC,GACjB6pB,EAAOmtB,EAAK,IAAMA,EAAK,GAEzB,OAAOntB,GAm/RTjK,GAAOujC,UA38GP,SAAmB73B,GACjB,OAAiB,MAAVA,EAAiB,GAAK4b,GAAc5b,EAAQ4P,GAAK5P,KA28G1D1L,GAAOwjC,YAj7GP,SAAqB93B,GACnB,OAAiB,MAAVA,EAAiB,GAAK4b,GAAc5b,EAAQuY,GAAOvY,KAi7G5D1L,GAAOw7B,QAAUA,GACjBx7B,GAAOyjC,QA56RP,SAAiBl6B,GAEf,OADsB,MAATA,GAAoBA,EAAMrrB,OACvBgxC,GAAU3lB,EAAO,GAAI,GAAK,IA26R5CvJ,GAAO85B,aAAeA,GACtB95B,GAAOg6B,eAAiBA,GACxBh6B,GAAOi6B,iBAAmBA,GAC1Bj6B,GAAOq/B,OAASA,GAChBr/B,GAAOs/B,SAAWA,GAClBt/B,GAAOy7B,UAAYA,GACnBz7B,GAAOyJ,SAAWA,GAClBzJ,GAAO07B,MAAQA,GACf17B,GAAOsb,KAAOA,GACdtb,GAAOikB,OAASA,GAChBjkB,GAAOpI,IAAMA,GACboI,GAAO0jC,QA1rGP,SAAiBh4B,EAAQjC,GACvB,IAAIQ,EAAS,GAMb,OALAR,EAAW4jB,GAAY5jB,EAAU,GAEjC+c,GAAW9a,EAAQ,SAASlmB,EAAO0E,EAAKwhB,GACtCwW,GAAgBjY,EAAQR,EAASjkB,EAAO0E,EAAKwhB,GAASlmB,KAEjDykB,GAorGTjK,GAAO2jC,UArpGP,SAAmBj4B,EAAQjC,GACzB,IAAIQ,EAAS,GAMb,OALAR,EAAW4jB,GAAY5jB,EAAU,GAEjC+c,GAAW9a,EAAQ,SAASlmB,EAAO0E,EAAKwhB,GACtCwW,GAAgBjY,EAAQ/f,EAAKuf,EAASjkB,EAAO0E,EAAKwhB,MAE7CzB,GA+oGTjK,GAAOlhB,QAphCP,SAAiB6jB,GACf,OAAO6oB,GAAYpI,GAAUzgB,EAxveX,KA4wgBpB3C,GAAO4jC,gBAh/BP,SAAyBnc,EAAMyD,GAC7B,OAAOK,GAAoB9D,EAAMrE,GAAU8H,EA7xezB,KA6wgBpBlrB,GAAOm5B,QAAUA,GACjBn5B,GAAOw/B,MAAQA,GACfx/B,GAAOo/B,UAAYA,GACnBp/B,GAAOhhB,OAASA,GAChBghB,GAAO+gC,SAAWA,GAClB/gC,GAAOghC,MAAQA,GACfhhC,GAAOu9B,OAASA,GAChBv9B,GAAO6jC,OAzzBP,SAAgBxmD,GAEd,OADAA,EAAI85C,GAAU95C,GACPkxC,GAAS,SAAShuC,GACvB,OAAO0sC,GAAQ1sC,EAAMlD,MAuzBzB2iB,GAAOy/B,KAAOA,GACdz/B,GAAO8jC,OAnhGP,SAAgBp4B,EAAQ5B,GACtB,OAAO61B,GAAOj0B,EAAQ6xB,GAAOlQ,GAAYvjB,MAmhG3C9J,GAAOhgB,KA73LP,SAAcopB,GACZ,OAAOwyB,GAAO,EAAGxyB,IA63LnBpJ,GAAO+jC,QAr4NP,SAAiB/4B,EAAYmiB,EAAWC,EAAQgG,GAC9C,OAAkB,MAAdpoB,EACK,IAEJxpB,GAAQ2rC,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnC3rC,GADL4rC,EAASgG,EAAQ/lC,GAAY+/B,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYliB,EAAYmiB,EAAWC,KA23N5CptB,GAAOihC,KAAOA,GACdjhC,GAAOw9B,SAAWA,GAClBx9B,GAAOkhC,UAAYA,GACnBlhC,GAAOmhC,SAAWA,GAClBnhC,GAAO29B,QAAUA,GACjB39B,GAAO49B,aAAeA,GACtB59B,GAAO27B,UAAYA,GACnB37B,GAAOya,KAAOA,GACdza,GAAO2/B,OAASA,GAChB3/B,GAAOyrB,SAAWA,GAClBzrB,GAAOgkC,WA/rBP,SAAoBt4B,GAClB,OAAO,SAAS+b,GACd,OAAiB,MAAV/b,EAAiBre,GAAYm6B,GAAQ9b,EAAQ+b,KA8rBxDznB,GAAOk6B,KAAOA,GACdl6B,GAAOm6B,QAAUA,GACjBn6B,GAAOikC,UApsRP,SAAmB16B,EAAOiB,EAAQf,GAChC,OAAQF,GAASA,EAAMrrB,QAAUssB,GAAUA,EAAOtsB,OAC9C+vC,GAAY1kB,EAAOiB,EAAQ6iB,GAAY5jB,EAAU,IACjDF,GAksRNvJ,GAAOkkC,YAxqRP,SAAqB36B,EAAOiB,EAAQH,GAClC,OAAQd,GAASA,EAAMrrB,QAAUssB,GAAUA,EAAOtsB,OAC9C+vC,GAAY1kB,EAAOiB,EAAQnd,GAAWgd,GACtCd,GAsqRNvJ,GAAOo6B,OAASA,GAChBp6B,GAAOohC,MAAQA,GACfphC,GAAOqhC,WAAaA,GACpBrhC,GAAO69B,MAAQA,GACf79B,GAAOmkC,OAxvNP,SAAgBn5B,EAAYlB,GAE1B,OADWtoB,GAAQwpB,GAAcjB,GAAc+c,IACnC9b,EAAYuyB,GAAOlQ,GAAYvjB,EAAW,MAuvNxD9J,GAAO/K,OAzmRP,SAAgBsU,EAAOO,GACrB,IAAIG,EAAS,GACb,IAAMV,IAASA,EAAMrrB,OACnB,OAAO+rB,EAET,IAAI7pB,GAAS,EACT+tC,EAAU,GACVjwC,EAASqrB,EAAMrrB,OAGnB,IADA4rB,EAAYujB,GAAYvjB,EAAW,KAC1B1pB,EAAQlC,GAAQ,CACvB,IAAIsH,EAAQ+jB,EAAMnpB,GACd0pB,EAAUtkB,EAAOpF,EAAOmpB,KAC1BU,EAAOlqB,KAAKyF,GACZ2oC,EAAQpuC,KAAKK,IAIjB,OADA8tC,GAAW3kB,EAAO4kB,GACXlkB,GAwlRTjK,GAAOokC,KAluLP,SAAch7B,EAAMolB,GAClB,GAAmB,mBAARplB,EACT,MAAM,IAAIuR,EAAU1a,IAGtB,OAAOsuB,GAASnlB,EADhBolB,EAAQA,IAAUnhC,GAAYmhC,EAAQ2I,GAAU3I,KA+tLlDxuB,GAAOie,QAAUA,GACjBje,GAAOqkC,WAhtNP,SAAoBr5B,EAAY3tB,EAAG+1C,GAOjC,OALE/1C,GADG+1C,EAAQC,GAAeroB,EAAY3tB,EAAG+1C,GAAS/1C,IAAMgQ,IACpD,EAEA8pC,GAAU95C,IAELmE,GAAQwpB,GAAc2W,GAAkBiN,IACvC5jB,EAAY3tB,IA0sN1B2iB,GAAOyZ,IAv6FP,SAAa/N,EAAQ+b,EAAMjiC,GACzB,OAAiB,MAAVkmB,EAAiBA,EAASsiB,GAAQtiB,EAAQ+b,EAAMjiC,IAu6FzDwa,GAAOskC,QA54FP,SAAiB54B,EAAQ+b,EAAMjiC,EAAO89B,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAaj2B,GAC3C,MAAVqe,EAAiBA,EAASsiB,GAAQtiB,EAAQ+b,EAAMjiC,EAAO89B,IA24FhEtjB,GAAOR,QA1rNP,SAAiBwL,GAEf,OADWxpB,GAAQwpB,GAAc+W,GAAekN,IACpCjkB,IAyrNdhL,GAAOxf,MAhjRP,SAAe+oB,EAAOilB,EAAOW,GAC3B,IAAIjxC,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAKA,GAKHixC,EAFEA,GAAqB,iBAAPA,GAAmBkE,GAAe9pB,EAAOilB,EAAOW,IAChEX,EAAQ,EACFtwC,IAGNswC,EAAiB,MAATA,EAAgB,EAAI2I,GAAU3I,GAChCW,IAAQ9hC,GAAYnP,EAASi5C,GAAUhI,IAExCD,GAAU3lB,EAAOilB,EAAOW,IAVtB,IA8iRXnvB,GAAOxB,OAASA,GAChBwB,GAAOukC,WAx3QP,SAAoBh7B,GAClB,OAAQA,GAASA,EAAMrrB,OACnBkyC,GAAe7mB,GACf,IAs3QNvJ,GAAOwkC,aAn2QP,SAAsBj7B,EAAOE,GAC3B,OAAQF,GAASA,EAAMrrB,OACnBkyC,GAAe7mB,EAAO8jB,GAAY5jB,EAAU,IAC5C,IAi2QNzJ,GAAOjC,MA5hEP,SAAeiO,EAAQy4B,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqBrR,GAAernB,EAAQy4B,EAAWC,KACzED,EAAYC,EAAQr3C,KAEtBq3C,EAAQA,IAAUr3C,GAAYkT,GAAmBmkC,IAAU,IAI3D14B,EAASiP,GAASjP,MAEQ,iBAAby4B,GACO,MAAbA,IAAsB17B,GAAS07B,OAEpCA,EAAYnU,GAAamU,KACPvrB,GAAWlN,GACpBylB,GAAU5X,GAAc7N,GAAS,EAAG04B,GAGxC14B,EAAOjO,MAAM0mC,EAAWC,GAZtB,IAuhEX1kC,GAAO2kC,OAnsLP,SAAgBv7B,EAAMolB,GACpB,GAAmB,mBAARplB,EACT,MAAM,IAAIuR,EAAU1a,IAGtB,OADAuuB,EAAiB,MAATA,EAAgB,EAAI7Q,EAAUwZ,GAAU3I,GAAQ,GACjDD,GAAS,SAAShuC,GACvB,IAAIgpB,EAAQhpB,EAAKiuC,GACbmK,EAAYlH,GAAUlxC,EAAM,EAAGiuC,GAKnC,OAHIjlB,GACFgB,GAAUouB,EAAWpvB,GAEhB7oB,GAAM0oB,EAAM/pB,KAAMs5C,MAwrL7B34B,GAAO4kC,KAl1QP,SAAcr7B,GACZ,IAAIrrB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAOA,EAASgxC,GAAU3lB,EAAO,EAAGrrB,GAAU,IAi1QhD8hB,GAAO6kC,KArzQP,SAAct7B,EAAOlsB,EAAG+1C,GACtB,OAAM7pB,GAASA,EAAMrrB,OAIdgxC,GAAU3lB,EAAO,GADxBlsB,EAAK+1C,GAAS/1C,IAAMgQ,GAAa,EAAI8pC,GAAU95C,IAChB,EAAI,EAAIA,GAH9B,IAozQX2iB,GAAO8kC,UArxQP,SAAmBv7B,EAAOlsB,EAAG+1C,GAC3B,IAAIl1C,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,OAAKA,EAKEgxC,GAAU3lB,GADjBlsB,EAAIa,GADJb,EAAK+1C,GAAS/1C,IAAMgQ,GAAa,EAAI8pC,GAAU95C,KAEnB,EAAI,EAAIA,EAAGa,GAJ9B,IAmxQX8hB,GAAO+kC,eAzuQP,SAAwBx7B,EAAOO,GAC7B,OAAQP,GAASA,EAAMrrB,OACnB0yC,GAAUrnB,EAAO8jB,GAAYvjB,EAAW,IAAI,GAAO,GACnD,IAuuQN9J,GAAOglC,UAjsQP,SAAmBz7B,EAAOO,GACxB,OAAQP,GAASA,EAAMrrB,OACnB0yC,GAAUrnB,EAAO8jB,GAAYvjB,EAAW,IACxC,IA+rQN9J,GAAOilC,IApuPP,SAAaz/C,EAAO01C,GAElB,OADAA,EAAY11C,GACLA,GAmuPTwa,GAAOklC,SA9oLP,SAAkB97B,EAAMgc,EAAMzgC,GAC5B,IAAI43C,GAAU,EACV/I,GAAW,EAEf,GAAmB,mBAARpqB,EACT,MAAM,IAAIuR,EAAU1a,IAMtB,OAJIwf,GAAS96B,KACX43C,EAAU,YAAa53C,IAAYA,EAAQ43C,QAAUA,EACrD/I,EAAW,aAAc7uC,IAAYA,EAAQ6uC,SAAWA,GAEnDwI,GAAS5yB,EAAMgc,EAAM,CAC1BmX,QAAWA,EACXJ,QAAW/W,EACXoO,SAAYA,KAioLhBxzB,GAAOo0B,KAAOA,GACdp0B,GAAOs+B,QAAUA,GACjBt+B,GAAO4/B,QAAUA,GACjB5/B,GAAO6/B,UAAYA,GACnB7/B,GAAOmlC,OArfP,SAAgB3/C,GACd,OAAIhE,GAAQgE,GACH8kB,GAAS9kB,EAAOmiC,IAElBd,GAASrhC,GAAS,CAACA,GAASq8B,GAAU0P,GAAatW,GAASz1B,MAkfrEwa,GAAO+sB,cAAgBA,GACvB/sB,GAAOlP,UA10FP,SAAmB4a,EAAQjC,EAAUC,GACnC,IAAIwX,EAAQ1/B,GAAQkqB,GAChB05B,EAAYlkB,GAAS5D,GAAS5R,IAAWvC,GAAauC,GAG1D,GADAjC,EAAW4jB,GAAY5jB,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAI8a,EAAO9Y,GAAUA,EAAO9f,YAE1B8d,EADE07B,EACYlkB,EAAQ,IAAIsD,EAAO,GAE1B/E,GAAS/T,IACF6b,GAAW/C,GAAQhF,GAAWxD,EAAatQ,IAG3C,GAMlB,OAHC05B,EAAYz7B,GAAY6c,IAAY9a,EAAQ,SAASlmB,EAAOpF,EAAOsrB,GAClE,OAAOjC,EAASC,EAAalkB,EAAOpF,EAAOsrB,KAEtChC,GAuzFT1J,GAAOqlC,MArnLP,SAAej8B,GACb,OAAO1nB,GAAI0nB,EAAM,IAqnLnBpJ,GAAOq6B,MAAQA,GACfr6B,GAAOs6B,QAAUA,GACjBt6B,GAAOu6B,UAAYA,GACnBv6B,GAAOslC,KAzmQP,SAAc/7B,GACZ,OAAQA,GAASA,EAAMrrB,OAAUqyC,GAAShnB,GAAS,IAymQrDvJ,GAAOulC,OA/kQP,SAAgBh8B,EAAOE,GACrB,OAAQF,GAASA,EAAMrrB,OAAUqyC,GAAShnB,EAAO8jB,GAAY5jB,EAAU,IAAM,IA+kQ/EzJ,GAAOwlC,SAxjQP,SAAkBj8B,EAAOc,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAahd,GACpDkc,GAASA,EAAMrrB,OAAUqyC,GAAShnB,EAAOlc,GAAWgd,GAAc,IAujQ5ErK,GAAOylC,MAhyFP,SAAe/5B,EAAQ+b,GACrB,OAAiB,MAAV/b,GAAwB2iB,GAAU3iB,EAAQ+b,IAgyFnDznB,GAAOw6B,MAAQA,GACfx6B,GAAO06B,UAAYA,GACnB16B,GAAO0lC,OApwFP,SAAgBh6B,EAAQ+b,EAAMkJ,GAC5B,OAAiB,MAAVjlB,EAAiBA,EAASglB,GAAWhlB,EAAQ+b,EAAM6J,GAAaX,KAowFzE3wB,GAAO2lC,WAzuFP,SAAoBj6B,EAAQ+b,EAAMkJ,EAASrN,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAaj2B,GAC3C,MAAVqe,EAAiBA,EAASglB,GAAWhlB,EAAQ+b,EAAM6J,GAAaX,GAAUrN,IAwuFnFtjB,GAAOwK,OAASA,GAChBxK,GAAO4lC,SAhrFP,SAAkBl6B,GAChB,OAAiB,MAAVA,EAAiB,GAAKS,GAAWT,EAAQuY,GAAOvY,KAgrFzD1L,GAAO26B,QAAUA,GACjB36B,GAAO0zB,MAAQA,GACf1zB,GAAO6lC,KA3mLP,SAAcrgD,EAAO6uC,GACnB,OAAOsJ,GAAQrM,GAAa+C,GAAU7uC,IA2mLxCwa,GAAO46B,IAAMA,GACb56B,GAAO66B,MAAQA,GACf76B,GAAO86B,QAAUA,GACjB96B,GAAO+6B,IAAMA,GACb/6B,GAAO8lC,UAj3PP,SAAmB15B,EAAO5B,GACxB,OAAO0mB,GAAc9kB,GAAS,GAAI5B,GAAU,GAAI2X,KAi3PlDniB,GAAO+lC,cA/1PP,SAAuB35B,EAAO5B,GAC5B,OAAO0mB,GAAc9kB,GAAS,GAAI5B,GAAU,GAAIwjB,KA+1PlDhuB,GAAOg7B,QAAUA,GAGjBh7B,GAAOugB,QAAUqf,GACjB5/B,GAAOgmC,UAAYnG,GACnB7/B,GAAOlf,OAAS+9C,GAChB7+B,GAAOimC,WAAanH,GAGpBkC,GAAMhhC,GAAQA,IAKdA,GAAO8gB,IAAMA,GACb9gB,GAAO0gC,QAAUA,GACjB1gC,GAAO8/B,UAAYA,GACnB9/B,GAAOggC,WAAaA,GACpBhgC,GAAOid,KAAOA,GACdjd,GAAOkmC,MAprFP,SAAejjB,EAAQC,EAAOC,GAa5B,OAZIA,IAAU91B,KACZ81B,EAAQD,EACRA,EAAQ71B,IAEN81B,IAAU91B,KAEZ81B,GADAA,EAAQwT,GAASxT,KACCA,EAAQA,EAAQ,GAEhCD,IAAU71B,KAEZ61B,GADAA,EAAQyT,GAASzT,KACCA,EAAQA,EAAQ,GAE7BpB,GAAU6U,GAAS1T,GAASC,EAAOC,IAwqF5CnjB,GAAOu5B,MA7jLP,SAAe/zC,GACb,OAAO49B,GAAU59B,EArzVI,IAk3gBvBwa,GAAOmmC,UApgLP,SAAmB3gD,GACjB,OAAO49B,GAAU59B,EAAOk6C,IAogL1B1/B,GAAOomC,cAr+KP,SAAuB5gD,EAAO89B,GAE5B,OAAOF,GAAU59B,EAAOk6C,EADxBpc,EAAkC,mBAAdA,EAA2BA,EAAaj2B,KAq+K9D2S,GAAOqmC,UA7hLP,SAAmB7gD,EAAO89B,GAExB,OAAOF,GAAU59B,EAz1VI,EAw1VrB89B,EAAkC,mBAAdA,EAA2BA,EAAaj2B,KA6hL9D2S,GAAOsmC,WA18KP,SAAoB56B,EAAQ/I,GAC1B,OAAiB,MAAVA,GAAkBuiB,GAAexZ,EAAQ/I,EAAQ2Y,GAAK3Y,KA08K/D3C,GAAO2zB,OAASA,GAChB3zB,GAAOumC,UA1xCP,SAAmB/gD,EAAOwwC,GACxB,OAAiB,MAATxwC,GAAiBA,GAAUA,EAASwwC,EAAexwC,GA0xC7Dwa,GAAOwhC,OAASA,GAChBxhC,GAAOwmC,SAz9EP,SAAkBx6B,EAAQ1X,EAAQ7H,GAChCuf,EAASiP,GAASjP,GAClB1X,EAASg8B,GAAah8B,GAEtB,IAAIpW,EAAS8tB,EAAO9tB,OAKhBixC,EAJJ1iC,EAAWA,IAAaY,GACpBnP,EACA4jC,GAAUqV,GAAU1qC,GAAW,EAAGvO,GAItC,OAAmB,IADnBuO,GAAY6H,EAAOpW,SACK8tB,EAAOxrB,MAAMiM,EAAU0iC,IAAQ76B,GA+8EzD0L,GAAOiiB,GAAKA,GACZjiB,GAAO6lB,OAj7EP,SAAgB7Z,GAEd,OADAA,EAASiP,GAASjP,KACApJ,GAAmBpF,KAAKwO,GACtCA,EAAOroB,QAAQ6e,GAAiBmW,IAChC3M,GA86ENhM,GAAOymC,aA55EP,SAAsBz6B,GAEpB,OADAA,EAASiP,GAASjP,KACA5I,GAAgB5F,KAAKwO,GACnCA,EAAOroB,QAAQwf,GAAc,QAC7B6I,GAy5ENhM,GAAO0mC,MA57OP,SAAe17B,EAAYlB,EAAWspB,GACpC,IAAIhqB,EAAO5nB,GAAQwpB,GAAcnB,GAAa8c,GAI9C,OAHIyM,GAASC,GAAeroB,EAAYlB,EAAWspB,KACjDtpB,EAAYzc,IAEP+b,EAAK4B,EAAYqiB,GAAYvjB,EAAW,KAw7OjD9J,GAAOq7B,KAAOA,GACdr7B,GAAO25B,UAAYA,GACnB35B,GAAO2mC,QArxHP,SAAiBj7B,EAAQ5B,GACvB,OAAOiB,GAAYW,EAAQ2hB,GAAYvjB,EAAW,GAAI0c,KAqxHxDxmB,GAAOs7B,SAAWA,GAClBt7B,GAAO45B,cAAgBA,GACvB55B,GAAO4mC,YAjvHP,SAAqBl7B,EAAQ5B,GAC3B,OAAOiB,GAAYW,EAAQ2hB,GAAYvjB,EAAW,GAAI4c,KAivHxD1mB,GAAOhQ,MAAQA,GACfgQ,GAAOzd,QAAUA,GACjByd,GAAOu7B,aAAeA,GACtBv7B,GAAO6mC,MArtHP,SAAen7B,EAAQjC,GACrB,OAAiB,MAAViC,EACHA,EACAyb,GAAQzb,EAAQ2hB,GAAY5jB,EAAU,GAAIwa,KAmtHhDjkB,GAAO8mC,WAtrHP,SAAoBp7B,EAAQjC,GAC1B,OAAiB,MAAViC,EACHA,EACA2b,GAAa3b,EAAQ2hB,GAAY5jB,EAAU,GAAIwa,KAorHrDjkB,GAAO+mC,OArpHP,SAAgBr7B,EAAQjC,GACtB,OAAOiC,GAAU8a,GAAW9a,EAAQ2hB,GAAY5jB,EAAU,KAqpH5DzJ,GAAOgnC,YAxnHP,SAAqBt7B,EAAQjC,GAC3B,OAAOiC,GAAUgb,GAAgBhb,EAAQ2hB,GAAY5jB,EAAU,KAwnHjEzJ,GAAOgjB,IAAMA,GACbhjB,GAAO89B,GAAKA,GACZ99B,GAAO+9B,IAAMA,GACb/9B,GAAOuM,IAzgHP,SAAab,EAAQ+b,GACnB,OAAiB,MAAV/b,GAAkBysB,GAAQzsB,EAAQ+b,EAAMY,KAygHjDroB,GAAOssB,MAAQA,GACftsB,GAAO65B,KAAOA,GACd75B,GAAOsrB,SAAWA,GAClBtrB,GAAOslB,SA5pOP,SAAkBta,EAAYxlB,EAAO2lB,EAAWioB,GAC9CpoB,EAAaihB,GAAYjhB,GAAcA,EAAaR,GAAOQ,GAC3DG,EAAaA,IAAcioB,EAAS+D,GAAUhsB,GAAa,EAE3D,IAAIjtB,EAAS8sB,EAAW9sB,OAIxB,OAHIitB,EAAY,IACdA,EAAYwS,EAAUz/B,EAASitB,EAAW,IAErCgzB,GAASnzB,GACXG,GAAajtB,IAAkD,EAAxC8sB,EAAWlrB,QAAQ0F,EAAO2lB,KAC/CjtB,IAAuD,EAA7CisB,GAAYa,EAAYxlB,EAAO2lB,IAmpOlDnL,GAAOlgB,QA9lSP,SAAiBypB,EAAO/jB,EAAO2lB,GAC7B,IAAIjtB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIkC,EAAqB,MAAb+qB,EAAoB,EAAIgsB,GAAUhsB,GAI9C,OAHI/qB,EAAQ,IACVA,EAAQu9B,EAAUz/B,EAASkC,EAAO,IAE7B+pB,GAAYZ,EAAO/jB,EAAOpF,IAslSnC4f,GAAOinC,QAlqFP,SAAiBhkB,EAAQuL,EAAOW,GAS9B,OARAX,EAAQgI,GAAShI,GACbW,IAAQ9hC,IACV8hC,EAAMX,EACNA,EAAQ,GAERW,EAAMqH,GAASrH,GAEjBlM,EAAS0T,GAAS1T,IAvsVCA,EAwsVAA,IAvsVFrF,EADU4Q,EAwsVAA,EAxsVOW,EAwsVAA,IAvsVQlM,EAAStF,EAAU6Q,EAAOW,GADtE,IAAqBlM,EAAQuL,EAAOW,GAk2apCnvB,GAAOu/B,OAASA,GAChBv/B,GAAOohB,YAAcA,GACrBphB,GAAOxe,QAAUA,GACjBwe,GAAOyI,cAAgBA,GACvBzI,GAAOisB,YAAcA,GACrBjsB,GAAO6sB,kBAAoBA,GAC3B7sB,GAAOknC,UAtwKP,SAAmB1hD,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB45B,GAAa55B,IAAUuiC,GAAWviC,IAAUmb,IAqwKjDX,GAAOsd,SAAWA,GAClBtd,GAAO2I,OAASA,GAChB3I,GAAOmnC,UA7sKP,SAAmB3hD,GACjB,OAAO45B,GAAa55B,IAA6B,IAAnBA,EAAMyB,WAAmB6lC,GAActnC,IA6sKvEwa,GAAOonC,QAzqKP,SAAiB5hD,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIymC,GAAYzmC,KACXhE,GAAQgE,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMnF,QAC1Di9B,GAAS93B,IAAU2jB,GAAa3jB,IAAU47B,GAAY57B,IAC1D,OAAQA,EAAMtH,OAEhB,IAAI0lC,EAAMC,GAAOr+B,GACjB,GAAIo+B,GAAO5iB,IAAU4iB,GAAOviB,GAC1B,OAAQ7b,EAAM2B,KAEhB,GAAIwkC,GAAYnmC,GACd,OAAQkmC,GAASlmC,GAAOtH,OAE1B,IAAK,IAAIgM,KAAO1E,EACd,GAAI01B,EAAej9B,KAAKuH,EAAO0E,GAC7B,OAAO,EAGX,OAAO,GAqpKT8V,GAAOqnC,QAtnKP,SAAiB7hD,EAAO4iC,GACtB,OAAOe,GAAY3jC,EAAO4iC,IAsnK5BpoB,GAAOsnC,YAnlKP,SAAqB9hD,EAAO4iC,EAAO9E,GAEjC,IAAIrZ,GADJqZ,EAAkC,mBAAdA,EAA2BA,EAAaj2B,IAClCi2B,EAAW99B,EAAO4iC,GAAS/6B,GACrD,OAAO4c,IAAW5c,GAAY87B,GAAY3jC,EAAO4iC,EAAO/6B,GAAWi2B,KAAgBrZ,GAilKrFjK,GAAOg+B,QAAUA,GACjBh+B,GAAOwd,SA1hKP,SAAkBh4B,GAChB,MAAuB,iBAATA,GAAqB+3B,EAAe/3B,IA0hKpDwa,GAAOunB,WAAaA,GACpBvnB,GAAOi+B,UAAYA,GACnBj+B,GAAOq4B,SAAWA,GAClBr4B,GAAO6I,MAAQA,GACf7I,GAAOunC,QA11JP,SAAiB77B,EAAQ/I,GACvB,OAAO+I,IAAW/I,GAAUooB,GAAYrf,EAAQ/I,EAAQupB,GAAavpB,KA01JvE3C,GAAOwnC,YAvzJP,SAAqB97B,EAAQ/I,EAAQ2gB,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAaj2B,GACrD09B,GAAYrf,EAAQ/I,EAAQupB,GAAavpB,GAAS2gB,IAszJ3DtjB,GAAOta,MAvxJP,SAAeF,GAIb,OAAO04C,GAAS14C,IAAUA,IAAUA,GAoxJtCwa,GAAOynC,SAvvJP,SAAkBjiD,GAChB,GAAIizC,GAAWjzC,GACb,MAAM,IAAI3H,EAtsXM,mEAwsXlB,OAAOutC,GAAa5lC,IAovJtBwa,GAAO0nC,MAxsJP,SAAeliD,GACb,OAAgB,MAATA,GAwsJTwa,GAAO2nC,OAjuJP,SAAgBniD,GACd,OAAiB,OAAVA,GAiuJTwa,GAAOk+B,SAAWA,GAClBl+B,GAAOyf,SAAWA,GAClBzf,GAAOof,aAAeA,GACtBpf,GAAO8sB,cAAgBA,GACvB9sB,GAAO+I,SAAWA,GAClB/I,GAAO4nC,cArlJP,SAAuBpiD,GACrB,OAAOy4C,GAAUz4C,KAAoB6a,IAAV7a,GAA8BA,GAAS6a,IAqlJpEL,GAAOiJ,MAAQA,GACfjJ,GAAOm+B,SAAWA,GAClBn+B,GAAO6mB,SAAWA,GAClB7mB,GAAOmJ,aAAeA,GACtBnJ,GAAO6nC,YAn/IP,SAAqBriD,GACnB,OAAOA,IAAU6H,IAm/InB2S,GAAO8nC,UA/9IP,SAAmBtiD,GACjB,OAAO45B,GAAa55B,IAAUq+B,GAAOr+B,IAAUgc,IA+9IjDxB,GAAO+nC,UA38IP,SAAmBviD,GACjB,OAAO45B,GAAa55B,IAn6XP,oBAm6XiBuiC,GAAWviC,IA28I3Cwa,GAAOqG,KAz/RP,SAAckD,EAAOk7B,GACnB,OAAgB,MAATl7B,EAAgB,GAAKkU,EAAWx/B,KAAKsrB,EAAOk7B,IAy/RrDzkC,GAAOkgC,UAAYA,GACnBlgC,GAAOipB,KAAOA,GACdjpB,GAAOgoC,YAh9RP,SAAqBz+B,EAAO/jB,EAAO2lB,GACjC,IAAIjtB,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIkC,EAAQlC,EAKZ,OAJIitB,IAAc9d,KAEhBjN,GADAA,EAAQ+2C,GAAUhsB,IACF,EAAIwS,EAAUz/B,EAASkC,EAAO,GAAKw9B,EAAUx9B,EAAOlC,EAAS,IAExEsH,GAAUA,EArvMrB,SAA2B+jB,EAAO/jB,EAAO2lB,GAEvC,IADA,IAAI/qB,EAAQ+qB,EAAY,EACjB/qB,KACL,GAAImpB,EAAMnpB,KAAWoF,EACnB,OAAOpF,EAGX,OAAOA,EA+uMD6nD,CAAkB1+B,EAAO/jB,EAAOpF,GAChC8qB,GAAc3B,EAAO+B,GAAWlrB,GAAO,IAq8R7C4f,GAAOmgC,UAAYA,GACnBngC,GAAOogC,WAAaA,GACpBpgC,GAAOo+B,GAAKA,GACZp+B,GAAOq+B,IAAMA,GACbr+B,GAAOtT,IAhfP,SAAa6c,GACX,OAAQA,GAASA,EAAMrrB,OACnB0oC,GAAard,EAAO+hB,GAAUnD,IAC9B96B,IA8eN2S,GAAOkoC,MApdP,SAAe3+B,EAAOE,GACpB,OAAQF,GAASA,EAAMrrB,OACnB0oC,GAAard,EAAO8jB,GAAY5jB,EAAU,GAAI0e,IAC9C96B,IAkdN2S,GAAOmoC,KAjcP,SAAc5+B,GACZ,OAAOiC,GAASjC,EAAO+hB,KAiczBtrB,GAAOooC,OAvaP,SAAgB7+B,EAAOE,GACrB,OAAO+B,GAASjC,EAAO8jB,GAAY5jB,EAAU,KAua/CzJ,GAAOxR,IAlZP,SAAa+a,GACX,OAAQA,GAASA,EAAMrrB,OACnB0oC,GAAard,EAAO+hB,GAAUS,IAC9B1+B,IAgZN2S,GAAOqoC,MAtXP,SAAe9+B,EAAOE,GACpB,OAAQF,GAASA,EAAMrrB,OACnB0oC,GAAard,EAAO8jB,GAAY5jB,EAAU,GAAIsiB,IAC9C1+B,IAoXN2S,GAAOk4B,UAAYA,GACnBl4B,GAAO04B,UAAYA,GACnB14B,GAAOsoC,WAztBP,WACE,MAAO,IAytBTtoC,GAAOuoC,WAzsBP,WACE,MAAO,IAysBTvoC,GAAOwoC,SAzrBP,WACE,OAAO,GAyrBTxoC,GAAO2hC,SAAWA,GAClB3hC,GAAOyoC,IA77RP,SAAal/B,EAAOlsB,GAClB,OAAQksB,GAASA,EAAMrrB,OAAU+uC,GAAQ1jB,EAAO4tB,GAAU95C,IAAMgQ,IA67RlE2S,GAAO0oC,WAliCP,WAIE,OAHI5gC,GAAKuS,IAAMh7B,OACbyoB,GAAKuS,EAAIqB,GAEJr8B,MA+hCT2gB,GAAOjK,KAAOA,GACdiK,GAAO8c,IAAMA,GACb9c,GAAO2oC,IAj5EP,SAAa38B,EAAQ9tB,EAAQk4C,GAC3BpqB,EAASiP,GAASjP,GAGlB,IAAI48B,GAFJ1qD,EAASi5C,GAAUj5C,IAEMw7B,GAAW1N,GAAU,EAC9C,IAAK9tB,GAAuBA,GAAb0qD,EACb,OAAO58B,EAET,IAAIyjB,GAAOvxC,EAAS0qD,GAAa,EACjC,OACEzS,GAAcjZ,EAAYuS,GAAM2G,GAChCpqB,EACAmqB,GAAcnZ,EAAWyS,GAAM2G,IAs4EnCp2B,GAAO6oC,OA32EP,SAAgB78B,EAAQ9tB,EAAQk4C,GAC9BpqB,EAASiP,GAASjP,GAGlB,IAAI48B,GAFJ1qD,EAASi5C,GAAUj5C,IAEMw7B,GAAW1N,GAAU,EAC9C,OAAQ9tB,GAAU0qD,EAAY1qD,EACzB8tB,EAASmqB,GAAcj4C,EAAS0qD,EAAWxS,GAC5CpqB,GAq2ENhM,GAAO8oC,SA30EP,SAAkB98B,EAAQ9tB,EAAQk4C,GAChCpqB,EAASiP,GAASjP,GAGlB,IAAI48B,GAFJ1qD,EAASi5C,GAAUj5C,IAEMw7B,GAAW1N,GAAU,EAC9C,OAAQ9tB,GAAU0qD,EAAY1qD,EACzBi4C,GAAcj4C,EAAS0qD,EAAWxS,GAASpqB,EAC5CA,GAq0ENhM,GAAO1B,SA1yEP,SAAkB0N,EAAQ+8B,EAAO3V,GAM/B,OALIA,GAAkB,MAAT2V,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJjrB,EAAe7C,GAASjP,GAAQroB,QAAQ0f,GAAa,IAAK0lC,GAAS,IAqyE5E/oC,GAAOlW,OA1rFP,SAAgBo5B,EAAOC,EAAO6lB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyB3V,GAAenQ,EAAOC,EAAO6lB,KAC3E7lB,EAAQ6lB,EAAW37C,IAEjB27C,IAAa37C,KACK,kBAAT81B,GACT6lB,EAAW7lB,EACXA,EAAQ91B,IAEe,kBAAT61B,IACd8lB,EAAW9lB,EACXA,EAAQ71B,KAGR61B,IAAU71B,IAAa81B,IAAU91B,IACnC61B,EAAQ,EACRC,EAAQ,IAGRD,EAAQsT,GAAStT,GACbC,IAAU91B,IACZ81B,EAAQD,EACRA,EAAQ,GAERC,EAAQqT,GAASrT,IAGTA,EAARD,EAAe,CACjB,IAAI+lB,EAAO/lB,EACXA,EAAQC,EACRA,EAAQ8lB,EAEV,GAAID,GAAY9lB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAI+V,EAAOnb,IACX,OAAOH,EAAUsF,EAASgW,GAAQ/V,EAAQD,EAAQzb,GAAe,QAAUyxB,EAAO,IAAIh7C,OAAS,KAAOilC,GAExG,OAAOzB,GAAWwB,EAAOC,IAupF3BnjB,GAAOkpC,OA5+NP,SAAgBl+B,EAAYvB,EAAUC,GACpC,IAAIN,EAAO5nB,GAAQwpB,GAAcP,GAAcmB,GAC3ClB,EAAYxnB,UAAUhF,OAAS,EAEnC,OAAOkrB,EAAK4B,EAAYqiB,GAAY5jB,EAAU,GAAIC,EAAagB,EAAW6X,KAy+N5EviB,GAAOmpC,YAh9NP,SAAqBn+B,EAAYvB,EAAUC,GACzC,IAAIN,EAAO5nB,GAAQwpB,GAAcL,GAAmBiB,GAChDlB,EAAYxnB,UAAUhF,OAAS,EAEnC,OAAOkrB,EAAK4B,EAAYqiB,GAAY5jB,EAAU,GAAIC,EAAagB,EAAW+b,KA68N5EzmB,GAAOopC,OA/wEP,SAAgBp9B,EAAQ3uB,EAAG+1C,GAMzB,OAJE/1C,GADG+1C,EAAQC,GAAernB,EAAQ3uB,EAAG+1C,GAAS/1C,IAAMgQ,IAChD,EAEA8pC,GAAU95C,GAETixC,GAAWrT,GAASjP,GAAS3uB,IA0wEtC2iB,GAAOrc,QApvEP,WACE,IAAIpD,EAAO2C,UACP8oB,EAASiP,GAAS16B,EAAK,IAE3B,OAAOA,EAAKrC,OAAS,EAAI8tB,EAASA,EAAOroB,QAAQpD,EAAK,GAAIA,EAAK,KAivEjEyf,GAAOiK,OAtoGP,SAAgByB,EAAQ+b,EAAMuO,GAG5B,IAAI51C,GAAS,EACTlC,GAHJupC,EAAOC,GAASD,EAAM/b,IAGJxtB,OAOlB,IAJKA,IACHA,EAAS,EACTwtB,EAASre,MAEFjN,EAAQlC,GAAQ,CACvB,IAAIsH,EAAkB,MAAVkmB,EAAiBre,GAAYqe,EAAOic,GAAMF,EAAKrnC,KACvDoF,IAAU6H,KACZjN,EAAQlC,EACRsH,EAAQwwC,GAEVtqB,EAAS6b,GAAW/hC,GAASA,EAAMvH,KAAKytB,GAAUlmB,EAEpD,OAAOkmB,GAonGT1L,GAAOlZ,MAAQA,GACfkZ,GAAOsa,aAAeA,EACtBta,GAAOqpC,OA15NP,SAAgBr+B,GAEd,OADWxpB,GAAQwpB,GAAcyW,GAAckN,IACnC3jB,IAy5NdhL,GAAO7Y,KA/0NP,SAAc6jB,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIihB,GAAYjhB,GACd,OAAOmzB,GAASnzB,GAAc0O,GAAW1O,GAAcA,EAAW9sB,OAEpE,IAAI0lC,EAAMC,GAAO7Y,GACjB,OAAI4Y,GAAO5iB,IAAU4iB,GAAOviB,GACnB2J,EAAW7jB,KAEbukC,GAAS1gB,GAAY9sB,QAq0N9B8hB,GAAOqgC,UAAYA,GACnBrgC,GAAOspC,KA/xNP,SAAct+B,EAAYlB,EAAWspB,GACnC,IAAIhqB,EAAO5nB,GAAQwpB,GAAcJ,GAAYwkB,GAI7C,OAHIgE,GAASC,GAAeroB,EAAYlB,EAAWspB,KACjDtpB,EAAYzc,IAEP+b,EAAK4B,EAAYqiB,GAAYvjB,EAAW,KA2xNjD9J,GAAOupC,YAhsRP,SAAqBhgC,EAAO/jB,GAC1B,OAAO6pC,GAAgB9lB,EAAO/jB,IAgsRhCwa,GAAOwpC,cApqRP,SAAuBjgC,EAAO/jB,EAAOikB,GACnC,OAAOimB,GAAkBnmB,EAAO/jB,EAAO6nC,GAAY5jB,EAAU,KAoqR/DzJ,GAAOypC,cAjpRP,SAAuBlgC,EAAO/jB,GAC5B,IAAItH,EAAkB,MAATqrB,EAAgB,EAAIA,EAAMrrB,OACvC,GAAIA,EAAQ,CACV,IAAIkC,EAAQivC,GAAgB9lB,EAAO/jB,GACnC,GAAIpF,EAAQlC,GAAU+jC,GAAG1Y,EAAMnpB,GAAQoF,GACrC,OAAOpF,EAGX,OAAQ,GA0oRV4f,GAAO0pC,gBArnRP,SAAyBngC,EAAO/jB,GAC9B,OAAO6pC,GAAgB9lB,EAAO/jB,GAAO,IAqnRvCwa,GAAO2pC,kBAzlRP,SAA2BpgC,EAAO/jB,EAAOikB,GACvC,OAAOimB,GAAkBnmB,EAAO/jB,EAAO6nC,GAAY5jB,EAAU,IAAI,IAylRnEzJ,GAAO4pC,kBAtkRP,SAA2BrgC,EAAO/jB,GAEhC,GADsB,MAAT+jB,GAAoBA,EAAMrrB,OAC3B,CACV,IAAIkC,EAAQivC,GAAgB9lB,EAAO/jB,GAAO,GAAQ,EAClD,GAAIy8B,GAAG1Y,EAAMnpB,GAAQoF,GACnB,OAAOpF,EAGX,OAAQ,GA+jRV4f,GAAOsgC,UAAYA,GACnBtgC,GAAO6pC,WA3oEP,SAAoB79B,EAAQ1X,EAAQ7H,GAOlC,OANAuf,EAASiP,GAASjP,GAClBvf,EAAuB,MAAZA,EACP,EACAq1B,GAAUqV,GAAU1qC,GAAW,EAAGuf,EAAO9tB,QAE7CoW,EAASg8B,GAAah8B,GACf0X,EAAOxrB,MAAMiM,EAAUA,EAAW6H,EAAOpW,SAAWoW,GAqoE7D0L,GAAO8hC,SAAWA,GAClB9hC,GAAO8pC,IAzUP,SAAavgC,GACX,OAAQA,GAASA,EAAMrrB,OACnButB,GAAQlC,EAAO+hB,IACf,GAuUNtrB,GAAO+pC,MA7SP,SAAexgC,EAAOE,GACpB,OAAQF,GAASA,EAAMrrB,OACnButB,GAAQlC,EAAO8jB,GAAY5jB,EAAU,IACrC,GA2SNzJ,GAAOgqC,SA7hEP,SAAkBh+B,EAAQrnB,EAASyuC,GAIjC,IAAI6W,EAAWjqC,GAAO4lB,iBAElBwN,GAASC,GAAernB,EAAQrnB,EAASyuC,KAC3CzuC,EAAU0I,IAEZ2e,EAASiP,GAASjP,GAClBrnB,EAAUm6C,GAAa,GAAIn6C,EAASslD,EAAUtS,IAE9C,IAIIuS,EACAC,EALAlkB,EAAU6Y,GAAa,GAAIn6C,EAAQshC,QAASgkB,EAAShkB,QAAS0R,IAC9DyS,EAAc9uB,GAAK2K,GACnBokB,EAAgBl+B,GAAW8Z,EAASmkB,GAIpChqD,EAAQ,EACR2lC,EAAcphC,EAAQohC,aAAe1hB,GACrC1B,EAAS,WAGT2nC,EAAe5nC,GAChB/d,EAAQkhC,QAAUxhB,IAAW1B,OAAS,IACvCojB,EAAYpjB,OAAS,KACpBojB,IAAgBhjB,GAAgBc,GAAeQ,IAAW1B,OAAS,KACnEhe,EAAQmhC,UAAYzhB,IAAW1B,OAAS,KACzC,KAME4nC,EAAY,kBACbrvB,EAAej9B,KAAK0G,EAAS,cACzBA,EAAQ4lD,UAAY,IAAI5mD,QAAQ,MAAO,KACvC,6BAA+BojB,GAAmB,KACnD,KAENiF,EAAOroB,QAAQ2mD,EAAc,SAAS1mD,EAAO4mD,EAAaC,EAAkBC,EAAiBC,EAAej7C,GAsB1G,OArBA+6C,IAAqBA,EAAmBC,GAGxC/nC,GAAUqJ,EAAOxrB,MAAMJ,EAAOsP,GAAQ/L,QAAQ2gB,GAAmB0U,IAG7DwxB,IACFN,GAAa,EACbvnC,GAAU,YAAc6nC,EAAc,UAEpCG,IACFR,GAAe,EACfxnC,GAAU,OAASgoC,EAAgB,eAEjCF,IACF9nC,GAAU,iBAAmB8nC,EAAmB,+BAElDrqD,EAAQsP,EAAS9L,EAAM1F,OAIhB0F,IAGT+e,GAAU,OAIV,IAAIqjB,EAAW9K,EAAej9B,KAAK0G,EAAS,aAAeA,EAAQqhC,SACnE,GAAKA,GAKA,GAAIriB,GAA2BnG,KAAKwoB,GACvC,MAAM,IAAInoC,EA3idmB,2DAsid7B8kB,EAAS,iBAAmBA,EAAS,QASvCA,GAAUwnC,EAAexnC,EAAOhf,QAAQye,GAAsB,IAAMO,GACjEhf,QAAQ0e,GAAqB,MAC7B1e,QAAQ2e,GAAuB,OAGlCK,EAAS,aAAeqjB,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCkkB,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJxnC,EACA,gBAEF,IAAIsH,EAASy2B,GAAQ,WACnB,OAAO34B,EAASqiC,EAAaG,EAAY,UAAY5nC,GAClDjiB,MAAM2M,GAAWg9C,KAMtB,GADApgC,EAAOtH,OAASA,EACZq7B,GAAQ/zB,GACV,MAAMA,EAER,OAAOA,GA46DTjK,GAAO4qC,MApsBP,SAAevtD,EAAGosB,GAEhB,IADApsB,EAAI85C,GAAU95C,IACN,GAASgjB,GAAJhjB,EACX,MAAO,GAET,IAAI+C,EAAQmgB,GACRriB,EAAS0/B,EAAUvgC,EAAGkjB,IAE1BkJ,EAAW4jB,GAAY5jB,GACvBpsB,GAAKkjB,GAGL,IADA,IAAI0J,EAAS6B,GAAU5tB,EAAQurB,KACtBrpB,EAAQ/C,GACfosB,EAASrpB,GAEX,OAAO6pB,GAsrBTjK,GAAOw2B,SAAWA,GAClBx2B,GAAOm3B,UAAYA,GACnBn3B,GAAO0+B,SAAWA,GAClB1+B,GAAO6qC,QAx5DP,SAAiBrlD,GACf,OAAOy1B,GAASz1B,GAAOzB,eAw5DzBic,GAAO22B,SAAWA,GAClB32B,GAAO8qC,cApuIP,SAAuBtlD,GACrB,OAAOA,EACHs8B,GAAUqV,GAAU3xC,IAAS6a,GAAkBA,IACpC,IAAV7a,EAAcA,EAAQ,GAkuI7Bwa,GAAOib,SAAWA,GAClBjb,GAAO+qC,QAn4DP,SAAiBvlD,GACf,OAAOy1B,GAASz1B,GAAOg7C,eAm4DzBxgC,GAAOrE,KA12DP,SAAcqQ,EAAQoqB,EAAOhD,GAE3B,IADApnB,EAASiP,GAASjP,MACHonB,GAASgD,IAAU/oC,IAChC,OAAO0e,GAASC,GAElB,IAAKA,KAAYoqB,EAAQ9F,GAAa8F,IACpC,OAAOpqB,EAET,IAAIS,EAAaoN,GAAc7N,GAC3BU,EAAamN,GAAcuc,GAI/B,OAAO3E,GAAUhlB,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETrG,KAAK,KA81DhDrG,GAAOgrC,QAx0DP,SAAiBh/B,EAAQoqB,EAAOhD,GAE9B,IADApnB,EAASiP,GAASjP,MACHonB,GAASgD,IAAU/oC,IAChC,OAAO2e,EAAOxrB,MAAM,EAAGyrB,GAAgBD,GAAU,GAEnD,IAAKA,KAAYoqB,EAAQ9F,GAAa8F,IACpC,OAAOpqB,EAET,IAAIS,EAAaoN,GAAc7N,GAG/B,OAAOylB,GAAUhlB,EAAY,EAFnBE,GAAcF,EAAYoN,GAAcuc,IAAU,GAEvB/vB,KAAK,KA8zD5CrG,GAAOirC,UAxyDP,SAAmBj/B,EAAQoqB,EAAOhD,GAEhC,IADApnB,EAASiP,GAASjP,MACHonB,GAASgD,IAAU/oC,IAChC,OAAO2e,EAAOroB,QAAQ0f,GAAa,IAErC,IAAK2I,KAAYoqB,EAAQ9F,GAAa8F,IACpC,OAAOpqB,EAET,IAAIS,EAAaoN,GAAc7N,GAG/B,OAAOylB,GAAUhlB,EAFLD,GAAgBC,EAAYoN,GAAcuc,KAElB/vB,KAAK,KA8xD3CrG,GAAOkrC,SAtvDP,SAAkBl/B,EAAQrnB,GACxB,IAAIzG,EAnvdmB,GAovdnBitD,EAnvdqB,MAqvdzB,GAAI1rB,GAAS96B,GAAU,CACrB,IAAI8/C,EAAY,cAAe9/C,EAAUA,EAAQ8/C,UAAYA,EAC7DvmD,EAAS,WAAYyG,EAAUwyC,GAAUxyC,EAAQzG,QAAUA,EAC3DitD,EAAW,aAAcxmD,EAAU2rC,GAAa3rC,EAAQwmD,UAAYA,EAItE,IAAIvC,GAFJ58B,EAASiP,GAASjP,IAEK9tB,OACvB,GAAIg7B,GAAWlN,GAAS,CACtB,IAAIS,EAAaoN,GAAc7N,GAC/B48B,EAAYn8B,EAAWvuB,OAEzB,GAAc0qD,GAAV1qD,EACF,OAAO8tB,EAET,IAAImjB,EAAMjxC,EAASw7B,GAAWyxB,GAC9B,GAAIhc,EAAM,EACR,OAAOgc,EAET,IAAIlhC,EAASwC,EACTglB,GAAUhlB,EAAY,EAAG0iB,GAAK9oB,KAAK,IACnC2F,EAAOxrB,MAAM,EAAG2uC,GAEpB,GAAIsV,IAAcp3C,GAChB,OAAO4c,EAASkhC,EAKlB,GAHI1+B,IACF0iB,GAAQllB,EAAO/rB,OAASixC,GAEtBpmB,GAAS07B,IACX,GAAIz4B,EAAOxrB,MAAM2uC,GAAKic,OAAO3G,GAAY,CACvC,IAAI7gD,EACAynD,EAAYphC,EAMhB,IAJKw6B,EAAUrlD,SACbqlD,EAAY/hC,EAAO+hC,EAAU9hC,OAAQsY,GAASnX,GAAQuX,KAAKopB,IAAc,MAE3EA,EAAU9qB,UAAY,EACd/1B,EAAQ6gD,EAAUppB,KAAKgwB,IAC7B,IAAIC,EAAS1nD,EAAMxD,MAErB6pB,EAASA,EAAOzpB,MAAM,EAAG8qD,IAAWj+C,GAAY8hC,EAAMmc,SAEnD,GAAIt/B,EAAOlsB,QAAQwwC,GAAamU,GAAYtV,IAAQA,EAAK,CAC9D,IAAI/uC,EAAQ6pB,EAAO+9B,YAAYvD,IAClB,EAATrkD,IACF6pB,EAASA,EAAOzpB,MAAM,EAAGJ,IAG7B,OAAO6pB,EAASkhC,GAksDlBnrC,GAAOurC,SA5qDP,SAAkBv/B,GAEhB,OADAA,EAASiP,GAASjP,KACAvJ,GAAiBjF,KAAKwO,GACpCA,EAAOroB,QAAQ4e,GAAewX,IAC9B/N,GAyqDNhM,GAAOwrC,SAvpBP,SAAkBC,GAChB,IAAIjiD,IAAO2xB,EACX,OAAOF,GAASwwB,GAAUjiD,GAspB5BwW,GAAOugC,UAAYA,GACnBvgC,GAAOigC,WAAaA,GAGpBjgC,GAAO0rC,KAAOnpD,GACdyd,GAAO2rC,UAAYpQ,GACnBv7B,GAAO4rC,MAAQ/R,GAEfmH,GAAMhhC,IACA2C,GAAS,GACb6jB,GAAWxmB,GAAQ,SAASoJ,EAAMvmB,GAC3Bq4B,EAAej9B,KAAK+hB,GAAOnhB,UAAWgE,KACzC8f,GAAO9f,GAAcumB,KAGlBzG,IACH,CAAEs4B,OAAS,IAWjBj7B,GAAO6rC,QA/ihBK,UAkjhBZliC,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,gBAAiB,SAAS9mB,GACxFmd,GAAOnd,GAAY02B,YAAcvZ,KAInC2J,GAAU,CAAC,OAAQ,QAAS,SAAS9mB,EAAYzC,GAC/Ci/B,GAAYxgC,UAAUgE,GAAc,SAASxF,GAC3CA,EAAIA,IAAMgQ,GAAY,EAAIswB,EAAUwZ,GAAU95C,GAAI,GAElD,IAAI4sB,EAAU5qB,KAAK6gC,eAAiB9/B,EAChC,IAAIi/B,GAAYhgC,MAChBA,KAAKk6C,QAUT,OARItvB,EAAOiW,aACTjW,EAAOmW,cAAgBxC,EAAUvgC,EAAG4sB,EAAOmW,eAE3CnW,EAAOoW,UAAUtgC,KAAK,CACpBoH,KAAQy2B,EAAUvgC,EAAGkjB,IACrBpe,KAAQU,GAAconB,EAAOgW,QAAU,EAAI,QAAU,MAGlDhW,GAGToV,GAAYxgC,UAAUgE,EAAa,SAAW,SAASxF,GACrD,OAAOgC,KAAK4+B,UAAUp7B,GAAYxF,GAAG4gC,aAKzCtU,GAAU,CAAC,SAAU,MAAO,aAAc,SAAS9mB,EAAYzC,GAC7D,IAAI+B,EAAO/B,EAAQ,EACf0rD,EAjihBe,GAiihBJ3pD,GA/hhBG,GA+hhByBA,EAE3Ck9B,GAAYxgC,UAAUgE,GAAc,SAAS4mB,GAC3C,IAAIQ,EAAS5qB,KAAKk6C,QAMlB,OALAtvB,EAAOkW,cAAcpgC,KAAK,CACxB0pB,SAAY4jB,GAAY5jB,EAAU,GAClCtnB,KAAQA,IAEV8nB,EAAOiW,aAAejW,EAAOiW,cAAgB4rB,EACtC7hC,KAKXN,GAAU,CAAC,OAAQ,QAAS,SAAS9mB,EAAYzC,GAC/C,IAAI2rD,EAAW,QAAU3rD,EAAQ,QAAU,IAE3Ci/B,GAAYxgC,UAAUgE,GAAc,WAClC,OAAOxD,KAAK0sD,GAAU,GAAGvmD,QAAQ,MAKrCmkB,GAAU,CAAC,UAAW,QAAS,SAAS9mB,EAAYzC,GAClD,IAAI4rD,EAAW,QAAU5rD,EAAQ,GAAK,SAEtCi/B,GAAYxgC,UAAUgE,GAAc,WAClC,OAAOxD,KAAK6gC,aAAe,IAAIb,GAAYhgC,MAAQA,KAAK2sD,GAAU,MAItE3sB,GAAYxgC,UAAUujD,QAAU,WAC9B,OAAO/iD,KAAKgZ,OAAOizB,KAGrBjM,GAAYxgC,UAAUw8C,KAAO,SAASvxB,GACpC,OAAOzqB,KAAKgZ,OAAOyR,GAAW+vB,QAGhCxa,GAAYxgC,UAAUy8C,SAAW,SAASxxB,GACxC,OAAOzqB,KAAK4+B,UAAUod,KAAKvxB,IAG7BuV,GAAYxgC,UAAU48C,UAAYlN,GAAS,SAAS9G,EAAMlnC,GACxD,MAAmB,mBAARknC,EACF,IAAIpI,GAAYhgC,MAElBA,KAAKuY,IAAI,SAASpS,GACvB,OAAOujC,GAAWvjC,EAAOiiC,EAAMlnC,OAInC8+B,GAAYxgC,UAAUslD,OAAS,SAASr6B,GACtC,OAAOzqB,KAAKgZ,OAAOklC,GAAOlQ,GAAYvjB,MAGxCuV,GAAYxgC,UAAU2B,MAAQ,SAASguC,EAAOW,GAC5CX,EAAQ2I,GAAU3I,GAElB,IAAIvkB,EAAS5qB,KACb,OAAI4qB,EAAOiW,eAAyB,EAARsO,GAAaW,EAAM,GACtC,IAAI9P,GAAYpV,IAErBukB,EAAQ,EACVvkB,EAASA,EAAO66B,WAAWtW,GAClBA,IACTvkB,EAASA,EAAOy4B,KAAKlU,IAEnBW,IAAQ9hC,KAEV4c,GADAklB,EAAMgI,GAAUhI,IACD,EAAIllB,EAAO04B,WAAWxT,GAAOllB,EAAO46B,KAAK1V,EAAMX,IAEzDvkB,IAGToV,GAAYxgC,UAAUkmD,eAAiB,SAASj7B,GAC9C,OAAOzqB,KAAK4+B,UAAU+mB,UAAUl7B,GAAWmU,WAG7CoB,GAAYxgC,UAAUy/C,QAAU,WAC9B,OAAOj/C,KAAKwlD,KAAKtkC,KAInBimB,GAAWnH,GAAYxgC,UAAW,SAASuqB,EAAMvmB,GAC/C,IAAIopD,EAAgB,qCAAqCzuC,KAAK3a,GAC1DqpD,EAAU,kBAAkB1uC,KAAK3a,GACjCspD,EAAansC,GAAOksC,EAAW,QAAwB,QAAdrpD,EAAuB,QAAU,IAAOA,GACjFupD,EAAeF,GAAW,QAAQ1uC,KAAK3a,GAEtCspD,IAGLnsC,GAAOnhB,UAAUgE,GAAc,WAC7B,IAAI2C,EAAQnG,KAAKugC,YACbr/B,EAAO2rD,EAAU,CAAC,GAAKhpD,UACvBmpD,EAAS7mD,aAAiB65B,GAC1B5V,EAAWlpB,EAAK,GAChB+rD,EAAUD,GAAU7qD,GAAQgE,GAE5B01C,EAAc,SAAS11C,GACzB,IAAIykB,EAASkiC,EAAWzrD,MAAMsf,GAAQuK,GAAU,CAAC/kB,GAAQjF,IACzD,OAAQ2rD,GAAWvsB,EAAY1V,EAAO,GAAKA,GAGzCqiC,GAAWL,GAAoC,mBAAZxiC,GAA6C,GAAnBA,EAASvrB,SAExEmuD,EAASC,GAAU,GAErB,IAAI3sB,EAAWtgC,KAAKygC,UAChBysB,IAAaltD,KAAKwgC,YAAY3hC,OAC9BsuD,EAAcJ,IAAiBzsB,EAC/B8sB,EAAWJ,IAAWE,EAE1B,GAAKH,IAAgBE,EAMrB,OAAIE,GAAeC,EACVrjC,EAAK1oB,MAAMrB,KAAMkB,IAE1B0pB,EAAS5qB,KAAK+0C,KAAK8G,GACZsR,EAAeN,EAAUjiC,EAAOzkB,QAAQ,GAAKykB,EAAOzkB,QAAWykB,GATpEzkB,EAAQinD,EAAWjnD,EAAQ,IAAI65B,GAAYhgC,MAC3C,IAAI4qB,EAASb,EAAK1oB,MAAM8E,EAAOjF,GAE/B,OADA0pB,EAAO4V,YAAY9/B,KAAK,CAAEqpB,KAAQgrB,GAAM7zC,KAAQ,CAAC26C,GAAc7xB,QAAWhc,KACnE,IAAIiyB,GAAcrV,EAAQ0V,OAWvChW,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,WAAY,SAAS9mB,GACxE,IAAIumB,EAAOwR,EAAW/3B,GAClB6pD,EAAY,0BAA0BlvC,KAAK3a,GAAc,MAAQ,OACjEupD,EAAe,kBAAkB5uC,KAAK3a,GAE1Cmd,GAAOnhB,UAAUgE,GAAc,WAC7B,IAAItC,EAAO2C,UACX,IAAIkpD,GAAiB/sD,KAAKygC,UAI1B,OAAOzgC,KAAKqtD,GAAW,SAASlnD,GAC9B,OAAO4jB,EAAK1oB,MAAMc,GAAQgE,GAASA,EAAQ,GAAIjF,KAJ/C,IAAIiF,EAAQnG,KAAKmG,QACjB,OAAO4jB,EAAK1oB,MAAMc,GAAQgE,GAASA,EAAQ,GAAIjF,MASrDimC,GAAWnH,GAAYxgC,UAAW,SAASuqB,EAAMvmB,GAC/C,IAAIspD,EAAansC,GAAOnd,GACxB,GAAIspD,EAAY,CACd,IAAIjiD,EAAMiiD,EAAWnwC,KAAO,GACvBkf,EAAej9B,KAAKwgC,GAAWv0B,KAClCu0B,GAAUv0B,GAAO,IAEnBu0B,GAAUv0B,GAAKnK,KAAK,CAAEic,KAAQnZ,EAAYumB,KAAQ+iC,OAItD1tB,GAAUkW,GAAatnC,GAlthBA,GAkthB+B2O,MAAQ,CAAC,CAC7DA,KAAQ,UACRoN,KAAQ/b,KAIVgyB,GAAYxgC,UAAU06C,MAh9dtB,WACE,IAAItvB,EAAS,IAAIoV,GAAYhgC,KAAKugC,aAOlC,OANA3V,EAAO4V,YAAcgC,GAAUxiC,KAAKwgC,aACpC5V,EAAOgW,QAAU5gC,KAAK4gC,QACtBhW,EAAOiW,aAAe7gC,KAAK6gC,aAC3BjW,EAAOkW,cAAgB0B,GAAUxiC,KAAK8gC,eACtClW,EAAOmW,cAAgB/gC,KAAK+gC,cAC5BnW,EAAOoW,UAAYwB,GAAUxiC,KAAKghC,WAC3BpW,GAy8dToV,GAAYxgC,UAAUo/B,QA97dtB,WACE,GAAI5+B,KAAK6gC,aAAc,CACrB,IAAIjW,EAAS,IAAIoV,GAAYhgC,MAC7B4qB,EAAOgW,SAAW,EAClBhW,EAAOiW,cAAe,OAEtBjW,EAAS5qB,KAAKk6C,SACPtZ,UAAY,EAErB,OAAOhW,GAs7dToV,GAAYxgC,UAAU2G,MA36dtB,WACE,IAAI+jB,EAAQlqB,KAAKugC,YAAYp6B,QACzBmnD,EAAMttD,KAAK4gC,QACXiB,EAAQ1/B,GAAQ+nB,GAChBqjC,EAAUD,EAAM,EAChBlX,EAAYvU,EAAQ3X,EAAMrrB,OAAS,EACnC2uD,EA8pIN,SAAiBre,EAAOW,EAAKsO,GAI3B,IAHA,IAAIr9C,GAAS,EACTlC,EAASu/C,EAAWv/C,SAEfkC,EAAQlC,GAAQ,CACvB,IAAIiH,EAAOs4C,EAAWr9C,GAClB+G,EAAOhC,EAAKgC,KAEhB,OAAQhC,EAAKhD,MACX,IAAK,OAAaqsC,GAASrnC,EAAM,MACjC,IAAK,YAAagoC,GAAOhoC,EAAM,MAC/B,IAAK,OAAagoC,EAAMvR,EAAUuR,EAAKX,EAAQrnC,GAAO,MACtD,IAAK,YAAaqnC,EAAQ7Q,EAAU6Q,EAAOW,EAAMhoC,IAGrD,MAAO,CAAEqnC,MAASA,EAAOW,IAAOA,GA7qIrB2d,CAAQ,EAAGrX,EAAWp2C,KAAKghC,WAClCmO,EAAQqe,EAAKre,MACbW,EAAM0d,EAAK1d,IACXjxC,EAASixC,EAAMX,EACfpuC,EAAQwsD,EAAUzd,EAAOX,EAAQ,EACjCrB,EAAY9tC,KAAK8gC,cACjB4sB,EAAa5f,EAAUjvC,OACvB8rB,EAAW,EACXgjC,EAAYpvB,EAAU1/B,EAAQmB,KAAK+gC,eAEvC,IAAKc,IAAW0rB,GAAWnX,GAAav3C,GAAU8uD,GAAa9uD,EAC7D,OAAO4yC,GAAiBvnB,EAAOlqB,KAAKwgC,aAEtC,IAAI5V,EAAS,GAEbwb,EACA,KAAOvnC,KAAY8rB,EAAWgjC,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbznD,EAAQ+jB,EAHZnpB,GAASusD,KAKAM,EAAYF,GAAY,CAC/B,IAAI5nD,EAAOgoC,EAAU8f,GACjBxjC,EAAWtkB,EAAKskB,SAChBtnB,EAAOgD,EAAKhD,KACZujC,EAAWjc,EAASjkB,GAExB,GA7zDY,GA6zDRrD,EACFqD,EAAQkgC,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTvjC,EACF,SAASsjC,EAET,MAAMA,GAIZxb,EAAOD,KAAcxkB,EAEvB,OAAOykB,GAg4dTjK,GAAOnhB,UAAUmgD,GAAK7D,GACtBn7B,GAAOnhB,UAAUo8C,MA1iQjB,WACE,OAAOA,GAAM57C,OA0iQf2gB,GAAOnhB,UAAUquD,OA7gQjB,WACE,OAAO,IAAI5tB,GAAcjgC,KAAKmG,QAASnG,KAAKygC,YA6gQ9C9f,GAAOnhB,UAAU0/C,KAp/PjB,WACMl/C,KAAK2gC,aAAe3yB,KACtBhO,KAAK2gC,WAAase,GAAQj/C,KAAKmG,UAEjC,IAAIg5C,EAAOn/C,KAAK0gC,WAAa1gC,KAAK2gC,WAAW9hC,OAG7C,MAAO,CAAEsgD,KAAQA,EAAMh5C,MAFXg5C,EAAOnxC,GAAYhO,KAAK2gC,WAAW3gC,KAAK0gC,eAg/PtD/f,GAAOnhB,UAAU61C,MA77PjB,SAAsBlvC,GAIpB,IAHA,IAAIykB,EACA+e,EAAS3pC,KAEN2pC,aAAkBtJ,IAAY,CACnC,IAAI6Z,EAAQha,GAAayJ,GACzBuQ,EAAMxZ,UAAY,EAClBwZ,EAAMvZ,WAAa3yB,GACf4c,EACFmkB,EAASxO,YAAc2Z,EAEvBtvB,EAASsvB,EAEX,IAAInL,EAAWmL,EACfvQ,EAASA,EAAOpJ,YAGlB,OADAwO,EAASxO,YAAcp6B,EAChBykB,GA66PTjK,GAAOnhB,UAAUo/B,QAt5PjB,WACE,IAAIz4B,EAAQnG,KAAKugC,YACjB,GAAIp6B,aAAiB65B,GAAa,CAChC,IAAI8tB,EAAU3nD,EAUd,OATInG,KAAKwgC,YAAY3hC,SACnBivD,EAAU,IAAI9tB,GAAYhgC,QAE5B8tD,EAAUA,EAAQlvB,WACV4B,YAAY9/B,KAAK,CACvBqpB,KAAQgrB,GACR7zC,KAAQ,CAAC09B,IACT5U,QAAWhc,KAEN,IAAIiyB,GAAc6tB,EAAS9tD,KAAKygC,WAEzC,OAAOzgC,KAAK+0C,KAAKnW,KAw4PnBje,GAAOnhB,UAAUuuD,OAASptC,GAAOnhB,UAAUqgC,QAAUlf,GAAOnhB,UAAU2G,MAv3PtE,WACE,OAAOsrC,GAAiBzxC,KAAKugC,YAAavgC,KAAKwgC,cAy3PjD7f,GAAOnhB,UAAU+sD,MAAQ5rC,GAAOnhB,UAAUg7C,KAEtCvd,IACFtc,GAAOnhB,UAAUy9B,GAj+PnB,WACE,OAAOj9B,OAk+PF2gB,GAMDsa,GAGa,mBAAV/7B,QAA6C,iBAAdA,OAAOC,KAAmBD,OAAOC,KAKzEspB,GAAKuS,EAAIA,GAIT97B,OAAO,WACL,OAAO87B,MAIFpS,IAENA,EAAWjqB,QAAUq8B,IAAGA,EAAIA,GAE7BrS,EAAYqS,EAAIA,IAIhBvS,GAAKuS,EAAIA,KAEXp8B,KAAKoB,QAEJpB,KAAKoB,QAAQpB,KAAKoB,KAAuB,oBAAXD,OAAyBA,OAAyB,oBAATyoB,KAAuBA,KAAyB,oBAAXxpB,OAAyBA,OAAS,KAC/I,IAAIgvD,mBAAmB,CAAC,SAASnwD,EAAQkB,EAAOJ,IAalD,SAAUK,GACT,aAMA,IAAIA,EAAOqG,OAAX,CAKA,IAAI4oD,EAAI,SAASpuD,EAAUq7B,GAC1B,OAAO,IAAI+yB,EAAE7tC,GAAG8tC,KAAKruD,EAAUq7B,IAQhC+yB,EAAEE,SAAW,SAASjsD,GAErB,OAAOA,GAAOA,IAAQA,EAAIlD,QAI3BivD,EAAEnrD,KAAO,SAASZ,GACjB,OAAKA,EAIiB,iBAARA,GAAmC,mBAARA,EACvCksD,EAAWxyB,EAASh9B,KAAKsD,KAAS,gBAC3BA,EALDA,EAAM,IASf+rD,EAAE9rD,QAAUH,MAAMG,SAAW,SAASD,GACrC,MAAuB,UAAhB+rD,EAAEnrD,KAAKZ,IAwBf+rD,EAAExgB,cAAgB,SAASvrC,GAC1B,IAAI2I,EAEJ,IAAK3I,GAAuB,WAAhB+rD,EAAEnrD,KAAKZ,IAAqBA,EAAI0F,UAAYqmD,EAAEE,SAASjsD,GAClE,OAAO,EAGR,IACC,GAAIA,EAAIqK,cACL8hD,EAAOzvD,KAAKsD,EAAK,iBACjBmsD,EAAOzvD,KAAKsD,EAAIqK,YAAY/M,UAAW,iBACzC,OAAO,EAEP,MAAOzB,GACR,OAAO,EAGR,IAAK8M,KAAO3I,GAGZ,YAAe8L,IAARnD,GAAqBwjD,EAAOzvD,KAAKsD,EAAK2I,IAI9CojD,EAAE5B,KAAO,SAASnqD,EAAK+B,EAAU/C,GAChC,IACE/C,EAAI,EACJU,EAASqD,EAAIrD,OACbsD,EAAUmsD,EAAYpsD,GAExB,GAAIhB,GACH,GAAIiB,EACH,KAAOhE,EAAIU,IAGI,IAFNoF,EAAS5C,MAAMa,EAAI/D,GAAI+C,GADb/C,UAQnB,IAAKA,KAAK+D,EACT,GAAKA,EAAI25B,eAAe19B,KAKV,IAFN8F,EAAS5C,MAAMa,EAAI/D,GAAI+C,GAG9B,WAMH,GAAIiB,EACH,KAAOhE,EAAIU,IAGI,IAFNoF,EAASrF,KAAKsD,EAAI/D,GAAIA,EAAG+D,EAAI/D,IADnBA,UAQnB,IAAKA,KAAK+D,EACT,GAAKA,EAAI25B,eAAe19B,KAKV,IAFN8F,EAASrF,KAAKsD,EAAI/D,GAAIA,EAAG+D,EAAI/D,IAGpC,MAMJ,OAAO+D,GAIR+rD,EAAEnoD,KAAO,SAASyoD,EAAM1jD,EAAK1E,GAE5B,QAAc6H,IAAV7H,EAAqB,CACxB,IAAIqoD,EAAQD,EAAKN,EAAEQ,SACjBC,EAAQF,GAASvhC,EAAMuhC,GAEzB,QAAYxgD,IAARnD,EACH,OAAO6jD,EACD,GAAIA,GACN7jD,KAAO6jD,EACV,OAAOA,EAAM7jD,QAIT,QAAYmD,IAARnD,EAAmB,CAC7B,IAAI8jD,EAAQJ,EAAKN,EAAEQ,WAAaF,EAAKN,EAAEQ,WAAaR,EAAEW,MAKtD,OAHA3hC,EAAM0hC,GAAS1hC,EAAM0hC,IAAU,GAC/B1hC,EAAM0hC,GAAO9jD,GAAO1E,IAOtB8nD,EAAEnyC,WAAa,SAASyyC,EAAMtyB,GAC7B,IAAI9xB,EAAKokD,EAAKN,EAAEQ,SACdC,EAAQvkD,GAAM8iB,EAAM9iB,GAElBukD,IAEEzyB,EAGJgyB,EAAE5B,KAAKpwB,EAAM,SAASjB,EAAGnwB,UACjB6jD,EAAM7jD,YAHPoiB,EAAM9iB,KAUhB8jD,EAAExsD,OAAS,WACV,IAAIotD,EAAKC,EAAazc,EAAM11B,EAAMrX,EAAS40C,EACzCjlC,EAASpR,UAAU,IAAM,GACzB1F,EAAI,EACJU,EAASgF,UAAUhF,OACnBkwD,GAAO,EAkBT,IAhBsB,kBAAX95C,IACV85C,EAAO95C,EAEPA,EAASpR,UAAU1F,IAAM,GACzBA,KAGqB,iBAAX8W,GAA0C,aAAnBg5C,EAAEnrD,KAAKmS,KACxCA,EAAS,IAGN9W,IAAMU,IACToW,EAASjV,KACT7B,KAGMA,EAAIU,EAAQV,IAClB,GAAKmH,EAAUzB,UAAU1F,GACxB,IAAKwe,KAAQrX,EACPA,EAAQu2B,eAAelf,KAG5BkyC,EAAM55C,EAAO0H,GAGT1H,KAFJo9B,EAAO/sC,EAAQqX,MAMXoyC,GAAQ1c,IAAS4b,EAAExgB,cAAc4E,KAAUyc,EAAcb,EAAE9rD,QAAQkwC,MAGrE6H,EAFG4U,GACHA,GAAc,EACND,GAAOZ,EAAE9rD,QAAQ0sD,GAAOA,EAAM,IAG9BA,GAAOZ,EAAExgB,cAAcohB,GAAOA,EAAM,GAG7C55C,EAAO0H,GAAQsxC,EAAExsD,OAAOstD,EAAM7U,EAAO7H,SAElBrkC,IAATqkC,IACVp9B,EAAO0H,GAAQ01B,KAMnB,OAAOp9B,GAIRg5C,EAAE/0C,MAAQ,SAAStZ,EAAMkD,EAAMgD,GAkC9B,GAAKlG,EAAL,CAIAkD,GAAQA,GAAQ,MAAQ,QAExB,IAvCoBksD,EAAKC,EACpBC,EAsCDC,EAAIlB,EAAEnoD,KAAKlG,EAAMkD,GAErB,OAAKgD,IAIAqpD,GAAKlB,EAAE9rD,QAAQ2D,GACnBqpD,EAAIlB,EAAEnoD,KAAKlG,EAAMkD,GA7CbosD,EAAMD,GAAW,IADFD,EA8CelpD,KA1C7BwoD,EAAYtkD,OAAOglD,IAEtB,SAAUzC,EAAO6C,GAKhB,IAJA,IAAI5wC,GAAO4wC,EAAOvwD,OAChBwwD,EAAI,EACJlxD,EAAIouD,EAAM1tD,OAELwwD,EAAI7wC,GACV+tC,EAAMpuD,KAAOixD,EAAOC,KAGrB,GAAI7wC,GAAQA,EACX,UAAqBxQ,IAAdohD,EAAOC,IACb9C,EAAMpuD,KAAOixD,EAAOC,KAItB9C,EAAM1tD,OAASV,EAfhB,CAkBG+wD,EAAoB,iBAARF,EAAmB,CAACA,GAAOA,GAE1C,GAAGtuD,KAAK9B,KAAKswD,EAAKF,IAIbE,IAkBPC,EAAEzuD,KAAKoF,GAGDqpD,GATCA,GAAK,KAadlB,EAAEqB,QAAU,SAAStsD,EAAOF,GAE3BmrD,EAAE5B,KAAKrpD,EAAM4E,SAAW,CAAC5E,GAASA,EAAO,SAAS7E,EAAGyB,GACpDkD,EAAOA,GAAQ,KAEf,IAAIoW,EAAQ+0C,EAAE/0C,MAAMtZ,EAAMkD,GACxBsd,EAAKlH,EAAMq2C,QAEF,eAAPnvC,IACHA,EAAKlH,EAAMq2C,SAGRnvC,IACU,OAATtd,GACHoW,EAAMs2C,QAAQ,cAGfpvC,EAAGxhB,KAAKgB,EAAM,WACbquD,EAAEqB,QAAQ1vD,EAAMkD,SAWpBmrD,EAAE7tC,GAAK6tC,EAAEzuD,UAAY,CACpB0uD,KAAM,SAASruD,GAEd,GAAIA,EAAS+H,SAGZ,OAFA5H,KAAK,GAAKH,EAEHG,KAEP,MAAM,IAAIxB,MAAM,oBAGlB6R,OAAQ,WAEP,IAAIo/C,EAAMzvD,KAAK,GAAGgb,sBAAwBhb,KAAK,GAAGgb,wBAA0B,CAAClK,IAAK,EAAGP,KAAM,GAE3F,MAAO,CACNO,IAAK2+C,EAAI3+C,KAAO9R,EAAO0wD,aAAeltD,SAASmtD,WAAa,IAAMntD,SAASotD,WAAa,GACxFr/C,KAAMk/C,EAAIl/C,MAAQvR,EAAO6wD,aAAertD,SAASstD,YAAc,IAAMttD,SAASutD,YAAc,KAG9F3iD,SAAU,WAaT,IAAIxN,EAAOI,KAAK,GACdgwD,EAZF,SAAwBpwD,GAGvB,IAFA,IAAIowD,EAAepwD,EAAKowD,aAEjBA,GAAyD,SAAxCA,EAAaC,SAASvrD,eAA4BsrD,EAAarpD,OAAuD,WAA9CqpD,EAAarpD,MAAMyG,SAAS1I,eAC3HsrD,EAAeA,EAAaA,aAG7B,OAAOA,GAAgBxtD,SAKP0tD,CAAetwD,GAC9ByQ,EAASrQ,KAAKqQ,SACd8/C,EAAe,mBAAmBhyC,KAAK6xC,EAAaC,UAAY,CAACn/C,IAAK,EAAGP,KAAM,GAAK09C,EAAE+B,GAAc3/C,SAUtG,OARAA,EAAOS,KAAO1K,WAAWxG,EAAK+G,MAAMwC,YAAc,EAClDkH,EAAOE,MAAQnK,WAAWxG,EAAK+G,MAAMqC,aAAe,EAEhDgnD,EAAarpD,QAChBwpD,EAAar/C,KAAO1K,WAAW4pD,EAAarpD,MAAM6C,iBAAmB,EACrE2mD,EAAa5/C,MAAQnK,WAAW4pD,EAAarpD,MAAM0C,kBAAoB,GAGjE,CACNyH,IAAKT,EAAOS,IAAMq/C,EAAar/C,IAC/BP,KAAMF,EAAOE,KAAO4/C,EAAa5/C,QAUpC,IAAI0c,EAAQ,GACZghC,EAAEQ,QAAU,YAAc,IAAIpzB,MAAO+0B,UACrCnC,EAAEW,KAAO,EAQT,IALA,IAAIR,EAAa,GACfC,EAASD,EAAWvyB,eACpBD,EAAWwyB,EAAWxyB,SAEpB3S,EAAQ,gEAAgEvK,MAAM,KACzEvgB,EAAI,EAAGA,EAAI8qB,EAAMpqB,OAAQV,IACjCiwD,EAAW,WAAanlC,EAAM9qB,GAAK,KAAO8qB,EAAM9qB,GAAGuG,cAIpDupD,EAAE7tC,GAAG8tC,KAAK1uD,UAAYyuD,EAAE7tC,GAGxBphB,EAAOqxD,SAAW,CAACC,UAAWrC,GAxW9B,SAASK,EAAYpsD,GACpB,IAAIrD,EAASqD,EAAIrD,OACfiE,EAAOmrD,EAAEnrD,KAAKZ,GAEhB,MAAa,aAATY,IAAuBmrD,EAAEE,SAASjsD,OAIjB,IAAjBA,EAAI0F,WAAkB/I,KAIV,UAATiE,GAA+B,IAAXjE,GAAkC,iBAAXA,GAAgC,EAATA,GAAeA,EAAS,KAAMqD,KAvDzG,CAoZGlD,QAMF,SAASC,GACT,aAEsB,iBAAXF,GAAiD,iBAAnBA,EAAOJ,QAC/CI,EAAOJ,QAAUM,IAEW,mBAAXC,QAAyBA,OAAOC,IACjDD,OAAOD,GAGPA,IAVF,CAYE,WACD,aACA,OAAO,SAASc,EAAQf,EAAQwD,EAAUwL,GAsBzC,IAsBKuiD,EAtBDC,EAAK,WACR,GAAIhuD,EAASiuD,aACZ,OAAOjuD,EAASiuD,aAEhB,IAAK,IAAItyD,EAAI,EAAO,EAAJA,EAAOA,IAAK,CAC3B,IAAI2D,EAAMU,EAASwE,cAAc,OAIjC,GAFAlF,EAAI4uD,UAAY,iBAAgBvyD,EAAI,iCAEhC2D,EAAI6uD,qBAAqB,QAAQ9xD,OAGpC,OAFAiD,EAAM,KAEC3D,EAKV,OAAO6P,EAjBC,GAqBL4iD,GACCL,EAAW,EAERvxD,EAAO6xD,6BAA+B7xD,EAAO8xD,0BAA4B,SAAS7sD,GACxF,IACE8sD,EADEC,GAAc,IAAK31B,MAAQ+0B,UAQ/B,OAHAW,EAAYvpD,KAAK6F,IAAI,EAAG,IAAM2jD,EAAcT,IAC5CA,EAAWS,EAAcD,EAElBhtD,WAAW,WACjBE,EAAS+sD,EAAcD,IACrBA,KAIDE,EAAc,WACjB,IAAIC,EAAOlyD,EAAOiyD,aAAe,GAEjC,GAAwB,mBAAbC,EAAKzzB,IAAoB,CACnC,IAAI0zB,EAAYD,EAAKE,QAAUF,EAAKE,OAAOC,gBAAkBH,EAAKE,OAAOC,iBAAkB,IAAKh2B,MAAQ+0B,UAExGc,EAAKzzB,IAAM,WACV,OAAO,IAAKpC,MAAQ+0B,UAAYe,GAGlC,OAAOD,EAVU,GAuClB,IAAII,EAAS,WACZ,IAAInwD,EAAQa,MAAMxC,UAAU2B,MAE5B,IAGC,OADAA,EAAMvC,KAAK4D,EAAS8E,iBACbnG,EACN,MAAOpD,GAMR,OAAO,SAASwzD,EAAOzhB,GACtB,IAAItxB,EAAMxe,KAAKnB,OAUf,GARqB,iBAAV0yD,IACVA,EAAQ,GAGU,iBAARzhB,IACVA,EAAMtxB,GAGHxe,KAAKmB,MACR,OAAOA,EAAMvC,KAAKoB,KAAMuxD,EAAOzhB,GAGhC,IAAI3xC,EACFqzD,EAAS,GAETriB,EAAkB,GAAToiB,EAAcA,EAAQ/pD,KAAK6F,IAAI,EAAGmR,EAAM+yC,GAIjDzpD,GAFOgoC,EAAM,EAAItxB,EAAMsxB,EAAMtoC,KAAK2H,IAAI2gC,EAAKtxB,IAE7B2wB,EAEhB,GAAW,EAAPrnC,EAEH,GADA0pD,EAAS,IAAIxvD,MAAM8F,GACf9H,KAAKy6B,OACR,IAAKt8B,EAAI,EAAGA,EAAI2J,EAAM3J,IACrBqzD,EAAOrzD,GAAK6B,KAAKy6B,OAAO0U,EAAQhxC,QAGjC,IAAKA,EAAI,EAAGA,EAAI2J,EAAM3J,IACrBqzD,EAAOrzD,GAAK6B,KAAKmvC,EAAQhxC,GAI5B,OAAOqzD,IAjDG,GAuDTC,EAAW,WACd,OAAIzvD,MAAMxC,UAAUymC,SACZ,SAAS+oB,EAAK9vC,GACpB,OAAO8vC,EAAI/oB,SAAS/mB,IAGlBld,MAAMxC,UAAUiB,QACZ,SAASuuD,EAAK9vC,GACpB,OAA2B,GAApB8vC,EAAIvuD,QAAQye,IAGd,SAAS8vC,EAAK9vC,GACpB,IAAK,IAAI/gB,EAAI,EAAGA,EAAI6wD,EAAInwD,OAAQV,IAC/B,GAAI6wD,EAAI7wD,KAAO+gB,EACd,OAAO,EAGT,OAAO,IAIT,SAASwyC,EAAiBC,GASzB,OAPIC,EAAKC,UAAUF,GAClBA,EAAWL,EAAO1yD,KAAK+yD,GAEbC,EAAKE,OAAOH,KACtBA,EAAW,CAACA,IAGNA,EAGR,IA6CI1D,EA7CA2D,EAAO,CACV/S,SAAU,SAASlY,GAClB,MAA4B,iBAAbA,GAEhBmY,SAAU,SAASnY,GAClB,MAA4B,iBAAbA,GAEhBxkC,QAASH,MAAMG,SAAW,SAASwkC,GAClC,MAAoD,mBAA7C38B,OAAOxK,UAAUo8B,SAASh9B,KAAK+nC,IAEvCuB,WAAY,SAASvB,GACpB,MAAoD,sBAA7C38B,OAAOxK,UAAUo8B,SAASh9B,KAAK+nC,IAEvCmrB,OAAQ,SAASnrB,GAChB,OAAOA,GAAYA,EAAS/+B,UAI7BiqD,UAAW,SAASlrB,GACnB,OAAOA,GACFA,IAAa3nC,GACb4yD,EAAK/S,SAASlY,EAAS9nC,UACtB+yD,EAAK9S,SAASnY,KACdirB,EAAK1pB,WAAWvB,KAChBirB,EAAKE,OAAOnrB,KACQ,IAApBA,EAAS9nC,QAAgB+yD,EAAKE,OAAOnrB,EAAS,MAErDorB,MAAO,SAASprB,GACf,OAAO3nC,EAAOgzD,YAAerrB,aAAoB3nC,EAAOgzD,YAEzDC,cAAe,SAAStrB,GACvB,IAAK,IAAIhqB,KAAQgqB,EAChB,GAAIA,EAAS9K,eAAelf,GAC3B,OAAO,EAIT,OAAO,IASPu1C,GAAW,EASb,GAPInyD,EAAOqgB,IAAMrgB,EAAOqgB,GAAG+xC,QAC1BlE,EAAIluD,EACJmyD,GAAW,GAEXjE,EAAIjvD,EAAOqxD,SAASC,UAGjBE,GAAM,IAAM0B,EACf,MAAM,IAAI1zD,MAAM,wEACV,KAAIgyD,GAAM,GAAV,CAYP,IACE4B,EAAiB,QAMf/B,EAAW,CAEdgC,MAAO,CAENC,SAAU,iEAAiEn0C,KAAKnf,EAAOuzD,UAAUC,WAEjGC,UAAW,WAAWt0C,KAAKnf,EAAOuzD,UAAUC,WAC5CE,cAAe,uBAAuBv0C,KAAKnf,EAAOuzD,UAAUC,WAC5DG,SAAU3zD,EAAO4zD,OACjBC,UAAW,WAAW10C,KAAKnf,EAAOuzD,UAAUC,WAE5CM,cAAetwD,EAASwE,cAAc,OAEtC+rD,cAAe,GAEfC,aAAc,KAEdC,mBAAoB,KACpBC,kBAAmB,KAEnBC,WAAW,EAEXC,MAAO,GACPC,gBAAiB,CAChBn5C,MAAO,IAITo5C,IAAK,GAELhD,UAAWrC,EAEXsF,UAAW,GACXC,QAAS,GAETz0B,QAAS//B,EAAO+/B,QAEhBhoB,SAAU,CACTmC,MAAO,GACPxE,SA9CqB,IA+CrB++C,OAAQrB,EACRb,MAAOvjD,EACP0lD,SAAU1lD,EACV2lD,SAAU3lD,EACVnG,QAASmG,EACT4lD,WAAY5lD,EACZ6lD,MAAM,EACNn+C,OAAO,EACPo+C,UAAU,EAEVC,cAAc,EAEdC,oBAAoB,GAGrB9F,KAAM,SAASnjD,GACdkjD,EAAEnoD,KAAKiF,EAAS,WAAY,CAE3BgnD,MAAOH,EAAKG,MAAMhnD,GAGlBkpD,aAAa,EAEbC,cAAe,KAGfC,gBAAiB,KAIjBC,uBAAwB,GAExBC,eAAgB,MAIlBC,KAAM,KAENC,MAAM,EACNC,QAAS,CAACC,MAAO,EAAGC,MAAO,EAAGC,MAAO,GAErCC,OAAO,EAEPC,WAAW,EAEXC,SAAU,SAASC,GAClB,IAAIC,GAAc,IAAK35B,MAAQ+0B,UAE/BnC,EAAE5B,KAAKgE,EAASgC,MAAMe,MAAO,SAASj1D,EAAG82D,GAExC,GAAIA,EAAY,CAGf,GAAIF,IAAc/mD,IAAeinD,EAAW,GAAG/7C,QAAU67C,IAAuC,IAAxBE,EAAW,GAAG/7C,OACrF,OAAO,EAIR+7C,EAAW,GAAK,CACfC,QAAQ,MAMXjH,EAAE5B,KAAKgE,EAASgC,MAAMgB,gBAAiB,SAAS8B,EAAGpqD,GAC7CA,GAGLqqD,EAAoBrqD,EAASiqD,MAI/BK,UAAW,SAASN,GACnB,IAAIC,GAAc,IAAK35B,MAAQ+0B,UAE/BnC,EAAE5B,KAAKgE,EAASgC,MAAMe,MAAO,SAASj1D,EAAG82D,GAExC,GAAIA,EAAY,CAGf,GAAIF,IAAc/mD,IAAeinD,EAAW,GAAG/7C,QAAU67C,IAAuC,IAAxBE,EAAW,GAAG/7C,OACrF,OAAO,EAIJ+7C,EAAW,KACdA,EAAW,GAAGC,QAAS,MAK1BjH,EAAE5B,KAAKgE,EAASgC,MAAMgB,gBAAiB,SAAS8B,EAAGpqD,GAC7CA,GAGLuqD,EAAqBvqD,EAASiqD,OAM7Bh2D,EAAO0wD,cAAgB1hD,GAC1BqiD,EAASgC,MAAMW,aAAeh0D,EAC9BqxD,EAASgC,MAAMY,mBAAqB,cACpC5C,EAASgC,MAAMa,kBAAoB,gBAEnC7C,EAASgC,MAAMW,aAAexwD,EAAS8E,iBAAmB9E,EAASC,KAAKF,YAAcC,EAASC,KAC/F4tD,EAASgC,MAAMY,mBAAqB,aACpC5C,EAASgC,MAAMa,kBAAoB,aAwMpC,IAAIqC,EAAqB,WACxB,SAASC,EAA2BC,GACnC,OAASA,EAAMC,QAAUD,EAAM7oD,EAAM6oD,EAAME,SAAWF,EAAMG,EAG7D,SAASC,EAAkCC,EAAcC,EAAIC,GAC5D,IAAIP,EAAQ,CACX7oD,EAAGkpD,EAAalpD,EAAIopD,EAAWC,GAAKF,EACpCH,EAAGE,EAAaF,EAAII,EAAWE,GAAKH,EACpCL,QAASI,EAAaJ,QACtBC,SAAUG,EAAaH,UAGxB,MAAO,CAACM,GAAIR,EAAMG,EAAGM,GAAIV,EAA2BC,IAoBrD,OAAO,SAASU,EAAiBT,EAASC,EAAUjhD,GAEnD,IAUE0hD,EAAeL,EAAIM,EA7BQZ,EAAOM,EAChCx3D,EAIFmD,EACArD,EACAi4D,EACAC,EACAC,EAUEC,EAAY,CACf7pD,GAAI,EACJgpD,EAAG,EACHF,QAAS,KACTC,SAAU,MAETvtB,EAAO,CAAC,GACRsuB,EAAc,EAwBhB,IAnBAhB,EAAUtvD,WAAWsvD,IAAY,IACjCC,EAAWvvD,WAAWuvD,IAAa,GACnCjhD,EAAWA,GAAY,KAEvB+hD,EAAUf,QAAUA,EACpBe,EAAUd,SAAWA,EASpBI,GAPDK,EAA6B,OAAb1hD,IAKfgiD,EAAcP,EAAiBT,EAASC,IAErBjhD,EAjBb,KAAA,KA5B6BqhD,EAoDwBA,OAnDxDx3D,EAAAA,EAAI,CACP03D,IAF4BR,EAoDMY,GAAcI,GAlDtCb,EACVM,GAAIV,EAA2BC,IAE9B/zD,EAAIm0D,EAAkCJ,EAAY,GAALM,EAAUx3D,GACvDF,EAAIw3D,EAAkCJ,EAAY,GAALM,EAAUr0D,GACvD40D,EAAIT,EAAkCJ,EAAOM,EAAI13D,GACjDk4D,EAAO,EAAM,GAAOh4D,EAAE03D,GAAK,GAAOv0D,EAAEu0D,GAAK53D,EAAE43D,IAAMK,EAAEL,IACnDO,EAAO,EAAM,GAAOj4D,EAAE23D,GAAK,GAAOx0D,EAAEw0D,GAAK73D,EAAE63D,IAAMI,EAAEJ,IAErDT,EAAM7oD,EAAI6oD,EAAM7oD,EAAI2pD,EAAOR,EAC3BN,EAAMG,EAAIH,EAAMG,EAAIY,EAAOT,EAwC1BM,EAtCMZ,EAwCNrtB,EAAK1nC,KAAK,EAAI21D,EAAWzpD,GACzB8pD,GAAe,GA5BF,KA8BPlvD,KAAKmvD,IAAIN,EAAWzpD,IA9Bb,KA8B+BpF,KAAKmvD,IAAIN,EAAWT,KAOjE,OAAQQ,EAA8B,SAASQ,GAC9C,OAAOxuB,EAAOwuB,GAAmBxuB,EAAKvpC,OAAS,GAAM,IAD9B63D,GAhFF,GAuFxBrG,EAASmD,QAAU,CAClBqD,OAAQ,SAASn4D,GAChB,OAAOA,GAERo4D,MAAO,SAASp4D,GACf,MAAO,GAAM8I,KAAKuvD,IAAIr4D,EAAI8I,KAAKwvD,IAAM,GAGtCC,OAAQ,SAASv4D,GAChB,OAAO,EAAK8I,KAAKuvD,IAAQ,IAAJr4D,EAAU8I,KAAKwvD,IAAMxvD,KAAK0vD,IAAS,GAAJx4D,KAKtDuvD,EAAE5B,KACA,CACC,CAAC,OAAQ,CAAC,IAAM,GAAK,IAAM,IAC3B,CAAC,UAAW,CAAC,IAAM,EAAK,EAAM,IAC9B,CAAC,WAAY,CAAC,EAAM,EAAK,IAAM,IAC/B,CAAC,cAAe,CAAC,IAAM,EAAK,IAAM,IAClC,CAAC,aAAc,CAAC,IAAM,EAAG,KAAO,OAChC,CAAC,cAAe,CAAC,IAAM,KAAO,KAAO,IACrC,CAAC,gBAAiB,CAAC,KAAO,IAAM,IAAM,MACtC,CAAC,aAAc,CAAC,IAAM,KAAO,IAAM,MACnC,CAAC,cAAe,CAAC,IAAM,IAAM,IAAM,MACnC,CAAC,gBAAiB,CAAC,KAAO,IAAM,KAAO,OACvC,CAAC,cAAe,CAAC,IAAM,KAAO,KAAO,MACrC,CAAC,eAAgB,CAAC,KAAO,IAAM,KAAO,IACtC,CAAC,iBAAkB,CAAC,KAAO,KAAO,KAAO,IACzC,CAAC,cAAe,CAAC,KAAO,IAAM,KAAO,MACrC,CAAC,eAAgB,CAAC,KAAO,IAAM,IAAM,IACrC,CAAC,iBAAkB,CAAC,IAAM,EAAG,KAAO,IACpC,CAAC,cAAe,CAAC,KAAO,IAAM,KAAO,MACrC,CAAC,eAAgB,CAAC,IAAM,EAAG,IAAM,IACjC,CAAC,iBAAkB,CAAC,IAAM,EAAG,IAAM,IACnC,CAAC,aAAc,CAAC,IAAM,IAAM,KAAO,OACnC,CAAC,cAAe,CAAC,IAAM,EAAG,IAAM,IAChC,CAAC,gBAAiB,CAAC,EAAG,EAAG,EAAG,IAC5B,CAAC,aAAc,CAAC,GAAK,IAAM,IAAM,OACjC,CAAC,cAAe,CAAC,KAAO,IAAM,KAAO,IACrC,CAAC,gBAAiB,CAAC,KAAO,KAAO,IAAM,OACrC,SAASluD,EAAGg5D,GAChB9G,EAASmD,QAAQ2D,EAAY,IAAMC,EAAe/1D,MAAM,KAAM81D,EAAY,MAgD3E,IAAI7D,EAAMjD,EAASiD,IAAM,CAKxB+D,MAAO,CACNC,MAAO,wBAEPC,YAAa,oBACbC,6BAA8B,qCAE9BC,WAAY,8CAMbC,MAAO,CACNC,OAAQ,CAAC,OAAQ,SAAU,YAAa,QAAS,kBAAmB,cAAe,iBAAkB,mBAAoB,oBAAqB,kBAAmB,gBACjKC,eAAgB,CAAC,aAAc,aAAc,QAAS,SAAU,SAAU,QAAS,QAAS,WAC5FC,aAAc,CAAC,uBAAwB,aAAc,SAAU,UAAW,WAC1EC,MAAO,CACN,IACA,KAAM,KAAM,KAAM,MAClB,KAAM,KAAM,OAAQ,OACpB,KAAM,KAAM,IAAK,KAAM,KAAM,KAAM,KACnC,MAAO,OAAQ,MAAO,OACtB,IAAK,MAENC,WAAY,CACXC,UAAa,cACbC,aAAgB,cAChBC,WAAc,cACdC,KAAQ,YACRC,MAAS,cACTC,MAAS,cACTC,OAAU,cACVC,MAAS,QACTC,eAAkB,cAClBC,WAAc,aACdC,KAAQ,UACRC,MAAS,YACTC,UAAa,cACbC,UAAa,aACbC,WAAc,YACdC,UAAa,aACbC,MAAS,aACTC,eAAkB,cAClBC,SAAY,cACZC,QAAW,YACXC,KAAQ,YACRC,SAAY,UACZC,SAAY,YACZC,cAAiB,aACjBC,SAAY,cACZC,SAAY,cACZC,UAAa,UACbC,UAAa,cACbC,YAAe,YACfC,eAAkB,YAClBC,WAAc,YACdC,WAAc,aACdC,QAAW,UACXC,WAAc,cACdC,aAAgB,cAChBC,cAAiB,YACjBC,cAAiB,WACjBC,cAAiB,YACjBC,WAAc,YACdC,SAAY,aACZC,YAAe,YACfC,QAAW,cACXC,QAAW,cACXC,WAAc,aACdC,UAAa,YACbC,YAAe,cACfC,YAAe,YACfC,QAAW,YACXC,UAAa,cACbC,WAAc,cACdC,KAAQ,YACRC,UAAa,aACbC,KAAQ,cACRC,KAAQ,cACRC,YAAe,aACfC,MAAS,UACTC,SAAY,cACZC,QAAW,cACXC,UAAa,YACbC,OAAU,WACVC,MAAS,cACTC,MAAS,cACTC,cAAiB,cACjBC,SAAY,cACZC,UAAa,YACbC,aAAgB,cAChBC,UAAa,cACbC,WAAc,cACdC,UAAa,cACbC,qBAAwB,cACxBC,UAAa,cACbC,UAAa,cACbC,WAAc,cACdC,UAAa,cACbC,YAAe,cACfC,cAAiB,aACjBC,aAAgB,cAChBC,eAAkB,cAClBC,eAAkB,cAClBC,YAAe,cACfC,UAAa,YACbC,KAAQ,UACRC,MAAS,cACTC,QAAW,YACXC,OAAU,UACVC,iBAAoB,cACpBC,WAAc,UACdC,aAAgB,aAChBC,aAAgB,cAChBC,eAAkB,aAClBC,gBAAmB,cACnBC,kBAAqB,YACrBC,gBAAmB,aACnBC,gBAAmB,aACnBC,aAAgB,YAChBC,UAAa,cACbC,UAAa,cACbC,SAAY,cACZC,YAAe,cACfC,KAAQ,UACRC,QAAW,cACXC,UAAa,aACbC,MAAS,YACTC,UAAa,WACbC,OAAU,YACVC,OAAU,cACVC,cAAiB,cACjBC,UAAa,cACbC,cAAiB,cACjBC,cAAiB,cACjBC,WAAc,cACdC,UAAa,cACbC,KAAQ,aACRC,KAAQ,cACRC,KAAQ,cACRC,WAAc,cACdC,OAAU,YACVC,IAAO,UACPC,UAAa,cACbC,UAAa,aACbC,YAAe,YACfC,OAAU,cACVC,WAAc,aACdC,SAAY,YACZC,SAAY,cACZC,OAAU,YACVC,OAAU,cACVC,QAAW,cACXC,UAAa,aACbC,UAAa,cACbC,KAAQ,cACRC,YAAe,YACfC,UAAa,aACbC,IAAO,cACPC,KAAQ,YACRC,QAAW,cACXC,OAAU,YACVC,UAAa,aACbC,OAAU,cACVC,MAAS,cACTC,WAAc,cACdC,MAAS,cACTC,YAAe,aACfC,OAAU,cAWZC,MAAO,CAONC,UAAW,CACVC,WAAc,CAAC,iBAAkB,qBACjCC,UAAa,CAAC,wBAAyB,yBACvCC,KAAQ,CAAC,wBAAyB,mBAClCC,mBAAsB,CAAC,MAAO,SAC9BC,gBAAmB,CAAC,QAAS,eAC7BC,kBAAqB,CAAC,MAAO,YAI9BC,WAAY,GAMZC,SAAU,WAKT,IAAK,IAAItjE,EAAI,EAAGA,EAAIm1D,EAAIoE,MAAMC,OAAO94D,OAAQV,IAAK,CACjD,IAAIujE,EAAyC,UAAxBpO,EAAIoE,MAAMC,OAAOx5D,GAAkB,UAAY,gBACpEm1D,EAAI0N,MAAMC,UAAU3N,EAAIoE,MAAMC,OAAOx5D,IAAM,CAAC,uBAAwBujE,GAGrE,IAAIC,EACFC,EACAC,EAIF,GAAIrR,EACH,IAAKmR,KAAgBrO,EAAI0N,MAAMC,UAC9B,GAAK3N,EAAI0N,MAAMC,UAAUplC,eAAe8lC,GAAxC,CAIAE,GADAD,EAAetO,EAAI0N,MAAMC,UAAUU,IACV,GAAGjjD,MAAM,KAElC,IAAIojD,EAAgBF,EAAa,GAAGr9D,MAAM+uD,EAAI+D,MAAMI,YAE/B,UAAjBoK,EAAU,KAEbA,EAAUnhE,KAAKmhE,EAAUtS,SACzBuS,EAAcphE,KAAKohE,EAAcvS,SAGjC+D,EAAI0N,MAAMC,UAAUU,GAAgB,CAACE,EAAU76C,KAAK,KAAM86C,EAAc96C,KAAK,OAMhF,IAAK26C,KAAgBrO,EAAI0N,MAAMC,UAC9B,GAAK3N,EAAI0N,MAAMC,UAAUplC,eAAe8lC,GAMxC,IAAK,IAAItS,KAFTwS,GADAD,EAAetO,EAAI0N,MAAMC,UAAUU,IACV,GAAGjjD,MAAM,KAGjC,GAAKmjD,EAAUhmC,eAAewzB,GAA9B,CAGA,IAAI0S,EAAeJ,EAAeE,EAAUxS,GAC1C2S,EAAe3S,EAIjBiE,EAAI0N,MAAMQ,WAAWO,GAAgB,CAACJ,EAAcK,KAUvDC,QAAS,SAAS71B,GACjB,IAAI81B,EAAW5O,EAAI0N,MAAMQ,WAAWp1B,GAEpC,OAAI81B,EACIA,EAAS,GAGT91B,GAGT+1B,QAAS,SAAS99D,EAAK8qC,GACtB,IAAI31B,GAAQnV,EAAI+9D,OAAOjzB,GAAS,EAAG,GAAG5qC,MAAM,aAAe,IAAI,IAAM,GAErE,OAAIiV,GAAQi4C,EAAS6B,EAAIoE,MAAMI,OACvBt+C,EAED,IAER6oD,UAAW,SAASh+D,GACnB,OAAOA,EAAIC,QAAQ,6BAA8B,SAASg+D,EAAI99D,EAAIC,GACjE,OAAI6uD,EAAIoE,MAAMK,WAAWl8B,eAAep3B,IAC/BD,GAAU,SAAW8uD,EAAIoE,MAAMK,WAAWtzD,IAAOD,EAAK,GAAK,OAE7DA,EAAKC,KAKd89D,uBAAwB,SAASZ,EAAca,GAc9C,OAZIlP,EAAI+D,MAAME,YAAYp5C,KAAKqkD,KAC9BA,EAAoBA,EAAkBj+D,MAAM+uD,EAAI+D,MAAME,aAAa,IAOhEjE,EAAImP,OAAOC,eAAeF,KAC7BA,EAAoBlP,EAAI0N,MAAMC,UAAUU,GAAc,IAGhDa,GAGRG,aAAc,SAASZ,EAAcS,GACpC,IAAIN,EAAW5O,EAAI0N,MAAMQ,WAAWO,GAEpC,GAAIG,EAAU,CACb,IAAIU,EAAWV,EAAS,GACtBF,EAAeE,EAAS,GAK1B,OAHAM,EAAoBlP,EAAI0N,MAAMuB,uBAAuBK,EAAUJ,IAGtC5mC,WAAWr3B,MAAM+uD,EAAI+D,MAAMI,YAAYuK,GAGhE,OAAOQ,GAKTK,YAAa,SAASd,EAAce,EAAWN,GAC9C,IAAIN,EAAW5O,EAAI0N,MAAMQ,WAAWO,GAEpC,GAAIG,EAAU,CACb,IAEEa,EAFEH,EAAWV,EAAS,GACtBF,EAAeE,EAAS,GAY1B,OAJAa,GAJAP,EAAoBlP,EAAI0N,MAAMuB,uBAAuBK,EAAUJ,IAIpB5mC,WAAWr3B,MAAM+uD,EAAI+D,MAAMI,aAC/CuK,GAAgBc,EACZC,EAAuB/7C,KAAK,KAKvD,OAAOw7C,IAUVQ,eAAgB,CAGfxB,WAAY,CACXJ,KAAM,SAASt+D,EAAMiI,EAASk4D,GAC7B,OAAQngE,GACP,IAAK,OACJ,MAAO,OAER,IAAK,UACJ,IAAIogE,EAaJ,OATCA,EADG5P,EAAI+D,MAAMG,6BAA6Br5C,KAAK8kD,GACnCA,GAGZC,EAAYD,EAAcrnC,WAAWr3B,MAAM+uD,EAAI+D,MAAME,cAG7B2L,EAAU,GAAG5+D,QAAQ,WAAY,KAAO2+D,EAKlE,IAAK,SACJ,MAAO,QAAUA,EAAgB,MAGpCE,KAAM,SAASrgE,EAAMiI,EAASk4D,GAC7B,OAAQngE,GACP,IAAK,OACJ,OAAOutD,EAASgC,MAAMQ,UAAY,SAAW,iBAC9C,IAAK,UACJ,IAAIqQ,EAAY98D,WAAW68D,GAG3B,IAAMC,GAA2B,IAAdA,EAAkB,CACpC,IAAIE,EAAgBH,EAAcrnC,WAAWr3B,MAAM,2BAIlD2+D,EADGE,EACSA,EAAc,GAGd,EAId,OAAOF,EAER,IAAK,SAEJ,OAAK98D,WAAW68D,GAGR,QAAUA,EAAgB,IAF1B,SAOX3sD,QAAS,SAASxT,EAAMiI,EAASk4D,GAChC,GAAIzS,GAAM,EACT,OAAQ1tD,GACP,IAAK,OACJ,MAAO,SACR,IAAK,UAGJ,IAAIogE,EAAYD,EAAcrnC,WAAWr3B,MAAM,0BAU/C,OANC0+D,EAFGC,EAEaA,EAAU,GAAK,IAGf,EAIlB,IAAK,SAOJ,OALAn4D,EAAQpE,MAAM08D,KAAO,IAKjBj9D,WAAW68D,GACP,GAGA,iBAAmBhkD,SAAqC,IAA5B7Y,WAAW68D,GAAsB,IAAM,SAK7E,OAAQngE,GACP,IAAK,OACJ,MAAO,UACR,IAAK,UAEL,IAAK,SACJ,OAAOmgE,KAUZxB,SAAU,WAgBHjR,KAAW,EAALA,IAAYH,EAASgC,MAAMK,gBAGtCY,EAAIoE,MAAME,eAAiBtE,EAAIoE,MAAME,eAAezyD,OAAOmuD,EAAIoE,MAAMG,eAGtE,IAAK,IAAI15D,EAAI,EAAGA,EAAIm1D,EAAIoE,MAAME,eAAe/4D,OAAQV,KAGpD,WACC,IAAImlE,EAAgBhQ,EAAIoE,MAAME,eAAez5D,GAE7Cm1D,EAAI0P,eAAexB,WAAW8B,GAAiB,SAASxgE,EAAMiI,EAASk4D,GACtE,OAAQngE,GAEP,IAAK,OACJ,MAAO,YAER,IAAK,UAEJ,OAAIygE,EAAKx4D,KAAaiD,GAAau1D,EAAKx4D,GAASspD,eAAeiP,KAAmBt1D,EAE3E,UAAUmQ,KAAKmlD,GAAiB,EAAI,EAIrCC,EAAKx4D,GAASspD,eAAeiP,GAAeh/D,QAAQ,QAAS,IACrE,IAAK,SACJ,IAAIk/D,GAAU,EAKd,OAAQF,EAAclB,OAAO,EAAGkB,EAAczkE,OAAS,IAEtD,IAAK,YACJ2kE,GAAW,2BAA2BrlD,KAAK8kD,GAC3C,MAED,IAAK,OACL,IAAK,QAIA5S,EAASgC,MAAMI,WAAa8Q,EAAKx4D,GAASspD,eAAeiP,KAAmBt1D,GAAai1D,EAAgB,IAC5GA,EAAgB,GAGjBO,GAAW,SAASrlD,KAAK8kD,GACzB,MACD,IAAK,OAGL,IAAK,SACJO,GAAW,aAAarlD,KAAK8kD,GAU/B,OANKO,IAEJD,EAAKx4D,GAASspD,eAAeiP,GAAiB,IAAML,EAAgB,KAI9DM,EAAKx4D,GAASspD,eAAeiP,KAvDxC,GAmED,IAAK,IAAIjU,EAAI,EAAGA,EAAIiE,EAAIoE,MAAMC,OAAO94D,OAAQwwD,KAG5C,WACC,IAAIoU,EAAYnQ,EAAIoE,MAAMC,OAAOtI,GAGjCiE,EAAI0P,eAAexB,WAAWiC,GAAa,SAAS3gE,EAAMiI,EAASk4D,GAClE,OAAQngE,GACP,IAAK,OACJ,OAAO2gE,EAER,IAAK,UACJ,IAAIP,EAGJ,GAAI5P,EAAI+D,MAAMG,6BAA6Br5C,KAAK8kD,GAC/CC,EAAYD,MACN,CACN,IAAIS,EACF3L,EAAa,CACZQ,MAAO,eACPG,KAAM,iBACN0C,KAAM,qBACNG,MAAO,iBACP8D,IAAK,iBACLwB,MAAO,sBAIN,YAAY1iD,KAAK8kD,GAEnBS,EADG3L,EAAWkL,KAAmBj1D,EACrB+pD,EAAWkL,GAGXlL,EAAWQ,MAGdjF,EAAI+D,MAAMC,MAAMn5C,KAAK8kD,GAC/BS,EAAY,OAASpQ,EAAImP,OAAOkB,SAASV,GAAej8C,KAAK,KAAO,IAExD,YAAY7I,KAAK8kD,KAC7BS,EAAY3L,EAAWQ,OAKxB2K,GAAaQ,GAAaT,GAAernC,WAAWr3B,MAAM+uD,EAAI+D,MAAME,aAAa,GAAGjzD,QAAQ,WAAY,KAQzG,QAJMksD,GAAW,EAALA,IAA2C,IAAhC0S,EAAUxkD,MAAM,KAAK7f,SAC3CqkE,GAAa,MAGPA,EACR,IAAK,SAEJ,MAAI,OAAO/kD,KAAK8kD,GACRA,GAIJzS,GAAM,EAC+B,IAApCyS,EAAcvkD,MAAM,KAAK7f,SAC5BokE,EAAgBA,EAAcvkD,MAAM,OAAOvd,MAAM,EAAG,GAAG6lB,KAAK,MAGf,IAApCi8C,EAAcvkD,MAAM,KAAK7f,SACnCokE,GAAiB,OAKVzS,GAAM,EAAI,MAAQ,QAAU,IAAMyS,EAAc3+D,QAAQ,OAAQ,KAAKA,QAAQ,gBAAiB,IAAM,OAvEhH,GAgFD,SAASs/D,EAAiBjnD,EAAM5R,EAAS84D,GAGxC,GAF0F,eAAxEvQ,EAAIwQ,iBAAiB/4D,EAAS,aAAa6wB,WAAWl3B,iBAEnDm/D,IAAa,GAgBlC,OAAO,EAdN,IAAI1lE,EACFgI,EACA49D,EAAU,EACVC,EAAiB,UAATrnD,EAAmB,CAAC,OAAQ,SAAW,CAAC,MAAO,UACvDsnD,EAAS,CAAC,UAAYD,EAAM,GAAI,UAAYA,EAAM,GAAI,SAAWA,EAAM,GAAK,QAAS,SAAWA,EAAM,GAAK,SAE7G,IAAK7lE,EAAI,EAAGA,EAAI8lE,EAAOplE,OAAQV,IAC9BgI,EAAQC,WAAWktD,EAAIwQ,iBAAiB/4D,EAASk5D,EAAO9lE,KACnDkI,MAAMF,KACV49D,GAAW59D,GAGb,OAAO09D,GAAaE,EAAUA,EAIhC,SAASG,EAAavnD,EAAMknD,GAC3B,OAAO,SAAS/gE,EAAMiI,EAASk4D,GAC9B,OAAQngE,GACP,IAAK,OACJ,OAAO6Z,EACR,IAAK,UACJ,OAAOvW,WAAW68D,GAAiBW,EAAiBjnD,EAAM5R,EAAS84D,GACpE,IAAK,SACJ,OAAQz9D,WAAW68D,GAAiBW,EAAiBjnD,EAAM5R,EAAS84D,GAAc,OAItFvQ,EAAI0P,eAAexB,WAAWx5D,WAAak8D,EAAa,SAAS,GACjE5Q,EAAI0P,eAAexB,WAAWv5D,YAAci8D,EAAa,UAAU,GACnE5Q,EAAI0P,eAAexB,WAAWt5D,WAAag8D,EAAa,SACxD5Q,EAAI0P,eAAexB,WAAWr5D,YAAc+7D,EAAa,YAO3DC,MAAO,CAGN1jB,UAAW,SAASrU,GACnB,OAAOA,EAAS9nC,QAAQ,SAAU,SAASC,EAAO6/D,GACjD,OAAOA,EAASjjB,iBAIlBkjB,aAAc,SAASj4B,GACtB,IAAIk4B,EAAgB,6CAOpB,OAJI9T,GAAOH,EAASgC,MAAMI,YAAcpC,EAASgC,MAAMM,YACtD2R,GAAiB,cAGX,IAAIjhD,OAAO,KAAOihD,EAAgB,KAAM,KAAKnmD,KAAKiuB,IAK1Dm4B,YAAa,SAASn4B,GAErB,GAAIikB,EAASgC,MAAMU,cAAc3mB,GAChC,MAAO,CAACikB,EAASgC,MAAMU,cAAc3mB,IAAW,GAIhD,IAFA,IAAIo4B,EAAU,CAAC,GAAI,SAAU,MAAO,KAAM,KAEjCrmE,EAAI,EAAGsmE,EAAgBD,EAAQ3lE,OAAQV,EAAIsmE,EAAetmE,IAAK,CACvE,IAAIumE,EAYJ,GATCA,EADS,IAANvmE,EACgBiuC,EAGAo4B,EAAQrmE,GAAKiuC,EAAS9nC,QAAQ,MAAO,SAASC,GAChE,OAAOA,EAAM48C,gBAKXyQ,EAAK9S,SAASuR,EAASgC,MAAMS,cAAcnsD,MAAM+9D,IAIpD,MAAO,CAFPrU,EAASgC,MAAMU,cAAc3mB,GAAYs4B,GAEf,GAK5B,MAAO,CAACt4B,GAAU,KAQrBq2B,OAAQ,CAEPkB,SAAU,SAASgB,GAClB,IAEEC,EAQF,OANAD,EAAMA,EAAIrgE,QAJW,mCAIa,SAASugE,EAAG/mE,EAAGgnE,EAAGpjE,GACnD,OAAO5D,EAAIA,EAAIgnE,EAAIA,EAAIpjE,EAAIA,KAG5BkjE,EAPkB,4CAOO5oC,KAAK2oC,IAEZ,CAAC1lD,SAAS2lD,EAAS,GAAI,IAAK3lD,SAAS2lD,EAAS,GAAI,IAAK3lD,SAAS2lD,EAAS,GAAI,KAAO,CAAC,EAAG,EAAG,IAE9GlC,eAAgB,SAASv8D,GAMxB,OAASA,GAAS,qDAAqDgY,KAAKhY,IAG7E4+D,YAAa,SAAS34B,GACrB,MAAI,kBAAkBjuB,KAAKiuB,GACnB,MACG,kHAAkHjuB,KAAKiuB,GAE1H,GAGA,MAKT44B,eAAgB,SAASj6D,GACxB,IAAIk6D,EAAUl6D,GAAWA,EAAQk6D,QAAQrpC,WAAWl3B,cAEpD,MAAI,2JAA2JyZ,KAAK8mD,GAC5J,SACG,UAAU9mD,KAAK8mD,GAClB,YACG,UAAU9mD,KAAK8mD,GAClB,YACG,aAAa9mD,KAAK8mD,GACrB,QACG,aAAa9mD,KAAK8mD,GACrB,kBAGA,SAITC,SAAU,SAASn6D,EAASnF,GAC3B,GAAImF,EACH,GAAIA,EAAQo6D,UACXp6D,EAAQo6D,UAAU1jC,IAAI77B,QAChB,GAAIgsD,EAAK9S,SAAS/zC,EAAQnF,WAEhCmF,EAAQnF,YAAcmF,EAAQnF,UAAU/G,OAAS,IAAM,IAAM+G,MACvD,CAEN,IAAIw/D,EAAer6D,EAAQvF,aAAagrD,GAAM,EAAI,YAAc,UAAY,GAE5EzlD,EAAQs6D,aAAa,QAASD,GAAgBA,EAAe,IAAM,IAAMx/D,KAI5E0/D,YAAa,SAASv6D,EAASnF,GAC9B,GAAImF,EACH,GAAIA,EAAQo6D,UACXp6D,EAAQo6D,UAAUvvD,OAAOhQ,QACnB,GAAIgsD,EAAK9S,SAAS/zC,EAAQnF,WAGhCmF,EAAQnF,UAAYmF,EAAQnF,UAAUg2B,WAAWt3B,QAAQ,IAAI+e,OAAO,UAAYzd,EAAU8Y,MAAM,KAAKsI,KAAK,KAAO,UAAW,MAAO,SAC7H,CAEN,IAAIo+C,EAAer6D,EAAQvF,aAAagrD,GAAM,EAAI,YAAc,UAAY,GAE5EzlD,EAAQs6D,aAAa,QAASD,EAAa9gE,QAAQ,IAAI+e,OAAO,QAAWzd,EAAU8Y,MAAM,KAAKsI,KAAK,KAAO,QAAU,MAAO,SAU/H88C,iBAAkB,SAAS/4D,EAASqhC,EAAUo2B,EAAmB+C,GAKhE,SAASC,EAAqBz6D,EAASqhC,GAKtC,IAAIq5B,EAAgB,EAMpB,GAAIjV,GAAM,EACTiV,EAAgBxX,EAAE/iD,IAAIH,EAASqhC,OAGzB,CAGN,IAAIs5B,GAAgB,EAEhB,mBAAmBvnD,KAAKiuB,IAA0D,IAA7CknB,EAAIwQ,iBAAiB/4D,EAAS,aACtE26D,GAAgB,EAChBpS,EAAIqS,iBAAiB56D,EAAS,UAAWuoD,EAAImP,OAAOuC,eAAej6D,KAGpE,IAoBImpD,EApBA0R,EAAgB,WACfF,GACHpS,EAAIqS,iBAAiB56D,EAAS,UAAW,SAI3C,IAAKw6D,EAAkB,CACtB,GAAiB,WAAbn5B,GAAiG,eAAxEknB,EAAIwQ,iBAAiB/4D,EAAS,aAAa6wB,WAAWl3B,cAAgC,CAClH,IAAImhE,EAAmB96D,EAAQzC,cAAgBlC,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,oBAAsB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,uBAAyB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,gBAAkB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,mBAAqB,GAG3T,OAFA66D,IAEOC,EACD,GAAiB,UAAbz5B,GAAgG,eAAxEknB,EAAIwQ,iBAAiB/4D,EAAS,aAAa6wB,WAAWl3B,cAAgC,CACxH,IAAIohE,EAAkB/6D,EAAQ1C,aAAejC,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,qBAAuB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,sBAAwB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,iBAAmB,IAAM3E,WAAWktD,EAAIwQ,iBAAiB/4D,EAAS,kBAAoB,GAGzT,OAFA66D,IAEOE,GASR5R,EADGqP,EAAKx4D,KAAaiD,EACLhP,EAAO4H,iBAAiBmE,EAAS,MAEtCw4D,EAAKx4D,GAASmpD,cAITqP,EAAKx4D,GAASmpD,cAHdqP,EAAKx4D,GAASmpD,cAAgBl1D,EAAO4H,iBAAiBmE,EAAS,MAS/D,gBAAbqhC,IACHA,EAAW,kBAaU,MAPrBq5B,EADU,IAAPjV,GAAyB,WAAbpkB,EACC8nB,EAAc4P,iBAAiB13B,GAE/B8nB,EAAc9nB,KAKe,OAAlBq5B,IAC3BA,EAAgB16D,EAAQpE,MAAMylC,IAG/Bw5B,IASD,GAAsB,SAAlBH,GAA4B,6BAA6BtnD,KAAKiuB,GAAW,CAC5E,IAAIh/B,EAAWo4D,EAAqBz6D,EAAS,aAM5B,UAAbqC,GAAsC,aAAbA,GAA2B,YAAY+Q,KAAKiuB,MAExEq5B,EAAgBxX,EAAEljD,GAASqC,WAAWg/B,GAAY,MAIpD,OAAOq5B,EAGR,IAAIxC,EAIJ,GAAI3P,EAAI0N,MAAMQ,WAAWp1B,GAAW,CACnC,IAAIkoB,EAAOloB,EACTw2B,EAAWtP,EAAI0N,MAAMiB,QAAQ3N,GAI3BkO,IAAsBx0D,IAEzBw0D,EAAoBlP,EAAIwQ,iBAAiB/4D,EAASuoD,EAAI6Q,MAAMI,YAAY3B,GAAU,KAI/EtP,EAAI0P,eAAexB,WAAWoB,KACjCJ,EAAoBlP,EAAI0P,eAAexB,WAAWoB,GAAU,UAAW73D,EAASy3D,IAIjFS,EAAgB3P,EAAI0N,MAAM2B,aAAarO,EAAMkO,QAMvC,GAAIlP,EAAI0P,eAAexB,WAAWp1B,GAAW,CACnD,IAAI25B,EACFC,EAQ6B,eAN/BD,EAAyBzS,EAAI0P,eAAexB,WAAWp1B,GAAU,OAAQrhC,MAOxEi7D,EAA0BR,EAAqBz6D,EAASuoD,EAAI6Q,MAAMI,YAAYwB,GAAwB,IAGlGzS,EAAImP,OAAOC,eAAesD,IAA4B1S,EAAI0N,MAAMC,UAAU70B,KAC7E45B,EAA0B1S,EAAI0N,MAAMC,UAAU70B,GAAU,KAI1D62B,EAAgB3P,EAAI0P,eAAexB,WAAWp1B,GAAU,UAAWrhC,EAASi7D,GAI7E,IAAK,SAAS7nD,KAAK8kD,GAAgB,CAGlC,IAAIn9D,EAAOy9D,EAAKx4D,GAEhB,GAAIjF,GAAQA,EAAKisD,OAASuB,EAAI6Q,MAAME,aAAaj4B,GAGhD,GAAI,oBAAoBjuB,KAAKiuB,GAE5B,IACC62B,EAAgBl4D,EAAQk7D,UAAU75B,GACjC,MAAOzmC,GACRs9D,EAAgB,OAIjBA,EAAgBl4D,EAAQvF,aAAa4mC,QAGtC62B,EAAgBuC,EAAqBz6D,EAASuoD,EAAI6Q,MAAMI,YAAYn4B,GAAU,IAchF,OARIknB,EAAImP,OAAOC,eAAeO,KAC7BA,EAAgB,GAGK,GAAlB5S,EAASuE,OACZjwD,QAAQuhE,IAAI,OAAS95B,EAAW,KAAO62B,GAGjCA,GAGR0C,iBAAkB,SAAS56D,EAASqhC,EAAU62B,EAAeT,EAAmB2D,GAC/E,IAAIjxD,EAAek3B,EAGnB,GAAiB,WAAbA,EAEC+5B,EAAWn3D,UACdm3D,EAAWn3D,UAAU,SAAWm3D,EAAWxmD,WAAasjD,EAG3B,SAAzBkD,EAAWxmD,UACd3gB,EAAOonE,SAASnD,EAAekD,EAAWE,gBAE1CrnE,EAAOonE,SAASD,EAAWE,eAAgBpD,QAM7C,GAAI3P,EAAI0P,eAAexB,WAAWp1B,IAA0E,cAA7DknB,EAAI0P,eAAexB,WAAWp1B,GAAU,OAAQrhC,GAG9FuoD,EAAI0P,eAAexB,WAAWp1B,GAAU,SAAUrhC,EAASk4D,GAE3D/tD,EAAe,YACf+tD,EAAgBM,EAAKx4D,GAASspD,eAAejoB,OACvC,CAEN,GAAIknB,EAAI0N,MAAMQ,WAAWp1B,GAAW,CACnC,IAAIk6B,EAAWl6B,EACbw2B,EAAWtP,EAAI0N,MAAMiB,QAAQ71B,GAG/Bo2B,EAAoBA,GAAqBlP,EAAIwQ,iBAAiB/4D,EAAS63D,GAEvEK,EAAgB3P,EAAI0N,MAAM6B,YAAYyD,EAAUrD,EAAeT,GAC/Dp2B,EAAWw2B,EAcZ,GAVItP,EAAI0P,eAAexB,WAAWp1B,KACjC62B,EAAgB3P,EAAI0P,eAAexB,WAAWp1B,GAAU,SAAUrhC,EAASk4D,GAC3E72B,EAAWknB,EAAI0P,eAAexB,WAAWp1B,GAAU,OAAQrhC,IAI5DmK,EAAeo+C,EAAI6Q,MAAMI,YAAYn4B,GAAU,GAI3CokB,GAAM,EACT,IACCzlD,EAAQpE,MAAMuO,GAAgB+tD,EAC7B,MAAOt9D,GACJ0qD,EAASuE,OACZjwD,QAAQuhE,IAAI,6BAA+BjD,EAAgB,UAAY/tD,EAAe,SAKlF,CACN,IAAIpP,EAAOy9D,EAAKx4D,GAEZjF,GAAQA,EAAKisD,OAASuB,EAAI6Q,MAAME,aAAaj4B,GAGhDrhC,EAAQs6D,aAAaj5B,EAAU62B,GAE/Bl4D,EAAQpE,MAAMuO,GAAgB+tD,EAIV,GAAlB5S,EAASuE,OACZjwD,QAAQuhE,IAAI,OAAS95B,EAAW,KAAOl3B,EAAe,MAAQ+tD,GAMjE,MAAO,CAAC/tD,EAAc+tD,IAIvBsD,oBAAqB,SAASx7D,GAC7B,IAAIy7D,EAAkB,GACpB1gE,EAAOy9D,EAAKx4D,GAId,IAAKylD,GAAOH,EAASgC,MAAMI,YAAcpC,EAASgC,MAAMM,WAAc7sD,GAAQA,EAAKisD,MAAO,CAGzF,IAAI0U,EAAoB,SAASj1D,GAChC,OAAOpL,WAAWktD,EAAIwQ,iBAAiB/4D,EAASyG,KAK7Ck1D,EAAgB,CACnBC,UAAW,CAACF,EAAkB,cAAeA,EAAkB,eAC/DG,MAAO,CAACH,EAAkB,UAAWI,MAAO,CAACJ,EAAkB,UAG/DK,MAAsC,IAA/BL,EAAkB,SAAiB,CAACA,EAAkB,SAAUA,EAAkB,UAAY,CAACA,EAAkB,UAAWA,EAAkB,WAGrJM,OAAQ,CAACN,EAAkB,WAAY,EAAG,IAK3CxY,EAAE5B,KAAKkX,EAAKx4D,GAASspD,eAAgB,SAASiP,GAGzC,cAAcnlD,KAAKmlD,GACtBA,EAAgB,YACN,UAAUnlD,KAAKmlD,GACzBA,EAAgB,QACN,WAAWnlD,KAAKmlD,KAC1BA,EAAgB,UAIboD,EAAcpD,KAEjBkD,GAAmBlD,EAAgB,IAAMoD,EAAcpD,GAAet8C,KAAK,KAAO,YAI3E0/C,EAAcpD,UAGjB,CACN,IAAI0D,EACFC,EAGFhZ,EAAE5B,KAAKkX,EAAKx4D,GAASspD,eAAgB,SAASiP,GAI7C,GAHA0D,EAAiBzD,EAAKx4D,GAASspD,eAAeiP,GAGxB,yBAAlBA,EAEH,OADA2D,EAAcD,GACP,EAIG,IAAPxW,GAA8B,YAAlB8S,IACfA,EAAgB,UAGjBkD,GAAmBlD,EAAgB0D,EAAiB,MAIjDC,IACHT,EAAkB,cAAgBS,EAAc,IAAMT,GAIxDlT,EAAIqS,iBAAiB56D,EAAS,YAAay7D,KAK7ClT,EAAI0N,MAAMS,WACVnO,EAAI0P,eAAevB,WAGnBpR,EAASiE,KAAO,SAAS3C,EAAUuV,EAAMC,GACxC,IAAIhhE,EA6BJ,OA3BAwrD,EAAWD,EAAiBC,GAE5B1D,EAAE5B,KAAKsF,EAAU,SAASxzD,EAAG4M,GAO5B,GALIw4D,EAAKx4D,KAAaiD,GACrBqiD,EAASnC,KAAKnjD,GAIXo8D,IAASn5D,EACR7H,IAAU6H,IACb7H,EAAQmtD,EAAIwQ,iBAAiB/4D,EAASm8D,QAGjC,CAEN,IAAIE,EAAc9T,EAAIqS,iBAAiB56D,EAASm8D,EAAMC,GAG/B,cAAnBC,EAAY,IACf/W,EAASiD,IAAIiT,oBAAoBx7D,GAGlC5E,EAAQihE,KAIHjhE,GAOR,IAAIkhE,EAAU,WACb,IAAI3vD,EAOJ,SAAS4vD,IAGR,OAAIC,EACIC,EAAYC,SAAW,KAGvBC,EAWT,IAEEH,EAGAG,EACAC,EAEEhW,EACFiW,EACAtiE,EAVEuiE,EAAkBhkE,UAAU,KAAOA,UAAU,GAAGnF,GAAOuvD,EAAExgB,cAAc5pC,UAAU,GAAGq/C,cAAgBr/C,UAAU,GAAGq/C,WAAW4kB,OAAUlW,EAAK9S,SAASj7C,UAAU,GAAGq/C,aAajK0O,EAAKC,UAAU7xD,OAClBunE,GAAY,EAEZI,EAAgB,EAEhBD,EADA/V,EAAW3xD,OAIXunE,GAAY,EAEZI,EAAgB,EAChBhW,EAAWkW,EAAkBhkE,UAAU,GAAG8tD,UAAY9tD,UAAU,GAAG9F,EAAK8F,UAAU,IAOnF,IAAI2jE,EAAc,CACjBC,QAAS,KACT1pB,SAAU,KACVgqB,SAAU,MA2BX,GAjBIR,GAAalX,EAAStxB,UACzByoC,EAAYC,QAAU,IAAIpX,EAAStxB,QAAQ,SAASma,EAAS4L,GAC5D0iB,EAAYzpB,SAAW7E,EACvBsuB,EAAYO,SAAWjjB,KAMxBx/C,EAFGuiE,GACHD,EAAgB/jE,UAAU,GAAGq/C,YAAcr/C,UAAU,GAAGnF,EAC9CmF,UAAU,GAAGyB,SAAWzB,UAAU,GAAG3F,IAE/C0pE,EAAgB/jE,UAAU8jE,GAChB9jE,UAAU8jE,EAAgB,IAGrChW,EAAWD,EAAiBC,GAE5B,CAaA,IAyCIhgB,EAzCAq2B,EAAiBrW,EAAS9yD,OAC5BopE,EAAgB,EASlB,IAAK,0CAA0C9pD,KAAKypD,KAAmB3Z,EAAExgB,cAAcnoC,GAAU,CAIhGA,EAAU,GAGV,IAAK,IAAInH,EALsBwpE,EAAgB,EAKRxpE,EAAI0F,UAAUhF,OAAQV,IAIvDyzD,EAAKzvD,QAAQ0B,UAAU1F,MAAQ,wBAAwBggB,KAAKta,UAAU1F,MAAO,MAAMggB,KAAKta,UAAU1F,IAG5FyzD,EAAK9S,SAASj7C,UAAU1F,KAAOyzD,EAAKzvD,QAAQ0B,UAAU1F,IAChEmH,EAAQmuD,OAAS5vD,UAAU1F,GAEjByzD,EAAK1pB,WAAWrkC,UAAU1F,MACpCmH,EAAQouD,SAAW7vD,UAAU1F,IAN7BmH,EAAQoP,SAAW7Q,UAAU1F,GAqBhC,OAAQypE,GACP,IAAK,SACJj2B,EAAS,SACT,MAED,IAAK,UACJA,EAAS,UACT,MAED,IAAK,QAMJ,IAAIqjB,GAAc,IAAK35B,MAAQ+0B,UAmD/B,OAhDAnC,EAAE5B,KAAKsF,EAAU,SAASxzD,EAAG4M,GAC5BqqD,EAAoBrqD,EAASiqD,KAQ9B/G,EAAE5B,KAAKgE,EAASgC,MAAMe,MAAO,SAASj1D,EAAG82D,GAExC,IAAIiT,GAAQ,EAERjT,GAEHhH,EAAE5B,KAAK4I,EAAW,GAAI,SAASE,EAAGgT,GACjC,IAAIpT,EAAazvD,IAAY0I,EAAa,GAAK1I,EAE/C,OAAkB,IAAdyvD,GAAuBE,EAAW,GAAG/7C,QAAU67C,IAAgBzvD,IAAY0I,IAAqC,IAAxBinD,EAAW,GAAG/7C,SAK1G+0C,EAAE5B,KAAKsF,EAAU,SAASyW,EAAGr9D,GAE5B,GAAIA,IAAYo9D,EASf,OANAlT,EAAW,GAAK,CACfC,QAAQ,KAITgT,GAAQ,MAMNA,QAAJ,OASIZ,IAER,IAAK,SA0DJ,OAnDArZ,EAAE5B,KAAKsF,EAAU,SAASxzD,EAAG4M,GAC5BuqD,EAAqBvqD,KAQtBkjD,EAAE5B,KAAKgE,EAASgC,MAAMe,MAAO,SAASj1D,EAAG82D,GACxC,IAAIiT,GAAQ,EAERjT,GAEHhH,EAAE5B,KAAK4I,EAAW,GAAI,SAASE,EAAGgT,GACjC,IAAIpT,EAAazvD,IAAY0I,EAAa,GAAK1I,EAE/C,OAAkB,IAAdyvD,GAAuBE,EAAW,GAAG/7C,QAAU67C,IAAgBzvD,IAAY0I,IAAqC,IAAxBinD,EAAW,GAAG/7C,UAKrG+7C,EAAW,KAKhBhH,EAAE5B,KAAKsF,EAAU,SAASyW,EAAGr9D,GAE5B,GAAIA,IAAYo9D,EAQf,OAJAlT,EAAW,GAAGC,QAAS,IAGvBgT,GAAQ,MAMNA,QAAJ,QASIZ,IAER,IAAK,SACL,IAAK,YACL,IAAK,OAMJrZ,EAAE5B,KAAKsF,EAAU,SAASxzD,EAAG4M,GACxBw4D,EAAKx4D,IAAYw4D,EAAKx4D,GAASs9D,aAElCzkE,aAAa2/D,EAAKx4D,GAASs9D,WAAWtkE,YAGlCw/D,EAAKx4D,GAASs9D,WAAWnpB,MAC5BqkB,EAAKx4D,GAASs9D,WAAWnpB,cAGnBqkB,EAAKx4D,GAASs9D,YAMA,cAAlBT,IAA8C,IAAZtiE,IAAoBssD,EAAK9S,SAASx5C,KAEvE2oD,EAAE5B,KAAK4B,EAAE/0C,MAAMnO,EAAS6mD,EAAK9S,SAASx5C,GAAWA,EAAU,IAAK,SAAS01B,EAAGhuB,GAEvE4kD,EAAK1pB,WAAWl7B,IACnBA,MAKFihD,EAAE/0C,MAAMnO,EAAS6mD,EAAK9S,SAASx5C,GAAWA,EAAU,GAAI,OAI1D,IAAIgjE,EAAc,GAwFlB,OA7EAra,EAAE5B,KAAKgE,EAASgC,MAAMe,MAAO,SAASj1D,EAAG82D,GAEpCA,GAEHhH,EAAE5B,KAAK4I,EAAW,GAAI,SAASE,EAAGgT,GAQjC,IAAIpT,EAAazvD,IAAY0I,EAAa,GAAK1I,EAE/C,IAAkB,IAAdyvD,GAAuBE,EAAW,GAAG/7C,QAAU67C,IAAgBzvD,IAAY0I,IAAqC,IAAxBinD,EAAW,GAAG/7C,OACzG,OAAO,EAIR+0C,EAAE5B,KAAKsF,EAAU,SAASyW,EAAGr9D,GAE5B,GAAIA,IAAYo9D,EAkBf,KAfgB,IAAZ7iE,GAAoBssD,EAAK9S,SAASx5C,MAErC2oD,EAAE5B,KAAK4B,EAAE/0C,MAAMnO,EAAS6mD,EAAK9S,SAASx5C,GAAWA,EAAU,IAAK,SAAS01B,EAAGhuB,GAEvE4kD,EAAK1pB,WAAWl7B,IAGnBA,EAAK,MAAM,KAKbihD,EAAE/0C,MAAMnO,EAAS6mD,EAAK9S,SAASx5C,GAAWA,EAAU,GAAI,KAGnC,SAAlBsiE,EAA0B,CAK7B,IAAI9hE,EAAOy9D,EAAKx4D,GACZjF,GAAQA,EAAKquD,mBAAkC,IAAdY,GAAoC,KAAdA,IAC1D9G,EAAE5B,KAAKvmD,EAAKquD,gBAAiB,SAAS0Q,EAAG0D,GACxCA,EAAYC,SAAWD,EAAYE,eAIrCH,EAAY5nE,KAAKvC,OACW,WAAlBypE,GAAgD,cAAlBA,IAGxC3S,EAAW,GAAGvgD,SAAW,SAUT,SAAlBkzD,IACH3Z,EAAE5B,KAAKic,EAAa,SAASnqE,EAAGkxD,GAC/BqZ,EAAarZ,GAAG,KAGbmY,EAAYC,SAEfD,EAAYzpB,SAAS4T,IAKhB2V,IAER,QAEC,IAAIrZ,EAAExgB,cAAcm6B,IAAmBhW,EAAKK,cAAc2V,GAQnD,CAAA,GAAIhW,EAAK9S,SAAS8oB,IAAkBvX,EAASkD,UAAUqU,GAAgB,CAG7E,IAAIe,GAFJjxD,EAAOu2C,EAAExsD,OAAO,GAAI6D,IAEQoP,SAC1Bk0D,EAAgBlxD,EAAKhC,OAAS,EAoChC,OAjCuB,IAAnBgC,EAAKmxD,YACRlX,EAAW1D,EAAExsD,QAAO,EAAM,GAAIkwD,GAAU/yB,WAIzCqvB,EAAE5B,KAAKsF,EAAU,SAASmX,EAAc/9D,GAEnC3E,WAAWsR,EAAKjC,SACnBiC,EAAKhC,MAAQkzD,EAAiBxiE,WAAWsR,EAAKjC,SAAWqzD,EAC/ClX,EAAK1pB,WAAWxwB,EAAKjC,WAC/BiC,EAAKhC,MAAQkzD,EAAgBlxD,EAAKjC,QAAQ7W,KAAKmM,EAAS+9D,EAAcd,IAKnEtwD,EAAKqxD,OAERrxD,EAAKhD,SAAWtO,WAAWuiE,KAAsB,wBAAwBxqD,KAAKypD,GAAiB,IAvqE9E,KA4qEjBlwD,EAAKhD,SAAWlN,KAAK6F,IAAIqK,EAAKhD,UAAYgD,EAAKmxD,UAAY,EAAIC,EAAed,GAAkBc,EAAe,GAAKd,GAAiC,IAAhBtwD,EAAKhD,SAAiB,MAK5J27C,EAASkD,UAAUqU,GAAehpE,KAAKmM,EAASA,EAAS2M,GAAQ,GAAIoxD,EAAcd,EAAgBrW,EAAU6V,EAAYC,QAAUD,EAAcx5D,KAM3Is5D,IAEP,IAAI0B,EAAa,6BAA+BpB,EAAgB,gFAQhE,OANIJ,EAAYC,QACfD,EAAYO,SAAS,IAAIvpE,MAAMwqE,IACrBhqE,EAAO2F,SACjBA,QAAQuhE,IAAI8C,GAGN1B,IAzDP31B,EAAS,QAqEZ,IAAIs3B,EAAyB,CAC5BC,WAAY,KACZC,aAAc,KACdC,aAAc,KACdC,qBAAsB,KACtBC,sBAAuB,KACvBC,WAAY,KACZC,QAAS,KACTC,OAAQ,KACRC,OAAQ,MAKL9qE,EAAO,GAomCXqvD,EAAE5B,KAAKsF,EAAU,SAASxzD,EAAG4M,GAExB6mD,EAAKE,OAAO/mD,IAzlCjB,SAAwBA,EAAS4+D,GAUhC,IAKEC,EAsgC8B7oE,EA1gC9B2W,EAAOu2C,EAAExsD,OAAO,GAAI4uD,EAASt5C,SAAUzR,GAGvC6uD,EAAkB,GA6DpB,OAtDIoP,EAAKx4D,KAAaiD,GACrBqiD,EAASnC,KAAKnjD,GAUX3E,WAAWsR,EAAKhC,SAAyB,IAAfgC,EAAKwB,OAClC+0C,EAAE/0C,MAAMnO,EAAS2M,EAAKwB,MAAO,SAASgmC,EAAM2qB,GAC3C,IAAmB,IAAfA,EAEH,OAAO,EAIRxZ,EAASyZ,wBAAyB,EAOlC,IAAIC,EAAY1Z,EAASgC,MAAMgB,gBAAgBn5C,QAC/Cm2C,EAASgC,MAAMgB,gBAAgB0W,GAAah/D,EAE5C,IAA8BhK,EAA1BipE,GAA0BjpE,EAQ3BgpE,EAPK,WAEN1Z,EAASgC,MAAMgB,gBAAgBtyD,IAAS,EAGxCm+C,MAKFqkB,EAAKx4D,GAASk/D,YAAa,IAAK5uC,MAAQ+0B,UACxCmT,EAAKx4D,GAAS2K,MAAQtP,WAAWsR,EAAKhC,OACtC6tD,EAAKx4D,GAASs9D,WAAa,CAC1BtkE,WAAYA,WAAWm7C,EAAM94C,WAAWsR,EAAKhC,QAC7CwpC,KAAM8qB,KAUDtyD,EAAKhD,SAASknB,WAAWl3B,eAChC,IAAK,OACJgT,EAAKhD,SAAW,IAChB,MAED,IAAK,SACJgD,EAAKhD,SAzzEc,IA0zEnB,MAED,IAAK,OACJgD,EAAKhD,SAAW,IAChB,MAED,QAECgD,EAAKhD,SAAWtO,WAAWsR,EAAKhD,WAAa,EA8E/C,SAASw1D,EAAWhrB,GACnB,IAAIp5C,EAAMqkE,EAmNyBC,EAAWC,EACxC7B,EAAU/U,EAAQ6W,EA7MxB,GAAI5yD,EAAK65C,OAA2B,IAAlB0W,EAEjB,IACCvwD,EAAK65C,MAAM3yD,KAAK+yD,EAAUA,GACzB,MAAOhsD,GACR5B,WAAW,WACV,MAAM4B,GACJ,GASL,GAAe,WAAXgsC,EAAqB,CAExB,IAEE44B,EACAC,EACAC,EAJEC,EAAmB,OAAOvsD,KAAKzG,EAAKizD,MAAQ,OAAS,MACvDC,EAAexkE,WAAWsR,EAAKrH,SAAW,EAOxCqH,EAAK1I,UAEJ4iD,EAAKC,UAAUn6C,EAAK1I,YAAc4iD,EAAKE,OAAOp6C,EAAK1I,YAEtD0I,EAAK1I,UAAY0I,EAAK1I,UAAU,IAAM0I,EAAK1I,UAQ3Cy7D,GALAF,EAAwB7yD,EAAK1I,UAAU,SAAW07D,IAKLzc,EAAEljD,GAASqC,WAAWs9D,EAAgBhmE,eAAkBkmE,GAGrGlzD,EAAK1I,UAAY,MAKlBu7D,EAAwBla,EAASgC,MAAMW,aAAa3C,EAASgC,MAAM,iBAAmBqY,IAEtFF,EAAiCna,EAASgC,MAAMW,aAAa3C,EAASgC,MAAM,kBAAwC,SAApBqY,EAA6B,MAAQ,UAIrID,EAAoBxc,EAAEljD,GAASsF,SAASq6D,EAAgBhmE,eAAiBkmE,GAI1EzW,EAAkB,CACjB0W,OAAQ,CACPrI,mBAAmB,EACnB8H,WAAYC,EACZ9B,aAAc8B,EACd/B,SAAUiC,EACVK,SAAU,GACVrX,OAAQ/7C,EAAK+7C,OACb0S,WAAY,CACXn3D,UAAW0I,EAAK1I,UAChB2Q,UAAW+qD,EACXrE,eAAgBmE,IAGlBz/D,QAASA,GAGNslD,EAASuE,OACZjwD,QAAQuhE,IAAI,6BAA8B/R,EAAgB0W,OAAQ9/D,QAc7D,GAAe,YAAX4mC,EAAsB,CAIhC,KAHA7rC,EAAOy9D,EAAKx4D,IAIX,OAGD,IAAKjF,EAAKquD,gBAIT,YAFAlG,EAAEqB,QAAQvkD,EAAS2M,EAAKwB,OA8CxB,IAAK,IAAI6xD,IApCiB,SAAtBjlE,EAAK4R,KAAK7P,UACb/B,EAAK4R,KAAK7P,QAAU,QAGQ,WAAzB/B,EAAK4R,KAAKk8C,aACb9tD,EAAK4R,KAAKk8C,WAAa,WAKxB9tD,EAAK4R,KAAKm8C,MAAO,EACjB/tD,EAAK4R,KAAK65C,MAAQ,KAClBzrD,EAAK4R,KAAKg8C,SAAW,KAIhBpuD,EAAQmuD,eACL/7C,EAAK+7C,OAGRnuD,EAAQoP,iBACLgD,EAAKhD,SAKbgD,EAAOu2C,EAAExsD,OAAO,GAAIqE,EAAK4R,KAAMA,GAO/ByyD,EAAsBlc,EAAExsD,QAAO,EAAM,GAAIqE,EAAOA,EAAKquD,gBAAkB,MAKtE,GAAIgW,EAAoBtuC,eAAekvC,IAA4B,YAAdA,EAAyB,CAC7E,IAAIC,EAAiBb,EAAoBY,GAAWT,WAEpDH,EAAoBY,GAAWT,WAAaH,EAAoBY,GAAWtC,aAAe0B,EAAoBY,GAAWvC,SACzH2B,EAAoBY,GAAWvC,SAAWwC,EAKrCpZ,EAAKK,cAAc3sD,KACvB6kE,EAAoBY,GAAWtX,OAAS/7C,EAAK+7C,QAG1CpD,EAASuE,OACZjwD,QAAQuhE,IAAI,4BAA8B6E,EAAY,MAAQtlE,KAAKwlE,UAAUd,EAAoBY,IAAahgE,GAKjHopD,EAAkBgW,OAOb,GAAe,UAAXx4B,EAAoB,EAc9B7rC,EAAOy9D,EAAKx4D,KAKAjF,EAAKquD,kBAAwC,IAArBruD,EAAKmuD,cACxCkW,EAAsBrkE,EAAKquD,iBAY5B,IAoDI+W,EAAmB,SAAS9+B,EAAUg+B,GAEzC,IAMEhpB,EANEugB,EAAerO,EAAI0N,MAAMiB,QAAQ71B,GACnCo2B,GAAoB,EAEpBgG,EAAW4B,EAAU,GACrB3W,EAAS2W,EAAU,GACnBE,EAAaF,EAAU,GAYzB,GAAMtkE,GAASA,EAAKisD,OAA2B,UAAjB4P,IAAuE,IAA3CrO,EAAI6Q,MAAMI,YAAY5C,GAAc,IAAgBrO,EAAI0P,eAAexB,WAAWG,KAAkB3zD,EAA9J,EAUM0J,EAAK7P,UAAYmG,GAA8B,OAAjB0J,EAAK7P,SAAqC,SAAjB6P,EAAK7P,SAAwB6P,EAAKk8C,aAAe5lD,GAAiC,WAApB0J,EAAKk8C,aAA6B,iBAAiBz1C,KAAKiuB,KAAck+B,GAA2B,IAAb9B,IAC9M8B,EAAa,GAMV5yD,EAAKq8C,cAAgBoW,GAAuBA,EAAoB/9B,IAC/Dk+B,IAAet8D,IAClBs8D,EAAaH,EAAoB/9B,GAAUo8B,SAAW2B,EAAoB/9B,GAAU0+B,UAMrFtI,EAAoB18D,EAAKsuD,uBAAuBuN,IAI5CrO,EAAI0N,MAAMQ,WAAWp1B,GACpBk+B,IAAet8D,GAClBw0D,EAAoBlP,EAAIwQ,iBAAiB/4D,EAAS42D,GAGlD2I,EAAahX,EAAIwQ,iBAAiB/4D,EAASqhC,EAAUo2B,IAOrDA,EAAoBlP,EAAI0N,MAAMC,UAAUU,GAAc,GAG7C2I,IAAet8D,IACzBs8D,EAAahX,EAAIwQ,iBAAiB/4D,EAASqhC,IAQ7C,IAAI++B,EACFC,EACAC,EACA30B,GAAW,EAGT40B,EAAgB,SAASl/B,EAAUjmC,GACtC,IAAI2kE,EACFS,EAmBF,OAjBAA,GAAgBplE,GAAS,KACtBy1B,WACAl3B,cAEAJ,QAAQ,WAAY,SAASC,GAK7B,OAHAumE,EAAWvmE,EAGJ,KAILumE,IACJA,EAAWxX,EAAImP,OAAOsC,YAAY34B,IAG5B,CAACm/B,EAAcT,IAGvB,GAAIR,IAAe9B,GAAY5W,EAAK9S,SAASwrB,IAAe1Y,EAAK9S,SAAS0pB,GAAW,CACpFpnB,EAAU,GACV,IAAIoqB,EAAS,EACXC,EAAO,EACPC,EAAS,GACTC,EAAO,GACPC,EAAS,EACTC,EAAQ,EACRC,EAAS,EAIX,IAFAxB,EAAahX,EAAI0N,MAAMqB,UAAUiI,GACjC9B,EAAWlV,EAAI0N,MAAMqB,UAAUmG,GACxBgD,EAASlB,EAAWzrE,QAAU4sE,EAAOjD,EAAS3pE,QAAQ,CAC5D,IAAIktE,EAASzB,EAAWkB,GACtBQ,EAAOxD,EAASiD,GAElB,GAAI,UAAUttD,KAAK4tD,IAAW,UAAU5tD,KAAK6tD,GAAO,CAMnD,IALA,IAAIC,EAASF,EACXG,EAAOF,EACPG,EAAW,IACXC,EAAS,MAEFZ,EAASlB,EAAWzrE,QAAQ,CAEpC,IADAktE,EAASzB,EAAWkB,MACLW,EACdA,EAAW,UACL,IAAK,KAAKhuD,KAAK4tD,GACrB,MAEDE,GAAUF,EAEX,OAASN,EAAOjD,EAAS3pE,QAAQ,CAEhC,IADAmtE,EAAOxD,EAASiD,MACHW,EACZA,EAAS,UACH,IAAK,KAAKjuD,KAAK6tD,GACrB,MAEDE,GAAQF,EAET,IAAIK,EAAS/Y,EAAI0N,MAAMmB,QAAQmI,EAAYkB,GACzCc,EAAOhZ,EAAI0N,MAAMmB,QAAQqG,EAAUiD,GAIrC,GAFAD,GAAUa,EAAOxtE,OACjB4sE,GAAQa,EAAKztE,OACTwtE,IAAWC,EAEVL,IAAWC,EAEd9qB,GAAW6qB,EAASI,GAGpBjrB,GAAW,IAAMsqB,EAAO7sE,QAAUgtE,EAAQ,IAAM,IAAM,IAAMQ,EAC5DX,EAAOhrE,KAAK0F,WAAW6lE,IACvBN,EAAKjrE,KAAK0F,WAAW8lE,SAEhB,CAEN,IAAIK,EAASnmE,WAAW6lE,GACtBO,EAAOpmE,WAAW8lE,GAEpB9qB,IAAYwqB,EAAS,EAAI,OAAS,IAAM,KACnCW,EAAS,IAAMb,EAAO7sE,QAAUgtE,EAAQ,IAAM,IAAM,IAAM,KAAOQ,EAClE,OACCG,EAAO,KAAOd,EAAO7sE,QAAU0tE,EAAS,EAAI,KAAOV,EAAQ,IAAM,IAAM,IAAM,KAAOS,EACrF,IACAC,IACHb,EAAOhrE,KAAK6rE,GACZZ,EAAKjrE,KAAK,IAEP8rE,IACHd,EAAOhrE,KAAK,GACZirE,EAAKjrE,KAAK8rE,SAGN,CAAA,GAAIT,IAAWC,EAmCf,CACNJ,EAAS,EAET,MArCAxqB,GAAW2qB,EACXP,IACAC,IAEe,IAAXG,GAA2B,MAAXG,GACJ,IAAXH,GAA2B,MAAXG,GACL,IAAXH,GAA2B,MAAXG,GACL,IAAXH,GAA2B,MAAXG,GACN,GAAVH,GAA0B,MAAXG,EAEnBH,KACWA,GAAUA,EAAS,GAChB,GAAVA,GAA0B,MAAXG,KAAoBH,EAAS,KAChDA,EAAS,GAGI,IAAVC,GAA0B,MAAXE,GACJ,IAAVF,GAA0B,MAAXE,GACL,IAAVF,GAA0B,MAAXE,GACL,IAAVF,GAA0B,MAAXE,GACN,GAATF,GAAyB,MAAXE,GAEJ,IAAVF,GAA0B,MAAXE,IAClBD,EAAS,GAEVD,KACUC,GAAqB,MAAXC,EACL,IAATD,IACLD,EAAQC,EAAS,IAEPA,GAAUD,GAASC,EAAS,EAAI,KAC7BA,EAAS,EAAI,IAAvBD,GAAwC,MAAXE,KAAoBF,GAASC,EAAS,EAAI,MAC3ED,EAAQC,EAAS,IAQhBN,IAAWlB,EAAWzrE,QAAU4sE,IAASjD,EAAS3pE,SACjDwxD,EAASuE,OACZjwD,QAAQgB,MAAM,iDAAoD6iE,EAAW,OAAW8B,EAAa,MAEtGlpB,EAAUpzC,GAEPozC,IACCsqB,EAAO7sE,QACNwxD,EAASuE,OACZjwD,QAAQuhE,IAAI,kBAAqB9kB,EAAU,QAAUsqB,EAAQC,EAAM,IAAMrB,EAAa,IAAM9B,EAAW,KAExG8B,EAAaoB,EACblD,EAAWmD,EACXP,EAAmBC,EAAqB,IAExCjqB,EAAUpzC,GAwKb,GAnKKozC,IAGJkpB,GADAa,EAAiBG,EAAcl/B,EAAUk+B,IACb,GAC5Be,EAAqBF,EAAe,GAIpC3C,GADA2C,EAAiBG,EAAcl/B,EAAUo8B,IACf,GAAGlkE,QAAQ,cAAe,SAASC,EAAO6/D,GAInE,OAHA1tB,EAAW0tB,EAGJ,KAERgH,EAAmBD,EAAe,GAGlCb,EAAalkE,WAAWkkE,IAAe,EACvC9B,EAAWpiE,WAAWoiE,IAAa,EAOV,MAArB4C,IAGC,0BAA0BjtD,KAAKiuB,IAElCo8B,GAAsB,IACtB4C,EAAmB,MAET,SAASjtD,KAAKiuB,IACxBo8B,GAAsB,IACtB4C,EAAmB,IAET,qBAAqBjtD,KAAKiuB,KACpCo8B,EAAYA,EAAW,IAAO,IAC9B4C,EAAmB,MA4HlB,QAAQjtD,KAAKu4B,GAChB00B,EAAmBC,OAMb,GAAKA,IAAuBD,GAAoC,IAAfd,EAKvD,GAAiB,IAAb9B,EACH4C,EAAmBC,MACb,CAGNzB,EAA4BA,GAxHJ,WAUzB,IAAI6C,EAAsB,CACzBC,SAAU3hE,EAAQxI,YAAcC,EAASC,KACzC2K,SAAUkmD,EAAIwQ,iBAAiB/4D,EAAS,YACxC4hE,SAAUrZ,EAAIwQ,iBAAiB/4D,EAAS,aAGvC6hE,EAAqBH,EAAoBr/D,WAAa67D,EAAuBE,cAAkBsD,EAAoBC,WAAazD,EAAuBC,WAEvJ2D,EAAeJ,EAAoBE,WAAa1D,EAAuBG,aAGzEH,EAAuBC,WAAauD,EAAoBC,SACxDzD,EAAuBE,aAAesD,EAAoBr/D,SAC1D67D,EAAuBG,aAAeqD,EAAoBE,SAQ1D,IACEG,EAAa,GAEf,GAAKD,GAAgBD,EA8BpBE,EAAWC,OAAS9D,EAAuBM,WAC3CuD,EAAWE,iBAAmB/D,EAAuBI,qBACrDyD,EAAWG,kBAAoBhE,EAAuBK,0BAhChB,CACtC,IAAI4D,EAAQpnE,GAAQA,EAAKisD,MAAQvvD,EAAS2qE,gBAAgB,6BAA8B,QAAU3qE,EAASwE,cAAc,OAEzHqpD,EAASnC,KAAKgf,GACdT,EAAoBC,SAASnlE,YAAY2lE,GAKzCjf,EAAE5B,KAAK,CAAC,WAAY,YAAa,aAAc,SAASluD,EAAGiuC,GAC1DikB,EAASiD,IAAIqS,iBAAiBuH,EAAO9gC,EAAU,YAEhDikB,EAASiD,IAAIqS,iBAAiBuH,EAAO,WAAYT,EAAoBr/D,UACrEijD,EAASiD,IAAIqS,iBAAiBuH,EAAO,WAAYT,EAAoBE,UACrEtc,EAASiD,IAAIqS,iBAAiBuH,EAAO,YAAa,eAGlDjf,EAAE5B,KAAK,CAAC,WAAY,WAAY,QAAS,YAAa,YAAa,UAAW,SAASluD,EAAGiuC,GACzFikB,EAASiD,IAAIqS,iBAAiBuH,EAAO9gC,EAAU5jC,UAGhD6nD,EAASiD,IAAIqS,iBAAiBuH,EAAO,cAAe1kE,SAGpDskE,EAAWE,iBAAmB/D,EAAuBI,sBAAwBjjE,WAAWktD,EAAIwQ,iBAAiBoJ,EAAO,QAAS,MAAM,KAAU,GA3B5H,IA4BjBJ,EAAWG,kBAAoBhE,EAAuBK,uBAAyBljE,WAAWktD,EAAIwQ,iBAAiBoJ,EAAO,SAAU,MAAM,KAAU,GA5B/H,IA6BjBJ,EAAWC,OAAS9D,EAAuBM,YAAcnjE,WAAWktD,EAAIwQ,iBAAiBoJ,EAAO,iBAAmB,GA7BlG,IA+BjBT,EAAoBC,SAAShlE,YAAYwlE,GAiC1C,OAlBuC,OAAnCjE,EAAuBO,UAE1BP,EAAuBO,QAAUpjE,WAAWktD,EAAIwQ,iBAAiBthE,EAASC,KAAM,cAAgB,IAI3D,OAAlCwmE,EAAuBQ,SAC1BR,EAAuBQ,OAASrjE,WAAWpH,EAAOgJ,YAAc,IAChEihE,EAAuBS,OAAStjE,WAAWpH,EAAOiJ,aAAe,KAGlE6kE,EAAWtD,QAAUP,EAAuBO,QAC5CsD,EAAWrD,OAASR,EAAuBQ,OAC3CqD,EAAWpD,OAAST,EAAuBS,OAErB,GAAlBrZ,EAASuE,OACZjwD,QAAQuhE,IAAI,gBAAkBzgE,KAAKwlE,UAAU6B,GAAa/hE,GAEpD+hE,EAyBmDM,GAIzD,IAAIzC,EAAQ,oDAAoDxsD,KAAKiuB,IAAa,KAAKjuB,KAAKiuB,IAA0B,MAAbA,EAAoB,IAAM,IAInI,OAAQi/B,GACP,IAAK,IAIJf,GAAwB,MAATK,EAAef,EAA0BoD,iBAAmBpD,EAA0BqD,kBACrG,MAED,IAAK,KAEJ,MAED,QACC3C,GAAcV,EAA0ByB,EAAqB,QAI/D,OAAQD,GACP,IAAK,IACJd,GAAc,GAAc,MAATK,EAAef,EAA0BoD,iBAAmBpD,EAA0BqD,mBACzG,MAED,IAAK,KAEJ,MAED,QACC3C,GAAc,EAAIV,EAA0BwB,EAAmB,SAanE,OAAQ10B,GACP,IAAK,IACJ8xB,EAAW8B,EAAa9B,EACxB,MAED,IAAK,IACJA,EAAW8B,EAAa9B,EACxB,MAED,IAAK,IACJA,GAAW8B,EACX,MAED,IAAK,IACJ9B,EAAW8B,EAAa9B,EAS1BrU,EAAgB/nB,GAAY,CAC3Bo2B,kBAAmBA,EACnB8H,WAAYA,EACZ7B,aAAc6B,EACd9B,SAAUA,EACVsC,SAAUM,EACV3X,OAAQA,GAELrS,IACH+S,EAAgB/nB,GAAUgV,QAAUA,GAGjCiP,EAASuE,OACZjwD,QAAQuhE,IAAI,oBAAsB95B,EAAW,MAAQ3mC,KAAKwlE,UAAU9W,EAAgB/nB,IAAYrhC,QAle5FslD,EAASuE,OACZjwD,QAAQuhE,IAAI,aAAevE,EAAe,wCAse7C,IAAK,IAAIv1B,KAAYw7B,EAEpB,GAAKA,EAAc/rC,eAAeuQ,GAAlC,CAKA,IAAIl3B,EAAeo+C,EAAI6Q,MAAM1jB,UAAUrU,GACrCg+B,GAvjB+BA,EAujBAxC,EAAcx7B,GAtjBzBk+B,EAAR7W,EAAV+U,EADwC6B,OAujB9BgD,EAnjBVzb,EAAK1pB,WAAWkiC,KACnBA,EAAYA,EAAUxrE,KAAKmM,EAAS4+D,EAAmB3B,IAKpDpW,EAAKzvD,QAAQioE,IAGhB5B,EAAW4B,EAAU,GAKpBE,GADK1Y,EAAKzvD,QAAQioE,EAAU,KAAO,SAASjsD,KAAKisD,EAAU,KAAQxY,EAAK1pB,WAAWkiC,EAAU,KAAO9W,EAAI+D,MAAMC,MAAMn5C,KAAKisD,EAAU,IACtHA,EAAU,GAEZxY,EAAK9S,SAASsrB,EAAU,MAAQ9W,EAAI+D,MAAMC,MAAMn5C,KAAKisD,EAAU,KAAO/Z,EAASmD,QAAQ4W,EAAU,KAAQxY,EAAKzvD,QAAQioE,EAAU,KAC3I3W,EAAS4W,EAAsBD,EAAU,GAAKkD,EAAUlD,EAAU,GAAI1yD,EAAKhD,UAG9D01D,EAAU,IAEVA,EAAU,IAAMA,EAAU,IAIxC5B,EAAW4B,EAIPC,IACJ5W,EAASA,GAAU/7C,EAAK+7C,QAKrB7B,EAAK1pB,WAAWsgC,KACnBA,EAAWA,EAAS5pE,KAAKmM,EAAS4+D,EAAmB3B,IAGlDpW,EAAK1pB,WAAWoiC,KACnBA,EAAaA,EAAW1rE,KAAKmM,EAAS4+D,EAAmB3B,IAInD,CAACQ,GAAY,EAAG/U,EAAQ6W,IA0gB/B,GAAI7Y,EAAS6B,EAAIoE,MAAMC,QAAuB,CAE7C,IAAI6Q,EAAW4B,EAAU,GACvB3W,EAAS2W,EAAU,GACnBE,EAAaF,EAAU,GAEzB,GAAI9W,EAAI+D,MAAMC,MAAMn5C,KAAKqqD,GAAW,CAOnC,IALA,IAAI+E,EAAkB,CAAC,MAAO,QAAS,QACrCC,EAAcla,EAAImP,OAAOkB,SAAS6E,GAClCiF,EAAgBnD,EAAahX,EAAImP,OAAOkB,SAAS2G,GAAct8D,EAGxD7P,EAAI,EAAGA,EAAIovE,EAAgB1uE,OAAQV,IAAK,CAChD,IAAIuvE,EAAY,CAACF,EAAYrvE,IAEzBs1D,GACHia,EAAUhtE,KAAK+yD,GAGZga,IAAkBz/D,GACrB0/D,EAAUhtE,KAAK+sE,EAActvE,IAG9B+sE,EAAiBh2D,EAAeq4D,EAAgBpvE,GAAIuvE,GAGrD,UAGFxC,EAAiBh2D,EAAck1D,GAIhCjW,EAAgBppD,QAAUA,EASvBopD,EAAgBppD,UAEnBuoD,EAAImP,OAAOyC,SAASn6D,EAAS,sBAG7BnM,EAAK8B,KAAKyzD,IAEVruD,EAAOy9D,EAAKx4D,MAIQ,KAAf2M,EAAKwB,QAERpT,EAAKquD,gBAAkBA,EACvBruD,EAAK4R,KAAOA,GAIb5R,EAAKmuD,aAAc,GAKhBgU,IAAkBD,EAAiB,GAGtC3X,EAASgC,MAAMe,MAAM1yD,KAAK,CAAC9B,EAAM+yD,EAAUj6C,EAAM,KAAM8vD,EAAYzpB,SAAU,KAAM,KAGlD,IAA7BsS,EAASgC,MAAMc,YAClB9C,EAASgC,MAAMc,WAAY,EAG3B/4C,MAGD6tD,KAMH,IA36BsB,IAAlB5X,EAASkE,QAGU,IAAlBlE,EAASkE,KACZ78C,EAAKhD,SAAWgD,EAAKhC,MAAQ,GAE7BgC,EAAKhD,UAAYtO,WAAWiqD,EAASkE,OAAS,EAC9C78C,EAAKhC,OAAStP,WAAWiqD,EAASkE,OAAS,IAQ7C78C,EAAK+7C,OAAS6Z,EAAU51D,EAAK+7C,OAAQ/7C,EAAKhD,UAOtCgD,EAAK65C,QAAUK,EAAK1pB,WAAWxwB,EAAK65C,SACvC75C,EAAK65C,MAAQ,MAGV75C,EAAKi8C,WAAa/B,EAAK1pB,WAAWxwB,EAAKi8C,YAC1Cj8C,EAAKi8C,SAAW,MAGbj8C,EAAKg8C,WAAa9B,EAAK1pB,WAAWxwB,EAAKg8C,YAC1Ch8C,EAAKg8C,SAAW,MASbh8C,EAAK7P,UAAYmG,GAA8B,OAAjB0J,EAAK7P,UACtC6P,EAAK7P,QAAU6P,EAAK7P,QAAQ+zB,WAAWl3B,cAGlB,SAAjBgT,EAAK7P,UACR6P,EAAK7P,QAAUwoD,EAASiD,IAAImP,OAAOuC,eAAej6D,KAIhD2M,EAAKk8C,aAAe5lD,GAAiC,OAApB0J,EAAKk8C,aACzCl8C,EAAKk8C,WAAal8C,EAAKk8C,WAAWh4B,WAAWl3B,eAW9CgT,EAAKo8C,SAAYp8C,EAAKo8C,UAAYzD,EAASgC,MAAMC,WAAajC,EAASgC,MAAMK,eA82B1D,IAAfh7C,EAAKwB,MAGR,GAAIxB,EAAKhC,MAAO,CAGf,IAAIq0D,EAAY1Z,EAASgC,MAAMgB,gBAAgBn5C,QAC/Cm2C,EAASgC,MAAMgB,gBAAgB0W,GAAah/D,EAE5C,IAAIi/D,GAA0BjpE,EAQ3BgpE,EAPK,WAEN1Z,EAASgC,MAAMgB,gBAAgBtyD,IAAS,EAGxCmpE,MAIF3G,EAAKx4D,GAASk/D,YAAa,IAAK5uC,MAAQ+0B,UACxCmT,EAAKx4D,GAAS2K,MAAQtP,WAAWsR,EAAKhC,OACtC6tD,EAAKx4D,GAASs9D,WAAa,CAC1BtkE,WAAYA,WAAWmmE,EAAY9jE,WAAWsR,EAAKhC,QACnDwpC,KAAM8qB,QAGPE,SAKDjc,EAAE/0C,MAAMnO,EAAS2M,EAAKwB,MAAO,SAASgmC,EAAM2qB,GAG3C,IAAmB,IAAfA,EAMH,OALIrC,EAAYC,SACfD,EAAYzpB,SAAS4T,IAIf,EAKRtB,EAASyZ,wBAAyB,EAElCI,MAiBkB,KAAfxyD,EAAKwB,OAA+B,OAAfxB,EAAKwB,OAA2C,eAAxB+0C,EAAE/0C,MAAMnO,GAAS,IAClEkjD,EAAEqB,QAAQvkD,GAaV4iE,CAAe5iE,EAAS5M,MAa1BuZ,EAAOu2C,EAAExsD,OAAO,GAAI4uD,EAASt5C,SAAUzR,IAClCuuD,KAAO50C,SAASvH,EAAKm8C,KAAM,IAChC,IAAI+Z,EAAiC,EAAZl2D,EAAKm8C,KAAY,EAE1C,GAAIn8C,EAAKm8C,KAGR,IAAK,IAAIjnD,EAAI,EAAGA,EAAIghE,EAAmBhhE,IAAK,CAI3C,IAAIihE,EAAiB,CACpBn4D,MAAOgC,EAAKhC,MACZi+C,SAAUj8C,EAAKi8C,UAKZ/mD,IAAMghE,EAAoB,IAC7BC,EAAehmE,QAAU6P,EAAK7P,QAC9BgmE,EAAeja,WAAal8C,EAAKk8C,WACjCia,EAAena,SAAWh8C,EAAKg8C,UAGhC2T,EAAQ1V,EAAU,UAAWkc,GAS/B,OAAOvG,IAliDFE,EAAYC,UACVG,GAAkBtiE,IAA0C,IAA/BA,EAAQ0uD,mBAGzCwT,EAAYzpB,WAFZypB,EAAYO,cAoiDhB1X,EAAWpC,EAAExsD,OAAO4lE,EAAShX,IAEpBgX,QAAUA,EAOnB,IAAIyG,EAAS9uE,EAAO+uE,uBAAyBnd,EAM7C,IAAKP,EAASgC,MAAMC,UAAY9vD,EAASwrE,SAAWhgE,EAAW,CAC9D,IAAIigE,EAAe,WAEdzrE,EAASwrE,QACZF,EAAS,SAAS7pE,GAEjB,OAAOF,WAAW,WACjBE,GAAS,IACP,KAIJmW,KAEA0zD,EAAS9uE,EAAO+uE,uBAAyBnd,GAK3Cqd,IAGAzrE,EAAS2B,iBAAiB,mBAAoB8pE,GA4kB/C,OA9GAluE,EAAOswD,SAAWA,EAEdtwD,IAAWf,IAEde,EAAOqgB,GAAG8tD,SAAW7G,EAErBtnE,EAAOqgB,GAAG8tD,SAASn3D,SAAWs5C,EAASt5C,UAQxCk3C,EAAE5B,KAAK,CAAC,OAAQ,MAAO,SAASluD,EAAGwhB,GAClC0wC,EAASkD,UAAU,QAAU5zC,GAAa,SAAS5U,EAASzF,EAAS2iE,EAAekG,EAAcxc,EAAU6V,GAC3G,IAAI9vD,EAAOu2C,EAAExsD,OAAO,GAAI6D,GACtBisD,EAAQ75C,EAAK65C,MACbmC,EAAWh8C,EAAKg8C,SAChB0a,EAAe,GACfC,EAAiB,CAACtmE,OAAQ,GAAIoB,UAAW,GAAIC,aAAc,GAAIP,WAAY,GAAIC,cAAe,IAE5F4O,EAAK7P,UAAYmG,IAGpB0J,EAAK7P,QAAyB,SAAd8X,EAAwE,WAAhD0wC,EAASiD,IAAImP,OAAOuC,eAAej6D,GAAwB,eAAiB,QAAW,QAGhI2M,EAAK65C,MAAQ,WAOZ,IAAK,IAAInlB,KALa,IAAlB67B,GAAuB1W,GAC1BA,EAAM3yD,KAAK+yD,EAAUA,GAID0c,EACpB,GAAKA,EAAexyC,eAAeuQ,GAAnC,CAGAgiC,EAAahiC,GAAYrhC,EAAQpE,MAAMylC,GAIvC,IAAI62B,EAAgB3P,EAAIwQ,iBAAiB/4D,EAASqhC,GAClDiiC,EAAejiC,GAA2B,SAAdzsB,EAAwB,CAACsjD,EAAe,GAAK,CAAC,EAAGA,GAI9EmL,EAAaE,SAAWvjE,EAAQpE,MAAM2nE,SACtCvjE,EAAQpE,MAAM2nE,SAAW,UAG1B52D,EAAKg8C,SAAW,WAEf,IAAK,IAAItnB,KAAYgiC,EAChBA,EAAavyC,eAAeuQ,KAC/BrhC,EAAQpE,MAAMylC,GAAYgiC,EAAahiC,IAKrC67B,IAAkBkG,EAAe,IAChCza,GACHA,EAAS90D,KAAK+yD,EAAUA,GAErB6V,GACHA,EAAYzpB,SAAS4T,KAKxBtB,EAAStlD,EAASsjE,EAAgB32D,MAKpCu2C,EAAE5B,KAAK,CAAC,KAAM,OAAQ,SAASluD,EAAGwhB,GACjC0wC,EAASkD,UAAU,OAAS5zC,GAAa,SAAS5U,EAASzF,EAAS2iE,EAAekG,EAAcxc,EAAU6V,GAC1G,IAAI9vD,EAAOu2C,EAAExsD,OAAO,GAAI6D,GACtBouD,EAAWh8C,EAAKg8C,SAChBkU,EAAgB,CAACtxD,QAAwB,OAAdqJ,EAAsB,EAAI,GAIjC,IAAlBsoD,IACHvwD,EAAK65C,MAAQ,MAGb75C,EAAKg8C,SADFuU,IAAkBkG,EAAe,EACpB,KAEA,WACXza,GACHA,EAAS90D,KAAK+yD,EAAUA,GAErB6V,GACHA,EAAYzpB,SAAS4T,IAOpBj6C,EAAK7P,UAAYmG,IACpB0J,EAAK7P,QAAyB,OAAd8X,EAAqB,OAAS,QAG/C0wC,EAASrwD,KAAM4nE,EAAelwD,MAIzB24C,EAr0HP,SAASkT,EAAKx4D,GAEb,IAAIwjE,EAAWtgB,EAAEnoD,KAAKiF,EAAS,YAG/B,OAAoB,OAAbwjE,EAAoBvgE,EAAYugE,EAOxC,SAASnZ,EAAoBrqD,EAASiqD,GAGrC,IAAIlvD,EAAOy9D,EAAKx4D,GACZjF,GAAQA,EAAKuiE,aAAeviE,EAAK0oE,cACpC1oE,EAAK2oE,eAAiB3oE,EAAK4P,MAAQs/C,EAAclvD,EAAKmkE,WACtDnkE,EAAK0oE,aAAc,EACnB5qE,aAAakC,EAAKuiE,WAAWtkE,aAI/B,SAASuxD,EAAqBvqD,EAASiqD,GAEtC,IAAIlvD,EAAOy9D,EAAKx4D,GACZjF,GAAQA,EAAKuiE,YAAcviE,EAAK0oE,cAEnC1oE,EAAK0oE,aAAc,EACnB1oE,EAAKuiE,WAAWtkE,WAAaA,WAAW+B,EAAKuiE,WAAWnpB,KAAMp5C,EAAK2oE,iBAkBrE,SAASrX,EAAesX,EAAKC,EAAKC,EAAKC,GACtC,IAAIC,EAAoB,EAEtBC,EAAwB,KACxBC,EAA6B,GAC7BC,EAAmB,GACnBC,EAAkB,GAAOD,EAAmB,GAC5CE,EAAwB,iBAAkBnwE,EAG5C,GAAyB,IAArB6E,UAAUhF,OACb,OAAO,EAIR,IAAK,IAAIV,EAAI,EAAGA,EAAI,IAAKA,EACxB,GAA4B,iBAAjB0F,UAAU1F,IAAmBkI,MAAMxC,UAAU1F,MAAQggC,SAASt6B,UAAU1F,IAClF,OAAO,EAKTuwE,EAAMlnE,KAAK2H,IAAIu/D,EAAK,GACpBE,EAAMpnE,KAAK2H,IAAIy/D,EAAK,GACpBF,EAAMlnE,KAAK6F,IAAIqhE,EAAK,GACpBE,EAAMpnE,KAAK6F,IAAIuhE,EAAK,GAEpB,IAAIQ,EAAgBD,EAAwB,IAAIE,aAAaJ,GAAoB,IAAIjtE,MAAMitE,GAE3F,SAASK,EAAEC,EAAKC,GACf,OAAO,EAAM,EAAMA,EAAM,EAAMD,EAEhC,SAASE,EAAEF,EAAKC,GACf,OAAO,EAAMA,EAAM,EAAMD,EAE1B,SAASG,EAAEH,GACV,OAAO,EAAMA,EAGd,SAASI,EAAWC,EAAIL,EAAKC,GAC5B,QAASF,EAAEC,EAAKC,GAAOI,EAAKH,EAAEF,EAAKC,IAAQI,EAAKF,EAAEH,IAAQK,EAG3D,SAASC,EAASD,EAAIL,EAAKC,GAC1B,OAAO,EAAMF,EAAEC,EAAKC,GAAOI,EAAKA,EAAK,EAAMH,EAAEF,EAAKC,GAAOI,EAAKF,EAAEH,GAwCjE,SAASO,EAASC,GAKjB,IAJA,IAAIC,EAAgB,EAClBC,EAAgB,EAChBC,EAAajB,EAAmB,EAE3BgB,IAAkBC,GAAcd,EAAca,IAAkBF,IAAME,EAC5ED,GAAiBd,EAKlB,IACEiB,EAAYH,GADFD,EAAKX,IAFfa,KAEgDb,EAAca,EAAgB,GAAKb,EAAca,IAC9Df,EACnCkB,EAAeP,EAASM,EAAWzB,EAAKE,GAE1C,MAjGoB,MAiGhBwB,EApDL,SAA8BL,EAAIM,GACjC,IAAK,IAAIlyE,EAAI,EAAGA,EAAI2wE,IAAqB3wE,EAAG,CAC3C,IAAImyE,EAAeT,EAASQ,EAAS3B,EAAKE,GAE1C,GAAqB,IAAjB0B,EACH,OAAOD,EAIRA,IADeV,EAAWU,EAAS3B,EAAKE,GAAOmB,GACzBO,EAGvB,OAAOD,EAyCCE,CAAqBR,EAAII,GACL,IAAjBC,EACHD,EAlCT,SAAyBJ,EAAIS,EAAIC,GAGhC,IAFA,IAAIC,EAAUC,EAAUxyE,EAAI,EAKZ,GADfuyE,EAAWf,EADXgB,EAAWH,GAAMC,EAAKD,GAAM,EACI9B,EAAKE,GAAOmB,GAE3CU,EAAKE,EAELH,EAAKG,EAEEnpE,KAAKmvD,IAAI+Z,GAAY3B,KAA2B5wE,EAAI6wE,IAE7D,OAAO2B,EAuBCC,CAAgBb,EAAIC,EAAeA,EAAgBd,GAI5D,IAAI2B,GAAe,EAEnB,SAASC,IACRD,GAAe,EACXnC,IAAQC,GAAOC,IAAQC,GAlD5B,WACC,IAAK,IAAI1wE,EAAI,EAAGA,EAAI8wE,IAAoB9wE,EACvCixE,EAAcjxE,GAAKwxE,EAAWxxE,EAAI+wE,EAAiBR,EAAKE,GAiDxDmC,GAIF,IAAI3yE,EAAI,SAAS2xE,GAIhB,OAHKc,GACJC,IAEGpC,IAAQC,GAAOC,IAAQC,EACnBkB,EAEG,IAAPA,EACI,EAEG,IAAPA,EACI,EAGDJ,EAAWG,EAASC,GAAKpB,EAAKE,IAGtCzwE,EAAE4yE,iBAAmB,WACpB,MAAO,CAAC,CAACpkE,EAAG8hE,EAAK7hE,EAAG8hE,GAAM,CAAC/hE,EAAGgiE,EAAK/hE,EAAGgiE,KAGvC,IAAIxqE,EAAM,kBAAoB,CAACqqE,EAAKC,EAAKC,EAAKC,GAAO,IAKrD,OAJAzwE,EAAEw9B,SAAW,WACZ,OAAOv3B,GAGDjG,EA2IR,SAASkvE,EAAUnnE,EAAOuO,GACzB,IAAI++C,EAASttD,EAiCb,OA7BIyrD,EAAK9S,SAAS34C,GAEZkqD,EAASmD,QAAQrtD,KACrBstD,GAAS,GAGVA,EADU7B,EAAKzvD,QAAQgE,IAA2B,IAAjBA,EAAMtH,OA3SzC,SAAsBoyE,GACrB,OAAO,SAASvyE,GACf,OAAO8I,KAAKC,MAAM/I,EAAIuyE,IAAU,EAAIA,KA0Sd5vE,MAAM,KAAM8E,GACxByrD,EAAKzvD,QAAQgE,IAA2B,IAAjBA,EAAMtH,OAI9B02D,EAAkBl0D,MAAM,KAAM8E,EAAMhB,OAAO,CAACuP,QAC3Ck9C,EAAKzvD,QAAQgE,IAA2B,IAAjBA,EAAMtH,SAE9Bu4D,EAAe/1D,MAAM,KAAM8E,IAOtB,IAAXstD,IAEFA,EADGpD,EAASmD,QAAQnD,EAASt5C,SAAS08C,QAC7BpD,EAASt5C,SAAS08C,OAElBrB,GAIJqB,EAs5FR,SAASr5C,EAAKy6C,GAOb,GAAIA,EAAW,CAId,IAAI7D,EAAcX,EAASwE,YAA2B,IAAdA,EAAqBA,EAAY5D,EAAYxzB,MAMjFyzC,EAAc7gB,EAASgC,MAAMe,MAAMv0D,OAKrB,IAAdqyE,IACH7gB,EAASgC,MAAMe,MA9mHlB,SAA4BlpC,GAK3B,IAJA,IAAInpB,GAAS,EACXlC,EAASqrB,EAAQA,EAAMrrB,OAAS,EAChC+rB,EAAS,KAEF7pB,EAAQlC,GAAQ,CACxB,IAAIsH,EAAQ+jB,EAAMnpB,GAEdoF,GACHykB,EAAOlqB,KAAKyF,GAId,OAAOykB,EAimHkBumD,CAAmB9gB,EAASgC,MAAMe,OACzD8d,EAAc7gB,EAASgC,MAAMe,MAAMv0D,QAIpC,IAAK,IAAIV,EAAI,EAAGA,EAAI+yE,EAAa/yE,IAEhC,GAAKkyD,EAASgC,MAAMe,MAAMj1D,GAA1B,CAQA,IAAIizE,EAAgB/gB,EAASgC,MAAMe,MAAMj1D,GACvCS,EAAOwyE,EAAc,GACrB15D,EAAO05D,EAAc,GACrBC,EAAYD,EAAc,GAC1BE,GAAaD,EACbE,EAAkB,KAClBC,EAAcJ,EAAc,GAC5BK,EAAuBL,EAAc,GAiBvC,GALKC,IACJA,EAAYhhB,EAASgC,MAAMe,MAAMj1D,GAAG,GAAK6yD,EAAc,IAIpDwgB,EAAa,CAChB,IAA2B,IAAvBA,EAAYtc,OAOf,SALAmc,EAAYD,EAAc,GAAK5pE,KAAKC,MAAMupD,EAAcygB,EAAuB,IAG/EL,EAAc,GAAK,KAMrBK,EAAuBL,EAAc,GAAKpgB,EAAcqgB,EAYxD,IAPA,IAAIza,EAAkBpvD,KAAK2H,IAAI,EAAyBuI,EAAKhD,SAAU,GAO9D26C,EAAI,EAAGqiB,EAAa9yE,EAAKC,OAAQwwD,EAAIqiB,EAAYriB,IAAK,CAC9D,IAAI8E,EAAkBv1D,EAAKywD,GACzBtkD,EAAUopD,EAAgBppD,QAI5B,GAAKw4D,EAAKx4D,GAAV,CAIA,IAAI4mE,GAA0B,EAQ9B,GAAIj6D,EAAK7P,UAAYmG,GAA8B,OAAjB0J,EAAK7P,SAAqC,SAAjB6P,EAAK7P,QAAoB,CACnF,GAAqB,SAAjB6P,EAAK7P,QAAoB,CAG5BomD,EAAE5B,KAFe,CAAC,cAAe,WAAY,cAAe,gBAEzC,SAASluD,EAAGyzE,GAC9Bte,EAAIqS,iBAAiB56D,EAAS,UAAW6mE,KAI3Cte,EAAIqS,iBAAiB56D,EAAS,UAAW2M,EAAK7P,SAa/C,IAAK,IAAIukC,KATL10B,EAAKk8C,aAAe5lD,GAAiC,WAApB0J,EAAKk8C,YACzCN,EAAIqS,iBAAiB56D,EAAS,aAAc2M,EAAKk8C,YAQ7BO,EAEpB,GAAIA,EAAgBt4B,eAAeuQ,IAA0B,YAAbA,EAAwB,CACvE,IACEq8B,EADEoJ,EAAQ1d,EAAgB/nB,GAI1BqnB,EAAS7B,EAAK9S,SAAS+yB,EAAMpe,QAAUpD,EAASmD,QAAQqe,EAAMpe,QAAUoe,EAAMpe,OAMhF,GAAI7B,EAAK9S,SAAS+yB,EAAMzwB,SAAU,CACjC,IAAI0wB,EAAqC,IAApBlb,EACnB,SAAS0L,EAAIvhE,EAAO0G,GACnB,IAAImjB,EAASinD,EAAMrJ,SAASznE,GAE5B,OAAO0G,EAAQD,KAAKC,MAAMmjB,GAAUA,GAErC,SAAS03C,EAAIvhE,EAAO0G,GACnB,IAAI6iE,EAAauH,EAAMvH,WAAWvpE,GAChCgxE,EAAaF,EAAMrJ,SAASznE,GAASupE,EACrC1/C,EAAS0/C,EAAcyH,EAAate,EAAOmD,EAAiBl/C,EAAMq6D,GAEpE,OAAOtqE,EAAQD,KAAKC,MAAMmjB,GAAUA,GAGvC69C,EAAeoJ,EAAMzwB,QAAQ98C,QAAQ,eAAgBwtE,QAC/C,GAAwB,IAApBlb,EAGV6R,EAAeoJ,EAAMrJ,aACf,CAEN,IAAIuJ,EAAaF,EAAMrJ,SAAWqJ,EAAMvH,WAExC7B,EAAeoJ,EAAMvH,WAAcyH,EAAate,EAAOmD,EAAiBl/C,EAAMq6D,GAG/E,IAAKT,GAAc7I,IAAiBoJ,EAAMpJ,aACzC,SAOD,GAJAoJ,EAAMpJ,aAAeA,EAIJ,UAAbr8B,EACHmlC,EAAkB9I,MACZ,CAIN,IAAI7F,EAOJ,GAAItP,EAAI0N,MAAMQ,WAAWp1B,GAAW,CACnCw2B,EAAWtP,EAAI0N,MAAMiB,QAAQ71B,GAE7B,IAAIgoB,EAAyBmP,EAAKx4D,GAASqpD,uBAAuBwO,GAE9DxO,IACHyd,EAAMrP,kBAAoBpO,GAU5B,IAAI4d,EAAkB1e,EAAIqS,iBAAiB56D,EACzCqhC,EACAylC,EAAMpJ,cAAgBjY,EAAK,GAAkC,IAA7BpqD,WAAWqiE,GAAsB,GAAKoJ,EAAM/G,UAC5E+G,EAAMrP,kBACNqP,EAAM1L,YAOJ7S,EAAI0N,MAAMQ,WAAWp1B,KAEpBknB,EAAI0P,eAAexB,WAAWoB,GACjCW,EAAKx4D,GAASqpD,uBAAuBwO,GAAYtP,EAAI0P,eAAexB,WAAWoB,GAAU,UAAW,KAAMoP,EAAgB,IAE1HzO,EAAKx4D,GAASqpD,uBAAuBwO,GAAYoP,EAAgB,IASxC,cAAvBA,EAAgB,KACnBL,GAA0B,IAa1Bj6D,EAAKo8C,UAEJyP,EAAKx4D,GAASspD,eAAe4d,cAAgBjkE,IAEhDu1D,EAAKx4D,GAASspD,eAAe4d,YAAc,kBAE3CN,GAA0B,GAIxBA,GACHre,EAAIiT,oBAAoBx7D,IAMtB2M,EAAK7P,UAAYmG,GAA8B,SAAjB0J,EAAK7P,UACtCwoD,EAASgC,MAAMe,MAAMj1D,GAAG,GAAG0J,SAAU,GAElC6P,EAAKk8C,aAAe5lD,GAAiC,WAApB0J,EAAKk8C,aACzCvD,EAASgC,MAAMe,MAAMj1D,GAAG,GAAGy1D,YAAa,GAIrCl8C,EAAKi8C,UACRj8C,EAAKi8C,SAAS/0D,KAAKwyE,EAAc,GAC/BA,EAAc,GACdxa,EACApvD,KAAK6F,IAAI,EAAIgkE,EAAY35D,EAAKhD,SAAYs8C,GAC1CqgB,EACAE,GAIqB,IAApB3a,GACH8R,EAAavqE,IAMZkyD,EAASgC,MAAMc,WAClB2a,EAAO1zD,GAST,SAASsuD,EAAaqB,EAAWmI,GAEhC,IAAK7hB,EAASgC,MAAMe,MAAM2W,GACzB,OAAO,EAeR,IAXA,IAAInrE,EAAOyxD,EAASgC,MAAMe,MAAM2W,GAAW,GACzCpY,EAAWtB,EAASgC,MAAMe,MAAM2W,GAAW,GAC3CryD,EAAO24C,EAASgC,MAAMe,MAAM2W,GAAW,GACvChsB,EAAWsS,EAASgC,MAAMe,MAAM2W,GAAW,GAEzCoI,GAAsB,EAMjBh0E,EAAI,EAAGuzE,EAAa9yE,EAAKC,OAAQV,EAAIuzE,EAAYvzE,IAAK,CAC9D,IAAI4M,EAAUnM,EAAKT,GAAG4M,QAKjBmnE,GAAcx6D,EAAKm8C,OACF,SAAjBn8C,EAAK7P,SACRyrD,EAAIqS,iBAAiB56D,EAAS,UAAW2M,EAAK7P,SAGvB,WAApB6P,EAAKk8C,YACRN,EAAIqS,iBAAiB56D,EAAS,aAAc2M,EAAKk8C,aASnD,IAAI9tD,EAAOy9D,EAAKx4D,GAEhB,IAAkB,IAAd2M,EAAKm8C,OAAkB5F,EAAE/0C,MAAMnO,GAAS,KAAOiD,IAAc,4BAA4BmQ,KAAK8vC,EAAE/0C,MAAMnO,GAAS,MAE9GjF,EAAM,CACTA,EAAKmuD,aAAc,EAInB,IAAIme,IAFJtsE,EAAKsuD,uBAAyB,IAI9BnG,EAAE5B,KAAKiH,EAAIoE,MAAMG,aAAc,SAAS15D,EAAGmlE,GAC1C,IAAI3sB,EAAe,SAASx4B,KAAKmlD,GAAiB,EAAI,EACpDmF,EAAe3iE,EAAKuuD,eAAeiP,GAEjCx9D,EAAKuuD,eAAeiP,KAAmBt1D,GAAa,IAAIqV,OAAO,OAASszB,EAAe,QAAQx4B,KAAKsqD,KACvG2J,GAA4B,SAErBtsE,EAAKuuD,eAAeiP,MAKzB5rD,EAAKo8C,WACRse,GAA4B,SACrBtsE,EAAKuuD,eAAe4d,aAIxBG,GACH9e,EAAIiT,oBAAoBx7D,GAIzBuoD,EAAImP,OAAO6C,YAAYv6D,EAAS,sBAUlC,IAAKmnE,GAAax6D,EAAKg8C,WAAah8C,EAAKm8C,MAAS11D,IAAMuzE,EAAa,EAEpE,IACCh6D,EAAKg8C,SAAS90D,KAAK+yD,EAAUA,GAC5B,MAAOhsD,GACR5B,WAAW,WACV,MAAM4B,GACJ,GASDo4C,IAA0B,IAAdrmC,EAAKm8C,MACpB9V,EAAS4T,GAON7rD,IAAsB,IAAd4R,EAAKm8C,OAAkBqe,IAGlCjkB,EAAE5B,KAAKvmD,EAAKquD,gBAAiB,SAASj/C,EAAcm9D,GACnD,GAAI,UAAUl0D,KAAKjJ,KAAmB9O,WAAWisE,EAAe/H,YAAclkE,WAAWisE,EAAe7J,WAAa,KAAQ,EAAI,CAChI,IAAI8J,EAAgBD,EAAe/H,WAEnC+H,EAAe/H,WAAa+H,EAAe7J,SAC3C6J,EAAe7J,SAAW8J,EAGvB,sBAAsBn0D,KAAKjJ,IAAyD,MAAxC9O,WAAWisE,EAAe7J,WAAiD,MAA5B6J,EAAevH,WAC7GuH,EAAe7J,SAAW,EAC1B6J,EAAe/H,WAAa,OAI9Bja,EAAStlD,EAAS,UAAW,CAAC8oD,MAAM,EAAMn+C,MAAOgC,EAAKhC,UAUpC,IAAfgC,EAAKwB,OACR+0C,EAAEqB,QAAQvkD,EAAS2M,EAAKwB,OAU1Bm3C,EAASgC,MAAMe,MAAM2W,IAAa,EAIlC,IAAK,IAAI1a,EAAI,EAAG6hB,EAAc7gB,EAASgC,MAAMe,MAAMv0D,OAAQwwD,EAAI6hB,EAAa7hB,IAC3E,IAAgC,IAA5BgB,EAASgC,MAAMe,MAAM/D,GAAc,CACtC8iB,GAAsB,EAEtB,OAI0B,IAAxBA,IAEH9hB,EAASgC,MAAMc,WAAY,SAGpB9C,EAASgC,MAAMe,MACtB/C,EAASgC,MAAMe,MAAQ,IAp3HxB/tD,OAAO+a,GAAG8tD,SAAW7oE,OAAO+a,GAAGinD,QAvP1B,CAuuIJroE,OAAOqG,QAAUrG,OAAOuzE,OAASvzE,OAASA,OAASA,OAASA,OAAOwD,cAAWwL,MAWhF,KAAK,GAAG","file":"dependencies-bundle.js","sourcesContent":["require=(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){\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\n},{}],2:[function(require,module,exports){\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},{}],3:[function(require,module,exports){\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},{\"desandro-matches-selector\":1}],4:[function(require,module,exports){\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},{}],5:[function(require,module,exports){\n/**\n * Isotope Item\n**/\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        'outlayer/outlayer'\n      ],\n      factory );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      require('outlayer')\n    );\n  } else {\n    // browser global\n    window.Isotope = window.Isotope || {};\n    window.Isotope.Item = factory(\n      window.Outlayer\n    );\n  }\n\n}( window, function factory( Outlayer ) {\n'use strict';\n\n// -------------------------- Item -------------------------- //\n\n// sub-class Outlayer Item\nfunction Item() {\n  Outlayer.Item.apply( this, arguments );\n}\n\nvar proto = Item.prototype = Object.create( Outlayer.Item.prototype );\n\nvar _create = proto._create;\nproto._create = function() {\n  // assign id, used for original-order sorting\n  this.id = this.layout.itemGUID++;\n  _create.call( this );\n  this.sortData = {};\n};\n\nproto.updateSortData = function() {\n  if ( this.isIgnored ) {\n    return;\n  }\n  // default sorters\n  this.sortData.id = this.id;\n  // for backward compatibility\n  this.sortData['original-order'] = this.id;\n  this.sortData.random = Math.random();\n  // go thru getSortData obj and apply the sorters\n  var getSortData = this.layout.options.getSortData;\n  var sorters = this.layout._sorters;\n  for ( var key in getSortData ) {\n    var sorter = sorters[ key ];\n    this.sortData[ key ] = sorter( this.element, this );\n  }\n};\n\nvar _destroy = proto.destroy;\nproto.destroy = function() {\n  // call super\n  _destroy.apply( this, arguments );\n  // reset display, #741\n  this.css({\n    display: ''\n  });\n};\n\nreturn Item;\n\n}));\n\n},{\"outlayer\":12}],6:[function(require,module,exports){\n/**\n * Isotope LayoutMode\n */\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        'get-size/get-size',\n        'outlayer/outlayer'\n      ],\n      factory );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      require('get-size'),\n      require('outlayer')\n    );\n  } else {\n    // browser global\n    window.Isotope = window.Isotope || {};\n    window.Isotope.LayoutMode = factory(\n      window.getSize,\n      window.Outlayer\n    );\n  }\n\n}( window, function factory( getSize, Outlayer ) {\n  'use strict';\n\n  // layout mode class\n  function LayoutMode( isotope ) {\n    this.isotope = isotope;\n    // link properties\n    if ( isotope ) {\n      this.options = isotope.options[ this.namespace ];\n      this.element = isotope.element;\n      this.items = isotope.filteredItems;\n      this.size = isotope.size;\n    }\n  }\n\n  var proto = LayoutMode.prototype;\n\n  /**\n   * some methods should just defer to default Outlayer method\n   * and reference the Isotope instance as `this`\n  **/\n  var facadeMethods = [\n    '_resetLayout',\n    '_getItemLayoutPosition',\n    '_manageStamp',\n    '_getContainerSize',\n    '_getElementOffset',\n    'needsResizeLayout',\n    '_getOption'\n  ];\n\n  facadeMethods.forEach( function( methodName ) {\n    proto[ methodName ] = function() {\n      return Outlayer.prototype[ methodName ].apply( this.isotope, arguments );\n    };\n  });\n\n  // -----  ----- //\n\n  // for horizontal layout modes, check vertical size\n  proto.needsVerticalResizeLayout = function() {\n    // don't trigger if size did not change\n    var size = getSize( this.isotope.element );\n    // check that this.size and size are there\n    // IE8 triggers resize on body size change, so they might not be\n    var hasSizes = this.isotope.size && size;\n    return hasSizes && size.innerHeight != this.isotope.size.innerHeight;\n  };\n\n  // ----- measurements ----- //\n\n  proto._getMeasurement = function() {\n    this.isotope._getMeasurement.apply( this, arguments );\n  };\n\n  proto.getColumnWidth = function() {\n    this.getSegmentSize( 'column', 'Width' );\n  };\n\n  proto.getRowHeight = function() {\n    this.getSegmentSize( 'row', 'Height' );\n  };\n\n  /**\n   * get columnWidth or rowHeight\n   * segment: 'column' or 'row'\n   * size 'Width' or 'Height'\n  **/\n  proto.getSegmentSize = function( segment, size ) {\n    var segmentName = segment + size;\n    var outerSize = 'outer' + size;\n    // columnWidth / outerWidth // rowHeight / outerHeight\n    this._getMeasurement( segmentName, outerSize );\n    // got rowHeight or columnWidth, we can chill\n    if ( this[ segmentName ] ) {\n      return;\n    }\n    // fall back to item of first element\n    var firstItemSize = this.getFirstItemSize();\n    this[ segmentName ] = firstItemSize && firstItemSize[ outerSize ] ||\n      // or size of container\n      this.isotope.size[ 'inner' + size ];\n  };\n\n  proto.getFirstItemSize = function() {\n    var firstItem = this.isotope.filteredItems[0];\n    return firstItem && firstItem.element && getSize( firstItem.element );\n  };\n\n  // ----- methods that should reference isotope ----- //\n\n  proto.layout = function() {\n    this.isotope.layout.apply( this.isotope, arguments );\n  };\n\n  proto.getSize = function() {\n    this.isotope.getSize();\n    this.size = this.isotope.size;\n  };\n\n  // -------------------------- create -------------------------- //\n\n  LayoutMode.modes = {};\n\n  LayoutMode.create = function( namespace, options ) {\n\n    function Mode() {\n      LayoutMode.apply( this, arguments );\n    }\n\n    Mode.prototype = Object.create( proto );\n    Mode.prototype.constructor = Mode;\n\n    // default options\n    if ( options ) {\n      Mode.options = options;\n    }\n\n    Mode.prototype.namespace = namespace;\n    // register in Isotope\n    LayoutMode.modes[ namespace ] = Mode;\n\n    return Mode;\n  };\n\n  return LayoutMode;\n\n}));\n\n},{\"get-size\":4,\"outlayer\":12}],7:[function(require,module,exports){\n/**\n * fitRows layout mode\n */\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        '../layout-mode'\n      ],\n      factory );\n  } else if ( typeof exports == 'object' ) {\n    // CommonJS\n    module.exports = factory(\n      require('../layout-mode')\n    );\n  } else {\n    // browser global\n    factory(\n      window.Isotope.LayoutMode\n    );\n  }\n\n}( window, function factory( LayoutMode ) {\n'use strict';\n\nvar FitRows = LayoutMode.create('fitRows');\n\nvar proto = FitRows.prototype;\n\nproto._resetLayout = function() {\n  this.x = 0;\n  this.y = 0;\n  this.maxY = 0;\n  this._getMeasurement( 'gutter', 'outerWidth' );\n};\n\nproto._getItemLayoutPosition = function( item ) {\n  item.getSize();\n\n  var itemWidth = item.size.outerWidth + this.gutter;\n  // if this element cannot fit in the current row\n  var containerWidth = this.isotope.size.innerWidth + this.gutter;\n  if ( this.x !== 0 && itemWidth + this.x > containerWidth ) {\n    this.x = 0;\n    this.y = this.maxY;\n  }\n\n  var position = {\n    x: this.x,\n    y: this.y\n  };\n\n  this.maxY = Math.max( this.maxY, this.y + item.size.outerHeight );\n  this.x += itemWidth;\n\n  return position;\n};\n\nproto._getContainerSize = function() {\n  return { height: this.maxY };\n};\n\nreturn FitRows;\n\n}));\n\n},{\"../layout-mode\":6}],8:[function(require,module,exports){\n/*!\n * Masonry layout mode\n * sub-classes Masonry\n * https://masonry.desandro.com\n */\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        '../layout-mode',\n        'masonry-layout/masonry'\n      ],\n      factory );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      require('../layout-mode'),\n      require('masonry-layout')\n    );\n  } else {\n    // browser global\n    factory(\n      window.Isotope.LayoutMode,\n      window.Masonry\n    );\n  }\n\n}( window, function factory( LayoutMode, Masonry ) {\n'use strict';\n\n// -------------------------- masonryDefinition -------------------------- //\n\n  // create an Outlayer layout class\n  var MasonryMode = LayoutMode.create('masonry');\n\n  var proto = MasonryMode.prototype;\n\n  var keepModeMethods = {\n    _getElementOffset: true,\n    layout: true,\n    _getMeasurement: true\n  };\n\n  // inherit Masonry prototype\n  for ( var method in Masonry.prototype ) {\n    // do not inherit mode methods\n    if ( !keepModeMethods[ method ] ) {\n      proto[ method ] = Masonry.prototype[ method ];\n    }\n  }\n\n  var measureColumns = proto.measureColumns;\n  proto.measureColumns = function() {\n    // set items, used if measuring first item\n    this.items = this.isotope.filteredItems;\n    measureColumns.call( this );\n  };\n\n  // point to mode options for fitWidth\n  var _getOption = proto._getOption;\n  proto._getOption = function( option ) {\n    if ( option == 'fitWidth' ) {\n      return this.options.isFitWidth !== undefined ?\n        this.options.isFitWidth : this.options.fitWidth;\n    }\n    return _getOption.apply( this.isotope, arguments );\n  };\n\n  return MasonryMode;\n\n}));\n\n},{\"../layout-mode\":6,\"masonry-layout\":10}],9:[function(require,module,exports){\n/**\n * vertical layout mode\n */\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        '../layout-mode'\n      ],\n      factory );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      require('../layout-mode')\n    );\n  } else {\n    // browser global\n    factory(\n      window.Isotope.LayoutMode\n    );\n  }\n\n}( window, function factory( LayoutMode ) {\n'use strict';\n\nvar Vertical = LayoutMode.create( 'vertical', {\n  horizontalAlignment: 0\n});\n\nvar proto = Vertical.prototype;\n\nproto._resetLayout = function() {\n  this.y = 0;\n};\n\nproto._getItemLayoutPosition = function( item ) {\n  item.getSize();\n  var x = ( this.isotope.size.innerWidth - item.size.outerWidth ) *\n    this.options.horizontalAlignment;\n  var y = this.y;\n  this.y += item.size.outerHeight;\n  return { x: x, y: y };\n};\n\nproto._getContainerSize = function() {\n  return { height: this.y };\n};\n\nreturn Vertical;\n\n}));\n\n},{\"../layout-mode\":6}],10:[function(require,module,exports){\n/*!\n * Masonry v4.2.2\n * Cascading grid layout library\n * https://masonry.desandro.com\n * MIT License\n * by David DeSandro\n */\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        'outlayer/outlayer',\n        'get-size/get-size'\n      ],\n      factory );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      require('outlayer'),\n      require('get-size')\n    );\n  } else {\n    // browser global\n    window.Masonry = factory(\n      window.Outlayer,\n      window.getSize\n    );\n  }\n\n}( window, function factory( Outlayer, getSize ) {\n\n'use strict';\n\n// -------------------------- masonryDefinition -------------------------- //\n\n  // create an Outlayer layout class\n  var Masonry = Outlayer.create('masonry');\n  // isFitWidth -> fitWidth\n  Masonry.compatOptions.fitWidth = 'isFitWidth';\n\n  var proto = Masonry.prototype;\n\n  proto._resetLayout = function() {\n    this.getSize();\n    this._getMeasurement( 'columnWidth', 'outerWidth' );\n    this._getMeasurement( 'gutter', 'outerWidth' );\n    this.measureColumns();\n\n    // reset column Y\n    this.colYs = [];\n    for ( var i=0; i < this.cols; i++ ) {\n      this.colYs.push( 0 );\n    }\n\n    this.maxY = 0;\n    this.horizontalColIndex = 0;\n  };\n\n  proto.measureColumns = function() {\n    this.getContainerWidth();\n    // if columnWidth is 0, default to outerWidth of first item\n    if ( !this.columnWidth ) {\n      var firstItem = this.items[0];\n      var firstItemElem = firstItem && firstItem.element;\n      // columnWidth fall back to item of first element\n      this.columnWidth = firstItemElem && getSize( firstItemElem ).outerWidth ||\n        // if first elem has no width, default to size of container\n        this.containerWidth;\n    }\n\n    var columnWidth = this.columnWidth += this.gutter;\n\n    // calculate columns\n    var containerWidth = this.containerWidth + this.gutter;\n    var cols = containerWidth / columnWidth;\n    // fix rounding errors, typically with gutters\n    var excess = columnWidth - containerWidth % columnWidth;\n    // if overshoot is less than a pixel, round up, otherwise floor it\n    var mathMethod = excess && excess < 1 ? 'round' : 'floor';\n    cols = Math[ mathMethod ]( cols );\n    this.cols = Math.max( cols, 1 );\n  };\n\n  proto.getContainerWidth = function() {\n    // container is parent if fit width\n    var isFitWidth = this._getOption('fitWidth');\n    var container = isFitWidth ? this.element.parentNode : this.element;\n    // check that this.size and size are there\n    // IE8 triggers resize on body size change, so they might not be\n    var size = getSize( container );\n    this.containerWidth = size && size.innerWidth;\n  };\n\n  proto._getItemLayoutPosition = function( item ) {\n    item.getSize();\n    // how many columns does this brick span\n    var remainder = item.size.outerWidth % this.columnWidth;\n    var mathMethod = remainder && remainder < 1 ? 'round' : 'ceil';\n    // round if off by 1 pixel, otherwise use ceil\n    var colSpan = Math[ mathMethod ]( item.size.outerWidth / this.columnWidth );\n    colSpan = Math.min( colSpan, this.cols );\n    // use horizontal or top column position\n    var colPosMethod = this.options.horizontalOrder ?\n      '_getHorizontalColPosition' : '_getTopColPosition';\n    var colPosition = this[ colPosMethod ]( colSpan, item );\n    // position the brick\n    var position = {\n      x: this.columnWidth * colPosition.col,\n      y: colPosition.y\n    };\n    // apply setHeight to necessary columns\n    var setHeight = colPosition.y + item.size.outerHeight;\n    var setMax = colSpan + colPosition.col;\n    for ( var i = colPosition.col; i < setMax; i++ ) {\n      this.colYs[i] = setHeight;\n    }\n\n    return position;\n  };\n\n  proto._getTopColPosition = function( colSpan ) {\n    var colGroup = this._getTopColGroup( colSpan );\n    // get the minimum Y value from the columns\n    var minimumY = Math.min.apply( Math, colGroup );\n\n    return {\n      col: colGroup.indexOf( minimumY ),\n      y: minimumY,\n    };\n  };\n\n  /**\n   * @param {Number} colSpan - number of columns the element spans\n   * @returns {Array} colGroup\n   */\n  proto._getTopColGroup = function( colSpan ) {\n    if ( colSpan < 2 ) {\n      // if brick spans only one column, use all the column Ys\n      return this.colYs;\n    }\n\n    var colGroup = [];\n    // how many different places could this brick fit horizontally\n    var groupCount = this.cols + 1 - colSpan;\n    // for each group potential horizontal position\n    for ( var i = 0; i < groupCount; i++ ) {\n      colGroup[i] = this._getColGroupY( i, colSpan );\n    }\n    return colGroup;\n  };\n\n  proto._getColGroupY = function( col, colSpan ) {\n    if ( colSpan < 2 ) {\n      return this.colYs[ col ];\n    }\n    // make an array of colY values for that one group\n    var groupColYs = this.colYs.slice( col, col + colSpan );\n    // and get the max value of the array\n    return Math.max.apply( Math, groupColYs );\n  };\n\n  // get column position based on horizontal index. #873\n  proto._getHorizontalColPosition = function( colSpan, item ) {\n    var col = this.horizontalColIndex % this.cols;\n    var isOver = colSpan > 1 && col + colSpan > this.cols;\n    // shift to next row if item can't fit on current row\n    col = isOver ? 0 : col;\n    // don't let zero-size items take up space\n    var hasSize = item.size.outerWidth && item.size.outerHeight;\n    this.horizontalColIndex = hasSize ? col + colSpan : this.horizontalColIndex;\n\n    return {\n      col: col,\n      y: this._getColGroupY( col, colSpan ),\n    };\n  };\n\n  proto._manageStamp = function( stamp ) {\n    var stampSize = getSize( stamp );\n    var offset = this._getElementOffset( stamp );\n    // get the columns that this stamp affects\n    var isOriginLeft = this._getOption('originLeft');\n    var firstX = isOriginLeft ? offset.left : offset.right;\n    var lastX = firstX + stampSize.outerWidth;\n    var firstCol = Math.floor( firstX / this.columnWidth );\n    firstCol = Math.max( 0, firstCol );\n    var lastCol = Math.floor( lastX / this.columnWidth );\n    // lastCol should not go over if multiple of columnWidth #425\n    lastCol -= lastX % this.columnWidth ? 0 : 1;\n    lastCol = Math.min( this.cols - 1, lastCol );\n    // set colYs to bottom of the stamp\n\n    var isOriginTop = this._getOption('originTop');\n    var stampMaxY = ( isOriginTop ? offset.top : offset.bottom ) +\n      stampSize.outerHeight;\n    for ( var i = firstCol; i <= lastCol; i++ ) {\n      this.colYs[i] = Math.max( stampMaxY, this.colYs[i] );\n    }\n  };\n\n  proto._getContainerSize = function() {\n    this.maxY = Math.max.apply( Math, this.colYs );\n    var size = {\n      height: this.maxY\n    };\n\n    if ( this._getOption('fitWidth') ) {\n      size.width = this._getContainerFitWidth();\n    }\n\n    return size;\n  };\n\n  proto._getContainerFitWidth = function() {\n    var unusedCols = 0;\n    // count unused columns\n    var i = this.cols;\n    while ( --i ) {\n      if ( this.colYs[i] !== 0 ) {\n        break;\n      }\n      unusedCols++;\n    }\n    // fit container to columns that have been used\n    return ( this.cols - unusedCols ) * this.columnWidth - this.gutter;\n  };\n\n  proto.needsResizeLayout = function() {\n    var previousWidth = this.containerWidth;\n    this.getContainerWidth();\n    return previousWidth != this.containerWidth;\n  };\n\n  return Masonry;\n\n}));\n\n},{\"get-size\":4,\"outlayer\":12}],11:[function(require,module,exports){\n/**\n * Outlayer Item\n */\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 - RequireJS\n    define( [\n        'ev-emitter/ev-emitter',\n        'get-size/get-size'\n      ],\n      factory\n    );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS - Browserify, Webpack\n    module.exports = factory(\n      require('ev-emitter'),\n      require('get-size')\n    );\n  } else {\n    // browser global\n    window.Outlayer = {};\n    window.Outlayer.Item = factory(\n      window.EvEmitter,\n      window.getSize\n    );\n  }\n\n}( window, function factory( EvEmitter, getSize ) {\n'use strict';\n\n// ----- helpers ----- //\n\nfunction isEmptyObj( obj ) {\n  for ( var prop in obj ) {\n    return false;\n  }\n  prop = null;\n  return true;\n}\n\n// -------------------------- CSS3 support -------------------------- //\n\n\nvar docElemStyle = document.documentElement.style;\n\nvar transitionProperty = typeof docElemStyle.transition == 'string' ?\n  'transition' : 'WebkitTransition';\nvar transformProperty = typeof docElemStyle.transform == 'string' ?\n  'transform' : 'WebkitTransform';\n\nvar transitionEndEvent = {\n  WebkitTransition: 'webkitTransitionEnd',\n  transition: 'transitionend'\n}[ transitionProperty ];\n\n// cache all vendor properties that could have vendor prefix\nvar vendorProperties = {\n  transform: transformProperty,\n  transition: transitionProperty,\n  transitionDuration: transitionProperty + 'Duration',\n  transitionProperty: transitionProperty + 'Property',\n  transitionDelay: transitionProperty + 'Delay'\n};\n\n// -------------------------- Item -------------------------- //\n\nfunction Item( element, layout ) {\n  if ( !element ) {\n    return;\n  }\n\n  this.element = element;\n  // parent layout class, i.e. Masonry, Isotope, or Packery\n  this.layout = layout;\n  this.position = {\n    x: 0,\n    y: 0\n  };\n\n  this._create();\n}\n\n// inherit EvEmitter\nvar proto = Item.prototype = Object.create( EvEmitter.prototype );\nproto.constructor = Item;\n\nproto._create = function() {\n  // transition objects\n  this._transn = {\n    ingProperties: {},\n    clean: {},\n    onEnd: {}\n  };\n\n  this.css({\n    position: 'absolute'\n  });\n};\n\n// trigger specified handler for event type\nproto.handleEvent = function( event ) {\n  var method = 'on' + event.type;\n  if ( this[ method ] ) {\n    this[ method ]( event );\n  }\n};\n\nproto.getSize = function() {\n  this.size = getSize( this.element );\n};\n\n/**\n * apply CSS styles to element\n * @param {Object} style\n */\nproto.css = function( style ) {\n  var elemStyle = this.element.style;\n\n  for ( var prop in style ) {\n    // use vendor property if available\n    var supportedProp = vendorProperties[ prop ] || prop;\n    elemStyle[ supportedProp ] = style[ prop ];\n  }\n};\n\n // measure position, and sets it\nproto.getPosition = function() {\n  var style = getComputedStyle( this.element );\n  var isOriginLeft = this.layout._getOption('originLeft');\n  var isOriginTop = this.layout._getOption('originTop');\n  var xValue = style[ isOriginLeft ? 'left' : 'right' ];\n  var yValue = style[ isOriginTop ? 'top' : 'bottom' ];\n  var x = parseFloat( xValue );\n  var y = parseFloat( yValue );\n  // convert percent to pixels\n  var layoutSize = this.layout.size;\n  if ( xValue.indexOf('%') != -1 ) {\n    x = ( x / 100 ) * layoutSize.width;\n  }\n  if ( yValue.indexOf('%') != -1 ) {\n    y = ( y / 100 ) * layoutSize.height;\n  }\n  // clean up 'auto' or other non-integer values\n  x = isNaN( x ) ? 0 : x;\n  y = isNaN( y ) ? 0 : y;\n  // remove padding from measurement\n  x -= isOriginLeft ? layoutSize.paddingLeft : layoutSize.paddingRight;\n  y -= isOriginTop ? layoutSize.paddingTop : layoutSize.paddingBottom;\n\n  this.position.x = x;\n  this.position.y = y;\n};\n\n// set settled position, apply padding\nproto.layoutPosition = function() {\n  var layoutSize = this.layout.size;\n  var style = {};\n  var isOriginLeft = this.layout._getOption('originLeft');\n  var isOriginTop = this.layout._getOption('originTop');\n\n  // x\n  var xPadding = isOriginLeft ? 'paddingLeft' : 'paddingRight';\n  var xProperty = isOriginLeft ? 'left' : 'right';\n  var xResetProperty = isOriginLeft ? 'right' : 'left';\n\n  var x = this.position.x + layoutSize[ xPadding ];\n  // set in percentage or pixels\n  style[ xProperty ] = this.getXValue( x );\n  // reset other property\n  style[ xResetProperty ] = '';\n\n  // y\n  var yPadding = isOriginTop ? 'paddingTop' : 'paddingBottom';\n  var yProperty = isOriginTop ? 'top' : 'bottom';\n  var yResetProperty = isOriginTop ? 'bottom' : 'top';\n\n  var y = this.position.y + layoutSize[ yPadding ];\n  // set in percentage or pixels\n  style[ yProperty ] = this.getYValue( y );\n  // reset other property\n  style[ yResetProperty ] = '';\n\n  this.css( style );\n  this.emitEvent( 'layout', [ this ] );\n};\n\nproto.getXValue = function( x ) {\n  var isHorizontal = this.layout._getOption('horizontal');\n  return this.layout.options.percentPosition && !isHorizontal ?\n    ( ( x / this.layout.size.width ) * 100 ) + '%' : x + 'px';\n};\n\nproto.getYValue = function( y ) {\n  var isHorizontal = this.layout._getOption('horizontal');\n  return this.layout.options.percentPosition && isHorizontal ?\n    ( ( y / this.layout.size.height ) * 100 ) + '%' : y + 'px';\n};\n\nproto._transitionTo = function( x, y ) {\n  this.getPosition();\n  // get current x & y from top/left\n  var curX = this.position.x;\n  var curY = this.position.y;\n\n  var didNotMove = x == this.position.x && y == this.position.y;\n\n  // save end position\n  this.setPosition( x, y );\n\n  // if did not move and not transitioning, just go to layout\n  if ( didNotMove && !this.isTransitioning ) {\n    this.layoutPosition();\n    return;\n  }\n\n  var transX = x - curX;\n  var transY = y - curY;\n  var transitionStyle = {};\n  transitionStyle.transform = this.getTranslate( transX, transY );\n\n  this.transition({\n    to: transitionStyle,\n    onTransitionEnd: {\n      transform: this.layoutPosition\n    },\n    isCleaning: true\n  });\n};\n\nproto.getTranslate = function( x, y ) {\n  // flip cooridinates if origin on right or bottom\n  var isOriginLeft = this.layout._getOption('originLeft');\n  var isOriginTop = this.layout._getOption('originTop');\n  x = isOriginLeft ? x : -x;\n  y = isOriginTop ? y : -y;\n  return 'translate3d(' + x + 'px, ' + y + 'px, 0)';\n};\n\n// non transition + transform support\nproto.goTo = function( x, y ) {\n  this.setPosition( x, y );\n  this.layoutPosition();\n};\n\nproto.moveTo = proto._transitionTo;\n\nproto.setPosition = function( x, y ) {\n  this.position.x = parseFloat( x );\n  this.position.y = parseFloat( y );\n};\n\n// ----- transition ----- //\n\n/**\n * @param {Object} style - CSS\n * @param {Function} onTransitionEnd\n */\n\n// non transition, just trigger callback\nproto._nonTransition = function( args ) {\n  this.css( args.to );\n  if ( args.isCleaning ) {\n    this._removeStyles( args.to );\n  }\n  for ( var prop in args.onTransitionEnd ) {\n    args.onTransitionEnd[ prop ].call( this );\n  }\n};\n\n/**\n * proper transition\n * @param {Object} args - arguments\n *   @param {Object} to - style to transition to\n *   @param {Object} from - style to start transition from\n *   @param {Boolean} isCleaning - removes transition styles after transition\n *   @param {Function} onTransitionEnd - callback\n */\nproto.transition = function( args ) {\n  // redirect to nonTransition if no transition duration\n  if ( !parseFloat( this.layout.options.transitionDuration ) ) {\n    this._nonTransition( args );\n    return;\n  }\n\n  var _transition = this._transn;\n  // keep track of onTransitionEnd callback by css property\n  for ( var prop in args.onTransitionEnd ) {\n    _transition.onEnd[ prop ] = args.onTransitionEnd[ prop ];\n  }\n  // keep track of properties that are transitioning\n  for ( prop in args.to ) {\n    _transition.ingProperties[ prop ] = true;\n    // keep track of properties to clean up when transition is done\n    if ( args.isCleaning ) {\n      _transition.clean[ prop ] = true;\n    }\n  }\n\n  // set from styles\n  if ( args.from ) {\n    this.css( args.from );\n    // force redraw. http://blog.alexmaccaw.com/css-transitions\n    var h = this.element.offsetHeight;\n    // hack for JSHint to hush about unused var\n    h = null;\n  }\n  // enable transition\n  this.enableTransition( args.to );\n  // set styles that are transitioning\n  this.css( args.to );\n\n  this.isTransitioning = true;\n\n};\n\n// dash before all cap letters, including first for\n// WebkitTransform => -webkit-transform\nfunction toDashedAll( str ) {\n  return str.replace( /([A-Z])/g, function( $1 ) {\n    return '-' + $1.toLowerCase();\n  });\n}\n\nvar transitionProps = 'opacity,' + toDashedAll( transformProperty );\n\nproto.enableTransition = function(/* style */) {\n  // HACK changing transitionProperty during a transition\n  // will cause transition to jump\n  if ( this.isTransitioning ) {\n    return;\n  }\n\n  // make `transition: foo, bar, baz` from style object\n  // HACK un-comment this when enableTransition can work\n  // while a transition is happening\n  // var transitionValues = [];\n  // for ( var prop in style ) {\n  //   // dash-ify camelCased properties like WebkitTransition\n  //   prop = vendorProperties[ prop ] || prop;\n  //   transitionValues.push( toDashedAll( prop ) );\n  // }\n  // munge number to millisecond, to match stagger\n  var duration = this.layout.options.transitionDuration;\n  duration = typeof duration == 'number' ? duration + 'ms' : duration;\n  // enable transition styles\n  this.css({\n    transitionProperty: transitionProps,\n    transitionDuration: duration,\n    transitionDelay: this.staggerDelay || 0\n  });\n  // listen for transition end event\n  this.element.addEventListener( transitionEndEvent, this, false );\n};\n\n// ----- events ----- //\n\nproto.onwebkitTransitionEnd = function( event ) {\n  this.ontransitionend( event );\n};\n\nproto.onotransitionend = function( event ) {\n  this.ontransitionend( event );\n};\n\n// properties that I munge to make my life easier\nvar dashedVendorProperties = {\n  '-webkit-transform': 'transform'\n};\n\nproto.ontransitionend = function( event ) {\n  // disregard bubbled events from children\n  if ( event.target !== this.element ) {\n    return;\n  }\n  var _transition = this._transn;\n  // get property name of transitioned property, convert to prefix-free\n  var propertyName = dashedVendorProperties[ event.propertyName ] || event.propertyName;\n\n  // remove property that has completed transitioning\n  delete _transition.ingProperties[ propertyName ];\n  // check if any properties are still transitioning\n  if ( isEmptyObj( _transition.ingProperties ) ) {\n    // all properties have completed transitioning\n    this.disableTransition();\n  }\n  // clean style\n  if ( propertyName in _transition.clean ) {\n    // clean up style\n    this.element.style[ event.propertyName ] = '';\n    delete _transition.clean[ propertyName ];\n  }\n  // trigger onTransitionEnd callback\n  if ( propertyName in _transition.onEnd ) {\n    var onTransitionEnd = _transition.onEnd[ propertyName ];\n    onTransitionEnd.call( this );\n    delete _transition.onEnd[ propertyName ];\n  }\n\n  this.emitEvent( 'transitionEnd', [ this ] );\n};\n\nproto.disableTransition = function() {\n  this.removeTransitionStyles();\n  this.element.removeEventListener( transitionEndEvent, this, false );\n  this.isTransitioning = false;\n};\n\n/**\n * removes style property from element\n * @param {Object} style\n**/\nproto._removeStyles = function( style ) {\n  // clean up transition styles\n  var cleanStyle = {};\n  for ( var prop in style ) {\n    cleanStyle[ prop ] = '';\n  }\n  this.css( cleanStyle );\n};\n\nvar cleanTransitionStyle = {\n  transitionProperty: '',\n  transitionDuration: '',\n  transitionDelay: ''\n};\n\nproto.removeTransitionStyles = function() {\n  // remove transition\n  this.css( cleanTransitionStyle );\n};\n\n// ----- stagger ----- //\n\nproto.stagger = function( delay ) {\n  delay = isNaN( delay ) ? 0 : delay;\n  this.staggerDelay = delay + 'ms';\n};\n\n// ----- show/hide/remove ----- //\n\n// remove element from DOM\nproto.removeElem = function() {\n  this.element.parentNode.removeChild( this.element );\n  // remove display: none\n  this.css({ display: '' });\n  this.emitEvent( 'remove', [ this ] );\n};\n\nproto.remove = function() {\n  // just remove element if no transition support or no transition\n  if ( !transitionProperty || !parseFloat( this.layout.options.transitionDuration ) ) {\n    this.removeElem();\n    return;\n  }\n\n  // start transition\n  this.once( 'transitionEnd', function() {\n    this.removeElem();\n  });\n  this.hide();\n};\n\nproto.reveal = function() {\n  delete this.isHidden;\n  // remove display: none\n  this.css({ display: '' });\n\n  var options = this.layout.options;\n\n  var onTransitionEnd = {};\n  var transitionEndProperty = this.getHideRevealTransitionEndProperty('visibleStyle');\n  onTransitionEnd[ transitionEndProperty ] = this.onRevealTransitionEnd;\n\n  this.transition({\n    from: options.hiddenStyle,\n    to: options.visibleStyle,\n    isCleaning: true,\n    onTransitionEnd: onTransitionEnd\n  });\n};\n\nproto.onRevealTransitionEnd = function() {\n  // check if still visible\n  // during transition, item may have been hidden\n  if ( !this.isHidden ) {\n    this.emitEvent('reveal');\n  }\n};\n\n/**\n * get style property use for hide/reveal transition end\n * @param {String} styleProperty - hiddenStyle/visibleStyle\n * @returns {String}\n */\nproto.getHideRevealTransitionEndProperty = function( styleProperty ) {\n  var optionStyle = this.layout.options[ styleProperty ];\n  // use opacity\n  if ( optionStyle.opacity ) {\n    return 'opacity';\n  }\n  // get first property\n  for ( var prop in optionStyle ) {\n    return prop;\n  }\n};\n\nproto.hide = function() {\n  // set flag\n  this.isHidden = true;\n  // remove display: none\n  this.css({ display: '' });\n\n  var options = this.layout.options;\n\n  var onTransitionEnd = {};\n  var transitionEndProperty = this.getHideRevealTransitionEndProperty('hiddenStyle');\n  onTransitionEnd[ transitionEndProperty ] = this.onHideTransitionEnd;\n\n  this.transition({\n    from: options.visibleStyle,\n    to: options.hiddenStyle,\n    // keep hidden stuff hidden\n    isCleaning: true,\n    onTransitionEnd: onTransitionEnd\n  });\n};\n\nproto.onHideTransitionEnd = function() {\n  // check if still hidden\n  // during transition, item may have been un-hidden\n  if ( this.isHidden ) {\n    this.css({ display: 'none' });\n    this.emitEvent('hide');\n  }\n};\n\nproto.destroy = function() {\n  this.css({\n    position: '',\n    left: '',\n    right: '',\n    top: '',\n    bottom: '',\n    transition: '',\n    transform: ''\n  });\n};\n\nreturn Item;\n\n}));\n\n},{\"ev-emitter\":2,\"get-size\":4}],12:[function(require,module,exports){\n/*!\n * Outlayer v2.1.1\n * the brains and guts of a layout library\n * MIT license\n */\n\n( function( window, factory ) {\n  'use strict';\n  // universal module definition\n  /* jshint strict: false */ /* globals define, module, require */\n  if ( typeof define == 'function' && define.amd ) {\n    // AMD - RequireJS\n    define( [\n        'ev-emitter/ev-emitter',\n        'get-size/get-size',\n        'fizzy-ui-utils/utils',\n        './item'\n      ],\n      function( EvEmitter, getSize, utils, Item ) {\n        return factory( window, EvEmitter, getSize, utils, Item);\n      }\n    );\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS - Browserify, Webpack\n    module.exports = factory(\n      window,\n      require('ev-emitter'),\n      require('get-size'),\n      require('fizzy-ui-utils'),\n      require('./item')\n    );\n  } else {\n    // browser global\n    window.Outlayer = factory(\n      window,\n      window.EvEmitter,\n      window.getSize,\n      window.fizzyUIUtils,\n      window.Outlayer.Item\n    );\n  }\n\n}( window, function factory( window, EvEmitter, getSize, utils, Item ) {\n'use strict';\n\n// ----- vars ----- //\n\nvar console = window.console;\nvar jQuery = window.jQuery;\nvar noop = function() {};\n\n// -------------------------- Outlayer -------------------------- //\n\n// globally unique identifiers\nvar GUID = 0;\n// internal store of all Outlayer intances\nvar instances = {};\n\n\n/**\n * @param {Element, String} element\n * @param {Object} options\n * @constructor\n */\nfunction Outlayer( element, options ) {\n  var queryElement = utils.getQueryElement( element );\n  if ( !queryElement ) {\n    if ( console ) {\n      console.error( 'Bad element for ' + this.constructor.namespace +\n        ': ' + ( queryElement || element ) );\n    }\n    return;\n  }\n  this.element = queryElement;\n  // add jQuery\n  if ( jQuery ) {\n    this.$element = jQuery( this.element );\n  }\n\n  // options\n  this.options = utils.extend( {}, this.constructor.defaults );\n  this.option( options );\n\n  // add id for Outlayer.getFromElement\n  var id = ++GUID;\n  this.element.outlayerGUID = id; // expando\n  instances[ id ] = this; // associate via id\n\n  // kick it off\n  this._create();\n\n  var isInitLayout = this._getOption('initLayout');\n  if ( isInitLayout ) {\n    this.layout();\n  }\n}\n\n// settings are for internal use only\nOutlayer.namespace = 'outlayer';\nOutlayer.Item = Item;\n\n// default options\nOutlayer.defaults = {\n  containerStyle: {\n    position: 'relative'\n  },\n  initLayout: true,\n  originLeft: true,\n  originTop: true,\n  resize: true,\n  resizeContainer: true,\n  // item options\n  transitionDuration: '0.4s',\n  hiddenStyle: {\n    opacity: 0,\n    transform: 'scale(0.001)'\n  },\n  visibleStyle: {\n    opacity: 1,\n    transform: 'scale(1)'\n  }\n};\n\nvar proto = Outlayer.prototype;\n// inherit EvEmitter\nutils.extend( proto, EvEmitter.prototype );\n\n/**\n * set options\n * @param {Object} opts\n */\nproto.option = function( opts ) {\n  utils.extend( this.options, opts );\n};\n\n/**\n * get backwards compatible option value, check old name\n */\nproto._getOption = function( option ) {\n  var oldOption = this.constructor.compatOptions[ option ];\n  return oldOption && this.options[ oldOption ] !== undefined ?\n    this.options[ oldOption ] : this.options[ option ];\n};\n\nOutlayer.compatOptions = {\n  // currentName: oldName\n  initLayout: 'isInitLayout',\n  horizontal: 'isHorizontal',\n  layoutInstant: 'isLayoutInstant',\n  originLeft: 'isOriginLeft',\n  originTop: 'isOriginTop',\n  resize: 'isResizeBound',\n  resizeContainer: 'isResizingContainer'\n};\n\nproto._create = function() {\n  // get items from children\n  this.reloadItems();\n  // elements that affect layout, but are not laid out\n  this.stamps = [];\n  this.stamp( this.options.stamp );\n  // set container style\n  utils.extend( this.element.style, this.options.containerStyle );\n\n  // bind resize method\n  var canBindResize = this._getOption('resize');\n  if ( canBindResize ) {\n    this.bindResize();\n  }\n};\n\n// goes through all children again and gets bricks in proper order\nproto.reloadItems = function() {\n  // collection of item elements\n  this.items = this._itemize( this.element.children );\n};\n\n\n/**\n * turn elements into Outlayer.Items to be used in layout\n * @param {Array or NodeList or HTMLElement} elems\n * @returns {Array} items - collection of new Outlayer Items\n */\nproto._itemize = function( elems ) {\n\n  var itemElems = this._filterFindItemElements( elems );\n  var Item = this.constructor.Item;\n\n  // create new Outlayer Items for collection\n  var items = [];\n  for ( var i=0; i < itemElems.length; i++ ) {\n    var elem = itemElems[i];\n    var item = new Item( elem, this );\n    items.push( item );\n  }\n\n  return items;\n};\n\n/**\n * get item elements to be used in layout\n * @param {Array or NodeList or HTMLElement} elems\n * @returns {Array} items - item elements\n */\nproto._filterFindItemElements = function( elems ) {\n  return utils.filterFindElements( elems, this.options.itemSelector );\n};\n\n/**\n * getter method for getting item elements\n * @returns {Array} elems - collection of item elements\n */\nproto.getItemElements = function() {\n  return this.items.map( function( item ) {\n    return item.element;\n  });\n};\n\n// ----- init & layout ----- //\n\n/**\n * lays out all items\n */\nproto.layout = function() {\n  this._resetLayout();\n  this._manageStamps();\n\n  // don't animate first layout\n  var layoutInstant = this._getOption('layoutInstant');\n  var isInstant = layoutInstant !== undefined ?\n    layoutInstant : !this._isLayoutInited;\n  this.layoutItems( this.items, isInstant );\n\n  // flag for initalized\n  this._isLayoutInited = true;\n};\n\n// _init is alias for layout\nproto._init = proto.layout;\n\n/**\n * logic before any new layout\n */\nproto._resetLayout = function() {\n  this.getSize();\n};\n\n\nproto.getSize = function() {\n  this.size = getSize( this.element );\n};\n\n/**\n * get measurement from option, for columnWidth, rowHeight, gutter\n * if option is String -> get element from selector string, & get size of element\n * if option is Element -> get size of element\n * else use option as a number\n *\n * @param {String} measurement\n * @param {String} size - width or height\n * @private\n */\nproto._getMeasurement = function( measurement, size ) {\n  var option = this.options[ measurement ];\n  var elem;\n  if ( !option ) {\n    // default to 0\n    this[ measurement ] = 0;\n  } else {\n    // use option as an element\n    if ( typeof option == 'string' ) {\n      elem = this.element.querySelector( option );\n    } else if ( option instanceof HTMLElement ) {\n      elem = option;\n    }\n    // use size of element, if element\n    this[ measurement ] = elem ? getSize( elem )[ size ] : option;\n  }\n};\n\n/**\n * layout a collection of item elements\n * @api public\n */\nproto.layoutItems = function( items, isInstant ) {\n  items = this._getItemsForLayout( items );\n\n  this._layoutItems( items, isInstant );\n\n  this._postLayout();\n};\n\n/**\n * get the items to be laid out\n * you may want to skip over some items\n * @param {Array} items\n * @returns {Array} items\n */\nproto._getItemsForLayout = function( items ) {\n  return items.filter( function( item ) {\n    return !item.isIgnored;\n  });\n};\n\n/**\n * layout items\n * @param {Array} items\n * @param {Boolean} isInstant\n */\nproto._layoutItems = function( items, isInstant ) {\n  this._emitCompleteOnItems( 'layout', items );\n\n  if ( !items || !items.length ) {\n    // no items, emit event with empty array\n    return;\n  }\n\n  var queue = [];\n\n  items.forEach( function( item ) {\n    // get x/y object from method\n    var position = this._getItemLayoutPosition( item );\n    // enqueue\n    position.item = item;\n    position.isInstant = isInstant || item.isLayoutInstant;\n    queue.push( position );\n  }, this );\n\n  this._processLayoutQueue( queue );\n};\n\n/**\n * get item layout position\n * @param {Outlayer.Item} item\n * @returns {Object} x and y position\n */\nproto._getItemLayoutPosition = function( /* item */ ) {\n  return {\n    x: 0,\n    y: 0\n  };\n};\n\n/**\n * iterate over array and position each item\n * Reason being - separating this logic prevents 'layout invalidation'\n * thx @paul_irish\n * @param {Array} queue\n */\nproto._processLayoutQueue = function( queue ) {\n  this.updateStagger();\n  queue.forEach( function( obj, i ) {\n    this._positionItem( obj.item, obj.x, obj.y, obj.isInstant, i );\n  }, this );\n};\n\n// set stagger from option in milliseconds number\nproto.updateStagger = function() {\n  var stagger = this.options.stagger;\n  if ( stagger === null || stagger === undefined ) {\n    this.stagger = 0;\n    return;\n  }\n  this.stagger = getMilliseconds( stagger );\n  return this.stagger;\n};\n\n/**\n * Sets position of item in DOM\n * @param {Outlayer.Item} item\n * @param {Number} x - horizontal position\n * @param {Number} y - vertical position\n * @param {Boolean} isInstant - disables transitions\n */\nproto._positionItem = function( item, x, y, isInstant, i ) {\n  if ( isInstant ) {\n    // if not transition, just set CSS\n    item.goTo( x, y );\n  } else {\n    item.stagger( i * this.stagger );\n    item.moveTo( x, y );\n  }\n};\n\n/**\n * Any logic you want to do after each layout,\n * i.e. size the container\n */\nproto._postLayout = function() {\n  this.resizeContainer();\n};\n\nproto.resizeContainer = function() {\n  var isResizingContainer = this._getOption('resizeContainer');\n  if ( !isResizingContainer ) {\n    return;\n  }\n  var size = this._getContainerSize();\n  if ( size ) {\n    this._setContainerMeasure( size.width, true );\n    this._setContainerMeasure( size.height, false );\n  }\n};\n\n/**\n * Sets width or height of container if returned\n * @returns {Object} size\n *   @param {Number} width\n *   @param {Number} height\n */\nproto._getContainerSize = noop;\n\n/**\n * @param {Number} measure - size of width or height\n * @param {Boolean} isWidth\n */\nproto._setContainerMeasure = function( measure, isWidth ) {\n  if ( measure === undefined ) {\n    return;\n  }\n\n  var elemSize = this.size;\n  // add padding and border width if border box\n  if ( elemSize.isBorderBox ) {\n    measure += isWidth ? elemSize.paddingLeft + elemSize.paddingRight +\n      elemSize.borderLeftWidth + elemSize.borderRightWidth :\n      elemSize.paddingBottom + elemSize.paddingTop +\n      elemSize.borderTopWidth + elemSize.borderBottomWidth;\n  }\n\n  measure = Math.max( measure, 0 );\n  this.element.style[ isWidth ? 'width' : 'height' ] = measure + 'px';\n};\n\n/**\n * emit eventComplete on a collection of items events\n * @param {String} eventName\n * @param {Array} items - Outlayer.Items\n */\nproto._emitCompleteOnItems = function( eventName, items ) {\n  var _this = this;\n  function onComplete() {\n    _this.dispatchEvent( eventName + 'Complete', null, [ items ] );\n  }\n\n  var count = items.length;\n  if ( !items || !count ) {\n    onComplete();\n    return;\n  }\n\n  var doneCount = 0;\n  function tick() {\n    doneCount++;\n    if ( doneCount == count ) {\n      onComplete();\n    }\n  }\n\n  // bind callback\n  items.forEach( function( item ) {\n    item.once( eventName, tick );\n  });\n};\n\n/**\n * emits events via EvEmitter 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  // add original event to arguments\n  var emitArgs = event ? [ event ].concat( args ) : args;\n  this.emitEvent( type, emitArgs );\n\n  if ( jQuery ) {\n    // set this.$element\n    this.$element = this.$element || jQuery( this.element );\n    if ( event ) {\n      // create jQuery event\n      var $event = jQuery.Event( event );\n      $event.type = type;\n      this.$element.trigger( $event, args );\n    } else {\n      // just trigger with type if no event available\n      this.$element.trigger( type, args );\n    }\n  }\n};\n\n// -------------------------- ignore & stamps -------------------------- //\n\n\n/**\n * keep item in collection, but do not lay it out\n * ignored items do not get skipped in layout\n * @param {Element} elem\n */\nproto.ignore = function( elem ) {\n  var item = this.getItem( elem );\n  if ( item ) {\n    item.isIgnored = true;\n  }\n};\n\n/**\n * return item to layout collection\n * @param {Element} elem\n */\nproto.unignore = function( elem ) {\n  var item = this.getItem( elem );\n  if ( item ) {\n    delete item.isIgnored;\n  }\n};\n\n/**\n * adds elements to stamps\n * @param {NodeList, Array, Element, or String} elems\n */\nproto.stamp = function( elems ) {\n  elems = this._find( elems );\n  if ( !elems ) {\n    return;\n  }\n\n  this.stamps = this.stamps.concat( elems );\n  // ignore\n  elems.forEach( this.ignore, this );\n};\n\n/**\n * removes elements to stamps\n * @param {NodeList, Array, or Element} elems\n */\nproto.unstamp = function( elems ) {\n  elems = this._find( elems );\n  if ( !elems ){\n    return;\n  }\n\n  elems.forEach( function( elem ) {\n    // filter out removed stamp elements\n    utils.removeFrom( this.stamps, elem );\n    this.unignore( elem );\n  }, this );\n};\n\n/**\n * finds child elements\n * @param {NodeList, Array, Element, or String} elems\n * @returns {Array} elems\n */\nproto._find = function( elems ) {\n  if ( !elems ) {\n    return;\n  }\n  // if string, use argument as selector string\n  if ( typeof elems == 'string' ) {\n    elems = this.element.querySelectorAll( elems );\n  }\n  elems = utils.makeArray( elems );\n  return elems;\n};\n\nproto._manageStamps = function() {\n  if ( !this.stamps || !this.stamps.length ) {\n    return;\n  }\n\n  this._getBoundingRect();\n\n  this.stamps.forEach( this._manageStamp, this );\n};\n\n// update boundingLeft / Top\nproto._getBoundingRect = function() {\n  // get bounding rect for container element\n  var boundingRect = this.element.getBoundingClientRect();\n  var size = this.size;\n  this._boundingRect = {\n    left: boundingRect.left + size.paddingLeft + size.borderLeftWidth,\n    top: boundingRect.top + size.paddingTop + size.borderTopWidth,\n    right: boundingRect.right - ( size.paddingRight + size.borderRightWidth ),\n    bottom: boundingRect.bottom - ( size.paddingBottom + size.borderBottomWidth )\n  };\n};\n\n/**\n * @param {Element} stamp\n**/\nproto._manageStamp = noop;\n\n/**\n * get x/y position of element relative to container element\n * @param {Element} elem\n * @returns {Object} offset - has left, top, right, bottom\n */\nproto._getElementOffset = function( elem ) {\n  var boundingRect = elem.getBoundingClientRect();\n  var thisRect = this._boundingRect;\n  var size = getSize( elem );\n  var offset = {\n    left: boundingRect.left - thisRect.left - size.marginLeft,\n    top: boundingRect.top - thisRect.top - size.marginTop,\n    right: thisRect.right - boundingRect.right - size.marginRight,\n    bottom: thisRect.bottom - boundingRect.bottom - size.marginBottom\n  };\n  return offset;\n};\n\n// -------------------------- resize -------------------------- //\n\n// enable event handlers for listeners\n// i.e. resize -> onresize\nproto.handleEvent = utils.handleEvent;\n\n/**\n * Bind layout to window resizing\n */\nproto.bindResize = function() {\n  window.addEventListener( 'resize', this );\n  this.isResizeBound = true;\n};\n\n/**\n * Unbind layout to window resizing\n */\nproto.unbindResize = function() {\n  window.removeEventListener( 'resize', this );\n  this.isResizeBound = false;\n};\n\nproto.onresize = function() {\n  this.resize();\n};\n\nutils.debounceMethod( Outlayer, 'onresize', 100 );\n\nproto.resize = function() {\n  // don't trigger if size did not change\n  // or if resize was unbound. See #9\n  if ( !this.isResizeBound || !this.needsResizeLayout() ) {\n    return;\n  }\n\n  this.layout();\n};\n\n/**\n * check if layout is needed post layout\n * @returns Boolean\n */\nproto.needsResizeLayout = function() {\n  var size = getSize( this.element );\n  // check that this.size and size are there\n  // IE8 triggers resize on body size change, so they might not be\n  var hasSizes = this.size && size;\n  return hasSizes && size.innerWidth !== this.size.innerWidth;\n};\n\n// -------------------------- methods -------------------------- //\n\n/**\n * add items to Outlayer instance\n * @param {Array or NodeList or Element} elems\n * @returns {Array} items - Outlayer.Items\n**/\nproto.addItems = function( elems ) {\n  var items = this._itemize( elems );\n  // add items to collection\n  if ( items.length ) {\n    this.items = this.items.concat( items );\n  }\n  return items;\n};\n\n/**\n * Layout newly-appended item elements\n * @param {Array or NodeList or Element} elems\n */\nproto.appended = function( elems ) {\n  var items = this.addItems( elems );\n  if ( !items.length ) {\n    return;\n  }\n  // layout and reveal just the new items\n  this.layoutItems( items, true );\n  this.reveal( items );\n};\n\n/**\n * Layout prepended elements\n * @param {Array or NodeList or Element} elems\n */\nproto.prepended = function( elems ) {\n  var items = this._itemize( elems );\n  if ( !items.length ) {\n    return;\n  }\n  // add items to beginning of collection\n  var previousItems = this.items.slice(0);\n  this.items = items.concat( previousItems );\n  // start new layout\n  this._resetLayout();\n  this._manageStamps();\n  // layout new stuff without transition\n  this.layoutItems( items, true );\n  this.reveal( items );\n  // layout previous items\n  this.layoutItems( previousItems );\n};\n\n/**\n * reveal a collection of items\n * @param {Array of Outlayer.Items} items\n */\nproto.reveal = function( items ) {\n  this._emitCompleteOnItems( 'reveal', items );\n  if ( !items || !items.length ) {\n    return;\n  }\n  var stagger = this.updateStagger();\n  items.forEach( function( item, i ) {\n    item.stagger( i * stagger );\n    item.reveal();\n  });\n};\n\n/**\n * hide a collection of items\n * @param {Array of Outlayer.Items} items\n */\nproto.hide = function( items ) {\n  this._emitCompleteOnItems( 'hide', items );\n  if ( !items || !items.length ) {\n    return;\n  }\n  var stagger = this.updateStagger();\n  items.forEach( function( item, i ) {\n    item.stagger( i * stagger );\n    item.hide();\n  });\n};\n\n/**\n * reveal item elements\n * @param {Array}, {Element}, {NodeList} items\n */\nproto.revealItemElements = function( elems ) {\n  var items = this.getItems( elems );\n  this.reveal( items );\n};\n\n/**\n * hide item elements\n * @param {Array}, {Element}, {NodeList} items\n */\nproto.hideItemElements = function( elems ) {\n  var items = this.getItems( elems );\n  this.hide( items );\n};\n\n/**\n * get Outlayer.Item, given an Element\n * @param {Element} elem\n * @param {Function} callback\n * @returns {Outlayer.Item} item\n */\nproto.getItem = function( elem ) {\n  // loop through items to get the one that matches\n  for ( var i=0; i < this.items.length; i++ ) {\n    var item = this.items[i];\n    if ( item.element == elem ) {\n      // return item\n      return item;\n    }\n  }\n};\n\n/**\n * get collection of Outlayer.Items, given Elements\n * @param {Array} elems\n * @returns {Array} items - Outlayer.Items\n */\nproto.getItems = function( elems ) {\n  elems = utils.makeArray( elems );\n  var items = [];\n  elems.forEach( function( elem ) {\n    var item = this.getItem( elem );\n    if ( item ) {\n      items.push( item );\n    }\n  }, this );\n\n  return items;\n};\n\n/**\n * remove element(s) from instance and DOM\n * @param {Array or NodeList or Element} elems\n */\nproto.remove = function( elems ) {\n  var removeItems = this.getItems( elems );\n\n  this._emitCompleteOnItems( 'remove', removeItems );\n\n  // bail if no items to remove\n  if ( !removeItems || !removeItems.length ) {\n    return;\n  }\n\n  removeItems.forEach( function( item ) {\n    item.remove();\n    // remove item from collection\n    utils.removeFrom( this.items, item );\n  }, this );\n};\n\n// ----- destroy ----- //\n\n// remove and disable Outlayer instance\nproto.destroy = function() {\n  // clean up dynamic styles\n  var style = this.element.style;\n  style.height = '';\n  style.position = '';\n  style.width = '';\n  // destroy items\n  this.items.forEach( function( item ) {\n    item.destroy();\n  });\n\n  this.unbindResize();\n\n  var id = this.element.outlayerGUID;\n  delete instances[ id ]; // remove reference to instance by id\n  delete this.element.outlayerGUID;\n  // remove data for jQuery\n  if ( jQuery ) {\n    jQuery.removeData( this.element, this.constructor.namespace );\n  }\n\n};\n\n// -------------------------- data -------------------------- //\n\n/**\n * get Outlayer instance from element\n * @param {Element} elem\n * @returns {Outlayer}\n */\nOutlayer.data = function( elem ) {\n  elem = utils.getQueryElement( elem );\n  var id = elem && elem.outlayerGUID;\n  return id && instances[ id ];\n};\n\n\n// -------------------------- create Outlayer class -------------------------- //\n\n/**\n * create a layout class\n * @param {String} namespace\n */\nOutlayer.create = function( namespace, options ) {\n  // sub-class Outlayer\n  var Layout = subclass( Outlayer );\n  // apply new options and compatOptions\n  Layout.defaults = utils.extend( {}, Outlayer.defaults );\n  utils.extend( Layout.defaults, options );\n  Layout.compatOptions = utils.extend( {}, Outlayer.compatOptions  );\n\n  Layout.namespace = namespace;\n\n  Layout.data = Outlayer.data;\n\n  // sub-class Item\n  Layout.Item = subclass( Item );\n\n  // -------------------------- declarative -------------------------- //\n\n  utils.htmlInit( Layout, namespace );\n\n  // -------------------------- jQuery bridge -------------------------- //\n\n  // make into jQuery plugin\n  if ( jQuery && jQuery.bridget ) {\n    jQuery.bridget( namespace, Layout );\n  }\n\n  return Layout;\n};\n\nfunction subclass( Parent ) {\n  function SubClass() {\n    Parent.apply( this, arguments );\n  }\n\n  SubClass.prototype = Object.create( Parent.prototype );\n  SubClass.prototype.constructor = SubClass;\n\n  return SubClass;\n}\n\n// ----- helpers ----- //\n\n// how many milliseconds are in each unit\nvar msUnits = {\n  ms: 1,\n  s: 1000\n};\n\n// munge time-like parameter into millisecond number\n// '0.4s' -> 40\nfunction getMilliseconds( time ) {\n  if ( typeof time == 'number' ) {\n    return time;\n  }\n  var matches = time.match( /(^\\d*\\.?\\d*)(\\w*)/ );\n  var num = matches && matches[1];\n  var unit = matches && matches[2];\n  if ( !num.length ) {\n    return 0;\n  }\n  num = parseFloat( num );\n  var mult = msUnits[ unit ] || 1;\n  return num * mult;\n}\n\n// ----- fin ----- //\n\n// back in global\nOutlayer.Item = Item;\n\nreturn Outlayer;\n\n}));\n\n},{\"./item\":11,\"ev-emitter\":2,\"fizzy-ui-utils\":3,\"get-size\":4}],\"isotope-layout\":[function(require,module,exports){\n/*!\n * Isotope v3.0.6\n *\n * Licensed GPLv3 for open source use\n * or Isotope Commercial License for commercial use\n *\n * https://isotope.metafizzy.co\n * Copyright 2010-2018 Metafizzy\n */\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        'outlayer/outlayer',\n        'get-size/get-size',\n        'desandro-matches-selector/matches-selector',\n        'fizzy-ui-utils/utils',\n        './item',\n        './layout-mode',\n        // include default layout modes\n        './layout-modes/masonry',\n        './layout-modes/fit-rows',\n        './layout-modes/vertical'\n      ],\n      function( Outlayer, getSize, matchesSelector, utils, Item, LayoutMode ) {\n        return factory( window, Outlayer, getSize, matchesSelector, utils, Item, LayoutMode );\n      });\n  } else if ( typeof module == 'object' && module.exports ) {\n    // CommonJS\n    module.exports = factory(\n      window,\n      require('outlayer'),\n      require('get-size'),\n      require('desandro-matches-selector'),\n      require('fizzy-ui-utils'),\n      require('./item'),\n      require('./layout-mode'),\n      // include default layout modes\n      require('./layout-modes/masonry'),\n      require('./layout-modes/fit-rows'),\n      require('./layout-modes/vertical')\n    );\n  } else {\n    // browser global\n    window.Isotope = factory(\n      window,\n      window.Outlayer,\n      window.getSize,\n      window.matchesSelector,\n      window.fizzyUIUtils,\n      window.Isotope.Item,\n      window.Isotope.LayoutMode\n    );\n  }\n\n}( window, function factory( window, Outlayer, getSize, matchesSelector, utils,\n  Item, LayoutMode ) {\n\n'use strict';\n\n// -------------------------- vars -------------------------- //\n\nvar jQuery = window.jQuery;\n\n// -------------------------- helpers -------------------------- //\n\nvar trim = String.prototype.trim ?\n  function( str ) {\n    return str.trim();\n  } :\n  function( str ) {\n    return str.replace( /^\\s+|\\s+$/g, '' );\n  };\n\n// -------------------------- isotopeDefinition -------------------------- //\n\n  // create an Outlayer layout class\n  var Isotope = Outlayer.create( 'isotope', {\n    layoutMode: 'masonry',\n    isJQueryFiltering: true,\n    sortAscending: true\n  });\n\n  Isotope.Item = Item;\n  Isotope.LayoutMode = LayoutMode;\n\n  var proto = Isotope.prototype;\n\n  proto._create = function() {\n    this.itemGUID = 0;\n    // functions that sort items\n    this._sorters = {};\n    this._getSorters();\n    // call super\n    Outlayer.prototype._create.call( this );\n\n    // create layout modes\n    this.modes = {};\n    // start filteredItems with all items\n    this.filteredItems = this.items;\n    // keep of track of sortBys\n    this.sortHistory = [ 'original-order' ];\n    // create from registered layout modes\n    for ( var name in LayoutMode.modes ) {\n      this._initLayoutMode( name );\n    }\n  };\n\n  proto.reloadItems = function() {\n    // reset item ID counter\n    this.itemGUID = 0;\n    // call super\n    Outlayer.prototype.reloadItems.call( this );\n  };\n\n  proto._itemize = function() {\n    var items = Outlayer.prototype._itemize.apply( this, arguments );\n    // assign ID for original-order\n    for ( var i=0; i < items.length; i++ ) {\n      var item = items[i];\n      item.id = this.itemGUID++;\n    }\n    this._updateItemsSortData( items );\n    return items;\n  };\n\n\n  // -------------------------- layout -------------------------- //\n\n  proto._initLayoutMode = function( name ) {\n    var Mode = LayoutMode.modes[ name ];\n    // set mode options\n    // HACK extend initial options, back-fill in default options\n    var initialOpts = this.options[ name ] || {};\n    this.options[ name ] = Mode.options ?\n      utils.extend( Mode.options, initialOpts ) : initialOpts;\n    // init layout mode instance\n    this.modes[ name ] = new Mode( this );\n  };\n\n\n  proto.layout = function() {\n    // if first time doing layout, do all magic\n    if ( !this._isLayoutInited && this._getOption('initLayout') ) {\n      this.arrange();\n      return;\n    }\n    this._layout();\n  };\n\n  // private method to be used in layout() & magic()\n  proto._layout = function() {\n    // don't animate first layout\n    var isInstant = this._getIsInstant();\n    // layout flow\n    this._resetLayout();\n    this._manageStamps();\n    this.layoutItems( this.filteredItems, isInstant );\n\n    // flag for initalized\n    this._isLayoutInited = true;\n  };\n\n  // filter + sort + layout\n  proto.arrange = function( opts ) {\n    // set any options pass\n    this.option( opts );\n    this._getIsInstant();\n    // filter, sort, and layout\n\n    // filter\n    var filtered = this._filter( this.items );\n    this.filteredItems = filtered.matches;\n\n    this._bindArrangeComplete();\n\n    if ( this._isInstant ) {\n      this._noTransition( this._hideReveal, [ filtered ] );\n    } else {\n      this._hideReveal( filtered );\n    }\n\n    this._sort();\n    this._layout();\n  };\n  // alias to _init for main plugin method\n  proto._init = proto.arrange;\n\n  proto._hideReveal = function( filtered ) {\n    this.reveal( filtered.needReveal );\n    this.hide( filtered.needHide );\n  };\n\n  // HACK\n  // Don't animate/transition first layout\n  // Or don't animate/transition other layouts\n  proto._getIsInstant = function() {\n    var isLayoutInstant = this._getOption('layoutInstant');\n    var isInstant = isLayoutInstant !== undefined ? isLayoutInstant :\n      !this._isLayoutInited;\n    this._isInstant = isInstant;\n    return isInstant;\n  };\n\n  // listen for layoutComplete, hideComplete and revealComplete\n  // to trigger arrangeComplete\n  proto._bindArrangeComplete = function() {\n    // listen for 3 events to trigger arrangeComplete\n    var isLayoutComplete, isHideComplete, isRevealComplete;\n    var _this = this;\n    function arrangeParallelCallback() {\n      if ( isLayoutComplete && isHideComplete && isRevealComplete ) {\n        _this.dispatchEvent( 'arrangeComplete', null, [ _this.filteredItems ] );\n      }\n    }\n    this.once( 'layoutComplete', function() {\n      isLayoutComplete = true;\n      arrangeParallelCallback();\n    });\n    this.once( 'hideComplete', function() {\n      isHideComplete = true;\n      arrangeParallelCallback();\n    });\n    this.once( 'revealComplete', function() {\n      isRevealComplete = true;\n      arrangeParallelCallback();\n    });\n  };\n\n  // -------------------------- filter -------------------------- //\n\n  proto._filter = function( items ) {\n    var filter = this.options.filter;\n    filter = filter || '*';\n    var matches = [];\n    var hiddenMatched = [];\n    var visibleUnmatched = [];\n\n    var test = this._getFilterTest( filter );\n\n    // test each item\n    for ( var i=0; i < items.length; i++ ) {\n      var item = items[i];\n      if ( item.isIgnored ) {\n        continue;\n      }\n      // add item to either matched or unmatched group\n      var isMatched = test( item );\n      // item.isFilterMatched = isMatched;\n      // add to matches if its a match\n      if ( isMatched ) {\n        matches.push( item );\n      }\n      // add to additional group if item needs to be hidden or revealed\n      if ( isMatched && item.isHidden ) {\n        hiddenMatched.push( item );\n      } else if ( !isMatched && !item.isHidden ) {\n        visibleUnmatched.push( item );\n      }\n    }\n\n    // return collections of items to be manipulated\n    return {\n      matches: matches,\n      needReveal: hiddenMatched,\n      needHide: visibleUnmatched\n    };\n  };\n\n  // get a jQuery, function, or a matchesSelector test given the filter\n  proto._getFilterTest = function( filter ) {\n    if ( jQuery && this.options.isJQueryFiltering ) {\n      // use jQuery\n      return function( item ) {\n        return jQuery( item.element ).is( filter );\n      };\n    }\n    if ( typeof filter == 'function' ) {\n      // use filter as function\n      return function( item ) {\n        return filter( item.element );\n      };\n    }\n    // default, use filter as selector string\n    return function( item ) {\n      return matchesSelector( item.element, filter );\n    };\n  };\n\n  // -------------------------- sorting -------------------------- //\n\n  /**\n   * @params {Array} elems\n   * @public\n   */\n  proto.updateSortData = function( elems ) {\n    // get items\n    var items;\n    if ( elems ) {\n      elems = utils.makeArray( elems );\n      items = this.getItems( elems );\n    } else {\n      // update all items if no elems provided\n      items = this.items;\n    }\n\n    this._getSorters();\n    this._updateItemsSortData( items );\n  };\n\n  proto._getSorters = function() {\n    var getSortData = this.options.getSortData;\n    for ( var key in getSortData ) {\n      var sorter = getSortData[ key ];\n      this._sorters[ key ] = mungeSorter( sorter );\n    }\n  };\n\n  /**\n   * @params {Array} items - of Isotope.Items\n   * @private\n   */\n  proto._updateItemsSortData = function( items ) {\n    // do not update if no items\n    var len = items && items.length;\n\n    for ( var i=0; len && i < len; i++ ) {\n      var item = items[i];\n      item.updateSortData();\n    }\n  };\n\n  // ----- munge sorter ----- //\n\n  // encapsulate this, as we just need mungeSorter\n  // other functions in here are just for munging\n  var mungeSorter = ( function() {\n    // add a magic layer to sorters for convienent shorthands\n    // `.foo-bar` will use the text of .foo-bar querySelector\n    // `[foo-bar]` will use attribute\n    // you can also add parser\n    // `.foo-bar parseInt` will parse that as a number\n    function mungeSorter( sorter ) {\n      // if not a string, return function or whatever it is\n      if ( typeof sorter != 'string' ) {\n        return sorter;\n      }\n      // parse the sorter string\n      var args = trim( sorter ).split(' ');\n      var query = args[0];\n      // check if query looks like [an-attribute]\n      var attrMatch = query.match( /^\\[(.+)\\]$/ );\n      var attr = attrMatch && attrMatch[1];\n      var getValue = getValueGetter( attr, query );\n      // use second argument as a parser\n      var parser = Isotope.sortDataParsers[ args[1] ];\n      // parse the value, if there was a parser\n      sorter = parser ? function( elem ) {\n        return elem && parser( getValue( elem ) );\n      } :\n      // otherwise just return value\n      function( elem ) {\n        return elem && getValue( elem );\n      };\n\n      return sorter;\n    }\n\n    // get an attribute getter, or get text of the querySelector\n    function getValueGetter( attr, query ) {\n      // if query looks like [foo-bar], get attribute\n      if ( attr ) {\n        return function getAttribute( elem ) {\n          return elem.getAttribute( attr );\n        };\n      }\n\n      // otherwise, assume its a querySelector, and get its text\n      return function getChildText( elem ) {\n        var child = elem.querySelector( query );\n        return child && child.textContent;\n      };\n    }\n\n    return mungeSorter;\n  })();\n\n  // parsers used in getSortData shortcut strings\n  Isotope.sortDataParsers = {\n    'parseInt': function( val ) {\n      return parseInt( val, 10 );\n    },\n    'parseFloat': function( val ) {\n      return parseFloat( val );\n    }\n  };\n\n  // ----- sort method ----- //\n\n  // sort filteredItem order\n  proto._sort = function() {\n    if ( !this.options.sortBy ) {\n      return;\n    }\n    // keep track of sortBy History\n    var sortBys = utils.makeArray( this.options.sortBy );\n    if ( !this._getIsSameSortBy( sortBys ) ) {\n      // concat all sortBy and sortHistory, add to front, oldest goes in last\n      this.sortHistory = sortBys.concat( this.sortHistory );\n    }\n    // sort magic\n    var itemSorter = getItemSorter( this.sortHistory, this.options.sortAscending );\n    this.filteredItems.sort( itemSorter );\n  };\n\n  // check if sortBys is same as start of sortHistory\n  proto._getIsSameSortBy = function( sortBys ) {\n    for ( var i=0; i < sortBys.length; i++ ) {\n      if ( sortBys[i] != this.sortHistory[i] ) {\n        return false;\n      }\n    }\n    return true;\n  };\n\n  // returns a function used for sorting\n  function getItemSorter( sortBys, sortAsc ) {\n    return function sorter( itemA, itemB ) {\n      // cycle through all sortKeys\n      for ( var i = 0; i < sortBys.length; i++ ) {\n        var sortBy = sortBys[i];\n        var a = itemA.sortData[ sortBy ];\n        var b = itemB.sortData[ sortBy ];\n        if ( a > b || a < b ) {\n          // if sortAsc is an object, use the value given the sortBy key\n          var isAscending = sortAsc[ sortBy ] !== undefined ? sortAsc[ sortBy ] : sortAsc;\n          var direction = isAscending ? 1 : -1;\n          return ( a > b ? 1 : -1 ) * direction;\n        }\n      }\n      return 0;\n    };\n  }\n\n  // -------------------------- methods -------------------------- //\n\n  // get layout mode\n  proto._mode = function() {\n    var layoutMode = this.options.layoutMode;\n    var mode = this.modes[ layoutMode ];\n    if ( !mode ) {\n      // TODO console.error\n      throw new Error( 'No layout mode: ' + layoutMode );\n    }\n    // HACK sync mode's options\n    // any options set after init for layout mode need to be synced\n    mode.options = this.options[ layoutMode ];\n    return mode;\n  };\n\n  proto._resetLayout = function() {\n    // trigger original reset layout\n    Outlayer.prototype._resetLayout.call( this );\n    this._mode()._resetLayout();\n  };\n\n  proto._getItemLayoutPosition = function( item  ) {\n    return this._mode()._getItemLayoutPosition( item );\n  };\n\n  proto._manageStamp = function( stamp ) {\n    this._mode()._manageStamp( stamp );\n  };\n\n  proto._getContainerSize = function() {\n    return this._mode()._getContainerSize();\n  };\n\n  proto.needsResizeLayout = function() {\n    return this._mode().needsResizeLayout();\n  };\n\n  // -------------------------- adding & removing -------------------------- //\n\n  // HEADS UP overwrites default Outlayer appended\n  proto.appended = function( elems ) {\n    var items = this.addItems( elems );\n    if ( !items.length ) {\n      return;\n    }\n    // filter, layout, reveal new items\n    var filteredItems = this._filterRevealAdded( items );\n    // add to filteredItems\n    this.filteredItems = this.filteredItems.concat( filteredItems );\n  };\n\n  // HEADS UP overwrites default Outlayer prepended\n  proto.prepended = function( elems ) {\n    var items = this._itemize( elems );\n    if ( !items.length ) {\n      return;\n    }\n    // start new layout\n    this._resetLayout();\n    this._manageStamps();\n    // filter, layout, reveal new items\n    var filteredItems = this._filterRevealAdded( items );\n    // layout previous items\n    this.layoutItems( this.filteredItems );\n    // add to items and filteredItems\n    this.filteredItems = filteredItems.concat( this.filteredItems );\n    this.items = items.concat( this.items );\n  };\n\n  proto._filterRevealAdded = function( items ) {\n    var filtered = this._filter( items );\n    this.hide( filtered.needHide );\n    // reveal all new items\n    this.reveal( filtered.matches );\n    // layout new items, no transition\n    this.layoutItems( filtered.matches, true );\n    return filtered.matches;\n  };\n\n  /**\n   * Filter, sort, and layout newly-appended item elements\n   * @param {Array or NodeList or Element} elems\n   */\n  proto.insert = function( elems ) {\n    var items = this.addItems( elems );\n    if ( !items.length ) {\n      return;\n    }\n    // append item elements\n    var i, item;\n    var len = items.length;\n    for ( i=0; i < len; i++ ) {\n      item = items[i];\n      this.element.appendChild( item.element );\n    }\n    // filter new stuff\n    var filteredInsertItems = this._filter( items ).matches;\n    // set flag\n    for ( i=0; i < len; i++ ) {\n      items[i].isLayoutInstant = true;\n    }\n    this.arrange();\n    // reset flag\n    for ( i=0; i < len; i++ ) {\n      delete items[i].isLayoutInstant;\n    }\n    this.reveal( filteredInsertItems );\n  };\n\n  var _remove = proto.remove;\n  proto.remove = function( elems ) {\n    elems = utils.makeArray( elems );\n    var removeItems = this.getItems( elems );\n    // do regular thing\n    _remove.call( this, elems );\n    // bail if no items to remove\n    var len = removeItems && removeItems.length;\n    // remove elems from filteredItems\n    for ( var i=0; len && i < len; i++ ) {\n      var item = removeItems[i];\n      // remove item from collection\n      utils.removeFrom( this.filteredItems, item );\n    }\n  };\n\n  proto.shuffle = function() {\n    // update random sortData\n    for ( var i=0; i < this.items.length; i++ ) {\n      var item = this.items[i];\n      item.sortData.random = Math.random();\n    }\n    this.options.sortBy = 'random';\n    this._sort();\n    this._layout();\n  };\n\n  /**\n   * trigger fn without transition\n   * kind of hacky to have this in the first place\n   * @param {Function} fn\n   * @param {Array} args\n   * @returns ret\n   * @private\n   */\n  proto._noTransition = function( fn, args ) {\n    // save transitionDuration before disabling\n    var transitionDuration = this.options.transitionDuration;\n    // disable transition\n    this.options.transitionDuration = 0;\n    // do it\n    var returnValue = fn.apply( this, args );\n    // re-enable transition for reveal\n    this.options.transitionDuration = transitionDuration;\n    return returnValue;\n  };\n\n  // ----- helper methods ----- //\n\n  /**\n   * getter method for getting filtered item elements\n   * @returns {Array} elems - collection of item elements\n   */\n  proto.getFilteredItemElements = function() {\n    return this.filteredItems.map( function( item ) {\n      return item.element;\n    });\n  };\n\n  // -----  ----- //\n\n  return Isotope;\n\n}));\n\n},{\"./item\":5,\"./layout-mode\":6,\"./layout-modes/fit-rows\":7,\"./layout-modes/masonry\":8,\"./layout-modes/vertical\":9,\"desandro-matches-selector\":1,\"fizzy-ui-utils\":3,\"get-size\":4,\"outlayer\":12}],\"lodash\":[function(require,module,exports){\n(function (global){(function (){\n/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\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    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\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 '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\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('<body>');\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, &amp; 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('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n      // and escape the comment, thus injecting code that gets evaled.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/\\s/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Throw an error if a forbidden character was found in `variable`, to prevent\n      // potential command injection attacks.\n      else if (reForbiddenIdentifierChars.test(variable)) {\n        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n      }\n\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\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     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\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 upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return baseTrim(string);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.slice(0, trimmedEndIndex(string) + 1);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper 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 upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper 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     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\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     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|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     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     *\n     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n\n}).call(this)}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{}],\"velocity-animate\":[function(require,module,exports){\n/*! VelocityJS.org (1.5.2). (C) 2014 Julian Shapiro. MIT @license: en.wikipedia.org/wiki/MIT_License */\r\n\r\n/*************************\r\n Velocity jQuery Shim\r\n *************************/\r\n\r\n/*! VelocityJS.org jQuery Shim (1.0.1). (C) 2014 The jQuery Foundation. MIT @license: en.wikipedia.org/wiki/MIT_License. */\r\n\r\n/* This file contains the jQuery functions that Velocity relies on, thereby removing Velocity's dependency on a full copy of jQuery, and allowing it to work in any environment. */\r\n/* These shimmed functions are only used if jQuery isn't present. If both this shim and jQuery are loaded, Velocity defaults to jQuery proper. */\r\n/* Browser support: Using this shim instead of jQuery proper removes support for IE8. */\r\n\r\n(function(window) {\r\n\t\"use strict\";\r\n\t/***************\r\n\t Setup\r\n\t ***************/\r\n\r\n\t/* If jQuery is already loaded, there's no point in loading this shim. */\r\n\tif (window.jQuery) {\r\n\t\treturn;\r\n\t}\r\n\r\n\t/* jQuery base. */\r\n\tvar $ = function(selector, context) {\r\n\t\treturn new $.fn.init(selector, context);\r\n\t};\r\n\r\n\t/********************\r\n\t Private Methods\r\n\t ********************/\r\n\r\n\t/* jQuery */\r\n\t$.isWindow = function(obj) {\r\n\t\t/* jshint eqeqeq: false */\r\n\t\treturn obj && obj === obj.window;\r\n\t};\r\n\r\n\t/* jQuery */\r\n\t$.type = function(obj) {\r\n\t\tif (!obj) {\r\n\t\t\treturn obj + \"\";\r\n\t\t}\r\n\r\n\t\treturn typeof obj === \"object\" || typeof obj === \"function\" ?\r\n\t\t\t\tclass2type[toString.call(obj)] || \"object\" :\r\n\t\t\t\ttypeof obj;\r\n\t};\r\n\r\n\t/* jQuery */\r\n\t$.isArray = Array.isArray || function(obj) {\r\n\t\treturn $.type(obj) === \"array\";\r\n\t};\r\n\r\n\t/* jQuery */\r\n\tfunction isArraylike(obj) {\r\n\t\tvar length = obj.length,\r\n\t\t\t\ttype = $.type(obj);\r\n\r\n\t\tif (type === \"function\" || $.isWindow(obj)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tif (obj.nodeType === 1 && length) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\treturn type === \"array\" || length === 0 || typeof length === \"number\" && length > 0 && (length - 1) in obj;\r\n\t}\r\n\r\n\t/***************\r\n\t $ Methods\r\n\t ***************/\r\n\r\n\t/* jQuery: Support removed for IE<9. */\r\n\t$.isPlainObject = function(obj) {\r\n\t\tvar key;\r\n\r\n\t\tif (!obj || $.type(obj) !== \"object\" || obj.nodeType || $.isWindow(obj)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\ttry {\r\n\t\t\tif (obj.constructor &&\r\n\t\t\t\t\t!hasOwn.call(obj, \"constructor\") &&\r\n\t\t\t\t\t!hasOwn.call(obj.constructor.prototype, \"isPrototypeOf\")) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t} catch (e) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tfor (key in obj) {\r\n\t\t}\r\n\r\n\t\treturn key === undefined || hasOwn.call(obj, key);\r\n\t};\r\n\r\n\t/* jQuery */\r\n\t$.each = function(obj, callback, args) {\r\n\t\tvar value,\r\n\t\t\t\ti = 0,\r\n\t\t\t\tlength = obj.length,\r\n\t\t\t\tisArray = isArraylike(obj);\r\n\r\n\t\tif (args) {\r\n\t\t\tif (isArray) {\r\n\t\t\t\tfor (; i < length; i++) {\r\n\t\t\t\t\tvalue = callback.apply(obj[i], args);\r\n\r\n\t\t\t\t\tif (value === false) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tfor (i in obj) {\r\n\t\t\t\t\tif (!obj.hasOwnProperty(i)) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvalue = callback.apply(obj[i], args);\r\n\r\n\t\t\t\t\tif (value === false) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t} else {\r\n\t\t\tif (isArray) {\r\n\t\t\t\tfor (; i < length; i++) {\r\n\t\t\t\t\tvalue = callback.call(obj[i], i, obj[i]);\r\n\r\n\t\t\t\t\tif (value === false) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tfor (i in obj) {\r\n\t\t\t\t\tif (!obj.hasOwnProperty(i)) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tvalue = callback.call(obj[i], i, obj[i]);\r\n\r\n\t\t\t\t\tif (value === false) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn obj;\r\n\t};\r\n\r\n\t/* Custom */\r\n\t$.data = function(node, key, value) {\r\n\t\t/* $.getData() */\r\n\t\tif (value === undefined) {\r\n\t\t\tvar getId = node[$.expando],\r\n\t\t\t\t\tstore = getId && cache[getId];\r\n\r\n\t\t\tif (key === undefined) {\r\n\t\t\t\treturn store;\r\n\t\t\t} else if (store) {\r\n\t\t\t\tif (key in store) {\r\n\t\t\t\t\treturn store[key];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t/* $.setData() */\r\n\t\t} else if (key !== undefined) {\r\n\t\t\tvar setId = node[$.expando] || (node[$.expando] = ++$.uuid);\r\n\r\n\t\t\tcache[setId] = cache[setId] || {};\r\n\t\t\tcache[setId][key] = value;\r\n\r\n\t\t\treturn value;\r\n\t\t}\r\n\t};\r\n\r\n\t/* Custom */\r\n\t$.removeData = function(node, keys) {\r\n\t\tvar id = node[$.expando],\r\n\t\t\t\tstore = id && cache[id];\r\n\r\n\t\tif (store) {\r\n\t\t\t// Cleanup the entire store if no keys are provided.\r\n\t\t\tif (!keys) {\r\n\t\t\t\tdelete cache[id];\r\n\t\t\t} else {\r\n\t\t\t\t$.each(keys, function(_, key) {\r\n\t\t\t\t\tdelete store[key];\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t}\r\n\t};\r\n\r\n\t/* jQuery */\r\n\t$.extend = function() {\r\n\t\tvar src, copyIsArray, copy, name, options, clone,\r\n\t\t\t\ttarget = arguments[0] || {},\r\n\t\t\t\ti = 1,\r\n\t\t\t\tlength = arguments.length,\r\n\t\t\t\tdeep = false;\r\n\r\n\t\tif (typeof target === \"boolean\") {\r\n\t\t\tdeep = target;\r\n\r\n\t\t\ttarget = arguments[i] || {};\r\n\t\t\ti++;\r\n\t\t}\r\n\r\n\t\tif (typeof target !== \"object\" && $.type(target) !== \"function\") {\r\n\t\t\ttarget = {};\r\n\t\t}\r\n\r\n\t\tif (i === length) {\r\n\t\t\ttarget = this;\r\n\t\t\ti--;\r\n\t\t}\r\n\r\n\t\tfor (; i < length; i++) {\r\n\t\t\tif ((options = arguments[i])) {\r\n\t\t\t\tfor (name in options) {\r\n\t\t\t\t\tif (!options.hasOwnProperty(name)) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tsrc = target[name];\r\n\t\t\t\t\tcopy = options[name];\r\n\r\n\t\t\t\t\tif (target === copy) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (deep && copy && ($.isPlainObject(copy) || (copyIsArray = $.isArray(copy)))) {\r\n\t\t\t\t\t\tif (copyIsArray) {\r\n\t\t\t\t\t\t\tcopyIsArray = false;\r\n\t\t\t\t\t\t\tclone = src && $.isArray(src) ? src : [];\r\n\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tclone = src && $.isPlainObject(src) ? src : {};\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\ttarget[name] = $.extend(deep, clone, copy);\r\n\r\n\t\t\t\t\t} else if (copy !== undefined) {\r\n\t\t\t\t\t\ttarget[name] = copy;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn target;\r\n\t};\r\n\r\n\t/* jQuery 1.4.3 */\r\n\t$.queue = function(elem, type, data) {\r\n\t\tfunction $makeArray(arr, results) {\r\n\t\t\tvar ret = results || [];\r\n\r\n\t\t\tif (arr) {\r\n\t\t\t\tif (isArraylike(Object(arr))) {\r\n\t\t\t\t\t/* $.merge */\r\n\t\t\t\t\t(function(first, second) {\r\n\t\t\t\t\t\tvar len = +second.length,\r\n\t\t\t\t\t\t\t\tj = 0,\r\n\t\t\t\t\t\t\t\ti = first.length;\r\n\r\n\t\t\t\t\t\twhile (j < len) {\r\n\t\t\t\t\t\t\tfirst[i++] = second[j++];\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (len !== len) {\r\n\t\t\t\t\t\t\twhile (second[j] !== undefined) {\r\n\t\t\t\t\t\t\t\tfirst[i++] = second[j++];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tfirst.length = i;\r\n\r\n\t\t\t\t\t\treturn first;\r\n\t\t\t\t\t})(ret, typeof arr === \"string\" ? [arr] : arr);\r\n\t\t\t\t} else {\r\n\t\t\t\t\t[].push.call(ret, arr);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn ret;\r\n\t\t}\r\n\r\n\t\tif (!elem) {\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\ttype = (type || \"fx\") + \"queue\";\r\n\r\n\t\tvar q = $.data(elem, type);\r\n\r\n\t\tif (!data) {\r\n\t\t\treturn q || [];\r\n\t\t}\r\n\r\n\t\tif (!q || $.isArray(data)) {\r\n\t\t\tq = $.data(elem, type, $makeArray(data));\r\n\t\t} else {\r\n\t\t\tq.push(data);\r\n\t\t}\r\n\r\n\t\treturn q;\r\n\t};\r\n\r\n\t/* jQuery 1.4.3 */\r\n\t$.dequeue = function(elems, type) {\r\n\t\t/* Custom: Embed element iteration. */\r\n\t\t$.each(elems.nodeType ? [elems] : elems, function(i, elem) {\r\n\t\t\ttype = type || \"fx\";\r\n\r\n\t\t\tvar queue = $.queue(elem, type),\r\n\t\t\t\t\tfn = queue.shift();\r\n\r\n\t\t\tif (fn === \"inprogress\") {\r\n\t\t\t\tfn = queue.shift();\r\n\t\t\t}\r\n\r\n\t\t\tif (fn) {\r\n\t\t\t\tif (type === \"fx\") {\r\n\t\t\t\t\tqueue.unshift(\"inprogress\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tfn.call(elem, function() {\r\n\t\t\t\t\t$.dequeue(elem, type);\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t};\r\n\r\n\t/******************\r\n\t $.fn Methods\r\n\t ******************/\r\n\r\n\t/* jQuery */\r\n\t$.fn = $.prototype = {\r\n\t\tinit: function(selector) {\r\n\t\t\t/* Just return the element wrapped inside an array; don't proceed with the actual jQuery node wrapping process. */\r\n\t\t\tif (selector.nodeType) {\r\n\t\t\t\tthis[0] = selector;\r\n\r\n\t\t\t\treturn this;\r\n\t\t\t} else {\r\n\t\t\t\tthrow new Error(\"Not a DOM node.\");\r\n\t\t\t}\r\n\t\t},\r\n\t\toffset: function() {\r\n\t\t\t/* jQuery altered code: Dropped disconnected DOM node checking. */\r\n\t\t\tvar box = this[0].getBoundingClientRect ? this[0].getBoundingClientRect() : {top: 0, left: 0};\r\n\r\n\t\t\treturn {\r\n\t\t\t\ttop: box.top + (window.pageYOffset || document.scrollTop || 0) - (document.clientTop || 0),\r\n\t\t\t\tleft: box.left + (window.pageXOffset || document.scrollLeft || 0) - (document.clientLeft || 0)\r\n\t\t\t};\r\n\t\t},\r\n\t\tposition: function() {\r\n\t\t\t/* jQuery */\r\n\t\t\tfunction offsetParentFn(elem) {\r\n\t\t\t\tvar offsetParent = elem.offsetParent;\r\n\r\n\t\t\t\twhile (offsetParent && (offsetParent.nodeName.toLowerCase() !== \"html\" && offsetParent.style && offsetParent.style.position.toLowerCase() === \"static\")) {\r\n\t\t\t\t\toffsetParent = offsetParent.offsetParent;\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn offsetParent || document;\r\n\t\t\t}\r\n\r\n\t\t\t/* Zepto */\r\n\t\t\tvar elem = this[0],\r\n\t\t\t\t\toffsetParent = offsetParentFn(elem),\r\n\t\t\t\t\toffset = this.offset(),\r\n\t\t\t\t\tparentOffset = /^(?:body|html)$/i.test(offsetParent.nodeName) ? {top: 0, left: 0} : $(offsetParent).offset();\r\n\r\n\t\t\toffset.top -= parseFloat(elem.style.marginTop) || 0;\r\n\t\t\toffset.left -= parseFloat(elem.style.marginLeft) || 0;\r\n\r\n\t\t\tif (offsetParent.style) {\r\n\t\t\t\tparentOffset.top += parseFloat(offsetParent.style.borderTopWidth) || 0;\r\n\t\t\t\tparentOffset.left += parseFloat(offsetParent.style.borderLeftWidth) || 0;\r\n\t\t\t}\r\n\r\n\t\t\treturn {\r\n\t\t\t\ttop: offset.top - parentOffset.top,\r\n\t\t\t\tleft: offset.left - parentOffset.left\r\n\t\t\t};\r\n\t\t}\r\n\t};\r\n\r\n\t/**********************\r\n\t Private Variables\r\n\t **********************/\r\n\r\n\t/* For $.data() */\r\n\tvar cache = {};\r\n\t$.expando = \"velocity\" + (new Date().getTime());\r\n\t$.uuid = 0;\r\n\r\n\t/* For $.queue() */\r\n\tvar class2type = {},\r\n\t\t\thasOwn = class2type.hasOwnProperty,\r\n\t\t\ttoString = class2type.toString;\r\n\r\n\tvar types = \"Boolean Number String Function Array Date RegExp Object Error\".split(\" \");\r\n\tfor (var i = 0; i < types.length; i++) {\r\n\t\tclass2type[\"[object \" + types[i] + \"]\"] = types[i].toLowerCase();\r\n\t}\r\n\r\n\t/* Makes $(node) possible, without having to call init. */\r\n\t$.fn.init.prototype = $.fn;\r\n\r\n\t/* Globalize Velocity onto the window, and assign its Utilities property. */\r\n\twindow.Velocity = {Utilities: $};\r\n})(window);\r\n\r\n/******************\r\n Velocity.js\r\n ******************/\r\n\r\n(function(factory) {\r\n\t\"use strict\";\r\n\t/* CommonJS module. */\r\n\tif (typeof module === \"object\" && typeof module.exports === \"object\") {\r\n\t\tmodule.exports = factory();\r\n\t\t/* AMD module. */\r\n\t} else if (typeof define === \"function\" && define.amd) {\r\n\t\tdefine(factory);\r\n\t\t/* Browser globals. */\r\n\t} else {\r\n\t\tfactory();\r\n\t}\r\n}(function() {\r\n\t\"use strict\";\r\n\treturn function(global, window, document, undefined) {\r\n\r\n\t\t/***************\r\n\t\t Summary\r\n\t\t ***************/\r\n\r\n\t\t/*\r\n\t\t - CSS: CSS stack that works independently from the rest of Velocity.\r\n\t\t - animate(): Core animation method that iterates over the targeted elements and queues the incoming call onto each element individually.\r\n\t\t - Pre-Queueing: Prepare the element for animation by instantiating its data cache and processing the call's options.\r\n\t\t - Queueing: The logic that runs once the call has reached its point of execution in the element's $.queue() stack.\r\n\t\t Most logic is placed here to avoid risking it becoming stale (if the element's properties have changed).\r\n\t\t - Pushing: Consolidation of the tween data followed by its push onto the global in-progress calls container.\r\n\t\t - tick(): The single requestAnimationFrame loop responsible for tweening all in-progress calls.\r\n\t\t - completeCall(): Handles the cleanup process for each Velocity call.\r\n\t\t */\r\n\r\n\t\t/*********************\r\n\t\t Helper Functions\r\n\t\t *********************/\r\n\r\n\t\t/* IE detection. Gist: https://gist.github.com/julianshapiro/9098609 */\r\n\t\tvar IE = (function() {\r\n\t\t\tif (document.documentMode) {\r\n\t\t\t\treturn document.documentMode;\r\n\t\t\t} else {\r\n\t\t\t\tfor (var i = 7; i > 4; i--) {\r\n\t\t\t\t\tvar div = document.createElement(\"div\");\r\n\r\n\t\t\t\t\tdiv.innerHTML = \"<!--[if IE \" + i + \"]><span></span><![endif]-->\";\r\n\r\n\t\t\t\t\tif (div.getElementsByTagName(\"span\").length) {\r\n\t\t\t\t\t\tdiv = null;\r\n\r\n\t\t\t\t\t\treturn i;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn undefined;\r\n\t\t})();\r\n\r\n\t\t/* rAF shim. Gist: https://gist.github.com/julianshapiro/9497513 */\r\n\t\tvar rAFShim = (function() {\r\n\t\t\tvar timeLast = 0;\r\n\r\n\t\t\treturn window.webkitRequestAnimationFrame || window.mozRequestAnimationFrame || function(callback) {\r\n\t\t\t\tvar timeCurrent = (new Date()).getTime(),\r\n\t\t\t\t\t\ttimeDelta;\r\n\r\n\t\t\t\t/* Dynamically set delay on a per-tick basis to match 60fps. */\r\n\t\t\t\t/* Technique by Erik Moller. MIT license: https://gist.github.com/paulirish/1579671 */\r\n\t\t\t\ttimeDelta = Math.max(0, 16 - (timeCurrent - timeLast));\r\n\t\t\t\ttimeLast = timeCurrent + timeDelta;\r\n\r\n\t\t\t\treturn setTimeout(function() {\r\n\t\t\t\t\tcallback(timeCurrent + timeDelta);\r\n\t\t\t\t}, timeDelta);\r\n\t\t\t};\r\n\t\t})();\r\n\r\n\t\tvar performance = (function() {\r\n\t\t\tvar perf = window.performance || {};\r\n\r\n\t\t\tif (typeof perf.now !== \"function\") {\r\n\t\t\t\tvar nowOffset = perf.timing && perf.timing.navigationStart ? perf.timing.navigationStart : (new Date()).getTime();\r\n\r\n\t\t\t\tperf.now = function() {\r\n\t\t\t\t\treturn (new Date()).getTime() - nowOffset;\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t\treturn perf;\r\n\t\t})();\r\n\r\n\t\t/* Array compacting. Copyright Lo-Dash. MIT License: https://github.com/lodash/lodash/blob/master/LICENSE.txt */\r\n\t\tfunction compactSparseArray(array) {\r\n\t\t\tvar index = -1,\r\n\t\t\t\t\tlength = array ? array.length : 0,\r\n\t\t\t\t\tresult = [];\r\n\r\n\t\t\twhile (++index < length) {\r\n\t\t\t\tvar value = array[index];\r\n\r\n\t\t\t\tif (value) {\r\n\t\t\t\t\tresult.push(value);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn result;\r\n\t\t}\r\n\r\n\t\t/**\r\n\t\t * Shim for \"fixing\" IE's lack of support (IE < 9) for applying slice\r\n\t\t * on host objects like NamedNodeMap, NodeList, and HTMLCollection\r\n\t\t * (technically, since host objects have been implementation-dependent,\r\n\t\t * at least before ES2015, IE hasn't needed to work this way).\r\n\t\t * Also works on strings, fixes IE < 9 to allow an explicit undefined\r\n\t\t * for the 2nd argument (as in Firefox), and prevents errors when\r\n\t\t * called on other DOM objects.\r\n\t\t */\r\n\t\tvar _slice = (function() {\r\n\t\t\tvar slice = Array.prototype.slice;\r\n\r\n\t\t\ttry {\r\n\t\t\t\t// Can't be used with DOM elements in IE < 9\r\n\t\t\t\tslice.call(document.documentElement);\r\n\t\t\t\treturn slice;\r\n\t\t\t} catch (e) { // Fails in IE < 9\r\n\r\n\t\t\t\t// This will work for genuine arrays, array-like objects, \r\n\t\t\t\t// NamedNodeMap (attributes, entities, notations),\r\n\t\t\t\t// NodeList (e.g., getElementsByTagName), HTMLCollection (e.g., childNodes),\r\n\t\t\t\t// and will not fail on other DOM objects (as do DOM elements in IE < 9)\r\n\t\t\t\treturn function(begin, end) {\r\n\t\t\t\t\tvar len = this.length;\r\n\r\n\t\t\t\t\tif (typeof begin !== \"number\") {\r\n\t\t\t\t\t\tbegin = 0;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// IE < 9 gets unhappy with an undefined end argument\r\n\t\t\t\t\tif (typeof end !== \"number\") {\r\n\t\t\t\t\t\tend = len;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// For native Array objects, we use the native slice function\r\n\t\t\t\t\tif (this.slice) {\r\n\t\t\t\t\t\treturn slice.call(this, begin, end);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// For array like object we handle it ourselves.\r\n\t\t\t\t\tvar i,\r\n\t\t\t\t\t\t\tcloned = [],\r\n\t\t\t\t\t\t\t// Handle negative value for \"begin\"\r\n\t\t\t\t\t\t\tstart = (begin >= 0) ? begin : Math.max(0, len + begin),\r\n\t\t\t\t\t\t\t// Handle negative value for \"end\"\r\n\t\t\t\t\t\t\tupTo = end < 0 ? len + end : Math.min(end, len),\r\n\t\t\t\t\t\t\t// Actual expected size of the slice\r\n\t\t\t\t\t\t\tsize = upTo - start;\r\n\r\n\t\t\t\t\tif (size > 0) {\r\n\t\t\t\t\t\tcloned = new Array(size);\r\n\t\t\t\t\t\tif (this.charAt) {\r\n\t\t\t\t\t\t\tfor (i = 0; i < size; i++) {\r\n\t\t\t\t\t\t\t\tcloned[i] = this.charAt(start + i);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tfor (i = 0; i < size; i++) {\r\n\t\t\t\t\t\t\t\tcloned[i] = this[start + i];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn cloned;\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t})();\r\n\r\n\t\t/* .indexOf doesn't exist in IE<9 */\r\n\t\tvar _inArray = (function() {\r\n\t\t\tif (Array.prototype.includes) {\r\n\t\t\t\treturn function(arr, val) {\r\n\t\t\t\t\treturn arr.includes(val);\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t\tif (Array.prototype.indexOf) {\r\n\t\t\t\treturn function(arr, val) {\r\n\t\t\t\t\treturn arr.indexOf(val) >= 0;\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t\treturn function(arr, val) {\r\n\t\t\t\tfor (var i = 0; i < arr.length; i++) {\r\n\t\t\t\t\tif (arr[i] === val) {\r\n\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\treturn false;\r\n\t\t\t};\r\n\t\t});\r\n\r\n\t\tfunction sanitizeElements(elements) {\r\n\t\t\t/* Unwrap jQuery/Zepto objects. */\r\n\t\t\tif (Type.isWrapped(elements)) {\r\n\t\t\t\telements = _slice.call(elements);\r\n\t\t\t\t/* Wrap a single element in an array so that $.each() can iterate with the element instead of its node's children. */\r\n\t\t\t} else if (Type.isNode(elements)) {\r\n\t\t\t\telements = [elements];\r\n\t\t\t}\r\n\r\n\t\t\treturn elements;\r\n\t\t}\r\n\r\n\t\tvar Type = {\r\n\t\t\tisNumber: function(variable) {\r\n\t\t\t\treturn (typeof variable === \"number\");\r\n\t\t\t},\r\n\t\t\tisString: function(variable) {\r\n\t\t\t\treturn (typeof variable === \"string\");\r\n\t\t\t},\r\n\t\t\tisArray: Array.isArray || function(variable) {\r\n\t\t\t\treturn Object.prototype.toString.call(variable) === \"[object Array]\";\r\n\t\t\t},\r\n\t\t\tisFunction: function(variable) {\r\n\t\t\t\treturn Object.prototype.toString.call(variable) === \"[object Function]\";\r\n\t\t\t},\r\n\t\t\tisNode: function(variable) {\r\n\t\t\t\treturn variable && variable.nodeType;\r\n\t\t\t},\r\n\t\t\t/* Determine if variable is an array-like wrapped jQuery, Zepto or similar element, or even a NodeList etc. */\r\n\t\t\t/* NOTE: HTMLFormElements also have a length. */\r\n\t\t\tisWrapped: function(variable) {\r\n\t\t\t\treturn variable\r\n\t\t\t\t\t\t&& variable !== window\r\n\t\t\t\t\t\t&& Type.isNumber(variable.length)\r\n\t\t\t\t\t\t&& !Type.isString(variable)\r\n\t\t\t\t\t\t&& !Type.isFunction(variable)\r\n\t\t\t\t\t\t&& !Type.isNode(variable)\r\n\t\t\t\t\t\t&& (variable.length === 0 || Type.isNode(variable[0]));\r\n\t\t\t},\r\n\t\t\tisSVG: function(variable) {\r\n\t\t\t\treturn window.SVGElement && (variable instanceof window.SVGElement);\r\n\t\t\t},\r\n\t\t\tisEmptyObject: function(variable) {\r\n\t\t\t\tfor (var name in variable) {\r\n\t\t\t\t\tif (variable.hasOwnProperty(name)) {\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t};\r\n\r\n\t\t/*****************\r\n\t\t Dependencies\r\n\t\t *****************/\r\n\r\n\t\tvar $,\r\n\t\t\t\tisJQuery = false;\r\n\r\n\t\tif (global.fn && global.fn.jquery) {\r\n\t\t\t$ = global;\r\n\t\t\tisJQuery = true;\r\n\t\t} else {\r\n\t\t\t$ = window.Velocity.Utilities;\r\n\t\t}\r\n\r\n\t\tif (IE <= 8 && !isJQuery) {\r\n\t\t\tthrow new Error(\"Velocity: IE8 and below require jQuery to be loaded before Velocity.\");\r\n\t\t} else if (IE <= 7) {\r\n\t\t\t/* Revert to jQuery's $.animate(), and lose Velocity's extra features. */\r\n\t\t\tjQuery.fn.velocity = jQuery.fn.animate;\r\n\r\n\t\t\t/* Now that $.fn.velocity is aliased, abort this Velocity declaration. */\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t/*****************\r\n\t\t Constants\r\n\t\t *****************/\r\n\r\n\t\tvar DURATION_DEFAULT = 400,\r\n\t\t\t\tEASING_DEFAULT = \"swing\";\r\n\r\n\t\t/*************\r\n\t\t State\r\n\t\t *************/\r\n\r\n\t\tvar Velocity = {\r\n\t\t\t/* Container for page-wide Velocity state data. */\r\n\t\t\tState: {\r\n\t\t\t\t/* Detect mobile devices to determine if mobileHA should be turned on. */\r\n\t\t\t\tisMobile: /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(window.navigator.userAgent),\r\n\t\t\t\t/* The mobileHA option's behavior changes on older Android devices (Gingerbread, versions 2.3.3-2.3.7). */\r\n\t\t\t\tisAndroid: /Android/i.test(window.navigator.userAgent),\r\n\t\t\t\tisGingerbread: /Android 2\\.3\\.[3-7]/i.test(window.navigator.userAgent),\r\n\t\t\t\tisChrome: window.chrome,\r\n\t\t\t\tisFirefox: /Firefox/i.test(window.navigator.userAgent),\r\n\t\t\t\t/* Create a cached element for re-use when checking for CSS property prefixes. */\r\n\t\t\t\tprefixElement: document.createElement(\"div\"),\r\n\t\t\t\t/* Cache every prefix match to avoid repeating lookups. */\r\n\t\t\t\tprefixMatches: {},\r\n\t\t\t\t/* Cache the anchor used for animating window scrolling. */\r\n\t\t\t\tscrollAnchor: null,\r\n\t\t\t\t/* Cache the browser-specific property names associated with the scroll anchor. */\r\n\t\t\t\tscrollPropertyLeft: null,\r\n\t\t\t\tscrollPropertyTop: null,\r\n\t\t\t\t/* Keep track of whether our RAF tick is running. */\r\n\t\t\t\tisTicking: false,\r\n\t\t\t\t/* Container for every in-progress call to Velocity. */\r\n\t\t\t\tcalls: [],\r\n\t\t\t\tdelayedElements: {\r\n\t\t\t\t\tcount: 0\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/* Velocity's custom CSS stack. Made global for unit testing. */\r\n\t\t\tCSS: {/* Defined below. */},\r\n\t\t\t/* A shim of the jQuery utility functions used by Velocity -- provided by Velocity's optional jQuery shim. */\r\n\t\t\tUtilities: $,\r\n\t\t\t/* Container for the user's custom animation redirects that are referenced by name in place of the properties map argument. */\r\n\t\t\tRedirects: {/* Manually registered by the user. */},\r\n\t\t\tEasings: {/* Defined below. */},\r\n\t\t\t/* Attempt to use ES6 Promises by default. Users can override this with a third-party promises library. */\r\n\t\t\tPromise: window.Promise,\r\n\t\t\t/* Velocity option defaults, which can be overriden by the user. */\r\n\t\t\tdefaults: {\r\n\t\t\t\tqueue: \"\",\r\n\t\t\t\tduration: DURATION_DEFAULT,\r\n\t\t\t\teasing: EASING_DEFAULT,\r\n\t\t\t\tbegin: undefined,\r\n\t\t\t\tcomplete: undefined,\r\n\t\t\t\tprogress: undefined,\r\n\t\t\t\tdisplay: undefined,\r\n\t\t\t\tvisibility: undefined,\r\n\t\t\t\tloop: false,\r\n\t\t\t\tdelay: false,\r\n\t\t\t\tmobileHA: true,\r\n\t\t\t\t/* Advanced: Set to false to prevent property values from being cached between consecutive Velocity-initiated chain calls. */\r\n\t\t\t\t_cacheValues: true,\r\n\t\t\t\t/* Advanced: Set to false if the promise should always resolve on empty element lists. */\r\n\t\t\t\tpromiseRejectEmpty: true\r\n\t\t\t},\r\n\t\t\t/* A design goal of Velocity is to cache data wherever possible in order to avoid DOM requerying. Accordingly, each element has a data cache. */\r\n\t\t\tinit: function(element) {\r\n\t\t\t\t$.data(element, \"velocity\", {\r\n\t\t\t\t\t/* Store whether this is an SVG element, since its properties are retrieved and updated differently than standard HTML elements. */\r\n\t\t\t\t\tisSVG: Type.isSVG(element),\r\n\t\t\t\t\t/* Keep track of whether the element is currently being animated by Velocity.\r\n\t\t\t\t\t This is used to ensure that property values are not transferred between non-consecutive (stale) calls. */\r\n\t\t\t\t\tisAnimating: false,\r\n\t\t\t\t\t/* A reference to the element's live computedStyle object. Learn more here: https://developer.mozilla.org/en/docs/Web/API/window.getComputedStyle */\r\n\t\t\t\t\tcomputedStyle: null,\r\n\t\t\t\t\t/* Tween data is cached for each animation on the element so that data can be passed across calls --\r\n\t\t\t\t\t in particular, end values are used as subsequent start values in consecutive Velocity calls. */\r\n\t\t\t\t\ttweensContainer: null,\r\n\t\t\t\t\t/* The full root property values of each CSS hook being animated on this element are cached so that:\r\n\t\t\t\t\t 1) Concurrently-animating hooks sharing the same root can have their root values' merged into one while tweening.\r\n\t\t\t\t\t 2) Post-hook-injection root values can be transferred over to consecutively chained Velocity calls as starting root values. */\r\n\t\t\t\t\trootPropertyValueCache: {},\r\n\t\t\t\t\t/* A cache for transform updates, which must be manually flushed via CSS.flushTransformCache(). */\r\n\t\t\t\t\ttransformCache: {}\r\n\t\t\t\t});\r\n\t\t\t},\r\n\t\t\t/* A parallel to jQuery's $.css(), used for getting/setting Velocity's hooked CSS properties. */\r\n\t\t\thook: null, /* Defined below. */\r\n\t\t\t/* Velocity-wide animation time remapping for testing purposes. */\r\n\t\t\tmock: false,\r\n\t\t\tversion: {major: 1, minor: 5, patch: 2},\r\n\t\t\t/* Set to 1 or 2 (most verbose) to output debug info to console. */\r\n\t\t\tdebug: false,\r\n\t\t\t/* Use rAF high resolution timestamp when available */\r\n\t\t\ttimestamp: true,\r\n\t\t\t/* Pause all animations */\r\n\t\t\tpauseAll: function(queueName) {\r\n\t\t\t\tvar currentTime = (new Date()).getTime();\r\n\r\n\t\t\t\t$.each(Velocity.State.calls, function(i, activeCall) {\r\n\r\n\t\t\t\t\tif (activeCall) {\r\n\r\n\t\t\t\t\t\t/* If we have a queueName and this call is not on that queue, skip */\r\n\t\t\t\t\t\tif (queueName !== undefined && ((activeCall[2].queue !== queueName) || (activeCall[2].queue === false))) {\r\n\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Set call to paused */\r\n\t\t\t\t\t\tactiveCall[5] = {\r\n\t\t\t\t\t\t\tresume: false\r\n\t\t\t\t\t\t};\r\n\t\t\t\t\t}\r\n\t\t\t\t});\r\n\r\n\t\t\t\t/* Pause timers on any currently delayed calls */\r\n\t\t\t\t$.each(Velocity.State.delayedElements, function(k, element) {\r\n\t\t\t\t\tif (!element) {\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tpauseDelayOnElement(element, currentTime);\r\n\t\t\t\t});\r\n\t\t\t},\r\n\t\t\t/* Resume all animations */\r\n\t\t\tresumeAll: function(queueName) {\r\n\t\t\t\tvar currentTime = (new Date()).getTime();\r\n\r\n\t\t\t\t$.each(Velocity.State.calls, function(i, activeCall) {\r\n\r\n\t\t\t\t\tif (activeCall) {\r\n\r\n\t\t\t\t\t\t/* If we have a queueName and this call is not on that queue, skip */\r\n\t\t\t\t\t\tif (queueName !== undefined && ((activeCall[2].queue !== queueName) || (activeCall[2].queue === false))) {\r\n\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Set call to resumed if it was paused */\r\n\t\t\t\t\t\tif (activeCall[5]) {\r\n\t\t\t\t\t\t\tactiveCall[5].resume = true;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t});\r\n\t\t\t\t/* Resume timers on any currently delayed calls */\r\n\t\t\t\t$.each(Velocity.State.delayedElements, function(k, element) {\r\n\t\t\t\t\tif (!element) {\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tresumeDelayOnElement(element, currentTime);\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t};\r\n\r\n\t\t/* Retrieve the appropriate scroll anchor and property name for the browser: https://developer.mozilla.org/en-US/docs/Web/API/Window.scrollY */\r\n\t\tif (window.pageYOffset !== undefined) {\r\n\t\t\tVelocity.State.scrollAnchor = window;\r\n\t\t\tVelocity.State.scrollPropertyLeft = \"pageXOffset\";\r\n\t\t\tVelocity.State.scrollPropertyTop = \"pageYOffset\";\r\n\t\t} else {\r\n\t\t\tVelocity.State.scrollAnchor = document.documentElement || document.body.parentNode || document.body;\r\n\t\t\tVelocity.State.scrollPropertyLeft = \"scrollLeft\";\r\n\t\t\tVelocity.State.scrollPropertyTop = \"scrollTop\";\r\n\t\t}\r\n\r\n\t\t/* Shorthand alias for jQuery's $.data() utility. */\r\n\t\tfunction Data(element) {\r\n\t\t\t/* Hardcode a reference to the plugin name. */\r\n\t\t\tvar response = $.data(element, \"velocity\");\r\n\r\n\t\t\t/* jQuery <=1.4.2 returns null instead of undefined when no match is found. We normalize this behavior. */\r\n\t\t\treturn response === null ? undefined : response;\r\n\t\t}\r\n\r\n\t\t/**************\r\n\t\t Delay Timer\r\n\t\t **************/\r\n\r\n\t\tfunction pauseDelayOnElement(element, currentTime) {\r\n\t\t\t/* Check for any delay timers, and pause the set timeouts (while preserving time data)\r\n\t\t\t to be resumed when the \"resume\" command is issued */\r\n\t\t\tvar data = Data(element);\r\n\t\t\tif (data && data.delayTimer && !data.delayPaused) {\r\n\t\t\t\tdata.delayRemaining = data.delay - currentTime + data.delayBegin;\r\n\t\t\t\tdata.delayPaused = true;\r\n\t\t\t\tclearTimeout(data.delayTimer.setTimeout);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfunction resumeDelayOnElement(element, currentTime) {\r\n\t\t\t/* Check for any paused timers and resume */\r\n\t\t\tvar data = Data(element);\r\n\t\t\tif (data && data.delayTimer && data.delayPaused) {\r\n\t\t\t\t/* If the element was mid-delay, re initiate the timeout with the remaining delay */\r\n\t\t\t\tdata.delayPaused = false;\r\n\t\t\t\tdata.delayTimer.setTimeout = setTimeout(data.delayTimer.next, data.delayRemaining);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\r\n\t\t/**************\r\n\t\t Easing\r\n\t\t **************/\r\n\r\n\t\t/* Step easing generator. */\r\n\t\tfunction generateStep(steps) {\r\n\t\t\treturn function(p) {\r\n\t\t\t\treturn Math.round(p * steps) * (1 / steps);\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\t/* Bezier curve function generator. Copyright Gaetan Renaudeau. MIT License: http://en.wikipedia.org/wiki/MIT_License */\r\n\t\tfunction generateBezier(mX1, mY1, mX2, mY2) {\r\n\t\t\tvar NEWTON_ITERATIONS = 4,\r\n\t\t\t\t\tNEWTON_MIN_SLOPE = 0.001,\r\n\t\t\t\t\tSUBDIVISION_PRECISION = 0.0000001,\r\n\t\t\t\t\tSUBDIVISION_MAX_ITERATIONS = 10,\r\n\t\t\t\t\tkSplineTableSize = 11,\r\n\t\t\t\t\tkSampleStepSize = 1.0 / (kSplineTableSize - 1.0),\r\n\t\t\t\t\tfloat32ArraySupported = \"Float32Array\" in window;\r\n\r\n\t\t\t/* Must contain four arguments. */\r\n\t\t\tif (arguments.length !== 4) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\t/* Arguments must be numbers. */\r\n\t\t\tfor (var i = 0; i < 4; ++i) {\r\n\t\t\t\tif (typeof arguments[i] !== \"number\" || isNaN(arguments[i]) || !isFinite(arguments[i])) {\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/* X values must be in the [0, 1] range. */\r\n\t\t\tmX1 = Math.min(mX1, 1);\r\n\t\t\tmX2 = Math.min(mX2, 1);\r\n\t\t\tmX1 = Math.max(mX1, 0);\r\n\t\t\tmX2 = Math.max(mX2, 0);\r\n\r\n\t\t\tvar mSampleValues = float32ArraySupported ? new Float32Array(kSplineTableSize) : new Array(kSplineTableSize);\r\n\r\n\t\t\tfunction A(aA1, aA2) {\r\n\t\t\t\treturn 1.0 - 3.0 * aA2 + 3.0 * aA1;\r\n\t\t\t}\r\n\t\t\tfunction B(aA1, aA2) {\r\n\t\t\t\treturn 3.0 * aA2 - 6.0 * aA1;\r\n\t\t\t}\r\n\t\t\tfunction C(aA1) {\r\n\t\t\t\treturn 3.0 * aA1;\r\n\t\t\t}\r\n\r\n\t\t\tfunction calcBezier(aT, aA1, aA2) {\r\n\t\t\t\treturn ((A(aA1, aA2) * aT + B(aA1, aA2)) * aT + C(aA1)) * aT;\r\n\t\t\t}\r\n\r\n\t\t\tfunction getSlope(aT, aA1, aA2) {\r\n\t\t\t\treturn 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1);\r\n\t\t\t}\r\n\r\n\t\t\tfunction newtonRaphsonIterate(aX, aGuessT) {\r\n\t\t\t\tfor (var i = 0; i < NEWTON_ITERATIONS; ++i) {\r\n\t\t\t\t\tvar currentSlope = getSlope(aGuessT, mX1, mX2);\r\n\r\n\t\t\t\t\tif (currentSlope === 0.0) {\r\n\t\t\t\t\t\treturn aGuessT;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tvar currentX = calcBezier(aGuessT, mX1, mX2) - aX;\r\n\t\t\t\t\taGuessT -= currentX / currentSlope;\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn aGuessT;\r\n\t\t\t}\r\n\r\n\t\t\tfunction calcSampleValues() {\r\n\t\t\t\tfor (var i = 0; i < kSplineTableSize; ++i) {\r\n\t\t\t\t\tmSampleValues[i] = calcBezier(i * kSampleStepSize, mX1, mX2);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tfunction binarySubdivide(aX, aA, aB) {\r\n\t\t\t\tvar currentX, currentT, i = 0;\r\n\r\n\t\t\t\tdo {\r\n\t\t\t\t\tcurrentT = aA + (aB - aA) / 2.0;\r\n\t\t\t\t\tcurrentX = calcBezier(currentT, mX1, mX2) - aX;\r\n\t\t\t\t\tif (currentX > 0.0) {\r\n\t\t\t\t\t\taB = currentT;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\taA = currentT;\r\n\t\t\t\t\t}\r\n\t\t\t\t} while (Math.abs(currentX) > SUBDIVISION_PRECISION && ++i < SUBDIVISION_MAX_ITERATIONS);\r\n\r\n\t\t\t\treturn currentT;\r\n\t\t\t}\r\n\r\n\t\t\tfunction getTForX(aX) {\r\n\t\t\t\tvar intervalStart = 0.0,\r\n\t\t\t\t\t\tcurrentSample = 1,\r\n\t\t\t\t\t\tlastSample = kSplineTableSize - 1;\r\n\r\n\t\t\t\tfor (; currentSample !== lastSample && mSampleValues[currentSample] <= aX; ++currentSample) {\r\n\t\t\t\t\tintervalStart += kSampleStepSize;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t--currentSample;\r\n\r\n\t\t\t\tvar dist = (aX - mSampleValues[currentSample]) / (mSampleValues[currentSample + 1] - mSampleValues[currentSample]),\r\n\t\t\t\t\t\tguessForT = intervalStart + dist * kSampleStepSize,\r\n\t\t\t\t\t\tinitialSlope = getSlope(guessForT, mX1, mX2);\r\n\r\n\t\t\t\tif (initialSlope >= NEWTON_MIN_SLOPE) {\r\n\t\t\t\t\treturn newtonRaphsonIterate(aX, guessForT);\r\n\t\t\t\t} else if (initialSlope === 0.0) {\r\n\t\t\t\t\treturn guessForT;\r\n\t\t\t\t} else {\r\n\t\t\t\t\treturn binarySubdivide(aX, intervalStart, intervalStart + kSampleStepSize);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvar _precomputed = false;\r\n\r\n\t\t\tfunction precompute() {\r\n\t\t\t\t_precomputed = true;\r\n\t\t\t\tif (mX1 !== mY1 || mX2 !== mY2) {\r\n\t\t\t\t\tcalcSampleValues();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tvar f = function(aX) {\r\n\t\t\t\tif (!_precomputed) {\r\n\t\t\t\t\tprecompute();\r\n\t\t\t\t}\r\n\t\t\t\tif (mX1 === mY1 && mX2 === mY2) {\r\n\t\t\t\t\treturn aX;\r\n\t\t\t\t}\r\n\t\t\t\tif (aX === 0) {\r\n\t\t\t\t\treturn 0;\r\n\t\t\t\t}\r\n\t\t\t\tif (aX === 1) {\r\n\t\t\t\t\treturn 1;\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn calcBezier(getTForX(aX), mY1, mY2);\r\n\t\t\t};\r\n\r\n\t\t\tf.getControlPoints = function() {\r\n\t\t\t\treturn [{x: mX1, y: mY1}, {x: mX2, y: mY2}];\r\n\t\t\t};\r\n\r\n\t\t\tvar str = \"generateBezier(\" + [mX1, mY1, mX2, mY2] + \")\";\r\n\t\t\tf.toString = function() {\r\n\t\t\t\treturn str;\r\n\t\t\t};\r\n\r\n\t\t\treturn f;\r\n\t\t}\r\n\r\n\t\t/* Runge-Kutta spring physics function generator. Adapted from Framer.js, copyright Koen Bok. MIT License: http://en.wikipedia.org/wiki/MIT_License */\r\n\t\t/* Given a tension, friction, and duration, a simulation at 60FPS will first run without a defined duration in order to calculate the full path. A second pass\r\n\t\t then adjusts the time delta -- using the relation between actual time and duration -- to calculate the path for the duration-constrained animation. */\r\n\t\tvar generateSpringRK4 = (function() {\r\n\t\t\tfunction springAccelerationForState(state) {\r\n\t\t\t\treturn (-state.tension * state.x) - (state.friction * state.v);\r\n\t\t\t}\r\n\r\n\t\t\tfunction springEvaluateStateWithDerivative(initialState, dt, derivative) {\r\n\t\t\t\tvar state = {\r\n\t\t\t\t\tx: initialState.x + derivative.dx * dt,\r\n\t\t\t\t\tv: initialState.v + derivative.dv * dt,\r\n\t\t\t\t\ttension: initialState.tension,\r\n\t\t\t\t\tfriction: initialState.friction\r\n\t\t\t\t};\r\n\r\n\t\t\t\treturn {dx: state.v, dv: springAccelerationForState(state)};\r\n\t\t\t}\r\n\r\n\t\t\tfunction springIntegrateState(state, dt) {\r\n\t\t\t\tvar a = {\r\n\t\t\t\t\tdx: state.v,\r\n\t\t\t\t\tdv: springAccelerationForState(state)\r\n\t\t\t\t},\r\n\t\t\t\t\t\tb = springEvaluateStateWithDerivative(state, dt * 0.5, a),\r\n\t\t\t\t\t\tc = springEvaluateStateWithDerivative(state, dt * 0.5, b),\r\n\t\t\t\t\t\td = springEvaluateStateWithDerivative(state, dt, c),\r\n\t\t\t\t\t\tdxdt = 1.0 / 6.0 * (a.dx + 2.0 * (b.dx + c.dx) + d.dx),\r\n\t\t\t\t\t\tdvdt = 1.0 / 6.0 * (a.dv + 2.0 * (b.dv + c.dv) + d.dv);\r\n\r\n\t\t\t\tstate.x = state.x + dxdt * dt;\r\n\t\t\t\tstate.v = state.v + dvdt * dt;\r\n\r\n\t\t\t\treturn state;\r\n\t\t\t}\r\n\r\n\t\t\treturn function springRK4Factory(tension, friction, duration) {\r\n\r\n\t\t\t\tvar initState = {\r\n\t\t\t\t\tx: -1,\r\n\t\t\t\t\tv: 0,\r\n\t\t\t\t\ttension: null,\r\n\t\t\t\t\tfriction: null\r\n\t\t\t\t},\r\n\t\t\t\t\t\tpath = [0],\r\n\t\t\t\t\t\ttime_lapsed = 0,\r\n\t\t\t\t\t\ttolerance = 1 / 10000,\r\n\t\t\t\t\t\tDT = 16 / 1000,\r\n\t\t\t\t\t\thave_duration, dt, last_state;\r\n\r\n\t\t\t\ttension = parseFloat(tension) || 500;\r\n\t\t\t\tfriction = parseFloat(friction) || 20;\r\n\t\t\t\tduration = duration || null;\r\n\r\n\t\t\t\tinitState.tension = tension;\r\n\t\t\t\tinitState.friction = friction;\r\n\r\n\t\t\t\thave_duration = duration !== null;\r\n\r\n\t\t\t\t/* Calculate the actual time it takes for this animation to complete with the provided conditions. */\r\n\t\t\t\tif (have_duration) {\r\n\t\t\t\t\t/* Run the simulation without a duration. */\r\n\t\t\t\t\ttime_lapsed = springRK4Factory(tension, friction);\r\n\t\t\t\t\t/* Compute the adjusted time delta. */\r\n\t\t\t\t\tdt = time_lapsed / duration * DT;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdt = DT;\r\n\t\t\t\t}\r\n\r\n\t\t\t\twhile (true) {\r\n\t\t\t\t\t/* Next/step function .*/\r\n\t\t\t\t\tlast_state = springIntegrateState(last_state || initState, dt);\r\n\t\t\t\t\t/* Store the position. */\r\n\t\t\t\t\tpath.push(1 + last_state.x);\r\n\t\t\t\t\ttime_lapsed += 16;\r\n\t\t\t\t\t/* If the change threshold is reached, break. */\r\n\t\t\t\t\tif (!(Math.abs(last_state.x) > tolerance && Math.abs(last_state.v) > tolerance)) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* If duration is not defined, return the actual time required for completing this animation. Otherwise, return a closure that holds the\r\n\t\t\t\t computed path and returns a snapshot of the position according to a given percentComplete. */\r\n\t\t\t\treturn !have_duration ? time_lapsed : function(percentComplete) {\r\n\t\t\t\t\treturn path[ (percentComplete * (path.length - 1)) | 0 ];\r\n\t\t\t\t};\r\n\t\t\t};\r\n\t\t}());\r\n\r\n\t\t/* jQuery easings. */\r\n\t\tVelocity.Easings = {\r\n\t\t\tlinear: function(p) {\r\n\t\t\t\treturn p;\r\n\t\t\t},\r\n\t\t\tswing: function(p) {\r\n\t\t\t\treturn 0.5 - Math.cos(p * Math.PI) / 2;\r\n\t\t\t},\r\n\t\t\t/* Bonus \"spring\" easing, which is a less exaggerated version of easeInOutElastic. */\r\n\t\t\tspring: function(p) {\r\n\t\t\t\treturn 1 - (Math.cos(p * 4.5 * Math.PI) * Math.exp(-p * 6));\r\n\t\t\t}\r\n\t\t};\r\n\r\n\t\t/* CSS3 and Robert Penner easings. */\r\n\t\t$.each(\r\n\t\t\t\t[\r\n\t\t\t\t\t[\"ease\", [0.25, 0.1, 0.25, 1.0]],\r\n\t\t\t\t\t[\"ease-in\", [0.42, 0.0, 1.00, 1.0]],\r\n\t\t\t\t\t[\"ease-out\", [0.00, 0.0, 0.58, 1.0]],\r\n\t\t\t\t\t[\"ease-in-out\", [0.42, 0.0, 0.58, 1.0]],\r\n\t\t\t\t\t[\"easeInSine\", [0.47, 0, 0.745, 0.715]],\r\n\t\t\t\t\t[\"easeOutSine\", [0.39, 0.575, 0.565, 1]],\r\n\t\t\t\t\t[\"easeInOutSine\", [0.445, 0.05, 0.55, 0.95]],\r\n\t\t\t\t\t[\"easeInQuad\", [0.55, 0.085, 0.68, 0.53]],\r\n\t\t\t\t\t[\"easeOutQuad\", [0.25, 0.46, 0.45, 0.94]],\r\n\t\t\t\t\t[\"easeInOutQuad\", [0.455, 0.03, 0.515, 0.955]],\r\n\t\t\t\t\t[\"easeInCubic\", [0.55, 0.055, 0.675, 0.19]],\r\n\t\t\t\t\t[\"easeOutCubic\", [0.215, 0.61, 0.355, 1]],\r\n\t\t\t\t\t[\"easeInOutCubic\", [0.645, 0.045, 0.355, 1]],\r\n\t\t\t\t\t[\"easeInQuart\", [0.895, 0.03, 0.685, 0.22]],\r\n\t\t\t\t\t[\"easeOutQuart\", [0.165, 0.84, 0.44, 1]],\r\n\t\t\t\t\t[\"easeInOutQuart\", [0.77, 0, 0.175, 1]],\r\n\t\t\t\t\t[\"easeInQuint\", [0.755, 0.05, 0.855, 0.06]],\r\n\t\t\t\t\t[\"easeOutQuint\", [0.23, 1, 0.32, 1]],\r\n\t\t\t\t\t[\"easeInOutQuint\", [0.86, 0, 0.07, 1]],\r\n\t\t\t\t\t[\"easeInExpo\", [0.95, 0.05, 0.795, 0.035]],\r\n\t\t\t\t\t[\"easeOutExpo\", [0.19, 1, 0.22, 1]],\r\n\t\t\t\t\t[\"easeInOutExpo\", [1, 0, 0, 1]],\r\n\t\t\t\t\t[\"easeInCirc\", [0.6, 0.04, 0.98, 0.335]],\r\n\t\t\t\t\t[\"easeOutCirc\", [0.075, 0.82, 0.165, 1]],\r\n\t\t\t\t\t[\"easeInOutCirc\", [0.785, 0.135, 0.15, 0.86]]\r\n\t\t\t\t], function(i, easingArray) {\r\n\t\t\tVelocity.Easings[easingArray[0]] = generateBezier.apply(null, easingArray[1]);\r\n\t\t});\r\n\r\n\t\t/* Determine the appropriate easing type given an easing input. */\r\n\t\tfunction getEasing(value, duration) {\r\n\t\t\tvar easing = value;\r\n\r\n\t\t\t/* The easing option can either be a string that references a pre-registered easing,\r\n\t\t\t or it can be a two-/four-item array of integers to be converted into a bezier/spring function. */\r\n\t\t\tif (Type.isString(value)) {\r\n\t\t\t\t/* Ensure that the easing has been assigned to jQuery's Velocity.Easings object. */\r\n\t\t\t\tif (!Velocity.Easings[value]) {\r\n\t\t\t\t\teasing = false;\r\n\t\t\t\t}\r\n\t\t\t} else if (Type.isArray(value) && value.length === 1) {\r\n\t\t\t\teasing = generateStep.apply(null, value);\r\n\t\t\t} else if (Type.isArray(value) && value.length === 2) {\r\n\t\t\t\t/* springRK4 must be passed the animation's duration. */\r\n\t\t\t\t/* Note: If the springRK4 array contains non-numbers, generateSpringRK4() returns an easing\r\n\t\t\t\t function generated with default tension and friction values. */\r\n\t\t\t\teasing = generateSpringRK4.apply(null, value.concat([duration]));\r\n\t\t\t} else if (Type.isArray(value) && value.length === 4) {\r\n\t\t\t\t/* Note: If the bezier array contains non-numbers, generateBezier() returns false. */\r\n\t\t\t\teasing = generateBezier.apply(null, value);\r\n\t\t\t} else {\r\n\t\t\t\teasing = false;\r\n\t\t\t}\r\n\r\n\t\t\t/* Revert to the Velocity-wide default easing type, or fall back to \"swing\" (which is also jQuery's default)\r\n\t\t\t if the Velocity-wide default has been incorrectly modified. */\r\n\t\t\tif (easing === false) {\r\n\t\t\t\tif (Velocity.Easings[Velocity.defaults.easing]) {\r\n\t\t\t\t\teasing = Velocity.defaults.easing;\r\n\t\t\t\t} else {\r\n\t\t\t\t\teasing = EASING_DEFAULT;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn easing;\r\n\t\t}\r\n\r\n\t\t/*****************\r\n\t\t CSS Stack\r\n\t\t *****************/\r\n\r\n\t\t/* The CSS object is a highly condensed and performant CSS stack that fully replaces jQuery's.\r\n\t\t It handles the validation, getting, and setting of both standard CSS properties and CSS property hooks. */\r\n\t\t/* Note: A \"CSS\" shorthand is aliased so that our code is easier to read. */\r\n\t\tvar CSS = Velocity.CSS = {\r\n\t\t\t/*************\r\n\t\t\t RegEx\r\n\t\t\t *************/\r\n\r\n\t\t\tRegEx: {\r\n\t\t\t\tisHex: /^#([A-f\\d]{3}){1,2}$/i,\r\n\t\t\t\t/* Unwrap a property value's surrounding text, e.g. \"rgba(4, 3, 2, 1)\" ==> \"4, 3, 2, 1\" and \"rect(4px 3px 2px 1px)\" ==> \"4px 3px 2px 1px\". */\r\n\t\t\t\tvalueUnwrap: /^[A-z]+\\((.*)\\)$/i,\r\n\t\t\t\twrappedValueAlreadyExtracted: /[0-9.]+ [0-9.]+ [0-9.]+( [0-9.]+)?/,\r\n\t\t\t\t/* Split a multi-value property into an array of subvalues, e.g. \"rgba(4, 3, 2, 1) 4px 3px 2px 1px\" ==> [ \"rgba(4, 3, 2, 1)\", \"4px\", \"3px\", \"2px\", \"1px\" ]. */\r\n\t\t\t\tvalueSplit: /([A-z]+\\(.+\\))|(([A-z0-9#-.]+?)(?=\\s|$))/ig\r\n\t\t\t},\r\n\t\t\t/************\r\n\t\t\t Lists\r\n\t\t\t ************/\r\n\r\n\t\t\tLists: {\r\n\t\t\t\tcolors: [\"fill\", \"stroke\", \"stopColor\", \"color\", \"backgroundColor\", \"borderColor\", \"borderTopColor\", \"borderRightColor\", \"borderBottomColor\", \"borderLeftColor\", \"outlineColor\"],\r\n\t\t\t\ttransformsBase: [\"translateX\", \"translateY\", \"scale\", \"scaleX\", \"scaleY\", \"skewX\", \"skewY\", \"rotateZ\"],\r\n\t\t\t\ttransforms3D: [\"transformPerspective\", \"translateZ\", \"scaleZ\", \"rotateX\", \"rotateY\"],\r\n\t\t\t\tunits: [\r\n\t\t\t\t\t\"%\", // relative\r\n\t\t\t\t\t\"em\", \"ex\", \"ch\", \"rem\", // font relative\r\n\t\t\t\t\t\"vw\", \"vh\", \"vmin\", \"vmax\", // viewport relative\r\n\t\t\t\t\t\"cm\", \"mm\", \"Q\", \"in\", \"pc\", \"pt\", \"px\", // absolute lengths\r\n\t\t\t\t\t\"deg\", \"grad\", \"rad\", \"turn\", // angles\r\n\t\t\t\t\t\"s\", \"ms\" // time\r\n\t\t\t\t],\r\n\t\t\t\tcolorNames: {\r\n\t\t\t\t\t\"aliceblue\": \"240,248,255\",\r\n\t\t\t\t\t\"antiquewhite\": \"250,235,215\",\r\n\t\t\t\t\t\"aquamarine\": \"127,255,212\",\r\n\t\t\t\t\t\"aqua\": \"0,255,255\",\r\n\t\t\t\t\t\"azure\": \"240,255,255\",\r\n\t\t\t\t\t\"beige\": \"245,245,220\",\r\n\t\t\t\t\t\"bisque\": \"255,228,196\",\r\n\t\t\t\t\t\"black\": \"0,0,0\",\r\n\t\t\t\t\t\"blanchedalmond\": \"255,235,205\",\r\n\t\t\t\t\t\"blueviolet\": \"138,43,226\",\r\n\t\t\t\t\t\"blue\": \"0,0,255\",\r\n\t\t\t\t\t\"brown\": \"165,42,42\",\r\n\t\t\t\t\t\"burlywood\": \"222,184,135\",\r\n\t\t\t\t\t\"cadetblue\": \"95,158,160\",\r\n\t\t\t\t\t\"chartreuse\": \"127,255,0\",\r\n\t\t\t\t\t\"chocolate\": \"210,105,30\",\r\n\t\t\t\t\t\"coral\": \"255,127,80\",\r\n\t\t\t\t\t\"cornflowerblue\": \"100,149,237\",\r\n\t\t\t\t\t\"cornsilk\": \"255,248,220\",\r\n\t\t\t\t\t\"crimson\": \"220,20,60\",\r\n\t\t\t\t\t\"cyan\": \"0,255,255\",\r\n\t\t\t\t\t\"darkblue\": \"0,0,139\",\r\n\t\t\t\t\t\"darkcyan\": \"0,139,139\",\r\n\t\t\t\t\t\"darkgoldenrod\": \"184,134,11\",\r\n\t\t\t\t\t\"darkgray\": \"169,169,169\",\r\n\t\t\t\t\t\"darkgrey\": \"169,169,169\",\r\n\t\t\t\t\t\"darkgreen\": \"0,100,0\",\r\n\t\t\t\t\t\"darkkhaki\": \"189,183,107\",\r\n\t\t\t\t\t\"darkmagenta\": \"139,0,139\",\r\n\t\t\t\t\t\"darkolivegreen\": \"85,107,47\",\r\n\t\t\t\t\t\"darkorange\": \"255,140,0\",\r\n\t\t\t\t\t\"darkorchid\": \"153,50,204\",\r\n\t\t\t\t\t\"darkred\": \"139,0,0\",\r\n\t\t\t\t\t\"darksalmon\": \"233,150,122\",\r\n\t\t\t\t\t\"darkseagreen\": \"143,188,143\",\r\n\t\t\t\t\t\"darkslateblue\": \"72,61,139\",\r\n\t\t\t\t\t\"darkslategray\": \"47,79,79\",\r\n\t\t\t\t\t\"darkturquoise\": \"0,206,209\",\r\n\t\t\t\t\t\"darkviolet\": \"148,0,211\",\r\n\t\t\t\t\t\"deeppink\": \"255,20,147\",\r\n\t\t\t\t\t\"deepskyblue\": \"0,191,255\",\r\n\t\t\t\t\t\"dimgray\": \"105,105,105\",\r\n\t\t\t\t\t\"dimgrey\": \"105,105,105\",\r\n\t\t\t\t\t\"dodgerblue\": \"30,144,255\",\r\n\t\t\t\t\t\"firebrick\": \"178,34,34\",\r\n\t\t\t\t\t\"floralwhite\": \"255,250,240\",\r\n\t\t\t\t\t\"forestgreen\": \"34,139,34\",\r\n\t\t\t\t\t\"fuchsia\": \"255,0,255\",\r\n\t\t\t\t\t\"gainsboro\": \"220,220,220\",\r\n\t\t\t\t\t\"ghostwhite\": \"248,248,255\",\r\n\t\t\t\t\t\"gold\": \"255,215,0\",\r\n\t\t\t\t\t\"goldenrod\": \"218,165,32\",\r\n\t\t\t\t\t\"gray\": \"128,128,128\",\r\n\t\t\t\t\t\"grey\": \"128,128,128\",\r\n\t\t\t\t\t\"greenyellow\": \"173,255,47\",\r\n\t\t\t\t\t\"green\": \"0,128,0\",\r\n\t\t\t\t\t\"honeydew\": \"240,255,240\",\r\n\t\t\t\t\t\"hotpink\": \"255,105,180\",\r\n\t\t\t\t\t\"indianred\": \"205,92,92\",\r\n\t\t\t\t\t\"indigo\": \"75,0,130\",\r\n\t\t\t\t\t\"ivory\": \"255,255,240\",\r\n\t\t\t\t\t\"khaki\": \"240,230,140\",\r\n\t\t\t\t\t\"lavenderblush\": \"255,240,245\",\r\n\t\t\t\t\t\"lavender\": \"230,230,250\",\r\n\t\t\t\t\t\"lawngreen\": \"124,252,0\",\r\n\t\t\t\t\t\"lemonchiffon\": \"255,250,205\",\r\n\t\t\t\t\t\"lightblue\": \"173,216,230\",\r\n\t\t\t\t\t\"lightcoral\": \"240,128,128\",\r\n\t\t\t\t\t\"lightcyan\": \"224,255,255\",\r\n\t\t\t\t\t\"lightgoldenrodyellow\": \"250,250,210\",\r\n\t\t\t\t\t\"lightgray\": \"211,211,211\",\r\n\t\t\t\t\t\"lightgrey\": \"211,211,211\",\r\n\t\t\t\t\t\"lightgreen\": \"144,238,144\",\r\n\t\t\t\t\t\"lightpink\": \"255,182,193\",\r\n\t\t\t\t\t\"lightsalmon\": \"255,160,122\",\r\n\t\t\t\t\t\"lightseagreen\": \"32,178,170\",\r\n\t\t\t\t\t\"lightskyblue\": \"135,206,250\",\r\n\t\t\t\t\t\"lightslategray\": \"119,136,153\",\r\n\t\t\t\t\t\"lightsteelblue\": \"176,196,222\",\r\n\t\t\t\t\t\"lightyellow\": \"255,255,224\",\r\n\t\t\t\t\t\"limegreen\": \"50,205,50\",\r\n\t\t\t\t\t\"lime\": \"0,255,0\",\r\n\t\t\t\t\t\"linen\": \"250,240,230\",\r\n\t\t\t\t\t\"magenta\": \"255,0,255\",\r\n\t\t\t\t\t\"maroon\": \"128,0,0\",\r\n\t\t\t\t\t\"mediumaquamarine\": \"102,205,170\",\r\n\t\t\t\t\t\"mediumblue\": \"0,0,205\",\r\n\t\t\t\t\t\"mediumorchid\": \"186,85,211\",\r\n\t\t\t\t\t\"mediumpurple\": \"147,112,219\",\r\n\t\t\t\t\t\"mediumseagreen\": \"60,179,113\",\r\n\t\t\t\t\t\"mediumslateblue\": \"123,104,238\",\r\n\t\t\t\t\t\"mediumspringgreen\": \"0,250,154\",\r\n\t\t\t\t\t\"mediumturquoise\": \"72,209,204\",\r\n\t\t\t\t\t\"mediumvioletred\": \"199,21,133\",\r\n\t\t\t\t\t\"midnightblue\": \"25,25,112\",\r\n\t\t\t\t\t\"mintcream\": \"245,255,250\",\r\n\t\t\t\t\t\"mistyrose\": \"255,228,225\",\r\n\t\t\t\t\t\"moccasin\": \"255,228,181\",\r\n\t\t\t\t\t\"navajowhite\": \"255,222,173\",\r\n\t\t\t\t\t\"navy\": \"0,0,128\",\r\n\t\t\t\t\t\"oldlace\": \"253,245,230\",\r\n\t\t\t\t\t\"olivedrab\": \"107,142,35\",\r\n\t\t\t\t\t\"olive\": \"128,128,0\",\r\n\t\t\t\t\t\"orangered\": \"255,69,0\",\r\n\t\t\t\t\t\"orange\": \"255,165,0\",\r\n\t\t\t\t\t\"orchid\": \"218,112,214\",\r\n\t\t\t\t\t\"palegoldenrod\": \"238,232,170\",\r\n\t\t\t\t\t\"palegreen\": \"152,251,152\",\r\n\t\t\t\t\t\"paleturquoise\": \"175,238,238\",\r\n\t\t\t\t\t\"palevioletred\": \"219,112,147\",\r\n\t\t\t\t\t\"papayawhip\": \"255,239,213\",\r\n\t\t\t\t\t\"peachpuff\": \"255,218,185\",\r\n\t\t\t\t\t\"peru\": \"205,133,63\",\r\n\t\t\t\t\t\"pink\": \"255,192,203\",\r\n\t\t\t\t\t\"plum\": \"221,160,221\",\r\n\t\t\t\t\t\"powderblue\": \"176,224,230\",\r\n\t\t\t\t\t\"purple\": \"128,0,128\",\r\n\t\t\t\t\t\"red\": \"255,0,0\",\r\n\t\t\t\t\t\"rosybrown\": \"188,143,143\",\r\n\t\t\t\t\t\"royalblue\": \"65,105,225\",\r\n\t\t\t\t\t\"saddlebrown\": \"139,69,19\",\r\n\t\t\t\t\t\"salmon\": \"250,128,114\",\r\n\t\t\t\t\t\"sandybrown\": \"244,164,96\",\r\n\t\t\t\t\t\"seagreen\": \"46,139,87\",\r\n\t\t\t\t\t\"seashell\": \"255,245,238\",\r\n\t\t\t\t\t\"sienna\": \"160,82,45\",\r\n\t\t\t\t\t\"silver\": \"192,192,192\",\r\n\t\t\t\t\t\"skyblue\": \"135,206,235\",\r\n\t\t\t\t\t\"slateblue\": \"106,90,205\",\r\n\t\t\t\t\t\"slategray\": \"112,128,144\",\r\n\t\t\t\t\t\"snow\": \"255,250,250\",\r\n\t\t\t\t\t\"springgreen\": \"0,255,127\",\r\n\t\t\t\t\t\"steelblue\": \"70,130,180\",\r\n\t\t\t\t\t\"tan\": \"210,180,140\",\r\n\t\t\t\t\t\"teal\": \"0,128,128\",\r\n\t\t\t\t\t\"thistle\": \"216,191,216\",\r\n\t\t\t\t\t\"tomato\": \"255,99,71\",\r\n\t\t\t\t\t\"turquoise\": \"64,224,208\",\r\n\t\t\t\t\t\"violet\": \"238,130,238\",\r\n\t\t\t\t\t\"wheat\": \"245,222,179\",\r\n\t\t\t\t\t\"whitesmoke\": \"245,245,245\",\r\n\t\t\t\t\t\"white\": \"255,255,255\",\r\n\t\t\t\t\t\"yellowgreen\": \"154,205,50\",\r\n\t\t\t\t\t\"yellow\": \"255,255,0\"\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/************\r\n\t\t\t Hooks\r\n\t\t\t ************/\r\n\r\n\t\t\t/* Hooks allow a subproperty (e.g. \"boxShadowBlur\") of a compound-value CSS property\r\n\t\t\t (e.g. \"boxShadow: X Y Blur Spread Color\") to be animated as if it were a discrete property. */\r\n\t\t\t/* Note: Beyond enabling fine-grained property animation, hooking is necessary since Velocity only\r\n\t\t\t tweens properties with single numeric values; unlike CSS transitions, Velocity does not interpolate compound-values. */\r\n\t\t\tHooks: {\r\n\t\t\t\t/********************\r\n\t\t\t\t Registration\r\n\t\t\t\t ********************/\r\n\r\n\t\t\t\t/* Templates are a concise way of indicating which subproperties must be individually registered for each compound-value CSS property. */\r\n\t\t\t\t/* Each template consists of the compound-value's base name, its constituent subproperty names, and those subproperties' default values. */\r\n\t\t\t\ttemplates: {\r\n\t\t\t\t\t\"textShadow\": [\"Color X Y Blur\", \"black 0px 0px 0px\"],\r\n\t\t\t\t\t\"boxShadow\": [\"Color X Y Blur Spread\", \"black 0px 0px 0px 0px\"],\r\n\t\t\t\t\t\"clip\": [\"Top Right Bottom Left\", \"0px 0px 0px 0px\"],\r\n\t\t\t\t\t\"backgroundPosition\": [\"X Y\", \"0% 0%\"],\r\n\t\t\t\t\t\"transformOrigin\": [\"X Y Z\", \"50% 50% 0px\"],\r\n\t\t\t\t\t\"perspectiveOrigin\": [\"X Y\", \"50% 50%\"]\r\n\t\t\t\t},\r\n\t\t\t\t/* A \"registered\" hook is one that has been converted from its template form into a live,\r\n\t\t\t\t tweenable property. It contains data to associate it with its root property. */\r\n\t\t\t\tregistered: {\r\n\t\t\t\t\t/* Note: A registered hook looks like this ==> textShadowBlur: [ \"textShadow\", 3 ],\r\n\t\t\t\t\t which consists of the subproperty's name, the associated root property's name,\r\n\t\t\t\t\t and the subproperty's position in the root's value. */\r\n\t\t\t\t},\r\n\t\t\t\t/* Convert the templates into individual hooks then append them to the registered object above. */\r\n\t\t\t\tregister: function() {\r\n\t\t\t\t\t/* Color hooks registration: Colors are defaulted to white -- as opposed to black -- since colors that are\r\n\t\t\t\t\t currently set to \"transparent\" default to their respective template below when color-animated,\r\n\t\t\t\t\t and white is typically a closer match to transparent than black is. An exception is made for text (\"color\"),\r\n\t\t\t\t\t which is almost always set closer to black than white. */\r\n\t\t\t\t\tfor (var i = 0; i < CSS.Lists.colors.length; i++) {\r\n\t\t\t\t\t\tvar rgbComponents = (CSS.Lists.colors[i] === \"color\") ? \"0 0 0 1\" : \"255 255 255 1\";\r\n\t\t\t\t\t\tCSS.Hooks.templates[CSS.Lists.colors[i]] = [\"Red Green Blue Alpha\", rgbComponents];\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tvar rootProperty,\r\n\t\t\t\t\t\t\thookTemplate,\r\n\t\t\t\t\t\t\thookNames;\r\n\r\n\t\t\t\t\t/* In IE, color values inside compound-value properties are positioned at the end the value instead of at the beginning.\r\n\t\t\t\t\t Thus, we re-arrange the templates accordingly. */\r\n\t\t\t\t\tif (IE) {\r\n\t\t\t\t\t\tfor (rootProperty in CSS.Hooks.templates) {\r\n\t\t\t\t\t\t\tif (!CSS.Hooks.templates.hasOwnProperty(rootProperty)) {\r\n\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\thookTemplate = CSS.Hooks.templates[rootProperty];\r\n\t\t\t\t\t\t\thookNames = hookTemplate[0].split(\" \");\r\n\r\n\t\t\t\t\t\t\tvar defaultValues = hookTemplate[1].match(CSS.RegEx.valueSplit);\r\n\r\n\t\t\t\t\t\t\tif (hookNames[0] === \"Color\") {\r\n\t\t\t\t\t\t\t\t/* Reposition both the hook's name and its default value to the end of their respective strings. */\r\n\t\t\t\t\t\t\t\thookNames.push(hookNames.shift());\r\n\t\t\t\t\t\t\t\tdefaultValues.push(defaultValues.shift());\r\n\r\n\t\t\t\t\t\t\t\t/* Replace the existing template for the hook's root property. */\r\n\t\t\t\t\t\t\t\tCSS.Hooks.templates[rootProperty] = [hookNames.join(\" \"), defaultValues.join(\" \")];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Hook registration. */\r\n\t\t\t\t\tfor (rootProperty in CSS.Hooks.templates) {\r\n\t\t\t\t\t\tif (!CSS.Hooks.templates.hasOwnProperty(rootProperty)) {\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\thookTemplate = CSS.Hooks.templates[rootProperty];\r\n\t\t\t\t\t\thookNames = hookTemplate[0].split(\" \");\r\n\r\n\t\t\t\t\t\tfor (var j in hookNames) {\r\n\t\t\t\t\t\t\tif (!hookNames.hasOwnProperty(j)) {\r\n\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tvar fullHookName = rootProperty + hookNames[j],\r\n\t\t\t\t\t\t\t\t\thookPosition = j;\r\n\r\n\t\t\t\t\t\t\t/* For each hook, register its full name (e.g. textShadowBlur) with its root property (e.g. textShadow)\r\n\t\t\t\t\t\t\t and the hook's position in its template's default value string. */\r\n\t\t\t\t\t\t\tCSS.Hooks.registered[fullHookName] = [rootProperty, hookPosition];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\t/*****************************\r\n\t\t\t\t Injection and Extraction\r\n\t\t\t\t *****************************/\r\n\r\n\t\t\t\t/* Look up the root property associated with the hook (e.g. return \"textShadow\" for \"textShadowBlur\"). */\r\n\t\t\t\t/* Since a hook cannot be set directly (the browser won't recognize it), style updating for hooks is routed through the hook's root property. */\r\n\t\t\t\tgetRoot: function(property) {\r\n\t\t\t\t\tvar hookData = CSS.Hooks.registered[property];\r\n\r\n\t\t\t\t\tif (hookData) {\r\n\t\t\t\t\t\treturn hookData[0];\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* If there was no hook match, return the property name untouched. */\r\n\t\t\t\t\t\treturn property;\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\tgetUnit: function(str, start) {\r\n\t\t\t\t\tvar unit = (str.substr(start || 0, 5).match(/^[a-z%]+/) || [])[0] || \"\";\r\n\r\n\t\t\t\t\tif (unit && _inArray(CSS.Lists.units, unit)) {\r\n\t\t\t\t\t\treturn unit;\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn \"\";\r\n\t\t\t\t},\r\n\t\t\t\tfixColors: function(str) {\r\n\t\t\t\t\treturn str.replace(/(rgba?\\(\\s*)?(\\b[a-z]+\\b)/g, function($0, $1, $2) {\r\n\t\t\t\t\t\tif (CSS.Lists.colorNames.hasOwnProperty($2)) {\r\n\t\t\t\t\t\t\treturn ($1 ? $1 : \"rgba(\") + CSS.Lists.colorNames[$2] + ($1 ? \"\" : \",1)\");\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\treturn $1 + $2;\r\n\t\t\t\t\t});\r\n\t\t\t\t},\r\n\t\t\t\t/* Convert any rootPropertyValue, null or otherwise, into a space-delimited list of hook values so that\r\n\t\t\t\t the targeted hook can be injected or extracted at its standard position. */\r\n\t\t\t\tcleanRootPropertyValue: function(rootProperty, rootPropertyValue) {\r\n\t\t\t\t\t/* If the rootPropertyValue is wrapped with \"rgb()\", \"clip()\", etc., remove the wrapping to normalize the value before manipulation. */\r\n\t\t\t\t\tif (CSS.RegEx.valueUnwrap.test(rootPropertyValue)) {\r\n\t\t\t\t\t\trootPropertyValue = rootPropertyValue.match(CSS.RegEx.valueUnwrap)[1];\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* If rootPropertyValue is a CSS null-value (from which there's inherently no hook value to extract),\r\n\t\t\t\t\t default to the root's default value as defined in CSS.Hooks.templates. */\r\n\t\t\t\t\t/* Note: CSS null-values include \"none\", \"auto\", and \"transparent\". They must be converted into their\r\n\t\t\t\t\t zero-values (e.g. textShadow: \"none\" ==> textShadow: \"0px 0px 0px black\") for hook manipulation to proceed. */\r\n\t\t\t\t\tif (CSS.Values.isCSSNullValue(rootPropertyValue)) {\r\n\t\t\t\t\t\trootPropertyValue = CSS.Hooks.templates[rootProperty][1];\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\treturn rootPropertyValue;\r\n\t\t\t\t},\r\n\t\t\t\t/* Extracted the hook's value from its root property's value. This is used to get the starting value of an animating hook. */\r\n\t\t\t\textractValue: function(fullHookName, rootPropertyValue) {\r\n\t\t\t\t\tvar hookData = CSS.Hooks.registered[fullHookName];\r\n\r\n\t\t\t\t\tif (hookData) {\r\n\t\t\t\t\t\tvar hookRoot = hookData[0],\r\n\t\t\t\t\t\t\t\thookPosition = hookData[1];\r\n\r\n\t\t\t\t\t\trootPropertyValue = CSS.Hooks.cleanRootPropertyValue(hookRoot, rootPropertyValue);\r\n\r\n\t\t\t\t\t\t/* Split rootPropertyValue into its constituent hook values then grab the desired hook at its standard position. */\r\n\t\t\t\t\t\treturn rootPropertyValue.toString().match(CSS.RegEx.valueSplit)[hookPosition];\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* If the provided fullHookName isn't a registered hook, return the rootPropertyValue that was passed in. */\r\n\t\t\t\t\t\treturn rootPropertyValue;\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\t/* Inject the hook's value into its root property's value. This is used to piece back together the root property\r\n\t\t\t\t once Velocity has updated one of its individually hooked values through tweening. */\r\n\t\t\t\tinjectValue: function(fullHookName, hookValue, rootPropertyValue) {\r\n\t\t\t\t\tvar hookData = CSS.Hooks.registered[fullHookName];\r\n\r\n\t\t\t\t\tif (hookData) {\r\n\t\t\t\t\t\tvar hookRoot = hookData[0],\r\n\t\t\t\t\t\t\t\thookPosition = hookData[1],\r\n\t\t\t\t\t\t\t\trootPropertyValueParts,\r\n\t\t\t\t\t\t\t\trootPropertyValueUpdated;\r\n\r\n\t\t\t\t\t\trootPropertyValue = CSS.Hooks.cleanRootPropertyValue(hookRoot, rootPropertyValue);\r\n\r\n\t\t\t\t\t\t/* Split rootPropertyValue into its individual hook values, replace the targeted value with hookValue,\r\n\t\t\t\t\t\t then reconstruct the rootPropertyValue string. */\r\n\t\t\t\t\t\trootPropertyValueParts = rootPropertyValue.toString().match(CSS.RegEx.valueSplit);\r\n\t\t\t\t\t\trootPropertyValueParts[hookPosition] = hookValue;\r\n\t\t\t\t\t\trootPropertyValueUpdated = rootPropertyValueParts.join(\" \");\r\n\r\n\t\t\t\t\t\treturn rootPropertyValueUpdated;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* If the provided fullHookName isn't a registered hook, return the rootPropertyValue that was passed in. */\r\n\t\t\t\t\t\treturn rootPropertyValue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/*******************\r\n\t\t\t Normalizations\r\n\t\t\t *******************/\r\n\r\n\t\t\t/* Normalizations standardize CSS property manipulation by pollyfilling browser-specific implementations (e.g. opacity)\r\n\t\t\t and reformatting special properties (e.g. clip, rgba) to look like standard ones. */\r\n\t\t\tNormalizations: {\r\n\t\t\t\t/* Normalizations are passed a normalization target (either the property's name, its extracted value, or its injected value),\r\n\t\t\t\t the targeted element (which may need to be queried), and the targeted property value. */\r\n\t\t\t\tregistered: {\r\n\t\t\t\t\tclip: function(type, element, propertyValue) {\r\n\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\treturn \"clip\";\r\n\t\t\t\t\t\t\t\t/* Clip needs to be unwrapped and stripped of its commas during extraction. */\r\n\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\tvar extracted;\r\n\r\n\t\t\t\t\t\t\t\t/* If Velocity also extracted this value, skip extraction. */\r\n\t\t\t\t\t\t\t\tif (CSS.RegEx.wrappedValueAlreadyExtracted.test(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\textracted = propertyValue;\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t/* Remove the \"rect()\" wrapper. */\r\n\t\t\t\t\t\t\t\t\textracted = propertyValue.toString().match(CSS.RegEx.valueUnwrap);\r\n\r\n\t\t\t\t\t\t\t\t\t/* Strip off commas. */\r\n\t\t\t\t\t\t\t\t\textracted = extracted ? extracted[1].replace(/,(\\s+)?/g, \" \") : propertyValue;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\treturn extracted;\r\n\t\t\t\t\t\t\t\t/* Clip needs to be re-wrapped during injection. */\r\n\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\treturn \"rect(\" + propertyValue + \")\";\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t},\r\n\t\t\t\t\tblur: function(type, element, propertyValue) {\r\n\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\treturn Velocity.State.isFirefox ? \"filter\" : \"-webkit-filter\";\r\n\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\tvar extracted = parseFloat(propertyValue);\r\n\r\n\t\t\t\t\t\t\t\t/* If extracted is NaN, meaning the value isn't already extracted. */\r\n\t\t\t\t\t\t\t\tif (!(extracted || extracted === 0)) {\r\n\t\t\t\t\t\t\t\t\tvar blurComponent = propertyValue.toString().match(/blur\\(([0-9]+[A-z]+)\\)/i);\r\n\r\n\t\t\t\t\t\t\t\t\t/* If the filter string had a blur component, return just the blur value and unit type. */\r\n\t\t\t\t\t\t\t\t\tif (blurComponent) {\r\n\t\t\t\t\t\t\t\t\t\textracted = blurComponent[1];\r\n\t\t\t\t\t\t\t\t\t\t/* If the component doesn't exist, default blur to 0. */\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\textracted = 0;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\treturn extracted;\r\n\t\t\t\t\t\t\t\t/* Blur needs to be re-wrapped during injection. */\r\n\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t/* For the blur effect to be fully de-applied, it needs to be set to \"none\" instead of 0. */\r\n\t\t\t\t\t\t\t\tif (!parseFloat(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\treturn \"none\";\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\treturn \"blur(\" + propertyValue + \")\";\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t},\r\n\t\t\t\t\t/* <=IE8 do not support the standard opacity property. They use filter:alpha(opacity=INT) instead. */\r\n\t\t\t\t\topacity: function(type, element, propertyValue) {\r\n\t\t\t\t\t\tif (IE <= 8) {\r\n\t\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\t\treturn \"filter\";\r\n\t\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\t\t/* <=IE8 return a \"filter\" value of \"alpha(opacity=\\d{1,3})\".\r\n\t\t\t\t\t\t\t\t\t Extract the value and convert it to a decimal value to match the standard CSS opacity property's formatting. */\r\n\t\t\t\t\t\t\t\t\tvar extracted = propertyValue.toString().match(/alpha\\(opacity=(.*)\\)/i);\r\n\r\n\t\t\t\t\t\t\t\t\tif (extracted) {\r\n\t\t\t\t\t\t\t\t\t\t/* Convert to decimal value. */\r\n\t\t\t\t\t\t\t\t\t\tpropertyValue = extracted[1] / 100;\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t/* When extracting opacity, default to 1 since a null value means opacity hasn't been set. */\r\n\t\t\t\t\t\t\t\t\t\tpropertyValue = 1;\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\treturn propertyValue;\r\n\t\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t\t/* Opacified elements are required to have their zoom property set to a non-zero value. */\r\n\t\t\t\t\t\t\t\t\telement.style.zoom = 1;\r\n\r\n\t\t\t\t\t\t\t\t\t/* Setting the filter property on elements with certain font property combinations can result in a\r\n\t\t\t\t\t\t\t\t\t highly unappealing ultra-bolding effect. There's no way to remedy this throughout a tween, but dropping the\r\n\t\t\t\t\t\t\t\t\t value altogether (when opacity hits 1) at leasts ensures that the glitch is gone post-tweening. */\r\n\t\t\t\t\t\t\t\t\tif (parseFloat(propertyValue) >= 1) {\r\n\t\t\t\t\t\t\t\t\t\treturn \"\";\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t/* As per the filter property's spec, convert the decimal value to a whole number and wrap the value. */\r\n\t\t\t\t\t\t\t\t\t\treturn \"alpha(opacity=\" + parseInt(parseFloat(propertyValue) * 100, 10) + \")\";\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t/* With all other browsers, normalization is not required; return the same values that were passed in. */\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\t\treturn \"opacity\";\r\n\t\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\t\treturn propertyValue;\r\n\t\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t\treturn propertyValue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\t/*****************************\r\n\t\t\t\t Batched Registrations\r\n\t\t\t\t *****************************/\r\n\r\n\t\t\t\t/* Note: Batched normalizations extend the CSS.Normalizations.registered object. */\r\n\t\t\t\tregister: function() {\r\n\r\n\t\t\t\t\t/*****************\r\n\t\t\t\t\t Transforms\r\n\t\t\t\t\t *****************/\r\n\r\n\t\t\t\t\t/* Transforms are the subproperties contained by the CSS \"transform\" property. Transforms must undergo normalization\r\n\t\t\t\t\t so that they can be referenced in a properties map by their individual names. */\r\n\t\t\t\t\t/* Note: When transforms are \"set\", they are actually assigned to a per-element transformCache. When all transform\r\n\t\t\t\t\t setting is complete complete, CSS.flushTransformCache() must be manually called to flush the values to the DOM.\r\n\t\t\t\t\t Transform setting is batched in this way to improve performance: the transform style only needs to be updated\r\n\t\t\t\t\t once when multiple transform subproperties are being animated simultaneously. */\r\n\t\t\t\t\t/* Note: IE9 and Android Gingerbread have support for 2D -- but not 3D -- transforms. Since animating unsupported\r\n\t\t\t\t\t transform properties results in the browser ignoring the *entire* transform string, we prevent these 3D values\r\n\t\t\t\t\t from being normalized for these browsers so that tweening skips these properties altogether\r\n\t\t\t\t\t (since it will ignore them as being unsupported by the browser.) */\r\n\t\t\t\t\tif ((!IE || IE > 9) && !Velocity.State.isGingerbread) {\r\n\t\t\t\t\t\t/* Note: Since the standalone CSS \"perspective\" property and the CSS transform \"perspective\" subproperty\r\n\t\t\t\t\t\t share the same name, the latter is given a unique token within Velocity: \"transformPerspective\". */\r\n\t\t\t\t\t\tCSS.Lists.transformsBase = CSS.Lists.transformsBase.concat(CSS.Lists.transforms3D);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tfor (var i = 0; i < CSS.Lists.transformsBase.length; i++) {\r\n\t\t\t\t\t\t/* Wrap the dynamically generated normalization function in a new scope so that transformName's value is\r\n\t\t\t\t\t\t paired with its respective function. (Otherwise, all functions would take the final for loop's transformName.) */\r\n\t\t\t\t\t\t(function() {\r\n\t\t\t\t\t\t\tvar transformName = CSS.Lists.transformsBase[i];\r\n\r\n\t\t\t\t\t\t\tCSS.Normalizations.registered[transformName] = function(type, element, propertyValue) {\r\n\t\t\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\t\t\t/* The normalized property name is the parent \"transform\" property -- the property that is actually set in CSS. */\r\n\t\t\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\t\t\treturn \"transform\";\r\n\t\t\t\t\t\t\t\t\t\t/* Transform values are cached onto a per-element transformCache object. */\r\n\t\t\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\t\t\t/* If this transform has yet to be assigned a value, return its null value. */\r\n\t\t\t\t\t\t\t\t\t\tif (Data(element) === undefined || Data(element).transformCache[transformName] === undefined) {\r\n\t\t\t\t\t\t\t\t\t\t\t/* Scale CSS.Lists.transformsBase default to 1 whereas all other transform properties default to 0. */\r\n\t\t\t\t\t\t\t\t\t\t\treturn /^scale/i.test(transformName) ? 1 : 0;\r\n\t\t\t\t\t\t\t\t\t\t\t/* When transform values are set, they are wrapped in parentheses as per the CSS spec.\r\n\t\t\t\t\t\t\t\t\t\t\t Thus, when extracting their values (for tween calculations), we strip off the parentheses. */\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\treturn Data(element).transformCache[transformName].replace(/[()]/g, \"\");\r\n\t\t\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t\t\tvar invalid = false;\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* If an individual transform property contains an unsupported unit type, the browser ignores the *entire* transform property.\r\n\t\t\t\t\t\t\t\t\t\t Thus, protect users from themselves by skipping setting for transform values supplied with invalid unit types. */\r\n\t\t\t\t\t\t\t\t\t\t/* Switch on the base transform type; ignore the axis by removing the last letter from the transform's name. */\r\n\t\t\t\t\t\t\t\t\t\tswitch (transformName.substr(0, transformName.length - 1)) {\r\n\t\t\t\t\t\t\t\t\t\t\t/* Whitelist unit types for each transform. */\r\n\t\t\t\t\t\t\t\t\t\t\tcase \"translate\":\r\n\t\t\t\t\t\t\t\t\t\t\t\tinvalid = !/(%|px|em|rem|vw|vh|\\d)$/i.test(propertyValue);\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t\t/* Since an axis-free \"scale\" property is supported as well, a little hack is used here to detect it by chopping off its last letter. */\r\n\t\t\t\t\t\t\t\t\t\t\tcase \"scal\":\r\n\t\t\t\t\t\t\t\t\t\t\tcase \"scale\":\r\n\t\t\t\t\t\t\t\t\t\t\t\t/* Chrome on Android has a bug in which scaled elements blur if their initial scale\r\n\t\t\t\t\t\t\t\t\t\t\t\t value is below 1 (which can happen with forcefeeding). Thus, we detect a yet-unset scale property\r\n\t\t\t\t\t\t\t\t\t\t\t\t and ensure that its first value is always 1. More info: http://stackoverflow.com/questions/10417890/css3-animations-with-transform-causes-blurred-elements-on-webkit/10417962#10417962 */\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (Velocity.State.isAndroid && Data(element).transformCache[transformName] === undefined && propertyValue < 1) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tpropertyValue = 1;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tinvalid = !/(\\d)$/i.test(propertyValue);\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\tcase \"skew\":\r\n\t\t\t\t\t\t\t\t\t\t\t\tinvalid = !/(deg|\\d)$/i.test(propertyValue);\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\tcase \"rotate\":\r\n\t\t\t\t\t\t\t\t\t\t\t\tinvalid = !/(deg|\\d)$/i.test(propertyValue);\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (!invalid) {\r\n\t\t\t\t\t\t\t\t\t\t\t/* As per the CSS spec, wrap the value in parentheses. */\r\n\t\t\t\t\t\t\t\t\t\t\tData(element).transformCache[transformName] = \"(\" + propertyValue + \")\";\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Although the value is set on the transformCache object, return the newly-updated value for the calling code to process as normal. */\r\n\t\t\t\t\t\t\t\t\t\treturn Data(element).transformCache[transformName];\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t};\r\n\t\t\t\t\t\t})();\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/*************\r\n\t\t\t\t\t Colors\r\n\t\t\t\t\t *************/\r\n\r\n\t\t\t\t\t/* Since Velocity only animates a single numeric value per property, color animation is achieved by hooking the individual RGBA components of CSS color properties.\r\n\t\t\t\t\t Accordingly, color values must be normalized (e.g. \"#ff0000\", \"red\", and \"rgb(255, 0, 0)\" ==> \"255 0 0 1\") so that their components can be injected/extracted by CSS.Hooks logic. */\r\n\t\t\t\t\tfor (var j = 0; j < CSS.Lists.colors.length; j++) {\r\n\t\t\t\t\t\t/* Wrap the dynamically generated normalization function in a new scope so that colorName's value is paired with its respective function.\r\n\t\t\t\t\t\t (Otherwise, all functions would take the final for loop's colorName.) */\r\n\t\t\t\t\t\t(function() {\r\n\t\t\t\t\t\t\tvar colorName = CSS.Lists.colors[j];\r\n\r\n\t\t\t\t\t\t\t/* Note: In IE<=8, which support rgb but not rgba, color properties are reverted to rgb by stripping off the alpha component. */\r\n\t\t\t\t\t\t\tCSS.Normalizations.registered[colorName] = function(type, element, propertyValue) {\r\n\t\t\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\t\t\treturn colorName;\r\n\t\t\t\t\t\t\t\t\t\t/* Convert all color values into the rgb format. (Old IE can return hex values and color names instead of rgb/rgba.) */\r\n\t\t\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\t\t\tvar extracted;\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* If the color is already in its hookable form (e.g. \"255 255 255 1\") due to having been previously extracted, skip extraction. */\r\n\t\t\t\t\t\t\t\t\t\tif (CSS.RegEx.wrappedValueAlreadyExtracted.test(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\t\t\textracted = propertyValue;\r\n\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\tvar converted,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tcolorNames = {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tblack: \"rgb(0, 0, 0)\",\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tblue: \"rgb(0, 0, 255)\",\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tgray: \"rgb(128, 128, 128)\",\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tgreen: \"rgb(0, 128, 0)\",\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tred: \"rgb(255, 0, 0)\",\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhite: \"rgb(255, 255, 255)\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t/* Convert color names to rgb. */\r\n\t\t\t\t\t\t\t\t\t\t\tif (/^[A-z]+$/i.test(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (colorNames[propertyValue] !== undefined) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tconverted = colorNames[propertyValue];\r\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t/* If an unmatched color name is provided, default to black. */\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tconverted = colorNames.black;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t/* Convert hex values to rgb. */\r\n\t\t\t\t\t\t\t\t\t\t\t} else if (CSS.RegEx.isHex.test(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tconverted = \"rgb(\" + CSS.Values.hexToRgb(propertyValue).join(\" \") + \")\";\r\n\t\t\t\t\t\t\t\t\t\t\t\t/* If the provided color doesn't match any of the accepted color formats, default to black. */\r\n\t\t\t\t\t\t\t\t\t\t\t} else if (!(/^rgba?\\(/i.test(propertyValue))) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tconverted = colorNames.black;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t/* Remove the surrounding \"rgb/rgba()\" string then replace commas with spaces and strip\r\n\t\t\t\t\t\t\t\t\t\t\t repeated spaces (in case the value included spaces to begin with). */\r\n\t\t\t\t\t\t\t\t\t\t\textracted = (converted || propertyValue).toString().match(CSS.RegEx.valueUnwrap)[1].replace(/,(\\s+)?/g, \" \");\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* So long as this isn't <=IE8, add a fourth (alpha) component if it's missing and default it to 1 (visible). */\r\n\t\t\t\t\t\t\t\t\t\tif ((!IE || IE > 8) && extracted.split(\" \").length === 3) {\r\n\t\t\t\t\t\t\t\t\t\t\textracted += \" 1\";\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\treturn extracted;\r\n\t\t\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t\t\t/* If we have a pattern then it might already have the right values */\r\n\t\t\t\t\t\t\t\t\t\tif (/^rgb/.test(propertyValue)) {\r\n\t\t\t\t\t\t\t\t\t\t\treturn propertyValue;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* If this is IE<=8 and an alpha component exists, strip it off. */\r\n\t\t\t\t\t\t\t\t\t\tif (IE <= 8) {\r\n\t\t\t\t\t\t\t\t\t\t\tif (propertyValue.split(\" \").length === 4) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tpropertyValue = propertyValue.split(/\\s+/).slice(0, 3).join(\" \");\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t/* Otherwise, add a fourth (alpha) component if it's missing and default it to 1 (visible). */\r\n\t\t\t\t\t\t\t\t\t\t} else if (propertyValue.split(\" \").length === 3) {\r\n\t\t\t\t\t\t\t\t\t\t\tpropertyValue += \" 1\";\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Re-insert the browser-appropriate wrapper(\"rgb/rgba()\"), insert commas, and strip off decimal units\r\n\t\t\t\t\t\t\t\t\t\t on all values but the fourth (R, G, and B only accept whole numbers). */\r\n\t\t\t\t\t\t\t\t\t\treturn (IE <= 8 ? \"rgb\" : \"rgba\") + \"(\" + propertyValue.replace(/\\s+/g, \",\").replace(/\\.(\\d)+(?=,)/g, \"\") + \")\";\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t};\r\n\t\t\t\t\t\t})();\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/**************\r\n\t\t\t\t\t Dimensions\r\n\t\t\t\t\t **************/\r\n\t\t\t\t\tfunction augmentDimension(name, element, wantInner) {\r\n\t\t\t\t\t\tvar isBorderBox = CSS.getPropertyValue(element, \"boxSizing\").toString().toLowerCase() === \"border-box\";\r\n\r\n\t\t\t\t\t\tif (isBorderBox === (wantInner || false)) {\r\n\t\t\t\t\t\t\t/* in box-sizing mode, the CSS width / height accessors already give the outerWidth / outerHeight. */\r\n\t\t\t\t\t\t\tvar i,\r\n\t\t\t\t\t\t\t\t\tvalue,\r\n\t\t\t\t\t\t\t\t\taugment = 0,\r\n\t\t\t\t\t\t\t\t\tsides = name === \"width\" ? [\"Left\", \"Right\"] : [\"Top\", \"Bottom\"],\r\n\t\t\t\t\t\t\t\t\tfields = [\"padding\" + sides[0], \"padding\" + sides[1], \"border\" + sides[0] + \"Width\", \"border\" + sides[1] + \"Width\"];\r\n\r\n\t\t\t\t\t\t\tfor (i = 0; i < fields.length; i++) {\r\n\t\t\t\t\t\t\t\tvalue = parseFloat(CSS.getPropertyValue(element, fields[i]));\r\n\t\t\t\t\t\t\t\tif (!isNaN(value)) {\r\n\t\t\t\t\t\t\t\t\taugment += value;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\treturn wantInner ? -augment : augment;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\treturn 0;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tfunction getDimension(name, wantInner) {\r\n\t\t\t\t\t\treturn function(type, element, propertyValue) {\r\n\t\t\t\t\t\t\tswitch (type) {\r\n\t\t\t\t\t\t\t\tcase \"name\":\r\n\t\t\t\t\t\t\t\t\treturn name;\r\n\t\t\t\t\t\t\t\tcase \"extract\":\r\n\t\t\t\t\t\t\t\t\treturn parseFloat(propertyValue) + augmentDimension(name, element, wantInner);\r\n\t\t\t\t\t\t\t\tcase \"inject\":\r\n\t\t\t\t\t\t\t\t\treturn (parseFloat(propertyValue) - augmentDimension(name, element, wantInner)) + \"px\";\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t};\r\n\t\t\t\t\t}\r\n\t\t\t\t\tCSS.Normalizations.registered.innerWidth = getDimension(\"width\", true);\r\n\t\t\t\t\tCSS.Normalizations.registered.innerHeight = getDimension(\"height\", true);\r\n\t\t\t\t\tCSS.Normalizations.registered.outerWidth = getDimension(\"width\");\r\n\t\t\t\t\tCSS.Normalizations.registered.outerHeight = getDimension(\"height\");\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/************************\r\n\t\t\t CSS Property Names\r\n\t\t\t ************************/\r\n\r\n\t\t\tNames: {\r\n\t\t\t\t/* Camelcase a property name into its JavaScript notation (e.g. \"background-color\" ==> \"backgroundColor\").\r\n\t\t\t\t Camelcasing is used to normalize property names between and across calls. */\r\n\t\t\t\tcamelCase: function(property) {\r\n\t\t\t\t\treturn property.replace(/-(\\w)/g, function(match, subMatch) {\r\n\t\t\t\t\t\treturn subMatch.toUpperCase();\r\n\t\t\t\t\t});\r\n\t\t\t\t},\r\n\t\t\t\t/* For SVG elements, some properties (namely, dimensional ones) are GET/SET via the element's HTML attributes (instead of via CSS styles). */\r\n\t\t\t\tSVGAttribute: function(property) {\r\n\t\t\t\t\tvar SVGAttributes = \"width|height|x|y|cx|cy|r|rx|ry|x1|x2|y1|y2\";\r\n\r\n\t\t\t\t\t/* Certain browsers require an SVG transform to be applied as an attribute. (Otherwise, application via CSS is preferable due to 3D support.) */\r\n\t\t\t\t\tif (IE || (Velocity.State.isAndroid && !Velocity.State.isChrome)) {\r\n\t\t\t\t\t\tSVGAttributes += \"|transform\";\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\treturn new RegExp(\"^(\" + SVGAttributes + \")$\", \"i\").test(property);\r\n\t\t\t\t},\r\n\t\t\t\t/* Determine whether a property should be set with a vendor prefix. */\r\n\t\t\t\t/* If a prefixed version of the property exists, return it. Otherwise, return the original property name.\r\n\t\t\t\t If the property is not at all supported by the browser, return a false flag. */\r\n\t\t\t\tprefixCheck: function(property) {\r\n\t\t\t\t\t/* If this property has already been checked, return the cached value. */\r\n\t\t\t\t\tif (Velocity.State.prefixMatches[property]) {\r\n\t\t\t\t\t\treturn [Velocity.State.prefixMatches[property], true];\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tvar vendors = [\"\", \"Webkit\", \"Moz\", \"ms\", \"O\"];\r\n\r\n\t\t\t\t\t\tfor (var i = 0, vendorsLength = vendors.length; i < vendorsLength; i++) {\r\n\t\t\t\t\t\t\tvar propertyPrefixed;\r\n\r\n\t\t\t\t\t\t\tif (i === 0) {\r\n\t\t\t\t\t\t\t\tpropertyPrefixed = property;\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t/* Capitalize the first letter of the property to conform to JavaScript vendor prefix notation (e.g. webkitFilter). */\r\n\t\t\t\t\t\t\t\tpropertyPrefixed = vendors[i] + property.replace(/^\\w/, function(match) {\r\n\t\t\t\t\t\t\t\t\treturn match.toUpperCase();\r\n\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Check if the browser supports this property as prefixed. */\r\n\t\t\t\t\t\t\tif (Type.isString(Velocity.State.prefixElement.style[propertyPrefixed])) {\r\n\t\t\t\t\t\t\t\t/* Cache the match. */\r\n\t\t\t\t\t\t\t\tVelocity.State.prefixMatches[property] = propertyPrefixed;\r\n\r\n\t\t\t\t\t\t\t\treturn [propertyPrefixed, true];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* If the browser doesn't support this property in any form, include a false flag so that the caller can decide how to proceed. */\r\n\t\t\t\t\t\treturn [property, false];\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/************************\r\n\t\t\t CSS Property Values\r\n\t\t\t ************************/\r\n\r\n\t\t\tValues: {\r\n\t\t\t\t/* Hex to RGB conversion. Copyright Tim Down: http://stackoverflow.com/questions/5623838/rgb-to-hex-and-hex-to-rgb */\r\n\t\t\t\thexToRgb: function(hex) {\r\n\t\t\t\t\tvar shortformRegex = /^#?([a-f\\d])([a-f\\d])([a-f\\d])$/i,\r\n\t\t\t\t\t\t\tlongformRegex = /^#?([a-f\\d]{2})([a-f\\d]{2})([a-f\\d]{2})$/i,\r\n\t\t\t\t\t\t\trgbParts;\r\n\r\n\t\t\t\t\thex = hex.replace(shortformRegex, function(m, r, g, b) {\r\n\t\t\t\t\t\treturn r + r + g + g + b + b;\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\trgbParts = longformRegex.exec(hex);\r\n\r\n\t\t\t\t\treturn rgbParts ? [parseInt(rgbParts[1], 16), parseInt(rgbParts[2], 16), parseInt(rgbParts[3], 16)] : [0, 0, 0];\r\n\t\t\t\t},\r\n\t\t\t\tisCSSNullValue: function(value) {\r\n\t\t\t\t\t/* The browser defaults CSS values that have not been set to either 0 or one of several possible null-value strings.\r\n\t\t\t\t\t Thus, we check for both falsiness and these special strings. */\r\n\t\t\t\t\t/* Null-value checking is performed to default the special strings to 0 (for the sake of tweening) or their hook\r\n\t\t\t\t\t templates as defined as CSS.Hooks (for the sake of hook injection/extraction). */\r\n\t\t\t\t\t/* Note: Chrome returns \"rgba(0, 0, 0, 0)\" for an undefined color whereas IE returns \"transparent\". */\r\n\t\t\t\t\treturn (!value || /^(none|auto|transparent|(rgba\\(0, ?0, ?0, ?0\\)))$/i.test(value));\r\n\t\t\t\t},\r\n\t\t\t\t/* Retrieve a property's default unit type. Used for assigning a unit type when one is not supplied by the user. */\r\n\t\t\t\tgetUnitType: function(property) {\r\n\t\t\t\t\tif (/^(rotate|skew)/i.test(property)) {\r\n\t\t\t\t\t\treturn \"deg\";\r\n\t\t\t\t\t} else if (/(^(scale|scaleX|scaleY|scaleZ|alpha|flexGrow|flexHeight|zIndex|fontWeight)$)|((opacity|red|green|blue|alpha)$)/i.test(property)) {\r\n\t\t\t\t\t\t/* The above properties are unitless. */\r\n\t\t\t\t\t\treturn \"\";\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* Default to px for all other properties. */\r\n\t\t\t\t\t\treturn \"px\";\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\t/* HTML elements default to an associated display type when they're not set to display:none. */\r\n\t\t\t\t/* Note: This function is used for correctly setting the non-\"none\" display value in certain Velocity redirects, such as fadeIn/Out. */\r\n\t\t\t\tgetDisplayType: function(element) {\r\n\t\t\t\t\tvar tagName = element && element.tagName.toString().toLowerCase();\r\n\r\n\t\t\t\t\tif (/^(b|big|i|small|tt|abbr|acronym|cite|code|dfn|em|kbd|strong|samp|var|a|bdo|br|img|map|object|q|script|span|sub|sup|button|input|label|select|textarea)$/i.test(tagName)) {\r\n\t\t\t\t\t\treturn \"inline\";\r\n\t\t\t\t\t} else if (/^(li)$/i.test(tagName)) {\r\n\t\t\t\t\t\treturn \"list-item\";\r\n\t\t\t\t\t} else if (/^(tr)$/i.test(tagName)) {\r\n\t\t\t\t\t\treturn \"table-row\";\r\n\t\t\t\t\t} else if (/^(table)$/i.test(tagName)) {\r\n\t\t\t\t\t\treturn \"table\";\r\n\t\t\t\t\t} else if (/^(tbody)$/i.test(tagName)) {\r\n\t\t\t\t\t\treturn \"table-row-group\";\r\n\t\t\t\t\t\t/* Default to \"block\" when no match is found. */\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\treturn \"block\";\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\t/* The class add/remove functions are used to temporarily apply a \"velocity-animating\" class to elements while they're animating. */\r\n\t\t\t\taddClass: function(element, className) {\r\n\t\t\t\t\tif (element) {\r\n\t\t\t\t\t\tif (element.classList) {\r\n\t\t\t\t\t\t\telement.classList.add(className);\r\n\t\t\t\t\t\t} else if (Type.isString(element.className)) {\r\n\t\t\t\t\t\t\t// Element.className is around 15% faster then set/getAttribute\r\n\t\t\t\t\t\t\telement.className += (element.className.length ? \" \" : \"\") + className;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Work around for IE strict mode animating SVG - and anything else that doesn't behave correctly - the same way jQuery does it\r\n\t\t\t\t\t\t\tvar currentClass = element.getAttribute(IE <= 7 ? \"className\" : \"class\") || \"\";\r\n\r\n\t\t\t\t\t\t\telement.setAttribute(\"class\", currentClass + (currentClass ? \" \" : \"\") + className);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t\tremoveClass: function(element, className) {\r\n\t\t\t\t\tif (element) {\r\n\t\t\t\t\t\tif (element.classList) {\r\n\t\t\t\t\t\t\telement.classList.remove(className);\r\n\t\t\t\t\t\t} else if (Type.isString(element.className)) {\r\n\t\t\t\t\t\t\t// Element.className is around 15% faster then set/getAttribute\r\n\t\t\t\t\t\t\t// TODO: Need some jsperf tests on performance - can we get rid of the regex and maybe use split / array manipulation?\r\n\t\t\t\t\t\t\telement.className = element.className.toString().replace(new RegExp(\"(^|\\\\s)\" + className.split(\" \").join(\"|\") + \"(\\\\s|$)\", \"gi\"), \" \");\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Work around for IE strict mode animating SVG - and anything else that doesn't behave correctly - the same way jQuery does it\r\n\t\t\t\t\t\t\tvar currentClass = element.getAttribute(IE <= 7 ? \"className\" : \"class\") || \"\";\r\n\r\n\t\t\t\t\t\t\telement.setAttribute(\"class\", currentClass.replace(new RegExp(\"(^|\\s)\" + className.split(\" \").join(\"|\") + \"(\\s|$)\", \"gi\"), \" \"));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t},\r\n\t\t\t/****************************\r\n\t\t\t Style Getting & Setting\r\n\t\t\t ****************************/\r\n\r\n\t\t\t/* The singular getPropertyValue, which routes the logic for all normalizations, hooks, and standard CSS properties. */\r\n\t\t\tgetPropertyValue: function(element, property, rootPropertyValue, forceStyleLookup) {\r\n\t\t\t\t/* Get an element's computed property value. */\r\n\t\t\t\t/* Note: Retrieving the value of a CSS property cannot simply be performed by checking an element's\r\n\t\t\t\t style attribute (which only reflects user-defined values). Instead, the browser must be queried for a property's\r\n\t\t\t\t *computed* value. You can read more about getComputedStyle here: https://developer.mozilla.org/en/docs/Web/API/window.getComputedStyle */\r\n\t\t\t\tfunction computePropertyValue(element, property) {\r\n\t\t\t\t\t/* When box-sizing isn't set to border-box, height and width style values are incorrectly computed when an\r\n\t\t\t\t\t element's scrollbars are visible (which expands the element's dimensions). Thus, we defer to the more accurate\r\n\t\t\t\t\t offsetHeight/Width property, which includes the total dimensions for interior, border, padding, and scrollbar.\r\n\t\t\t\t\t We subtract border and padding to get the sum of interior + scrollbar. */\r\n\t\t\t\t\tvar computedValue = 0;\r\n\r\n\t\t\t\t\t/* IE<=8 doesn't support window.getComputedStyle, thus we defer to jQuery, which has an extensive array\r\n\t\t\t\t\t of hacks to accurately retrieve IE8 property values. Re-implementing that logic here is not worth bloating the\r\n\t\t\t\t\t codebase for a dying browser. The performance repercussions of using jQuery here are minimal since\r\n\t\t\t\t\t Velocity is optimized to rarely (and sometimes never) query the DOM. Further, the $.css() codepath isn't that slow. */\r\n\t\t\t\t\tif (IE <= 8) {\r\n\t\t\t\t\t\tcomputedValue = $.css(element, property); /* GET */\r\n\t\t\t\t\t\t/* All other browsers support getComputedStyle. The returned live object reference is cached onto its\r\n\t\t\t\t\t\t associated element so that it does not need to be refetched upon every GET. */\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* Browsers do not return height and width values for elements that are set to display:\"none\". Thus, we temporarily\r\n\t\t\t\t\t\t toggle display to the element type's default value. */\r\n\t\t\t\t\t\tvar toggleDisplay = false;\r\n\r\n\t\t\t\t\t\tif (/^(width|height)$/.test(property) && CSS.getPropertyValue(element, \"display\") === 0) {\r\n\t\t\t\t\t\t\ttoggleDisplay = true;\r\n\t\t\t\t\t\t\tCSS.setPropertyValue(element, \"display\", CSS.Values.getDisplayType(element));\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tvar revertDisplay = function() {\r\n\t\t\t\t\t\t\tif (toggleDisplay) {\r\n\t\t\t\t\t\t\t\tCSS.setPropertyValue(element, \"display\", \"none\");\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\tif (!forceStyleLookup) {\r\n\t\t\t\t\t\t\tif (property === \"height\" && CSS.getPropertyValue(element, \"boxSizing\").toString().toLowerCase() !== \"border-box\") {\r\n\t\t\t\t\t\t\t\tvar contentBoxHeight = element.offsetHeight - (parseFloat(CSS.getPropertyValue(element, \"borderTopWidth\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"borderBottomWidth\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"paddingTop\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"paddingBottom\")) || 0);\r\n\t\t\t\t\t\t\t\trevertDisplay();\r\n\r\n\t\t\t\t\t\t\t\treturn contentBoxHeight;\r\n\t\t\t\t\t\t\t} else if (property === \"width\" && CSS.getPropertyValue(element, \"boxSizing\").toString().toLowerCase() !== \"border-box\") {\r\n\t\t\t\t\t\t\t\tvar contentBoxWidth = element.offsetWidth - (parseFloat(CSS.getPropertyValue(element, \"borderLeftWidth\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"borderRightWidth\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"paddingLeft\")) || 0) - (parseFloat(CSS.getPropertyValue(element, \"paddingRight\")) || 0);\r\n\t\t\t\t\t\t\t\trevertDisplay();\r\n\r\n\t\t\t\t\t\t\t\treturn contentBoxWidth;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tvar computedStyle;\r\n\r\n\t\t\t\t\t\t/* For elements that Velocity hasn't been called on directly (e.g. when Velocity queries the DOM on behalf\r\n\t\t\t\t\t\t of a parent of an element its animating), perform a direct getComputedStyle lookup since the object isn't cached. */\r\n\t\t\t\t\t\tif (Data(element) === undefined) {\r\n\t\t\t\t\t\t\tcomputedStyle = window.getComputedStyle(element, null); /* GET */\r\n\t\t\t\t\t\t\t/* If the computedStyle object has yet to be cached, do so now. */\r\n\t\t\t\t\t\t} else if (!Data(element).computedStyle) {\r\n\t\t\t\t\t\t\tcomputedStyle = Data(element).computedStyle = window.getComputedStyle(element, null); /* GET */\r\n\t\t\t\t\t\t\t/* If computedStyle is cached, use it. */\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tcomputedStyle = Data(element).computedStyle;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* IE and Firefox do not return a value for the generic borderColor -- they only return individual values for each border side's color.\r\n\t\t\t\t\t\t Also, in all browsers, when border colors aren't all the same, a compound value is returned that Velocity isn't setup to parse.\r\n\t\t\t\t\t\t So, as a polyfill for querying individual border side colors, we just return the top border's color and animate all borders from that value. */\r\n\t\t\t\t\t\tif (property === \"borderColor\") {\r\n\t\t\t\t\t\t\tproperty = \"borderTopColor\";\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* IE9 has a bug in which the \"filter\" property must be accessed from computedStyle using the getPropertyValue method\r\n\t\t\t\t\t\t instead of a direct property lookup. The getPropertyValue method is slower than a direct lookup, which is why we avoid it by default. */\r\n\t\t\t\t\t\tif (IE === 9 && property === \"filter\") {\r\n\t\t\t\t\t\t\tcomputedValue = computedStyle.getPropertyValue(property); /* GET */\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tcomputedValue = computedStyle[property];\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Fall back to the property's style value (if defined) when computedValue returns nothing,\r\n\t\t\t\t\t\t which can happen when the element hasn't been painted. */\r\n\t\t\t\t\t\tif (computedValue === \"\" || computedValue === null) {\r\n\t\t\t\t\t\t\tcomputedValue = element.style[property];\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\trevertDisplay();\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* For top, right, bottom, and left (TRBL) values that are set to \"auto\" on elements of \"fixed\" or \"absolute\" position,\r\n\t\t\t\t\t defer to jQuery for converting \"auto\" to a numeric value. (For elements with a \"static\" or \"relative\" position, \"auto\" has the same\r\n\t\t\t\t\t effect as being set to 0, so no conversion is necessary.) */\r\n\t\t\t\t\t/* An example of why numeric conversion is necessary: When an element with \"position:absolute\" has an untouched \"left\"\r\n\t\t\t\t\t property, which reverts to \"auto\", left's value is 0 relative to its parent element, but is often non-zero relative\r\n\t\t\t\t\t to its *containing* (not parent) element, which is the nearest \"position:relative\" ancestor or the viewport (and always the viewport in the case of \"position:fixed\"). */\r\n\t\t\t\t\tif (computedValue === \"auto\" && /^(top|right|bottom|left)$/i.test(property)) {\r\n\t\t\t\t\t\tvar position = computePropertyValue(element, \"position\"); /* GET */\r\n\r\n\t\t\t\t\t\t/* For absolute positioning, jQuery's $.position() only returns values for top and left;\r\n\t\t\t\t\t\t right and bottom will have their \"auto\" value reverted to 0. */\r\n\t\t\t\t\t\t/* Note: A jQuery object must be created here since jQuery doesn't have a low-level alias for $.position().\r\n\t\t\t\t\t\t Not a big deal since we're currently in a GET batch anyway. */\r\n\t\t\t\t\t\tif (position === \"fixed\" || (position === \"absolute\" && /top|left/i.test(property))) {\r\n\t\t\t\t\t\t\t/* Note: jQuery strips the pixel unit from its returned values; we re-add it here to conform with computePropertyValue's behavior. */\r\n\t\t\t\t\t\t\tcomputedValue = $(element).position()[property] + \"px\"; /* GET */\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\treturn computedValue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tvar propertyValue;\r\n\r\n\t\t\t\t/* If this is a hooked property (e.g. \"clipLeft\" instead of the root property of \"clip\"),\r\n\t\t\t\t extract the hook's value from a normalized rootPropertyValue using CSS.Hooks.extractValue(). */\r\n\t\t\t\tif (CSS.Hooks.registered[property]) {\r\n\t\t\t\t\tvar hook = property,\r\n\t\t\t\t\t\t\thookRoot = CSS.Hooks.getRoot(hook);\r\n\r\n\t\t\t\t\t/* If a cached rootPropertyValue wasn't passed in (which Velocity always attempts to do in order to avoid requerying the DOM),\r\n\t\t\t\t\t query the DOM for the root property's value. */\r\n\t\t\t\t\tif (rootPropertyValue === undefined) {\r\n\t\t\t\t\t\t/* Since the browser is now being directly queried, use the official post-prefixing property name for this lookup. */\r\n\t\t\t\t\t\trootPropertyValue = CSS.getPropertyValue(element, CSS.Names.prefixCheck(hookRoot)[0]); /* GET */\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* If this root has a normalization registered, peform the associated normalization extraction. */\r\n\t\t\t\t\tif (CSS.Normalizations.registered[hookRoot]) {\r\n\t\t\t\t\t\trootPropertyValue = CSS.Normalizations.registered[hookRoot](\"extract\", element, rootPropertyValue);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Extract the hook's value. */\r\n\t\t\t\t\tpropertyValue = CSS.Hooks.extractValue(hook, rootPropertyValue);\r\n\r\n\t\t\t\t\t/* If this is a normalized property (e.g. \"opacity\" becomes \"filter\" in <=IE8) or \"translateX\" becomes \"transform\"),\r\n\t\t\t\t\t normalize the property's name and value, and handle the special case of transforms. */\r\n\t\t\t\t\t/* Note: Normalizing a property is mutually exclusive from hooking a property since hook-extracted values are strictly\r\n\t\t\t\t\t numerical and therefore do not require normalization extraction. */\r\n\t\t\t\t} else if (CSS.Normalizations.registered[property]) {\r\n\t\t\t\t\tvar normalizedPropertyName,\r\n\t\t\t\t\t\t\tnormalizedPropertyValue;\r\n\r\n\t\t\t\t\tnormalizedPropertyName = CSS.Normalizations.registered[property](\"name\", element);\r\n\r\n\t\t\t\t\t/* Transform values are calculated via normalization extraction (see below), which checks against the element's transformCache.\r\n\t\t\t\t\t At no point do transform GETs ever actually query the DOM; initial stylesheet values are never processed.\r\n\t\t\t\t\t This is because parsing 3D transform matrices is not always accurate and would bloat our codebase;\r\n\t\t\t\t\t thus, normalization extraction defaults initial transform values to their zero-values (e.g. 1 for scaleX and 0 for translateX). */\r\n\t\t\t\t\tif (normalizedPropertyName !== \"transform\") {\r\n\t\t\t\t\t\tnormalizedPropertyValue = computePropertyValue(element, CSS.Names.prefixCheck(normalizedPropertyName)[0]); /* GET */\r\n\r\n\t\t\t\t\t\t/* If the value is a CSS null-value and this property has a hook template, use that zero-value template so that hooks can be extracted from it. */\r\n\t\t\t\t\t\tif (CSS.Values.isCSSNullValue(normalizedPropertyValue) && CSS.Hooks.templates[property]) {\r\n\t\t\t\t\t\t\tnormalizedPropertyValue = CSS.Hooks.templates[property][1];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tpropertyValue = CSS.Normalizations.registered[property](\"extract\", element, normalizedPropertyValue);\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* If a (numeric) value wasn't produced via hook extraction or normalization, query the DOM. */\r\n\t\t\t\tif (!/^[\\d-]/.test(propertyValue)) {\r\n\t\t\t\t\t/* For SVG elements, dimensional properties (which SVGAttribute() detects) are tweened via\r\n\t\t\t\t\t their HTML attribute values instead of their CSS style values. */\r\n\t\t\t\t\tvar data = Data(element);\r\n\r\n\t\t\t\t\tif (data && data.isSVG && CSS.Names.SVGAttribute(property)) {\r\n\t\t\t\t\t\t/* Since the height/width attribute values must be set manually, they don't reflect computed values.\r\n\t\t\t\t\t\t Thus, we use use getBBox() to ensure we always get values for elements with undefined height/width attributes. */\r\n\t\t\t\t\t\tif (/^(height|width)$/i.test(property)) {\r\n\t\t\t\t\t\t\t/* Firefox throws an error if .getBBox() is called on an SVG that isn't attached to the DOM. */\r\n\t\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\t\tpropertyValue = element.getBBox()[property];\r\n\t\t\t\t\t\t\t} catch (error) {\r\n\t\t\t\t\t\t\t\tpropertyValue = 0;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t/* Otherwise, access the attribute value directly. */\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tpropertyValue = element.getAttribute(property);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tpropertyValue = computePropertyValue(element, CSS.Names.prefixCheck(property)[0]); /* GET */\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Since property lookups are for animation purposes (which entails computing the numeric delta between start and end values),\r\n\t\t\t\t convert CSS null-values to an integer of value 0. */\r\n\t\t\t\tif (CSS.Values.isCSSNullValue(propertyValue)) {\r\n\t\t\t\t\tpropertyValue = 0;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (Velocity.debug >= 2) {\r\n\t\t\t\t\tconsole.log(\"Get \" + property + \": \" + propertyValue);\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn propertyValue;\r\n\t\t\t},\r\n\t\t\t/* The singular setPropertyValue, which routes the logic for all normalizations, hooks, and standard CSS properties. */\r\n\t\t\tsetPropertyValue: function(element, property, propertyValue, rootPropertyValue, scrollData) {\r\n\t\t\t\tvar propertyName = property;\r\n\r\n\t\t\t\t/* In order to be subjected to call options and element queueing, scroll animation is routed through Velocity as if it were a standard CSS property. */\r\n\t\t\t\tif (property === \"scroll\") {\r\n\t\t\t\t\t/* If a container option is present, scroll the container instead of the browser window. */\r\n\t\t\t\t\tif (scrollData.container) {\r\n\t\t\t\t\t\tscrollData.container[\"scroll\" + scrollData.direction] = propertyValue;\r\n\t\t\t\t\t\t/* Otherwise, Velocity defaults to scrolling the browser window. */\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (scrollData.direction === \"Left\") {\r\n\t\t\t\t\t\t\twindow.scrollTo(propertyValue, scrollData.alternateValue);\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\twindow.scrollTo(scrollData.alternateValue, propertyValue);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\t/* Transforms (translateX, rotateZ, etc.) are applied to a per-element transformCache object, which is manually flushed via flushTransformCache().\r\n\t\t\t\t\t Thus, for now, we merely cache transforms being SET. */\r\n\t\t\t\t\tif (CSS.Normalizations.registered[property] && CSS.Normalizations.registered[property](\"name\", element) === \"transform\") {\r\n\t\t\t\t\t\t/* Perform a normalization injection. */\r\n\t\t\t\t\t\t/* Note: The normalization logic handles the transformCache updating. */\r\n\t\t\t\t\t\tCSS.Normalizations.registered[property](\"inject\", element, propertyValue);\r\n\r\n\t\t\t\t\t\tpropertyName = \"transform\";\r\n\t\t\t\t\t\tpropertyValue = Data(element).transformCache[property];\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t/* Inject hooks. */\r\n\t\t\t\t\t\tif (CSS.Hooks.registered[property]) {\r\n\t\t\t\t\t\t\tvar hookName = property,\r\n\t\t\t\t\t\t\t\t\thookRoot = CSS.Hooks.getRoot(property);\r\n\r\n\t\t\t\t\t\t\t/* If a cached rootPropertyValue was not provided, query the DOM for the hookRoot's current value. */\r\n\t\t\t\t\t\t\trootPropertyValue = rootPropertyValue || CSS.getPropertyValue(element, hookRoot); /* GET */\r\n\r\n\t\t\t\t\t\t\tpropertyValue = CSS.Hooks.injectValue(hookName, propertyValue, rootPropertyValue);\r\n\t\t\t\t\t\t\tproperty = hookRoot;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Normalize names and values. */\r\n\t\t\t\t\t\tif (CSS.Normalizations.registered[property]) {\r\n\t\t\t\t\t\t\tpropertyValue = CSS.Normalizations.registered[property](\"inject\", element, propertyValue);\r\n\t\t\t\t\t\t\tproperty = CSS.Normalizations.registered[property](\"name\", element);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Assign the appropriate vendor prefix before performing an official style update. */\r\n\t\t\t\t\t\tpropertyName = CSS.Names.prefixCheck(property)[0];\r\n\r\n\t\t\t\t\t\t/* A try/catch is used for IE<=8, which throws an error when \"invalid\" CSS values are set, e.g. a negative width.\r\n\t\t\t\t\t\t Try/catch is avoided for other browsers since it incurs a performance overhead. */\r\n\t\t\t\t\t\tif (IE <= 8) {\r\n\t\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\t\telement.style[propertyName] = propertyValue;\r\n\t\t\t\t\t\t\t} catch (error) {\r\n\t\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\t\tconsole.log(\"Browser does not support [\" + propertyValue + \"] for [\" + propertyName + \"]\");\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t/* SVG elements have their dimensional properties (width, height, x, y, cx, etc.) applied directly as attributes instead of as styles. */\r\n\t\t\t\t\t\t\t/* Note: IE8 does not support SVG elements, so it's okay that we skip it for SVG animation. */\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tvar data = Data(element);\r\n\r\n\t\t\t\t\t\t\tif (data && data.isSVG && CSS.Names.SVGAttribute(property)) {\r\n\t\t\t\t\t\t\t\t/* Note: For SVG attributes, vendor-prefixed property names are never used. */\r\n\t\t\t\t\t\t\t\t/* Note: Not all CSS properties can be animated via attributes, but the browser won't throw an error for unsupported properties. */\r\n\t\t\t\t\t\t\t\telement.setAttribute(property, propertyValue);\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\telement.style[propertyName] = propertyValue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (Velocity.debug >= 2) {\r\n\t\t\t\t\t\t\tconsole.log(\"Set \" + property + \" (\" + propertyName + \"): \" + propertyValue);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Return the normalized property name and value in case the caller wants to know how these values were modified before being applied to the DOM. */\r\n\t\t\t\treturn [propertyName, propertyValue];\r\n\t\t\t},\r\n\t\t\t/* To increase performance by batching transform updates into a single SET, transforms are not directly applied to an element until flushTransformCache() is called. */\r\n\t\t\t/* Note: Velocity applies transform properties in the same order that they are chronogically introduced to the element's CSS styles. */\r\n\t\t\tflushTransformCache: function(element) {\r\n\t\t\t\tvar transformString = \"\",\r\n\t\t\t\t\t\tdata = Data(element);\r\n\r\n\t\t\t\t/* Certain browsers require that SVG transforms be applied as an attribute. However, the SVG transform attribute takes a modified version of CSS's transform string\r\n\t\t\t\t (units are dropped and, except for skewX/Y, subproperties are merged into their master property -- e.g. scaleX and scaleY are merged into scale(X Y). */\r\n\t\t\t\tif ((IE || (Velocity.State.isAndroid && !Velocity.State.isChrome)) && data && data.isSVG) {\r\n\t\t\t\t\t/* Since transform values are stored in their parentheses-wrapped form, we use a helper function to strip out their numeric values.\r\n\t\t\t\t\t Further, SVG transform properties only take unitless (representing pixels) values, so it's okay that parseFloat() strips the unit suffixed to the float value. */\r\n\t\t\t\t\tvar getTransformFloat = function(transformProperty) {\r\n\t\t\t\t\t\treturn parseFloat(CSS.getPropertyValue(element, transformProperty));\r\n\t\t\t\t\t};\r\n\r\n\t\t\t\t\t/* Create an object to organize all the transforms that we'll apply to the SVG element. To keep the logic simple,\r\n\t\t\t\t\t we process *all* transform properties -- even those that may not be explicitly applied (since they default to their zero-values anyway). */\r\n\t\t\t\t\tvar SVGTransforms = {\r\n\t\t\t\t\t\ttranslate: [getTransformFloat(\"translateX\"), getTransformFloat(\"translateY\")],\r\n\t\t\t\t\t\tskewX: [getTransformFloat(\"skewX\")], skewY: [getTransformFloat(\"skewY\")],\r\n\t\t\t\t\t\t/* If the scale property is set (non-1), use that value for the scaleX and scaleY values\r\n\t\t\t\t\t\t (this behavior mimics the result of animating all these properties at once on HTML elements). */\r\n\t\t\t\t\t\tscale: getTransformFloat(\"scale\") !== 1 ? [getTransformFloat(\"scale\"), getTransformFloat(\"scale\")] : [getTransformFloat(\"scaleX\"), getTransformFloat(\"scaleY\")],\r\n\t\t\t\t\t\t/* Note: SVG's rotate transform takes three values: rotation degrees followed by the X and Y values\r\n\t\t\t\t\t\t defining the rotation's origin point. We ignore the origin values (default them to 0). */\r\n\t\t\t\t\t\trotate: [getTransformFloat(\"rotateZ\"), 0, 0]\r\n\t\t\t\t\t};\r\n\r\n\t\t\t\t\t/* Iterate through the transform properties in the user-defined property map order.\r\n\t\t\t\t\t (This mimics the behavior of non-SVG transform animation.) */\r\n\t\t\t\t\t$.each(Data(element).transformCache, function(transformName) {\r\n\t\t\t\t\t\t/* Except for with skewX/Y, revert the axis-specific transform subproperties to their axis-free master\r\n\t\t\t\t\t\t properties so that they match up with SVG's accepted transform properties. */\r\n\t\t\t\t\t\tif (/^translate/i.test(transformName)) {\r\n\t\t\t\t\t\t\ttransformName = \"translate\";\r\n\t\t\t\t\t\t} else if (/^scale/i.test(transformName)) {\r\n\t\t\t\t\t\t\ttransformName = \"scale\";\r\n\t\t\t\t\t\t} else if (/^rotate/i.test(transformName)) {\r\n\t\t\t\t\t\t\ttransformName = \"rotate\";\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Check that we haven't yet deleted the property from the SVGTransforms container. */\r\n\t\t\t\t\t\tif (SVGTransforms[transformName]) {\r\n\t\t\t\t\t\t\t/* Append the transform property in the SVG-supported transform format. As per the spec, surround the space-delimited values in parentheses. */\r\n\t\t\t\t\t\t\ttransformString += transformName + \"(\" + SVGTransforms[transformName].join(\" \") + \")\" + \" \";\r\n\r\n\t\t\t\t\t\t\t/* After processing an SVG transform property, delete it from the SVGTransforms container so we don't\r\n\t\t\t\t\t\t\t re-insert the same master property if we encounter another one of its axis-specific properties. */\r\n\t\t\t\t\t\t\tdelete SVGTransforms[transformName];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});\r\n\t\t\t\t} else {\r\n\t\t\t\t\tvar transformValue,\r\n\t\t\t\t\t\t\tperspective;\r\n\r\n\t\t\t\t\t/* Transform properties are stored as members of the transformCache object. Concatenate all the members into a string. */\r\n\t\t\t\t\t$.each(Data(element).transformCache, function(transformName) {\r\n\t\t\t\t\t\ttransformValue = Data(element).transformCache[transformName];\r\n\r\n\t\t\t\t\t\t/* Transform's perspective subproperty must be set first in order to take effect. Store it temporarily. */\r\n\t\t\t\t\t\tif (transformName === \"transformPerspective\") {\r\n\t\t\t\t\t\t\tperspective = transformValue;\r\n\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* IE9 only supports one rotation type, rotateZ, which it refers to as \"rotate\". */\r\n\t\t\t\t\t\tif (IE === 9 && transformName === \"rotateZ\") {\r\n\t\t\t\t\t\t\ttransformName = \"rotate\";\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\ttransformString += transformName + transformValue + \" \";\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* If present, set the perspective subproperty first. */\r\n\t\t\t\t\tif (perspective) {\r\n\t\t\t\t\t\ttransformString = \"perspective\" + perspective + \" \" + transformString;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tCSS.setPropertyValue(element, \"transform\", transformString);\r\n\t\t\t}\r\n\t\t};\r\n\r\n\t\t/* Register hooks and normalizations. */\r\n\t\tCSS.Hooks.register();\r\n\t\tCSS.Normalizations.register();\r\n\r\n\t\t/* Allow hook setting in the same fashion as jQuery's $.css(). */\r\n\t\tVelocity.hook = function(elements, arg2, arg3) {\r\n\t\t\tvar value;\r\n\r\n\t\t\telements = sanitizeElements(elements);\r\n\r\n\t\t\t$.each(elements, function(i, element) {\r\n\t\t\t\t/* Initialize Velocity's per-element data cache if this element hasn't previously been animated. */\r\n\t\t\t\tif (Data(element) === undefined) {\r\n\t\t\t\t\tVelocity.init(element);\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Get property value. If an element set was passed in, only return the value for the first element. */\r\n\t\t\t\tif (arg3 === undefined) {\r\n\t\t\t\t\tif (value === undefined) {\r\n\t\t\t\t\t\tvalue = CSS.getPropertyValue(element, arg2);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t/* Set property value. */\r\n\t\t\t\t} else {\r\n\t\t\t\t\t/* sPV returns an array of the normalized propertyName/propertyValue pair used to update the DOM. */\r\n\t\t\t\t\tvar adjustedSet = CSS.setPropertyValue(element, arg2, arg3);\r\n\r\n\t\t\t\t\t/* Transform properties don't automatically set. They have to be flushed to the DOM. */\r\n\t\t\t\t\tif (adjustedSet[0] === \"transform\") {\r\n\t\t\t\t\t\tVelocity.CSS.flushTransformCache(element);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tvalue = adjustedSet;\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\t\treturn value;\r\n\t\t};\r\n\r\n\t\t/*****************\r\n\t\t Animation\r\n\t\t *****************/\r\n\r\n\t\tvar animate = function() {\r\n\t\t\tvar opts;\r\n\r\n\t\t\t/******************\r\n\t\t\t Call Chain\r\n\t\t\t ******************/\r\n\r\n\t\t\t/* Logic for determining what to return to the call stack when exiting out of Velocity. */\r\n\t\t\tfunction getChain() {\r\n\t\t\t\t/* If we are using the utility function, attempt to return this call's promise. If no promise library was detected,\r\n\t\t\t\t default to null instead of returning the targeted elements so that utility function's return value is standardized. */\r\n\t\t\t\tif (isUtility) {\r\n\t\t\t\t\treturn promiseData.promise || null;\r\n\t\t\t\t\t/* Otherwise, if we're using $.fn, return the jQuery-/Zepto-wrapped element set. */\r\n\t\t\t\t} else {\r\n\t\t\t\t\treturn elementsWrapped;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/*************************\r\n\t\t\t Arguments Assignment\r\n\t\t\t *************************/\r\n\r\n\t\t\t/* To allow for expressive CoffeeScript code, Velocity supports an alternative syntax in which \"elements\" (or \"e\"), \"properties\" (or \"p\"), and \"options\" (or \"o\")\r\n\t\t\t objects are defined on a container object that's passed in as Velocity's sole argument. */\r\n\t\t\t/* Note: Some browsers automatically populate arguments with a \"properties\" object. We detect it by checking for its default \"names\" property. */\r\n\t\t\tvar syntacticSugar = (arguments[0] && (arguments[0].p || (($.isPlainObject(arguments[0].properties) && !arguments[0].properties.names) || Type.isString(arguments[0].properties)))),\r\n\t\t\t\t\t/* Whether Velocity was called via the utility function (as opposed to on a jQuery/Zepto object). */\r\n\t\t\t\t\tisUtility,\r\n\t\t\t\t\t/* When Velocity is called via the utility function ($.Velocity()/Velocity()), elements are explicitly\r\n\t\t\t\t\t passed in as the first parameter. Thus, argument positioning varies. We normalize them here. */\r\n\t\t\t\t\telementsWrapped,\r\n\t\t\t\t\targumentIndex;\r\n\r\n\t\t\tvar elements,\r\n\t\t\t\t\tpropertiesMap,\r\n\t\t\t\t\toptions;\r\n\r\n\t\t\t/* Detect jQuery/Zepto elements being animated via the $.fn method. */\r\n\t\t\tif (Type.isWrapped(this)) {\r\n\t\t\t\tisUtility = false;\r\n\r\n\t\t\t\targumentIndex = 0;\r\n\t\t\t\telements = this;\r\n\t\t\t\telementsWrapped = this;\r\n\t\t\t\t/* Otherwise, raw elements are being animated via the utility function. */\r\n\t\t\t} else {\r\n\t\t\t\tisUtility = true;\r\n\r\n\t\t\t\targumentIndex = 1;\r\n\t\t\t\telements = syntacticSugar ? (arguments[0].elements || arguments[0].e) : arguments[0];\r\n\t\t\t}\r\n\r\n\t\t\t/***************\r\n\t\t\t Promises\r\n\t\t\t ***************/\r\n\r\n\t\t\tvar promiseData = {\r\n\t\t\t\tpromise: null,\r\n\t\t\t\tresolver: null,\r\n\t\t\t\trejecter: null\r\n\t\t\t};\r\n\r\n\t\t\t/* If this call was made via the utility function (which is the default method of invocation when jQuery/Zepto are not being used), and if\r\n\t\t\t promise support was detected, create a promise object for this call and store references to its resolver and rejecter methods. The resolve\r\n\t\t\t method is used when a call completes naturally or is prematurely stopped by the user. In both cases, completeCall() handles the associated\r\n\t\t\t call cleanup and promise resolving logic. The reject method is used when an invalid set of arguments is passed into a Velocity call. */\r\n\t\t\t/* Note: Velocity employs a call-based queueing architecture, which means that stopping an animating element actually stops the full call that\r\n\t\t\t triggered it -- not that one element exclusively. Similarly, there is one promise per call, and all elements targeted by a Velocity call are\r\n\t\t\t grouped together for the purposes of resolving and rejecting a promise. */\r\n\t\t\tif (isUtility && Velocity.Promise) {\r\n\t\t\t\tpromiseData.promise = new Velocity.Promise(function(resolve, reject) {\r\n\t\t\t\t\tpromiseData.resolver = resolve;\r\n\t\t\t\t\tpromiseData.rejecter = reject;\r\n\t\t\t\t});\r\n\t\t\t}\r\n\r\n\t\t\tif (syntacticSugar) {\r\n\t\t\t\tpropertiesMap = arguments[0].properties || arguments[0].p;\r\n\t\t\t\toptions = arguments[0].options || arguments[0].o;\r\n\t\t\t} else {\r\n\t\t\t\tpropertiesMap = arguments[argumentIndex];\r\n\t\t\t\toptions = arguments[argumentIndex + 1];\r\n\t\t\t}\r\n\r\n\t\t\telements = sanitizeElements(elements);\r\n\r\n\t\t\tif (!elements) {\r\n\t\t\t\tif (promiseData.promise) {\r\n\t\t\t\t\tif (!propertiesMap || !options || options.promiseRejectEmpty !== false) {\r\n\t\t\t\t\t\tpromiseData.rejecter();\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tpromiseData.resolver();\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\t/* The length of the element set (in the form of a nodeList or an array of elements) is defaulted to 1 in case a\r\n\t\t\t single raw DOM element is passed in (which doesn't contain a length property). */\r\n\t\t\tvar elementsLength = elements.length,\r\n\t\t\t\t\telementsIndex = 0;\r\n\r\n\t\t\t/***************************\r\n\t\t\t Argument Overloading\r\n\t\t\t ***************************/\r\n\r\n\t\t\t/* Support is included for jQuery's argument overloading: $.animate(propertyMap [, duration] [, easing] [, complete]).\r\n\t\t\t Overloading is detected by checking for the absence of an object being passed into options. */\r\n\t\t\t/* Note: The stop/finish/pause/resume actions do not accept animation options, and are therefore excluded from this check. */\r\n\t\t\tif (!/^(stop|finish|finishAll|pause|resume)$/i.test(propertiesMap) && !$.isPlainObject(options)) {\r\n\t\t\t\t/* The utility function shifts all arguments one position to the right, so we adjust for that offset. */\r\n\t\t\t\tvar startingArgumentPosition = argumentIndex + 1;\r\n\r\n\t\t\t\toptions = {};\r\n\r\n\t\t\t\t/* Iterate through all options arguments */\r\n\t\t\t\tfor (var i = startingArgumentPosition; i < arguments.length; i++) {\r\n\t\t\t\t\t/* Treat a number as a duration. Parse it out. */\r\n\t\t\t\t\t/* Note: The following RegEx will return true if passed an array with a number as its first item.\r\n\t\t\t\t\t Thus, arrays are skipped from this check. */\r\n\t\t\t\t\tif (!Type.isArray(arguments[i]) && (/^(fast|normal|slow)$/i.test(arguments[i]) || /^\\d/.test(arguments[i]))) {\r\n\t\t\t\t\t\toptions.duration = arguments[i];\r\n\t\t\t\t\t\t/* Treat strings and arrays as easings. */\r\n\t\t\t\t\t} else if (Type.isString(arguments[i]) || Type.isArray(arguments[i])) {\r\n\t\t\t\t\t\toptions.easing = arguments[i];\r\n\t\t\t\t\t\t/* Treat a function as a complete callback. */\r\n\t\t\t\t\t} else if (Type.isFunction(arguments[i])) {\r\n\t\t\t\t\t\toptions.complete = arguments[i];\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/*********************\r\n\t\t\t Action Detection\r\n\t\t\t *********************/\r\n\r\n\t\t\t/* Velocity's behavior is categorized into \"actions\": Elements can either be specially scrolled into view,\r\n\t\t\t or they can be started, stopped, paused, resumed, or reversed . If a literal or referenced properties map is passed in as Velocity's\r\n\t\t\t first argument, the associated action is \"start\". Alternatively, \"scroll\", \"reverse\", \"pause\", \"resume\" or \"stop\" can be passed in \r\n\t\t\t instead of a properties map. */\r\n\t\t\tvar action;\r\n\r\n\t\t\tswitch (propertiesMap) {\r\n\t\t\t\tcase \"scroll\":\r\n\t\t\t\t\taction = \"scroll\";\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\tcase \"reverse\":\r\n\t\t\t\t\taction = \"reverse\";\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t\tcase \"pause\":\r\n\r\n\t\t\t\t\t/*******************\r\n\t\t\t\t\t Action: Pause\r\n\t\t\t\t\t *******************/\r\n\r\n\t\t\t\t\tvar currentTime = (new Date()).getTime();\r\n\r\n\t\t\t\t\t/* Handle delay timers */\r\n\t\t\t\t\t$.each(elements, function(i, element) {\r\n\t\t\t\t\t\tpauseDelayOnElement(element, currentTime);\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* Pause and Resume are call-wide (not on a per element basis). Thus, calling pause or resume on a \r\n\t\t\t\t\t single element will cause any calls that containt tweens for that element to be paused/resumed\r\n\t\t\t\t\t as well. */\r\n\r\n\t\t\t\t\t/* Iterate through all calls and pause any that contain any of our elements */\r\n\t\t\t\t\t$.each(Velocity.State.calls, function(i, activeCall) {\r\n\r\n\t\t\t\t\t\tvar found = false;\r\n\t\t\t\t\t\t/* Inactive calls are set to false by the logic inside completeCall(). Skip them. */\r\n\t\t\t\t\t\tif (activeCall) {\r\n\t\t\t\t\t\t\t/* Iterate through the active call's targeted elements. */\r\n\t\t\t\t\t\t\t$.each(activeCall[1], function(k, activeElement) {\r\n\t\t\t\t\t\t\t\tvar queueName = (options === undefined) ? \"\" : options;\r\n\r\n\t\t\t\t\t\t\t\tif (queueName !== true && (activeCall[2].queue !== queueName) && !(options === undefined && activeCall[2].queue === false)) {\r\n\t\t\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* Iterate through the calls targeted by the stop command. */\r\n\t\t\t\t\t\t\t\t$.each(elements, function(l, element) {\r\n\t\t\t\t\t\t\t\t\t/* Check that this call was applied to the target element. */\r\n\t\t\t\t\t\t\t\t\tif (element === activeElement) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Set call to paused */\r\n\t\t\t\t\t\t\t\t\t\tactiveCall[5] = {\r\n\t\t\t\t\t\t\t\t\t\t\tresume: false\r\n\t\t\t\t\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Once we match an element, we can bounce out to the next call entirely */\r\n\t\t\t\t\t\t\t\t\t\tfound = true;\r\n\t\t\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\t\t/* Proceed to check next call if we have already matched */\r\n\t\t\t\t\t\t\t\tif (found) {\r\n\t\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* Since pause creates no new tweens, exit out of Velocity. */\r\n\t\t\t\t\treturn getChain();\r\n\r\n\t\t\t\tcase \"resume\":\r\n\r\n\t\t\t\t\t/*******************\r\n\t\t\t\t\t Action: Resume\r\n\t\t\t\t\t *******************/\r\n\r\n\t\t\t\t\t/* Handle delay timers */\r\n\t\t\t\t\t$.each(elements, function(i, element) {\r\n\t\t\t\t\t\tresumeDelayOnElement(element, currentTime);\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* Pause and Resume are call-wide (not on a per elemnt basis). Thus, calling pause or resume on a \r\n\t\t\t\t\t single element will cause any calls that containt tweens for that element to be paused/resumed\r\n\t\t\t\t\t as well. */\r\n\r\n\t\t\t\t\t/* Iterate through all calls and pause any that contain any of our elements */\r\n\t\t\t\t\t$.each(Velocity.State.calls, function(i, activeCall) {\r\n\t\t\t\t\t\tvar found = false;\r\n\t\t\t\t\t\t/* Inactive calls are set to false by the logic inside completeCall(). Skip them. */\r\n\t\t\t\t\t\tif (activeCall) {\r\n\t\t\t\t\t\t\t/* Iterate through the active call's targeted elements. */\r\n\t\t\t\t\t\t\t$.each(activeCall[1], function(k, activeElement) {\r\n\t\t\t\t\t\t\t\tvar queueName = (options === undefined) ? \"\" : options;\r\n\r\n\t\t\t\t\t\t\t\tif (queueName !== true && (activeCall[2].queue !== queueName) && !(options === undefined && activeCall[2].queue === false)) {\r\n\t\t\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* Skip any calls that have never been paused */\r\n\t\t\t\t\t\t\t\tif (!activeCall[5]) {\r\n\t\t\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* Iterate through the calls targeted by the stop command. */\r\n\t\t\t\t\t\t\t\t$.each(elements, function(l, element) {\r\n\t\t\t\t\t\t\t\t\t/* Check that this call was applied to the target element. */\r\n\t\t\t\t\t\t\t\t\tif (element === activeElement) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Flag a pause object to be resumed, which will occur during the next tick. In\r\n\t\t\t\t\t\t\t\t\t\t addition, the pause object will at that time be deleted */\r\n\t\t\t\t\t\t\t\t\t\tactiveCall[5].resume = true;\r\n\r\n\t\t\t\t\t\t\t\t\t\t/* Once we match an element, we can bounce out to the next call entirely */\r\n\t\t\t\t\t\t\t\t\t\tfound = true;\r\n\t\t\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\t\t/* Proceed to check next call if we have already matched */\r\n\t\t\t\t\t\t\t\tif (found) {\r\n\t\t\t\t\t\t\t\t\treturn false;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* Since resume creates no new tweens, exit out of Velocity. */\r\n\t\t\t\t\treturn getChain();\r\n\r\n\t\t\t\tcase \"finish\":\r\n\t\t\t\tcase \"finishAll\":\r\n\t\t\t\tcase \"stop\":\r\n\t\t\t\t\t/*******************\r\n\t\t\t\t\t Action: Stop\r\n\t\t\t\t\t *******************/\r\n\r\n\t\t\t\t\t/* Clear the currently-active delay on each targeted element. */\r\n\t\t\t\t\t$.each(elements, function(i, element) {\r\n\t\t\t\t\t\tif (Data(element) && Data(element).delayTimer) {\r\n\t\t\t\t\t\t\t/* Stop the timer from triggering its cached next() function. */\r\n\t\t\t\t\t\t\tclearTimeout(Data(element).delayTimer.setTimeout);\r\n\r\n\t\t\t\t\t\t\t/* Manually call the next() function so that the subsequent queue items can progress. */\r\n\t\t\t\t\t\t\tif (Data(element).delayTimer.next) {\r\n\t\t\t\t\t\t\t\tData(element).delayTimer.next();\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tdelete Data(element).delayTimer;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* If we want to finish everything in the queue, we have to iterate through it\r\n\t\t\t\t\t\t and call each function. This will make them active calls below, which will\r\n\t\t\t\t\t\t cause them to be applied via the duration setting. */\r\n\t\t\t\t\t\tif (propertiesMap === \"finishAll\" && (options === true || Type.isString(options))) {\r\n\t\t\t\t\t\t\t/* Iterate through the items in the element's queue. */\r\n\t\t\t\t\t\t\t$.each($.queue(element, Type.isString(options) ? options : \"\"), function(_, item) {\r\n\t\t\t\t\t\t\t\t/* The queue array can contain an \"inprogress\" string, which we skip. */\r\n\t\t\t\t\t\t\t\tif (Type.isFunction(item)) {\r\n\t\t\t\t\t\t\t\t\titem();\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\t/* Clearing the $.queue() array is achieved by resetting it to []. */\r\n\t\t\t\t\t\t\t$.queue(element, Type.isString(options) ? options : \"\", []);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\tvar callsToStop = [];\r\n\r\n\t\t\t\t\t/* When the stop action is triggered, the elements' currently active call is immediately stopped. The active call might have\r\n\t\t\t\t\t been applied to multiple elements, in which case all of the call's elements will be stopped. When an element\r\n\t\t\t\t\t is stopped, the next item in its animation queue is immediately triggered. */\r\n\t\t\t\t\t/* An additional argument may be passed in to clear an element's remaining queued calls. Either true (which defaults to the \"fx\" queue)\r\n\t\t\t\t\t or a custom queue string can be passed in. */\r\n\t\t\t\t\t/* Note: The stop command runs prior to Velocity's Queueing phase since its behavior is intended to take effect *immediately*,\r\n\t\t\t\t\t regardless of the element's current queue state. */\r\n\r\n\t\t\t\t\t/* Iterate through every active call. */\r\n\t\t\t\t\t$.each(Velocity.State.calls, function(i, activeCall) {\r\n\t\t\t\t\t\t/* Inactive calls are set to false by the logic inside completeCall(). Skip them. */\r\n\t\t\t\t\t\tif (activeCall) {\r\n\t\t\t\t\t\t\t/* Iterate through the active call's targeted elements. */\r\n\t\t\t\t\t\t\t$.each(activeCall[1], function(k, activeElement) {\r\n\t\t\t\t\t\t\t\t/* If true was passed in as a secondary argument, clear absolutely all calls on this element. Otherwise, only\r\n\t\t\t\t\t\t\t\t clear calls associated with the relevant queue. */\r\n\t\t\t\t\t\t\t\t/* Call stopping logic works as follows:\r\n\t\t\t\t\t\t\t\t - options === true --> stop current default queue calls (and queue:false calls), including remaining queued ones.\r\n\t\t\t\t\t\t\t\t - options === undefined --> stop current queue:\"\" call and all queue:false calls.\r\n\t\t\t\t\t\t\t\t - options === false --> stop only queue:false calls.\r\n\t\t\t\t\t\t\t\t - options === \"custom\" --> stop current queue:\"custom\" call, including remaining queued ones (there is no functionality to only clear the currently-running queue:\"custom\" call). */\r\n\t\t\t\t\t\t\t\tvar queueName = (options === undefined) ? \"\" : options;\r\n\r\n\t\t\t\t\t\t\t\tif (queueName !== true && (activeCall[2].queue !== queueName) && !(options === undefined && activeCall[2].queue === false)) {\r\n\t\t\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* Iterate through the calls targeted by the stop command. */\r\n\t\t\t\t\t\t\t\t$.each(elements, function(l, element) {\r\n\t\t\t\t\t\t\t\t\t/* Check that this call was applied to the target element. */\r\n\t\t\t\t\t\t\t\t\tif (element === activeElement) {\r\n\t\t\t\t\t\t\t\t\t\t/* Optionally clear the remaining queued calls. If we're doing \"finishAll\" this won't find anything,\r\n\t\t\t\t\t\t\t\t\t\t due to the queue-clearing above. */\r\n\t\t\t\t\t\t\t\t\t\tif (options === true || Type.isString(options)) {\r\n\t\t\t\t\t\t\t\t\t\t\t/* Iterate through the items in the element's queue. */\r\n\t\t\t\t\t\t\t\t\t\t\t$.each($.queue(element, Type.isString(options) ? options : \"\"), function(_, item) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t/* The queue array can contain an \"inprogress\" string, which we skip. */\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (Type.isFunction(item)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t/* Pass the item's callback a flag indicating that we want to abort from the queue call.\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t (Specifically, the queue will resolve the call's associated promise then abort.)  */\r\n\t\t\t\t\t\t\t\t\t\t\t\t\titem(null, true);\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t/* Clearing the $.queue() array is achieved by resetting it to []. */\r\n\t\t\t\t\t\t\t\t\t\t\t$.queue(element, Type.isString(options) ? options : \"\", []);\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (propertiesMap === \"stop\") {\r\n\t\t\t\t\t\t\t\t\t\t\t/* Since \"reverse\" uses cached start values (the previous call's endValues), these values must be\r\n\t\t\t\t\t\t\t\t\t\t\t changed to reflect the final value that the elements were actually tweened to. */\r\n\t\t\t\t\t\t\t\t\t\t\t/* Note: If only queue:false/queue:\"custom\" animations are currently running on an element, it won't have a tweensContainer\r\n\t\t\t\t\t\t\t\t\t\t\t object. Also, queue:false/queue:\"custom\" animations can't be reversed. */\r\n\t\t\t\t\t\t\t\t\t\t\tvar data = Data(element);\r\n\t\t\t\t\t\t\t\t\t\t\tif (data && data.tweensContainer && (queueName === true || queueName === \"\")) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t$.each(data.tweensContainer, function(m, activeTween) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tactiveTween.endValue = activeTween.currentValue;\r\n\t\t\t\t\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tcallsToStop.push(i);\r\n\t\t\t\t\t\t\t\t\t\t} else if (propertiesMap === \"finish\" || propertiesMap === \"finishAll\") {\r\n\t\t\t\t\t\t\t\t\t\t\t/* To get active tweens to finish immediately, we forcefully shorten their durations to 1ms so that\r\n\t\t\t\t\t\t\t\t\t\t\t they finish upon the next rAf tick then proceed with normal call completion logic. */\r\n\t\t\t\t\t\t\t\t\t\t\tactiveCall[2].duration = 1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\t/* Prematurely call completeCall() on each matched active call. Pass an additional flag for \"stop\" to indicate\r\n\t\t\t\t\t that the complete callback and display:none setting should be skipped since we're completing prematurely. */\r\n\t\t\t\t\tif (propertiesMap === \"stop\") {\r\n\t\t\t\t\t\t$.each(callsToStop, function(i, j) {\r\n\t\t\t\t\t\t\tcompleteCall(j, true);\r\n\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\tif (promiseData.promise) {\r\n\t\t\t\t\t\t\t/* Immediately resolve the promise associated with this stop call since stop runs synchronously. */\r\n\t\t\t\t\t\t\tpromiseData.resolver(elements);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Since we're stopping, and not proceeding with queueing, exit out of Velocity. */\r\n\t\t\t\t\treturn getChain();\r\n\r\n\t\t\t\tdefault:\r\n\t\t\t\t\t/* Treat a non-empty plain object as a literal properties map. */\r\n\t\t\t\t\tif ($.isPlainObject(propertiesMap) && !Type.isEmptyObject(propertiesMap)) {\r\n\t\t\t\t\t\taction = \"start\";\r\n\r\n\t\t\t\t\t\t/****************\r\n\t\t\t\t\t\t Redirects\r\n\t\t\t\t\t\t ****************/\r\n\r\n\t\t\t\t\t\t/* Check if a string matches a registered redirect (see Redirects above). */\r\n\t\t\t\t\t} else if (Type.isString(propertiesMap) && Velocity.Redirects[propertiesMap]) {\r\n\t\t\t\t\t\topts = $.extend({}, options);\r\n\r\n\t\t\t\t\t\tvar durationOriginal = opts.duration,\r\n\t\t\t\t\t\t\t\tdelayOriginal = opts.delay || 0;\r\n\r\n\t\t\t\t\t\t/* If the backwards option was passed in, reverse the element set so that elements animate from the last to the first. */\r\n\t\t\t\t\t\tif (opts.backwards === true) {\r\n\t\t\t\t\t\t\telements = $.extend(true, [], elements).reverse();\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Individually trigger the redirect for each element in the set to prevent users from having to handle iteration logic in their redirect. */\r\n\t\t\t\t\t\t$.each(elements, function(elementIndex, element) {\r\n\t\t\t\t\t\t\t/* If the stagger option was passed in, successively delay each element by the stagger value (in ms). Retain the original delay value. */\r\n\t\t\t\t\t\t\tif (parseFloat(opts.stagger)) {\r\n\t\t\t\t\t\t\t\topts.delay = delayOriginal + (parseFloat(opts.stagger) * elementIndex);\r\n\t\t\t\t\t\t\t} else if (Type.isFunction(opts.stagger)) {\r\n\t\t\t\t\t\t\t\topts.delay = delayOriginal + opts.stagger.call(element, elementIndex, elementsLength);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* If the drag option was passed in, successively increase/decrease (depending on the presense of opts.backwards)\r\n\t\t\t\t\t\t\t the duration of each element's animation, using floors to prevent producing very short durations. */\r\n\t\t\t\t\t\t\tif (opts.drag) {\r\n\t\t\t\t\t\t\t\t/* Default the duration of UI pack effects (callouts and transitions) to 1000ms instead of the usual default duration of 400ms. */\r\n\t\t\t\t\t\t\t\topts.duration = parseFloat(durationOriginal) || (/^(callout|transition)/.test(propertiesMap) ? 1000 : DURATION_DEFAULT);\r\n\r\n\t\t\t\t\t\t\t\t/* For each element, take the greater duration of: A) animation completion percentage relative to the original duration,\r\n\t\t\t\t\t\t\t\t B) 75% of the original duration, or C) a 200ms fallback (in case duration is already set to a low value).\r\n\t\t\t\t\t\t\t\t The end result is a baseline of 75% of the redirect's duration that increases/decreases as the end of the element set is approached. */\r\n\t\t\t\t\t\t\t\topts.duration = Math.max(opts.duration * (opts.backwards ? 1 - elementIndex / elementsLength : (elementIndex + 1) / elementsLength), opts.duration * 0.75, 200);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Pass in the call's opts object so that the redirect can optionally extend it. It defaults to an empty object instead of null to\r\n\t\t\t\t\t\t\t reduce the opts checking logic required inside the redirect. */\r\n\t\t\t\t\t\t\tVelocity.Redirects[propertiesMap].call(element, element, opts || {}, elementIndex, elementsLength, elements, promiseData.promise ? promiseData : undefined);\r\n\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t/* Since the animation logic resides within the redirect's own code, abort the remainder of this call.\r\n\t\t\t\t\t\t (The performance overhead up to this point is virtually non-existant.) */\r\n\t\t\t\t\t\t/* Note: The jQuery call chain is kept intact by returning the complete element set. */\r\n\t\t\t\t\t\treturn getChain();\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tvar abortError = \"Velocity: First argument (\" + propertiesMap + \") was not a property map, a known action, or a registered redirect. Aborting.\";\r\n\r\n\t\t\t\t\t\tif (promiseData.promise) {\r\n\t\t\t\t\t\t\tpromiseData.rejecter(new Error(abortError));\r\n\t\t\t\t\t\t} else if (window.console) {\r\n\t\t\t\t\t\t\tconsole.log(abortError);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\treturn getChain();\r\n\t\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/**************************\r\n\t\t\t Call-Wide Variables\r\n\t\t\t **************************/\r\n\r\n\t\t\t/* A container for CSS unit conversion ratios (e.g. %, rem, and em ==> px) that is used to cache ratios across all elements\r\n\t\t\t being animated in a single Velocity call. Calculating unit ratios necessitates DOM querying and updating, and is therefore\r\n\t\t\t avoided (via caching) wherever possible. This container is call-wide instead of page-wide to avoid the risk of using stale\r\n\t\t\t conversion metrics across Velocity animations that are not immediately consecutively chained. */\r\n\t\t\tvar callUnitConversionData = {\r\n\t\t\t\tlastParent: null,\r\n\t\t\t\tlastPosition: null,\r\n\t\t\t\tlastFontSize: null,\r\n\t\t\t\tlastPercentToPxWidth: null,\r\n\t\t\t\tlastPercentToPxHeight: null,\r\n\t\t\t\tlastEmToPx: null,\r\n\t\t\t\tremToPx: null,\r\n\t\t\t\tvwToPx: null,\r\n\t\t\t\tvhToPx: null\r\n\t\t\t};\r\n\r\n\t\t\t/* A container for all the ensuing tween data and metadata associated with this call. This container gets pushed to the page-wide\r\n\t\t\t Velocity.State.calls array that is processed during animation ticking. */\r\n\t\t\tvar call = [];\r\n\r\n\t\t\t/************************\r\n\t\t\t Element Processing\r\n\t\t\t ************************/\r\n\r\n\t\t\t/* Element processing consists of three parts -- data processing that cannot go stale and data processing that *can* go stale (i.e. third-party style modifications):\r\n\t\t\t 1) Pre-Queueing: Element-wide variables, including the element's data storage, are instantiated. Call options are prepared. If triggered, the Stop action is executed.\r\n\t\t\t 2) Queueing: The logic that runs once this call has reached its point of execution in the element's $.queue() stack. Most logic is placed here to avoid risking it becoming stale.\r\n\t\t\t 3) Pushing: Consolidation of the tween data followed by its push onto the global in-progress calls container.\r\n\t\t\t `elementArrayIndex` allows passing index of the element in the original array to value functions.\r\n\t\t\t If `elementsIndex` were used instead the index would be determined by the elements' per-element queue.\r\n\t\t\t */\r\n\t\t\tfunction processElement(element, elementArrayIndex) {\r\n\r\n\t\t\t\t/*************************\r\n\t\t\t\t Part I: Pre-Queueing\r\n\t\t\t\t *************************/\r\n\r\n\t\t\t\t/***************************\r\n\t\t\t\t Element-Wide Variables\r\n\t\t\t\t ***************************/\r\n\r\n\t\t\t\tvar /* The runtime opts object is the extension of the current call's options and Velocity's page-wide option defaults. */\r\n\t\t\t\t\t\topts = $.extend({}, Velocity.defaults, options),\r\n\t\t\t\t\t\t/* A container for the processed data associated with each property in the propertyMap.\r\n\t\t\t\t\t\t (Each property in the map produces its own \"tween\".) */\r\n\t\t\t\t\t\ttweensContainer = {},\r\n\t\t\t\t\t\telementUnitConversionData;\r\n\r\n\t\t\t\t/******************\r\n\t\t\t\t Element Init\r\n\t\t\t\t ******************/\r\n\r\n\t\t\t\tif (Data(element) === undefined) {\r\n\t\t\t\t\tVelocity.init(element);\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/******************\r\n\t\t\t\t Option: Delay\r\n\t\t\t\t ******************/\r\n\r\n\t\t\t\t/* Since queue:false doesn't respect the item's existing queue, we avoid injecting its delay here (it's set later on). */\r\n\t\t\t\t/* Note: Velocity rolls its own delay function since jQuery doesn't have a utility alias for $.fn.delay()\r\n\t\t\t\t (and thus requires jQuery element creation, which we avoid since its overhead includes DOM querying). */\r\n\t\t\t\tif (parseFloat(opts.delay) && opts.queue !== false) {\r\n\t\t\t\t\t$.queue(element, opts.queue, function(next, clearQueue) {\r\n\t\t\t\t\t\tif (clearQueue === true) {\r\n\t\t\t\t\t\t\t/* Do not continue with animation queueing. */\r\n\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* This is a flag used to indicate to the upcoming completeCall() function that this queue entry was initiated by Velocity. See completeCall() for further details. */\r\n\t\t\t\t\t\tVelocity.velocityQueueEntryFlag = true;\r\n\r\n\t\t\t\t\t\t/* The ensuing queue item (which is assigned to the \"next\" argument that $.queue() automatically passes in) will be triggered after a setTimeout delay.\r\n\t\t\t\t\t\t The setTimeout is stored so that it can be subjected to clearTimeout() if this animation is prematurely stopped via Velocity's \"stop\" command, and\r\n\t\t\t\t\t\t delayBegin/delayTime is used to ensure we can \"pause\" and \"resume\" a tween that is still mid-delay. */\r\n\r\n\t\t\t\t\t\t/* Temporarily store delayed elements to facilite access for global pause/resume */\r\n\t\t\t\t\t\tvar callIndex = Velocity.State.delayedElements.count++;\r\n\t\t\t\t\t\tVelocity.State.delayedElements[callIndex] = element;\r\n\r\n\t\t\t\t\t\tvar delayComplete = (function(index) {\r\n\t\t\t\t\t\t\treturn function() {\r\n\t\t\t\t\t\t\t\t/* Clear the temporary element */\r\n\t\t\t\t\t\t\t\tVelocity.State.delayedElements[index] = false;\r\n\r\n\t\t\t\t\t\t\t\t/* Finally, issue the call */\r\n\t\t\t\t\t\t\t\tnext();\r\n\t\t\t\t\t\t\t};\r\n\t\t\t\t\t\t})(callIndex);\r\n\r\n\r\n\t\t\t\t\t\tData(element).delayBegin = (new Date()).getTime();\r\n\t\t\t\t\t\tData(element).delay = parseFloat(opts.delay);\r\n\t\t\t\t\t\tData(element).delayTimer = {\r\n\t\t\t\t\t\t\tsetTimeout: setTimeout(next, parseFloat(opts.delay)),\r\n\t\t\t\t\t\t\tnext: delayComplete\r\n\t\t\t\t\t\t};\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/*********************\r\n\t\t\t\t Option: Duration\r\n\t\t\t\t *********************/\r\n\r\n\t\t\t\t/* Support for jQuery's named durations. */\r\n\t\t\t\tswitch (opts.duration.toString().toLowerCase()) {\r\n\t\t\t\t\tcase \"fast\":\r\n\t\t\t\t\t\topts.duration = 200;\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tcase \"normal\":\r\n\t\t\t\t\t\topts.duration = DURATION_DEFAULT;\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tcase \"slow\":\r\n\t\t\t\t\t\topts.duration = 600;\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t/* Remove the potential \"ms\" suffix and default to 1 if the user is attempting to set a duration of 0 (in order to produce an immediate style change). */\r\n\t\t\t\t\t\topts.duration = parseFloat(opts.duration) || 1;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/************************\r\n\t\t\t\t Global Option: Mock\r\n\t\t\t\t ************************/\r\n\r\n\t\t\t\tif (Velocity.mock !== false) {\r\n\t\t\t\t\t/* In mock mode, all animations are forced to 1ms so that they occur immediately upon the next rAF tick.\r\n\t\t\t\t\t Alternatively, a multiplier can be passed in to time remap all delays and durations. */\r\n\t\t\t\t\tif (Velocity.mock === true) {\r\n\t\t\t\t\t\topts.duration = opts.delay = 1;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\topts.duration *= parseFloat(Velocity.mock) || 1;\r\n\t\t\t\t\t\topts.delay *= parseFloat(Velocity.mock) || 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/*******************\r\n\t\t\t\t Option: Easing\r\n\t\t\t\t *******************/\r\n\r\n\t\t\t\topts.easing = getEasing(opts.easing, opts.duration);\r\n\r\n\t\t\t\t/**********************\r\n\t\t\t\t Option: Callbacks\r\n\t\t\t\t **********************/\r\n\r\n\t\t\t\t/* Callbacks must functions. Otherwise, default to null. */\r\n\t\t\t\tif (opts.begin && !Type.isFunction(opts.begin)) {\r\n\t\t\t\t\topts.begin = null;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (opts.progress && !Type.isFunction(opts.progress)) {\r\n\t\t\t\t\topts.progress = null;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (opts.complete && !Type.isFunction(opts.complete)) {\r\n\t\t\t\t\topts.complete = null;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/*********************************\r\n\t\t\t\t Option: Display & Visibility\r\n\t\t\t\t *********************************/\r\n\r\n\t\t\t\t/* Refer to Velocity's documentation (VelocityJS.org/#displayAndVisibility) for a description of the display and visibility options' behavior. */\r\n\t\t\t\t/* Note: We strictly check for undefined instead of falsiness because display accepts an empty string value. */\r\n\t\t\t\tif (opts.display !== undefined && opts.display !== null) {\r\n\t\t\t\t\topts.display = opts.display.toString().toLowerCase();\r\n\r\n\t\t\t\t\t/* Users can pass in a special \"auto\" value to instruct Velocity to set the element to its default display value. */\r\n\t\t\t\t\tif (opts.display === \"auto\") {\r\n\t\t\t\t\t\topts.display = Velocity.CSS.Values.getDisplayType(element);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (opts.visibility !== undefined && opts.visibility !== null) {\r\n\t\t\t\t\topts.visibility = opts.visibility.toString().toLowerCase();\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/**********************\r\n\t\t\t\t Option: mobileHA\r\n\t\t\t\t **********************/\r\n\r\n\t\t\t\t/* When set to true, and if this is a mobile device, mobileHA automatically enables hardware acceleration (via a null transform hack)\r\n\t\t\t\t on animating elements. HA is removed from the element at the completion of its animation. */\r\n\t\t\t\t/* Note: Android Gingerbread doesn't support HA. If a null transform hack (mobileHA) is in fact set, it will prevent other tranform subproperties from taking effect. */\r\n\t\t\t\t/* Note: You can read more about the use of mobileHA in Velocity's documentation: VelocityJS.org/#mobileHA. */\r\n\t\t\t\topts.mobileHA = (opts.mobileHA && Velocity.State.isMobile && !Velocity.State.isGingerbread);\r\n\r\n\t\t\t\t/***********************\r\n\t\t\t\t Part II: Queueing\r\n\t\t\t\t ***********************/\r\n\r\n\t\t\t\t/* When a set of elements is targeted by a Velocity call, the set is broken up and each element has the current Velocity call individually queued onto it.\r\n\t\t\t\t In this way, each element's existing queue is respected; some elements may already be animating and accordingly should not have this current Velocity call triggered immediately. */\r\n\t\t\t\t/* In each queue, tween data is processed for each animating property then pushed onto the call-wide calls array. When the last element in the set has had its tweens processed,\r\n\t\t\t\t the call array is pushed to Velocity.State.calls for live processing by the requestAnimationFrame tick. */\r\n\t\t\t\tfunction buildQueue(next) {\r\n\t\t\t\t\tvar data, lastTweensContainer;\r\n\r\n\t\t\t\t\t/*******************\r\n\t\t\t\t\t Option: Begin\r\n\t\t\t\t\t *******************/\r\n\r\n\t\t\t\t\t/* The begin callback is fired once per call -- not once per elemenet -- and is passed the full raw DOM element set as both its context and its first argument. */\r\n\t\t\t\t\tif (opts.begin && elementsIndex === 0) {\r\n\t\t\t\t\t\t/* We throw callbacks in a setTimeout so that thrown errors don't halt the execution of Velocity itself. */\r\n\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\topts.begin.call(elements, elements);\r\n\t\t\t\t\t\t} catch (error) {\r\n\t\t\t\t\t\t\tsetTimeout(function() {\r\n\t\t\t\t\t\t\t\tthrow error;\r\n\t\t\t\t\t\t\t}, 1);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/*****************************************\r\n\t\t\t\t\t Tween Data Construction (for Scroll)\r\n\t\t\t\t\t *****************************************/\r\n\r\n\t\t\t\t\t/* Note: In order to be subjected to chaining and animation options, scroll's tweening is routed through Velocity as if it were a standard CSS property animation. */\r\n\t\t\t\t\tif (action === \"scroll\") {\r\n\t\t\t\t\t\t/* The scroll action uniquely takes an optional \"offset\" option -- specified in pixels -- that offsets the targeted scroll position. */\r\n\t\t\t\t\t\tvar scrollDirection = (/^x$/i.test(opts.axis) ? \"Left\" : \"Top\"),\r\n\t\t\t\t\t\t\t\tscrollOffset = parseFloat(opts.offset) || 0,\r\n\t\t\t\t\t\t\t\tscrollPositionCurrent,\r\n\t\t\t\t\t\t\t\tscrollPositionCurrentAlternate,\r\n\t\t\t\t\t\t\t\tscrollPositionEnd;\r\n\r\n\t\t\t\t\t\t/* Scroll also uniquely takes an optional \"container\" option, which indicates the parent element that should be scrolled --\r\n\t\t\t\t\t\t as opposed to the browser window itself. This is useful for scrolling toward an element that's inside an overflowing parent element. */\r\n\t\t\t\t\t\tif (opts.container) {\r\n\t\t\t\t\t\t\t/* Ensure that either a jQuery object or a raw DOM element was passed in. */\r\n\t\t\t\t\t\t\tif (Type.isWrapped(opts.container) || Type.isNode(opts.container)) {\r\n\t\t\t\t\t\t\t\t/* Extract the raw DOM element from the jQuery wrapper. */\r\n\t\t\t\t\t\t\t\topts.container = opts.container[0] || opts.container;\r\n\t\t\t\t\t\t\t\t/* Note: Unlike other properties in Velocity, the browser's scroll position is never cached since it so frequently changes\r\n\t\t\t\t\t\t\t\t (due to the user's natural interaction with the page). */\r\n\t\t\t\t\t\t\t\tscrollPositionCurrent = opts.container[\"scroll\" + scrollDirection]; /* GET */\r\n\r\n\t\t\t\t\t\t\t\t/* $.position() values are relative to the container's currently viewable area (without taking into account the container's true dimensions\r\n\t\t\t\t\t\t\t\t -- say, for example, if the container was not overflowing). Thus, the scroll end value is the sum of the child element's position *and*\r\n\t\t\t\t\t\t\t\t the scroll container's current scroll position. */\r\n\t\t\t\t\t\t\t\tscrollPositionEnd = (scrollPositionCurrent + $(element).position()[scrollDirection.toLowerCase()]) + scrollOffset; /* GET */\r\n\t\t\t\t\t\t\t\t/* If a value other than a jQuery object or a raw DOM element was passed in, default to null so that this option is ignored. */\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\topts.container = null;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t/* If the window itself is being scrolled -- not a containing element -- perform a live scroll position lookup using\r\n\t\t\t\t\t\t\t the appropriate cached property names (which differ based on browser type). */\r\n\t\t\t\t\t\t\tscrollPositionCurrent = Velocity.State.scrollAnchor[Velocity.State[\"scrollProperty\" + scrollDirection]]; /* GET */\r\n\t\t\t\t\t\t\t/* When scrolling the browser window, cache the alternate axis's current value since window.scrollTo() doesn't let us change only one value at a time. */\r\n\t\t\t\t\t\t\tscrollPositionCurrentAlternate = Velocity.State.scrollAnchor[Velocity.State[\"scrollProperty\" + (scrollDirection === \"Left\" ? \"Top\" : \"Left\")]]; /* GET */\r\n\r\n\t\t\t\t\t\t\t/* Unlike $.position(), $.offset() values are relative to the browser window's true dimensions -- not merely its currently viewable area --\r\n\t\t\t\t\t\t\t and therefore end values do not need to be compounded onto current values. */\r\n\t\t\t\t\t\t\tscrollPositionEnd = $(element).offset()[scrollDirection.toLowerCase()] + scrollOffset; /* GET */\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Since there's only one format that scroll's associated tweensContainer can take, we create it manually. */\r\n\t\t\t\t\t\ttweensContainer = {\r\n\t\t\t\t\t\t\tscroll: {\r\n\t\t\t\t\t\t\t\trootPropertyValue: false,\r\n\t\t\t\t\t\t\t\tstartValue: scrollPositionCurrent,\r\n\t\t\t\t\t\t\t\tcurrentValue: scrollPositionCurrent,\r\n\t\t\t\t\t\t\t\tendValue: scrollPositionEnd,\r\n\t\t\t\t\t\t\t\tunitType: \"\",\r\n\t\t\t\t\t\t\t\teasing: opts.easing,\r\n\t\t\t\t\t\t\t\tscrollData: {\r\n\t\t\t\t\t\t\t\t\tcontainer: opts.container,\r\n\t\t\t\t\t\t\t\t\tdirection: scrollDirection,\r\n\t\t\t\t\t\t\t\t\talternateValue: scrollPositionCurrentAlternate\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t},\r\n\t\t\t\t\t\t\telement: element\r\n\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\tconsole.log(\"tweensContainer (scroll): \", tweensContainer.scroll, element);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/******************************************\r\n\t\t\t\t\t\t Tween Data Construction (for Reverse)\r\n\t\t\t\t\t\t ******************************************/\r\n\r\n\t\t\t\t\t\t/* Reverse acts like a \"start\" action in that a property map is animated toward. The only difference is\r\n\t\t\t\t\t\t that the property map used for reverse is the inverse of the map used in the previous call. Thus, we manipulate\r\n\t\t\t\t\t\t the previous call to construct our new map: use the previous map's end values as our new map's start values. Copy over all other data. */\r\n\t\t\t\t\t\t/* Note: Reverse can be directly called via the \"reverse\" parameter, or it can be indirectly triggered via the loop option. (Loops are composed of multiple reverses.) */\r\n\t\t\t\t\t\t/* Note: Reverse calls do not need to be consecutively chained onto a currently-animating element in order to operate on cached values;\r\n\t\t\t\t\t\t there is no harm to reverse being called on a potentially stale data cache since reverse's behavior is simply defined\r\n\t\t\t\t\t\t as reverting to the element's values as they were prior to the previous *Velocity* call. */\r\n\t\t\t\t\t} else if (action === \"reverse\") {\r\n\t\t\t\t\t\tdata = Data(element);\r\n\r\n\t\t\t\t\t\t/* Abort if there is no prior animation data to reverse to. */\r\n\t\t\t\t\t\tif (!data) {\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (!data.tweensContainer) {\r\n\t\t\t\t\t\t\t/* Dequeue the element so that this queue entry releases itself immediately, allowing subsequent queue entries to run. */\r\n\t\t\t\t\t\t\t$.dequeue(element, opts.queue);\r\n\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t/*********************\r\n\t\t\t\t\t\t\t Options Parsing\r\n\t\t\t\t\t\t\t *********************/\r\n\r\n\t\t\t\t\t\t\t/* If the element was hidden via the display option in the previous call,\r\n\t\t\t\t\t\t\t revert display to \"auto\" prior to reversal so that the element is visible again. */\r\n\t\t\t\t\t\t\tif (data.opts.display === \"none\") {\r\n\t\t\t\t\t\t\t\tdata.opts.display = \"auto\";\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (data.opts.visibility === \"hidden\") {\r\n\t\t\t\t\t\t\t\tdata.opts.visibility = \"visible\";\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* If the loop option was set in the previous call, disable it so that \"reverse\" calls aren't recursively generated.\r\n\t\t\t\t\t\t\t Further, remove the previous call's callback options; typically, users do not want these to be refired. */\r\n\t\t\t\t\t\t\tdata.opts.loop = false;\r\n\t\t\t\t\t\t\tdata.opts.begin = null;\r\n\t\t\t\t\t\t\tdata.opts.complete = null;\r\n\r\n\t\t\t\t\t\t\t/* Since we're extending an opts object that has already been extended with the defaults options object,\r\n\t\t\t\t\t\t\t we remove non-explicitly-defined properties that are auto-assigned values. */\r\n\t\t\t\t\t\t\tif (!options.easing) {\r\n\t\t\t\t\t\t\t\tdelete opts.easing;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (!options.duration) {\r\n\t\t\t\t\t\t\t\tdelete opts.duration;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* The opts object used for reversal is an extension of the options object optionally passed into this\r\n\t\t\t\t\t\t\t reverse call plus the options used in the previous Velocity call. */\r\n\t\t\t\t\t\t\topts = $.extend({}, data.opts, opts);\r\n\r\n\t\t\t\t\t\t\t/*************************************\r\n\t\t\t\t\t\t\t Tweens Container Reconstruction\r\n\t\t\t\t\t\t\t *************************************/\r\n\r\n\t\t\t\t\t\t\t/* Create a deepy copy (indicated via the true flag) of the previous call's tweensContainer. */\r\n\t\t\t\t\t\t\tlastTweensContainer = $.extend(true, {}, data ? data.tweensContainer : null);\r\n\r\n\t\t\t\t\t\t\t/* Manipulate the previous tweensContainer by replacing its end values and currentValues with its start values. */\r\n\t\t\t\t\t\t\tfor (var lastTween in lastTweensContainer) {\r\n\t\t\t\t\t\t\t\t/* In addition to tween data, tweensContainers contain an element property that we ignore here. */\r\n\t\t\t\t\t\t\t\tif (lastTweensContainer.hasOwnProperty(lastTween) && lastTween !== \"element\") {\r\n\t\t\t\t\t\t\t\t\tvar lastStartValue = lastTweensContainer[lastTween].startValue;\r\n\r\n\t\t\t\t\t\t\t\t\tlastTweensContainer[lastTween].startValue = lastTweensContainer[lastTween].currentValue = lastTweensContainer[lastTween].endValue;\r\n\t\t\t\t\t\t\t\t\tlastTweensContainer[lastTween].endValue = lastStartValue;\r\n\r\n\t\t\t\t\t\t\t\t\t/* Easing is the only option that embeds into the individual tween data (since it can be defined on a per-property basis).\r\n\t\t\t\t\t\t\t\t\t Accordingly, every property's easing value must be updated when an options object is passed in with a reverse call.\r\n\t\t\t\t\t\t\t\t\t The side effect of this extensibility is that all per-property easing values are forcefully reset to the new value. */\r\n\t\t\t\t\t\t\t\t\tif (!Type.isEmptyObject(options)) {\r\n\t\t\t\t\t\t\t\t\t\tlastTweensContainer[lastTween].easing = opts.easing;\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\t\t\tconsole.log(\"reverse tweensContainer (\" + lastTween + \"): \" + JSON.stringify(lastTweensContainer[lastTween]), element);\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\ttweensContainer = lastTweensContainer;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/*****************************************\r\n\t\t\t\t\t\t Tween Data Construction (for Start)\r\n\t\t\t\t\t\t *****************************************/\r\n\r\n\t\t\t\t\t} else if (action === \"start\") {\r\n\r\n\t\t\t\t\t\t/*************************\r\n\t\t\t\t\t\t Value Transferring\r\n\t\t\t\t\t\t *************************/\r\n\r\n\t\t\t\t\t\t/* If this queue entry follows a previous Velocity-initiated queue entry *and* if this entry was created\r\n\t\t\t\t\t\t while the element was in the process of being animated by Velocity, then this current call is safe to use\r\n\t\t\t\t\t\t the end values from the prior call as its start values. Velocity attempts to perform this value transfer\r\n\t\t\t\t\t\t process whenever possible in order to avoid requerying the DOM. */\r\n\t\t\t\t\t\t/* If values aren't transferred from a prior call and start values were not forcefed by the user (more on this below),\r\n\t\t\t\t\t\t then the DOM is queried for the element's current values as a last resort. */\r\n\t\t\t\t\t\t/* Note: Conversely, animation reversal (and looping) *always* perform inter-call value transfers; they never requery the DOM. */\r\n\r\n\t\t\t\t\t\tdata = Data(element);\r\n\r\n\t\t\t\t\t\t/* The per-element isAnimating flag is used to indicate whether it's safe (i.e. the data isn't stale)\r\n\t\t\t\t\t\t to transfer over end values to use as start values. If it's set to true and there is a previous\r\n\t\t\t\t\t\t Velocity call to pull values from, do so. */\r\n\t\t\t\t\t\tif (data && data.tweensContainer && data.isAnimating === true) {\r\n\t\t\t\t\t\t\tlastTweensContainer = data.tweensContainer;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/***************************\r\n\t\t\t\t\t\t Tween Data Calculation\r\n\t\t\t\t\t\t ***************************/\r\n\r\n\t\t\t\t\t\t/* This function parses property data and defaults endValue, easing, and startValue as appropriate. */\r\n\t\t\t\t\t\t/* Property map values can either take the form of 1) a single value representing the end value,\r\n\t\t\t\t\t\t or 2) an array in the form of [ endValue, [, easing] [, startValue] ].\r\n\t\t\t\t\t\t The optional third parameter is a forcefed startValue to be used instead of querying the DOM for\r\n\t\t\t\t\t\t the element's current value. Read Velocity's docmentation to learn more about forcefeeding: VelocityJS.org/#forcefeeding */\r\n\t\t\t\t\t\tvar parsePropertyValue = function(valueData, skipResolvingEasing) {\r\n\t\t\t\t\t\t\tvar endValue, easing, startValue;\r\n\r\n\t\t\t\t\t\t\t/* If we have a function as the main argument then resolve it first, in case it returns an array that needs to be split */\r\n\t\t\t\t\t\t\tif (Type.isFunction(valueData)) {\r\n\t\t\t\t\t\t\t\tvalueData = valueData.call(element, elementArrayIndex, elementsLength);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Handle the array format, which can be structured as one of three potential overloads:\r\n\t\t\t\t\t\t\t A) [ endValue, easing, startValue ], B) [ endValue, easing ], or C) [ endValue, startValue ] */\r\n\t\t\t\t\t\t\tif (Type.isArray(valueData)) {\r\n\t\t\t\t\t\t\t\t/* endValue is always the first item in the array. Don't bother validating endValue's value now\r\n\t\t\t\t\t\t\t\t since the ensuing property cycling logic does that. */\r\n\t\t\t\t\t\t\t\tendValue = valueData[0];\r\n\r\n\t\t\t\t\t\t\t\t/* Two-item array format: If the second item is a number, function, or hex string, treat it as a\r\n\t\t\t\t\t\t\t\t start value since easings can only be non-hex strings or arrays. */\r\n\t\t\t\t\t\t\t\tif ((!Type.isArray(valueData[1]) && /^[\\d-]/.test(valueData[1])) || Type.isFunction(valueData[1]) || CSS.RegEx.isHex.test(valueData[1])) {\r\n\t\t\t\t\t\t\t\t\tstartValue = valueData[1];\r\n\t\t\t\t\t\t\t\t\t/* Two or three-item array: If the second item is a non-hex string easing name or an array, treat it as an easing. */\r\n\t\t\t\t\t\t\t\t} else if ((Type.isString(valueData[1]) && !CSS.RegEx.isHex.test(valueData[1]) && Velocity.Easings[valueData[1]]) || Type.isArray(valueData[1])) {\r\n\t\t\t\t\t\t\t\t\teasing = skipResolvingEasing ? valueData[1] : getEasing(valueData[1], opts.duration);\r\n\r\n\t\t\t\t\t\t\t\t\t/* Don't bother validating startValue's value now since the ensuing property cycling logic inherently does that. */\r\n\t\t\t\t\t\t\t\t\tstartValue = valueData[2];\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\tstartValue = valueData[1] || valueData[2];\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t/* Handle the single-value format. */\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\tendValue = valueData;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Default to the call's easing if a per-property easing type was not defined. */\r\n\t\t\t\t\t\t\tif (!skipResolvingEasing) {\r\n\t\t\t\t\t\t\t\teasing = easing || opts.easing;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* If functions were passed in as values, pass the function the current element as its context,\r\n\t\t\t\t\t\t\t plus the element's index and the element set's size as arguments. Then, assign the returned value. */\r\n\t\t\t\t\t\t\tif (Type.isFunction(endValue)) {\r\n\t\t\t\t\t\t\t\tendValue = endValue.call(element, elementArrayIndex, elementsLength);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (Type.isFunction(startValue)) {\r\n\t\t\t\t\t\t\t\tstartValue = startValue.call(element, elementArrayIndex, elementsLength);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Allow startValue to be left as undefined to indicate to the ensuing code that its value was not forcefed. */\r\n\t\t\t\t\t\t\treturn [endValue || 0, easing, startValue];\r\n\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\tvar fixPropertyValue = function(property, valueData) {\r\n\t\t\t\t\t\t\t/* In case this property is a hook, there are circumstances where we will intend to work on the hook's root property and not the hooked subproperty. */\r\n\t\t\t\t\t\t\tvar rootProperty = CSS.Hooks.getRoot(property),\r\n\t\t\t\t\t\t\t\t\trootPropertyValue = false,\r\n\t\t\t\t\t\t\t\t\t/* Parse out endValue, easing, and startValue from the property's data. */\r\n\t\t\t\t\t\t\t\t\tendValue = valueData[0],\r\n\t\t\t\t\t\t\t\t\teasing = valueData[1],\r\n\t\t\t\t\t\t\t\t\tstartValue = valueData[2],\r\n\t\t\t\t\t\t\t\t\tpattern;\r\n\r\n\t\t\t\t\t\t\t/**************************\r\n\t\t\t\t\t\t\t Start Value Sourcing\r\n\t\t\t\t\t\t\t **************************/\r\n\r\n\t\t\t\t\t\t\t/* Other than for the dummy tween property, properties that are not supported by the browser (and do not have an associated normalization) will\r\n\t\t\t\t\t\t\t inherently produce no style changes when set, so they are skipped in order to decrease animation tick overhead.\r\n\t\t\t\t\t\t\t Property support is determined via prefixCheck(), which returns a false flag when no supported is detected. */\r\n\t\t\t\t\t\t\t/* Note: Since SVG elements have some of their properties directly applied as HTML attributes,\r\n\t\t\t\t\t\t\t there is no way to check for their explicit browser support, and so we skip skip this check for them. */\r\n\t\t\t\t\t\t\tif ((!data || !data.isSVG) && rootProperty !== \"tween\" && CSS.Names.prefixCheck(rootProperty)[1] === false && CSS.Normalizations.registered[rootProperty] === undefined) {\r\n\t\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\t\tconsole.log(\"Skipping [\" + rootProperty + \"] due to a lack of browser support.\");\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* If the display option is being set to a non-\"none\" (e.g. \"block\") and opacity (filter on IE<=8) is being\r\n\t\t\t\t\t\t\t animated to an endValue of non-zero, the user's intention is to fade in from invisible, thus we forcefeed opacity\r\n\t\t\t\t\t\t\t a startValue of 0 if its startValue hasn't already been sourced by value transferring or prior forcefeeding. */\r\n\t\t\t\t\t\t\tif (((opts.display !== undefined && opts.display !== null && opts.display !== \"none\") || (opts.visibility !== undefined && opts.visibility !== \"hidden\")) && /opacity|filter/.test(property) && !startValue && endValue !== 0) {\r\n\t\t\t\t\t\t\t\tstartValue = 0;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* If values have been transferred from the previous Velocity call, extract the endValue and rootPropertyValue\r\n\t\t\t\t\t\t\t for all of the current call's properties that were *also* animated in the previous call. */\r\n\t\t\t\t\t\t\t/* Note: Value transferring can optionally be disabled by the user via the _cacheValues option. */\r\n\t\t\t\t\t\t\tif (opts._cacheValues && lastTweensContainer && lastTweensContainer[property]) {\r\n\t\t\t\t\t\t\t\tif (startValue === undefined) {\r\n\t\t\t\t\t\t\t\t\tstartValue = lastTweensContainer[property].endValue + lastTweensContainer[property].unitType;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* The previous call's rootPropertyValue is extracted from the element's data cache since that's the\r\n\t\t\t\t\t\t\t\t instance of rootPropertyValue that gets freshly updated by the tweening process, whereas the rootPropertyValue\r\n\t\t\t\t\t\t\t\t attached to the incoming lastTweensContainer is equal to the root property's value prior to any tweening. */\r\n\t\t\t\t\t\t\t\trootPropertyValue = data.rootPropertyValueCache[rootProperty];\r\n\t\t\t\t\t\t\t\t/* If values were not transferred from a previous Velocity call, query the DOM as needed. */\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t/* Handle hooked properties. */\r\n\t\t\t\t\t\t\t\tif (CSS.Hooks.registered[property]) {\r\n\t\t\t\t\t\t\t\t\tif (startValue === undefined) {\r\n\t\t\t\t\t\t\t\t\t\trootPropertyValue = CSS.getPropertyValue(element, rootProperty); /* GET */\r\n\t\t\t\t\t\t\t\t\t\t/* Note: The following getPropertyValue() call does not actually trigger a DOM query;\r\n\t\t\t\t\t\t\t\t\t\t getPropertyValue() will extract the hook from rootPropertyValue. */\r\n\t\t\t\t\t\t\t\t\t\tstartValue = CSS.getPropertyValue(element, property, rootPropertyValue);\r\n\t\t\t\t\t\t\t\t\t\t/* If startValue is already defined via forcefeeding, do not query the DOM for the root property's value;\r\n\t\t\t\t\t\t\t\t\t\t just grab rootProperty's zero-value template from CSS.Hooks. This overwrites the element's actual\r\n\t\t\t\t\t\t\t\t\t\t root property value (if one is set), but this is acceptable since the primary reason users forcefeed is\r\n\t\t\t\t\t\t\t\t\t\t to avoid DOM queries, and thus we likewise avoid querying the DOM for the root property's value. */\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t/* Grab this hook's zero-value template, e.g. \"0px 0px 0px black\". */\r\n\t\t\t\t\t\t\t\t\t\trootPropertyValue = CSS.Hooks.templates[rootProperty][1];\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t/* Handle non-hooked properties that haven't already been defined via forcefeeding. */\r\n\t\t\t\t\t\t\t\t} else if (startValue === undefined) {\r\n\t\t\t\t\t\t\t\t\tstartValue = CSS.getPropertyValue(element, property); /* GET */\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/**************************\r\n\t\t\t\t\t\t\t Value Data Extraction\r\n\t\t\t\t\t\t\t **************************/\r\n\r\n\t\t\t\t\t\t\tvar separatedValue,\r\n\t\t\t\t\t\t\t\t\tendValueUnitType,\r\n\t\t\t\t\t\t\t\t\tstartValueUnitType,\r\n\t\t\t\t\t\t\t\t\toperator = false;\r\n\r\n\t\t\t\t\t\t\t/* Separates a property value into its numeric value and its unit type. */\r\n\t\t\t\t\t\t\tvar separateValue = function(property, value) {\r\n\t\t\t\t\t\t\t\tvar unitType,\r\n\t\t\t\t\t\t\t\t\t\tnumericValue;\r\n\r\n\t\t\t\t\t\t\t\tnumericValue = (value || \"0\")\r\n\t\t\t\t\t\t\t\t\t\t.toString()\r\n\t\t\t\t\t\t\t\t\t\t.toLowerCase()\r\n\t\t\t\t\t\t\t\t\t\t/* Match the unit type at the end of the value. */\r\n\t\t\t\t\t\t\t\t\t\t.replace(/[%A-z]+$/, function(match) {\r\n\t\t\t\t\t\t\t\t\t\t\t/* Grab the unit type. */\r\n\t\t\t\t\t\t\t\t\t\t\tunitType = match;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t/* Strip the unit type off of value. */\r\n\t\t\t\t\t\t\t\t\t\t\treturn \"\";\r\n\t\t\t\t\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t\t\t/* If no unit type was supplied, assign one that is appropriate for this property (e.g. \"deg\" for rotateZ or \"px\" for width). */\r\n\t\t\t\t\t\t\t\tif (!unitType) {\r\n\t\t\t\t\t\t\t\t\tunitType = CSS.Values.getUnitType(property);\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\treturn [numericValue, unitType];\r\n\t\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t\tif (startValue !== endValue && Type.isString(startValue) && Type.isString(endValue)) {\r\n\t\t\t\t\t\t\t\tpattern = \"\";\r\n\t\t\t\t\t\t\t\tvar iStart = 0, // index in startValue\r\n\t\t\t\t\t\t\t\t\t\tiEnd = 0, // index in endValue\r\n\t\t\t\t\t\t\t\t\t\taStart = [], // array of startValue numbers\r\n\t\t\t\t\t\t\t\t\t\taEnd = [], // array of endValue numbers\r\n\t\t\t\t\t\t\t\t\t\tinCalc = 0, // Keep track of being inside a \"calc()\" so we don't duplicate it\r\n\t\t\t\t\t\t\t\t\t\tinRGB = 0, // Keep track of being inside an RGB as we can't use fractional values\r\n\t\t\t\t\t\t\t\t\t\tinRGBA = 0; // Keep track of being inside an RGBA as we must pass fractional for the alpha channel\r\n\r\n\t\t\t\t\t\t\t\tstartValue = CSS.Hooks.fixColors(startValue);\r\n\t\t\t\t\t\t\t\tendValue = CSS.Hooks.fixColors(endValue);\r\n\t\t\t\t\t\t\t\twhile (iStart < startValue.length && iEnd < endValue.length) {\r\n\t\t\t\t\t\t\t\t\tvar cStart = startValue[iStart],\r\n\t\t\t\t\t\t\t\t\t\t\tcEnd = endValue[iEnd];\r\n\r\n\t\t\t\t\t\t\t\t\tif (/[\\d\\.-]/.test(cStart) && /[\\d\\.-]/.test(cEnd)) {\r\n\t\t\t\t\t\t\t\t\t\tvar tStart = cStart, // temporary character buffer\r\n\t\t\t\t\t\t\t\t\t\t\t\ttEnd = cEnd, // temporary character buffer\r\n\t\t\t\t\t\t\t\t\t\t\t\tdotStart = \".\", // Make sure we can only ever match a single dot in a decimal\r\n\t\t\t\t\t\t\t\t\t\t\t\tdotEnd = \".\"; // Make sure we can only ever match a single dot in a decimal\r\n\r\n\t\t\t\t\t\t\t\t\t\twhile (++iStart < startValue.length) {\r\n\t\t\t\t\t\t\t\t\t\t\tcStart = startValue[iStart];\r\n\t\t\t\t\t\t\t\t\t\t\tif (cStart === dotStart) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tdotStart = \"..\"; // Can never match two characters\r\n\t\t\t\t\t\t\t\t\t\t\t} else if (!/\\d/.test(cStart)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\ttStart += cStart;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\twhile (++iEnd < endValue.length) {\r\n\t\t\t\t\t\t\t\t\t\t\tcEnd = endValue[iEnd];\r\n\t\t\t\t\t\t\t\t\t\t\tif (cEnd === dotEnd) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tdotEnd = \"..\"; // Can never match two characters\r\n\t\t\t\t\t\t\t\t\t\t\t} else if (!/\\d/.test(cEnd)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\ttEnd += cEnd;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\tvar uStart = CSS.Hooks.getUnit(startValue, iStart), // temporary unit type\r\n\t\t\t\t\t\t\t\t\t\t\t\tuEnd = CSS.Hooks.getUnit(endValue, iEnd); // temporary unit type\r\n\r\n\t\t\t\t\t\t\t\t\t\tiStart += uStart.length;\r\n\t\t\t\t\t\t\t\t\t\tiEnd += uEnd.length;\r\n\t\t\t\t\t\t\t\t\t\tif (uStart === uEnd) {\r\n\t\t\t\t\t\t\t\t\t\t\t// Same units\r\n\t\t\t\t\t\t\t\t\t\t\tif (tStart === tEnd) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t// Same numbers, so just copy over\r\n\t\t\t\t\t\t\t\t\t\t\t\tpattern += tStart + uStart;\r\n\t\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\t\t// Different numbers, so store them\r\n\t\t\t\t\t\t\t\t\t\t\t\tpattern += \"{\" + aStart.length + (inRGB ? \"!\" : \"\") + \"}\" + uStart;\r\n\t\t\t\t\t\t\t\t\t\t\t\taStart.push(parseFloat(tStart));\r\n\t\t\t\t\t\t\t\t\t\t\t\taEnd.push(parseFloat(tEnd));\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\t// Different units, so put into a \"calc(from + to)\" and animate each side to/from zero\r\n\t\t\t\t\t\t\t\t\t\t\tvar nStart = parseFloat(tStart),\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tnEnd = parseFloat(tEnd);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tpattern += (inCalc < 5 ? \"calc\" : \"\") + \"(\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t+ (nStart ? \"{\" + aStart.length + (inRGB ? \"!\" : \"\") + \"}\" : \"0\") + uStart\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t+ \" + \"\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t+ (nEnd ? \"{\" + (aStart.length + (nStart ? 1 : 0)) + (inRGB ? \"!\" : \"\") + \"}\" : \"0\") + uEnd\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t+ \")\";\r\n\t\t\t\t\t\t\t\t\t\t\tif (nStart) {\r\n\t\t\t\t\t\t\t\t\t\t\t\taStart.push(nStart);\r\n\t\t\t\t\t\t\t\t\t\t\t\taEnd.push(0);\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\tif (nEnd) {\r\n\t\t\t\t\t\t\t\t\t\t\t\taStart.push(0);\r\n\t\t\t\t\t\t\t\t\t\t\t\taEnd.push(nEnd);\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t} else if (cStart === cEnd) {\r\n\t\t\t\t\t\t\t\t\t\tpattern += cStart;\r\n\t\t\t\t\t\t\t\t\t\tiStart++;\r\n\t\t\t\t\t\t\t\t\t\tiEnd++;\r\n\t\t\t\t\t\t\t\t\t\t// Keep track of being inside a calc()\r\n\t\t\t\t\t\t\t\t\t\tif (inCalc === 0 && cStart === \"c\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inCalc === 1 && cStart === \"a\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inCalc === 2 && cStart === \"l\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inCalc === 3 && cStart === \"c\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inCalc >= 4 && cStart === \"(\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t) {\r\n\t\t\t\t\t\t\t\t\t\t\tinCalc++;\r\n\t\t\t\t\t\t\t\t\t\t} else if ((inCalc && inCalc < 5)\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inCalc >= 4 && cStart === \")\" && --inCalc < 5) {\r\n\t\t\t\t\t\t\t\t\t\t\tinCalc = 0;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t// Keep track of being inside an rgb() / rgba()\r\n\t\t\t\t\t\t\t\t\t\tif (inRGB === 0 && cStart === \"r\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inRGB === 1 && cStart === \"g\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inRGB === 2 && cStart === \"b\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inRGB === 3 && cStart === \"a\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inRGB >= 3 && cStart === \"(\"\r\n\t\t\t\t\t\t\t\t\t\t\t\t) {\r\n\t\t\t\t\t\t\t\t\t\t\tif (inRGB === 3 && cStart === \"a\") {\r\n\t\t\t\t\t\t\t\t\t\t\t\tinRGBA = 1;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\tinRGB++;\r\n\t\t\t\t\t\t\t\t\t\t} else if (inRGBA && cStart === \",\") {\r\n\t\t\t\t\t\t\t\t\t\t\tif (++inRGBA > 3) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tinRGB = inRGBA = 0;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t} else if ((inRGBA && inRGB < (inRGBA ? 5 : 4))\r\n\t\t\t\t\t\t\t\t\t\t\t\t|| inRGB >= (inRGBA ? 4 : 3) && cStart === \")\" && --inRGB < (inRGBA ? 5 : 4)) {\r\n\t\t\t\t\t\t\t\t\t\t\tinRGB = inRGBA = 0;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\tinCalc = 0;\r\n\t\t\t\t\t\t\t\t\t\t// TODO: changing units, fixing colours\r\n\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\tif (iStart !== startValue.length || iEnd !== endValue.length) {\r\n\t\t\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\t\t\tconsole.error(\"Trying to pattern match mis-matched strings [\\\"\" + endValue + \"\\\", \\\"\" + startValue + \"\\\"]\");\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\tpattern = undefined;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\tif (pattern) {\r\n\t\t\t\t\t\t\t\t\tif (aStart.length) {\r\n\t\t\t\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\t\t\t\tconsole.log(\"Pattern found \\\"\" + pattern + \"\\\" -> \", aStart, aEnd, \"[\" + startValue + \",\" + endValue + \"]\");\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\tstartValue = aStart;\r\n\t\t\t\t\t\t\t\t\t\tendValue = aEnd;\r\n\t\t\t\t\t\t\t\t\t\tendValueUnitType = startValueUnitType = \"\";\r\n\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\tpattern = undefined;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (!pattern) {\r\n\t\t\t\t\t\t\t\t/* Separate startValue. */\r\n\t\t\t\t\t\t\t\tseparatedValue = separateValue(property, startValue);\r\n\t\t\t\t\t\t\t\tstartValue = separatedValue[0];\r\n\t\t\t\t\t\t\t\tstartValueUnitType = separatedValue[1];\r\n\r\n\t\t\t\t\t\t\t\t/* Separate endValue, and extract a value operator (e.g. \"+=\", \"-=\") if one exists. */\r\n\t\t\t\t\t\t\t\tseparatedValue = separateValue(property, endValue);\r\n\t\t\t\t\t\t\t\tendValue = separatedValue[0].replace(/^([+-\\/*])=/, function(match, subMatch) {\r\n\t\t\t\t\t\t\t\t\toperator = subMatch;\r\n\r\n\t\t\t\t\t\t\t\t\t/* Strip the operator off of the value. */\r\n\t\t\t\t\t\t\t\t\treturn \"\";\r\n\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t\tendValueUnitType = separatedValue[1];\r\n\r\n\t\t\t\t\t\t\t\t/* Parse float values from endValue and startValue. Default to 0 if NaN is returned. */\r\n\t\t\t\t\t\t\t\tstartValue = parseFloat(startValue) || 0;\r\n\t\t\t\t\t\t\t\tendValue = parseFloat(endValue) || 0;\r\n\r\n\t\t\t\t\t\t\t\t/***************************************\r\n\t\t\t\t\t\t\t\t Property-Specific Value Conversion\r\n\t\t\t\t\t\t\t\t ***************************************/\r\n\r\n\t\t\t\t\t\t\t\t/* Custom support for properties that don't actually accept the % unit type, but where pollyfilling is trivial and relatively foolproof. */\r\n\t\t\t\t\t\t\t\tif (endValueUnitType === \"%\") {\r\n\t\t\t\t\t\t\t\t\t/* A %-value fontSize/lineHeight is relative to the parent's fontSize (as opposed to the parent's dimensions),\r\n\t\t\t\t\t\t\t\t\t which is identical to the em unit's behavior, so we piggyback off of that. */\r\n\t\t\t\t\t\t\t\t\tif (/^(fontSize|lineHeight)$/.test(property)) {\r\n\t\t\t\t\t\t\t\t\t\t/* Convert % into an em decimal value. */\r\n\t\t\t\t\t\t\t\t\t\tendValue = endValue / 100;\r\n\t\t\t\t\t\t\t\t\t\tendValueUnitType = \"em\";\r\n\t\t\t\t\t\t\t\t\t\t/* For scaleX and scaleY, convert the value into its decimal format and strip off the unit type. */\r\n\t\t\t\t\t\t\t\t\t} else if (/^scale/.test(property)) {\r\n\t\t\t\t\t\t\t\t\t\tendValue = endValue / 100;\r\n\t\t\t\t\t\t\t\t\t\tendValueUnitType = \"\";\r\n\t\t\t\t\t\t\t\t\t\t/* For RGB components, take the defined percentage of 255 and strip off the unit type. */\r\n\t\t\t\t\t\t\t\t\t} else if (/(Red|Green|Blue)$/i.test(property)) {\r\n\t\t\t\t\t\t\t\t\t\tendValue = (endValue / 100) * 255;\r\n\t\t\t\t\t\t\t\t\t\tendValueUnitType = \"\";\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/***************************\r\n\t\t\t\t\t\t\t Unit Ratio Calculation\r\n\t\t\t\t\t\t\t ***************************/\r\n\r\n\t\t\t\t\t\t\t/* When queried, the browser returns (most) CSS property values in pixels. Therefore, if an endValue with a unit type of\r\n\t\t\t\t\t\t\t %, em, or rem is animated toward, startValue must be converted from pixels into the same unit type as endValue in order\r\n\t\t\t\t\t\t\t for value manipulation logic (increment/decrement) to proceed. Further, if the startValue was forcefed or transferred\r\n\t\t\t\t\t\t\t from a previous call, startValue may also not be in pixels. Unit conversion logic therefore consists of two steps:\r\n\t\t\t\t\t\t\t 1) Calculating the ratio of %/em/rem/vh/vw relative to pixels\r\n\t\t\t\t\t\t\t 2) Converting startValue into the same unit of measurement as endValue based on these ratios. */\r\n\t\t\t\t\t\t\t/* Unit conversion ratios are calculated by inserting a sibling node next to the target node, copying over its position property,\r\n\t\t\t\t\t\t\t setting values with the target unit type then comparing the returned pixel value. */\r\n\t\t\t\t\t\t\t/* Note: Even if only one of these unit types is being animated, all unit ratios are calculated at once since the overhead\r\n\t\t\t\t\t\t\t of batching the SETs and GETs together upfront outweights the potential overhead\r\n\t\t\t\t\t\t\t of layout thrashing caused by re-querying for uncalculated ratios for subsequently-processed properties. */\r\n\t\t\t\t\t\t\t/* Todo: Shift this logic into the calls' first tick instance so that it's synced with RAF. */\r\n\t\t\t\t\t\t\tvar calculateUnitRatios = function() {\r\n\r\n\t\t\t\t\t\t\t\t/************************\r\n\t\t\t\t\t\t\t\t Same Ratio Checks\r\n\t\t\t\t\t\t\t\t ************************/\r\n\r\n\t\t\t\t\t\t\t\t/* The properties below are used to determine whether the element differs sufficiently from this call's\r\n\t\t\t\t\t\t\t\t previously iterated element to also differ in its unit conversion ratios. If the properties match up with those\r\n\t\t\t\t\t\t\t\t of the prior element, the prior element's conversion ratios are used. Like most optimizations in Velocity,\r\n\t\t\t\t\t\t\t\t this is done to minimize DOM querying. */\r\n\t\t\t\t\t\t\t\tvar sameRatioIndicators = {\r\n\t\t\t\t\t\t\t\t\tmyParent: element.parentNode || document.body, /* GET */\r\n\t\t\t\t\t\t\t\t\tposition: CSS.getPropertyValue(element, \"position\"), /* GET */\r\n\t\t\t\t\t\t\t\t\tfontSize: CSS.getPropertyValue(element, \"fontSize\") /* GET */\r\n\t\t\t\t\t\t\t\t},\r\n\t\t\t\t\t\t\t\t\t\t/* Determine if the same % ratio can be used. % is based on the element's position value and its parent's width and height dimensions. */\r\n\t\t\t\t\t\t\t\t\t\tsamePercentRatio = ((sameRatioIndicators.position === callUnitConversionData.lastPosition) && (sameRatioIndicators.myParent === callUnitConversionData.lastParent)),\r\n\t\t\t\t\t\t\t\t\t\t/* Determine if the same em ratio can be used. em is relative to the element's fontSize. */\r\n\t\t\t\t\t\t\t\t\t\tsameEmRatio = (sameRatioIndicators.fontSize === callUnitConversionData.lastFontSize);\r\n\r\n\t\t\t\t\t\t\t\t/* Store these ratio indicators call-wide for the next element to compare against. */\r\n\t\t\t\t\t\t\t\tcallUnitConversionData.lastParent = sameRatioIndicators.myParent;\r\n\t\t\t\t\t\t\t\tcallUnitConversionData.lastPosition = sameRatioIndicators.position;\r\n\t\t\t\t\t\t\t\tcallUnitConversionData.lastFontSize = sameRatioIndicators.fontSize;\r\n\r\n\t\t\t\t\t\t\t\t/***************************\r\n\t\t\t\t\t\t\t\t Element-Specific Units\r\n\t\t\t\t\t\t\t\t ***************************/\r\n\r\n\t\t\t\t\t\t\t\t/* Note: IE8 rounds to the nearest pixel when returning CSS values, thus we perform conversions using a measurement\r\n\t\t\t\t\t\t\t\t of 100 (instead of 1) to give our ratios a precision of at least 2 decimal values. */\r\n\t\t\t\t\t\t\t\tvar measurement = 100,\r\n\t\t\t\t\t\t\t\t\t\tunitRatios = {};\r\n\r\n\t\t\t\t\t\t\t\tif (!sameEmRatio || !samePercentRatio) {\r\n\t\t\t\t\t\t\t\t\tvar dummy = data && data.isSVG ? document.createElementNS(\"http://www.w3.org/2000/svg\", \"rect\") : document.createElement(\"div\");\r\n\r\n\t\t\t\t\t\t\t\t\tVelocity.init(dummy);\r\n\t\t\t\t\t\t\t\t\tsameRatioIndicators.myParent.appendChild(dummy);\r\n\r\n\t\t\t\t\t\t\t\t\t/* To accurately and consistently calculate conversion ratios, the element's cascaded overflow and box-sizing are stripped.\r\n\t\t\t\t\t\t\t\t\t Similarly, since width/height can be artificially constrained by their min-/max- equivalents, these are controlled for as well. */\r\n\t\t\t\t\t\t\t\t\t/* Note: Overflow must be also be controlled for per-axis since the overflow property overwrites its per-axis values. */\r\n\t\t\t\t\t\t\t\t\t$.each([\"overflow\", \"overflowX\", \"overflowY\"], function(i, property) {\r\n\t\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, property, \"hidden\");\r\n\t\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, \"position\", sameRatioIndicators.position);\r\n\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, \"fontSize\", sameRatioIndicators.fontSize);\r\n\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, \"boxSizing\", \"content-box\");\r\n\r\n\t\t\t\t\t\t\t\t\t/* width and height act as our proxy properties for measuring the horizontal and vertical % ratios. */\r\n\t\t\t\t\t\t\t\t\t$.each([\"minWidth\", \"maxWidth\", \"width\", \"minHeight\", \"maxHeight\", \"height\"], function(i, property) {\r\n\t\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, property, measurement + \"%\");\r\n\t\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t\t\t/* paddingLeft arbitrarily acts as our proxy property for the em ratio. */\r\n\t\t\t\t\t\t\t\t\tVelocity.CSS.setPropertyValue(dummy, \"paddingLeft\", measurement + \"em\");\r\n\r\n\t\t\t\t\t\t\t\t\t/* Divide the returned value by the measurement to get the ratio between 1% and 1px. Default to 1 since working with 0 can produce Infinite. */\r\n\t\t\t\t\t\t\t\t\tunitRatios.percentToPxWidth = callUnitConversionData.lastPercentToPxWidth = (parseFloat(CSS.getPropertyValue(dummy, \"width\", null, true)) || 1) / measurement; /* GET */\r\n\t\t\t\t\t\t\t\t\tunitRatios.percentToPxHeight = callUnitConversionData.lastPercentToPxHeight = (parseFloat(CSS.getPropertyValue(dummy, \"height\", null, true)) || 1) / measurement; /* GET */\r\n\t\t\t\t\t\t\t\t\tunitRatios.emToPx = callUnitConversionData.lastEmToPx = (parseFloat(CSS.getPropertyValue(dummy, \"paddingLeft\")) || 1) / measurement; /* GET */\r\n\r\n\t\t\t\t\t\t\t\t\tsameRatioIndicators.myParent.removeChild(dummy);\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\tunitRatios.emToPx = callUnitConversionData.lastEmToPx;\r\n\t\t\t\t\t\t\t\t\tunitRatios.percentToPxWidth = callUnitConversionData.lastPercentToPxWidth;\r\n\t\t\t\t\t\t\t\t\tunitRatios.percentToPxHeight = callUnitConversionData.lastPercentToPxHeight;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/***************************\r\n\t\t\t\t\t\t\t\t Element-Agnostic Units\r\n\t\t\t\t\t\t\t\t ***************************/\r\n\r\n\t\t\t\t\t\t\t\t/* Whereas % and em ratios are determined on a per-element basis, the rem unit only needs to be checked\r\n\t\t\t\t\t\t\t\t once per call since it's exclusively dependant upon document.body's fontSize. If this is the first time\r\n\t\t\t\t\t\t\t\t that calculateUnitRatios() is being run during this call, remToPx will still be set to its default value of null,\r\n\t\t\t\t\t\t\t\t so we calculate it now. */\r\n\t\t\t\t\t\t\t\tif (callUnitConversionData.remToPx === null) {\r\n\t\t\t\t\t\t\t\t\t/* Default to browsers' default fontSize of 16px in the case of 0. */\r\n\t\t\t\t\t\t\t\t\tcallUnitConversionData.remToPx = parseFloat(CSS.getPropertyValue(document.body, \"fontSize\")) || 16; /* GET */\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t/* Similarly, viewport units are %-relative to the window's inner dimensions. */\r\n\t\t\t\t\t\t\t\tif (callUnitConversionData.vwToPx === null) {\r\n\t\t\t\t\t\t\t\t\tcallUnitConversionData.vwToPx = parseFloat(window.innerWidth) / 100; /* GET */\r\n\t\t\t\t\t\t\t\t\tcallUnitConversionData.vhToPx = parseFloat(window.innerHeight) / 100; /* GET */\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tunitRatios.remToPx = callUnitConversionData.remToPx;\r\n\t\t\t\t\t\t\t\tunitRatios.vwToPx = callUnitConversionData.vwToPx;\r\n\t\t\t\t\t\t\t\tunitRatios.vhToPx = callUnitConversionData.vhToPx;\r\n\r\n\t\t\t\t\t\t\t\tif (Velocity.debug >= 1) {\r\n\t\t\t\t\t\t\t\t\tconsole.log(\"Unit ratios: \" + JSON.stringify(unitRatios), element);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\treturn unitRatios;\r\n\t\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t\t/********************\r\n\t\t\t\t\t\t\t Unit Conversion\r\n\t\t\t\t\t\t\t ********************/\r\n\r\n\t\t\t\t\t\t\t/* The * and / operators, which are not passed in with an associated unit, inherently use startValue's unit. Skip value and unit conversion. */\r\n\t\t\t\t\t\t\tif (/[\\/*]/.test(operator)) {\r\n\t\t\t\t\t\t\t\tendValueUnitType = startValueUnitType;\r\n\t\t\t\t\t\t\t\t/* If startValue and endValue differ in unit type, convert startValue into the same unit type as endValue so that if endValueUnitType\r\n\t\t\t\t\t\t\t\t is a relative unit (%, em, rem), the values set during tweening will continue to be accurately relative even if the metrics they depend\r\n\t\t\t\t\t\t\t\t on are dynamically changing during the course of the animation. Conversely, if we always normalized into px and used px for setting values, the px ratio\r\n\t\t\t\t\t\t\t\t would become stale if the original unit being animated toward was relative and the underlying metrics change during the animation. */\r\n\t\t\t\t\t\t\t\t/* Since 0 is 0 in any unit type, no conversion is necessary when startValue is 0 -- we just start at 0 with endValueUnitType. */\r\n\t\t\t\t\t\t\t} else if ((startValueUnitType !== endValueUnitType) && startValue !== 0) {\r\n\t\t\t\t\t\t\t\t/* Unit conversion is also skipped when endValue is 0, but *startValueUnitType* must be used for tween values to remain accurate. */\r\n\t\t\t\t\t\t\t\t/* Note: Skipping unit conversion here means that if endValueUnitType was originally a relative unit, the animation won't relatively\r\n\t\t\t\t\t\t\t\t match the underlying metrics if they change, but this is acceptable since we're animating toward invisibility instead of toward visibility,\r\n\t\t\t\t\t\t\t\t which remains past the point of the animation's completion. */\r\n\t\t\t\t\t\t\t\tif (endValue === 0) {\r\n\t\t\t\t\t\t\t\t\tendValueUnitType = startValueUnitType;\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t/* By this point, we cannot avoid unit conversion (it's undesirable since it causes layout thrashing).\r\n\t\t\t\t\t\t\t\t\t If we haven't already, we trigger calculateUnitRatios(), which runs once per element per call. */\r\n\t\t\t\t\t\t\t\t\telementUnitConversionData = elementUnitConversionData || calculateUnitRatios();\r\n\r\n\t\t\t\t\t\t\t\t\t/* The following RegEx matches CSS properties that have their % values measured relative to the x-axis. */\r\n\t\t\t\t\t\t\t\t\t/* Note: W3C spec mandates that all of margin and padding's properties (even top and bottom) are %-relative to the *width* of the parent element. */\r\n\t\t\t\t\t\t\t\t\tvar axis = (/margin|padding|left|right|width|text|word|letter/i.test(property) || /X$/.test(property) || property === \"x\") ? \"x\" : \"y\";\r\n\r\n\t\t\t\t\t\t\t\t\t/* In order to avoid generating n^2 bespoke conversion functions, unit conversion is a two-step process:\r\n\t\t\t\t\t\t\t\t\t 1) Convert startValue into pixels. 2) Convert this new pixel value into endValue's unit type. */\r\n\t\t\t\t\t\t\t\t\tswitch (startValueUnitType) {\r\n\t\t\t\t\t\t\t\t\t\tcase \"%\":\r\n\t\t\t\t\t\t\t\t\t\t\t/* Note: translateX and translateY are the only properties that are %-relative to an element's own dimensions -- not its parent's dimensions.\r\n\t\t\t\t\t\t\t\t\t\t\t Velocity does not include a special conversion process to account for this behavior. Therefore, animating translateX/Y from a % value\r\n\t\t\t\t\t\t\t\t\t\t\t to a non-% value will produce an incorrect start value. Fortunately, this sort of cross-unit conversion is rarely done by users in practice. */\r\n\t\t\t\t\t\t\t\t\t\t\tstartValue *= (axis === \"x\" ? elementUnitConversionData.percentToPxWidth : elementUnitConversionData.percentToPxHeight);\r\n\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\t\t\tcase \"px\":\r\n\t\t\t\t\t\t\t\t\t\t\t/* px acts as our midpoint in the unit conversion process; do nothing. */\r\n\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t\t\t\t\t\tstartValue *= elementUnitConversionData[startValueUnitType + \"ToPx\"];\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t/* Invert the px ratios to convert into to the target unit. */\r\n\t\t\t\t\t\t\t\t\tswitch (endValueUnitType) {\r\n\t\t\t\t\t\t\t\t\t\tcase \"%\":\r\n\t\t\t\t\t\t\t\t\t\t\tstartValue *= 1 / (axis === \"x\" ? elementUnitConversionData.percentToPxWidth : elementUnitConversionData.percentToPxHeight);\r\n\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\t\t\tcase \"px\":\r\n\t\t\t\t\t\t\t\t\t\t\t/* startValue is already in px, do nothing; we're done. */\r\n\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t\t\t\t\t\tstartValue *= 1 / elementUnitConversionData[endValueUnitType + \"ToPx\"];\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/*********************\r\n\t\t\t\t\t\t\t Relative Values\r\n\t\t\t\t\t\t\t *********************/\r\n\r\n\t\t\t\t\t\t\t/* Operator logic must be performed last since it requires unit-normalized start and end values. */\r\n\t\t\t\t\t\t\t/* Note: Relative *percent values* do not behave how most people think; while one would expect \"+=50%\"\r\n\t\t\t\t\t\t\t to increase the property 1.5x its current value, it in fact increases the percent units in absolute terms:\r\n\t\t\t\t\t\t\t 50 points is added on top of the current % value. */\r\n\t\t\t\t\t\t\tswitch (operator) {\r\n\t\t\t\t\t\t\t\tcase \"+\":\r\n\t\t\t\t\t\t\t\t\tendValue = startValue + endValue;\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\tcase \"-\":\r\n\t\t\t\t\t\t\t\t\tendValue = startValue - endValue;\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\tcase \"*\":\r\n\t\t\t\t\t\t\t\t\tendValue = startValue * endValue;\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\t\t\t\tcase \"/\":\r\n\t\t\t\t\t\t\t\t\tendValue = startValue / endValue;\r\n\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/**************************\r\n\t\t\t\t\t\t\t tweensContainer Push\r\n\t\t\t\t\t\t\t **************************/\r\n\r\n\t\t\t\t\t\t\t/* Construct the per-property tween object, and push it to the element's tweensContainer. */\r\n\t\t\t\t\t\t\ttweensContainer[property] = {\r\n\t\t\t\t\t\t\t\trootPropertyValue: rootPropertyValue,\r\n\t\t\t\t\t\t\t\tstartValue: startValue,\r\n\t\t\t\t\t\t\t\tcurrentValue: startValue,\r\n\t\t\t\t\t\t\t\tendValue: endValue,\r\n\t\t\t\t\t\t\t\tunitType: endValueUnitType,\r\n\t\t\t\t\t\t\t\teasing: easing\r\n\t\t\t\t\t\t\t};\r\n\t\t\t\t\t\t\tif (pattern) {\r\n\t\t\t\t\t\t\t\ttweensContainer[property].pattern = pattern;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (Velocity.debug) {\r\n\t\t\t\t\t\t\t\tconsole.log(\"tweensContainer (\" + property + \"): \" + JSON.stringify(tweensContainer[property]), element);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t/* Create a tween out of each property, and append its associated data to tweensContainer. */\r\n\t\t\t\t\t\tfor (var property in propertiesMap) {\r\n\r\n\t\t\t\t\t\t\tif (!propertiesMap.hasOwnProperty(property)) {\r\n\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t/* The original property name's format must be used for the parsePropertyValue() lookup,\r\n\t\t\t\t\t\t\t but we then use its camelCase styling to normalize it for manipulation. */\r\n\t\t\t\t\t\t\tvar propertyName = CSS.Names.camelCase(property),\r\n\t\t\t\t\t\t\t\t\tvalueData = parsePropertyValue(propertiesMap[property]);\r\n\r\n\t\t\t\t\t\t\t/* Find shorthand color properties that have been passed a hex string. */\r\n\t\t\t\t\t\t\t/* Would be quicker to use CSS.Lists.colors.includes() if possible */\r\n\t\t\t\t\t\t\tif (_inArray(CSS.Lists.colors, propertyName)) {\r\n\t\t\t\t\t\t\t\t/* Parse the value data for each shorthand. */\r\n\t\t\t\t\t\t\t\tvar endValue = valueData[0],\r\n\t\t\t\t\t\t\t\t\t\teasing = valueData[1],\r\n\t\t\t\t\t\t\t\t\t\tstartValue = valueData[2];\r\n\r\n\t\t\t\t\t\t\t\tif (CSS.RegEx.isHex.test(endValue)) {\r\n\t\t\t\t\t\t\t\t\t/* Convert the hex strings into their RGB component arrays. */\r\n\t\t\t\t\t\t\t\t\tvar colorComponents = [\"Red\", \"Green\", \"Blue\"],\r\n\t\t\t\t\t\t\t\t\t\t\tendValueRGB = CSS.Values.hexToRgb(endValue),\r\n\t\t\t\t\t\t\t\t\t\t\tstartValueRGB = startValue ? CSS.Values.hexToRgb(startValue) : undefined;\r\n\r\n\t\t\t\t\t\t\t\t\t/* Inject the RGB component tweens into propertiesMap. */\r\n\t\t\t\t\t\t\t\t\tfor (var i = 0; i < colorComponents.length; i++) {\r\n\t\t\t\t\t\t\t\t\t\tvar dataArray = [endValueRGB[i]];\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (easing) {\r\n\t\t\t\t\t\t\t\t\t\t\tdataArray.push(easing);\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (startValueRGB !== undefined) {\r\n\t\t\t\t\t\t\t\t\t\t\tdataArray.push(startValueRGB[i]);\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tfixPropertyValue(propertyName + colorComponents[i], dataArray);\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t/* If we have replaced a shortcut color value then don't update the standard property name */\r\n\t\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tfixPropertyValue(propertyName, valueData);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Along with its property data, store a reference to the element itself onto tweensContainer. */\r\n\t\t\t\t\t\ttweensContainer.element = element;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/*****************\r\n\t\t\t\t\t Call Push\r\n\t\t\t\t\t *****************/\r\n\r\n\t\t\t\t\t/* Note: tweensContainer can be empty if all of the properties in this call's property map were skipped due to not\r\n\t\t\t\t\t being supported by the browser. The element property is used for checking that the tweensContainer has been appended to. */\r\n\t\t\t\t\tif (tweensContainer.element) {\r\n\t\t\t\t\t\t/* Apply the \"velocity-animating\" indicator class. */\r\n\t\t\t\t\t\tCSS.Values.addClass(element, \"velocity-animating\");\r\n\r\n\t\t\t\t\t\t/* The call array houses the tweensContainers for each element being animated in the current call. */\r\n\t\t\t\t\t\tcall.push(tweensContainer);\r\n\r\n\t\t\t\t\t\tdata = Data(element);\r\n\r\n\t\t\t\t\t\tif (data) {\r\n\t\t\t\t\t\t\t/* Store the tweensContainer and options if we're working on the default effects queue, so that they can be used by the reverse command. */\r\n\t\t\t\t\t\t\tif (opts.queue === \"\") {\r\n\r\n\t\t\t\t\t\t\t\tdata.tweensContainer = tweensContainer;\r\n\t\t\t\t\t\t\t\tdata.opts = opts;\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Switch on the element's animating flag. */\r\n\t\t\t\t\t\t\tdata.isAnimating = true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Once the final element in this call's element set has been processed, push the call array onto\r\n\t\t\t\t\t\t Velocity.State.calls for the animation tick to immediately begin processing. */\r\n\t\t\t\t\t\tif (elementsIndex === elementsLength - 1) {\r\n\t\t\t\t\t\t\t/* Add the current call plus its associated metadata (the element set and the call's options) onto the global call container.\r\n\t\t\t\t\t\t\t Anything on this call container is subjected to tick() processing. */\r\n\t\t\t\t\t\t\tVelocity.State.calls.push([call, elements, opts, null, promiseData.resolver, null, 0]);\r\n\r\n\t\t\t\t\t\t\t/* If the animation tick isn't running, start it. (Velocity shuts it off when there are no active calls to process.) */\r\n\t\t\t\t\t\t\tif (Velocity.State.isTicking === false) {\r\n\t\t\t\t\t\t\t\tVelocity.State.isTicking = true;\r\n\r\n\t\t\t\t\t\t\t\t/* Start the tick loop. */\r\n\t\t\t\t\t\t\t\ttick();\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\telementsIndex++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* When the queue option is set to false, the call skips the element's queue and fires immediately. */\r\n\t\t\t\tif (opts.queue === false) {\r\n\t\t\t\t\t/* Since this buildQueue call doesn't respect the element's existing queue (which is where a delay option would have been appended),\r\n\t\t\t\t\t we manually inject the delay property here with an explicit setTimeout. */\r\n\t\t\t\t\tif (opts.delay) {\r\n\r\n\t\t\t\t\t\t/* Temporarily store delayed elements to facilitate access for global pause/resume */\r\n\t\t\t\t\t\tvar callIndex = Velocity.State.delayedElements.count++;\r\n\t\t\t\t\t\tVelocity.State.delayedElements[callIndex] = element;\r\n\r\n\t\t\t\t\t\tvar delayComplete = (function(index) {\r\n\t\t\t\t\t\t\treturn function() {\r\n\t\t\t\t\t\t\t\t/* Clear the temporary element */\r\n\t\t\t\t\t\t\t\tVelocity.State.delayedElements[index] = false;\r\n\r\n\t\t\t\t\t\t\t\t/* Finally, issue the call */\r\n\t\t\t\t\t\t\t\tbuildQueue();\r\n\t\t\t\t\t\t\t};\r\n\t\t\t\t\t\t})(callIndex);\r\n\r\n\t\t\t\t\t\tData(element).delayBegin = (new Date()).getTime();\r\n\t\t\t\t\t\tData(element).delay = parseFloat(opts.delay);\r\n\t\t\t\t\t\tData(element).delayTimer = {\r\n\t\t\t\t\t\t\tsetTimeout: setTimeout(buildQueue, parseFloat(opts.delay)),\r\n\t\t\t\t\t\t\tnext: delayComplete\r\n\t\t\t\t\t\t};\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tbuildQueue();\r\n\t\t\t\t\t}\r\n\t\t\t\t\t/* Otherwise, the call undergoes element queueing as normal. */\r\n\t\t\t\t\t/* Note: To interoperate with jQuery, Velocity uses jQuery's own $.queue() stack for queuing logic. */\r\n\t\t\t\t} else {\r\n\t\t\t\t\t$.queue(element, opts.queue, function(next, clearQueue) {\r\n\t\t\t\t\t\t/* If the clearQueue flag was passed in by the stop command, resolve this call's promise. (Promises can only be resolved once,\r\n\t\t\t\t\t\t so it's fine if this is repeatedly triggered for each element in the associated call.) */\r\n\t\t\t\t\t\tif (clearQueue === true) {\r\n\t\t\t\t\t\t\tif (promiseData.promise) {\r\n\t\t\t\t\t\t\t\tpromiseData.resolver(elements);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t/* Do not continue with animation queueing. */\r\n\t\t\t\t\t\t\treturn true;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* This flag indicates to the upcoming completeCall() function that this queue entry was initiated by Velocity.\r\n\t\t\t\t\t\t See completeCall() for further details. */\r\n\t\t\t\t\t\tVelocity.velocityQueueEntryFlag = true;\r\n\r\n\t\t\t\t\t\tbuildQueue(next);\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/*********************\r\n\t\t\t\t Auto-Dequeuing\r\n\t\t\t\t *********************/\r\n\r\n\t\t\t\t/* As per jQuery's $.queue() behavior, to fire the first non-custom-queue entry on an element, the element\r\n\t\t\t\t must be dequeued if its queue stack consists *solely* of the current call. (This can be determined by checking\r\n\t\t\t\t for the \"inprogress\" item that jQuery prepends to active queue stack arrays.) Regardless, whenever the element's\r\n\t\t\t\t queue is further appended with additional items -- including $.delay()'s or even $.animate() calls, the queue's\r\n\t\t\t\t first entry is automatically fired. This behavior contrasts that of custom queues, which never auto-fire. */\r\n\t\t\t\t/* Note: When an element set is being subjected to a non-parallel Velocity call, the animation will not begin until\r\n\t\t\t\t each one of the elements in the set has reached the end of its individually pre-existing queue chain. */\r\n\t\t\t\t/* Note: Unfortunately, most people don't fully grasp jQuery's powerful, yet quirky, $.queue() function.\r\n\t\t\t\t Lean more here: http://stackoverflow.com/questions/1058158/can-somebody-explain-jquery-queue-to-me */\r\n\t\t\t\tif ((opts.queue === \"\" || opts.queue === \"fx\") && $.queue(element)[0] !== \"inprogress\") {\r\n\t\t\t\t\t$.dequeue(element);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/**************************\r\n\t\t\t Element Set Iteration\r\n\t\t\t **************************/\r\n\r\n\t\t\t/* If the \"nodeType\" property exists on the elements variable, we're animating a single element.\r\n\t\t\t Place it in an array so that $.each() can iterate over it. */\r\n\t\t\t$.each(elements, function(i, element) {\r\n\t\t\t\t/* Ensure each element in a set has a nodeType (is a real element) to avoid throwing errors. */\r\n\t\t\t\tif (Type.isNode(element)) {\r\n\t\t\t\t\tprocessElement(element, i);\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\t\t/******************\r\n\t\t\t Option: Loop\r\n\t\t\t ******************/\r\n\r\n\t\t\t/* The loop option accepts an integer indicating how many times the element should loop between the values in the\r\n\t\t\t current call's properties map and the element's property values prior to this call. */\r\n\t\t\t/* Note: The loop option's logic is performed here -- after element processing -- because the current call needs\r\n\t\t\t to undergo its queue insertion prior to the loop option generating its series of constituent \"reverse\" calls,\r\n\t\t\t which chain after the current call. Two reverse calls (two \"alternations\") constitute one loop. */\r\n\t\t\topts = $.extend({}, Velocity.defaults, options);\r\n\t\t\topts.loop = parseInt(opts.loop, 10);\r\n\t\t\tvar reverseCallsCount = (opts.loop * 2) - 1;\r\n\r\n\t\t\tif (opts.loop) {\r\n\t\t\t\t/* Double the loop count to convert it into its appropriate number of \"reverse\" calls.\r\n\t\t\t\t Subtract 1 from the resulting value since the current call is included in the total alternation count. */\r\n\t\t\t\tfor (var x = 0; x < reverseCallsCount; x++) {\r\n\t\t\t\t\t/* Since the logic for the reverse action occurs inside Queueing and therefore this call's options object\r\n\t\t\t\t\t isn't parsed until then as well, the current call's delay option must be explicitly passed into the reverse\r\n\t\t\t\t\t call so that the delay logic that occurs inside *Pre-Queueing* can process it. */\r\n\t\t\t\t\tvar reverseOptions = {\r\n\t\t\t\t\t\tdelay: opts.delay,\r\n\t\t\t\t\t\tprogress: opts.progress\r\n\t\t\t\t\t};\r\n\r\n\t\t\t\t\t/* If a complete callback was passed into this call, transfer it to the loop redirect's final \"reverse\" call\r\n\t\t\t\t\t so that it's triggered when the entire redirect is complete (and not when the very first animation is complete). */\r\n\t\t\t\t\tif (x === reverseCallsCount - 1) {\r\n\t\t\t\t\t\treverseOptions.display = opts.display;\r\n\t\t\t\t\t\treverseOptions.visibility = opts.visibility;\r\n\t\t\t\t\t\treverseOptions.complete = opts.complete;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tanimate(elements, \"reverse\", reverseOptions);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/***************\r\n\t\t\t Chaining\r\n\t\t\t ***************/\r\n\r\n\t\t\t/* Return the elements back to the call chain, with wrapped elements taking precedence in case Velocity was called via the $.fn. extension. */\r\n\t\t\treturn getChain();\r\n\t\t};\r\n\r\n\t\t/* Turn Velocity into the animation function, extended with the pre-existing Velocity object. */\r\n\t\tVelocity = $.extend(animate, Velocity);\r\n\t\t/* For legacy support, also expose the literal animate method. */\r\n\t\tVelocity.animate = animate;\r\n\r\n\t\t/**************\r\n\t\t Timing\r\n\t\t **************/\r\n\r\n\t\t/* Ticker function. */\r\n\t\tvar ticker = window.requestAnimationFrame || rAFShim;\r\n\r\n\t\t/* Inactive browser tabs pause rAF, which results in all active animations immediately sprinting to their completion states when the tab refocuses.\r\n\t\t To get around this, we dynamically switch rAF to setTimeout (which the browser *doesn't* pause) when the tab loses focus. We skip this for mobile\r\n\t\t devices to avoid wasting battery power on inactive tabs. */\r\n\t\t/* Note: Tab focus detection doesn't work on older versions of IE, but that's okay since they don't support rAF to begin with. */\r\n\t\tif (!Velocity.State.isMobile && document.hidden !== undefined) {\r\n\t\t\tvar updateTicker = function() {\r\n\t\t\t\t/* Reassign the rAF function (which the global tick() function uses) based on the tab's focus state. */\r\n\t\t\t\tif (document.hidden) {\r\n\t\t\t\t\tticker = function(callback) {\r\n\t\t\t\t\t\t/* The tick function needs a truthy first argument in order to pass its internal timestamp check. */\r\n\t\t\t\t\t\treturn setTimeout(function() {\r\n\t\t\t\t\t\t\tcallback(true);\r\n\t\t\t\t\t\t}, 16);\r\n\t\t\t\t\t};\r\n\r\n\t\t\t\t\t/* The rAF loop has been paused by the browser, so we manually restart the tick. */\r\n\t\t\t\t\ttick();\r\n\t\t\t\t} else {\r\n\t\t\t\t\tticker = window.requestAnimationFrame || rAFShim;\r\n\t\t\t\t}\r\n\t\t\t};\r\n\r\n\t\t\t/* Page could be sitting in the background at this time (i.e. opened as new tab) so making sure we use correct ticker from the start */\r\n\t\t\tupdateTicker();\r\n\r\n\t\t\t/* And then run check again every time visibility changes */\r\n\t\t\tdocument.addEventListener(\"visibilitychange\", updateTicker);\r\n\t\t}\r\n\r\n\t\t/************\r\n\t\t Tick\r\n\t\t ************/\r\n\r\n\t\t/* Note: All calls to Velocity are pushed to the Velocity.State.calls array, which is fully iterated through upon each tick. */\r\n\t\tfunction tick(timestamp) {\r\n\t\t\t/* An empty timestamp argument indicates that this is the first tick occurence since ticking was turned on.\r\n\t\t\t We leverage this metadata to fully ignore the first tick pass since RAF's initial pass is fired whenever\r\n\t\t\t the browser's next tick sync time occurs, which results in the first elements subjected to Velocity\r\n\t\t\t calls being animated out of sync with any elements animated immediately thereafter. In short, we ignore\r\n\t\t\t the first RAF tick pass so that elements being immediately consecutively animated -- instead of simultaneously animated\r\n\t\t\t by the same Velocity call -- are properly batched into the same initial RAF tick and consequently remain in sync thereafter. */\r\n\t\t\tif (timestamp) {\r\n\t\t\t\t/* We normally use RAF's high resolution timestamp but as it can be significantly offset when the browser is\r\n\t\t\t\t under high stress we give the option for choppiness over allowing the browser to drop huge chunks of frames.\r\n\t\t\t\t We use performance.now() and shim it if it doesn't exist for when the tab is hidden. */\r\n\t\t\t\tvar timeCurrent = Velocity.timestamp && timestamp !== true ? timestamp : performance.now();\r\n\r\n\t\t\t\t/********************\r\n\t\t\t\t Call Iteration\r\n\t\t\t\t ********************/\r\n\r\n\t\t\t\tvar callsLength = Velocity.State.calls.length;\r\n\r\n\t\t\t\t/* To speed up iterating over this array, it is compacted (falsey items -- calls that have completed -- are removed)\r\n\t\t\t\t when its length has ballooned to a point that can impact tick performance. This only becomes necessary when animation\r\n\t\t\t\t has been continuous with many elements over a long period of time; whenever all active calls are completed, completeCall() clears Velocity.State.calls. */\r\n\t\t\t\tif (callsLength > 10000) {\r\n\t\t\t\t\tVelocity.State.calls = compactSparseArray(Velocity.State.calls);\r\n\t\t\t\t\tcallsLength = Velocity.State.calls.length;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Iterate through each active call. */\r\n\t\t\t\tfor (var i = 0; i < callsLength; i++) {\r\n\t\t\t\t\t/* When a Velocity call is completed, its Velocity.State.calls entry is set to false. Continue on to the next call. */\r\n\t\t\t\t\tif (!Velocity.State.calls[i]) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/************************\r\n\t\t\t\t\t Call-Wide Variables\r\n\t\t\t\t\t ************************/\r\n\r\n\t\t\t\t\tvar callContainer = Velocity.State.calls[i],\r\n\t\t\t\t\t\t\tcall = callContainer[0],\r\n\t\t\t\t\t\t\topts = callContainer[2],\r\n\t\t\t\t\t\t\ttimeStart = callContainer[3],\r\n\t\t\t\t\t\t\tfirstTick = !timeStart,\r\n\t\t\t\t\t\t\ttweenDummyValue = null,\r\n\t\t\t\t\t\t\tpauseObject = callContainer[5],\r\n\t\t\t\t\t\t\tmillisecondsEllapsed = callContainer[6];\r\n\r\n\r\n\r\n\t\t\t\t\t/* If timeStart is undefined, then this is the first time that this call has been processed by tick().\r\n\t\t\t\t\t We assign timeStart now so that its value is as close to the real animation start time as possible.\r\n\t\t\t\t\t (Conversely, had timeStart been defined when this call was added to Velocity.State.calls, the delay\r\n\t\t\t\t\t between that time and now would cause the first few frames of the tween to be skipped since\r\n\t\t\t\t\t percentComplete is calculated relative to timeStart.) */\r\n\t\t\t\t\t/* Further, subtract 16ms (the approximate resolution of RAF) from the current time value so that the\r\n\t\t\t\t\t first tick iteration isn't wasted by animating at 0% tween completion, which would produce the\r\n\t\t\t\t\t same style value as the element's current value. */\r\n\t\t\t\t\tif (!timeStart) {\r\n\t\t\t\t\t\ttimeStart = Velocity.State.calls[i][3] = timeCurrent - 16;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* If a pause object is present, skip processing unless it has been set to resume */\r\n\t\t\t\t\tif (pauseObject) {\r\n\t\t\t\t\t\tif (pauseObject.resume === true) {\r\n\t\t\t\t\t\t\t/* Update the time start to accomodate the paused completion amount */\r\n\t\t\t\t\t\t\ttimeStart = callContainer[3] = Math.round(timeCurrent - millisecondsEllapsed - 16);\r\n\r\n\t\t\t\t\t\t\t/* Remove pause object after processing */\r\n\t\t\t\t\t\t\tcallContainer[5] = null;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tmillisecondsEllapsed = callContainer[6] = timeCurrent - timeStart;\r\n\r\n\t\t\t\t\t/* The tween's completion percentage is relative to the tween's start time, not the tween's start value\r\n\t\t\t\t\t (which would result in unpredictable tween durations since JavaScript's timers are not particularly accurate).\r\n\t\t\t\t\t Accordingly, we ensure that percentComplete does not exceed 1. */\r\n\t\t\t\t\tvar percentComplete = Math.min((millisecondsEllapsed) / opts.duration, 1);\r\n\r\n\t\t\t\t\t/**********************\r\n\t\t\t\t\t Element Iteration\r\n\t\t\t\t\t **********************/\r\n\r\n\t\t\t\t\t/* For every call, iterate through each of the elements in its set. */\r\n\t\t\t\t\tfor (var j = 0, callLength = call.length; j < callLength; j++) {\r\n\t\t\t\t\t\tvar tweensContainer = call[j],\r\n\t\t\t\t\t\t\t\telement = tweensContainer.element;\r\n\r\n\t\t\t\t\t\t/* Check to see if this element has been deleted midway through the animation by checking for the\r\n\t\t\t\t\t\t continued existence of its data cache. If it's gone, or the element is currently paused, skip animating this element. */\r\n\t\t\t\t\t\tif (!Data(element)) {\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tvar transformPropertyExists = false;\r\n\r\n\t\t\t\t\t\t/**********************************\r\n\t\t\t\t\t\t Display & Visibility Toggling\r\n\t\t\t\t\t\t **********************************/\r\n\r\n\t\t\t\t\t\t/* If the display option is set to non-\"none\", set it upfront so that the element can become visible before tweening begins.\r\n\t\t\t\t\t\t (Otherwise, display's \"none\" value is set in completeCall() once the animation has completed.) */\r\n\t\t\t\t\t\tif (opts.display !== undefined && opts.display !== null && opts.display !== \"none\") {\r\n\t\t\t\t\t\t\tif (opts.display === \"flex\") {\r\n\t\t\t\t\t\t\t\tvar flexValues = [\"-webkit-box\", \"-moz-box\", \"-ms-flexbox\", \"-webkit-flex\"];\r\n\r\n\t\t\t\t\t\t\t\t$.each(flexValues, function(i, flexValue) {\r\n\t\t\t\t\t\t\t\t\tCSS.setPropertyValue(element, \"display\", flexValue);\r\n\t\t\t\t\t\t\t\t});\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tCSS.setPropertyValue(element, \"display\", opts.display);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Same goes with the visibility option, but its \"none\" equivalent is \"hidden\". */\r\n\t\t\t\t\t\tif (opts.visibility !== undefined && opts.visibility !== \"hidden\") {\r\n\t\t\t\t\t\t\tCSS.setPropertyValue(element, \"visibility\", opts.visibility);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/************************\r\n\t\t\t\t\t\t Property Iteration\r\n\t\t\t\t\t\t ************************/\r\n\r\n\t\t\t\t\t\t/* For every element, iterate through each property. */\r\n\t\t\t\t\t\tfor (var property in tweensContainer) {\r\n\t\t\t\t\t\t\t/* Note: In addition to property tween data, tweensContainer contains a reference to its associated element. */\r\n\t\t\t\t\t\t\tif (tweensContainer.hasOwnProperty(property) && property !== \"element\") {\r\n\t\t\t\t\t\t\t\tvar tween = tweensContainer[property],\r\n\t\t\t\t\t\t\t\t\t\tcurrentValue,\r\n\t\t\t\t\t\t\t\t\t\t/* Easing can either be a pre-genereated function or a string that references a pre-registered easing\r\n\t\t\t\t\t\t\t\t\t\t on the Velocity.Easings object. In either case, return the appropriate easing *function*. */\r\n\t\t\t\t\t\t\t\t\t\teasing = Type.isString(tween.easing) ? Velocity.Easings[tween.easing] : tween.easing;\r\n\r\n\t\t\t\t\t\t\t\t/******************************\r\n\t\t\t\t\t\t\t\t Current Value Calculation\r\n\t\t\t\t\t\t\t\t ******************************/\r\n\r\n\t\t\t\t\t\t\t\tif (Type.isString(tween.pattern)) {\r\n\t\t\t\t\t\t\t\t\tvar patternReplace = percentComplete === 1 ?\r\n\t\t\t\t\t\t\t\t\t\t\tfunction($0, index, round) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tvar result = tween.endValue[index];\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\treturn round ? Math.round(result) : result;\r\n\t\t\t\t\t\t\t\t\t\t\t} :\r\n\t\t\t\t\t\t\t\t\t\t\tfunction($0, index, round) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tvar startValue = tween.startValue[index],\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\ttweenDelta = tween.endValue[index] - startValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tresult = startValue + (tweenDelta * easing(percentComplete, opts, tweenDelta));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\treturn round ? Math.round(result) : result;\r\n\t\t\t\t\t\t\t\t\t\t\t};\r\n\r\n\t\t\t\t\t\t\t\t\tcurrentValue = tween.pattern.replace(/{(\\d+)(!)?}/g, patternReplace);\r\n\t\t\t\t\t\t\t\t} else if (percentComplete === 1) {\r\n\t\t\t\t\t\t\t\t\t/* If this is the last tick pass (if we've reached 100% completion for this tween),\r\n\t\t\t\t\t\t\t\t\t ensure that currentValue is explicitly set to its target endValue so that it's not subjected to any rounding. */\r\n\t\t\t\t\t\t\t\t\tcurrentValue = tween.endValue;\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t/* Otherwise, calculate currentValue based on the current delta from startValue. */\r\n\t\t\t\t\t\t\t\t\tvar tweenDelta = tween.endValue - tween.startValue;\r\n\r\n\t\t\t\t\t\t\t\t\tcurrentValue = tween.startValue + (tweenDelta * easing(percentComplete, opts, tweenDelta));\r\n\t\t\t\t\t\t\t\t\t/* If no value change is occurring, don't proceed with DOM updating. */\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\tif (!firstTick && (currentValue === tween.currentValue)) {\r\n\t\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\ttween.currentValue = currentValue;\r\n\r\n\t\t\t\t\t\t\t\t/* If we're tweening a fake 'tween' property in order to log transition values, update the one-per-call variable so that\r\n\t\t\t\t\t\t\t\t it can be passed into the progress callback. */\r\n\t\t\t\t\t\t\t\tif (property === \"tween\") {\r\n\t\t\t\t\t\t\t\t\ttweenDummyValue = currentValue;\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t/******************\r\n\t\t\t\t\t\t\t\t\t Hooks: Part I\r\n\t\t\t\t\t\t\t\t\t ******************/\r\n\t\t\t\t\t\t\t\t\tvar hookRoot;\r\n\r\n\t\t\t\t\t\t\t\t\t/* For hooked properties, the newly-updated rootPropertyValueCache is cached onto the element so that it can be used\r\n\t\t\t\t\t\t\t\t\t for subsequent hooks in this call that are associated with the same root property. If we didn't cache the updated\r\n\t\t\t\t\t\t\t\t\t rootPropertyValue, each subsequent update to the root property in this tick pass would reset the previous hook's\r\n\t\t\t\t\t\t\t\t\t updates to rootPropertyValue prior to injection. A nice performance byproduct of rootPropertyValue caching is that\r\n\t\t\t\t\t\t\t\t\t subsequently chained animations using the same hookRoot but a different hook can use this cached rootPropertyValue. */\r\n\t\t\t\t\t\t\t\t\tif (CSS.Hooks.registered[property]) {\r\n\t\t\t\t\t\t\t\t\t\thookRoot = CSS.Hooks.getRoot(property);\r\n\r\n\t\t\t\t\t\t\t\t\t\tvar rootPropertyValueCache = Data(element).rootPropertyValueCache[hookRoot];\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (rootPropertyValueCache) {\r\n\t\t\t\t\t\t\t\t\t\t\ttween.rootPropertyValue = rootPropertyValueCache;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t/*****************\r\n\t\t\t\t\t\t\t\t\t DOM Update\r\n\t\t\t\t\t\t\t\t\t *****************/\r\n\r\n\t\t\t\t\t\t\t\t\t/* setPropertyValue() returns an array of the property name and property value post any normalization that may have been performed. */\r\n\t\t\t\t\t\t\t\t\t/* Note: To solve an IE<=8 positioning bug, the unit type is dropped when setting a property value of 0. */\r\n\t\t\t\t\t\t\t\t\tvar adjustedSetData = CSS.setPropertyValue(element, /* SET */\r\n\t\t\t\t\t\t\t\t\t\t\tproperty,\r\n\t\t\t\t\t\t\t\t\t\t\ttween.currentValue + (IE < 9 && parseFloat(currentValue) === 0 ? \"\" : tween.unitType),\r\n\t\t\t\t\t\t\t\t\t\t\ttween.rootPropertyValue,\r\n\t\t\t\t\t\t\t\t\t\t\ttween.scrollData);\r\n\r\n\t\t\t\t\t\t\t\t\t/*******************\r\n\t\t\t\t\t\t\t\t\t Hooks: Part II\r\n\t\t\t\t\t\t\t\t\t *******************/\r\n\r\n\t\t\t\t\t\t\t\t\t/* Now that we have the hook's updated rootPropertyValue (the post-processed value provided by adjustedSetData), cache it onto the element. */\r\n\t\t\t\t\t\t\t\t\tif (CSS.Hooks.registered[property]) {\r\n\t\t\t\t\t\t\t\t\t\t/* Since adjustedSetData contains normalized data ready for DOM updating, the rootPropertyValue needs to be re-extracted from its normalized form. ?? */\r\n\t\t\t\t\t\t\t\t\t\tif (CSS.Normalizations.registered[hookRoot]) {\r\n\t\t\t\t\t\t\t\t\t\t\tData(element).rootPropertyValueCache[hookRoot] = CSS.Normalizations.registered[hookRoot](\"extract\", null, adjustedSetData[1]);\r\n\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\tData(element).rootPropertyValueCache[hookRoot] = adjustedSetData[1];\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t/***************\r\n\t\t\t\t\t\t\t\t\t Transforms\r\n\t\t\t\t\t\t\t\t\t ***************/\r\n\r\n\t\t\t\t\t\t\t\t\t/* Flag whether a transform property is being animated so that flushTransformCache() can be triggered once this tick pass is complete. */\r\n\t\t\t\t\t\t\t\t\tif (adjustedSetData[0] === \"transform\") {\r\n\t\t\t\t\t\t\t\t\t\ttransformPropertyExists = true;\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/****************\r\n\t\t\t\t\t\t mobileHA\r\n\t\t\t\t\t\t ****************/\r\n\r\n\t\t\t\t\t\t/* If mobileHA is enabled, set the translate3d transform to null to force hardware acceleration.\r\n\t\t\t\t\t\t It's safe to override this property since Velocity doesn't actually support its animation (hooks are used in its place). */\r\n\t\t\t\t\t\tif (opts.mobileHA) {\r\n\t\t\t\t\t\t\t/* Don't set the null transform hack if we've already done so. */\r\n\t\t\t\t\t\t\tif (Data(element).transformCache.translate3d === undefined) {\r\n\t\t\t\t\t\t\t\t/* All entries on the transformCache object are later concatenated into a single transform string via flushTransformCache(). */\r\n\t\t\t\t\t\t\t\tData(element).transformCache.translate3d = \"(0px, 0px, 0px)\";\r\n\r\n\t\t\t\t\t\t\t\ttransformPropertyExists = true;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (transformPropertyExists) {\r\n\t\t\t\t\t\t\tCSS.flushTransformCache(element);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* The non-\"none\" display value is only applied to an element once -- when its associated call is first ticked through.\r\n\t\t\t\t\t Accordingly, it's set to false so that it isn't re-processed by this call in the next tick. */\r\n\t\t\t\t\tif (opts.display !== undefined && opts.display !== \"none\") {\r\n\t\t\t\t\t\tVelocity.State.calls[i][2].display = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (opts.visibility !== undefined && opts.visibility !== \"hidden\") {\r\n\t\t\t\t\t\tVelocity.State.calls[i][2].visibility = false;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Pass the elements and the timing data (percentComplete, msRemaining, timeStart, tweenDummyValue) into the progress callback. */\r\n\t\t\t\t\tif (opts.progress) {\r\n\t\t\t\t\t\topts.progress.call(callContainer[1],\r\n\t\t\t\t\t\t\t\tcallContainer[1],\r\n\t\t\t\t\t\t\t\tpercentComplete,\r\n\t\t\t\t\t\t\t\tMath.max(0, (timeStart + opts.duration) - timeCurrent),\r\n\t\t\t\t\t\t\t\ttimeStart,\r\n\t\t\t\t\t\t\t\ttweenDummyValue);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* If this call has finished tweening, pass its index to completeCall() to handle call cleanup. */\r\n\t\t\t\t\tif (percentComplete === 1) {\r\n\t\t\t\t\t\tcompleteCall(i);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/* Note: completeCall() sets the isTicking flag to false when the last call on Velocity.State.calls has completed. */\r\n\t\t\tif (Velocity.State.isTicking) {\r\n\t\t\t\tticker(tick);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t/**********************\r\n\t\t Call Completion\r\n\t\t **********************/\r\n\r\n\t\t/* Note: Unlike tick(), which processes all active calls at once, call completion is handled on a per-call basis. */\r\n\t\tfunction completeCall(callIndex, isStopped) {\r\n\t\t\t/* Ensure the call exists. */\r\n\t\t\tif (!Velocity.State.calls[callIndex]) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\r\n\t\t\t/* Pull the metadata from the call. */\r\n\t\t\tvar call = Velocity.State.calls[callIndex][0],\r\n\t\t\t\t\telements = Velocity.State.calls[callIndex][1],\r\n\t\t\t\t\topts = Velocity.State.calls[callIndex][2],\r\n\t\t\t\t\tresolver = Velocity.State.calls[callIndex][4];\r\n\r\n\t\t\tvar remainingCallsExist = false;\r\n\r\n\t\t\t/*************************\r\n\t\t\t Element Finalization\r\n\t\t\t *************************/\r\n\r\n\t\t\tfor (var i = 0, callLength = call.length; i < callLength; i++) {\r\n\t\t\t\tvar element = call[i].element;\r\n\r\n\t\t\t\t/* If the user set display to \"none\" (intending to hide the element), set it now that the animation has completed. */\r\n\t\t\t\t/* Note: display:none isn't set when calls are manually stopped (via Velocity(\"stop\"). */\r\n\t\t\t\t/* Note: Display gets ignored with \"reverse\" calls and infinite loops, since this behavior would be undesirable. */\r\n\t\t\t\tif (!isStopped && !opts.loop) {\r\n\t\t\t\t\tif (opts.display === \"none\") {\r\n\t\t\t\t\t\tCSS.setPropertyValue(element, \"display\", opts.display);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tif (opts.visibility === \"hidden\") {\r\n\t\t\t\t\t\tCSS.setPropertyValue(element, \"visibility\", opts.visibility);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* If the element's queue is empty (if only the \"inprogress\" item is left at position 0) or if its queue is about to run\r\n\t\t\t\t a non-Velocity-initiated entry, turn off the isAnimating flag. A non-Velocity-initiatied queue entry's logic might alter\r\n\t\t\t\t an element's CSS values and thereby cause Velocity's cached value data to go stale. To detect if a queue entry was initiated by Velocity,\r\n\t\t\t\t we check for the existence of our special Velocity.queueEntryFlag declaration, which minifiers won't rename since the flag\r\n\t\t\t\t is assigned to jQuery's global $ object and thus exists out of Velocity's own scope. */\r\n\t\t\t\tvar data = Data(element);\r\n\r\n\t\t\t\tif (opts.loop !== true && ($.queue(element)[1] === undefined || !/\\.velocityQueueEntryFlag/i.test($.queue(element)[1]))) {\r\n\t\t\t\t\t/* The element may have been deleted. Ensure that its data cache still exists before acting on it. */\r\n\t\t\t\t\tif (data) {\r\n\t\t\t\t\t\tdata.isAnimating = false;\r\n\t\t\t\t\t\t/* Clear the element's rootPropertyValueCache, which will become stale. */\r\n\t\t\t\t\t\tdata.rootPropertyValueCache = {};\r\n\r\n\t\t\t\t\t\tvar transformHAPropertyExists = false;\r\n\t\t\t\t\t\t/* If any 3D transform subproperty is at its default value (regardless of unit type), remove it. */\r\n\t\t\t\t\t\t$.each(CSS.Lists.transforms3D, function(i, transformName) {\r\n\t\t\t\t\t\t\tvar defaultValue = /^scale/.test(transformName) ? 1 : 0,\r\n\t\t\t\t\t\t\t\t\tcurrentValue = data.transformCache[transformName];\r\n\r\n\t\t\t\t\t\t\tif (data.transformCache[transformName] !== undefined && new RegExp(\"^\\\\(\" + defaultValue + \"[^.]\").test(currentValue)) {\r\n\t\t\t\t\t\t\t\ttransformHAPropertyExists = true;\r\n\r\n\t\t\t\t\t\t\t\tdelete data.transformCache[transformName];\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t});\r\n\r\n\t\t\t\t\t\t/* Mobile devices have hardware acceleration removed at the end of the animation in order to avoid hogging the GPU's memory. */\r\n\t\t\t\t\t\tif (opts.mobileHA) {\r\n\t\t\t\t\t\t\ttransformHAPropertyExists = true;\r\n\t\t\t\t\t\t\tdelete data.transformCache.translate3d;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Flush the subproperty removals to the DOM. */\r\n\t\t\t\t\t\tif (transformHAPropertyExists) {\r\n\t\t\t\t\t\t\tCSS.flushTransformCache(element);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t/* Remove the \"velocity-animating\" indicator class. */\r\n\t\t\t\t\t\tCSS.Values.removeClass(element, \"velocity-animating\");\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/*********************\r\n\t\t\t\t Option: Complete\r\n\t\t\t\t *********************/\r\n\r\n\t\t\t\t/* Complete is fired once per call (not once per element) and is passed the full raw DOM element set as both its context and its first argument. */\r\n\t\t\t\t/* Note: Callbacks aren't fired when calls are manually stopped (via Velocity(\"stop\"). */\r\n\t\t\t\tif (!isStopped && opts.complete && !opts.loop && (i === callLength - 1)) {\r\n\t\t\t\t\t/* We throw callbacks in a setTimeout so that thrown errors don't halt the execution of Velocity itself. */\r\n\t\t\t\t\ttry {\r\n\t\t\t\t\t\topts.complete.call(elements, elements);\r\n\t\t\t\t\t} catch (error) {\r\n\t\t\t\t\t\tsetTimeout(function() {\r\n\t\t\t\t\t\t\tthrow error;\r\n\t\t\t\t\t\t}, 1);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/**********************\r\n\t\t\t\t Promise Resolving\r\n\t\t\t\t **********************/\r\n\r\n\t\t\t\t/* Note: Infinite loops don't return promises. */\r\n\t\t\t\tif (resolver && opts.loop !== true) {\r\n\t\t\t\t\tresolver(elements);\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/****************************\r\n\t\t\t\t Option: Loop (Infinite)\r\n\t\t\t\t ****************************/\r\n\r\n\t\t\t\tif (data && opts.loop === true && !isStopped) {\r\n\t\t\t\t\t/* If a rotateX/Y/Z property is being animated by 360 deg with loop:true, swap tween start/end values to enable\r\n\t\t\t\t\t continuous iterative rotation looping. (Otherise, the element would just rotate back and forth.) */\r\n\t\t\t\t\t$.each(data.tweensContainer, function(propertyName, tweenContainer) {\r\n\t\t\t\t\t\tif (/^rotate/.test(propertyName) && ((parseFloat(tweenContainer.startValue) - parseFloat(tweenContainer.endValue)) % 360 === 0)) {\r\n\t\t\t\t\t\t\tvar oldStartValue = tweenContainer.startValue;\r\n\r\n\t\t\t\t\t\t\ttweenContainer.startValue = tweenContainer.endValue;\r\n\t\t\t\t\t\t\ttweenContainer.endValue = oldStartValue;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (/^backgroundPosition/.test(propertyName) && parseFloat(tweenContainer.endValue) === 100 && tweenContainer.unitType === \"%\") {\r\n\t\t\t\t\t\t\ttweenContainer.endValue = 0;\r\n\t\t\t\t\t\t\ttweenContainer.startValue = 100;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});\r\n\r\n\t\t\t\t\tVelocity(element, \"reverse\", {loop: true, delay: opts.delay});\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/***************\r\n\t\t\t\t Dequeueing\r\n\t\t\t\t ***************/\r\n\r\n\t\t\t\t/* Fire the next call in the queue so long as this call's queue wasn't set to false (to trigger a parallel animation),\r\n\t\t\t\t which would have already caused the next call to fire. Note: Even if the end of the animation queue has been reached,\r\n\t\t\t\t $.dequeue() must still be called in order to completely clear jQuery's animation queue. */\r\n\t\t\t\tif (opts.queue !== false) {\r\n\t\t\t\t\t$.dequeue(element, opts.queue);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/************************\r\n\t\t\t Calls Array Cleanup\r\n\t\t\t ************************/\r\n\r\n\t\t\t/* Since this call is complete, set it to false so that the rAF tick skips it. This array is later compacted via compactSparseArray().\r\n\t\t\t (For performance reasons, the call is set to false instead of being deleted from the array: http://www.html5rocks.com/en/tutorials/speed/v8/) */\r\n\t\t\tVelocity.State.calls[callIndex] = false;\r\n\r\n\t\t\t/* Iterate through the calls array to determine if this was the final in-progress animation.\r\n\t\t\t If so, set a flag to end ticking and clear the calls array. */\r\n\t\t\tfor (var j = 0, callsLength = Velocity.State.calls.length; j < callsLength; j++) {\r\n\t\t\t\tif (Velocity.State.calls[j] !== false) {\r\n\t\t\t\t\tremainingCallsExist = true;\r\n\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (remainingCallsExist === false) {\r\n\t\t\t\t/* tick() will detect this flag upon its next iteration and subsequently turn itself off. */\r\n\t\t\t\tVelocity.State.isTicking = false;\r\n\r\n\t\t\t\t/* Clear the calls array so that its length is reset. */\r\n\t\t\t\tdelete Velocity.State.calls;\r\n\t\t\t\tVelocity.State.calls = [];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t/******************\r\n\t\t Frameworks\r\n\t\t ******************/\r\n\r\n\t\t/* Both jQuery and Zepto allow their $.fn object to be extended to allow wrapped elements to be subjected to plugin calls.\r\n\t\t If either framework is loaded, register a \"velocity\" extension pointing to Velocity's core animate() method.  Velocity\r\n\t\t also registers itself onto a global container (window.jQuery || window.Zepto || window) so that certain features are\r\n\t\t accessible beyond just a per-element scope. This master object contains an .animate() method, which is later assigned to $.fn\r\n\t\t (if jQuery or Zepto are present). Accordingly, Velocity can both act on wrapped DOM elements and stand alone for targeting raw DOM elements. */\r\n\t\tglobal.Velocity = Velocity;\r\n\r\n\t\tif (global !== window) {\r\n\t\t\t/* Assign the element function to Velocity's core animate() method. */\r\n\t\t\tglobal.fn.velocity = animate;\r\n\t\t\t/* Assign the object function's defaults to Velocity's global defaults object. */\r\n\t\t\tglobal.fn.velocity.defaults = Velocity.defaults;\r\n\t\t}\r\n\r\n\t\t/***********************\r\n\t\t Packaged Redirects\r\n\t\t ***********************/\r\n\r\n\t\t/* slideUp, slideDown */\r\n\t\t$.each([\"Down\", \"Up\"], function(i, direction) {\r\n\t\t\tVelocity.Redirects[\"slide\" + direction] = function(element, options, elementsIndex, elementsSize, elements, promiseData) {\r\n\t\t\t\tvar opts = $.extend({}, options),\r\n\t\t\t\t\t\tbegin = opts.begin,\r\n\t\t\t\t\t\tcomplete = opts.complete,\r\n\t\t\t\t\t\tinlineValues = {},\r\n\t\t\t\t\t\tcomputedValues = {height: \"\", marginTop: \"\", marginBottom: \"\", paddingTop: \"\", paddingBottom: \"\"};\r\n\r\n\t\t\t\tif (opts.display === undefined) {\r\n\t\t\t\t\t/* Show the element before slideDown begins and hide the element after slideUp completes. */\r\n\t\t\t\t\t/* Note: Inline elements cannot have dimensions animated, so they're reverted to inline-block. */\r\n\t\t\t\t\topts.display = (direction === \"Down\" ? (Velocity.CSS.Values.getDisplayType(element) === \"inline\" ? \"inline-block\" : \"block\") : \"none\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\topts.begin = function() {\r\n\t\t\t\t\t/* If the user passed in a begin callback, fire it now. */\r\n\t\t\t\t\tif (elementsIndex === 0 && begin) {\r\n\t\t\t\t\t\tbegin.call(elements, elements);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Cache the elements' original vertical dimensional property values so that we can animate back to them. */\r\n\t\t\t\t\tfor (var property in computedValues) {\r\n\t\t\t\t\t\tif (!computedValues.hasOwnProperty(property)) {\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tinlineValues[property] = element.style[property];\r\n\r\n\t\t\t\t\t\t/* For slideDown, use forcefeeding to animate all vertical properties from 0. For slideUp,\r\n\t\t\t\t\t\t use forcefeeding to start from computed values and animate down to 0. */\r\n\t\t\t\t\t\tvar propertyValue = CSS.getPropertyValue(element, property);\r\n\t\t\t\t\t\tcomputedValues[property] = (direction === \"Down\") ? [propertyValue, 0] : [0, propertyValue];\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* Force vertical overflow content to clip so that sliding works as expected. */\r\n\t\t\t\t\tinlineValues.overflow = element.style.overflow;\r\n\t\t\t\t\telement.style.overflow = \"hidden\";\r\n\t\t\t\t};\r\n\r\n\t\t\t\topts.complete = function() {\r\n\t\t\t\t\t/* Reset element to its pre-slide inline values once its slide animation is complete. */\r\n\t\t\t\t\tfor (var property in inlineValues) {\r\n\t\t\t\t\t\tif (inlineValues.hasOwnProperty(property)) {\r\n\t\t\t\t\t\t\telement.style[property] = inlineValues[property];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t/* If the user passed in a complete callback, fire it now. */\r\n\t\t\t\t\tif (elementsIndex === elementsSize - 1) {\r\n\t\t\t\t\t\tif (complete) {\r\n\t\t\t\t\t\t\tcomplete.call(elements, elements);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (promiseData) {\r\n\t\t\t\t\t\t\tpromiseData.resolver(elements);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t};\r\n\r\n\t\t\t\tVelocity(element, computedValues, opts);\r\n\t\t\t};\r\n\t\t});\r\n\r\n\t\t/* fadeIn, fadeOut */\r\n\t\t$.each([\"In\", \"Out\"], function(i, direction) {\r\n\t\t\tVelocity.Redirects[\"fade\" + direction] = function(element, options, elementsIndex, elementsSize, elements, promiseData) {\r\n\t\t\t\tvar opts = $.extend({}, options),\r\n\t\t\t\t\t\tcomplete = opts.complete,\r\n\t\t\t\t\t\tpropertiesMap = {opacity: (direction === \"In\") ? 1 : 0};\r\n\r\n\t\t\t\t/* Since redirects are triggered individually for each element in the animated set, avoid repeatedly triggering\r\n\t\t\t\t callbacks by firing them only when the final element has been reached. */\r\n\t\t\t\tif (elementsIndex !== 0) {\r\n\t\t\t\t\topts.begin = null;\r\n\t\t\t\t}\r\n\t\t\t\tif (elementsIndex !== elementsSize - 1) {\r\n\t\t\t\t\topts.complete = null;\r\n\t\t\t\t} else {\r\n\t\t\t\t\topts.complete = function() {\r\n\t\t\t\t\t\tif (complete) {\r\n\t\t\t\t\t\t\tcomplete.call(elements, elements);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (promiseData) {\r\n\t\t\t\t\t\t\tpromiseData.resolver(elements);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t};\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* If a display was passed in, use it. Otherwise, default to \"none\" for fadeOut or the element-specific default for fadeIn. */\r\n\t\t\t\t/* Note: We allow users to pass in \"null\" to skip display setting altogether. */\r\n\t\t\t\tif (opts.display === undefined) {\r\n\t\t\t\t\topts.display = (direction === \"In\" ? \"auto\" : \"none\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tVelocity(this, propertiesMap, opts);\r\n\t\t\t};\r\n\t\t});\r\n\r\n\t\treturn Velocity;\r\n\t}((window.jQuery || window.Zepto || window), window, (window ? window.document : undefined));\r\n}));\r\n\r\n/******************\r\n Known Issues\r\n ******************/\r\n\r\n/* The CSS spec mandates that the translateX/Y/Z transforms are %-relative to the element itself -- not its parent.\r\n Velocity, however, doesn't make this distinction. Thus, converting to or from the % unit with these subproperties\r\n will produce an inaccurate conversion value. The same issue exists with the cx/cy attributes of SVG circles and ellipses. */\r\n\n},{}]},{},[]);\n"]}