{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./resources/js/frontend/nav.js","webpack:///./resources/js/frontend/scrollBehaviour.js","webpack:///./resources/js/frontend/topic-1/section-1-3.js","webpack:///./resources/js/frontend/topic-4/topic-4-6.js","webpack:///./resources/js/frontend/topic-3/section-3-4.js","webpack:///./resources/js/frontend/topic-2/section-2-1.js","webpack:///./node_modules/lodash/lodash.js","webpack:///./resources/js/frontend/topic-2/section-2-2.js","webpack:///./resources/js/frontend/plugins/counterup2.js","webpack:///./resources/js/frontend/plugins/counter.js","webpack:///./resources/js/frontend/topic-1/section-1-4.js","webpack:///./resources/js/frontend/topic-4/topic-4-1.js","webpack:///./resources/js/frontend/topic-3/section-3-1.js","webpack:///(webpack)/buildin/module.js","webpack:///./resources/js/frontend/topic-1/section-1-1.js","webpack:///./resources/js/frontend/topic-4/topic-4-7.js","webpack:///./resources/js/frontend/topic-4/topic-4-3.js","webpack:///./resources/js/frontend/topic-6/topic-6.js","webpack:///./node_modules/waypoints/lib/noframework.waypoints.js","webpack:///./resources/js/frontend/sidebar.js","webpack:///./resources/js/frontend/topic-5/topic-5.js","webpack:///./resources/js/frontend/scrollInit.js","webpack:///./resources/js/frontend/topic-3/section-3-3.js","webpack:///./resources/js/frontend/topic-4/topic-4-2.js","webpack:///./resources/js/frontend/script.js","webpack:///./resources/js/frontend/cover.js","webpack:///(webpack)/buildin/global.js"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","require","functions","circumference","radius","Math","PI","updateRing","dataCLS","pos","total","$","removeClass","addClass","circle","children","circle_mobile","percent","parseFloat","setTimeout","updateProgress","offset","css","each","elem","$nav","$this","this","ScrollMagic","Scene","triggerElement","triggerHook","on","event","scrollDirection","data","length","prev","hasClass","addTo","document","ready","outerHeight","window","height","resize","click","e","preventDefault","fadeIn","fadeOut","width","lastScrollTop","scroll","st","scrollTop","controllerScrollPanel","headerScroll","footerScroll","resizeTimer","initController","Controller","theme","attr","parent","$prevThis","index","AOS","init","duration","easing","doneResizing","destroy","clearTimeout","handleResize","inScene","outScene","currentWindowWidth","timelineScrollInit","gap","innerWidth","pinned","durationHorizontal","section1_3Horizontal","TimelineMax","to","x","durationPin","setPin","setTween","refresh","resizedFinished","getWidthScreen","slick","dots","mobileFirst","infinite","arrows","responsive","breakpoint","settings","customPlotLines","chartContainer","find","chartCountHeight","chartWidth","chartHeight","chart21","yAxis","update","xAxis","setSize","Highcharts","chart","type","backgroundColor","events","load","drawPlotLines","redraw","marginLeft","credits","title","text","html","align","useHTML","style","fontFamily","fontSize","lineHeight","color","lineWidth","gridLineColor","gridLineWidth","gridLineDashStyle","tickLength","categories","crosshair","labels","afterSetExtremes","tooltip","crosshairs","series","points","tickAmount","min","max","legend","enabled","borderColor","padding","borderRadius","distance","formatter","point","hideTooltip","y","plotOptions","dataLabels","marker","fillColor","lineColor","states","hover","className","radiusPlus","rules","condition","maxWidth","chartOptions","xValue","yStart","toPixels","yEnd","forEach","customPlotLine","xData","renderer","path","stroke","add","FUNC_ERROR_TEXT","PLACEHOLDER","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","source","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrim","reTrimStart","reTrimEnd","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsComboRange","rsComboMarksRange","rsBreakRange","rsMathOpRange","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsMiscLower","rsMiscUpper","reOptMod","rsSeq","join","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","freeParseInt","parseInt","freeGlobal","global","freeSelf","self","root","Function","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","apply","func","thisArg","args","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","result","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","Array","arrayPush","values","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","undefined","basePropertyOf","baseReduce","current","baseTimes","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","countHolders","placeholder","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","string","test","mapToArray","map","size","overArg","transform","arg","replaceHolders","setToArray","set","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","match","unicodeToArray","split","asciiToArray","unescapeHtmlChar","_","runInContext","context","uid","defaults","pick","Date","Error","String","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","toString","idCounter","maskSrcKey","exec","keys","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","replace","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","iterator","symToStringTag","getNative","ctxClearTimeout","ctxNow","now","ctxSetTimeout","nativeCeil","ceil","nativeFloor","floor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","random","nativeReverse","reverse","DataView","Map","Promise","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","clear","entry","ListCache","MapCache","SetCache","__data__","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","push","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","constructor","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","pop","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","Infinity","seen","baseInvoke","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","comparer","sort","baseSortBy","objCriteria","criteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","indexOf","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","MAX_ARRAY_LENGTH","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","id","slice","copy","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","charAt","trailing","createCompounder","callback","words","deburr","createCtor","arguments","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","newHolders","createRecurry","fn","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrLength","arrStacked","arrValue","flatten","otherFunc","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","resolve","ctorString","isMaskable","stubFalse","otherArgs","oldArray","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","count","lastCalled","stamp","remaining","rand","memoize","memoizeCapped","charCodeAt","quote","subString","clone","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bindKey","WRAP_BIND_FLAG","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","next","done","iteratorToArray","remainder","toLength","isBinary","assign","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","prop","toPairs","toPairsIn","camelCase","word","toLowerCase","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","toUpperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","method","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","round","subtract","minuend","subtrahend","after","castArray","chunk","compact","concat","cond","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","reject","remove","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","target","position","escape","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNaN","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sum","sumBy","template","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","variable","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","search","substring","newEnd","unescape","uniqueId","prefix","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","chart22Width","center","pane","pieRadius","zIndex","innerRadius","inverted","polar","margin","startAngle","endAngle","background","borderWidth","solidgauge","enableMouseTracking","stickyTracking","animation","tickPositions","counterUp","el","lang","stopCountUp","innerHTML","realNumber","dataset","nums","divideNumbers","getAttribute","querySelector","_countUpOrigInnerHTML","visibility","output","shift","countUpTimeout","num","divisions","splitValues","k","isComma","isFloat","decimalPlaces","val","newNum","toFixed","toLocaleString","ignore","counter","Waypoint","element","handler","direction","scene1","scene2","scene3","scene1b","scene2b","scene3b","fadeScrollInit","scene1TL","yPercent","alpha","scene2TL","scene3TL","sceneScrollInit","section1_1Horizontal","slickInit","play","webpackPolyfill","deprecate","currentWidth","pushfollowers","modal","playVideo","carousel","interval","pause","PerfectScrollbar","suppressScrollY","location","href","stopPropagation","screen","open","keyCounter","allWaypoints","Adapter","adapter","axis","horizontal","triggerPoint","Group","findOrCreate","Context","findOrCreateByElement","offsetAliases","queueTrigger","trigger","disable","enable","invokeAll","allWaypointsArray","waypointKey","destroyAll","disableAll","enableAll","refreshAll","viewportHeight","innerHeight","documentElement","clientHeight","viewportWidth","clientWidth","adapters","continuous","outerWidth","requestAnimationFrameShim","contexts","oldWindowLoad","onload","didScroll","didResize","oldScroll","scrollLeft","waypoints","vertical","waypointContextKey","windowContext","createThrottledScrollHandler","createThrottledResizeHandler","waypoint","checkEmpty","horizontalEmpty","isEmptyObject","verticalEmpty","isWindow","off","resizeHandler","requestAnimationFrame","scrollHandler","handleScroll","isTouch","triggeredGroups","axes","newScroll","forward","backward","axisKey","wasBeforeTriggerPoint","nowAfterTriggerPoint","groupKey","flushTriggers","contextOffset","left","contextScroll","contextDimension","offsetProp","top","contextModifier","wasBeforeScroll","nowAfterScroll","triggeredForward","adjustment","oldTriggerPoint","elementOffset","freshWaypoint","findByElement","contextId","mozRequestAnimationFrame","webkitRequestAnimationFrame","byTriggerPoint","a","b","byReverseTriggerPoint","groups","clearTriggerQueues","triggerQueues","up","down","right","inArray","getWindow","defaultView","NoFrameworkAdapter","handlers","removeListeners","listeners","listener","removeEventListener","eventParts","eventType","namespace","ownerDocument","win","rect","getBoundingClientRect","pageYOffset","clientTop","pageXOffset","clientLeft","nsHandlers","addEventListener","includeMargin","computedStyle","getComputedStyle","marginTop","marginBottom","marginRight","obj","getHeightScreen","detectLang","pathname","strLine2","spansLine2","appendTo","fadeTo","parents","mouse","moved","parallaxIt","movement","TweenMax","mousemove","clientX","clientY","TweenLite","ticker","g"],"mappings":";aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,IAIjBlC,EAAoBA,EAAoBmC,EAAI,G,iGClF/BC,EAAQ,QAAtBC,U,IAGJC,EAAgBC,GAAaC,KAAKC,GA+DtC,SAASC,EAAWC,EAASC,EAAKC,GAC9BC,EAAE,aAAaC,YAAY,UAC3BD,EAAE,aAAaH,GAASK,SAAS,UACjCF,EAAE,8BAA8BC,YAAY,UAC5CD,EAAE,8BAA8BH,GAASK,SAAS,UAClD,IAAIC,EAASH,EAAE,aAAaH,EAAQ,mBAAmBO,SAAS,0BAC5DC,EAAgBL,EAAE,8BAA8BH,EAAQ,mBAAmBO,SAAS,0BACpFE,EAAUC,WAAgB,IAAJT,EAASC,GACnCS,YAAW,WACPC,EAAeN,EAAQG,GACvBG,EAAeJ,EAAeC,KAC/B,KAGP,SAASG,EAAeN,EAAQG,GAG5B,IAAMI,EAASlB,EAAgBc,EAAU,IAAMd,EAC/CW,EAAOQ,IAAI,oBAAqBD,GA9EpCV,EAAE,WAAWY,MAAK,SAAUtD,EAAGuD,GAC3B,IAAIC,EAAOd,EAAE,OACTe,EAAQf,EAAEgB,MAGd,IAAIC,YAAYC,MAAM,CAClBR,QAAS,GACTS,eAAgBN,EAChBO,YAAa,IAEhBC,GAAG,SAAS,SAASC,GAClB,GAA4B,WAAzBA,EAAMC,gBAA8B,CACnC,IAAI1B,EAAWkB,EAAMS,KAAK,OAAUT,EAAMS,KAAK,OAAS,QACpD1B,EAAMiB,EAAMS,KAAK,OACjBzB,EAAQC,EAAE,qBAAsBH,EAAS,MAAM4B,OACpC,SAAX5B,GACAiB,EAAKb,YAAY,UACjBD,EAAE,8BAA8BC,YAAY,YAG5Ca,EAAKZ,SAAS,UAEdN,EAAWC,EAASC,EAAKC,QAIpCsB,GAAG,SAAS,SAASC,GAClB,GAA4B,WAAzBA,EAAMC,gBAA8B,CACnC,GAAGR,EAAMW,OAAOC,SAAS,0BACrB,IAAI9B,EAAWkB,EAAMW,OAAOtB,SAAS,WAAWoB,KAAK,OAAUT,EAAMW,OAAOtB,SAAS,WAAWoB,KAAK,OAAS,QAC9G1B,EAAMiB,EAAMW,OAAOtB,SAAS,WAAWoB,KAAK,OAC5CzB,EAAQC,EAAE,qBAAsBH,EAAS,MAAM4B,YAE3C5B,EAAWkB,EAAMW,OAAOF,KAAK,OAAUT,EAAMW,OAAOF,KAAK,OAAS,QACtE1B,EAAMiB,EAAMW,OAAOF,KAAK,OACxBzB,EAAQC,EAAE,qBAAsBH,EAAS,MAAM4B,OAGpC,SAAX5B,GACAiB,EAAKb,YAAY,UACjBD,EAAE,8BAA8BC,YAAY,YAE5Ca,EAAKZ,SAAS,UAEdN,EAAWC,EAASC,EAAKC,QAIpC6B,MAAMtC,EAAQ,YAGnBU,EAAE,kBAAkBY,MAAK,WACrB,IAAIT,EAASH,EAAEgB,MAAMZ,SAAS,0BAE9BD,EAAOQ,IAAI,mBAAX,UAAkCnB,EAAlC,YAAmDA,IACnDW,EAAOQ,IAAI,oBAAX,UAAmCnB,IACnCiB,EAAeN,EAAQ,MAyB3BH,EAAE6B,UAAUC,OAAM,WACd9B,EAAE,OAAO+B,YAAY/B,EAAEgC,QAAQC,UAE/BjC,EAAEgC,QAAQE,QAAO,WACblC,EAAE,OAAO+B,YAAY/B,EAAEgC,QAAQC,aAGnCjC,EAAE,uBAAuBmC,OAAM,SAAUC,GACrCA,EAAEC,iBACFrC,EAAE,YAAYsC,SACdtC,EAAE,OAAOE,SAAS,oBAGtBF,EAAE,mBAAmBmC,OAAM,SAAUC,GACjCA,EAAEC,iBACFrC,EAAE,YAAYuC,UACdvC,EAAE,OAAOC,YAAY,oBAGzBD,EAAE,kBAAkBmC,OAAM,SAAUC,GAEhCpC,EAAE,YAAYE,SAAS,UAEvBM,YAAW,WACPR,EAAE,YAAYC,YAAY,UACtBD,EAAEgC,QAAQQ,QAAU,OACpBxC,EAAE,YAAYuC,UACdvC,EAAE,OAAOC,YAAY,oBAE1B,QAGPD,EAAE,4FAA4FmC,OAAM,SAAUC,GAE1GpC,EAAE,YAAYE,SAAS,UAEvBM,YAAW,WACPR,EAAE,YAAYC,YAAY,UAC1BD,EAAE,YAAYuC,YACf,QAGP,IAAIE,EAAgB,EACpBzC,EAAEgC,QAAQU,QAAO,SAAUpB,GAEvB,GAAItB,EAAEgC,QAAQQ,QAAU,KAAM,CAC1B,IAAIG,EAAK3C,EAAEgB,MAAM4B,YAEbD,EAAK,EACDA,GAAMF,IACNzC,EAAE,UAAUE,SAAS,aACrBF,EAAE,UAAUE,SAAS,eAGzBF,EAAE,UAAUC,YAAY,aACxBD,EAAE,UAAUC,YAAY,cAGxB0C,EAAK3C,EAAE,UAAUiC,SACbU,EAAKF,GACLzC,EAAE,UAAUE,SAAS,eACrBF,EAAE,UAAUC,YAAY,eAExBD,EAAE,UAAUC,YAAY,eACxBD,EAAE,UAAUE,SAAS,eAGzBF,EAAE,UAAUC,YAAY,aACxBD,EAAE,UAAUC,YAAY,gBAE5BwC,EAAgBE,U,uBC5J5B,IAAIE,EAGAC,EACAC,EACAC,EASJ,SAASC,IAELJ,EAAwB,IAAI5B,YAAYiC,WA8DxClD,EAAE,WAAWY,MAAK,SAAUtD,EAAGuD,GAC3B,IAAIE,EAAQf,EAAEa,GAGdiC,EAAe,IAAI7B,YAAYC,MAAM,CACjCR,QAAS,IACTS,eAAgBN,EAChBO,YAAa,IAEhBC,GAAG,SAAS,SAASC,GAElB,GAA6B,WAAzBA,EAAMC,gBAA8B,CACpC,IAAI4B,EAAQpC,EAAMS,KAAK,SAEvBxB,EAAE,oBAAoBoD,KAAK,aAAcD,GACzCnD,EAAE,gCAAgCoD,KAAK,aAAcD,GACrDnD,EAAE,2BAA2BoD,KAAK,aAAcD,GAChDnD,EAAE,OAAOoD,KAAK,aAAcD,GAExBpC,EAAMY,SAAS,gBACf3B,EAAE,gCAAgCoD,KAAK,aAAc,YAMhE/B,GAAG,SAAS,SAASC,GAClB,GAA6B,WAAzBA,EAAMC,gBAA8B,CAEpC,GAAKR,EAAMsC,SAAS1B,SAAS,0BACzB,IAAI2B,EAAavC,EAAMsC,SAAS3B,YAG5B4B,EAAavC,EAAMW,OAW3B,IAAIyB,GANIG,EADJvC,EAAMsC,SAAS1B,SAAS,aAAiC,IAAlBZ,EAAMwC,QAC5BxC,EAAMsC,SAAS3B,OAGfX,EAAMW,QAGLF,KAAK,SAC3BxB,EAAE,oBAAoBoD,KAAK,aAAcD,GACzCnD,EAAE,gCAAgCoD,KAAK,aAAcD,GACrDnD,EAAE,2BAA2BoD,KAAK,aAAcD,GAChDnD,EAAE,OAAOoD,KAAK,aAAcD,GAExBG,EAAU3B,SAAS,gBACnB3B,EAAE,gCAAgCoD,KAAK,aAAc,QAGzD9B,EAAMC,mBAObK,MAAMiB,GAGH7C,EAAEgC,QAAQQ,QAAU,MAEpBO,EAAe,IAAI9B,YAAYC,MAAM,CACjCR,OAAQ,GACRS,eAAgBN,EAChBO,YAAa,IAEhBC,GAAG,SAAS,SAASC,GAElB,GAA6B,WAAzBA,EAAMC,gBAA8B,CACpC,IAAI4B,EAAQpC,EAAMS,KAAK,SAEvBxB,EAAE,UAAUoD,KAAK,aAAcD,GAE3BpC,EAAMY,SAAS,gBACf3B,EAAE,UAAUoD,KAAK,aAAc,QAI/BrC,EAAMY,SAAS,cACf3B,EAAE,UAAUE,SAAS,YAErBF,EAAE,UAAUC,YAAY,gBAInCoB,GAAG,SAAS,SAASC,GAClB,GAA6B,WAAzBA,EAAMC,gBAA8B,CAEpC,GAAIR,EAAMsC,SAAS1B,SAAS,0BACxB,IAAI2B,EAAavC,EAAMsC,SAAS3B,YAG5B4B,EAAavC,EAAMW,OAW3B,IAAIyB,GANIG,EADJvC,EAAMsC,SAAS1B,SAAS,aAAiC,IAAlBZ,EAAMwC,QAC5BxC,EAAMsC,SAAS3B,OAGfX,EAAMW,QAGLF,KAAK,SAE3BxB,EAAE,UAAUoD,KAAK,aAAcD,GAE3BG,EAAU3B,SAAS,gBACnB3B,EAAE,UAAUoD,KAAK,aAAc,QAI/BE,EAAU3B,SAAS,cACnB3B,EAAE,UAAUE,SAAS,YAErBF,EAAE,UAAUC,YAAY,gBAInC2B,MAAMiB,OAtLfW,IAAIC,KAAK,CAEL/C,OAAQ,IACRgD,SAAU,IACVC,OAAQ,gBAjBhB3D,EAAEgC,QAAQX,GAAG,QAAQ,WAEjB4B,IAoBJ,WAQI,SAASW,IAoBTf,EAAwB,KACxBC,EAAe,KACfC,EAAe,KAGfE,IA/BAjD,EAAEgC,QAAQE,QAAO,WAajBW,EAAsBgB,UACtBf,EAAae,UAGT7D,EAAEgC,QAAQQ,QAAU,KACpBO,EAAac,UAhBbC,aAAad,GACbA,EAAcxC,WAAWoD,EAAc,QAxB3CG,MAuQJ/D,GAAE,WACEA,EAAEgC,QAAQU,QAAO,WACb1C,EAAE,QAAQE,SAAS,aACnB4D,aAAa9D,EAAEwB,KAAKR,KAAM,gBAC1BhB,EAAEwB,KAAKR,KAAM,cAAeR,YAAW,WAEnCR,EAAE,QAAQC,YAAY,eACvB,a,uBCzRX,IAAI+D,EAAU,KACVC,EAAW,KACXC,EAAqB,KAkBzB,SAASC,IAOL,GALe,OAAZH,IACCC,EAASJ,SAAQ,GACjBG,EAAQH,SAAQ,IAGhB7D,EAAEgC,QAAQQ,QAAU,IACpB,IAAI4B,EAAMpE,EAAE,oCAAoCqE,aAAerE,EAAEgC,QAAQQ,QAAUxC,EAAE,+BAA+BqE,aAChHC,EAAS,2BAGV,CACCF,EAAM,EACVpE,EAAE,kDAAkDY,MAAK,WACrDwD,GAAOpE,EAAEgB,MAAMwB,WAEnB4B,GAAOpE,EAAEgC,QAAQQ,QAEb8B,EAAS,6CAIjB,GAAIF,EAAM,EAAG,CACT,IAOIG,EAPAC,GAAuB,IAAIC,aAC1BC,GAAG,mCAAoC,EAAG,CACvCC,EAAG,IAAMP,EAAM,OAInBQ,EAAc,OAElBA,EAAiC,KAAnB5E,EAAEgC,QAAQC,SACxBsC,EAAwC,IAAnBvE,EAAEgC,QAAQC,SAE5BjC,EAAEgC,QAAQQ,QAAUxC,EAAEgC,QAAQC,UACzBjC,EAAEgC,QAAQQ,QAAU,OAEpBoC,EAAiC,EAAnB5E,EAAEgC,QAAQC,UAMhC+B,EAAU,IAAI/C,YAAYC,MAAM,CAC5BR,OAAgB,EAChBS,eAAgBmD,EAChBlD,YAAgB,EAChBsC,SAAgBkB,IAEfC,OAAOP,GACP1C,MAAMtC,EAAQ,SAGnB2E,EAAW,IAAIhD,YAAYC,MAAM,CAC7BR,OAAgB,EAChBS,eAAgBmD,EAChBlD,YAAgB,EAChBsC,SAAgBa,IAEfO,SAASN,GACT5C,MAAMtC,EAAQ,SAGvBkE,IAAIuB,UAjFR/E,GAAE,WAIE,IAAIgF,EAFJb,IAGAnE,EAAEgC,QAAQX,GAAG,UAAU,WACnByC,aAAakB,GACbA,EAAkBxE,YAAW,WACtB0D,IAAuBlE,EAAEgB,MAAMwB,UAC9B0B,EAAqBlE,EAAEgB,MAAMwB,QAC7B2B,OAEL,Y,iECfXnE,GAAE,WAEEA,EAAEgC,QAAQX,GAAG,UAAU,WACnB,IAAI4D,EAAiBjD,OAAOqC,WACxBrC,OAAOqC,YAAc,IACrBrE,EAAE,+BAA+BW,IAAI,QAASsE,GAE9CjF,EAAE,+BAA+BW,IAAI,QAAS,OAGtD,IAAIsE,EAAiBjD,OAAOqC,WACxBrC,OAAOqC,YAAc,IACrBrE,EAAE,+BAA+BW,IAAI,QAASsE,GAE9CjF,EAAE,+BAA+BW,IAAI,QAAS,Q,mBCdtDX,GAAE,WACEA,EAAE,eAAekF,MAAM,CACnBC,MAAa,EACbC,aAAa,EACbC,UAAa,EACbC,QAAa,EACbC,WAAa,CACT,CACIC,WAAY,IACZC,SAAY,kB,wCCT5BzF,GAAE,WACC,IAEIgF,EAFAU,EAAkB,GAIlBC,GAHe3F,EAAE,cAAcwC,QAErBxC,EAAE,gBACa4F,KAAK,qBAElC,SAASC,IACN,IAAIC,EAAaH,EAAenD,QAC5BuD,EAAc,EACdD,EAAa,MACdC,EAAcD,GAGdC,EADCD,EAAa,IACa,IAAbA,EAEa,GAAbA,EAGjBE,EAAQC,MAAM,GAAGC,OAAO,CACrBjE,OAAQ8D,EAAc,MAEzBC,EAAQG,MAAM,GAAGD,OAAO,CACrBjE,OAAQ8D,IAEXC,EAAQI,QAAQN,EAAYC,GAG/B/F,EAAEgC,QAAQX,GAAG,UAAU,WACpByC,aAAakB,GACbA,EAAkBxE,YAAW,WAC1BqF,MACA,QAIN,IAAIG,EAAUK,WAAWC,MAAM,YAAa,CAGzCA,MAAS,CACNC,KAAiB,OACjBC,gBAAiB,cACjBvE,OAAiB,IACjBwE,OAAiB,CACdC,KAAQ,WACLC,EAAc3F,OAEjB4F,OAAQ,WACLD,EAAc3F,QAGpB6F,WAAiB,IAEpBC,SAAS,EACTC,MAAS,CACNC,KAAS,mCAAoChH,EAAE,sBAAsBiH,OAAQ,UAC7EC,MAAS,OACTC,SAAS,EACTC,MAAS,CACNC,WAAY,QACZC,SAAY,OACZC,WAAY,OACZC,MAAY,0BAGlBrB,MAAS,CACNY,MAAmB,KACnBU,UAAmB,EACnBC,cAAmB,UACnBC,cAAmB,EACnBC,kBAAmB,WACnBC,WAAmB,EAEnB5F,OAAmB,IACnBvB,QAAoB,IACpBoH,WAAmB,CAAC,KAAM,KAAM,KAAM,KAAM,MAC5CC,UAAmB,CAChBP,MAAO,yBAEVQ,OAAmB,CAChBZ,MAAO,CACJC,WAAY,QACZC,SAAY,OACZE,MAAY,YAGlBf,OAAmB,CAChBwB,iBAAkB,WACfjH,KAAKsF,MAAM4B,QAAQC,WAAa,GAChCnH,KAAKsF,MAAM4B,QAAQC,WAAW3F,MAASxB,KAAKsF,MAAM9D,OAASxB,KAAKoH,OAAO,GAAGC,OAAO5G,OAAS,MAInGwE,MAAa,CACVc,MAAe,KACfU,UAAe,EACfC,cAAe,cACfG,WAAe,EACfS,WAAe,EACf5H,OAAe,EACfuB,OAAe,IACfsG,IAAe,GACfC,IAAe,GACfR,OAAe,CACZZ,MAAO,CACJC,WAAY,QACZC,SAAY,OACZE,MAAY,aAIrBiB,OAAa,CACVC,SAAS,GAEZR,QAAa,CACV1B,gBAAiB,UACjBmC,YAAiB,cACjBC,QAAiB,EACjBC,aAAiB,GACjBC,SAAiB,GACjB3B,SAAiB,EACjB4B,UAAiB,WACd,OAAI/H,KAAKgI,MAAMC,aAGR,GAAKjI,KAAKkI,IAGvBC,YAAa,CACVf,OAAQ,CACLgB,WAAY,CACT5C,gBAAiB,cACjBmC,YAAiB,cACjBC,QAAiB,EACjBF,SAAiB,EACjBG,aAAiB,GACjBC,SAAiB,GACjB3B,SAAiB,KAM1BC,MAAa,CACVC,WAAY,SAEfe,OAAa,CAAC,CACXvK,KAAW,yBACX2D,KAAW,CACR,CACG0H,EAAQ,KACRG,OAAQ,CACLC,UAAW,UACXC,UAAW,UACXC,OAAW,CACRC,MAAO,CACJH,UAAW,UACXC,UAAW,cAKvB,CACGL,EAAG,MAEN,CACGA,EAAQ,KACRG,OAAQ,CACLC,UAAW,UACXC,UAAW,UACXC,OAAW,CACRC,MAAO,CACJH,UAAW,UACXC,UAAW,cAKvB,CACGL,EAAa,MAEhB,CACGA,EAAQ,KACRG,OAAQ,CACLC,UAAW,UACXC,UAAW,UACXC,OAAW,CACRC,MAAO,CACJH,UAAW,UACXC,UAAW,aAIpBH,WAAa,CACVM,UAAW,aAEdT,aAAa,IAGnBM,UAAW,UAEXF,OAAQ,CACLC,UAAW,UACXC,UAAW,UACX9J,OAAW,EACXgI,UAAW,EACX+B,OAAW,CACRC,MAAO,CACJH,UAAY,UACZC,UAAY,UACZI,WAAY,EACZlK,OAAY,EACZgI,UAAY,OAMxBlC,WAAY,CACTqE,MAAO,CAAC,CACLC,UAAc,CACXC,SAAU,KAEbC,aAAc,CACXzD,MAAO,CACJO,WAAiB,IAEpBE,MAAO,CACJC,KAAM,kCAAmChH,EAAE,sBAAsBiH,OAAQ,WAE5Ed,MAAO,CACJ6B,OAAe,CACZZ,MAAO,CACJE,SAAU,UAInBrB,MAAO,CACJ+B,OAAe,CACZZ,MAAO,CACJE,SAAU,gBAS/B,SAASX,EAAcL,GACpB,IAAIH,EAAQG,EAAMH,MAAM,GACpBF,EAAQK,EAAML,MAAM,GACpB+D,EAAS,EACTC,EAAShE,EAAMiE,SAASjE,EAAMsC,KAC9B4B,EAAOlE,EAAMiE,SAASjE,EAAMuC,KAQhC,IANI9C,EAAgBjE,QACjBiE,EAAgB0E,SAAQ,SAASC,GAC9BA,EAAexG,aAIhBvG,EAAI,EAAGA,EAAIgJ,EAAMH,MAAM,GAAG2B,WAAWrG,OAAQnE,IAC/C0M,EAAS7D,EAAM+D,SAAS5D,EAAM8B,OAAO,GAAGkC,MAAMhN,IAC9CoI,EAAgBpI,GAAKgJ,EAAMiE,SAASC,KAAK,CAAC,IAAKR,EAAQC,EAAQ,IAAKD,EAAQG,IACvE/G,KAAK,CACH,eAAoB,EACpB,mBAAoB,MACpBqH,OAAoB,YAEtBC,MAIX7E,Q,sBClRH,qBAQE,WAGA,IAUI8E,EAAkB,sBASlBC,EAAc,yBAgDdC,EAAY,CACd,CAAC,MA9BiB,KA+BlB,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aArCyB,IAsC1B,CAAC,OAjCkB,KAkCnB,CAAC,UAtCqB,IAuCtB,CAAC,eAtC2B,IAuC5B,CAAC,QArCmB,MAyClBC,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBAGZC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBAEXC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBC,OAAOH,EAAcI,QACxCC,EAAqBF,OAAOF,EAAgBG,QAG5CE,EAAW,mBACXC,EAAa,kBACbC,EAAgB,mBAGhBC,EAAe,mDACfC,EAAgB,QAChBC,EAAa,mGAMbC,EAAe,sBACfC,EAAkBV,OAAOS,EAAaR,QAGtCU,EAAS,aACTC,EAAc,OACdC,EAAY,OAGZC,EAAgB,4CAChBC,EAAgB,oCAChBC,EAAiB,QAGjBC,GAAc,4CAGdC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAOpBC,GAAeC,gDASfC,GAAeC,8OAIfC,GAAW,oBACXC,GAAU,IAAMH,GAAe,IAC/BI,GAAU,IAAMN,GAAe,IAC/BO,GAAW,OACXC,GAAY,oBACZC,GAAU,8BACVC,GAAS,oBAAuBR,GAAeK,GAAtC,qEACTI,GAAS,2BAETC,GAAc,qBACdC,GAAa,kCACbC,GAAa,qCACbC,GAAU,8BAIVC,GAAc,MAAQP,GAAU,IAAMC,GAAS,IAC/CO,GAAc,MAAQF,GAAU,IAAML,GAAS,IAG/CQ,GAZa,MAAQZ,GAAU,IAAMK,GAAS,IAYtB,IAKxBQ,GAJW,oBAIQD,IAHP,gBAAwB,CAACN,GAAaC,GAAYC,IAAYM,KAAK,KAAnE,qBAA2FF,GAAW,MAIlHG,GAAU,MAAQ,CAACb,GAAWK,GAAYC,IAAYM,KAAK,KAAO,IAAMD,GACxEG,GAAW,MAAQ,CAACV,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUgB,KAAK,KAAO,IAGxGG,GAASpD,OA/BA,OA+Be,KAMxBqD,GAAcrD,OAAOmC,GAAS,KAG9BmB,GAAYtD,OAAOwC,GAAS,MAAQA,GAAS,KAAOW,GAAWH,GAAO,KAGtEO,GAAgBvD,OAAO,CACzB4C,GAAU,IAAMN,GAAhBM,oCAA0D,CAACV,GAASU,GAAS,KAAKK,KAAK,KAAO,IAC9FH,uCAA8C,CAACZ,GAASU,GAAUC,GAAa,KAAKI,KAAK,KAAO,IAChGL,GAAU,IAAMC,GAAhBD,iCACAA,oCAtBe,mDADA,mDA0BfR,GACAc,IACAD,KAAK,KAAM,KAGTO,GAAexD,OAAO,0BAA+B6B,GAA/B,mBAGtB4B,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,GAAe1E,GAAc0E,GAAezE,GAC5CyE,GAAexE,GAAWwE,GAAevE,GACzCuE,GAAetE,GAAYsE,GAAerE,GAC1CqE,GA/KsB,8BA+KYA,GAAepE,GACjDoE,GAAenE,IAAa,EAC5BmE,GAAe3F,GAAW2F,GAAe1F,GACzC0F,GAAe5E,GAAkB4E,GAAezF,GAChDyF,GAAe3E,GAAe2E,GAAexF,GAC7CwF,GAAevF,GAAYuF,GAAetF,GAC1CsF,GAAepF,GAAUoF,GAAenF,GACxCmF,GAAelF,GAAakF,GAAejF,GAC3CiF,GAAehF,GAAUgF,GAAe/E,GACxC+E,GAAe7E,IAAc,EAG7B,IAAI8E,GAAgB,GACpBA,GAAc5F,GAAW4F,GAAc3F,GACvC2F,GAAc7E,GAAkB6E,GAAc5E,GAC9C4E,GAAc1F,GAAW0F,GAAczF,GACvCyF,GAAc3E,GAAc2E,GAAc1E,GAC1C0E,GAAczE,GAAWyE,GAAcxE,GACvCwE,GAAcvE,GAAYuE,GAAcrF,GACxCqF,GAAcpF,GAAaoF,GAAcnF,GACzCmF,GAAclF,GAAakF,GAAcjF,GACzCiF,GAAchF,GAAagF,GAAc/E,GACzC+E,GAActE,GAAYsE,GArMJ,8BAsMtBA,GAAcrE,GAAaqE,GAAcpE,IAAa,EACtDoE,GAAcxF,GAAYwF,GAAcvF,GACxCuF,GAAc9E,IAAc,EAG5B,IA4EI+E,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBrQ,WACjBsQ,GAAeC,SAGfC,GAA8B,iBAAVC,GAAsBA,GAAUA,EAAOhT,SAAWA,QAAUgT,EAGhFC,GAA0B,iBAARC,MAAoBA,MAAQA,KAAKlT,SAAWA,QAAUkT,KAGxEC,GAAOJ,IAAcE,IAAYG,SAAS,cAATA,GAGjCC,GAA4CjU,IAAYA,EAAQkU,UAAYlU,EAG5EmU,GAAaF,IAAgC,iBAAVhU,GAAsBA,IAAWA,EAAOiU,UAAYjU,EAGvFmU,GAAgBD,IAAcA,GAAWnU,UAAYiU,GAGrDI,GAAcD,IAAiBT,GAAWW,QAG1CC,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWjS,SAAWiS,GAAWjS,QAAQ,QAAQsS,MAE3E,OAAIA,GAKGH,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,QACjE,MAAOzP,KAXI,GAeX0P,GAAoBH,IAAYA,GAASI,cACzCC,GAAaL,IAAYA,GAASM,OAClCC,GAAYP,IAAYA,GAASQ,MACjCC,GAAeT,IAAYA,GAASU,SACpCC,GAAYX,IAAYA,GAASY,MACjCC,GAAmBb,IAAYA,GAASc,aAc5C,SAASC,GAAMC,EAAMC,EAASC,GAC5B,OAAQA,EAAKpR,QACX,KAAK,EAAG,OAAOkR,EAAKlV,KAAKmV,GACzB,KAAK,EAAG,OAAOD,EAAKlV,KAAKmV,EAASC,EAAK,IACvC,KAAK,EAAG,OAAOF,EAAKlV,KAAKmV,EAASC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOF,EAAKlV,KAAKmV,EAASC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOF,EAAKD,MAAME,EAASC,GAa7B,SAASC,GAAgBC,EAAOC,EAAQC,EAAUC,GAIhD,IAHA,IAAI3P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,SAE9B8B,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GAClByP,EAAOE,EAAa3U,EAAO0U,EAAS1U,GAAQwU,GAE9C,OAAOG,EAYT,SAASC,GAAUJ,EAAOE,GAIxB,IAHA,IAAI1P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,SAE9B8B,EAAQ9B,IAC8B,IAAzCwR,EAASF,EAAMxP,GAAQA,EAAOwP,KAIpC,OAAOA,EAYT,SAASK,GAAeL,EAAOE,GAG7B,IAFA,IAAIxR,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OAEhCA,MAC0C,IAA3CwR,EAASF,EAAMtR,GAASA,EAAQsR,KAItC,OAAOA,EAaT,SAASM,GAAWN,EAAOO,GAIzB,IAHA,IAAI/P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,SAE9B8B,EAAQ9B,GACf,IAAK6R,EAAUP,EAAMxP,GAAQA,EAAOwP,GAClC,OAAO,EAGX,OAAO,EAYT,SAASQ,GAAYR,EAAOO,GAM1B,IALA,IAAI/P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACnC+R,EAAW,EACXC,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACd+P,EAAU/U,EAAOgF,EAAOwP,KAC1BU,EAAOD,KAAcjV,GAGzB,OAAOkV,EAYT,SAASC,GAAcX,EAAOxU,GAE5B,SADsB,MAATwU,EAAgB,EAAIA,EAAMtR,SACpBkS,GAAYZ,EAAOxU,EAAO,IAAM,EAYrD,SAASqV,GAAkBb,EAAOxU,EAAOsV,GAIvC,IAHA,IAAItQ,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,SAE9B8B,EAAQ9B,GACf,GAAIoS,EAAWtV,EAAOwU,EAAMxP,IAC1B,OAAO,EAGX,OAAO,EAYT,SAASuQ,GAASf,EAAOE,GAKvB,IAJA,IAAI1P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACnCgS,EAASM,MAAMtS,KAEV8B,EAAQ9B,GACfgS,EAAOlQ,GAAS0P,EAASF,EAAMxP,GAAQA,EAAOwP,GAEhD,OAAOU,EAWT,SAASO,GAAUjB,EAAOkB,GAKxB,IAJA,IAAI1Q,GAAS,EACT9B,EAASwS,EAAOxS,OAChBf,EAASqS,EAAMtR,SAEV8B,EAAQ9B,GACfsR,EAAMrS,EAAS6C,GAAS0Q,EAAO1Q,GAEjC,OAAOwP,EAeT,SAASmB,GAAYnB,EAAOE,EAAUC,EAAaiB,GACjD,IAAI5Q,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OAKvC,IAHI0S,GAAa1S,IACfyR,EAAcH,IAAQxP,MAEfA,EAAQ9B,GACfyR,EAAcD,EAASC,EAAaH,EAAMxP,GAAQA,EAAOwP,GAE3D,OAAOG,EAeT,SAASkB,GAAiBrB,EAAOE,EAAUC,EAAaiB,GACtD,IAAI1S,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OAIvC,IAHI0S,GAAa1S,IACfyR,EAAcH,IAAQtR,IAEjBA,KACLyR,EAAcD,EAASC,EAAaH,EAAMtR,GAASA,EAAQsR,GAE7D,OAAOG,EAaT,SAASmB,GAAUtB,EAAOO,GAIxB,IAHA,IAAI/P,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,SAE9B8B,EAAQ9B,GACf,GAAI6R,EAAUP,EAAMxP,GAAQA,EAAOwP,GACjC,OAAO,EAGX,OAAO,EAUT,IAAIuB,GAAYC,GAAa,UAmC7B,SAASC,GAAYC,EAAYnB,EAAWoB,GAC1C,IAAIjB,EAOJ,OANAiB,EAASD,GAAY,SAASlW,EAAOM,EAAK4V,GACxC,GAAInB,EAAU/U,EAAOM,EAAK4V,GAExB,OADAhB,EAAS5U,GACF,KAGJ4U,EAcT,SAASkB,GAAc5B,EAAOO,EAAWsB,EAAWC,GAIlD,IAHA,IAAIpT,EAASsR,EAAMtR,OACf8B,EAAQqR,GAAaC,EAAY,GAAK,GAElCA,EAAYtR,MAAYA,EAAQ9B,GACtC,GAAI6R,EAAUP,EAAMxP,GAAQA,EAAOwP,GACjC,OAAOxP,EAGX,OAAQ,EAYV,SAASoQ,GAAYZ,EAAOxU,EAAOqW,GACjC,OAAOrW,GAAUA,EAocnB,SAAuBwU,EAAOxU,EAAOqW,GACnC,IAAIrR,EAAQqR,EAAY,EACpBnT,EAASsR,EAAMtR,OAEnB,OAAS8B,EAAQ9B,GACf,GAAIsR,EAAMxP,KAAWhF,EACnB,OAAOgF,EAGX,OAAQ,EA5cJuR,CAAc/B,EAAOxU,EAAOqW,GAC5BD,GAAc5B,EAAOgC,GAAWH,GAatC,SAASI,GAAgBjC,EAAOxU,EAAOqW,EAAWf,GAIhD,IAHA,IAAItQ,EAAQqR,EAAY,EACpBnT,EAASsR,EAAMtR,SAEV8B,EAAQ9B,GACf,GAAIoS,EAAWd,EAAMxP,GAAQhF,GAC3B,OAAOgF,EAGX,OAAQ,EAUV,SAASwR,GAAUxW,GACjB,OAAOA,GAAUA,EAYnB,SAAS0W,GAASlC,EAAOE,GACvB,IAAIxR,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAOA,EAAUyT,GAAQnC,EAAOE,GAAYxR,EA7xBpC,IAuyBV,SAAS8S,GAAa1V,GACpB,OAAO,SAASG,GACd,OAAiB,MAAVA,OAp2BPmW,EAo2BoCnW,EAAOH,IAW/C,SAASuW,GAAepW,GACtB,OAAO,SAASH,GACd,OAAiB,MAAVG,OAj3BPmW,EAi3BoCnW,EAAOH,IAiB/C,SAASwW,GAAWZ,EAAYxB,EAAUC,EAAaiB,EAAWO,GAMhE,OALAA,EAASD,GAAY,SAASlW,EAAOgF,EAAOkR,GAC1CvB,EAAciB,GACTA,GAAY,EAAO5V,GACpB0U,EAASC,EAAa3U,EAAOgF,EAAOkR,MAEnCvB,EAgCT,SAASgC,GAAQnC,EAAOE,GAKtB,IAJA,IAAIQ,EACAlQ,GAAS,EACT9B,EAASsR,EAAMtR,SAEV8B,EAAQ9B,GAAQ,CACvB,IAAI6T,EAAUrC,EAASF,EAAMxP,SA96B7B4R,IA+6BIG,IACF7B,OAh7BF0B,IAg7BW1B,EAAuB6B,EAAW7B,EAAS6B,GAGxD,OAAO7B,EAYT,SAAS8B,GAAUxW,EAAGkU,GAIpB,IAHA,IAAI1P,GAAS,EACTkQ,EAASM,MAAMhV,KAEVwE,EAAQxE,GACf0U,EAAOlQ,GAAS0P,EAAS1P,GAE3B,OAAOkQ,EAyBT,SAAS+B,GAAU7C,GACjB,OAAO,SAASpU,GACd,OAAOoU,EAAKpU,IAchB,SAASkX,GAAWzW,EAAQ0W,GAC1B,OAAO5B,GAAS4B,GAAO,SAAS7W,GAC9B,OAAOG,EAAOH,MAYlB,SAAS8W,GAASC,EAAO/W,GACvB,OAAO+W,EAAMC,IAAIhX,GAYnB,SAASiX,GAAgBC,EAAYC,GAInC,IAHA,IAAIzS,GAAS,EACT9B,EAASsU,EAAWtU,SAEf8B,EAAQ9B,GAAUkS,GAAYqC,EAAYD,EAAWxS,GAAQ,IAAM,IAC5E,OAAOA,EAYT,SAAS0S,GAAcF,EAAYC,GAGjC,IAFA,IAAIzS,EAAQwS,EAAWtU,OAEhB8B,KAAWoQ,GAAYqC,EAAYD,EAAWxS,GAAQ,IAAM,IACnE,OAAOA,EAWT,SAAS2S,GAAanD,EAAOoD,GAI3B,IAHA,IAAI1U,EAASsR,EAAMtR,OACfgS,EAAS,EAENhS,KACDsR,EAAMtR,KAAY0U,KAClB1C,EAGN,OAAOA,EAWT,IAAI2C,GAAehB,GApwBG,CAEpB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IACtB,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAC1E,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IAAK,IAAQ,IAChD,IAAQ,IAAM,IAAQ,IAAK,IAAQ,IACnC,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAAM,IAAQ,KACtB,IAAQ,KAER,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACvE,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IACxD,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IAAK,IAAU,IACtF,IAAU,IAAM,IAAU,IAC1B,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,IAAM,IAAU,IAAK,IAAU,IACzC,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,KAC1B,IAAU,KAAM,IAAU,MAutBxBiB,GAAiBjB,GAntBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAutBP,SAASkB,GAAiBC,GACxB,MAAO,KAAO5F,GAAc4F,GAsB9B,SAASC,GAAWC,GAClB,OAAOpG,GAAaqG,KAAKD,GAsC3B,SAASE,GAAWC,GAClB,IAAIrT,GAAS,EACTkQ,EAASM,MAAM6C,EAAIC,MAKvB,OAHAD,EAAIxM,SAAQ,SAAS7L,EAAOM,GAC1B4U,IAASlQ,GAAS,CAAC1E,EAAKN,MAEnBkV,EAWT,SAASqD,GAAQnE,EAAMoE,GACrB,OAAO,SAASC,GACd,OAAOrE,EAAKoE,EAAUC,KAa1B,SAASC,GAAelE,EAAOoD,GAM7B,IALA,IAAI5S,GAAS,EACT9B,EAASsR,EAAMtR,OACf+R,EAAW,EACXC,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdhF,IAAU4X,GAAe5X,IAAUqM,IACrCmI,EAAMxP,GAASqH,EACf6I,EAAOD,KAAcjQ,GAGzB,OAAOkQ,EAUT,SAASyD,GAAWC,GAClB,IAAI5T,GAAS,EACTkQ,EAASM,MAAMoD,EAAIN,MAKvB,OAHAM,EAAI/M,SAAQ,SAAS7L,GACnBkV,IAASlQ,GAAShF,KAEbkV,EAUT,SAAS2D,GAAWD,GAClB,IAAI5T,GAAS,EACTkQ,EAASM,MAAMoD,EAAIN,MAKvB,OAHAM,EAAI/M,SAAQ,SAAS7L,GACnBkV,IAASlQ,GAAS,CAAChF,EAAOA,MAErBkV,EAoDT,SAAS4D,GAAWZ,GAClB,OAAOD,GAAWC,GAkCpB,SAAqBA,GACnB,IAAIhD,EAAStD,GAAUmH,UAAY,EACnC,KAAOnH,GAAUuG,KAAKD,MAClBhD,EAEJ,OAAOA,EAtCH8D,CAAYd,GACZnC,GAAUmC,GAUhB,SAASe,GAAcf,GACrB,OAAOD,GAAWC,GAoCpB,SAAwBA,GACtB,OAAOA,EAAOgB,MAAMtH,KAAc,GApC9BuH,CAAejB,GAhkBrB,SAAsBA,GACpB,OAAOA,EAAOkB,MAAM,IAgkBhBC,CAAanB,GAUnB,IAAIoB,GAAmBzC,GA/6BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MAg/BX,IAg3eI0C,GAh3ee,SAAUC,EAAaC,GAIxC,IA6BMC,EA7BFlE,GAHJiE,EAAqB,MAAXA,EAAkB7G,GAAO2G,GAAEI,SAAS/G,GAAKnT,SAAUga,EAASF,GAAEK,KAAKhH,GAAMZ,MAG/DwD,MAChBqE,EAAOJ,EAAQI,KACfC,GAAQL,EAAQK,MAChBjH,GAAW4G,EAAQ5G,SACnB1R,GAAOsY,EAAQtY,KACf1B,GAASga,EAAQha,OACjB6O,GAASmL,EAAQnL,OACjByL,GAASN,EAAQM,OACjBC,GAAYP,EAAQO,UAGpBC,GAAazE,EAAM7U,UACnBuZ,GAAYrH,GAASlS,UACrBwZ,GAAc1a,GAAOkB,UAGrByZ,GAAaX,EAAQ,sBAGrBY,GAAeH,GAAUI,SAGzB1Z,GAAiBuZ,GAAYvZ,eAG7B2Z,GAAY,EAGZC,IACEd,EAAM,SAASe,KAAKL,IAAcA,GAAWM,MAAQN,GAAWM,KAAKC,UAAY,KACvE,iBAAmBjB,EAAO,GAQtCkB,GAAuBT,GAAYG,SAGnCO,GAAmBR,GAAanb,KAAKO,IAGrCqb,GAAUlI,GAAK2G,EAGfwB,GAAazM,GAAO,IACtB+L,GAAanb,KAAK0B,IAAgBoa,QAAQjM,EAAc,QACvDiM,QAAQ,yDAA0D,SAAW,KAI5EC,GAAShI,GAAgBwG,EAAQwB,YA36CnCrE,EA46CE9W,GAAS2Z,EAAQ3Z,OACjBob,GAAazB,EAAQyB,WACrBC,GAAcF,GAASA,GAAOE,iBA96ChCvE,EA+6CEwE,GAAe7C,GAAQ9Y,GAAO4b,eAAgB5b,IAC9C6b,GAAe7b,GAAOY,OACtBkb,GAAuBpB,GAAYoB,qBACnCC,GAASvB,GAAWuB,OACpBC,GAAmB3b,GAASA,GAAO4b,wBAn7CrC9E,EAo7CE+E,GAAc7b,GAASA,GAAO8b,cAp7ChChF,EAq7CEiF,GAAiB/b,GAASA,GAAOC,iBAr7CnC6W,EAu7CElX,GAAkB,WACpB,IACE,IAAI0U,EAAO0H,GAAUrc,GAAQ,kBAE7B,OADA2U,EAAK,GAAI,GAAI,IACNA,EACP,MAAOvQ,KALU,GASjBkY,GAAkBtC,EAAQlU,eAAiBqN,GAAKrN,cAAgBkU,EAAQlU,aACxEyW,GAASnC,GAAQA,EAAKoC,MAAQrJ,GAAKiH,KAAKoC,KAAOpC,EAAKoC,IACpDC,GAAgBzC,EAAQxX,aAAe2Q,GAAK3Q,YAAcwX,EAAQxX,WAGlEka,GAAahb,GAAKib,KAClBC,GAAclb,GAAKmb,MACnBC,GAAmB9c,GAAO+c,sBAC1BC,GAAiBxB,GAASA,GAAOyB,cAx8CnC9F,EAy8CE+F,GAAiBlD,EAAQmD,SACzBC,GAAa5C,GAAW1I,KACxBuL,GAAavE,GAAQ9Y,GAAOib,KAAMjb,IAClCsd,GAAY5b,GAAK8I,IACjB+S,GAAY7b,GAAK6I,IACjBiT,GAAYpD,EAAKoC,IACjBiB,GAAiBzD,EAAQlH,SACzB4K,GAAehc,GAAKic,OACpBC,GAAgBpD,GAAWqD,QAG3BC,GAAWzB,GAAUrC,EAAS,YAC9B+D,GAAM1B,GAAUrC,EAAS,OACzBgE,GAAU3B,GAAUrC,EAAS,WAC7BiE,GAAM5B,GAAUrC,EAAS,OACzBkE,GAAU7B,GAAUrC,EAAS,WAC7BmE,GAAe9B,GAAUrc,GAAQ,UAGjCoe,GAAUF,IAAW,IAAIA,GAGzBG,GAAY,GAGZC,GAAqBC,GAAST,IAC9BU,GAAgBD,GAASR,IACzBU,GAAoBF,GAASP,IAC7BU,GAAgBH,GAASN,IACzBU,GAAoBJ,GAASL,IAG7BU,GAAcve,GAASA,GAAOa,eAz+ChCiW,EA0+CE0H,GAAgBD,GAAcA,GAAYE,aA1+C5C3H,EA2+CE4H,GAAiBH,GAAcA,GAAY/D,cA3+C7C1D,EAomDF,SAAS6H,GAAOze,GACd,GAAI0e,GAAa1e,KAAW2e,GAAQ3e,MAAYA,aAAiB4e,IAAc,CAC7E,GAAI5e,aAAiB6e,GACnB,OAAO7e,EAET,GAAIY,GAAe1B,KAAKc,EAAO,eAC7B,OAAO8e,GAAa9e,GAGxB,OAAO,IAAI6e,GAAc7e,GAW3B,IAAI+e,GAAc,WAChB,SAASte,KACT,OAAO,SAASue,GACd,IAAKC,GAASD,GACZ,MAAO,GAET,GAAI1D,GACF,OAAOA,GAAa0D,GAEtBve,EAAOE,UAAYqe,EACnB,IAAI9J,EAAS,IAAIzU,EAEjB,OADAA,EAAOE,eAnoDTiW,EAooDS1B,GAZM,GAqBjB,SAASgK,MAWT,SAASL,GAAc7e,EAAOmf,GAC5B1c,KAAK2c,YAAcpf,EACnByC,KAAK4c,YAAc,GACnB5c,KAAK6c,YAAcH,EACnB1c,KAAK8c,UAAY,EACjB9c,KAAK+c,gBA7pDL5I,EA6uDF,SAASgI,GAAY5e,GACnByC,KAAK2c,YAAcpf,EACnByC,KAAK4c,YAAc,GACnB5c,KAAKgd,QAAU,EACfhd,KAAKid,cAAe,EACpBjd,KAAKkd,cAAgB,GACrBld,KAAKmd,cArrDc,WAsrDnBnd,KAAKod,UAAY,GAgHnB,SAASC,GAAKC,GACZ,IAAI/a,GAAS,EACT9B,EAAoB,MAAX6c,EAAkB,EAAIA,EAAQ7c,OAG3C,IADAT,KAAKud,UACIhb,EAAQ9B,GAAQ,CACvB,IAAI+c,EAAQF,EAAQ/a,GACpBvC,KAAKmW,IAAIqH,EAAM,GAAIA,EAAM,KAiG7B,SAASC,GAAUH,GACjB,IAAI/a,GAAS,EACT9B,EAAoB,MAAX6c,EAAkB,EAAIA,EAAQ7c,OAG3C,IADAT,KAAKud,UACIhb,EAAQ9B,GAAQ,CACvB,IAAI+c,EAAQF,EAAQ/a,GACpBvC,KAAKmW,IAAIqH,EAAM,GAAIA,EAAM,KA8G7B,SAASE,GAASJ,GAChB,IAAI/a,GAAS,EACT9B,EAAoB,MAAX6c,EAAkB,EAAIA,EAAQ7c,OAG3C,IADAT,KAAKud,UACIhb,EAAQ9B,GAAQ,CACvB,IAAI+c,EAAQF,EAAQ/a,GACpBvC,KAAKmW,IAAIqH,EAAM,GAAIA,EAAM,KAiG7B,SAASG,GAAS1K,GAChB,IAAI1Q,GAAS,EACT9B,EAAmB,MAAVwS,EAAiB,EAAIA,EAAOxS,OAGzC,IADAT,KAAK4d,SAAW,IAAIF,KACXnb,EAAQ9B,GACfT,KAAK0J,IAAIuJ,EAAO1Q,IA6CpB,SAASsb,GAAMP,GACb,IAAI9c,EAAOR,KAAK4d,SAAW,IAAIH,GAAUH,GACzCtd,KAAK6V,KAAOrV,EAAKqV,KAqGnB,SAASiI,GAAcvgB,EAAOwgB,GAC5B,IAAIC,EAAQ9B,GAAQ3e,GAChB0gB,GAASD,GAASE,GAAY3gB,GAC9B4gB,GAAUH,IAAUC,GAAShE,GAAS1c,GACtC6gB,GAAUJ,IAAUC,IAAUE,GAAU1M,GAAalU,GACrD8gB,EAAcL,GAASC,GAASE,GAAUC,EAC1C3L,EAAS4L,EAAc9J,GAAUhX,EAAMkD,OAAQ6W,IAAU,GACzD7W,EAASgS,EAAOhS,OAEpB,IAAK,IAAI5C,KAAON,GACTwgB,IAAa5f,GAAe1B,KAAKc,EAAOM,IACvCwgB,IAEQ,UAAPxgB,GAECsgB,IAAkB,UAAPtgB,GAA0B,UAAPA,IAE9BugB,IAAkB,UAAPvgB,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDygB,GAAQzgB,EAAK4C,KAElBgS,EAAO8L,KAAK1gB,GAGhB,OAAO4U,EAUT,SAAS+L,GAAYzM,GACnB,IAAItR,EAASsR,EAAMtR,OACnB,OAAOA,EAASsR,EAAM0M,GAAW,EAAGhe,EAAS,SAv2E7C0T,EAk3EF,SAASuK,GAAgB3M,EAAOhU,GAC9B,OAAO4gB,GAAYC,GAAU7M,GAAQ8M,GAAU9gB,EAAG,EAAGgU,EAAMtR,SAU7D,SAASqe,GAAa/M,GACpB,OAAO4M,GAAYC,GAAU7M,IAY/B,SAASgN,GAAiB/gB,EAAQH,EAAKN,SA14ErC4W,IA24EK5W,IAAwByhB,GAAGhhB,EAAOH,GAAMN,SA34E7C4W,IA44EK5W,KAAyBM,KAAOG,KACnCihB,GAAgBjhB,EAAQH,EAAKN,GAcjC,SAAS2hB,GAAYlhB,EAAQH,EAAKN,GAChC,IAAI4hB,EAAWnhB,EAAOH,GAChBM,GAAe1B,KAAKuB,EAAQH,IAAQmhB,GAAGG,EAAU5hB,UA75EvD4W,IA85EK5W,GAAyBM,KAAOG,IACnCihB,GAAgBjhB,EAAQH,EAAKN,GAYjC,SAAS6hB,GAAarN,EAAOlU,GAE3B,IADA,IAAI4C,EAASsR,EAAMtR,OACZA,KACL,GAAIue,GAAGjN,EAAMtR,GAAQ,GAAI5C,GACvB,OAAO4C,EAGX,OAAQ,EAcV,SAAS4e,GAAe5L,EAAYzB,EAAQC,EAAUC,GAIpD,OAHAoN,GAAS7L,GAAY,SAASlW,EAAOM,EAAK4V,GACxCzB,EAAOE,EAAa3U,EAAO0U,EAAS1U,GAAQkW,MAEvCvB,EAYT,SAASqN,GAAWvhB,EAAQ8N,GAC1B,OAAO9N,GAAUwhB,GAAW1T,EAAQmM,GAAKnM,GAAS9N,GAyBpD,SAASihB,GAAgBjhB,EAAQH,EAAKN,GACzB,aAAPM,GAAsBZ,GACxBA,GAAee,EAAQH,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASN,EACT,UAAY,IAGdS,EAAOH,GAAON,EAYlB,SAASkiB,GAAOzhB,EAAQ0hB,GAMtB,IALA,IAAInd,GAAS,EACT9B,EAASif,EAAMjf,OACfgS,EAASM,EAAMtS,GACfkf,EAAiB,MAAV3hB,IAEFuE,EAAQ9B,GACfgS,EAAOlQ,GAASod,OAtgFlBxL,EAsgFqChX,GAAIa,EAAQ0hB,EAAMnd,IAEvD,OAAOkQ,EAYT,SAASoM,GAAUe,EAAQC,EAAOC,GAShC,OARIF,GAAWA,SArhFfzL,IAshFM2L,IACFF,EAASA,GAAUE,EAAQF,EAASE,QAvhFxC3L,IAyhFM0L,IACFD,EAASA,GAAUC,EAAQD,EAASC,IAGjCD,EAmBT,SAASG,GAAUxiB,EAAOyiB,EAASC,EAAYpiB,EAAKG,EAAQkiB,GAC1D,IAAIzN,EACA0N,EA5hFc,EA4hFLH,EACTI,EA5hFc,EA4hFLJ,EACTK,EA5hFiB,EA4hFRL,EAKb,GAHIC,IACFxN,EAASzU,EAASiiB,EAAW1iB,EAAOM,EAAKG,EAAQkiB,GAASD,EAAW1iB,SAvjFvE4W,IAyjFI1B,EACF,OAAOA,EAET,IAAK+J,GAASjf,GACZ,OAAOA,EAET,IAAIygB,EAAQ9B,GAAQ3e,GACpB,GAAIygB,GAEF,GADAvL,EA68GJ,SAAwBV,GACtB,IAAItR,EAASsR,EAAMtR,OACfgS,EAAS,IAAIV,EAAMuO,YAAY7f,GAG/BA,GAA6B,iBAAZsR,EAAM,IAAkB5T,GAAe1B,KAAKsV,EAAO,WACtEU,EAAOlQ,MAAQwP,EAAMxP,MACrBkQ,EAAO8N,MAAQxO,EAAMwO,OAEvB,OAAO9N,EAt9GI+N,CAAejjB,IACnB4iB,EACH,OAAOvB,GAAUrhB,EAAOkV,OAErB,CACL,IAAIgO,EAAMC,GAAOnjB,GACbojB,EAASF,GAAOtW,GAAWsW,GAAOrW,EAEtC,GAAI6P,GAAS1c,GACX,OAAOqjB,GAAYrjB,EAAO4iB,GAE5B,GAAIM,GAAOlW,GAAakW,GAAO3W,GAAY6W,IAAW3iB,GAEpD,GADAyU,EAAU2N,GAAUO,EAAU,GAAKE,GAAgBtjB,IAC9C4iB,EACH,OAAOC,EA+nEf,SAAuBtU,EAAQ9N,GAC7B,OAAOwhB,GAAW1T,EAAQgV,GAAahV,GAAS9N,GA/nEtC+iB,CAAcxjB,EAnH1B,SAAsBS,EAAQ8N,GAC5B,OAAO9N,GAAUwhB,GAAW1T,EAAQkV,GAAOlV,GAAS9N,GAkHrBijB,CAAaxO,EAAQlV,IAknEtD,SAAqBuO,EAAQ9N,GAC3B,OAAOwhB,GAAW1T,EAAQoV,GAAWpV,GAAS9N,GAlnEpCmjB,CAAY5jB,EAAOgiB,GAAW9M,EAAQlV,QAEvC,CACL,IAAKmS,GAAc+Q,GACjB,OAAOziB,EAAST,EAAQ,GAE1BkV,EA49GN,SAAwBzU,EAAQyiB,EAAKN,GACnC,IAAIiB,EAAOpjB,EAAOsiB,YAClB,OAAQG,GACN,KAAK5V,EACH,OAAOwW,GAAiBrjB,GAE1B,KAAKgM,EACL,KAAKC,EACH,OAAO,IAAImX,GAAMpjB,GAEnB,KAAK8M,EACH,OA5nDN,SAAuBwW,EAAUnB,GAC/B,IAAIoB,EAASpB,EAASkB,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAAShB,YAAYiB,EAAQD,EAASE,WAAYF,EAASG,YA0nD3DC,CAAc1jB,EAAQmiB,GAE/B,KAAKpV,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,IAn9LC,6BAm9LqB,KAAKC,EAAW,KAAKC,EACxD,OAAOqW,GAAgB3jB,EAAQmiB,GAEjC,KAAK9V,EACH,OAAO,IAAI+W,EAEb,KAAK9W,EACL,KAAKI,EACH,OAAO,IAAI0W,EAAKpjB,GAElB,KAAKwM,EACH,OA/nDN,SAAqBoX,GACnB,IAAInP,EAAS,IAAImP,EAAOtB,YAAYsB,EAAO9V,OAAQmB,GAAQ+K,KAAK4J,IAEhE,OADAnP,EAAO6D,UAAYsL,EAAOtL,UACnB7D,EA4nDIoP,CAAY7jB,GAErB,KAAKyM,EACH,OAAO,IAAI2W,EAEb,KAAKzW,EACH,OAxnDemX,EAwnDI9jB,EAvnDhB6d,GAAgB7e,GAAO6e,GAAcpf,KAAKqlB,IAAW,GAD9D,IAAqBA,EAp4DNC,CAAexkB,EAAOkjB,EAAKN,IAIxCD,IAAUA,EAAQ,IAAIrC,IACtB,IAAImE,EAAU9B,EAAM/iB,IAAII,GACxB,GAAIykB,EACF,OAAOA,EAET9B,EAAM/J,IAAI5Y,EAAOkV,GAEblB,GAAMhU,GACRA,EAAM6L,SAAQ,SAAS6Y,GACrBxP,EAAO/I,IAAIqW,GAAUkC,EAAUjC,EAASC,EAAYgC,EAAU1kB,EAAO2iB,OAE9D/O,GAAM5T,IACfA,EAAM6L,SAAQ,SAAS6Y,EAAUpkB,GAC/B4U,EAAO0D,IAAItY,EAAKkiB,GAAUkC,EAAUjC,EAASC,EAAYpiB,EAAKN,EAAO2iB,OAIzE,IAIIxL,EAAQsJ,OAhnFZ7J,GA4mFekM,EACVD,EAAS8B,GAAeC,GACxB/B,EAASY,GAAS/I,IAEkB1a,GASzC,OARA4U,GAAUuC,GAASnX,GAAO,SAAS0kB,EAAUpkB,GACvC6W,IAEFuN,EAAW1kB,EADXM,EAAMokB,IAIR/C,GAAYzM,EAAQ5U,EAAKkiB,GAAUkC,EAAUjC,EAASC,EAAYpiB,EAAKN,EAAO2iB,OAEzEzN,EAyBT,SAAS2P,GAAepkB,EAAQ8N,EAAQ4I,GACtC,IAAIjU,EAASiU,EAAMjU,OACnB,GAAc,MAAVzC,EACF,OAAQyC,EAGV,IADAzC,EAAShB,GAAOgB,GACTyC,KAAU,CACf,IAAI5C,EAAM6W,EAAMjU,GACZ6R,EAAYxG,EAAOjO,GACnBN,EAAQS,EAAOH,GAEnB,QA7pFFsW,IA6pFO5W,KAAyBM,KAAOG,KAAasU,EAAU/U,GAC1D,OAAO,EAGX,OAAO,EAaT,SAAS8kB,GAAU1Q,EAAM2Q,EAAMzQ,GAC7B,GAAmB,mBAARF,EACT,MAAM,IAAI4F,GAAU5N,GAEtB,OAAOnK,IAAW,WAAamS,EAAKD,WAlrFpCyC,EAkrFqDtC,KAAUyQ,GAcjE,SAASC,GAAexQ,EAAOkB,EAAQhB,EAAUY,GAC/C,IAAItQ,GAAS,EACTigB,EAAW9P,GACX+P,GAAW,EACXhiB,EAASsR,EAAMtR,OACfgS,EAAS,GACTiQ,EAAezP,EAAOxS,OAE1B,IAAKA,EACH,OAAOgS,EAELR,IACFgB,EAASH,GAASG,EAAQuB,GAAUvC,KAElCY,GACF2P,EAAW5P,GACX6P,GAAW,GAEJxP,EAAOxS,QA5sFG,MA6sFjB+hB,EAAW7N,GACX8N,GAAW,EACXxP,EAAS,IAAI0K,GAAS1K,IAExB0P,EACA,OAASpgB,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdqgB,EAAuB,MAAZ3Q,EAAmB1U,EAAQ0U,EAAS1U,GAGnD,GADAA,EAASsV,GAAwB,IAAVtV,EAAeA,EAAQ,EAC1CklB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAI5P,EAAO4P,KAAiBD,EAC1B,SAASD,EAGblQ,EAAO8L,KAAKhhB,QAEJilB,EAASvP,EAAQ2P,EAAU/P,IACnCJ,EAAO8L,KAAKhhB,GAGhB,OAAOkV,EAjkCTuJ,GAAO8G,iBAAmB,CAQxB,OAAU9W,EAQV,SAAYC,EAQZ,YAAeC,EAQf,SAAY,GAQZ,QAAW,CAQT,EAAK8P,KAKTA,GAAO9d,UAAYue,GAAWve,UAC9B8d,GAAO9d,UAAUoiB,YAActE,GAE/BI,GAAcle,UAAYoe,GAAWG,GAAWve,WAChDke,GAAcle,UAAUoiB,YAAclE,GAsHtCD,GAAYje,UAAYoe,GAAWG,GAAWve,WAC9Cie,GAAYje,UAAUoiB,YAAcnE,GAoGpCkB,GAAKnf,UAAUqf,MAvEf,WACEvd,KAAK4d,SAAWzC,GAAeA,GAAa,MAAQ,GACpDnb,KAAK6V,KAAO,GAsEdwH,GAAKnf,UAAkB,OAzDvB,SAAoBL,GAClB,IAAI4U,EAASzS,KAAK6U,IAAIhX,WAAemC,KAAK4d,SAAS/f,GAEnD,OADAmC,KAAK6V,MAAQpD,EAAS,EAAI,EACnBA,GAuDT4K,GAAKnf,UAAUf,IA3Cf,SAAiBU,GACf,IAAI2C,EAAOR,KAAK4d,SAChB,GAAIzC,GAAc,CAChB,IAAI1I,EAASjS,EAAK3C,GAClB,MA34De,8BA24DR4U,OAx5DT0B,EAw5DiD1B,EAEjD,OAAOtU,GAAe1B,KAAK+D,EAAM3C,GAAO2C,EAAK3C,QA15D7CsW,GAg8DFkJ,GAAKnf,UAAU2W,IA1Bf,SAAiBhX,GACf,IAAI2C,EAAOR,KAAK4d,SAChB,OAAOzC,QAx6DPhH,IAw6DuB3T,EAAK3C,GAAsBM,GAAe1B,KAAK+D,EAAM3C,IAyB9Ewf,GAAKnf,UAAUiY,IAZf,SAAiBtY,EAAKN,GACpB,IAAIiD,EAAOR,KAAK4d,SAGhB,OAFA5d,KAAK6V,MAAQ7V,KAAK6U,IAAIhX,GAAO,EAAI,EACjC2C,EAAK3C,GAAQsd,SAx7DbhH,IAw7D6B5W,EA36DZ,4BA26DoDA,EAC9DyC,MAyHTyd,GAAUvf,UAAUqf,MApFpB,WACEvd,KAAK4d,SAAW,GAChB5d,KAAK6V,KAAO,GAmFd4H,GAAUvf,UAAkB,OAvE5B,SAAyBL,GACvB,IAAI2C,EAAOR,KAAK4d,SACZrb,EAAQ6c,GAAa5e,EAAM3C,GAE/B,QAAI0E,EAAQ,KAIRA,GADY/B,EAAKC,OAAS,EAE5BD,EAAKuiB,MAELhK,GAAOtc,KAAK+D,EAAM+B,EAAO,KAEzBvC,KAAK6V,MACA,IA0DT4H,GAAUvf,UAAUf,IA9CpB,SAAsBU,GACpB,IAAI2C,EAAOR,KAAK4d,SACZrb,EAAQ6c,GAAa5e,EAAM3C,GAE/B,OAAO0E,EAAQ,OA1gEf4R,EA0gE+B3T,EAAK+B,GAAO,IA2C7Ckb,GAAUvf,UAAU2W,IA/BpB,SAAsBhX,GACpB,OAAOuhB,GAAapf,KAAK4d,SAAU/f,IAAQ,GA+B7C4f,GAAUvf,UAAUiY,IAlBpB,SAAsBtY,EAAKN,GACzB,IAAIiD,EAAOR,KAAK4d,SACZrb,EAAQ6c,GAAa5e,EAAM3C,GAQ/B,OANI0E,EAAQ,KACRvC,KAAK6V,KACPrV,EAAK+d,KAAK,CAAC1gB,EAAKN,KAEhBiD,EAAK+B,GAAO,GAAKhF,EAEZyC,MA2GT0d,GAASxf,UAAUqf,MAtEnB,WACEvd,KAAK6V,KAAO,EACZ7V,KAAK4d,SAAW,CACd,KAAQ,IAAIP,GACZ,IAAO,IAAKtC,IAAO0C,IACnB,OAAU,IAAIJ,KAkElBK,GAASxf,UAAkB,OArD3B,SAAwBL,GACtB,IAAI4U,EAASuQ,GAAWhjB,KAAMnC,GAAa,OAAEA,GAE7C,OADAmC,KAAK6V,MAAQpD,EAAS,EAAI,EACnBA,GAmDTiL,GAASxf,UAAUf,IAvCnB,SAAqBU,GACnB,OAAOmlB,GAAWhjB,KAAMnC,GAAKV,IAAIU,IAuCnC6f,GAASxf,UAAU2W,IA3BnB,SAAqBhX,GACnB,OAAOmlB,GAAWhjB,KAAMnC,GAAKgX,IAAIhX,IA2BnC6f,GAASxf,UAAUiY,IAdnB,SAAqBtY,EAAKN,GACxB,IAAIiD,EAAOwiB,GAAWhjB,KAAMnC,GACxBgY,EAAOrV,EAAKqV,KAIhB,OAFArV,EAAK2V,IAAItY,EAAKN,GACdyC,KAAK6V,MAAQrV,EAAKqV,MAAQA,EAAO,EAAI,EAC9B7V,MA2DT2d,GAASzf,UAAUwL,IAAMiU,GAASzf,UAAUqgB,KAnB5C,SAAqBhhB,GAEnB,OADAyC,KAAK4d,SAASzH,IAAI5Y,EAjrED,6BAkrEVyC,MAkBT2d,GAASzf,UAAU2W,IANnB,SAAqBtX,GACnB,OAAOyC,KAAK4d,SAAS/I,IAAItX,IAuG3BsgB,GAAM3f,UAAUqf,MA3EhB,WACEvd,KAAK4d,SAAW,IAAIH,GACpBzd,KAAK6V,KAAO,GA0EdgI,GAAM3f,UAAkB,OA9DxB,SAAqBL,GACnB,IAAI2C,EAAOR,KAAK4d,SACZnL,EAASjS,EAAa,OAAE3C,GAG5B,OADAmC,KAAK6V,KAAOrV,EAAKqV,KACVpD,GA0DToL,GAAM3f,UAAUf,IA9ChB,SAAkBU,GAChB,OAAOmC,KAAK4d,SAASzgB,IAAIU,IA8C3BggB,GAAM3f,UAAU2W,IAlChB,SAAkBhX,GAChB,OAAOmC,KAAK4d,SAAS/I,IAAIhX,IAkC3BggB,GAAM3f,UAAUiY,IArBhB,SAAkBtY,EAAKN,GACrB,IAAIiD,EAAOR,KAAK4d,SAChB,GAAIpd,aAAgBid,GAAW,CAC7B,IAAIwF,EAAQziB,EAAKod,SACjB,IAAK7C,IAAQkI,EAAMxiB,OAASyiB,IAG1B,OAFAD,EAAM1E,KAAK,CAAC1gB,EAAKN,IACjByC,KAAK6V,OAASrV,EAAKqV,KACZ7V,KAETQ,EAAOR,KAAK4d,SAAW,IAAIF,GAASuF,GAItC,OAFAziB,EAAK2V,IAAItY,EAAKN,GACdyC,KAAK6V,KAAOrV,EAAKqV,KACV7V,MAscT,IAAIsf,GAAW6D,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAU9P,EAAYnB,GAC7B,IAAIG,GAAS,EAKb,OAJA6M,GAAS7L,GAAY,SAASlW,EAAOgF,EAAOkR,GAE1C,OADAhB,IAAWH,EAAU/U,EAAOgF,EAAOkR,MAG9BhB,EAaT,SAAS+Q,GAAazR,EAAOE,EAAUY,GAIrC,IAHA,IAAItQ,GAAS,EACT9B,EAASsR,EAAMtR,SAEV8B,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACd+R,EAAUrC,EAAS1U,GAEvB,GAAe,MAAX+W,SAryFNH,IAqyF0ByO,EACftO,GAAYA,IAAYmP,GAASnP,GAClCzB,EAAWyB,EAASsO,IAE1B,IAAIA,EAAWtO,EACX7B,EAASlV,EAGjB,OAAOkV,EAuCT,SAASiR,GAAWjQ,EAAYnB,GAC9B,IAAIG,EAAS,GAMb,OALA6M,GAAS7L,GAAY,SAASlW,EAAOgF,EAAOkR,GACtCnB,EAAU/U,EAAOgF,EAAOkR,IAC1BhB,EAAO8L,KAAKhhB,MAGTkV,EAcT,SAASkR,GAAY5R,EAAO6R,EAAOtR,EAAWuR,EAAUpR,GACtD,IAAIlQ,GAAS,EACT9B,EAASsR,EAAMtR,OAKnB,IAHA6R,IAAcA,EAAYwR,IAC1BrR,IAAWA,EAAS,MAEXlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdqhB,EAAQ,GAAKtR,EAAU/U,GACrBqmB,EAAQ,EAEVD,GAAYpmB,EAAOqmB,EAAQ,EAAGtR,EAAWuR,EAAUpR,GAEnDO,GAAUP,EAAQlV,GAEVsmB,IACVpR,EAAOA,EAAOhS,QAAUlD,GAG5B,OAAOkV,EAcT,IAAIsR,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAWplB,EAAQiU,GAC1B,OAAOjU,GAAU+lB,GAAQ/lB,EAAQiU,EAAUgG,IAW7C,SAASqL,GAAgBtlB,EAAQiU,GAC/B,OAAOjU,GAAUimB,GAAajmB,EAAQiU,EAAUgG,IAYlD,SAASiM,GAAclmB,EAAQ0W,GAC7B,OAAOnC,GAAYmC,GAAO,SAAS7W,GACjC,OAAOsmB,GAAWnmB,EAAOH,OAY7B,SAASumB,GAAQpmB,EAAQwL,GAMvB,IAHA,IAAIjH,EAAQ,EACR9B,GAHJ+I,EAAO6a,GAAS7a,EAAMxL,IAGJyC,OAED,MAAVzC,GAAkBuE,EAAQ9B,GAC/BzC,EAASA,EAAOsmB,GAAM9a,EAAKjH,OAE7B,OAAQA,GAASA,GAAS9B,EAAUzC,OAj9FpCmW,EA+9FF,SAASoQ,GAAevmB,EAAQwmB,EAAUC,GACxC,IAAIhS,EAAS+R,EAASxmB,GACtB,OAAOke,GAAQle,GAAUyU,EAASO,GAAUP,EAAQgS,EAAYzmB,IAUlE,SAAS0mB,GAAWnnB,GAClB,OAAa,MAATA,OA5+FJ4W,IA6+FS5W,EA14FM,qBARL,gBAo5FF6b,IAAkBA,MAAkBpc,GAAOO,GA23FrD,SAAmBA,GACjB,IAAIonB,EAAQxmB,GAAe1B,KAAKc,EAAO6b,IACnCqH,EAAMljB,EAAM6b,IAEhB,IACE7b,EAAM6b,SA/2LRjF,EAg3LE,IAAIyQ,GAAW,EACf,MAAOxjB,IAET,IAAIqR,EAAS0F,GAAqB1b,KAAKc,GACnCqnB,IACED,EACFpnB,EAAM6b,IAAkBqH,SAEjBljB,EAAM6b,KAGjB,OAAO3G,EA34FHoS,CAAUtnB,GA+5GhB,SAAwBA,GACtB,OAAO4a,GAAqB1b,KAAKc,GA/5G7BunB,CAAevnB,GAYrB,SAASwnB,GAAOxnB,EAAOynB,GACrB,OAAOznB,EAAQynB,EAWjB,SAASC,GAAQjnB,EAAQH,GACvB,OAAiB,MAAVG,GAAkBG,GAAe1B,KAAKuB,EAAQH,GAWvD,SAASqnB,GAAUlnB,EAAQH,GACzB,OAAiB,MAAVG,GAAkBH,KAAOb,GAAOgB,GA0BzC,SAASmnB,GAAiBC,EAAQnT,EAAUY,GAS1C,IARA,IAAI2P,EAAW3P,EAAaD,GAAoBF,GAC5CjS,EAAS2kB,EAAO,GAAG3kB,OACnB4kB,EAAYD,EAAO3kB,OACnB6kB,EAAWD,EACXE,EAASxS,EAAMsS,GACfG,EAAYC,IACZhT,EAAS,GAEN6S,KAAY,CACjB,IAAIvT,EAAQqT,EAAOE,GACfA,GAAYrT,IACdF,EAAQe,GAASf,EAAOyC,GAAUvC,KAEpCuT,EAAYjL,GAAUxI,EAAMtR,OAAQ+kB,GACpCD,EAAOD,IAAazS,IAAeZ,GAAaxR,GAAU,KAAOsR,EAAMtR,QAAU,KAC7E,IAAIkd,GAAS2H,GAAYvT,QAhkG/BoC,EAmkGApC,EAAQqT,EAAO,GAEf,IAAI7iB,GAAS,EACTmjB,EAAOH,EAAO,GAElB5C,EACA,OAASpgB,EAAQ9B,GAAUgS,EAAOhS,OAAS+kB,GAAW,CACpD,IAAIjoB,EAAQwU,EAAMxP,GACdqgB,EAAW3Q,EAAWA,EAAS1U,GAASA,EAG5C,GADAA,EAASsV,GAAwB,IAAVtV,EAAeA,EAAQ,IACxCmoB,EACE/Q,GAAS+Q,EAAM9C,GACfJ,EAAS/P,EAAQmQ,EAAU/P,IAC5B,CAEL,IADAyS,EAAWD,IACFC,GAAU,CACjB,IAAI1Q,EAAQ2Q,EAAOD,GACnB,KAAM1Q,EACED,GAASC,EAAOgO,GAChBJ,EAAS4C,EAAOE,GAAW1C,EAAU/P,IAE3C,SAAS8P,EAGT+C,GACFA,EAAKnH,KAAKqE,GAEZnQ,EAAO8L,KAAKhhB,IAGhB,OAAOkV,EA+BT,SAASkT,GAAW3nB,EAAQwL,EAAMqI,GAGhC,IAAIF,EAAiB,OADrB3T,EAASqE,GAAOrE,EADhBwL,EAAO6a,GAAS7a,EAAMxL,KAEMA,EAASA,EAAOsmB,GAAMsB,GAAKpc,KACvD,OAAe,MAARmI,OAroGPwC,EAqoGkCzC,GAAMC,EAAM3T,EAAQ6T,GAUxD,SAASgU,GAAgBtoB,GACvB,OAAO0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUuM,EAuCrD,SAASgc,GAAYvoB,EAAOynB,EAAOhF,EAASC,EAAYC,GACtD,OAAI3iB,IAAUynB,IAGD,MAATznB,GAA0B,MAATynB,IAAmB/I,GAAa1e,KAAW0e,GAAa+I,GACpEznB,GAAUA,GAASynB,GAAUA,EAmBxC,SAAyBhnB,EAAQgnB,EAAOhF,EAASC,EAAY8F,EAAW7F,GACtE,IAAI8F,EAAW9J,GAAQle,GACnBioB,EAAW/J,GAAQ8I,GACnBkB,EAASF,EAAWjc,EAAW2W,GAAO1iB,GACtCmoB,EAASF,EAAWlc,EAAW2W,GAAOsE,GAKtCoB,GAHJF,EAASA,GAAUpc,EAAUS,EAAY2b,IAGhB3b,EACrB8b,GAHJF,EAASA,GAAUrc,EAAUS,EAAY4b,IAGhB5b,EACrB+b,EAAYJ,GAAUC,EAE1B,GAAIG,GAAarM,GAASjc,GAAS,CACjC,IAAKic,GAAS+K,GACZ,OAAO,EAETgB,GAAW,EACXI,GAAW,EAEb,GAAIE,IAAcF,EAEhB,OADAlG,IAAUA,EAAQ,IAAIrC,IACdmI,GAAYvU,GAAazT,GAC7BuoB,GAAYvoB,EAAQgnB,EAAOhF,EAASC,EAAY8F,EAAW7F,GA81EnE,SAAoBliB,EAAQgnB,EAAOvE,EAAKT,EAASC,EAAY8F,EAAW7F,GACtE,OAAQO,GACN,KAAK3V,EACH,GAAK9M,EAAOyjB,YAAcuD,EAAMvD,YAC3BzjB,EAAOwjB,YAAcwD,EAAMxD,WAC9B,OAAO,EAETxjB,EAASA,EAAOujB,OAChByD,EAAQA,EAAMzD,OAEhB,KAAK1W,EACH,QAAK7M,EAAOyjB,YAAcuD,EAAMvD,aAC3BsE,EAAU,IAAItN,GAAWza,GAAS,IAAIya,GAAWuM,KAKxD,KAAKhb,EACL,KAAKC,EACL,KAAKK,EAGH,OAAO0U,IAAIhhB,GAASgnB,GAEtB,KAAK9a,EACH,OAAOlM,EAAOnB,MAAQmoB,EAAMnoB,MAAQmB,EAAOwoB,SAAWxB,EAAMwB,QAE9D,KAAKhc,EACL,KAAKE,EAIH,OAAO1M,GAAWgnB,EAAQ,GAE5B,KAAK3a,EACH,IAAIoc,EAAU9Q,GAEhB,KAAKlL,EACH,IAAIic,EA/kLe,EA+kLH1G,EAGhB,GAFAyG,IAAYA,EAAUvQ,IAElBlY,EAAO6X,MAAQmP,EAAMnP,OAAS6Q,EAChC,OAAO,EAGT,IAAI1E,EAAU9B,EAAM/iB,IAAIa,GACxB,GAAIgkB,EACF,OAAOA,GAAWgD,EAEpBhF,GAzlLqB,EA4lLrBE,EAAM/J,IAAInY,EAAQgnB,GAClB,IAAIvS,EAAS8T,GAAYE,EAAQzoB,GAASyoB,EAAQzB,GAAQhF,EAASC,EAAY8F,EAAW7F,GAE1F,OADAA,EAAc,OAAEliB,GACTyU,EAET,KAAK9H,EACH,GAAIkR,GACF,OAAOA,GAAcpf,KAAKuB,IAAW6d,GAAcpf,KAAKuoB,GAG9D,OAAO,EA35ED2B,CAAW3oB,EAAQgnB,EAAOkB,EAAQlG,EAASC,EAAY8F,EAAW7F,GAExE,KA9sGuB,EA8sGjBF,GAAiC,CACrC,IAAI4G,EAAeR,GAAYjoB,GAAe1B,KAAKuB,EAAQ,eACvD6oB,EAAeR,GAAYloB,GAAe1B,KAAKuoB,EAAO,eAE1D,GAAI4B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe5oB,EAAOT,QAAUS,EAC/C+oB,EAAeF,EAAe7B,EAAMznB,QAAUynB,EAGlD,OADA9E,IAAUA,EAAQ,IAAIrC,IACfkI,EAAUe,EAAcC,EAAc/G,EAASC,EAAYC,IAGtE,IAAKoG,EACH,OAAO,EAGT,OADApG,IAAUA,EAAQ,IAAIrC,IA05ExB,SAAsB7f,EAAQgnB,EAAOhF,EAASC,EAAY8F,EAAW7F,GACnE,IAAIwG,EAxnLmB,EAwnLP1G,EACZgH,EAAW7E,GAAWnkB,GACtBipB,EAAYD,EAASvmB,OAErB4kB,EADWlD,GAAW6C,GACDvkB,OAEzB,GAAIwmB,GAAa5B,IAAcqB,EAC7B,OAAO,EAET,IAAInkB,EAAQ0kB,EACZ,KAAO1kB,KAAS,CACd,IAAI1E,EAAMmpB,EAASzkB,GACnB,KAAMmkB,EAAY7oB,KAAOmnB,EAAQ7mB,GAAe1B,KAAKuoB,EAAOnnB,IAC1D,OAAO,EAIX,IAAIqpB,EAAahH,EAAM/iB,IAAIa,GACvBmpB,EAAajH,EAAM/iB,IAAI6nB,GAC3B,GAAIkC,GAAcC,EAChB,OAAOD,GAAclC,GAASmC,GAAcnpB,EAE9C,IAAIyU,GAAS,EACbyN,EAAM/J,IAAInY,EAAQgnB,GAClB9E,EAAM/J,IAAI6O,EAAOhnB,GAEjB,IAAIopB,EAAWV,EACf,OAASnkB,EAAQ0kB,GAAW,CAC1BppB,EAAMmpB,EAASzkB,GACf,IAAI4c,EAAWnhB,EAAOH,GAClBwpB,EAAWrC,EAAMnnB,GAErB,GAAIoiB,EACF,IAAIqH,EAAWZ,EACXzG,EAAWoH,EAAUlI,EAAUthB,EAAKmnB,EAAOhnB,EAAQkiB,GACnDD,EAAWd,EAAUkI,EAAUxpB,EAAKG,EAAQgnB,EAAO9E,GAGzD,UAzrLF/L,IAyrLQmT,EACGnI,IAAakI,GAAYtB,EAAU5G,EAAUkI,EAAUrH,EAASC,EAAYC,GAC7EoH,GACD,CACL7U,GAAS,EACT,MAEF2U,IAAaA,EAAkB,eAAPvpB,GAE1B,GAAI4U,IAAW2U,EAAU,CACvB,IAAIG,EAAUvpB,EAAOsiB,YACjBkH,EAAUxC,EAAM1E,YAGhBiH,GAAWC,KACV,gBAAiBxpB,MAAU,gBAAiBgnB,IACzB,mBAAXuC,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD/U,GAAS,GAKb,OAFAyN,EAAc,OAAEliB,GAChBkiB,EAAc,OAAE8E,GACTvS,EAv9EAgV,CAAazpB,EAAQgnB,EAAOhF,EAASC,EAAY8F,EAAW7F,GA3D5DwH,CAAgBnqB,EAAOynB,EAAOhF,EAASC,EAAY6F,GAAa5F,IAmFzE,SAASyH,GAAY3pB,EAAQ8N,EAAQ8b,EAAW3H,GAC9C,IAAI1d,EAAQqlB,EAAUnnB,OAClBA,EAAS8B,EACTslB,GAAgB5H,EAEpB,GAAc,MAAVjiB,EACF,OAAQyC,EAGV,IADAzC,EAAShB,GAAOgB,GACTuE,KAAS,CACd,IAAI/B,EAAOonB,EAAUrlB,GACrB,GAAKslB,GAAgBrnB,EAAK,GAClBA,EAAK,KAAOxC,EAAOwC,EAAK,MACtBA,EAAK,KAAMxC,GAEnB,OAAO,EAGX,OAASuE,EAAQ9B,GAAQ,CAEvB,IAAI5C,GADJ2C,EAAOonB,EAAUrlB,IACF,GACX4c,EAAWnhB,EAAOH,GAClBiqB,EAAWtnB,EAAK,GAEpB,GAAIqnB,GAAgBrnB,EAAK,IACvB,QA1yGJ2T,IA0yGQgL,KAA4BthB,KAAOG,GACrC,OAAO,MAEJ,CACL,IAAIkiB,EAAQ,IAAIrC,GAChB,GAAIoC,EACF,IAAIxN,EAASwN,EAAWd,EAAU2I,EAAUjqB,EAAKG,EAAQ8N,EAAQoU,GAEnE,UAlzGJ/L,IAkzGU1B,EACEqT,GAAYgC,EAAU3I,EAAU4I,EAA+C9H,EAAYC,GAC3FzN,GAEN,OAAO,GAIb,OAAO,EAWT,SAASuV,GAAazqB,GACpB,SAAKif,GAASjf,KA05FEoU,EA15FiBpU,EA25FxBwa,IAAeA,MAAcpG,MAx5FxBwS,GAAW5mB,GAAS+a,GAAalL,IAChCsI,KAAK6F,GAAShe,IAs5F/B,IAAkBoU,EA12FlB,SAASsW,GAAa1qB,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK2qB,GAEW,iBAAT3qB,EACF2e,GAAQ3e,GACX4qB,GAAoB5qB,EAAM,GAAIA,EAAM,IACpC6qB,GAAY7qB,GAEXU,GAASV,GAUlB,SAAS8qB,GAASrqB,GAChB,IAAKsqB,GAAYtqB,GACf,OAAOqc,GAAWrc,GAEpB,IAAIyU,EAAS,GACb,IAAK,IAAI5U,KAAOb,GAAOgB,GACjBG,GAAe1B,KAAKuB,EAAQH,IAAe,eAAPA,GACtC4U,EAAO8L,KAAK1gB,GAGhB,OAAO4U,EAUT,SAAS8V,GAAWvqB,GAClB,IAAKwe,GAASxe,GACZ,OA09FJ,SAAsBA,GACpB,IAAIyU,EAAS,GACb,GAAc,MAAVzU,EACF,IAAK,IAAIH,KAAOb,GAAOgB,GACrByU,EAAO8L,KAAK1gB,GAGhB,OAAO4U,EAj+FE+V,CAAaxqB,GAEtB,IAAIyqB,EAAUH,GAAYtqB,GACtByU,EAAS,GAEb,IAAK,IAAI5U,KAAOG,GACD,eAAPH,IAAyB4qB,GAAYtqB,GAAe1B,KAAKuB,EAAQH,KACrE4U,EAAO8L,KAAK1gB,GAGhB,OAAO4U,EAYT,SAASiW,GAAOnrB,EAAOynB,GACrB,OAAOznB,EAAQynB,EAWjB,SAAS2D,GAAQlV,EAAYxB,GAC3B,IAAI1P,GAAS,EACTkQ,EAASmW,GAAYnV,GAAcV,EAAMU,EAAWhT,QAAU,GAKlE,OAHA6e,GAAS7L,GAAY,SAASlW,EAAOM,EAAK4V,GACxChB,IAASlQ,GAAS0P,EAAS1U,EAAOM,EAAK4V,MAElChB,EAUT,SAAS2V,GAAYtc,GACnB,IAAI8b,EAAYiB,GAAa/c,GAC7B,OAAwB,GAApB8b,EAAUnnB,QAAemnB,EAAU,GAAG,GACjCkB,GAAwBlB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAAS5pB,GACd,OAAOA,IAAW8N,GAAU6b,GAAY3pB,EAAQ8N,EAAQ8b,IAY5D,SAASO,GAAoB3e,EAAMse,GACjC,OAAIiB,GAAMvf,IAASwf,GAAmBlB,GAC7BgB,GAAwBxE,GAAM9a,GAAOse,GAEvC,SAAS9pB,GACd,IAAImhB,EAAWhiB,GAAIa,EAAQwL,GAC3B,YA/+GF2K,IA++GUgL,GAA0BA,IAAa2I,EAC3CmB,GAAMjrB,EAAQwL,GACdsc,GAAYgC,EAAU3I,EAAU4I,IAexC,SAASmB,GAAUlrB,EAAQ8N,EAAQqd,EAAUlJ,EAAYC,GACnDliB,IAAW8N,GAGfiY,GAAQjY,GAAQ,SAASgc,EAAUjqB,GAEjC,GADAqiB,IAAUA,EAAQ,IAAIrC,IAClBrB,GAASsL,IA+BjB,SAAuB9pB,EAAQ8N,EAAQjO,EAAKsrB,EAAUC,EAAWnJ,EAAYC,GAC3E,IAAIf,EAAWkK,GAAQrrB,EAAQH,GAC3BiqB,EAAWuB,GAAQvd,EAAQjO,GAC3BmkB,EAAU9B,EAAM/iB,IAAI2qB,GAExB,GAAI9F,EAEF,YADAjD,GAAiB/gB,EAAQH,EAAKmkB,GAGhC,IAAIsH,EAAWrJ,EACXA,EAAWd,EAAU2I,EAAWjqB,EAAM,GAAKG,EAAQ8N,EAAQoU,QA/iH/D/L,EAkjHIsO,OAljHJtO,IAkjHemV,EAEf,GAAI7G,EAAU,CACZ,IAAIzE,EAAQ9B,GAAQ4L,GAChB3J,GAAUH,GAAS/D,GAAS6N,GAC5ByB,GAAWvL,IAAUG,GAAU1M,GAAaqW,GAEhDwB,EAAWxB,EACP9J,GAASG,GAAUoL,EACjBrN,GAAQiD,GACVmK,EAAWnK,EAEJqK,GAAkBrK,GACzBmK,EAAW1K,GAAUO,GAEdhB,GACPsE,GAAW,EACX6G,EAAW1I,GAAYkH,GAAU,IAE1ByB,GACP9G,GAAW,EACX6G,EAAW3H,GAAgBmG,GAAU,IAGrCwB,EAAW,GAGNG,GAAc3B,IAAa5J,GAAY4J,IAC9CwB,EAAWnK,EACPjB,GAAYiB,GACdmK,EAAWI,GAAcvK,GAEjB3C,GAAS2C,KAAagF,GAAWhF,KACzCmK,EAAWzI,GAAgBiH,KAI7BrF,GAAW,EAGXA,IAEFvC,EAAM/J,IAAI2R,EAAUwB,GACpBF,EAAUE,EAAUxB,EAAUqB,EAAUlJ,EAAYC,GACpDA,EAAc,OAAE4H,IAElB/I,GAAiB/gB,EAAQH,EAAKyrB,GAzF1BK,CAAc3rB,EAAQ8N,EAAQjO,EAAKsrB,EAAUD,GAAWjJ,EAAYC,OAEjE,CACH,IAAIoJ,EAAWrJ,EACXA,EAAWoJ,GAAQrrB,EAAQH,GAAMiqB,EAAWjqB,EAAM,GAAKG,EAAQ8N,EAAQoU,QA3gH/E/L,WA8gHQmV,IACFA,EAAWxB,GAEb/I,GAAiB/gB,EAAQH,EAAKyrB,MAE/BtI,IAwFL,SAAS4I,GAAQ7X,EAAOhU,GACtB,IAAI0C,EAASsR,EAAMtR,OACnB,GAAKA,EAIL,OAAO6d,GADPvgB,GAAKA,EAAI,EAAI0C,EAAS,EACJA,GAAUsR,EAAMhU,QAjnHlCoW,EA6nHF,SAAS0V,GAAYpW,EAAYqW,EAAWC,GAExCD,EADEA,EAAUrpB,OACAqS,GAASgX,GAAW,SAAS7X,GACvC,OAAIiK,GAAQjK,GACH,SAAS1U,GACd,OAAO6mB,GAAQ7mB,EAA2B,IAApB0U,EAASxR,OAAewR,EAAS,GAAKA,IAGzDA,KAGG,CAACiW,IAGf,IAAI3lB,GAAS,EAUb,OATAunB,EAAYhX,GAASgX,EAAWtV,GAAUwV,OAvvF9C,SAAoBjY,EAAOkY,GACzB,IAAIxpB,EAASsR,EAAMtR,OAGnB,IADAsR,EAAMmY,KAAKD,GACJxpB,KACLsR,EAAMtR,GAAUsR,EAAMtR,GAAQlD,MAEhC,OAAOwU,EAyvFEoY,CAPMxB,GAAQlV,GAAY,SAASlW,EAAOM,EAAK4V,GAIpD,MAAO,CAAE,SAHMX,GAASgX,GAAW,SAAS7X,GAC1C,OAAOA,EAAS1U,MAEa,QAAWgF,EAAO,MAAShF,OAGlC,SAASS,EAAQgnB,GACzC,OA04BJ,SAAyBhnB,EAAQgnB,EAAO+E,GACtC,IAAIxnB,GAAS,EACT6nB,EAAcpsB,EAAOqsB,SACrBC,EAActF,EAAMqF,SACpB5pB,EAAS2pB,EAAY3pB,OACrB8pB,EAAeR,EAAOtpB,OAE1B,OAAS8B,EAAQ9B,GAAQ,CACvB,IAAIgS,EAAS+X,GAAiBJ,EAAY7nB,GAAQ+nB,EAAY/nB,IAC9D,GAAIkQ,EAAQ,CACV,GAAIlQ,GAASgoB,EACX,OAAO9X,EAET,IAAIgY,EAAQV,EAAOxnB,GACnB,OAAOkQ,GAAmB,QAATgY,GAAmB,EAAI,IAU5C,OAAOzsB,EAAOuE,MAAQyiB,EAAMziB,MAl6BnBmoB,CAAgB1sB,EAAQgnB,EAAO+E,MA4B1C,SAASY,GAAW3sB,EAAQ0hB,EAAOpN,GAKjC,IAJA,IAAI/P,GAAS,EACT9B,EAASif,EAAMjf,OACfgS,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAI+I,EAAOkW,EAAMnd,GACbhF,EAAQ6mB,GAAQpmB,EAAQwL,GAExB8I,EAAU/U,EAAOiM,IACnBohB,GAAQnY,EAAQ4R,GAAS7a,EAAMxL,GAAST,GAG5C,OAAOkV,EA2BT,SAASoY,GAAY9Y,EAAOkB,EAAQhB,EAAUY,GAC5C,IAAIiY,EAAUjY,EAAamB,GAAkBrB,GACzCpQ,GAAS,EACT9B,EAASwS,EAAOxS,OAChBilB,EAAO3T,EAQX,IANIA,IAAUkB,IACZA,EAAS2L,GAAU3L,IAEjBhB,IACFyT,EAAO5S,GAASf,EAAOyC,GAAUvC,OAE1B1P,EAAQ9B,GAKf,IAJA,IAAImT,EAAY,EACZrW,EAAQ0V,EAAO1Q,GACfqgB,EAAW3Q,EAAWA,EAAS1U,GAASA,GAEpCqW,EAAYkX,EAAQpF,EAAM9C,EAAUhP,EAAWf,KAAgB,GACjE6S,IAAS3T,GACXgH,GAAOtc,KAAKipB,EAAM9R,EAAW,GAE/BmF,GAAOtc,KAAKsV,EAAO6B,EAAW,GAGlC,OAAO7B,EAYT,SAASgZ,GAAWhZ,EAAOiZ,GAIzB,IAHA,IAAIvqB,EAASsR,EAAQiZ,EAAQvqB,OAAS,EAClC6V,EAAY7V,EAAS,EAElBA,KAAU,CACf,IAAI8B,EAAQyoB,EAAQvqB,GACpB,GAAIA,GAAU6V,GAAa/T,IAAU0oB,EAAU,CAC7C,IAAIA,EAAW1oB,EACX+b,GAAQ/b,GACVwW,GAAOtc,KAAKsV,EAAOxP,EAAO,GAE1B2oB,GAAUnZ,EAAOxP,IAIvB,OAAOwP,EAYT,SAAS0M,GAAWoB,EAAOC,GACzB,OAAOD,EAAQjG,GAAYc,MAAkBoF,EAAQD,EAAQ,IAkC/D,SAASsL,GAAW1V,EAAQ1X,GAC1B,IAAI0U,EAAS,GACb,IAAKgD,GAAU1X,EAAI,GAAKA,EArwHL,iBAswHjB,OAAO0U,EAIT,GACM1U,EAAI,IACN0U,GAAUgD,IAEZ1X,EAAI6b,GAAY7b,EAAI,MAElB0X,GAAUA,SAEL1X,GAET,OAAO0U,EAWT,SAAS2Y,GAASzZ,EAAM0Z,GACtB,OAAOC,GAAYC,GAAS5Z,EAAM0Z,EAAOnD,IAAWvW,EAAO,IAU7D,SAAS6Z,GAAW/X,GAClB,OAAO+K,GAAYvL,GAAOQ,IAW5B,SAASgY,GAAehY,EAAY1V,GAClC,IAAIgU,EAAQkB,GAAOQ,GACnB,OAAOkL,GAAY5M,EAAO8M,GAAU9gB,EAAG,EAAGgU,EAAMtR,SAalD,SAASmqB,GAAQ5sB,EAAQwL,EAAMjM,EAAO0iB,GACpC,IAAKzD,GAASxe,GACZ,OAAOA,EAST,IALA,IAAIuE,GAAS,EACT9B,GAHJ+I,EAAO6a,GAAS7a,EAAMxL,IAGJyC,OACd6V,EAAY7V,EAAS,EACrBirB,EAAS1tB,EAEI,MAAV0tB,KAAoBnpB,EAAQ9B,GAAQ,CACzC,IAAI5C,EAAMymB,GAAM9a,EAAKjH,IACjB+mB,EAAW/rB,EAEf,GAAY,cAARM,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOG,EAGT,GAAIuE,GAAS+T,EAAW,CACtB,IAAI6I,EAAWuM,EAAO7tB,QAl5H1BsW,KAm5HImV,EAAWrJ,EAAaA,EAAWd,EAAUthB,EAAK6tB,QAn5HtDvX,KAq5HMmV,EAAW9M,GAAS2C,GAChBA,EACCb,GAAQ9U,EAAKjH,EAAQ,IAAM,GAAK,IAGzC2c,GAAYwM,EAAQ7tB,EAAKyrB,GACzBoC,EAASA,EAAO7tB,GAElB,OAAOG,EAWT,IAAI2tB,GAAevQ,GAAqB,SAASzJ,EAAMnR,GAErD,OADA4a,GAAQjF,IAAIxE,EAAMnR,GACXmR,GAFoBuW,GAazB0D,GAAmB3uB,GAA4B,SAAS0U,EAAM8D,GAChE,OAAOxY,GAAe0U,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASka,GAASpW,GAClB,UAAY,KALwByS,GAgBxC,SAAS4D,GAAYrY,GACnB,OAAOkL,GAAY1L,GAAOQ,IAY5B,SAASsY,GAAUha,EAAOsZ,EAAOW,GAC/B,IAAIzpB,GAAS,EACT9B,EAASsR,EAAMtR,OAEf4qB,EAAQ,IACVA,GAASA,EAAQ5qB,EAAS,EAAKA,EAAS4qB,IAE1CW,EAAMA,EAAMvrB,EAASA,EAASurB,GACpB,IACRA,GAAOvrB,GAETA,EAAS4qB,EAAQW,EAAM,EAAMA,EAAMX,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAI5Y,EAASM,EAAMtS,KACV8B,EAAQ9B,GACfgS,EAAOlQ,GAASwP,EAAMxP,EAAQ8oB,GAEhC,OAAO5Y,EAYT,SAASwZ,GAASxY,EAAYnB,GAC5B,IAAIG,EAMJ,OAJA6M,GAAS7L,GAAY,SAASlW,EAAOgF,EAAOkR,GAE1C,QADAhB,EAASH,EAAU/U,EAAOgF,EAAOkR,SAG1BhB,EAeX,SAASyZ,GAAgBna,EAAOxU,EAAO4uB,GACrC,IAAIC,EAAM,EACNC,EAAgB,MAATta,EAAgBqa,EAAMra,EAAMtR,OAEvC,GAAoB,iBAATlD,GAAqBA,GAAUA,GAAS8uB,GA18H3BC,WA08H0D,CAChF,KAAOF,EAAMC,GAAM,CACjB,IAAIE,EAAOH,EAAMC,IAAU,EACvBzJ,EAAW7Q,EAAMwa,GAEJ,OAAb3J,IAAsBa,GAASb,KAC9BuJ,EAAcvJ,GAAYrlB,EAAUqlB,EAAWrlB,GAClD6uB,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAOF,EAET,OAAOG,GAAkBza,EAAOxU,EAAO2qB,GAAUiE,GAgBnD,SAASK,GAAkBza,EAAOxU,EAAO0U,EAAUka,GACjD,IAAIC,EAAM,EACNC,EAAgB,MAATta,EAAgB,EAAIA,EAAMtR,OACrC,GAAa,IAAT4rB,EACF,OAAO,EAST,IALA,IAAII,GADJlvB,EAAQ0U,EAAS1U,KACQA,EACrBmvB,EAAsB,OAAVnvB,EACZovB,EAAclJ,GAASlmB,GACvBqvB,OAnjIJzY,IAmjIqB5W,EAEd6uB,EAAMC,GAAM,CACjB,IAAIE,EAAM3S,IAAawS,EAAMC,GAAQ,GACjCzJ,EAAW3Q,EAASF,EAAMwa,IAC1BM,OAxjIN1Y,IAwjIqByO,EACfkK,EAAyB,OAAblK,EACZmK,EAAiBnK,GAAaA,EAC9BoK,EAAcvJ,GAASb,GAE3B,GAAI6J,EACF,IAAIQ,EAASd,GAAcY,OAE3BE,EADSL,EACAG,IAAmBZ,GAAcU,GACjCH,EACAK,GAAkBF,IAAiBV,IAAeW,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcX,IAAea,IAChEF,IAAaE,IAGbb,EAAcvJ,GAAYrlB,EAAUqlB,EAAWrlB,GAEtD0vB,EACFb,EAAMG,EAAM,EAEZF,EAAOE,EAGX,OAAOhS,GAAU8R,EAjhICC,YA6hIpB,SAASY,GAAenb,EAAOE,GAM7B,IALA,IAAI1P,GAAS,EACT9B,EAASsR,EAAMtR,OACf+R,EAAW,EACXC,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdqgB,EAAW3Q,EAAWA,EAAS1U,GAASA,EAE5C,IAAKgF,IAAUyc,GAAG4D,EAAU8C,GAAO,CACjC,IAAIA,EAAO9C,EACXnQ,EAAOD,KAAwB,IAAVjV,EAAc,EAAIA,GAG3C,OAAOkV,EAWT,SAAS0a,GAAa5vB,GACpB,MAAoB,iBAATA,EACFA,EAELkmB,GAASlmB,GA/jIP,KAkkIEA,EAWV,SAAS6vB,GAAa7vB,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI2e,GAAQ3e,GAEV,OAAOuV,GAASvV,EAAO6vB,IAAgB,GAEzC,GAAI3J,GAASlmB,GACX,OAAOwe,GAAiBA,GAAetf,KAAKc,GAAS,GAEvD,IAAIkV,EAAUlV,EAAQ,GACtB,MAAkB,KAAVkV,GAAkB,EAAIlV,IA7lInB,IA6lI0C,KAAOkV,EAY9D,SAAS4a,GAAStb,EAAOE,EAAUY,GACjC,IAAItQ,GAAS,EACTigB,EAAW9P,GACXjS,EAASsR,EAAMtR,OACfgiB,GAAW,EACXhQ,EAAS,GACTiT,EAAOjT,EAEX,GAAII,EACF4P,GAAW,EACXD,EAAW5P,QAER,GAAInS,GAvqIU,IAuqIkB,CACnC,IAAI0V,EAAMlE,EAAW,KAAOqb,GAAUvb,GACtC,GAAIoE,EACF,OAAOD,GAAWC,GAEpBsM,GAAW,EACXD,EAAW7N,GACX+Q,EAAO,IAAI/H,QAGX+H,EAAOzT,EAAW,GAAKQ,EAEzBkQ,EACA,OAASpgB,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdqgB,EAAW3Q,EAAWA,EAAS1U,GAASA,EAG5C,GADAA,EAASsV,GAAwB,IAAVtV,EAAeA,EAAQ,EAC1CklB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAI2K,EAAY7H,EAAKjlB,OACd8sB,KACL,GAAI7H,EAAK6H,KAAe3K,EACtB,SAASD,EAGT1Q,GACFyT,EAAKnH,KAAKqE,GAEZnQ,EAAO8L,KAAKhhB,QAEJilB,EAASkD,EAAM9C,EAAU/P,KAC7B6S,IAASjT,GACXiT,EAAKnH,KAAKqE,GAEZnQ,EAAO8L,KAAKhhB,IAGhB,OAAOkV,EAWT,SAASyY,GAAUltB,EAAQwL,GAGzB,OAAiB,OADjBxL,EAASqE,GAAOrE,EADhBwL,EAAO6a,GAAS7a,EAAMxL,aAEUA,EAAOsmB,GAAMsB,GAAKpc,KAapD,SAASgkB,GAAWxvB,EAAQwL,EAAMikB,EAASxN,GACzC,OAAO2K,GAAQ5sB,EAAQwL,EAAMikB,EAAQrJ,GAAQpmB,EAAQwL,IAAQyW,GAc/D,SAASyN,GAAU3b,EAAOO,EAAWqb,EAAQ9Z,GAI3C,IAHA,IAAIpT,EAASsR,EAAMtR,OACf8B,EAAQsR,EAAYpT,GAAU,GAE1BoT,EAAYtR,MAAYA,EAAQ9B,IACtC6R,EAAUP,EAAMxP,GAAQA,EAAOwP,KAEjC,OAAO4b,EACH5B,GAAUha,EAAQ8B,EAAY,EAAItR,EAASsR,EAAYtR,EAAQ,EAAI9B,GACnEsrB,GAAUha,EAAQ8B,EAAYtR,EAAQ,EAAI,EAAKsR,EAAYpT,EAAS8B,GAa1E,SAASqrB,GAAiBrwB,EAAOswB,GAC/B,IAAIpb,EAASlV,EAIb,OAHIkV,aAAkB0J,KACpB1J,EAASA,EAAOlV,SAEX2V,GAAY2a,GAAS,SAASpb,EAAQqb,GAC3C,OAAOA,EAAOnc,KAAKD,MAAMoc,EAAOlc,QAASoB,GAAU,CAACP,GAASqb,EAAOjc,SACnEY,GAaL,SAASsb,GAAQ3I,EAAQnT,EAAUY,GACjC,IAAIpS,EAAS2kB,EAAO3kB,OACpB,GAAIA,EAAS,EACX,OAAOA,EAAS4sB,GAASjI,EAAO,IAAM,GAKxC,IAHA,IAAI7iB,GAAS,EACTkQ,EAASM,EAAMtS,KAEV8B,EAAQ9B,GAIf,IAHA,IAAIsR,EAAQqT,EAAO7iB,GACf+iB,GAAY,IAEPA,EAAW7kB,GACd6kB,GAAY/iB,IACdkQ,EAAOlQ,GAASggB,GAAe9P,EAAOlQ,IAAUwP,EAAOqT,EAAOE,GAAWrT,EAAUY,IAIzF,OAAOwa,GAAS1J,GAAYlR,EAAQ,GAAIR,EAAUY,GAYpD,SAASmb,GAActZ,EAAOzB,EAAQgb,GAMpC,IALA,IAAI1rB,GAAS,EACT9B,EAASiU,EAAMjU,OACfytB,EAAajb,EAAOxS,OACpBgS,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQgF,EAAQ2rB,EAAajb,EAAO1Q,QA30I1C4R,EA40IE8Z,EAAWxb,EAAQiC,EAAMnS,GAAQhF,GAEnC,OAAOkV,EAUT,SAAS0b,GAAoB5wB,GAC3B,OAAOisB,GAAkBjsB,GAASA,EAAQ,GAU5C,SAAS6wB,GAAa7wB,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ2qB,GAW9C,SAAS7D,GAAS9mB,EAAOS,GACvB,OAAIke,GAAQ3e,GACHA,EAEFwrB,GAAMxrB,EAAOS,GAAU,CAACT,GAAS8wB,GAAaxW,GAASta,IAYhE,IAAI+wB,GAAWlD,GAWf,SAASmD,GAAUxc,EAAOsZ,EAAOW,GAC/B,IAAIvrB,EAASsR,EAAMtR,OAEnB,OADAurB,OA54IA7X,IA44IM6X,EAAoBvrB,EAASurB,GAC1BX,GAASW,GAAOvrB,EAAUsR,EAAQga,GAAUha,EAAOsZ,EAAOW,GASrE,IAAIlpB,GAAewW,IAAmB,SAASkV,GAC7C,OAAOre,GAAKrN,aAAa0rB,IAW3B,SAAS5N,GAAYW,EAAQpB,GAC3B,GAAIA,EACF,OAAOoB,EAAOkN,QAEhB,IAAIhuB,EAAS8gB,EAAO9gB,OAChBgS,EAASiG,GAAcA,GAAYjY,GAAU,IAAI8gB,EAAOjB,YAAY7f,GAGxE,OADA8gB,EAAOmN,KAAKjc,GACLA,EAUT,SAAS4O,GAAiBsN,GACxB,IAAIlc,EAAS,IAAIkc,EAAYrO,YAAYqO,EAAYlN,YAErD,OADA,IAAIhJ,GAAWhG,GAAQ0D,IAAI,IAAIsC,GAAWkW,IACnClc,EAgDT,SAASkP,GAAgBiN,EAAYzO,GACnC,IAAIoB,EAASpB,EAASkB,GAAiBuN,EAAWrN,QAAUqN,EAAWrN,OACvE,OAAO,IAAIqN,EAAWtO,YAAYiB,EAAQqN,EAAWpN,WAAYoN,EAAWnuB,QAW9E,SAAS+pB,GAAiBjtB,EAAOynB,GAC/B,GAAIznB,IAAUynB,EAAO,CACnB,IAAI6J,OAt/IN1a,IAs/IqB5W,EACfmvB,EAAsB,OAAVnvB,EACZuxB,EAAiBvxB,GAAUA,EAC3BovB,EAAclJ,GAASlmB,GAEvBsvB,OA3/IN1Y,IA2/IqB6Q,EACf8H,EAAsB,OAAV9H,EACZ+H,EAAiB/H,GAAUA,EAC3BgI,EAAcvJ,GAASuB,GAE3B,IAAM8H,IAAcE,IAAgBL,GAAepvB,EAAQynB,GACtD2H,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5B8B,GAAgB9B,IACjB+B,EACH,OAAO,EAET,IAAMpC,IAAcC,IAAgBK,GAAezvB,EAAQynB,GACtDgI,GAAe6B,GAAgBC,IAAmBpC,IAAcC,GAChEG,GAAa+B,GAAgBC,IAC5BjC,GAAgBiC,IACjB/B,EACH,OAAQ,EAGZ,OAAO,EAuDT,SAASgC,GAAYld,EAAMmd,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAavd,EAAKpR,OAClB4uB,EAAgBJ,EAAQxuB,OACxB6uB,GAAa,EACbC,EAAaP,EAASvuB,OACtB+uB,EAAclV,GAAU8U,EAAaC,EAAe,GACpD5c,EAASM,EAAMwc,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnB9c,EAAO6c,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7B3c,EAAOwc,EAAQE,IAActd,EAAKsd,IAGtC,KAAOK,KACL/c,EAAO6c,KAAezd,EAAKsd,KAE7B,OAAO1c,EAcT,SAASid,GAAiB7d,EAAMmd,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAavd,EAAKpR,OAClBkvB,GAAgB,EAChBN,EAAgBJ,EAAQxuB,OACxBmvB,GAAc,EACdC,EAAcb,EAASvuB,OACvB+uB,EAAclV,GAAU8U,EAAaC,EAAe,GACpD5c,EAASM,EAAMyc,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnB/c,EAAO0c,GAAatd,EAAKsd,GAG3B,IADA,IAAIzvB,EAASyvB,IACJS,EAAaC,GACpBpd,EAAO/S,EAASkwB,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7B3c,EAAO/S,EAASuvB,EAAQU,IAAiB9d,EAAKsd,MAGlD,OAAO1c,EAWT,SAASmM,GAAU9S,EAAQiG,GACzB,IAAIxP,GAAS,EACT9B,EAASqL,EAAOrL,OAGpB,IADAsR,IAAUA,EAAQgB,EAAMtS,MACf8B,EAAQ9B,GACfsR,EAAMxP,GAASuJ,EAAOvJ,GAExB,OAAOwP,EAaT,SAASyN,GAAW1T,EAAQ4I,EAAO1W,EAAQiiB,GACzC,IAAI6P,GAAS9xB,EACbA,IAAWA,EAAS,IAKpB,IAHA,IAAIuE,GAAS,EACT9B,EAASiU,EAAMjU,SAEV8B,EAAQ9B,GAAQ,CACvB,IAAI5C,EAAM6W,EAAMnS,GAEZ+mB,EAAWrJ,EACXA,EAAWjiB,EAAOH,GAAMiO,EAAOjO,GAAMA,EAAKG,EAAQ8N,QA3qJxDqI,WA8qJMmV,IACFA,EAAWxd,EAAOjO,IAEhBiyB,EACF7Q,GAAgBjhB,EAAQH,EAAKyrB,GAE7BpK,GAAYlhB,EAAQH,EAAKyrB,GAG7B,OAAOtrB,EAmCT,SAAS+xB,GAAiB/d,EAAQge,GAChC,OAAO,SAASvc,EAAYxB,GAC1B,IAAIN,EAAOuK,GAAQzI,GAAc3B,GAAkBuN,GAC/CnN,EAAc8d,EAAcA,IAAgB,GAEhD,OAAOre,EAAK8B,EAAYzB,EAAQgY,GAAY/X,EAAU,GAAIC,IAW9D,SAAS+d,GAAeC,GACtB,OAAO9E,IAAS,SAASptB,EAAQmyB,GAC/B,IAAI5tB,GAAS,EACT9B,EAAS0vB,EAAQ1vB,OACjBwf,EAAaxf,EAAS,EAAI0vB,EAAQ1vB,EAAS,QA9uJjD0T,EA+uJMic,EAAQ3vB,EAAS,EAAI0vB,EAAQ,QA/uJnChc,EA0vJE,IATA8L,EAAciQ,EAASzvB,OAAS,GAA0B,mBAAdwf,GACvCxf,IAAUwf,QAlvJjB9L,EAqvJMic,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDnQ,EAAaxf,EAAS,OAtvJ1B0T,EAsvJ0C8L,EACtCxf,EAAS,GAEXzC,EAAShB,GAAOgB,KACPuE,EAAQ9B,GAAQ,CACvB,IAAIqL,EAASqkB,EAAQ5tB,GACjBuJ,GACFokB,EAASlyB,EAAQ8N,EAAQvJ,EAAO0d,GAGpC,OAAOjiB,KAYX,SAASmlB,GAAezP,EAAUG,GAChC,OAAO,SAASJ,EAAYxB,GAC1B,GAAkB,MAAdwB,EACF,OAAOA,EAET,IAAKmV,GAAYnV,GACf,OAAOC,EAASD,EAAYxB,GAM9B,IAJA,IAAIxR,EAASgT,EAAWhT,OACpB8B,EAAQsR,EAAYpT,GAAU,EAC9B6vB,EAAWtzB,GAAOyW,IAEdI,EAAYtR,MAAYA,EAAQ9B,KACa,IAA/CwR,EAASqe,EAAS/tB,GAAQA,EAAO+tB,KAIvC,OAAO7c,GAWX,SAASuQ,GAAcnQ,GACrB,OAAO,SAAS7V,EAAQiU,EAAUuS,GAMhC,IALA,IAAIjiB,GAAS,EACT+tB,EAAWtzB,GAAOgB,GAClB0W,EAAQ8P,EAASxmB,GACjByC,EAASiU,EAAMjU,OAEZA,KAAU,CACf,IAAI5C,EAAM6W,EAAMb,EAAYpT,IAAW8B,GACvC,IAA+C,IAA3C0P,EAASqe,EAASzyB,GAAMA,EAAKyyB,GAC/B,MAGJ,OAAOtyB,GAgCX,SAASuyB,GAAgBC,GACvB,OAAO,SAAS/a,GAGd,IAAIV,EAAaS,GAFjBC,EAASoC,GAASpC,IAGde,GAAcf,QA11JpBtB,EA61JMoB,EAAMR,EACNA,EAAW,GACXU,EAAOgb,OAAO,GAEdC,EAAW3b,EACXwZ,GAAUxZ,EAAY,GAAGjG,KAAK,IAC9B2G,EAAOgZ,MAAM,GAEjB,OAAOlZ,EAAIib,KAAgBE,GAW/B,SAASC,GAAiBC,GACxB,OAAO,SAASnb,GACd,OAAOvC,GAAY2d,GAAMC,GAAOrb,GAAQ8C,QAAQtJ,GAAQ,KAAM2hB,EAAU,KAY5E,SAASG,GAAW3P,GAClB,OAAO,WAIL,IAAIvP,EAAOmf,UACX,OAAQnf,EAAKpR,QACX,KAAK,EAAG,OAAO,IAAI2gB,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAKvP,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAIuP,EAAKvP,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIof,EAAc3U,GAAW8E,EAAKljB,WAC9BuU,EAAS2O,EAAK1P,MAAMuf,EAAapf,GAIrC,OAAO2K,GAAS/J,GAAUA,EAASwe,GAgDvC,SAASC,GAAWC,GAClB,OAAO,SAAS1d,EAAYnB,EAAWsB,GACrC,IAAI0c,EAAWtzB,GAAOyW,GACtB,IAAKmV,GAAYnV,GAAa,CAC5B,IAAIxB,EAAW+X,GAAY1X,EAAW,GACtCmB,EAAawE,GAAKxE,GAClBnB,EAAY,SAASzU,GAAO,OAAOoU,EAASqe,EAASzyB,GAAMA,EAAKyyB,IAElE,IAAI/tB,EAAQ4uB,EAAc1d,EAAYnB,EAAWsB,GACjD,OAAOrR,GAAS,EAAI+tB,EAASre,EAAWwB,EAAWlR,GAASA,QA58J9D4R,GAu9JF,SAASid,GAAWvd,GAClB,OAAOwd,IAAS,SAASC,GACvB,IAAI7wB,EAAS6wB,EAAM7wB,OACf8B,EAAQ9B,EACR8wB,EAASnV,GAAcle,UAAUszB,KAKrC,IAHI3d,GACFyd,EAAMzW,UAEDtY,KAAS,CACd,IAAIoP,EAAO2f,EAAM/uB,GACjB,GAAmB,mBAARoP,EACT,MAAM,IAAI4F,GAAU5N,GAEtB,GAAI4nB,IAAWE,GAAgC,WAArBC,GAAY/f,GACpC,IAAI8f,EAAU,IAAIrV,GAAc,IAAI,GAIxC,IADA7Z,EAAQkvB,EAAUlvB,EAAQ9B,IACjB8B,EAAQ9B,GAAQ,CAGvB,IAAIkxB,EAAWD,GAFf/f,EAAO2f,EAAM/uB,IAGT/B,EAAmB,WAAZmxB,EAAwBC,GAAQjgB,QA9+J/CwC,EAo/JMsd,EAJEjxB,GAAQqxB,GAAWrxB,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGC,QAAqB,GAAXD,EAAK,GAElBixB,EAAQC,GAAYlxB,EAAK,KAAKkR,MAAM+f,EAASjxB,EAAK,IAElC,GAAfmR,EAAKlR,QAAeoxB,GAAWlgB,GACtC8f,EAAQE,KACRF,EAAQD,KAAK7f,GAGrB,OAAO,WACL,IAAIE,EAAOmf,UACPzzB,EAAQsU,EAAK,GAEjB,GAAI4f,GAA0B,GAAf5f,EAAKpR,QAAeyb,GAAQ3e,GACzC,OAAOk0B,EAAQK,MAAMv0B,GAAOA,QAK9B,IAHA,IAAIgF,EAAQ,EACRkQ,EAAShS,EAAS6wB,EAAM/uB,GAAOmP,MAAM1R,KAAM6R,GAAQtU,IAE9CgF,EAAQ9B,GACfgS,EAAS6e,EAAM/uB,GAAO9F,KAAKuD,KAAMyS,GAEnC,OAAOA,MAwBb,SAASsf,GAAapgB,EAAMqO,EAASpO,EAASod,EAAUC,EAAS+C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EA3/JY,IA2/JJrS,EACRsS,EAngKa,EAmgKJtS,EACTuS,EAngKiB,EAmgKLvS,EACZkP,EAAsB,GAAVlP,EACZwS,EA7/Ja,IA6/JJxS,EACToB,EAAOmR,OAtiKXpe,EAsiKmC4c,GAAWpf,GA6C9C,OA3CA,SAAS8f,IAKP,IAJA,IAAIhxB,EAASuwB,UAAUvwB,OACnBoR,EAAOkB,EAAMtS,GACb8B,EAAQ9B,EAEL8B,KACLsP,EAAKtP,GAASyuB,UAAUzuB,GAE1B,GAAI2sB,EACF,IAAI/Z,EAAcsd,GAAUhB,GACxBiB,EAAexd,GAAarD,EAAMsD,GASxC,GAPI6Z,IACFnd,EAAOkd,GAAYld,EAAMmd,EAAUC,EAASC,IAE1C8C,IACFngB,EAAO6d,GAAiB7d,EAAMmgB,EAAeC,EAAc/C,IAE7DzuB,GAAUiyB,EACNxD,GAAazuB,EAAS2xB,EAAO,CAC/B,IAAIO,EAAa1c,GAAepE,EAAMsD,GACtC,OAAOyd,GACLjhB,EAAMqO,EAAS+R,GAAcN,EAAQtc,YAAavD,EAClDC,EAAM8gB,EAAYT,EAAQC,EAAKC,EAAQ3xB,GAG3C,IAAIwwB,EAAcqB,EAAS1gB,EAAU5R,KACjC6yB,EAAKN,EAAYtB,EAAYtf,GAAQA,EAczC,OAZAlR,EAASoR,EAAKpR,OACVyxB,EACFrgB,EAAOihB,GAAQjhB,EAAMqgB,GACZM,GAAU/xB,EAAS,GAC5BoR,EAAKgJ,UAEHwX,GAASF,EAAM1xB,IACjBoR,EAAKpR,OAAS0xB,GAEZnyB,MAAQA,OAASmQ,IAAQnQ,gBAAgByxB,IAC3CoB,EAAKzR,GAAQ2P,GAAW8B,IAEnBA,EAAGnhB,MAAMuf,EAAapf,IAajC,SAASkhB,GAAe/gB,EAAQghB,GAC9B,OAAO,SAASh1B,EAAQiU,GACtB,OAh/DJ,SAAsBjU,EAAQgU,EAAQC,EAAUC,GAI9C,OAHAkR,GAAWplB,GAAQ,SAAST,EAAOM,EAAKG,GACtCgU,EAAOE,EAAaD,EAAS1U,GAAQM,EAAKG,MAErCkU,EA4+DE+gB,CAAaj1B,EAAQgU,EAAQghB,EAAW/gB,GAAW,KAY9D,SAASihB,GAAoBC,EAAUC,GACrC,OAAO,SAAS71B,EAAOynB,GACrB,IAAIvS,EACJ,QA/mKF0B,IA+mKM5W,QA/mKN4W,IA+mK6B6Q,EACzB,OAAOoO,EAKT,QArnKFjf,IAknKM5W,IACFkV,EAASlV,QAnnKb4W,IAqnKM6Q,EAAqB,CACvB,QAtnKJ7Q,IAsnKQ1B,EACF,OAAOuS,EAEW,iBAATznB,GAAqC,iBAATynB,GACrCznB,EAAQ6vB,GAAa7vB,GACrBynB,EAAQoI,GAAapI,KAErBznB,EAAQ4vB,GAAa5vB,GACrBynB,EAAQmI,GAAanI,IAEvBvS,EAAS0gB,EAAS51B,EAAOynB,GAE3B,OAAOvS,GAWX,SAAS4gB,GAAWC,GAClB,OAAOjC,IAAS,SAASvH,GAEvB,OADAA,EAAYhX,GAASgX,EAAWtV,GAAUwV,OACnCoB,IAAS,SAASvZ,GACvB,IAAID,EAAU5R,KACd,OAAOszB,EAAUxJ,GAAW,SAAS7X,GACnC,OAAOP,GAAMO,EAAUL,EAASC,YAexC,SAAS0hB,GAAc9yB,EAAQ+yB,GAG7B,IAAIC,GAFJD,OAnqKArf,IAmqKQqf,EAAsB,IAAMpG,GAAaoG,IAEzB/yB,OACxB,GAAIgzB,EAAc,EAChB,OAAOA,EAActI,GAAWqI,EAAO/yB,GAAU+yB,EAEnD,IAAI/gB,EAAS0Y,GAAWqI,EAAO9Z,GAAWjZ,EAAS4V,GAAWmd,KAC9D,OAAOhe,GAAWge,GACdjF,GAAU/X,GAAc/D,GAAS,EAAGhS,GAAQqO,KAAK,IACjD2D,EAAOgc,MAAM,EAAGhuB,GA6CtB,SAASizB,GAAY7f,GACnB,OAAO,SAASwX,EAAOW,EAAK2H,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBtD,GAAehF,EAAOW,EAAK2H,KAChE3H,EAAM2H,OA5tKVxf,GA+tKEkX,EAAQuI,GAASvI,QA/tKnBlX,IAguKM6X,GACFA,EAAMX,EACNA,EAAQ,GAERW,EAAM4H,GAAS5H,GA57CrB,SAAmBX,EAAOW,EAAK2H,EAAM9f,GAKnC,IAJA,IAAItR,GAAS,EACT9B,EAAS6Z,GAAUZ,IAAYsS,EAAMX,IAAUsI,GAAQ,IAAK,GAC5DlhB,EAASM,EAAMtS,GAEZA,KACLgS,EAAOoB,EAAYpT,IAAW8B,GAAS8oB,EACvCA,GAASsI,EAEX,OAAOlhB,EAs7CEohB,CAAUxI,EAAOW,EADxB2H,OAtuKFxf,IAsuKSwf,EAAsBtI,EAAQW,EAAM,GAAK,EAAK4H,GAASD,GAC3B9f,IAWvC,SAASigB,GAA0BX,GACjC,OAAO,SAAS51B,EAAOynB,GAKrB,MAJsB,iBAATznB,GAAqC,iBAATynB,IACvCznB,EAAQw2B,GAASx2B,GACjBynB,EAAQ+O,GAAS/O,IAEZmO,EAAS51B,EAAOynB,IAqB3B,SAAS4N,GAAcjhB,EAAMqO,EAASgU,EAAU7e,EAAavD,EAASod,EAAUC,EAASiD,EAAQC,EAAKC,GACpG,IAAI6B,EA5uKc,EA4uKJjU,EAMdA,GAAYiU,EAhvKQ,GACM,GAJF,GAovKxBjU,KAAaiU,EAhvKa,GADN,OAovKlBjU,IAAW,GAEb,IAAIkU,EAAU,CACZviB,EAAMqO,EAASpO,EAVCqiB,EAAUjF,OAjxK5B7a,EA+wKiB8f,EAAUhF,OA/wK3B9a,EAkxKuB8f,OAlxKvB9f,EAkxK6C6a,EAFvBiF,OAhxKtB9f,EAgxK4C8a,EAYzBiD,EAAQC,EAAKC,GAG5B3f,EAASuhB,EAAStiB,WA/xKtByC,EA+xKuC+f,GAKvC,OAJIrC,GAAWlgB,IACbwiB,GAAQ1hB,EAAQyhB,GAElBzhB,EAAO0C,YAAcA,EACdif,GAAgB3hB,EAAQd,EAAMqO,GAUvC,SAASqU,GAAY7D,GACnB,IAAI7e,EAAOjT,GAAK8xB,GAChB,OAAO,SAAS5Q,EAAQ0U,GAGtB,GAFA1U,EAASmU,GAASnU,IAClB0U,EAAyB,MAAbA,EAAoB,EAAI/Z,GAAUga,GAAUD,GAAY,OACnDpa,GAAe0F,GAAS,CAGvC,IAAI4U,GAAQ3c,GAAS+H,GAAU,KAAKjJ,MAAM,KAI1C,SADA6d,GAAQ3c,GAFIlG,EAAK6iB,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAK3d,MAAM,MACvB,GAAK,MAAQ6d,EAAK,GAAKF,IAEvC,OAAO3iB,EAAKiO,IAWhB,IAAI0N,GAAcrS,IAAQ,EAAI/E,GAAW,IAAI+E,GAAI,CAAC,EAAE,KAAK,IA/wK5C,IA+wKsE,SAAShI,GAC1F,OAAO,IAAIgI,GAAIhI,IAD2DwhB,GAW5E,SAASC,GAAclQ,GACrB,OAAO,SAASxmB,GACd,IAAIyiB,EAAMC,GAAO1iB,GACjB,OAAIyiB,GAAOpW,EACFsL,GAAW3X,GAEhByiB,GAAOhW,EACF2L,GAAWpY,GAv4I1B,SAAqBA,EAAQ0W,GAC3B,OAAO5B,GAAS4B,GAAO,SAAS7W,GAC9B,MAAO,CAACA,EAAKG,EAAOH,OAu4IX82B,CAAY32B,EAAQwmB,EAASxmB,KA6BxC,SAAS42B,GAAWjjB,EAAMqO,EAASpO,EAASod,EAAUC,EAASiD,EAAQC,EAAKC,GAC1E,IAAIG,EAz1KiB,EAy1KLvS,EAChB,IAAKuS,GAA4B,mBAAR5gB,EACvB,MAAM,IAAI4F,GAAU5N,GAEtB,IAAIlJ,EAASuuB,EAAWA,EAASvuB,OAAS,EAS1C,GARKA,IACHuf,IAAW,GACXgP,EAAWC,OAh4Kb9a,GAk4KAge,OAl4KAhe,IAk4KMge,EAAoBA,EAAM7X,GAAUia,GAAUpC,GAAM,GAC1DC,OAn4KAje,IAm4KQie,EAAsBA,EAAQmC,GAAUnC,GAChD3xB,GAAUwuB,EAAUA,EAAQxuB,OAAS,EA/1KX,GAi2KtBuf,EAAmC,CACrC,IAAIgS,EAAgBhD,EAChBiD,EAAehD,EAEnBD,EAAWC,OA14Kb9a,EA44KA,IAAI3T,EAAO+xB,OA54KXpe,EA44KmCyd,GAAQjgB,GAEvCuiB,EAAU,CACZviB,EAAMqO,EAASpO,EAASod,EAAUC,EAAS+C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfI5xB,GA26BN,SAAmBA,EAAMsL,GACvB,IAAIkU,EAAUxf,EAAK,GACfq0B,EAAa/oB,EAAO,GACpBgpB,EAAa9U,EAAU6U,EACvBpS,EAAWqS,EAAa,IAExBC,EA9xMY,KA+xMZF,GAnyMc,GAmyMmB7U,GA/xMrB,KAgyMZ6U,GA/xMc,KA+xMmB7U,GAAgCxf,EAAK,GAAGC,QAAUqL,EAAO,IAC5E,KAAd+oB,GAAqD/oB,EAAO,GAAGrL,QAAUqL,EAAO,IAryMlE,GAqyM0EkU,EAG5F,IAAMyC,IAAYsS,EAChB,OAAOv0B,EA5yMQ,EA+yMbq0B,IACFr0B,EAAK,GAAKsL,EAAO,GAEjBgpB,GAlzMe,EAkzMD9U,EAA2B,EAhzMnB,GAmzMxB,IAAIziB,EAAQuO,EAAO,GACnB,GAAIvO,EAAO,CACT,IAAIyxB,EAAWxuB,EAAK,GACpBA,EAAK,GAAKwuB,EAAWD,GAAYC,EAAUzxB,EAAOuO,EAAO,IAAMvO,EAC/DiD,EAAK,GAAKwuB,EAAW/Y,GAAezV,EAAK,GAAIoJ,GAAekC,EAAO,IAGrEvO,EAAQuO,EAAO,MAEbkjB,EAAWxuB,EAAK,GAChBA,EAAK,GAAKwuB,EAAWU,GAAiBV,EAAUzxB,EAAOuO,EAAO,IAAMvO,EACpEiD,EAAK,GAAKwuB,EAAW/Y,GAAezV,EAAK,GAAIoJ,GAAekC,EAAO,KAGrEvO,EAAQuO,EAAO,MAEbtL,EAAK,GAAKjD,GA9zMI,IAi0MZs3B,IACFr0B,EAAK,GAAgB,MAAXA,EAAK,GAAasL,EAAO,GAAKyO,GAAU/Z,EAAK,GAAIsL,EAAO,KAGrD,MAAXtL,EAAK,KACPA,EAAK,GAAKsL,EAAO,IAGnBtL,EAAK,GAAKsL,EAAO,GACjBtL,EAAK,GAAKs0B,EA59BRE,CAAUd,EAAS1zB,GAErBmR,EAAOuiB,EAAQ,GACflU,EAAUkU,EAAQ,GAClBtiB,EAAUsiB,EAAQ,GAClBlF,EAAWkF,EAAQ,GACnBjF,EAAUiF,EAAQ,KAClB9B,EAAQ8B,EAAQ,QA35KhB/f,IA25KqB+f,EAAQ,GACxB3B,EAAY,EAAI5gB,EAAKlR,OACtB6Z,GAAU4Z,EAAQ,GAAKzzB,EAAQ,KAEX,GAAVuf,IACZA,IAAW,IAERA,GAn4KY,GAm4KDA,EAGdvN,EAn4KgB,GAk4KPuN,GAj4Ka,IAi4KiBA,EApgB3C,SAAqBrO,EAAMqO,EAASoS,GAClC,IAAIhR,EAAO2P,GAAWpf,GAwBtB,OAtBA,SAAS8f,IAMP,IALA,IAAIhxB,EAASuwB,UAAUvwB,OACnBoR,EAAOkB,EAAMtS,GACb8B,EAAQ9B,EACR0U,EAAcsd,GAAUhB,GAErBlvB,KACLsP,EAAKtP,GAASyuB,UAAUzuB,GAE1B,IAAI0sB,EAAWxuB,EAAS,GAAKoR,EAAK,KAAOsD,GAAetD,EAAKpR,EAAS,KAAO0U,EACzE,GACAc,GAAepE,EAAMsD,GAGzB,IADA1U,GAAUwuB,EAAQxuB,QACL2xB,EACX,OAAOQ,GACLjhB,EAAMqO,EAAS+R,GAAcN,EAAQtc,iBAn7J3ChB,EAo7JMtC,EAAMod,OAp7JZ9a,SAo7J2Cie,EAAQ3xB,GAEjD,IAAIoyB,EAAM7yB,MAAQA,OAASmQ,IAAQnQ,gBAAgByxB,EAAWrQ,EAAOzP,EACrE,OAAOD,GAAMmhB,EAAI7yB,KAAM6R,IA8edojB,CAAYtjB,EAAMqO,EAASoS,GAj4KlB,IAk4KRpS,GAA2C,IAAXA,GAAqDiP,EAAQxuB,OAG9FsxB,GAAargB,WAz6KxByC,EAy6KyC+f,GA9O3C,SAAuBviB,EAAMqO,EAASpO,EAASod,GAC7C,IAAIsD,EA7pKa,EA6pKJtS,EACToB,EAAO2P,GAAWpf,GAkBtB,OAhBA,SAAS8f,IAQP,IAPA,IAAItC,GAAa,EACbC,EAAa4B,UAAUvwB,OACvB6uB,GAAa,EACbC,EAAaP,EAASvuB,OACtBoR,EAAOkB,EAAMwc,EAAaH,GAC1ByD,EAAM7yB,MAAQA,OAASmQ,IAAQnQ,gBAAgByxB,EAAWrQ,EAAOzP,IAE5D2d,EAAYC,GACnB1d,EAAKyd,GAAaN,EAASM,GAE7B,KAAOF,KACLvd,EAAKyd,KAAe0B,YAAY7B,GAElC,OAAOzd,GAAMmhB,EAAIP,EAAS1gB,EAAU5R,KAAM6R,IA0NjCqjB,CAAcvjB,EAAMqO,EAASpO,EAASod,QAJ/C,IAAIvc,EAhmBR,SAAoBd,EAAMqO,EAASpO,GACjC,IAAI0gB,EAryJa,EAqyJJtS,EACToB,EAAO2P,GAAWpf,GAMtB,OAJA,SAAS8f,IACP,IAAIoB,EAAM7yB,MAAQA,OAASmQ,IAAQnQ,gBAAgByxB,EAAWrQ,EAAOzP,EACrE,OAAOkhB,EAAGnhB,MAAM4gB,EAAS1gB,EAAU5R,KAAMgxB,YA0lB5BmE,CAAWxjB,EAAMqO,EAASpO,GASzC,OAAOwiB,IADM5zB,EAAOmrB,GAAcwI,IACJ1hB,EAAQyhB,GAAUviB,EAAMqO,GAexD,SAASoV,GAAuBjW,EAAU2I,EAAUjqB,EAAKG,GACvD,YA57KAmW,IA47KIgL,GACCH,GAAGG,EAAUzH,GAAY7Z,MAAUM,GAAe1B,KAAKuB,EAAQH,GAC3DiqB,EAEF3I,EAiBT,SAASkW,GAAoBlW,EAAU2I,EAAUjqB,EAAKG,EAAQ8N,EAAQoU,GAOpE,OANI1D,GAAS2C,IAAa3C,GAASsL,KAEjC5H,EAAM/J,IAAI2R,EAAU3I,GACpB+J,GAAU/J,EAAU2I,OAr9KtB3T,EAq9K2CkhB,GAAqBnV,GAC9DA,EAAc,OAAE4H,IAEX3I,EAYT,SAASmW,GAAgB/3B,GACvB,OAAOksB,GAAclsB,QAr+KrB4W,EAq+K0C5W,EAgB5C,SAASgpB,GAAYxU,EAAOiT,EAAOhF,EAASC,EAAY8F,EAAW7F,GACjE,IAAIwG,EA39KmB,EA29KP1G,EACZuV,EAAYxjB,EAAMtR,OAClB4kB,EAAYL,EAAMvkB,OAEtB,GAAI80B,GAAalQ,KAAeqB,GAAarB,EAAYkQ,GACvD,OAAO,EAGT,IAAIC,EAAatV,EAAM/iB,IAAI4U,GACvBoV,EAAajH,EAAM/iB,IAAI6nB,GAC3B,GAAIwQ,GAAcrO,EAChB,OAAOqO,GAAcxQ,GAASmC,GAAcpV,EAE9C,IAAIxP,GAAS,EACTkQ,GAAS,EACTiT,EAz+KqB,EAy+Kb1F,EAAoC,IAAIrC,QArgLpDxJ,EA2gLA,IAJA+L,EAAM/J,IAAIpE,EAAOiT,GACjB9E,EAAM/J,IAAI6O,EAAOjT,KAGRxP,EAAQgzB,GAAW,CAC1B,IAAIE,EAAW1jB,EAAMxP,GACjB8kB,EAAWrC,EAAMziB,GAErB,GAAI0d,EACF,IAAIqH,EAAWZ,EACXzG,EAAWoH,EAAUoO,EAAUlzB,EAAOyiB,EAAOjT,EAAOmO,GACpDD,EAAWwV,EAAUpO,EAAU9kB,EAAOwP,EAAOiT,EAAO9E,GAE1D,QAphLF/L,IAohLMmT,EAAwB,CAC1B,GAAIA,EACF,SAEF7U,GAAS,EACT,MAGF,GAAIiT,GACF,IAAKrS,GAAU2R,GAAO,SAASqC,EAAU/B,GACnC,IAAK3Q,GAAS+Q,EAAMJ,KACfmQ,IAAapO,GAAYtB,EAAU0P,EAAUpO,EAAUrH,EAASC,EAAYC,IAC/E,OAAOwF,EAAKnH,KAAK+G,MAEjB,CACN7S,GAAS,EACT,YAEG,GACDgjB,IAAapO,IACXtB,EAAU0P,EAAUpO,EAAUrH,EAASC,EAAYC,GACpD,CACLzN,GAAS,EACT,OAKJ,OAFAyN,EAAc,OAAEnO,GAChBmO,EAAc,OAAE8E,GACTvS,EA0KT,SAAS4e,GAAS1f,GAChB,OAAO2Z,GAAYC,GAAS5Z,OA3tL5BwC,EA2tL6CuhB,IAAU/jB,EAAO,IAUhE,SAASwQ,GAAWnkB,GAClB,OAAOumB,GAAevmB,EAAQia,GAAMiJ,IAWtC,SAASgB,GAAalkB,GACpB,OAAOumB,GAAevmB,EAAQgjB,GAAQF,IAUxC,IAAI8Q,GAAWxW,GAAiB,SAASzJ,GACvC,OAAOyJ,GAAQje,IAAIwU,IADI8iB,GAWzB,SAAS/C,GAAY/f,GAKnB,IAJA,IAAIc,EAAUd,EAAK9U,KAAO,GACtBkV,EAAQsJ,GAAU5I,GAClBhS,EAAStC,GAAe1B,KAAK4e,GAAW5I,GAAUV,EAAMtR,OAAS,EAE9DA,KAAU,CACf,IAAID,EAAOuR,EAAMtR,GACbk1B,EAAYn1B,EAAKmR,KACrB,GAAiB,MAAbgkB,GAAqBA,GAAahkB,EACpC,OAAOnR,EAAK3D,KAGhB,OAAO4V,EAUT,SAASggB,GAAU9gB,GAEjB,OADaxT,GAAe1B,KAAKuf,GAAQ,eAAiBA,GAASrK,GACrDwD,YAchB,SAAS6U,KACP,IAAIvX,EAASuJ,GAAO/J,UAAYA,GAEhC,OADAQ,EAASA,IAAWR,GAAWgW,GAAexV,EACvCue,UAAUvwB,OAASgS,EAAOue,UAAU,GAAIA,UAAU,IAAMve,EAWjE,SAASuQ,GAAWpN,EAAK/X,GACvB,IAgYiBN,EACbgI,EAjYA/E,EAAOoV,EAAIgI,SACf,OAiYgB,WADZrY,SADahI,EA/XAM,KAiYmB,UAAR0H,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVhI,EACU,OAAVA,GAlYDiD,EAAmB,iBAAP3C,EAAkB,SAAW,QACzC2C,EAAKoV,IAUX,SAASiT,GAAa7qB,GAIpB,IAHA,IAAIyU,EAASwF,GAAKja,GACdyC,EAASgS,EAAOhS,OAEbA,KAAU,CACf,IAAI5C,EAAM4U,EAAOhS,GACblD,EAAQS,EAAOH,GAEnB4U,EAAOhS,GAAU,CAAC5C,EAAKN,EAAOyrB,GAAmBzrB,IAEnD,OAAOkV,EAWT,SAAS4G,GAAUrb,EAAQH,GACzB,IAAIN,EAnwJR,SAAkBS,EAAQH,GACxB,OAAiB,MAAVG,OA7lCLmW,EA6lCkCnW,EAAOH,GAkwJ7B+3B,CAAS53B,EAAQH,GAC7B,OAAOmqB,GAAazqB,GAASA,OAh2L7B4W,EAq4LF,IAAI+M,GAAcpH,GAA+B,SAAS9b,GACxD,OAAc,MAAVA,EACK,IAETA,EAAShB,GAAOgB,GACTuU,GAAYuH,GAAiB9b,IAAS,SAAS8jB,GACpD,OAAOhJ,GAAqBrc,KAAKuB,EAAQ8jB,QANR+T,GAiBjC/U,GAAgBhH,GAA+B,SAAS9b,GAE1D,IADA,IAAIyU,EAAS,GACNzU,GACLgV,GAAUP,EAAQyO,GAAWljB,IAC7BA,EAAS2a,GAAa3a,GAExB,OAAOyU,GAN8BojB,GAgBnCnV,GAASgE,GA2Eb,SAASoR,GAAQ93B,EAAQwL,EAAMusB,GAO7B,IAJA,IAAIxzB,GAAS,EACT9B,GAHJ+I,EAAO6a,GAAS7a,EAAMxL,IAGJyC,OACdgS,GAAS,IAEJlQ,EAAQ9B,GAAQ,CACvB,IAAI5C,EAAMymB,GAAM9a,EAAKjH,IACrB,KAAMkQ,EAAmB,MAAVzU,GAAkB+3B,EAAQ/3B,EAAQH,IAC/C,MAEFG,EAASA,EAAOH,GAElB,OAAI4U,KAAYlQ,GAAS9B,EAChBgS,KAEThS,EAAmB,MAAVzC,EAAiB,EAAIA,EAAOyC,SAClBu1B,GAASv1B,IAAW6d,GAAQzgB,EAAK4C,KACjDyb,GAAQle,IAAWkgB,GAAYlgB,IA6BpC,SAAS6iB,GAAgB7iB,GACvB,MAAqC,mBAAtBA,EAAOsiB,aAA8BgI,GAAYtqB,GAE5D,GADAse,GAAW3D,GAAa3a,IA8E9B,SAAS8lB,GAAcvmB,GACrB,OAAO2e,GAAQ3e,IAAU2gB,GAAY3gB,OAChCyb,IAAoBzb,GAASA,EAAMyb,KAW1C,SAASsF,GAAQ/gB,EAAOkD,GACtB,IAAI8E,SAAchI,EAGlB,SAFAkD,EAAmB,MAAVA,EAvkMU,iBAukM0BA,KAGlC,UAAR8E,GACU,UAARA,GAAoB+H,GAASoI,KAAKnY,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQkD,EAajD,SAAS4vB,GAAe9yB,EAAOgF,EAAOvE,GACpC,IAAKwe,GAASxe,GACZ,OAAO,EAET,IAAIuH,SAAchD,EAClB,SAAY,UAARgD,EACKqjB,GAAY5qB,IAAWsgB,GAAQ/b,EAAOvE,EAAOyC,QACrC,UAAR8E,GAAoBhD,KAASvE,IAE7BghB,GAAGhhB,EAAOuE,GAAQhF,GAa7B,SAASwrB,GAAMxrB,EAAOS,GACpB,GAAIke,GAAQ3e,GACV,OAAO,EAET,IAAIgI,SAAchI,EAClB,QAAY,UAARgI,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAAThI,IAAiBkmB,GAASlmB,MAGvB6O,EAAcsJ,KAAKnY,KAAW4O,EAAauJ,KAAKnY,IAC1C,MAAVS,GAAkBT,KAASP,GAAOgB,IAyBvC,SAAS6zB,GAAWlgB,GAClB,IAAIggB,EAAWD,GAAY/f,GACvBqT,EAAQhJ,GAAO2V,GAEnB,GAAoB,mBAAT3M,KAAyB2M,KAAYxV,GAAYje,WAC1D,OAAO,EAET,GAAIyT,IAASqT,EACX,OAAO,EAET,IAAIxkB,EAAOoxB,GAAQ5M,GACnB,QAASxkB,GAAQmR,IAASnR,EAAK,IA7S5Bsa,IAAY4F,GAAO,IAAI5F,GAAS,IAAImb,YAAY,MAAQnrB,GACxDiQ,IAAO2F,GAAO,IAAI3F,KAAQ1Q,GAC1B2Q,IA90LU,oBA80LC0F,GAAO1F,GAAQkb,YAC1Bjb,IAAOyF,GAAO,IAAIzF,KAAQxQ,GAC1ByQ,IAAWwF,GAAO,IAAIxF,KAAYtQ,KACrC8V,GAAS,SAASnjB,GAChB,IAAIkV,EAASiS,GAAWnnB,GACpB6jB,EAAO3O,GAAUlI,EAAYhN,EAAM+iB,iBAh7LzCnM,EAi7LMgiB,EAAa/U,EAAO7F,GAAS6F,GAAQ,GAEzC,GAAI+U,EACF,OAAQA,GACN,KAAK7a,GAAoB,OAAOxQ,EAChC,KAAK0Q,GAAe,OAAOnR,EAC3B,KAAKoR,GAAmB,MA11LjB,mBA21LP,KAAKC,GAAe,OAAOjR,EAC3B,KAAKkR,GAAmB,OAAO/Q,EAGnC,OAAO6H,IA+SX,IAAI2jB,GAAaze,GAAawM,GAAakS,GAS3C,SAAS/N,GAAY/qB,GACnB,IAAI6jB,EAAO7jB,GAASA,EAAM+iB,YAG1B,OAAO/iB,KAFqB,mBAAR6jB,GAAsBA,EAAKljB,WAAcwZ,IAa/D,SAASsR,GAAmBzrB,GAC1B,OAAOA,GAAUA,IAAUif,GAASjf,GAYtC,SAASurB,GAAwBjrB,EAAKiqB,GACpC,OAAO,SAAS9pB,GACd,OAAc,MAAVA,IAGGA,EAAOH,KAASiqB,SArxMzB3T,IAsxMK2T,GAA2BjqB,KAAOb,GAAOgB,MAsIhD,SAASutB,GAAS5Z,EAAM0Z,EAAOtV,GAE7B,OADAsV,EAAQ/Q,QA75MRnG,IA65MkBkX,EAAuB1Z,EAAKlR,OAAS,EAAK4qB,EAAO,GAC5D,WAML,IALA,IAAIxZ,EAAOmf,UACPzuB,GAAS,EACT9B,EAAS6Z,GAAUzI,EAAKpR,OAAS4qB,EAAO,GACxCtZ,EAAQgB,EAAMtS,KAET8B,EAAQ9B,GACfsR,EAAMxP,GAASsP,EAAKwZ,EAAQ9oB,GAE9BA,GAAS,EAET,IADA,IAAI+zB,EAAYvjB,EAAMsY,EAAQ,KACrB9oB,EAAQ8oB,GACfiL,EAAU/zB,GAASsP,EAAKtP,GAG1B,OADA+zB,EAAUjL,GAAStV,EAAUhE,GACtBL,GAAMC,EAAM3R,KAAMs2B,IAY7B,SAASj0B,GAAOrE,EAAQwL,GACtB,OAAOA,EAAK/I,OAAS,EAAIzC,EAASomB,GAAQpmB,EAAQ+tB,GAAUviB,EAAM,GAAI,IAaxE,SAASspB,GAAQ/gB,EAAOiZ,GAKtB,IAJA,IAAIuK,EAAYxjB,EAAMtR,OAClBA,EAAS8Z,GAAUyQ,EAAQvqB,OAAQ80B,GACnCgB,EAAW3X,GAAU7M,GAElBtR,KAAU,CACf,IAAI8B,EAAQyoB,EAAQvqB,GACpBsR,EAAMtR,GAAU6d,GAAQ/b,EAAOgzB,GAAagB,EAASh0B,QA98MvD4R,EAg9MA,OAAOpC,EAWT,SAASsX,GAAQrrB,EAAQH,GACvB,IAAY,gBAARA,GAAgD,mBAAhBG,EAAOH,KAIhC,aAAPA,EAIJ,OAAOG,EAAOH,GAiBhB,IAAIs2B,GAAUqC,GAAS7K,IAUnBnsB,GAAaia,IAAiB,SAAS9H,EAAM2Q,GAC/C,OAAOnS,GAAK3Q,WAAWmS,EAAM2Q,IAW3BgJ,GAAckL,GAAS5K,IAY3B,SAASwI,GAAgB3C,EAASgF,EAAWzW,GAC3C,IAAIlU,EAAU2qB,EAAY,GAC1B,OAAOnL,GAAYmG,EA1brB,SAA2B3lB,EAAQ4qB,GACjC,IAAIj2B,EAASi2B,EAAQj2B,OACrB,IAAKA,EACH,OAAOqL,EAET,IAAIwK,EAAY7V,EAAS,EAGzB,OAFAi2B,EAAQpgB,IAAc7V,EAAS,EAAI,KAAO,IAAMi2B,EAAQpgB,GACxDogB,EAAUA,EAAQ5nB,KAAKrO,EAAS,EAAI,KAAO,KACpCqL,EAAOyM,QAAQ5L,EAAe,uBAAyB+pB,EAAU,UAkb5CC,CAAkB7qB,EAqHhD,SAA2B4qB,EAAS1W,GAOlC,OANA7N,GAAUtI,GAAW,SAAS2qB,GAC5B,IAAIj3B,EAAQ,KAAOi3B,EAAK,GACnBxU,EAAUwU,EAAK,KAAQ9hB,GAAcgkB,EAASn5B,IACjDm5B,EAAQnY,KAAKhhB,MAGVm5B,EAAQxM,OA5HuC0M,CAtjBxD,SAAwB9qB,GACtB,IAAI2K,EAAQ3K,EAAO2K,MAAM7J,GACzB,OAAO6J,EAAQA,EAAM,GAAGE,MAAM9J,GAAkB,GAojBwBgqB,CAAe/qB,GAASkU,KAYlG,SAASwW,GAAS7kB,GAChB,IAAImlB,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQxc,KACRyc,EA3/MK,IA2/MmBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAhgNE,IAigNN,OAAO9F,UAAU,QAGnB8F,EAAQ,EAEV,OAAOnlB,EAAKD,WArjNdyC,EAqjN+B6c,YAYjC,SAASrS,GAAY5M,EAAO8D,GAC1B,IAAItT,GAAS,EACT9B,EAASsR,EAAMtR,OACf6V,EAAY7V,EAAS,EAGzB,IADAoV,OAtkNA1B,IAskNO0B,EAAqBpV,EAASoV,IAC5BtT,EAAQsT,GAAM,CACrB,IAAIqhB,EAAOzY,GAAWlc,EAAO+T,GACzB/Y,EAAQwU,EAAMmlB,GAElBnlB,EAAMmlB,GAAQnlB,EAAMxP,GACpBwP,EAAMxP,GAAShF,EAGjB,OADAwU,EAAMtR,OAASoV,EACR9D,EAUT,IAAIsc,GAvTJ,SAAuB1c,GACrB,IAAIc,EAAS0kB,GAAQxlB,GAAM,SAAS9T,GAIlC,OAvxMiB,MAoxMb+W,EAAMiB,MACRjB,EAAM2I,QAED1f,KAGL+W,EAAQnC,EAAOmC,MACnB,OAAOnC,EA8SU2kB,EAAc,SAAS3hB,GACxC,IAAIhD,EAAS,GAOb,OAN6B,KAAzBgD,EAAO4hB,WAAW,IACpB5kB,EAAO8L,KAAK,IAEd9I,EAAO8C,QAAQlM,GAAY,SAASoK,EAAOmJ,EAAQ0X,EAAOC,GACxD9kB,EAAO8L,KAAK+Y,EAAQC,EAAUhf,QAAQxL,GAAc,MAAS6S,GAAUnJ,MAElEhE,KAUT,SAAS6R,GAAM/mB,GACb,GAAoB,iBAATA,GAAqBkmB,GAASlmB,GACvC,OAAOA,EAET,IAAIkV,EAAUlV,EAAQ,GACtB,MAAkB,KAAVkV,GAAkB,EAAIlV,IAxjNnB,IAwjN0C,KAAOkV,EAU9D,SAAS8I,GAAS5J,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOiG,GAAanb,KAAKkV,GACzB,MAAOvQ,IACT,IACE,OAAQuQ,EAAO,GACf,MAAOvQ,KAEX,MAAO,GA4BT,SAASib,GAAaoV,GACpB,GAAIA,aAAmBtV,GACrB,OAAOsV,EAAQ+F,QAEjB,IAAI/kB,EAAS,IAAI2J,GAAcqV,EAAQ9U,YAAa8U,EAAQ5U,WAI5D,OAHApK,EAAOmK,YAAcgC,GAAU6S,EAAQ7U,aACvCnK,EAAOqK,UAAa2U,EAAQ3U,UAC5BrK,EAAOsK,WAAa0U,EAAQ1U,WACrBtK,EAsIT,IAAIglB,GAAarM,IAAS,SAASrZ,EAAOkB,GACxC,OAAOuW,GAAkBzX,GACrBwQ,GAAexQ,EAAO4R,GAAY1Q,EAAQ,EAAGuW,IAAmB,IAChE,MA6BFkO,GAAetM,IAAS,SAASrZ,EAAOkB,GAC1C,IAAIhB,EAAW2T,GAAK3S,GAIpB,OAHIuW,GAAkBvX,KACpBA,OAh1NFkC,GAk1NOqV,GAAkBzX,GACrBwQ,GAAexQ,EAAO4R,GAAY1Q,EAAQ,EAAGuW,IAAmB,GAAOQ,GAAY/X,EAAU,IAC7F,MA0BF0lB,GAAiBvM,IAAS,SAASrZ,EAAOkB,GAC5C,IAAIJ,EAAa+S,GAAK3S,GAItB,OAHIuW,GAAkB3W,KACpBA,OAj3NFsB,GAm3NOqV,GAAkBzX,GACrBwQ,GAAexQ,EAAO4R,GAAY1Q,EAAQ,EAAGuW,IAAmB,QAp3NpErV,EAo3NsFtB,GAClF,MAsON,SAAS+kB,GAAU7lB,EAAOO,EAAWsB,GACnC,IAAInT,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI8B,EAAqB,MAAbqR,EAAoB,EAAI2gB,GAAU3gB,GAI9C,OAHIrR,EAAQ,IACVA,EAAQ+X,GAAU7Z,EAAS8B,EAAO,IAE7BoR,GAAc5B,EAAOiY,GAAY1X,EAAW,GAAI/P,GAsCzD,SAASs1B,GAAc9lB,EAAOO,EAAWsB,GACvC,IAAInT,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI8B,EAAQ9B,EAAS,EAOrB,YAtpOA0T,IAgpOIP,IACFrR,EAAQgyB,GAAU3gB,GAClBrR,EAAQqR,EAAY,EAChB0G,GAAU7Z,EAAS8B,EAAO,GAC1BgY,GAAUhY,EAAO9B,EAAS,IAEzBkT,GAAc5B,EAAOiY,GAAY1X,EAAW,GAAI/P,GAAO,GAiBhE,SAASmzB,GAAQ3jB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMtR,QACvBkjB,GAAY5R,EAAO,GAAK,GAgG1C,SAAS+lB,GAAK/lB,GACZ,OAAQA,GAASA,EAAMtR,OAAUsR,EAAM,QA1wOvCoC,EAo1OF,IAAI4jB,GAAe3M,IAAS,SAAShG,GACnC,IAAI4S,EAASllB,GAASsS,EAAQ+I,IAC9B,OAAQ6J,EAAOv3B,QAAUu3B,EAAO,KAAO5S,EAAO,GAC1CD,GAAiB6S,GACjB,MA0BFC,GAAiB7M,IAAS,SAAShG,GACrC,IAAInT,EAAW2T,GAAKR,GAChB4S,EAASllB,GAASsS,EAAQ+I,IAO9B,OALIlc,IAAa2T,GAAKoS,GACpB/lB,OAv3OFkC,EAy3OE6jB,EAAOjV,MAEDiV,EAAOv3B,QAAUu3B,EAAO,KAAO5S,EAAO,GAC1CD,GAAiB6S,EAAQhO,GAAY/X,EAAU,IAC/C,MAwBFimB,GAAmB9M,IAAS,SAAShG,GACvC,IAAIvS,EAAa+S,GAAKR,GAClB4S,EAASllB,GAASsS,EAAQ+I,IAM9B,OAJAtb,EAAkC,mBAAdA,EAA2BA,OAz5O/CsB,IA25OE6jB,EAAOjV,MAEDiV,EAAOv3B,QAAUu3B,EAAO,KAAO5S,EAAO,GAC1CD,GAAiB6S,OA95OrB7jB,EA85OwCtB,GACpC,MAoCN,SAAS+S,GAAK7T,GACZ,IAAItR,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAOA,EAASsR,EAAMtR,EAAS,QAr8O/B0T,EA4hPF,IAAIgkB,GAAO/M,GAASgN,IAsBpB,SAASA,GAAQrmB,EAAOkB,GACtB,OAAQlB,GAASA,EAAMtR,QAAUwS,GAAUA,EAAOxS,OAC9CoqB,GAAY9Y,EAAOkB,GACnBlB,EAqFN,IAAIsmB,GAAShH,IAAS,SAAStf,EAAOiZ,GACpC,IAAIvqB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACnCgS,EAASgN,GAAO1N,EAAOiZ,GAM3B,OAJAD,GAAWhZ,EAAOe,GAASkY,GAAS,SAASzoB,GAC3C,OAAO+b,GAAQ/b,EAAO9B,IAAW8B,EAAQA,KACxC2nB,KAAKM,KAED/X,KA2ET,SAASoI,GAAQ9I,GACf,OAAgB,MAATA,EAAgBA,EAAQ6I,GAAcne,KAAKsV,GAkapD,IAAIumB,GAAQlN,IAAS,SAAShG,GAC5B,OAAOiI,GAAS1J,GAAYyB,EAAQ,EAAGoE,IAAmB,OA0BxD+O,GAAUnN,IAAS,SAAShG,GAC9B,IAAInT,EAAW2T,GAAKR,GAIpB,OAHIoE,GAAkBvX,KACpBA,OA9pQFkC,GAgqQOkZ,GAAS1J,GAAYyB,EAAQ,EAAGoE,IAAmB,GAAOQ,GAAY/X,EAAU,OAwBrFumB,GAAYpN,IAAS,SAAShG,GAChC,IAAIvS,EAAa+S,GAAKR,GAEtB,OADAvS,EAAkC,mBAAdA,EAA2BA,OA1rQ/CsB,EA2rQOkZ,GAAS1J,GAAYyB,EAAQ,EAAGoE,IAAmB,QA3rQ1DrV,EA2rQ4EtB,MAgG9E,SAAS4lB,GAAM1mB,GACb,IAAMA,IAASA,EAAMtR,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAsR,EAAQQ,GAAYR,GAAO,SAAS2mB,GAClC,GAAIlP,GAAkBkP,GAEpB,OADAj4B,EAAS6Z,GAAUoe,EAAMj4B,OAAQA,IAC1B,KAGJ8T,GAAU9T,GAAQ,SAAS8B,GAChC,OAAOuQ,GAASf,EAAOwB,GAAahR,OAyBxC,SAASo2B,GAAU5mB,EAAOE,GACxB,IAAMF,IAASA,EAAMtR,OACnB,MAAO,GAET,IAAIgS,EAASgmB,GAAM1mB,GACnB,OAAgB,MAAZE,EACKQ,EAEFK,GAASL,GAAQ,SAASimB,GAC/B,OAAOhnB,GAAMO,OAz0QfkC,EAy0QoCukB,MAwBtC,IAAIE,GAAUxN,IAAS,SAASrZ,EAAOkB,GACrC,OAAOuW,GAAkBzX,GACrBwQ,GAAexQ,EAAOkB,GACtB,MAqBF4lB,GAAMzN,IAAS,SAAShG,GAC1B,OAAO2I,GAAQxb,GAAY6S,EAAQoE,QA0BjCsP,GAAQ1N,IAAS,SAAShG,GAC5B,IAAInT,EAAW2T,GAAKR,GAIpB,OAHIoE,GAAkBvX,KACpBA,OAv5QFkC,GAy5QO4Z,GAAQxb,GAAY6S,EAAQoE,IAAoBQ,GAAY/X,EAAU,OAwB3E8mB,GAAU3N,IAAS,SAAShG,GAC9B,IAAIvS,EAAa+S,GAAKR,GAEtB,OADAvS,EAAkC,mBAAdA,EAA2BA,OAn7Q/CsB,EAo7QO4Z,GAAQxb,GAAY6S,EAAQoE,SAp7QnCrV,EAo7QkEtB,MAmBhEmmB,GAAM5N,GAASqN,IA6DnB,IAAIQ,GAAU7N,IAAS,SAAShG,GAC9B,IAAI3kB,EAAS2kB,EAAO3kB,OAChBwR,EAAWxR,EAAS,EAAI2kB,EAAO3kB,EAAS,QAtgR5C0T,EAygRA,OADAlC,EAA8B,mBAAZA,GAA0BmT,EAAOrC,MAAO9Q,QAxgR1DkC,EAygROwkB,GAAUvT,EAAQnT,MAkC3B,SAASinB,GAAM37B,GACb,IAAIkV,EAASuJ,GAAOze,GAEpB,OADAkV,EAAOoK,WAAY,EACZpK,EAsDT,SAAS+e,GAAKj0B,EAAO47B,GACnB,OAAOA,EAAY57B,GAmBrB,IAAI67B,GAAY/H,IAAS,SAAS3R,GAChC,IAAIjf,EAASif,EAAMjf,OACf4qB,EAAQ5qB,EAASif,EAAM,GAAK,EAC5BniB,EAAQyC,KAAK2c,YACbwc,EAAc,SAASn7B,GAAU,OAAOyhB,GAAOzhB,EAAQ0hB,IAE3D,QAAIjf,EAAS,GAAKT,KAAK4c,YAAYnc,SAC7BlD,aAAiB4e,IAAiBmC,GAAQ+M,KAGhD9tB,EAAQA,EAAMkxB,MAAMpD,GAAQA,GAAS5qB,EAAS,EAAI,KAC5Cmc,YAAY2B,KAAK,CACrB,KAAQiT,GACR,KAAQ,CAAC2H,GACT,aAtoRFhlB,IAwoRO,IAAIiI,GAAc7e,EAAOyC,KAAK6c,WAAW2U,MAAK,SAASzf,GAI5D,OAHItR,IAAWsR,EAAMtR,QACnBsR,EAAMwM,UA1oRVpK,GA4oRSpC,MAZA/R,KAAKwxB,KAAK2H,MA+PrB,IAAIE,GAAUtJ,IAAiB,SAAStd,EAAQlV,EAAOM,GACjDM,GAAe1B,KAAKgW,EAAQ5U,KAC5B4U,EAAO5U,GAETohB,GAAgBxM,EAAQ5U,EAAK,MAuIjC,IAAI+G,GAAOssB,GAAW0G,IAqBlB0B,GAAWpI,GAAW2G,IA2G1B,SAASzuB,GAAQqK,EAAYxB,GAE3B,OADWiK,GAAQzI,GAActB,GAAYmN,IACjC7L,EAAYuW,GAAY/X,EAAU,IAuBhD,SAASsnB,GAAa9lB,EAAYxB,GAEhC,OADWiK,GAAQzI,GAAcrB,GAAiBiR,IACtC5P,EAAYuW,GAAY/X,EAAU,IA0BhD,IAAIunB,GAAUzJ,IAAiB,SAAStd,EAAQlV,EAAOM,GACjDM,GAAe1B,KAAKgW,EAAQ5U,GAC9B4U,EAAO5U,GAAK0gB,KAAKhhB,GAEjB0hB,GAAgBxM,EAAQ5U,EAAK,CAACN,OAsElC,IAAIk8B,GAAYrO,IAAS,SAAS3X,EAAYjK,EAAMqI,GAClD,IAAItP,GAAS,EACToe,EAAwB,mBAARnX,EAChBiJ,EAASmW,GAAYnV,GAAcV,EAAMU,EAAWhT,QAAU,GAKlE,OAHA6e,GAAS7L,GAAY,SAASlW,GAC5BkV,IAASlQ,GAASoe,EAASjP,GAAMlI,EAAMjM,EAAOsU,GAAQ8T,GAAWpoB,EAAOiM,EAAMqI,MAEzEY,KA+BLinB,GAAQ3J,IAAiB,SAAStd,EAAQlV,EAAOM,GACnDohB,GAAgBxM,EAAQ5U,EAAKN,MA6C/B,SAASqY,GAAInC,EAAYxB,GAEvB,OADWiK,GAAQzI,GAAcX,GAAW6V,IAChClV,EAAYuW,GAAY/X,EAAU,IAkFhD,IAAI0nB,GAAY5J,IAAiB,SAAStd,EAAQlV,EAAOM,GACvD4U,EAAO5U,EAAM,EAAI,GAAG0gB,KAAKhhB,MACxB,WAAa,MAAO,CAAC,GAAI,OAmS5B,IAAIq8B,GAASxO,IAAS,SAAS3X,EAAYqW,GACzC,GAAkB,MAAdrW,EACF,MAAO,GAET,IAAIhT,EAASqpB,EAAUrpB,OAMvB,OALIA,EAAS,GAAK4vB,GAAe5c,EAAYqW,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHrpB,EAAS,GAAK4vB,GAAevG,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYpW,EAAYkQ,GAAYmG,EAAW,GAAI,OAqBxDtQ,GAAMD,IAAU,WAClB,OAAOpJ,GAAKiH,KAAKoC,OA0DnB,SAAS2Y,GAAIxgB,EAAM5T,EAAGqyB,GAGpB,OAFAryB,EAAIqyB,OAlzTJjc,EAkzTwBpW,EAEjB62B,GAAWjjB,EA9wTF,SAtChBwC,uBAmzTApW,EAAK4T,GAAa,MAAL5T,EAAa4T,EAAKlR,OAAS1C,GAqB1C,SAAS87B,GAAO97B,EAAG4T,GACjB,IAAIc,EACJ,GAAmB,mBAARd,EACT,MAAM,IAAI4F,GAAU5N,GAGtB,OADA5L,EAAIw2B,GAAUx2B,GACP,WAOL,QANMA,EAAI,IACR0U,EAASd,EAAKD,MAAM1R,KAAMgxB,YAExBjzB,GAAK,IACP4T,OAn1TJwC,GAq1TS1B,GAuCX,IAAI3U,GAAOstB,IAAS,SAASzZ,EAAMC,EAASod,GAC1C,IAAIhP,EA91Ta,EA+1TjB,GAAIgP,EAASvuB,OAAQ,CACnB,IAAIwuB,EAAUhZ,GAAe+Y,EAAUyD,GAAU30B,KACjDkiB,GA51TkB,GA81TpB,OAAO4U,GAAWjjB,EAAMqO,EAASpO,EAASod,EAAUC,MAgDlD6K,GAAU1O,IAAS,SAASptB,EAAQH,EAAKmxB,GAC3C,IAAIhP,EAAU+Z,EACd,GAAI/K,EAASvuB,OAAQ,CACnB,IAAIwuB,EAAUhZ,GAAe+Y,EAAUyD,GAAUqH,KACjD9Z,GAl5TkB,GAo5TpB,OAAO4U,GAAW/2B,EAAKmiB,EAAShiB,EAAQgxB,EAAUC,MAsJpD,SAAS+K,GAASroB,EAAM2Q,EAAM2X,GAC5B,IAAIC,EACAC,EACAC,EACA3nB,EACA4nB,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACT/J,GAAW,EAEf,GAAmB,mBAAR/e,EACT,MAAM,IAAI4F,GAAU5N,GAUtB,SAAS+wB,EAAWC,GAClB,IAAI9oB,EAAOqoB,EACPtoB,EAAUuoB,EAKd,OAHAD,EAAWC,OAzmUbhmB,EA0mUEomB,EAAiBI,EACjBloB,EAASd,EAAKD,MAAME,EAASC,GAI/B,SAAS+oB,EAAYD,GAMnB,OAJAJ,EAAiBI,EAEjBN,EAAU76B,GAAWq7B,EAAcvY,GAE5BkY,EAAUE,EAAWC,GAAQloB,EAatC,SAASqoB,EAAaH,GACpB,IAAII,EAAoBJ,EAAOL,EAM/B,YAzoUFnmB,IAyoUUmmB,GAA+BS,GAAqBzY,GACzDyY,EAAoB,GAAON,GANJE,EAAOJ,GAM8BH,EAGjE,SAASS,IACP,IAAIF,EAAOnhB,KACX,GAAIshB,EAAaH,GACf,OAAOK,EAAaL,GAGtBN,EAAU76B,GAAWq7B,EA3BvB,SAAuBF,GACrB,IAEIM,EAAc3Y,GAFMqY,EAAOL,GAI/B,OAAOG,EACHlgB,GAAU0gB,EAAab,GAJDO,EAAOJ,IAK7BU,EAoB+BC,CAAcP,IAGnD,SAASK,EAAaL,GAKpB,OAJAN,OAvpUFlmB,EA2pUMuc,GAAYwJ,EACPQ,EAAWC,IAEpBT,EAAWC,OA9pUbhmB,EA+pUS1B,GAeT,SAAS0oB,IACP,IAAIR,EAAOnhB,KACP4hB,EAAaN,EAAaH,GAM9B,GAJAT,EAAWlJ,UACXmJ,EAAWn6B,KACXs6B,EAAeK,EAEXS,EAAY,CACd,QAvrUJjnB,IAurUQkmB,EACF,OAAOO,EAAYN,GAErB,GAAIG,EAIF,OAFA33B,GAAau3B,GACbA,EAAU76B,GAAWq7B,EAAcvY,GAC5BoY,EAAWJ,GAMtB,YApsUFnmB,IAisUMkmB,IACFA,EAAU76B,GAAWq7B,EAAcvY,IAE9B7P,EAIT,OA3GA6P,EAAOyR,GAASzR,IAAS,EACrB9F,GAASyd,KACXO,IAAYP,EAAQO,QAEpBJ,GADAK,EAAS,YAAaR,GACH3f,GAAUyZ,GAASkG,EAAQG,UAAY,EAAG9X,GAAQ8X,EACrE1J,EAAW,aAAcuJ,IAAYA,EAAQvJ,SAAWA,GAoG1DyK,EAAUE,OApCV,gBAlqUAlnB,IAmqUMkmB,GACFv3B,GAAau3B,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,OAvqUvClmB,GAusUAgnB,EAAUG,MA7BV,WACE,YA3qUFnnB,IA2qUSkmB,EAAwB5nB,EAASuoB,EAAaxhB,OA6BhD2hB,EAqBT,IAAII,GAAQnQ,IAAS,SAASzZ,EAAME,GAClC,OAAOwQ,GAAU1Q,EAAM,EAAGE,MAsBxB2pB,GAAQpQ,IAAS,SAASzZ,EAAM2Q,EAAMzQ,GACxC,OAAOwQ,GAAU1Q,EAAMoiB,GAASzR,IAAS,EAAGzQ,MAqE9C,SAASslB,GAAQxlB,EAAM8pB,GACrB,GAAmB,mBAAR9pB,GAAmC,MAAZ8pB,GAAuC,mBAAZA,EAC3D,MAAM,IAAIlkB,GAAU5N,GAEtB,IAAI+xB,EAAW,WACb,IAAI7pB,EAAOmf,UACPnzB,EAAM49B,EAAWA,EAAS/pB,MAAM1R,KAAM6R,GAAQA,EAAK,GACnD+C,EAAQ8mB,EAAS9mB,MAErB,GAAIA,EAAMC,IAAIhX,GACZ,OAAO+W,EAAMzX,IAAIU,GAEnB,IAAI4U,EAASd,EAAKD,MAAM1R,KAAM6R,GAE9B,OADA6pB,EAAS9mB,MAAQA,EAAMuB,IAAItY,EAAK4U,IAAWmC,EACpCnC,GAGT,OADAipB,EAAS9mB,MAAQ,IAAKuiB,GAAQwE,OAASje,IAChCge,EA0BT,SAASE,GAAOtpB,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAIiF,GAAU5N,GAEtB,OAAO,WACL,IAAIkI,EAAOmf,UACX,OAAQnf,EAAKpR,QACX,KAAK,EAAG,OAAQ6R,EAAU7V,KAAKuD,MAC/B,KAAK,EAAG,OAAQsS,EAAU7V,KAAKuD,KAAM6R,EAAK,IAC1C,KAAK,EAAG,OAAQS,EAAU7V,KAAKuD,KAAM6R,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQS,EAAU7V,KAAKuD,KAAM6R,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQS,EAAUZ,MAAM1R,KAAM6R,IAlClCslB,GAAQwE,MAAQje,GA2FhB,IAAIme,GAAWvN,IAAS,SAAS3c,EAAMmqB,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWr7B,QAAeyb,GAAQ4f,EAAW,IACvDhpB,GAASgpB,EAAW,GAAItnB,GAAUwV,OAClClX,GAAS6Q,GAAYmY,EAAY,GAAItnB,GAAUwV,QAEtBvpB,OAC7B,OAAO2qB,IAAS,SAASvZ,GAIvB,IAHA,IAAItP,GAAS,EACT9B,EAAS8Z,GAAU1I,EAAKpR,OAAQs7B,KAE3Bx5B,EAAQ9B,GACfoR,EAAKtP,GAASu5B,EAAWv5B,GAAO9F,KAAKuD,KAAM6R,EAAKtP,IAElD,OAAOmP,GAAMC,EAAM3R,KAAM6R,SAqCzBmqB,GAAU5Q,IAAS,SAASzZ,EAAMqd,GAEpC,OAAO4F,GAAWjjB,EA17UE,QApCpBwC,EA89UsD6a,EADxC/Y,GAAe+Y,EAAUyD,GAAUuJ,SAoC/CC,GAAe7Q,IAAS,SAASzZ,EAAMqd,GAEzC,OAAO4F,GAAWjjB,EA99UQ,QArC1BwC,EAmgV4D6a,EAD9C/Y,GAAe+Y,EAAUyD,GAAUwJ,SA0B/CC,GAAQ7K,IAAS,SAAS1f,EAAMqZ,GAClC,OAAO4J,GAAWjjB,EAt/UA,SAvClBwC,gBA6hV0E6W,MAia5E,SAAShM,GAAGzhB,EAAOynB,GACjB,OAAOznB,IAAUynB,GAAUznB,GAAUA,GAASynB,GAAUA,EA0B1D,IAAImX,GAAKrI,GAA0B/O,IAyB/BqX,GAAMtI,IAA0B,SAASv2B,EAAOynB,GAClD,OAAOznB,GAASynB,KAqBd9G,GAAc2H,GAAgB,WAAa,OAAOmL,UAApB,IAAsCnL,GAAkB,SAAStoB,GACjG,OAAO0e,GAAa1e,IAAUY,GAAe1B,KAAKc,EAAO,YACtDub,GAAqBrc,KAAKc,EAAO,WA0BlC2e,GAAUnJ,EAAMmJ,QAmBhBnL,GAAgBD,GAAoB0D,GAAU1D,IA75PlD,SAA2BvT,GACzB,OAAO0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUsN,GAu7PrD,SAAS+d,GAAYrrB,GACnB,OAAgB,MAATA,GAAiBy4B,GAASz4B,EAAMkD,UAAY0jB,GAAW5mB,GA4BhE,SAASisB,GAAkBjsB,GACzB,OAAO0e,GAAa1e,IAAUqrB,GAAYrrB,GA0C5C,IAAI0c,GAAWD,IAAkBqc,GAmB7BplB,GAASD,GAAawD,GAAUxD,IAxgQpC,SAAoBzT,GAClB,OAAO0e,GAAa1e,IAAUmnB,GAAWnnB,IAAU0M,GA+qQrD,SAASoyB,GAAQ9+B,GACf,IAAK0e,GAAa1e,GAChB,OAAO,EAET,IAAIkjB,EAAMiE,GAAWnnB,GACrB,OAAOkjB,GAAOvW,GArwWF,yBAqwWcuW,GACC,iBAAjBljB,EAAMipB,SAA4C,iBAAdjpB,EAAMV,OAAqB4sB,GAAclsB,GAkDzF,SAAS4mB,GAAW5mB,GAClB,IAAKif,GAASjf,GACZ,OAAO,EAIT,IAAIkjB,EAAMiE,GAAWnnB,GACrB,OAAOkjB,GAAOtW,GAAWsW,GAAOrW,GAl0WrB,0BAk0W+BqW,GAtzW/B,kBAszWkDA,EA6B/D,SAAS6b,GAAU/+B,GACjB,MAAuB,iBAATA,GAAqBA,GAASg3B,GAAUh3B,GA6BxD,SAASy4B,GAASz4B,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAx5Wf,iBAo7WrB,SAASif,GAASjf,GAChB,IAAIgI,SAAchI,EAClB,OAAgB,MAATA,IAA0B,UAARgI,GAA4B,YAARA,GA2B/C,SAAS0W,GAAa1e,GACpB,OAAgB,MAATA,GAAiC,iBAATA,EAoBjC,IAAI4T,GAAQD,GAAYsD,GAAUtD,IA5xQlC,SAAmB3T,GACjB,OAAO0e,GAAa1e,IAAUmjB,GAAOnjB,IAAU8M,GA6+QjD,SAASkyB,GAASh/B,GAChB,MAAuB,iBAATA,GACX0e,GAAa1e,IAAUmnB,GAAWnnB,IAAU+M,EA+BjD,SAASmf,GAAclsB,GACrB,IAAK0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUgN,EAC/C,OAAO,EAET,IAAIgS,EAAQ5D,GAAapb,GACzB,GAAc,OAAVgf,EACF,OAAO,EAET,IAAI6E,EAAOjjB,GAAe1B,KAAK8f,EAAO,gBAAkBA,EAAM+D,YAC9D,MAAsB,mBAARc,GAAsBA,aAAgBA,GAClDxJ,GAAanb,KAAK2kB,IAAShJ,GAoB/B,IAAI/G,GAAWD,GAAeoD,GAAUpD,IA59QxC,SAAsB7T,GACpB,OAAO0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUiN,GA6gRrD,IAAI+G,GAAQD,GAAYkD,GAAUlD,IAngRlC,SAAmB/T,GACjB,OAAO0e,GAAa1e,IAAUmjB,GAAOnjB,IAAUkN,GAqhRjD,SAAS+xB,GAASj/B,GAChB,MAAuB,iBAATA,IACV2e,GAAQ3e,IAAU0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUmN,EAoBpE,SAAS+Y,GAASlmB,GAChB,MAAuB,iBAATA,GACX0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUoN,EAoBjD,IAAI8G,GAAeD,GAAmBgD,GAAUhD,IAvjRhD,SAA0BjU,GACxB,OAAO0e,GAAa1e,IAClBy4B,GAASz4B,EAAMkD,WAAagP,GAAeiV,GAAWnnB,KA6oR1D,IAAIk/B,GAAK3I,GAA0BpL,IAyB/BgU,GAAM5I,IAA0B,SAASv2B,EAAOynB,GAClD,OAAOznB,GAASynB,KA0BlB,SAAS2X,GAAQp/B,GACf,IAAKA,EACH,MAAO,GAET,GAAIqrB,GAAYrrB,GACd,OAAOi/B,GAASj/B,GAASiZ,GAAcjZ,GAASqhB,GAAUrhB,GAE5D,GAAI2b,IAAe3b,EAAM2b,IACvB,OAx7VN,SAAyBC,GAIvB,IAHA,IAAI3Y,EACAiS,EAAS,KAEJjS,EAAO2Y,EAASyjB,QAAQC,MAC/BpqB,EAAO8L,KAAK/d,EAAKjD,OAEnB,OAAOkV,EAi7VIqqB,CAAgBv/B,EAAM2b,OAE/B,IAAIuH,EAAMC,GAAOnjB,GAGjB,OAFWkjB,GAAOpW,EAASsL,GAAc8K,GAAOhW,EAASyL,GAAajD,IAE1D1V,GA0Bd,SAASq2B,GAASr2B,GAChB,OAAKA,GAGLA,EAAQw2B,GAASx2B,MAhiYN,KAiiYeA,KAjiYf,IAEG,uBAgiYAA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,EAoCjC,SAASg3B,GAAUh3B,GACjB,IAAIkV,EAASmhB,GAASr2B,GAClBw/B,EAAYtqB,EAAS,EAEzB,OAAOA,GAAWA,EAAUsqB,EAAYtqB,EAASsqB,EAAYtqB,EAAU,EA8BzE,SAASuqB,GAASz/B,GAChB,OAAOA,EAAQshB,GAAU0V,GAAUh3B,GAAQ,EA/lYxB,YA+lY+C,EA0BpE,SAASw2B,GAASx2B,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIkmB,GAASlmB,GACX,OAjoYI,IAmoYN,GAAIif,GAASjf,GAAQ,CACnB,IAAIynB,EAAgC,mBAAjBznB,EAAMue,QAAwBve,EAAMue,UAAYve,EACnEA,EAAQif,GAASwI,GAAUA,EAAQ,GAAMA,EAE3C,GAAoB,iBAATznB,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAMgb,QAAQ/L,EAAQ,IAC9B,IAAIywB,EAAW9vB,GAAWuI,KAAKnY,GAC/B,OAAQ0/B,GAAY5vB,GAAUqI,KAAKnY,GAC/BsS,GAAatS,EAAMkxB,MAAM,GAAIwO,EAAW,EAAI,GAC3C/vB,GAAWwI,KAAKnY,GA9oYf,KA8oY+BA,EA2BvC,SAASmsB,GAAcnsB,GACrB,OAAOiiB,GAAWjiB,EAAOyjB,GAAOzjB,IAsDlC,SAASsa,GAASta,GAChB,OAAgB,MAATA,EAAgB,GAAK6vB,GAAa7vB,GAqC3C,IAAI2/B,GAASjN,IAAe,SAASjyB,EAAQ8N,GAC3C,GAAIwc,GAAYxc,IAAW8c,GAAY9c,GACrC0T,GAAW1T,EAAQmM,GAAKnM,GAAS9N,QAGnC,IAAK,IAAIH,KAAOiO,EACV3N,GAAe1B,KAAKqP,EAAQjO,IAC9BqhB,GAAYlhB,EAAQH,EAAKiO,EAAOjO,OAoClCs/B,GAAWlN,IAAe,SAASjyB,EAAQ8N,GAC7C0T,GAAW1T,EAAQkV,GAAOlV,GAAS9N,MAgCjCo/B,GAAenN,IAAe,SAASjyB,EAAQ8N,EAAQqd,EAAUlJ,GACnET,GAAW1T,EAAQkV,GAAOlV,GAAS9N,EAAQiiB,MA+BzCod,GAAapN,IAAe,SAASjyB,EAAQ8N,EAAQqd,EAAUlJ,GACjET,GAAW1T,EAAQmM,GAAKnM,GAAS9N,EAAQiiB,MAoBvCqd,GAAKjM,GAAS5R,IA8DlB,IAAIvI,GAAWkU,IAAS,SAASptB,EAAQmyB,GACvCnyB,EAAShB,GAAOgB,GAEhB,IAAIuE,GAAS,EACT9B,EAAS0vB,EAAQ1vB,OACjB2vB,EAAQ3vB,EAAS,EAAI0vB,EAAQ,QArgZjChc,EA2gZA,IAJIic,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD3vB,EAAS,KAGF8B,EAAQ9B,GAMf,IALA,IAAIqL,EAASqkB,EAAQ5tB,GACjBmS,EAAQsM,GAAOlV,GACfyxB,GAAc,EACdC,EAAc9oB,EAAMjU,SAEf88B,EAAaC,GAAa,CACjC,IAAI3/B,EAAM6W,EAAM6oB,GACZhgC,EAAQS,EAAOH,SAnhZvBsW,IAqhZQ5W,GACCyhB,GAAGzhB,EAAOma,GAAY7Z,MAAUM,GAAe1B,KAAKuB,EAAQH,MAC/DG,EAAOH,GAAOiO,EAAOjO,IAK3B,OAAOG,KAsBLy/B,GAAerS,IAAS,SAASvZ,GAEnC,OADAA,EAAK0M,UAnjZLpK,EAmjZqBkhB,IACd3jB,GAAMgsB,QApjZbvpB,EAojZmCtC,MAgSrC,SAAS1U,GAAIa,EAAQwL,EAAM4pB,GACzB,IAAI3gB,EAAmB,MAAVzU,OAr1ZbmW,EAq1Z0CiQ,GAAQpmB,EAAQwL,GAC1D,YAt1ZA2K,IAs1ZO1B,EAAuB2gB,EAAe3gB,EA4D/C,SAASwW,GAAMjrB,EAAQwL,GACrB,OAAiB,MAAVxL,GAAkB83B,GAAQ93B,EAAQwL,EAAM0b,IAqBjD,IAAIyY,GAAS5K,IAAe,SAAStgB,EAAQlV,EAAOM,GACrC,MAATN,GACyB,mBAAlBA,EAAMsa,WACfta,EAAQ4a,GAAqB1b,KAAKc,IAGpCkV,EAAOlV,GAASM,IACfguB,GAAS3D,KA4BR0V,GAAW7K,IAAe,SAAStgB,EAAQlV,EAAOM,GACvC,MAATN,GACyB,mBAAlBA,EAAMsa,WACfta,EAAQ4a,GAAqB1b,KAAKc,IAGhCY,GAAe1B,KAAKgW,EAAQlV,GAC9BkV,EAAOlV,GAAOghB,KAAK1gB,GAEnB4U,EAAOlV,GAAS,CAACM,KAElBmsB,IAoBC6T,GAASzS,GAASzF,IA8BtB,SAAS1N,GAAKja,GACZ,OAAO4qB,GAAY5qB,GAAU8f,GAAc9f,GAAUqqB,GAASrqB,GA0BhE,SAASgjB,GAAOhjB,GACd,OAAO4qB,GAAY5qB,GAAU8f,GAAc9f,GAAQ,GAAQuqB,GAAWvqB,GAuGxE,IAAI8/B,GAAQ7N,IAAe,SAASjyB,EAAQ8N,EAAQqd,GAClDD,GAAUlrB,EAAQ8N,EAAQqd,MAkCxBuU,GAAYzN,IAAe,SAASjyB,EAAQ8N,EAAQqd,EAAUlJ,GAChEiJ,GAAUlrB,EAAQ8N,EAAQqd,EAAUlJ,MAuBlC8d,GAAO1M,IAAS,SAASrzB,EAAQ0hB,GACnC,IAAIjN,EAAS,GACb,GAAc,MAAVzU,EACF,OAAOyU,EAET,IAAI0N,GAAS,EACbT,EAAQ5M,GAAS4M,GAAO,SAASlW,GAG/B,OAFAA,EAAO6a,GAAS7a,EAAMxL,GACtBmiB,IAAWA,EAAS3W,EAAK/I,OAAS,GAC3B+I,KAETgW,GAAWxhB,EAAQkkB,GAAalkB,GAASyU,GACrC0N,IACF1N,EAASsN,GAAUtN,EAAQurB,EAAwD1I,KAGrF,IADA,IAAI70B,EAASif,EAAMjf,OACZA,KACLyqB,GAAUzY,EAAQiN,EAAMjf,IAE1B,OAAOgS,KA4CT,IAAI0E,GAAOka,IAAS,SAASrzB,EAAQ0hB,GACnC,OAAiB,MAAV1hB,EAAiB,GAnmT1B,SAAkBA,EAAQ0hB,GACxB,OAAOiL,GAAW3sB,EAAQ0hB,GAAO,SAASniB,EAAOiM,GAC/C,OAAOyf,GAAMjrB,EAAQwL,MAimTMy0B,CAASjgC,EAAQ0hB,MAqBhD,SAASwe,GAAOlgC,EAAQsU,GACtB,GAAc,MAAVtU,EACF,MAAO,GAET,IAAI0W,EAAQ5B,GAASoP,GAAalkB,IAAS,SAASmgC,GAClD,MAAO,CAACA,MAGV,OADA7rB,EAAY0X,GAAY1X,GACjBqY,GAAW3sB,EAAQ0W,GAAO,SAASnX,EAAOiM,GAC/C,OAAO8I,EAAU/U,EAAOiM,EAAK,OA4IjC,IAAI40B,GAAU1J,GAAczc,IA0BxBomB,GAAY3J,GAAc1T,IA4K9B,SAAS/N,GAAOjV,GACd,OAAiB,MAAVA,EAAiB,GAAKyW,GAAWzW,EAAQia,GAAKja,IAkNvD,IAAIsgC,GAAY3N,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GAEtD,OADAg8B,EAAOA,EAAKC,cACL/rB,GAAUlQ,EAAQk8B,GAAWF,GAAQA,MAkB9C,SAASE,GAAWhpB,GAClB,OAAOipB,GAAW7mB,GAASpC,GAAQ+oB,eAqBrC,SAAS1N,GAAOrb,GAEd,OADAA,EAASoC,GAASpC,KACDA,EAAO8C,QAAQhL,GAAS6H,IAAcmD,QAAQrJ,GAAa,IAsH9E,IAAIyvB,GAAYhO,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GACtD,OAAOkQ,GAAUlQ,EAAQ,IAAM,IAAMg8B,EAAKC,iBAuBxCI,GAAYjO,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GACtD,OAAOkQ,GAAUlQ,EAAQ,IAAM,IAAMg8B,EAAKC,iBAoBxCK,GAAatO,GAAgB,eA0NjC,IAAIuO,GAAYnO,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GACtD,OAAOkQ,GAAUlQ,EAAQ,IAAM,IAAMg8B,EAAKC,iBAgE5C,IAAIO,GAAYpO,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GACtD,OAAOkQ,GAAUlQ,EAAQ,IAAM,IAAMm8B,GAAWH,MAgiBlD,IAAIS,GAAYrO,IAAiB,SAASle,EAAQ8rB,EAAMh8B,GACtD,OAAOkQ,GAAUlQ,EAAQ,IAAM,IAAMg8B,EAAKU,iBAoBxCP,GAAanO,GAAgB,eAqBjC,SAASM,GAAMpb,EAAQypB,EAAS9O,GAI9B,OAHA3a,EAASoC,GAASpC,QA/3dlBtB,KAg4dA+qB,EAAU9O,OAh4dVjc,EAg4d8B+qB,GA9wblC,SAAwBzpB,GACtB,OAAOnG,GAAiBoG,KAAKD,GAgxblB0pB,CAAe1pB,GApjb5B,SAAsBA,GACpB,OAAOA,EAAOgB,MAAMrH,KAAkB,GAmjbFgwB,CAAa3pB,GAvpcnD,SAAoBA,GAClB,OAAOA,EAAOgB,MAAM3J,KAAgB,GAspcuBuyB,CAAW5pB,GAE7DA,EAAOgB,MAAMyoB,IAAY,GA2BlC,IAAII,GAAUlU,IAAS,SAASzZ,EAAME,GACpC,IACE,OAAOH,GAAMC,OAl6dfwC,EAk6dgCtC,GAC9B,MAAOzQ,GACP,OAAOi7B,GAAQj7B,GAAKA,EAAI,IAAIiW,GAAMjW,OA8BlCm+B,GAAUlO,IAAS,SAASrzB,EAAQwhC,GAKtC,OAJArtB,GAAUqtB,GAAa,SAAS3hC,GAC9BA,EAAMymB,GAAMzmB,GACZohB,GAAgBjhB,EAAQH,EAAKC,GAAKE,EAAOH,GAAMG,OAE1CA,KAqGT,SAAS6tB,GAAStuB,GAChB,OAAO,WACL,OAAOA,GAkDX,IAAIkiC,GAAOrO,KAuBPsO,GAAYtO,IAAW,GAkB3B,SAASlJ,GAAS3qB,GAChB,OAAOA,EA6CT,SAAS0U,GAASN,GAChB,OAAOsW,GAA4B,mBAARtW,EAAqBA,EAAOoO,GAAUpO,EAlqe/C,IAywepB,IAAIguB,GAASvU,IAAS,SAAS5hB,EAAMqI,GACnC,OAAO,SAAS7T,GACd,OAAO2nB,GAAW3nB,EAAQwL,EAAMqI,OA2BhC+tB,GAAWxU,IAAS,SAASptB,EAAQ6T,GACvC,OAAO,SAASrI,GACd,OAAOmc,GAAW3nB,EAAQwL,EAAMqI,OAwCpC,SAASguB,GAAM7hC,EAAQ8N,EAAQmuB,GAC7B,IAAIvlB,EAAQuD,GAAKnM,GACb0zB,EAActb,GAAcpY,EAAQ4I,GAEzB,MAAXulB,GACEzd,GAAS1Q,KAAY0zB,EAAY/+B,SAAWiU,EAAMjU,UACtDw5B,EAAUnuB,EACVA,EAAS9N,EACTA,EAASgC,KACTw/B,EAActb,GAAcpY,EAAQmM,GAAKnM,KAE3C,IAAIotB,IAAU1c,GAASyd,IAAY,UAAWA,IAAcA,EAAQf,OAChEvY,EAASwD,GAAWnmB,GAqBxB,OAnBAmU,GAAUqtB,GAAa,SAAShP,GAC9B,IAAI7e,EAAO7F,EAAO0kB,GAClBxyB,EAAOwyB,GAAc7e,EACjBgP,IACF3iB,EAAOE,UAAUsyB,GAAc,WAC7B,IAAI9T,EAAW1c,KAAK6c,UACpB,GAAIqc,GAASxc,EAAU,CACrB,IAAIjK,EAASzU,EAAOgC,KAAK2c,aACrBkR,EAAUpb,EAAOmK,YAAcgC,GAAU5e,KAAK4c,aAIlD,OAFAiR,EAAQtP,KAAK,CAAE,KAAQ5M,EAAM,KAAQqf,UAAW,QAAWhzB,IAC3DyU,EAAOoK,UAAYH,EACZjK,EAET,OAAOd,EAAKD,MAAM1T,EAAQgV,GAAU,CAAChT,KAAKzC,SAAUyzB,iBAKnDhzB,EAmCT,SAASy2B,MAiDT,IAAIqL,GAAOzM,GAAWvgB,IA8BlBitB,GAAY1M,GAAWhhB,IAiCvB2tB,GAAW3M,GAAWhgB,IAwB1B,SAASpV,GAASuL,GAChB,OAAOuf,GAAMvf,GAAQ+J,GAAa+Q,GAAM9a,IA12X1C,SAA0BA,GACxB,OAAO,SAASxL,GACd,OAAOomB,GAAQpmB,EAAQwL,IAw2XwBy2B,CAAiBz2B,GAuEpE,IAAI02B,GAAQxM,KAsCRyM,GAAazM,IAAY,GAoB7B,SAASmC,KACP,MAAO,GAgBT,SAASQ,KACP,OAAO,EA+JT,IAAI3sB,GAAMwpB,IAAoB,SAASkN,EAAQC,GAC7C,OAAOD,EAASC,IACf,GAuBC1mB,GAAO0a,GAAY,QAiBnBiM,GAASpN,IAAoB,SAASqN,EAAUC,GAClD,OAAOD,EAAWC,IACjB,GAuBC3mB,GAAQwa,GAAY,SAwKxB,IAgaMvoB,GAhaF20B,GAAWvN,IAAoB,SAASwN,EAAYC,GACtD,OAAOD,EAAaC,IACnB,GAuBCC,GAAQvM,GAAY,SAiBpBwM,GAAW3N,IAAoB,SAAS4N,EAASC,GACnD,OAAOD,EAAUC,IAChB,GAgmBH,OA1iBA/kB,GAAOglB,MA95MP,SAAejjC,EAAG4T,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAI4F,GAAU5N,GAGtB,OADA5L,EAAIw2B,GAAUx2B,GACP,WACL,KAAMA,EAAI,EACR,OAAO4T,EAAKD,MAAM1R,KAAMgxB,aAw5M9BhV,GAAOmW,IAAMA,GACbnW,GAAOkhB,OAASA,GAChBlhB,GAAOmhB,SAAWA,GAClBnhB,GAAOohB,aAAeA,GACtBphB,GAAOqhB,WAAaA,GACpBrhB,GAAOshB,GAAKA,GACZthB,GAAO6d,OAASA,GAChB7d,GAAOle,KAAOA,GACdke,GAAOujB,QAAUA,GACjBvjB,GAAO8d,QAAUA,GACjB9d,GAAOilB,UA57KP,WACE,IAAKjQ,UAAUvwB,OACb,MAAO,GAET,IAAIlD,EAAQyzB,UAAU,GACtB,OAAO9U,GAAQ3e,GAASA,EAAQ,CAACA,IAw7KnCye,GAAOkd,MAAQA,GACfld,GAAOklB,MA9/SP,SAAenvB,EAAO8D,EAAMua,GAExBva,GADGua,EAAQC,GAAete,EAAO8D,EAAMua,QAlsNzCjc,IAksNkD0B,GACzC,EAEAyE,GAAUia,GAAU1e,GAAO,GAEpC,IAAIpV,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,IAAKA,GAAUoV,EAAO,EACpB,MAAO,GAMT,IAJA,IAAItT,EAAQ,EACRiQ,EAAW,EACXC,EAASM,EAAM2G,GAAWjZ,EAASoV,IAEhCtT,EAAQ9B,GACbgS,EAAOD,KAAcuZ,GAAUha,EAAOxP,EAAQA,GAASsT,GAEzD,OAAOpD,GA8+STuJ,GAAOmlB,QA59SP,SAAiBpvB,GAMf,IALA,IAAIxP,GAAS,EACT9B,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACnC+R,EAAW,EACXC,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACdhF,IACFkV,EAAOD,KAAcjV,GAGzB,OAAOkV,GAi9STuJ,GAAOolB,OAx7SP,WACE,IAAI3gC,EAASuwB,UAAUvwB,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAIoR,EAAOkB,EAAMtS,EAAS,GACtBsR,EAAQif,UAAU,GAClBzuB,EAAQ9B,EAEL8B,KACLsP,EAAKtP,EAAQ,GAAKyuB,UAAUzuB,GAE9B,OAAOyQ,GAAUkJ,GAAQnK,GAAS6M,GAAU7M,GAAS,CAACA,GAAQ4R,GAAY9R,EAAM,KA66SlFmK,GAAOqlB,KA3tCP,SAAcpe,GACZ,IAAIxiB,EAAkB,MAATwiB,EAAgB,EAAIA,EAAMxiB,OACnCuyB,EAAahJ,KASjB,OAPA/G,EAASxiB,EAAcqS,GAASmQ,GAAO,SAASuR,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIjd,GAAU5N,GAEtB,MAAO,CAACqpB,EAAWwB,EAAK,IAAKA,EAAK,OAJlB,GAOXpJ,IAAS,SAASvZ,GAEvB,IADA,IAAItP,GAAS,IACJA,EAAQ9B,GAAQ,CACvB,IAAI+zB,EAAOvR,EAAM1gB,GACjB,GAAImP,GAAM8iB,EAAK,GAAIx0B,KAAM6R,GACvB,OAAOH,GAAM8iB,EAAK,GAAIx0B,KAAM6R,QA4sCpCmK,GAAOslB,SA9qCP,SAAkBx1B,GAChB,OAn5YF,SAAsBA,GACpB,IAAI4I,EAAQuD,GAAKnM,GACjB,OAAO,SAAS9N,GACd,OAAOokB,GAAepkB,EAAQ8N,EAAQ4I,IAg5YjC6sB,CAAaxhB,GAAUjU,EAhgeZ,KA8qgBpBkQ,GAAO6P,SAAWA,GAClB7P,GAAOqd,QAAUA,GACjBrd,GAAOpe,OAhuHP,SAAgBM,EAAWsjC,GACzB,IAAI/uB,EAAS6J,GAAWpe,GACxB,OAAqB,MAAdsjC,EAAqB/uB,EAAS8M,GAAW9M,EAAQ+uB,IA+tH1DxlB,GAAOylB,MAnuMP,SAASA,EAAM9vB,EAAMygB,EAAOhC,GAE1B,IAAI3d,EAASmiB,GAAWjjB,EAp8TN,OAlClBwC,8BAq+TAie,EAAQhC,OAr+TRjc,EAq+T4Bie,GAG5B,OADA3f,EAAO0C,YAAcssB,EAAMtsB,YACpB1C,GAguMTuJ,GAAO0lB,WAvrMP,SAASA,EAAW/vB,EAAMygB,EAAOhC,GAE/B,IAAI3d,EAASmiB,GAAWjjB,EAh/TA,QAnCxBwC,8BAkhUAie,EAAQhC,OAlhURjc,EAkhU4Bie,GAG5B,OADA3f,EAAO0C,YAAcusB,EAAWvsB,YACzB1C,GAorMTuJ,GAAOge,SAAWA,GAClBhe,GAAO9E,SAAWA,GAClB8E,GAAOyhB,aAAeA,GACtBzhB,GAAOuf,MAAQA,GACfvf,GAAOwf,MAAQA,GACfxf,GAAOyb,WAAaA,GACpBzb,GAAO0b,aAAeA,GACtB1b,GAAO2b,eAAiBA,GACxB3b,GAAO2lB,KAh0SP,SAAc5vB,EAAOhU,EAAGqyB,GACtB,IAAI3vB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAKA,EAIEsrB,GAAUha,GADjBhU,EAAKqyB,QAt5NLjc,IAs5NcpW,EAAmB,EAAIw2B,GAAUx2B,IACnB,EAAI,EAAIA,EAAG0C,GAH9B,IA8zSXub,GAAO4lB,UA/xSP,SAAmB7vB,EAAOhU,EAAGqyB,GAC3B,IAAI3vB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAKA,EAKEsrB,GAAUha,EAAO,GADxBhU,EAAI0C,GADJ1C,EAAKqyB,QAx7NLjc,IAw7NcpW,EAAmB,EAAIw2B,GAAUx2B,KAEhB,EAAI,EAAIA,GAJ9B,IA6xSXie,GAAO6lB,eAnvSP,SAAwB9vB,EAAOO,GAC7B,OAAQP,GAASA,EAAMtR,OACnBitB,GAAU3b,EAAOiY,GAAY1X,EAAW,IAAI,GAAM,GAClD,IAivSN0J,GAAO8lB,UA3sSP,SAAmB/vB,EAAOO,GACxB,OAAQP,GAASA,EAAMtR,OACnBitB,GAAU3b,EAAOiY,GAAY1X,EAAW,IAAI,GAC5C,IAysSN0J,GAAO+lB,KAzqSP,SAAchwB,EAAOxU,EAAO8tB,EAAOW,GACjC,IAAIvrB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAKA,GAGD4qB,GAAyB,iBAATA,GAAqBgF,GAAete,EAAOxU,EAAO8tB,KACpEA,EAAQ,EACRW,EAAMvrB,GAzvIV,SAAkBsR,EAAOxU,EAAO8tB,EAAOW,GACrC,IAAIvrB,EAASsR,EAAMtR,OAWnB,KATA4qB,EAAQkJ,GAAUlJ,IACN,IACVA,GAASA,EAAQ5qB,EAAS,EAAKA,EAAS4qB,IAE1CW,OAj0FA7X,IAi0FO6X,GAAqBA,EAAMvrB,EAAUA,EAAS8zB,GAAUvI,IACrD,IACRA,GAAOvrB,GAETurB,EAAMX,EAAQW,EAAM,EAAIgR,GAAShR,GAC1BX,EAAQW,GACbja,EAAMsZ,KAAW9tB,EAEnB,OAAOwU,EA4uIAiwB,CAASjwB,EAAOxU,EAAO8tB,EAAOW,IAN5B,IAuqSXhQ,GAAOimB,OArvOP,SAAgBxuB,EAAYnB,GAE1B,OADW4J,GAAQzI,GAAclB,GAAcmR,IACnCjQ,EAAYuW,GAAY1X,EAAW,KAovOjD0J,GAAOkmB,QAjqOP,SAAiBzuB,EAAYxB,GAC3B,OAAO0R,GAAY/N,GAAInC,EAAYxB,GAAW,IAiqOhD+J,GAAOmmB,YA1oOP,SAAqB1uB,EAAYxB,GAC/B,OAAO0R,GAAY/N,GAAInC,EAAYxB,GAvhSxB,MAiqgBb+J,GAAOomB,aAlnOP,SAAsB3uB,EAAYxB,EAAU2R,GAE1C,OADAA,OAxmSAzP,IAwmSQyP,EAAsB,EAAI2Q,GAAU3Q,GACrCD,GAAY/N,GAAInC,EAAYxB,GAAW2R,IAinOhD5H,GAAO0Z,QAAUA,GACjB1Z,GAAOqmB,YAjiSP,SAAqBtwB,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAMtR,QACvBkjB,GAAY5R,EApoOjB,KAooOoC,IAgiSjDiK,GAAOsmB,aAzgSP,SAAsBvwB,EAAO6R,GAE3B,OADsB,MAAT7R,EAAgB,EAAIA,EAAMtR,QAKhCkjB,GAAY5R,EADnB6R,OAxtOAzP,IAwtOQyP,EAAsB,EAAI2Q,GAAU3Q,IAFnC,IAugSX5H,GAAOumB,KAn9LP,SAAc5wB,GACZ,OAAOijB,GAAWjjB,EAnuUD,MAsrgBnBqK,GAAOyjB,KAAOA,GACdzjB,GAAO0jB,UAAYA,GACnB1jB,GAAOwmB,UAr/RP,SAAmBvf,GAKjB,IAJA,IAAI1gB,GAAS,EACT9B,EAAkB,MAATwiB,EAAgB,EAAIA,EAAMxiB,OACnCgS,EAAS,KAEJlQ,EAAQ9B,GAAQ,CACvB,IAAI+zB,EAAOvR,EAAM1gB,GACjBkQ,EAAO+hB,EAAK,IAAMA,EAAK,GAEzB,OAAO/hB,GA6+RTuJ,GAAOzd,UAr8GP,SAAmBP,GACjB,OAAiB,MAAVA,EAAiB,GAAKkmB,GAAclmB,EAAQia,GAAKja,KAq8G1Dge,GAAOymB,YA36GP,SAAqBzkC,GACnB,OAAiB,MAAVA,EAAiB,GAAKkmB,GAAclmB,EAAQgjB,GAAOhjB,KA26G5Dge,GAAOwd,QAAUA,GACjBxd,GAAO0mB,QAt6RP,SAAiB3wB,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMtR,QACvBsrB,GAAUha,EAAO,GAAI,GAAK,IAq6R5CiK,GAAO+b,aAAeA,GACtB/b,GAAOic,eAAiBA,GACxBjc,GAAOkc,iBAAmBA,GAC1Blc,GAAO2hB,OAASA,GAChB3hB,GAAO4hB,SAAWA,GAClB5hB,GAAOyd,UAAYA,GACnBzd,GAAO/J,SAAWA,GAClB+J,GAAO0d,MAAQA,GACf1d,GAAO/D,KAAOA,GACd+D,GAAOgF,OAASA,GAChBhF,GAAOpG,IAAMA,GACboG,GAAO2mB,QAprGP,SAAiB3kC,EAAQiU,GACvB,IAAIQ,EAAS,GAMb,OALAR,EAAW+X,GAAY/X,EAAU,GAEjCmR,GAAWplB,GAAQ,SAAST,EAAOM,EAAKG,GACtCihB,GAAgBxM,EAAQR,EAAS1U,EAAOM,EAAKG,GAAST,MAEjDkV,GA8qGTuJ,GAAO4mB,UA/oGP,SAAmB5kC,EAAQiU,GACzB,IAAIQ,EAAS,GAMb,OALAR,EAAW+X,GAAY/X,EAAU,GAEjCmR,GAAWplB,GAAQ,SAAST,EAAOM,EAAKG,GACtCihB,GAAgBxM,EAAQ5U,EAAKoU,EAAS1U,EAAOM,EAAKG,OAE7CyU,GAyoGTuJ,GAAO6mB,QAphCP,SAAiB/2B,GACf,OAAOsc,GAAYrI,GAAUjU,EAzseX,KA6tgBpBkQ,GAAO8mB,gBAh/BP,SAAyBt5B,EAAMse,GAC7B,OAAOK,GAAoB3e,EAAMuW,GAAU+H,EA9uezB,KA8tgBpB9L,GAAOmb,QAAUA,GACjBnb,GAAO8hB,MAAQA,GACf9hB,GAAO0hB,UAAYA,GACnB1hB,GAAO2jB,OAASA,GAChB3jB,GAAO4jB,SAAWA,GAClB5jB,GAAO6jB,MAAQA,GACf7jB,GAAO4f,OAASA,GAChB5f,GAAO+mB,OAzzBP,SAAgBhlC,GAEd,OADAA,EAAIw2B,GAAUx2B,GACPqtB,IAAS,SAASvZ,GACvB,OAAO+X,GAAQ/X,EAAM9T,OAuzBzBie,GAAO+hB,KAAOA,GACd/hB,GAAOgnB,OA7gGP,SAAgBhlC,EAAQsU,GACtB,OAAO4rB,GAAOlgC,EAAQ49B,GAAO5R,GAAY1X,MA6gG3C0J,GAAOinB,KAv3LP,SAActxB,GACZ,OAAOkoB,GAAO,EAAGloB,IAu3LnBqK,GAAOknB,QA/3NP,SAAiBzvB,EAAYqW,EAAWC,EAAQqG,GAC9C,OAAkB,MAAd3c,EACK,IAEJyI,GAAQ4N,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnC5N,GADL6N,EAASqG,OAv4STjc,EAu4S6B4V,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYpW,EAAYqW,EAAWC,KAq3N5C/N,GAAO8jB,KAAOA,GACd9jB,GAAO6f,SAAWA,GAClB7f,GAAO+jB,UAAYA,GACnB/jB,GAAOgkB,SAAWA,GAClBhkB,GAAOggB,QAAUA,GACjBhgB,GAAOigB,aAAeA,GACtBjgB,GAAO2d,UAAYA,GACnB3d,GAAO7E,KAAOA,GACd6E,GAAOkiB,OAASA,GAChBliB,GAAO/d,SAAWA,GAClB+d,GAAOmnB,WA/rBP,SAAoBnlC,GAClB,OAAO,SAASwL,GACd,OAAiB,MAAVxL,OA7kfTmW,EA6kfsCiQ,GAAQpmB,EAAQwL,KA8rBxDwS,GAAOmc,KAAOA,GACdnc,GAAOoc,QAAUA,GACjBpc,GAAOonB,UA9rRP,SAAmBrxB,EAAOkB,EAAQhB,GAChC,OAAQF,GAASA,EAAMtR,QAAUwS,GAAUA,EAAOxS,OAC9CoqB,GAAY9Y,EAAOkB,EAAQ+W,GAAY/X,EAAU,IACjDF,GA4rRNiK,GAAOqnB,YAlqRP,SAAqBtxB,EAAOkB,EAAQJ,GAClC,OAAQd,GAASA,EAAMtR,QAAUwS,GAAUA,EAAOxS,OAC9CoqB,GAAY9Y,EAAOkB,OA9mPvBkB,EA8mP0CtB,GACtCd,GAgqRNiK,GAAOqc,OAASA,GAChBrc,GAAOkkB,MAAQA,GACflkB,GAAOmkB,WAAaA,GACpBnkB,GAAOkgB,MAAQA,GACflgB,GAAOsnB,OAlvNP,SAAgB7vB,EAAYnB,GAE1B,OADW4J,GAAQzI,GAAclB,GAAcmR,IACnCjQ,EAAYmoB,GAAO5R,GAAY1X,EAAW,MAivNxD0J,GAAOunB,OAnmRP,SAAgBxxB,EAAOO,GACrB,IAAIG,EAAS,GACb,IAAMV,IAASA,EAAMtR,OACnB,OAAOgS,EAET,IAAIlQ,GAAS,EACTyoB,EAAU,GACVvqB,EAASsR,EAAMtR,OAGnB,IADA6R,EAAY0X,GAAY1X,EAAW,KAC1B/P,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAQwU,EAAMxP,GACd+P,EAAU/U,EAAOgF,EAAOwP,KAC1BU,EAAO8L,KAAKhhB,GACZytB,EAAQzM,KAAKhc,IAIjB,OADAwoB,GAAWhZ,EAAOiZ,GACXvY,GAklRTuJ,GAAOwnB,KA5tLP,SAAc7xB,EAAM0Z,GAClB,GAAmB,mBAAR1Z,EACT,MAAM,IAAI4F,GAAU5N,GAGtB,OAAOyhB,GAASzZ,EADhB0Z,OA7jVAlX,IA6jVQkX,EAAsBA,EAAQkJ,GAAUlJ,KAytLlDrP,GAAOnB,QAAUA,GACjBmB,GAAOynB,WA1sNP,SAAoBhwB,EAAY1V,EAAGqyB,GAOjC,OALEryB,GADGqyB,EAAQC,GAAe5c,EAAY1V,EAAGqyB,QA9kT3Cjc,IA8kToDpW,GAC9C,EAEAw2B,GAAUx2B,IAELme,GAAQzI,GAAciL,GAAkB+M,IACvChY,EAAY1V,IAosN1Bie,GAAO7F,IAj6FP,SAAanY,EAAQwL,EAAMjM,GACzB,OAAiB,MAAVS,EAAiBA,EAAS4sB,GAAQ5sB,EAAQwL,EAAMjM,IAi6FzDye,GAAO0nB,QAt4FP,SAAiB1lC,EAAQwL,EAAMjM,EAAO0iB,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,OAp5a/C9L,EAq5aiB,MAAVnW,EAAiBA,EAAS4sB,GAAQ5sB,EAAQwL,EAAMjM,EAAO0iB,IAq4FhEjE,GAAO2nB,QAprNP,SAAiBlwB,GAEf,OADWyI,GAAQzI,GAAcqL,GAAegN,IACpCrY,IAmrNduI,GAAOyS,MA1iRP,SAAe1c,EAAOsZ,EAAOW,GAC3B,IAAIvrB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAKA,GAGDurB,GAAqB,iBAAPA,GAAmBqE,GAAete,EAAOsZ,EAAOW,IAChEX,EAAQ,EACRW,EAAMvrB,IAGN4qB,EAAiB,MAATA,EAAgB,EAAIkJ,GAAUlJ,GACtCW,OA5vPF7X,IA4vPQ6X,EAAoBvrB,EAAS8zB,GAAUvI,IAExCD,GAAUha,EAAOsZ,EAAOW,IAVtB,IAwiRXhQ,GAAO4d,OAASA,GAChB5d,GAAO4nB,WAl3QP,SAAoB7xB,GAClB,OAAQA,GAASA,EAAMtR,OACnBysB,GAAenb,GACf,IAg3QNiK,GAAO6nB,aA71QP,SAAsB9xB,EAAOE,GAC3B,OAAQF,GAASA,EAAMtR,OACnBysB,GAAenb,EAAOiY,GAAY/X,EAAU,IAC5C,IA21QN+J,GAAOrF,MAthEP,SAAelB,EAAQquB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB1T,GAAe5a,EAAQquB,EAAWC,KACzED,EAAYC,OA3wcd5vB,IA6wcA4vB,OA7wcA5vB,IA6wcQ4vB,EA/scW,WA+sc8BA,IAAU,IAI3DtuB,EAASoC,GAASpC,MAEQ,iBAAbquB,GACO,MAAbA,IAAsBzyB,GAASyyB,OAEpCA,EAAY1W,GAAa0W,KACPtuB,GAAWC,GACpB8Y,GAAU/X,GAAcf,GAAS,EAAGsuB,GAGxCtuB,EAAOkB,MAAMmtB,EAAWC,GAZtB,IAihEX/nB,GAAOgoB,OA7rLP,SAAgBryB,EAAM0Z,GACpB,GAAmB,mBAAR1Z,EACT,MAAM,IAAI4F,GAAU5N,GAGtB,OADA0hB,EAAiB,MAATA,EAAgB,EAAI/Q,GAAUia,GAAUlJ,GAAQ,GACjDD,IAAS,SAASvZ,GACvB,IAAIE,EAAQF,EAAKwZ,GACbiL,EAAY/H,GAAU1c,EAAM,EAAGwZ,GAKnC,OAHItZ,GACFiB,GAAUsjB,EAAWvkB,GAEhBL,GAAMC,EAAM3R,KAAMs2B,OAkrL7Bta,GAAOioB,KA50QP,SAAclyB,GACZ,IAAItR,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAOA,EAASsrB,GAAUha,EAAO,EAAGtR,GAAU,IA20QhDub,GAAOkoB,KA/yQP,SAAcnyB,EAAOhU,EAAGqyB,GACtB,OAAMre,GAASA,EAAMtR,OAIdsrB,GAAUha,EAAO,GADxBhU,EAAKqyB,QAv/PLjc,IAu/PcpW,EAAmB,EAAIw2B,GAAUx2B,IAChB,EAAI,EAAIA,GAH9B,IA8yQXie,GAAOmoB,UA/wQP,SAAmBpyB,EAAOhU,EAAGqyB,GAC3B,IAAI3vB,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,OAAKA,EAKEsrB,GAAUha,GADjBhU,EAAI0C,GADJ1C,EAAKqyB,QAzhQLjc,IAyhQcpW,EAAmB,EAAIw2B,GAAUx2B,KAEnB,EAAI,EAAIA,EAAG0C,GAJ9B,IA6wQXub,GAAOooB,eAnuQP,SAAwBryB,EAAOO,GAC7B,OAAQP,GAASA,EAAMtR,OACnBitB,GAAU3b,EAAOiY,GAAY1X,EAAW,IAAI,GAAO,GACnD,IAiuQN0J,GAAOqoB,UA3rQP,SAAmBtyB,EAAOO,GACxB,OAAQP,GAASA,EAAMtR,OACnBitB,GAAU3b,EAAOiY,GAAY1X,EAAW,IACxC,IAyrQN0J,GAAOsoB,IA9tPP,SAAa/mC,EAAO47B,GAElB,OADAA,EAAY57B,GACLA,GA6tPTye,GAAOuoB,SAxoLP,SAAkB5yB,EAAM2Q,EAAM2X,GAC5B,IAAIO,GAAU,EACV9J,GAAW,EAEf,GAAmB,mBAAR/e,EACT,MAAM,IAAI4F,GAAU5N,GAMtB,OAJI6S,GAASyd,KACXO,EAAU,YAAaP,IAAYA,EAAQO,QAAUA,EACrD9J,EAAW,aAAcuJ,IAAYA,EAAQvJ,SAAWA,GAEnDsJ,GAASroB,EAAM2Q,EAAM,CAC1B,QAAWkY,EACX,QAAWlY,EACX,SAAYoO,KA2nLhB1U,GAAOwV,KAAOA,GACdxV,GAAO2gB,QAAUA,GACjB3gB,GAAOoiB,QAAUA,GACjBpiB,GAAOqiB,UAAYA,GACnBriB,GAAOwoB,OArfP,SAAgBjnC,GACd,OAAI2e,GAAQ3e,GACHuV,GAASvV,EAAO+mB,IAElBb,GAASlmB,GAAS,CAACA,GAASqhB,GAAUyP,GAAaxW,GAASta,MAkfrEye,GAAO0N,cAAgBA,GACvB1N,GAAOjG,UAp0FP,SAAmB/X,EAAQiU,EAAUC,GACnC,IAAI8L,EAAQ9B,GAAQle,GAChBymC,EAAYzmB,GAAS/D,GAASjc,IAAWyT,GAAazT,GAG1D,GADAiU,EAAW+X,GAAY/X,EAAU,GACd,MAAfC,EAAqB,CACvB,IAAIkP,EAAOpjB,GAAUA,EAAOsiB,YAE1BpO,EADEuyB,EACYzmB,EAAQ,IAAIoD,EAAO,GAE1B5E,GAASxe,IACFmmB,GAAW/C,GAAQ9E,GAAW3D,GAAa3a,IAG3C,GAMlB,OAHCymC,EAAYtyB,GAAYiR,IAAYplB,GAAQ,SAAST,EAAOgF,EAAOvE,GAClE,OAAOiU,EAASC,EAAa3U,EAAOgF,EAAOvE,MAEtCkU,GAizFT8J,GAAO0oB,MA/mLP,SAAe/yB,GACb,OAAOwgB,GAAIxgB,EAAM,IA+mLnBqK,GAAOsc,MAAQA,GACftc,GAAOuc,QAAUA,GACjBvc,GAAOwc,UAAYA,GACnBxc,GAAO2oB,KAnmQP,SAAc5yB,GACZ,OAAQA,GAASA,EAAMtR,OAAU4sB,GAAStb,GAAS,IAmmQrDiK,GAAO4oB,OAzkQP,SAAgB7yB,EAAOE,GACrB,OAAQF,GAASA,EAAMtR,OAAU4sB,GAAStb,EAAOiY,GAAY/X,EAAU,IAAM,IAykQ/E+J,GAAO6oB,SAljQP,SAAkB9yB,EAAOc,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,OApwQ/CsB,EAqwQQpC,GAASA,EAAMtR,OAAU4sB,GAAStb,OArwQ1CoC,EAqwQ4DtB,GAAc,IAijQ5EmJ,GAAO8oB,MA1xFP,SAAe9mC,EAAQwL,GACrB,OAAiB,MAAVxL,GAAwBktB,GAAUltB,EAAQwL,IA0xFnDwS,GAAOyc,MAAQA,GACfzc,GAAO2c,UAAYA,GACnB3c,GAAO9W,OA9vFP,SAAgBlH,EAAQwL,EAAMikB,GAC5B,OAAiB,MAAVzvB,EAAiBA,EAASwvB,GAAWxvB,EAAQwL,EAAM4kB,GAAaX,KA8vFzEzR,GAAO+oB,WAnuFP,SAAoB/mC,EAAQwL,EAAMikB,EAASxN,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,OAxlb/C9L,EAylbiB,MAAVnW,EAAiBA,EAASwvB,GAAWxvB,EAAQwL,EAAM4kB,GAAaX,GAAUxN,IAkuFnFjE,GAAO/I,OAASA,GAChB+I,GAAOgpB,SA1qFP,SAAkBhnC,GAChB,OAAiB,MAAVA,EAAiB,GAAKyW,GAAWzW,EAAQgjB,GAAOhjB,KA0qFzDge,GAAO4c,QAAUA,GACjB5c,GAAO6U,MAAQA,GACf7U,GAAOipB,KArmLP,SAAc1nC,EAAOk0B,GACnB,OAAOuK,GAAQ5N,GAAaqD,GAAUl0B,IAqmLxCye,GAAO6c,IAAMA,GACb7c,GAAO8c,MAAQA,GACf9c,GAAO+c,QAAUA,GACjB/c,GAAOgd,IAAMA,GACbhd,GAAOkpB,UA32PP,SAAmBxwB,EAAOzB,GACxB,OAAO+a,GAActZ,GAAS,GAAIzB,GAAU,GAAIiM,KA22PlDlD,GAAOmpB,cAz1PP,SAAuBzwB,EAAOzB,GAC5B,OAAO+a,GAActZ,GAAS,GAAIzB,GAAU,GAAI2X,KAy1PlD5O,GAAOid,QAAUA,GAGjBjd,GAAOsB,QAAU8gB,GACjBpiB,GAAOopB,UAAY/G,GACnBriB,GAAOqpB,OAASlI,GAChBnhB,GAAOspB,WAAalI,GAGpByC,GAAM7jB,GAAQA,IAKdA,GAAOtS,IAAMA,GACbsS,GAAOsjB,QAAUA,GACjBtjB,GAAOsiB,UAAYA,GACnBtiB,GAAOyiB,WAAaA,GACpBziB,GAAOrC,KAAOA,GACdqC,GAAOupB,MA9qFP,SAAe3lB,EAAQC,EAAOC,GAa5B,YAxrbA3L,IA4qbI2L,IACFA,EAAQD,EACRA,OA9qbF1L,YAgrbI2L,IAEFA,GADAA,EAAQiU,GAASjU,KACCA,EAAQA,EAAQ,QAlrbpC3L,IAorbI0L,IAEFA,GADAA,EAAQkU,GAASlU,KACCA,EAAQA,EAAQ,GAE7BhB,GAAUkV,GAASnU,GAASC,EAAOC,IAkqF5C9D,GAAOwb,MAvjLP,SAAej6B,GACb,OAAOwiB,GAAUxiB,EA5wVI,IAm0gBvBye,GAAOwpB,UA9/KP,SAAmBjoC,GACjB,OAAOwiB,GAAUxiB,EAAOygC,IA8/K1BhiB,GAAOypB,cA/9KP,SAAuBloC,EAAO0iB,GAE5B,OAAOF,GAAUxiB,EAAOygC,EADxB/d,EAAkC,mBAAdA,EAA2BA,OA93V/C9L,IA61gBF6H,GAAO0pB,UAvhLP,SAAmBnoC,EAAO0iB,GAExB,OAAOF,GAAUxiB,EAhzVI,EA+yVrB0iB,EAAkC,mBAAdA,EAA2BA,OAv0V/C9L,IA81gBF6H,GAAO2pB,WAp8KP,SAAoB3nC,EAAQ8N,GAC1B,OAAiB,MAAVA,GAAkBsW,GAAepkB,EAAQ8N,EAAQmM,GAAKnM,KAo8K/DkQ,GAAO8U,OAASA,GAChB9U,GAAO4pB,UA1xCP,SAAmBroC,EAAO61B,GACxB,OAAiB,MAAT71B,GAAiBA,GAAUA,EAAS61B,EAAe71B,GA0xC7Dye,GAAOskB,OAASA,GAChBtkB,GAAO6pB,SAn9EP,SAAkBpwB,EAAQqwB,EAAQC,GAChCtwB,EAASoC,GAASpC,GAClBqwB,EAAS1Y,GAAa0Y,GAEtB,IAAIrlC,EAASgV,EAAOhV,OAKhBurB,EAJJ+Z,OAp5bA5xB,IAo5bW4xB,EACPtlC,EACAoe,GAAU0V,GAAUwR,GAAW,EAAGtlC,GAItC,OADAslC,GAAYD,EAAOrlC,SACA,GAAKgV,EAAOgZ,MAAMsX,EAAU/Z,IAAQ8Z,GAy8EzD9pB,GAAOgD,GAAKA,GACZhD,GAAOgqB,OA36EP,SAAgBvwB,GAEd,OADAA,EAASoC,GAASpC,KACA1J,EAAmB2J,KAAKD,GACtCA,EAAO8C,QAAQ5M,EAAiB0J,IAChCI,GAw6ENuG,GAAOiqB,aAt5EP,SAAsBxwB,GAEpB,OADAA,EAASoC,GAASpC,KACAlJ,EAAgBmJ,KAAKD,GACnCA,EAAO8C,QAAQjM,EAAc,QAC7BmJ,GAm5ENuG,GAAOkqB,MAt7OP,SAAezyB,EAAYnB,EAAW8d,GACpC,IAAIze,EAAOuK,GAAQzI,GAAcpB,GAAakR,GAI9C,OAHI6M,GAASC,GAAe5c,EAAYnB,EAAW8d,KACjD9d,OAn7RF6B,GAq7ROxC,EAAK8B,EAAYuW,GAAY1X,EAAW,KAk7OjD0J,GAAOpX,KAAOA,GACdoX,GAAO4b,UAAYA,GACnB5b,GAAOmqB,QA/wHP,SAAiBnoC,EAAQsU,GACvB,OAAOkB,GAAYxV,EAAQgsB,GAAY1X,EAAW,GAAI8Q,KA+wHxDpH,GAAOsd,SAAWA,GAClBtd,GAAO6b,cAAgBA,GACvB7b,GAAOoqB,YA3uHP,SAAqBpoC,EAAQsU,GAC3B,OAAOkB,GAAYxV,EAAQgsB,GAAY1X,EAAW,GAAIgR,KA2uHxDtH,GAAOnC,MAAQA,GACfmC,GAAO5S,QAAUA,GACjB4S,GAAOud,aAAeA,GACtBvd,GAAOqqB,MA/sHP,SAAeroC,EAAQiU,GACrB,OAAiB,MAAVjU,EACHA,EACA+lB,GAAQ/lB,EAAQgsB,GAAY/X,EAAU,GAAI+O,KA6sHhDhF,GAAOsqB,WAhrHP,SAAoBtoC,EAAQiU,GAC1B,OAAiB,MAAVjU,EACHA,EACAimB,GAAajmB,EAAQgsB,GAAY/X,EAAU,GAAI+O,KA8qHrDhF,GAAOuqB,OA/oHP,SAAgBvoC,EAAQiU,GACtB,OAAOjU,GAAUolB,GAAWplB,EAAQgsB,GAAY/X,EAAU,KA+oH5D+J,GAAOwqB,YAlnHP,SAAqBxoC,EAAQiU,GAC3B,OAAOjU,GAAUslB,GAAgBtlB,EAAQgsB,GAAY/X,EAAU,KAknHjE+J,GAAO7e,IAAMA,GACb6e,GAAOmgB,GAAKA,GACZngB,GAAOogB,IAAMA,GACbpgB,GAAOnH,IAngHP,SAAa7W,EAAQwL,GACnB,OAAiB,MAAVxL,GAAkB83B,GAAQ93B,EAAQwL,EAAMyb,KAmgHjDjJ,GAAOiN,MAAQA,GACfjN,GAAO8b,KAAOA,GACd9b,GAAOkM,SAAWA,GAClBlM,GAAOwG,SAtpOP,SAAkB/O,EAAYlW,EAAOqW,EAAWwc,GAC9C3c,EAAamV,GAAYnV,GAAcA,EAAaR,GAAOQ,GAC3DG,EAAaA,IAAcwc,EAASmE,GAAU3gB,GAAa,EAE3D,IAAInT,EAASgT,EAAWhT,OAIxB,OAHImT,EAAY,IACdA,EAAY0G,GAAU7Z,EAASmT,EAAW,IAErC4oB,GAAS/oB,GACXG,GAAanT,GAAUgT,EAAWqX,QAAQvtB,EAAOqW,IAAc,IAC7DnT,GAAUkS,GAAYc,EAAYlW,EAAOqW,IAAc,GA6oOhEoI,GAAO8O,QAxlSP,SAAiB/Y,EAAOxU,EAAOqW,GAC7B,IAAInT,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI8B,EAAqB,MAAbqR,EAAoB,EAAI2gB,GAAU3gB,GAI9C,OAHIrR,EAAQ,IACVA,EAAQ+X,GAAU7Z,EAAS8B,EAAO,IAE7BoQ,GAAYZ,EAAOxU,EAAOgF,IAglSnCyZ,GAAOyqB,QA5pFP,SAAiB7mB,EAAQyL,EAAOW,GAS9B,OARAX,EAAQuI,GAASvI,QAlubjBlX,IAmubI6X,GACFA,EAAMX,EACNA,EAAQ,GAERW,EAAM4H,GAAS5H,GArsVnB,SAAqBpM,EAAQyL,EAAOW,GAClC,OAAOpM,GAAUrF,GAAU8Q,EAAOW,IAAQpM,EAAStF,GAAU+Q,EAAOW,GAusV7D0a,CADP9mB,EAASmU,GAASnU,GACSyL,EAAOW,IAopFpChQ,GAAO6hB,OAASA,GAChB7hB,GAAOkC,YAAcA,GACrBlC,GAAOE,QAAUA,GACjBF,GAAOjL,cAAgBA,GACvBiL,GAAO4M,YAAcA,GACrB5M,GAAOwN,kBAAoBA,GAC3BxN,GAAO2qB,UAhwKP,SAAmBppC,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtB0e,GAAa1e,IAAUmnB,GAAWnnB,IAAUyM,GA+vKjDgS,GAAO/B,SAAWA,GAClB+B,GAAO/K,OAASA,GAChB+K,GAAO4qB,UAvsKP,SAAmBrpC,GACjB,OAAO0e,GAAa1e,IAA6B,IAAnBA,EAAM+S,WAAmBmZ,GAAclsB,IAusKvEye,GAAO6qB,QAnqKP,SAAiBtpC,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIqrB,GAAYrrB,KACX2e,GAAQ3e,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMwb,QAC1DkB,GAAS1c,IAAUkU,GAAalU,IAAU2gB,GAAY3gB,IAC1D,OAAQA,EAAMkD,OAEhB,IAAIggB,EAAMC,GAAOnjB,GACjB,GAAIkjB,GAAOpW,GAAUoW,GAAOhW,EAC1B,OAAQlN,EAAMsY,KAEhB,GAAIyS,GAAY/qB,GACd,OAAQ8qB,GAAS9qB,GAAOkD,OAE1B,IAAK,IAAI5C,KAAON,EACd,GAAIY,GAAe1B,KAAKc,EAAOM,GAC7B,OAAO,EAGX,OAAO,GA+oKTme,GAAO8qB,QAhnKP,SAAiBvpC,EAAOynB,GACtB,OAAOc,GAAYvoB,EAAOynB,IAgnK5BhJ,GAAO+qB,YA7kKP,SAAqBxpC,EAAOynB,EAAO/E,GAEjC,IAAIxN,GADJwN,EAAkC,mBAAdA,EAA2BA,OA9zW/C9L,GA+zW0B8L,EAAW1iB,EAAOynB,QA/zW5C7Q,EAg0WA,YAh0WAA,IAg0WO1B,EAAuBqT,GAAYvoB,EAAOynB,OAh0WjD7Q,EAg0WmE8L,KAAgBxN,GA2kKrFuJ,GAAOqgB,QAAUA,GACjBrgB,GAAO7B,SAphKP,SAAkB5c,GAChB,MAAuB,iBAATA,GAAqB2c,GAAe3c,IAohKpDye,GAAOmI,WAAaA,GACpBnI,GAAOsgB,UAAYA,GACnBtgB,GAAOga,SAAWA,GAClBha,GAAO7K,MAAQA,GACf6K,GAAOgrB,QAp1JP,SAAiBhpC,EAAQ8N,GACvB,OAAO9N,IAAW8N,GAAU6b,GAAY3pB,EAAQ8N,EAAQ+c,GAAa/c,KAo1JvEkQ,GAAOirB,YAjzJP,SAAqBjpC,EAAQ8N,EAAQmU,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,OAlmX/C9L,EAmmXOwT,GAAY3pB,EAAQ8N,EAAQ+c,GAAa/c,GAASmU,IAgzJ3DjE,GAAOkrB,MAjxJP,SAAe3pC,GAIb,OAAOg/B,GAASh/B,IAAUA,IAAUA,GA8wJtCye,GAAOmrB,SAjvJP,SAAkB5pC,GAChB,GAAI64B,GAAW74B,GACb,MAAM,IAAI8Z,GA5pXM,mEA8pXlB,OAAO2Q,GAAazqB,IA8uJtBye,GAAOorB,MAlsJP,SAAe7pC,GACb,OAAgB,MAATA,GAksJTye,GAAOqrB,OA3tJP,SAAgB9pC,GACd,OAAiB,OAAVA,GA2tJTye,GAAOugB,SAAWA,GAClBvgB,GAAOQ,SAAWA,GAClBR,GAAOC,aAAeA,GACtBD,GAAOyN,cAAgBA,GACvBzN,GAAO3K,SAAWA,GAClB2K,GAAOsrB,cA/kJP,SAAuB/pC,GACrB,OAAO++B,GAAU/+B,IAAUA,IArxXR,kBAqxXsCA,GArxXtC,kBAo2gBrBye,GAAOzK,MAAQA,GACfyK,GAAOwgB,SAAWA,GAClBxgB,GAAOyH,SAAWA,GAClBzH,GAAOvK,aAAeA,GACtBuK,GAAOurB,YA7+IP,SAAqBhqC,GACnB,YAr7XA4W,IAq7XO5W,GA6+ITye,GAAOwrB,UAz9IP,SAAmBjqC,GACjB,OAAO0e,GAAa1e,IAAUmjB,GAAOnjB,IAAUqN,GAy9IjDoR,GAAOyrB,UAr8IP,SAAmBlqC,GACjB,OAAO0e,GAAa1e,IA13XP,oBA03XiBmnB,GAAWnnB,IAq8I3Cye,GAAOlN,KAn/RP,SAAciD,EAAO+xB,GACnB,OAAgB,MAAT/xB,EAAgB,GAAKqI,GAAW3d,KAAKsV,EAAO+xB,IAm/RrD9nB,GAAO2iB,UAAYA,GACnB3iB,GAAO4J,KAAOA,GACd5J,GAAO0rB,YA18RP,SAAqB31B,EAAOxU,EAAOqW,GACjC,IAAInT,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI8B,EAAQ9B,EAKZ,YAv+OA0T,IAm+OIP,IAEFrR,GADAA,EAAQgyB,GAAU3gB,IACF,EAAI0G,GAAU7Z,EAAS8B,EAAO,GAAKgY,GAAUhY,EAAO9B,EAAS,IAExElD,GAAUA,EAtuMrB,SAA2BwU,EAAOxU,EAAOqW,GAEvC,IADA,IAAIrR,EAAQqR,EAAY,EACjBrR,KACL,GAAIwP,EAAMxP,KAAWhF,EACnB,OAAOgF,EAGX,OAAOA,EAguMDolC,CAAkB51B,EAAOxU,EAAOgF,GAChCoR,GAAc5B,EAAOgC,GAAWxR,GAAO,IA+7R7CyZ,GAAO4iB,UAAYA,GACnB5iB,GAAO6iB,WAAaA,GACpB7iB,GAAOygB,GAAKA,GACZzgB,GAAO0gB,IAAMA,GACb1gB,GAAOxU,IAhfP,SAAauK,GACX,OAAQA,GAASA,EAAMtR,OACnB+iB,GAAazR,EAAOmW,GAAUnD,SA97flC5Q,GA66gBF6H,GAAO4rB,MApdP,SAAe71B,EAAOE,GACpB,OAAQF,GAASA,EAAMtR,OACnB+iB,GAAazR,EAAOiY,GAAY/X,EAAU,GAAI8S,SA39flD5Q,GA86gBF6H,GAAO6rB,KAjcP,SAAc91B,GACZ,OAAOkC,GAASlC,EAAOmW,KAiczBlM,GAAO8rB,OAvaP,SAAgB/1B,EAAOE,GACrB,OAAOgC,GAASlC,EAAOiY,GAAY/X,EAAU,KAua/C+J,GAAOzU,IAlZP,SAAawK,GACX,OAAQA,GAASA,EAAMtR,OACnB+iB,GAAazR,EAAOmW,GAAUQ,SAhigBlCvU,GAi7gBF6H,GAAO+rB,MAtXP,SAAeh2B,EAAOE,GACpB,OAAQF,GAASA,EAAMtR,OACnB+iB,GAAazR,EAAOiY,GAAY/X,EAAU,GAAIyW,SA7jgBlDvU,GAk7gBF6H,GAAO6Z,UAAYA,GACnB7Z,GAAOqa,UAAYA,GACnBra,GAAOgsB,WAztBP,WACE,MAAO,IAytBThsB,GAAOisB,WAzsBP,WACE,MAAO,IAysBTjsB,GAAOksB,SAzrBP,WACE,OAAO,GAyrBTlsB,GAAOykB,SAAWA,GAClBzkB,GAAOmsB,IAv7RP,SAAap2B,EAAOhU,GAClB,OAAQgU,GAASA,EAAMtR,OAAUmpB,GAAQ7X,EAAOwiB,GAAUx2B,SAlgP1DoW,GAy7gBF6H,GAAOosB,WAliCP,WAIE,OAHIj4B,GAAK2G,IAAM9W,OACbmQ,GAAK2G,EAAIuB,IAEJrY,MA+hCTgc,GAAOyY,KAAOA,GACdzY,GAAOxC,IAAMA,GACbwC,GAAOqsB,IA34EP,SAAa5yB,EAAQhV,EAAQ+yB,GAC3B/d,EAASoC,GAASpC,GAGlB,IAAI6yB,GAFJ7nC,EAAS8zB,GAAU9zB,IAEM4V,GAAWZ,GAAU,EAC9C,IAAKhV,GAAU6nC,GAAa7nC,EAC1B,OAAOgV,EAET,IAAI8W,GAAO9rB,EAAS6nC,GAAa,EACjC,OACE/U,GAAc3Z,GAAY2S,GAAMiH,GAChC/d,EACA8d,GAAc7Z,GAAW6S,GAAMiH,IAg4EnCxX,GAAOusB,OAr2EP,SAAgB9yB,EAAQhV,EAAQ+yB,GAC9B/d,EAASoC,GAASpC,GAGlB,IAAI6yB,GAFJ7nC,EAAS8zB,GAAU9zB,IAEM4V,GAAWZ,GAAU,EAC9C,OAAQhV,GAAU6nC,EAAY7nC,EACzBgV,EAAS8d,GAAc9yB,EAAS6nC,EAAW9U,GAC5C/d,GA+1ENuG,GAAOwsB,SAr0EP,SAAkB/yB,EAAQhV,EAAQ+yB,GAChC/d,EAASoC,GAASpC,GAGlB,IAAI6yB,GAFJ7nC,EAAS8zB,GAAU9zB,IAEM4V,GAAWZ,GAAU,EAC9C,OAAQhV,GAAU6nC,EAAY7nC,EACzB8yB,GAAc9yB,EAAS6nC,EAAW9U,GAAS/d,EAC5CA,GA+zENuG,GAAOlM,SApyEP,SAAkB2F,EAAQgzB,EAAOrY,GAM/B,OALIA,GAAkB,MAATqY,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJhuB,GAAe5C,GAASpC,GAAQ8C,QAAQ9L,EAAa,IAAKg8B,GAAS,IA+xE5EzsB,GAAOrB,OAprFP,SAAgBkF,EAAOC,EAAO4oB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBrY,GAAexQ,EAAOC,EAAO4oB,KAC3E5oB,EAAQ4oB,OA9wbVv0B,YAgxbIu0B,IACkB,kBAAT5oB,GACT4oB,EAAW5oB,EACXA,OAnxbJ3L,GAqxb2B,kBAAT0L,IACd6oB,EAAW7oB,EACXA,OAvxbJ1L,aA0xbI0L,QA1xbJ1L,IA0xb2B2L,GACzBD,EAAQ,EACRC,EAAQ,IAGRD,EAAQ+T,GAAS/T,QA/xbnB1L,IAgybM2L,GACFA,EAAQD,EACRA,EAAQ,GAERC,EAAQ8T,GAAS9T,IAGjBD,EAAQC,EAAO,CACjB,IAAI6oB,EAAO9oB,EACXA,EAAQC,EACRA,EAAQ6oB,EAEV,GAAID,GAAY7oB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIoX,EAAOxc,KACX,OAAOH,GAAUsF,EAASqX,GAAQpX,EAAQD,EAAQjQ,GAAe,QAAUsnB,EAAO,IAAIz2B,OAAS,KAAOqf,GAExG,OAAOrB,GAAWoB,EAAOC,IAipF3B9D,GAAO4sB,OAt+NP,SAAgBn1B,EAAYxB,EAAUC,GACpC,IAAIP,EAAOuK,GAAQzI,GAAcP,GAAcmB,GAC3ClB,EAAY6d,UAAUvwB,OAAS,EAEnC,OAAOkR,EAAK8B,EAAYuW,GAAY/X,EAAU,GAAIC,EAAaiB,EAAWmM,KAm+N5EtD,GAAO6sB,YA18NP,SAAqBp1B,EAAYxB,EAAUC,GACzC,IAAIP,EAAOuK,GAAQzI,GAAcL,GAAmBiB,GAChDlB,EAAY6d,UAAUvwB,OAAS,EAEnC,OAAOkR,EAAK8B,EAAYuW,GAAY/X,EAAU,GAAIC,EAAaiB,EAAWkQ,KAu8N5ErH,GAAO8sB,OAzwEP,SAAgBrzB,EAAQ1X,EAAGqyB,GAMzB,OAJEryB,GADGqyB,EAAQC,GAAe5a,EAAQ1X,EAAGqyB,QA3rcvCjc,IA2rcgDpW,GAC1C,EAEAw2B,GAAUx2B,GAETotB,GAAWtT,GAASpC,GAAS1X,IAowEtCie,GAAOzD,QA9uEP,WACE,IAAI1G,EAAOmf,UACPvb,EAASoC,GAAShG,EAAK,IAE3B,OAAOA,EAAKpR,OAAS,EAAIgV,EAASA,EAAO8C,QAAQ1G,EAAK,GAAIA,EAAK,KA2uEjEmK,GAAOvJ,OAhoGP,SAAgBzU,EAAQwL,EAAM4pB,GAG5B,IAAI7wB,GAAS,EACT9B,GAHJ+I,EAAO6a,GAAS7a,EAAMxL,IAGJyC,OAOlB,IAJKA,IACHA,EAAS,EACTzC,OA90aFmW,KAg1aS5R,EAAQ9B,GAAQ,CACvB,IAAIlD,EAAkB,MAAVS,OAj1admW,EAi1a2CnW,EAAOsmB,GAAM9a,EAAKjH,UAj1a7D4R,IAk1aM5W,IACFgF,EAAQ9B,EACRlD,EAAQ61B,GAEVp1B,EAASmmB,GAAW5mB,GAASA,EAAMd,KAAKuB,GAAUT,EAEpD,OAAOS,GA8mGTge,GAAO4kB,MAAQA,GACf5kB,GAAOjF,aAAeA,EACtBiF,GAAO+sB,OAp5NP,SAAgBt1B,GAEd,OADWyI,GAAQzI,GAAc+K,GAAcgN,IACnC/X,IAm5NduI,GAAOnG,KAz0NP,SAAcpC,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAImV,GAAYnV,GACd,OAAO+oB,GAAS/oB,GAAc4C,GAAW5C,GAAcA,EAAWhT,OAEpE,IAAIggB,EAAMC,GAAOjN,GACjB,OAAIgN,GAAOpW,GAAUoW,GAAOhW,EACnBgJ,EAAWoC,KAEbwS,GAAS5U,GAAYhT,QA+zN9Bub,GAAO8iB,UAAYA,GACnB9iB,GAAOgtB,KAzxNP,SAAcv1B,EAAYnB,EAAW8d,GACnC,IAAIze,EAAOuK,GAAQzI,GAAcJ,GAAY4Y,GAI7C,OAHImE,GAASC,GAAe5c,EAAYnB,EAAW8d,KACjD9d,OArrTF6B,GAurTOxC,EAAK8B,EAAYuW,GAAY1X,EAAW,KAqxNjD0J,GAAOitB,YA1rRP,SAAqBl3B,EAAOxU,GAC1B,OAAO2uB,GAAgBna,EAAOxU,IA0rRhCye,GAAOktB,cA9pRP,SAAuBn3B,EAAOxU,EAAO0U,GACnC,OAAOua,GAAkBza,EAAOxU,EAAOysB,GAAY/X,EAAU,KA8pR/D+J,GAAOmtB,cA3oRP,SAAuBp3B,EAAOxU,GAC5B,IAAIkD,EAAkB,MAATsR,EAAgB,EAAIA,EAAMtR,OACvC,GAAIA,EAAQ,CACV,IAAI8B,EAAQ2pB,GAAgBna,EAAOxU,GACnC,GAAIgF,EAAQ9B,GAAUue,GAAGjN,EAAMxP,GAAQhF,GACrC,OAAOgF,EAGX,OAAQ,GAooRVyZ,GAAOotB,gBA/mRP,SAAyBr3B,EAAOxU,GAC9B,OAAO2uB,GAAgBna,EAAOxU,GAAO,IA+mRvCye,GAAOqtB,kBAnlRP,SAA2Bt3B,EAAOxU,EAAO0U,GACvC,OAAOua,GAAkBza,EAAOxU,EAAOysB,GAAY/X,EAAU,IAAI,IAmlRnE+J,GAAOstB,kBAhkRP,SAA2Bv3B,EAAOxU,GAEhC,GADsB,MAATwU,EAAgB,EAAIA,EAAMtR,OAC3B,CACV,IAAI8B,EAAQ2pB,GAAgBna,EAAOxU,GAAO,GAAQ,EAClD,GAAIyhB,GAAGjN,EAAMxP,GAAQhF,GACnB,OAAOgF,EAGX,OAAQ,GAyjRVyZ,GAAO+iB,UAAYA,GACnB/iB,GAAOutB,WAroEP,SAAoB9zB,EAAQqwB,EAAQC,GAOlC,OANAtwB,EAASoC,GAASpC,GAClBswB,EAAuB,MAAZA,EACP,EACAlnB,GAAU0V,GAAUwR,GAAW,EAAGtwB,EAAOhV,QAE7CqlC,EAAS1Y,GAAa0Y,GACfrwB,EAAOgZ,MAAMsX,EAAUA,EAAWD,EAAOrlC,SAAWqlC,GA+nE7D9pB,GAAO6kB,SAAWA,GAClB7kB,GAAOwtB,IAzUP,SAAaz3B,GACX,OAAQA,GAASA,EAAMtR,OACnByT,GAAQnC,EAAOmW,IACf,GAuUNlM,GAAOytB,MA7SP,SAAe13B,EAAOE,GACpB,OAAQF,GAASA,EAAMtR,OACnByT,GAAQnC,EAAOiY,GAAY/X,EAAU,IACrC,GA2SN+J,GAAO0tB,SAvhEP,SAAkBj0B,EAAQwkB,EAAS7J,GAIjC,IAAI3rB,EAAWuX,GAAO8G,iBAElBsN,GAASC,GAAe5a,EAAQwkB,EAAS7J,KAC3C6J,OAv8cF9lB,GAy8cAsB,EAASoC,GAASpC,GAClBwkB,EAAUmD,GAAa,GAAInD,EAASx1B,EAAU2wB,IAE9C,IAIIuU,EACAC,EALAC,EAAUzM,GAAa,GAAInD,EAAQ4P,QAASplC,EAASolC,QAASzU,IAC9D0U,EAAc7xB,GAAK4xB,GACnBE,EAAgBt1B,GAAWo1B,EAASC,GAIpCvnC,EAAQ,EACRynC,EAAc/P,EAAQ+P,aAAex8B,GACrC1B,EAAS,WAGTm+B,EAAep+B,IAChBouB,EAAQ+L,QAAUx4B,IAAW1B,OAAS,IACvCk+B,EAAYl+B,OAAS,KACpBk+B,IAAgB99B,EAAgBc,GAAeQ,IAAW1B,OAAS,KACnEmuB,EAAQiQ,UAAY18B,IAAW1B,OAAS,KACzC,KAMEq+B,EAAY,kBACbhsC,GAAe1B,KAAKw9B,EAAS,cACzBA,EAAQkQ,UAAY,IAAI5xB,QAAQ,MAAO,KACvC,6BAA+B/I,GAAmB,KACnD,KAENiG,EAAO8C,QAAQ0xB,GAAc,SAASxzB,EAAO2zB,EAAaC,EAAkBC,EAAiBC,EAAe7qC,GAsB1G,OArBA2qC,IAAqBA,EAAmBC,GAGxCx+B,GAAU2J,EAAOgZ,MAAMlsB,EAAO7C,GAAQ6Y,QAAQ9K,GAAmB6H,IAG7D80B,IACFT,GAAa,EACb79B,GAAU,YAAcs+B,EAAc,UAEpCG,IACFX,GAAe,EACf99B,GAAU,OAASy+B,EAAgB,eAEjCF,IACFv+B,GAAU,iBAAmBu+B,EAAmB,+BAElD9nC,EAAQ7C,EAAS+W,EAAMhW,OAIhBgW,KAGT3K,GAAU,OAIV,IAAI0+B,EAAWrsC,GAAe1B,KAAKw9B,EAAS,aAAeA,EAAQuQ,SAC9DA,IACH1+B,EAAS,iBAAmBA,EAAS,SAGvCA,GAAU89B,EAAe99B,EAAOyM,QAAQhN,EAAsB,IAAMO,GACjEyM,QAAQ/M,EAAqB,MAC7B+M,QAAQ9M,EAAuB,OAGlCK,EAAS,aAAe0+B,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCb,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJ99B,EACA,gBAEF,IAAI2G,EAAS6sB,IAAQ,WACnB,OAAOlvB,GAAS05B,EAAaK,EAAY,UAAYr+B,GAClD4F,WAnidLyC,EAmidsB41B,MAMtB,GADAt3B,EAAO3G,OAASA,EACZuwB,GAAQ5pB,GACV,MAAMA,EAER,OAAOA,GA46DTuJ,GAAOyuB,MApsBP,SAAe1sC,EAAGkU,GAEhB,IADAlU,EAAIw2B,GAAUx2B,IACN,GAAKA,EA7tfM,iBA8tfjB,MAAO,GAET,IAAIwE,EA3tfe,WA4tff9B,EAAS8Z,GAAUxc,EA5tfJ,YA+tfnBA,GA/tfmB,WAkufnB,IADA,IAAI0U,EAAS8B,GAAU9T,EAHvBwR,EAAW+X,GAAY/X,MAId1P,EAAQxE,GACfkU,EAAS1P,GAEX,OAAOkQ,GAsrBTuJ,GAAO4X,SAAWA,GAClB5X,GAAOuY,UAAYA,GACnBvY,GAAOghB,SAAWA,GAClBhhB,GAAO0uB,QAx5DP,SAAiBntC,GACf,OAAOsa,GAASta,GAAOihC,eAw5DzBxiB,GAAO+X,SAAWA,GAClB/X,GAAO2uB,cA9tIP,SAAuBptC,GACrB,OAAOA,EACHshB,GAAU0V,GAAUh3B,IAzsYL,mCA0sYJ,IAAVA,EAAcA,EAAQ,GA4tI7Bye,GAAOnE,SAAWA,GAClBmE,GAAO4uB,QAn4DP,SAAiBrtC,GACf,OAAOsa,GAASta,GAAO0hC,eAm4DzBjjB,GAAO6uB,KA12DP,SAAcp1B,EAAQ+d,EAAOpD,GAE3B,IADA3a,EAASoC,GAASpC,MACH2a,QAzndfjc,IAyndwBqf,GACtB,OAAO/d,EAAO8C,QAAQ/L,EAAQ,IAEhC,IAAKiJ,KAAY+d,EAAQpG,GAAaoG,IACpC,OAAO/d,EAET,IAAIV,EAAayB,GAAcf,GAC3BT,EAAawB,GAAcgd,GAI/B,OAAOjF,GAAUxZ,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETlG,KAAK,KA81DhDkN,GAAO8uB,QAx0DP,SAAiBr1B,EAAQ+d,EAAOpD,GAE9B,IADA3a,EAASoC,GAASpC,MACH2a,QA5pdfjc,IA4pdwBqf,GACtB,OAAO/d,EAAO8C,QAAQ7L,EAAW,IAEnC,IAAK+I,KAAY+d,EAAQpG,GAAaoG,IACpC,OAAO/d,EAET,IAAIV,EAAayB,GAAcf,GAG/B,OAAO8Y,GAAUxZ,EAAY,EAFnBE,GAAcF,EAAYyB,GAAcgd,IAAU,GAEvB1kB,KAAK,KA8zD5CkN,GAAO+uB,UAxyDP,SAAmBt1B,EAAQ+d,EAAOpD,GAEhC,IADA3a,EAASoC,GAASpC,MACH2a,QA7rdfjc,IA6rdwBqf,GACtB,OAAO/d,EAAO8C,QAAQ9L,EAAa,IAErC,IAAKgJ,KAAY+d,EAAQpG,GAAaoG,IACpC,OAAO/d,EAET,IAAIV,EAAayB,GAAcf,GAG/B,OAAO8Y,GAAUxZ,EAFLD,GAAgBC,EAAYyB,GAAcgd,KAElB1kB,KAAK,KA8xD3CkN,GAAOgvB,SAtvDP,SAAkBv1B,EAAQwkB,GACxB,IAAIx5B,EApsdmB,GAqsdnBwqC,EApsdqB,MAssdzB,GAAIzuB,GAASyd,GAAU,CACrB,IAAI6J,EAAY,cAAe7J,EAAUA,EAAQ6J,UAAYA,EAC7DrjC,EAAS,WAAYw5B,EAAU1F,GAAU0F,EAAQx5B,QAAUA,EAC3DwqC,EAAW,aAAchR,EAAU7M,GAAa6M,EAAQgR,UAAYA,EAItE,IAAI3C,GAFJ7yB,EAASoC,GAASpC,IAEKhV,OACvB,GAAI+U,GAAWC,GAAS,CACtB,IAAIV,EAAayB,GAAcf,GAC/B6yB,EAAYvzB,EAAWtU,OAEzB,GAAIA,GAAU6nC,EACZ,OAAO7yB,EAET,IAAIuW,EAAMvrB,EAAS4V,GAAW40B,GAC9B,GAAIjf,EAAM,EACR,OAAOif,EAET,IAAIx4B,EAASsC,EACTwZ,GAAUxZ,EAAY,EAAGiX,GAAKld,KAAK,IACnC2G,EAAOgZ,MAAM,EAAGzC,GAEpB,QAzwdA7X,IAywdI2vB,EACF,OAAOrxB,EAASw4B,EAKlB,GAHIl2B,IACFiX,GAAQvZ,EAAOhS,OAASurB,GAEtB3a,GAASyyB,IACX,GAAIruB,EAAOgZ,MAAMzC,GAAKkf,OAAOpH,GAAY,CACvC,IAAIrtB,EACA00B,EAAY14B,EAMhB,IAJKqxB,EAAU9zB,SACb8zB,EAAYj4B,GAAOi4B,EAAUh4B,OAAQ+L,GAAS5K,GAAQ+K,KAAK8rB,IAAc,MAE3EA,EAAUxtB,UAAY,EACdG,EAAQqtB,EAAU9rB,KAAKmzB,IAC7B,IAAIC,EAAS30B,EAAMlU,MAErBkQ,EAASA,EAAOgc,MAAM,OA3xd1Bta,IA2xd6Bi3B,EAAuBpf,EAAMof,SAEnD,GAAI31B,EAAOqV,QAAQsC,GAAa0W,GAAY9X,IAAQA,EAAK,CAC9D,IAAIzpB,EAAQkQ,EAAOi1B,YAAY5D,GAC3BvhC,GAAS,IACXkQ,EAASA,EAAOgc,MAAM,EAAGlsB,IAG7B,OAAOkQ,EAASw4B,GAksDlBjvB,GAAOqvB,SA5qDP,SAAkB51B,GAEhB,OADAA,EAASoC,GAASpC,KACA7J,EAAiB8J,KAAKD,GACpCA,EAAO8C,QAAQ7M,EAAemL,IAC9BpB,GAyqDNuG,GAAOsvB,SAvpBP,SAAkBC,GAChB,IAAI/c,IAAO1W,GACX,OAAOD,GAAS0zB,GAAU/c,GAspB5BxS,GAAOgjB,UAAYA,GACnBhjB,GAAO0iB,WAAaA,GAGpB1iB,GAAOpc,KAAOwJ,GACd4S,GAAOwvB,UAAYjS,GACnBvd,GAAOyvB,MAAQ3T,GAEf+H,GAAM7jB,IACAlQ,GAAS,GACbsX,GAAWpH,IAAQ,SAASrK,EAAM6e,GAC3BryB,GAAe1B,KAAKuf,GAAO9d,UAAWsyB,KACzC1kB,GAAO0kB,GAAc7e,MAGlB7F,IACH,CAAE,OAAS,IAWjBkQ,GAAO0vB,QA//gBK,UAkghBZv5B,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASqe,GACxFxU,GAAOwU,GAAYrb,YAAc6G,MAInC7J,GAAU,CAAC,OAAQ,SAAS,SAASqe,EAAYjuB,GAC/C4Z,GAAYje,UAAUsyB,GAAc,SAASzyB,GAC3CA,OA5ghBFoW,IA4ghBMpW,EAAkB,EAAIuc,GAAUia,GAAUx2B,GAAI,GAElD,IAAI0U,EAAUzS,KAAKid,eAAiB1a,EAChC,IAAI4Z,GAAYnc,MAChBA,KAAKw3B,QAUT,OARI/kB,EAAOwK,aACTxK,EAAO0K,cAAgB5C,GAAUxc,EAAG0U,EAAO0K,eAE3C1K,EAAO2K,UAAUmB,KAAK,CACpB,KAAQhE,GAAUxc,EAx9gBL,YAy9gBb,KAAQyyB,GAAc/d,EAAOuK,QAAU,EAAI,QAAU,MAGlDvK,GAGT0J,GAAYje,UAAUsyB,EAAa,SAAW,SAASzyB,GACrD,OAAOiC,KAAK6a,UAAU2V,GAAYzyB,GAAG8c,cAKzC1I,GAAU,CAAC,SAAU,MAAO,cAAc,SAASqe,EAAYjuB,GAC7D,IAAIgD,EAAOhD,EAAQ,EACfopC,EAl/gBe,GAk/gBJpmC,GAh/gBG,GAg/gByBA,EAE3C4W,GAAYje,UAAUsyB,GAAc,SAASve,GAC3C,IAAIQ,EAASzS,KAAKw3B,QAMlB,OALA/kB,EAAOyK,cAAcqB,KAAK,CACxB,SAAYyL,GAAY/X,EAAU,GAClC,KAAQ1M,IAEVkN,EAAOwK,aAAexK,EAAOwK,cAAgB0uB,EACtCl5B,MAKXN,GAAU,CAAC,OAAQ,SAAS,SAASqe,EAAYjuB,GAC/C,IAAIqpC,EAAW,QAAUrpC,EAAQ,QAAU,IAE3C4Z,GAAYje,UAAUsyB,GAAc,WAClC,OAAOxwB,KAAK4rC,GAAU,GAAGruC,QAAQ,OAKrC4U,GAAU,CAAC,UAAW,SAAS,SAASqe,EAAYjuB,GAClD,IAAIspC,EAAW,QAAUtpC,EAAQ,GAAK,SAEtC4Z,GAAYje,UAAUsyB,GAAc,WAClC,OAAOxwB,KAAKid,aAAe,IAAId,GAAYnc,MAAQA,KAAK6rC,GAAU,OAItE1vB,GAAYje,UAAUijC,QAAU,WAC9B,OAAOnhC,KAAKiiC,OAAO/Z,KAGrB/L,GAAYje,UAAU0G,KAAO,SAAS0N,GACpC,OAAOtS,KAAKiiC,OAAO3vB,GAAWwlB,QAGhC3b,GAAYje,UAAUo7B,SAAW,SAAShnB,GACxC,OAAOtS,KAAK6a,UAAUjW,KAAK0N,IAG7B6J,GAAYje,UAAUu7B,UAAYrO,IAAS,SAAS5hB,EAAMqI,GACxD,MAAmB,mBAARrI,EACF,IAAI2S,GAAYnc,MAElBA,KAAK4V,KAAI,SAASrY,GACvB,OAAOooB,GAAWpoB,EAAOiM,EAAMqI,SAInCsK,GAAYje,UAAUolC,OAAS,SAAShxB,GACtC,OAAOtS,KAAKiiC,OAAOrG,GAAO5R,GAAY1X,MAGxC6J,GAAYje,UAAUuwB,MAAQ,SAASpD,EAAOW,GAC5CX,EAAQkJ,GAAUlJ,GAElB,IAAI5Y,EAASzS,KACb,OAAIyS,EAAOwK,eAAiBoO,EAAQ,GAAKW,EAAM,GACtC,IAAI7P,GAAY1J,IAErB4Y,EAAQ,EACV5Y,EAASA,EAAO0xB,WAAW9Y,GAClBA,IACT5Y,EAASA,EAAOkvB,KAAKtW,SAvmhBvBlX,IAymhBI6X,IAEFvZ,GADAuZ,EAAMuI,GAAUvI,IACD,EAAIvZ,EAAOmvB,WAAW5V,GAAOvZ,EAAOyxB,KAAKlY,EAAMX,IAEzD5Y,IAGT0J,GAAYje,UAAUkmC,eAAiB,SAAS9xB,GAC9C,OAAOtS,KAAK6a,UAAUwpB,UAAU/xB,GAAWuI,WAG7CsB,GAAYje,UAAUy+B,QAAU,WAC9B,OAAO38B,KAAKkkC,KAvjhBO,aA2jhBrB9gB,GAAWjH,GAAYje,WAAW,SAASyT,EAAM6e,GAC/C,IAAIsb,EAAgB,qCAAqCp2B,KAAK8a,GAC1Dub,EAAU,kBAAkBr2B,KAAK8a,GACjCwb,EAAahwB,GAAO+vB,EAAW,QAAwB,QAAdvb,EAAuB,QAAU,IAAOA,GACjFyb,EAAeF,GAAW,QAAQr2B,KAAK8a,GAEtCwb,IAGLhwB,GAAO9d,UAAUsyB,GAAc,WAC7B,IAAIjzB,EAAQyC,KAAK2c,YACb9K,EAAOk6B,EAAU,CAAC,GAAK/a,UACvBkb,EAAS3uC,aAAiB4e,GAC1BlK,EAAWJ,EAAK,GAChBs6B,EAAUD,GAAUhwB,GAAQ3e,GAE5B47B,EAAc,SAAS57B,GACzB,IAAIkV,EAASu5B,EAAWt6B,MAAMsK,GAAQhJ,GAAU,CAACzV,GAAQsU,IACzD,OAAQk6B,GAAWrvB,EAAYjK,EAAO,GAAKA,GAGzC05B,GAAWL,GAAoC,mBAAZ75B,GAA6C,GAAnBA,EAASxR,SAExEyrC,EAASC,GAAU,GAErB,IAAIzvB,EAAW1c,KAAK6c,UAChBuvB,IAAapsC,KAAK4c,YAAYnc,OAC9B4rC,EAAcJ,IAAiBvvB,EAC/B4vB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B5uC,EAAQ+uC,EAAW/uC,EAAQ,IAAI4e,GAAYnc,MAC3C,IAAIyS,EAASd,EAAKD,MAAMnU,EAAOsU,GAE/B,OADAY,EAAOmK,YAAY2B,KAAK,CAAE,KAAQiT,GAAM,KAAQ,CAAC2H,GAAc,aA1phBnEhlB,IA2phBW,IAAIiI,GAAc3J,EAAQiK,GAEnC,OAAI2vB,GAAeC,EACV36B,EAAKD,MAAM1R,KAAM6R,IAE1BY,EAASzS,KAAKwxB,KAAK2H,GACZkT,EAAeN,EAAUt5B,EAAOlV,QAAQ,GAAKkV,EAAOlV,QAAWkV,QAK1EN,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASqe,GACxE,IAAI7e,EAAO6F,GAAWgZ,GAClB+b,EAAY,0BAA0B72B,KAAK8a,GAAc,MAAQ,OACjEyb,EAAe,kBAAkBv2B,KAAK8a,GAE1CxU,GAAO9d,UAAUsyB,GAAc,WAC7B,IAAI3e,EAAOmf,UACX,GAAIib,IAAiBjsC,KAAK6c,UAAW,CACnC,IAAItf,EAAQyC,KAAKzC,QACjB,OAAOoU,EAAKD,MAAMwK,GAAQ3e,GAASA,EAAQ,GAAIsU,GAEjD,OAAO7R,KAAKusC,IAAW,SAAShvC,GAC9B,OAAOoU,EAAKD,MAAMwK,GAAQ3e,GAASA,EAAQ,GAAIsU,UAMrDuR,GAAWjH,GAAYje,WAAW,SAASyT,EAAM6e,GAC/C,IAAIwb,EAAahwB,GAAOwU,GACxB,GAAIwb,EAAY,CACd,IAAInuC,EAAMmuC,EAAWnvC,KAAO,GACvBsB,GAAe1B,KAAK4e,GAAWxd,KAClCwd,GAAUxd,GAAO,IAEnBwd,GAAUxd,GAAK0gB,KAAK,CAAE,KAAQiS,EAAY,KAAQwb,QAItD3wB,GAAU0W,QAnshBR5d,EAgCqB,GAmqhB+BtX,MAAQ,CAAC,CAC7D,KAAQ,UACR,UArshBAsX,IAyshBFgI,GAAYje,UAAUs5B,MA18dtB,WACE,IAAI/kB,EAAS,IAAI0J,GAAYnc,KAAK2c,aAOlC,OANAlK,EAAOmK,YAAcgC,GAAU5e,KAAK4c,aACpCnK,EAAOuK,QAAUhd,KAAKgd,QACtBvK,EAAOwK,aAAejd,KAAKid,aAC3BxK,EAAOyK,cAAgB0B,GAAU5e,KAAKkd,eACtCzK,EAAO0K,cAAgBnd,KAAKmd,cAC5B1K,EAAO2K,UAAYwB,GAAU5e,KAAKod,WAC3B3K,GAm8dT0J,GAAYje,UAAU2c,QAx7dtB,WACE,GAAI7a,KAAKid,aAAc,CACrB,IAAIxK,EAAS,IAAI0J,GAAYnc,MAC7ByS,EAAOuK,SAAW,EAClBvK,EAAOwK,cAAe,OAEtBxK,EAASzS,KAAKw3B,SACPxa,UAAY,EAErB,OAAOvK,GAg7dT0J,GAAYje,UAAUX,MAr6dtB,WACE,IAAIwU,EAAQ/R,KAAK2c,YAAYpf,QACzBivC,EAAMxsC,KAAKgd,QACXgB,EAAQ9B,GAAQnK,GAChB06B,EAAUD,EAAM,EAChBjX,EAAYvX,EAAQjM,EAAMtR,OAAS,EACnCisC,EA8pIN,SAAiBrhB,EAAOW,EAAK8P,GAC3B,IAAIv5B,GAAS,EACT9B,EAASq7B,EAAWr7B,OAExB,OAAS8B,EAAQ9B,GAAQ,CACvB,IAAID,EAAOs7B,EAAWv5B,GAClBsT,EAAOrV,EAAKqV,KAEhB,OAAQrV,EAAK+E,MACX,IAAK,OAAa8lB,GAASxV,EAAM,MACjC,IAAK,YAAamW,GAAOnW,EAAM,MAC/B,IAAK,OAAamW,EAAMzR,GAAUyR,EAAKX,EAAQxV,GAAO,MACtD,IAAK,YAAawV,EAAQ/Q,GAAU+Q,EAAOW,EAAMnW,IAGrD,MAAO,CAAE,MAASwV,EAAO,IAAOW,GA7qIrB2gB,CAAQ,EAAGpX,EAAWv1B,KAAKod,WAClCiO,EAAQqhB,EAAKrhB,MACbW,EAAM0gB,EAAK1gB,IACXvrB,EAASurB,EAAMX,EACf9oB,EAAQkqC,EAAUzgB,EAAOX,EAAQ,EACjCvB,EAAY9pB,KAAKkd,cACjB0vB,EAAa9iB,EAAUrpB,OACvB+R,EAAW,EACXq6B,EAAYtyB,GAAU9Z,EAAQT,KAAKmd,eAEvC,IAAKa,IAAWyuB,GAAWlX,GAAa90B,GAAUosC,GAAapsC,EAC7D,OAAOmtB,GAAiB7b,EAAO/R,KAAK4c,aAEtC,IAAInK,EAAS,GAEbkQ,EACA,KAAOliB,KAAY+R,EAAWq6B,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbvvC,EAAQwU,EAHZxP,GAASiqC,KAKAM,EAAYF,GAAY,CAC/B,IAAIpsC,EAAOspB,EAAUgjB,GACjB76B,EAAWzR,EAAKyR,SAChB1M,EAAO/E,EAAK+E,KACZqd,EAAW3Q,EAAS1U,GAExB,GApxDY,GAoxDRgI,EACFhI,EAAQqlB,OACH,IAAKA,EAAU,CACpB,GAxxDa,GAwxDTrd,EACF,SAASod,EAET,MAAMA,GAIZlQ,EAAOD,KAAcjV,EAEvB,OAAOkV,GA03dTuJ,GAAO9d,UAAUo/B,GAAKlE,GACtBpd,GAAO9d,UAAUg7B,MApiQjB,WACE,OAAOA,GAAMl5B,OAoiQfgc,GAAO9d,UAAU6uC,OAvgQjB,WACE,OAAO,IAAI3wB,GAAcpc,KAAKzC,QAASyC,KAAK6c,YAugQ9Cb,GAAO9d,UAAU0+B,KA9+PjB,gBAnuREzoB,IAouRInU,KAAK+c,aACP/c,KAAK+c,WAAa4f,GAAQ38B,KAAKzC,UAEjC,IAAIs/B,EAAO78B,KAAK8c,WAAa9c,KAAK+c,WAAWtc,OAG7C,MAAO,CAAE,KAAQo8B,EAAM,MAFXA,OAxuRZ1oB,EAwuR+BnU,KAAK+c,WAAW/c,KAAK8c,eA0+PtDd,GAAO9d,UAAU4zB,MAv7PjB,SAAsBv0B,GAIpB,IAHA,IAAIkV,EACApQ,EAASrC,KAENqC,aAAkBoa,IAAY,CACnC,IAAI+a,EAAQnb,GAAaha,GACzBm1B,EAAM1a,UAAY,EAClB0a,EAAMza,gBAlyRR5I,EAmyRM1B,EACFwY,EAAStO,YAAc6a,EAEvB/kB,EAAS+kB,EAEX,IAAIvM,EAAWuM,EACfn1B,EAASA,EAAOsa,YAGlB,OADAsO,EAAStO,YAAcpf,EAChBkV,GAu6PTuJ,GAAO9d,UAAU2c,QAh5PjB,WACE,IAAItd,EAAQyC,KAAK2c,YACjB,GAAIpf,aAAiB4e,GAAa,CAChC,IAAI6wB,EAAUzvC,EAUd,OATIyC,KAAK4c,YAAYnc,SACnBusC,EAAU,IAAI7wB,GAAYnc,QAE5BgtC,EAAUA,EAAQnyB,WACV+B,YAAY2B,KAAK,CACvB,KAAQiT,GACR,KAAQ,CAAC3W,IACT,aA90RJ1G,IAg1RS,IAAIiI,GAAc4wB,EAAShtC,KAAK6c,WAEzC,OAAO7c,KAAKwxB,KAAK3W,KAk4PnBmB,GAAO9d,UAAU+uC,OAASjxB,GAAO9d,UAAU4d,QAAUE,GAAO9d,UAAUX,MAj3PtE,WACE,OAAOqwB,GAAiB5tB,KAAK2c,YAAa3c,KAAK4c,cAm3PjDZ,GAAO9d,UAAUutC,MAAQzvB,GAAO9d,UAAU45B,KAEtC5e,KACF8C,GAAO9d,UAAUgb,IA39PnB,WACE,OAAOlZ,OA49PFgc,GAMDjF,GAQN5G,GAAK2G,EAAIA,QA1uhBP3C,KA8uhBF,aACE,OAAO2C,IACR,gCAaHra,KAAKuD,Q,0DCtwhBPhB,GAAE,WACE,IAEIgF,EAFAU,EAAkB,GAClBwoC,EAAeluC,EAAE,cAAcwC,QAcnC,SAASmE,EAAcL,GACfZ,EAAgBjE,QAChBiE,EAAgB0E,SAAQ,SAAUC,GAC9BA,EAAexG,aAIvB,IAAIsqC,EAAS,GACT1uC,EAAS,GAEb0uC,EAAO,GAAK7nC,EAAM8nC,KAAK,GAAGD,OAAO,GACjCA,EAAO,GAAK7nC,EAAM8nC,KAAK,GAAGD,OAAO,GACjC,IAAIE,EAAY/nC,EAAM8nC,KAAK,GAAGD,OAAO,GAErC1uC,EAAO,GAAiB,KAAZ4uC,EAAwC,EACpD5uC,EAAO,GAAiB,KAAZ4uC,EAAyC,EAErD3oC,EAAgB,GAAKY,EAAMiE,SAASpK,OAAOguC,EAAO,GAAIA,EAAO,GAAI1uC,EAAO,IAAI2D,KAAK,CAC7E2/B,KAAoB,cACpBt4B,OAAoB,2BACpB,eAAoB,EACpB,mBAAoB,OACpB6jC,OAAoB,IACrB5jC,MAEHhF,EAAgB,GAAKY,EAAMiE,SAASpK,OAAOguC,EAAO,GAAIA,EAAO,GAAI1uC,EAAO,IAAI2D,KAAK,CAC7E2/B,KAAoB,cACpBt4B,OAAoB,2BACpB,eAAoB,EACpB,mBAAoB,OACpB6jC,OAAoB,IACrB5jC,MAzCP1K,EAAEgC,QAAQX,GAAG,UAAU,WACnByC,aAAakB,GACbA,EAAkBxE,YAAW,WACzB0tC,EAAeluC,EAAE,iCAAiCwC,QAC/CR,OAAM,QAAYoE,WACjBpE,OAAM,QAAYoE,QAAQ8nC,EAAcA,KAE7C,QAqCP,IAAI9lC,EAAS,CAAC,CACVvK,KAAM,YACN2D,KAAM,CAAC,CACHgG,MAAa,UACb/H,OAAa,OACb8uC,YAAa,MACbrlC,EAAG,QAER,CACCrL,KAAM,kBACN2D,KAAM,CAAC,CACHgG,MAAa,UACb/H,OAAa,MACb8uC,YAAa,MACbrlC,EAAG,SAGXlH,OAAM,QAAc,KA6EpB,IAAIf,YAAYC,MAAM,CAClBR,OAAQ,EACRS,eAAgB,eAEhBC,YAAa,KAEhBC,GAAG,SAAS,SAASe,GAClB,IAAI8rC,EAAeluC,EAAE,cAAcwC,QACnCR,OAAM,QAAcqE,WAAWC,MAAM,YAAa,CAC9CA,MAAa,CACTC,KAAiB,aACjBC,gBAAiB,cACjBgoC,UAAiB,EACjBvsC,OAAiBisC,EACjBO,OAAiB,EACjB7lC,QAAiB,EACjB8lC,OAAiB,EACjBjoC,OAAiB,CACbC,KAAQ,WACJC,EAAc3F,OAElB4F,OAAQ,WACJD,EAAc3F,SAI1B8F,SAAa,EACbC,OAAa,EACbqnC,KAAa,CACTO,WAAY,IACZC,SAAY,EACZhmC,QAAY,EACZpG,MAAY0rC,EACZjsC,OAAYisC,EACZC,OAAY,CAAC,MAAO,OACpBt3B,KAAY,OACZg4B,WAAY,CACRroC,gBAAiB,cACjBsoC,YAAiB,IAIzB3lC,YACI,CACI4lC,WAAY,CACRvoC,gBAAqB,cACrB4C,WAAqB,CACjBV,SAAS,GAEbsmC,qBAAqB,EACrBC,gBAAqB,EACrBzlC,OAAqB,CACjBC,MAAO,CACHf,SAAS,IAGjBwmC,UAAqB,CACjBxrC,SAAU,OAGlB0E,OAAY,CACR4mC,qBAAqB,EACrBxlC,OAAqB,CACjBC,MAAO,CACHf,SAAS,MAK7BR,QAAa,CACTQ,SAAS,GAEbzC,MAAa,CACTsC,IAAe,EACfC,IAAe,IACff,UAAe,EACf0nC,cAAe,IAEnB/mC,OAAaA,OAKpBxG,MAAMtC,EAAQ,a,8DCrOnB,IAiDe8vC,EAjDG,SAAEC,GAAsB,IAAlBpU,EAAkB,uDAAR,GAAQ,EAOlCA,EAJAnM,cAHkC,MAGzB,QAHyB,IAOlCmM,EAHAv3B,gBAJkC,MAIvB,IAJuB,IAOlCu3B,EAFAuB,aALkC,MAK1B,GAL0B,IAOlCvB,EADAqU,YANkC,WAM3Bn6B,EAN2B,EAUtC,GAAgB,SAAX2Z,GAQL,GAHAygB,EAAaF,GAGN,QAAQ34B,KAAM24B,EAAGG,WAAxB,CAGA,IAAMC,EAAaJ,EAAGK,QAAQ5X,MAAQuX,EAAGK,QAAQ5X,MAAQuX,EAAGG,UAEtDG,EAAOC,EAAeH,EAAY,CACpC/rC,SAAUA,GAAY2rC,EAAGQ,aAAc,iBACvCP,KAAMA,GAAQztC,SAASiuC,cAAe,QAASD,aAAc,cAAY16B,EACzEqnB,MAAOA,GAAS6S,EAAGQ,aAAc,gBAIrCR,EAAGU,sBAAwBV,EAAGG,UAC9BH,EAAGG,UAAYG,EAAM,GACrBN,EAAGjoC,MAAM4oC,WAAa,UAGtB,IAAMC,EAAS,SAATA,IACFZ,EAAGG,UAAYG,EAAKO,QAEfP,EAAKluC,QACNqC,aAAcurC,EAAGc,gBACjBd,EAAGc,eAAiB3vC,WAAYyvC,EAAQzT,IAGxC+S,EAAYF,IAGpBA,EAAGc,eAAiB3vC,WAAYyvC,EAAQzT,SAnCpC+S,EAAaF,IAwCfE,EAAc,SAAAF,GAChBvrC,aAAcurC,EAAGc,gBACZd,EAAGU,wBACJV,EAAGG,UAAYH,EAAGU,sBAClBV,EAAGU,2BAAwB56B,GAE/Bk6B,EAAGjoC,MAAM4oC,WAAa,IAGbJ,EAAgB,SAAEQ,GAkB3B,IAlBkD,IAAlBnV,EAAkB,uDAAR,GAAQ,EAM9CA,EAHAv3B,gBAH8C,MAGnC,IAHmC,IAM9Cu3B,EAFAuB,aAJ8C,MAItC,GAJsC,IAM9CvB,EADAqU,YAL8C,WAKvCn6B,EALuC,EAS5Ck7B,EAAY3sC,EAAW84B,EAGvB8T,EAAcF,EAAIv3B,WAAWlB,MAAO,kCAGpCg4B,EAAO,GAGHY,EAAI,EAAGA,EAAIF,EAAWE,IAC5BZ,EAAKpwB,KAAM,IAIf,IAAM,IAAIjiB,EAAI,EAAGA,EAAIgzC,EAAY7uC,OAAQnE,IAErC,GAAK,yBAAyBoZ,KAAM45B,EAAahzC,MAAW,UAAUoZ,KAAM45B,EAAahzC,IAAQ,CAC7F,IAAI8yC,EAAME,EAAahzC,GAGjBkzC,EAAU,gBAAgB95B,KAAM05B,GAGtCA,EAAMA,EAAI72B,QAAS,KAAM,IAYzB,IATA,IAAMk3B,EAAU,mBAAmB/5B,KAAM05B,GAGnCM,EAAgBD,GAAYL,EAAIz4B,MAAO,KAAO,IAAO,IAAKlW,OAAS,EAGrE8uC,EAAIZ,EAAKluC,OAAS,EAGZkvC,EAAMN,EAAWM,GAAO,EAAGA,IAAQ,CACzC,IAAIC,EAAS9/B,SAAUs/B,EAAMC,EAAYM,EAAK,IAGzCF,IACDG,EAASrwC,WAAY6vC,EAAMC,EAAYM,GAAME,QAASH,GACtDE,EAASrwC,WAAYqwC,GAASE,eAAgBxB,IAI7CkB,IACDI,EAASA,EAAOE,eAAgBxB,IAIpCK,EAAMY,MAASK,QAInB,IAAM,IAAIL,EAAI,EAAGA,EAAIF,EAAWE,IAC5BZ,EAAMY,IAAOD,EAAahzC,GAQtC,OAFAqyC,EAAMA,EAAKluC,QAAW2uC,EAAIv3B,WAEnB82B,GCnIXrwC,EAAS,QAETU,GAAE,WACkBA,EAAE,YAGRY,MAAK,SAAUmwC,EAAQC,GACd,IAAIC,SAAU,CACzBC,QAASlxC,EAAEgB,MAAM,GACjBmwC,QAAS,SAASC,GACdhC,EAAU4B,EAAS,CACfttC,SAAU,OAGlBhD,OAAQ,0B,mBCMpBV,EAAE,4BAA4BkF,MAAM,CAChCC,MAAa,EACbC,aAAa,EACbC,UAAa,EACbC,QAAa,K,qBCvBjB,IAAItB,EAAU,KACVqtC,EAAS,KACTC,EAAS,KACTC,EAAS,KACTC,EAAU,KACVC,EAAU,KACVC,EAAU,KAoBd,SAASC,IAaL,GAXe,OAAZ3tC,IAECA,EAAQH,SAAQ,GAChBwtC,EAAOxtC,SAAQ,GACfytC,EAAOztC,SAAQ,GACf0tC,EAAO1tC,SAAQ,GACf2tC,EAAQ3tC,SAAQ,GAChB4tC,EAAQ5tC,SAAQ,GAChB6tC,EAAQ7tC,SAAQ,IAGhB7D,EAAEgC,QAAQQ,QAAU,IACpB,IAAIkB,EAAW,IACXtC,EAAc,SAEdsC,EAAW,GACXtC,EAAc,GAItB4C,EAAU,IAAI/C,YAAYC,MAAM,CAC5BR,OAAgB,EAChBS,eAAgB,uBAChBC,YAAgB,EAChBsC,SAAgB1D,EAAE,yBAAyB+B,cAAgB/B,EAAE,yBAAyB+B,gBAErF8C,OAAO,wBACPjD,MAAMtC,EAAQ,SAGnB,IAAIsyC,GAAY,IAAIntC,aACHC,GAAG,mCAAoC,EAAG,CAAEmtC,SAAU,IAAM,SAC5DntC,GAAG,gDAAiDhB,EAAU,CAAEouC,MAAO,GAAK,KAE7FT,EAAS,IAAIpwC,YAAYC,MAAM,CAC3BC,eAAgB,wBAChBC,YAAa,IACbsC,SAAU1D,EAAE,yBAAyBiC,WAExC6C,SAAS8sC,GACTvwC,GAAG,SAAS,SAASC,GAGdtB,EAAE,+CAA+CW,IAAI,QAAS,SAMrEU,GAAG,SAAS,SAASC,GAEdtB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SACfkyC,EAAU,IAAIvwC,YAAYC,MAAM,CAC5BC,eAAgB,wBAChBC,YAAa,EACbsC,SAAU1D,EAAE,yBAAyBiC,WAExCZ,GAAG,SAAS,SAASC,GAEU,WAAzBA,EAAMC,iBACLvB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SAGf,IAAIyyC,GAAY,IAAIttC,aACHC,GAAG,mCAAoC,EAAG,CAAEmtC,SAAU,IAAM,SAC5DntC,GAAG,gDAAiDhB,EAAU,CAAEouC,MAAO,GAAK,KAE7FR,EAAS,IAAIrwC,YAAYC,MAAM,CAC3BC,eAAgB,wBAChBC,YAAaA,EACbsC,SAAU1D,EAAE,yBAAyBiC,WAExC6C,SAASitC,GACT1wC,GAAG,SAAS,SAASC,GAGdtB,EAAE,+CAA+CW,IAAI,QAAS,SAKrEU,GAAG,SAAS,SAASC,GACiC,WAAzBA,EAAMC,iBAC5BvB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SAEfmyC,EAAU,IAAIxwC,YAAYC,MAAM,CAC5BC,eAAgB,wBAChBC,YAAa,EACbsC,SAAU1D,EAAE,yBAAyBiC,WAExCZ,GAAG,SAAS,SAASC,GAEU,WAAzBA,EAAMC,iBACLvB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SAGf,IAAI0yC,GAAY,IAAIvtC,aACHC,GAAG,mCAAoC,EAAG,CAAEmtC,SAAU,IAAM,SAE7EN,EAAS,IAAItwC,YAAYC,MAAM,CAC3BC,eAAgB,wBAChBC,YAAaA,EACbsC,SAAU1D,EAAE,yBAAyBiC,WAExC6C,SAASktC,GACT3wC,GAAG,SAAS,SAASC,GAGdtB,EAAE,+CAA+CW,IAAI,QAAS,SAMrEU,GAAG,SAAS,SAASC,GAEdtB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SAEfoyC,EAAU,IAAIzwC,YAAYC,MAAM,CAC5BC,eAAgB,wBAChBC,YAAa,EACbsC,SAAU1D,EAAE,yBAAyBiC,WAExCZ,GAAG,SAAS,SAASC,GAEU,WAAzBA,EAAMC,iBACLvB,EAAE,+CAA+CW,IAAI,QAAS,SAGrEiB,MAAMtC,EAAQ,SAhKnBU,GAAE,WAIE,IAAIgF,EAFJ2sC,IAGA3xC,EAAEgC,QAAQX,GAAG,UAAU,WACnByC,aAAakB,GACbA,EAAkBxE,YAAW,WACzBmxC,MACD,Y,qBCvBX,IAAI3tC,EAAU,KACVC,EAAW,KAEf,SAASguC,IACU,OAAZjuC,IACCC,EAASJ,SAAQ,GACjBG,EAAQH,SAAQ,IAGpB,IAAIO,EAAM,EACVpE,EAAE,+CAA+CY,MAAK,WAClDwD,GAAOpE,EAAEgB,MAAMqD,gBAEnBD,GAAOpE,EAAE,+CAA+CwC,QACxD,IAAI9B,EAASV,EAAE,wBAAwBiC,SAAYjC,EAAEgC,QAAQC,SAAY,IAEzE,GAAImC,EAAM,GAAKpE,EAAEgC,QAAQQ,SAAW,IAAK,CAErC,IAAI0vC,GAAuB,IAAIztC,aAC1BC,GAAG,wCAAyC,EAAG,CAC5CC,EAAG,IAAMP,EAAM,OAIvBJ,EAAU,IAAI/C,YAAYC,MAAM,CAC5BR,OAAgBA,EAChBS,eAAgB,uBAChBC,YAAgB,EAChBsC,SAAmC,IAAnB1D,EAAEgC,QAAQC,WAEzB4C,OAAO,wBACPjD,MAAMtC,EAAQ,SAGnB2E,EAAW,IAAIhD,YAAYC,MAAM,CAC7BR,OAAgBA,EAChBS,eAAgB,uBAChBC,YAAgB,EAChBsC,SAAmC,IAAnB1D,EAAEgC,QAAQC,WAEzB6C,SAASotC,GACTtwC,MAAMtC,EAAQ,SAEvBkE,IAAIuB,UAGR,SAASotC,IACLnyC,EAAE,yCAAyCkF,MAAM,CAC7CC,MAAa,EACbC,aAAa,EACbC,UAAa,EACbC,QAAa,EACbC,WAAa,CACT,CACIC,WAAY,IACZC,SAAY,cAM5BzF,GAAE,WAGE,IAAIgF,EAFJitC,IACAE,IAEAnyC,EAAEgC,QAAQX,GAAG,UAAU,WACnByC,aAAakB,GACbA,EAAkBxE,YAAW,WACzByxC,IACAE,MACD,QAEPnyC,EAAE,sBAAsBY,MAAK,WACzBZ,EAAEgB,MAAM,GAAGoxC,c,mBCzEnB/0C,EAAOD,QAAU,SAASC,GAoBzB,OAnBKA,EAAOg1C,kBACXh1C,EAAOi1C,UAAY,aACnBj1C,EAAOqjB,MAAQ,GAEVrjB,EAAO+C,WAAU/C,EAAO+C,SAAW,IACxCpC,OAAOC,eAAeZ,EAAQ,SAAU,CACvCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOE,KAGhBS,OAAOC,eAAeZ,EAAQ,KAAM,CACnCa,YAAY,EACZC,IAAK,WACJ,OAAOd,EAAOC,KAGhBD,EAAOg1C,gBAAkB,GAEnBh1C,I,qBCpBR,IAAI2G,EAAU,KACVC,EAAW,KACXsuC,EAAevyC,EAAEgC,QAAQQ,QAuC7B,SAAS2B,IAEU,OAAZH,IACCC,EAASJ,SAAQ,GACjBG,EAAQH,SAAQ,IAGpB,IAAIO,EAAMpE,EAAE,oCAAoCwC,QAAUxC,EAAE,2BAA2BwC,QAEvF,GAAG4B,EAAM,GAAKpE,EAAEgC,QAAQQ,QAAU,IAAK,CAEnC,IAGI+B,EAHA2tC,GAAuB,IAAIztC,aAAcC,GAAG,wBAAyB,EAAK,CAACC,EAAG,IAAKP,EAAK,OAExFQ,EAAc,OAElBA,EAAiC,IAAnB5E,EAAEgC,QAAQC,SACxBsC,EAAwC,EAAnBvE,EAAEgC,QAAQC,SAE5BjC,EAAEgC,QAAQQ,QAAUxC,EAAEgC,QAAQC,UACzBjC,EAAEgC,QAAQQ,QAAU,OACpBoC,EAAc,OACdA,EAAiC,IAAnB5E,EAAEgC,QAAQC,UAKhC+B,EAAU,IAAI/C,YAAYC,MAAM,CAC5BC,eAAgB,uBAChBC,YAAa,EACbsC,SAAUkB,IAEbC,OAAO,uBAAwB,CAAC2tC,eAAe,IAC/C5wC,MAAMtC,EAAQ,SAEf2E,EAAW,IAAIhD,YAAYC,MAAM,CAC7BR,OAAQ,IACRS,eAAgB,uBAChBC,YAAa,EACbsC,SAAUa,IAEbO,SAASotC,GACTtwC,MAAMtC,EAAQ,SAInBkE,IAAIuB,UAlFR/E,GAAE,WAUE,IAAIgF,EAFJb,IAGAnE,EAAEgC,QAAQX,GAAG,UAAU,WAChBrB,EAAEgC,QAAQQ,UAAY+vC,IACrBzuC,aAAakB,GACbA,EAAkBxE,YAAW,WACzB2D,MACD,KAEHouC,EAAevyC,EAAEgC,QAAQQ,QAEzBxC,EAAE,+BAA+BiC,OAAOjC,EAAEgC,QAAQC,cAI1DjC,EAAE,uBAAuBmC,OAAM,SAASC,GACrCA,EAAEC,iBACFrC,EAAE,uBAAuBoD,KAAK,MAAOpD,EAAEgB,MAAMoC,KAAK,aAClDpD,EAAE,gBAAgByyC,MAAM,WAG3BzyC,EAAE,gBAAgBqB,GAAG,mBAAmB,SAAUe,GAC9CpC,EAAE,uBAAuBoD,KAAK,MAAO,W,mBCnC7CpD,GAAE,WAEEA,EAAE,0BAA0BqB,GAAG,SAAS,WACpCrB,EAAEgB,MAAMuB,UACRmwC,mB,mBCJR1yC,GAAE,WAEEA,EAAE,8BAA8B2yC,SAAS,CACrCC,UAAU,IACXD,SAAS,GAGZ3yC,EAAE,2EAA2EmC,OAAM,WAC/EnC,EAAE,8BAA8B2yC,SAAS,YAI7C3yC,EAAE,gBAAgBmC,OAAM,WAEpBnC,EAAE,8BAA8B2yC,SAAS,WACzC3yC,EAAE,8BAA8B2yC,SAAS,CACrCC,SAAU,KACVC,OAAO,EACP5M,MAAM,IACP0M,SAAS,U,mBCnBpB3yC,GAAE,WAEE,IAAI8yC,iBAAiB,uBAAwB,CACzCC,iBAAiB,IAErB,IAAID,iBAAiB,uBAAwB,CACzCC,iBAAiB,IAIC/wC,OAAOgxC,SAASC,KACzCjzC,EAAE,kBAAkBqB,GAAG,SAAS,SAASe,GACxCA,EAAE8wC,kBACF9wC,EAAEC,iBACI,IAAI4wC,EAAOjzC,EAAEgB,MAAMoC,KAAK,QAC1BuB,EAAIwuC,OAAO3wC,MAAM,EAAI,IACrB0G,EAAIiqC,OAAOlxC,OAAO,EAAI,IACfjC,EAAEgB,MAAMoC,KAAK,OAGf,UADCpD,EAAEgB,MAAMoC,KAAK,UAEtBpB,OAAOoxC,KAAKH,EAAM,UAGlBjxC,OAAOoxC,KAAKH,EAAM,SAAU,6BAA6BtuC,EAAE,QAAQuE,U,oBClBrE,WACC,aAEA,IAAImqC,EAAa,EACbC,EAAe,GAGnB,SAASrC,EAAShW,GAChB,IAAKA,EACH,MAAM,IAAI5iB,MAAM,6CAElB,IAAK4iB,EAAQiW,QACX,MAAM,IAAI74B,MAAM,oDAElB,IAAK4iB,EAAQkW,QACX,MAAM,IAAI94B,MAAM,oDAGlBrX,KAAKnC,IAAM,YAAcw0C,EACzBryC,KAAKi6B,QAAUgW,EAASsC,QAAQlN,OAAO,GAAI4K,EAAS/4B,SAAU+iB,GAC9Dj6B,KAAKkwC,QAAUlwC,KAAKi6B,QAAQiW,QAC5BlwC,KAAKwyC,QAAU,IAAIvC,EAASsC,QAAQvyC,KAAKkwC,SACzClwC,KAAK4wB,SAAWqJ,EAAQkW,QACxBnwC,KAAKyyC,KAAOzyC,KAAKi6B,QAAQyY,WAAa,aAAe,WACrD1yC,KAAK0H,QAAU1H,KAAKi6B,QAAQvyB,QAC5B1H,KAAK2yC,aAAe,KACpB3yC,KAAK04B,MAAQuX,EAAS2C,MAAMC,aAAa,CACvCh2C,KAAMmD,KAAKi6B,QAAQvB,MACnB+Z,KAAMzyC,KAAKyyC,OAEbzyC,KAAKgX,QAAUi5B,EAAS6C,QAAQC,sBAAsB/yC,KAAKi6B,QAAQjjB,SAE/Di5B,EAAS+C,cAAchzC,KAAKi6B,QAAQv6B,UACtCM,KAAKi6B,QAAQv6B,OAASuwC,EAAS+C,cAAchzC,KAAKi6B,QAAQv6B,SAE5DM,KAAK04B,MAAMhvB,IAAI1J,MACfA,KAAKgX,QAAQtN,IAAI1J,MACjBsyC,EAAatyC,KAAKnC,KAAOmC,KACzBqyC,GAAc,EAIhBpC,EAAS/xC,UAAU+0C,aAAe,SAAS7C,GACzCpwC,KAAK04B,MAAMua,aAAajzC,KAAMowC,IAIhCH,EAAS/xC,UAAUg1C,QAAU,SAASrhC,GAC/B7R,KAAK0H,SAGN1H,KAAK4wB,UACP5wB,KAAK4wB,SAASlf,MAAM1R,KAAM6R,IAM9Bo+B,EAAS/xC,UAAU2E,QAAU,WAC3B7C,KAAKgX,QAAQusB,OAAOvjC,MACpBA,KAAK04B,MAAM6K,OAAOvjC,aACXsyC,EAAatyC,KAAKnC,MAK3BoyC,EAAS/xC,UAAUi1C,QAAU,WAE3B,OADAnzC,KAAK0H,SAAU,EACR1H,MAKTiwC,EAAS/xC,UAAUk1C,OAAS,WAG1B,OAFApzC,KAAKgX,QAAQjT,UACb/D,KAAK0H,SAAU,EACR1H,MAKTiwC,EAAS/xC,UAAU0+B,KAAO,WACxB,OAAO58B,KAAK04B,MAAMkE,KAAK58B,OAKzBiwC,EAAS/xC,UAAU+sB,SAAW,WAC5B,OAAOjrB,KAAK04B,MAAMzN,SAASjrB,OAI7BiwC,EAASoD,UAAY,SAAS1T,GAC5B,IAAI2T,EAAoB,GACxB,IAAK,IAAIC,KAAejB,EACtBgB,EAAkB/0B,KAAK+zB,EAAaiB,IAEtC,IAAK,IAAIj3C,EAAI,EAAG0vB,EAAMsnB,EAAkB7yC,OAAQnE,EAAI0vB,EAAK1vB,IACvDg3C,EAAkBh3C,GAAGqjC,MAMzBsQ,EAASuD,WAAa,WACpBvD,EAASoD,UAAU,YAKrBpD,EAASwD,WAAa,WACpBxD,EAASoD,UAAU,YAKrBpD,EAASyD,UAAY,WAEnB,IAAK,IAAIH,KADTtD,EAAS6C,QAAQa,aACOrB,EACtBA,EAAaiB,GAAa7rC,SAAU,EAEtC,OAAO1H,MAKTiwC,EAAS0D,WAAa,WACpB1D,EAAS6C,QAAQa,cAKnB1D,EAAS2D,eAAiB,WACxB,OAAO5yC,OAAO6yC,aAAehzC,SAASizC,gBAAgBC,cAKxD9D,EAAS+D,cAAgB,WACvB,OAAOnzC,SAASizC,gBAAgBG,aAGlChE,EAASiE,SAAW,GAEpBjE,EAAS/4B,SAAW,CAClBF,QAAShW,OACTmzC,YAAY,EACZzsC,SAAS,EACTgxB,MAAO,UACPga,YAAY,EACZhzC,OAAQ,GAGVuwC,EAAS+C,cAAgB,CACvB,iBAAkB,WAChB,OAAOhzC,KAAKgX,QAAQ68B,cAAgB7zC,KAAKwyC,QAAQzxC,eAEnD,gBAAiB,WACf,OAAOf,KAAKgX,QAAQ3T,aAAerD,KAAKwyC,QAAQ4B,eAIpDpzC,OAAOivC,SAAWA,EAlKpB,GAoKE,WACA,aAEA,SAASoE,EAA0BzjB,GACjC5vB,OAAOxB,WAAWoxB,EAAU,IAAO,IAGrC,IAAIyhB,EAAa,EACbiC,EAAW,GACXrE,EAAWjvC,OAAOivC,SAClBsE,EAAgBvzC,OAAOwzC,OAG3B,SAAS1B,EAAQ5C,GACflwC,KAAKkwC,QAAUA,EACflwC,KAAKuyC,QAAUtC,EAASsC,QACxBvyC,KAAKwyC,QAAU,IAAIxyC,KAAKuyC,QAAQrC,GAChClwC,KAAKnC,IAAM,oBAAsBw0C,EACjCryC,KAAKy0C,WAAY,EACjBz0C,KAAK00C,WAAY,EACjB10C,KAAK20C,UAAY,CACfhxC,EAAG3D,KAAKwyC,QAAQoC,aAChB1sC,EAAGlI,KAAKwyC,QAAQ5wC,aAElB5B,KAAK60C,UAAY,CACfC,SAAU,GACVpC,WAAY,IAGdxC,EAAQ6E,mBAAqB/0C,KAAKnC,IAClCy2C,EAASpE,EAAQ6E,oBAAsB/0C,KACvCqyC,GAAc,EACTpC,EAAS+E,gBACZ/E,EAAS+E,eAAgB,EACzB/E,EAAS+E,cAAgB,IAAIlC,EAAQ9xC,SAGvChB,KAAKi1C,+BACLj1C,KAAKk1C,+BAIPpC,EAAQ50C,UAAUwL,IAAM,SAASyrC,GAC/B,IAAI1C,EAAO0C,EAASlb,QAAQyY,WAAa,aAAe,WACxD1yC,KAAK60C,UAAUpC,GAAM0C,EAASt3C,KAAOs3C,EACrCn1C,KAAK+D,WAIP+uC,EAAQ50C,UAAUk3C,WAAa,WAC7B,IAAIC,EAAkBr1C,KAAKuyC,QAAQ+C,cAAct1C,KAAK60C,UAAUnC,YAC5D6C,EAAgBv1C,KAAKuyC,QAAQ+C,cAAct1C,KAAK60C,UAAUC,UAC1DU,EAAWx1C,KAAKkwC,SAAWlwC,KAAKkwC,QAAQlvC,OACxCq0C,GAAmBE,IAAkBC,IACvCx1C,KAAKwyC,QAAQiD,IAAI,qBACVnB,EAASt0C,KAAKnC,OAKzBi1C,EAAQ50C,UAAUg3C,6BAA+B,WAC/C,IAAIhlC,EAAOlQ,KAEX,SAAS01C,IACPxlC,EAAKnN,eACLmN,EAAKwkC,WAAY,EAGnB10C,KAAKwyC,QAAQnyC,GAAG,oBAAoB,WAC7B6P,EAAKwkC,YACRxkC,EAAKwkC,WAAY,EACjBzE,EAAS0F,sBAAsBD,QAMrC5C,EAAQ50C,UAAU+2C,6BAA+B,WAC/C,IAAI/kC,EAAOlQ,KACX,SAAS41C,IACP1lC,EAAK2lC,eACL3lC,EAAKukC,WAAY,EAGnBz0C,KAAKwyC,QAAQnyC,GAAG,oBAAoB,WAC7B6P,EAAKukC,YAAaxE,EAAS6F,UAC9B5lC,EAAKukC,WAAY,EACjBxE,EAAS0F,sBAAsBC,QAMrC9C,EAAQ50C,UAAU6E,aAAe,WAC/BktC,EAAS6C,QAAQa,cAInBb,EAAQ50C,UAAU23C,aAAe,WAC/B,IAAIE,EAAkB,GAClBC,EAAO,CACTtD,WAAY,CACVuD,UAAWj2C,KAAKwyC,QAAQoC,aACxBD,UAAW30C,KAAK20C,UAAUhxC,EAC1BuyC,QAAS,QACTC,SAAU,QAEZrB,SAAU,CACRmB,UAAWj2C,KAAKwyC,QAAQ5wC,YACxB+yC,UAAW30C,KAAK20C,UAAUzsC,EAC1BguC,QAAS,OACTC,SAAU,OAId,IAAK,IAAIC,KAAWJ,EAAM,CACxB,IAAIvD,EAAOuD,EAAKI,GAEZhG,EADYqC,EAAKwD,UAAYxD,EAAKkC,UACVlC,EAAKyD,QAAUzD,EAAK0D,SAEhD,IAAK,IAAI5C,KAAevzC,KAAK60C,UAAUuB,GAAU,CAC/C,IAAIjB,EAAWn1C,KAAK60C,UAAUuB,GAAS7C,GACvC,GAA8B,OAA1B4B,EAASxC,aAAb,CAGA,IAAI0D,EAAwB5D,EAAKkC,UAAYQ,EAASxC,aAClD2D,EAAuB7D,EAAKwD,WAAad,EAASxC,cACjC0D,GAAyBC,IACvBD,IAA0BC,KAE/CnB,EAASlC,aAAa7C,GACtB2F,EAAgBZ,EAASzc,MAAMlK,IAAM2mB,EAASzc,SAKpD,IAAK,IAAI6d,KAAYR,EACnBA,EAAgBQ,GAAUC,gBAG5Bx2C,KAAK20C,UAAY,CACfhxC,EAAGqyC,EAAKtD,WAAWuD,UACnB/tC,EAAG8tC,EAAKlB,SAASmB,YAKrBnD,EAAQ50C,UAAU21C,YAAc,WAE9B,OAAI7zC,KAAKkwC,SAAWlwC,KAAKkwC,QAAQlvC,OACxBivC,EAAS2D,iBAGX5zC,KAAKwyC,QAAQqB,eAItBf,EAAQ50C,UAAUqlC,OAAS,SAAS4R,UAC3Bn1C,KAAK60C,UAAUM,EAAS1C,MAAM0C,EAASt3C,KAC9CmC,KAAKo1C,cAIPtC,EAAQ50C,UAAUmF,WAAa,WAE7B,OAAIrD,KAAKkwC,SAAWlwC,KAAKkwC,QAAQlvC,OACxBivC,EAAS+D,gBAGXh0C,KAAKwyC,QAAQnvC,cAKtByvC,EAAQ50C,UAAU2E,QAAU,WAC1B,IAAIyvC,EAAe,GACnB,IAAK,IAAIG,KAAQzyC,KAAK60C,UACpB,IAAK,IAAItB,KAAevzC,KAAK60C,UAAUpC,GACrCH,EAAa/zB,KAAKve,KAAK60C,UAAUpC,GAAMc,IAG3C,IAAK,IAAIj3C,EAAI,EAAG0vB,EAAMsmB,EAAa7xC,OAAQnE,EAAI0vB,EAAK1vB,IAClDg2C,EAAah2C,GAAGuG,WAMpBiwC,EAAQ50C,UAAU6F,QAAU,WAE1B,IAIIiyC,EAJAR,EAAWx1C,KAAKkwC,SAAWlwC,KAAKkwC,QAAQlvC,OAExCy1C,EAAgBjB,OAAWrhC,EAAYnU,KAAKwyC,QAAQ9yC,SACpDq2C,EAAkB,GAyBtB,IAAK,IAAIK,KAtBTp2C,KAAK61C,eACLG,EAAO,CACLtD,WAAY,CACV+D,cAAejB,EAAW,EAAIiB,EAAcC,KAC5CC,cAAenB,EAAW,EAAIx1C,KAAK20C,UAAUhxC,EAC7CizC,iBAAkB52C,KAAKqD,aACvBsxC,UAAW30C,KAAK20C,UAAUhxC,EAC1BuyC,QAAS,QACTC,SAAU,OACVU,WAAY,QAEd/B,SAAU,CACR2B,cAAejB,EAAW,EAAIiB,EAAcK,IAC5CH,cAAenB,EAAW,EAAIx1C,KAAK20C,UAAUzsC,EAC7C0uC,iBAAkB52C,KAAK6zC,cACvBc,UAAW30C,KAAK20C,UAAUzsC,EAC1BguC,QAAS,OACTC,SAAU,KACVU,WAAY,QAIU,CACxB,IAAIpE,EAAOuD,EAAKI,GAChB,IAAK,IAAI7C,KAAevzC,KAAK60C,UAAUuB,GAAU,CAC/C,IAKIW,EAAiBC,EAAiBC,EACfC,EANnB/B,EAAWn1C,KAAK60C,UAAUuB,GAAS7C,GACnC4D,EAAahC,EAASlb,QAAQv6B,OAC9B03C,EAAkBjC,EAASxC,aAC3B0E,EAAgB,EAChBC,EAAmC,MAAnBF,EAIhBjC,EAASjF,UAAYiF,EAASjF,QAAQlvC,SACxCq2C,EAAgBlC,EAAS3C,QAAQ9yC,SAAS+yC,EAAKoE,aAGvB,mBAAfM,EACTA,EAAaA,EAAWzlC,MAAMyjC,GAED,iBAAfgC,IACdA,EAAa53C,WAAW43C,GACpBhC,EAASlb,QAAQv6B,OAAOorB,QAAQ,MAAS,IAC3CqsB,EAAaz4C,KAAKib,KAAK84B,EAAKmE,iBAAmBO,EAAa,OAIhEJ,EAAkBtE,EAAKkE,cAAgBlE,EAAKgE,cAC5CtB,EAASxC,aAAej0C,KAAKmb,MAAMw9B,EAAgBN,EAAkBI,GACrEH,EAAkBI,EAAkB3E,EAAKkC,UACzCsC,EAAiB9B,EAASxC,cAAgBF,EAAKkC,UAE/CuC,GAAoBF,IAAoBC,GAEnCK,IAHeN,GAAmBC,IAIrC9B,EAASlC,aAAaR,EAAK0D,UAC3BJ,EAAgBZ,EAASzc,MAAMlK,IAAM2mB,EAASzc,SAEtC4e,GAAiBJ,GAIlBI,GAAiB7E,EAAKkC,WAAaQ,EAASxC,gBAHnDwC,EAASlC,aAAaR,EAAKyD,SAC3BH,EAAgBZ,EAASzc,MAAMlK,IAAM2mB,EAASzc,QAepD,OANAuX,EAAS0F,uBAAsB,WAC7B,IAAK,IAAIY,KAAYR,EACnBA,EAAgBQ,GAAUC,mBAIvBx2C,MAIT8yC,EAAQC,sBAAwB,SAAS7C,GACvC,OAAO4C,EAAQyE,cAAcrH,IAAY,IAAI4C,EAAQ5C,IAIvD4C,EAAQa,WAAa,WACnB,IAAK,IAAI6D,KAAalD,EACpBA,EAASkD,GAAWzzC,WAMxB+uC,EAAQyE,cAAgB,SAASrH,GAC/B,OAAOoE,EAASpE,EAAQ6E,qBAG1B/zC,OAAOwzC,OAAS,WACVD,GACFA,IAEFzB,EAAQa,cAIV1D,EAAS0F,sBAAwB,SAAS/kB,IACxB5vB,OAAO20C,uBACrB30C,OAAOy2C,0BACPz2C,OAAO02C,6BACPrD,GACQ53C,KAAKuE,OAAQ4vB,IAEzBqf,EAAS6C,QAAUA,EAnTpB,GAqTC,WACA,aAEA,SAAS6E,EAAeC,EAAGC,GACzB,OAAOD,EAAEjF,aAAekF,EAAElF,aAG5B,SAASmF,EAAsBF,EAAGC,GAChC,OAAOA,EAAElF,aAAeiF,EAAEjF,aAG5B,IAAIoF,EAAS,CACXjD,SAAU,GACVpC,WAAY,IAEVzC,EAAWjvC,OAAOivC,SAGtB,SAAS2C,EAAM3Y,GACbj6B,KAAKnD,KAAOo9B,EAAQp9B,KACpBmD,KAAKyyC,KAAOxY,EAAQwY,KACpBzyC,KAAKwuB,GAAKxuB,KAAKnD,KAAO,IAAMmD,KAAKyyC,KACjCzyC,KAAK60C,UAAY,GACjB70C,KAAKg4C,qBACLD,EAAO/3C,KAAKyyC,MAAMzyC,KAAKnD,MAAQmD,KAIjC4yC,EAAM10C,UAAUwL,IAAM,SAASyrC,GAC7Bn1C,KAAK60C,UAAUt2B,KAAK42B,IAItBvC,EAAM10C,UAAU85C,mBAAqB,WACnCh4C,KAAKi4C,cAAgB,CACnBC,GAAI,GACJC,KAAM,GACNzB,KAAM,GACN0B,MAAO,KAKXxF,EAAM10C,UAAUs4C,cAAgB,WAC9B,IAAK,IAAIpG,KAAapwC,KAAKi4C,cAAe,CACxC,IAAIpD,EAAY70C,KAAKi4C,cAAc7H,GAC/Bv1B,EAAwB,OAAdu1B,GAAoC,SAAdA,EACpCyE,EAAU3qB,KAAKrP,EAAUi9B,EAAwBH,GACjD,IAAK,IAAIr7C,EAAI,EAAG0vB,EAAM6oB,EAAUp0C,OAAQnE,EAAI0vB,EAAK1vB,GAAK,EAAG,CACvD,IAAI64C,EAAWN,EAAUv4C,IACrB64C,EAASlb,QAAQka,YAAc73C,IAAMu4C,EAAUp0C,OAAS,IAC1D00C,EAASjC,QAAQ,CAAC9C,KAIxBpwC,KAAKg4C,sBAIPpF,EAAM10C,UAAU0+B,KAAO,SAASuY,GAC9Bn1C,KAAK60C,UAAU3qB,KAAKytB,GACpB,IAAIp1C,EAAQ0tC,EAASsC,QAAQ8F,QAAQlD,EAAUn1C,KAAK60C,WAEpD,OADatyC,IAAUvC,KAAK60C,UAAUp0C,OAAS,EAC/B,KAAOT,KAAK60C,UAAUtyC,EAAQ,IAIhDqwC,EAAM10C,UAAU+sB,SAAW,SAASkqB,GAClCn1C,KAAK60C,UAAU3qB,KAAKytB,GACpB,IAAIp1C,EAAQ0tC,EAASsC,QAAQ8F,QAAQlD,EAAUn1C,KAAK60C,WACpD,OAAOtyC,EAAQvC,KAAK60C,UAAUtyC,EAAQ,GAAK,MAI7CqwC,EAAM10C,UAAU+0C,aAAe,SAASkC,EAAU/E,GAChDpwC,KAAKi4C,cAAc7H,GAAW7xB,KAAK42B,IAIrCvC,EAAM10C,UAAUqlC,OAAS,SAAS4R,GAChC,IAAI5yC,EAAQ0tC,EAASsC,QAAQ8F,QAAQlD,EAAUn1C,KAAK60C,WAChDtyC,GAAS,GACXvC,KAAK60C,UAAU97B,OAAOxW,EAAO,IAMjCqwC,EAAM10C,UAAUutC,MAAQ,WACtB,OAAOzrC,KAAK60C,UAAU,IAKxBjC,EAAM10C,UAAU0nB,KAAO,WACrB,OAAO5lB,KAAK60C,UAAU70C,KAAK60C,UAAUp0C,OAAS,IAIhDmyC,EAAMC,aAAe,SAAS5Y,GAC5B,OAAO8d,EAAO9d,EAAQwY,MAAMxY,EAAQp9B,OAAS,IAAI+1C,EAAM3Y,IAGzDgW,EAAS2C,MAAQA,EAvGlB,GAyGC,WACA,aAEA,IAAI3C,EAAWjvC,OAAOivC,SAEtB,SAASuF,EAAStF,GAChB,OAAOA,IAAYA,EAAQlvC,OAG7B,SAASs3C,EAAUpI,GACjB,OAAIsF,EAAStF,GACJA,EAEFA,EAAQqI,YAGjB,SAASC,EAAmBtI,GAC1BlwC,KAAKkwC,QAAUA,EACflwC,KAAKy4C,SAAW,GAGlBD,EAAmBt6C,UAAU21C,YAAc,WAEzC,OADY2B,EAASx1C,KAAKkwC,SACXlwC,KAAKkwC,QAAQ2D,YAAc7zC,KAAKkwC,QAAQ6D,cAGzDyE,EAAmBt6C,UAAUmF,WAAa,WAExC,OADYmyC,EAASx1C,KAAKkwC,SACXlwC,KAAKkwC,QAAQ7sC,WAAarD,KAAKkwC,QAAQ+D,aAGxDuE,EAAmBt6C,UAAUu3C,IAAM,SAASn1C,EAAO6vC,GACjD,SAASuI,EAAgBxI,EAASyI,EAAWxI,GAC3C,IAAK,IAAI7zC,EAAI,EAAG0vB,EAAM2sB,EAAUl4C,OAAS,EAAGnE,EAAI0vB,EAAK1vB,IAAK,CACxD,IAAIs8C,EAAWD,EAAUr8C,GACpB6zC,GAAWA,IAAYyI,GAC1B1I,EAAQ2I,oBAAoBD,IAKlC,IAAIE,EAAax4C,EAAMqW,MAAM,KACzBoiC,EAAYD,EAAW,GACvBE,EAAYF,EAAW,GACvB5I,EAAUlwC,KAAKkwC,QAEnB,GAAI8I,GAAah5C,KAAKy4C,SAASO,IAAcD,EAC3CL,EAAgBxI,EAASlwC,KAAKy4C,SAASO,GAAWD,GAAY5I,GAC9DnwC,KAAKy4C,SAASO,GAAWD,GAAa,QAEnC,GAAIA,EACP,IAAK,IAAIp7C,KAAMqC,KAAKy4C,SAClBC,EAAgBxI,EAASlwC,KAAKy4C,SAAS96C,GAAIo7C,IAAc,GAAI5I,GAC7DnwC,KAAKy4C,SAAS96C,GAAIo7C,GAAa,QAG9B,GAAIC,GAAah5C,KAAKy4C,SAASO,GAAY,CAC9C,IAAK,IAAIzzC,KAAQvF,KAAKy4C,SAASO,GAC7BN,EAAgBxI,EAASlwC,KAAKy4C,SAASO,GAAWzzC,GAAO4qC,GAE3DnwC,KAAKy4C,SAASO,GAAa,KAK/BR,EAAmBt6C,UAAUwB,OAAS,WACpC,IAAKM,KAAKkwC,QAAQ+I,cAChB,OAAO,KAGT,IAAInF,EAAkB9zC,KAAKkwC,QAAQ+I,cAAcnF,gBAC7CoF,EAAMZ,EAAUt4C,KAAKkwC,QAAQ+I,eAC7BE,EAAO,CACTrC,IAAK,EACLJ,KAAM,GAOR,OAJI12C,KAAKkwC,QAAQkJ,wBACfD,EAAOn5C,KAAKkwC,QAAQkJ,yBAGf,CACLtC,IAAKqC,EAAKrC,IAAMoC,EAAIG,YAAcvF,EAAgBwF,UAClD5C,KAAMyC,EAAKzC,KAAOwC,EAAIK,YAAczF,EAAgB0F,aAIxDhB,EAAmBt6C,UAAUmC,GAAK,SAASC,EAAO6vC,GAChD,IAAI2I,EAAax4C,EAAMqW,MAAM,KACzBoiC,EAAYD,EAAW,GACvBE,EAAYF,EAAW,IAAM,YAC7BW,EAAaz5C,KAAKy4C,SAASO,GAAah5C,KAAKy4C,SAASO,IAAc,IACvDS,EAAWV,GAAaU,EAAWV,IAAc,IAEvDx6B,KAAK4xB,GAChBnwC,KAAKkwC,QAAQwJ,iBAAiBX,EAAW5I,IAG3CqI,EAAmBt6C,UAAU6C,YAAc,SAAS44C,GAClD,IACIC,EADA34C,EAASjB,KAAK6zC,cASlB,OANI8F,IAAkBnE,EAASx1C,KAAKkwC,WAClC0J,EAAgB54C,OAAO64C,iBAAiB75C,KAAKkwC,SAC7CjvC,GAAU6O,SAAS8pC,EAAcE,UAAW,IAC5C74C,GAAU6O,SAAS8pC,EAAcG,aAAc,KAG1C94C,GAGTu3C,EAAmBt6C,UAAUk2C,WAAa,SAASuF,GACjD,IACIC,EADAp4C,EAAQxB,KAAKqD,aASjB,OANIs2C,IAAkBnE,EAASx1C,KAAKkwC,WAClC0J,EAAgB54C,OAAO64C,iBAAiB75C,KAAKkwC,SAC7C1uC,GAASsO,SAAS8pC,EAAc/zC,WAAY,IAC5CrE,GAASsO,SAAS8pC,EAAcI,YAAa,KAGxCx4C,GAGTg3C,EAAmBt6C,UAAU02C,WAAa,WACxC,IAAIsE,EAAMZ,EAAUt4C,KAAKkwC,SACzB,OAAOgJ,EAAMA,EAAIK,YAAcv5C,KAAKkwC,QAAQ0E,YAG9C4D,EAAmBt6C,UAAU0D,UAAY,WACvC,IAAIs3C,EAAMZ,EAAUt4C,KAAKkwC,SACzB,OAAOgJ,EAAMA,EAAIG,YAAcr5C,KAAKkwC,QAAQtuC,WAG9C42C,EAAmBnT,OAAS,WAC1B,IAAIxzB,EAAOkB,MAAM7U,UAAUuwB,MAAMhyB,KAAKu0B,WAEtC,SAAS8M,EAAMgI,EAAQmU,GACrB,GAAsB,iBAAXnU,GAAsC,iBAARmU,EACvC,IAAK,IAAIp8C,KAAOo8C,EACVA,EAAI97C,eAAeN,KACrBioC,EAAOjoC,GAAOo8C,EAAIp8C,IAKxB,OAAOioC,EAGT,IAAK,IAAIxpC,EAAI,EAAG0vB,EAAMna,EAAKpR,OAAQnE,EAAI0vB,EAAK1vB,IAC1CwhC,EAAMjsB,EAAK,GAAIA,EAAKvV,IAEtB,OAAOuV,EAAK,IAGd2mC,EAAmBH,QAAU,SAASnI,EAASn+B,EAAOzV,GACpD,OAAgB,MAATyV,GAAiB,EAAIA,EAAM+Y,QAAQolB,EAAS5zC,IAGrDk8C,EAAmBlD,cAAgB,SAAS2E,GAE1C,IAAK,IAAIp9C,KAAQo9C,EACf,OAAO,EAET,OAAO,GAGThK,EAASiE,SAAS31B,KAAK,CACrB1hB,KAAM,cACN01C,QAASiG,IAEXvI,EAASsC,QAAUiG,EA3KpB,I,mBCxkBDx5C,GAAE,WAEEA,EAAEgC,QAAQX,GAAG,UAAU,WACnB,IAAI65C,EAAkBl7C,EAAEgC,QAAQ6yC,cAChC70C,EAAE,8CAA8CW,IAAI,SAAUu6C,MAElE,IAAIA,EAAkBl7C,EAAEgC,QAAQ6yC,cAChC70C,EAAE,8CAA8CW,IAAI,SAAUu6C,GAG9Dl7C,EAAE,gDAAgDmC,OAAM,WACpDnC,EAAE,QAAQC,YAAY,aACtBD,EAAE,8CAA8CC,YAAY,gBAC5DD,EAAE,8CAA8CW,IAAI,QAAS,aAEjEX,EAAE,qBAAqBmC,OAAM,SAASC,GAC/BpC,EAAEgC,QAAQQ,QAAU,OACnBJ,EAAEC,iBACFrC,EAAE,QAAQE,SAAS,aACnBF,EAAE,8CAA8CE,SAAS,gBACzDF,EAAE,8CAA8CW,IAAI,QAAS,a,qBCpBzEX,GAAE,WAEE,IAAIm7C,EAAan5C,OAAOgxC,SAASoI,SAASzjC,MAAM,KAAK,GAGrD,GAAkB,MAAdwjC,GAAoC,MAAdA,EACtB,IAAIE,EAAW,iNAEXA,EAAW,8LAGnB,IAAIC,EAAa,SAAWD,EAAS1jC,MAAM,OAAO7H,KAAK,kBAAoB,UAG3E,IAAI7O,YAAYC,MAAM,CAClBR,OAAS,OACTS,eAAgB,eAChBC,YAAa,EACbya,SAAS,IAEZxa,GAAG,SAAS,SAASe,GAClBpC,EAAE,eAAeukC,SAGjBvkC,EAAEs7C,GAAYp7C,SAAS,QAAQq7C,SAAS,UAAU36C,MAAK,SAAStD,GAE5D0C,EAAEgB,MAAMw7B,MAAM,IAAMl/B,GAAGk+C,OAAO,OAAQ,GAEpB,MAAdL,GAAoC,MAAdA,GACb,GAAL79C,GACA0C,EAAEgB,MAAMd,SAAS,UAEZ,GAAL5C,GACA0C,EAAEgB,MAAMd,SAAS,YAGZ,GAAL5C,GACA0C,EAAEgB,MAAMd,SAAS,UAEZ,GAAL5C,GACA0C,EAAEgB,MAAMd,SAAS,iBAKhC0B,MAAMtC,EAAQ,a,mBC7CnB,IAAIuD,EAAwB,IAAI5B,YAAYiC,WAE5C7F,EAAOD,QAAUyF,G,qBCFjB7C,GAAE,WAGEA,EAAE,qDAAqDmC,OAAM,SAAUC,GACnEA,EAAEC,iBAEF,IAAMykC,EAAS9mC,EAAEgB,MAAMoC,KAAK,eAC5BpD,EAAE,mDAAmDC,YAAY,UACjED,EAAE8mC,GAAQ2U,QAAQ,2BAA2B71C,KAAK,sBAAsB3F,YAAY,UAEpFD,EAAEgB,MAAMy6C,QAAQ,sBAAsBv7C,SAAS,UAC/CF,EAAE8mC,GAAQ5mC,SAAS,UAEJ,kCAAX4mC,EACA9mC,EAAE,gBAAgBE,SAAS,WAE3BF,EAAE,gBAAgBC,YAAY,kB,mBChB1CD,GAAE,WAEEA,EAAEgC,QAAQX,GAAG,UAAU,WACnB,IAAI4D,EAAiBjD,OAAOqC,WACxBrC,OAAOqC,YAAc,IACrBrE,EAAE,iBAAiBW,IAAI,QAASsE,GAEhCjF,EAAE,iBAAiBW,IAAI,QAAS,OAGxC,IAAIsE,EAAiBjD,OAAOqC,WACxBrC,OAAOqC,YAAc,IACrBrE,EAAE,iBAAiBW,IAAI,QAASsE,GAEhCjF,EAAE,iBAAiBW,IAAI,QAAS,Q,uBCdxCrB,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QAERA,EAAQ,QAERA,EAAQ,QACRA,EAAQ,QAERA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QAERA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QAGRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QACRA,EAAQ,QAGRA,EAAQ,QAGRA,EAAQ,S,mBC5BR,IAAI66C,EAAOn6C,EAAE,sBAAsB,GAAGo6C,wBAClCsB,EAAQ,CAAC/2C,EAAG,EAAGuE,EAAG,EAAGyyC,OAAO,GAqBhC,SAASC,EAAW9U,EAAQ+U,GACxBC,SAASp3C,GAAGoiC,EAAQ,GAAK,CACrBniC,GAAI+2C,EAAM/2C,EAAIw1C,EAAK33C,MAAQ,GAAK23C,EAAK33C,MAAQq5C,EAC7C3yC,GAAIwyC,EAAMxyC,EAAIixC,EAAKl4C,OAAS,GAAKk4C,EAAKl4C,OAAS45C,IAtBvD77C,EAAE,sBAAsB+7C,WAAU,SAAS35C,GACvCs5C,EAAMC,OAAQ,EACdD,EAAM/2C,EAAIvC,EAAE45C,QAAU7B,EAAKzC,KAC3BgE,EAAMxyC,EAAI9G,EAAE65C,QAAU9B,EAAKrC,OAI/BoE,UAAUC,OAAOzB,iBAAiB,QAAQ,WAClCgB,EAAMC,OAAS37C,EAAEgC,QAAQQ,QAAU,MACnCo5C,EAAW,KAAM,GACjBA,EAAW,WAAY,GACvBA,EAAW,WAAY,IACvBA,EAAW,aAAc,IACzBA,EAAW,aAAc,IACzBA,EAAW,UAAW,KAE1BF,EAAMC,OAAQ,KAUlB37C,EAAEgC,QAAQX,GAAG,iBAAiB,WAC1B84C,EAAOn6C,EAAE,sBAAsB,GAAGo6C,2BAItCp6C,EAAE,eAAeY,MAAK,SAAUtD,EAAG8E,GAC/BpC,EAAEoC,GAAGH,OAAOjC,EAAEgC,QAAQC,aAG1BjC,EAAEgC,QAAQE,QAAO,WACblC,EAAE,eAAeY,MAAK,SAAUtD,EAAG8E,GAC/BpC,EAAEoC,GAAGH,OAAOjC,EAAEgC,QAAQC,iB,mBC9C9B,IAAIm6C,EAGJA,EAAI,WACH,OAAOp7C,KADJ,GAIJ,IAECo7C,EAAIA,GAAK,IAAIhrC,SAAS,cAAb,GACR,MAAOhP,GAEc,iBAAXJ,SAAqBo6C,EAAIp6C,QAOrC3E,EAAOD,QAAUg/C","file":"/frontend/js/script.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 0);\n","const { functions } = require('lodash');\n\nvar radius = 20;\nvar circumference = radius * 2 * Math.PI;\n// var navScroll;\n\n$('section').each(function (i, elem) {\n var $nav = $('nav'),\n $this = $(this);\n \n //forward scroll\n new ScrollMagic.Scene({\n offset: -10, // Number of pixels user can scroll before panel snaps into place\n triggerElement: elem,\n triggerHook: 0, // Trigger this scene when top of panel hit top window\n })\n .on('start', function(event) {\n if(event.scrollDirection == 'FORWARD') {\n var dataCLS = ($this.data('cls')) ? $this.data('cls') : 'cover',\n pos = $this.data('pos'),\n total = $('section[data-cls=\"' +dataCLS+ '\"]').length;\n if (dataCLS == 'cover') {\n $nav.removeClass('active');\n $('header .progress-nav .item').removeClass('active');\n\n } else {\n $nav.addClass('active');\n \n updateRing(dataCLS, pos, total);\n }\n }\n })\n .on('leave', function(event) {\n if(event.scrollDirection == 'REVERSE') {\n if($this.prev().hasClass('scrollmagic-pin-spacer')) {\n var dataCLS = ($this.prev().children('section').data('cls')) ? $this.prev().children('section').data('cls') : 'cover',\n pos = $this.prev().children('section').data('pos'),\n total = $('section[data-cls=\"' +dataCLS+ '\"]').length;\n } else {\n var dataCLS = ($this.prev().data('cls')) ? $this.prev().data('cls') : 'cover',\n pos = $this.prev().data('pos'),\n total = $('section[data-cls=\"' +dataCLS+ '\"]').length;\n }\n\n if (dataCLS == 'cover') {\n $nav.removeClass('active');\n $('header .progress-nav .item').removeClass('active');\n } else {\n $nav.addClass('active');\n \n updateRing(dataCLS, pos, total);\n }\n }\n })\n .addTo(require('./scrollInit'));\n});\n\n$(\".progress-ring\").each(function(){\n var circle = $(this).children('.progress-ring__circle');\n\n circle.css('stroke-dasharray', `${circumference} ${circumference}`);\n circle.css('stroke-dashoffset', `${circumference}`);\n updateProgress(circle, 0);\n\n});\n\nfunction updateRing(dataCLS, pos, total) {\n $('nav .item').removeClass('active');\n $('nav .item.'+dataCLS).addClass('active');\n $('header .progress-nav .item').removeClass('active');\n $('header .progress-nav .item.'+dataCLS).addClass('active');\n var circle = $('nav .item.'+dataCLS+' .progress-ring').children('.progress-ring__circle');\n var circle_mobile = $('header .progress-nav .item.'+dataCLS+' .progress-ring').children('.progress-ring__circle');\n var percent = parseFloat((pos*100)/total);\n setTimeout(() => {\n updateProgress(circle, percent);\n updateProgress(circle_mobile, percent);\n }, 500);\n}\n\nfunction updateProgress(circle, percent) {\n // console.log(circle);\n\n const offset = circumference - percent / 100 * circumference;\n circle.css('stroke-dashoffset', offset);\n}\n\n$(document).ready(function () {\n $('nav').outerHeight($(window).height());\n \n $(window).resize(function () { \n $('nav').outerHeight($(window).height());\n });\n \n $('header .mobile-menu').click(function (e) { \n e.preventDefault();\n $('.overlay').fadeIn();\n $('nav').addClass('mobile-active');\n });\n \n $('nav .close-menu').click(function (e) { \n e.preventDefault();\n $('.overlay').fadeOut();\n $('nav').removeClass('mobile-active');\n });\n\n $('nav .content a').click(function (e) { \n // e.preventDefault();\n $('.overlay').addClass('active');\n\n setTimeout(() => {\n $('.overlay').removeClass('active');\n if ($(window).width() < 1025) {\n $('.overlay').fadeOut();\n $('nav').removeClass('mobile-active');\n }\n }, 2000);\n });\n \n $('header .logo, .content-topic5-sidebar-pantau-pelaksanaan .footer a, a[href=\"#topik-5-2\"]').click(function (e) { \n // e.preventDefault();\n $('.overlay').addClass('active');\n\n setTimeout(() => {\n $('.overlay').removeClass('active');\n $('.overlay').fadeOut();\n }, 2000);\n });\n\n var lastScrollTop = 0;\n $(window).scroll(function (event) {\n \n if ($(window).width() < 1025) {\n var st = $(this).scrollTop();\n\n if (st > 0) {\n if (st <= lastScrollTop) {\n $(\"header\").addClass(\"fixed-top\");\n $(\"header\").addClass(\"scrolling\");\n }\n } else {\n $(\"header\").removeClass(\"fixed-top\");\n $(\"header\").removeClass(\"scrolling\");\n }\n \n if (st > $(\"header\").height()) {\n if (st > lastScrollTop) {\n $(\"header\").addClass(\"scroll-down\");\n $(\"header\").removeClass(\"scroll-up\");\n } else {\n $(\"header\").removeClass(\"scroll-down\");\n $(\"header\").addClass(\"scroll-up\");\n }\n } else {\n $(\"header\").removeClass(\"scroll-up\");\n $(\"header\").removeClass(\"scroll-down\");\n }\n lastScrollTop = st;\n }\n }); \n});","// global variable\nvar controllerScrollPanel,\n // fullPageScroll,\n // fullPageScrollReverse,\n headerScroll,\n footerScroll,\n resizeTimer;\n\n$(window).on('load', function(){ \n // $('body').addClass('is-locked');\n initController();\n handleResize();\n});\n\n// Initialize the scrollMagic controller\nfunction initController() {\n // Init new controller\n controllerScrollPanel = new ScrollMagic.Controller();\n \n scrollPanelScenes();\n\n AOS.init({\n // once: true\n offset: 300,\n duration: 600,\n easing: 'ease-in-out'\n });\n}\n\n// If window is resized, destroy controller and reset once resize has stopped\nfunction handleResize() {\n\n $(window).resize(function() {\n destroyScrollPanels();\n clearTimeout(resizeTimer);\n resizeTimer = setTimeout(doneResizing, 500);\n });\n\n function doneResizing(){\n reInitScrollPanels();\n }\n}\n\n// Destroy scroll panels\nfunction destroyScrollPanels() {\n controllerScrollPanel.destroy();\n headerScroll.destroy();\n\n // desktop only\n if ($(window).width() > 768) {\n footerScroll.destroy();\n // fullPageScroll.destroy();\n // fullPageScrollReverse.destroy();\n }\n}\n \n// Re-init scroll panels\nfunction reInitScrollPanels() {\n controllerScrollPanel = null;\n headerScroll = null;\n footerScroll = null;\n // fullPageScroll = null;\n // fullPageScrollReverse = null;\n initController();\n\n // console.log('reinit');\n}\n\nvar navLink = false;\n// Prevent problems with momentum scrolling by pausing for a period of time\nfunction pauseScroll() {\n $('body').addClass('is-locked');\n $('body').on('mousewheel DOMMouseScroll', _.debounce(function(e){\n $('body').removeClass('is-locked');\n }, 100));\n}\n\nfunction scrollPanelScenes() {\n // change header, footer, nav themes based on section\n $('section').each(function (i, elem) {\n var $this = $(elem);\n \n // header change theme\n headerScroll = new ScrollMagic.Scene({\n offset: -180, // Number of pixels user can scroll before panel snaps into place\n triggerElement: elem,\n triggerHook: 0, // Trigger this scene when top of panel hit top window\n })\n .on('start', function(event) {\n // running when scroll forward\n if (event.scrollDirection == 'FORWARD') {\n var theme = $this.data('theme');\n \n $('header div .logo').attr('data-theme', theme);\n $('header div .latest-news-link').attr('data-theme', theme);\n $('header div .mobile-menu').attr('data-theme', theme);\n $('nav').attr('data-theme', theme);\n \n if ($this.hasClass('section-1-3')) {\n $('header div .latest-news-link').attr('data-theme', 'dark');\n }\n\n }\n \n })\n .on('leave', function(event) {\n if (event.scrollDirection == 'REVERSE') {\n // check if this section has pin parent\n if ($this.parent().hasClass('scrollmagic-pin-spacer')) {\n var $prevThis = $this.parent().prev();\n \n } else {\n var $prevThis = $this.prev();\n \n }\n \n if ($this.parent().hasClass('bg-paper') && $this.index() === 0) {\n var $prevThis = $this.parent().prev();\n \n } else {\n var $prevThis = $this.prev();\n }\n\n var theme = $prevThis.data('theme');\n $('header div .logo').attr('data-theme', theme);\n $('header div .latest-news-link').attr('data-theme', theme);\n $('header div .mobile-menu').attr('data-theme', theme);\n $('nav').attr('data-theme', theme);\n \n if ($prevThis.hasClass('section-1-3')) {\n $('header div .latest-news-link').attr('data-theme', 'dark');\n }\n }\n if (event.scrollDirection == 'FORWARD') {\n /* disable fullpage */\n // if ($this.next().hasClass('fullpage__section')) {\n // // pauseScroll();\n // }\n }\n })\n .addTo(controllerScrollPanel);\n \n // desktop only\n if ($(window).width() > 768) { \n // footer change theme\n footerScroll = new ScrollMagic.Scene({\n offset: 48, // Number of pixels user can scroll before panel snaps into place\n triggerElement: elem,\n triggerHook: 1, // Trigger this scene when top of panel hit top window\n })\n .on('start', function(event) {\n // running when scroll forward\n if (event.scrollDirection == 'FORWARD') {\n var theme = $this.data('theme');\n \n $('footer').attr('data-theme', theme);\n \n if ($this.hasClass('section-1-3')) {\n $('footer').attr('data-theme', 'dark');\n }\n \n // remove cover when not in main cover\n if ($this.hasClass('main-cover')) {\n $('footer').addClass('on-cover');\n } else {\n $('footer').removeClass('on-cover');\n }\n }\n })\n .on('leave', function(event) {\n if (event.scrollDirection == 'REVERSE') {\n // check if this section has pin parent\n if ($this.parent().hasClass('scrollmagic-pin-spacer')) {\n var $prevThis = $this.parent().prev();\n \n } else {\n var $prevThis = $this.prev();\n \n }\n \n if ($this.parent().hasClass('bg-paper') && $this.index() === 0) {\n var $prevThis = $this.parent().prev();\n \n } else {\n var $prevThis = $this.prev();\n }\n \n var theme = $prevThis.data('theme');\n \n $('footer').attr('data-theme', theme);\n \n if ($prevThis.hasClass('section-1-3')) {\n $('footer').attr('data-theme', 'dark');\n }\n \n // remove cover when not in main cover\n if ($prevThis.hasClass('main-cover')) {\n $('footer').addClass('on-cover');\n } else {\n $('footer').removeClass('on-cover');\n }\n }\n })\n .addTo(controllerScrollPanel);\n }\n });\n\n // desktop only\n // if ($(window).width() > 768) {\n /* disable fullpage */\n if (false) {\n // Create scenes for fullpage panels\n\n // $('.fullpage__section').each(function(index, elem) {\n $('.fullpage__section').each(function(index, elem) {\n var $scrollPanel = $(elem);\n \n fullPageScroll = new ScrollMagic.Scene({\n offset: 10, // Number of pixels user can scroll before panel snaps into place\n triggerElement: elem,\n triggerHook: 1, // Trigger this scene when top of panel enters view\n })\n .on('start', function(event) {\n if (event.scrollDirection == 'FORWARD' && !navLink) {\n // pauseScroll();\n // manipulation for bottom cover\n if ($scrollPanel.hasClass('bottom-area')) {\n var scrollPos = $scrollPanel.offset().top - $scrollPanel.height();\n } else {\n var scrollPos = $scrollPanel.offset().top;\n }\n \n TweenMax.to(window, 0.5, {scrollTo: {y: scrollPos, autoKill:false}}); \n }\n })\n .on('enter', pauseScroll)\n .addTo(controllerScrollPanel);\n \n // // Create scenes for fullpage panels, when scrolling reverse\n fullPageScrollReverse = new ScrollMagic.Scene({\n offset: -10, // Number of pixels user can scroll before panel snaps into place\n triggerElement: elem,\n triggerHook: 0,// Trigger this scene when bottom of panel enters view\n })\n .on('start', function(event) {\n if (event.scrollDirection == 'REVERSE' && !navLink) {\n var scrollPos = $scrollPanel.prev().offset().top + $scrollPanel.prev().innerHeight() - $(window).height();\n }\n \n TweenMax.to(window, 0.5, {scrollTo: {y: scrollPos, autoKill:false}}); \n })\n .on('leave', pauseScroll)\n .addTo(controllerScrollPanel);\n });\n }\n}\n\n// navigation click event\n// $('.page-scroll').click(function (e) {\n// navLink = true;\n// var elem = $(this).data('link'),\n// $scrollPanel = $(elem),\n// scrollPos = $scrollPanel.offset().top;\n//\n// $('nav').removeClass('mobile-active');\n//\n// TweenMax.to(window, 0.5, {scrollTo: {y: scrollPos, autoKill:false}});\n//\n// setTimeout(() => {\n// navLink = false;\n// }, 500);\n// });\n\n/* show hide*/\n$(function(){\n $(window).scroll(function() {\n $('body').addClass('scrolling');\n clearTimeout($.data(this, 'scrollTimer'));\n $.data(this, 'scrollTimer', setTimeout(function() {\n // do something\n $('body').removeClass('scrolling');\n }, 500));\n });\n});","var inScene = null;\nvar outScene = null;\nvar currentWindowWidth = null;\n$(function () {\n // var gap = $('.section-1-3 .scrollable-content').innerWidth() - $(window).width();\n timelineScrollInit();\n // }\n let resizedFinished;\n $(window).on('resize', function() {\n clearTimeout(resizedFinished);\n resizedFinished = setTimeout(function(){\n if(currentWindowWidth !== $(this).width()) {\n currentWindowWidth = $(this).width();\n timelineScrollInit();\n }\n }, 250);\n });\n});\n\n// horizontal scroll tween\nfunction timelineScrollInit() {\n // var windowWidth = $(window).width();\n if(inScene !== null){\n outScene.destroy(true);\n inScene.destroy(true);\n }\n\n if ($(window).width() > 992) {\n var gap = $('.section-1-3 .scrollable-content').innerWidth() - $(window).width() + $('.section-1-3 .main-text-col').innerWidth();\n var pinned = '.section-1-3 .pinned';\n // $('.section-1-1').height('650vh');\n // var pinned = '.section-1-3 .scrollable-content-container';\n } else {\n var gap = 0;\n $('.section-1-3 .scrollable-content .d-flex > div').each(function () {\n gap += $(this).width();\n });\n gap -= $(window).width();\n // var gap = $('.section-1-3 .scrollable-content').innerWidth();\n var pinned = '.section-1-3 .scrollable-content-container';\n // gap = 0;\n }\n\n if (gap > 0) {\n var section1_3Horizontal = new TimelineMax()\n .to(\".section-1-3 .scrollable-content\", 1, {\n x: \"-\" + gap + \"px\"\n // x: '-100%'\n })\n \n var durationPin = \"475%\";\n var durationHorizontal = \"450%\";\n durationPin = $(window).height()*4.75;\n durationHorizontal = $(window).height()*4.5;\n \n if($(window).width() > $(window).height()) {\n if ($(window).width() > 1024) {\n // durationPin = \"550%\";\n durationPin = $(window).height()*5;\n }\n }\n \n\n // create scene to pin and link animation\n inScene = new ScrollMagic.Scene({\n offset : 0,\n triggerElement: pinned,\n triggerHook : 0,\n duration : durationPin\n })\n .setPin(pinned)\n .addTo(require('../scrollInit'));\n // create scene to pin and link animation\n\n outScene = new ScrollMagic.Scene({\n offset : 0,\n triggerElement: pinned,\n triggerHook : 0,\n duration : durationHorizontal\n })\n .setTween(section1_3Horizontal)\n .addTo(require('../scrollInit'));\n }\n\n AOS.refresh();\n}","$(function (){\n /* set width of image absolute */\n $(window).on('resize', function() {\n var getWidthScreen = window.innerWidth;\n if (window.innerWidth <= 768) {\n $('.content-topic4-impacts img').css(\"width\", getWidthScreen);\n } else{\n $('.content-topic4-impacts img').css(\"width\", \"\");\n }\n });\n var getWidthScreen = window.innerWidth;\n if (window.innerWidth <= 768) {\n $('.content-topic4-impacts img').css(\"width\", getWidthScreen);\n } else{\n $('.content-topic4-impacts img').css(\"width\", \"\");\n }\n});","$(function () {\n $('.points-row').slick({\n dots : true,\n mobileFirst: true,\n infinite : false,\n arrows : false,\n responsive : [\n {\n breakpoint: 767,\n settings : \"unslick\"\n }\n ]\n })\n})\n","$(function (){\n let customPlotLines = [];\n let chart21Width = $('#chart-2-1').width();\n let resizedFinished;\n let section = $('.section-2-1');\n let chartContainer = section.find('.chart-container');\n\n function chartCountHeight(){\n var chartWidth = chartContainer.width();\n var chartHeight = 0;\n if (chartWidth < 500) {\n chartHeight = chartWidth;\n }\n if (chartWidth < 400) {\n chartHeight = chartWidth * 1.2;\n } else {\n chartHeight = chartWidth * 0.9;\n }\n\n chart21.yAxis[0].update({\n height: chartHeight - 180,\n });\n chart21.xAxis[0].update({\n height: chartHeight,\n })\n chart21.setSize(chartWidth, chartHeight);\n }\n\n $(window).on('resize', function () {\n clearTimeout(resizedFinished);\n resizedFinished = setTimeout(function () {\n chartCountHeight();\n }, 250);\n });\n\n\n let chart21 = Highcharts.chart('chart-2-1', {\n // $('#chart-2-2').highcharts({\n // chart = new Highcharts.chart({\n chart : {\n type : 'line',\n backgroundColor: 'transparent',\n height : 500,\n events : {\n load : function () {\n drawPlotLines(this);\n },\n redraw: function () {\n drawPlotLines(this);\n },\n },\n marginLeft : 80,\n },\n credits: false,\n title : {\n text : ''+ $('#topik-2-1 .y-axis').html() +'',\n align : 'left',\n useHTML: true,\n style : {\n fontFamily: 'Inter',\n fontSize : '12px',\n lineHeight: '16px',\n color : 'rgba(255,255,255,0.6)',\n }\n },\n xAxis : {\n title : null,\n lineWidth : 0,\n gridLineColor : '#7C7C7C',\n gridLineWidth : 0,\n gridLineDashStyle: 'longdash',\n tickLength : 0,\n // offset : 20,\n height : 500,\n offset : -140,\n categories : [2016, 2017, 2018, 2019, 2020],\n crosshair : {\n color: 'rgba(255,255,255,0.1)',\n },\n labels : {\n style: {\n fontFamily: 'Inter',\n fontSize : '18px',\n color : '#FFFFFF',\n }\n },\n events : {\n afterSetExtremes: function () {\n this.chart.tooltip.crosshairs = [];\n this.chart.tooltip.crosshairs.width = (this.chart.width / (this.series[0].points.length - 1));\n }\n }\n },\n yAxis : {\n title : null,\n lineWidth : 0,\n gridLineColor: 'transparent',\n tickLength : 0,\n tickAmount : 4,\n offset : 0,\n height : 320,\n min : 20,\n max : 80,\n labels : {\n style: {\n fontFamily: 'Inter',\n fontSize : '18px',\n color : '#FFFFFF',\n }\n }\n },\n legend : {\n enabled: false\n },\n tooltip : {\n backgroundColor: '#FFFFFF',\n borderColor : 'transparent',\n padding : 0,\n borderRadius : 12,\n distance : 35,\n useHTML : true,\n formatter : function () {\n if (this.point.hideTooltip) {\n return false;\n }\n return \"\" + this.y + \"\";\n },\n },\n plotOptions: {\n series: {\n dataLabels: {\n backgroundColor: 'transparent',\n borderColor : 'transparent',\n padding : 0,\n enabled : true,\n borderRadius : 22,\n distance : 35,\n useHTML : true,\n // y : -70,\n // shape: 'callout'\n }\n }\n },\n style : {\n fontFamily: 'Inter'\n },\n series : [{\n name : 'Index ketahanan pangan',\n data : [\n {\n y : 50.6,\n marker: {\n fillColor: '#FFFFFF',\n lineColor: '#f16521',\n states : {\n hover: {\n fillColor: '#f16521',\n lineColor: '#FFFFFF',\n }\n }\n }\n },\n {\n y: 51.3,\n },\n {\n y : 54.8,\n marker: {\n fillColor: '#FFFFFF',\n lineColor: '#f16521',\n states : {\n hover: {\n fillColor: '#f16521',\n lineColor: '#FFFFFF',\n }\n }\n }\n },\n {\n y : 62.6,\n },\n {\n y : 59.5,\n marker: {\n fillColor: '#FFFFFF',\n lineColor: '#f16521',\n states : {\n hover: {\n fillColor: '#f16521',\n lineColor: '#FFFFFF',\n }\n }\n },\n dataLabels : {\n className: 'highlight',\n },\n hideTooltip: true,\n },\n ],\n lineColor: '#FFFFFF',\n\n marker: {\n fillColor: '#FFFFFF',\n lineColor: '#FFCE20',\n radius : 6,\n lineWidth: 3,\n states : {\n hover: {\n fillColor : '#FFCE20',\n lineColor : '#FFFFFF',\n radiusPlus: 0,\n radius : 6,\n lineWidth : 4,\n }\n }\n }\n }],\n\n responsive: {\n rules: [{\n condition : {\n maxWidth: 400\n },\n chartOptions: {\n chart: {\n marginLeft : 40,\n },\n title: {\n text: ''+ $('#topik-2-1 .y-axis').html() +'',\n },\n xAxis: {\n labels : {\n style: {\n fontSize: '16px'\n }\n }\n },\n yAxis: {\n labels : {\n style: {\n fontSize: '16px'\n }\n }\n }\n }\n }]\n }\n });\n\n function drawPlotLines(chart) {\n let xAxis = chart.xAxis[0],\n yAxis = chart.yAxis[0],\n xValue = 0,\n yStart = yAxis.toPixels(yAxis.min),\n yEnd = yAxis.toPixels(yAxis.max);\n\n if (customPlotLines.length) {\n customPlotLines.forEach(function(customPlotLine){\n customPlotLine.destroy();\n })\n }\n\n for (i = 0; i < chart.xAxis[0].categories.length; i++) {\n xValue = xAxis.toPixels(chart.series[0].xData[i]);\n customPlotLines[i] = chart.renderer.path(['M', xValue, yStart, 'L', xValue, yEnd])\n .attr({\n 'stroke-width' : 2,\n 'stroke-dasharray': '8,8',\n stroke : '#7C7C7C'\n })\n .add();\n }\n }\n\n chartCountHeight();\n});","/**\n * @license\n * Lodash \n * Copyright OpenJS Foundation and other contributors \n * Released under MIT license \n * Based on Underscore.js 1.8.3 \n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.20';\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\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 and trailing whitespace. */\n var reTrim = /^\\s+|\\s+$/g,\n reTrimStart = /^\\s+/,\n reTrimEnd = /\\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 /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&': '&',\n '<': '<',\n '>': '>',\n '"': '\"',\n ''': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.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 `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '

' + func(text) + '

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

fred, barney, & pebbles

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